= highestRow){\n\t\t\t\thighestRow = row;\n\t\t\t}\n\t\t\tif(col >= highestCol){\n\t\t\t\thighestCol = col;\n\t\t\t}\n\n\t\t}\n\t\tthis.width = highestCol;\n\t\tthis.height = highestRow;\n\t}","function average() {\n averageHeight = averageHeight / rectNum;\n strokeWeight(3);\n line(0,averageHeight,width,averageHeight);\n}","function avg(arr) {\n\tlet total = 0;\n\t//loop over each num\n\tfor (let num of arr) {\n\t\t//add them together\n\t\ttotal += num;\n\t}\n\t//divide by number of nums\n\treturn total / arr.length;\n}","function avgCostPerDesigner(shoes){\n return (shoes.reduce(function(total,item){\n return total += item.price ;\n },0))/shoes.length ;\n}","function calculateFitnessChrom()\n{\n var gaps = new Array(); // to keep the amount of gaps in the layout\n\n var filledCols= new Array (theLayout.numCols); //to keep how filled is each column\n for (var i = 0 ; i < theLayout.numCols ; i++)\n filledCols[i] = 0;\n\n for ( var i = 0; i < this.adn.length; i++ ) {\n\n // select the column to place the layer. If the layer spans in more than\n // one column, the selected column will be the first column the layers uses\n\n var selCol = 0; // column to allocate the layer\n var selMean = 0; // used capacity mean\n var selStd = 0; // used capacity standard deviation\n for (var k=0 ; k < theLayout.widths[this.adn[i]] ; k++) {\n selMean += filledCols[k];\n }\n selMean /= theLayout.widths[this.adn[i]];\n\n for (var k=0 ; k < theLayout.widths[this.adn[i]] ; k++) {\n selStd += Math.abs(filledCols[k]-selMean);\n }\n selStd /= theLayout.widths[this.adn[i]];\n \n var limit = theLayout.numCols - theLayout.widths[this.adn[i]]+1;\n for ( var j = 1 ; j < limit ; j++) {\n\n var mean = 0;\n var std = 0;\n\n if (theLayout.widths[this.adn[i]] > 1) {\n for (var k=j ; k < j+theLayout.widths[this.adn[i]] ; k++) {\n mean += filledCols[k];\n }\n mean /= theLayout.widths[this.adn[i]];\n\n for (var k=j ; k < j+theLayout.widths[this.adn[i]] ; k++) {\n std += Math.abs(filledCols[k]-mean);\n }\n std /= theLayout.widths[this.adn[i]];\n }\n else {\n mean = filledCols[j];\n }\n\n if (std < selStd || (std == selStd && mean < selMean)) {\n selCol = j;\n selMean = mean;\n selStd = std;\n }\n }\n\n // once the column is chosen, if the layer spans more than one column,\n // the maximum used capacity is used\n var max = filledCols[selCol];\n if (theLayout.widths[this.adn[i]] > 1) {\n for (var k=selCol ; k < selCol+theLayout.widths[this.adn[i]] ; k++) {\n if ( filledCols[k] > filledCols[selCol] ) {\n max = filledCols[k];\n }\n }\n\n // detect gaps\n for (var k=selCol ; k < selCol+theLayout.widths[this.adn[i]] ; k++) {\n if (max > filledCols[k])\n gaps.push (max - filledCols[k]);\n }\n }\n\n // fill the column selected with the height of the layer\n for (var k=selCol ; k < selCol+theLayout.widths[this.adn[i]] ; k++) {\n filledCols[k] = max + $(theLayout.layers[this.adn[i]]).height() +\n theLayout.pixelsGap;\n }\n }\n\n // this part calculates the gaps at the bottom\n var max = filledCols[0];\n for ( var j = 1 ; j < theLayout.numCols ; j++) {\n if (filledCols[j] > max)\n max = filledCols[j];\n }\n\n for ( var j = 0 ; j < theLayout.numCols ; j++) {\n if (filledCols[j] < max)\n gaps.push (max - filledCols[j]);\n }\n\n\n // this part tries to minimize the gaps\n\n // If there were only one gap, the standard deviation would be 0,\n // so I insert a fictitious gap to avoid this problem\n gaps.push (0);\n\n var gapsMean = 0; // gap size mean\n if (gaps.length>0) {\n for (var k=0 ; k < gaps.length ; k++) {\n gapsMean += gaps[k];\n }\n gapsMean /= gaps.length;\n\n }\n\n this.fitness = gapsMean;\n\n return this.fitness;\n}","function avg() {\n var sum = 0;\n for (var i = 0, j = arguments.length; i < j; i++) {\n sum += arguments[i];\n }\n return sum / arguments.length;\n}","function avg() {\n var sum = 0;\n for (var i = 0, j = arguments.length; i < j; i++) {\n sum += arguments[i];\n }\n return sum / arguments.length;\n}","function ex_3_R(a){\n m = 0;\n if ( a.length == 0 ) m = 0;\n else m = (ex_3_R(a.slice(1))*(a.length-1) + a[0])/a.length;\nreturn m;\n}","getLengths( divisions = this.arcLengthDivisions ) {\n\n\t\t\tif ( this.cacheArcLengths &&\n\t\t\t\t( this.cacheArcLengths.length === divisions + 1 ) &&\n\t\t\t\t! this.needsUpdate ) {\n\n\t\t\t\treturn this.cacheArcLengths;\n\n\t\t\t}\n\n\t\t\tthis.needsUpdate = false;\n\n\t\t\tconst cache = [];\n\t\t\tlet current, last = this.getPoint( 0 );\n\t\t\tlet sum = 0;\n\n\t\t\tcache.push( 0 );\n\n\t\t\tfor ( let p = 1; p <= divisions; p ++ ) {\n\n\t\t\t\tcurrent = this.getPoint( p / divisions );\n\t\t\t\tsum += current.distanceTo( last );\n\t\t\t\tcache.push( sum );\n\t\t\t\tlast = current;\n\n\t\t\t}\n\n\t\t\tthis.cacheArcLengths = cache;\n\n\t\t\treturn cache; // { sums: cache, sum: sum }; Sum is in the last element.\n\n\t\t}","function size_of(segments, bindings) {\n var size = 0;\n for (var i=0, len = segments.length; i < len; i++) {\n size += size_of_segment(segments[i], bindings);\n }\n return size;\n}","findAverage(mat){\n\n var size = [mat.length,mat[0].length];\n var sum = Array.apply(null, Array(size[1])).map(Number.prototype.valueOf,0);\n\n for(var i=0;i currentValue/size[0]);\n sum = sum.map(currentValue => Math.round(currentValue*100)/100);\n return sum;\n }","function avg(num1, num2, num3) {\n return (num1 + num2 + num3) / 3; \n}","function avgWindSp () {\n\tvar array = map(list, function (c) {\n\t\treturn c.wind.speed;\n\t});\n\tvar sum = reduce(array, function (a, b) {\n\t\treturn a + b;\n\t});\n\treturn Math.round(100 * (sum / list.length)) / 100;\n}","function find_average(array) {\n // your code here\n var sum = 0;\n array.forEach( element => sum += element); \n return sum / array.length;\n}","function calcAverage(score1, score2, score3) {\n return (score1 + score2 + score3) / 3;\n}","getDrawSize () {\r\n return Math.ceil(this.calories / this.gestation * 10)\r\n }","function find_avg(arr) {\n\t\tvar sum = 0, avg;\n\t\tfor (var i = 0; i < arr.length; i++) {\n\t\t\tsum += arr[i];\n\t\t}\n\t\tavg = sum / arr.length;\n\t\treturn avg;\n\t}","function computedAvgPriceForEach() {\r\n let sumPrice = 0;\r\n shirts.forEach(val => sumPrice += val.price );\r\n return sumPrice/shirts.length;\r\n}","function getEffectSizeAmount(effectSizeType, effectSize)\n{\n var interpretations = effectSizeInterpretations[effectSizeType];\n if(effectSize < interpretations[0])\n return 0;\n else if(effectSize >= interpretations[0] && effectSize < interpretations[1])\n return 1;\n else if(effectSize >= interpretations[1] && effectSize < interpretations[2])\n return 2;\n else if(effectSize >= interpretations[2])\n return 3; \n return 99;\n}","function calculateAveragePrice(flavors) {\n var sum = 0;\n flavors.forEach(function(flavor)\n {\n\t sum+= parseFloat(flavor.price.replace('$', ''));\n });\n return (sum/flavors.length).toFixed(2);\n }","updateWeights(weights) {\n let numAreas = 0;\n for (let ind = 0; ind < CSRankings.areas.length; ind++) {\n let area = CSRankings.areas[ind];\n weights[area] = $('input[name=' + this.fields[ind] + ']').prop('checked') ? 1 : 0;\n if (weights[area] === 1) {\n if (area in CSRankings.parentMap) {\n // Don't count children.\n continue;\n }\n /* One more area checked. */\n numAreas++;\n }\n }\n return numAreas;\n }"],"string":"[\n \"function computeDimension(topLeft, topRight, bottomLeft, moduleSize) {\\r\\n\\t\\t var tltrCentersDimension = Math.round(distance(topLeft.x, topLeft.y, topRight.x, topRight.y) / moduleSize);\\r\\n\\t\\t var tlblCentersDimension = Math.round(distance(topLeft.x, topLeft.y, bottomLeft.x, bottomLeft.y) / moduleSize);\\r\\n\\t\\t var dimension = ((tltrCentersDimension + tlblCentersDimension) >> 1) + 7;\\r\\n\\t\\t switch (dimension & 0x03) {\\r\\n\\t\\t // mod 4\\r\\n\\t\\t case 0:\\r\\n\\t\\t dimension++;\\r\\n\\t\\t break;\\r\\n\\t\\t // 1? do nothing\\r\\n\\t\\t case 2:\\r\\n\\t\\t dimension--;\\r\\n\\t\\t break;\\r\\n\\t\\t }\\r\\n\\t\\t return dimension;\\r\\n\\t\\t}\",\n \"function calculateAverage() {\\r\\n var sum = 0;\\r\\n for (var i = 0; i < arguments.length; i++) {\\r\\n sum += arguments[i];\\r\\n }\\r\\n return sum / 4;\\r\\n }\",\n \"function computeDimension(topLeft, topRight, bottomLeft, matrix) {\\n var moduleSize = (sum(countBlackWhiteRun(topLeft, bottomLeft, matrix, 5)) / 7 + // Divide by 7 since the ratio is 1:1:3:1:1\\n sum(countBlackWhiteRun(topLeft, topRight, matrix, 5)) / 7 +\\n sum(countBlackWhiteRun(bottomLeft, topLeft, matrix, 5)) / 7 +\\n sum(countBlackWhiteRun(topRight, topLeft, matrix, 5)) / 7) / 4;\\n var topDimension = Math.round(distance(topLeft, topRight) / moduleSize);\\n var sideDimension = Math.round(distance(topLeft, bottomLeft) / moduleSize);\\n var dimension = Math.floor((topDimension + sideDimension) / 2) + 7;\\n switch (dimension % 4) {\\n case 0:\\n dimension++;\\n break;\\n case 2:\\n dimension--;\\n break;\\n }\\n return { dimension: dimension, moduleSize: moduleSize };\\n}\",\n \"average() {\\n return this.buffer.reduce((accum, current) => accum + current) / this.size;\\n }\",\n \"function calculateSizes () {\\n // Figure out the parent size minus padding.\\n var a = elements[this.a].element;\\n var b = elements[this.b].element;\\n\\n this.size = a[getBoundingClientRect]()[dimension] + b[getBoundingClientRect]()[dimension] + this.aGutterSize + this.bGutterSize;\\n this.start = a[getBoundingClientRect]()[position];\\n }\",\n \"function calculateSizes () {\\n // Figure out the parent size minus padding.\\n var a = elements[this.a].element;\\n var b = elements[this.b].element;\\n\\n this.size = a[getBoundingClientRect]()[dimension] + b[getBoundingClientRect]()[dimension] + this.aGutterSize + this.bGutterSize;\\n this.start = a[getBoundingClientRect]()[position];\\n }\",\n \"function getInnerPctCalcFunction(arcs, shapes) {\\n var calcSegLen = arcs.isPlanar() ? geom.distance2D : geom.greatCircleDistance;\\n var arcIndex = new ArcTopologyIndex(arcs, shapes);\\n var outerLen, innerLen, arcLen; // temp variables\\n\\n return function(shp) {\\n outerLen = 0;\\n innerLen = 0;\\n if (shp) shp.forEach(procRing);\\n return innerLen > 0 ? innerLen / (innerLen + outerLen) : 0;\\n };\\n\\n function procRing(ids) {\\n ids.forEach(procArc);\\n }\\n\\n function procArc(id) {\\n arcLen = 0;\\n arcs.forEachArcSegment(id, addSegLen);\\n if (arcIndex.isInnerArc(id)) {\\n innerLen += arcLen;\\n } else {\\n outerLen += arcLen;\\n }\\n }\\n\\n function addSegLen(i, j, xx, yy) {\\n arcLen += calcSegLen(xx[i], yy[i], xx[j], yy[j]);\\n }\\n }\",\n \"function _calc() {\\n var winW = $w.width() < $t.width() ? $t.width() : $w.width();\\n var realW = winW - 2 * cfg.navWidth - cfg.perNumber;\\n var itemW = Math.floor(realW / cfg.perNumber);\\n return itemW;\\n }\",\n \"get avgOrderDims(){\\n var output = { tW: 0, tL: 0, tH: 0, avgW: 0, avgL: 0, avgH: 0, tO: 0 };\\n for(var index in this.orders){\\n output.tH += (this.orders[index].height * this.orders[index].quantity);\\n output.tW += (this.orders[index].width * this.orders[index].quantity);\\n output.tL += (this.orders[index].length * this.orders[index].quantity);\\n output.tO += this.orders[index].quantity;\\n }\\n output.avgH = output.tH / output.tO;\\n output.avgW = output.tW / output.tO;\\n output.avgL = output.tL / output.tO;\\n return output;\\n }\",\n \"averageSatisfactionDegree() {\\n\\t\\tlet ave = 0;\\n\\t\\tfor (const c of this._cons) {\\n\\t\\t\\tave += c.satisfactionDegree();\\n\\t\\t}\\n\\t\\tave = ave / this._cons.length;\\n\\t\\treturn ave;\\n\\t}\",\n \"function averageFinder2(arr) {\\n var average = 0;\\n var sum = 0;\\n for(var i = 0; i < arr.length; i++) {\\n sum+= arr[i]\\n } \\n return Math.ceil(sum / arr.length); \\n }\",\n \"function calcMean1(cb){\\n\\tvar sumRep=0;\\n\\tvar numRep =0;\\n\\tvar lenRep =0;\\n\\tvar rep=[];\\n\\tfor(var i=0; i 0) {\\n\\t\\t\\t\\t\\t\\tsel.each(function () {\\n\\t\\t\\t\\t\\t\\t\\ttotal += this.offsetHeight + this.offsetWidth;\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn total;\\n\\t\\t\\t\\t}\",\n \"calculateAverageGlobalRank() {\\n let totalGlobalRank = 0;\\n this.genomes.forEach(function (genome) {\\n totalGlobalRank += genome.globalRank;\\n });\\n\\n this.averageGlobalRank = totalGlobalRank / this.genomes.length;\\n }\",\n \"findAverageMass(humans) {\\n const _humans = Object.keys(humans);\\n let _total = 0;\\n for(let human of _humans){\\n if(humans[human].mass !== 'unknown') _total += parseInt(humans[human].mass);\\n }\\n return Math.floor(_total / _humans.length)\\n }\",\n \"function calc_step_size(a,b) {\\n\\t\\t return (a - b) / steps_total;\\n\\t\\t}\",\n \"function calc_step_size(a,b) {\\r\\n return (a - b) / steps_total;\\r\\n}\",\n \"function getAvgSegment(arcs) {\\n var sum = 0;\\n var count = arcs.forEachSegment(function(i, j, xx, yy) {\\n var dx = xx[i] - xx[j],\\n dy = yy[i] - yy[j];\\n sum += Math.sqrt(dx * dx + dy * dy);\\n });\\n return sum / count || 0;\\n }\",\n \"getAverageM3() {\\n\\t var days = this.getDays();\\n\\t var m3 = this.getM3();\\n\\n\\t var averageM3 = days > 0 ? m3/days : m3;\\n\\n\\t return Math.round(averageM3 * 100) / 100;\\n\\t}\",\n \"function calc_step_size(a, b) {\\r\\n return (a - b) / steps_total;\\r\\n}\",\n \"avg() {\\n\\t\\tlet argArr = this.args;\\n\\t\\tfunction avgSet(s,c,f) {\\n\\t\\t\\taverage: s;\\n\\t\\t\\tceiling: c;\\n\\t\\t\\tfloor: f;\\n\\t\\t}\\n\\t\\tlet evaluate = function() {\\n\\t\\t\\tlet sum = 0;\\n\\t\\t\\tfor(let c=0;c0){sel.each(function(){total+=$(this).height()+$(this).width();});}\\n\\t\\t\\t\\treturn total;\\n\\t\\t\\t}\",\n \"function calculateSizes () {\\n console.log('calculateSizes');\\n\\n updateName(['_yyparse.s', fs.readFileSync('build/s/_yyparse.s', { encoding: 'utf8' })]);\\n\\n execSync(\\n 'cat ./updateSpinner.s ./build/s/_yyparse.s > ./build/g/_yyparse.s;' +\\n 'cl65 -T -t c64 ' +\\n '-o ./build/obj2/yyparse.bin ' +\\n '-Ln ./build/obj2/yyparse.lbl ' +\\n '-C ./yyparse.cfg ./build/g/_yyparse.s'\\n );\\n\\n passPostfix = 'a';\\n\\n const yyparseSize = Math.max(0x2000, fs.statSync('build/obj2/yyparse.bin').size);\\n\\n const yyparseStart = 0xC000 - yyparseSize;\\n\\n const dataSize = fs.statSync('build/data.bin').size;\\n\\n const dataStart = yyparseStart - dataSize;\\n\\n const libcSize = fs.statSync('build/libcdata.bin').size;\\n\\n const libcStart = dataStart - libcSize;\\n\\n const floatlibSize = fs.statSync('build/floatlibdata.bin').size;\\n\\n const floatlibStart = libcStart - floatlibSize;\\n\\n const mainSize = fs.statSync('build/maindata.bin').size;\\n\\n const mainStart = floatlibStart - mainSize;\\n\\n const heapSize = mainStart - 0x0800;\\n\\n remainder -= (yyparseSize + dataSize + libcSize + floatlibSize + mainSize);\\n\\n execSync(\\n \\\"sed 's/ROMH: file = %O, start = $8000, size = $4000/\\\" +\\n 'ROMH: file = %O, start = $' +\\n (yyparseStart.toString(16).toUpperCase()) +\\n ', size = $' +\\n (yyparseSize.toString(16).toUpperCase()) +\\n '/g;' +\\n 's/RAM: file = \\\"\\\", start = $0800, size = $9800/' +\\n 'RAM: file = \\\"\\\", start = $0800, size = $' +\\n (heapSize.toString(16).toUpperCase()) + '/g;' +\\n \\\"' yyparse.cfg > build/yyparsea.cfg\\\"\\n );\\n\\n execSync(\\n \\\"sed 's/data2.bin\\\\\\\\\\\\\\\", start = $0800, size = $9800/\\\" +\\n 'data2.bin\\\\\\\\\\\", start = $' +\\n (dataStart.toString(16).toUpperCase()) +\\n ', size = $' +\\n (dataSize.toString(16).toUpperCase()) +\\n '/g;' +\\n 's/RAM: file = \\\"\\\", start = $0800, size = $9800/' +\\n 'RAM: file = \\\"\\\", start = $0800, size = $' +\\n (heapSize.toString(16).toUpperCase()) + '/g;' +\\n \\\"' data.cfg > build/dataa.cfg\\\"\\n );\\n\\n execSync(\\n \\\"sed 's/floatlibdata2.bin\\\\\\\\\\\\\\\", start = $0800, size = $9800/\\\" +\\n 'floatlibdata2.bin\\\\\\\\\\\", start = $' +\\n (floatlibStart.toString(16).toUpperCase()) +\\n ', size = $' +\\n (floatlibSize.toString(16).toUpperCase()) +\\n '/g;' +\\n 's/RAM: file = \\\"\\\", start = $0800, size = $9800/' +\\n 'RAM: file = \\\"\\\", start = $0800, size = $' +\\n (heapSize.toString(16).toUpperCase()) + '/g;' +\\n \\\"' floatlib.cfg > build/floatliba.cfg\\\"\\n );\\n\\n execSync(\\n \\\"sed 's/libcdata2.bin\\\\\\\\\\\\\\\", start = $0800, size = $9800/\\\" +\\n 'libcdata2.bin\\\\\\\\\\\", start = $' +\\n (libcStart.toString(16).toUpperCase()) +\\n ', size = $' +\\n (libcSize.toString(16).toUpperCase()) +\\n '/g;' +\\n 's/RAM: file = \\\"\\\", start = $0800, size = $9800/' +\\n 'RAM: file = \\\"\\\", start = $0800, size = $' +\\n (heapSize.toString(16).toUpperCase()) + '/g;' +\\n \\\"' libc.cfg > build/libca.cfg\\\"\\n );\\n\\n execSync(\\n \\\"sed 's/RAM2: file = \\\\\\\\\\\\\\\"\\\\\\\\\\\\\\\", start = $0800, size = $9800/\\\" +\\n 'RAM2: file = \\\\\\\\\\\"\\\\\\\\\\\", start = $' +\\n (mainStart.toString(16).toUpperCase()) +\\n ', size = $' +\\n (mainSize.toString(16).toUpperCase()) +\\n '/g;' +\\n 's/RAM: file = \\\"\\\", start = $0800, size = $9800/' +\\n 'RAM: file = \\\"\\\", start = $0800, size = $' +\\n (heapSize.toString(16).toUpperCase()) + '/g;' +\\n \\\"' main.cfg > build/maina.cfg\\\"\\n );\\n\\n execSync(\\n \\\"sed '\\\" +\\n 's/RAM: file = \\\"\\\", start = $0800, size = $9800/' +\\n 'RAM: file = \\\"\\\", start = $0800, size = $' +\\n (heapSize.toString(16).toUpperCase()) + '/g;' +\\n \\\"' page.cfg > build/pagea.cfg\\\"\\n );\\n\\n compileFloatLib();\\n}\",\n \"function calculateArea(width, heigth, depth) {\\n\\tvar area = width * heigth;\\n\\tvar volume = width * heigth * depth;\\n\\tvar sizes = [area, volume];\\n\\treturn sizes;\\n}\",\n \"function calculateDotRarity() {\\n for (i = 0; i < tilesList.length; i++) {\\n if (tilesList[i].mat == 6) {\\n tilesList[i].dotRarity = 0\\n }\\n else {\\n tilesList[i].dotRarity = tilesList[i].dot / getTotalDots(tilesList[i].mat)\\n }\\n }\\n}\",\n \"function average(){\\r\\n // parse arguments into an array\\r\\n var args = [].slice.call(arguments);\\r\\n var addedNum = 0;\\r\\n var averageNum;\\r\\n\\r\\n // .. do something with each element of args\\r\\n args.forEach(function(value, idx, list) {\\r\\n addedNum += value;\\r\\n\\r\\n if (idx === (list.length - 1)) {\\r\\n averageNum = addedNum / (list.length);\\r\\n }\\r\\n });\\r\\n\\r\\n return averageNum;\\r\\n\\r\\n}\",\n \"function computeAvgRatings (ratings) {\\n const avgRating = ratings.reduce((acc, rating) => {\\n return acc + (rating.stars / ratings.length);\\n }, 0);\\n return Math.round(avgRating);\\n}\",\n \"function Calculate()\\n{\\n // do linear interpolations to get calibrated Adam readings\\n for (var i=0; i= cal.length || cal[j+2] >= raw) {\\n adamCal[i] = cal[j+1] + (raw - cal[j]) * (cal[j+3] - cal[j+1]) / (cal[j+2] - cal[j]);\\n break;\\n }\\n }\\n }\\n\\n // total force in kg due to air pressure difference\\n var f = (adamCal[6] - kAirPressureNom) * kBellowArea / (100 * kGravity);\\n\\n for (var i=0; i<3; ++i) {\\n damperPosition[i] = adamCal[i];\\n stagePosition[i] = adamCal[i+3];\\n // calculate load on this damper\\n damperLoad[i] = kLoadNom + (stagePosition[i] - damperPosition[i]) * kDamperForceConst;\\n // calculate fraction of the force felt by this damper\\n // (the pulse tube is offset toward damper 0)\\n var frac = (1 + (i ? -1 : 2) * kBellowPos / kDamperPos) / 3;\\n // nominal load on the damper for this pressure\\n var loadNom = kLoadNom - f * frac;\\n // this is how much weight we need to add to achieve the nominal load\\n damperAddWeight[i] = loadNom - damperLoad[i];\\n }\\n}\",\n \"getPixelPerMeter() {\\n\\t\\tlet ppm = new vec2(this.#_fusion.targetOutSize.x/this.#_augmentaScene.scene.x,this.#_fusion.targetOutSize.y/this.#_augmentaScene.scene.y);\\n\\t\\treturn ppm;\\n\\t}\",\n \"function sizesSum(){\\r\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\r\\n\\t\\t\\t\\tvar total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\r\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=$(this).height()+$(this).width();});}\\r\\n\\t\\t\\t\\treturn total;\\r\\n\\t\\t\\t}\",\n \"function getAvgNum(origVal) {\\n //map performs an action on each element of an array, \\n //reduce operates on all the elements\\n let inchVal = origVal.match(/\\\\d+(''|\\\")/g);\\n //RegEx: to get feet: digit followed by quote that's not followed by anouther quote\\n let footVal = origVal.match(/\\\\d+'(?!')/g);\\n let finalExtracted = [0];\\n if (inchVal && footVal){finalExtracted = inchVal.map(x=>parseFloat(x)).concat(footVal.map(x=>parseFloat(x)*12));} \\n else if (inchVal) {finalExtracted = inchVal.map(x=>parseFloat(x));}\\n else if (footVal) {finalExtracted = footVal.map(x=>parseFloat(x)*12);}\\n finalExtracted = finalExtracted.reduce((a,b)=>(a+b))/finalExtracted.length.toString();\\n// \\tfinalExtracted === 0?finalExtracted=1:finalExtracted; //todo: how to deal with plants without width and height?\\n\\treturn finalExtracted;\\n}\",\n \"function avg(d, u, h) {\\n return (d + u + h) / 3;\\n}\",\n \"function averageOf(no1, no2, no3) {\\n return (no1 + no2 + no3)/3;\\n}\",\n \"average() {\\n const length = this.length();\\n let sum = 0;\\n // this.traverse(function (node) {\\n // sum += node.value;\\n // });\\n this.traverse(node => sum += node.value);\\n\\n return this.isEmpty() ? null : sum / length;\\n }\",\n \"getDotPatternSize() {\\n //const { width } = this.getWindowDimensions();\\n return 28; // 28 for all for now\\n }\",\n \"function sizesSum(){\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\n\\t\\t\\t\\tvar total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\n\\t\\t\\t\\treturn total;\\n\\t\\t\\t}\",\n \"function sizesSum(){\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\n\\t\\t\\t\\tvar total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\n\\t\\t\\t\\treturn total;\\n\\t\\t\\t}\",\n \"function sizesSum(){\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\n\\t\\t\\t\\tvar total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\n\\t\\t\\t\\treturn total;\\n\\t\\t\\t}\",\n \"function sizesSum(){\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\n\\t\\t\\t\\tvar total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\n\\t\\t\\t\\treturn total;\\n\\t\\t\\t}\",\n \"function sizesSum(){\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\n\\t\\t\\t\\tvar total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange && sel.length>0){sel.each((function(){total+=this.offsetHeight+this.offsetWidth;}));}\\n\\t\\t\\t\\treturn total;\\n\\t\\t\\t}\",\n \"function ex_3_I(a){\\n m = 0;\\n for( i = 0; i {\\n sum += size\\n })\\n\\n if (this.data) {\\n sum += this.data.length\\n }\\n\\n return sum\\n }\",\n \"function sizesSum(){\\n\\t\\t\\t\\t if(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\n\\t\\t\\t\\t var total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\n\\t\\t\\t\\t if(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\n\\t\\t\\t\\t return total;\\n\\t\\t\\t }\",\n \"function sizesSum(){\\n if(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\n var total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\n if(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\n return total;\\n }\",\n \"function sizesSum(){\\r\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\r\\n\\t\\t\\t\\tvar total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\r\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\r\\n\\t\\t\\t\\treturn total;\\r\\n\\t\\t\\t}\",\n \"function sizesSum(){\\r\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\r\\n\\t\\t\\t\\tvar total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\r\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\r\\n\\t\\t\\t\\treturn total;\\r\\n\\t\\t\\t}\",\n \"function sizesSum(){\\r\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\r\\n\\t\\t\\t\\tvar total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\r\\n\\t\\t\\t\\tif(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\r\\n\\t\\t\\t\\treturn total;\\r\\n\\t\\t\\t}\",\n \"function averageNum(moreNumbers){\\r\\n return moreNumbers.reduce(function(accumulator, currentValue){\\r\\n return accumulator + currentValue\\r\\n})/moreNumbers.length}\",\n \"function findAvgWordLength(txt) {\\n let words = getWords(txt);\\n let count = 0;\\n for (let i = 0; i < words.length; i++) {\\n \\tcount += words[i].length;\\n }\\n\\n return count / words.length;\\n}\",\n \"calcExtraParams () {}\",\n \"function findAvg(mat) {\\n var sumMat = 0;\\n for (var i = 0; i < mat.length; i++) {\\n // var sumRow = 0;\\n var row = mat[i];\\n for (var j = 0; j < row.length; j++) {\\n sumMat += row[j] \\n }\\n // sumMat += sumRow\\n }\\n var n = (mat.length)*(mat.length) ;\\n console.log(sumMat/n)\\n}\",\n \"function sizesSum(){\\r\\n if(o.advanced.updateOnSelectorChange===true){o.advanced.updateOnSelectorChange=\\\"*\\\";}\\r\\n var total=0,sel=mCSB_container.find(o.advanced.updateOnSelectorChange);\\r\\n if(o.advanced.updateOnSelectorChange && sel.length>0){sel.each(function(){total+=this.offsetHeight+this.offsetWidth;});}\\r\\n return total;\\r\\n }\",\n \"average() {\\n if (this.length)\\n return this.reduce((accumulator, value) => accumulator + value, 0) / this.length;\\n else\\n return 0;\\n }\",\n \"function calculateAvgBpm(bpms) {\\n\\t\\tvar bpmSum = 0;\\n\\t\\tfor (var i=0; i currentSum + rating, 0);\\n const lengthOfArray = this._ratings.length;\\n return ratingsSum/lengthOfArray;\\n }\",\n \"getDataSize () {\\n let size = 0\\n\\n for (let n=0; n +a + +b) / arr.length;\\n }\",\n \"function average(a, b, c) {\\n\\nreturn (a + b + c) / 3;\\n\\n}\",\n \"function totalOptions(x, y, z, w) {\\n let result = 0;\\n\\n const start = Date.now();\\n\\n let xCount, yCount, zCount;\\n for(xCount = 0; xCount <= w; xCount += x) {\\n // console.log(\\\"for 1: xCount=\\\" + xCount);\\n for(yCount = 0; yCount <= w - xCount; yCount += y) {\\n // console.log(\\\"----for 2: yCount=\\\" + yCount);\\n for(zCount = 0; zCount <= w - yCount - xCount; zCount += z) {\\n // console.log(\\\"--------for 3: zCount=\\\" + zCount);\\n if(xCount + yCount + zCount === w) {\\n // console.log(\\\"xCount:\\\",xCount, \\\"+\\\",\\\"yCount:\\\",yCount,\\\"+\\\",\\\"zCount\\\",zCount);\\n result++;\\n } \\n }\\n }\\n }\\n\\n console.log(\\\"time: \\\" + (Date.now() - start));\\n\\n return result;\\n}\",\n \"function calculate() {\\n\\t\\t// 'this' is the jQuery object for the container.\\n\\t\\tmaxitemwidth = this.width()/settings['width-ratio'];\\n\\t\\tmaxitemheight = this.height()/settings['height-ratio'];\\n\\n\\t\\tgalleryitemwidth = maxitemwidth;\\n\\t\\tgalleryheight = 0;\\n\\n\\t\\tvar length = galleryitems.length;\\n\\n\\t\\t// Calculate gallery item width.\\n\\t\\tfor (var i = 0; i < length; i++){\\n\\t\\t\\t// Figure out which dimension is going to require the most resizing.\\n\\t\\t\\tvar scale = Math.min(maxitemwidth/galleryitems[i].width, maxitemheight/galleryitems[i].height, 1);\\n\\n\\t\\t\\tgalleryitemwidth = $('body').width();\\n\\t\\t}\\n\\n\\t\\t// Identify gallery item height now that we know the gallery item width.\\n\\t\\tfor (var i = 0; i < length; i++){\\n\\t\\t\\t// Figure out which dimension is going to require the most resizing.\\n\\t\\t\\tvar scale = galleryitemwidth / galleryitems[i].width;\\t\\t\\t\\n\\n\\t\\t\\tgalleryheight = $('body').height();\\n\\t\\t\\tgalleryitems[i].scaledwidth = $('body').width();\\n\\t\\t\\tgalleryitems[i].scaledheight = $('body').height();\\n\\t\\t}\\n\\n\\t\\t// Now that we know the max height, figure out the transformation origin for each.\\n\\t\\tfor (var i = 0; i < length; i++){\\n\\t\\t\\tgalleryitems[i].transformOriginY = galleryitems[i].scaledheight - galleryheight + (settings['transform-origin-ratio'] * galleryheight);\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"getAveragePoint(){\\n var sumX = 0;\\n var sumY = 0;\\n var numIncluded =0;\\n for(var i = this.hexesInPath.length-1; i>= Math.max(0, this.hexesInPath.length-3);i--){\\n sumX+=this.hexesInPath[i].getOffSetPos().x;\\n sumY+=this.hexesInPath[i].getOffSetPos().y;\\n numIncluded++;\\n console.log(this.hexesInPath[i]);\\n }\\n return {\\n x: sumX/numIncluded,\\n y: sumY/numIncluded\\n };\\n }\",\n \"function calcSize(points) {\\n\\t var area = 0,\\n\\t dist = 0;\\n\\n\\t for (var i = 0, a, b; i < points.length - 1; i++) {\\n\\t a = b || points[i];\\n\\t b = points[i + 1];\\n\\n\\t area += a[0] * b[1] - b[0] * a[1];\\n\\n\\t // use Manhattan distance instead of Euclidian one to avoid expensive square root computation\\n\\t dist += Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\\n\\t }\\n\\t points.area = Math.abs(area / 2);\\n\\t points.dist = dist;\\n\\t}\",\n \"getLengths( divisions = this.arcLengthDivisions ) {\\n\\n\\t\\tif ( this.cacheArcLengths &&\\n\\t\\t\\t( this.cacheArcLengths.length === divisions + 1 ) &&\\n\\t\\t\\t! this.needsUpdate ) {\\n\\n\\t\\t\\treturn this.cacheArcLengths;\\n\\n\\t\\t}\\n\\n\\t\\tthis.needsUpdate = false;\\n\\n\\t\\tconst cache = [];\\n\\t\\tlet current, last = this.getPoint( 0 );\\n\\t\\tlet sum = 0;\\n\\n\\t\\tcache.push( 0 );\\n\\n\\t\\tfor ( let p = 1; p <= divisions; p ++ ) {\\n\\n\\t\\t\\tcurrent = this.getPoint( p / divisions );\\n\\t\\t\\tsum += current.distanceTo( last );\\n\\t\\t\\tcache.push( sum );\\n\\t\\t\\tlast = current;\\n\\n\\t\\t}\\n\\n\\t\\tthis.cacheArcLengths = cache;\\n\\n\\t\\treturn cache; // { sums: cache, sum: sum }; Sum is in the last element.\\n\\n\\t}\",\n \"getLengths( divisions = this.arcLengthDivisions ) {\\n\\n\\t\\tif ( this.cacheArcLengths &&\\n\\t\\t\\t( this.cacheArcLengths.length === divisions + 1 ) &&\\n\\t\\t\\t! this.needsUpdate ) {\\n\\n\\t\\t\\treturn this.cacheArcLengths;\\n\\n\\t\\t}\\n\\n\\t\\tthis.needsUpdate = false;\\n\\n\\t\\tconst cache = [];\\n\\t\\tlet current, last = this.getPoint( 0 );\\n\\t\\tlet sum = 0;\\n\\n\\t\\tcache.push( 0 );\\n\\n\\t\\tfor ( let p = 1; p <= divisions; p ++ ) {\\n\\n\\t\\t\\tcurrent = this.getPoint( p / divisions );\\n\\t\\t\\tsum += current.distanceTo( last );\\n\\t\\t\\tcache.push( sum );\\n\\t\\t\\tlast = current;\\n\\n\\t\\t}\\n\\n\\t\\tthis.cacheArcLengths = cache;\\n\\n\\t\\treturn cache; // { sums: cache, sum: sum }; Sum is in the last element.\\n\\n\\t}\",\n \"async calculateTxSize (inputs, outputs, changeAddress, feeRate) {\\n const weightTestInput = rpcFormat(inputs, outputs, changeAddress, 0.0005)\\n const weightTestRaw = await this.client.createRawTransaction(...weightTestInput)\\n const weightTestSigned = await this.client.signRawTransactionWithWallet(weightTestRaw)\\n const weightTestTx = await this.client.decodeRawTransaction(weightTestSigned.hex)\\n\\n const virtualSize = weightTestTx.weight / 4\\n return virtualSize\\n }\",\n \"function calcAve(tips){\\n var sum = 0;\\n for (var i = 0; i < tips.length; i++){\\n sum = sum + tips[i];\\n }\\n return sum / tips.length;\\n}\",\n \"getSize() {\\n\\t\\tlet pattern = this.getPattern();\\n\\t\\tlet highestRow = 0;\\n\\t\\tlet highestCol = 0;\\n\\t\\tfor(let block of pattern){\\n\\t\\t\\tlet row = block[0] + 1;\\n\\t\\t\\tlet col = block[1] + 1;\\n\\n\\t\\t\\tif(row >= highestRow){\\n\\t\\t\\t\\thighestRow = row;\\n\\t\\t\\t}\\n\\t\\t\\tif(col >= highestCol){\\n\\t\\t\\t\\thighestCol = col;\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\tthis.width = highestCol;\\n\\t\\tthis.height = highestRow;\\n\\t}\",\n \"function average() {\\n averageHeight = averageHeight / rectNum;\\n strokeWeight(3);\\n line(0,averageHeight,width,averageHeight);\\n}\",\n \"function avg(arr) {\\n\\tlet total = 0;\\n\\t//loop over each num\\n\\tfor (let num of arr) {\\n\\t\\t//add them together\\n\\t\\ttotal += num;\\n\\t}\\n\\t//divide by number of nums\\n\\treturn total / arr.length;\\n}\",\n \"function avgCostPerDesigner(shoes){\\n return (shoes.reduce(function(total,item){\\n return total += item.price ;\\n },0))/shoes.length ;\\n}\",\n \"function calculateFitnessChrom()\\n{\\n var gaps = new Array(); // to keep the amount of gaps in the layout\\n\\n var filledCols= new Array (theLayout.numCols); //to keep how filled is each column\\n for (var i = 0 ; i < theLayout.numCols ; i++)\\n filledCols[i] = 0;\\n\\n for ( var i = 0; i < this.adn.length; i++ ) {\\n\\n // select the column to place the layer. If the layer spans in more than\\n // one column, the selected column will be the first column the layers uses\\n\\n var selCol = 0; // column to allocate the layer\\n var selMean = 0; // used capacity mean\\n var selStd = 0; // used capacity standard deviation\\n for (var k=0 ; k < theLayout.widths[this.adn[i]] ; k++) {\\n selMean += filledCols[k];\\n }\\n selMean /= theLayout.widths[this.adn[i]];\\n\\n for (var k=0 ; k < theLayout.widths[this.adn[i]] ; k++) {\\n selStd += Math.abs(filledCols[k]-selMean);\\n }\\n selStd /= theLayout.widths[this.adn[i]];\\n \\n var limit = theLayout.numCols - theLayout.widths[this.adn[i]]+1;\\n for ( var j = 1 ; j < limit ; j++) {\\n\\n var mean = 0;\\n var std = 0;\\n\\n if (theLayout.widths[this.adn[i]] > 1) {\\n for (var k=j ; k < j+theLayout.widths[this.adn[i]] ; k++) {\\n mean += filledCols[k];\\n }\\n mean /= theLayout.widths[this.adn[i]];\\n\\n for (var k=j ; k < j+theLayout.widths[this.adn[i]] ; k++) {\\n std += Math.abs(filledCols[k]-mean);\\n }\\n std /= theLayout.widths[this.adn[i]];\\n }\\n else {\\n mean = filledCols[j];\\n }\\n\\n if (std < selStd || (std == selStd && mean < selMean)) {\\n selCol = j;\\n selMean = mean;\\n selStd = std;\\n }\\n }\\n\\n // once the column is chosen, if the layer spans more than one column,\\n // the maximum used capacity is used\\n var max = filledCols[selCol];\\n if (theLayout.widths[this.adn[i]] > 1) {\\n for (var k=selCol ; k < selCol+theLayout.widths[this.adn[i]] ; k++) {\\n if ( filledCols[k] > filledCols[selCol] ) {\\n max = filledCols[k];\\n }\\n }\\n\\n // detect gaps\\n for (var k=selCol ; k < selCol+theLayout.widths[this.adn[i]] ; k++) {\\n if (max > filledCols[k])\\n gaps.push (max - filledCols[k]);\\n }\\n }\\n\\n // fill the column selected with the height of the layer\\n for (var k=selCol ; k < selCol+theLayout.widths[this.adn[i]] ; k++) {\\n filledCols[k] = max + $(theLayout.layers[this.adn[i]]).height() +\\n theLayout.pixelsGap;\\n }\\n }\\n\\n // this part calculates the gaps at the bottom\\n var max = filledCols[0];\\n for ( var j = 1 ; j < theLayout.numCols ; j++) {\\n if (filledCols[j] > max)\\n max = filledCols[j];\\n }\\n\\n for ( var j = 0 ; j < theLayout.numCols ; j++) {\\n if (filledCols[j] < max)\\n gaps.push (max - filledCols[j]);\\n }\\n\\n\\n // this part tries to minimize the gaps\\n\\n // If there were only one gap, the standard deviation would be 0,\\n // so I insert a fictitious gap to avoid this problem\\n gaps.push (0);\\n\\n var gapsMean = 0; // gap size mean\\n if (gaps.length>0) {\\n for (var k=0 ; k < gaps.length ; k++) {\\n gapsMean += gaps[k];\\n }\\n gapsMean /= gaps.length;\\n\\n }\\n\\n this.fitness = gapsMean;\\n\\n return this.fitness;\\n}\",\n \"function avg() {\\n var sum = 0;\\n for (var i = 0, j = arguments.length; i < j; i++) {\\n sum += arguments[i];\\n }\\n return sum / arguments.length;\\n}\",\n \"function avg() {\\n var sum = 0;\\n for (var i = 0, j = arguments.length; i < j; i++) {\\n sum += arguments[i];\\n }\\n return sum / arguments.length;\\n}\",\n \"function ex_3_R(a){\\n m = 0;\\n if ( a.length == 0 ) m = 0;\\n else m = (ex_3_R(a.slice(1))*(a.length-1) + a[0])/a.length;\\nreturn m;\\n}\",\n \"getLengths( divisions = this.arcLengthDivisions ) {\\n\\n\\t\\t\\tif ( this.cacheArcLengths &&\\n\\t\\t\\t\\t( this.cacheArcLengths.length === divisions + 1 ) &&\\n\\t\\t\\t\\t! this.needsUpdate ) {\\n\\n\\t\\t\\t\\treturn this.cacheArcLengths;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tthis.needsUpdate = false;\\n\\n\\t\\t\\tconst cache = [];\\n\\t\\t\\tlet current, last = this.getPoint( 0 );\\n\\t\\t\\tlet sum = 0;\\n\\n\\t\\t\\tcache.push( 0 );\\n\\n\\t\\t\\tfor ( let p = 1; p <= divisions; p ++ ) {\\n\\n\\t\\t\\t\\tcurrent = this.getPoint( p / divisions );\\n\\t\\t\\t\\tsum += current.distanceTo( last );\\n\\t\\t\\t\\tcache.push( sum );\\n\\t\\t\\t\\tlast = current;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tthis.cacheArcLengths = cache;\\n\\n\\t\\t\\treturn cache; // { sums: cache, sum: sum }; Sum is in the last element.\\n\\n\\t\\t}\",\n \"function size_of(segments, bindings) {\\n var size = 0;\\n for (var i=0, len = segments.length; i < len; i++) {\\n size += size_of_segment(segments[i], bindings);\\n }\\n return size;\\n}\",\n \"findAverage(mat){\\n\\n var size = [mat.length,mat[0].length];\\n var sum = Array.apply(null, Array(size[1])).map(Number.prototype.valueOf,0);\\n\\n for(var i=0;i currentValue/size[0]);\\n sum = sum.map(currentValue => Math.round(currentValue*100)/100);\\n return sum;\\n }\",\n \"function avg(num1, num2, num3) {\\n return (num1 + num2 + num3) / 3; \\n}\",\n \"function avgWindSp () {\\n\\tvar array = map(list, function (c) {\\n\\t\\treturn c.wind.speed;\\n\\t});\\n\\tvar sum = reduce(array, function (a, b) {\\n\\t\\treturn a + b;\\n\\t});\\n\\treturn Math.round(100 * (sum / list.length)) / 100;\\n}\",\n \"function find_average(array) {\\n // your code here\\n var sum = 0;\\n array.forEach( element => sum += element); \\n return sum / array.length;\\n}\",\n \"function calcAverage(score1, score2, score3) {\\n return (score1 + score2 + score3) / 3;\\n}\",\n \"getDrawSize () {\\r\\n return Math.ceil(this.calories / this.gestation * 10)\\r\\n }\",\n \"function find_avg(arr) {\\n\\t\\tvar sum = 0, avg;\\n\\t\\tfor (var i = 0; i < arr.length; i++) {\\n\\t\\t\\tsum += arr[i];\\n\\t\\t}\\n\\t\\tavg = sum / arr.length;\\n\\t\\treturn avg;\\n\\t}\",\n \"function computedAvgPriceForEach() {\\r\\n let sumPrice = 0;\\r\\n shirts.forEach(val => sumPrice += val.price );\\r\\n return sumPrice/shirts.length;\\r\\n}\",\n \"function getEffectSizeAmount(effectSizeType, effectSize)\\n{\\n var interpretations = effectSizeInterpretations[effectSizeType];\\n if(effectSize < interpretations[0])\\n return 0;\\n else if(effectSize >= interpretations[0] && effectSize < interpretations[1])\\n return 1;\\n else if(effectSize >= interpretations[1] && effectSize < interpretations[2])\\n return 2;\\n else if(effectSize >= interpretations[2])\\n return 3; \\n return 99;\\n}\",\n \"function calculateAveragePrice(flavors) {\\n var sum = 0;\\n flavors.forEach(function(flavor)\\n {\\n\\t sum+= parseFloat(flavor.price.replace('$', ''));\\n });\\n return (sum/flavors.length).toFixed(2);\\n }\",\n \"updateWeights(weights) {\\n let numAreas = 0;\\n for (let ind = 0; ind < CSRankings.areas.length; ind++) {\\n let area = CSRankings.areas[ind];\\n weights[area] = $('input[name=' + this.fields[ind] + ']').prop('checked') ? 1 : 0;\\n if (weights[area] === 1) {\\n if (area in CSRankings.parentMap) {\\n // Don't count children.\\n continue;\\n }\\n /* One more area checked. */\\n numAreas++;\\n }\\n }\\n return numAreas;\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.57280034","0.5540435","0.53792703","0.52424026","0.5117586","0.5117586","0.5070961","0.5068654","0.50404084","0.49998394","0.49994612","0.49917972","0.4977473","0.49752748","0.49266025","0.4909818","0.4899954","0.48816302","0.48655826","0.48574534","0.48550236","0.4816818","0.4815315","0.47645533","0.47444686","0.47300515","0.47290367","0.4726107","0.47193512","0.4712717","0.47116742","0.47006786","0.4684813","0.46842045","0.46803534","0.4674445","0.467332","0.46695668","0.46695668","0.46695668","0.46695668","0.46549934","0.464668","0.46379238","0.46273273","0.46188766","0.46158278","0.4614431","0.46108347","0.4610531","0.46070656","0.46070656","0.46070656","0.46047318","0.4597953","0.45954368","0.45947638","0.45934442","0.45922005","0.4590368","0.4587583","0.4578028","0.45776063","0.45679173","0.4559456","0.45584476","0.45568478","0.4555555","0.4553695","0.45423216","0.45406067","0.45401183","0.4538243","0.45342678","0.45319086","0.45303136","0.45303136","0.45298788","0.45265555","0.4522651","0.45102572","0.44987127","0.4496176","0.44959918","0.44939113","0.44939113","0.44895187","0.4489376","0.44870955","0.44866213","0.4481441","0.44813892","0.44811475","0.44771862","0.44763651","0.4474959","0.44720453","0.44719547","0.44716403","0.4471509"],"string":"[\n \"0.57280034\",\n \"0.5540435\",\n \"0.53792703\",\n \"0.52424026\",\n \"0.5117586\",\n \"0.5117586\",\n \"0.5070961\",\n \"0.5068654\",\n \"0.50404084\",\n \"0.49998394\",\n \"0.49994612\",\n \"0.49917972\",\n \"0.4977473\",\n \"0.49752748\",\n \"0.49266025\",\n \"0.4909818\",\n \"0.4899954\",\n \"0.48816302\",\n \"0.48655826\",\n \"0.48574534\",\n \"0.48550236\",\n \"0.4816818\",\n \"0.4815315\",\n \"0.47645533\",\n \"0.47444686\",\n \"0.47300515\",\n \"0.47290367\",\n \"0.4726107\",\n \"0.47193512\",\n \"0.4712717\",\n \"0.47116742\",\n \"0.47006786\",\n \"0.4684813\",\n \"0.46842045\",\n \"0.46803534\",\n \"0.4674445\",\n \"0.467332\",\n \"0.46695668\",\n \"0.46695668\",\n \"0.46695668\",\n \"0.46695668\",\n \"0.46549934\",\n \"0.464668\",\n \"0.46379238\",\n \"0.46273273\",\n \"0.46188766\",\n \"0.46158278\",\n \"0.4614431\",\n \"0.46108347\",\n \"0.4610531\",\n \"0.46070656\",\n \"0.46070656\",\n \"0.46070656\",\n \"0.46047318\",\n \"0.4597953\",\n \"0.45954368\",\n \"0.45947638\",\n \"0.45934442\",\n \"0.45922005\",\n \"0.4590368\",\n \"0.4587583\",\n \"0.4578028\",\n \"0.45776063\",\n \"0.45679173\",\n \"0.4559456\",\n \"0.45584476\",\n \"0.45568478\",\n \"0.4555555\",\n \"0.4553695\",\n \"0.45423216\",\n \"0.45406067\",\n \"0.45401183\",\n \"0.4538243\",\n \"0.45342678\",\n \"0.45319086\",\n \"0.45303136\",\n \"0.45303136\",\n \"0.45298788\",\n \"0.45265555\",\n \"0.4522651\",\n \"0.45102572\",\n \"0.44987127\",\n \"0.4496176\",\n \"0.44959918\",\n \"0.44939113\",\n \"0.44939113\",\n \"0.44895187\",\n \"0.4489376\",\n \"0.44870955\",\n \"0.44866213\",\n \"0.4481441\",\n \"0.44813892\",\n \"0.44811475\",\n \"0.44771862\",\n \"0.44763651\",\n \"0.4474959\",\n \"0.44720453\",\n \"0.44719547\",\n \"0.44716403\",\n \"0.4471509\"\n]"},"document_score":{"kind":"string","value":"0.5978173"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":3067,"cells":{"query":{"kind":"string","value":"returns true if the proportions of the counts is close enough to the 1/1/1 ratios used by alignment patterns to be considered a match"},"document":{"kind":"string","value":"function foundPatternCross(stateCount, moduleSize) {\r\n\t\t var maxVariance = moduleSize / 2;\r\n\t\t for (var i = 0; i < 3; i++) {\r\n\t\t if (Math.abs(moduleSize - stateCount[i]) >= maxVariance) {\r\n\t\t return false;\r\n\t\t }\r\n\t\t }\r\n\t\t return true;\r\n\t\t}"},"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 checkCounts(){\n\tfor(cat in landmarks){\n\t\tif(landmarks[cat].length != targetCounts[cat]){\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}","compareDNA(pAeq2){\n let count = 0;\n dna.forEach((base1, index) => {\n const base2 = pAeq2.dna[index];\n if(base1 == base2){\n count++;\n }\n });\n let percent = (count/(dna.length+pAeq2.dna.length))*100;\n percent = percent.toFixed(2);\n console.log(`specimen #${this.specimenNum} and specimen #${pAeq2.specimenNum} have ${percent}% DNA in common.`)\n }","compareDNA(pAequor) {\n let similarBases = 0;\n for(let i = 0; i < 15; i++) {\n if(this.dna[i] === pAequor.dna[i]) {\n similarBases++;\n }\n }\n const percentOfSimilarity = (similarBases / 15) * 100;\n console.log(`specimen #${this.specimenNum} and specimen #${pAequor.specimenNum} have ${percentOfSimilarity.toFixed()}% DNA in common.`);\n }","function percentageLayout() {\n // check subpixel layout supporting\n var doc = document,\n body = getBody(),\n docOverflow = setFakeBody(body),\n wrapper = doc.createElement('div'),\n outer = doc.createElement('div'),\n str = '',\n count = 70,\n perPage = 3,\n supported = false;\n\n wrapper.className = \"tns-t-subp2\";\n outer.className = \"tns-t-ct\";\n\n for (var i = 0; i < count; i++) {\n str += '';\n }\n\n outer.innerHTML = str;\n wrapper.appendChild(outer);\n body.appendChild(wrapper);\n\n supported = Math.abs(wrapper.getBoundingClientRect().left - outer.children[count - perPage].getBoundingClientRect().left) < 2;\n\n body.fake ? resetFakeBody(body, docOverflow) : wrapper.remove();\n\n return supported;\n}","compareDna (pAequor) {\n let identicalResults = 0;\n for (let i = 0; i < 15; i++) {\n if (this.dna[i] === pAequor.dna[i]) {\n identicalResults += 1;\n } \n }\n const percentage = identicalResults / this.dna.length * 100;\n console.log(`Specimen ${this.specimenNum} and specimen ${pAequor.specimenNum} have ${percentage.toFixed \n (2)}% in common.`);\n }","compareDNA(obj) { \n //identical variable is the number of duplicates per index of both this.dna and obj.dna arrays\n let identical = 0\n this.dna.forEach( (element, index) => element === obj.dna[index] ? identical++ : identical += 0)\n\n //percentage variable, of course finds the percentage of duplicates both arrays\n let percentage = Math.floor(identical / this.dna.length * 100)\n\n return `specimen #1 and specimen #2 have ${percentage}% DNA in common.`\n }","willLikelySurvive() {\n let returnPercentage = 0;\n this.dna.forEach(item => item === 'C' || item === 'G' ? returnPercentage += 1/this.dna.length : '');\n return returnPercentage >= .6 ? true : false;\n }","willLikelySurvive() {\n let NumOfCs = 0;\n let NumOfGs = 0;\n\n this.dna.forEach(base => {\n if(base === 'C') {\n NumOfCs++;\n } else if(base === 'G') {\n NumOfGs++;\n }\n });\n\n const percentOfCs = NumOfCs / 15 * 100;\n const percentOfGs = NumOfGs / 15 * 100;\n\n if(percentOfCs >= 60 || percentOfGs >= 60) {\n return true;\n } else {\n return false;\n }\n }","function improvesRatio(currentrow, nextnode, length) {\n var newrow;\n\n if (currentrow.length === 0) {\n return true;\n }\n\n newrow = currentrow.slice();\n newrow.push(nextnode);\n var currentratio = calculateRatio(currentrow, length);\n var newratio = calculateRatio(newrow, length); // the pseudocode in the Bruls paper has the direction of the comparison\n // wrong, this is the correct one.\n\n return currentratio >= newratio;\n } // calculateRatio - calculates the maximum width to height ratio of the","compareDnaV2 (pAequor) {\n const result = this.dna.reduce((acc, curr, idx, arr) => {\n if (arr[idx] === pAequor.dna[idx]) {\n return acc + 1;\n }\n else {\n return acc;\n }\n }, 0)\n const percentage2 = result / this.dna.length * 100;\n return `Specimen ${this.specimenNum} and specimen ${pAequor.specimenNum} have ${percentage2.toFixed \n (2)}% in common.`\n }","compareDNA(specimen) {\n let matches = 0\n this.dna.forEach((element, currentIndex) => {\n if (element === specimen.dna[currentIndex]) {\n matches++\n console.log(`${this.dna[currentIndex]} matches ${specimen.dna[currentIndex]} at ${currentIndex}`)\n }\n })\n if (matches > 0) {\n console.log (`Specimens have ${Math.floor((matches / this.dna.length) * 100)}% DNA in common.`)\n } else {\n console.log(\"No matches were found.\")\n console.log (\"Specimens don't have DNA in common.\")\n }\n }","compareDNA(pAequor) {\n\t\t\tlet curr = this.dna;\n\t\t\tlet past = pAequor.dna;\n\t\t\tlet cnt = 0;\n\t\t\tfor(let i = 0; i < curr.length; i++) {\n\t\t\t\tif(curr[i] === past[i]) {\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet perc = (cnt/(curr.length) * 100).toFixed(2);\n\t\t\tconsole.log(`specimen #1 and specimen #2 have ${perc}% DNA in common`);\n\t\t}","function IsFittingCount(x, syllables) {\n return x.length == syllables;\n}","function isApproximately(a, b, withinPercent) {\n let percent = a / b * 100;\n Phoenix.log(percent);\n return percent > 100 - withinPercent && percent < 100 + withinPercent \n}","function matchCheck(){\n return (points == match);\n }","function perfect (x) {\r\n var module = x.module, pref = maxSize(x);\r\n if ( isVertical(x) ) {return Math.abs(pref.width - module.width()) < tolerance;} \r\n if ( isHorizontal(x) ) {return Math.abs(pref.height - module.height()) < tolerance;}\r\n return true;\r\n }","function matchQuality (text, query) {\n const terms = tokenize(query)\n const termsLength = terms.map(term => term.length).reduce((x, y) => x + y, 0)\n\n const quality = termsLength / text.length\n // Add bonus points if the query matches text at the very start.\n const bonus = startsWith(text, terms[0]) ? 1 : 0\n\n return quality + bonus\n}","function checkOverlap (shifts) {\n var width = 0;\n _.each(shifts, function (shift, i) {\n width += (shift.end-shift.start)\n });\n if (width > 1440) {\n return true;\n } else {\n return false;\n }\n }","static selectionsSameMeasure(selections) {\n let i = 0;\n if (selections.length < 2) {\n return true;\n }\n const sel1 = selections[0].selector;\n for (i = 1; i < selections.length; ++i) {\n if (!SmoSelector.sameMeasure(sel1, selections[i].selector)) {\n return false;\n }\n }\n return true;\n }","function betterThanAverage(classPoints, yourPoints) {\n \n let mediaClassPoints = classPoints.reduce((a,b) => a + b, 0) / classPoints.length;\n if((mediaClassPoints + yourPoints) / 2 <= yourPoints) {return true;}\n return false;\n}","function checkSimilarTags(prefixArr){\n var isDifferent = false;\n for(var i = 0; i < queue[0].length; i++){\n if(arraysEqual(queue[0][i], prefixArr[0]) && !isDifferent){\n if(i / queue[0].length < Config.THRESHOLD_PERCENTAGE){\n isDifferent = true;\n }\n }\n }\n for(var i=0; i {\n if(base === 'C' || base === 'G'){\n surviveCount++;\n }\n });\n let survivePercent = (surviveCount/dna.length)*100;\n if(survivePercent >= 60) {\n return true;\n } else {\n return false;\n }\n }","function countDuplicates(text) {\n const splitted = text.split(/\\s+/g);\n const wordcount = new Set(splitted).size;\n const ratio = wordcount / splitted.length;\n\n if (wordcount > 0 && ratio < 0.1)\n return true;\n else if (wordcount > 0 && text.length / wordcount > 300)\n return true;\n else\n return false;\n}","willLikelySurvive() {\n // Use .filter() method to create new array containing only C/G elements\n const cOrG = this.dna.filter((el) => el === 'C' || el === 'G');\n // Divide length of newly filtered C/G array by length of original DNA array\n // If >= sixty percent, return true - If not, return false\n return cOrG.length / this.dna.length >= 0.6;\n }","function charCountCompabilityCheck(seqs) {\n\tvar positionArray = new Array(seqs[0].length);\n\t// Create a base counter for each position:\n\tfor(var i = 0, n = seqs[0].length; i < n; i++) {\n\t\tpositionArray[i] = {A:0, T:0, G:0, C:0};\n\t}\n\t// Iterate over all sequences:\n\tvar seq;\n\tfor(var i = 0, n = seqs.length; i < n ; i++) {\n\t\tseq = seqs[i];\n\t\t// Iterate over all positions in current sequence:\n\t\tfor(var j = 0, m = seq.length; j < m; j++) {\n\t\t\t// Add one to the count for the base in this position:\n\t\t\tpositionArray[j][seq[j]] += 1;\n\t\t}\n\t}\n\t// Sum channel distribution:\n\tvar green;\n\tvar red;\n\tfor(var i = 0, n = seqs[0].length; i < n ; i++) {\n\t\tgreen = positionArray[i].T + positionArray[i].G;\n\t\tred = positionArray[i].A + positionArray[i].C;\n\t}\n\treturn (green > 0 && red > 0);\n}","function matchCompare(matchRequirement, ingredients, availableIngredients) {\n var matches;\n var matchPercent = 100 * (matches / ingredients.length());\n \n for (var i = 0; i < ingredients.length(); i++) {\n for (var j = 0; j < availableIngredients.length(); j++) {\n if (ingredients[i] == availableIngredients[j]) {\n matches++;\n }\n }\n }\n \n if (matchPercent < matchRequirement) {\n return false;\n }\n \n return true;\n}","function checkRepeats() {\n var v_ctr;\n for (v_ctr=0; v_ctr<7; v_ctr++) {\n/* console.log(\"340 [\" + v_ctr + \"] [\" +\n a_scaleNotes[v_ctr].substr(0,1) + \"] [\" +\n a_scaleNotes[(v_ctr + 1) % 7].substr(0,1) + \"]\");\n*/\n if (a_scaleNotes[v_ctr].substr(0,1) == a_scaleNotes[(v_ctr + 1) % 7].substr(0,1))\n return true;\n }\n return false;\n}","function checkPerms(s1, s2) { //case-sensitive; assume whitespace is significant; only ASCII inputs\n\tvar l1 = s1.length;\n\tvar l2 = s2.length;\n\tif (l1 !== l2) return false;\n\n\tvar chars = {};\n\tfor (var i = 0, l = l1; i < l; i++) {\n\t\tif (chars[s1[i]]) chars[s1[i]] += 1;\n\t\telse chars[s1[i]] = 1;\n\t}\n\tfor (var i = 0, l = l2; i < l; i++) {\n\t\tif (chars[s2[i]]) chars[s2[i]] -= 1;\n\t\telse return false;\n\n\t\tif (chars[s2[i]] < 0) return false;\n\t}\n\treturn true;\n}","function boolpercent(arr) {\n\tvar count = 0;\n\tfor (var i=0; i=0) \n similarilty_count++;\n }\n if (arr1[0] ===arr2[0] && similarilty_count/arr1.length > SIMILAR_THRESHOLD) return true; \n return false;\n }","settled(arr) {\n for (let i = 0; i < arr.length; i++) {\n if (Math.abs(arr[i]) > 0.1) {\n return false;\n }\n }\n return true;\n }","function same(p0, p1) {\n return (Math.abs(p0[0] - p1[0]) < 1e-9 && Math.abs(p0[1] - p1[1]) < 1e-9);\n}","function isCorrectPercentage(){\n let x = table.children[0];\n let theSpot;\n let leftD, leftM, leftU, upM, rightU, rightM, rightD, downM;\n for(let i=0; i= threshold) {\n return true;\n } else {\n return false;\n }\n}","willLikelySurvive() {\n let count = 0;\n for (let i = 0; i < this.dna.length; i++) {\n if (this.dna[i] === \"C\" || this.dna[i] === \"G\") {\n count++;\n }\n }\n if ((count * 100) / this.dna.length >= 60) {\n return true;\n } else {\n return false;\n }\n }","function checkExactish(widthTarget, width, heightTarget, height) {\n\tconst targetAspect = parseFloat(widthTarget / heightTarget).toFixed(2)\n\tconst aspect = parseFloat(width / height).toFixed(2)\n\n\tconst isValid = (widthTarget <= width) &&\n\t\t(heightTarget <= height) &&\n\t\t(targetAspect === aspect)\n\n\treturn isValid\n}","validate(pwd){\n this._maxLength = 0;\n this._leastTransformations = 10;\n for(let keyboard of this.keyboards){\n try{\n this._transformationsDone = [];\n const length = this._snakeLength(pwd, keyboard);\n if (length > this._maxLength){\n this._maxLength = length;\n\n if (this._transformationsDone.length < this._leastTransformations){\n this._leastTransformations = this._transformationsDone.length;\n }\n }\n } finally {\n this._transformationsDone = [];\n }\n }\n\n this._percentage = this._maxLength / pwd.length;\n\n return !(this._percentage >= this.minPercentage && this._leastTransformations <= 5);\n }","function segmentSizesValid(segments){\r\n var totsize=0;\r\n for(var j=0; jmainMemorySize){\r\n return false;\r\n }else{\r\n return true;\r\n }\r\n}","function calculeScores() {\n var width = canvas.width / ratio;\n var height = canvas.height / ratio;\n pigs.forEach((p) => {\n if ((birdX + birdWidth - tolerance > p.centerX - p.radius) && (birdX + tolerance < p.centerX + p.radius)) {\n if ((birdY + birdHeight - tolerance > p.centerY - p.radius) && (birdY + tolerance < p.centerY + p.radius)) {\n scoreSound.play();\n score += 2;\n p.centerX = canvas.width / ratio;\n p.centerY = Math.floor(Math.random() * (height - flowHeight - flowHeight + 1) + flowHeight);\n }\n }\n })\n}","function shouldUse() {\n var show = data[questionPos][\"show_number\"];\n var toTake = (questionPos % 4) + 1;\n return ((parseInt(show.charCodeAt(toTake)) % g) >= (g / 3));\n }","function sameFrequencyPattern(arr1, arr2){\n const n1 = arr1.length\n const n2 = arr2.length\n if( n1 !== n2 ) return false\n\n // calculates the frequencies of each table\n const frequencyCounter1 = arr1.reduce((acc,v) => ({ ...acc, [v]:(acc[v]||0)+1 }),{})\n const frequencyCounter2 = arr2.reduce((acc,v) => ({ ...acc, [v]:(acc[v]||0)+1 }),{})\n\n for(let key in frequencyCounter1){\n // if a number in array 1 (squared) does not exists in array 2 then return false\n if(!(key ** 2 in frequencyCounter2)) return false\n // if the frequencies between between the values do not match return false\n if(frequencyCounter2[key**2] !== frequencyCounter1[key]) return false\n }\n\n return true\n}","function checkMatches(drawData) {\n const { winningNumbers, drawedSets} = drawData;\n //const numAmount = winningNumbers.size;\n for (set of drawedSets) {\n set.match = 0;\n for (let num of set.numbers) {\n if (winningNumbers.includes(num)) {\n set.match++;\n }\n }\n }\n //console.log(winningNumbers, drawedSets);\n}","function countMatches(orders) {\r\n\t var matched = 0, dimension = orders[0].length\r\n\t while(matched < dimension) {\r\n\t for(var j=1; j delta) {\n return false;\n }\n }\n return true;\n}","function patternCheckOrientation(pattern, targetCell, qualityGoal, weight, orientation) {\n var forwardFacingCells = FWD_CELLS[targetCell];\n var totalDiscrepancies = 0;\n DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\"Enter pCO([\" + pattern + \"]; \" + targetCell + \", \" + qualityGoal + \", \" + weight + \", \" + orientation + \"); compass: \" + compass);\n fwdWrong = [];\n rearWrong = [];\n if ((Array.isArray(pattern[POS_CENTER]) && !pattern[POS_CENTER][myColor]) ||\n\t((pattern[POS_CENTER] > 0) && (myColor != pattern[POS_CENTER]))) {\n\tif (forwardFacingCells[POS_CENTER]) { // always true, in fact\n\t fwdWrong.push({p:POS_CENTER, v:POS_CENTER});\n\t totalDiscrepancies += 1;\n\t} else {\n\t rearWrong.push({p:POS_CENTER, v:POS_CENTER});\n\t totalDiscrepancies += weight;\n\t}\n }\n if ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\n\tDEBUG_PATTERN_CHECK_VERBOSELY && debugme(\"--- too bad\");\n\treturn PAT_NOMATCH;\n }\n var jFrom = 0;\n switch (targetCell) {\n case AIM_UP:\n\tjFrom = 4;\n\tbreak;\n case AIM_LEFT:\n\tjFrom = 6;\n\tbreak;\n case AIM_RIGHT:\n\tjFrom = 2;\n\tbreak;\n case AIM_DOWN:\n case POS_CENTER:\n default:\n\tbreak;\n }\n for (var j = jFrom; j < TOTAL_NBRS + jFrom; j++) {\n\tvar posP = CCW[j];\n\tvar posV = CCW[orientation + j];\n\tvar c = view[posV].color;\n\tif ((Array.isArray(pattern[posP]) && !pattern[posP][c]) ||\n\t ((pattern[posP] > 0) && (c != pattern[posP]))) {\n\t if (forwardFacingCells[posP]) {\n\t\tfwdWrong.push({p:posP, v:posV});\n\t\t// #future# If it should ever be needed, we could push j as a\n\t\t// third member of these objects (its absence indicating the\n\t\t// center cell).\n\t\ttotalDiscrepancies += 1;\n\t } else {\n\t\trearWrong.push({p:posP, v:posV});\n\t\ttotalDiscrepancies += weight;\n\t }\n\t}\n\tif ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\n\t DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\"--- too bad\");\n\t return PAT_NOMATCH;\n\t}\n }\n // Assert: totalDiscrepancies == fwdWrong.length + rearWrong.length;\n // Assert: If compass < 0, then totalDiscrepancies <= qualityGoal\n debugme(\"-> total \" + totalDiscrepancies + \" weighted discrepancies found.\");\n if ((compass < 0)\n\t// && (totalDiscrepancies <= qualityGoal)\n ) {\n\tcompass = orientation;\n }\n if (DEBUGME[myType]) {\n\t// Bypass the single-arg debugme() in order to get the objects printed.\n\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\"forwardD: [\", fwdWrong, \"]\");\n\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\"rearD: [\", rearWrong, \"]\");\n }\n if (fwdWrong.length == 0) {\n\treturn (totalDiscrepancies);\n } else {\n\treturn (-totalDiscrepancies);\n }\n}","function calc_conf_score(input_set, master_paragraph){\n\n let num_same_words = 0;\n // clean string and split by spaces\n let master_paragraph_split = master_paragraph.toLowerCase().replace(/[.,\\/#!$%\\^&\\*;:{}=\\-_`~()]/g,\"\").replace(/\\s{2,}/g,\" \").split(\" \");\n let master_paragraph_split_filtered = master_paragraph_split.filter((x)=>!unimportant_words.has(x));\n let num_words_paragraph = master_paragraph_split_filtered.length;\n\n for(var i = 0; i < master_paragraph_split_filtered.length; i++){\n if (input_set.has(master_paragraph_split_filtered[i])){\n num_same_words++;\n }\n }\n return (num_same_words / num_words_paragraph);\n}","campare(a, b) {\n const EPS = 0.1;\n if (Math.abs(Math.abs(a) - Math.abs(b)) < EPS) {\n return true;\n }\n return false;\n }","function checkAnswer(patternLen) {\r\n for(var i=0;i= 60) {\n\t\t\t\treturn true;\n\t\t\t} else {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}","function betterThanAverage(classPoints, yourPoints) {\n return classPoints.reduce((a,b) => a + b)/classPoints.length < yourPoints ? true : false\n }","function macthCount(current, goal) {\n let matchC = 0;\n for (let i = 0; i < current.length; i++) {\n for (let j = 0; j < current[i].length; j++) {\n if (current[i][j] == goal[i][j]) {\n matchC++;\n }\n }\n }\n return (matchC==9)?true:false;\n}","function caml_greaterequal (x, y) { return +(caml_compare(x,y,false) >= 0); }","function isPassing(ratio) {\n if (ratio >= 7.99) {\n return \"Passing - Level AAA\";\n }\n else if (ratio >= 4.5) {\n return \"Passing - Level AA\";\n }\n else {\n return \"Failing\";\n }\n}","function solution(){\n primes = primeGenerator(10000000);\n for(let len=4173; len<30000; len+=2){\n let mat = generateSpiral(len);\n let values = getDiagonalValues(mat);\n let ratio = ratioOfPrimes(values, primes);\n console.log(\"len: \"+len+\" ratio: \"+ratio);\n if(ratio < 10.0){\n console.log(len);\n break;\n }\n }\n}","function countMatches(orders) {\r\n var matched = 0, dimension = orders[0].length\r\n while(matched < dimension) {\r\n for(var j=1; j {\n const rank = this.ranks[i];\n const size = this.sizes[i];\n const isRepr = parent === i;\n\n if (isRepr) {\n numRepr++;\n }\n\n const isParentInRange = 0 <= parent && parent < this.parents.length;\n const isReprRelevant = (isRepr || rank < this.ranks[parent]) &&\n (!isRepr && size === 0 || isRepr && size >= (1 << rank));\n const noAssertion = isParentInRange && isReprRelevant && 0 <= rank ;\n\n if (!noAssertion) {\n throw \"Assertion error\";\n }\n });\n\n if (!(0 <= this.numSets && this.numSets === numRepr && this.numSets <= this.parents.length)) {\n throw \"Assertion error\";\n }\n }","function isMatchPattern() {\n\tvar cards = $(\".card-flipped\");\n\tvar pattern = $(cards[0]).data(\"pattern\");\n\tvar anotherPattern = $(cards[1]).data(\"pattern\");\n\treturn (pattern == anotherPattern);\n}","isFullMatch() {\n for (let i = 0; i < this.result.length; i++) {\n if (this.result[i].result !== 'MATCH') {\n return false;\n }\n }\n\n return true;\n }","function comparePeaks(reference) {\n var result = 0, cutoff = reference.offset * 1.5;\n\n // Pairwise comparison\n _.each(histogramSorted, function (peak) {\n if (peak == reference) return;\n if (peak.offset < cutoff) return;\n\n // Calculate match value based on narrow window around integer ratios.\n var ratio = peak.offset / reference.offset,\n match = Math.max(0, 1 - Math.abs(ratio - Math.round(ratio)) * 8);\n\n // Scale by peak strength\n strength = peak.strength * peak.permanence * ratio;\n result += match * strength;\n });\n\n return result;\n }","function countMatches(orders) {\n var matched = 0, dimension = orders[0].length\n while(matched < dimension) {\n for(var j=1; j {\n return a-b;\n });\n console.log(l)\n\n let t = threshold**2;\n if (l[3]-l[4] ) return false;\n if (l[4] !== l[5]) return false;\n\n console.log(\"banana\")\n\n if (!(l[0] == l[1] &&\n l[1] == l[2] &&\n l[2] == l[3])) {\n return false;\n }\n\n return true;\n}","function similar(coords1, coords2, tolerance) {\n\t if (coords1.length !== coords2.length) {\n\t return false;\n\t }\n\n\t var n = coords1.length;\n\n\t var angles1 = angleMeasures(coords1);\n\t var angles2 = angleMeasures(coords2);\n\n\t var sides1 = sideLengths(coords1);\n\t var sides2 = sideLengths(coords2);\n\n\t for (var i = 0; i < 2 * n; i++) {\n\t var angles = angles2.slice();\n\t var sides = sides2.slice();\n\n\t // Reverse angles and sides to allow matching reflected polygons\n\t if (i >= n) {\n\t angles.reverse();\n\t sides.reverse();\n\t // Since sides are calculated from two coordinates,\n\t // simply reversing results in an off by one error\n\t sides = rotate(sides, 1);\n\t }\n\n\t angles = rotate(angles, i);\n\t sides = rotate(sides, i);\n\n\t if (deepEq(angles1, angles)) {\n\t var sidePairs = _.zip(sides1, sides);\n\n\t var factors = _.map(sidePairs, function (pair) {\n\t return pair[0] / pair[1];\n\t });\n\n\t var same = _.all(factors, function (factor) {\n\t return eq(factors[0], factor);\n\t });\n\n\t var congruentEnough = _.all(sidePairs, function (pair) {\n\t return knumber.equal(pair[0], pair[1], tolerance);\n\t });\n\n\t if (same && congruentEnough) {\n\t return true;\n\t }\n\t }\n\t }\n\n\t return false;\n\t}","function checkWin() {\n return match.length === 16;\n}","function areSimilar(a, b) {\n const values = {}; // values = {1: 0, 2: 0, 3: 0}\n let mismatches = 0; // mismatches = 0\n\n for (let i = 0; i < a.length; i++) { // i = 3, length = 3\n const value = a[i]; // value = 3\n if (values[value] > 0) {\n values[value] += 1;\n } else {\n values[value] = 1;\n }\n if (value !== b[i]) {\n mismatches++;\n }\n if (mismatches > 2) {\n return false;\n }\n }\n\n for (let i = 0; i < b.length; i++) { // i = 3, length = 3\n const value = b[i]; // value = 3\n if (values[value]) {\n values[value] -= 1;\n } else {\n return false;\n }\n }\n\n for (const key in values) { // key = 3\n if (values[key] !== 0) { // values.3 = 0\n return false;\n }\n }\n\n return true;\n}","function matchPriority(params) {\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\n if (!optional.length)\n return 0.000001;\n var matched = optional.filter(function (param) { return params[param.id]; });\n return matched.length / optional.length;\n }","function calculatePOSMatch(posPairDict, posTotalFreqs,\n\texpectedPairFreqs,expectedTotalFreqs) {\n\tvar chiSquaredDict = new Object();\n\tvar finalChiSquared = 0.0;\n\n\tvar totalWords = 0;\n\tfor (var key in posTotalFreqs) {\n\t\ttotalWords += posTotalFreqs[key];\n\t}\n\n\t// 3) using observed and expected frequencies, run a chi-squared test (for each POS) \n\t// 4) We can weight each chi-squared test by the frequency of each POS\n\tfor (var key in expectedPairFreqs) {\n\t\tvar expectedPosFreqs = expectedPairFreqs[key];\n\t\tvar chiSquaredValue = 0;\n\t\tfor(var key2 in expectedPosFreqs) {\n\t\t\tvar temp = Math.pow(expectedPosFreqs[key2] - posPairDict[key][key2], 2);\n\t\t\ttemp /= expectedPosFreqs[key2];\n\t\t\tchiSquaredValue += temp;\n\t\t}\n\t\tchiSquaredDict[key] = chiSquaredValue;\n\t\tfinalChiSquared += (chiSquaredValue) * (posTotalFreqs[key]) / totalWords;\n\t}\n\n\t// 5) Now that we have the final chi-squared static, calculate the probability\n\tvar prob = 1 - chi.cdf(finalChiSquared, Object.keys(posTotalFreqs).length * 5);\n\treturn prob;\n}","function calculateAccuracy(chances){\n var falseCount = 0;\n var trueCount = 0;\n\n chances.forEach(function(chance){\n if (chance.result){\n trueCount++;\n } else {\n falseCount++;\n }\n });\n\n return chances.length === 0 ? 0 : ((trueCount/chances.length) * 100);\n}","isContiguous() {\n for (let idx = 0; idx < this.dims; idx++) {\n const stride = this.strides[idx];\n const mod = this.mods[idx];\n\n if (idx === this.dims - 1) {\n if (stride !== 1) {\n return false;\n }\n } else if (stride !== this.mods[idx + 1]) {\n return false;\n }\n\n if (mod !== this.strides[idx] * this.shape[idx]) {\n return false;\n }\n }\n\n return true;\n }","function matchPriority(params) {\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\n if (!optional.length)\n return 0.000001;\n var matched = optional.filter(function (param) { return params[param.id]; });\n return matched.length / optional.length;\n }","function matchPriority(params) {\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\n if (!optional.length)\n return 0.000001;\n var matched = optional.filter(function (param) { return params[param.id]; });\n return matched.length / optional.length;\n }","function matchPriority(params) {\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\n if (!optional.length)\n return 0.000001;\n var matched = optional.filter(function (param) { return params[param.id]; });\n return matched.length / optional.length;\n }","function matchPriority(params) {\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\n if (!optional.length)\n return 0.000001;\n var matched = optional.filter(function (param) { return params[param.id]; });\n return matched.length / optional.length;\n }","nearPlotsFitRequirements(plots) {\n const nearFlavors = [0, 0, 0, 0, 0];\n plots.forEach(idx => {\n const plot = App.game.farming.plotList[idx];\n if (!plot.isUnlocked) {\n return;\n }\n if (plot.isEmpty()) {\n return;\n }\n if (plot.stage() < PlotStage.Taller) {\n return;\n }\n const berryFlavors = App.game.farming.berryData[plot.berry].flavors.map(x => x.value * this.flavorRatio[plot.stage() - 2]);\n for (let j = 0; j < 5; j++) {\n nearFlavors[j] += berryFlavors[j];\n }\n });\n return this.flavorReqs.every((value, idx) => value[0] <= nearFlavors[idx] && nearFlavors[idx] <= value[1]);\n }","nearPlotsFitRequirements(plots) {\n const nearFlavors = [0, 0, 0, 0, 0];\n plots.forEach(idx => {\n const plot = App.game.farming.plotList[idx];\n if (!plot.isUnlocked) {\n return;\n }\n if (plot.isEmpty()) {\n return;\n }\n if (plot.stage() < PlotStage.Taller) {\n return;\n }\n const berryFlavors = App.game.farming.berryData[plot.berry].flavors.map(x => x.value * this.flavorRatio[plot.stage() - 2]);\n for (let j = 0; j < 5; j++) {\n nearFlavors[j] += berryFlavors[j];\n }\n });\n return this.flavorReqs.every((value, idx) => value[0] <= nearFlavors[idx] && nearFlavors[idx] <= value[1]);\n }","get _isResized() {\n // Compare ratios. Very different includes IHM space.\n var heightRatio = _Global.document.documentElement.clientHeight / _Global.innerHeight,\n widthRatio = _Global.document.documentElement.clientWidth / _Global.innerWidth;\n\n // If they're nearly identical, then the view hasn't been resized for the IHM\n // Only check one bound because we know the IHM will make it shorter, not skinnier.\n return (widthRatio / heightRatio < 0.99);\n\n }","function isValidSize(size) {\n\tvar MIN_ASPECT = 1 / 3,\n\t\tMAX_ASPECT = 10,\n\t\tMIN_AREA = 100 * 100;\n\n\tvar aspect = size.height / size.width,\n\t\tarea = size.width * size.height;\n\n\treturn aspect > MIN_ASPECT &&\n\t\taspect < MAX_ASPECT &&\n\t\tarea > MIN_AREA;\n}","function ePaisagem(width, height) {\n\n return width > height\n}","function isRectangle() {\r\n // The total number of size 1x1 fields (in piece space) that\r\n // are occupied by the selected pieces:\r\n var occupiedFields = 0;\r\n for (var i in that.pieces) {\r\n var piece = that.pieces[i];\r\n occupiedFields += piece.widthP * piece.heightP;\r\n }\r\n return (occupiedFields == that.widthP * that.heightP);\r\n }","function checkPass(result) {\n let labMarks = result.labMarks ? result.labMarks : 0;\n return result.theoryMarks + labMarks >= 50;\n }","function isEqualSlices(totalNumSlice, numReciepients, slicesPerPerson) {\n if (numReciepients * slicesPerPerson > totalNumSlice) {\n console.log(`not enought slices`, false);\n } else {\n console.log(`enought slices`, true);\n }\n}","static IsGoodPosition(position) {\n if (position.length == 0) return false;\n const rows = position.split(\"/\");\n if (rows.length != V.size.x) return false;\n let kings = { \"k\": 0, \"K\": 0, 'l': 0, 'L': 0 };\n for (let row of rows) {\n let sumElts = 0;\n for (let i = 0; i < row.length; i++) {\n if (['K','k','L','l'].includes(row[i])) kings[row[i]]++;\n if (V.PIECES.includes(row[i].toLowerCase())) sumElts++;\n else {\n const num = parseInt(row[i], 10);\n if (isNaN(num)) return false;\n sumElts += num;\n }\n }\n if (sumElts != V.size.y) return false;\n }\n if (kings['k'] + kings['l'] != 1 || kings['K'] + kings['L'] != 1)\n return false;\n return true;\n }","function hasValidSampleSize() {\n return offsetSamples.length >= 5;\n }","nearPlotsFitRequirements(plots) {\n const currentReqs = {};\n plots.forEach((idx) => {\n const plot = App.game.farming.plotList[idx];\n if (plot.stage() !== PlotStage.Berry) {\n return;\n }\n if (!currentReqs[plot.berry]) {\n currentReqs[plot.berry] = 1;\n }\n else {\n currentReqs[plot.berry] += 1;\n }\n });\n return Object.keys(this.berryReqs).every(key => currentReqs[key] !== undefined && currentReqs[key] >= this.berryReqs[key]);\n }","function checkConsanginuity(fam_id, pers1_id, pers2_id)\n{\n var fam_map = familyMapOps.getFam(fam_id),\n pers1 = fam_map[pers1_id],\n pers2 = fam_map[pers2_id];\n\n // Find pers1 founder\n var routes2 = [];\n routes2.push( pers1 );\n routes2.push( pers2 );\n\n //console.log(\"routes2=\", pers1_id, pers2_id);\n\n // = [pers1, pers2];\n\n var complete = [],\n \tloopnum = 0;\n\n // console.log(pers1.id+\" and \"+pers2.id);\n while(routes2.length > 0 && loopnum++ < 100){\n\n \tvar perc = routes2.shift(); // remove from search\n\n/* \tif (perc === undefined){\n \t\t\n \t}\n*/\n \t//Try mother + father\n\t if (perc.mother === 0 && perc.father === 0){\n\t \tcomplete.push(perc.id);\n\t \tcontinue;\n\t }\n\n \tif (perc.mother != 0) routes2.push(perc.mother);\n \tif (perc.father != 0) routes2.push(perc.father);\n\n \t// console.log(\" routes=\", routes2.map( function(n){ return n.id;}));\n }\n // console.log(\"complete=\", complete);\n\n //Find duplicates in complete\n complete = complete.sort();\n for (var a=0; a < complete.length -1; a++){\n \tif (complete[a+1] === complete[a])\n \t\treturn true;\n }\n\n return false;\n}"],"string":"[\n \"function checkCounts(){\\n\\tfor(cat in landmarks){\\n\\t\\tif(landmarks[cat].length != targetCounts[cat]){\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\",\n \"compareDNA(pAeq2){\\n let count = 0;\\n dna.forEach((base1, index) => {\\n const base2 = pAeq2.dna[index];\\n if(base1 == base2){\\n count++;\\n }\\n });\\n let percent = (count/(dna.length+pAeq2.dna.length))*100;\\n percent = percent.toFixed(2);\\n console.log(`specimen #${this.specimenNum} and specimen #${pAeq2.specimenNum} have ${percent}% DNA in common.`)\\n }\",\n \"compareDNA(pAequor) {\\n let similarBases = 0;\\n for(let i = 0; i < 15; i++) {\\n if(this.dna[i] === pAequor.dna[i]) {\\n similarBases++;\\n }\\n }\\n const percentOfSimilarity = (similarBases / 15) * 100;\\n console.log(`specimen #${this.specimenNum} and specimen #${pAequor.specimenNum} have ${percentOfSimilarity.toFixed()}% DNA in common.`);\\n }\",\n \"function percentageLayout() {\\n // check subpixel layout supporting\\n var doc = document,\\n body = getBody(),\\n docOverflow = setFakeBody(body),\\n wrapper = doc.createElement('div'),\\n outer = doc.createElement('div'),\\n str = '',\\n count = 70,\\n perPage = 3,\\n supported = false;\\n\\n wrapper.className = \\\"tns-t-subp2\\\";\\n outer.className = \\\"tns-t-ct\\\";\\n\\n for (var i = 0; i < count; i++) {\\n str += '';\\n }\\n\\n outer.innerHTML = str;\\n wrapper.appendChild(outer);\\n body.appendChild(wrapper);\\n\\n supported = Math.abs(wrapper.getBoundingClientRect().left - outer.children[count - perPage].getBoundingClientRect().left) < 2;\\n\\n body.fake ? resetFakeBody(body, docOverflow) : wrapper.remove();\\n\\n return supported;\\n}\",\n \"compareDna (pAequor) {\\n let identicalResults = 0;\\n for (let i = 0; i < 15; i++) {\\n if (this.dna[i] === pAequor.dna[i]) {\\n identicalResults += 1;\\n } \\n }\\n const percentage = identicalResults / this.dna.length * 100;\\n console.log(`Specimen ${this.specimenNum} and specimen ${pAequor.specimenNum} have ${percentage.toFixed \\n (2)}% in common.`);\\n }\",\n \"compareDNA(obj) { \\n //identical variable is the number of duplicates per index of both this.dna and obj.dna arrays\\n let identical = 0\\n this.dna.forEach( (element, index) => element === obj.dna[index] ? identical++ : identical += 0)\\n\\n //percentage variable, of course finds the percentage of duplicates both arrays\\n let percentage = Math.floor(identical / this.dna.length * 100)\\n\\n return `specimen #1 and specimen #2 have ${percentage}% DNA in common.`\\n }\",\n \"willLikelySurvive() {\\n let returnPercentage = 0;\\n this.dna.forEach(item => item === 'C' || item === 'G' ? returnPercentage += 1/this.dna.length : '');\\n return returnPercentage >= .6 ? true : false;\\n }\",\n \"willLikelySurvive() {\\n let NumOfCs = 0;\\n let NumOfGs = 0;\\n\\n this.dna.forEach(base => {\\n if(base === 'C') {\\n NumOfCs++;\\n } else if(base === 'G') {\\n NumOfGs++;\\n }\\n });\\n\\n const percentOfCs = NumOfCs / 15 * 100;\\n const percentOfGs = NumOfGs / 15 * 100;\\n\\n if(percentOfCs >= 60 || percentOfGs >= 60) {\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"function improvesRatio(currentrow, nextnode, length) {\\n var newrow;\\n\\n if (currentrow.length === 0) {\\n return true;\\n }\\n\\n newrow = currentrow.slice();\\n newrow.push(nextnode);\\n var currentratio = calculateRatio(currentrow, length);\\n var newratio = calculateRatio(newrow, length); // the pseudocode in the Bruls paper has the direction of the comparison\\n // wrong, this is the correct one.\\n\\n return currentratio >= newratio;\\n } // calculateRatio - calculates the maximum width to height ratio of the\",\n \"compareDnaV2 (pAequor) {\\n const result = this.dna.reduce((acc, curr, idx, arr) => {\\n if (arr[idx] === pAequor.dna[idx]) {\\n return acc + 1;\\n }\\n else {\\n return acc;\\n }\\n }, 0)\\n const percentage2 = result / this.dna.length * 100;\\n return `Specimen ${this.specimenNum} and specimen ${pAequor.specimenNum} have ${percentage2.toFixed \\n (2)}% in common.`\\n }\",\n \"compareDNA(specimen) {\\n let matches = 0\\n this.dna.forEach((element, currentIndex) => {\\n if (element === specimen.dna[currentIndex]) {\\n matches++\\n console.log(`${this.dna[currentIndex]} matches ${specimen.dna[currentIndex]} at ${currentIndex}`)\\n }\\n })\\n if (matches > 0) {\\n console.log (`Specimens have ${Math.floor((matches / this.dna.length) * 100)}% DNA in common.`)\\n } else {\\n console.log(\\\"No matches were found.\\\")\\n console.log (\\\"Specimens don't have DNA in common.\\\")\\n }\\n }\",\n \"compareDNA(pAequor) {\\n\\t\\t\\tlet curr = this.dna;\\n\\t\\t\\tlet past = pAequor.dna;\\n\\t\\t\\tlet cnt = 0;\\n\\t\\t\\tfor(let i = 0; i < curr.length; i++) {\\n\\t\\t\\t\\tif(curr[i] === past[i]) {\\n\\t\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tlet perc = (cnt/(curr.length) * 100).toFixed(2);\\n\\t\\t\\tconsole.log(`specimen #1 and specimen #2 have ${perc}% DNA in common`);\\n\\t\\t}\",\n \"function IsFittingCount(x, syllables) {\\n return x.length == syllables;\\n}\",\n \"function isApproximately(a, b, withinPercent) {\\n let percent = a / b * 100;\\n Phoenix.log(percent);\\n return percent > 100 - withinPercent && percent < 100 + withinPercent \\n}\",\n \"function matchCheck(){\\n return (points == match);\\n }\",\n \"function perfect (x) {\\r\\n var module = x.module, pref = maxSize(x);\\r\\n if ( isVertical(x) ) {return Math.abs(pref.width - module.width()) < tolerance;} \\r\\n if ( isHorizontal(x) ) {return Math.abs(pref.height - module.height()) < tolerance;}\\r\\n return true;\\r\\n }\",\n \"function matchQuality (text, query) {\\n const terms = tokenize(query)\\n const termsLength = terms.map(term => term.length).reduce((x, y) => x + y, 0)\\n\\n const quality = termsLength / text.length\\n // Add bonus points if the query matches text at the very start.\\n const bonus = startsWith(text, terms[0]) ? 1 : 0\\n\\n return quality + bonus\\n}\",\n \"function checkOverlap (shifts) {\\n var width = 0;\\n _.each(shifts, function (shift, i) {\\n width += (shift.end-shift.start)\\n });\\n if (width > 1440) {\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"static selectionsSameMeasure(selections) {\\n let i = 0;\\n if (selections.length < 2) {\\n return true;\\n }\\n const sel1 = selections[0].selector;\\n for (i = 1; i < selections.length; ++i) {\\n if (!SmoSelector.sameMeasure(sel1, selections[i].selector)) {\\n return false;\\n }\\n }\\n return true;\\n }\",\n \"function betterThanAverage(classPoints, yourPoints) {\\n \\n let mediaClassPoints = classPoints.reduce((a,b) => a + b, 0) / classPoints.length;\\n if((mediaClassPoints + yourPoints) / 2 <= yourPoints) {return true;}\\n return false;\\n}\",\n \"function checkSimilarTags(prefixArr){\\n var isDifferent = false;\\n for(var i = 0; i < queue[0].length; i++){\\n if(arraysEqual(queue[0][i], prefixArr[0]) && !isDifferent){\\n if(i / queue[0].length < Config.THRESHOLD_PERCENTAGE){\\n isDifferent = true;\\n }\\n }\\n }\\n for(var i=0; i {\\n if(base === 'C' || base === 'G'){\\n surviveCount++;\\n }\\n });\\n let survivePercent = (surviveCount/dna.length)*100;\\n if(survivePercent >= 60) {\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"function countDuplicates(text) {\\n const splitted = text.split(/\\\\s+/g);\\n const wordcount = new Set(splitted).size;\\n const ratio = wordcount / splitted.length;\\n\\n if (wordcount > 0 && ratio < 0.1)\\n return true;\\n else if (wordcount > 0 && text.length / wordcount > 300)\\n return true;\\n else\\n return false;\\n}\",\n \"willLikelySurvive() {\\n // Use .filter() method to create new array containing only C/G elements\\n const cOrG = this.dna.filter((el) => el === 'C' || el === 'G');\\n // Divide length of newly filtered C/G array by length of original DNA array\\n // If >= sixty percent, return true - If not, return false\\n return cOrG.length / this.dna.length >= 0.6;\\n }\",\n \"function charCountCompabilityCheck(seqs) {\\n\\tvar positionArray = new Array(seqs[0].length);\\n\\t// Create a base counter for each position:\\n\\tfor(var i = 0, n = seqs[0].length; i < n; i++) {\\n\\t\\tpositionArray[i] = {A:0, T:0, G:0, C:0};\\n\\t}\\n\\t// Iterate over all sequences:\\n\\tvar seq;\\n\\tfor(var i = 0, n = seqs.length; i < n ; i++) {\\n\\t\\tseq = seqs[i];\\n\\t\\t// Iterate over all positions in current sequence:\\n\\t\\tfor(var j = 0, m = seq.length; j < m; j++) {\\n\\t\\t\\t// Add one to the count for the base in this position:\\n\\t\\t\\tpositionArray[j][seq[j]] += 1;\\n\\t\\t}\\n\\t}\\n\\t// Sum channel distribution:\\n\\tvar green;\\n\\tvar red;\\n\\tfor(var i = 0, n = seqs[0].length; i < n ; i++) {\\n\\t\\tgreen = positionArray[i].T + positionArray[i].G;\\n\\t\\tred = positionArray[i].A + positionArray[i].C;\\n\\t}\\n\\treturn (green > 0 && red > 0);\\n}\",\n \"function matchCompare(matchRequirement, ingredients, availableIngredients) {\\n var matches;\\n var matchPercent = 100 * (matches / ingredients.length());\\n \\n for (var i = 0; i < ingredients.length(); i++) {\\n for (var j = 0; j < availableIngredients.length(); j++) {\\n if (ingredients[i] == availableIngredients[j]) {\\n matches++;\\n }\\n }\\n }\\n \\n if (matchPercent < matchRequirement) {\\n return false;\\n }\\n \\n return true;\\n}\",\n \"function checkRepeats() {\\n var v_ctr;\\n for (v_ctr=0; v_ctr<7; v_ctr++) {\\n/* console.log(\\\"340 [\\\" + v_ctr + \\\"] [\\\" +\\n a_scaleNotes[v_ctr].substr(0,1) + \\\"] [\\\" +\\n a_scaleNotes[(v_ctr + 1) % 7].substr(0,1) + \\\"]\\\");\\n*/\\n if (a_scaleNotes[v_ctr].substr(0,1) == a_scaleNotes[(v_ctr + 1) % 7].substr(0,1))\\n return true;\\n }\\n return false;\\n}\",\n \"function checkPerms(s1, s2) { //case-sensitive; assume whitespace is significant; only ASCII inputs\\n\\tvar l1 = s1.length;\\n\\tvar l2 = s2.length;\\n\\tif (l1 !== l2) return false;\\n\\n\\tvar chars = {};\\n\\tfor (var i = 0, l = l1; i < l; i++) {\\n\\t\\tif (chars[s1[i]]) chars[s1[i]] += 1;\\n\\t\\telse chars[s1[i]] = 1;\\n\\t}\\n\\tfor (var i = 0, l = l2; i < l; i++) {\\n\\t\\tif (chars[s2[i]]) chars[s2[i]] -= 1;\\n\\t\\telse return false;\\n\\n\\t\\tif (chars[s2[i]] < 0) return false;\\n\\t}\\n\\treturn true;\\n}\",\n \"function boolpercent(arr) {\\n\\tvar count = 0;\\n\\tfor (var i=0; i=0) \\n similarilty_count++;\\n }\\n if (arr1[0] ===arr2[0] && similarilty_count/arr1.length > SIMILAR_THRESHOLD) return true; \\n return false;\\n }\",\n \"settled(arr) {\\n for (let i = 0; i < arr.length; i++) {\\n if (Math.abs(arr[i]) > 0.1) {\\n return false;\\n }\\n }\\n return true;\\n }\",\n \"function same(p0, p1) {\\n return (Math.abs(p0[0] - p1[0]) < 1e-9 && Math.abs(p0[1] - p1[1]) < 1e-9);\\n}\",\n \"function isCorrectPercentage(){\\n let x = table.children[0];\\n let theSpot;\\n let leftD, leftM, leftU, upM, rightU, rightM, rightD, downM;\\n for(let i=0; i= threshold) {\\n return true;\\n } else {\\n return false;\\n }\\n}\",\n \"willLikelySurvive() {\\n let count = 0;\\n for (let i = 0; i < this.dna.length; i++) {\\n if (this.dna[i] === \\\"C\\\" || this.dna[i] === \\\"G\\\") {\\n count++;\\n }\\n }\\n if ((count * 100) / this.dna.length >= 60) {\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"function checkExactish(widthTarget, width, heightTarget, height) {\\n\\tconst targetAspect = parseFloat(widthTarget / heightTarget).toFixed(2)\\n\\tconst aspect = parseFloat(width / height).toFixed(2)\\n\\n\\tconst isValid = (widthTarget <= width) &&\\n\\t\\t(heightTarget <= height) &&\\n\\t\\t(targetAspect === aspect)\\n\\n\\treturn isValid\\n}\",\n \"validate(pwd){\\n this._maxLength = 0;\\n this._leastTransformations = 10;\\n for(let keyboard of this.keyboards){\\n try{\\n this._transformationsDone = [];\\n const length = this._snakeLength(pwd, keyboard);\\n if (length > this._maxLength){\\n this._maxLength = length;\\n\\n if (this._transformationsDone.length < this._leastTransformations){\\n this._leastTransformations = this._transformationsDone.length;\\n }\\n }\\n } finally {\\n this._transformationsDone = [];\\n }\\n }\\n\\n this._percentage = this._maxLength / pwd.length;\\n\\n return !(this._percentage >= this.minPercentage && this._leastTransformations <= 5);\\n }\",\n \"function segmentSizesValid(segments){\\r\\n var totsize=0;\\r\\n for(var j=0; jmainMemorySize){\\r\\n return false;\\r\\n }else{\\r\\n return true;\\r\\n }\\r\\n}\",\n \"function calculeScores() {\\n var width = canvas.width / ratio;\\n var height = canvas.height / ratio;\\n pigs.forEach((p) => {\\n if ((birdX + birdWidth - tolerance > p.centerX - p.radius) && (birdX + tolerance < p.centerX + p.radius)) {\\n if ((birdY + birdHeight - tolerance > p.centerY - p.radius) && (birdY + tolerance < p.centerY + p.radius)) {\\n scoreSound.play();\\n score += 2;\\n p.centerX = canvas.width / ratio;\\n p.centerY = Math.floor(Math.random() * (height - flowHeight - flowHeight + 1) + flowHeight);\\n }\\n }\\n })\\n}\",\n \"function shouldUse() {\\n var show = data[questionPos][\\\"show_number\\\"];\\n var toTake = (questionPos % 4) + 1;\\n return ((parseInt(show.charCodeAt(toTake)) % g) >= (g / 3));\\n }\",\n \"function sameFrequencyPattern(arr1, arr2){\\n const n1 = arr1.length\\n const n2 = arr2.length\\n if( n1 !== n2 ) return false\\n\\n // calculates the frequencies of each table\\n const frequencyCounter1 = arr1.reduce((acc,v) => ({ ...acc, [v]:(acc[v]||0)+1 }),{})\\n const frequencyCounter2 = arr2.reduce((acc,v) => ({ ...acc, [v]:(acc[v]||0)+1 }),{})\\n\\n for(let key in frequencyCounter1){\\n // if a number in array 1 (squared) does not exists in array 2 then return false\\n if(!(key ** 2 in frequencyCounter2)) return false\\n // if the frequencies between between the values do not match return false\\n if(frequencyCounter2[key**2] !== frequencyCounter1[key]) return false\\n }\\n\\n return true\\n}\",\n \"function checkMatches(drawData) {\\n const { winningNumbers, drawedSets} = drawData;\\n //const numAmount = winningNumbers.size;\\n for (set of drawedSets) {\\n set.match = 0;\\n for (let num of set.numbers) {\\n if (winningNumbers.includes(num)) {\\n set.match++;\\n }\\n }\\n }\\n //console.log(winningNumbers, drawedSets);\\n}\",\n \"function countMatches(orders) {\\r\\n\\t var matched = 0, dimension = orders[0].length\\r\\n\\t while(matched < dimension) {\\r\\n\\t for(var j=1; j delta) {\\n return false;\\n }\\n }\\n return true;\\n}\",\n \"function patternCheckOrientation(pattern, targetCell, qualityGoal, weight, orientation) {\\n var forwardFacingCells = FWD_CELLS[targetCell];\\n var totalDiscrepancies = 0;\\n DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\\\"Enter pCO([\\\" + pattern + \\\"]; \\\" + targetCell + \\\", \\\" + qualityGoal + \\\", \\\" + weight + \\\", \\\" + orientation + \\\"); compass: \\\" + compass);\\n fwdWrong = [];\\n rearWrong = [];\\n if ((Array.isArray(pattern[POS_CENTER]) && !pattern[POS_CENTER][myColor]) ||\\n\\t((pattern[POS_CENTER] > 0) && (myColor != pattern[POS_CENTER]))) {\\n\\tif (forwardFacingCells[POS_CENTER]) { // always true, in fact\\n\\t fwdWrong.push({p:POS_CENTER, v:POS_CENTER});\\n\\t totalDiscrepancies += 1;\\n\\t} else {\\n\\t rearWrong.push({p:POS_CENTER, v:POS_CENTER});\\n\\t totalDiscrepancies += weight;\\n\\t}\\n }\\n if ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\\n\\tDEBUG_PATTERN_CHECK_VERBOSELY && debugme(\\\"--- too bad\\\");\\n\\treturn PAT_NOMATCH;\\n }\\n var jFrom = 0;\\n switch (targetCell) {\\n case AIM_UP:\\n\\tjFrom = 4;\\n\\tbreak;\\n case AIM_LEFT:\\n\\tjFrom = 6;\\n\\tbreak;\\n case AIM_RIGHT:\\n\\tjFrom = 2;\\n\\tbreak;\\n case AIM_DOWN:\\n case POS_CENTER:\\n default:\\n\\tbreak;\\n }\\n for (var j = jFrom; j < TOTAL_NBRS + jFrom; j++) {\\n\\tvar posP = CCW[j];\\n\\tvar posV = CCW[orientation + j];\\n\\tvar c = view[posV].color;\\n\\tif ((Array.isArray(pattern[posP]) && !pattern[posP][c]) ||\\n\\t ((pattern[posP] > 0) && (c != pattern[posP]))) {\\n\\t if (forwardFacingCells[posP]) {\\n\\t\\tfwdWrong.push({p:posP, v:posV});\\n\\t\\t// #future# If it should ever be needed, we could push j as a\\n\\t\\t// third member of these objects (its absence indicating the\\n\\t\\t// center cell).\\n\\t\\ttotalDiscrepancies += 1;\\n\\t } else {\\n\\t\\trearWrong.push({p:posP, v:posV});\\n\\t\\ttotalDiscrepancies += weight;\\n\\t }\\n\\t}\\n\\tif ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\\n\\t DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\\\"--- too bad\\\");\\n\\t return PAT_NOMATCH;\\n\\t}\\n }\\n // Assert: totalDiscrepancies == fwdWrong.length + rearWrong.length;\\n // Assert: If compass < 0, then totalDiscrepancies <= qualityGoal\\n debugme(\\\"-> total \\\" + totalDiscrepancies + \\\" weighted discrepancies found.\\\");\\n if ((compass < 0)\\n\\t// && (totalDiscrepancies <= qualityGoal)\\n ) {\\n\\tcompass = orientation;\\n }\\n if (DEBUGME[myType]) {\\n\\t// Bypass the single-arg debugme() in order to get the objects printed.\\n\\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\\\"forwardD: [\\\", fwdWrong, \\\"]\\\");\\n\\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\\\"rearD: [\\\", rearWrong, \\\"]\\\");\\n }\\n if (fwdWrong.length == 0) {\\n\\treturn (totalDiscrepancies);\\n } else {\\n\\treturn (-totalDiscrepancies);\\n }\\n}\",\n \"function calc_conf_score(input_set, master_paragraph){\\n\\n let num_same_words = 0;\\n // clean string and split by spaces\\n let master_paragraph_split = master_paragraph.toLowerCase().replace(/[.,\\\\/#!$%\\\\^&\\\\*;:{}=\\\\-_`~()]/g,\\\"\\\").replace(/\\\\s{2,}/g,\\\" \\\").split(\\\" \\\");\\n let master_paragraph_split_filtered = master_paragraph_split.filter((x)=>!unimportant_words.has(x));\\n let num_words_paragraph = master_paragraph_split_filtered.length;\\n\\n for(var i = 0; i < master_paragraph_split_filtered.length; i++){\\n if (input_set.has(master_paragraph_split_filtered[i])){\\n num_same_words++;\\n }\\n }\\n return (num_same_words / num_words_paragraph);\\n}\",\n \"campare(a, b) {\\n const EPS = 0.1;\\n if (Math.abs(Math.abs(a) - Math.abs(b)) < EPS) {\\n return true;\\n }\\n return false;\\n }\",\n \"function checkAnswer(patternLen) {\\r\\n for(var i=0;i= 60) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function betterThanAverage(classPoints, yourPoints) {\\n return classPoints.reduce((a,b) => a + b)/classPoints.length < yourPoints ? true : false\\n }\",\n \"function macthCount(current, goal) {\\n let matchC = 0;\\n for (let i = 0; i < current.length; i++) {\\n for (let j = 0; j < current[i].length; j++) {\\n if (current[i][j] == goal[i][j]) {\\n matchC++;\\n }\\n }\\n }\\n return (matchC==9)?true:false;\\n}\",\n \"function caml_greaterequal (x, y) { return +(caml_compare(x,y,false) >= 0); }\",\n \"function isPassing(ratio) {\\n if (ratio >= 7.99) {\\n return \\\"Passing - Level AAA\\\";\\n }\\n else if (ratio >= 4.5) {\\n return \\\"Passing - Level AA\\\";\\n }\\n else {\\n return \\\"Failing\\\";\\n }\\n}\",\n \"function solution(){\\n primes = primeGenerator(10000000);\\n for(let len=4173; len<30000; len+=2){\\n let mat = generateSpiral(len);\\n let values = getDiagonalValues(mat);\\n let ratio = ratioOfPrimes(values, primes);\\n console.log(\\\"len: \\\"+len+\\\" ratio: \\\"+ratio);\\n if(ratio < 10.0){\\n console.log(len);\\n break;\\n }\\n }\\n}\",\n \"function countMatches(orders) {\\r\\n var matched = 0, dimension = orders[0].length\\r\\n while(matched < dimension) {\\r\\n for(var j=1; j {\\n const rank = this.ranks[i];\\n const size = this.sizes[i];\\n const isRepr = parent === i;\\n\\n if (isRepr) {\\n numRepr++;\\n }\\n\\n const isParentInRange = 0 <= parent && parent < this.parents.length;\\n const isReprRelevant = (isRepr || rank < this.ranks[parent]) &&\\n (!isRepr && size === 0 || isRepr && size >= (1 << rank));\\n const noAssertion = isParentInRange && isReprRelevant && 0 <= rank ;\\n\\n if (!noAssertion) {\\n throw \\\"Assertion error\\\";\\n }\\n });\\n\\n if (!(0 <= this.numSets && this.numSets === numRepr && this.numSets <= this.parents.length)) {\\n throw \\\"Assertion error\\\";\\n }\\n }\",\n \"function isMatchPattern() {\\n\\tvar cards = $(\\\".card-flipped\\\");\\n\\tvar pattern = $(cards[0]).data(\\\"pattern\\\");\\n\\tvar anotherPattern = $(cards[1]).data(\\\"pattern\\\");\\n\\treturn (pattern == anotherPattern);\\n}\",\n \"isFullMatch() {\\n for (let i = 0; i < this.result.length; i++) {\\n if (this.result[i].result !== 'MATCH') {\\n return false;\\n }\\n }\\n\\n return true;\\n }\",\n \"function comparePeaks(reference) {\\n var result = 0, cutoff = reference.offset * 1.5;\\n\\n // Pairwise comparison\\n _.each(histogramSorted, function (peak) {\\n if (peak == reference) return;\\n if (peak.offset < cutoff) return;\\n\\n // Calculate match value based on narrow window around integer ratios.\\n var ratio = peak.offset / reference.offset,\\n match = Math.max(0, 1 - Math.abs(ratio - Math.round(ratio)) * 8);\\n\\n // Scale by peak strength\\n strength = peak.strength * peak.permanence * ratio;\\n result += match * strength;\\n });\\n\\n return result;\\n }\",\n \"function countMatches(orders) {\\n var matched = 0, dimension = orders[0].length\\n while(matched < dimension) {\\n for(var j=1; j {\\n return a-b;\\n });\\n console.log(l)\\n\\n let t = threshold**2;\\n if (l[3]-l[4] ) return false;\\n if (l[4] !== l[5]) return false;\\n\\n console.log(\\\"banana\\\")\\n\\n if (!(l[0] == l[1] &&\\n l[1] == l[2] &&\\n l[2] == l[3])) {\\n return false;\\n }\\n\\n return true;\\n}\",\n \"function similar(coords1, coords2, tolerance) {\\n\\t if (coords1.length !== coords2.length) {\\n\\t return false;\\n\\t }\\n\\n\\t var n = coords1.length;\\n\\n\\t var angles1 = angleMeasures(coords1);\\n\\t var angles2 = angleMeasures(coords2);\\n\\n\\t var sides1 = sideLengths(coords1);\\n\\t var sides2 = sideLengths(coords2);\\n\\n\\t for (var i = 0; i < 2 * n; i++) {\\n\\t var angles = angles2.slice();\\n\\t var sides = sides2.slice();\\n\\n\\t // Reverse angles and sides to allow matching reflected polygons\\n\\t if (i >= n) {\\n\\t angles.reverse();\\n\\t sides.reverse();\\n\\t // Since sides are calculated from two coordinates,\\n\\t // simply reversing results in an off by one error\\n\\t sides = rotate(sides, 1);\\n\\t }\\n\\n\\t angles = rotate(angles, i);\\n\\t sides = rotate(sides, i);\\n\\n\\t if (deepEq(angles1, angles)) {\\n\\t var sidePairs = _.zip(sides1, sides);\\n\\n\\t var factors = _.map(sidePairs, function (pair) {\\n\\t return pair[0] / pair[1];\\n\\t });\\n\\n\\t var same = _.all(factors, function (factor) {\\n\\t return eq(factors[0], factor);\\n\\t });\\n\\n\\t var congruentEnough = _.all(sidePairs, function (pair) {\\n\\t return knumber.equal(pair[0], pair[1], tolerance);\\n\\t });\\n\\n\\t if (same && congruentEnough) {\\n\\t return true;\\n\\t }\\n\\t }\\n\\t }\\n\\n\\t return false;\\n\\t}\",\n \"function checkWin() {\\n return match.length === 16;\\n}\",\n \"function areSimilar(a, b) {\\n const values = {}; // values = {1: 0, 2: 0, 3: 0}\\n let mismatches = 0; // mismatches = 0\\n\\n for (let i = 0; i < a.length; i++) { // i = 3, length = 3\\n const value = a[i]; // value = 3\\n if (values[value] > 0) {\\n values[value] += 1;\\n } else {\\n values[value] = 1;\\n }\\n if (value !== b[i]) {\\n mismatches++;\\n }\\n if (mismatches > 2) {\\n return false;\\n }\\n }\\n\\n for (let i = 0; i < b.length; i++) { // i = 3, length = 3\\n const value = b[i]; // value = 3\\n if (values[value]) {\\n values[value] -= 1;\\n } else {\\n return false;\\n }\\n }\\n\\n for (const key in values) { // key = 3\\n if (values[key] !== 0) { // values.3 = 0\\n return false;\\n }\\n }\\n\\n return true;\\n}\",\n \"function matchPriority(params) {\\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\\n if (!optional.length)\\n return 0.000001;\\n var matched = optional.filter(function (param) { return params[param.id]; });\\n return matched.length / optional.length;\\n }\",\n \"function calculatePOSMatch(posPairDict, posTotalFreqs,\\n\\texpectedPairFreqs,expectedTotalFreqs) {\\n\\tvar chiSquaredDict = new Object();\\n\\tvar finalChiSquared = 0.0;\\n\\n\\tvar totalWords = 0;\\n\\tfor (var key in posTotalFreqs) {\\n\\t\\ttotalWords += posTotalFreqs[key];\\n\\t}\\n\\n\\t// 3) using observed and expected frequencies, run a chi-squared test (for each POS) \\n\\t// 4) We can weight each chi-squared test by the frequency of each POS\\n\\tfor (var key in expectedPairFreqs) {\\n\\t\\tvar expectedPosFreqs = expectedPairFreqs[key];\\n\\t\\tvar chiSquaredValue = 0;\\n\\t\\tfor(var key2 in expectedPosFreqs) {\\n\\t\\t\\tvar temp = Math.pow(expectedPosFreqs[key2] - posPairDict[key][key2], 2);\\n\\t\\t\\ttemp /= expectedPosFreqs[key2];\\n\\t\\t\\tchiSquaredValue += temp;\\n\\t\\t}\\n\\t\\tchiSquaredDict[key] = chiSquaredValue;\\n\\t\\tfinalChiSquared += (chiSquaredValue) * (posTotalFreqs[key]) / totalWords;\\n\\t}\\n\\n\\t// 5) Now that we have the final chi-squared static, calculate the probability\\n\\tvar prob = 1 - chi.cdf(finalChiSquared, Object.keys(posTotalFreqs).length * 5);\\n\\treturn prob;\\n}\",\n \"function calculateAccuracy(chances){\\n var falseCount = 0;\\n var trueCount = 0;\\n\\n chances.forEach(function(chance){\\n if (chance.result){\\n trueCount++;\\n } else {\\n falseCount++;\\n }\\n });\\n\\n return chances.length === 0 ? 0 : ((trueCount/chances.length) * 100);\\n}\",\n \"isContiguous() {\\n for (let idx = 0; idx < this.dims; idx++) {\\n const stride = this.strides[idx];\\n const mod = this.mods[idx];\\n\\n if (idx === this.dims - 1) {\\n if (stride !== 1) {\\n return false;\\n }\\n } else if (stride !== this.mods[idx + 1]) {\\n return false;\\n }\\n\\n if (mod !== this.strides[idx] * this.shape[idx]) {\\n return false;\\n }\\n }\\n\\n return true;\\n }\",\n \"function matchPriority(params) {\\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\\n if (!optional.length)\\n return 0.000001;\\n var matched = optional.filter(function (param) { return params[param.id]; });\\n return matched.length / optional.length;\\n }\",\n \"function matchPriority(params) {\\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\\n if (!optional.length)\\n return 0.000001;\\n var matched = optional.filter(function (param) { return params[param.id]; });\\n return matched.length / optional.length;\\n }\",\n \"function matchPriority(params) {\\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\\n if (!optional.length)\\n return 0.000001;\\n var matched = optional.filter(function (param) { return params[param.id]; });\\n return matched.length / optional.length;\\n }\",\n \"function matchPriority(params) {\\n var optional = urlMatcher.parameters().filter(function (param) { return param.isOptional; });\\n if (!optional.length)\\n return 0.000001;\\n var matched = optional.filter(function (param) { return params[param.id]; });\\n return matched.length / optional.length;\\n }\",\n \"nearPlotsFitRequirements(plots) {\\n const nearFlavors = [0, 0, 0, 0, 0];\\n plots.forEach(idx => {\\n const plot = App.game.farming.plotList[idx];\\n if (!plot.isUnlocked) {\\n return;\\n }\\n if (plot.isEmpty()) {\\n return;\\n }\\n if (plot.stage() < PlotStage.Taller) {\\n return;\\n }\\n const berryFlavors = App.game.farming.berryData[plot.berry].flavors.map(x => x.value * this.flavorRatio[plot.stage() - 2]);\\n for (let j = 0; j < 5; j++) {\\n nearFlavors[j] += berryFlavors[j];\\n }\\n });\\n return this.flavorReqs.every((value, idx) => value[0] <= nearFlavors[idx] && nearFlavors[idx] <= value[1]);\\n }\",\n \"nearPlotsFitRequirements(plots) {\\n const nearFlavors = [0, 0, 0, 0, 0];\\n plots.forEach(idx => {\\n const plot = App.game.farming.plotList[idx];\\n if (!plot.isUnlocked) {\\n return;\\n }\\n if (plot.isEmpty()) {\\n return;\\n }\\n if (plot.stage() < PlotStage.Taller) {\\n return;\\n }\\n const berryFlavors = App.game.farming.berryData[plot.berry].flavors.map(x => x.value * this.flavorRatio[plot.stage() - 2]);\\n for (let j = 0; j < 5; j++) {\\n nearFlavors[j] += berryFlavors[j];\\n }\\n });\\n return this.flavorReqs.every((value, idx) => value[0] <= nearFlavors[idx] && nearFlavors[idx] <= value[1]);\\n }\",\n \"get _isResized() {\\n // Compare ratios. Very different includes IHM space.\\n var heightRatio = _Global.document.documentElement.clientHeight / _Global.innerHeight,\\n widthRatio = _Global.document.documentElement.clientWidth / _Global.innerWidth;\\n\\n // If they're nearly identical, then the view hasn't been resized for the IHM\\n // Only check one bound because we know the IHM will make it shorter, not skinnier.\\n return (widthRatio / heightRatio < 0.99);\\n\\n }\",\n \"function isValidSize(size) {\\n\\tvar MIN_ASPECT = 1 / 3,\\n\\t\\tMAX_ASPECT = 10,\\n\\t\\tMIN_AREA = 100 * 100;\\n\\n\\tvar aspect = size.height / size.width,\\n\\t\\tarea = size.width * size.height;\\n\\n\\treturn aspect > MIN_ASPECT &&\\n\\t\\taspect < MAX_ASPECT &&\\n\\t\\tarea > MIN_AREA;\\n}\",\n \"function ePaisagem(width, height) {\\n\\n return width > height\\n}\",\n \"function isRectangle() {\\r\\n // The total number of size 1x1 fields (in piece space) that\\r\\n // are occupied by the selected pieces:\\r\\n var occupiedFields = 0;\\r\\n for (var i in that.pieces) {\\r\\n var piece = that.pieces[i];\\r\\n occupiedFields += piece.widthP * piece.heightP;\\r\\n }\\r\\n return (occupiedFields == that.widthP * that.heightP);\\r\\n }\",\n \"function checkPass(result) {\\n let labMarks = result.labMarks ? result.labMarks : 0;\\n return result.theoryMarks + labMarks >= 50;\\n }\",\n \"function isEqualSlices(totalNumSlice, numReciepients, slicesPerPerson) {\\n if (numReciepients * slicesPerPerson > totalNumSlice) {\\n console.log(`not enought slices`, false);\\n } else {\\n console.log(`enought slices`, true);\\n }\\n}\",\n \"static IsGoodPosition(position) {\\n if (position.length == 0) return false;\\n const rows = position.split(\\\"/\\\");\\n if (rows.length != V.size.x) return false;\\n let kings = { \\\"k\\\": 0, \\\"K\\\": 0, 'l': 0, 'L': 0 };\\n for (let row of rows) {\\n let sumElts = 0;\\n for (let i = 0; i < row.length; i++) {\\n if (['K','k','L','l'].includes(row[i])) kings[row[i]]++;\\n if (V.PIECES.includes(row[i].toLowerCase())) sumElts++;\\n else {\\n const num = parseInt(row[i], 10);\\n if (isNaN(num)) return false;\\n sumElts += num;\\n }\\n }\\n if (sumElts != V.size.y) return false;\\n }\\n if (kings['k'] + kings['l'] != 1 || kings['K'] + kings['L'] != 1)\\n return false;\\n return true;\\n }\",\n \"function hasValidSampleSize() {\\n return offsetSamples.length >= 5;\\n }\",\n \"nearPlotsFitRequirements(plots) {\\n const currentReqs = {};\\n plots.forEach((idx) => {\\n const plot = App.game.farming.plotList[idx];\\n if (plot.stage() !== PlotStage.Berry) {\\n return;\\n }\\n if (!currentReqs[plot.berry]) {\\n currentReqs[plot.berry] = 1;\\n }\\n else {\\n currentReqs[plot.berry] += 1;\\n }\\n });\\n return Object.keys(this.berryReqs).every(key => currentReqs[key] !== undefined && currentReqs[key] >= this.berryReqs[key]);\\n }\",\n \"function checkConsanginuity(fam_id, pers1_id, pers2_id)\\n{\\n var fam_map = familyMapOps.getFam(fam_id),\\n pers1 = fam_map[pers1_id],\\n pers2 = fam_map[pers2_id];\\n\\n // Find pers1 founder\\n var routes2 = [];\\n routes2.push( pers1 );\\n routes2.push( pers2 );\\n\\n //console.log(\\\"routes2=\\\", pers1_id, pers2_id);\\n\\n // = [pers1, pers2];\\n\\n var complete = [],\\n \\tloopnum = 0;\\n\\n // console.log(pers1.id+\\\" and \\\"+pers2.id);\\n while(routes2.length > 0 && loopnum++ < 100){\\n\\n \\tvar perc = routes2.shift(); // remove from search\\n\\n/* \\tif (perc === undefined){\\n \\t\\t\\n \\t}\\n*/\\n \\t//Try mother + father\\n\\t if (perc.mother === 0 && perc.father === 0){\\n\\t \\tcomplete.push(perc.id);\\n\\t \\tcontinue;\\n\\t }\\n\\n \\tif (perc.mother != 0) routes2.push(perc.mother);\\n \\tif (perc.father != 0) routes2.push(perc.father);\\n\\n \\t// console.log(\\\" routes=\\\", routes2.map( function(n){ return n.id;}));\\n }\\n // console.log(\\\"complete=\\\", complete);\\n\\n //Find duplicates in complete\\n complete = complete.sort();\\n for (var a=0; a < complete.length -1; a++){\\n \\tif (complete[a+1] === complete[a])\\n \\t\\treturn true;\\n }\\n\\n return false;\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.58984965","0.5873701","0.5846635","0.58114964","0.58030957","0.57344806","0.5690995","0.5646999","0.563571","0.5550344","0.5445501","0.54425097","0.54248667","0.5385541","0.5372878","0.5366242","0.5363819","0.5352206","0.5316015","0.53134966","0.5311252","0.52856725","0.5270786","0.5259772","0.52577454","0.5253942","0.5248371","0.5243528","0.5242046","0.5242046","0.5240374","0.5224718","0.52228534","0.5218619","0.51978934","0.5191057","0.5190722","0.51847637","0.5175462","0.5169386","0.5165346","0.51652414","0.5162082","0.51218075","0.5121089","0.51138693","0.5091822","0.50817335","0.50809544","0.50809544","0.506814","0.50680864","0.50668","0.50665027","0.5062422","0.50534403","0.50491154","0.50439","0.5039087","0.5016296","0.49975938","0.4989016","0.4989016","0.4989016","0.4989016","0.49869385","0.49778715","0.49755967","0.49729282","0.49655217","0.4963609","0.4963609","0.4963609","0.4963609","0.4963609","0.4963609","0.49611384","0.4961102","0.49565145","0.4954868","0.4947576","0.4943907","0.49377218","0.4936672","0.4934951","0.4934951","0.4934951","0.4934951","0.49339908","0.49339908","0.49338475","0.49337763","0.49337637","0.4930023","0.49232578","0.49218112","0.49146423","0.49122077","0.49062526","0.49058723"],"string":"[\n \"0.58984965\",\n \"0.5873701\",\n \"0.5846635\",\n \"0.58114964\",\n \"0.58030957\",\n \"0.57344806\",\n \"0.5690995\",\n \"0.5646999\",\n \"0.563571\",\n \"0.5550344\",\n \"0.5445501\",\n \"0.54425097\",\n \"0.54248667\",\n \"0.5385541\",\n \"0.5372878\",\n \"0.5366242\",\n \"0.5363819\",\n \"0.5352206\",\n \"0.5316015\",\n \"0.53134966\",\n \"0.5311252\",\n \"0.52856725\",\n \"0.5270786\",\n \"0.5259772\",\n \"0.52577454\",\n \"0.5253942\",\n \"0.5248371\",\n \"0.5243528\",\n \"0.5242046\",\n \"0.5242046\",\n \"0.5240374\",\n \"0.5224718\",\n \"0.52228534\",\n \"0.5218619\",\n \"0.51978934\",\n \"0.5191057\",\n \"0.5190722\",\n \"0.51847637\",\n \"0.5175462\",\n \"0.5169386\",\n \"0.5165346\",\n \"0.51652414\",\n \"0.5162082\",\n \"0.51218075\",\n \"0.5121089\",\n \"0.51138693\",\n \"0.5091822\",\n \"0.50817335\",\n \"0.50809544\",\n \"0.50809544\",\n \"0.506814\",\n \"0.50680864\",\n \"0.50668\",\n \"0.50665027\",\n \"0.5062422\",\n \"0.50534403\",\n \"0.50491154\",\n \"0.50439\",\n \"0.5039087\",\n \"0.5016296\",\n \"0.49975938\",\n \"0.4989016\",\n \"0.4989016\",\n \"0.4989016\",\n \"0.4989016\",\n \"0.49869385\",\n \"0.49778715\",\n \"0.49755967\",\n \"0.49729282\",\n \"0.49655217\",\n \"0.4963609\",\n \"0.4963609\",\n \"0.4963609\",\n \"0.4963609\",\n \"0.4963609\",\n \"0.4963609\",\n \"0.49611384\",\n \"0.4961102\",\n \"0.49565145\",\n \"0.4954868\",\n \"0.4947576\",\n \"0.4943907\",\n \"0.49377218\",\n \"0.4936672\",\n \"0.4934951\",\n \"0.4934951\",\n \"0.4934951\",\n \"0.4934951\",\n \"0.49339908\",\n \"0.49339908\",\n \"0.49338475\",\n \"0.49337763\",\n \"0.49337637\",\n \"0.4930023\",\n \"0.49232578\",\n \"0.49218112\",\n \"0.49146423\",\n \"0.49122077\",\n \"0.49062526\",\n \"0.49058723\"\n]"},"document_score":{"kind":"string","value":"0.56132394"},"document_rank":{"kind":"string","value":"9"}}},{"rowIdx":3068,"cells":{"query":{"kind":"string","value":"Given a count of black/white/black pixels just seen and an end position, figures the location of the center of this black/white/black run."},"document":{"kind":"string","value":"function centerFromEnd(stateCount, end) {\r\n\t\t var result = (end - stateCount[2]) - stateCount[1] / 2;\r\n\t\t if (helpers_1.isNaN(result)) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t return result;\r\n\t\t}"},"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 countBlackWhiteRun(origin, end, matrix, length) {\n var rise = end.y - origin.y;\n var run = end.x - origin.x;\n var towardsEnd = countBlackWhiteRunTowardsPoint(origin, end, matrix, Math.ceil(length / 2));\n var awayFromEnd = countBlackWhiteRunTowardsPoint(origin, { x: origin.x - run, y: origin.y - rise }, matrix, Math.ceil(length / 2));\n var middleValue = towardsEnd.shift() + awayFromEnd.shift() - 1; // Substract one so we don't double count a pixel\n return (_a = awayFromEnd.concat(middleValue)).concat.apply(_a, towardsEnd);\n var _a;\n}","function countBlackWhiteRunTowardsPoint(origin, end, matrix, length) {\n var switchPoints = [{ x: Math.floor(origin.x), y: Math.floor(origin.y) }];\n var steep = Math.abs(end.y - origin.y) > Math.abs(end.x - origin.x);\n var fromX;\n var fromY;\n var toX;\n var toY;\n if (steep) {\n fromX = Math.floor(origin.y);\n fromY = Math.floor(origin.x);\n toX = Math.floor(end.y);\n toY = Math.floor(end.x);\n }\n else {\n fromX = Math.floor(origin.x);\n fromY = Math.floor(origin.y);\n toX = Math.floor(end.x);\n toY = Math.floor(end.y);\n }\n var dx = Math.abs(toX - fromX);\n var dy = Math.abs(toY - fromY);\n var error = Math.floor(-dx / 2);\n var xStep = fromX < toX ? 1 : -1;\n var yStep = fromY < toY ? 1 : -1;\n var currentPixel = true;\n // Loop up until x == toX, but not beyond\n for (var x = fromX, y = fromY; x !== toX + xStep; x += xStep) {\n // Does current pixel mean we have moved white to black or vice versa?\n // Scanning black in state 0,2 and white in state 1, so if we find the wrong\n // color, advance to next state or end if we are in state 2 already\n var realX = steep ? y : x;\n var realY = steep ? x : y;\n if (matrix.get(realX, realY) !== currentPixel) {\n currentPixel = !currentPixel;\n switchPoints.push({ x: realX, y: realY });\n if (switchPoints.length === length + 1) {\n break;\n }\n }\n error += dy;\n if (error > 0) {\n if (y === toY) {\n break;\n }\n y += yStep;\n error -= dx;\n }\n }\n var distances = [];\n for (var i = 0; i < length; i++) {\n if (switchPoints[i] && switchPoints[i + 1]) {\n distances.push(distance(switchPoints[i], switchPoints[i + 1]));\n }\n else {\n distances.push(0);\n }\n }\n return distances;\n}","function center(iv) {\n return Math.floor((iv.stop + iv.start) / 2);\n }","function center(iv: Interval) {\n return Math.floor((iv.stop + iv.start) / 2);\n }","function CentreVideo() {\n //console.log(\"R = \" + (image.data[3 * (image.width / 2) + 3 * (image.height / 2) * image.width]));\n //console.log(\"G = \" + (image.data[3 * (image.width / 2) + 1 + 3 * (image.height / 2) * image.width]));\n //console.log(\"B = \" + (image.data[3 * (image.width / 2) + 2 + 3 * (image.height / 2) * image.width]));\n\n for (var i = 3 * (image.width / 2); i < 5 * (image.width / 2); i += 4) {\n for (var j = 3 * (image.height / 2) * image.width; j < 5 * (image.height / 2) * image.width; j += 4 * image.width) {\n nbPoints++;\n var red = image.data[i + j];\n var green = image.data[i + j + 1];\n var blue = image.data[i + j + 2];\n\n if (red > 192 && green < 128 && blue < 128) {\n nbRedPoints++;\n }\n\n image.data[i + j] = 255;\n image.data[i + j + 1] = 0;\n image.data[i + j + 2] = 0;\n }\n }\n }","function getOffsets(size) {\n //THIS FUNCTION IS SO UGLY IM SO SORRY\n let wO = (size * 1.732050808 / 2);\n let hO = size;\n let ans = [];\n\n let startingY = 50 - 2 * (hO * .75);\n let startingX = 50 - wO;\n\n for (let i = 0; i < 3; i++) {\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\n }\n\n startingY = 50 - 1 * (hO * .75);\n startingX = 50 - wO * (1.5);\n\n for (let i = 0; i < 4; i++) {\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\n }\n\n startingY = 50;\n startingX = 50 - wO * (2);\n\n for (let i = 0; i < 5; i++) {\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\n }\n\n\n\n startingY = 50 + 1 * (hO * .75);\n startingX = 50 - wO * (1.5);\n\n for (let i = 0; i < 4; i++) {\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\n }\n\n startingY = 50 + 2 * (hO * .75);\n startingX = 50 - wO;\n\n\n for (let i = 0; i < 3; i++) {\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\n }\n return ans;\n}","function sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY, image) {\r\n\t\t fromX = Math.floor(fromX);\r\n\t\t fromY = Math.floor(fromY);\r\n\t\t toX = Math.floor(toX);\r\n\t\t toY = Math.floor(toY);\r\n\t\t // Mild variant of Bresenham's algorithm;\r\n\t\t // see http://en.wikipedia.org/wiki/Bresenham's_line_algorithm\r\n\t\t var steep = Math.abs(toY - fromY) > Math.abs(toX - fromX);\r\n\t\t if (steep) {\r\n\t\t var temp = fromX;\r\n\t\t fromX = fromY;\r\n\t\t fromY = temp;\r\n\t\t temp = toX;\r\n\t\t toX = toY;\r\n\t\t toY = temp;\r\n\t\t }\r\n\t\t var dx = Math.abs(toX - fromX);\r\n\t\t var dy = Math.abs(toY - fromY);\r\n\t\t var error = -dx >> 1;\r\n\t\t var xstep = fromX < toX ? 1 : -1;\r\n\t\t var ystep = fromY < toY ? 1 : -1;\r\n\t\t // In black pixels, looking for white, first or second time.\r\n\t\t var state = 0;\r\n\t\t // Loop up until x == toX, but not beyond\r\n\t\t var xLimit = toX + xstep;\r\n\t\t for (var x = fromX, y = fromY; x != xLimit; x += xstep) {\r\n\t\t var realX = steep ? y : x;\r\n\t\t var realY = steep ? x : y;\r\n\t\t // Does current pixel mean we have moved white to black or vice versa?\r\n\t\t // Scanning black in state 0,2 and white in state 1, so if we find the wrong\r\n\t\t // color, advance to next state or end if we are in state 2 already\r\n\t\t if ((state == 1) === image.get(realX, realY)) {\r\n\t\t if (state == 2) {\r\n\t\t return distance(x, y, fromX, fromY);\r\n\t\t }\r\n\t\t state++;\r\n\t\t }\r\n\t\t error += dy;\r\n\t\t if (error > 0) {\r\n\t\t if (y == toY) {\r\n\t\t break;\r\n\t\t }\r\n\t\t y += ystep;\r\n\t\t error -= dx;\r\n\t\t }\r\n\t\t }\r\n\t\t // Found black-white-black; give the benefit of the doubt that the next pixel outside the image\r\n\t\t // is \"white\" so this last point at (toX+xStep,toY) is the right ending. This is really a\r\n\t\t // small approximation; (toX+xStep,toY+yStep) might be really correct. Ignore this.\r\n\t\t if (state == 2) {\r\n\t\t return distance(toX + xstep, toY, fromX, fromY);\r\n\t\t }\r\n\t\t // else we didn't find even black-white-black; no estimate is really possible\r\n\t\t return NaN;\r\n\t\t}","function search_start_pos(value) {\n var N = height / $p.config.GRIDY; // target grid N\n\n var y = Infinity,\n y$ = value,\n count = 0;\n\n while (y > 0) {\n y = Math.floor(math.log(y$) * self.A + self.B);\n y$ *= self.$_mult;\n if (count++ > N * 3) return 0; // Prevents deadloops\n }\n\n return y$;\n }","function annot_offset(range_end){\n var lines = editor.getSession().getDocument().getLines(0, range_end.row);\n var total_off = 0;\n var num_char;\n\n for(var i = 0; i < lines.length; i++){\n num_char = lines[i].length;\n total_off += parseInt((num_char - 1) / 80, 10);\n }\n\n return total_off;\n}","function handlePossibleCenter(stateCount, i, j, moduleSize) {\r\n\t\t var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\r\n\t\t var centerJ = centerFromEnd(stateCount, j);\r\n\t\t if (centerJ == null) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t var centerI = crossCheckVertical(i, Math.floor(centerJ), 2 * stateCount[1], stateCountTotal, moduleSize, image);\r\n\t\t if (centerI != null) {\r\n\t\t var estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3;\r\n\t\t for (var i2 in possibleCenters) {\r\n\t\t var center = possibleCenters[i2];\r\n\t\t // Look for about the same center and module size:\r\n\t\t if (aboutEquals(center, estimatedModuleSize, centerI, centerJ)) {\r\n\t\t return combineEstimate(center, centerI, centerJ, estimatedModuleSize);\r\n\t\t }\r\n\t\t }\r\n\t\t // Hadn't found this before; save it\r\n\t\t var point = { x: centerJ, y: centerI, estimatedModuleSize: estimatedModuleSize };\r\n\t\t possibleCenters.push(point);\r\n\t\t }\r\n\t\t return null;\r\n\t\t }","function showPixelFinal(imageDataFinal, imageData, MAX_X, MAX_Y) {\n\tvar index = '';\n\tvar marginLeft = 0;\n\tvar marginTop = 0;\n\tfor (var i = 0; i < MAX_X; i++) {\n\t\tfor (var j = 0; j < MAX_Y; j++) {\n\t\t\tif (imageData[i][j]) {\n\t\t\t\tindex = (i + marginLeft + (j + marginTop) * MAX_X) * 4;\n\t\t\t\t//console.log(imageData[i][j].x+\" \"+imageData[i][j].y+\" \"+index+\" \"+imageData[i][j].r+\" \"+imageData[i][j].g+\" \"+imageData[i][j].b+\" \"+\" \");\n\t\t\t\timageDataFinal.data[index + 0] = imageData[i][j].r;\n\t\t\t\timageDataFinal.data[index + 1] = imageData[i][j].g;\n\t\t\t\timageDataFinal.data[index + 2] = imageData[i][j].b;\n\t\t\t\timageDataFinal.data[index + 3] = imageData[i][j].a;\n\t\t\t}\n\t\t}\n\t}\n}","function imageIndexOf(x,y) {\n return x+(y+2)*(maxX+3)+topImages+3; } // This is the simplified version","function getPixelCenter(x, y) {\n\tvar pixelX = x*(canvas.width/grid.x)+((canvas.width/grid.x)/2);\n\tvar pixelY = y*(canvas.height/grid.y)+((canvas.height/grid.y)/2);\n\treturn {\"x\": pixelX, \"y\": pixelY};\n}","function colorTracker(arg){\n\tcapture.loadPixels();\n\n\tlet colLoc = [0,0];\n\tlet colDist = 600;\n\n\t for(let bY =0; bY < capture.height; bY++){\n\t \tfor(let bX=0;bX p === '-' || p === '|').length;\n const ind = [];\n for (let i = 0; i < 8; i++) {\n if (n[i] === '-' || n[i] === '|') ind.push(i);\n }\n\n switch (edges) {\n\n case 2:\n switch (ind[0]) {\n case 1: \n return ind[1] === 3 ? (n[0] === n[7] ? 2 : 1) : (n[2] === n[5] ? 2 : 1);\n case 3: \n return n[2] === n[5] ? 2 : 1;\n case 4: \n return n[0] === n[7] ? 2 : 1;\n }\n\n case 3: \n return n.filter(p => p === ' ').length === 5 ? 3 : 2;\n\n case 4:\n return n.filter(p => p === ' ').length;\n }\n }","computeCenter() {\n self.centerX = self.screenX + self.screenDisplacementX;\n self.centerY = self.screenY + self.screenDisplacementY;\n }","findCenter() {\n return {\n x: (this.right - this.left)/2 + this.left,\n y: (this.bottom - this.top)/2 + this.top\n };\n }","calculateAtDesiredPos() {\n let counter = 0;\n for (let i = 0; i < this.num_rows; i++) {\n for (let j = 0; j < this.num_cols; j++) {\n if (this.isAtDesiredPos([i, j], this.board[i][j])) counter++;\n }\n }\n return counter;\n }","function placePieceForSearch(row, col, color, board){\n //start and end are arrays with the starting and ending indices of the pieces boxing in those to be changed\n if(color == \"white\")\n { \n board[row][col] = nextwhitePieceId;\n nextwhitePieceId+=2; \n }\n else{\n \n board[row][col] = nextblackPieceId;\n nextblackPieceId+=2;\n } \n replaceMiddlePiecesForSearch(row,col)\n}","leg(loc, x, y, start_val){\n\t\tvar cur_val = start_val\n\t\tvar stop = false\n\t\tvar check_loc = []\n\t\twhile(!stop){\n\t\t\tloc[0] += x\n\t\t\tloc[1] += y\n\n\t\t\t// I'm sure there is a mathish way to do this. I'm just lazy right now.\n\t\t\t// This sets up the cell coordinates to look at for an empty spot.\n\t\t\tif(y == -1){\n\t\t\t\tcheck_loc[0] = loc[0] - 1\n\t\t\t\tcheck_loc[1] = loc[1]\n\t\t\t}else if (x == -1) {\n\t\t\t\tcheck_loc[0] = loc[0]\n\t\t\t\tcheck_loc[1] = loc[1] + 1\n\t\t\t}else if (y == 1){\n\t\t\t\tcheck_loc[0] = loc[0] + 1\n\t\t\t\tcheck_loc[1] = loc[1]\n\t\t\t}else{\n\t\t\t\tcheck_loc[0] = loc[0]\n\t\t\t\tcheck_loc[1] = loc[1] - 1\n\t\t\t}\n\n\t\t\tcur_val += 1\n\t\t\tif(this.tbl.rows.length - 1 < loc[1] || this.tbl.rows[loc[1]].cells.length - 1 < loc[0]){\n\t\t\t\tthrow new RangeError(\"outta room\")\n\t\t\t}\n\t\t\tthis.tbl.rows[loc[1]].cells[loc[0]].innerHTML = cur_val\n\t\t\t// give a faint crosshair so we can find the center on larger blocks.\n\t\t\tif(loc[0] == this.center || loc[1] == this.center){\n\t\t\t\tthis.tbl.rows[loc[1]].cells[loc[0]].style.backgroundColor = \"#DDDDDD\"\n\t\t\t}\n\t\t\tthis.formatPrime(loc[0], loc[1])\n\t\t\tstop = this.tbl.rows[check_loc[1]].cells[check_loc[0]].innerHTML == this.filler\n\t\t}\n\n\t\treturn cur_val\n\t}","function northeast(n) {\n var level = bottoms[n];\n var count = 0;\n\n for (var i = 1; ((n + i) <= 6) && ((level - i) >= 0); i++) {\n var square = document.getElementsByClassName(\"row\").item(level - i)\n .getElementsByClassName(\"bigSquare\").item(n + i);\n if (square.style.backgroundColor == color(currentTurn)) {\n count++;\n }\n else return count;\n }\n return count;\n }","calcCoordsForCenter(tileRow, tileCol, width, height, tileSize) {\n const tileXCenter = tileSize * (tileCol + 0.5);\n const tileYCenter = tileSize * (tileRow + 0.5);\n const dstX = tileXCenter - width * 0.5;\n const dstY = tileYCenter - height * 0.5;\n return [dstX, dstY];\n }","getBlockIndex(screenX, screenY) {\n let col = Math.floor(screenX * this.col / window.innerWidth);\n let row = Math.floor(screenY * this.row / window.innerHeight);\n return [row, col];\n }","center() {\n let x_center = 0, y_center = 0;\n const coords = this.getCoords();\n for (let axis = 0; axis < coords.length; axis ++) {\n let [i, j] = num_60rotations(2*axis);\n x_center += i * coords[axis];\n y_center += j * coords[axis];\n }\n return [x_center, y_center];\n }","function calculateCentroidPositions() { // x location, y location, count, sum of square distances\n clearCentroidPositions();\n addupXYPositions();\n // scale sums by count....to calculate averages\n normalizeCentroidByColorTypeCount(colorCentroidStructure);\n sumOfSquares();\n }","function bottom_Y(){\r\n\r\n\tvar imgd = ctx.getImageData(0,0, c.width,c.height);\r\n\t//var pix_array = imgd.data;\r\n\r\n\tfor(var y = c.height - 1; y >= 0 ; y--){\r\n\t\tfor(var x = 0; x < c.width; x++){\r\n\t\r\n\t\t\tvar index = (x + y * imgd.width) * 4;\r\n\r\n\t\t\tif(imgd.data[index+0] == 0 &&\r\n\t\t\t\timgd.data[index+1] == 0 &&\r\n\t\t\t\timgd.data[index+2] == 0){\r\n\t\t\t\t\r\n\r\n\t\t\t\t// if(seen == false){\r\n\t\t\t\t// \tconsole.log(\"bottom_Y is: \" + y);\r\n\t\t\t\t// \tseen = true;\r\n\t\t\t\t// }\r\n\r\n\t\t\t\treturn y;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\r\n\t// if(seen == false){\r\n\t// \tconsole.log(\"eek! error! Didn't see any black unfortunately.\");\r\n\t// \tseen = true;\r\n\t// }\r\n}","tile_normalized_coord() {\n\t\tvar rect = this.canvas.getBoundingClientRect();\n\t\tvar x = this.cursor_x - rect.left + this.current_x;\n\t\tvar y = this.cursor_y - rect.top + this.current_y;\n\t\tvar row = y / this.tile_size;\n\t\tvar col = x / this.tile_size;\n\t\treturn [col, row]\n\t}","function getCenter(character) {\n var index = (consonants.indexOf(character) % centers.length);\n return centers[index];\n}","cell_centre_at_position(position) {\n return new Offset(\n this.cell_size(this.cell_width, position.x) / 2,\n this.cell_size(this.cell_height, position.y) / 2,\n );\n }","function calculateColor(begin, end, pos) {\n var color = 'rgba('\n + parseInt((begin[0] + pos * (end[0] - begin[0])), 10) + ','\n + parseInt((begin[1] + pos * (end[1] - begin[1])), 10) + ','\n + parseInt((begin[2] + pos * (end[2] - begin[2])), 10);\n\n color += ',' + (begin && end ? parseFloat(begin[3] + pos * (end[3] - begin[3])) : 1);\n color += ')';\n return color;\n }","function calculateColor(begin, end, pos) {\n var color = 'rgba('\n + parseInt((begin[0] + pos * (end[0] - begin[0])), 10) + ','\n + parseInt((begin[1] + pos * (end[1] - begin[1])), 10) + ','\n + parseInt((begin[2] + pos * (end[2] - begin[2])), 10);\n\n color += ',' + (begin && end ? parseFloat(begin[3] + pos * (end[3] - begin[3])) : 1);\n color += ')';\n return color;\n }","function calculateColor(begin, end, pos) {\n var color = 'rgba('\n + parseInt((begin[0] + pos * (end[0] - begin[0])), 10) + ','\n + parseInt((begin[1] + pos * (end[1] - begin[1])), 10) + ','\n + parseInt((begin[2] + pos * (end[2] - begin[2])), 10);\n\n color += ',' + (begin && end ? parseFloat(begin[3] + pos * (end[3] - begin[3])) : 1);\n color += ')';\n return color;\n }","centerPosition() {\n return [this.clientWidth() / 2, this.clientHeight() / 2, ];\n }","function centerOf(text) {\n let center = Math.floor(text.length / 2);\n if (text.length % 2 === 1) {\n return text[center];\n }\n\n return text[center - 1] + text[center];\n}","getStartingPosition() {\n const left = this.generateRandomPosition();\n\n // If the `left` value lies in the restricted range, then top cannot lie there.\n // This prevents streak generation with a certain radius from the center. (imporves aesthetic appeal)\n const restrictiveFlag =\n (left > Streak.positionLimits[this.attributes.type].lower) &&\n (left < Streak.positionLimits[this.attributes.type].upper)\n ;\n const top = this.generateRandomPosition(restrictiveFlag);\n\n return { left, top };\n }","function countCoordinate (val){\n return (val * side ) + (side / 2);\n}","function evaluate_corners () {\r\n\tfor (a = 0; a < 2; a++) {\r\n\t\tif (start[a] < end[a]) {\r\n\t\t\ttop_left[a] = start[a];\r\n\t\t\tbottom_right[a] = end[a];\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\ttop_left[a] = end[a];\r\n\t\t\tbottom_right[a] = start[a];\r\n\t\t}\r\n\t}\r\n\trwidth = bottom_right[0] - top_left[0];\r\n\trheight = bottom_right[1] - top_left[1];\r\n\t// set text\r\n\ttlc.innerHTML = \"Top Left: [\" + top_left[0] + \",\" + top_left[1] + \"]\";\r\n\tbrc.innerHTML = \"Bottom Right: [\" + bottom_right[0] + \",\" + bottom_right[1] + \"]\";\r\n}","function incrNeighbors(rC, cC) { // Center is at (rC, cC)\n for (var rN = rC+drA; rN <= rC+drB; rN++) { // Neighbor row\n for (var cN = cC+dcA; cN <= cC+dcB; cN++) { // Neighbor col\n if (! bMap[rN][cN]) { cMap[rN][cN]++; } // Increment non-mine pixels\n }\n }\n }","function color_starting_square(ctx, num_canvas_cells, x_offset, y_offset)\r\n{\r\n ctx.save( );\r\n ctx.fillStyle = 'black';\r\n\r\n // rect(the x cord in the upper left corner, the y cord of the upper left rect, width, height)\r\n ctx.rect(x_offset + ((Math.floor(num_canvas_cells / 2) - 1) * 5), y_offset, 5, 5);\r\n ctx.fill();\r\n ctx.restore( );\r\n}","function point2ColorPos(pt, imgSize) {\n return ((pt.y - 1) * imgSize.w * 4) + (pt.x * 4 - 4);\n}","function drawCenterStars(num)\n{\n \n}","function centerPosition(el) {\n var pageSize = getPageSize(),\n dim = el.getDimensions(),\n offsets = el.cumulativeOffset(),\n d = getImgSize(dim),\n\n top = (offsets.top + (pageSize.height - d.height) / 2),\n left = (offsets.left + (pageSize.width - d.width) / 2),\n right = (offsets.left + (pageSize.width + d.width) / 2);\n\n return {width: dim.width, height: dim.height, top: top, left: left, right: right}\n}","function kMove(color, start, end) {\n var dif1 = start[0] - end[0];\n var dif2 = start[1] - end[1];\n \n if (Math.abs(dif1) >= 2 || Math.abs(dif2) >= 2) {\n return false;\n } else if (isSquareOccupied(end[0], end[1])) {\n return take(color, end[0], end[1]);\n }\n return true;\n}","matchStartColor(pixelPos) {\n var pixelColor = this.getPixelColor(this.colorLayerData, pixelPos);\n var v = this.matchClickedColor(pixelColor.r, pixelColor.g, pixelColor.b, pixelColor.a);\n return v;\n }","static CenteredPosition(position, out = new b2.Vec2()) {\n return out.Set(position.x + FrackerSettings.k_tileHalfWidth, position.y + FrackerSettings.k_tileHalfHeight);\n }","function xyOffsetIndex(i, x, y, w, h) {\n var index = i + x + y * w;\n var absx = (i % w) + x;\n if (absx < 0 && index < 0 || absx >= w && index >= w * h) {\n return i - x - y * w;\n }\n if (absx < 0 || absx >= w) { // if off the left.\n return i - x + y * w;\n }\n //var absy = index - (w * y)\n if (index < 0 || index >= w * h) { // if off top/bottom.\n return i + x - y * w;\n }\n return index;\n}","north(x,y,count){\r\n if(count >= 5){\r\n return true;\r\n }\r\n else if(y-1 >= 0 && this.getColor(x,y) === this.getColor(x,y-1)){//point must exist\r\n return this.north(x, y-1, count+1);\r\n }\r\n return(count >= 5);\r\n }","function count_color(current_coordinate, desired_color, desired_direction, current_count) {\n\t\t\t\tlet next_coordinate = [current_coordinate[0] + desired_direction[0],\n\t\t\t\tcurrent_coordinate[1] + desired_direction[1]];\n\t\t\t\tconsole.log(next_coordinate);\n\t\t\t\tif (piece_position[next_coordinate[0]] && piece_position[next_coordinate[0]][next_coordinate[1]]) {\n\t\t\t\t\tif (piece_position[next_coordinate[0]][next_coordinate[1]].color != desired_color)\n\t\t\t\t\t\treturn current_count;\n\t\t\t\t\tcurrent_count += 1;\n\t\t\t\t\tif (current_count == 3)\n\t\t\t\t\t\treturn current_count;\n\t\t\t\t\treturn count_color(next_coordinate, desired_color, desired_direction, current_count);\n\t\t\t\t}\n\t\t\t\treturn current_count;\n\t\t\t}","basePixelOffset(m, p, x, y, k) {\n\tvar t = this;\n\treturn ((m*(t.nplanes+1) + p)*t.resolution*t.resolution + (x + y*t.resolution))*3 + k;\n}","function calculateCenter (array) {\n \n var x = 0, y = 0;\n\n array.forEach(function(point){\n x += point.x;\n y += point.y;\n });\n\n x = x / array.length;\n y = y / array.length;\n\n return {x: x,y: y};\n\n}","function getOffset() {\n if (innerHeight < 600 || innerWidth < 1000) {\n return 105;\n }\n else {\n return 55;\n }\n}","setCenter() {\n let x = 0;\n let y = 0;\n for (let v of this.pixelVectorPositions) {\n x += v.x;\n y += v.y;\n }\n\n x /= this.pixelVectorPositions.length;\n y /= this.pixelVectorPositions.length;\n this.center = createVector(x, y);\n }","function center(x1, y1, x2, y2, width, height) {\n\tif ((x1 >= x2 && x1 <= x2 + width))\n\t\tif ((y1 >= y2 && y1 <= y2 + height))\n\t\t\treturn true;\n\t\treturn false;\n}","function getPixelRange() {\r\n\t\t$this = $['mapsettings'].element;\r\n\t\tvar xstart = 0;\r\n\t\tvar ystart = 0;\r\n\t\tif($['mapsettings'].initLeft<0) xstart = Math.abs($['mapsettings'].initLeft);\r\n\t\tif($['mapsettings'].initTop<0) ystart = Math.abs($['mapsettings'].initTop);\r\n\t\txstart = getFirstXPosInRange(xstart);\r\n\t\t// Makes sure that ystart values are multiples of 256 and start before viewport\r\n\t\tif(ystart%256!=0) ystart=((parseInt(ystart/256))-1)*256;\r\n\t\tvar xend = $this.innerWidth() - $['mapsettings'].initLeft;\r\n\t\tvar yend = $this.innerHeight() - $['mapsettings'].initTop;\r\n\t\treturn {\r\n\t\t\t\"start\": {\r\n\t\t\t\t\"x\": xstart,\r\n\t\t\t\t\"y\": ystart\r\n\t\t\t},\r\n\t\t\t\"end\": {\r\n\t\t\t\t\"x\": xend,\r\n\t\t\t\t\"y\": yend\r\n\t\t\t}\r\n\t\t};\r\n\t}","function colorFigures(colors, current_position) {\n\n\tvar chosen_color;\n\t//console.log(current_position);\n\tvar left = current_position.indexOf(\"left\");\n\tvar right = current_position.indexOf(\"right\");\n\tvar center = current_position.indexOf(\"center\");\n\n\tif (left >= 0) {\n\n\t\tchosen_color = colors[0];\n\n\t} else if (right >= 0) {\n\n\t\tchosen_color = colors[1];\n\n\t} else if (center >= 0) {\n\n\t\tchosen_color = colors[2];\n\n\t}\n\n\treturn chosen_color;\n\n}","function drawMiddlePartition() {\n for(let i = 5; i <= height; i+=30) {\n rect(400, i, 5, 20);\n fill(255, 255, 255);\n }\n}","function midline()\r\n{\r\nfor(i=0;i<480;i+=10)\r\n{\r\nvar y = 0;\r\nfill(\"white\");\r\nstroke(0);\r\nrect(width/2,y+i,10,480);\r\n}\r\n}","function findSquare(mazeimg, locations) {\n var x = locations[0].x;\n var y = locations[0].y;\n var color;\n var hexcolor;\n\n do {\n x--;\n hexcolor = mazeimg.getPixelColor(x, y);\n color = Jimp.intToRGBA(hexcolor);\n } while (color.r == 255 && color.g == 0 && color.b == 0);\n\n hexcolor = mazeimg.getPixelColor(x + 17, y);\n color = Jimp.intToRGBA(hexcolor);\n if (color.r == 255 && color.g == 0 && color.b == 0) {\n x += 1;//move back inside the red square\n do {\n y--;\n hexcolor = mazeimg.getPixelColor(x, y);\n color = Jimp.intToRGBA(hexcolor);\n } while (color.r == 255 && color.g == 0 && color.b == 0);\n\n hexcolor = mazeimg.getPixelColor(x, y + 17);\n color = Jimp.intToRGBA(hexcolor);\n if (color.r == 255 && color.g == 0 && color.b == 0) {\n //location 1 is the square\n console.log(\"found Start (circle) at \", locations[1]);\n console.log(\"found End (square) at \", locations[0]);\n return 1;\n }\n }\n //didnt find square at location 1 so it must be location 2\n console.log(\"found Start (circle) at \", locations[0]);\n console.log(\"found End (square) at \", locations[1]);\n\n return 0;\n}","function sizeOfBlackWhiteBlackRunBothWays(fromX, fromY, toX, toY, image) {\r\n\t\t var result = sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY, image);\r\n\t\t // Now count other way -- don't run off image though of course\r\n\t\t var scale = 1;\r\n\t\t var otherToX = fromX - (toX - fromX);\r\n\t\t if (otherToX < 0) {\r\n\t\t scale = fromX / (fromX - otherToX);\r\n\t\t otherToX = 0;\r\n\t\t }\r\n\t\t else if (otherToX >= image.width) {\r\n\t\t scale = (image.width - 1 - fromX) / (otherToX - fromX);\r\n\t\t otherToX = image.width - 1;\r\n\t\t }\r\n\t\t var otherToY = (fromY - (toY - fromY) * scale);\r\n\t\t scale = 1;\r\n\t\t if (otherToY < 0) {\r\n\t\t scale = fromY / (fromY - otherToY);\r\n\t\t otherToY = 0;\r\n\t\t }\r\n\t\t else if (otherToY >= image.height) {\r\n\t\t scale = (image.height - 1 - fromY) / (otherToY - fromY);\r\n\t\t otherToY = image.height - 1;\r\n\t\t }\r\n\t\t otherToX = (fromX + (otherToX - fromX) * scale);\r\n\t\t result += sizeOfBlackWhiteBlackRun(fromX, fromY, otherToX, otherToY, image);\r\n\t\t return result - 1; // -1 because we counted the middle pixel twice\r\n\t\t}","function getTileIndexes(x, y) {\r\n \r\n var l = Math.floor(x/(w_tuile + padding));\r\n var c = Math.floor(y/(h_tuile + padding));\r\n var pad_x = x - l*(w_tuile + padding);\r\n var pad_y = y - c*(h_tuile + padding);\r\n \r\n console.log(pad_x +\" , \" + pad_y);\r\n \r\n if(pad_x < padding/2 || pad_x > w_tuile+padding/2) {\r\n \treturn null;\r\n }\r\n \r\n if(pad_y < padding/2 || pad_y > h_tuile+padding/2) {\r\n \treturn null;\r\n }\r\n \r\n console.log(\"C = \" + c + \", L = \" + l);\r\n return {i: c, j: l};\r\n}","setCenter() {\n let x = 0;\n let y = 0;\n for (var v of this.pixelVectorPositions) {\n x += v.x;\n y += v.y;\n }\n\n x /= this.pixelVectorPositions.length;\n y /= this.pixelVectorPositions.length;\n this.center = createVector(x, y);\n\n }","function ComputeOutCode(x, y, xmin, ymin, xmax, ymax)\n{\n var code;\n\n code = INSIDE; // initialised as being inside of [[clip window]]\n\n if (x < xmin) // to the left of clip window\n code |= LEFT;else\n if (x > xmax) // to the right of clip window\n code |= RIGHT;\n if (y < ymin) // below the clip window\n code |= BOTTOM;else\n if (y > ymax) // above the clip window\n code |= TOP;\n\n return code;\n}","centre_offset_from_position(position) {\n const offset = this.offset_from_position(position);\n const centre = this.cell_centre_at_position(position);\n return offset.add(centre);\n }","function east(n) {\n var level = bottoms[n];\n var count = 0;\n\n for (var i = 1; (n + i) <= 6; i++) {\n var square = document.getElementsByClassName(\"row\").item(level)\n .getElementsByClassName(\"bigSquare\").item(n + i);\n if (square.style.backgroundColor == color(currentTurn)) {\n count++;\n }\n else return count;\n }\n return count;\n }","blocksTravelled(){\n let horizontal = Math.abs(eastWest.indexOf(this.beginningLocation.horizontal) - eastWest.indexOf(this.endingLocation.horizontal))\n let vertical = Math.abs(parseInt(this.beginningLocation.vertical)-parseInt(this.endingLocation.vertical))\n return (horizontal + vertical);\n }","getEndPosition(widget) {\n let left = widget.x;\n let top = widget.y;\n let lineWidget = undefined;\n if (widget.childWidgets.length > 0) {\n lineWidget = widget.childWidgets[widget.childWidgets.length - 1];\n left += this.getWidth(lineWidget, false);\n }\n if (!isNullOrUndefined(lineWidget)) {\n top = this.getTop(lineWidget);\n }\n let topMargin = 0;\n let bottomMargin = 0;\n let size = this.getParagraphMarkSize(widget, topMargin, bottomMargin);\n return new Point(left, top + size.topMargin);\n }","function scanCircle(x, y, h, k, setPixel) {\n // top-right quad\n drawVertical(x + h, y + h, y + k, setPixel);\n drawHorizontal(x + h + 1, x + k, y + h, setPixel);\n // bottom-left quad\n const yOff = h == 0 ? -1 : 0;\n drawVertical(x - h, y - k, y - h + yOff, setPixel);\n drawHorizontal(x - k, x - h - 1, y - h, setPixel);\n\n // don't repeat on axes\n if(h > 0) {\n // top-left quad\n drawVertical(x - h, y + h, y + k, setPixel);\n drawHorizontal(x - k, x - h - 1, y + h, setPixel);\n // bottom-right quad\n drawVertical(x + h, y - k, y - h, setPixel);\n drawHorizontal(x + h + 1, x + k, y - h, setPixel);\n }\n}","function getCentreX(array) {\n const len = array.length;\n\n if (len % 2 === 0) {\n const secondI = len / 2;\n const second = array[secondI];\n\n const firstI = secondI - 1;\n const first = array[firstI];\n\n if (first > second)\n return firstI;\n\n return secondI;\n }\n\n return (len - 1) / 2;\n }","function calcCenter(){\r\n\t\tvar i;\r\n\t\tvar latAverage = 0;\r\n\t\tfor(i = 0; i < latArray.length; i++){\r\n\t\t\tlatAverage = latAverage + latArray[i];\r\n\t\t}\r\n\t\tlatAverage = latAverage/latArray.length;\r\n\t\t\r\n\t\tfor(i = 0; i < lonArray.length; i++){\r\n\t\t\tlonAverage = lonAverage + lonArray[i];\r\n\t\t}\r\n\t\t\r\n\t\tlonAverage = lonAverage / lonArray.length;\r\n\t\t\r\n\t\t/*\r\n\t\t\tPrints the location out on the screen\r\n\t\t*/\r\n\t\t\r\n\t\tdocument.getElementById(\"latitudeDiv\").innerHTML = latAverage;\r\n\t\tdocument.getElementById(\"longitudeDiv\").innerHTML = lonAverage;\r\n\t}","function posforblock(block, axis, x, y) {\n var c = 3 * (block % 3);\n var r = (block - block % 3);\n if (axis == 0) { c += x; r += y; }\n else { c += y; r += x; }\n c = c % 9;\n r = r % 9;\n return r * 9 + c;\n}","function posforblock(block, axis, x, y) {\n var c = 3 * (block % 3);\n var r = (block - block % 3);\n if (axis == 0) { c += x; r += y; }\n else { c += y; r += x; }\n c = c % 9;\n r = r % 9;\n return r * 9 + c;\n}","function calculateMapTilePosition(){\n\t\tvar mnwCurrentView = $('mnwCurrentView');\n\t\tvar calcLeft = mnwCurrentView.style.left;\n\t\tvar calcTop = mnwCurrentView.style.top;\t\t\n\t\tvar c_top = Math.floor(VIEWPORT_HEIGHT/2);\n\t\tvar c_left = Math.floor(VIEWPORT_WIDTH/2);\n\t\tcalcLeft = calcLeft.replace('px','')*1;\n\t\tcalcTop = calcTop.replace('px','')*1;\n\t\tcalcLeft = calcLeft * mnwScale + c_left;\n\t\tcalcTop = calcTop * mnwScale + c_top;\n\t\tgoToMapPosition(calcTop,calcLeft);\n\t\tloadCurrentMapArea();\n\t}","function calculateCenter(){\n center = map.getCenter();\n }","function box_get_centroid(dst, dst_off, src, src_off) {\n\t dst[dst_off] = 0.5 * (src[src_off] + src[src_off + 3]);\n\t dst[dst_off + 1] = 0.5 * (src[src_off + 1] + src[src_off + 4]);\n\t dst[dst_off + 2] = 0.5 * (src[src_off + 2] + src[src_off + 5]);\n\t }","function getRectCenterOffset(rect) {\n return { x: rect.width / 2, y: rect.height / 2 };\n }","function virtical_location(y, sizey){\n\t \tif(((y+sizey)/tileHeight)%1 >= 0.5){\n\t \t\treturn Math.ceil((y+sizey)/tileHeight)+1\n\t \t} else {\n\t \t\treturn Math.floor((y+sizey)/tileHeight)+1;\n\t \t}\n\t }","function findTargetSpots(cells, fromIndex) {\n if (cells[fromIndex.color] === \"\") {\n return []\n }\n\n let result = []\n\n const fromRow = Math.trunc(fromIndex / NO_COLS)\n const fromCol = fromIndex % NO_COLS\n\n // left\n let tmpCol = fromCol\n while (--tmpCol >= 0) {\n const tmpIdx = (fromRow * NO_COLS) + tmpCol\n if (cells[tmpIdx].color !== \"\") {\n if (tmpIdx + 1 !== fromIndex) {\n result.push(tmpIdx + 1)\n }\n break\n }\n }\n\n // right\n tmpCol = fromCol\n while (++tmpCol < NO_COLS) {\n const tmpIdx = (fromRow * NO_COLS) + tmpCol\n if (cells[tmpIdx].color !== \"\"){\n if (tmpIdx - 1 !== fromIndex) {\n result.push(tmpIdx - 1)\n }\n break\n }\n }\n\n // top\n let tmpRow = fromRow\n while (--tmpRow >= 0) {\n const tmpIdx = (tmpRow * NO_COLS) + fromCol\n if (cells[tmpIdx].color !== \"\") {\n if (tmpIdx + NO_COLS !== fromIndex) {\n result.push(tmpIdx + NO_COLS)\n }\n break\n }\n }\n\n // down\n tmpRow = fromRow\n while (++tmpRow < NO_ROWS) {\n const tmpIdx = (tmpRow * NO_COLS) + fromCol\n if (cells[tmpIdx].color !== \"\") {\n if (tmpIdx - NO_COLS !== fromIndex) {\n result.push(tmpIdx - NO_COLS)\n }\n break\n }\n }\n\n return result\n}","offset() {\n if (this.overlap) return this.dot ? 8 : 12;\n return this.dot ? 2 : 4;\n }","function top_Y(){\r\n\r\n\tvar imgd = ctx.getImageData(0,0, c.width,c.height);\r\n\t//var pix_array = imgd.data;\r\n\r\n\tfor(var y = 0; y < c.height; y++){\r\n\t\tfor(var x = 0; x < c.width; x++){\r\n\r\n\t\t\tvar index = (x + y * imgd.width) * 4;\r\n\r\n\t\t\tif(imgd.data[index+0] == 0 &&\r\n\t\t\t\timgd.data[index+1] == 0 &&\r\n\t\t\t\timgd.data[index+2] == 0){\r\n\r\n\t\t\t\t// if(seen == false){\r\n\t\t\t\t// \tconsole.log(\"22top_Y is: \" + y);\r\n\t\t\t\t// \tseen = true;\r\n\t\t\t\t// }\r\n\r\n\t\t\t\treturn y;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\r\n\t// if(seen == false){\r\n\t// \tconsole.log(\"eek! error! Didn't see any black unfortunately.\");\r\n\t// \tseen = true;\r\n\t// }\r\n}","getEndPosition() {\n const radius = (this.tunnelWidth - 1) / 2\n if (this.direction === 'NORTH') {\n return { x: this.x + radius, y: this.y }\n } else if (this.direction === 'SOUTH') {\n return { x: this.x + radius, y: (this.y + this.height) - 1 }\n } else if (this.direction === 'EAST') {\n return { x: (this.x + this.width) - 1, y: this.y + radius }\n } else if (this.direction === 'WEST') {\n return { x: this.x, y: this.y + radius }\n }\n return null\n }","function computeDiscCoordinates(col, row) {\n let xpos = sizes.initialx + sizes.size / 2 + col * sizes.size;\n let ypos = sizes.initialy + sizes.ysize - sizes.size / 2 - row * sizes.size;\n return { x: xpos, y: ypos };\n}","function getWithinFrame(i, x, y, frameWidth, frameHeight, totalWidth) {\n const row = Math.floor(i / 4 / totalWidth)\n const col = Math.floor(i / 4) % totalWidth\n if (col >= x && col < x + frameWidth && row >= y && row < y + frameHeight) {\n return ((row - y) * frameWidth + (col - x)) * 4\n }\n\n return -1\n}","function squareCenterWin(){\n\n}","function southeast(n) {\n var level = bottoms[n];\n var count = 0;\n\n for (var i = 1; ((n + i) <= 6) && ((level + i) <= 5); i++) {\n var square = document.getElementsByClassName(\"row\").item(level + i)\n .getElementsByClassName(\"bigSquare\").item(n + i);\n if (square.style.backgroundColor == color(currentTurn)) {\n count++;\n }\n else return count;\n }\n return count;\n }","function getCenter(a, b) {\n return {\n x: (b.x + a.x) / 2,\n y: (b.y + a.y) / 2\n };\n}","getPixelCoordsFromTileIndex(i) {\n return {\n x: (i % this.width.tiles) * this.tileSize,\n y: Math.floor(i / this.width.tiles) * this.tileSize\n };\n }","function getMapCenterY()\r\n{\r\n\tvar frameY = getHeight()/2;\r\n\tvar mapTop = getMapTop();\r\n\treturn frameY - mapTop;\t\r\n}","function getRectCenter(rect){return{left:(rect.left+rect.right)/2,top:(rect.top+rect.bottom)/2};}","function highlightPawn(i,j) {\n\tif (isWhite) {\n\t\tif (j < 7) {\n\t\t\tif (lookupTile(2,i,j+1).piece == 'ee')\n\t\t\t\thighlight(i,j+1,true);\n\t\t\tif (i < 7) {\n\t\t\t\tif (lookupTile(2,i+1,j+1).piece.charAt(0) == 'b')\n\t\t\t\t\thighlight(i+1,j+1,false);\n\t\t\t}\n\t\t\tif (i > 0) {\n\t\t\t\tif (lookupTile(2,i-1,j+1).piece.charAt(0) == 'b')\n\t\t\t\t\thighlight(i-1,j+1,false);\n\t\t\t}\n\t\t\tif (j == 1 && lookupTile(2,i,j+2).piece == 'ee')\n\t\t\t\thighlight(i,j+2,true);\n\t\t}\n\t} else {\n\t\tif (j > 0) {\n\t\t\tif (lookupTile(2,i,j-1).piece == 'ee')\n\t\t\t\thighlight(i,j-1,true);\n\t\t\tif (i < 7) {\n\t\t\t\tif (lookupTile(2,i+1,j-1).piece.charAt(0) == 'w')\n\t\t\t\t\thighlight(i+1,j-1,false);\n\t\t\t}\n\t\t\tif (i > 0) {\n\t\t\t\tif (lookupTile(2,i-1,j-1).piece.charAt(0) == 'w')\n\t\t\t\t\thighlight(i-1,j-1,false);\n\t\t\t}\n\t\t\tif (j == 6 && lookupTile(2,i,j-2).piece == 'ee')\n\t\t\t\thighlight(i,j-2,true);\n\t\t}\n\t}\n}","function getSurroundingXCount(x, y, type){\n\t\tvar count =0;\n\t\t\tfor(var i =x-1; i <= x+1 ; i++){\n\t\t\t\tfor(var j = y-1; j<= y+1; j++){\n\t\t\t\t\tif( i >= 0 && i < tileWidth && j >= 0 && j < tileHeight){\n\t\t\t\t\t\tif( i != x || j != y){\n\t\t\t\t\t\t\tif(tiles[i][j] == type){\n\t\t\t\t\t\t\t\tcount ++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\treturn count;\n}","function getMatchVerticalOffset(matchCount, currentRound) {\n return 1 / (matchCount / currentRound);\n}","startCursorBlinking: () => void,\n stopCursorBlinking(): void,\n pixelPositionForScreenPosition(\n screenPosition: atom$Point,\n clip?: boolean,\n ): {top: number, left: number},","function countNeighbours(centerX, centerY, searchSize) {\n\n var numCellsCounted = 0;\n var numNeighbours = 0;\n\n for (let xOffset = -searchSize; xOffset <= searchSize; xOffset++) {\n for (let yOffset = -searchSize; yOffset <= searchSize; yOffset++) {\n if (xOffset != 0 || yOffset != 0) { \n var xSamp = centerX + xOffset;\n var ySamp = centerY + yOffset;\n\n if (xSamp >= 0 && xSamp < cols && ySamp > 0 && ySamp < rows) {\n if (pPuffs[xSamp][ySamp]){\n numNeighbours += 1;\n }\n numCellsCounted += 1;\n }\n }\n }\n }\n\n return numNeighbours / numCellsCounted;\n}","function pixelDist() {\r\n\tvar min = bounds.getSouthWest();\r\n\tvar max = bounds.getNorthEast();\r\n\t\r\n\tvar x = Math.abs(max.lng() - min.lng())/dojo.contentBox(\"map_canvas\").w;\r\n\tvar y = Math.abs(max.lat() - min.lat())/dojo.contentBox(\"map_canvas\").h;\r\n\t\r\n\tvar r = Math.pow(10,7);\r\n\tpixels = {\"x\": Math.round(x*r)/r, \"y\": Math.round(y*r)/r};\r\n}","function findCord(x, y) \n{\n\tif (0<= x && x <= 1/3*width) {\n\t\tcord = 0;\n\t}\n\telse if (1/3*width<= x && x <= 2/3*width) \n\t{\n\t\tcord = 1;\n\t}\n\telse if (2/3*width<= x && x <= 3*width) \n\t{\n\t\tcord = 2;\n\t}\n\t\n\treturn cord;\n}","function computeCenter(rect) {\n return {\n top: rect.top + (rect.height / 2),\n left: rect.left + (rect.width / 2)\n };\n}"],"string":"[\n \"function countBlackWhiteRun(origin, end, matrix, length) {\\n var rise = end.y - origin.y;\\n var run = end.x - origin.x;\\n var towardsEnd = countBlackWhiteRunTowardsPoint(origin, end, matrix, Math.ceil(length / 2));\\n var awayFromEnd = countBlackWhiteRunTowardsPoint(origin, { x: origin.x - run, y: origin.y - rise }, matrix, Math.ceil(length / 2));\\n var middleValue = towardsEnd.shift() + awayFromEnd.shift() - 1; // Substract one so we don't double count a pixel\\n return (_a = awayFromEnd.concat(middleValue)).concat.apply(_a, towardsEnd);\\n var _a;\\n}\",\n \"function countBlackWhiteRunTowardsPoint(origin, end, matrix, length) {\\n var switchPoints = [{ x: Math.floor(origin.x), y: Math.floor(origin.y) }];\\n var steep = Math.abs(end.y - origin.y) > Math.abs(end.x - origin.x);\\n var fromX;\\n var fromY;\\n var toX;\\n var toY;\\n if (steep) {\\n fromX = Math.floor(origin.y);\\n fromY = Math.floor(origin.x);\\n toX = Math.floor(end.y);\\n toY = Math.floor(end.x);\\n }\\n else {\\n fromX = Math.floor(origin.x);\\n fromY = Math.floor(origin.y);\\n toX = Math.floor(end.x);\\n toY = Math.floor(end.y);\\n }\\n var dx = Math.abs(toX - fromX);\\n var dy = Math.abs(toY - fromY);\\n var error = Math.floor(-dx / 2);\\n var xStep = fromX < toX ? 1 : -1;\\n var yStep = fromY < toY ? 1 : -1;\\n var currentPixel = true;\\n // Loop up until x == toX, but not beyond\\n for (var x = fromX, y = fromY; x !== toX + xStep; x += xStep) {\\n // Does current pixel mean we have moved white to black or vice versa?\\n // Scanning black in state 0,2 and white in state 1, so if we find the wrong\\n // color, advance to next state or end if we are in state 2 already\\n var realX = steep ? y : x;\\n var realY = steep ? x : y;\\n if (matrix.get(realX, realY) !== currentPixel) {\\n currentPixel = !currentPixel;\\n switchPoints.push({ x: realX, y: realY });\\n if (switchPoints.length === length + 1) {\\n break;\\n }\\n }\\n error += dy;\\n if (error > 0) {\\n if (y === toY) {\\n break;\\n }\\n y += yStep;\\n error -= dx;\\n }\\n }\\n var distances = [];\\n for (var i = 0; i < length; i++) {\\n if (switchPoints[i] && switchPoints[i + 1]) {\\n distances.push(distance(switchPoints[i], switchPoints[i + 1]));\\n }\\n else {\\n distances.push(0);\\n }\\n }\\n return distances;\\n}\",\n \"function center(iv) {\\n return Math.floor((iv.stop + iv.start) / 2);\\n }\",\n \"function center(iv: Interval) {\\n return Math.floor((iv.stop + iv.start) / 2);\\n }\",\n \"function CentreVideo() {\\n //console.log(\\\"R = \\\" + (image.data[3 * (image.width / 2) + 3 * (image.height / 2) * image.width]));\\n //console.log(\\\"G = \\\" + (image.data[3 * (image.width / 2) + 1 + 3 * (image.height / 2) * image.width]));\\n //console.log(\\\"B = \\\" + (image.data[3 * (image.width / 2) + 2 + 3 * (image.height / 2) * image.width]));\\n\\n for (var i = 3 * (image.width / 2); i < 5 * (image.width / 2); i += 4) {\\n for (var j = 3 * (image.height / 2) * image.width; j < 5 * (image.height / 2) * image.width; j += 4 * image.width) {\\n nbPoints++;\\n var red = image.data[i + j];\\n var green = image.data[i + j + 1];\\n var blue = image.data[i + j + 2];\\n\\n if (red > 192 && green < 128 && blue < 128) {\\n nbRedPoints++;\\n }\\n\\n image.data[i + j] = 255;\\n image.data[i + j + 1] = 0;\\n image.data[i + j + 2] = 0;\\n }\\n }\\n }\",\n \"function getOffsets(size) {\\n //THIS FUNCTION IS SO UGLY IM SO SORRY\\n let wO = (size * 1.732050808 / 2);\\n let hO = size;\\n let ans = [];\\n\\n let startingY = 50 - 2 * (hO * .75);\\n let startingX = 50 - wO;\\n\\n for (let i = 0; i < 3; i++) {\\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\\n }\\n\\n startingY = 50 - 1 * (hO * .75);\\n startingX = 50 - wO * (1.5);\\n\\n for (let i = 0; i < 4; i++) {\\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\\n }\\n\\n startingY = 50;\\n startingX = 50 - wO * (2);\\n\\n for (let i = 0; i < 5; i++) {\\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\\n }\\n\\n\\n\\n startingY = 50 + 1 * (hO * .75);\\n startingX = 50 - wO * (1.5);\\n\\n for (let i = 0; i < 4; i++) {\\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\\n }\\n\\n startingY = 50 + 2 * (hO * .75);\\n startingX = 50 - wO;\\n\\n\\n for (let i = 0; i < 3; i++) {\\n ans.push(`top:${startingY}%;left:${startingX + i * (wO)}%`)\\n }\\n return ans;\\n}\",\n \"function sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY, image) {\\r\\n\\t\\t fromX = Math.floor(fromX);\\r\\n\\t\\t fromY = Math.floor(fromY);\\r\\n\\t\\t toX = Math.floor(toX);\\r\\n\\t\\t toY = Math.floor(toY);\\r\\n\\t\\t // Mild variant of Bresenham's algorithm;\\r\\n\\t\\t // see http://en.wikipedia.org/wiki/Bresenham's_line_algorithm\\r\\n\\t\\t var steep = Math.abs(toY - fromY) > Math.abs(toX - fromX);\\r\\n\\t\\t if (steep) {\\r\\n\\t\\t var temp = fromX;\\r\\n\\t\\t fromX = fromY;\\r\\n\\t\\t fromY = temp;\\r\\n\\t\\t temp = toX;\\r\\n\\t\\t toX = toY;\\r\\n\\t\\t toY = temp;\\r\\n\\t\\t }\\r\\n\\t\\t var dx = Math.abs(toX - fromX);\\r\\n\\t\\t var dy = Math.abs(toY - fromY);\\r\\n\\t\\t var error = -dx >> 1;\\r\\n\\t\\t var xstep = fromX < toX ? 1 : -1;\\r\\n\\t\\t var ystep = fromY < toY ? 1 : -1;\\r\\n\\t\\t // In black pixels, looking for white, first or second time.\\r\\n\\t\\t var state = 0;\\r\\n\\t\\t // Loop up until x == toX, but not beyond\\r\\n\\t\\t var xLimit = toX + xstep;\\r\\n\\t\\t for (var x = fromX, y = fromY; x != xLimit; x += xstep) {\\r\\n\\t\\t var realX = steep ? y : x;\\r\\n\\t\\t var realY = steep ? x : y;\\r\\n\\t\\t // Does current pixel mean we have moved white to black or vice versa?\\r\\n\\t\\t // Scanning black in state 0,2 and white in state 1, so if we find the wrong\\r\\n\\t\\t // color, advance to next state or end if we are in state 2 already\\r\\n\\t\\t if ((state == 1) === image.get(realX, realY)) {\\r\\n\\t\\t if (state == 2) {\\r\\n\\t\\t return distance(x, y, fromX, fromY);\\r\\n\\t\\t }\\r\\n\\t\\t state++;\\r\\n\\t\\t }\\r\\n\\t\\t error += dy;\\r\\n\\t\\t if (error > 0) {\\r\\n\\t\\t if (y == toY) {\\r\\n\\t\\t break;\\r\\n\\t\\t }\\r\\n\\t\\t y += ystep;\\r\\n\\t\\t error -= dx;\\r\\n\\t\\t }\\r\\n\\t\\t }\\r\\n\\t\\t // Found black-white-black; give the benefit of the doubt that the next pixel outside the image\\r\\n\\t\\t // is \\\"white\\\" so this last point at (toX+xStep,toY) is the right ending. This is really a\\r\\n\\t\\t // small approximation; (toX+xStep,toY+yStep) might be really correct. Ignore this.\\r\\n\\t\\t if (state == 2) {\\r\\n\\t\\t return distance(toX + xstep, toY, fromX, fromY);\\r\\n\\t\\t }\\r\\n\\t\\t // else we didn't find even black-white-black; no estimate is really possible\\r\\n\\t\\t return NaN;\\r\\n\\t\\t}\",\n \"function search_start_pos(value) {\\n var N = height / $p.config.GRIDY; // target grid N\\n\\n var y = Infinity,\\n y$ = value,\\n count = 0;\\n\\n while (y > 0) {\\n y = Math.floor(math.log(y$) * self.A + self.B);\\n y$ *= self.$_mult;\\n if (count++ > N * 3) return 0; // Prevents deadloops\\n }\\n\\n return y$;\\n }\",\n \"function annot_offset(range_end){\\n var lines = editor.getSession().getDocument().getLines(0, range_end.row);\\n var total_off = 0;\\n var num_char;\\n\\n for(var i = 0; i < lines.length; i++){\\n num_char = lines[i].length;\\n total_off += parseInt((num_char - 1) / 80, 10);\\n }\\n\\n return total_off;\\n}\",\n \"function handlePossibleCenter(stateCount, i, j, moduleSize) {\\r\\n\\t\\t var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\\r\\n\\t\\t var centerJ = centerFromEnd(stateCount, j);\\r\\n\\t\\t if (centerJ == null) {\\r\\n\\t\\t return null;\\r\\n\\t\\t }\\r\\n\\t\\t var centerI = crossCheckVertical(i, Math.floor(centerJ), 2 * stateCount[1], stateCountTotal, moduleSize, image);\\r\\n\\t\\t if (centerI != null) {\\r\\n\\t\\t var estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3;\\r\\n\\t\\t for (var i2 in possibleCenters) {\\r\\n\\t\\t var center = possibleCenters[i2];\\r\\n\\t\\t // Look for about the same center and module size:\\r\\n\\t\\t if (aboutEquals(center, estimatedModuleSize, centerI, centerJ)) {\\r\\n\\t\\t return combineEstimate(center, centerI, centerJ, estimatedModuleSize);\\r\\n\\t\\t }\\r\\n\\t\\t }\\r\\n\\t\\t // Hadn't found this before; save it\\r\\n\\t\\t var point = { x: centerJ, y: centerI, estimatedModuleSize: estimatedModuleSize };\\r\\n\\t\\t possibleCenters.push(point);\\r\\n\\t\\t }\\r\\n\\t\\t return null;\\r\\n\\t\\t }\",\n \"function showPixelFinal(imageDataFinal, imageData, MAX_X, MAX_Y) {\\n\\tvar index = '';\\n\\tvar marginLeft = 0;\\n\\tvar marginTop = 0;\\n\\tfor (var i = 0; i < MAX_X; i++) {\\n\\t\\tfor (var j = 0; j < MAX_Y; j++) {\\n\\t\\t\\tif (imageData[i][j]) {\\n\\t\\t\\t\\tindex = (i + marginLeft + (j + marginTop) * MAX_X) * 4;\\n\\t\\t\\t\\t//console.log(imageData[i][j].x+\\\" \\\"+imageData[i][j].y+\\\" \\\"+index+\\\" \\\"+imageData[i][j].r+\\\" \\\"+imageData[i][j].g+\\\" \\\"+imageData[i][j].b+\\\" \\\"+\\\" \\\");\\n\\t\\t\\t\\timageDataFinal.data[index + 0] = imageData[i][j].r;\\n\\t\\t\\t\\timageDataFinal.data[index + 1] = imageData[i][j].g;\\n\\t\\t\\t\\timageDataFinal.data[index + 2] = imageData[i][j].b;\\n\\t\\t\\t\\timageDataFinal.data[index + 3] = imageData[i][j].a;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"function imageIndexOf(x,y) {\\n return x+(y+2)*(maxX+3)+topImages+3; } // This is the simplified version\",\n \"function getPixelCenter(x, y) {\\n\\tvar pixelX = x*(canvas.width/grid.x)+((canvas.width/grid.x)/2);\\n\\tvar pixelY = y*(canvas.height/grid.y)+((canvas.height/grid.y)/2);\\n\\treturn {\\\"x\\\": pixelX, \\\"y\\\": pixelY};\\n}\",\n \"function colorTracker(arg){\\n\\tcapture.loadPixels();\\n\\n\\tlet colLoc = [0,0];\\n\\tlet colDist = 600;\\n\\n\\t for(let bY =0; bY < capture.height; bY++){\\n\\t \\tfor(let bX=0;bX p === '-' || p === '|').length;\\n const ind = [];\\n for (let i = 0; i < 8; i++) {\\n if (n[i] === '-' || n[i] === '|') ind.push(i);\\n }\\n\\n switch (edges) {\\n\\n case 2:\\n switch (ind[0]) {\\n case 1: \\n return ind[1] === 3 ? (n[0] === n[7] ? 2 : 1) : (n[2] === n[5] ? 2 : 1);\\n case 3: \\n return n[2] === n[5] ? 2 : 1;\\n case 4: \\n return n[0] === n[7] ? 2 : 1;\\n }\\n\\n case 3: \\n return n.filter(p => p === ' ').length === 5 ? 3 : 2;\\n\\n case 4:\\n return n.filter(p => p === ' ').length;\\n }\\n }\",\n \"computeCenter() {\\n self.centerX = self.screenX + self.screenDisplacementX;\\n self.centerY = self.screenY + self.screenDisplacementY;\\n }\",\n \"findCenter() {\\n return {\\n x: (this.right - this.left)/2 + this.left,\\n y: (this.bottom - this.top)/2 + this.top\\n };\\n }\",\n \"calculateAtDesiredPos() {\\n let counter = 0;\\n for (let i = 0; i < this.num_rows; i++) {\\n for (let j = 0; j < this.num_cols; j++) {\\n if (this.isAtDesiredPos([i, j], this.board[i][j])) counter++;\\n }\\n }\\n return counter;\\n }\",\n \"function placePieceForSearch(row, col, color, board){\\n //start and end are arrays with the starting and ending indices of the pieces boxing in those to be changed\\n if(color == \\\"white\\\")\\n { \\n board[row][col] = nextwhitePieceId;\\n nextwhitePieceId+=2; \\n }\\n else{\\n \\n board[row][col] = nextblackPieceId;\\n nextblackPieceId+=2;\\n } \\n replaceMiddlePiecesForSearch(row,col)\\n}\",\n \"leg(loc, x, y, start_val){\\n\\t\\tvar cur_val = start_val\\n\\t\\tvar stop = false\\n\\t\\tvar check_loc = []\\n\\t\\twhile(!stop){\\n\\t\\t\\tloc[0] += x\\n\\t\\t\\tloc[1] += y\\n\\n\\t\\t\\t// I'm sure there is a mathish way to do this. I'm just lazy right now.\\n\\t\\t\\t// This sets up the cell coordinates to look at for an empty spot.\\n\\t\\t\\tif(y == -1){\\n\\t\\t\\t\\tcheck_loc[0] = loc[0] - 1\\n\\t\\t\\t\\tcheck_loc[1] = loc[1]\\n\\t\\t\\t}else if (x == -1) {\\n\\t\\t\\t\\tcheck_loc[0] = loc[0]\\n\\t\\t\\t\\tcheck_loc[1] = loc[1] + 1\\n\\t\\t\\t}else if (y == 1){\\n\\t\\t\\t\\tcheck_loc[0] = loc[0] + 1\\n\\t\\t\\t\\tcheck_loc[1] = loc[1]\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tcheck_loc[0] = loc[0]\\n\\t\\t\\t\\tcheck_loc[1] = loc[1] - 1\\n\\t\\t\\t}\\n\\n\\t\\t\\tcur_val += 1\\n\\t\\t\\tif(this.tbl.rows.length - 1 < loc[1] || this.tbl.rows[loc[1]].cells.length - 1 < loc[0]){\\n\\t\\t\\t\\tthrow new RangeError(\\\"outta room\\\")\\n\\t\\t\\t}\\n\\t\\t\\tthis.tbl.rows[loc[1]].cells[loc[0]].innerHTML = cur_val\\n\\t\\t\\t// give a faint crosshair so we can find the center on larger blocks.\\n\\t\\t\\tif(loc[0] == this.center || loc[1] == this.center){\\n\\t\\t\\t\\tthis.tbl.rows[loc[1]].cells[loc[0]].style.backgroundColor = \\\"#DDDDDD\\\"\\n\\t\\t\\t}\\n\\t\\t\\tthis.formatPrime(loc[0], loc[1])\\n\\t\\t\\tstop = this.tbl.rows[check_loc[1]].cells[check_loc[0]].innerHTML == this.filler\\n\\t\\t}\\n\\n\\t\\treturn cur_val\\n\\t}\",\n \"function northeast(n) {\\n var level = bottoms[n];\\n var count = 0;\\n\\n for (var i = 1; ((n + i) <= 6) && ((level - i) >= 0); i++) {\\n var square = document.getElementsByClassName(\\\"row\\\").item(level - i)\\n .getElementsByClassName(\\\"bigSquare\\\").item(n + i);\\n if (square.style.backgroundColor == color(currentTurn)) {\\n count++;\\n }\\n else return count;\\n }\\n return count;\\n }\",\n \"calcCoordsForCenter(tileRow, tileCol, width, height, tileSize) {\\n const tileXCenter = tileSize * (tileCol + 0.5);\\n const tileYCenter = tileSize * (tileRow + 0.5);\\n const dstX = tileXCenter - width * 0.5;\\n const dstY = tileYCenter - height * 0.5;\\n return [dstX, dstY];\\n }\",\n \"getBlockIndex(screenX, screenY) {\\n let col = Math.floor(screenX * this.col / window.innerWidth);\\n let row = Math.floor(screenY * this.row / window.innerHeight);\\n return [row, col];\\n }\",\n \"center() {\\n let x_center = 0, y_center = 0;\\n const coords = this.getCoords();\\n for (let axis = 0; axis < coords.length; axis ++) {\\n let [i, j] = num_60rotations(2*axis);\\n x_center += i * coords[axis];\\n y_center += j * coords[axis];\\n }\\n return [x_center, y_center];\\n }\",\n \"function calculateCentroidPositions() { // x location, y location, count, sum of square distances\\n clearCentroidPositions();\\n addupXYPositions();\\n // scale sums by count....to calculate averages\\n normalizeCentroidByColorTypeCount(colorCentroidStructure);\\n sumOfSquares();\\n }\",\n \"function bottom_Y(){\\r\\n\\r\\n\\tvar imgd = ctx.getImageData(0,0, c.width,c.height);\\r\\n\\t//var pix_array = imgd.data;\\r\\n\\r\\n\\tfor(var y = c.height - 1; y >= 0 ; y--){\\r\\n\\t\\tfor(var x = 0; x < c.width; x++){\\r\\n\\t\\r\\n\\t\\t\\tvar index = (x + y * imgd.width) * 4;\\r\\n\\r\\n\\t\\t\\tif(imgd.data[index+0] == 0 &&\\r\\n\\t\\t\\t\\timgd.data[index+1] == 0 &&\\r\\n\\t\\t\\t\\timgd.data[index+2] == 0){\\r\\n\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t// if(seen == false){\\r\\n\\t\\t\\t\\t// \\tconsole.log(\\\"bottom_Y is: \\\" + y);\\r\\n\\t\\t\\t\\t// \\tseen = true;\\r\\n\\t\\t\\t\\t// }\\r\\n\\r\\n\\t\\t\\t\\treturn y;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\r\\n\\r\\n\\t// if(seen == false){\\r\\n\\t// \\tconsole.log(\\\"eek! error! Didn't see any black unfortunately.\\\");\\r\\n\\t// \\tseen = true;\\r\\n\\t// }\\r\\n}\",\n \"tile_normalized_coord() {\\n\\t\\tvar rect = this.canvas.getBoundingClientRect();\\n\\t\\tvar x = this.cursor_x - rect.left + this.current_x;\\n\\t\\tvar y = this.cursor_y - rect.top + this.current_y;\\n\\t\\tvar row = y / this.tile_size;\\n\\t\\tvar col = x / this.tile_size;\\n\\t\\treturn [col, row]\\n\\t}\",\n \"function getCenter(character) {\\n var index = (consonants.indexOf(character) % centers.length);\\n return centers[index];\\n}\",\n \"cell_centre_at_position(position) {\\n return new Offset(\\n this.cell_size(this.cell_width, position.x) / 2,\\n this.cell_size(this.cell_height, position.y) / 2,\\n );\\n }\",\n \"function calculateColor(begin, end, pos) {\\n var color = 'rgba('\\n + parseInt((begin[0] + pos * (end[0] - begin[0])), 10) + ','\\n + parseInt((begin[1] + pos * (end[1] - begin[1])), 10) + ','\\n + parseInt((begin[2] + pos * (end[2] - begin[2])), 10);\\n\\n color += ',' + (begin && end ? parseFloat(begin[3] + pos * (end[3] - begin[3])) : 1);\\n color += ')';\\n return color;\\n }\",\n \"function calculateColor(begin, end, pos) {\\n var color = 'rgba('\\n + parseInt((begin[0] + pos * (end[0] - begin[0])), 10) + ','\\n + parseInt((begin[1] + pos * (end[1] - begin[1])), 10) + ','\\n + parseInt((begin[2] + pos * (end[2] - begin[2])), 10);\\n\\n color += ',' + (begin && end ? parseFloat(begin[3] + pos * (end[3] - begin[3])) : 1);\\n color += ')';\\n return color;\\n }\",\n \"function calculateColor(begin, end, pos) {\\n var color = 'rgba('\\n + parseInt((begin[0] + pos * (end[0] - begin[0])), 10) + ','\\n + parseInt((begin[1] + pos * (end[1] - begin[1])), 10) + ','\\n + parseInt((begin[2] + pos * (end[2] - begin[2])), 10);\\n\\n color += ',' + (begin && end ? parseFloat(begin[3] + pos * (end[3] - begin[3])) : 1);\\n color += ')';\\n return color;\\n }\",\n \"centerPosition() {\\n return [this.clientWidth() / 2, this.clientHeight() / 2, ];\\n }\",\n \"function centerOf(text) {\\n let center = Math.floor(text.length / 2);\\n if (text.length % 2 === 1) {\\n return text[center];\\n }\\n\\n return text[center - 1] + text[center];\\n}\",\n \"getStartingPosition() {\\n const left = this.generateRandomPosition();\\n\\n // If the `left` value lies in the restricted range, then top cannot lie there.\\n // This prevents streak generation with a certain radius from the center. (imporves aesthetic appeal)\\n const restrictiveFlag =\\n (left > Streak.positionLimits[this.attributes.type].lower) &&\\n (left < Streak.positionLimits[this.attributes.type].upper)\\n ;\\n const top = this.generateRandomPosition(restrictiveFlag);\\n\\n return { left, top };\\n }\",\n \"function countCoordinate (val){\\n return (val * side ) + (side / 2);\\n}\",\n \"function evaluate_corners () {\\r\\n\\tfor (a = 0; a < 2; a++) {\\r\\n\\t\\tif (start[a] < end[a]) {\\r\\n\\t\\t\\ttop_left[a] = start[a];\\r\\n\\t\\t\\tbottom_right[a] = end[a];\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\ttop_left[a] = end[a];\\r\\n\\t\\t\\tbottom_right[a] = start[a];\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\trwidth = bottom_right[0] - top_left[0];\\r\\n\\trheight = bottom_right[1] - top_left[1];\\r\\n\\t// set text\\r\\n\\ttlc.innerHTML = \\\"Top Left: [\\\" + top_left[0] + \\\",\\\" + top_left[1] + \\\"]\\\";\\r\\n\\tbrc.innerHTML = \\\"Bottom Right: [\\\" + bottom_right[0] + \\\",\\\" + bottom_right[1] + \\\"]\\\";\\r\\n}\",\n \"function incrNeighbors(rC, cC) { // Center is at (rC, cC)\\n for (var rN = rC+drA; rN <= rC+drB; rN++) { // Neighbor row\\n for (var cN = cC+dcA; cN <= cC+dcB; cN++) { // Neighbor col\\n if (! bMap[rN][cN]) { cMap[rN][cN]++; } // Increment non-mine pixels\\n }\\n }\\n }\",\n \"function color_starting_square(ctx, num_canvas_cells, x_offset, y_offset)\\r\\n{\\r\\n ctx.save( );\\r\\n ctx.fillStyle = 'black';\\r\\n\\r\\n // rect(the x cord in the upper left corner, the y cord of the upper left rect, width, height)\\r\\n ctx.rect(x_offset + ((Math.floor(num_canvas_cells / 2) - 1) * 5), y_offset, 5, 5);\\r\\n ctx.fill();\\r\\n ctx.restore( );\\r\\n}\",\n \"function point2ColorPos(pt, imgSize) {\\n return ((pt.y - 1) * imgSize.w * 4) + (pt.x * 4 - 4);\\n}\",\n \"function drawCenterStars(num)\\n{\\n \\n}\",\n \"function centerPosition(el) {\\n var pageSize = getPageSize(),\\n dim = el.getDimensions(),\\n offsets = el.cumulativeOffset(),\\n d = getImgSize(dim),\\n\\n top = (offsets.top + (pageSize.height - d.height) / 2),\\n left = (offsets.left + (pageSize.width - d.width) / 2),\\n right = (offsets.left + (pageSize.width + d.width) / 2);\\n\\n return {width: dim.width, height: dim.height, top: top, left: left, right: right}\\n}\",\n \"function kMove(color, start, end) {\\n var dif1 = start[0] - end[0];\\n var dif2 = start[1] - end[1];\\n \\n if (Math.abs(dif1) >= 2 || Math.abs(dif2) >= 2) {\\n return false;\\n } else if (isSquareOccupied(end[0], end[1])) {\\n return take(color, end[0], end[1]);\\n }\\n return true;\\n}\",\n \"matchStartColor(pixelPos) {\\n var pixelColor = this.getPixelColor(this.colorLayerData, pixelPos);\\n var v = this.matchClickedColor(pixelColor.r, pixelColor.g, pixelColor.b, pixelColor.a);\\n return v;\\n }\",\n \"static CenteredPosition(position, out = new b2.Vec2()) {\\n return out.Set(position.x + FrackerSettings.k_tileHalfWidth, position.y + FrackerSettings.k_tileHalfHeight);\\n }\",\n \"function xyOffsetIndex(i, x, y, w, h) {\\n var index = i + x + y * w;\\n var absx = (i % w) + x;\\n if (absx < 0 && index < 0 || absx >= w && index >= w * h) {\\n return i - x - y * w;\\n }\\n if (absx < 0 || absx >= w) { // if off the left.\\n return i - x + y * w;\\n }\\n //var absy = index - (w * y)\\n if (index < 0 || index >= w * h) { // if off top/bottom.\\n return i + x - y * w;\\n }\\n return index;\\n}\",\n \"north(x,y,count){\\r\\n if(count >= 5){\\r\\n return true;\\r\\n }\\r\\n else if(y-1 >= 0 && this.getColor(x,y) === this.getColor(x,y-1)){//point must exist\\r\\n return this.north(x, y-1, count+1);\\r\\n }\\r\\n return(count >= 5);\\r\\n }\",\n \"function count_color(current_coordinate, desired_color, desired_direction, current_count) {\\n\\t\\t\\t\\tlet next_coordinate = [current_coordinate[0] + desired_direction[0],\\n\\t\\t\\t\\tcurrent_coordinate[1] + desired_direction[1]];\\n\\t\\t\\t\\tconsole.log(next_coordinate);\\n\\t\\t\\t\\tif (piece_position[next_coordinate[0]] && piece_position[next_coordinate[0]][next_coordinate[1]]) {\\n\\t\\t\\t\\t\\tif (piece_position[next_coordinate[0]][next_coordinate[1]].color != desired_color)\\n\\t\\t\\t\\t\\t\\treturn current_count;\\n\\t\\t\\t\\t\\tcurrent_count += 1;\\n\\t\\t\\t\\t\\tif (current_count == 3)\\n\\t\\t\\t\\t\\t\\treturn current_count;\\n\\t\\t\\t\\t\\treturn count_color(next_coordinate, desired_color, desired_direction, current_count);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn current_count;\\n\\t\\t\\t}\",\n \"basePixelOffset(m, p, x, y, k) {\\n\\tvar t = this;\\n\\treturn ((m*(t.nplanes+1) + p)*t.resolution*t.resolution + (x + y*t.resolution))*3 + k;\\n}\",\n \"function calculateCenter (array) {\\n \\n var x = 0, y = 0;\\n\\n array.forEach(function(point){\\n x += point.x;\\n y += point.y;\\n });\\n\\n x = x / array.length;\\n y = y / array.length;\\n\\n return {x: x,y: y};\\n\\n}\",\n \"function getOffset() {\\n if (innerHeight < 600 || innerWidth < 1000) {\\n return 105;\\n }\\n else {\\n return 55;\\n }\\n}\",\n \"setCenter() {\\n let x = 0;\\n let y = 0;\\n for (let v of this.pixelVectorPositions) {\\n x += v.x;\\n y += v.y;\\n }\\n\\n x /= this.pixelVectorPositions.length;\\n y /= this.pixelVectorPositions.length;\\n this.center = createVector(x, y);\\n }\",\n \"function center(x1, y1, x2, y2, width, height) {\\n\\tif ((x1 >= x2 && x1 <= x2 + width))\\n\\t\\tif ((y1 >= y2 && y1 <= y2 + height))\\n\\t\\t\\treturn true;\\n\\t\\treturn false;\\n}\",\n \"function getPixelRange() {\\r\\n\\t\\t$this = $['mapsettings'].element;\\r\\n\\t\\tvar xstart = 0;\\r\\n\\t\\tvar ystart = 0;\\r\\n\\t\\tif($['mapsettings'].initLeft<0) xstart = Math.abs($['mapsettings'].initLeft);\\r\\n\\t\\tif($['mapsettings'].initTop<0) ystart = Math.abs($['mapsettings'].initTop);\\r\\n\\t\\txstart = getFirstXPosInRange(xstart);\\r\\n\\t\\t// Makes sure that ystart values are multiples of 256 and start before viewport\\r\\n\\t\\tif(ystart%256!=0) ystart=((parseInt(ystart/256))-1)*256;\\r\\n\\t\\tvar xend = $this.innerWidth() - $['mapsettings'].initLeft;\\r\\n\\t\\tvar yend = $this.innerHeight() - $['mapsettings'].initTop;\\r\\n\\t\\treturn {\\r\\n\\t\\t\\t\\\"start\\\": {\\r\\n\\t\\t\\t\\t\\\"x\\\": xstart,\\r\\n\\t\\t\\t\\t\\\"y\\\": ystart\\r\\n\\t\\t\\t},\\r\\n\\t\\t\\t\\\"end\\\": {\\r\\n\\t\\t\\t\\t\\\"x\\\": xend,\\r\\n\\t\\t\\t\\t\\\"y\\\": yend\\r\\n\\t\\t\\t}\\r\\n\\t\\t};\\r\\n\\t}\",\n \"function colorFigures(colors, current_position) {\\n\\n\\tvar chosen_color;\\n\\t//console.log(current_position);\\n\\tvar left = current_position.indexOf(\\\"left\\\");\\n\\tvar right = current_position.indexOf(\\\"right\\\");\\n\\tvar center = current_position.indexOf(\\\"center\\\");\\n\\n\\tif (left >= 0) {\\n\\n\\t\\tchosen_color = colors[0];\\n\\n\\t} else if (right >= 0) {\\n\\n\\t\\tchosen_color = colors[1];\\n\\n\\t} else if (center >= 0) {\\n\\n\\t\\tchosen_color = colors[2];\\n\\n\\t}\\n\\n\\treturn chosen_color;\\n\\n}\",\n \"function drawMiddlePartition() {\\n for(let i = 5; i <= height; i+=30) {\\n rect(400, i, 5, 20);\\n fill(255, 255, 255);\\n }\\n}\",\n \"function midline()\\r\\n{\\r\\nfor(i=0;i<480;i+=10)\\r\\n{\\r\\nvar y = 0;\\r\\nfill(\\\"white\\\");\\r\\nstroke(0);\\r\\nrect(width/2,y+i,10,480);\\r\\n}\\r\\n}\",\n \"function findSquare(mazeimg, locations) {\\n var x = locations[0].x;\\n var y = locations[0].y;\\n var color;\\n var hexcolor;\\n\\n do {\\n x--;\\n hexcolor = mazeimg.getPixelColor(x, y);\\n color = Jimp.intToRGBA(hexcolor);\\n } while (color.r == 255 && color.g == 0 && color.b == 0);\\n\\n hexcolor = mazeimg.getPixelColor(x + 17, y);\\n color = Jimp.intToRGBA(hexcolor);\\n if (color.r == 255 && color.g == 0 && color.b == 0) {\\n x += 1;//move back inside the red square\\n do {\\n y--;\\n hexcolor = mazeimg.getPixelColor(x, y);\\n color = Jimp.intToRGBA(hexcolor);\\n } while (color.r == 255 && color.g == 0 && color.b == 0);\\n\\n hexcolor = mazeimg.getPixelColor(x, y + 17);\\n color = Jimp.intToRGBA(hexcolor);\\n if (color.r == 255 && color.g == 0 && color.b == 0) {\\n //location 1 is the square\\n console.log(\\\"found Start (circle) at \\\", locations[1]);\\n console.log(\\\"found End (square) at \\\", locations[0]);\\n return 1;\\n }\\n }\\n //didnt find square at location 1 so it must be location 2\\n console.log(\\\"found Start (circle) at \\\", locations[0]);\\n console.log(\\\"found End (square) at \\\", locations[1]);\\n\\n return 0;\\n}\",\n \"function sizeOfBlackWhiteBlackRunBothWays(fromX, fromY, toX, toY, image) {\\r\\n\\t\\t var result = sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY, image);\\r\\n\\t\\t // Now count other way -- don't run off image though of course\\r\\n\\t\\t var scale = 1;\\r\\n\\t\\t var otherToX = fromX - (toX - fromX);\\r\\n\\t\\t if (otherToX < 0) {\\r\\n\\t\\t scale = fromX / (fromX - otherToX);\\r\\n\\t\\t otherToX = 0;\\r\\n\\t\\t }\\r\\n\\t\\t else if (otherToX >= image.width) {\\r\\n\\t\\t scale = (image.width - 1 - fromX) / (otherToX - fromX);\\r\\n\\t\\t otherToX = image.width - 1;\\r\\n\\t\\t }\\r\\n\\t\\t var otherToY = (fromY - (toY - fromY) * scale);\\r\\n\\t\\t scale = 1;\\r\\n\\t\\t if (otherToY < 0) {\\r\\n\\t\\t scale = fromY / (fromY - otherToY);\\r\\n\\t\\t otherToY = 0;\\r\\n\\t\\t }\\r\\n\\t\\t else if (otherToY >= image.height) {\\r\\n\\t\\t scale = (image.height - 1 - fromY) / (otherToY - fromY);\\r\\n\\t\\t otherToY = image.height - 1;\\r\\n\\t\\t }\\r\\n\\t\\t otherToX = (fromX + (otherToX - fromX) * scale);\\r\\n\\t\\t result += sizeOfBlackWhiteBlackRun(fromX, fromY, otherToX, otherToY, image);\\r\\n\\t\\t return result - 1; // -1 because we counted the middle pixel twice\\r\\n\\t\\t}\",\n \"function getTileIndexes(x, y) {\\r\\n \\r\\n var l = Math.floor(x/(w_tuile + padding));\\r\\n var c = Math.floor(y/(h_tuile + padding));\\r\\n var pad_x = x - l*(w_tuile + padding);\\r\\n var pad_y = y - c*(h_tuile + padding);\\r\\n \\r\\n console.log(pad_x +\\\" , \\\" + pad_y);\\r\\n \\r\\n if(pad_x < padding/2 || pad_x > w_tuile+padding/2) {\\r\\n \\treturn null;\\r\\n }\\r\\n \\r\\n if(pad_y < padding/2 || pad_y > h_tuile+padding/2) {\\r\\n \\treturn null;\\r\\n }\\r\\n \\r\\n console.log(\\\"C = \\\" + c + \\\", L = \\\" + l);\\r\\n return {i: c, j: l};\\r\\n}\",\n \"setCenter() {\\n let x = 0;\\n let y = 0;\\n for (var v of this.pixelVectorPositions) {\\n x += v.x;\\n y += v.y;\\n }\\n\\n x /= this.pixelVectorPositions.length;\\n y /= this.pixelVectorPositions.length;\\n this.center = createVector(x, y);\\n\\n }\",\n \"function ComputeOutCode(x, y, xmin, ymin, xmax, ymax)\\n{\\n var code;\\n\\n code = INSIDE; // initialised as being inside of [[clip window]]\\n\\n if (x < xmin) // to the left of clip window\\n code |= LEFT;else\\n if (x > xmax) // to the right of clip window\\n code |= RIGHT;\\n if (y < ymin) // below the clip window\\n code |= BOTTOM;else\\n if (y > ymax) // above the clip window\\n code |= TOP;\\n\\n return code;\\n}\",\n \"centre_offset_from_position(position) {\\n const offset = this.offset_from_position(position);\\n const centre = this.cell_centre_at_position(position);\\n return offset.add(centre);\\n }\",\n \"function east(n) {\\n var level = bottoms[n];\\n var count = 0;\\n\\n for (var i = 1; (n + i) <= 6; i++) {\\n var square = document.getElementsByClassName(\\\"row\\\").item(level)\\n .getElementsByClassName(\\\"bigSquare\\\").item(n + i);\\n if (square.style.backgroundColor == color(currentTurn)) {\\n count++;\\n }\\n else return count;\\n }\\n return count;\\n }\",\n \"blocksTravelled(){\\n let horizontal = Math.abs(eastWest.indexOf(this.beginningLocation.horizontal) - eastWest.indexOf(this.endingLocation.horizontal))\\n let vertical = Math.abs(parseInt(this.beginningLocation.vertical)-parseInt(this.endingLocation.vertical))\\n return (horizontal + vertical);\\n }\",\n \"getEndPosition(widget) {\\n let left = widget.x;\\n let top = widget.y;\\n let lineWidget = undefined;\\n if (widget.childWidgets.length > 0) {\\n lineWidget = widget.childWidgets[widget.childWidgets.length - 1];\\n left += this.getWidth(lineWidget, false);\\n }\\n if (!isNullOrUndefined(lineWidget)) {\\n top = this.getTop(lineWidget);\\n }\\n let topMargin = 0;\\n let bottomMargin = 0;\\n let size = this.getParagraphMarkSize(widget, topMargin, bottomMargin);\\n return new Point(left, top + size.topMargin);\\n }\",\n \"function scanCircle(x, y, h, k, setPixel) {\\n // top-right quad\\n drawVertical(x + h, y + h, y + k, setPixel);\\n drawHorizontal(x + h + 1, x + k, y + h, setPixel);\\n // bottom-left quad\\n const yOff = h == 0 ? -1 : 0;\\n drawVertical(x - h, y - k, y - h + yOff, setPixel);\\n drawHorizontal(x - k, x - h - 1, y - h, setPixel);\\n\\n // don't repeat on axes\\n if(h > 0) {\\n // top-left quad\\n drawVertical(x - h, y + h, y + k, setPixel);\\n drawHorizontal(x - k, x - h - 1, y + h, setPixel);\\n // bottom-right quad\\n drawVertical(x + h, y - k, y - h, setPixel);\\n drawHorizontal(x + h + 1, x + k, y - h, setPixel);\\n }\\n}\",\n \"function getCentreX(array) {\\n const len = array.length;\\n\\n if (len % 2 === 0) {\\n const secondI = len / 2;\\n const second = array[secondI];\\n\\n const firstI = secondI - 1;\\n const first = array[firstI];\\n\\n if (first > second)\\n return firstI;\\n\\n return secondI;\\n }\\n\\n return (len - 1) / 2;\\n }\",\n \"function calcCenter(){\\r\\n\\t\\tvar i;\\r\\n\\t\\tvar latAverage = 0;\\r\\n\\t\\tfor(i = 0; i < latArray.length; i++){\\r\\n\\t\\t\\tlatAverage = latAverage + latArray[i];\\r\\n\\t\\t}\\r\\n\\t\\tlatAverage = latAverage/latArray.length;\\r\\n\\t\\t\\r\\n\\t\\tfor(i = 0; i < lonArray.length; i++){\\r\\n\\t\\t\\tlonAverage = lonAverage + lonArray[i];\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tlonAverage = lonAverage / lonArray.length;\\r\\n\\t\\t\\r\\n\\t\\t/*\\r\\n\\t\\t\\tPrints the location out on the screen\\r\\n\\t\\t*/\\r\\n\\t\\t\\r\\n\\t\\tdocument.getElementById(\\\"latitudeDiv\\\").innerHTML = latAverage;\\r\\n\\t\\tdocument.getElementById(\\\"longitudeDiv\\\").innerHTML = lonAverage;\\r\\n\\t}\",\n \"function posforblock(block, axis, x, y) {\\n var c = 3 * (block % 3);\\n var r = (block - block % 3);\\n if (axis == 0) { c += x; r += y; }\\n else { c += y; r += x; }\\n c = c % 9;\\n r = r % 9;\\n return r * 9 + c;\\n}\",\n \"function posforblock(block, axis, x, y) {\\n var c = 3 * (block % 3);\\n var r = (block - block % 3);\\n if (axis == 0) { c += x; r += y; }\\n else { c += y; r += x; }\\n c = c % 9;\\n r = r % 9;\\n return r * 9 + c;\\n}\",\n \"function calculateMapTilePosition(){\\n\\t\\tvar mnwCurrentView = $('mnwCurrentView');\\n\\t\\tvar calcLeft = mnwCurrentView.style.left;\\n\\t\\tvar calcTop = mnwCurrentView.style.top;\\t\\t\\n\\t\\tvar c_top = Math.floor(VIEWPORT_HEIGHT/2);\\n\\t\\tvar c_left = Math.floor(VIEWPORT_WIDTH/2);\\n\\t\\tcalcLeft = calcLeft.replace('px','')*1;\\n\\t\\tcalcTop = calcTop.replace('px','')*1;\\n\\t\\tcalcLeft = calcLeft * mnwScale + c_left;\\n\\t\\tcalcTop = calcTop * mnwScale + c_top;\\n\\t\\tgoToMapPosition(calcTop,calcLeft);\\n\\t\\tloadCurrentMapArea();\\n\\t}\",\n \"function calculateCenter(){\\n center = map.getCenter();\\n }\",\n \"function box_get_centroid(dst, dst_off, src, src_off) {\\n\\t dst[dst_off] = 0.5 * (src[src_off] + src[src_off + 3]);\\n\\t dst[dst_off + 1] = 0.5 * (src[src_off + 1] + src[src_off + 4]);\\n\\t dst[dst_off + 2] = 0.5 * (src[src_off + 2] + src[src_off + 5]);\\n\\t }\",\n \"function getRectCenterOffset(rect) {\\n return { x: rect.width / 2, y: rect.height / 2 };\\n }\",\n \"function virtical_location(y, sizey){\\n\\t \\tif(((y+sizey)/tileHeight)%1 >= 0.5){\\n\\t \\t\\treturn Math.ceil((y+sizey)/tileHeight)+1\\n\\t \\t} else {\\n\\t \\t\\treturn Math.floor((y+sizey)/tileHeight)+1;\\n\\t \\t}\\n\\t }\",\n \"function findTargetSpots(cells, fromIndex) {\\n if (cells[fromIndex.color] === \\\"\\\") {\\n return []\\n }\\n\\n let result = []\\n\\n const fromRow = Math.trunc(fromIndex / NO_COLS)\\n const fromCol = fromIndex % NO_COLS\\n\\n // left\\n let tmpCol = fromCol\\n while (--tmpCol >= 0) {\\n const tmpIdx = (fromRow * NO_COLS) + tmpCol\\n if (cells[tmpIdx].color !== \\\"\\\") {\\n if (tmpIdx + 1 !== fromIndex) {\\n result.push(tmpIdx + 1)\\n }\\n break\\n }\\n }\\n\\n // right\\n tmpCol = fromCol\\n while (++tmpCol < NO_COLS) {\\n const tmpIdx = (fromRow * NO_COLS) + tmpCol\\n if (cells[tmpIdx].color !== \\\"\\\"){\\n if (tmpIdx - 1 !== fromIndex) {\\n result.push(tmpIdx - 1)\\n }\\n break\\n }\\n }\\n\\n // top\\n let tmpRow = fromRow\\n while (--tmpRow >= 0) {\\n const tmpIdx = (tmpRow * NO_COLS) + fromCol\\n if (cells[tmpIdx].color !== \\\"\\\") {\\n if (tmpIdx + NO_COLS !== fromIndex) {\\n result.push(tmpIdx + NO_COLS)\\n }\\n break\\n }\\n }\\n\\n // down\\n tmpRow = fromRow\\n while (++tmpRow < NO_ROWS) {\\n const tmpIdx = (tmpRow * NO_COLS) + fromCol\\n if (cells[tmpIdx].color !== \\\"\\\") {\\n if (tmpIdx - NO_COLS !== fromIndex) {\\n result.push(tmpIdx - NO_COLS)\\n }\\n break\\n }\\n }\\n\\n return result\\n}\",\n \"offset() {\\n if (this.overlap) return this.dot ? 8 : 12;\\n return this.dot ? 2 : 4;\\n }\",\n \"function top_Y(){\\r\\n\\r\\n\\tvar imgd = ctx.getImageData(0,0, c.width,c.height);\\r\\n\\t//var pix_array = imgd.data;\\r\\n\\r\\n\\tfor(var y = 0; y < c.height; y++){\\r\\n\\t\\tfor(var x = 0; x < c.width; x++){\\r\\n\\r\\n\\t\\t\\tvar index = (x + y * imgd.width) * 4;\\r\\n\\r\\n\\t\\t\\tif(imgd.data[index+0] == 0 &&\\r\\n\\t\\t\\t\\timgd.data[index+1] == 0 &&\\r\\n\\t\\t\\t\\timgd.data[index+2] == 0){\\r\\n\\r\\n\\t\\t\\t\\t// if(seen == false){\\r\\n\\t\\t\\t\\t// \\tconsole.log(\\\"22top_Y is: \\\" + y);\\r\\n\\t\\t\\t\\t// \\tseen = true;\\r\\n\\t\\t\\t\\t// }\\r\\n\\r\\n\\t\\t\\t\\treturn y;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\r\\n\\r\\n\\t// if(seen == false){\\r\\n\\t// \\tconsole.log(\\\"eek! error! Didn't see any black unfortunately.\\\");\\r\\n\\t// \\tseen = true;\\r\\n\\t// }\\r\\n}\",\n \"getEndPosition() {\\n const radius = (this.tunnelWidth - 1) / 2\\n if (this.direction === 'NORTH') {\\n return { x: this.x + radius, y: this.y }\\n } else if (this.direction === 'SOUTH') {\\n return { x: this.x + radius, y: (this.y + this.height) - 1 }\\n } else if (this.direction === 'EAST') {\\n return { x: (this.x + this.width) - 1, y: this.y + radius }\\n } else if (this.direction === 'WEST') {\\n return { x: this.x, y: this.y + radius }\\n }\\n return null\\n }\",\n \"function computeDiscCoordinates(col, row) {\\n let xpos = sizes.initialx + sizes.size / 2 + col * sizes.size;\\n let ypos = sizes.initialy + sizes.ysize - sizes.size / 2 - row * sizes.size;\\n return { x: xpos, y: ypos };\\n}\",\n \"function getWithinFrame(i, x, y, frameWidth, frameHeight, totalWidth) {\\n const row = Math.floor(i / 4 / totalWidth)\\n const col = Math.floor(i / 4) % totalWidth\\n if (col >= x && col < x + frameWidth && row >= y && row < y + frameHeight) {\\n return ((row - y) * frameWidth + (col - x)) * 4\\n }\\n\\n return -1\\n}\",\n \"function squareCenterWin(){\\n\\n}\",\n \"function southeast(n) {\\n var level = bottoms[n];\\n var count = 0;\\n\\n for (var i = 1; ((n + i) <= 6) && ((level + i) <= 5); i++) {\\n var square = document.getElementsByClassName(\\\"row\\\").item(level + i)\\n .getElementsByClassName(\\\"bigSquare\\\").item(n + i);\\n if (square.style.backgroundColor == color(currentTurn)) {\\n count++;\\n }\\n else return count;\\n }\\n return count;\\n }\",\n \"function getCenter(a, b) {\\n return {\\n x: (b.x + a.x) / 2,\\n y: (b.y + a.y) / 2\\n };\\n}\",\n \"getPixelCoordsFromTileIndex(i) {\\n return {\\n x: (i % this.width.tiles) * this.tileSize,\\n y: Math.floor(i / this.width.tiles) * this.tileSize\\n };\\n }\",\n \"function getMapCenterY()\\r\\n{\\r\\n\\tvar frameY = getHeight()/2;\\r\\n\\tvar mapTop = getMapTop();\\r\\n\\treturn frameY - mapTop;\\t\\r\\n}\",\n \"function getRectCenter(rect){return{left:(rect.left+rect.right)/2,top:(rect.top+rect.bottom)/2};}\",\n \"function highlightPawn(i,j) {\\n\\tif (isWhite) {\\n\\t\\tif (j < 7) {\\n\\t\\t\\tif (lookupTile(2,i,j+1).piece == 'ee')\\n\\t\\t\\t\\thighlight(i,j+1,true);\\n\\t\\t\\tif (i < 7) {\\n\\t\\t\\t\\tif (lookupTile(2,i+1,j+1).piece.charAt(0) == 'b')\\n\\t\\t\\t\\t\\thighlight(i+1,j+1,false);\\n\\t\\t\\t}\\n\\t\\t\\tif (i > 0) {\\n\\t\\t\\t\\tif (lookupTile(2,i-1,j+1).piece.charAt(0) == 'b')\\n\\t\\t\\t\\t\\thighlight(i-1,j+1,false);\\n\\t\\t\\t}\\n\\t\\t\\tif (j == 1 && lookupTile(2,i,j+2).piece == 'ee')\\n\\t\\t\\t\\thighlight(i,j+2,true);\\n\\t\\t}\\n\\t} else {\\n\\t\\tif (j > 0) {\\n\\t\\t\\tif (lookupTile(2,i,j-1).piece == 'ee')\\n\\t\\t\\t\\thighlight(i,j-1,true);\\n\\t\\t\\tif (i < 7) {\\n\\t\\t\\t\\tif (lookupTile(2,i+1,j-1).piece.charAt(0) == 'w')\\n\\t\\t\\t\\t\\thighlight(i+1,j-1,false);\\n\\t\\t\\t}\\n\\t\\t\\tif (i > 0) {\\n\\t\\t\\t\\tif (lookupTile(2,i-1,j-1).piece.charAt(0) == 'w')\\n\\t\\t\\t\\t\\thighlight(i-1,j-1,false);\\n\\t\\t\\t}\\n\\t\\t\\tif (j == 6 && lookupTile(2,i,j-2).piece == 'ee')\\n\\t\\t\\t\\thighlight(i,j-2,true);\\n\\t\\t}\\n\\t}\\n}\",\n \"function getSurroundingXCount(x, y, type){\\n\\t\\tvar count =0;\\n\\t\\t\\tfor(var i =x-1; i <= x+1 ; i++){\\n\\t\\t\\t\\tfor(var j = y-1; j<= y+1; j++){\\n\\t\\t\\t\\t\\tif( i >= 0 && i < tileWidth && j >= 0 && j < tileHeight){\\n\\t\\t\\t\\t\\t\\tif( i != x || j != y){\\n\\t\\t\\t\\t\\t\\t\\tif(tiles[i][j] == type){\\n\\t\\t\\t\\t\\t\\t\\t\\tcount ++;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\treturn count;\\n}\",\n \"function getMatchVerticalOffset(matchCount, currentRound) {\\n return 1 / (matchCount / currentRound);\\n}\",\n \"startCursorBlinking: () => void,\\n stopCursorBlinking(): void,\\n pixelPositionForScreenPosition(\\n screenPosition: atom$Point,\\n clip?: boolean,\\n ): {top: number, left: number},\",\n \"function countNeighbours(centerX, centerY, searchSize) {\\n\\n var numCellsCounted = 0;\\n var numNeighbours = 0;\\n\\n for (let xOffset = -searchSize; xOffset <= searchSize; xOffset++) {\\n for (let yOffset = -searchSize; yOffset <= searchSize; yOffset++) {\\n if (xOffset != 0 || yOffset != 0) { \\n var xSamp = centerX + xOffset;\\n var ySamp = centerY + yOffset;\\n\\n if (xSamp >= 0 && xSamp < cols && ySamp > 0 && ySamp < rows) {\\n if (pPuffs[xSamp][ySamp]){\\n numNeighbours += 1;\\n }\\n numCellsCounted += 1;\\n }\\n }\\n }\\n }\\n\\n return numNeighbours / numCellsCounted;\\n}\",\n \"function pixelDist() {\\r\\n\\tvar min = bounds.getSouthWest();\\r\\n\\tvar max = bounds.getNorthEast();\\r\\n\\t\\r\\n\\tvar x = Math.abs(max.lng() - min.lng())/dojo.contentBox(\\\"map_canvas\\\").w;\\r\\n\\tvar y = Math.abs(max.lat() - min.lat())/dojo.contentBox(\\\"map_canvas\\\").h;\\r\\n\\t\\r\\n\\tvar r = Math.pow(10,7);\\r\\n\\tpixels = {\\\"x\\\": Math.round(x*r)/r, \\\"y\\\": Math.round(y*r)/r};\\r\\n}\",\n \"function findCord(x, y) \\n{\\n\\tif (0<= x && x <= 1/3*width) {\\n\\t\\tcord = 0;\\n\\t}\\n\\telse if (1/3*width<= x && x <= 2/3*width) \\n\\t{\\n\\t\\tcord = 1;\\n\\t}\\n\\telse if (2/3*width<= x && x <= 3*width) \\n\\t{\\n\\t\\tcord = 2;\\n\\t}\\n\\t\\n\\treturn cord;\\n}\",\n \"function computeCenter(rect) {\\n return {\\n top: rect.top + (rect.height / 2),\\n left: rect.left + (rect.width / 2)\\n };\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.6693089","0.626105","0.60249573","0.5923096","0.57945","0.5737114","0.5688535","0.5610086","0.5545497","0.5544482","0.53885883","0.53602487","0.5351306","0.5348422","0.5330814","0.53264034","0.52810115","0.5271384","0.525986","0.52412474","0.52239156","0.5222474","0.5211858","0.5209493","0.5142753","0.5138094","0.51311696","0.51246244","0.51151663","0.5113628","0.5110333","0.51078206","0.51061636","0.5088218","0.5088218","0.5088218","0.50880224","0.5079671","0.5076894","0.5076297","0.5075524","0.507364","0.50733393","0.5071436","0.5063268","0.50607383","0.5049514","0.5040129","0.5034161","0.503329","0.5022962","0.5017822","0.50075597","0.5007471","0.49968287","0.49921528","0.49757376","0.49745518","0.4971264","0.4967583","0.49656963","0.49547","0.49514517","0.494932","0.49421373","0.4941625","0.49380267","0.493594","0.4935811","0.49334016","0.49227202","0.4916759","0.49161297","0.49154067","0.49154067","0.4914121","0.49094832","0.49093124","0.49083483","0.49017385","0.48992994","0.48956022","0.4886952","0.48839158","0.48809078","0.4880727","0.48785585","0.48751155","0.48737448","0.4863993","0.4861641","0.48553047","0.48517808","0.48511276","0.48481736","0.48466423","0.48457894","0.48446998","0.48430583","0.484293"],"string":"[\n \"0.6693089\",\n \"0.626105\",\n \"0.60249573\",\n \"0.5923096\",\n \"0.57945\",\n \"0.5737114\",\n \"0.5688535\",\n \"0.5610086\",\n \"0.5545497\",\n \"0.5544482\",\n \"0.53885883\",\n \"0.53602487\",\n \"0.5351306\",\n \"0.5348422\",\n \"0.5330814\",\n \"0.53264034\",\n \"0.52810115\",\n \"0.5271384\",\n \"0.525986\",\n \"0.52412474\",\n \"0.52239156\",\n \"0.5222474\",\n \"0.5211858\",\n \"0.5209493\",\n \"0.5142753\",\n \"0.5138094\",\n \"0.51311696\",\n \"0.51246244\",\n \"0.51151663\",\n \"0.5113628\",\n \"0.5110333\",\n \"0.51078206\",\n \"0.51061636\",\n \"0.5088218\",\n \"0.5088218\",\n \"0.5088218\",\n \"0.50880224\",\n \"0.5079671\",\n \"0.5076894\",\n \"0.5076297\",\n \"0.5075524\",\n \"0.507364\",\n \"0.50733393\",\n \"0.5071436\",\n \"0.5063268\",\n \"0.50607383\",\n \"0.5049514\",\n \"0.5040129\",\n \"0.5034161\",\n \"0.503329\",\n \"0.5022962\",\n \"0.5017822\",\n \"0.50075597\",\n \"0.5007471\",\n \"0.49968287\",\n \"0.49921528\",\n \"0.49757376\",\n \"0.49745518\",\n \"0.4971264\",\n \"0.4967583\",\n \"0.49656963\",\n \"0.49547\",\n \"0.49514517\",\n \"0.494932\",\n \"0.49421373\",\n \"0.4941625\",\n \"0.49380267\",\n \"0.493594\",\n \"0.4935811\",\n \"0.49334016\",\n \"0.49227202\",\n \"0.4916759\",\n \"0.49161297\",\n \"0.49154067\",\n \"0.49154067\",\n \"0.4914121\",\n \"0.49094832\",\n \"0.49093124\",\n \"0.49083483\",\n \"0.49017385\",\n \"0.48992994\",\n \"0.48956022\",\n \"0.4886952\",\n \"0.48839158\",\n \"0.48809078\",\n \"0.4880727\",\n \"0.48785585\",\n \"0.48751155\",\n \"0.48737448\",\n \"0.4863993\",\n \"0.4861641\",\n \"0.48553047\",\n \"0.48517808\",\n \"0.48511276\",\n \"0.48481736\",\n \"0.48466423\",\n \"0.48457894\",\n \"0.48446998\",\n \"0.48430583\",\n \"0.484293\"\n]"},"document_score":{"kind":"string","value":"0.6282014"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":3069,"cells":{"query":{"kind":"string","value":"After a horizontal scan finds a potential alignment pattern, this method \"crosschecks\" by scanning down vertically through the center of the possible alignment pattern to see if the same proportion is detected. startI row where an alignment pattern was detected centerJ center of the section that appears to cross an alignment pattern maxCount maximum reasonable number of modules that should be observed in any reading state, based on the results of the horizontal scan originalStateCountTotal The original state count total"},"document":{"kind":"string","value":"function crossCheckVertical(startI, centerJ, maxCount, originalStateCountTotal, moduleSize, image) {\r\n\t\t var maxI = image.height;\r\n\t\t var stateCount = [0, 0, 0];\r\n\t\t // Start counting up from center\r\n\t\t var i = startI;\r\n\t\t while (i >= 0 && image.get(centerJ, i) && stateCount[1] <= maxCount) {\r\n\t\t stateCount[1]++;\r\n\t\t i--;\r\n\t\t }\r\n\t\t // If already too many modules in this state or ran off the edge:\r\n\t\t if (i < 0 || stateCount[1] > maxCount) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t while (i >= 0 && !image.get(centerJ, i) && stateCount[0] <= maxCount) {\r\n\t\t stateCount[0]++;\r\n\t\t i--;\r\n\t\t }\r\n\t\t if (stateCount[0] > maxCount) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t // Now also count down from center\r\n\t\t i = startI + 1;\r\n\t\t while (i < maxI && image.get(centerJ, i) && stateCount[1] <= maxCount) {\r\n\t\t stateCount[1]++;\r\n\t\t i++;\r\n\t\t }\r\n\t\t if (i == maxI || stateCount[1] > maxCount) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t while (i < maxI && !image.get(centerJ, i) && stateCount[2] <= maxCount) {\r\n\t\t stateCount[2]++;\r\n\t\t i++;\r\n\t\t }\r\n\t\t if (stateCount[2] > maxCount) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\r\n\t\t if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t return foundPatternCross(stateCount, moduleSize) ? centerFromEnd(stateCount, i) : null;\r\n\t\t}"},"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 handlePossibleCenter(stateCount, i, j, moduleSize) {\r\n\t\t var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\r\n\t\t var centerJ = centerFromEnd(stateCount, j);\r\n\t\t if (centerJ == null) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t var centerI = crossCheckVertical(i, Math.floor(centerJ), 2 * stateCount[1], stateCountTotal, moduleSize, image);\r\n\t\t if (centerI != null) {\r\n\t\t var estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3;\r\n\t\t for (var i2 in possibleCenters) {\r\n\t\t var center = possibleCenters[i2];\r\n\t\t // Look for about the same center and module size:\r\n\t\t if (aboutEquals(center, estimatedModuleSize, centerI, centerJ)) {\r\n\t\t return combineEstimate(center, centerI, centerJ, estimatedModuleSize);\r\n\t\t }\r\n\t\t }\r\n\t\t // Hadn't found this before; save it\r\n\t\t var point = { x: centerJ, y: centerI, estimatedModuleSize: estimatedModuleSize };\r\n\t\t possibleCenters.push(point);\r\n\t\t }\r\n\t\t return null;\r\n\t\t }","readCodewords() {\n let width = this.bitMatrix.getWidth();\n let height = this.bitMatrix.getHeight();\n\n this.erasures = new Array(MAX_CW_CAPACITY);\n\n for (let k = 0; k < this.erasures.length; k++) {\n this.erasures[k] = 0;\n }\n\n // Get the number of pixels in a module across the X dimension\n //float moduleWidth = bitMatrix.getModuleWidth();\n let moduleWidth = 1.0; // Image has been sampled and reduced\n let rowCounters = new Array(width);\n\n for (let n = 0; n < rowCounters.length; n++) {\n rowCounters[n] = 0;\n }\n\n let codewords = new Array(MAX_CW_CAPACITY);\n\n for (let m = 0; m < codewords.length; m++) {\n codewords[m] = 0;\n }\n\n let next = 0;\n let matchingConsecutiveScans = 0;\n let rowInProgress = false;\n let rowNumber = 0;\n let rowHeight = 0;\n\n for (let i = 1; i < height; i++) {\n if (rowNumber >= MAX_ROWS) {\n // Something is wrong, since we have exceeded\n // the maximum rows in the specification.\n // TODO Maybe return error code\n return null;\n }\n let rowDifference = 0;\n // Scan a line of modules and check the\n // difference between this and the previous line\n for (let j = 0; j < width; j++) {\n // Accumulate differences between this line and the\n // previous line.\n if (this.bitMatrix._get(j, i) != this.bitMatrix._get(j, i - 1)) {\n rowDifference++;\n }\n }\n\n if (rowDifference <= moduleWidth * this.MAX_ROW_DIFFERENCE) {\n for (let j2 = 0; j2 < width; j2++) {\n // Accumulate the black pixels on this line\n if (bitMatrix._get(j2, i)) {\n rowCounters[j2]++;\n }\n }\n // Increment the number of consecutive rows of pixels\n // that are more or less the same\n matchingConsecutiveScans++;\n // Height of a row is a multiple of the module size in pixels\n // Usually at least 3 times the module size\n if (matchingConsecutiveScans >= moduleWidth * 2) { // MGMG\n // We have some previous matches as well as a match here\n // Set processing a unique row.\n rowInProgress = true;\n }\n } else {\n if (rowInProgress) {\n // Process Row\n next = processRow(rowCounters, rowNumber, rowHeight, codewords, next);\n if (next == -1) {\n // Something is wrong, since we have exceeded\n // the maximum columns in the specification.\n // TODO Maybe return error code\n return null;\n }\n // Reinitialize the row counters.\n for (let j3 = 0; j3 < rowCounters.length; j3++) {\n rowCounters[j3] = 0;\n }\n rowNumber++;\n rowHeight = 0;\n }\n matchingConsecutiveScans = 0;\n rowInProgress = false;\n }\n rowHeight++;\n }\n // Check for a row that was in progress before we exited above.\n if (rowInProgress) {\n // Process Row\n if (rowNumber >= this.MAX_ROWS) {\n // Something is wrong, since we have exceeded\n // the maximum rows in the specification.\n // TODO Maybe return error code\n return null;\n }\n\n next = this.processRow(rowCounters, rowNumber, rowHeight, codewords, next);\n rowNumber++;\n rows = rowNumber;\n }\n erasures = trimArray(erasures, eraseCount);\n return trimArray(codewords, next);\n }","function AlignmentPatternFinder(image, startX\n /*int*/\n , startY\n /*int*/\n , width\n /*int*/\n , height\n /*int*/\n , moduleSize\n /*float*/\n , resultPointCallback) {\n _classCallCheck(this, AlignmentPatternFinder);\n\n this.image = image;\n this.startX = startX;\n this.startY = startY;\n this.width = width;\n this.height = height;\n this.moduleSize = moduleSize;\n this.resultPointCallback = resultPointCallback;\n this.possibleCenters = []; // new Array(5))\n // TYPESCRIPTPORT: array initialization without size as the length is checked below\n\n this.crossCheckStateCount = new Int32Array(3);\n }","calculateAtDesiredPos() {\n let counter = 0;\n for (let i = 0; i < this.num_rows; i++) {\n for (let j = 0; j < this.num_cols; j++) {\n if (this.isAtDesiredPos([i, j], this.board[i][j])) counter++;\n }\n }\n return counter;\n }","function check_block() {\n var moved = false;\n reset_counts();\n check_counts(\"X\");\n\n if (countdiag1 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 3 + i);\n }\n }\n if (countdiag2 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 2 + 2);\n }\n }\n if (countrow0 == 2) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i);\n }\n }\n if (countrow1 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(3 + i);\n }\n }\n if (countrow2 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(6 + i);\n }\n }\n if (countcol0 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 3);\n }\n }\n if (countcol1 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 3 + 1);\n }\n }\n if (countcol2 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 3 + 2);\n }\n }\n return moved;\n}","drawAlignmentPattern(x, y) {\n let i;\n let j;\n for (i = x - 2, j = y - 2; i < x + 3; i++, j++) {\n this.mModuleValue[i][y - 2].isBlack = true;\n this.mModuleValue[i][y - 2].isFilled = true;\n this.mModuleValue[i][y + 2].isBlack = true;\n this.mModuleValue[i][y + 2].isFilled = true;\n this.mModuleValue[x - 2][j].isBlack = true;\n this.mModuleValue[x - 2][j].isFilled = true;\n this.mModuleValue[x + 2][j].isBlack = true;\n this.mModuleValue[x + 2][j].isFilled = true;\n }\n for (i = x - 1, j = y - 1; i < x + 2; i++, j++) {\n this.mModuleValue[i][y - 1].isBlack = false;\n this.mModuleValue[i][y - 1].isFilled = true;\n this.mModuleValue[i][y + 1].isBlack = false;\n this.mModuleValue[i][y + 1].isFilled = true;\n this.mModuleValue[x - 1][j].isBlack = false;\n this.mModuleValue[x - 1][j].isFilled = true;\n this.mModuleValue[x + 1][j].isBlack = false;\n this.mModuleValue[x + 1][j].isFilled = true;\n }\n this.mModuleValue[x][y].isBlack = true;\n this.mModuleValue[x][y].isFilled = true;\n }","function foundPatternCross(stateCount, moduleSize) {\r\n\t\t var maxVariance = moduleSize / 2;\r\n\t\t for (var i = 0; i < 3; i++) {\r\n\t\t if (Math.abs(moduleSize - stateCount[i]) >= maxVariance) {\r\n\t\t return false;\r\n\t\t }\r\n\t\t }\r\n\t\t return true;\r\n\t\t}","computeGrids(){\n // Fill in the first row\n for (let j = 1; j < this.jMax; j++) {\n this.grid[0][j] = this.grid[0][j-1] + this.gap_penalty;\n this.tracebackGrid[0][j] = [false, false, true];\n }\n\n // Fill in the first column\n for (let i = 1; i < this.iMax; i++) {\n this.grid[i][0] = this.grid[i-1][0] + this.gap_penalty;\n this.tracebackGrid[i][0] = [false, true, false];\n }\n\n // Fill the rest of the grid\n for(let i = 1; i < this.iMax; i++){\n for(let j = 1; j < this.jMax; j++){\n // Find the max score(s) among [`Diag`, `Up`, `Left`]\n let diag;\n if(this.sequence1[i-1] === this.sequence2[j-1])\n diag = this.grid[i-1][j-1] + this.match_score;\n else\n diag = this.grid[i-1][j-1] + this.mismatch_penalty;\n\n let up = this.grid[i-1][j] + this.gap_penalty;\n let left = this.grid[i][j-1] + this.gap_penalty;\n\n // If there exists multiple max values, capture them for multiple paths\n let maxOf = [diag,up,left];\n let indices = this.arrayAllMaxIndexes(maxOf);\n\n // Update Grids\n this.grid[i][j] = maxOf[indices[0]];\n this.tracebackGrid[i][j] = [indices.includes(0), indices.includes(1), indices.includes(2)];\n }\n }\n\n // Update alignment score\n this.score = this.grid[this.iMax-1][this.jMax-1];\n }","function AlignmentPattern(posX, posY, estimatedModuleSize)\r\n{\r\n\tthis.x=posX;\r\n\tthis.y=posY;\r\n\tthis.count = 1;\r\n\tthis.estimatedModuleSize = estimatedModuleSize;\r\n\t\r\n\tthis.__defineGetter__(\"EstimatedModuleSize\", function()\r\n\t{\r\n\t\treturn this.estimatedModuleSize;\r\n\t}); \r\n\tthis.__defineGetter__(\"Count\", function()\r\n\t{\r\n\t\treturn this.count;\r\n\t});\r\n\tthis.__defineGetter__(\"X\", function()\r\n\t{\r\n\t\treturn Math.floor(this.x);\r\n\t});\r\n\tthis.__defineGetter__(\"Y\", function()\r\n\t{\r\n\t\treturn Math.floor(this.y);\r\n\t});\r\n\tthis.incrementCount = function()\r\n\t{\r\n\t\tthis.count++;\r\n\t}\r\n\tthis.aboutEquals=function( moduleSize, i, j)\r\n\t\t{\r\n\t\t\tif (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize)\r\n\t\t\t{\r\n\t\t\t\tvar moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);\r\n\t\t\t\treturn moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;\r\n\t\t\t}\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\r\n}","getAlignmentPatternCoOrdinates() {\n let allign = null;\n switch ((this.mVersion)) {\n case 2:\n allign = [6, 18];\n break;\n case 3:\n allign = [6, 22];\n break;\n case 4:\n allign = [6, 26];\n break;\n case 5:\n allign = [6, 30];\n break;\n case 6:\n allign = [6, 34];\n break;\n case 7:\n allign = [6, 22, 38];\n break;\n case 8:\n allign = [6, 24, 42];\n break;\n case 9:\n allign = [6, 26, 46];\n break;\n case 10:\n allign = [6, 28, 50];\n break;\n case 11:\n allign = [6, 30, 54];\n break;\n case 12:\n allign = [6, 32, 58];\n break;\n case 13:\n allign = [6, 34, 62];\n break;\n case 14:\n allign = [6, 26, 46, 66];\n break;\n case 15:\n allign = [6, 26, 48, 70];\n break;\n case 16:\n allign = [6, 26, 50, 74];\n break;\n case 17:\n allign = [6, 30, 54, 78];\n break;\n case 18:\n allign = [6, 30, 56, 82];\n break;\n case 19:\n allign = [6, 30, 58, 86];\n break;\n case 20:\n allign = [6, 34, 62, 90];\n break;\n case 21:\n allign = [6, 28, 50, 72, 94];\n break;\n case 22:\n allign = [6, 26, 50, 74, 98];\n break;\n case 23:\n allign = [6, 30, 54, 78, 102];\n break;\n case 24:\n allign = [6, 28, 54, 80, 106];\n break;\n case 25:\n allign = [6, 32, 58, 84, 110];\n break;\n case 26:\n allign = [6, 30, 58, 86, 114];\n break;\n case 27:\n allign = [6, 34, 62, 90, 118];\n break;\n case 28:\n allign = [6, 26, 50, 74, 98, 122];\n break;\n case 29:\n allign = [6, 30, 54, 78, 102, 126];\n break;\n case 30:\n allign = [6, 26, 52, 78, 104, 130];\n break;\n case 31:\n allign = [6, 30, 56, 82, 108, 134];\n break;\n case 32:\n allign = [6, 34, 60, 86, 112, 138];\n break;\n case 33:\n allign = [6, 30, 58, 86, 114, 142];\n break;\n case 34:\n allign = [6, 34, 62, 90, 118, 146];\n break;\n case 35:\n allign = [6, 30, 54, 78, 102, 126, 150];\n break;\n case 36:\n allign = [6, 24, 50, 76, 102, 128, 154];\n break;\n case 37:\n allign = [6, 28, 54, 80, 106, 132, 158];\n break;\n case 38:\n allign = [6, 32, 58, 84, 110, 136, 162];\n break;\n case 39:\n allign = [6, 26, 54, 82, 110, 138, 166];\n break;\n case 40:\n allign = [6, 30, 58, 86, 114, 142, 170];\n break;\n }\n return allign;\n }","function patternCheckOrientation(pattern, targetCell, qualityGoal, weight, orientation) {\n var forwardFacingCells = FWD_CELLS[targetCell];\n var totalDiscrepancies = 0;\n DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\"Enter pCO([\" + pattern + \"]; \" + targetCell + \", \" + qualityGoal + \", \" + weight + \", \" + orientation + \"); compass: \" + compass);\n fwdWrong = [];\n rearWrong = [];\n if ((Array.isArray(pattern[POS_CENTER]) && !pattern[POS_CENTER][myColor]) ||\n\t((pattern[POS_CENTER] > 0) && (myColor != pattern[POS_CENTER]))) {\n\tif (forwardFacingCells[POS_CENTER]) { // always true, in fact\n\t fwdWrong.push({p:POS_CENTER, v:POS_CENTER});\n\t totalDiscrepancies += 1;\n\t} else {\n\t rearWrong.push({p:POS_CENTER, v:POS_CENTER});\n\t totalDiscrepancies += weight;\n\t}\n }\n if ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\n\tDEBUG_PATTERN_CHECK_VERBOSELY && debugme(\"--- too bad\");\n\treturn PAT_NOMATCH;\n }\n var jFrom = 0;\n switch (targetCell) {\n case AIM_UP:\n\tjFrom = 4;\n\tbreak;\n case AIM_LEFT:\n\tjFrom = 6;\n\tbreak;\n case AIM_RIGHT:\n\tjFrom = 2;\n\tbreak;\n case AIM_DOWN:\n case POS_CENTER:\n default:\n\tbreak;\n }\n for (var j = jFrom; j < TOTAL_NBRS + jFrom; j++) {\n\tvar posP = CCW[j];\n\tvar posV = CCW[orientation + j];\n\tvar c = view[posV].color;\n\tif ((Array.isArray(pattern[posP]) && !pattern[posP][c]) ||\n\t ((pattern[posP] > 0) && (c != pattern[posP]))) {\n\t if (forwardFacingCells[posP]) {\n\t\tfwdWrong.push({p:posP, v:posV});\n\t\t// #future# If it should ever be needed, we could push j as a\n\t\t// third member of these objects (its absence indicating the\n\t\t// center cell).\n\t\ttotalDiscrepancies += 1;\n\t } else {\n\t\trearWrong.push({p:posP, v:posV});\n\t\ttotalDiscrepancies += weight;\n\t }\n\t}\n\tif ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\n\t DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\"--- too bad\");\n\t return PAT_NOMATCH;\n\t}\n }\n // Assert: totalDiscrepancies == fwdWrong.length + rearWrong.length;\n // Assert: If compass < 0, then totalDiscrepancies <= qualityGoal\n debugme(\"-> total \" + totalDiscrepancies + \" weighted discrepancies found.\");\n if ((compass < 0)\n\t// && (totalDiscrepancies <= qualityGoal)\n ) {\n\tcompass = orientation;\n }\n if (DEBUGME[myType]) {\n\t// Bypass the single-arg debugme() in order to get the objects printed.\n\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\"forwardD: [\", fwdWrong, \"]\");\n\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\"rearD: [\", rearWrong, \"]\");\n }\n if (fwdWrong.length == 0) {\n\treturn (totalDiscrepancies);\n } else {\n\treturn (-totalDiscrepancies);\n }\n}","step() {\n // Fill the offscreen buffer with the next cca generation built\n // from the current buffer.\n\n let backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n let currentBuffer = this.buffer[this.currentBufferIndex];\n let backBuffer = this.buffer[backBufferIndex];\n\n // See if we have a neighbor to infect this one\n function hasInfectiousNeighbor(x, y) {\n const nextValue = (currentBuffer[y][x] + 1) % MODULO;\n\n // Check the west neighbor of cell x, y\n /*if (x > 0) {\n if (currentBuffer[y][x - 1] === nextValue) {\n return true;\n }\n }*/\n\n // North\n if (y > 0) {\n if (currentBuffer[y - 1][x] === nextValue) {\n return true;\n }\n }\n\n // East\n if (x < this.width - 1) {\n if (currentBuffer[y][x + 1] === nextValue) {\n return true;\n }\n }\n\n // South\n if (y < this.height - 1) {\n if (currentBuffer[y + 1][x] === nextValue) {\n return true;\n }\n }\n\n // If we've made it this far we're not infected!\n return false;\n }\n\n // Loop through and decide the state of the next generation\n // for each cell processed.\n for (let y = 0; y < this.height; y++) {\n for (let x = 0; x < this.width; x++) {\n if (hasInfectiousNeighbor.call(this, x, y)) {\n backBuffer[y][x] = (currentBuffer[y][x] + 1) % MODULO;\n } else {\n backBuffer[y][x] = currentBuffer[y][x];\n }\n }\n }\n\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n }","function lookAheadCount(nfa, testCombineIndex)\n{ var testString=inputString.value;// var s=inputString.value; \n var localCombineIndex={\n localIndex:[],\n localFinalIndex:[]\n\n };\nlocalCombineIndex.localIndex=testCombineIndex.myIndex;\n//localCombineIndex.myFinalIndex=testCombineIndex.myFinalIndex;\n var CurrentActive=[];\n var NextActive=[];\n var MatchCount=0;\n var temp=[];\n \n CurrentActive=_.union(CurrentActive, nfa.states);\n for(var i=0; i= highestRow){\n\t\t\t\thighestRow = row;\n\t\t\t}\n\t\t\tif(col >= highestCol){\n\t\t\t\thighestCol = col;\n\t\t\t}\n\n\t\t}\n\t\tthis.width = highestCol;\n\t\tthis.height = highestRow;\n\t}","check(x, y, board = this.map) {\n let color = board[y][x];\n if (color === \"⚪\") return 1;\n //horizontal\n if (\n this.search(x, y, color, 1, 0, 0) +\n this.search(x, y, color, -1, 0, 0) - 1 >= 4\n ) {\n return 2;\n }\n //lt-rb diagonal\n if (\n this.search(x, y, color, 1, 1, 0) +\n this.search(x, y, color, -1, -1, 0) - 1 >= 4\n ) {\n return 2;\n }\n //lt-rb diagonal\n if (\n this.search(x, y, color, -1, 1, 0) +\n this.search(x, y, color, 1, -1, 0) - 1 >= 4\n ) {\n return 2;\n }\n //vertical\n if (\n this.search(x, y, color, 0, 1, 0) +\n this.search(x, y, color, 0, -1, 0) - 1 >= 4\n ) {\n return 2;\n }\n\n // check how many pieces in a column\n let countstack = 0;\n for (let i = 0; i < 7; i++) {\n if (this.stack[i] === -1) {\n countstack++;\n }\n }\n\n // a column is full\n if (countstack === 7) return 3;\n\n return 1;\n }","didWin(mark) {\n\n // premenne na vypocet znacky\n var vertical_count = 0,\n horizontal_count = 0,\n right_to_left_count = 0,\n left_to_right_count = 0;\n\n // Loop 1\n for (var i = 0; i < this.state.grid_size; i++) {\n\n\n vertical_count = 0;\n horizontal_count = 0;\n\n // Loop 2\n for (var j = 0; j < this.state.grid_size; j++) {\n\n\n if (this.state.data[i + '' + j] == mark) {\n horizontal_count++;\n }\n\n\n if (this.state.data[j + '' + i] == mark) {\n vertical_count++;\n }\n\n }\n\n\n if (this.state.data[i + '' + i] == mark) {\n left_to_right_count++;\n }\n\n\n if (this.state.data[(this.state.grid_size - 1 - i) + '' + i] == mark) {\n right_to_left_count++;\n }\n\n // ak suhlasi vyhral\n if (horizontal_count == this.state.grid_size || vertical_count == this.state.grid_size) {\n return true;\n }\n\n }\n\n // ak suhlasi diagonal vyhral\n if (left_to_right_count == this.state.grid_size || right_to_left_count == this.state.grid_size) {\n return true;\n }\n\n // nikto nevyhral\n return false;\n }","_getPartOfCount() {\n\n // 8-neighborhood around\n const n = [\n Point.val(this.x - 1, this.y - 1),\n Point.val(this.x - 1, this.y),\n Point.val(this.x - 1, this.y + 1),\n Point.val(this.x, this.y - 1),\n Point.val(this.x, this.y + 1),\n Point.val(this.x + 1, this.y - 1),\n Point.val(this.x + 1, this.y),\n Point.val(this.x + 1, this.y + 1),\n ];\n\n const edges = n.filter(p => p === '-' || p === '|').length;\n const ind = [];\n for (let i = 0; i < 8; i++) {\n if (n[i] === '-' || n[i] === '|') ind.push(i);\n }\n\n switch (edges) {\n\n case 2:\n switch (ind[0]) {\n case 1: \n return ind[1] === 3 ? (n[0] === n[7] ? 2 : 1) : (n[2] === n[5] ? 2 : 1);\n case 3: \n return n[2] === n[5] ? 2 : 1;\n case 4: \n return n[0] === n[7] ? 2 : 1;\n }\n\n case 3: \n return n.filter(p => p === ' ').length === 5 ? 3 : 2;\n\n case 4:\n return n.filter(p => p === ' ').length;\n }\n }","function updateCount( x, y, regions, last_regions) {\n var occupied = []; \n for (var r in regions) {\n \n // If already in the region, expand the boundaries\n var adj_lr = [0,0]; \n var adj_ul = [0,0]; \n var A = 0.12; // A 12% proportional \"expansion\" of the border to trigger leaving\n if (useRegionStickiness && last_regions.indexOf(r) > -1) { \n adj_lr[0] = A*regions[r].height;\n adj_lr[1] = A*regions[r].width;\n adj_ul[0] = -1*A*regions[r].height;\n adj_ul[1] = -1*A*regions[r].width;\n } \n \n // Now, use the adjusted region boundaries in the test\n //\n if (y >= regions[r].ul[0]+adj_ul[0] && y <= regions[r].lr[0]+adj_lr[0] && // These checks are for a graphics coordinate\n x >= regions[r].ul[1]+adj_ul[1] && x <= regions[r].lr[1]+adj_lr[1] ) { // system with (0,0) in the top left\n regions[r].count += 1; \n occupied.push(r); \n }\n } \n return occupied; \n}","function getCount(possibility_matrix, count_arr, len) {\n let turn_1_index = 0;\n let turn_1_count = count_arr[0];\n let turn_2_count = 0;\n for (let i = 0; i < count_arr.length; i++) {\n if (count_arr[i] > turn_1_count) {\n turn_1_count = count_arr[i];\n turn_1_index = i;\n }\n }\n if (count_arr.length > 1) {\n let catched_salmon_arr = [];\n for (let i = 0; i < possibility_matrix[turn_1_index].length; i++) {\n if (possibility_matrix[turn_1_index][i]) {\n catched_salmon_arr[i] = true;\n }\n }\n // console.log(catched_salmon_arr, turn_1_index, turn_1_count);\n let turn_2_index;\n for (let i = 0; i < catched_salmon_arr.length; i++) {\n if (catched_salmon_arr[i]) {\n continue;\n } else {\n turn_2_index = i;\n turn_2_count = count_arr[i];\n break;\n }\n }\n\n for (let i = 0; i < count_arr.length; i++) {\n if (!catched_salmon_arr[i] && count_arr[i] > turn_2_count && (count_arr[i] + turn_1_count) <= len && checkNoneOfCurrentGroupCatched(possibility_matrix[i])) {\n turn_2_index = i;\n turn_2_count = count_arr[i];\n }\n }\n // console.log(catched_salmon_arr, turn_2_index, turn_2_count);\n } else {\n turn_2_count = 0; // turn 2 not possible\n }\n console.log(turn_1_count + turn_2_count);\n}","function checkVictory(cléIndex) {\n var currentColor = cellProperties[cléIndex].couleur;\n var currentCol = cellProperties[cléIndex].col;\n var currentRow = cellProperties[cléIndex].row;\n var tokenHorizontal = 0;\n var tokenVertical = 0;\n var tokenDiagonalPositive = 0;\n var tokenDiagonalNegative = 0;\n var emptyCellFound = 0;\n\n\n // horizontal \n // coté gauche(check les cases à gauche du jeton joué)\n if (currentCol > 1) {\n for (i = currentCol; i > 1; i--) {\n colTest = \"col\" + (i - 1);\n if (cellProperties[colTest + 'row' + currentRow].couleur === currentColor) {\n tokenHorizontal += 1;\n }\n if (cellProperties[colTest + 'row' + currentRow].couleur != currentColor) {\n break;\n }\n if (tokenHorizontal >= 3) {\n victoire = true;\n console.log(\"Victoire Horizontale\");\n break;\n }\n }\n }\n // coté droit(check les cases à droite du jeton joué)\n if (currentCol < x && tokenHorizontal < 3 && x - currentCol > (3 - tokenHorizontal)) {\n for (i = currentCol; i > 0; i++) {\n colTest = \"col\" + (i + 1);\n if (cellProperties[colTest + 'row' + currentRow].couleur === currentColor) {\n tokenHorizontal += 1;\n }\n if (cellProperties[colTest + 'row' + currentRow].couleur != currentColor) {\n break;\n }\n if (tokenHorizontal >= 3) {\n victoire = true;\n console.log(\"Victoire Horizontale\");\n break;\n }\n }\n }\n\n // vertical (check les cases sous le jeton joué)\n if (currentRow <= (y - 3)) {\n for (i = currentRow; i < y; i++) {\n rowTest = \"row\" + (i + 1);\n if (cellProperties[\"col\" + currentCol + rowTest].couleur === currentColor) {\n tokenVertical += 1;\n }\n if (cellProperties[\"col\" + currentCol + rowTest].couleur != currentColor) {\n break;\n }\n if (tokenVertical >= 3) {\n victoire = true;\n console.log(\"Victoire Verticale\");\n break;\n }\n }\n }\n\n // diagonaux\n //diagonale positive\n // bas gauche (check les cases en bas à gauche en diagonale du jeton joué)\n if (currentRow < y && currentCol > 1) {\n for (i = currentRow, j = currentCol; i < y && j > 1; i++ , j--) {\n rowTest = \"row\" + (i + 1);\n colTest = \"col\" + (j - 1)\n\n if (cellProperties[colTest + rowTest].couleur === currentColor) {\n tokenDiagonalPositive += 1;\n }\n if (cellProperties[colTest + rowTest].couleur != currentColor) {\n break;\n }\n if (tokenDiagonalPositive >= 3) {\n victoire = true;\n console.log(\"Victoire Diagonale+\");\n break;\n }\n }\n }\n //diagonale positive\n // haut droit (check les cases en haut à droite en diagonale du jeton joué)\n if (currentRow > 1 && currentCol < x && (x - currentCol) > (3 - tokenDiagonalPositive) && currentRow > (3 - tokenDiagonalPositive)) {\n for (i = currentRow, j = currentCol; i > 1 && j < x; i-- , j++) {\n rowTest = \"row\" + (i - 1);\n colTest = \"col\" + (j + 1)\n\n if (cellProperties[colTest + rowTest].couleur === currentColor) {\n tokenDiagonalPositive += 1;\n }\n if (cellProperties[colTest + rowTest].couleur != currentColor) {\n break;\n }\n if (tokenDiagonalPositive >= 3) {\n victoire = true;\n console.log(\"Victoire Diagonale+\");\n break;\n }\n }\n }\n\n //diagonale negative\n // bas droite (check les cases en bas à droite en diagonale du jeton joué)\n if (currentRow < y && currentCol < x) {\n for (i = currentRow, j = currentCol; i < y && j < x; i++ , j++) {\n rowTest = \"row\" + (i + 1);\n colTest = \"col\" + (j + 1)\n\n if (cellProperties[colTest + rowTest].couleur === currentColor) {\n tokenDiagonalNegative += 1;\n }\n if (cellProperties[colTest + rowTest].couleur != currentColor) {\n break;\n }\n if (tokenDiagonalNegative >= 3) {\n victoire = true;\n console.log(\"Victoire Diagonale-\");\n break;\n }\n }\n }\n\n // diagonale negative\n // haut gauche (check les cases en bas à droite en diagonale du jeton joué)\n if (currentRow > 1 && currentCol > 1 && (currentCol - 1) > (3 - tokenDiagonalNegative) && currentRow > (3 - tokenDiagonalNegative)) {\n for (i = currentRow, j = currentCol; i > 1 && j > 1; i-- , j--) {\n rowTest = \"row\" + (i - 1);\n colTest = \"col\" + (j - 1)\n\n if (cellProperties[colTest + rowTest].couleur === currentColor) {\n tokenDiagonalNegative += 1;\n }\n if (cellProperties[colTest + rowTest].couleur != currentColor) {\n break;\n }\n if (tokenDiagonalNegative >= 3) {\n victoire = true;\n console.log(\"Victoire Diagonale-\");\n break;\n }\n }\n }\n\n // vérification du match nul en cas de complétion de grille\n if (currentRow == 1 && !victoire) {\n for (i = 1; i <= x; i++) {\n colTest = \"col\" + (i);\n if (cellProperties[colTest + 'row1'].couleur == 0) {\n emptyCellFound += 1;\n break;\n }\n }\n if (emptyCellFound == 0) {\n console.log('Match Nul')\n matchNul = true;\n }\n }\n\n } // crochet fin de fonction condition de victoire","step() {\n const backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n const currentBuffer = this.buffer[this.currentBufferIndex];\n const backBuffer = this.buffer[backBufferIndex];\n\n const countNeighbors = (x, y, options={border: 'wrap'}) => {\n let neighborCount = 0;\n\n // Actually count living neighbors\n if (options.border === 'wrap') {\n let north = y - 1;\n let south = y + 1;\n let west = x - 1;\n let east = x + 1;\n\n if (north < 0) north = this.height - 1;\n\n if (south > this.height - 1) south = 0;\n\n if (west < 0) west = this.width - 1;\n\n if (east > this.width - 1) east = 0;\n\n neighborCount = \n currentBuffer[north][west] + \n currentBuffer[north][x] + \n currentBuffer[north][east] + \n currentBuffer[y][west] + \n currentBuffer[y][east] + \n currentBuffer[south][x] + \n currentBuffer[south][east] + \n currentBuffer[south][west];\n\n } else if (options.border === 'nowrap') {\n // Treat out of bounds as zero\n for (let yOffset = -1; yOffset <= 1; yOffset++) {\n let yPos = y + yOffset;\n if (yPos < 0 || yPos >= this.height) continue; // Out of bounds\n\n for (let xOffset = -1; xOffset <= 1; xOffset++) {\n let xPos = x + xOffset;\n if (xPos < 0 || xPos >= this.width) continue; // Out of bounds\n if (yPos === y && xPos === x) continue; // Can't be your own neighbor\n neighborCount += currentBuffer[yPos][xPos];\n }\n }\n } else {\n throw new Error('Unknown border option: ' + options.border);\n }\n return neighborCount;\n }\n\n // Update backBuffer to have the next time state\n for(let y = 0; y < this.height; y++) {\n for (let x = 0; x < this.width; x++) {\n const neighbors = countNeighbors(x, y);\n const thisCell = currentBuffer[y][x];\n\n // Implement GoL rules\n if (thisCell) {\n //Current cell is alive\n if (neighbors < 2 || neighbors > 3) {\n // Death\n backBuffer[y][x] = 0;\n } else {\n // Alive\n backBuffer[y][x] = 1;\n }\n } else {\n // Current cell is dead\n if (neighbors === 3) {\n // A cell is born\n backBuffer[y][x] = 1;\n } else {\n // Still dead\n backBuffer[y][x] = 0;\n }\n }\n }\n }\n\n this.currentBufferIndex = backBufferIndex;\n }","function checkOverlapse(direction) {\n\t\textraTop = newTop;\n\t\textraLeft = newLeft;\n\t\t\n\t\tlet overlapRows = false;\n\t\t let overlapCols = false;\n\t\t\n\t\tif (currTopPx % dimension != 0)\n\t\t\toverlapRows = true;\n\t\tif (currLeftPx % dimension != 0)\n\t\t\toverlapCols = true;\n\t\t\n\t\tswitch(direction) {\n\t\t\tcase leftKey:\n\t\t\tcase rightKey:\t \n\t\t\t\tif (overlapRows)\n\t\t\t\t\textraTop = newTop + 1;\n\t\t\t\tbreak;\n\t\n\t\t\tcase upKey:\n\t\t\tcase downKey: \n\t\t\t\tif (overlapCols)\n\t\t\t\t\textraLeft = newLeft + 1;\n\t\t\t\tbreak;\t\t\t\t\t\t\n\t\t}\n\t}","function comparison(){\n\n var a1,a2,a3,a4,b1,b2,b3,b4,hint1,hint2,hint3,hint4;\n a1 = row[nbrOfRows].h1;\n a2 = row[nbrOfRows].h2;\n a3 = row[nbrOfRows].h3;\n a4 = row[nbrOfRows].h4;\n b1 = row[0].h1;\n b2 = row[0].h2;\n b3 = row[0].h3;\n b4 = row[0].h4;\n\n\n correctPosition=0; //Nbr of correct colors on correct position\n if (a1 == b1){correctPosition++;a1=1;b1=0;hint1=1}\n if (a2 == b2){correctPosition++;a2=1;b2=0;hint2=1}\n if (a3 == b3){correctPosition++;a3=1;b3=0;hint3=1}\n if (a4 == b4){correctPosition++;a4=1;b4=0;hint4=1}\n\n correctColour=0; //Nbr of correct colors on wrong position\n if (a1 == b2){correctColour++;a1=1;b2=0}\n if (a1 == b3){correctColour++;a1=1;b3=0}\n if (a1 == b4){correctColour++;a1=1;b4=0}\n\n if (a2 == b1){correctColour++;a2=1;b1=0}\n if (a2 == b3){correctColour++;a2=1;b3=0}\n if (a2 == b4){correctColour++;a2=1;b4=0}\n\n if (a3 == b1){correctColour++;a3=1;b1=0}\n if (a3 == b2){correctColour++;a3=1;b2=0}\n if (a3 == b4){correctColour++;a3=1;b4=0}\n\n if (a4 == b1){correctColour++;a4=1;b1=0}\n if (a4 == b2){correctColour++;a4=1;b2=0}\n if (a4 == b3){correctColour++;a4=1;b3=0}\n\n //Draw the hints on the side of the board\n var p = 9*box+4.8;\n for (i=0;i<4;i++){\n if (i {\n let from = transfer.fromStop - minStopPerPattern.get(pattern) + patternVerticalOffsets.get(pattern)\n let to = transfer.toStop - minStopPerPattern.get(transfer.toPattern) + patternVerticalOffsets.get(transfer.toPattern)\n\n // this transfer goes the wrong way\n if (to <= from) objective += from - to + 1\n })\n }\n\n return objective\n }","function horizontalline(prevrow) {\n var currchip = null;\n var prevchip = 0;\n var count = 0;\n\n for (var col = 0; col < 7; col++) {\n currchip = board[prevrow][col];\n if (currchip == prevchip && currchip != 0) {\n count++;\n }\n else {\n count = 0;\n }\n //count == 3 when four chips are in a line\n if (count == UI.wincondition - 1) {\n return true;\n }\n //set previous chip to current chip for next comparison\n prevchip = currchip;\n }\n\n //else no horizontal line\n return false;\n}","isPercolated () {\n var topPercolateIndex = this.size\n var bottomPercolateIndex = this.size + 1\n\n var topPercolateArranges = this.grid.slice(0, 1)[0]\n .map((value, x) =>\n value && [topPercolateIndex, this.width * x]\n ).filter(v => v)\n\n var bottomPercolateArranges = this.grid.slice(-1)[0]\n .map((value, x) =>\n value && [bottomPercolateIndex, (this.grid.length-1) * this.width + x]\n ).filter(v => v)\n\n // console.log('topPercolateArranges', topPercolateArranges);\n // console.log('bottomPercolateArranges', bottomPercolateArranges);\n\n // padds arranges like this: double means has arrange (e.g. \\\\)\n //\n // top_percolate (pad)\n // // | \\\\\n // X - X\n // X X X\n // - X X\n // \\ || //\n // bottom_percolate (pad)\n\n var paddedArranges = [\n ...topPercolateArranges,\n ...this.arranges,\n ...bottomPercolateArranges,\n ]\n\n // find if topPercolate is connected to bottomPercolate, which are appeneded at the end, hence we pass {n} as `this.size + 2`\n return (new UnionFind.QuickFind(\n this.size + 2,\n paddedArranges\n )).find(topPercolateIndex, bottomPercolateIndex)\n }","controlHorizontalPosterior(x, ficha, matrizCeldas) {\r\n let contador = 0;\r\n let y = ficha.columna;\r\n while (y < matrizCeldas[y].length && (ficha.getColor() === matrizCeldas[y + 1][x]?.fichaColor)) {\r\n contador++;\r\n y++;\r\n }\r\n return contador;\r\n }","function alignDiscontinuities(lastFrag,details,lastLevel){if(shouldAlignOnDiscontinuities(lastFrag,lastLevel,details)){var referenceFrag=findDiscontinuousReferenceFrag(lastLevel.details,details);if(referenceFrag){logger_1.logger.log('Adjusting PTS using last level due to CC increase within current level');adjustPts(referenceFrag.start,details);}}}","function checkLearnedSpiral(arg,extended=0,linear=0) {\n \n var ctrls=[]; var s=[]; var mindi=[]; var minInds = [];\n /*console.log(toKeep);\n for (var bg=0; bg arg[k]),forControl.map(k => learnedSpirals[bg][0][k]),weightVector));\n ctrls.push(ctrl);\n s.push(ctrl);\n }*/\n for (var i=0; i0) { minInds.push(drawBackgroundSpiral/0.25); }\n for (var i=0; i0) { if (ctrls.indexOf(s[i]) != drawBackgroundSpiral/0.25) {\n minInds.push(ctrls.indexOf(s[i]));\n }}\n else { \n minInds.push(ctrls.indexOf(s[i]));\n }\n }\n //If we're just checking the linear score, use distance from the background spiral of appropriate size as the only number. \n if (linear == 1 && (drawBackgroundSpiral > 0 || plotType == 1)) {\n var toKeep = [4,5,10,11,19,20];\n var weightVector=[1,1,1,1,1,1,1,1];\n var res = []; \n //Only use the template size. \n for (var i=0; i<(drawBackgroundSpiral>0?1:minInds.length); i++) { \n var p1=((euclidDistWeight(toKeep.map(k => arg[k]),toKeep.map(k => perfSpirals[minInds[i]][k]),weightVector)).toFixed(2));\n var p2=(euclidDistWeight(toKeep.map(k=> perfSpirals[minInds[i]][k]),toKeep.map(k => learnedSpirals[minInds[i]][0][k]),weightVector)).toFixed(2);\n var p3=(euclidDistWeight(toKeep.map(k=> arg[k]),toKeep.map(k => learnedSpirals[minInds[i]][0][k]),weightVector)).toFixed(2);\n res.push((p1/p2).toFixed(2));\n }\n return (res);\n }\n \n //Get rid of standard deviations basically. \n var forControl = [3,5,7,9,11,12,13,14,15,16,17];\n var toKeep = [3,5,7,9,11,12,13,14,15,16,17];\n var weightVector = [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1];\n \n if (extended==1) { toKeep=toKeep.concat([18,19]);console.log(\"extended\"); }\n\n\n var check=[]; var minds = []; var ds=[]; \n for (var bg=0; bg arg[k]),toKeep.map(k => learnedSpirals[minInds[bg]][0][k]),weightVector));\n var mind=1000000; var d=0; var mi=-1; \n //Distance to control center. \n for (var i=1; i arg[k]),toKeep.map(k => learnedSpirals[minInds[bg]][i][k]),weightVector);\n //Keep the minimum difference between control and noise. \n ds.push(d);\n if (d 3) {\n backBuffer[r][c] = 0;\n } else {\n backBuffer[r][c] = 1;\n }\n } else {\n if (neighborCount === 3) {\n backBuffer[r][c] = 0;\n } else {\n backBuffer[r][c] = 1;\n }\n }\n }\n }\n\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n }","function updateCount( x, y, regions, last_regions) {\n var occupied = []; \n if (typeof last_regions == 'undefined') last_regions = []; // Added this because we have arbitrary track ids, making it hard to guarantee a value here\n for (var r in regions) {\n // If already in the region, expand the boundaries\n var adj_lr = [0,0]; \n var adj_ul = [0,0]; \n var A = 0.12; // A 12% proportional \"expansion\" of the border to trigger leaving\n if (useRegionStickiness && last_regions.indexOf(r) > -1) { \n adj_lr[0] = A*regions[r].height;\n adj_lr[1] = A*regions[r].width;\n adj_ul[0] = -1*A*regions[r].height;\n adj_ul[1] = -1*A*regions[r].width;\n } \n \n // Now, use the adjusted region boundaries in the test\n //\n if (y >= regions[r].ul[0]+adj_ul[0] && y <= regions[r].lr[0]+adj_lr[0] && // These checks are for a graphics coordinate\n x >= regions[r].ul[1]+adj_ul[1] && x <= regions[r].lr[1]+adj_lr[1] ) { // system with (0,0) in the top left\n regions[r].count += 1; \n occupied.push(r); \n }\n } \n return occupied; \n}","bestPlaceToStart(incomingClues) {\n\n // penalize clues that have more zeros\n function weightedClue(clue) {\n return clue ? clue : -10;\n }\n\n const sideLength = this.size;\n const lastCell = this.size * 4 - 1;\n\n const sideClues = [\n {\n direction: 'top',\n count:\n weightedClue(incomingClues[sideLength]) + weightedClue(incomingClues[sideLength + 1]) +\n weightedClue(incomingClues[lastCell - 1]) + weightedClue(incomingClues[lastCell])\n },\n {\n direction: 'bottom',\n count:\n weightedClue(incomingClues[sideLength * 2 - 2]) + weightedClue(incomingClues[sideLength * 2 - 1]) +\n weightedClue(incomingClues[sideLength * 3]) + weightedClue(incomingClues[sideLength * 3 + 1])\n },\n {\n direction: 'left',\n count:\n weightedClue(incomingClues[0]) + weightedClue(incomingClues[1]) +\n weightedClue(incomingClues[sideLength * 3 - 2]) + weightedClue(incomingClues[sideLength * 3 - 1])\n },\n {\n direction: 'right',\n count:\n weightedClue(incomingClues[sideLength - 2]) + weightedClue(incomingClues[sideLength - 1]) +\n weightedClue(incomingClues[sideLength * 2]) + weightedClue(incomingClues[sideLength * 2 + 1])\n }\n ];\n sideClues.sort((a, b) => b.count - a.count);\n const bestDirection = sideClues[0].direction;\n\n let clues;\n let c1;\n let c2;\n let c3;\n let c4;\n switch(bestDirection) {\n case 'top':\n clues = incomingClues;\n break;\n case 'bottom': // shift bottom to the first row\n c1 = incomingClues.slice(sideLength * 2, sideLength * 3).reverse();\n c2 = incomingClues.slice(sideLength, sideLength * 2).reverse();\n c3 = incomingClues.slice(0, sideLength).reverse();\n c4 = incomingClues.slice(sideLength * 3, sideLength * 4).reverse();\n clues = c1.concat(c2).concat(c3).concat(c4);\n break;\n case 'left': // shift left side to the first row\n c1 = incomingClues.slice(sideLength * 3, sideLength * 4);\n c2 = incomingClues.slice(0, sideLength * 3);\n clues = c1.concat(c2);\n break;\n case 'right': // shift right side to the first row\n c1 = incomingClues.slice(sideLength, sideLength * 4);\n c2 = incomingClues.slice(0, sideLength);\n clues = c1.concat(c2);\n break;\n }\n return { startAt: bestDirection, clues };\n }","function checkRow( g, ri ) {\n var above_status = aliveAbove( g, ri );\n var below_status = aliveBelow( g, ri );\n var curr_status = g[ri]>0;\n var alives = [];\n var new_row = 0;\n // If nothing around it is alive, return 0;\n if ( above_status > 0 || below_status > 0 || curr_status > 0 ) {\n // Check the positions\n for( var i = 1; i < bits; i *= 2 ) {\n var alive_or_dead = (g[ri]&i)>0;\n var ac = 0;\n if ( above_status == true ) {\n (g[ri-1] & (i/2))>0?ac++:false;\n (g[ri-1] & (i/1))>0?ac++:false;\n (g[ri-1] & (i*2))>0?ac++:false;\n }\n if ( curr_status == true ) {\n (g[ri] & (i/2))>0?ac++:false;\n (g[ri] & (i*2))>0?ac++:false;\n }\n if ( below_status == true ) {\n (g[ri+1] & (i/2))>0?ac++:false;\n (g[ri+1] & (i/1))>0?ac++:false;\n (g[ri+1] & (i*2))>0?ac++:false;\n }\n if ( alive_or_dead == true && ( ac == 2 || ac == 3 ) ) {\n new_row += bits & i;\n }\n else if ( alive_or_dead == false && ac == 3 ) {\n new_row += bits & i;\n }\n }\n return new_row;\n }\n else {\n return 0;\n }\n}","screenAlignmentPattern() {\n // prepare cell data\n const cell = new CellData();\n cell.content = 1 << 22 /* WIDTH_SHIFT */ | 'E'.charCodeAt(0);\n cell.fg = this._curAttrData.fg;\n cell.bg = this._curAttrData.bg;\n const buffer = this._bufferService.buffer;\n this._setCursor(0, 0);\n for (let yOffset = 0; yOffset < this._bufferService.rows; ++yOffset) {\n const row = buffer.ybase + buffer.y + yOffset;\n const line = buffer.lines.get(row);\n if (line) {\n line.fill(cell);\n line.isWrapped = false;\n }\n }\n this._dirtyRowService.markAllDirty();\n this._setCursor(0, 0);\n return true;\n }","function arrayMarkCount(iRows, iCols, iStartRow, iStartCol) {\n var i;\n var j;\n\n iMarkCount = 0;\n\n for (i = iStartRow; i < iStartRow + iRows; i++) {\n for (j = iStartCol; j < iStartCol + iCols; j++) {\n if (iMarkedCells[i % iMapRows][j % iMapCols] == 1) {\n iMarkCount++;\n } \n }\n } \n\n return iMarkCount;\n}","function AlignmentPattern(posX, posY, estimatedModuleSize) {\n this.x = posX;\n this.y = posY;\n this.count = 1;\n this.estimatedModuleSize = estimatedModuleSize;\n }","_updateGeneration () {\n let shouldUpdateGenerationCounter = false\n\n for (let x = 0; x < this.sizeX; x++) {\n for (let y = 0; y < this.sizeY; y++) {\n let neighbours = this._countNeighbours(x, y)\n if (this.matrix[x][y] === 1 && (neighbours > 3 || neighbours < 2)) {\n this.nextMatrix[x][y] = -1\n } else if (this.matrix[x][y] !== 1 && neighbours === 3) {\n shouldUpdateGenerationCounter = true\n this.nextMatrix[x][y] = 1\n } else {\n this.nextMatrix[x][y] = this.matrix[x][y]\n }\n }\n }\n\n if (shouldUpdateGenerationCounter) {\n this.generationNumber++\n }\n }","function count_islands(emap) {\n \n const len = array_length(emap);\n const height = array_length(emap[0]);\n \n let visited = [];\n\n // Generate the visited 2D array -> This is to check whether the cell \n // has already been checked\n for (let i = 0; i < len; i = i + 1) {\n visited[i] = [];\n for (let j = 0; j < height; j = j + 1) {\n visited[i][j] = false;\n }\n }\n \n // Check whether the neighboring cells are valid \n function isSafe(emap, row, col, visited) {\n // Check there is no negative / overflow index\n return row >= 0 && row < len && col >= 0 && col < height \n && emap[row][col] > 0 && !visited[row][col];\n }\n \n\n // Apply Depth-First search and treat the 2D array as a graph\n function dfs(emap, row, col, visited) {\n // Mark this cell as visited\n visited[row][col] = true;\n for (let i = -1; i <= 1; i = i + 1) {\n for (let j = -1; j <= 1; j = j + 1) {\n if ((i === -1 && j === 0) ||\n (i === 0 && j === -1) ||\n (i === 0 && j === 1) ||\n (i === 1 && j === 0)) {\n if(isSafe(emap, row + i, col + j, visited)) {\n dfs(emap, row + i, col + j, visited);\n } else {\n \n }\n } else {\n \n }\n }\n }\n \n }\n\n \n let counter = 0;\n \n // Trying to check the number of connected graphs\n for (let i = 0; i < len; i = i + 1) {\n for (let j = 0; j < len; j = j + 1) {\n if (emap[i][j] > 0 && !visited[i][j]) {\n // Check\n dfs(emap, i, j, visited);\n counter = counter + 1;\n } else {\n \n }\n }\n }\n\n return counter;\n}","getPositionCorrection(counter) {\r\n let correction = 0;\r\n let isLastSlide = this.isLastSlide(counter);\r\n if (this.carouselProperties.loop || this.direction === \"right\") {\r\n return 0;\r\n }\r\n if (this.isSlideLengthLimited || isLastSlide) {\r\n let cellsWidth = this.cells.cellLengthInLightDOMMode * this.fullCellWidth;\r\n if (this.visibleWidth < cellsWidth) {\r\n correction = -(this.visibleCellsCount * this.fullCellWidth - this.visibleWidth - this.margin);\r\n }\r\n if (correction >= -this.margin) {\r\n correction = 0;\r\n }\r\n }\r\n return correction;\r\n }","function calcSegmentIntersectionStripeCount_old(arcs) {\n var yrange = arcs.getBounds().height(),\n segLen = getAvgSegment2(arcs)[1], // slow\n count = 1;\n if (segLen > 0 && yrange > 0) {\n count = Math.ceil(yrange / segLen / 20);\n }\n return count || 1;\n }","function little_check(count,count2){\n\t\t\t\n\t\t\t//console.log(\"count \"+ count+\"count2 \"+count2);\t\t\t\n \t \t\tfor ( var x=count; x <= (count+2); x++) { // cycle the matrix rows...\n \t \t\t\tfor (var y=count2; y <= (count2+2); y++) { // ...and cycle the matrix cells\n\t\t\t\t\t//var BR=1;\n\n\t\t\t\t\t//console.log(\"matrx[x] \"+ x+\"martix[y] \"+y);\n\t\t\t\t\tif ((matrix[x][(count2+0)]) === \"p1\" && (matrix[x][(count2+1)]) === \"p1\" && (matrix[x][(count2+2)]) === \"p1\") { // If our cell has been 'tagged' p1 given x is (e.g 0) then: x0y0, x0y1, x0y2 would mean player one has 3 horizontal cells in a line = victory!\n\t\t\t\t\t\tif (player1 === true){\n\t\t\t\t\t\t//console.log(\"horizontal victory\")\n\t\t\t\t\t\t//console.log(\"player1 wins square row \"+BR+ \"column \"+BC )\n\t\t\t\t\t\twinner_show(BR,BC)\n\t\t\t\t\t\tlittlematrix[(BR-1)][(BC-1)]=\"p1\";\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t\t}\n\t\t\t\t\t} \n\t\t\t\t\telse if\t( (matrix[(count+0)][y]) === \"p1\" && (matrix[(count+1)][y]) === \"p1\" && (matrix[(count+2)][y]) === \"p1\") { // Repeated for other conditions\n\t\t\t\t\t\tif (player1 === true){\n\t\t\t\t\t\t//console.log(\"vertical victory\")\n\t\t\t\t\t\t//console.log(\"player1 wins\")\n\t\t\t\t\t\twinner_show(BR,BC)\n\t\t\t\t\t\tlittlematrix[(BR-1)][(BC-1)]=\"p1\";\n\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if ((matrix[(count+0)][(count2+0)]) === \"p1\" && (matrix[(count+1)][(count2+1)]) === \"p1\" && (matrix[(count+2)][(count2+2)]) === \"p1\") {\n\t\t\t\t\t\tif (player1 === true){\n\t\t\t\t\t\tconsole.log(\"LtopRdown diagonal\")\n\t\t\t\t\t\tconsole.log(\"player1 wins\")\n\t\t\t\t\t\twinner_show(BR,BC)\n\t\t\t\t\t\tlittlematrix[(BR-1)][(BC-1)]=\"p1\";\n\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t} \n\t\t\t\t\telse if\t( (matrix[(count+0)][(count2+2)]) === \"p1\" && (matrix[(count+1)][(count2+1)]) === \"p1\" && (matrix[(count+2)][(count2+0)]) === \"p1\") {\t\n\t\t\t\t\t\tif (player1 === true){\n\t\t\t\t\t\tconsole.log(\"Rtop Ldown diagonal\")\n\t\t\t\t\t\tconsole.log(\"player1 wins\")\n\t\t\t\t\t\twinner_show(BR,BC)\n\t\t\t\t\t\tlittlematrix[(BR-1)][(BC-1)]=\"p1\";\n\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\n\t \t}","findNext() {\n // look left, right, up, down\n let leftLoc = {x: this.center.x - 1, y: this.center.y};\n let rightLoc = {x: this.center.x, y: this.center.y};\n let upLoc = {x: this.center.x, y: this.center.y - 1};\n let downLoc = {x: this.center.x, y: this.center.y + 1};\n\n let carArray = [this.layout[leftLoc.y][leftLoc.x] || 0, this.layout[rightLoc.y][rightLoc.x] || 0,\n this.layout[upLoc.y][upLoc.x] || 0, this.layout[downLoc.y][downLoc.x] || 0];\n if(Math.max(...carArray) === 0) {\n console.log(\"bunny sleep\")\n return\n }\n let nextLoc = carArray.indexOf(Math.max(...carArray));\n\n switch(nextLoc) {\n case 0: \n return leftLoc;\n \n case 1: \n return rightLoc;\n\n case 2: \n return upLoc;\n \n case 3: \n return downLoc;\n default: \n return null;\n }\n }","step() {\n /* If you put logic from CCA here it works as should */\n\n /* In the Game of Life, these rules examine each cell of the grid. \n For each cell, it counts that cell's eight neighbors\n (up, down, left, right, and diagonals), and then act on that result.\n\n If the cell is alive and has 2 or 3 neighbors, then it remains alive. Else it dies.\n If the cell is dead and has exactly 3 neighbors, then it comes to life. Else if remains dead. */\n\n let currentBuffer = this.cells[this.currentBufferIndex];\n let backBuffer = this.cells[this.currentBufferIndex === 0 ? 1 : 0];\n \n // see if we have a neighbor that can infect this cell and change its color\n function checkNeighbors(w, h) {\n let neighbors = 0;\n\n // Check West\n if (w) {\n if (currentBuffer[h][w - 1]) {\n neighbors++;\n }\n }\n // Check NW\n if (h && w) {\n if (currentBuffer[h - 1][w - 1])\n neighbors++;\n }\n // Check North\n if (h) {\n if (currentBuffer[h - 1][w]) {\n neighbors++;\n }\n }\n // Check NE\n if ((w < this.width - 1) && h) {\n if (currentBuffer[h - 1][w + 1]) {\n neighbors++;\n }\n }\n // Check East\n if (w < this.width - 1) {\n if (currentBuffer[h][w + 1]) {\n neighbors++;\n }\n }\n // Check SE\n if ((h < this.height - 1) && (w < this.width - 1)) {\n if (currentBuffer[h + 1][w + 1]) {\n neighbors++;\n }\n }\n // Check South\n if (h < this.height - 1) {\n if (currentBuffer[h + 1][w]) {\n neighbors++;\n }\n }\n // Check SW\n if ((h < this.height - 1) && w) {\n if (currentBuffer[h + 1][w - 1]) {\n neighbors++;\n }\n }\n\n return neighbors;\n } // end: checkNeightbors()\n\n for (let h = 0; h < this.height; h++) {\n for (let w = 0; w < this.width; w++) {\n let neighborCount = checkNeighbors.call(this, w, h);\n\n // is current cell alive?\n if (currentBuffer[h][w]) {\n if (neighborCount === 2 || neighborCount === 3) {\n backBuffer[h][w] = currentBuffer[h][w]; // cell stay alives\n }\n else { // else it dies\n backBuffer[h][w] = (currentBuffer[h][w] + 1) % MODULO;\n }\n }\n else { // current cell is dead\n if (neighborCount === 3) {\n backBuffer[h][w] = (currentBuffer[h][w] + 1) % MODULO; // bring cell to life\n }\n else { // else cell remains dead\n backBuffer[h][w] = currentBuffer[h][w];\n }\n }\n }\n }\n\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n }","function count_color(current_coordinate, desired_color, desired_direction, current_count) {\n\t\t\t\tlet next_coordinate = [current_coordinate[0] + desired_direction[0],\n\t\t\t\tcurrent_coordinate[1] + desired_direction[1]];\n\t\t\t\tconsole.log(next_coordinate);\n\t\t\t\tif (piece_position[next_coordinate[0]] && piece_position[next_coordinate[0]][next_coordinate[1]]) {\n\t\t\t\t\tif (piece_position[next_coordinate[0]][next_coordinate[1]].color != desired_color)\n\t\t\t\t\t\treturn current_count;\n\t\t\t\t\tcurrent_count += 1;\n\t\t\t\t\tif (current_count == 3)\n\t\t\t\t\t\treturn current_count;\n\t\t\t\t\treturn count_color(next_coordinate, desired_color, desired_direction, current_count);\n\t\t\t\t}\n\t\t\t\treturn current_count;\n\t\t\t}","calculateCOOCM(sourceMatrix, size) {\n\t\tvar nextValue = 0,\n\t\t\tpreviousValue = 0,\n\t\t\tsum = 0,\n\t\t\tlength,\n\t\t\tindex = 0;\n\n\t\tlength = sourceMatrix.length;\n\t\tfor (index = 0; index < length; index++) {\n\t\t\tswitch (this.orientation) {\n\t\t\t\tcase 'horizontally':\n\t\t\t\t{\n\t\t\t\t\tif (index % size + this.distance <= size - 1) {\n\t\t\t\t\t\tnextValue = sourceMatrix[index + this.distance];\n\t\t\t\t\t\tthis.incrementCOOCMMatrix(sourceMatrix[index] - 1, nextValue - 1);\n\t\t\t\t\t}\n\t\t\t\t\tif (index % size - this.distance >= 0) {\n\t\t\t\t\t\tpreviousValue = sourceMatrix[index - this.distance];\n\t\t\t\t\t\tthis.incrementCOOCMMatrix(sourceMatrix[index] - 1, previousValue - 1);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 'vertically':\n\t\t\t\t{\n\t\t\t\t\t//TODO TEST\n\t\t\t\t\t//vertically\n\t\t\t\t\tif (index > this.distance * size - 1) {\n\t\t\t\t\t\tpreviousValue = sourceMatrix[index - this.distance * size];\n\t\t\t\t\t\tthis.incrementCOOCMMatrix(previousValue - 1, sourceMatrix[index] - 1);\n\t\t\t\t\t}\n\t\t\t\t\tif (index < length - this.distance * size) {\n\t\t\t\t\t\tnextValue = sourceMatrix[index + this.distance * size];\n\t\t\t\t\t\tthis.incrementCOOCMMatrix(previousValue - 1, sourceMatrix[index] - 1);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase '45st':\n\t\t\t\t{\n\t\t\t\t\tif (index % size > this.distance - 1 && index < length - this.distance * size) {\n\t\t\t\t\t\tpreviousValue = sourceMatrix[index + size * this.distance - this.distance];\n\t\t\t\t\t\tthis.incrementCOOCMMatrix(sourceMatrix[index] - 1, previousValue - 1);\n\t\t\t\t\t}\n\t\t\t\t\tif (index % size < size - this.distance && index > this.distance * size - 1) {\n\t\t\t\t\t\tnextValue = sourceMatrix[index - size * this.distance + this.distance];\n\t\t\t\t\t\tthis.incrementCOOCMMatrix(sourceMatrix[index] - 1, previousValue - 1);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase '135st':\n\t\t\t\t{\n\t\t\t\t\tif (index % size > this.distance - 1 && index > this.distance * size - 1) {\n\t\t\t\t\t\tpreviousValue = sourceMatrix[index - size * this.distance - this.distance];\n\t\t\t\t\t\tthis.incrementCOOCMMatrix(previousValue - 1, sourceMatrix[index] - 1);\n\t\t\t\t\t}\n\t\t\t\t\tif (index % size < size - this.distance && index < length - this.distance * size) {\n\t\t\t\t\t\tnextValue = sourceMatrix[index + size * this.distance + this.distance];\n\t\t\t\t\t\tthis.incrementCOOCMMatrix(previousValue - 1, sourceMatrix[index] - 1);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tlength = this.coocmMatrix2.length;\n\t\t//ready for new approach\n\t\t//1600ms better\n\t\tfor (index = 0; index < length; index++) {\n\t\t\tsum = sum + this.coocmMatrix2[index];\n\t\t}\n\n//1500ms better\n\t\tif (sum) {\n\t\t\tfor (index = 0; index < length; index++) {\n\t\t\t\tthis.coocmMatrix2[index] = this.coocmMatrix2[index] / sum;\n\t\t\t}\n\t\t}\n\n\t\t/*this.coocmMatrix2.forEach(function (value, index) {\n\t\t //self.coocmMatrix.subset(math.index(index[0], index % size), value / sum);\n\t\t self.coocmMatrix2[index] = value / sum;\n\t\t });*/\n\n//show matrix in the console\n//console.log(this.coocmMatrix2);\n\t\treturn this.coocmMatrix2;\n\t}","step() {\n const backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n const cB = this.buffer[this.currentBufferIndex]; // currentBuffer\n const bB = this.buffer[backBufferIndex]; // backBuffer\n const w = this.width, h = this.height;\n\n const countNeighbors = (x, y) => {\n let c = 0; // counter\n if (x > 0 && cB[y][x - 1]) c++;\n if (x < w - 1 && cB[y][x + 1]) c++;\n if (y > 0 && cB[y - 1][x]) c++;\n if (y < h - 1 && cB[y + 1][x]) c++;\n if (x > 0 && y < h - 1 && cB[y + 1][x - 1]) c++;\n if (y > 0 && x < w - 1 && cB[y - 1][x + 1]) c++;\n if (x > 0 && y > 0 && cB[y - 1][x - 1]) c++;\n if (x < w - 1 && y < h - 1 && cB[y + 1][x + 1]) c++;\n return c;\n }\n\n for (let y = 0; y < this.height; y++) {\n for (let x = 0; x < this.width; x++) {\n const counter = countNeighbors(x, y);\n const cell = cB[y][x];\n if (cell && counter === 2) bB[y][x] = 1;\n else if (cell && counter === 3) bB[y][x] = 1;\n else if (!cell && counter === 3) bB[y][x] = 1;\n else bB[y][x] = 0;\n }\n }\n\n this.currentBufferIndex = backBufferIndex;\n }","controlHorizontalAnterior(x, ficha, matrizCeldas) {\r\n let contador = 0;\r\n let y = ficha.columna;\r\n\r\n while (y - 1 >= 0 && (ficha.getColor() === matrizCeldas[y - 1][x]?.fichaColor)) {\r\n contador++;\r\n y--;\r\n }\r\n return contador;\r\n }","function countSameColorIcons(startIcon, moveX, moveY) {\n\n var curX = startIcon.posX + moveX;\n var curY = startIcon.posY + moveY;\n var count = 0;\n\n while (curX >= 0 && curY >= 0 && curX < BOARD_COLS && curY < BOARD_ROWS && getIconColor(getIcon(curX, curY)) === getIconColor(startIcon))\n {\n count++;\n curX += moveX;\n curY += moveY;\n }\n\n return count;\n\n}","function countTexts(frameY) {\r totalCAP++;\r panelCAP++;\r\r if(frameY < 3000) {\r topRowCAP++;\r }\r}","function findNewState(){\n\n let newState = new Array();\n let prev;\n let anc;\n let next;\n\n for(i = 0; i < cols; i++) {\n\n anc = state[i];\n\n if(i == 0){\n prev = state[state.length-1];\n next = state[i+1];\n }\n else if( i == state.length - 1) {\n prev = state[i-1];\n next = state[0];\n }\n else{\n prev = state[i-1];\n next = state[i+1];\n }\n\n if(prev == 1 && anc == 1 && next == 1) {\n newState[i] = 0;\n }\n else if (prev == 1 && anc == 1 && next == 0) {\n newState[i] = 0;\n }\n else if (prev == 1 && anc == 0 && next == 1) {\n newState[i] = 1;\n }\n else if (prev == 1 && anc == 0 && next == 0) {\n newState[i] = 1;\n }\n else if (prev == 0 && anc == 1 && next == 1) {\n newState[i] = 1;\n }\n else if (prev == 0 && anc == 1 && next == 0) {\n newState[i] = 1;\n }\n else if (prev == 0 && anc == 0 && next == 1) {\n newState[i] = 0;\n }\n else if (prev == 0 && anc == 0 && next == 0) {\n newState[i] = 0;\n }\n }\n state = newState.slice();\n}","function findMaxMatch3() {\r\n\r\n // Initialise empty matching (reset flags)\r\n for (var i = 0; i < nodes.length; i++)\r\n match[i] = false;\r\n\r\n // Create frame and push to frames array (for animation)\r\n longTrace.push(\"
Algorithm started
\");\r\n shortTrace.push(\"
Algorithm started
\");\r\n frame = new Frame2(1, 1, longTraceNum++, shortTraceNum, graph.map(g => ([ ...g ])), [], [...blossom]);\r\n frames.push(frame);\r\n\r\n // Find augmenting path and augment matching along path until maximum matching is found\r\n while (findAugmentingPath());\r\n\r\n // Create frame and push to frames array (for animation)\r\n longTrace.push(\"
Maximum matching found
\");\r\n shortTrace.push(\"
Maximum matching found
\");\r\n frame = new Frame2(9, 5, longTraceNum++, ++shortTraceNum, graph.map(g => ([ ...g ])), [], []);\r\n frames.push(frame);\r\n\r\n}","getNumActiveDiagnosed() { return this.E1[1] + this.I0[1] + this.I1[1] + this.I2[1] + this.I3[1]; }","function charCountCompabilityCheck(seqs) {\n\tvar positionArray = new Array(seqs[0].length);\n\t// Create a base counter for each position:\n\tfor(var i = 0, n = seqs[0].length; i < n; i++) {\n\t\tpositionArray[i] = {A:0, T:0, G:0, C:0};\n\t}\n\t// Iterate over all sequences:\n\tvar seq;\n\tfor(var i = 0, n = seqs.length; i < n ; i++) {\n\t\tseq = seqs[i];\n\t\t// Iterate over all positions in current sequence:\n\t\tfor(var j = 0, m = seq.length; j < m; j++) {\n\t\t\t// Add one to the count for the base in this position:\n\t\t\tpositionArray[j][seq[j]] += 1;\n\t\t}\n\t}\n\t// Sum channel distribution:\n\tvar green;\n\tvar red;\n\tfor(var i = 0, n = seqs[0].length; i < n ; i++) {\n\t\tgreen = positionArray[i].T + positionArray[i].G;\n\t\tred = positionArray[i].A + positionArray[i].C;\n\t}\n\treturn (green > 0 && red > 0);\n}","constructor(pattern_num, x = 0, y = 0, secondary = false) {\n this.pattern_num = pattern_num;\n this.blocks = [];\n this.pattern = shapes[pattern_num];\n this.color = colors[shape_color[pattern_num]];\n this.start_x = x;\n this.start_y = y;\n\n this.initialize_pattern = function () {\n if (this.blocks.length != 0) {\n let least_x = Infinity;\n let least_y = Infinity;\n this.blocks.forEach(block => {\n if (block.left < least_x) {\n least_x = block.left;\n }\n if (block.top < least_y) {\n least_y = block.top;\n }\n });\n while (least_x + this.pattern[0].length * field.block_width > canvas.width) {\n least_x -= field.block_width;\n }\n while (least_y + this.pattern.length * field.block_height > canvas.height) {\n least_y -= field.block_height;\n }\n\n\n this.start_x = least_x;\n this.start_y = least_y;\n }\n this.blocks = [];\n let start_x = this.start_x;\n let start_y = this.start_y;\n for (let i = 0; i < this.pattern.length; i += 1) {\n\n let row = this.pattern[i];\n for (let j = 0; j < row.length; j += 1) {\n let data = row[j];\n if (data != 1) {\n\n start_x += field.block_width;\n } else {\n let block = new game_block(this.color, start_x, start_y, secondary);\n this.blocks.push(block);\n start_x += field.block_width;\n }\n\n }\n start_x = this.start_x;\n start_y += field.block_height;\n }\n //this.start_y = start_y;\n }\n this.initialize_pattern_test = function (pattern) {\n let imaginary_blocks = [];\n let start_x;\n let start_y;\n if (this.blocks.length != 0) {\n let least_x = Infinity;\n let least_y = Infinity;\n this.blocks.forEach(block => {\n if (block.left < least_x) {\n least_x = block.left;\n }\n if (block.top < least_y) {\n least_y = block.top;\n }\n });\n while (least_x + pattern[0].length * field.block_width > canvas.width) {\n least_x -= field.block_width;\n }\n while (least_y + pattern.length * field.block_height > canvas.height) {\n least_y -= field.block_height;\n }\n\n\n start_x = least_x;\n start_y = least_y;\n }\n\n let st_x = start_x;\n for (let i = 0; i < pattern.length; i += 1) {\n\n let row = pattern[i];\n for (let j = 0; j < row.length; j += 1) {\n let data = row[j];\n if (data != 1) {\n\n start_x += field.block_width;\n } else {\n let block = new game_block(this.color, start_x, start_y);\n imaginary_blocks.push(block);\n start_x += field.block_width;\n }\n\n }\n start_x = st_x;\n start_y += field.block_height;\n }\n return imaginary_blocks;\n\n }\n this.get_vertical_height = function(){\n let smallest_top = Infinity;\n let biggest_bottom = -Infinity;\n this.blocks.forEach(block => {\n if(block.top < smallest_top){\n smallest_top = block.top;\n\n }\n if(block.bottom > biggest_bottom){\n biggest_bottom = block.bottom;\n }\n })\n return biggest_bottom - smallest_top;\n }\n this.delete_block = function (index) {\n this.blocks.splice(index, 1);\n }\n this.rotate_clockwise = function () {\n let new_pattern = rotate_array_clockwise(this.pattern);\n\n let imaginary_blocks = this.initialize_pattern_test(new_pattern);\n console.log(this.blocks, imaginary_blocks);\n let other_pieces = field.pieces;\n let inside_of_another = false;\n for (let i = 0; i < other_pieces.length; i += 1) {\n let other_piece = other_pieces[i];\n for (let j = 0; j < imaginary_blocks.length; j += 1) {\n let cur_block = imaginary_blocks[j];\n \n if (cur_block.inside_of_another_piece(other_piece) === true) {\n \n inside_of_another = true;\n break;\n }\n }\n if (inside_of_another === true) {\n break;\n }\n }\n if (inside_of_another === false) {\n this.pattern = new_pattern;\n\n this.initialize_pattern();\n }\n\n\n }\n this.initialize_pattern();\n this.draw = function () {\n this.blocks.forEach(function (block) {\n block.draw();\n })\n };\n this.touches_other_piece_bottom = function (pieces, excluded = -1) {\n for (let i = 0; i < pieces.length; i += 1) {\n if(excluded === i){\n continue;\n }\n let other_piece = pieces[i];\n for (let j = 0; j < this.blocks.length; j += 1) {\n if (this.blocks[j].touches_other_piece_bottom(other_piece) === true) {\n \n return true;\n }\n }\n\n }\n return false;\n }\n this.touches_other_piece_right = function () {\n for (let i = 0; i < field.pieces.length; i += 1) {\n let other_piece = field.pieces[i];\n for (let j = 0; j < this.blocks.length; j += 1) {\n if (this.blocks[j].touches_other_piece_right(other_piece) === true) {\n return true;\n }\n }\n\n }\n return false;\n }\n this.touches_other_piece_left = function () {\n for (let i = 0; i < field.pieces.length; i += 1) {\n let other_piece = field.pieces[i];\n for (let j = 0; j < this.blocks.length; j += 1) {\n if (this.blocks[j].touches_other_piece_left(other_piece) === true) {\n return true;\n }\n }\n\n }\n return false;\n }\n\n this.touches_bottom = function () {\n let touches_bottom = false;\n for (let i = 0; i < this.blocks.length; i += 1) {\n let item = this.blocks[i];\n let temp = item.touches_bottom();\n if (temp === true) {\n touches_bottom = true;\n break;\n }\n }\n return touches_bottom;\n }\n this.move_down = function () {\n let touches_bottom = this.touches_bottom();\n let touches_other_piece_bottom = this.touches_other_piece_bottom(field.pieces);\n if (touches_bottom === false && touches_other_piece_bottom === false) {\n this.blocks.forEach(block => {\n block.move_down();\n });\n touches_bottom = this.touches_bottom();\n touches_other_piece_bottom = this.touches_other_piece_bottom(field.pieces);\n if (touches_bottom === true || touches_other_piece_bottom === true) {\n field.deactivate_piece();\n }\n } else if (touches_bottom === false || touches_other_piece_bottom === false) {\n field.deactivate_piece();\n }\n\n }\n this.move_right = function () {\n let touches_right = false;\n let touches_other_piece_right = this.touches_other_piece_right();\n for (let i = 0; i < this.blocks.length; i += 1) {\n let item = this.blocks[i];\n let temp = item.touches_right();\n if (temp === true) {\n touches_right = true;\n break;\n }\n }\n if (touches_right === false && touches_other_piece_right === false) {\n\n this.blocks.forEach(block => {\n block.move_right();\n })\n }\n }\n this.move_left = function () {\n let touches_left = false;\n let touches_other_piece_left = this.touches_other_piece_left();\n for (let i = 0; i < this.blocks.length; i += 1) {\n let item = this.blocks[i];\n let temp = item.touches_left();\n if (temp === true) {\n touches_left = true;\n break;\n }\n }\n if (touches_left === false && touches_other_piece_left === false) {\n this.blocks.forEach(block => {\n block.move_left();\n })\n }\n }\n\n\n }","function fineClassification(inputPattern, inputCandidates) {\n\t var inputLength = inputPattern.length;\n\t var candidates = [];\n\t for(var i=0;i iLength-3) {\n\n\t\t var iMap = getMap(iPattern, inputPattern, initialDistance);\n\n\t\t iMap = completeMap(iPattern, inputPattern, wholeWholeDistance, iMap);\n\t\t if(refPatterns[j][0] == \"委\") {\n\t\t console.log(\"finished imap, fine:\");\n\t\t console.log(iMap);\n\t\t\t console.log(\"weight:\")\n\t\t\t console.log(computeDistance(iPattern, inputPattern, wholeWholeDistance, iMap));\n\t\t\t console.log(\"weight intended:\")\n\t\t\t console.log(computeDistance(iPattern, inputPattern, wholeWholeDistance, [0,1,2,3,4,7,5,6]));\n\t\t\t }\n\t\t var dist = computeWholeDistanceWeighted(iPattern, inputPattern, iMap);\n\t\t var n = inputLength;\n\t\t var m = iPattern.length;\n\t\t if(m > n) {\n\t\t m = n;\n\t\t }\n\t\t dist = dist / m;\n\t\t candidates.push([j, dist]);\n\t }\n\t }\n\t candidates.sort(function(a, b){return a[1]-b[1]});\n\t var outStr = \"\";\n\t for(var i=0;i 0) {\n let $left_cell = get_cell(row, --col)\n console.log(col, color, 'left count')\n console.log($left_cell)\n if ($left_cell.css('backgroundColor') == color) {\n count += 1\n console.log('count +++ left')\n }\n else {\n break\n }\n }\n col = temp\n while (col < that.col) {\n let $right_cell = get_cell(row, ++col)\n console.log(col, color, 'right count')\n console.log($right_cell)\n if ($right_cell.css('backgroundColor') == color) {\n count += 1\n console.log('count +++ right')\n }\n else {\n break\n }\n }\n if (count >= 4) {\n return true\n }\n return false\n }","checkCollide(trials) {\n \n \n let infosRow = {rowUp: {row:1, top:0}, rowDown:{row:2, top:125}};\n let arrayRow = [];\n let iteration = 1;\n\n let isCollide = this.doCheckCollide(trials, infosRow); \n\n // There is collide so need to prevent all overlap\n while(isCollide) {\n\n let newtrialsCopy = [...trials.filter(trial => trial.row == iteration)];\n infosRow = {rowUp: {row:iteration+1, top:125}, rowDown:{row:iteration+2, top:(125/2) +125}};\n this.doCheckCollide(newtrialsCopy, infosRow); \n if(iteration >= trials.length) {\n break;\n }\n iteration ++;\n }\n this.setState({ trials: trials });\n return trials;\n }","changeState(leftBoarderDistance, downDistance, board, bS, next) {\n let distanceB = Math.round(downDistance / blockSize); // Distance in blocks to bottom border\n let distance = (Math.round(leftBoarderDistance / blockSize)); // Distance in blocks to left border\n if (this.calc == false) {\n if (this.check(leftBoarderDistance, downDistance, board, bS, next) == false) {\n return;\n }\n }\n switch (this.blockNumber) { // Switch depending on block\n case 1: {\n switch (this.state) { //Check state\n case 1: {\n if (distance < 5) {\n for (let i = 0; i < this.res.children.length; i++) {\n this.res.children[i].y = 3 * blockSize;\n this.res.children[i].x = (i) * blockSize;\n }\n }\n else {\n for (let i = 0; i < this.res.children.length; i++) {\n this.res.children[i].y = 3 * blockSize;\n this.res.children[i].x = (i - 3) * blockSize;\n }\n }\n this.state = 2;\n break;\n }\n case 2: {\n if (distance < 5) {\n for (let i = 0; i < this.res.children.length; i++) {\n this.res.children[i].x = 0;\n this.res.children[i].y = blockSize * i;\n }\n }\n else {\n for (let i = 0; i < this.res.children.length; i++) {\n this.res.children[i].x = 0;\n this.res.children[i].y = blockSize * i;\n }\n }\n this.state = 1;\n break;\n }\n }\n }\n case 2: {\n break;\n }\n case 3: {\n // Variable holding next/previous state, we don't want to change main variable until we change the state\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = 0;\n }\n else {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize * (i + 1);\n }\n else {\n this.res.children[i].y = blockSize * (i - 1);\n this.res.children[i].x = blockSize;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize * (i - 1);\n this.res.children[i].x = blockSize * 2;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize * (i - 2);\n this.res.children[i].x = blockSize;\n }\n }\n if (!next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n case 4: {\n // Variable holding next/previous state, we don't want to change main variable until we change the state\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i == 0) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = 0;\n }\n else {\n this.res.children[i].y = (i - 1) * blockSize;\n this.res.children[i].x = blockSize;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i == 0) {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = (i - 1) * blockSize;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i == 0) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = 2 * blockSize;\n }\n else {\n this.res.children[i].y = (i - 1) * blockSize;\n this.res.children[i].x = blockSize;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = i * blockSize;\n }\n else {\n this.res.children[i].y = 2 * blockSize;\n this.res.children[i].x = blockSize;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n case 5: {\n // Variable holding next/previous state, we don't want to change main variable until we change the state\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = blockSize * (i - 1);\n this.res.children[i].x = blockSize * 2;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = 0;\n }\n else {\n this.res.children[i].y = blockSize * (i - 1);\n this.res.children[i].x = blockSize;\n }\n }\n if (!next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n case 6: {\n // Variable holding next/previous state, we don't want to change main variable until we change the state\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = blockSize * 2;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = 0;\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 3) {\n this.res.children[i].y = blockSize * i;\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = 0;\n this.res.children[i].x = 0;\n }\n }\n if (!next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n case 7: {\n let state = this.stateChanger(next);\n switch (state) {\n case 1: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = 0;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 2: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * (i + 1);\n this.res.children[i].x = blockSize;\n }\n else {\n this.res.children[i].y = blockSize * (i - 2);\n this.res.children[i].x = blockSize * 2;\n }\n }\n if (next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n case 3: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize;\n this.res.children[i].x = blockSize * i;\n }\n else {\n this.res.children[i].y = blockSize * 2;\n this.res.children[i].x = blockSize * (i - 1);\n }\n }\n if (next) {\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\n }\n else {\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\n }\n this.state = state;\n break;\n }\n case 4: {\n for (let i = 0; i < this.res.children.length; i++) {\n if (i < 2) {\n this.res.children[i].y = blockSize * (i + 1);\n this.res.children[i].x = 0;\n }\n else {\n this.res.children[i].y = blockSize * (i - 2);\n this.res.children[i].x = blockSize;\n }\n }\n if (!next) {\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\n }\n this.state = state;\n break;\n }\n }\n break;\n }\n }\n }","goToNextStep() {\n let diffCount = 0;\n this._cells = this._cells.map((cell, index) => {\n let neighbours = this._layout.getNeighbours(index);\n\n let aliveNeighbours = neighbours.filter(listIndex => this._cells[listIndex]);\n\n if (cell) {\n // RULE NO. 1 AND NO. 3\n if (aliveNeighbours.length < 2 || aliveNeighbours.length > 3) {\n diffCount++;\n return false;\n }\n } else {\n // RULE NO. 4\n if (aliveNeighbours.length === 3) {\n diffCount++;\n return true;\n }\n }\n\n // REST GOES TO RULE NO. 2\n return cell;\n });\n\n if (diffCount > 0) {\n this._gameState = GameState.PROGRESS;\n } else {\n this._gameState = GameState.DONE;\n }\n }","function newGrid() {\n // Checks how many living neighboring cells each cell has\n // Iterate the grid\n for (let i = 0; i < dimension; i++) {\n for (let j = 0; j < dimension; j++) {\n // Count surrounding living cells\n let cellsCount = 0;\n // Check the three cells above the current one\n if (i !== 0) { // continue only if this is not the first/zero row\n if (j !== 0) // continue only if this is not the first/zero column\n cellsCount += grid[i - 1][j - 1];\n cellsCount += grid[i - 1][j];\n if (j !== (dimension - 1)) // continue only if this is not the last column\n cellsCount += grid[i - 1][j + 1];\n }\n // Check the cell on the left\n if (j !== 0) // continue only if this is not the first/zero column\n cellsCount += grid[i][j - 1];\n // Check the cell on the right \n if (j !== (dimension - 1)) // continue only if this is not the last column\n cellsCount += grid[i][j + 1];\n // Check the three cells below the current one\n if (i !== (dimension - 1)) {\n if (j !== 0) // continue only if this is not the first/zero column\n cellsCount += grid[i + 1][j - 1];\n cellsCount += grid[i + 1][j];\n if (j !== (dimension - 1)) // continue only if this is not the last column\n cellsCount += grid[i + 1][j + 1];\n }\n\n // Check if the currnet cell is dead\n if (grid[i][j] === 0) {\n // Become alive if three surrounding cells are alive, else die\n if (cellsCount === 3) {\n copiedGrid[i][j] = 1;\n } else {\n copiedGrid[i][j] = 0;\n }\n } \n // Current cell is alive\n else if (grid[i][j] === 1) {\n // stay alive with 2 or 3 living neighbours, else die\n if (cellsCount === 2 || cellsCount === 3) {\n copiedGrid[i][j] = 1;\n } else {\n copiedGrid[i][j] = 0;\n }\n }\n }\n }\n\n // Copy the temporary grid in real one\n for (let j = 0; j < dimension; j++) {\n for (let k = 0; k < dimension; k++) {\n grid[j][k] = copiedGrid[j][k];\n }\n }\n\n drawGrid();\n}","Board_Evaluation(board, color) {\n let result = { two: 0, three: 0, four: 0 };\n\n for (var i = 0; i < 6; i++) {\n for (var j = 0; j < 7; j++) {\n if (board[i][j] === color) {\n let x = j;\n let y = i;\n let arr = [\n this.search2(x, y, color, 1, 0, 0, board),\n this.search2(x, y, color, -1, 0, 0, board),\n this.search2(x, y, color, 1, 1, 0, board),\n this.search2(x, y, color, -1, -1, 0, board),\n this.search2(x, y, color, -1, 1, 0, board),\n this.search2(x, y, color, 1, -1, 0, board),\n this.search2(x, y, color, 0, 1, 0, board),\n this.search2(x, y, color, 0, -1, 0, board),\n ];\n\n for (var q = 0; q < 4; q++) {\n switch (arr[2 * q].count + arr[2 * q + 1].count - 1) {\n case 2:\n if (arr[2 * q].live) result.two++;\n break;\n\n case 3:\n if (arr[2 * q].live + arr[2 * q + 1].live > 0) {\n result.three++;\n } else if (\n arr[2 * q].live + arr[2 * q + 1].live ===\n 2\n ) {\n console.log(1);\n result.four++;\n }\n break;\n\n case 4:\n result.four++;\n break;\n }\n }\n }\n }\n }\n return result;\n }","checkForMatch() {\n\n // Matching horizontal lines\n if(this._topLeft.textContent === 'X' || this._topLeft.textContent === '0') {\n \n if(this._topLeft.textContent === this._topMiddle.textContent && this._topMiddle.textContent === this._topRight.textContent) {\n this._topLeft.style.backgroundColor = 'green'\n this._topMiddle.style.backgroundColor = 'green'\n this._topRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n if(this._middleLeft.textContent === 'X' || this._middleLeft.textContent === '0') {\n \n if(this._middleLeft.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._middleRight.textContent) {\n this._middleLeft.style.backgroundColor = 'green'\n this._middleMiddle.style.backgroundColor = 'green'\n this._middleRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n if(this._bottomLeft.textContent === 'X' || this._bottomLeft.textContent === '0') {\n \n if(this._bottomLeft.textContent === this._bottomMiddle.textContent && this._bottomMiddle.textContent === this._bottomRight.textContent) {\n this._bottomLeft.style.backgroundColor = 'green'\n this._bottomMiddle.style.backgroundColor = 'green'\n this._bottomRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n // Matching vertical lines\n if(this._topLeft.textContent === 'X' || this._topLeft.textContent === '0') {\n \n if(this._topLeft.textContent === this._middleLeft.textContent && this._middleLeft.textContent == this._bottomLeft.textContent) {\n this._topLeft.style.backgroundColor = 'green'\n this._middleLeft.style.backgroundColor = 'green'\n this._bottomLeft.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n if(this._topMiddle.textContent === 'X' || this._topMiddle.textContent === '0') {\n \n if(this._topMiddle.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent == this._bottomMiddle.textContent) {\n this._topMiddle.style.backgroundColor = 'green'\n this._middleMiddle.style.backgroundColor = 'green'\n this._bottomMiddle.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n if(this._topRight.textContent === 'X' || this._topRight.textContent === '0') {\n \n if(this._topRight.textContent === this._middleRight.textContent && this._middleRight.textContent == this._bottomRight.textContent) {\n this._topRight.style.backgroundColor = 'green'\n this._middleRight.style.backgroundColor = 'green'\n this._bottomRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n \n // Matching diagonal lines\n if(this._middleMiddle.textContent === 'X' || this._middleMiddle.textContent === '0') {\n \n if(this._topLeft.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._bottomRight.textContent) {\n this._topLeft.style.backgroundColor = 'green'\n this._middleMiddle.style.backgroundColor = 'green'\n this._bottomRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n\n if(this._topRight.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._bottomLeft.textContent) {\n this._topRight.style.backgroundColor = 'green'\n this._middleMiddle.style.backgroundColor = 'green'\n this._bottomLeft.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n }","apply(mutableBoardData, cloneSquare){\n //5..2...4....6.3....3...9..7..3..7.....7..8...6......2..8......3...4..6.....1..5..\n let mutations = 0;\n this.cellIndexes.forEach( (cellIdx, index, array) => {\n let immutableSquare = mutableBoardData[cellIdx];\n let replacementCandidates = [...immutableSquare.candidates];\n \n \n // unlike cage, littleKiller can have repeats in other boxes.\n\n \n let otherCellIndexes = this.cellIndexes.filter( i=> i!== cellIdx);\n replacementCandidates.forEach( (candidate, cIndex, cArray) => {\n if( candidate > 0 ){\n if( ! this.cageValidates(mutableBoardData, this.value-candidate, otherCellIndexes)){\n replacementCandidates[cIndex] = 0;\n mutations = mutations+1;\n }\n \n\n }\n });\n \n\n \n \n \n\n // if the region has a candidate that exists in the intersection of two regions, \n // and the candidate only exists in that intersection on the Other rule, \n //then this candidate must also exist within said intersection on this rule!\n\n\n if( mutations>0 ){\n let newSquareData = cloneSquare(immutableSquare);\n console.log(\"Removing value from square\");\n newSquareData.candidates = replacementCandidates;\n \n mutableBoardData[cellIdx]=newSquareData;\n }\n\n \n \n\n });\n return mutations;\n \n }","function getChainLength(x:int, y: int, xIncrement: int, yIncrement: int){\n\tvar countUp = 0;\n\tvar countDown = 0;\n\twhile (cells[x + countUp * xIncrement, y + countUp * yIncrement].cellStatus == cells[x,y].cellStatus){\n\t\tcountUp ++;\n\t\tif (Mathf.Max(x + countUp * xIncrement, y + countUp * yIncrement) > xSize - 1 || Mathf.Min(x + countUp * xIncrement, y + countUp * yIncrement) < 0){\n\t\t\tbreak;\n\t\t}\n\t}\n\twhile (cells[x - countDown * xIncrement, y - countDown * yIncrement].cellStatus == cells[x,y].cellStatus){\n\t\tcountDown ++;\n\t\tif (Mathf.Max(x - countDown * xIncrement, y - countDown * yIncrement) > xSize - 1 || Mathf.Min(x - countDown * xIncrement, y - countDown * yIncrement) < 0){\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn countUp + countDown - 1;\n}","function decide() {\n\t\t\t\tvar recognise = false;\n\t\t\t\tif(fromAbove && fromBelow) {\n\t\t\t\t\tif(fromAbove == fromBelow) {\n\t\t\t\t\t\talert(\"Pattern recognized\");\n\t\t\t\t\t\t// window['Cortex'].grid[self.childAddress[i].x][self.childAddress[i].y][self.childAddress[i].z](fromBelow);\n\t\t\t\t\t} else {\n\t\t\t\t\t\talert(\"Pattern not recognized\");\n\t\t\t\t\t\t// window['Cortex'].grid[self.parentAddress.x][self.parentAddress.y][self.parentAddress.z](fromBelow);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}","countBlockTurns(move) {\n let layerCount = move.getLayerCount();\n let layerMask = move.getLayerMask();\n let turns = Math.abs(move.getAngle()) % 4;\n if (turns == 0) {\n return 0;\n } else {\n let previousTurnedLayer = 0;\n let countTurned = 0;\n let previousImmobileLayer = 1;\n let countImmobile = 0;\n for (let i = 0; i < layerCount; i++) {\n let currentLayer = (layerMask >>> i) & 1;\n if (currentLayer == 1 && currentLayer != previousTurnedLayer) {\n countTurned++;\n }\n if (currentLayer == 0 && currentLayer != previousImmobileLayer) {\n countImmobile++;\n }\n previousTurnedLayer = previousImmobileLayer = currentLayer;\n }\n return Math.min(countTurned, countImmobile);\n }\n }","set _physicalStart(val){val=val%this._physicalCount;if(0>val){val=this._physicalCount+val}if(this.grid){val=val-val%this._itemsPerRow}this._physicalStartVal=val}","calcMaxLength () {\n let maxima = [0.0, 0.0, 0.0]\n let minima = [0.0, 0.0, 0.0]\n let spans = [0.0, 0.0, 0.0]\n\n function comp (v, i) {\n if (i === 0) return v.x\n if (i === 1) return v.y\n if (i === 2) return v.z\n }\n\n let atom = this.getAtomProxy()\n for (let iDim = 0; iDim < 3; iDim++) {\n for (let iAtom = 0; iAtom < this.getAtomCount(); iAtom += 1) {\n let pos = atom.load(iAtom).pos\n if (minima[iDim] > comp(pos, iDim)) {\n minima[iDim] = comp(pos, iDim)\n }\n if (maxima[iDim] < comp(pos, iDim)) {\n maxima[iDim] = comp(pos, iDim)\n }\n }\n spans[iDim] = maxima[iDim] - minima[iDim]\n }\n this.maxLength = Math.max(spans[0], spans[1], spans[2])\n }","step() {\n let backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0 \n let currentBuffer = this.bufferr[this.currentBufferIndex];\n let backBuffer = this.buffer[this.backBufferIndex];\n \n\n // helper function to see if cell has infectious neighbor\n const hasInfectiousNeighbour = (x, y) => {\n const nextValue = (currentBuffer[y][x] + 1) % MODULO;\n\n // check west neighbour to see if it has nextValue\n if (x > 0) { // if it isn't it has no west neighbour it's a col 0\n if(currentBuffer[y][x-1] === nextValue) {\n return true; \n }\n } \n\n // check North, note x,y 00 is top left not bottom left of graph\n if (y > 0) { // if it isn't it has no north neighbour\n if(currentBuffer[y - 1][x] === nextValue) {\n return true; \n }\n } \n\n // check south\n if (y < this.height - 1) { // if it isn't it has no north neighbour\n if(currentBuffer[y + 1][x] === nextValue) {\n return true; \n }\n }\n\n // check east\n if (x < this.width - 1) { // if it isn't it has no north neighbour\n if(currentBuffer[y][x + 1] === nextValue) {\n return true; \n }\n }\n\n // default case, none of the neighbours have the value or infection\n return false; \n\n }\n\n // loop through the current buffer and populate backbuffer based on currenbufer \n // infected neighbour value\n for (let y = 0; y < this.height; y++) {\n for (let x = 0; x < this.lenght; x++) {\n if (hasInfectiousNeighbour(x,y)) { // backbuffer value is next val\n backBuffer[x][y] = (currentBuffer[y][x] + 1) % MODULO; \n } else { // backBuffer same as current buffer\n backBuffer[y][x] = currentBuffer[y][x];\n }\n\n }\n }\n this.currentBufferIndex = backBufferIndex;\n }","_calculateBlockIndex() {\n var curX = this.startX;\n var maxH = 0;\n let superXAlign = 0;\n let superXWidth = 0;\n let prevBlock = null;\n let i = 0;\n this.textFont.setFontSize(this.fontSize);\n this.blocks.forEach((block) => {\n // super/subscript\n const sp = this.isSuperscript(block);\n const sub = this.isSubcript(block);\n\n block.width = 0;\n block.height = 0;\n\n // coeff for sub/super script\n const subAdj = (sp || sub) ? VF.ChordSymbol.superSubRatio : 1.0;\n // offset for super/sub\n let subOffset = 0;\n if (sp) {\n subOffset = SuiInlineText.superscriptOffset * this.pointsToPixels;\n } else if (sub) {\n subOffset = SuiInlineText.subscriptOffset * this.pointsToPixels;\n } else {\n subOffset = 0;\n }\n block.x = curX;\n if (block.symbolType === SuiInlineText.symbolTypes.TEXT) {\n for (i = 0; i < block.text.length; ++i) {\n const ch = block.text[i];\n\n const glyph = this.textFont.getMetricForCharacter(ch);\n block.width += ((glyph.advanceWidth) / this.textFont.resolution) * this.pointsToPixels * block.scale * subAdj;\n const blockHeight = (glyph.ha / this.textFont.resolution) * this.pointsToPixels * block.scale;\n block.height = block.height < blockHeight ? blockHeight : block.height;\n block.y = this.startY + (subOffset * block.scale);\n }\n } else if (block.symbolType === SuiInlineText.symbolTypes.GLYPH) {\n block.width = (block.metrics.advanceWidth / VF.ChordSymbol.engravingFontResolution) * this.pointsToPixels * block.scale;\n block.height = (block.glyph.metrics.ha / VF.ChordSymbol.engravingFontResolution) * this.pointsToPixels * block.scale;\n block.x += block.metrics.leftSideBearing / VF.ChordSymbol.engravingFontResolution * this.pointsToPixels * block.scale;\n block.y = this.startY + this._glyphOffset(block) + subOffset;\n }\n // Line subscript up with super if the follow each other\n if (sp) {\n if (superXAlign === 0) {\n superXAlign = block.x;\n }\n } else if (sub) {\n if (superXAlign > 0) {\n block.x = superXAlign;\n superXWidth = prevBlock.x + prevBlock.width;\n curX = superXAlign;\n superXAlign = 0;\n } else {\n if (superXWidth > 0 && superXWidth < block.width + block.x) {\n superXWidth = block.width + block.x;\n }\n }\n } else if (superXWidth > 0) {\n block.x = superXWidth + VF.ChordSymbol.spacingBetweenBlocks;\n superXWidth = 0;\n } else {\n superXAlign = 0;\n }\n curX += block.width;\n maxH = block.height > maxH ? maxH : block.height;\n prevBlock = block;\n });\n this.width = curX - this.startX;\n this.height = maxH;\n this.updatedMetrics = true;\n }","step() {\n // !!!! IMPLEMENT ME !!!!\n const currentCells = this.cells[this.activeBuffer];\n const nextCells = this.cells[this.activeBuffer === 1 ? 0 : 1];\n\n for (let h = 0; h < this.height; h++) {\n for (let w = 0; w < this.width; w++) {\n const count = this.getLiveNeighborCount.call(this, h, w);\n\n if (currentCells[h][w]) {\n if (count < 2 || count > 3) {\n nextCells[h][w] = false;\n } else {\n nextCells[h][w] = true;\n }\n } else {\n if (count === 3) {\n nextCells[h][w] = true;\n } else {\n nextCells[h][w] = false;\n }\n }\n }\n }\n this.activeBuffer = this.activeBuffer === 1 ? 0 : 1;\n }","function checkSequence(){\n\t console.log(\"checking\");\n\t if (JSON.stringify(pattern) === JSON.stringify(userPattern)){\n\t\t\telementScore.innerHTML ++;\n\t\t\tif(elementHigh.innerHTML < elementScore.innerHTML){\n\t\t\t elementHigh.innerHTML++;\n\t\t\t}\n\t/* The next level function is called if they are, if not end game.*/\t\n\t\t \n\t\t console.log(\"next\");\n\t nextLevel();\n\t }\n\t\telse {\n\t\t\n\t\t\tendGame();\n\t\t} \n }","checkRows() {\n for (let o = 0; o < this.canvasheight / this.blockSize; o++) {\n let row = 0;\n for (let i = 0; i < this.blocks.length; i++){\n if (this.blocks[i].y === o){\n row++;\n }\n }\n\n if (row === this.canvaswidth / this.blockSize){\n this.remove(o);\n }\n }\n }","function matchPattern(pattern,genome) {\n //console.log(pattern);\n //console.log(genome);\n //console.log(\"genome length : \" + genome.length);\n var positions = [];\n for(var i=0;i<=genome.length-pattern.length;i++) {\n var str = computeText(genome,i,pattern.length);\n // console.log(str);\n if(str==pattern) {\n positions.push(i);\n }\n }\n return positions;\n /*\n var output = \"\";\n for(var i=0;i {\n\n let imgBytes = await this.toIntegerArray();\n\n let scanCount = 0;\n \n let SOS = this.SOS;\n\n let imgBytesLength = imgBytes.length;\n \n //0xFFDA\n for (let i = 0; i < imgBytesLength; i = i + 2) {\n //0xFFDA\n if (imgBytes[i] === SOS[0] && imgBytes[i + 1] === SOS[1]) {\n scanCount++;\n }\n }\n \n resolve(scanCount);\n });\n }","parseBlock(s, currentRehearsalGroup, latest_variables){\n // parase until block boundary is found\n // block boundary = \"[\" or 2 successive NL or NOL\n try{\n var r = null;\n var loop_cnt = 0;\n\n var block = new common.Block();\n var current_align = \"expand\";\n\n this.context.contiguous_line_break = 0; // This should be done only if NL is really consumed.\n\n let num_meas_row = 0;\n\n let MAX_LOOP = 1000;\n\n let end_of_rg = false;\n\n // eslint-disable-next-line no-constant-condition\n while (true) {\n r = this.nextToken(s);\n if (r.type == TOKEN_END){\n s = r.s; // explicitly consume the last spaces if any.\n end_of_rg = true;\n break;\n }else if (r.type == TOKEN_NL) {\n this.context.line += 1;\n this.context.contiguous_line_break += 1;\n current_align = \"expand\"; // default is expand\n //if(this.context.contiguous_line_break >= 2) break; Do not break here. If the first non NL element is found, then break.\n } else if(r.type == TOKEN_BACK_SLASH){\n if(this.context.contiguous_line_break >= 2) break;\n // Expect TOKEN_NL \n r = this.nextToken(r.s);\n if(r.type != TOKEN_NL) this.onParseError(\"INVALID CODE DETECTED AFTER BACK SLASH\");\n this.context.line += 1;\n //block.appendChild(new common.RawSpaces(r.sss));\n //block.appendChild(new common.RawSpaces(r.token)); \n // Does not count as line break\n }else if(r.type == TOKEN_BRACKET_RA){\n if(this.context.contiguous_line_break >= 2) break;\n // Right aligh indicoator > which is outside measure\n current_align = \"right\";\n }else if(r.type == TOKEN_BRACKET_LA){\n if(this.context.contiguous_line_break >= 2) break;\n // Right aligh indicoator > which is outside measure\n current_align = \"left\";\n } else if (r.type == TOKEN_BRACKET_LS) {\n // Next rehearsal mark detected.\n // Do not consume.\n end_of_rg = true;\n break;\n } else if (\n [\n TOKEN_MB,\n TOKEN_MB_DBL,\n TOKEN_MB_LOOP_BEGIN,\n TOKEN_MB_LOOP_END,\n TOKEN_MB_LOOP_BOTH,\n TOKEN_MB_FIN,\n TOKEN_MB_DBL_SIMILE\n ].indexOf(r.type) >= 0\n ) {\n if(this.context.contiguous_line_break >= 2) break;\n\n let is_new_line_middle_of_block = num_meas_row > 0 && this.context.contiguous_line_break == 1;\n\n this.context.contiguous_line_break = 0;\n \n r = this.parseMeasures(r, r.s); // the last NL has not been consumed.\n // Apply the variables valid at this point for each measures\n //r.measures.forEach(m=>{ m.variables = common.shallowcopy(latest_variables);});\n r.measures.forEach(m=>{\n for(let key in latest_variables){\n m.setVariable(latest_variables[key]);\n }\n });\n\n // For the first measure, set align and new line mark.\n r.measures[0].align = current_align;\n r.measures[0].raw_new_line = is_new_line_middle_of_block; // mark to the first measure\n block.concat(r.measures);\n\n ++num_meas_row;\n\n } else if (r.type == TOKEN_PERCENT) {\n if(this.context.contiguous_line_break >= 2) break;\n // Expression\n r = this.parseVariable(r.s); // last NL would not be consumed\n let variable = new common.Variable(r.key, r.value);\n //block.setVariable(r.key, r.value); Do not do this as with this, only the last variable will be valid.\n latest_variables[r.key] = variable;\n block.appendChild(variable);\n this.context.contiguous_line_break = 0; // -= 1; // Does not reset to 0, but cancell the new line in the same row as this variable\n } else {\n console.log(r.token);\n this.onParseError(\"ERROR_WHILE_PARSE_MOST_OUTSIDER\");\n }\n s = r.s;\n loop_cnt++;\n if (loop_cnt >= MAX_LOOP){\n throw \"Too much elements or infnite loop detected with unkown reason\";\n }\n }\n return { block:block, s:s, end_of_rg:end_of_rg};\n }catch(e){\n console.error(e);\n return null;\n }\n }","function ascendingdiagonalline(prevrow, prevcol) {\n var currchip = null;\n var prevchip = 0;\n var count = 0;\n\n for (var row = 0; row < 6; row++) {\n //for any coordinate in an ascending diagonal, sum of col and row are the same\n //thus when row increases by 1, col decreases by 1\n //row = 0 is the top-right of diagonal; row = 5 is the bottom-left of diagonal\n var col = prevcol + prevrow - row;\n if (col >=0 && col < 7) {\n\n currchip = board[row][col];\n if (currchip == prevchip && currchip != 0) {\n count++;\n }\n else {\n count = 0;\n }\n //count == 3 when four chips are in a line\n if (count == UI.wincondition - 1) {\n return true;\n }\n //set previous chip to current chip for next comparison\n prevchip = currchip;\n\n }\n }\n\n //else no ascending diagonal line\n return false;\n}","function macthCount(current, goal) {\n let matchC = 0;\n for (let i = 0; i < current.length; i++) {\n for (let j = 0; j < current[i].length; j++) {\n if (current[i][j] == goal[i][j]) {\n matchC++;\n }\n }\n }\n return (matchC==9)?true:false;\n}","function binaryPlacement(pEn,pKay,set,pItemSet,writtenTo)\n{\n this.inPosition =[];\n this.itemSet=pItemSet;\n this.kay=pKay;\n this.en=pEn;\n var low = ((this.en-this.kay)>this.kay)?this.kay:this.en-this.kay;\n var top = en-low;\n var curPosCapt =writtenTo.slice();\n var lastStart=[0]\n var aftFirst = false;\n\nfor (var cA=0;cA(apArray.length-1))\n if (aftFirst)\n {\n if (cj==start)\n {\n for (var cp=cj-leve-1;cp<(this.en-this.kay);cp++)\n if(cp==cj-leve-1)\n {\n curPosCapt[cp+(leve-1)-lastStart[0]]=this.itemSet[1];\n }\n else\n {\n curPosCapt[pSet[cp+this.kay]]=this.itemSet[1];\n }\n }\n else\n {\n curPosCapt[pSet[cj-1]]=this.itemSet[1];\n }\n }\n this.inPosition.push(curPosCapt.slice());\n }\n if (start==(this.en-1))\n {\n lastStart[0]=lastStart[0]+1;\n var int = 5;\n }\n else\n {\n lastStart[0]=0;\n }\n }\n else\n {\n //on any call the start value is the value at the current level\n start=leveA;\n //starting at that value go up to the en - length+leve +1\n for (var ck=start;ck<(this.en-this.kay+leve+1);ck++)\n {\n //write the counter value to this level position\n leveA++;\n curPosCapt[pSet[ck]]=this.itemSet[0];\n //call the next level with this one holding array that\n //has just been fed ck.\n //increase level by one and\n //make the value one higher\n BAForRep(ck+1,pSet,aftFirst,leve+1,leveA,lastStart,curPosCapt)\n// BAForRep(ck+1,pSet,aftFirst,en,leve+1,leveA,lastStart,curPosCapt)\n //after we have written arrays for the last level\n //we will snap back at each level\n //and we run the ascending sequence to the end\n for (var cm=leve+1;cm= 0; row--) {\n\n if (block) return false; // ==== se han comprobado todos los bloques de abajo ====>>>\n for (let col = 0; col < 4; col++) {\n\n if (this[row][col] === 0) continue;\n\n block = true;\n absPos = this._getAbsolutePosition(row, col);\n\n if (absPos.row === 19) return true; //==== un bloque esta eb el fondo =====>>\n }\n }\n }","topColPositions(callback){\n var colSpan = arguments[0]\n var rowIdx = arguments[1] - 1//get offset so not looking at hall\n var board = arguments[2]\n //get top and bottom\n var l = colSpan[0]\n var r = colSpan[1]\n //create copies to check reduction bounds\n var originalL = l\n //counter for a quit if the room cannot be created with the max amount of tries\n var counter = 0\n\n var span = Math.abs(l-r)\n //reduce by more than a half because of offsets\n l = l - Math.floor((span/3))\n r = r - Math.floor(span/3)\n //update the span\n span = Math.abs(l - r)\n try{\n if(board[rowIdx + 1][l].type == 'H' || board[rowIdx + 1][r].type == 'H'){\n return null\n }\n else if(board[rowIdx][l].filled == false && board[rowIdx][r].filled == false &&\n board[rowIdx+1][l].type != 'H' && board[rowIdx+1][r].filled != 'H'){//checks the bounds to make sure hall is not in the empty spaces\n // console.log('returning original')\n return [l,r]\n }\n else{\n while(((board[l][rowIdx].filled == true || board[r][rowIdx].filled == true) ||\n (board[rowIdx+1][l].type !== 'H' || board[rowIdx+1][r].type !== 'H')) && \n counter < 3 && span > 3){\n // console.log('reducing')\n //top is occupied, reduce by a quarter of current span, usually just 1 because rooms are small right now\n if(board[rowIdx][l].filled == true){\n l = l + 1\n }\n //bot is occupied, reduce by a quarter of current span, usually just 1 because rooms are small right now\n if(board[rowIdx][r].filled == true){\n r = r - 1\n }\n //return the updated positions if the positions are not filled\n if(board[rowIdx][l].filled == false && board[rowIdx][r].filled == false && originalL >= l && l < r && span > 3 &&\n board[rowIdx+1][l].type != 'H' && board[rowIdx+1][r].filled != 'H'){\n return [l,r]\n }\n //update the span\n span = Math.abs(l-r)\n //update counter\n counter += 1\n }\n }\n\n }\n catch(e){\n console.log('row position is null with top:${t} and bottom: ${b}')\n return null\n }\n return null\n }","function findInSequence() {\n\tvar beginMatch = 0;\n\tvar endMatch = 0;\n\tvar i = 0;\n\tvar specChar = RegExp('[X]');\n\tvar test = specChar.exec(searchMotif);\n\tconsole.log(test);\n\tvar xs = [];\n\tvar generalCase = false;\n\tvar splitMotif = searchMotif.split(\"\");\n\tif (test != null && searchMotif.length >= 2){\n\t\t\n\t\tfor (var i = 0; i < searchMotif.length; i++){\n\t\t\tvar char = searchMotif.charAt(i);\n\t\t\tif(char == \"X\"){\n\t\t\t\txs.push(i);\n\t\t\t}\n\t\t}\n\t\tgeneralCase = true;\n\t}\nwhile (endMatch < seq.length){\n\tendMatch = beginMatch + searchMotif.length;\n\tvar currentlyChecked = seq.substring(beginMatch, endMatch);\n\t//check for spaces or new lines within the search portion of the sequence\n\tif(generalCase){\n\t\tvar currCheckedSplit = currentlyChecked.split(\"\");\n\t\t//process out x's\n\t\tfor(var i = 0; i < splitMotif.length; i++){\n\t\t\tif(xs[i] != null){\n\t\t\tcurrCheckedSplit.splice(xs[i],1,\"X\");\n\t\t\t}\n\t\t}\n\t\tcurrentlyChecked = currCheckedSplit.join(\"\");\n\t}\n\tif(currentlyChecked === searchMotif){\n\t\tvar indices = [beginMatch, endMatch];\n\t\tindicesOfMatches.push(indices);\n\t\tbeginMatch = endMatch;\n\t}\n\telse{\n\t\tbeginMatch++;\n\t}\n\tcurrentlyChecked = \"\";\n}\n\tinsertHighlightSpans();\n}","function cdetect(x,y){\n if((x>=arrow_c[0]&&x=arrow_c[1]&&y=arrow_c[0]+40+bgpos[2]&&x=arrow_c[1]&&y=btn_opt,txtpos[0]-32+block_s&&x=txtpos[1]+i*block_s-12&&y= start) {\n\t\t\t\tthis.newArray.push(row[1]);\n\t\t\t\tif (row[2] == 0) { rows.push(JSON.stringify(this.newArray)); \n\t\t\t\t\tthis.count++;\n\t\t\t\t} else {\n\t\t\t\t\tthis.recurse(row[2], row[3]);\n\t\t\t\t}\n\t\t\t\tthis.newArray.pop();\n\t\t\t}\n\t\t}\n\t}\n}","updateState(currentState) {\n // Net state working array\n let newState = [];\n // If the new state is identical to the old state\n let identical = true;\n for (let i = 0; i < this.cols; i++) {\n newState.push([]);\n for (let j = 0; j < this.rows; j++) {\n // Previously alive\n let wasAlive = currentState[i][j];\n // If it will be alive now\n let nowAlive = false;\n // Number of neighboring cells that are alive\n let neighbors = 0;\n // the 'j' coordinate of the cells above\n const up = (j - 1 + this.rows) % this.rows;\n // the 'j' coordinate of the cells below\n const down = (j + 1 + this.rows) % this.rows;\n // the 'i' coordinate of the cells left\n const left = (i - 1 + this.cols) % this.cols;\n // the 'i' coordinate of the cells right\n const right = (i + 1 + this.cols) % this.cols;\n // Count living neighbors\n if (currentState[i][up])\n neighbors++;\n if (currentState[right][up])\n neighbors++;\n if (currentState[right][j])\n neighbors++;\n if (currentState[right][down])\n neighbors++;\n if (currentState[i][down])\n neighbors++;\n if (currentState[left][down])\n neighbors++;\n if (currentState[left][j])\n neighbors++;\n if (currentState[left][up])\n neighbors++;\n // Is it now alive?\n if (wasAlive) {\n if (neighbors < 2 || neighbors > 3) {\n nowAlive = false;\n }\n else {\n nowAlive = true;\n }\n }\n else {\n if (neighbors == 3) {\n nowAlive = true;\n }\n else {\n nowAlive = false;\n }\n }\n // If different than before then arrays aren't identical\n if (nowAlive !== wasAlive) {\n identical = false;\n }\n // Push new sate to working array\n newState[i].push(nowAlive);\n }\n }\n // Set stable to true if the arrays are identical\n if (identical) {\n this.stable = true;\n }\n return newState;\n }","function _vcount(a, s) {\n // a arrays\n var aptr = a._ptr;\n var aindex = a._index;\n var asize = a._size; // rows & columns\n\n var m = asize[0];\n var n = asize[1]; // initialize s arrays\n\n s.pinv = []; // (m + n)\n\n s.leftmost = []; // (m)\n // vars\n\n var parent = s.parent;\n var pinv = s.pinv;\n var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\n\n var w = []; // (m + 3 * n)\n\n var next = 0;\n var head = m;\n var tail = m + n;\n var nque = m + 2 * n; // vars\n\n var i, k, p, p0, p1; // initialize w\n\n for (k = 0; k < n; k++) {\n // queue k is empty\n w[head + k] = -1;\n w[tail + k] = -1;\n w[nque + k] = 0;\n } // initialize row arrays\n\n\n for (i = 0; i < m; i++) {\n leftmost[i] = -1;\n } // loop columns backwards\n\n\n for (k = n - 1; k >= 0; k--) {\n // values & index for column k\n for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n // leftmost[i] = min(find(A(i,:)))\n leftmost[aindex[p]] = k;\n }\n } // scan rows in reverse order\n\n\n for (i = m - 1; i >= 0; i--) {\n // row i is not yet ordered\n pinv[i] = -1;\n k = leftmost[i]; // check row i is empty\n\n if (k === -1) {\n continue;\n } // first row in queue k\n\n\n if (w[nque + k]++ === 0) {\n w[tail + k] = i;\n } // put i at head of queue k\n\n\n w[next + i] = w[head + k];\n w[head + k] = i;\n }\n\n s.lnz = 0;\n s.m2 = m; // find row permutation and nnz(V)\n\n for (k = 0; k < n; k++) {\n // remove row i from queue k\n i = w[head + k]; // count V(k,k) as nonzero\n\n s.lnz++; // add a fictitious row\n\n if (i < 0) {\n i = s.m2++;\n } // associate row i with V(:,k)\n\n\n pinv[i] = k; // skip if V(k+1:m,k) is empty\n\n if (--nque[k] <= 0) {\n continue;\n } // nque[k] is nnz (V(k+1:m,k))\n\n\n s.lnz += w[nque + k]; // move all rows to parent of k\n\n var pa = parent[k];\n\n if (pa !== -1) {\n if (w[nque + pa] === 0) {\n w[tail + pa] = w[tail + k];\n }\n\n w[next + w[tail + k]] = w[head + pa];\n w[head + pa] = w[next + i];\n w[nque + pa] += w[nque + k];\n }\n }\n\n for (i = 0; i < m; i++) {\n if (pinv[i] < 0) {\n pinv[i] = k++;\n }\n }\n\n return true;\n }","function _vcount(a, s) {\n // a arrays\n var aptr = a._ptr;\n var aindex = a._index;\n var asize = a._size; // rows & columns\n\n var m = asize[0];\n var n = asize[1]; // initialize s arrays\n\n s.pinv = []; // (m + n)\n\n s.leftmost = []; // (m)\n // vars\n\n var parent = s.parent;\n var pinv = s.pinv;\n var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\n\n var w = []; // (m + 3 * n)\n\n var next = 0;\n var head = m;\n var tail = m + n;\n var nque = m + 2 * n; // vars\n\n var i, k, p, p0, p1; // initialize w\n\n for (k = 0; k < n; k++) {\n // queue k is empty\n w[head + k] = -1;\n w[tail + k] = -1;\n w[nque + k] = 0;\n } // initialize row arrays\n\n\n for (i = 0; i < m; i++) {\n leftmost[i] = -1;\n } // loop columns backwards\n\n\n for (k = n - 1; k >= 0; k--) {\n // values & index for column k\n for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n // leftmost[i] = min(find(A(i,:)))\n leftmost[aindex[p]] = k;\n }\n } // scan rows in reverse order\n\n\n for (i = m - 1; i >= 0; i--) {\n // row i is not yet ordered\n pinv[i] = -1;\n k = leftmost[i]; // check row i is empty\n\n if (k === -1) {\n continue;\n } // first row in queue k\n\n\n if (w[nque + k]++ === 0) {\n w[tail + k] = i;\n } // put i at head of queue k\n\n\n w[next + i] = w[head + k];\n w[head + k] = i;\n }\n\n s.lnz = 0;\n s.m2 = m; // find row permutation and nnz(V)\n\n for (k = 0; k < n; k++) {\n // remove row i from queue k\n i = w[head + k]; // count V(k,k) as nonzero\n\n s.lnz++; // add a fictitious row\n\n if (i < 0) {\n i = s.m2++;\n } // associate row i with V(:,k)\n\n\n pinv[i] = k; // skip if V(k+1:m,k) is empty\n\n if (--nque[k] <= 0) {\n continue;\n } // nque[k] is nnz (V(k+1:m,k))\n\n\n s.lnz += w[nque + k]; // move all rows to parent of k\n\n var pa = parent[k];\n\n if (pa !== -1) {\n if (w[nque + pa] === 0) {\n w[tail + pa] = w[tail + k];\n }\n\n w[next + w[tail + k]] = w[head + pa];\n w[head + pa] = w[next + i];\n w[nque + pa] += w[nque + k];\n }\n }\n\n for (i = 0; i < m; i++) {\n if (pinv[i] < 0) {\n pinv[i] = k++;\n }\n }\n\n return true;\n }","function checkForHorizontalMatches(grid, height, width){\n xMatchList = [];\n for (var a = 0; a < grid.length; a++){\n for (var b = 0; b < grid[a].length; b++){\n if (grid[a][b-1]){\n if (grid[a][b].stoneColor != grid[a][b-1].stoneColor){\n if (grid[a][b+1]){\n if (grid[a][b].stoneColor == grid[a][b + 1].stoneColor){\n var count = 1;\n var matches = [];\n matches.push(grid[a][b]);\n while (grid[a][b + count] != null && grid[a][b].stoneColor == grid[a][b + count].stoneColor){\n matches.push(grid[a][b + count]);\n count++;\n }\n if (matches.length >= 3){\n xMatchList.push(matches);\n }\n }\n }\n }\n }\n }\n }\n return xMatchList;\n }","function checkrow(rowIndex, state) {\n var countb = 0;\n var countw = 0;\n var tempb = [];\n var tempw = [];\n for (var j = 0; j < 6; j ++) {\n if (state[rowIndex][j] == 'b') {\n countb ++;\n tempw.push(countw);\n countw =0;\n } else if (state[rowIndex][j] == 'w'){\n countw ++;\n tempb.push(countb);\n countb = 0;\n } else {\n tempw.push(countw);\n countw =0;\n tempb.push(countb);\n countb =0;\n }\n }\n tempw.push(countw);\n countw =0;\n tempb.push(countb);\n countb =0;\n tempb.sort(function(a,b) {return b-a});\n tempw.sort(function(a,b) {return b-a});\n resultB[rowIndex] = tempb[0];\n resultW[rowIndex] = tempw[0];\n }"],"string":"[\n \"function handlePossibleCenter(stateCount, i, j, moduleSize) {\\r\\n\\t\\t var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\\r\\n\\t\\t var centerJ = centerFromEnd(stateCount, j);\\r\\n\\t\\t if (centerJ == null) {\\r\\n\\t\\t return null;\\r\\n\\t\\t }\\r\\n\\t\\t var centerI = crossCheckVertical(i, Math.floor(centerJ), 2 * stateCount[1], stateCountTotal, moduleSize, image);\\r\\n\\t\\t if (centerI != null) {\\r\\n\\t\\t var estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3;\\r\\n\\t\\t for (var i2 in possibleCenters) {\\r\\n\\t\\t var center = possibleCenters[i2];\\r\\n\\t\\t // Look for about the same center and module size:\\r\\n\\t\\t if (aboutEquals(center, estimatedModuleSize, centerI, centerJ)) {\\r\\n\\t\\t return combineEstimate(center, centerI, centerJ, estimatedModuleSize);\\r\\n\\t\\t }\\r\\n\\t\\t }\\r\\n\\t\\t // Hadn't found this before; save it\\r\\n\\t\\t var point = { x: centerJ, y: centerI, estimatedModuleSize: estimatedModuleSize };\\r\\n\\t\\t possibleCenters.push(point);\\r\\n\\t\\t }\\r\\n\\t\\t return null;\\r\\n\\t\\t }\",\n \"readCodewords() {\\n let width = this.bitMatrix.getWidth();\\n let height = this.bitMatrix.getHeight();\\n\\n this.erasures = new Array(MAX_CW_CAPACITY);\\n\\n for (let k = 0; k < this.erasures.length; k++) {\\n this.erasures[k] = 0;\\n }\\n\\n // Get the number of pixels in a module across the X dimension\\n //float moduleWidth = bitMatrix.getModuleWidth();\\n let moduleWidth = 1.0; // Image has been sampled and reduced\\n let rowCounters = new Array(width);\\n\\n for (let n = 0; n < rowCounters.length; n++) {\\n rowCounters[n] = 0;\\n }\\n\\n let codewords = new Array(MAX_CW_CAPACITY);\\n\\n for (let m = 0; m < codewords.length; m++) {\\n codewords[m] = 0;\\n }\\n\\n let next = 0;\\n let matchingConsecutiveScans = 0;\\n let rowInProgress = false;\\n let rowNumber = 0;\\n let rowHeight = 0;\\n\\n for (let i = 1; i < height; i++) {\\n if (rowNumber >= MAX_ROWS) {\\n // Something is wrong, since we have exceeded\\n // the maximum rows in the specification.\\n // TODO Maybe return error code\\n return null;\\n }\\n let rowDifference = 0;\\n // Scan a line of modules and check the\\n // difference between this and the previous line\\n for (let j = 0; j < width; j++) {\\n // Accumulate differences between this line and the\\n // previous line.\\n if (this.bitMatrix._get(j, i) != this.bitMatrix._get(j, i - 1)) {\\n rowDifference++;\\n }\\n }\\n\\n if (rowDifference <= moduleWidth * this.MAX_ROW_DIFFERENCE) {\\n for (let j2 = 0; j2 < width; j2++) {\\n // Accumulate the black pixels on this line\\n if (bitMatrix._get(j2, i)) {\\n rowCounters[j2]++;\\n }\\n }\\n // Increment the number of consecutive rows of pixels\\n // that are more or less the same\\n matchingConsecutiveScans++;\\n // Height of a row is a multiple of the module size in pixels\\n // Usually at least 3 times the module size\\n if (matchingConsecutiveScans >= moduleWidth * 2) { // MGMG\\n // We have some previous matches as well as a match here\\n // Set processing a unique row.\\n rowInProgress = true;\\n }\\n } else {\\n if (rowInProgress) {\\n // Process Row\\n next = processRow(rowCounters, rowNumber, rowHeight, codewords, next);\\n if (next == -1) {\\n // Something is wrong, since we have exceeded\\n // the maximum columns in the specification.\\n // TODO Maybe return error code\\n return null;\\n }\\n // Reinitialize the row counters.\\n for (let j3 = 0; j3 < rowCounters.length; j3++) {\\n rowCounters[j3] = 0;\\n }\\n rowNumber++;\\n rowHeight = 0;\\n }\\n matchingConsecutiveScans = 0;\\n rowInProgress = false;\\n }\\n rowHeight++;\\n }\\n // Check for a row that was in progress before we exited above.\\n if (rowInProgress) {\\n // Process Row\\n if (rowNumber >= this.MAX_ROWS) {\\n // Something is wrong, since we have exceeded\\n // the maximum rows in the specification.\\n // TODO Maybe return error code\\n return null;\\n }\\n\\n next = this.processRow(rowCounters, rowNumber, rowHeight, codewords, next);\\n rowNumber++;\\n rows = rowNumber;\\n }\\n erasures = trimArray(erasures, eraseCount);\\n return trimArray(codewords, next);\\n }\",\n \"function AlignmentPatternFinder(image, startX\\n /*int*/\\n , startY\\n /*int*/\\n , width\\n /*int*/\\n , height\\n /*int*/\\n , moduleSize\\n /*float*/\\n , resultPointCallback) {\\n _classCallCheck(this, AlignmentPatternFinder);\\n\\n this.image = image;\\n this.startX = startX;\\n this.startY = startY;\\n this.width = width;\\n this.height = height;\\n this.moduleSize = moduleSize;\\n this.resultPointCallback = resultPointCallback;\\n this.possibleCenters = []; // new Array(5))\\n // TYPESCRIPTPORT: array initialization without size as the length is checked below\\n\\n this.crossCheckStateCount = new Int32Array(3);\\n }\",\n \"calculateAtDesiredPos() {\\n let counter = 0;\\n for (let i = 0; i < this.num_rows; i++) {\\n for (let j = 0; j < this.num_cols; j++) {\\n if (this.isAtDesiredPos([i, j], this.board[i][j])) counter++;\\n }\\n }\\n return counter;\\n }\",\n \"function check_block() {\\n var moved = false;\\n reset_counts();\\n check_counts(\\\"X\\\");\\n\\n if (countdiag1 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 3 + i);\\n }\\n }\\n if (countdiag2 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 2 + 2);\\n }\\n }\\n if (countrow0 == 2) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i);\\n }\\n }\\n if (countrow1 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(3 + i);\\n }\\n }\\n if (countrow2 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(6 + i);\\n }\\n }\\n if (countcol0 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 3);\\n }\\n }\\n if (countcol1 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 3 + 1);\\n }\\n }\\n if (countcol2 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 3 + 2);\\n }\\n }\\n return moved;\\n}\",\n \"drawAlignmentPattern(x, y) {\\n let i;\\n let j;\\n for (i = x - 2, j = y - 2; i < x + 3; i++, j++) {\\n this.mModuleValue[i][y - 2].isBlack = true;\\n this.mModuleValue[i][y - 2].isFilled = true;\\n this.mModuleValue[i][y + 2].isBlack = true;\\n this.mModuleValue[i][y + 2].isFilled = true;\\n this.mModuleValue[x - 2][j].isBlack = true;\\n this.mModuleValue[x - 2][j].isFilled = true;\\n this.mModuleValue[x + 2][j].isBlack = true;\\n this.mModuleValue[x + 2][j].isFilled = true;\\n }\\n for (i = x - 1, j = y - 1; i < x + 2; i++, j++) {\\n this.mModuleValue[i][y - 1].isBlack = false;\\n this.mModuleValue[i][y - 1].isFilled = true;\\n this.mModuleValue[i][y + 1].isBlack = false;\\n this.mModuleValue[i][y + 1].isFilled = true;\\n this.mModuleValue[x - 1][j].isBlack = false;\\n this.mModuleValue[x - 1][j].isFilled = true;\\n this.mModuleValue[x + 1][j].isBlack = false;\\n this.mModuleValue[x + 1][j].isFilled = true;\\n }\\n this.mModuleValue[x][y].isBlack = true;\\n this.mModuleValue[x][y].isFilled = true;\\n }\",\n \"function foundPatternCross(stateCount, moduleSize) {\\r\\n\\t\\t var maxVariance = moduleSize / 2;\\r\\n\\t\\t for (var i = 0; i < 3; i++) {\\r\\n\\t\\t if (Math.abs(moduleSize - stateCount[i]) >= maxVariance) {\\r\\n\\t\\t return false;\\r\\n\\t\\t }\\r\\n\\t\\t }\\r\\n\\t\\t return true;\\r\\n\\t\\t}\",\n \"computeGrids(){\\n // Fill in the first row\\n for (let j = 1; j < this.jMax; j++) {\\n this.grid[0][j] = this.grid[0][j-1] + this.gap_penalty;\\n this.tracebackGrid[0][j] = [false, false, true];\\n }\\n\\n // Fill in the first column\\n for (let i = 1; i < this.iMax; i++) {\\n this.grid[i][0] = this.grid[i-1][0] + this.gap_penalty;\\n this.tracebackGrid[i][0] = [false, true, false];\\n }\\n\\n // Fill the rest of the grid\\n for(let i = 1; i < this.iMax; i++){\\n for(let j = 1; j < this.jMax; j++){\\n // Find the max score(s) among [`Diag`, `Up`, `Left`]\\n let diag;\\n if(this.sequence1[i-1] === this.sequence2[j-1])\\n diag = this.grid[i-1][j-1] + this.match_score;\\n else\\n diag = this.grid[i-1][j-1] + this.mismatch_penalty;\\n\\n let up = this.grid[i-1][j] + this.gap_penalty;\\n let left = this.grid[i][j-1] + this.gap_penalty;\\n\\n // If there exists multiple max values, capture them for multiple paths\\n let maxOf = [diag,up,left];\\n let indices = this.arrayAllMaxIndexes(maxOf);\\n\\n // Update Grids\\n this.grid[i][j] = maxOf[indices[0]];\\n this.tracebackGrid[i][j] = [indices.includes(0), indices.includes(1), indices.includes(2)];\\n }\\n }\\n\\n // Update alignment score\\n this.score = this.grid[this.iMax-1][this.jMax-1];\\n }\",\n \"function AlignmentPattern(posX, posY, estimatedModuleSize)\\r\\n{\\r\\n\\tthis.x=posX;\\r\\n\\tthis.y=posY;\\r\\n\\tthis.count = 1;\\r\\n\\tthis.estimatedModuleSize = estimatedModuleSize;\\r\\n\\t\\r\\n\\tthis.__defineGetter__(\\\"EstimatedModuleSize\\\", function()\\r\\n\\t{\\r\\n\\t\\treturn this.estimatedModuleSize;\\r\\n\\t}); \\r\\n\\tthis.__defineGetter__(\\\"Count\\\", function()\\r\\n\\t{\\r\\n\\t\\treturn this.count;\\r\\n\\t});\\r\\n\\tthis.__defineGetter__(\\\"X\\\", function()\\r\\n\\t{\\r\\n\\t\\treturn Math.floor(this.x);\\r\\n\\t});\\r\\n\\tthis.__defineGetter__(\\\"Y\\\", function()\\r\\n\\t{\\r\\n\\t\\treturn Math.floor(this.y);\\r\\n\\t});\\r\\n\\tthis.incrementCount = function()\\r\\n\\t{\\r\\n\\t\\tthis.count++;\\r\\n\\t}\\r\\n\\tthis.aboutEquals=function( moduleSize, i, j)\\r\\n\\t\\t{\\r\\n\\t\\t\\tif (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tvar moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);\\r\\n\\t\\t\\t\\treturn moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t\\r\\n}\",\n \"getAlignmentPatternCoOrdinates() {\\n let allign = null;\\n switch ((this.mVersion)) {\\n case 2:\\n allign = [6, 18];\\n break;\\n case 3:\\n allign = [6, 22];\\n break;\\n case 4:\\n allign = [6, 26];\\n break;\\n case 5:\\n allign = [6, 30];\\n break;\\n case 6:\\n allign = [6, 34];\\n break;\\n case 7:\\n allign = [6, 22, 38];\\n break;\\n case 8:\\n allign = [6, 24, 42];\\n break;\\n case 9:\\n allign = [6, 26, 46];\\n break;\\n case 10:\\n allign = [6, 28, 50];\\n break;\\n case 11:\\n allign = [6, 30, 54];\\n break;\\n case 12:\\n allign = [6, 32, 58];\\n break;\\n case 13:\\n allign = [6, 34, 62];\\n break;\\n case 14:\\n allign = [6, 26, 46, 66];\\n break;\\n case 15:\\n allign = [6, 26, 48, 70];\\n break;\\n case 16:\\n allign = [6, 26, 50, 74];\\n break;\\n case 17:\\n allign = [6, 30, 54, 78];\\n break;\\n case 18:\\n allign = [6, 30, 56, 82];\\n break;\\n case 19:\\n allign = [6, 30, 58, 86];\\n break;\\n case 20:\\n allign = [6, 34, 62, 90];\\n break;\\n case 21:\\n allign = [6, 28, 50, 72, 94];\\n break;\\n case 22:\\n allign = [6, 26, 50, 74, 98];\\n break;\\n case 23:\\n allign = [6, 30, 54, 78, 102];\\n break;\\n case 24:\\n allign = [6, 28, 54, 80, 106];\\n break;\\n case 25:\\n allign = [6, 32, 58, 84, 110];\\n break;\\n case 26:\\n allign = [6, 30, 58, 86, 114];\\n break;\\n case 27:\\n allign = [6, 34, 62, 90, 118];\\n break;\\n case 28:\\n allign = [6, 26, 50, 74, 98, 122];\\n break;\\n case 29:\\n allign = [6, 30, 54, 78, 102, 126];\\n break;\\n case 30:\\n allign = [6, 26, 52, 78, 104, 130];\\n break;\\n case 31:\\n allign = [6, 30, 56, 82, 108, 134];\\n break;\\n case 32:\\n allign = [6, 34, 60, 86, 112, 138];\\n break;\\n case 33:\\n allign = [6, 30, 58, 86, 114, 142];\\n break;\\n case 34:\\n allign = [6, 34, 62, 90, 118, 146];\\n break;\\n case 35:\\n allign = [6, 30, 54, 78, 102, 126, 150];\\n break;\\n case 36:\\n allign = [6, 24, 50, 76, 102, 128, 154];\\n break;\\n case 37:\\n allign = [6, 28, 54, 80, 106, 132, 158];\\n break;\\n case 38:\\n allign = [6, 32, 58, 84, 110, 136, 162];\\n break;\\n case 39:\\n allign = [6, 26, 54, 82, 110, 138, 166];\\n break;\\n case 40:\\n allign = [6, 30, 58, 86, 114, 142, 170];\\n break;\\n }\\n return allign;\\n }\",\n \"function patternCheckOrientation(pattern, targetCell, qualityGoal, weight, orientation) {\\n var forwardFacingCells = FWD_CELLS[targetCell];\\n var totalDiscrepancies = 0;\\n DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\\\"Enter pCO([\\\" + pattern + \\\"]; \\\" + targetCell + \\\", \\\" + qualityGoal + \\\", \\\" + weight + \\\", \\\" + orientation + \\\"); compass: \\\" + compass);\\n fwdWrong = [];\\n rearWrong = [];\\n if ((Array.isArray(pattern[POS_CENTER]) && !pattern[POS_CENTER][myColor]) ||\\n\\t((pattern[POS_CENTER] > 0) && (myColor != pattern[POS_CENTER]))) {\\n\\tif (forwardFacingCells[POS_CENTER]) { // always true, in fact\\n\\t fwdWrong.push({p:POS_CENTER, v:POS_CENTER});\\n\\t totalDiscrepancies += 1;\\n\\t} else {\\n\\t rearWrong.push({p:POS_CENTER, v:POS_CENTER});\\n\\t totalDiscrepancies += weight;\\n\\t}\\n }\\n if ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\\n\\tDEBUG_PATTERN_CHECK_VERBOSELY && debugme(\\\"--- too bad\\\");\\n\\treturn PAT_NOMATCH;\\n }\\n var jFrom = 0;\\n switch (targetCell) {\\n case AIM_UP:\\n\\tjFrom = 4;\\n\\tbreak;\\n case AIM_LEFT:\\n\\tjFrom = 6;\\n\\tbreak;\\n case AIM_RIGHT:\\n\\tjFrom = 2;\\n\\tbreak;\\n case AIM_DOWN:\\n case POS_CENTER:\\n default:\\n\\tbreak;\\n }\\n for (var j = jFrom; j < TOTAL_NBRS + jFrom; j++) {\\n\\tvar posP = CCW[j];\\n\\tvar posV = CCW[orientation + j];\\n\\tvar c = view[posV].color;\\n\\tif ((Array.isArray(pattern[posP]) && !pattern[posP][c]) ||\\n\\t ((pattern[posP] > 0) && (c != pattern[posP]))) {\\n\\t if (forwardFacingCells[posP]) {\\n\\t\\tfwdWrong.push({p:posP, v:posV});\\n\\t\\t// #future# If it should ever be needed, we could push j as a\\n\\t\\t// third member of these objects (its absence indicating the\\n\\t\\t// center cell).\\n\\t\\ttotalDiscrepancies += 1;\\n\\t } else {\\n\\t\\trearWrong.push({p:posP, v:posV});\\n\\t\\ttotalDiscrepancies += weight;\\n\\t }\\n\\t}\\n\\tif ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\\n\\t DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\\\"--- too bad\\\");\\n\\t return PAT_NOMATCH;\\n\\t}\\n }\\n // Assert: totalDiscrepancies == fwdWrong.length + rearWrong.length;\\n // Assert: If compass < 0, then totalDiscrepancies <= qualityGoal\\n debugme(\\\"-> total \\\" + totalDiscrepancies + \\\" weighted discrepancies found.\\\");\\n if ((compass < 0)\\n\\t// && (totalDiscrepancies <= qualityGoal)\\n ) {\\n\\tcompass = orientation;\\n }\\n if (DEBUGME[myType]) {\\n\\t// Bypass the single-arg debugme() in order to get the objects printed.\\n\\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\\\"forwardD: [\\\", fwdWrong, \\\"]\\\");\\n\\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\\\"rearD: [\\\", rearWrong, \\\"]\\\");\\n }\\n if (fwdWrong.length == 0) {\\n\\treturn (totalDiscrepancies);\\n } else {\\n\\treturn (-totalDiscrepancies);\\n }\\n}\",\n \"step() {\\n // Fill the offscreen buffer with the next cca generation built\\n // from the current buffer.\\n\\n let backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n let currentBuffer = this.buffer[this.currentBufferIndex];\\n let backBuffer = this.buffer[backBufferIndex];\\n\\n // See if we have a neighbor to infect this one\\n function hasInfectiousNeighbor(x, y) {\\n const nextValue = (currentBuffer[y][x] + 1) % MODULO;\\n\\n // Check the west neighbor of cell x, y\\n /*if (x > 0) {\\n if (currentBuffer[y][x - 1] === nextValue) {\\n return true;\\n }\\n }*/\\n\\n // North\\n if (y > 0) {\\n if (currentBuffer[y - 1][x] === nextValue) {\\n return true;\\n }\\n }\\n\\n // East\\n if (x < this.width - 1) {\\n if (currentBuffer[y][x + 1] === nextValue) {\\n return true;\\n }\\n }\\n\\n // South\\n if (y < this.height - 1) {\\n if (currentBuffer[y + 1][x] === nextValue) {\\n return true;\\n }\\n }\\n\\n // If we've made it this far we're not infected!\\n return false;\\n }\\n\\n // Loop through and decide the state of the next generation\\n // for each cell processed.\\n for (let y = 0; y < this.height; y++) {\\n for (let x = 0; x < this.width; x++) {\\n if (hasInfectiousNeighbor.call(this, x, y)) {\\n backBuffer[y][x] = (currentBuffer[y][x] + 1) % MODULO;\\n } else {\\n backBuffer[y][x] = currentBuffer[y][x];\\n }\\n }\\n }\\n\\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n }\",\n \"function lookAheadCount(nfa, testCombineIndex)\\n{ var testString=inputString.value;// var s=inputString.value; \\n var localCombineIndex={\\n localIndex:[],\\n localFinalIndex:[]\\n\\n };\\nlocalCombineIndex.localIndex=testCombineIndex.myIndex;\\n//localCombineIndex.myFinalIndex=testCombineIndex.myFinalIndex;\\n var CurrentActive=[];\\n var NextActive=[];\\n var MatchCount=0;\\n var temp=[];\\n \\n CurrentActive=_.union(CurrentActive, nfa.states);\\n for(var i=0; i= highestRow){\\n\\t\\t\\t\\thighestRow = row;\\n\\t\\t\\t}\\n\\t\\t\\tif(col >= highestCol){\\n\\t\\t\\t\\thighestCol = col;\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\tthis.width = highestCol;\\n\\t\\tthis.height = highestRow;\\n\\t}\",\n \"check(x, y, board = this.map) {\\n let color = board[y][x];\\n if (color === \\\"⚪\\\") return 1;\\n //horizontal\\n if (\\n this.search(x, y, color, 1, 0, 0) +\\n this.search(x, y, color, -1, 0, 0) - 1 >= 4\\n ) {\\n return 2;\\n }\\n //lt-rb diagonal\\n if (\\n this.search(x, y, color, 1, 1, 0) +\\n this.search(x, y, color, -1, -1, 0) - 1 >= 4\\n ) {\\n return 2;\\n }\\n //lt-rb diagonal\\n if (\\n this.search(x, y, color, -1, 1, 0) +\\n this.search(x, y, color, 1, -1, 0) - 1 >= 4\\n ) {\\n return 2;\\n }\\n //vertical\\n if (\\n this.search(x, y, color, 0, 1, 0) +\\n this.search(x, y, color, 0, -1, 0) - 1 >= 4\\n ) {\\n return 2;\\n }\\n\\n // check how many pieces in a column\\n let countstack = 0;\\n for (let i = 0; i < 7; i++) {\\n if (this.stack[i] === -1) {\\n countstack++;\\n }\\n }\\n\\n // a column is full\\n if (countstack === 7) return 3;\\n\\n return 1;\\n }\",\n \"didWin(mark) {\\n\\n // premenne na vypocet znacky\\n var vertical_count = 0,\\n horizontal_count = 0,\\n right_to_left_count = 0,\\n left_to_right_count = 0;\\n\\n // Loop 1\\n for (var i = 0; i < this.state.grid_size; i++) {\\n\\n\\n vertical_count = 0;\\n horizontal_count = 0;\\n\\n // Loop 2\\n for (var j = 0; j < this.state.grid_size; j++) {\\n\\n\\n if (this.state.data[i + '' + j] == mark) {\\n horizontal_count++;\\n }\\n\\n\\n if (this.state.data[j + '' + i] == mark) {\\n vertical_count++;\\n }\\n\\n }\\n\\n\\n if (this.state.data[i + '' + i] == mark) {\\n left_to_right_count++;\\n }\\n\\n\\n if (this.state.data[(this.state.grid_size - 1 - i) + '' + i] == mark) {\\n right_to_left_count++;\\n }\\n\\n // ak suhlasi vyhral\\n if (horizontal_count == this.state.grid_size || vertical_count == this.state.grid_size) {\\n return true;\\n }\\n\\n }\\n\\n // ak suhlasi diagonal vyhral\\n if (left_to_right_count == this.state.grid_size || right_to_left_count == this.state.grid_size) {\\n return true;\\n }\\n\\n // nikto nevyhral\\n return false;\\n }\",\n \"_getPartOfCount() {\\n\\n // 8-neighborhood around\\n const n = [\\n Point.val(this.x - 1, this.y - 1),\\n Point.val(this.x - 1, this.y),\\n Point.val(this.x - 1, this.y + 1),\\n Point.val(this.x, this.y - 1),\\n Point.val(this.x, this.y + 1),\\n Point.val(this.x + 1, this.y - 1),\\n Point.val(this.x + 1, this.y),\\n Point.val(this.x + 1, this.y + 1),\\n ];\\n\\n const edges = n.filter(p => p === '-' || p === '|').length;\\n const ind = [];\\n for (let i = 0; i < 8; i++) {\\n if (n[i] === '-' || n[i] === '|') ind.push(i);\\n }\\n\\n switch (edges) {\\n\\n case 2:\\n switch (ind[0]) {\\n case 1: \\n return ind[1] === 3 ? (n[0] === n[7] ? 2 : 1) : (n[2] === n[5] ? 2 : 1);\\n case 3: \\n return n[2] === n[5] ? 2 : 1;\\n case 4: \\n return n[0] === n[7] ? 2 : 1;\\n }\\n\\n case 3: \\n return n.filter(p => p === ' ').length === 5 ? 3 : 2;\\n\\n case 4:\\n return n.filter(p => p === ' ').length;\\n }\\n }\",\n \"function updateCount( x, y, regions, last_regions) {\\n var occupied = []; \\n for (var r in regions) {\\n \\n // If already in the region, expand the boundaries\\n var adj_lr = [0,0]; \\n var adj_ul = [0,0]; \\n var A = 0.12; // A 12% proportional \\\"expansion\\\" of the border to trigger leaving\\n if (useRegionStickiness && last_regions.indexOf(r) > -1) { \\n adj_lr[0] = A*regions[r].height;\\n adj_lr[1] = A*regions[r].width;\\n adj_ul[0] = -1*A*regions[r].height;\\n adj_ul[1] = -1*A*regions[r].width;\\n } \\n \\n // Now, use the adjusted region boundaries in the test\\n //\\n if (y >= regions[r].ul[0]+adj_ul[0] && y <= regions[r].lr[0]+adj_lr[0] && // These checks are for a graphics coordinate\\n x >= regions[r].ul[1]+adj_ul[1] && x <= regions[r].lr[1]+adj_lr[1] ) { // system with (0,0) in the top left\\n regions[r].count += 1; \\n occupied.push(r); \\n }\\n } \\n return occupied; \\n}\",\n \"function getCount(possibility_matrix, count_arr, len) {\\n let turn_1_index = 0;\\n let turn_1_count = count_arr[0];\\n let turn_2_count = 0;\\n for (let i = 0; i < count_arr.length; i++) {\\n if (count_arr[i] > turn_1_count) {\\n turn_1_count = count_arr[i];\\n turn_1_index = i;\\n }\\n }\\n if (count_arr.length > 1) {\\n let catched_salmon_arr = [];\\n for (let i = 0; i < possibility_matrix[turn_1_index].length; i++) {\\n if (possibility_matrix[turn_1_index][i]) {\\n catched_salmon_arr[i] = true;\\n }\\n }\\n // console.log(catched_salmon_arr, turn_1_index, turn_1_count);\\n let turn_2_index;\\n for (let i = 0; i < catched_salmon_arr.length; i++) {\\n if (catched_salmon_arr[i]) {\\n continue;\\n } else {\\n turn_2_index = i;\\n turn_2_count = count_arr[i];\\n break;\\n }\\n }\\n\\n for (let i = 0; i < count_arr.length; i++) {\\n if (!catched_salmon_arr[i] && count_arr[i] > turn_2_count && (count_arr[i] + turn_1_count) <= len && checkNoneOfCurrentGroupCatched(possibility_matrix[i])) {\\n turn_2_index = i;\\n turn_2_count = count_arr[i];\\n }\\n }\\n // console.log(catched_salmon_arr, turn_2_index, turn_2_count);\\n } else {\\n turn_2_count = 0; // turn 2 not possible\\n }\\n console.log(turn_1_count + turn_2_count);\\n}\",\n \"function checkVictory(cléIndex) {\\n var currentColor = cellProperties[cléIndex].couleur;\\n var currentCol = cellProperties[cléIndex].col;\\n var currentRow = cellProperties[cléIndex].row;\\n var tokenHorizontal = 0;\\n var tokenVertical = 0;\\n var tokenDiagonalPositive = 0;\\n var tokenDiagonalNegative = 0;\\n var emptyCellFound = 0;\\n\\n\\n // horizontal \\n // coté gauche(check les cases à gauche du jeton joué)\\n if (currentCol > 1) {\\n for (i = currentCol; i > 1; i--) {\\n colTest = \\\"col\\\" + (i - 1);\\n if (cellProperties[colTest + 'row' + currentRow].couleur === currentColor) {\\n tokenHorizontal += 1;\\n }\\n if (cellProperties[colTest + 'row' + currentRow].couleur != currentColor) {\\n break;\\n }\\n if (tokenHorizontal >= 3) {\\n victoire = true;\\n console.log(\\\"Victoire Horizontale\\\");\\n break;\\n }\\n }\\n }\\n // coté droit(check les cases à droite du jeton joué)\\n if (currentCol < x && tokenHorizontal < 3 && x - currentCol > (3 - tokenHorizontal)) {\\n for (i = currentCol; i > 0; i++) {\\n colTest = \\\"col\\\" + (i + 1);\\n if (cellProperties[colTest + 'row' + currentRow].couleur === currentColor) {\\n tokenHorizontal += 1;\\n }\\n if (cellProperties[colTest + 'row' + currentRow].couleur != currentColor) {\\n break;\\n }\\n if (tokenHorizontal >= 3) {\\n victoire = true;\\n console.log(\\\"Victoire Horizontale\\\");\\n break;\\n }\\n }\\n }\\n\\n // vertical (check les cases sous le jeton joué)\\n if (currentRow <= (y - 3)) {\\n for (i = currentRow; i < y; i++) {\\n rowTest = \\\"row\\\" + (i + 1);\\n if (cellProperties[\\\"col\\\" + currentCol + rowTest].couleur === currentColor) {\\n tokenVertical += 1;\\n }\\n if (cellProperties[\\\"col\\\" + currentCol + rowTest].couleur != currentColor) {\\n break;\\n }\\n if (tokenVertical >= 3) {\\n victoire = true;\\n console.log(\\\"Victoire Verticale\\\");\\n break;\\n }\\n }\\n }\\n\\n // diagonaux\\n //diagonale positive\\n // bas gauche (check les cases en bas à gauche en diagonale du jeton joué)\\n if (currentRow < y && currentCol > 1) {\\n for (i = currentRow, j = currentCol; i < y && j > 1; i++ , j--) {\\n rowTest = \\\"row\\\" + (i + 1);\\n colTest = \\\"col\\\" + (j - 1)\\n\\n if (cellProperties[colTest + rowTest].couleur === currentColor) {\\n tokenDiagonalPositive += 1;\\n }\\n if (cellProperties[colTest + rowTest].couleur != currentColor) {\\n break;\\n }\\n if (tokenDiagonalPositive >= 3) {\\n victoire = true;\\n console.log(\\\"Victoire Diagonale+\\\");\\n break;\\n }\\n }\\n }\\n //diagonale positive\\n // haut droit (check les cases en haut à droite en diagonale du jeton joué)\\n if (currentRow > 1 && currentCol < x && (x - currentCol) > (3 - tokenDiagonalPositive) && currentRow > (3 - tokenDiagonalPositive)) {\\n for (i = currentRow, j = currentCol; i > 1 && j < x; i-- , j++) {\\n rowTest = \\\"row\\\" + (i - 1);\\n colTest = \\\"col\\\" + (j + 1)\\n\\n if (cellProperties[colTest + rowTest].couleur === currentColor) {\\n tokenDiagonalPositive += 1;\\n }\\n if (cellProperties[colTest + rowTest].couleur != currentColor) {\\n break;\\n }\\n if (tokenDiagonalPositive >= 3) {\\n victoire = true;\\n console.log(\\\"Victoire Diagonale+\\\");\\n break;\\n }\\n }\\n }\\n\\n //diagonale negative\\n // bas droite (check les cases en bas à droite en diagonale du jeton joué)\\n if (currentRow < y && currentCol < x) {\\n for (i = currentRow, j = currentCol; i < y && j < x; i++ , j++) {\\n rowTest = \\\"row\\\" + (i + 1);\\n colTest = \\\"col\\\" + (j + 1)\\n\\n if (cellProperties[colTest + rowTest].couleur === currentColor) {\\n tokenDiagonalNegative += 1;\\n }\\n if (cellProperties[colTest + rowTest].couleur != currentColor) {\\n break;\\n }\\n if (tokenDiagonalNegative >= 3) {\\n victoire = true;\\n console.log(\\\"Victoire Diagonale-\\\");\\n break;\\n }\\n }\\n }\\n\\n // diagonale negative\\n // haut gauche (check les cases en bas à droite en diagonale du jeton joué)\\n if (currentRow > 1 && currentCol > 1 && (currentCol - 1) > (3 - tokenDiagonalNegative) && currentRow > (3 - tokenDiagonalNegative)) {\\n for (i = currentRow, j = currentCol; i > 1 && j > 1; i-- , j--) {\\n rowTest = \\\"row\\\" + (i - 1);\\n colTest = \\\"col\\\" + (j - 1)\\n\\n if (cellProperties[colTest + rowTest].couleur === currentColor) {\\n tokenDiagonalNegative += 1;\\n }\\n if (cellProperties[colTest + rowTest].couleur != currentColor) {\\n break;\\n }\\n if (tokenDiagonalNegative >= 3) {\\n victoire = true;\\n console.log(\\\"Victoire Diagonale-\\\");\\n break;\\n }\\n }\\n }\\n\\n // vérification du match nul en cas de complétion de grille\\n if (currentRow == 1 && !victoire) {\\n for (i = 1; i <= x; i++) {\\n colTest = \\\"col\\\" + (i);\\n if (cellProperties[colTest + 'row1'].couleur == 0) {\\n emptyCellFound += 1;\\n break;\\n }\\n }\\n if (emptyCellFound == 0) {\\n console.log('Match Nul')\\n matchNul = true;\\n }\\n }\\n\\n } // crochet fin de fonction condition de victoire\",\n \"step() {\\n const backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n const currentBuffer = this.buffer[this.currentBufferIndex];\\n const backBuffer = this.buffer[backBufferIndex];\\n\\n const countNeighbors = (x, y, options={border: 'wrap'}) => {\\n let neighborCount = 0;\\n\\n // Actually count living neighbors\\n if (options.border === 'wrap') {\\n let north = y - 1;\\n let south = y + 1;\\n let west = x - 1;\\n let east = x + 1;\\n\\n if (north < 0) north = this.height - 1;\\n\\n if (south > this.height - 1) south = 0;\\n\\n if (west < 0) west = this.width - 1;\\n\\n if (east > this.width - 1) east = 0;\\n\\n neighborCount = \\n currentBuffer[north][west] + \\n currentBuffer[north][x] + \\n currentBuffer[north][east] + \\n currentBuffer[y][west] + \\n currentBuffer[y][east] + \\n currentBuffer[south][x] + \\n currentBuffer[south][east] + \\n currentBuffer[south][west];\\n\\n } else if (options.border === 'nowrap') {\\n // Treat out of bounds as zero\\n for (let yOffset = -1; yOffset <= 1; yOffset++) {\\n let yPos = y + yOffset;\\n if (yPos < 0 || yPos >= this.height) continue; // Out of bounds\\n\\n for (let xOffset = -1; xOffset <= 1; xOffset++) {\\n let xPos = x + xOffset;\\n if (xPos < 0 || xPos >= this.width) continue; // Out of bounds\\n if (yPos === y && xPos === x) continue; // Can't be your own neighbor\\n neighborCount += currentBuffer[yPos][xPos];\\n }\\n }\\n } else {\\n throw new Error('Unknown border option: ' + options.border);\\n }\\n return neighborCount;\\n }\\n\\n // Update backBuffer to have the next time state\\n for(let y = 0; y < this.height; y++) {\\n for (let x = 0; x < this.width; x++) {\\n const neighbors = countNeighbors(x, y);\\n const thisCell = currentBuffer[y][x];\\n\\n // Implement GoL rules\\n if (thisCell) {\\n //Current cell is alive\\n if (neighbors < 2 || neighbors > 3) {\\n // Death\\n backBuffer[y][x] = 0;\\n } else {\\n // Alive\\n backBuffer[y][x] = 1;\\n }\\n } else {\\n // Current cell is dead\\n if (neighbors === 3) {\\n // A cell is born\\n backBuffer[y][x] = 1;\\n } else {\\n // Still dead\\n backBuffer[y][x] = 0;\\n }\\n }\\n }\\n }\\n\\n this.currentBufferIndex = backBufferIndex;\\n }\",\n \"function checkOverlapse(direction) {\\n\\t\\textraTop = newTop;\\n\\t\\textraLeft = newLeft;\\n\\t\\t\\n\\t\\tlet overlapRows = false;\\n\\t\\t let overlapCols = false;\\n\\t\\t\\n\\t\\tif (currTopPx % dimension != 0)\\n\\t\\t\\toverlapRows = true;\\n\\t\\tif (currLeftPx % dimension != 0)\\n\\t\\t\\toverlapCols = true;\\n\\t\\t\\n\\t\\tswitch(direction) {\\n\\t\\t\\tcase leftKey:\\n\\t\\t\\tcase rightKey:\\t \\n\\t\\t\\t\\tif (overlapRows)\\n\\t\\t\\t\\t\\textraTop = newTop + 1;\\n\\t\\t\\t\\tbreak;\\n\\t\\n\\t\\t\\tcase upKey:\\n\\t\\t\\tcase downKey: \\n\\t\\t\\t\\tif (overlapCols)\\n\\t\\t\\t\\t\\textraLeft = newLeft + 1;\\n\\t\\t\\t\\tbreak;\\t\\t\\t\\t\\t\\t\\n\\t\\t}\\n\\t}\",\n \"function comparison(){\\n\\n var a1,a2,a3,a4,b1,b2,b3,b4,hint1,hint2,hint3,hint4;\\n a1 = row[nbrOfRows].h1;\\n a2 = row[nbrOfRows].h2;\\n a3 = row[nbrOfRows].h3;\\n a4 = row[nbrOfRows].h4;\\n b1 = row[0].h1;\\n b2 = row[0].h2;\\n b3 = row[0].h3;\\n b4 = row[0].h4;\\n\\n\\n correctPosition=0; //Nbr of correct colors on correct position\\n if (a1 == b1){correctPosition++;a1=1;b1=0;hint1=1}\\n if (a2 == b2){correctPosition++;a2=1;b2=0;hint2=1}\\n if (a3 == b3){correctPosition++;a3=1;b3=0;hint3=1}\\n if (a4 == b4){correctPosition++;a4=1;b4=0;hint4=1}\\n\\n correctColour=0; //Nbr of correct colors on wrong position\\n if (a1 == b2){correctColour++;a1=1;b2=0}\\n if (a1 == b3){correctColour++;a1=1;b3=0}\\n if (a1 == b4){correctColour++;a1=1;b4=0}\\n\\n if (a2 == b1){correctColour++;a2=1;b1=0}\\n if (a2 == b3){correctColour++;a2=1;b3=0}\\n if (a2 == b4){correctColour++;a2=1;b4=0}\\n\\n if (a3 == b1){correctColour++;a3=1;b1=0}\\n if (a3 == b2){correctColour++;a3=1;b2=0}\\n if (a3 == b4){correctColour++;a3=1;b4=0}\\n\\n if (a4 == b1){correctColour++;a4=1;b1=0}\\n if (a4 == b2){correctColour++;a4=1;b2=0}\\n if (a4 == b3){correctColour++;a4=1;b3=0}\\n\\n //Draw the hints on the side of the board\\n var p = 9*box+4.8;\\n for (i=0;i<4;i++){\\n if (i {\\n let from = transfer.fromStop - minStopPerPattern.get(pattern) + patternVerticalOffsets.get(pattern)\\n let to = transfer.toStop - minStopPerPattern.get(transfer.toPattern) + patternVerticalOffsets.get(transfer.toPattern)\\n\\n // this transfer goes the wrong way\\n if (to <= from) objective += from - to + 1\\n })\\n }\\n\\n return objective\\n }\",\n \"function horizontalline(prevrow) {\\n var currchip = null;\\n var prevchip = 0;\\n var count = 0;\\n\\n for (var col = 0; col < 7; col++) {\\n currchip = board[prevrow][col];\\n if (currchip == prevchip && currchip != 0) {\\n count++;\\n }\\n else {\\n count = 0;\\n }\\n //count == 3 when four chips are in a line\\n if (count == UI.wincondition - 1) {\\n return true;\\n }\\n //set previous chip to current chip for next comparison\\n prevchip = currchip;\\n }\\n\\n //else no horizontal line\\n return false;\\n}\",\n \"isPercolated () {\\n var topPercolateIndex = this.size\\n var bottomPercolateIndex = this.size + 1\\n\\n var topPercolateArranges = this.grid.slice(0, 1)[0]\\n .map((value, x) =>\\n value && [topPercolateIndex, this.width * x]\\n ).filter(v => v)\\n\\n var bottomPercolateArranges = this.grid.slice(-1)[0]\\n .map((value, x) =>\\n value && [bottomPercolateIndex, (this.grid.length-1) * this.width + x]\\n ).filter(v => v)\\n\\n // console.log('topPercolateArranges', topPercolateArranges);\\n // console.log('bottomPercolateArranges', bottomPercolateArranges);\\n\\n // padds arranges like this: double means has arrange (e.g. \\\\\\\\)\\n //\\n // top_percolate (pad)\\n // // | \\\\\\\\\\n // X - X\\n // X X X\\n // - X X\\n // \\\\ || //\\n // bottom_percolate (pad)\\n\\n var paddedArranges = [\\n ...topPercolateArranges,\\n ...this.arranges,\\n ...bottomPercolateArranges,\\n ]\\n\\n // find if topPercolate is connected to bottomPercolate, which are appeneded at the end, hence we pass {n} as `this.size + 2`\\n return (new UnionFind.QuickFind(\\n this.size + 2,\\n paddedArranges\\n )).find(topPercolateIndex, bottomPercolateIndex)\\n }\",\n \"controlHorizontalPosterior(x, ficha, matrizCeldas) {\\r\\n let contador = 0;\\r\\n let y = ficha.columna;\\r\\n while (y < matrizCeldas[y].length && (ficha.getColor() === matrizCeldas[y + 1][x]?.fichaColor)) {\\r\\n contador++;\\r\\n y++;\\r\\n }\\r\\n return contador;\\r\\n }\",\n \"function alignDiscontinuities(lastFrag,details,lastLevel){if(shouldAlignOnDiscontinuities(lastFrag,lastLevel,details)){var referenceFrag=findDiscontinuousReferenceFrag(lastLevel.details,details);if(referenceFrag){logger_1.logger.log('Adjusting PTS using last level due to CC increase within current level');adjustPts(referenceFrag.start,details);}}}\",\n \"function checkLearnedSpiral(arg,extended=0,linear=0) {\\n \\n var ctrls=[]; var s=[]; var mindi=[]; var minInds = [];\\n /*console.log(toKeep);\\n for (var bg=0; bg arg[k]),forControl.map(k => learnedSpirals[bg][0][k]),weightVector));\\n ctrls.push(ctrl);\\n s.push(ctrl);\\n }*/\\n for (var i=0; i0) { minInds.push(drawBackgroundSpiral/0.25); }\\n for (var i=0; i0) { if (ctrls.indexOf(s[i]) != drawBackgroundSpiral/0.25) {\\n minInds.push(ctrls.indexOf(s[i]));\\n }}\\n else { \\n minInds.push(ctrls.indexOf(s[i]));\\n }\\n }\\n //If we're just checking the linear score, use distance from the background spiral of appropriate size as the only number. \\n if (linear == 1 && (drawBackgroundSpiral > 0 || plotType == 1)) {\\n var toKeep = [4,5,10,11,19,20];\\n var weightVector=[1,1,1,1,1,1,1,1];\\n var res = []; \\n //Only use the template size. \\n for (var i=0; i<(drawBackgroundSpiral>0?1:minInds.length); i++) { \\n var p1=((euclidDistWeight(toKeep.map(k => arg[k]),toKeep.map(k => perfSpirals[minInds[i]][k]),weightVector)).toFixed(2));\\n var p2=(euclidDistWeight(toKeep.map(k=> perfSpirals[minInds[i]][k]),toKeep.map(k => learnedSpirals[minInds[i]][0][k]),weightVector)).toFixed(2);\\n var p3=(euclidDistWeight(toKeep.map(k=> arg[k]),toKeep.map(k => learnedSpirals[minInds[i]][0][k]),weightVector)).toFixed(2);\\n res.push((p1/p2).toFixed(2));\\n }\\n return (res);\\n }\\n \\n //Get rid of standard deviations basically. \\n var forControl = [3,5,7,9,11,12,13,14,15,16,17];\\n var toKeep = [3,5,7,9,11,12,13,14,15,16,17];\\n var weightVector = [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1];\\n \\n if (extended==1) { toKeep=toKeep.concat([18,19]);console.log(\\\"extended\\\"); }\\n\\n\\n var check=[]; var minds = []; var ds=[]; \\n for (var bg=0; bg arg[k]),toKeep.map(k => learnedSpirals[minInds[bg]][0][k]),weightVector));\\n var mind=1000000; var d=0; var mi=-1; \\n //Distance to control center. \\n for (var i=1; i arg[k]),toKeep.map(k => learnedSpirals[minInds[bg]][i][k]),weightVector);\\n //Keep the minimum difference between control and noise. \\n ds.push(d);\\n if (d 3) {\\n backBuffer[r][c] = 0;\\n } else {\\n backBuffer[r][c] = 1;\\n }\\n } else {\\n if (neighborCount === 3) {\\n backBuffer[r][c] = 0;\\n } else {\\n backBuffer[r][c] = 1;\\n }\\n }\\n }\\n }\\n\\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n }\",\n \"function updateCount( x, y, regions, last_regions) {\\n var occupied = []; \\n if (typeof last_regions == 'undefined') last_regions = []; // Added this because we have arbitrary track ids, making it hard to guarantee a value here\\n for (var r in regions) {\\n // If already in the region, expand the boundaries\\n var adj_lr = [0,0]; \\n var adj_ul = [0,0]; \\n var A = 0.12; // A 12% proportional \\\"expansion\\\" of the border to trigger leaving\\n if (useRegionStickiness && last_regions.indexOf(r) > -1) { \\n adj_lr[0] = A*regions[r].height;\\n adj_lr[1] = A*regions[r].width;\\n adj_ul[0] = -1*A*regions[r].height;\\n adj_ul[1] = -1*A*regions[r].width;\\n } \\n \\n // Now, use the adjusted region boundaries in the test\\n //\\n if (y >= regions[r].ul[0]+adj_ul[0] && y <= regions[r].lr[0]+adj_lr[0] && // These checks are for a graphics coordinate\\n x >= regions[r].ul[1]+adj_ul[1] && x <= regions[r].lr[1]+adj_lr[1] ) { // system with (0,0) in the top left\\n regions[r].count += 1; \\n occupied.push(r); \\n }\\n } \\n return occupied; \\n}\",\n \"bestPlaceToStart(incomingClues) {\\n\\n // penalize clues that have more zeros\\n function weightedClue(clue) {\\n return clue ? clue : -10;\\n }\\n\\n const sideLength = this.size;\\n const lastCell = this.size * 4 - 1;\\n\\n const sideClues = [\\n {\\n direction: 'top',\\n count:\\n weightedClue(incomingClues[sideLength]) + weightedClue(incomingClues[sideLength + 1]) +\\n weightedClue(incomingClues[lastCell - 1]) + weightedClue(incomingClues[lastCell])\\n },\\n {\\n direction: 'bottom',\\n count:\\n weightedClue(incomingClues[sideLength * 2 - 2]) + weightedClue(incomingClues[sideLength * 2 - 1]) +\\n weightedClue(incomingClues[sideLength * 3]) + weightedClue(incomingClues[sideLength * 3 + 1])\\n },\\n {\\n direction: 'left',\\n count:\\n weightedClue(incomingClues[0]) + weightedClue(incomingClues[1]) +\\n weightedClue(incomingClues[sideLength * 3 - 2]) + weightedClue(incomingClues[sideLength * 3 - 1])\\n },\\n {\\n direction: 'right',\\n count:\\n weightedClue(incomingClues[sideLength - 2]) + weightedClue(incomingClues[sideLength - 1]) +\\n weightedClue(incomingClues[sideLength * 2]) + weightedClue(incomingClues[sideLength * 2 + 1])\\n }\\n ];\\n sideClues.sort((a, b) => b.count - a.count);\\n const bestDirection = sideClues[0].direction;\\n\\n let clues;\\n let c1;\\n let c2;\\n let c3;\\n let c4;\\n switch(bestDirection) {\\n case 'top':\\n clues = incomingClues;\\n break;\\n case 'bottom': // shift bottom to the first row\\n c1 = incomingClues.slice(sideLength * 2, sideLength * 3).reverse();\\n c2 = incomingClues.slice(sideLength, sideLength * 2).reverse();\\n c3 = incomingClues.slice(0, sideLength).reverse();\\n c4 = incomingClues.slice(sideLength * 3, sideLength * 4).reverse();\\n clues = c1.concat(c2).concat(c3).concat(c4);\\n break;\\n case 'left': // shift left side to the first row\\n c1 = incomingClues.slice(sideLength * 3, sideLength * 4);\\n c2 = incomingClues.slice(0, sideLength * 3);\\n clues = c1.concat(c2);\\n break;\\n case 'right': // shift right side to the first row\\n c1 = incomingClues.slice(sideLength, sideLength * 4);\\n c2 = incomingClues.slice(0, sideLength);\\n clues = c1.concat(c2);\\n break;\\n }\\n return { startAt: bestDirection, clues };\\n }\",\n \"function checkRow( g, ri ) {\\n var above_status = aliveAbove( g, ri );\\n var below_status = aliveBelow( g, ri );\\n var curr_status = g[ri]>0;\\n var alives = [];\\n var new_row = 0;\\n // If nothing around it is alive, return 0;\\n if ( above_status > 0 || below_status > 0 || curr_status > 0 ) {\\n // Check the positions\\n for( var i = 1; i < bits; i *= 2 ) {\\n var alive_or_dead = (g[ri]&i)>0;\\n var ac = 0;\\n if ( above_status == true ) {\\n (g[ri-1] & (i/2))>0?ac++:false;\\n (g[ri-1] & (i/1))>0?ac++:false;\\n (g[ri-1] & (i*2))>0?ac++:false;\\n }\\n if ( curr_status == true ) {\\n (g[ri] & (i/2))>0?ac++:false;\\n (g[ri] & (i*2))>0?ac++:false;\\n }\\n if ( below_status == true ) {\\n (g[ri+1] & (i/2))>0?ac++:false;\\n (g[ri+1] & (i/1))>0?ac++:false;\\n (g[ri+1] & (i*2))>0?ac++:false;\\n }\\n if ( alive_or_dead == true && ( ac == 2 || ac == 3 ) ) {\\n new_row += bits & i;\\n }\\n else if ( alive_or_dead == false && ac == 3 ) {\\n new_row += bits & i;\\n }\\n }\\n return new_row;\\n }\\n else {\\n return 0;\\n }\\n}\",\n \"screenAlignmentPattern() {\\n // prepare cell data\\n const cell = new CellData();\\n cell.content = 1 << 22 /* WIDTH_SHIFT */ | 'E'.charCodeAt(0);\\n cell.fg = this._curAttrData.fg;\\n cell.bg = this._curAttrData.bg;\\n const buffer = this._bufferService.buffer;\\n this._setCursor(0, 0);\\n for (let yOffset = 0; yOffset < this._bufferService.rows; ++yOffset) {\\n const row = buffer.ybase + buffer.y + yOffset;\\n const line = buffer.lines.get(row);\\n if (line) {\\n line.fill(cell);\\n line.isWrapped = false;\\n }\\n }\\n this._dirtyRowService.markAllDirty();\\n this._setCursor(0, 0);\\n return true;\\n }\",\n \"function arrayMarkCount(iRows, iCols, iStartRow, iStartCol) {\\n var i;\\n var j;\\n\\n iMarkCount = 0;\\n\\n for (i = iStartRow; i < iStartRow + iRows; i++) {\\n for (j = iStartCol; j < iStartCol + iCols; j++) {\\n if (iMarkedCells[i % iMapRows][j % iMapCols] == 1) {\\n iMarkCount++;\\n } \\n }\\n } \\n\\n return iMarkCount;\\n}\",\n \"function AlignmentPattern(posX, posY, estimatedModuleSize) {\\n this.x = posX;\\n this.y = posY;\\n this.count = 1;\\n this.estimatedModuleSize = estimatedModuleSize;\\n }\",\n \"_updateGeneration () {\\n let shouldUpdateGenerationCounter = false\\n\\n for (let x = 0; x < this.sizeX; x++) {\\n for (let y = 0; y < this.sizeY; y++) {\\n let neighbours = this._countNeighbours(x, y)\\n if (this.matrix[x][y] === 1 && (neighbours > 3 || neighbours < 2)) {\\n this.nextMatrix[x][y] = -1\\n } else if (this.matrix[x][y] !== 1 && neighbours === 3) {\\n shouldUpdateGenerationCounter = true\\n this.nextMatrix[x][y] = 1\\n } else {\\n this.nextMatrix[x][y] = this.matrix[x][y]\\n }\\n }\\n }\\n\\n if (shouldUpdateGenerationCounter) {\\n this.generationNumber++\\n }\\n }\",\n \"function count_islands(emap) {\\n \\n const len = array_length(emap);\\n const height = array_length(emap[0]);\\n \\n let visited = [];\\n\\n // Generate the visited 2D array -> This is to check whether the cell \\n // has already been checked\\n for (let i = 0; i < len; i = i + 1) {\\n visited[i] = [];\\n for (let j = 0; j < height; j = j + 1) {\\n visited[i][j] = false;\\n }\\n }\\n \\n // Check whether the neighboring cells are valid \\n function isSafe(emap, row, col, visited) {\\n // Check there is no negative / overflow index\\n return row >= 0 && row < len && col >= 0 && col < height \\n && emap[row][col] > 0 && !visited[row][col];\\n }\\n \\n\\n // Apply Depth-First search and treat the 2D array as a graph\\n function dfs(emap, row, col, visited) {\\n // Mark this cell as visited\\n visited[row][col] = true;\\n for (let i = -1; i <= 1; i = i + 1) {\\n for (let j = -1; j <= 1; j = j + 1) {\\n if ((i === -1 && j === 0) ||\\n (i === 0 && j === -1) ||\\n (i === 0 && j === 1) ||\\n (i === 1 && j === 0)) {\\n if(isSafe(emap, row + i, col + j, visited)) {\\n dfs(emap, row + i, col + j, visited);\\n } else {\\n \\n }\\n } else {\\n \\n }\\n }\\n }\\n \\n }\\n\\n \\n let counter = 0;\\n \\n // Trying to check the number of connected graphs\\n for (let i = 0; i < len; i = i + 1) {\\n for (let j = 0; j < len; j = j + 1) {\\n if (emap[i][j] > 0 && !visited[i][j]) {\\n // Check\\n dfs(emap, i, j, visited);\\n counter = counter + 1;\\n } else {\\n \\n }\\n }\\n }\\n\\n return counter;\\n}\",\n \"getPositionCorrection(counter) {\\r\\n let correction = 0;\\r\\n let isLastSlide = this.isLastSlide(counter);\\r\\n if (this.carouselProperties.loop || this.direction === \\\"right\\\") {\\r\\n return 0;\\r\\n }\\r\\n if (this.isSlideLengthLimited || isLastSlide) {\\r\\n let cellsWidth = this.cells.cellLengthInLightDOMMode * this.fullCellWidth;\\r\\n if (this.visibleWidth < cellsWidth) {\\r\\n correction = -(this.visibleCellsCount * this.fullCellWidth - this.visibleWidth - this.margin);\\r\\n }\\r\\n if (correction >= -this.margin) {\\r\\n correction = 0;\\r\\n }\\r\\n }\\r\\n return correction;\\r\\n }\",\n \"function calcSegmentIntersectionStripeCount_old(arcs) {\\n var yrange = arcs.getBounds().height(),\\n segLen = getAvgSegment2(arcs)[1], // slow\\n count = 1;\\n if (segLen > 0 && yrange > 0) {\\n count = Math.ceil(yrange / segLen / 20);\\n }\\n return count || 1;\\n }\",\n \"function little_check(count,count2){\\n\\t\\t\\t\\n\\t\\t\\t//console.log(\\\"count \\\"+ count+\\\"count2 \\\"+count2);\\t\\t\\t\\n \\t \\t\\tfor ( var x=count; x <= (count+2); x++) { // cycle the matrix rows...\\n \\t \\t\\t\\tfor (var y=count2; y <= (count2+2); y++) { // ...and cycle the matrix cells\\n\\t\\t\\t\\t\\t//var BR=1;\\n\\n\\t\\t\\t\\t\\t//console.log(\\\"matrx[x] \\\"+ x+\\\"martix[y] \\\"+y);\\n\\t\\t\\t\\t\\tif ((matrix[x][(count2+0)]) === \\\"p1\\\" && (matrix[x][(count2+1)]) === \\\"p1\\\" && (matrix[x][(count2+2)]) === \\\"p1\\\") { // If our cell has been 'tagged' p1 given x is (e.g 0) then: x0y0, x0y1, x0y2 would mean player one has 3 horizontal cells in a line = victory!\\n\\t\\t\\t\\t\\t\\tif (player1 === true){\\n\\t\\t\\t\\t\\t\\t//console.log(\\\"horizontal victory\\\")\\n\\t\\t\\t\\t\\t\\t//console.log(\\\"player1 wins square row \\\"+BR+ \\\"column \\\"+BC )\\n\\t\\t\\t\\t\\t\\twinner_show(BR,BC)\\n\\t\\t\\t\\t\\t\\tlittlematrix[(BR-1)][(BC-1)]=\\\"p1\\\";\\n\\t\\t\\t\\t\\t\\treturn;\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t} \\n\\t\\t\\t\\t\\telse if\\t( (matrix[(count+0)][y]) === \\\"p1\\\" && (matrix[(count+1)][y]) === \\\"p1\\\" && (matrix[(count+2)][y]) === \\\"p1\\\") { // Repeated for other conditions\\n\\t\\t\\t\\t\\t\\tif (player1 === true){\\n\\t\\t\\t\\t\\t\\t//console.log(\\\"vertical victory\\\")\\n\\t\\t\\t\\t\\t\\t//console.log(\\\"player1 wins\\\")\\n\\t\\t\\t\\t\\t\\twinner_show(BR,BC)\\n\\t\\t\\t\\t\\t\\tlittlematrix[(BR-1)][(BC-1)]=\\\"p1\\\";\\n\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if ((matrix[(count+0)][(count2+0)]) === \\\"p1\\\" && (matrix[(count+1)][(count2+1)]) === \\\"p1\\\" && (matrix[(count+2)][(count2+2)]) === \\\"p1\\\") {\\n\\t\\t\\t\\t\\t\\tif (player1 === true){\\n\\t\\t\\t\\t\\t\\tconsole.log(\\\"LtopRdown diagonal\\\")\\n\\t\\t\\t\\t\\t\\tconsole.log(\\\"player1 wins\\\")\\n\\t\\t\\t\\t\\t\\twinner_show(BR,BC)\\n\\t\\t\\t\\t\\t\\tlittlematrix[(BR-1)][(BC-1)]=\\\"p1\\\";\\n\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t} \\n\\t\\t\\t\\t\\telse if\\t( (matrix[(count+0)][(count2+2)]) === \\\"p1\\\" && (matrix[(count+1)][(count2+1)]) === \\\"p1\\\" && (matrix[(count+2)][(count2+0)]) === \\\"p1\\\") {\\t\\n\\t\\t\\t\\t\\t\\tif (player1 === true){\\n\\t\\t\\t\\t\\t\\tconsole.log(\\\"Rtop Ldown diagonal\\\")\\n\\t\\t\\t\\t\\t\\tconsole.log(\\\"player1 wins\\\")\\n\\t\\t\\t\\t\\t\\twinner_show(BR,BC)\\n\\t\\t\\t\\t\\t\\tlittlematrix[(BR-1)][(BC-1)]=\\\"p1\\\";\\n\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\n\\t \\t}\",\n \"findNext() {\\n // look left, right, up, down\\n let leftLoc = {x: this.center.x - 1, y: this.center.y};\\n let rightLoc = {x: this.center.x, y: this.center.y};\\n let upLoc = {x: this.center.x, y: this.center.y - 1};\\n let downLoc = {x: this.center.x, y: this.center.y + 1};\\n\\n let carArray = [this.layout[leftLoc.y][leftLoc.x] || 0, this.layout[rightLoc.y][rightLoc.x] || 0,\\n this.layout[upLoc.y][upLoc.x] || 0, this.layout[downLoc.y][downLoc.x] || 0];\\n if(Math.max(...carArray) === 0) {\\n console.log(\\\"bunny sleep\\\")\\n return\\n }\\n let nextLoc = carArray.indexOf(Math.max(...carArray));\\n\\n switch(nextLoc) {\\n case 0: \\n return leftLoc;\\n \\n case 1: \\n return rightLoc;\\n\\n case 2: \\n return upLoc;\\n \\n case 3: \\n return downLoc;\\n default: \\n return null;\\n }\\n }\",\n \"step() {\\n /* If you put logic from CCA here it works as should */\\n\\n /* In the Game of Life, these rules examine each cell of the grid. \\n For each cell, it counts that cell's eight neighbors\\n (up, down, left, right, and diagonals), and then act on that result.\\n\\n If the cell is alive and has 2 or 3 neighbors, then it remains alive. Else it dies.\\n If the cell is dead and has exactly 3 neighbors, then it comes to life. Else if remains dead. */\\n\\n let currentBuffer = this.cells[this.currentBufferIndex];\\n let backBuffer = this.cells[this.currentBufferIndex === 0 ? 1 : 0];\\n \\n // see if we have a neighbor that can infect this cell and change its color\\n function checkNeighbors(w, h) {\\n let neighbors = 0;\\n\\n // Check West\\n if (w) {\\n if (currentBuffer[h][w - 1]) {\\n neighbors++;\\n }\\n }\\n // Check NW\\n if (h && w) {\\n if (currentBuffer[h - 1][w - 1])\\n neighbors++;\\n }\\n // Check North\\n if (h) {\\n if (currentBuffer[h - 1][w]) {\\n neighbors++;\\n }\\n }\\n // Check NE\\n if ((w < this.width - 1) && h) {\\n if (currentBuffer[h - 1][w + 1]) {\\n neighbors++;\\n }\\n }\\n // Check East\\n if (w < this.width - 1) {\\n if (currentBuffer[h][w + 1]) {\\n neighbors++;\\n }\\n }\\n // Check SE\\n if ((h < this.height - 1) && (w < this.width - 1)) {\\n if (currentBuffer[h + 1][w + 1]) {\\n neighbors++;\\n }\\n }\\n // Check South\\n if (h < this.height - 1) {\\n if (currentBuffer[h + 1][w]) {\\n neighbors++;\\n }\\n }\\n // Check SW\\n if ((h < this.height - 1) && w) {\\n if (currentBuffer[h + 1][w - 1]) {\\n neighbors++;\\n }\\n }\\n\\n return neighbors;\\n } // end: checkNeightbors()\\n\\n for (let h = 0; h < this.height; h++) {\\n for (let w = 0; w < this.width; w++) {\\n let neighborCount = checkNeighbors.call(this, w, h);\\n\\n // is current cell alive?\\n if (currentBuffer[h][w]) {\\n if (neighborCount === 2 || neighborCount === 3) {\\n backBuffer[h][w] = currentBuffer[h][w]; // cell stay alives\\n }\\n else { // else it dies\\n backBuffer[h][w] = (currentBuffer[h][w] + 1) % MODULO;\\n }\\n }\\n else { // current cell is dead\\n if (neighborCount === 3) {\\n backBuffer[h][w] = (currentBuffer[h][w] + 1) % MODULO; // bring cell to life\\n }\\n else { // else cell remains dead\\n backBuffer[h][w] = currentBuffer[h][w];\\n }\\n }\\n }\\n }\\n\\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n }\",\n \"function count_color(current_coordinate, desired_color, desired_direction, current_count) {\\n\\t\\t\\t\\tlet next_coordinate = [current_coordinate[0] + desired_direction[0],\\n\\t\\t\\t\\tcurrent_coordinate[1] + desired_direction[1]];\\n\\t\\t\\t\\tconsole.log(next_coordinate);\\n\\t\\t\\t\\tif (piece_position[next_coordinate[0]] && piece_position[next_coordinate[0]][next_coordinate[1]]) {\\n\\t\\t\\t\\t\\tif (piece_position[next_coordinate[0]][next_coordinate[1]].color != desired_color)\\n\\t\\t\\t\\t\\t\\treturn current_count;\\n\\t\\t\\t\\t\\tcurrent_count += 1;\\n\\t\\t\\t\\t\\tif (current_count == 3)\\n\\t\\t\\t\\t\\t\\treturn current_count;\\n\\t\\t\\t\\t\\treturn count_color(next_coordinate, desired_color, desired_direction, current_count);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn current_count;\\n\\t\\t\\t}\",\n \"calculateCOOCM(sourceMatrix, size) {\\n\\t\\tvar nextValue = 0,\\n\\t\\t\\tpreviousValue = 0,\\n\\t\\t\\tsum = 0,\\n\\t\\t\\tlength,\\n\\t\\t\\tindex = 0;\\n\\n\\t\\tlength = sourceMatrix.length;\\n\\t\\tfor (index = 0; index < length; index++) {\\n\\t\\t\\tswitch (this.orientation) {\\n\\t\\t\\t\\tcase 'horizontally':\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (index % size + this.distance <= size - 1) {\\n\\t\\t\\t\\t\\t\\tnextValue = sourceMatrix[index + this.distance];\\n\\t\\t\\t\\t\\t\\tthis.incrementCOOCMMatrix(sourceMatrix[index] - 1, nextValue - 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (index % size - this.distance >= 0) {\\n\\t\\t\\t\\t\\t\\tpreviousValue = sourceMatrix[index - this.distance];\\n\\t\\t\\t\\t\\t\\tthis.incrementCOOCMMatrix(sourceMatrix[index] - 1, previousValue - 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcase 'vertically':\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//TODO TEST\\n\\t\\t\\t\\t\\t//vertically\\n\\t\\t\\t\\t\\tif (index > this.distance * size - 1) {\\n\\t\\t\\t\\t\\t\\tpreviousValue = sourceMatrix[index - this.distance * size];\\n\\t\\t\\t\\t\\t\\tthis.incrementCOOCMMatrix(previousValue - 1, sourceMatrix[index] - 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (index < length - this.distance * size) {\\n\\t\\t\\t\\t\\t\\tnextValue = sourceMatrix[index + this.distance * size];\\n\\t\\t\\t\\t\\t\\tthis.incrementCOOCMMatrix(previousValue - 1, sourceMatrix[index] - 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcase '45st':\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (index % size > this.distance - 1 && index < length - this.distance * size) {\\n\\t\\t\\t\\t\\t\\tpreviousValue = sourceMatrix[index + size * this.distance - this.distance];\\n\\t\\t\\t\\t\\t\\tthis.incrementCOOCMMatrix(sourceMatrix[index] - 1, previousValue - 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (index % size < size - this.distance && index > this.distance * size - 1) {\\n\\t\\t\\t\\t\\t\\tnextValue = sourceMatrix[index - size * this.distance + this.distance];\\n\\t\\t\\t\\t\\t\\tthis.incrementCOOCMMatrix(sourceMatrix[index] - 1, previousValue - 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcase '135st':\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (index % size > this.distance - 1 && index > this.distance * size - 1) {\\n\\t\\t\\t\\t\\t\\tpreviousValue = sourceMatrix[index - size * this.distance - this.distance];\\n\\t\\t\\t\\t\\t\\tthis.incrementCOOCMMatrix(previousValue - 1, sourceMatrix[index] - 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (index % size < size - this.distance && index < length - this.distance * size) {\\n\\t\\t\\t\\t\\t\\tnextValue = sourceMatrix[index + size * this.distance + this.distance];\\n\\t\\t\\t\\t\\t\\tthis.incrementCOOCMMatrix(previousValue - 1, sourceMatrix[index] - 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tlength = this.coocmMatrix2.length;\\n\\t\\t//ready for new approach\\n\\t\\t//1600ms better\\n\\t\\tfor (index = 0; index < length; index++) {\\n\\t\\t\\tsum = sum + this.coocmMatrix2[index];\\n\\t\\t}\\n\\n//1500ms better\\n\\t\\tif (sum) {\\n\\t\\t\\tfor (index = 0; index < length; index++) {\\n\\t\\t\\t\\tthis.coocmMatrix2[index] = this.coocmMatrix2[index] / sum;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t/*this.coocmMatrix2.forEach(function (value, index) {\\n\\t\\t //self.coocmMatrix.subset(math.index(index[0], index % size), value / sum);\\n\\t\\t self.coocmMatrix2[index] = value / sum;\\n\\t\\t });*/\\n\\n//show matrix in the console\\n//console.log(this.coocmMatrix2);\\n\\t\\treturn this.coocmMatrix2;\\n\\t}\",\n \"step() {\\n const backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n const cB = this.buffer[this.currentBufferIndex]; // currentBuffer\\n const bB = this.buffer[backBufferIndex]; // backBuffer\\n const w = this.width, h = this.height;\\n\\n const countNeighbors = (x, y) => {\\n let c = 0; // counter\\n if (x > 0 && cB[y][x - 1]) c++;\\n if (x < w - 1 && cB[y][x + 1]) c++;\\n if (y > 0 && cB[y - 1][x]) c++;\\n if (y < h - 1 && cB[y + 1][x]) c++;\\n if (x > 0 && y < h - 1 && cB[y + 1][x - 1]) c++;\\n if (y > 0 && x < w - 1 && cB[y - 1][x + 1]) c++;\\n if (x > 0 && y > 0 && cB[y - 1][x - 1]) c++;\\n if (x < w - 1 && y < h - 1 && cB[y + 1][x + 1]) c++;\\n return c;\\n }\\n\\n for (let y = 0; y < this.height; y++) {\\n for (let x = 0; x < this.width; x++) {\\n const counter = countNeighbors(x, y);\\n const cell = cB[y][x];\\n if (cell && counter === 2) bB[y][x] = 1;\\n else if (cell && counter === 3) bB[y][x] = 1;\\n else if (!cell && counter === 3) bB[y][x] = 1;\\n else bB[y][x] = 0;\\n }\\n }\\n\\n this.currentBufferIndex = backBufferIndex;\\n }\",\n \"controlHorizontalAnterior(x, ficha, matrizCeldas) {\\r\\n let contador = 0;\\r\\n let y = ficha.columna;\\r\\n\\r\\n while (y - 1 >= 0 && (ficha.getColor() === matrizCeldas[y - 1][x]?.fichaColor)) {\\r\\n contador++;\\r\\n y--;\\r\\n }\\r\\n return contador;\\r\\n }\",\n \"function countSameColorIcons(startIcon, moveX, moveY) {\\n\\n var curX = startIcon.posX + moveX;\\n var curY = startIcon.posY + moveY;\\n var count = 0;\\n\\n while (curX >= 0 && curY >= 0 && curX < BOARD_COLS && curY < BOARD_ROWS && getIconColor(getIcon(curX, curY)) === getIconColor(startIcon))\\n {\\n count++;\\n curX += moveX;\\n curY += moveY;\\n }\\n\\n return count;\\n\\n}\",\n \"function countTexts(frameY) {\\r totalCAP++;\\r panelCAP++;\\r\\r if(frameY < 3000) {\\r topRowCAP++;\\r }\\r}\",\n \"function findNewState(){\\n\\n let newState = new Array();\\n let prev;\\n let anc;\\n let next;\\n\\n for(i = 0; i < cols; i++) {\\n\\n anc = state[i];\\n\\n if(i == 0){\\n prev = state[state.length-1];\\n next = state[i+1];\\n }\\n else if( i == state.length - 1) {\\n prev = state[i-1];\\n next = state[0];\\n }\\n else{\\n prev = state[i-1];\\n next = state[i+1];\\n }\\n\\n if(prev == 1 && anc == 1 && next == 1) {\\n newState[i] = 0;\\n }\\n else if (prev == 1 && anc == 1 && next == 0) {\\n newState[i] = 0;\\n }\\n else if (prev == 1 && anc == 0 && next == 1) {\\n newState[i] = 1;\\n }\\n else if (prev == 1 && anc == 0 && next == 0) {\\n newState[i] = 1;\\n }\\n else if (prev == 0 && anc == 1 && next == 1) {\\n newState[i] = 1;\\n }\\n else if (prev == 0 && anc == 1 && next == 0) {\\n newState[i] = 1;\\n }\\n else if (prev == 0 && anc == 0 && next == 1) {\\n newState[i] = 0;\\n }\\n else if (prev == 0 && anc == 0 && next == 0) {\\n newState[i] = 0;\\n }\\n }\\n state = newState.slice();\\n}\",\n \"function findMaxMatch3() {\\r\\n\\r\\n // Initialise empty matching (reset flags)\\r\\n for (var i = 0; i < nodes.length; i++)\\r\\n match[i] = false;\\r\\n\\r\\n // Create frame and push to frames array (for animation)\\r\\n longTrace.push(\\\"
Algorithm started
\\\");\\r\\n shortTrace.push(\\\"
Algorithm started
\\\");\\r\\n frame = new Frame2(1, 1, longTraceNum++, shortTraceNum, graph.map(g => ([ ...g ])), [], [...blossom]);\\r\\n frames.push(frame);\\r\\n\\r\\n // Find augmenting path and augment matching along path until maximum matching is found\\r\\n while (findAugmentingPath());\\r\\n\\r\\n // Create frame and push to frames array (for animation)\\r\\n longTrace.push(\\\"
Maximum matching found
\\\");\\r\\n shortTrace.push(\\\"
Maximum matching found
\\\");\\r\\n frame = new Frame2(9, 5, longTraceNum++, ++shortTraceNum, graph.map(g => ([ ...g ])), [], []);\\r\\n frames.push(frame);\\r\\n\\r\\n}\",\n \"getNumActiveDiagnosed() { return this.E1[1] + this.I0[1] + this.I1[1] + this.I2[1] + this.I3[1]; }\",\n \"function charCountCompabilityCheck(seqs) {\\n\\tvar positionArray = new Array(seqs[0].length);\\n\\t// Create a base counter for each position:\\n\\tfor(var i = 0, n = seqs[0].length; i < n; i++) {\\n\\t\\tpositionArray[i] = {A:0, T:0, G:0, C:0};\\n\\t}\\n\\t// Iterate over all sequences:\\n\\tvar seq;\\n\\tfor(var i = 0, n = seqs.length; i < n ; i++) {\\n\\t\\tseq = seqs[i];\\n\\t\\t// Iterate over all positions in current sequence:\\n\\t\\tfor(var j = 0, m = seq.length; j < m; j++) {\\n\\t\\t\\t// Add one to the count for the base in this position:\\n\\t\\t\\tpositionArray[j][seq[j]] += 1;\\n\\t\\t}\\n\\t}\\n\\t// Sum channel distribution:\\n\\tvar green;\\n\\tvar red;\\n\\tfor(var i = 0, n = seqs[0].length; i < n ; i++) {\\n\\t\\tgreen = positionArray[i].T + positionArray[i].G;\\n\\t\\tred = positionArray[i].A + positionArray[i].C;\\n\\t}\\n\\treturn (green > 0 && red > 0);\\n}\",\n \"constructor(pattern_num, x = 0, y = 0, secondary = false) {\\n this.pattern_num = pattern_num;\\n this.blocks = [];\\n this.pattern = shapes[pattern_num];\\n this.color = colors[shape_color[pattern_num]];\\n this.start_x = x;\\n this.start_y = y;\\n\\n this.initialize_pattern = function () {\\n if (this.blocks.length != 0) {\\n let least_x = Infinity;\\n let least_y = Infinity;\\n this.blocks.forEach(block => {\\n if (block.left < least_x) {\\n least_x = block.left;\\n }\\n if (block.top < least_y) {\\n least_y = block.top;\\n }\\n });\\n while (least_x + this.pattern[0].length * field.block_width > canvas.width) {\\n least_x -= field.block_width;\\n }\\n while (least_y + this.pattern.length * field.block_height > canvas.height) {\\n least_y -= field.block_height;\\n }\\n\\n\\n this.start_x = least_x;\\n this.start_y = least_y;\\n }\\n this.blocks = [];\\n let start_x = this.start_x;\\n let start_y = this.start_y;\\n for (let i = 0; i < this.pattern.length; i += 1) {\\n\\n let row = this.pattern[i];\\n for (let j = 0; j < row.length; j += 1) {\\n let data = row[j];\\n if (data != 1) {\\n\\n start_x += field.block_width;\\n } else {\\n let block = new game_block(this.color, start_x, start_y, secondary);\\n this.blocks.push(block);\\n start_x += field.block_width;\\n }\\n\\n }\\n start_x = this.start_x;\\n start_y += field.block_height;\\n }\\n //this.start_y = start_y;\\n }\\n this.initialize_pattern_test = function (pattern) {\\n let imaginary_blocks = [];\\n let start_x;\\n let start_y;\\n if (this.blocks.length != 0) {\\n let least_x = Infinity;\\n let least_y = Infinity;\\n this.blocks.forEach(block => {\\n if (block.left < least_x) {\\n least_x = block.left;\\n }\\n if (block.top < least_y) {\\n least_y = block.top;\\n }\\n });\\n while (least_x + pattern[0].length * field.block_width > canvas.width) {\\n least_x -= field.block_width;\\n }\\n while (least_y + pattern.length * field.block_height > canvas.height) {\\n least_y -= field.block_height;\\n }\\n\\n\\n start_x = least_x;\\n start_y = least_y;\\n }\\n\\n let st_x = start_x;\\n for (let i = 0; i < pattern.length; i += 1) {\\n\\n let row = pattern[i];\\n for (let j = 0; j < row.length; j += 1) {\\n let data = row[j];\\n if (data != 1) {\\n\\n start_x += field.block_width;\\n } else {\\n let block = new game_block(this.color, start_x, start_y);\\n imaginary_blocks.push(block);\\n start_x += field.block_width;\\n }\\n\\n }\\n start_x = st_x;\\n start_y += field.block_height;\\n }\\n return imaginary_blocks;\\n\\n }\\n this.get_vertical_height = function(){\\n let smallest_top = Infinity;\\n let biggest_bottom = -Infinity;\\n this.blocks.forEach(block => {\\n if(block.top < smallest_top){\\n smallest_top = block.top;\\n\\n }\\n if(block.bottom > biggest_bottom){\\n biggest_bottom = block.bottom;\\n }\\n })\\n return biggest_bottom - smallest_top;\\n }\\n this.delete_block = function (index) {\\n this.blocks.splice(index, 1);\\n }\\n this.rotate_clockwise = function () {\\n let new_pattern = rotate_array_clockwise(this.pattern);\\n\\n let imaginary_blocks = this.initialize_pattern_test(new_pattern);\\n console.log(this.blocks, imaginary_blocks);\\n let other_pieces = field.pieces;\\n let inside_of_another = false;\\n for (let i = 0; i < other_pieces.length; i += 1) {\\n let other_piece = other_pieces[i];\\n for (let j = 0; j < imaginary_blocks.length; j += 1) {\\n let cur_block = imaginary_blocks[j];\\n \\n if (cur_block.inside_of_another_piece(other_piece) === true) {\\n \\n inside_of_another = true;\\n break;\\n }\\n }\\n if (inside_of_another === true) {\\n break;\\n }\\n }\\n if (inside_of_another === false) {\\n this.pattern = new_pattern;\\n\\n this.initialize_pattern();\\n }\\n\\n\\n }\\n this.initialize_pattern();\\n this.draw = function () {\\n this.blocks.forEach(function (block) {\\n block.draw();\\n })\\n };\\n this.touches_other_piece_bottom = function (pieces, excluded = -1) {\\n for (let i = 0; i < pieces.length; i += 1) {\\n if(excluded === i){\\n continue;\\n }\\n let other_piece = pieces[i];\\n for (let j = 0; j < this.blocks.length; j += 1) {\\n if (this.blocks[j].touches_other_piece_bottom(other_piece) === true) {\\n \\n return true;\\n }\\n }\\n\\n }\\n return false;\\n }\\n this.touches_other_piece_right = function () {\\n for (let i = 0; i < field.pieces.length; i += 1) {\\n let other_piece = field.pieces[i];\\n for (let j = 0; j < this.blocks.length; j += 1) {\\n if (this.blocks[j].touches_other_piece_right(other_piece) === true) {\\n return true;\\n }\\n }\\n\\n }\\n return false;\\n }\\n this.touches_other_piece_left = function () {\\n for (let i = 0; i < field.pieces.length; i += 1) {\\n let other_piece = field.pieces[i];\\n for (let j = 0; j < this.blocks.length; j += 1) {\\n if (this.blocks[j].touches_other_piece_left(other_piece) === true) {\\n return true;\\n }\\n }\\n\\n }\\n return false;\\n }\\n\\n this.touches_bottom = function () {\\n let touches_bottom = false;\\n for (let i = 0; i < this.blocks.length; i += 1) {\\n let item = this.blocks[i];\\n let temp = item.touches_bottom();\\n if (temp === true) {\\n touches_bottom = true;\\n break;\\n }\\n }\\n return touches_bottom;\\n }\\n this.move_down = function () {\\n let touches_bottom = this.touches_bottom();\\n let touches_other_piece_bottom = this.touches_other_piece_bottom(field.pieces);\\n if (touches_bottom === false && touches_other_piece_bottom === false) {\\n this.blocks.forEach(block => {\\n block.move_down();\\n });\\n touches_bottom = this.touches_bottom();\\n touches_other_piece_bottom = this.touches_other_piece_bottom(field.pieces);\\n if (touches_bottom === true || touches_other_piece_bottom === true) {\\n field.deactivate_piece();\\n }\\n } else if (touches_bottom === false || touches_other_piece_bottom === false) {\\n field.deactivate_piece();\\n }\\n\\n }\\n this.move_right = function () {\\n let touches_right = false;\\n let touches_other_piece_right = this.touches_other_piece_right();\\n for (let i = 0; i < this.blocks.length; i += 1) {\\n let item = this.blocks[i];\\n let temp = item.touches_right();\\n if (temp === true) {\\n touches_right = true;\\n break;\\n }\\n }\\n if (touches_right === false && touches_other_piece_right === false) {\\n\\n this.blocks.forEach(block => {\\n block.move_right();\\n })\\n }\\n }\\n this.move_left = function () {\\n let touches_left = false;\\n let touches_other_piece_left = this.touches_other_piece_left();\\n for (let i = 0; i < this.blocks.length; i += 1) {\\n let item = this.blocks[i];\\n let temp = item.touches_left();\\n if (temp === true) {\\n touches_left = true;\\n break;\\n }\\n }\\n if (touches_left === false && touches_other_piece_left === false) {\\n this.blocks.forEach(block => {\\n block.move_left();\\n })\\n }\\n }\\n\\n\\n }\",\n \"function fineClassification(inputPattern, inputCandidates) {\\n\\t var inputLength = inputPattern.length;\\n\\t var candidates = [];\\n\\t for(var i=0;i iLength-3) {\\n\\n\\t\\t var iMap = getMap(iPattern, inputPattern, initialDistance);\\n\\n\\t\\t iMap = completeMap(iPattern, inputPattern, wholeWholeDistance, iMap);\\n\\t\\t if(refPatterns[j][0] == \\\"委\\\") {\\n\\t\\t console.log(\\\"finished imap, fine:\\\");\\n\\t\\t console.log(iMap);\\n\\t\\t\\t console.log(\\\"weight:\\\")\\n\\t\\t\\t console.log(computeDistance(iPattern, inputPattern, wholeWholeDistance, iMap));\\n\\t\\t\\t console.log(\\\"weight intended:\\\")\\n\\t\\t\\t console.log(computeDistance(iPattern, inputPattern, wholeWholeDistance, [0,1,2,3,4,7,5,6]));\\n\\t\\t\\t }\\n\\t\\t var dist = computeWholeDistanceWeighted(iPattern, inputPattern, iMap);\\n\\t\\t var n = inputLength;\\n\\t\\t var m = iPattern.length;\\n\\t\\t if(m > n) {\\n\\t\\t m = n;\\n\\t\\t }\\n\\t\\t dist = dist / m;\\n\\t\\t candidates.push([j, dist]);\\n\\t }\\n\\t }\\n\\t candidates.sort(function(a, b){return a[1]-b[1]});\\n\\t var outStr = \\\"\\\";\\n\\t for(var i=0;i 0) {\\n let $left_cell = get_cell(row, --col)\\n console.log(col, color, 'left count')\\n console.log($left_cell)\\n if ($left_cell.css('backgroundColor') == color) {\\n count += 1\\n console.log('count +++ left')\\n }\\n else {\\n break\\n }\\n }\\n col = temp\\n while (col < that.col) {\\n let $right_cell = get_cell(row, ++col)\\n console.log(col, color, 'right count')\\n console.log($right_cell)\\n if ($right_cell.css('backgroundColor') == color) {\\n count += 1\\n console.log('count +++ right')\\n }\\n else {\\n break\\n }\\n }\\n if (count >= 4) {\\n return true\\n }\\n return false\\n }\",\n \"checkCollide(trials) {\\n \\n \\n let infosRow = {rowUp: {row:1, top:0}, rowDown:{row:2, top:125}};\\n let arrayRow = [];\\n let iteration = 1;\\n\\n let isCollide = this.doCheckCollide(trials, infosRow); \\n\\n // There is collide so need to prevent all overlap\\n while(isCollide) {\\n\\n let newtrialsCopy = [...trials.filter(trial => trial.row == iteration)];\\n infosRow = {rowUp: {row:iteration+1, top:125}, rowDown:{row:iteration+2, top:(125/2) +125}};\\n this.doCheckCollide(newtrialsCopy, infosRow); \\n if(iteration >= trials.length) {\\n break;\\n }\\n iteration ++;\\n }\\n this.setState({ trials: trials });\\n return trials;\\n }\",\n \"changeState(leftBoarderDistance, downDistance, board, bS, next) {\\n let distanceB = Math.round(downDistance / blockSize); // Distance in blocks to bottom border\\n let distance = (Math.round(leftBoarderDistance / blockSize)); // Distance in blocks to left border\\n if (this.calc == false) {\\n if (this.check(leftBoarderDistance, downDistance, board, bS, next) == false) {\\n return;\\n }\\n }\\n switch (this.blockNumber) { // Switch depending on block\\n case 1: {\\n switch (this.state) { //Check state\\n case 1: {\\n if (distance < 5) {\\n for (let i = 0; i < this.res.children.length; i++) {\\n this.res.children[i].y = 3 * blockSize;\\n this.res.children[i].x = (i) * blockSize;\\n }\\n }\\n else {\\n for (let i = 0; i < this.res.children.length; i++) {\\n this.res.children[i].y = 3 * blockSize;\\n this.res.children[i].x = (i - 3) * blockSize;\\n }\\n }\\n this.state = 2;\\n break;\\n }\\n case 2: {\\n if (distance < 5) {\\n for (let i = 0; i < this.res.children.length; i++) {\\n this.res.children[i].x = 0;\\n this.res.children[i].y = blockSize * i;\\n }\\n }\\n else {\\n for (let i = 0; i < this.res.children.length; i++) {\\n this.res.children[i].x = 0;\\n this.res.children[i].y = blockSize * i;\\n }\\n }\\n this.state = 1;\\n break;\\n }\\n }\\n }\\n case 2: {\\n break;\\n }\\n case 3: {\\n // Variable holding next/previous state, we don't want to change main variable until we change the state\\n let state = this.stateChanger(next);\\n switch (state) {\\n case 1: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize * i;\\n this.res.children[i].x = 0;\\n }\\n else {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = blockSize * (i - 1);\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 2: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = 0;\\n this.res.children[i].x = blockSize * (i + 1);\\n }\\n else {\\n this.res.children[i].y = blockSize * (i - 1);\\n this.res.children[i].x = blockSize;\\n }\\n }\\n if (next) {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 3: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = blockSize * i;\\n }\\n else {\\n this.res.children[i].y = blockSize * (i - 1);\\n this.res.children[i].x = blockSize * 2;\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 4: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize * 2;\\n this.res.children[i].x = blockSize * i;\\n }\\n else {\\n this.res.children[i].y = blockSize * (i - 2);\\n this.res.children[i].x = blockSize;\\n }\\n }\\n if (!next) {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n }\\n break;\\n }\\n case 4: {\\n // Variable holding next/previous state, we don't want to change main variable until we change the state\\n let state = this.stateChanger(next);\\n switch (state) {\\n case 1: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i == 0) {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = 0;\\n }\\n else {\\n this.res.children[i].y = (i - 1) * blockSize;\\n this.res.children[i].x = blockSize;\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n else {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 2: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i == 0) {\\n this.res.children[i].y = 0;\\n this.res.children[i].x = blockSize;\\n }\\n else {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = (i - 1) * blockSize;\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 3: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i == 0) {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = 2 * blockSize;\\n }\\n else {\\n this.res.children[i].y = (i - 1) * blockSize;\\n this.res.children[i].x = blockSize;\\n }\\n }\\n if (next) {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 4: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 3) {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = i * blockSize;\\n }\\n else {\\n this.res.children[i].y = 2 * blockSize;\\n this.res.children[i].x = blockSize;\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n }\\n break;\\n }\\n case 5: {\\n // Variable holding next/previous state, we don't want to change main variable until we change the state\\n let state = this.stateChanger(next);\\n switch (state) {\\n case 1: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = blockSize * i;\\n }\\n else {\\n this.res.children[i].y = 0;\\n this.res.children[i].x = blockSize * (i - 1);\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 2: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize * i;\\n this.res.children[i].x = blockSize;\\n }\\n else {\\n this.res.children[i].y = blockSize * (i - 1);\\n this.res.children[i].x = blockSize * 2;\\n }\\n }\\n if (next) {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 3: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize * 2;\\n this.res.children[i].x = blockSize * i;\\n }\\n else {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = blockSize * (i - 1);\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 4: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize * i;\\n this.res.children[i].x = 0;\\n }\\n else {\\n this.res.children[i].y = blockSize * (i - 1);\\n this.res.children[i].x = blockSize;\\n }\\n }\\n if (!next) {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n }\\n break;\\n }\\n case 6: {\\n // Variable holding next/previous state, we don't want to change main variable until we change the state\\n let state = this.stateChanger(next);\\n switch (state) {\\n case 1: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 3) {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = blockSize * i;\\n }\\n else {\\n this.res.children[i].y = 0;\\n this.res.children[i].x = blockSize * (i - 1);\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 2: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 3) {\\n this.res.children[i].y = blockSize * i;\\n this.res.children[i].x = blockSize;\\n }\\n else {\\n this.res.children[i].y = blockSize * 2;\\n this.res.children[i].x = blockSize * 2;\\n }\\n }\\n if (next) {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 3: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 3) {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = blockSize * i;\\n }\\n else {\\n this.res.children[i].y = blockSize * 2;\\n this.res.children[i].x = 0;\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 4: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 3) {\\n this.res.children[i].y = blockSize * i;\\n this.res.children[i].x = blockSize;\\n }\\n else {\\n this.res.children[i].y = 0;\\n this.res.children[i].x = 0;\\n }\\n }\\n if (!next) {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n }\\n break;\\n }\\n case 7: {\\n let state = this.stateChanger(next);\\n switch (state) {\\n case 1: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = 0;\\n this.res.children[i].x = blockSize * i;\\n }\\n else {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = blockSize * (i - 1);\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 2: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize * (i + 1);\\n this.res.children[i].x = blockSize;\\n }\\n else {\\n this.res.children[i].y = blockSize * (i - 2);\\n this.res.children[i].x = blockSize * 2;\\n }\\n }\\n if (next) {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 3: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize;\\n this.res.children[i].x = blockSize * i;\\n }\\n else {\\n this.res.children[i].y = blockSize * 2;\\n this.res.children[i].x = blockSize * (i - 1);\\n }\\n }\\n if (next) {\\n this.res.x += blockSize * (distance == 0 ? 1 : 0);\\n }\\n else {\\n this.res.x += blockSize * (distance == 8 ? -1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n case 4: {\\n for (let i = 0; i < this.res.children.length; i++) {\\n if (i < 2) {\\n this.res.children[i].y = blockSize * (i + 1);\\n this.res.children[i].x = 0;\\n }\\n else {\\n this.res.children[i].y = blockSize * (i - 2);\\n this.res.children[i].x = blockSize;\\n }\\n }\\n if (!next) {\\n this.res.y -= blockSize * (distanceB == 0 ? 1 : 0);\\n }\\n this.state = state;\\n break;\\n }\\n }\\n break;\\n }\\n }\\n }\",\n \"goToNextStep() {\\n let diffCount = 0;\\n this._cells = this._cells.map((cell, index) => {\\n let neighbours = this._layout.getNeighbours(index);\\n\\n let aliveNeighbours = neighbours.filter(listIndex => this._cells[listIndex]);\\n\\n if (cell) {\\n // RULE NO. 1 AND NO. 3\\n if (aliveNeighbours.length < 2 || aliveNeighbours.length > 3) {\\n diffCount++;\\n return false;\\n }\\n } else {\\n // RULE NO. 4\\n if (aliveNeighbours.length === 3) {\\n diffCount++;\\n return true;\\n }\\n }\\n\\n // REST GOES TO RULE NO. 2\\n return cell;\\n });\\n\\n if (diffCount > 0) {\\n this._gameState = GameState.PROGRESS;\\n } else {\\n this._gameState = GameState.DONE;\\n }\\n }\",\n \"function newGrid() {\\n // Checks how many living neighboring cells each cell has\\n // Iterate the grid\\n for (let i = 0; i < dimension; i++) {\\n for (let j = 0; j < dimension; j++) {\\n // Count surrounding living cells\\n let cellsCount = 0;\\n // Check the three cells above the current one\\n if (i !== 0) { // continue only if this is not the first/zero row\\n if (j !== 0) // continue only if this is not the first/zero column\\n cellsCount += grid[i - 1][j - 1];\\n cellsCount += grid[i - 1][j];\\n if (j !== (dimension - 1)) // continue only if this is not the last column\\n cellsCount += grid[i - 1][j + 1];\\n }\\n // Check the cell on the left\\n if (j !== 0) // continue only if this is not the first/zero column\\n cellsCount += grid[i][j - 1];\\n // Check the cell on the right \\n if (j !== (dimension - 1)) // continue only if this is not the last column\\n cellsCount += grid[i][j + 1];\\n // Check the three cells below the current one\\n if (i !== (dimension - 1)) {\\n if (j !== 0) // continue only if this is not the first/zero column\\n cellsCount += grid[i + 1][j - 1];\\n cellsCount += grid[i + 1][j];\\n if (j !== (dimension - 1)) // continue only if this is not the last column\\n cellsCount += grid[i + 1][j + 1];\\n }\\n\\n // Check if the currnet cell is dead\\n if (grid[i][j] === 0) {\\n // Become alive if three surrounding cells are alive, else die\\n if (cellsCount === 3) {\\n copiedGrid[i][j] = 1;\\n } else {\\n copiedGrid[i][j] = 0;\\n }\\n } \\n // Current cell is alive\\n else if (grid[i][j] === 1) {\\n // stay alive with 2 or 3 living neighbours, else die\\n if (cellsCount === 2 || cellsCount === 3) {\\n copiedGrid[i][j] = 1;\\n } else {\\n copiedGrid[i][j] = 0;\\n }\\n }\\n }\\n }\\n\\n // Copy the temporary grid in real one\\n for (let j = 0; j < dimension; j++) {\\n for (let k = 0; k < dimension; k++) {\\n grid[j][k] = copiedGrid[j][k];\\n }\\n }\\n\\n drawGrid();\\n}\",\n \"Board_Evaluation(board, color) {\\n let result = { two: 0, three: 0, four: 0 };\\n\\n for (var i = 0; i < 6; i++) {\\n for (var j = 0; j < 7; j++) {\\n if (board[i][j] === color) {\\n let x = j;\\n let y = i;\\n let arr = [\\n this.search2(x, y, color, 1, 0, 0, board),\\n this.search2(x, y, color, -1, 0, 0, board),\\n this.search2(x, y, color, 1, 1, 0, board),\\n this.search2(x, y, color, -1, -1, 0, board),\\n this.search2(x, y, color, -1, 1, 0, board),\\n this.search2(x, y, color, 1, -1, 0, board),\\n this.search2(x, y, color, 0, 1, 0, board),\\n this.search2(x, y, color, 0, -1, 0, board),\\n ];\\n\\n for (var q = 0; q < 4; q++) {\\n switch (arr[2 * q].count + arr[2 * q + 1].count - 1) {\\n case 2:\\n if (arr[2 * q].live) result.two++;\\n break;\\n\\n case 3:\\n if (arr[2 * q].live + arr[2 * q + 1].live > 0) {\\n result.three++;\\n } else if (\\n arr[2 * q].live + arr[2 * q + 1].live ===\\n 2\\n ) {\\n console.log(1);\\n result.four++;\\n }\\n break;\\n\\n case 4:\\n result.four++;\\n break;\\n }\\n }\\n }\\n }\\n }\\n return result;\\n }\",\n \"checkForMatch() {\\n\\n // Matching horizontal lines\\n if(this._topLeft.textContent === 'X' || this._topLeft.textContent === '0') {\\n \\n if(this._topLeft.textContent === this._topMiddle.textContent && this._topMiddle.textContent === this._topRight.textContent) {\\n this._topLeft.style.backgroundColor = 'green'\\n this._topMiddle.style.backgroundColor = 'green'\\n this._topRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n if(this._middleLeft.textContent === 'X' || this._middleLeft.textContent === '0') {\\n \\n if(this._middleLeft.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._middleRight.textContent) {\\n this._middleLeft.style.backgroundColor = 'green'\\n this._middleMiddle.style.backgroundColor = 'green'\\n this._middleRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n if(this._bottomLeft.textContent === 'X' || this._bottomLeft.textContent === '0') {\\n \\n if(this._bottomLeft.textContent === this._bottomMiddle.textContent && this._bottomMiddle.textContent === this._bottomRight.textContent) {\\n this._bottomLeft.style.backgroundColor = 'green'\\n this._bottomMiddle.style.backgroundColor = 'green'\\n this._bottomRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n // Matching vertical lines\\n if(this._topLeft.textContent === 'X' || this._topLeft.textContent === '0') {\\n \\n if(this._topLeft.textContent === this._middleLeft.textContent && this._middleLeft.textContent == this._bottomLeft.textContent) {\\n this._topLeft.style.backgroundColor = 'green'\\n this._middleLeft.style.backgroundColor = 'green'\\n this._bottomLeft.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n if(this._topMiddle.textContent === 'X' || this._topMiddle.textContent === '0') {\\n \\n if(this._topMiddle.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent == this._bottomMiddle.textContent) {\\n this._topMiddle.style.backgroundColor = 'green'\\n this._middleMiddle.style.backgroundColor = 'green'\\n this._bottomMiddle.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n if(this._topRight.textContent === 'X' || this._topRight.textContent === '0') {\\n \\n if(this._topRight.textContent === this._middleRight.textContent && this._middleRight.textContent == this._bottomRight.textContent) {\\n this._topRight.style.backgroundColor = 'green'\\n this._middleRight.style.backgroundColor = 'green'\\n this._bottomRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n \\n // Matching diagonal lines\\n if(this._middleMiddle.textContent === 'X' || this._middleMiddle.textContent === '0') {\\n \\n if(this._topLeft.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._bottomRight.textContent) {\\n this._topLeft.style.backgroundColor = 'green'\\n this._middleMiddle.style.backgroundColor = 'green'\\n this._bottomRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n\\n if(this._topRight.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._bottomLeft.textContent) {\\n this._topRight.style.backgroundColor = 'green'\\n this._middleMiddle.style.backgroundColor = 'green'\\n this._bottomLeft.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n }\",\n \"apply(mutableBoardData, cloneSquare){\\n //5..2...4....6.3....3...9..7..3..7.....7..8...6......2..8......3...4..6.....1..5..\\n let mutations = 0;\\n this.cellIndexes.forEach( (cellIdx, index, array) => {\\n let immutableSquare = mutableBoardData[cellIdx];\\n let replacementCandidates = [...immutableSquare.candidates];\\n \\n \\n // unlike cage, littleKiller can have repeats in other boxes.\\n\\n \\n let otherCellIndexes = this.cellIndexes.filter( i=> i!== cellIdx);\\n replacementCandidates.forEach( (candidate, cIndex, cArray) => {\\n if( candidate > 0 ){\\n if( ! this.cageValidates(mutableBoardData, this.value-candidate, otherCellIndexes)){\\n replacementCandidates[cIndex] = 0;\\n mutations = mutations+1;\\n }\\n \\n\\n }\\n });\\n \\n\\n \\n \\n \\n\\n // if the region has a candidate that exists in the intersection of two regions, \\n // and the candidate only exists in that intersection on the Other rule, \\n //then this candidate must also exist within said intersection on this rule!\\n\\n\\n if( mutations>0 ){\\n let newSquareData = cloneSquare(immutableSquare);\\n console.log(\\\"Removing value from square\\\");\\n newSquareData.candidates = replacementCandidates;\\n \\n mutableBoardData[cellIdx]=newSquareData;\\n }\\n\\n \\n \\n\\n });\\n return mutations;\\n \\n }\",\n \"function getChainLength(x:int, y: int, xIncrement: int, yIncrement: int){\\n\\tvar countUp = 0;\\n\\tvar countDown = 0;\\n\\twhile (cells[x + countUp * xIncrement, y + countUp * yIncrement].cellStatus == cells[x,y].cellStatus){\\n\\t\\tcountUp ++;\\n\\t\\tif (Mathf.Max(x + countUp * xIncrement, y + countUp * yIncrement) > xSize - 1 || Mathf.Min(x + countUp * xIncrement, y + countUp * yIncrement) < 0){\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\twhile (cells[x - countDown * xIncrement, y - countDown * yIncrement].cellStatus == cells[x,y].cellStatus){\\n\\t\\tcountDown ++;\\n\\t\\tif (Mathf.Max(x - countDown * xIncrement, y - countDown * yIncrement) > xSize - 1 || Mathf.Min(x - countDown * xIncrement, y - countDown * yIncrement) < 0){\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\treturn countUp + countDown - 1;\\n}\",\n \"function decide() {\\n\\t\\t\\t\\tvar recognise = false;\\n\\t\\t\\t\\tif(fromAbove && fromBelow) {\\n\\t\\t\\t\\t\\tif(fromAbove == fromBelow) {\\n\\t\\t\\t\\t\\t\\talert(\\\"Pattern recognized\\\");\\n\\t\\t\\t\\t\\t\\t// window['Cortex'].grid[self.childAddress[i].x][self.childAddress[i].y][self.childAddress[i].z](fromBelow);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\talert(\\\"Pattern not recognized\\\");\\n\\t\\t\\t\\t\\t\\t// window['Cortex'].grid[self.parentAddress.x][self.parentAddress.y][self.parentAddress.z](fromBelow);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"countBlockTurns(move) {\\n let layerCount = move.getLayerCount();\\n let layerMask = move.getLayerMask();\\n let turns = Math.abs(move.getAngle()) % 4;\\n if (turns == 0) {\\n return 0;\\n } else {\\n let previousTurnedLayer = 0;\\n let countTurned = 0;\\n let previousImmobileLayer = 1;\\n let countImmobile = 0;\\n for (let i = 0; i < layerCount; i++) {\\n let currentLayer = (layerMask >>> i) & 1;\\n if (currentLayer == 1 && currentLayer != previousTurnedLayer) {\\n countTurned++;\\n }\\n if (currentLayer == 0 && currentLayer != previousImmobileLayer) {\\n countImmobile++;\\n }\\n previousTurnedLayer = previousImmobileLayer = currentLayer;\\n }\\n return Math.min(countTurned, countImmobile);\\n }\\n }\",\n \"set _physicalStart(val){val=val%this._physicalCount;if(0>val){val=this._physicalCount+val}if(this.grid){val=val-val%this._itemsPerRow}this._physicalStartVal=val}\",\n \"calcMaxLength () {\\n let maxima = [0.0, 0.0, 0.0]\\n let minima = [0.0, 0.0, 0.0]\\n let spans = [0.0, 0.0, 0.0]\\n\\n function comp (v, i) {\\n if (i === 0) return v.x\\n if (i === 1) return v.y\\n if (i === 2) return v.z\\n }\\n\\n let atom = this.getAtomProxy()\\n for (let iDim = 0; iDim < 3; iDim++) {\\n for (let iAtom = 0; iAtom < this.getAtomCount(); iAtom += 1) {\\n let pos = atom.load(iAtom).pos\\n if (minima[iDim] > comp(pos, iDim)) {\\n minima[iDim] = comp(pos, iDim)\\n }\\n if (maxima[iDim] < comp(pos, iDim)) {\\n maxima[iDim] = comp(pos, iDim)\\n }\\n }\\n spans[iDim] = maxima[iDim] - minima[iDim]\\n }\\n this.maxLength = Math.max(spans[0], spans[1], spans[2])\\n }\",\n \"step() {\\n let backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0 \\n let currentBuffer = this.bufferr[this.currentBufferIndex];\\n let backBuffer = this.buffer[this.backBufferIndex];\\n \\n\\n // helper function to see if cell has infectious neighbor\\n const hasInfectiousNeighbour = (x, y) => {\\n const nextValue = (currentBuffer[y][x] + 1) % MODULO;\\n\\n // check west neighbour to see if it has nextValue\\n if (x > 0) { // if it isn't it has no west neighbour it's a col 0\\n if(currentBuffer[y][x-1] === nextValue) {\\n return true; \\n }\\n } \\n\\n // check North, note x,y 00 is top left not bottom left of graph\\n if (y > 0) { // if it isn't it has no north neighbour\\n if(currentBuffer[y - 1][x] === nextValue) {\\n return true; \\n }\\n } \\n\\n // check south\\n if (y < this.height - 1) { // if it isn't it has no north neighbour\\n if(currentBuffer[y + 1][x] === nextValue) {\\n return true; \\n }\\n }\\n\\n // check east\\n if (x < this.width - 1) { // if it isn't it has no north neighbour\\n if(currentBuffer[y][x + 1] === nextValue) {\\n return true; \\n }\\n }\\n\\n // default case, none of the neighbours have the value or infection\\n return false; \\n\\n }\\n\\n // loop through the current buffer and populate backbuffer based on currenbufer \\n // infected neighbour value\\n for (let y = 0; y < this.height; y++) {\\n for (let x = 0; x < this.lenght; x++) {\\n if (hasInfectiousNeighbour(x,y)) { // backbuffer value is next val\\n backBuffer[x][y] = (currentBuffer[y][x] + 1) % MODULO; \\n } else { // backBuffer same as current buffer\\n backBuffer[y][x] = currentBuffer[y][x];\\n }\\n\\n }\\n }\\n this.currentBufferIndex = backBufferIndex;\\n }\",\n \"_calculateBlockIndex() {\\n var curX = this.startX;\\n var maxH = 0;\\n let superXAlign = 0;\\n let superXWidth = 0;\\n let prevBlock = null;\\n let i = 0;\\n this.textFont.setFontSize(this.fontSize);\\n this.blocks.forEach((block) => {\\n // super/subscript\\n const sp = this.isSuperscript(block);\\n const sub = this.isSubcript(block);\\n\\n block.width = 0;\\n block.height = 0;\\n\\n // coeff for sub/super script\\n const subAdj = (sp || sub) ? VF.ChordSymbol.superSubRatio : 1.0;\\n // offset for super/sub\\n let subOffset = 0;\\n if (sp) {\\n subOffset = SuiInlineText.superscriptOffset * this.pointsToPixels;\\n } else if (sub) {\\n subOffset = SuiInlineText.subscriptOffset * this.pointsToPixels;\\n } else {\\n subOffset = 0;\\n }\\n block.x = curX;\\n if (block.symbolType === SuiInlineText.symbolTypes.TEXT) {\\n for (i = 0; i < block.text.length; ++i) {\\n const ch = block.text[i];\\n\\n const glyph = this.textFont.getMetricForCharacter(ch);\\n block.width += ((glyph.advanceWidth) / this.textFont.resolution) * this.pointsToPixels * block.scale * subAdj;\\n const blockHeight = (glyph.ha / this.textFont.resolution) * this.pointsToPixels * block.scale;\\n block.height = block.height < blockHeight ? blockHeight : block.height;\\n block.y = this.startY + (subOffset * block.scale);\\n }\\n } else if (block.symbolType === SuiInlineText.symbolTypes.GLYPH) {\\n block.width = (block.metrics.advanceWidth / VF.ChordSymbol.engravingFontResolution) * this.pointsToPixels * block.scale;\\n block.height = (block.glyph.metrics.ha / VF.ChordSymbol.engravingFontResolution) * this.pointsToPixels * block.scale;\\n block.x += block.metrics.leftSideBearing / VF.ChordSymbol.engravingFontResolution * this.pointsToPixels * block.scale;\\n block.y = this.startY + this._glyphOffset(block) + subOffset;\\n }\\n // Line subscript up with super if the follow each other\\n if (sp) {\\n if (superXAlign === 0) {\\n superXAlign = block.x;\\n }\\n } else if (sub) {\\n if (superXAlign > 0) {\\n block.x = superXAlign;\\n superXWidth = prevBlock.x + prevBlock.width;\\n curX = superXAlign;\\n superXAlign = 0;\\n } else {\\n if (superXWidth > 0 && superXWidth < block.width + block.x) {\\n superXWidth = block.width + block.x;\\n }\\n }\\n } else if (superXWidth > 0) {\\n block.x = superXWidth + VF.ChordSymbol.spacingBetweenBlocks;\\n superXWidth = 0;\\n } else {\\n superXAlign = 0;\\n }\\n curX += block.width;\\n maxH = block.height > maxH ? maxH : block.height;\\n prevBlock = block;\\n });\\n this.width = curX - this.startX;\\n this.height = maxH;\\n this.updatedMetrics = true;\\n }\",\n \"step() {\\n // !!!! IMPLEMENT ME !!!!\\n const currentCells = this.cells[this.activeBuffer];\\n const nextCells = this.cells[this.activeBuffer === 1 ? 0 : 1];\\n\\n for (let h = 0; h < this.height; h++) {\\n for (let w = 0; w < this.width; w++) {\\n const count = this.getLiveNeighborCount.call(this, h, w);\\n\\n if (currentCells[h][w]) {\\n if (count < 2 || count > 3) {\\n nextCells[h][w] = false;\\n } else {\\n nextCells[h][w] = true;\\n }\\n } else {\\n if (count === 3) {\\n nextCells[h][w] = true;\\n } else {\\n nextCells[h][w] = false;\\n }\\n }\\n }\\n }\\n this.activeBuffer = this.activeBuffer === 1 ? 0 : 1;\\n }\",\n \"function checkSequence(){\\n\\t console.log(\\\"checking\\\");\\n\\t if (JSON.stringify(pattern) === JSON.stringify(userPattern)){\\n\\t\\t\\telementScore.innerHTML ++;\\n\\t\\t\\tif(elementHigh.innerHTML < elementScore.innerHTML){\\n\\t\\t\\t elementHigh.innerHTML++;\\n\\t\\t\\t}\\n\\t/* The next level function is called if they are, if not end game.*/\\t\\n\\t\\t \\n\\t\\t console.log(\\\"next\\\");\\n\\t nextLevel();\\n\\t }\\n\\t\\telse {\\n\\t\\t\\n\\t\\t\\tendGame();\\n\\t\\t} \\n }\",\n \"checkRows() {\\n for (let o = 0; o < this.canvasheight / this.blockSize; o++) {\\n let row = 0;\\n for (let i = 0; i < this.blocks.length; i++){\\n if (this.blocks[i].y === o){\\n row++;\\n }\\n }\\n\\n if (row === this.canvaswidth / this.blockSize){\\n this.remove(o);\\n }\\n }\\n }\",\n \"function matchPattern(pattern,genome) {\\n //console.log(pattern);\\n //console.log(genome);\\n //console.log(\\\"genome length : \\\" + genome.length);\\n var positions = [];\\n for(var i=0;i<=genome.length-pattern.length;i++) {\\n var str = computeText(genome,i,pattern.length);\\n // console.log(str);\\n if(str==pattern) {\\n positions.push(i);\\n }\\n }\\n return positions;\\n /*\\n var output = \\\"\\\";\\n for(var i=0;i {\\n\\n let imgBytes = await this.toIntegerArray();\\n\\n let scanCount = 0;\\n \\n let SOS = this.SOS;\\n\\n let imgBytesLength = imgBytes.length;\\n \\n //0xFFDA\\n for (let i = 0; i < imgBytesLength; i = i + 2) {\\n //0xFFDA\\n if (imgBytes[i] === SOS[0] && imgBytes[i + 1] === SOS[1]) {\\n scanCount++;\\n }\\n }\\n \\n resolve(scanCount);\\n });\\n }\",\n \"parseBlock(s, currentRehearsalGroup, latest_variables){\\n // parase until block boundary is found\\n // block boundary = \\\"[\\\" or 2 successive NL or NOL\\n try{\\n var r = null;\\n var loop_cnt = 0;\\n\\n var block = new common.Block();\\n var current_align = \\\"expand\\\";\\n\\n this.context.contiguous_line_break = 0; // This should be done only if NL is really consumed.\\n\\n let num_meas_row = 0;\\n\\n let MAX_LOOP = 1000;\\n\\n let end_of_rg = false;\\n\\n // eslint-disable-next-line no-constant-condition\\n while (true) {\\n r = this.nextToken(s);\\n if (r.type == TOKEN_END){\\n s = r.s; // explicitly consume the last spaces if any.\\n end_of_rg = true;\\n break;\\n }else if (r.type == TOKEN_NL) {\\n this.context.line += 1;\\n this.context.contiguous_line_break += 1;\\n current_align = \\\"expand\\\"; // default is expand\\n //if(this.context.contiguous_line_break >= 2) break; Do not break here. If the first non NL element is found, then break.\\n } else if(r.type == TOKEN_BACK_SLASH){\\n if(this.context.contiguous_line_break >= 2) break;\\n // Expect TOKEN_NL \\n r = this.nextToken(r.s);\\n if(r.type != TOKEN_NL) this.onParseError(\\\"INVALID CODE DETECTED AFTER BACK SLASH\\\");\\n this.context.line += 1;\\n //block.appendChild(new common.RawSpaces(r.sss));\\n //block.appendChild(new common.RawSpaces(r.token)); \\n // Does not count as line break\\n }else if(r.type == TOKEN_BRACKET_RA){\\n if(this.context.contiguous_line_break >= 2) break;\\n // Right aligh indicoator > which is outside measure\\n current_align = \\\"right\\\";\\n }else if(r.type == TOKEN_BRACKET_LA){\\n if(this.context.contiguous_line_break >= 2) break;\\n // Right aligh indicoator > which is outside measure\\n current_align = \\\"left\\\";\\n } else if (r.type == TOKEN_BRACKET_LS) {\\n // Next rehearsal mark detected.\\n // Do not consume.\\n end_of_rg = true;\\n break;\\n } else if (\\n [\\n TOKEN_MB,\\n TOKEN_MB_DBL,\\n TOKEN_MB_LOOP_BEGIN,\\n TOKEN_MB_LOOP_END,\\n TOKEN_MB_LOOP_BOTH,\\n TOKEN_MB_FIN,\\n TOKEN_MB_DBL_SIMILE\\n ].indexOf(r.type) >= 0\\n ) {\\n if(this.context.contiguous_line_break >= 2) break;\\n\\n let is_new_line_middle_of_block = num_meas_row > 0 && this.context.contiguous_line_break == 1;\\n\\n this.context.contiguous_line_break = 0;\\n \\n r = this.parseMeasures(r, r.s); // the last NL has not been consumed.\\n // Apply the variables valid at this point for each measures\\n //r.measures.forEach(m=>{ m.variables = common.shallowcopy(latest_variables);});\\n r.measures.forEach(m=>{\\n for(let key in latest_variables){\\n m.setVariable(latest_variables[key]);\\n }\\n });\\n\\n // For the first measure, set align and new line mark.\\n r.measures[0].align = current_align;\\n r.measures[0].raw_new_line = is_new_line_middle_of_block; // mark to the first measure\\n block.concat(r.measures);\\n\\n ++num_meas_row;\\n\\n } else if (r.type == TOKEN_PERCENT) {\\n if(this.context.contiguous_line_break >= 2) break;\\n // Expression\\n r = this.parseVariable(r.s); // last NL would not be consumed\\n let variable = new common.Variable(r.key, r.value);\\n //block.setVariable(r.key, r.value); Do not do this as with this, only the last variable will be valid.\\n latest_variables[r.key] = variable;\\n block.appendChild(variable);\\n this.context.contiguous_line_break = 0; // -= 1; // Does not reset to 0, but cancell the new line in the same row as this variable\\n } else {\\n console.log(r.token);\\n this.onParseError(\\\"ERROR_WHILE_PARSE_MOST_OUTSIDER\\\");\\n }\\n s = r.s;\\n loop_cnt++;\\n if (loop_cnt >= MAX_LOOP){\\n throw \\\"Too much elements or infnite loop detected with unkown reason\\\";\\n }\\n }\\n return { block:block, s:s, end_of_rg:end_of_rg};\\n }catch(e){\\n console.error(e);\\n return null;\\n }\\n }\",\n \"function ascendingdiagonalline(prevrow, prevcol) {\\n var currchip = null;\\n var prevchip = 0;\\n var count = 0;\\n\\n for (var row = 0; row < 6; row++) {\\n //for any coordinate in an ascending diagonal, sum of col and row are the same\\n //thus when row increases by 1, col decreases by 1\\n //row = 0 is the top-right of diagonal; row = 5 is the bottom-left of diagonal\\n var col = prevcol + prevrow - row;\\n if (col >=0 && col < 7) {\\n\\n currchip = board[row][col];\\n if (currchip == prevchip && currchip != 0) {\\n count++;\\n }\\n else {\\n count = 0;\\n }\\n //count == 3 when four chips are in a line\\n if (count == UI.wincondition - 1) {\\n return true;\\n }\\n //set previous chip to current chip for next comparison\\n prevchip = currchip;\\n\\n }\\n }\\n\\n //else no ascending diagonal line\\n return false;\\n}\",\n \"function macthCount(current, goal) {\\n let matchC = 0;\\n for (let i = 0; i < current.length; i++) {\\n for (let j = 0; j < current[i].length; j++) {\\n if (current[i][j] == goal[i][j]) {\\n matchC++;\\n }\\n }\\n }\\n return (matchC==9)?true:false;\\n}\",\n \"function binaryPlacement(pEn,pKay,set,pItemSet,writtenTo)\\n{\\n this.inPosition =[];\\n this.itemSet=pItemSet;\\n this.kay=pKay;\\n this.en=pEn;\\n var low = ((this.en-this.kay)>this.kay)?this.kay:this.en-this.kay;\\n var top = en-low;\\n var curPosCapt =writtenTo.slice();\\n var lastStart=[0]\\n var aftFirst = false;\\n\\nfor (var cA=0;cA(apArray.length-1))\\n if (aftFirst)\\n {\\n if (cj==start)\\n {\\n for (var cp=cj-leve-1;cp<(this.en-this.kay);cp++)\\n if(cp==cj-leve-1)\\n {\\n curPosCapt[cp+(leve-1)-lastStart[0]]=this.itemSet[1];\\n }\\n else\\n {\\n curPosCapt[pSet[cp+this.kay]]=this.itemSet[1];\\n }\\n }\\n else\\n {\\n curPosCapt[pSet[cj-1]]=this.itemSet[1];\\n }\\n }\\n this.inPosition.push(curPosCapt.slice());\\n }\\n if (start==(this.en-1))\\n {\\n lastStart[0]=lastStart[0]+1;\\n var int = 5;\\n }\\n else\\n {\\n lastStart[0]=0;\\n }\\n }\\n else\\n {\\n //on any call the start value is the value at the current level\\n start=leveA;\\n //starting at that value go up to the en - length+leve +1\\n for (var ck=start;ck<(this.en-this.kay+leve+1);ck++)\\n {\\n //write the counter value to this level position\\n leveA++;\\n curPosCapt[pSet[ck]]=this.itemSet[0];\\n //call the next level with this one holding array that\\n //has just been fed ck.\\n //increase level by one and\\n //make the value one higher\\n BAForRep(ck+1,pSet,aftFirst,leve+1,leveA,lastStart,curPosCapt)\\n// BAForRep(ck+1,pSet,aftFirst,en,leve+1,leveA,lastStart,curPosCapt)\\n //after we have written arrays for the last level\\n //we will snap back at each level\\n //and we run the ascending sequence to the end\\n for (var cm=leve+1;cm= 0; row--) {\\n\\n if (block) return false; // ==== se han comprobado todos los bloques de abajo ====>>>\\n for (let col = 0; col < 4; col++) {\\n\\n if (this[row][col] === 0) continue;\\n\\n block = true;\\n absPos = this._getAbsolutePosition(row, col);\\n\\n if (absPos.row === 19) return true; //==== un bloque esta eb el fondo =====>>\\n }\\n }\\n }\",\n \"topColPositions(callback){\\n var colSpan = arguments[0]\\n var rowIdx = arguments[1] - 1//get offset so not looking at hall\\n var board = arguments[2]\\n //get top and bottom\\n var l = colSpan[0]\\n var r = colSpan[1]\\n //create copies to check reduction bounds\\n var originalL = l\\n //counter for a quit if the room cannot be created with the max amount of tries\\n var counter = 0\\n\\n var span = Math.abs(l-r)\\n //reduce by more than a half because of offsets\\n l = l - Math.floor((span/3))\\n r = r - Math.floor(span/3)\\n //update the span\\n span = Math.abs(l - r)\\n try{\\n if(board[rowIdx + 1][l].type == 'H' || board[rowIdx + 1][r].type == 'H'){\\n return null\\n }\\n else if(board[rowIdx][l].filled == false && board[rowIdx][r].filled == false &&\\n board[rowIdx+1][l].type != 'H' && board[rowIdx+1][r].filled != 'H'){//checks the bounds to make sure hall is not in the empty spaces\\n // console.log('returning original')\\n return [l,r]\\n }\\n else{\\n while(((board[l][rowIdx].filled == true || board[r][rowIdx].filled == true) ||\\n (board[rowIdx+1][l].type !== 'H' || board[rowIdx+1][r].type !== 'H')) && \\n counter < 3 && span > 3){\\n // console.log('reducing')\\n //top is occupied, reduce by a quarter of current span, usually just 1 because rooms are small right now\\n if(board[rowIdx][l].filled == true){\\n l = l + 1\\n }\\n //bot is occupied, reduce by a quarter of current span, usually just 1 because rooms are small right now\\n if(board[rowIdx][r].filled == true){\\n r = r - 1\\n }\\n //return the updated positions if the positions are not filled\\n if(board[rowIdx][l].filled == false && board[rowIdx][r].filled == false && originalL >= l && l < r && span > 3 &&\\n board[rowIdx+1][l].type != 'H' && board[rowIdx+1][r].filled != 'H'){\\n return [l,r]\\n }\\n //update the span\\n span = Math.abs(l-r)\\n //update counter\\n counter += 1\\n }\\n }\\n\\n }\\n catch(e){\\n console.log('row position is null with top:${t} and bottom: ${b}')\\n return null\\n }\\n return null\\n }\",\n \"function findInSequence() {\\n\\tvar beginMatch = 0;\\n\\tvar endMatch = 0;\\n\\tvar i = 0;\\n\\tvar specChar = RegExp('[X]');\\n\\tvar test = specChar.exec(searchMotif);\\n\\tconsole.log(test);\\n\\tvar xs = [];\\n\\tvar generalCase = false;\\n\\tvar splitMotif = searchMotif.split(\\\"\\\");\\n\\tif (test != null && searchMotif.length >= 2){\\n\\t\\t\\n\\t\\tfor (var i = 0; i < searchMotif.length; i++){\\n\\t\\t\\tvar char = searchMotif.charAt(i);\\n\\t\\t\\tif(char == \\\"X\\\"){\\n\\t\\t\\t\\txs.push(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tgeneralCase = true;\\n\\t}\\nwhile (endMatch < seq.length){\\n\\tendMatch = beginMatch + searchMotif.length;\\n\\tvar currentlyChecked = seq.substring(beginMatch, endMatch);\\n\\t//check for spaces or new lines within the search portion of the sequence\\n\\tif(generalCase){\\n\\t\\tvar currCheckedSplit = currentlyChecked.split(\\\"\\\");\\n\\t\\t//process out x's\\n\\t\\tfor(var i = 0; i < splitMotif.length; i++){\\n\\t\\t\\tif(xs[i] != null){\\n\\t\\t\\tcurrCheckedSplit.splice(xs[i],1,\\\"X\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcurrentlyChecked = currCheckedSplit.join(\\\"\\\");\\n\\t}\\n\\tif(currentlyChecked === searchMotif){\\n\\t\\tvar indices = [beginMatch, endMatch];\\n\\t\\tindicesOfMatches.push(indices);\\n\\t\\tbeginMatch = endMatch;\\n\\t}\\n\\telse{\\n\\t\\tbeginMatch++;\\n\\t}\\n\\tcurrentlyChecked = \\\"\\\";\\n}\\n\\tinsertHighlightSpans();\\n}\",\n \"function cdetect(x,y){\\n if((x>=arrow_c[0]&&x=arrow_c[1]&&y=arrow_c[0]+40+bgpos[2]&&x=arrow_c[1]&&y=btn_opt,txtpos[0]-32+block_s&&x=txtpos[1]+i*block_s-12&&y= start) {\\n\\t\\t\\t\\tthis.newArray.push(row[1]);\\n\\t\\t\\t\\tif (row[2] == 0) { rows.push(JSON.stringify(this.newArray)); \\n\\t\\t\\t\\t\\tthis.count++;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tthis.recurse(row[2], row[3]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tthis.newArray.pop();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"updateState(currentState) {\\n // Net state working array\\n let newState = [];\\n // If the new state is identical to the old state\\n let identical = true;\\n for (let i = 0; i < this.cols; i++) {\\n newState.push([]);\\n for (let j = 0; j < this.rows; j++) {\\n // Previously alive\\n let wasAlive = currentState[i][j];\\n // If it will be alive now\\n let nowAlive = false;\\n // Number of neighboring cells that are alive\\n let neighbors = 0;\\n // the 'j' coordinate of the cells above\\n const up = (j - 1 + this.rows) % this.rows;\\n // the 'j' coordinate of the cells below\\n const down = (j + 1 + this.rows) % this.rows;\\n // the 'i' coordinate of the cells left\\n const left = (i - 1 + this.cols) % this.cols;\\n // the 'i' coordinate of the cells right\\n const right = (i + 1 + this.cols) % this.cols;\\n // Count living neighbors\\n if (currentState[i][up])\\n neighbors++;\\n if (currentState[right][up])\\n neighbors++;\\n if (currentState[right][j])\\n neighbors++;\\n if (currentState[right][down])\\n neighbors++;\\n if (currentState[i][down])\\n neighbors++;\\n if (currentState[left][down])\\n neighbors++;\\n if (currentState[left][j])\\n neighbors++;\\n if (currentState[left][up])\\n neighbors++;\\n // Is it now alive?\\n if (wasAlive) {\\n if (neighbors < 2 || neighbors > 3) {\\n nowAlive = false;\\n }\\n else {\\n nowAlive = true;\\n }\\n }\\n else {\\n if (neighbors == 3) {\\n nowAlive = true;\\n }\\n else {\\n nowAlive = false;\\n }\\n }\\n // If different than before then arrays aren't identical\\n if (nowAlive !== wasAlive) {\\n identical = false;\\n }\\n // Push new sate to working array\\n newState[i].push(nowAlive);\\n }\\n }\\n // Set stable to true if the arrays are identical\\n if (identical) {\\n this.stable = true;\\n }\\n return newState;\\n }\",\n \"function _vcount(a, s) {\\n // a arrays\\n var aptr = a._ptr;\\n var aindex = a._index;\\n var asize = a._size; // rows & columns\\n\\n var m = asize[0];\\n var n = asize[1]; // initialize s arrays\\n\\n s.pinv = []; // (m + n)\\n\\n s.leftmost = []; // (m)\\n // vars\\n\\n var parent = s.parent;\\n var pinv = s.pinv;\\n var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\\n\\n var w = []; // (m + 3 * n)\\n\\n var next = 0;\\n var head = m;\\n var tail = m + n;\\n var nque = m + 2 * n; // vars\\n\\n var i, k, p, p0, p1; // initialize w\\n\\n for (k = 0; k < n; k++) {\\n // queue k is empty\\n w[head + k] = -1;\\n w[tail + k] = -1;\\n w[nque + k] = 0;\\n } // initialize row arrays\\n\\n\\n for (i = 0; i < m; i++) {\\n leftmost[i] = -1;\\n } // loop columns backwards\\n\\n\\n for (k = n - 1; k >= 0; k--) {\\n // values & index for column k\\n for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\\n // leftmost[i] = min(find(A(i,:)))\\n leftmost[aindex[p]] = k;\\n }\\n } // scan rows in reverse order\\n\\n\\n for (i = m - 1; i >= 0; i--) {\\n // row i is not yet ordered\\n pinv[i] = -1;\\n k = leftmost[i]; // check row i is empty\\n\\n if (k === -1) {\\n continue;\\n } // first row in queue k\\n\\n\\n if (w[nque + k]++ === 0) {\\n w[tail + k] = i;\\n } // put i at head of queue k\\n\\n\\n w[next + i] = w[head + k];\\n w[head + k] = i;\\n }\\n\\n s.lnz = 0;\\n s.m2 = m; // find row permutation and nnz(V)\\n\\n for (k = 0; k < n; k++) {\\n // remove row i from queue k\\n i = w[head + k]; // count V(k,k) as nonzero\\n\\n s.lnz++; // add a fictitious row\\n\\n if (i < 0) {\\n i = s.m2++;\\n } // associate row i with V(:,k)\\n\\n\\n pinv[i] = k; // skip if V(k+1:m,k) is empty\\n\\n if (--nque[k] <= 0) {\\n continue;\\n } // nque[k] is nnz (V(k+1:m,k))\\n\\n\\n s.lnz += w[nque + k]; // move all rows to parent of k\\n\\n var pa = parent[k];\\n\\n if (pa !== -1) {\\n if (w[nque + pa] === 0) {\\n w[tail + pa] = w[tail + k];\\n }\\n\\n w[next + w[tail + k]] = w[head + pa];\\n w[head + pa] = w[next + i];\\n w[nque + pa] += w[nque + k];\\n }\\n }\\n\\n for (i = 0; i < m; i++) {\\n if (pinv[i] < 0) {\\n pinv[i] = k++;\\n }\\n }\\n\\n return true;\\n }\",\n \"function _vcount(a, s) {\\n // a arrays\\n var aptr = a._ptr;\\n var aindex = a._index;\\n var asize = a._size; // rows & columns\\n\\n var m = asize[0];\\n var n = asize[1]; // initialize s arrays\\n\\n s.pinv = []; // (m + n)\\n\\n s.leftmost = []; // (m)\\n // vars\\n\\n var parent = s.parent;\\n var pinv = s.pinv;\\n var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\\n\\n var w = []; // (m + 3 * n)\\n\\n var next = 0;\\n var head = m;\\n var tail = m + n;\\n var nque = m + 2 * n; // vars\\n\\n var i, k, p, p0, p1; // initialize w\\n\\n for (k = 0; k < n; k++) {\\n // queue k is empty\\n w[head + k] = -1;\\n w[tail + k] = -1;\\n w[nque + k] = 0;\\n } // initialize row arrays\\n\\n\\n for (i = 0; i < m; i++) {\\n leftmost[i] = -1;\\n } // loop columns backwards\\n\\n\\n for (k = n - 1; k >= 0; k--) {\\n // values & index for column k\\n for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\\n // leftmost[i] = min(find(A(i,:)))\\n leftmost[aindex[p]] = k;\\n }\\n } // scan rows in reverse order\\n\\n\\n for (i = m - 1; i >= 0; i--) {\\n // row i is not yet ordered\\n pinv[i] = -1;\\n k = leftmost[i]; // check row i is empty\\n\\n if (k === -1) {\\n continue;\\n } // first row in queue k\\n\\n\\n if (w[nque + k]++ === 0) {\\n w[tail + k] = i;\\n } // put i at head of queue k\\n\\n\\n w[next + i] = w[head + k];\\n w[head + k] = i;\\n }\\n\\n s.lnz = 0;\\n s.m2 = m; // find row permutation and nnz(V)\\n\\n for (k = 0; k < n; k++) {\\n // remove row i from queue k\\n i = w[head + k]; // count V(k,k) as nonzero\\n\\n s.lnz++; // add a fictitious row\\n\\n if (i < 0) {\\n i = s.m2++;\\n } // associate row i with V(:,k)\\n\\n\\n pinv[i] = k; // skip if V(k+1:m,k) is empty\\n\\n if (--nque[k] <= 0) {\\n continue;\\n } // nque[k] is nnz (V(k+1:m,k))\\n\\n\\n s.lnz += w[nque + k]; // move all rows to parent of k\\n\\n var pa = parent[k];\\n\\n if (pa !== -1) {\\n if (w[nque + pa] === 0) {\\n w[tail + pa] = w[tail + k];\\n }\\n\\n w[next + w[tail + k]] = w[head + pa];\\n w[head + pa] = w[next + i];\\n w[nque + pa] += w[nque + k];\\n }\\n }\\n\\n for (i = 0; i < m; i++) {\\n if (pinv[i] < 0) {\\n pinv[i] = k++;\\n }\\n }\\n\\n return true;\\n }\",\n \"function checkForHorizontalMatches(grid, height, width){\\n xMatchList = [];\\n for (var a = 0; a < grid.length; a++){\\n for (var b = 0; b < grid[a].length; b++){\\n if (grid[a][b-1]){\\n if (grid[a][b].stoneColor != grid[a][b-1].stoneColor){\\n if (grid[a][b+1]){\\n if (grid[a][b].stoneColor == grid[a][b + 1].stoneColor){\\n var count = 1;\\n var matches = [];\\n matches.push(grid[a][b]);\\n while (grid[a][b + count] != null && grid[a][b].stoneColor == grid[a][b + count].stoneColor){\\n matches.push(grid[a][b + count]);\\n count++;\\n }\\n if (matches.length >= 3){\\n xMatchList.push(matches);\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n return xMatchList;\\n }\",\n \"function checkrow(rowIndex, state) {\\n var countb = 0;\\n var countw = 0;\\n var tempb = [];\\n var tempw = [];\\n for (var j = 0; j < 6; j ++) {\\n if (state[rowIndex][j] == 'b') {\\n countb ++;\\n tempw.push(countw);\\n countw =0;\\n } else if (state[rowIndex][j] == 'w'){\\n countw ++;\\n tempb.push(countb);\\n countb = 0;\\n } else {\\n tempw.push(countw);\\n countw =0;\\n tempb.push(countb);\\n countb =0;\\n }\\n }\\n tempw.push(countw);\\n countw =0;\\n tempb.push(countb);\\n countb =0;\\n tempb.sort(function(a,b) {return b-a});\\n tempw.sort(function(a,b) {return b-a});\\n resultB[rowIndex] = tempb[0];\\n resultW[rowIndex] = tempw[0];\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.556877","0.55510575","0.550457","0.54952186","0.5485731","0.54697144","0.5401432","0.53315246","0.5296665","0.52186847","0.519853","0.5159309","0.51492774","0.51125616","0.5105361","0.5051013","0.5049619","0.50307536","0.4978565","0.49664906","0.4953451","0.4946108","0.4911204","0.48993278","0.48652253","0.48633105","0.48619917","0.48585254","0.48485187","0.48414558","0.4838748","0.4832283","0.4807545","0.4784825","0.47704917","0.47698155","0.47693887","0.4739101","0.47371578","0.47302577","0.47243437","0.4721678","0.47158042","0.46931234","0.46792","0.46790212","0.46743652","0.46664834","0.46596092","0.46526197","0.4645179","0.46339864","0.4628371","0.46274683","0.4624134","0.4623062","0.46147454","0.46146864","0.45975155","0.45947224","0.45883346","0.4583467","0.45798156","0.45777762","0.4575364","0.457104","0.45632973","0.45428857","0.45398426","0.453903","0.45339832","0.45208362","0.45141098","0.4504218","0.4496106","0.4493771","0.44847238","0.4483179","0.44788846","0.44767013","0.44749945","0.4473785","0.44701567","0.44639122","0.44617313","0.44616777","0.44583768","0.44496906","0.4448694","0.44463682","0.4432764","0.44293174","0.44227186","0.4419464","0.4415274","0.44140437","0.44110212","0.44110212","0.4407394","0.44067764"],"string":"[\n \"0.556877\",\n \"0.55510575\",\n \"0.550457\",\n \"0.54952186\",\n \"0.5485731\",\n \"0.54697144\",\n \"0.5401432\",\n \"0.53315246\",\n \"0.5296665\",\n \"0.52186847\",\n \"0.519853\",\n \"0.5159309\",\n \"0.51492774\",\n \"0.51125616\",\n \"0.5105361\",\n \"0.5051013\",\n \"0.5049619\",\n \"0.50307536\",\n \"0.4978565\",\n \"0.49664906\",\n \"0.4953451\",\n \"0.4946108\",\n \"0.4911204\",\n \"0.48993278\",\n \"0.48652253\",\n \"0.48633105\",\n \"0.48619917\",\n \"0.48585254\",\n \"0.48485187\",\n \"0.48414558\",\n \"0.4838748\",\n \"0.4832283\",\n \"0.4807545\",\n \"0.4784825\",\n \"0.47704917\",\n \"0.47698155\",\n \"0.47693887\",\n \"0.4739101\",\n \"0.47371578\",\n \"0.47302577\",\n \"0.47243437\",\n \"0.4721678\",\n \"0.47158042\",\n \"0.46931234\",\n \"0.46792\",\n \"0.46790212\",\n \"0.46743652\",\n \"0.46664834\",\n \"0.46596092\",\n \"0.46526197\",\n \"0.4645179\",\n \"0.46339864\",\n \"0.4628371\",\n \"0.46274683\",\n \"0.4624134\",\n \"0.4623062\",\n \"0.46147454\",\n \"0.46146864\",\n \"0.45975155\",\n \"0.45947224\",\n \"0.45883346\",\n \"0.4583467\",\n \"0.45798156\",\n \"0.45777762\",\n \"0.4575364\",\n \"0.457104\",\n \"0.45632973\",\n \"0.45428857\",\n \"0.45398426\",\n \"0.453903\",\n \"0.45339832\",\n \"0.45208362\",\n \"0.45141098\",\n \"0.4504218\",\n \"0.4496106\",\n \"0.4493771\",\n \"0.44847238\",\n \"0.4483179\",\n \"0.44788846\",\n \"0.44767013\",\n \"0.44749945\",\n \"0.4473785\",\n \"0.44701567\",\n \"0.44639122\",\n \"0.44617313\",\n \"0.44616777\",\n \"0.44583768\",\n \"0.44496906\",\n \"0.4448694\",\n \"0.44463682\",\n \"0.4432764\",\n \"0.44293174\",\n \"0.44227186\",\n \"0.4419464\",\n \"0.4415274\",\n \"0.44140437\",\n \"0.44110212\",\n \"0.44110212\",\n \"0.4407394\",\n \"0.44067764\"\n]"},"document_score":{"kind":"string","value":"0.7157436"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":3070,"cells":{"query":{"kind":"string","value":"This is called when a horizontal scan finds a possible alignment pattern. It will cross check with a vertical scan, and if successful, will see if this pattern had been found on a previous horizontal scan. If so, we consider it confirmed and conclude we have found the alignment pattern. stateCount reading state module counts from horizontal scan i where alignment pattern may be found j end of possible alignment pattern in row"},"document":{"kind":"string","value":"function handlePossibleCenter(stateCount, i, j, moduleSize) {\r\n\t\t var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\r\n\t\t var centerJ = centerFromEnd(stateCount, j);\r\n\t\t if (centerJ == null) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t var centerI = crossCheckVertical(i, Math.floor(centerJ), 2 * stateCount[1], stateCountTotal, moduleSize, image);\r\n\t\t if (centerI != null) {\r\n\t\t var estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3;\r\n\t\t for (var i2 in possibleCenters) {\r\n\t\t var center = possibleCenters[i2];\r\n\t\t // Look for about the same center and module size:\r\n\t\t if (aboutEquals(center, estimatedModuleSize, centerI, centerJ)) {\r\n\t\t return combineEstimate(center, centerI, centerJ, estimatedModuleSize);\r\n\t\t }\r\n\t\t }\r\n\t\t // Hadn't found this before; save it\r\n\t\t var point = { x: centerJ, y: centerI, estimatedModuleSize: estimatedModuleSize };\r\n\t\t possibleCenters.push(point);\r\n\t\t }\r\n\t\t return null;\r\n\t\t }"},"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 crossCheckVertical(startI, centerJ, maxCount, originalStateCountTotal, moduleSize, image) {\r\n\t\t var maxI = image.height;\r\n\t\t var stateCount = [0, 0, 0];\r\n\t\t // Start counting up from center\r\n\t\t var i = startI;\r\n\t\t while (i >= 0 && image.get(centerJ, i) && stateCount[1] <= maxCount) {\r\n\t\t stateCount[1]++;\r\n\t\t i--;\r\n\t\t }\r\n\t\t // If already too many modules in this state or ran off the edge:\r\n\t\t if (i < 0 || stateCount[1] > maxCount) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t while (i >= 0 && !image.get(centerJ, i) && stateCount[0] <= maxCount) {\r\n\t\t stateCount[0]++;\r\n\t\t i--;\r\n\t\t }\r\n\t\t if (stateCount[0] > maxCount) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t // Now also count down from center\r\n\t\t i = startI + 1;\r\n\t\t while (i < maxI && image.get(centerJ, i) && stateCount[1] <= maxCount) {\r\n\t\t stateCount[1]++;\r\n\t\t i++;\r\n\t\t }\r\n\t\t if (i == maxI || stateCount[1] > maxCount) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t while (i < maxI && !image.get(centerJ, i) && stateCount[2] <= maxCount) {\r\n\t\t stateCount[2]++;\r\n\t\t i++;\r\n\t\t }\r\n\t\t if (stateCount[2] > maxCount) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\r\n\t\t if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t return foundPatternCross(stateCount, moduleSize) ? centerFromEnd(stateCount, i) : null;\r\n\t\t}","function AlignmentPatternFinder(image, startX\n /*int*/\n , startY\n /*int*/\n , width\n /*int*/\n , height\n /*int*/\n , moduleSize\n /*float*/\n , resultPointCallback) {\n _classCallCheck(this, AlignmentPatternFinder);\n\n this.image = image;\n this.startX = startX;\n this.startY = startY;\n this.width = width;\n this.height = height;\n this.moduleSize = moduleSize;\n this.resultPointCallback = resultPointCallback;\n this.possibleCenters = []; // new Array(5))\n // TYPESCRIPTPORT: array initialization without size as the length is checked below\n\n this.crossCheckStateCount = new Int32Array(3);\n }","check(x, y, board = this.map) {\n let color = board[y][x];\n if (color === \"⚪\") return 1;\n //horizontal\n if (\n this.search(x, y, color, 1, 0, 0) +\n this.search(x, y, color, -1, 0, 0) - 1 >= 4\n ) {\n return 2;\n }\n //lt-rb diagonal\n if (\n this.search(x, y, color, 1, 1, 0) +\n this.search(x, y, color, -1, -1, 0) - 1 >= 4\n ) {\n return 2;\n }\n //lt-rb diagonal\n if (\n this.search(x, y, color, -1, 1, 0) +\n this.search(x, y, color, 1, -1, 0) - 1 >= 4\n ) {\n return 2;\n }\n //vertical\n if (\n this.search(x, y, color, 0, 1, 0) +\n this.search(x, y, color, 0, -1, 0) - 1 >= 4\n ) {\n return 2;\n }\n\n // check how many pieces in a column\n let countstack = 0;\n for (let i = 0; i < 7; i++) {\n if (this.stack[i] === -1) {\n countstack++;\n }\n }\n\n // a column is full\n if (countstack === 7) return 3;\n\n return 1;\n }","drawAlignmentPattern(x, y) {\n let i;\n let j;\n for (i = x - 2, j = y - 2; i < x + 3; i++, j++) {\n this.mModuleValue[i][y - 2].isBlack = true;\n this.mModuleValue[i][y - 2].isFilled = true;\n this.mModuleValue[i][y + 2].isBlack = true;\n this.mModuleValue[i][y + 2].isFilled = true;\n this.mModuleValue[x - 2][j].isBlack = true;\n this.mModuleValue[x - 2][j].isFilled = true;\n this.mModuleValue[x + 2][j].isBlack = true;\n this.mModuleValue[x + 2][j].isFilled = true;\n }\n for (i = x - 1, j = y - 1; i < x + 2; i++, j++) {\n this.mModuleValue[i][y - 1].isBlack = false;\n this.mModuleValue[i][y - 1].isFilled = true;\n this.mModuleValue[i][y + 1].isBlack = false;\n this.mModuleValue[i][y + 1].isFilled = true;\n this.mModuleValue[x - 1][j].isBlack = false;\n this.mModuleValue[x - 1][j].isFilled = true;\n this.mModuleValue[x + 1][j].isBlack = false;\n this.mModuleValue[x + 1][j].isFilled = true;\n }\n this.mModuleValue[x][y].isBlack = true;\n this.mModuleValue[x][y].isFilled = true;\n }","function lookAheadCount(nfa, testCombineIndex)\n{ var testString=inputString.value;// var s=inputString.value; \n var localCombineIndex={\n localIndex:[],\n localFinalIndex:[]\n\n };\nlocalCombineIndex.localIndex=testCombineIndex.myIndex;\n//localCombineIndex.myFinalIndex=testCombineIndex.myFinalIndex;\n var CurrentActive=[];\n var NextActive=[];\n var MatchCount=0;\n var temp=[];\n \n CurrentActive=_.union(CurrentActive, nfa.states);\n for(var i=0; i= MAX_ROWS) {\n // Something is wrong, since we have exceeded\n // the maximum rows in the specification.\n // TODO Maybe return error code\n return null;\n }\n let rowDifference = 0;\n // Scan a line of modules and check the\n // difference between this and the previous line\n for (let j = 0; j < width; j++) {\n // Accumulate differences between this line and the\n // previous line.\n if (this.bitMatrix._get(j, i) != this.bitMatrix._get(j, i - 1)) {\n rowDifference++;\n }\n }\n\n if (rowDifference <= moduleWidth * this.MAX_ROW_DIFFERENCE) {\n for (let j2 = 0; j2 < width; j2++) {\n // Accumulate the black pixels on this line\n if (bitMatrix._get(j2, i)) {\n rowCounters[j2]++;\n }\n }\n // Increment the number of consecutive rows of pixels\n // that are more or less the same\n matchingConsecutiveScans++;\n // Height of a row is a multiple of the module size in pixels\n // Usually at least 3 times the module size\n if (matchingConsecutiveScans >= moduleWidth * 2) { // MGMG\n // We have some previous matches as well as a match here\n // Set processing a unique row.\n rowInProgress = true;\n }\n } else {\n if (rowInProgress) {\n // Process Row\n next = processRow(rowCounters, rowNumber, rowHeight, codewords, next);\n if (next == -1) {\n // Something is wrong, since we have exceeded\n // the maximum columns in the specification.\n // TODO Maybe return error code\n return null;\n }\n // Reinitialize the row counters.\n for (let j3 = 0; j3 < rowCounters.length; j3++) {\n rowCounters[j3] = 0;\n }\n rowNumber++;\n rowHeight = 0;\n }\n matchingConsecutiveScans = 0;\n rowInProgress = false;\n }\n rowHeight++;\n }\n // Check for a row that was in progress before we exited above.\n if (rowInProgress) {\n // Process Row\n if (rowNumber >= this.MAX_ROWS) {\n // Something is wrong, since we have exceeded\n // the maximum rows in the specification.\n // TODO Maybe return error code\n return null;\n }\n\n next = this.processRow(rowCounters, rowNumber, rowHeight, codewords, next);\n rowNumber++;\n rows = rowNumber;\n }\n erasures = trimArray(erasures, eraseCount);\n return trimArray(codewords, next);\n }","didWin(mark) {\n\n // premenne na vypocet znacky\n var vertical_count = 0,\n horizontal_count = 0,\n right_to_left_count = 0,\n left_to_right_count = 0;\n\n // Loop 1\n for (var i = 0; i < this.state.grid_size; i++) {\n\n\n vertical_count = 0;\n horizontal_count = 0;\n\n // Loop 2\n for (var j = 0; j < this.state.grid_size; j++) {\n\n\n if (this.state.data[i + '' + j] == mark) {\n horizontal_count++;\n }\n\n\n if (this.state.data[j + '' + i] == mark) {\n vertical_count++;\n }\n\n }\n\n\n if (this.state.data[i + '' + i] == mark) {\n left_to_right_count++;\n }\n\n\n if (this.state.data[(this.state.grid_size - 1 - i) + '' + i] == mark) {\n right_to_left_count++;\n }\n\n // ak suhlasi vyhral\n if (horizontal_count == this.state.grid_size || vertical_count == this.state.grid_size) {\n return true;\n }\n\n }\n\n // ak suhlasi diagonal vyhral\n if (left_to_right_count == this.state.grid_size || right_to_left_count == this.state.grid_size) {\n return true;\n }\n\n // nikto nevyhral\n return false;\n }","getNextValidPosition(inX, inY, state, stateHoriz, stateVert, currWord, lastOrientation){\n let valid = false;\n let currX = -1;\n let currY = -1;\n let newX = -1;\n let newY = -1;\n let partialScore = 0;\n\n let x = -1;\n let y = -1;\n let res = null;\n let flagBreak = false;\n if (lastOrientation == VERTICAL){\n inY = inY + 1;\n lastOrientation = null;\n }\n let currPosLetter = null;\n for (y = inY; y < state.sizeY; y++) { \n for (x = inX; x < state.sizeX; x++) {\n // Simple first test, to see if the position can be used, and cut the processing weight.\n // We will see if the position is not Empty and if it has a different letter then our first letter.\n currPosLetter = state.board[x][y];\n if ( (currPosLetter != EMPTY) && currPosLetter != currWord[0] ){\n continue;\n }\n if ((lastOrientation == null) || (lastOrientation != HORIZONTAL)){\n // Generate Horizontally placement.\n lastOrientation = HORIZONTAL;\n // Test if word can fit horizontally until the end.\n if (x < state.sizeX - currWord.length){\n [res, partialScore] = this.canWordBePlacedHorizontal(x, y, state, stateHoriz, stateVert, currWord);\n if (res == true){\n flagBreak = true;\n break;\n }\n }\n }\n if (lastOrientation == HORIZONTAL){\n // Generate Vertical placement.\n lastOrientation = VERTICAL;\n // Test if word can fit vertically until the bottom.\n if (y < state.sizeY - currWord.length){\n [res, partialScore] = this.canWordBePlacedVertical(x, y, state, stateHoriz, stateVert, currWord);\n if (res == true){\n flagBreak = true;\n break;\n }\n }\n }\n }\n if (flagBreak)\n break;\n }\n\n if ((res != null) && (res == true)){\n valid = true;\n currX = x;\n currY = y;\n newX = x;\n newY = y;\n }\n\n return [valid, currX, currY, newX, newY, lastOrientation, partialScore];\n }","function _tr_align() {\n\t\t send_bits(STATIC_TREES << 1, 3);\n\t\t send_code(END_BLOCK, StaticTree.static_ltree);\n\t\t bi_flush(); // Of the 10 bits for the empty block, we have already sent\n\t\t // (10 - bi_valid) bits. The lookahead for the last real code (before\n\t\t // the EOB of the previous block) was thus at least one plus the length\n\t\t // of the EOB plus what we have just sent of the empty static block.\n \n\t\t if (1 + last_eob_len + 10 - bi_valid < 9) {\n\t\t\tsend_bits(STATIC_TREES << 1, 3);\n\t\t\tsend_code(END_BLOCK, StaticTree.static_ltree);\n\t\t\tbi_flush();\n\t\t }\n \n\t\t last_eob_len = 7;\n\t\t} // Save the match info and tally the frequency counts. Return true if","function AlignmentPattern(posX, posY, estimatedModuleSize)\r\n{\r\n\tthis.x=posX;\r\n\tthis.y=posY;\r\n\tthis.count = 1;\r\n\tthis.estimatedModuleSize = estimatedModuleSize;\r\n\t\r\n\tthis.__defineGetter__(\"EstimatedModuleSize\", function()\r\n\t{\r\n\t\treturn this.estimatedModuleSize;\r\n\t}); \r\n\tthis.__defineGetter__(\"Count\", function()\r\n\t{\r\n\t\treturn this.count;\r\n\t});\r\n\tthis.__defineGetter__(\"X\", function()\r\n\t{\r\n\t\treturn Math.floor(this.x);\r\n\t});\r\n\tthis.__defineGetter__(\"Y\", function()\r\n\t{\r\n\t\treturn Math.floor(this.y);\r\n\t});\r\n\tthis.incrementCount = function()\r\n\t{\r\n\t\tthis.count++;\r\n\t}\r\n\tthis.aboutEquals=function( moduleSize, i, j)\r\n\t\t{\r\n\t\t\tif (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize)\r\n\t\t\t{\r\n\t\t\t\tvar moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);\r\n\t\t\t\treturn moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;\r\n\t\t\t}\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\r\n}","function patternCheckOrientation(pattern, targetCell, qualityGoal, weight, orientation) {\n var forwardFacingCells = FWD_CELLS[targetCell];\n var totalDiscrepancies = 0;\n DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\"Enter pCO([\" + pattern + \"]; \" + targetCell + \", \" + qualityGoal + \", \" + weight + \", \" + orientation + \"); compass: \" + compass);\n fwdWrong = [];\n rearWrong = [];\n if ((Array.isArray(pattern[POS_CENTER]) && !pattern[POS_CENTER][myColor]) ||\n\t((pattern[POS_CENTER] > 0) && (myColor != pattern[POS_CENTER]))) {\n\tif (forwardFacingCells[POS_CENTER]) { // always true, in fact\n\t fwdWrong.push({p:POS_CENTER, v:POS_CENTER});\n\t totalDiscrepancies += 1;\n\t} else {\n\t rearWrong.push({p:POS_CENTER, v:POS_CENTER});\n\t totalDiscrepancies += weight;\n\t}\n }\n if ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\n\tDEBUG_PATTERN_CHECK_VERBOSELY && debugme(\"--- too bad\");\n\treturn PAT_NOMATCH;\n }\n var jFrom = 0;\n switch (targetCell) {\n case AIM_UP:\n\tjFrom = 4;\n\tbreak;\n case AIM_LEFT:\n\tjFrom = 6;\n\tbreak;\n case AIM_RIGHT:\n\tjFrom = 2;\n\tbreak;\n case AIM_DOWN:\n case POS_CENTER:\n default:\n\tbreak;\n }\n for (var j = jFrom; j < TOTAL_NBRS + jFrom; j++) {\n\tvar posP = CCW[j];\n\tvar posV = CCW[orientation + j];\n\tvar c = view[posV].color;\n\tif ((Array.isArray(pattern[posP]) && !pattern[posP][c]) ||\n\t ((pattern[posP] > 0) && (c != pattern[posP]))) {\n\t if (forwardFacingCells[posP]) {\n\t\tfwdWrong.push({p:posP, v:posV});\n\t\t// #future# If it should ever be needed, we could push j as a\n\t\t// third member of these objects (its absence indicating the\n\t\t// center cell).\n\t\ttotalDiscrepancies += 1;\n\t } else {\n\t\trearWrong.push({p:posP, v:posV});\n\t\ttotalDiscrepancies += weight;\n\t }\n\t}\n\tif ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\n\t DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\"--- too bad\");\n\t return PAT_NOMATCH;\n\t}\n }\n // Assert: totalDiscrepancies == fwdWrong.length + rearWrong.length;\n // Assert: If compass < 0, then totalDiscrepancies <= qualityGoal\n debugme(\"-> total \" + totalDiscrepancies + \" weighted discrepancies found.\");\n if ((compass < 0)\n\t// && (totalDiscrepancies <= qualityGoal)\n ) {\n\tcompass = orientation;\n }\n if (DEBUGME[myType]) {\n\t// Bypass the single-arg debugme() in order to get the objects printed.\n\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\"forwardD: [\", fwdWrong, \"]\");\n\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\"rearD: [\", rearWrong, \"]\");\n }\n if (fwdWrong.length == 0) {\n\treturn (totalDiscrepancies);\n } else {\n\treturn (-totalDiscrepancies);\n }\n}","function analyze(str) {\n function createResultRecord() {\n resultsArr.push(`(${getToken(currentState)}, ${tokenString})`)\n }\n const initStrArr = str.trim().split(\"\")\n\n // Array contains previous states. Used to go back if sequence failed\n let statesBuffer = []\n let currentState = 0\n let tokenString = \"\"\n let resultsArr = [] // Results array in format [\"(number, 2)\", (id, asd), ...]\n \n for(let index = 0; index < initStrArr.length; index++) {\n function iterateBack() {\n let prevStep = 1\n let revercedBufferArr = statesBuffer.slice(1).reverse()\n\n // From the end of buffered states iterate and find first successful state\n while(!getToken(revercedBufferArr[prevStep]) &&\n prevStep <= revercedBufferArr.length) {\n prevStep += 1\n }\n // Set params to last known successfull state\n currentState = revercedBufferArr[prevStep]\n tokenString = tokenString.substr(0, tokenString.length - prevStep)\n createResultRecord()\n tokenString = \"\"\n currentState = 0\n index -= prevStep + 1\n }\n\n const char = initStrArr[index]\n const newState = getNewState(currentState, char)\n statesBuffer.push(currentState)\n\n if (char == \" \") { continue; }\n \n if (newState) {\n currentState = newState\n tokenString += char\n } else {\n if (!tokenTable[currentState]) {\n iterateBack(); continue;\n }\n createResultRecord()\n tokenString = char\n currentState = 0\n currentState = getNewState(currentState, char)\n }\n \n if(index === initStrArr.length - 1) {\n if(getToken(currentState)) {\n createResultRecord()\n } else {\n statesBuffer.push(currentState)\n index += 1\n iterateBack()\n }\n }\n }\n return resultsArr.join(\"; \") \n}","function checkSequence(){\n\t console.log(\"checking\");\n\t if (JSON.stringify(pattern) === JSON.stringify(userPattern)){\n\t\t\telementScore.innerHTML ++;\n\t\t\tif(elementHigh.innerHTML < elementScore.innerHTML){\n\t\t\t elementHigh.innerHTML++;\n\t\t\t}\n\t/* The next level function is called if they are, if not end game.*/\t\n\t\t \n\t\t console.log(\"next\");\n\t nextLevel();\n\t }\n\t\telse {\n\t\t\n\t\t\tendGame();\n\t\t} \n }","function check_block() {\n var moved = false;\n reset_counts();\n check_counts(\"X\");\n\n if (countdiag1 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 3 + i);\n }\n }\n if (countdiag2 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 2 + 2);\n }\n }\n if (countrow0 == 2) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i);\n }\n }\n if (countrow1 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(3 + i);\n }\n }\n if (countrow2 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(6 + i);\n }\n }\n if (countcol0 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 3);\n }\n }\n if (countcol1 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 3 + 1);\n }\n }\n if (countcol2 == 2 && !moved) {\n for (i = 0; i < 3; i++) {\n moved = take_space(i * 3 + 2);\n }\n }\n return moved;\n}","function checkRow( g, ri ) {\n var above_status = aliveAbove( g, ri );\n var below_status = aliveBelow( g, ri );\n var curr_status = g[ri]>0;\n var alives = [];\n var new_row = 0;\n // If nothing around it is alive, return 0;\n if ( above_status > 0 || below_status > 0 || curr_status > 0 ) {\n // Check the positions\n for( var i = 1; i < bits; i *= 2 ) {\n var alive_or_dead = (g[ri]&i)>0;\n var ac = 0;\n if ( above_status == true ) {\n (g[ri-1] & (i/2))>0?ac++:false;\n (g[ri-1] & (i/1))>0?ac++:false;\n (g[ri-1] & (i*2))>0?ac++:false;\n }\n if ( curr_status == true ) {\n (g[ri] & (i/2))>0?ac++:false;\n (g[ri] & (i*2))>0?ac++:false;\n }\n if ( below_status == true ) {\n (g[ri+1] & (i/2))>0?ac++:false;\n (g[ri+1] & (i/1))>0?ac++:false;\n (g[ri+1] & (i*2))>0?ac++:false;\n }\n if ( alive_or_dead == true && ( ac == 2 || ac == 3 ) ) {\n new_row += bits & i;\n }\n else if ( alive_or_dead == false && ac == 3 ) {\n new_row += bits & i;\n }\n }\n return new_row;\n }\n else {\n return 0;\n }\n}","canWordBePlacedHorizontal(x, y, state, stateHoriz, stateVert, word){\n let result = false;\n let partialScore = 0;\n\n // Test if we can put the word at x, y, Horizontal.\n \n // Test if the star and end position are over invalid state value terminate early.\n let endX = x + word.length - 1;\n if ((stateHoriz.board[x][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n (stateVert.board[x][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n (stateHoriz.board[x][y] == NO_HORIZ_NO_VERT) ||\n (stateVert.board[x][y] == NO_HORIZ_NO_VERT) ||\n \n (stateHoriz.board[endX][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n (stateVert.board[endX][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n (stateHoriz.board[endX][y] == NO_HORIZ_NO_VERT) ||\n (stateVert.board[endX][y] == NO_HORIZ_NO_VERT) ){\n \n result = false;\n partialScore = 0;\n return [result, partialScore]; \n }\n // Test if the word clash's with the Horizontal constrains, for all positions of the previous words placed.\n for (let i = 0; i < word.length; i++) {\n let xi = x + i; \n if ((stateHoriz.board[xi][y] == HORIZONTAL) ||\n (stateHoriz.board[xi][y] == NO_HORIZ_NO_VERT) ||\n (stateVert.board[xi][y] == NO_HORIZ_NO_VERT) ||\n (stateHoriz.board[xi][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n ( (state.board[xi][y] != EMPTY) && (state.board[xi][y] != word[i])) ){\n\n result = false;\n partialScore = 0;\n return [result, partialScore];\n }\n // Calculate the partial score of this move based on the number of crosses between words.\n if ((state.board[xi][y] != EMPTY) && (state.board[xi][y] == word[i])){\n partialScore = partialScore + 1;\n }\n }\n \n result = true;\n return [result, partialScore];\n }","function AlignmentPattern(posX, posY, estimatedModuleSize)\n{\n\tthis.x=posX;\n\tthis.y=posY;\n\tthis.count = 1;\n\tthis.estimatedModuleSize = estimatedModuleSize;\n\t\n\tthis.__defineGetter__(\"EstimatedModuleSize\", function()\n\t{\n\t\treturn this.estimatedModuleSize;\n\t}); \n\tthis.__defineGetter__(\"Count\", function()\n\t{\n\t\treturn this.count;\n\t});\n\tthis.__defineGetter__(\"X\", function()\n\t{\n\t\treturn Math.floor(this.x);\n\t});\n\tthis.__defineGetter__(\"Y\", function()\n\t{\n\t\treturn Math.floor(this.y);\n\t});\n\tthis.incrementCount = function()\n\t{\n\t\tthis.count++;\n\t}\n\tthis.aboutEquals=function( moduleSize, i, j)\n\t\t{\n\t\t\tif (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize)\n\t\t\t{\n\t\t\t\tvar moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);\n\t\t\t\treturn moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\n}","function match_pattern_at(state, pattern, player, x, y) {\n if(x >= 0 && x < state.length) {\n if(y >= 0 && y < state[x].length) {\n var element = pattern[0];\n // Check whether the type of the part is 'p'\n if(element[0] == 'p') {\n if(state[x][y] !== player) {\n return false;\n }\n } else if(element[0] == ' '){ // Check whether that the square is empty\n if(state[x][y] !== undefined) {\n return false;\n }\n }\n /*\n Check whether the pattern has more than one component in, if so then all the components\n in the pattern have not been matched so therefore call the function to check the rest of the pattern.\n The x and y cooridates are updated with the patterns second and third. If there is just one element in the pattern\n then therefore we know the pattern has matched so return true.\n */\n if(pattern.length > 1) {\n return match_pattern_at(state, pattern.slice(1), player, x + element[1], y + element[2])\n } else {\n return true;\n }\n }\n }\n return false;\n}","bitCount(mtx) {\n var count = 0;\n for (var y = 0 ; y < this.height ; y++) {\n for (var x = 0 ; x < this.width ; x++) {\n if (0 < mtx[y][x]) {\n count += 1;\n }\n }\n }\n // console.log(\"bitCount: count = \", count);\n return count;\n }","function check_horizontal(row, col, color) {\n let count = 1\n let temp = col\n while (col > 0) {\n let $left_cell = get_cell(row, --col)\n console.log(col, color, 'left count')\n console.log($left_cell)\n if ($left_cell.css('backgroundColor') == color) {\n count += 1\n console.log('count +++ left')\n }\n else {\n break\n }\n }\n col = temp\n while (col < that.col) {\n let $right_cell = get_cell(row, ++col)\n console.log(col, color, 'right count')\n console.log($right_cell)\n if ($right_cell.css('backgroundColor') == color) {\n count += 1\n console.log('count +++ right')\n }\n else {\n break\n }\n }\n if (count >= 4) {\n return true\n }\n return false\n }","numValidDirections(board) {\n let count = 0;\n\n if (this.isValidMove(board, DIRECTION.UP)) count++;\n if (this.isValidMove(board, DIRECTION.DOWN)) count++;\n if (this.isValidMove(board, DIRECTION.RIGHT)) count++;\n if (this.isValidMove(board, DIRECTION.LEFT)) count++;\n return count;\n }","function getGridStateAndNumFilled() {\n let state = '';\n let numFilled = 0\n for (let i = 0; i < gridHeight; i++) {\n for (let j = 0; j < gridWidth; j++) {\n if (grid[i][j].notBlocked()) {\n if (langMaxCharCodes == 1) {\n state = state + grid[i][j].currentLetter\n } else {\n state = state + grid[i][j].currentLetter + '$'\n }\n if (grid[i][j].currentLetter != '0') {\n numFilled++\n }\n } else {\n state = state + '.'\n }\n }\n }\n numCellsFilled = numFilled\n return state;\n}","function count_color(current_coordinate, desired_color, desired_direction, current_count) {\n\t\t\t\tlet next_coordinate = [current_coordinate[0] + desired_direction[0],\n\t\t\t\tcurrent_coordinate[1] + desired_direction[1]];\n\t\t\t\tconsole.log(next_coordinate);\n\t\t\t\tif (piece_position[next_coordinate[0]] && piece_position[next_coordinate[0]][next_coordinate[1]]) {\n\t\t\t\t\tif (piece_position[next_coordinate[0]][next_coordinate[1]].color != desired_color)\n\t\t\t\t\t\treturn current_count;\n\t\t\t\t\tcurrent_count += 1;\n\t\t\t\t\tif (current_count == 3)\n\t\t\t\t\t\treturn current_count;\n\t\t\t\t\treturn count_color(next_coordinate, desired_color, desired_direction, current_count);\n\t\t\t\t}\n\t\t\t\treturn current_count;\n\t\t\t}","setup() {\n let statetotal = 0;\n for (let i = 0; i < this.file.getRowCount(); i++) {\n let statename = this.file.getString(i, 'State');\n\n if (statename == '') return 'Not Valid State Name';\n else if (this.state.indexOf(statename) == -1) {\n this.state[statetotal] = statename;\n statetotal++;\n }\n }\n }","examine_possibles(count) {\n let updates = 0;\n //Loop through diagonally (hitting all rows/columns in n iterations)\n for (var i = 0; i < this.size; i++) {\n let node = this.nodes[i * (this.size + 1)];\n updates += this.calculate_frequencies(node, 0, count); //Row\n updates += this.calculate_frequencies(node, 1, count); //Col\n }\n\n let inc = Math.sqrt(this.size);\n\n //Loop through top left of all sub_squares\n for (var y = 0; y < this.size; y += inc) {\n for (var x = 0; x < this.size; x += inc) {\n updates += this.calculate_frequencies(this.nodes[x_y_to_index(x, y, this.size)], 2, count); //Sqr\n }\n }\n\n return updates;\n }","function charCountCompabilityCheck(seqs) {\n\tvar positionArray = new Array(seqs[0].length);\n\t// Create a base counter for each position:\n\tfor(var i = 0, n = seqs[0].length; i < n; i++) {\n\t\tpositionArray[i] = {A:0, T:0, G:0, C:0};\n\t}\n\t// Iterate over all sequences:\n\tvar seq;\n\tfor(var i = 0, n = seqs.length; i < n ; i++) {\n\t\tseq = seqs[i];\n\t\t// Iterate over all positions in current sequence:\n\t\tfor(var j = 0, m = seq.length; j < m; j++) {\n\t\t\t// Add one to the count for the base in this position:\n\t\t\tpositionArray[j][seq[j]] += 1;\n\t\t}\n\t}\n\t// Sum channel distribution:\n\tvar green;\n\tvar red;\n\tfor(var i = 0, n = seqs[0].length; i < n ; i++) {\n\t\tgreen = positionArray[i].T + positionArray[i].G;\n\t\tred = positionArray[i].A + positionArray[i].C;\n\t}\n\treturn (green > 0 && red > 0);\n}","step() {\n // Fill the offscreen buffer with the next cca generation built\n // from the current buffer.\n\n let backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n let currentBuffer = this.buffer[this.currentBufferIndex];\n let backBuffer = this.buffer[backBufferIndex];\n\n // See if we have a neighbor to infect this one\n function hasInfectiousNeighbor(x, y) {\n const nextValue = (currentBuffer[y][x] + 1) % MODULO;\n\n // Check the west neighbor of cell x, y\n /*if (x > 0) {\n if (currentBuffer[y][x - 1] === nextValue) {\n return true;\n }\n }*/\n\n // North\n if (y > 0) {\n if (currentBuffer[y - 1][x] === nextValue) {\n return true;\n }\n }\n\n // East\n if (x < this.width - 1) {\n if (currentBuffer[y][x + 1] === nextValue) {\n return true;\n }\n }\n\n // South\n if (y < this.height - 1) {\n if (currentBuffer[y + 1][x] === nextValue) {\n return true;\n }\n }\n\n // If we've made it this far we're not infected!\n return false;\n }\n\n // Loop through and decide the state of the next generation\n // for each cell processed.\n for (let y = 0; y < this.height; y++) {\n for (let x = 0; x < this.width; x++) {\n if (hasInfectiousNeighbor.call(this, x, y)) {\n backBuffer[y][x] = (currentBuffer[y][x] + 1) % MODULO;\n } else {\n backBuffer[y][x] = currentBuffer[y][x];\n }\n }\n }\n\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n }","function patternCheck(pattern, targetCell, qualityGoal, weight) {\n if (compass >= 0) { // already set\n\treturn (patternCheckOrientation(pattern, targetCell, qualityGoal, weight, compass));\n } else {\n\tvar mismatch;\n\tfor (var o = 0; o < TOTAL_NBRS; o += 2) {\n\t debugme(\"patternCheck: hunting for compass (now \" + compass + \") at \" + o);\n\t mismatch = patternCheckOrientation(pattern, targetCell, qualityGoal, weight, o);\n\t debugme(\"-> got mismatch \" + mismatch + \" and compass \" + compass);\n\t if (compass >= 0) {\n\t\treturn mismatch;\n\t }\n\t}\n\treturn PAT_NOMATCH;\n }\n}","function findAlignmentInRegion(overallEstModuleSize, estAlignmentX, estAlignmentY, allowanceFactor, image) {\r\n\t\t estAlignmentX = Math.floor(estAlignmentX);\r\n\t\t estAlignmentY = Math.floor(estAlignmentY);\r\n\t\t // Look for an alignment pattern (3 modules in size) around where it should be\r\n\t\t var allowance = Math.floor(allowanceFactor * overallEstModuleSize);\r\n\t\t var alignmentAreaLeftX = Math.max(0, estAlignmentX - allowance);\r\n\t\t var alignmentAreaRightX = Math.min(image.width, estAlignmentX + allowance);\r\n\t\t if (alignmentAreaRightX - alignmentAreaLeftX < overallEstModuleSize * 3) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t var alignmentAreaTopY = Math.max(0, estAlignmentY - allowance);\r\n\t\t var alignmentAreaBottomY = Math.min(image.height - 1, estAlignmentY + allowance);\r\n\t\t return alignment_finder_1.findAlignment(alignmentAreaLeftX, alignmentAreaTopY, alignmentAreaRightX - alignmentAreaLeftX, alignmentAreaBottomY - alignmentAreaTopY, overallEstModuleSize, image);\r\n\t\t}","function headerCountLiveNeighbors(board, location){\n var liveNeighbors = 0;\n //check above\n if(board[location - HEADERBOARDWIDTH] === HEADERALIVE && !headerInTopRow(location)){\n liveNeighbors++;\n }\n //check below\n if(board[location + HEADERBOARDWIDTH] === HEADERALIVE && !headerInBottomRow(location)){\n liveNeighbors++;\n }\n //check right\n if(board[location + 1] === HEADERALIVE && !headerInRightColumn(location)){\n liveNeighbors++;\n }\n //check left\n if(board[location - 1] === HEADERALIVE && !headerInLeftColumn(location)){\n liveNeighbors++;\n }\n //check aboveright\n if(board[location - HEADERBOARDWIDTH + 1] === HEADERALIVE && !headerInTopRow(location) && !headerInRightColumn(location)){\n liveNeighbors++;\n }\n //check aboveleft\n if(board[location - HEADERBOARDWIDTH - 1] === HEADERALIVE && !headerInTopRow(location) && !headerInLeftColumn(location)){\n liveNeighbors++;\n }\n //check belowright\n if(board[location + HEADERBOARDWIDTH + 1] === HEADERALIVE && !headerInBottomRow(location) && !headerInRightColumn(location)){\n liveNeighbors++;\n }\n //check belowleft\n if(board[location + HEADERBOARDWIDTH - 1] === HEADERALIVE && !headerInBottomRow(location) && !headerInLeftColumn(location)){\n liveNeighbors++;\n }\n return liveNeighbors;\n}","function findNewState(){\n\n let newState = new Array();\n let prev;\n let anc;\n let next;\n\n for(i = 0; i < cols; i++) {\n\n anc = state[i];\n\n if(i == 0){\n prev = state[state.length-1];\n next = state[i+1];\n }\n else if( i == state.length - 1) {\n prev = state[i-1];\n next = state[0];\n }\n else{\n prev = state[i-1];\n next = state[i+1];\n }\n\n if(prev == 1 && anc == 1 && next == 1) {\n newState[i] = 0;\n }\n else if (prev == 1 && anc == 1 && next == 0) {\n newState[i] = 0;\n }\n else if (prev == 1 && anc == 0 && next == 1) {\n newState[i] = 1;\n }\n else if (prev == 1 && anc == 0 && next == 0) {\n newState[i] = 1;\n }\n else if (prev == 0 && anc == 1 && next == 1) {\n newState[i] = 1;\n }\n else if (prev == 0 && anc == 1 && next == 0) {\n newState[i] = 1;\n }\n else if (prev == 0 && anc == 0 && next == 1) {\n newState[i] = 0;\n }\n else if (prev == 0 && anc == 0 && next == 0) {\n newState[i] = 0;\n }\n }\n state = newState.slice();\n}","function AlignmentPattern(posX, posY, estimatedModuleSize) {\n this.x = posX;\n this.y = posY;\n this.count = 1;\n this.estimatedModuleSize = estimatedModuleSize;\n }","setup() {\n let validStateCount = 0;\n // For each row, allocate a clickable object\n for( let i = 0; i < this.statesTable.getRowCount(); i++ ) {\n let className = this.statesTable.getString(i, 'ClassName');\n \n // if we have an image, we will call setImage() to load that image into that p5.clickable\n if( className === \"\" ) {\n print(\"empty className field in line #\" + i + \" of states file\");\n return false; \n }\n \n // this is the allocator itself\n this.states[validStateCount] = eval(\"new \" + className);\n \n // store name of the state in the PNGRoom\n this.states[validStateCount].setName(this.statesTable.getString(i, 'StateName'));\n\n // All classes (for now) have a PNGFilename, could add a blank room\n this.states[validStateCount].setup( this.statesTable.getString(i, 'PNGFilename'),\n this.statesTable.getString(i, 'CollisionFilename'));\n \n this.states[validStateCount].preload();\n\n validStateCount++;\n }\n \n if( validStateCount > 0 ) {\n this.hasValidStates = true;\n this.currentStateName = this.statesTable.getString(0, 'StateName');\n this.changeState(this.currentStateName,true);\n }\n else {\n this.hasValidStates = false;\n }\n\n return this.hasValidStates;\n }","canWordBePlacedVertical(x, y, state, stateHoriz, stateVert, word){\n let result = false;\n let partialScore = 0;\n\n // Test if we can put the word at x, y, Vertical.\n \n // Test if the star and end position are over invalid state value terminate early.\n let endY = y + word.length - 1;\n if ((stateHoriz.board[x][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n (stateVert.board[x][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n (stateHoriz.board[x][y] == NO_HORIZ_NO_VERT) || \n (stateVert.board[x][y] == NO_HORIZ_NO_VERT) || \n\n (stateHoriz.board[x][endY] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n (stateVert.board[x][endY] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n (stateHoriz.board[x][endY] == NO_HORIZ_NO_VERT) || \n (stateVert.board[x][endY] == NO_HORIZ_NO_VERT) ){\n \n result = false;\n partialScore = 0;\n return [result, partialScore]; \n }\n // Test if the word clash's with the Vertical constrains, for all positions of the previous words placed.\n for (let i = 0; i < word.length; i++) {\n let yi = y + i; \n if ((stateVert.board[x][yi] == VERTICAL) ||\n (stateVert.board[x][yi] == NO_HORIZ_NO_VERT) ||\n (stateHoriz.board[x][yi] == NO_HORIZ_NO_VERT) ||\n (stateVert.board[x][yi] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\n ( (state.board[x][yi] != EMPTY) && (state.board[x][yi] != word[i])) ){\n\n result = false;\n partialScore = 0;\n return [result, partialScore];\n }\n // Calculate the partial score of this move based on the number of crosses between words.\n if ((state.board[x][yi] != EMPTY) && (state.board[x][yi] == word[i])){\n partialScore = partialScore + 1;\n }\n }\n \n result = true;\n return [result, partialScore];\n }","lookupAndMarkFound() {\n let m=0;\n for (let n=1; n<=N; n++) {\n for (let i=0;i {\n let neighborCount = 0;\n\n // Actually count living neighbors\n if (options.border === 'wrap') {\n let north = y - 1;\n let south = y + 1;\n let west = x - 1;\n let east = x + 1;\n\n if (north < 0) north = this.height - 1;\n\n if (south > this.height - 1) south = 0;\n\n if (west < 0) west = this.width - 1;\n\n if (east > this.width - 1) east = 0;\n\n neighborCount = \n currentBuffer[north][west] + \n currentBuffer[north][x] + \n currentBuffer[north][east] + \n currentBuffer[y][west] + \n currentBuffer[y][east] + \n currentBuffer[south][x] + \n currentBuffer[south][east] + \n currentBuffer[south][west];\n\n } else if (options.border === 'nowrap') {\n // Treat out of bounds as zero\n for (let yOffset = -1; yOffset <= 1; yOffset++) {\n let yPos = y + yOffset;\n if (yPos < 0 || yPos >= this.height) continue; // Out of bounds\n\n for (let xOffset = -1; xOffset <= 1; xOffset++) {\n let xPos = x + xOffset;\n if (xPos < 0 || xPos >= this.width) continue; // Out of bounds\n if (yPos === y && xPos === x) continue; // Can't be your own neighbor\n neighborCount += currentBuffer[yPos][xPos];\n }\n }\n } else {\n throw new Error('Unknown border option: ' + options.border);\n }\n return neighborCount;\n }\n\n // Update backBuffer to have the next time state\n for(let y = 0; y < this.height; y++) {\n for (let x = 0; x < this.width; x++) {\n const neighbors = countNeighbors(x, y);\n const thisCell = currentBuffer[y][x];\n\n // Implement GoL rules\n if (thisCell) {\n //Current cell is alive\n if (neighbors < 2 || neighbors > 3) {\n // Death\n backBuffer[y][x] = 0;\n } else {\n // Alive\n backBuffer[y][x] = 1;\n }\n } else {\n // Current cell is dead\n if (neighbors === 3) {\n // A cell is born\n backBuffer[y][x] = 1;\n } else {\n // Still dead\n backBuffer[y][x] = 0;\n }\n }\n }\n }\n\n this.currentBufferIndex = backBufferIndex;\n }","function numIslands(grid) {\n //? Treat matrix as graph, recursive DFS on grid with row, column if land seen \n let count = 0;\n \n function dfs(grid, row, col) {\n if (row < 0 || col < 0 || row >= grid.length || col >= grid.length) return;\n\n let value = grid[row][col];\n if (value === '1') {\n grid[row][col] = '#';\n dfs(grid, row+1, col);\n dfs(grid, row-1, col);\n dfs(grid, row, col-1);\n dfs(grid, row, col+1);\n }\n }\n\n for (let i = 0; i < grid.length; i++) {\n for (let j = 0; j < grid[0].length; j++) {\n if (grid[i][j] === '1') {\n count++;\n dfs(grid, i, j);\n }\n }\n }\n return count;\n}","noOfScan() {\n\n return new Promise(async (resolve, reject) => {\n\n let imgBytes = await this.toIntegerArray();\n\n let scanCount = 0;\n \n let SOS = this.SOS;\n\n let imgBytesLength = imgBytes.length;\n \n //0xFFDA\n for (let i = 0; i < imgBytesLength; i = i + 2) {\n //0xFFDA\n if (imgBytes[i] === SOS[0] && imgBytes[i + 1] === SOS[1]) {\n scanCount++;\n }\n }\n \n resolve(scanCount);\n });\n }","function count_islands(emap) {\n \n const len = array_length(emap);\n const height = array_length(emap[0]);\n \n let visited = [];\n\n // Generate the visited 2D array -> This is to check whether the cell \n // has already been checked\n for (let i = 0; i < len; i = i + 1) {\n visited[i] = [];\n for (let j = 0; j < height; j = j + 1) {\n visited[i][j] = false;\n }\n }\n \n // Check whether the neighboring cells are valid \n function isSafe(emap, row, col, visited) {\n // Check there is no negative / overflow index\n return row >= 0 && row < len && col >= 0 && col < height \n && emap[row][col] > 0 && !visited[row][col];\n }\n \n\n // Apply Depth-First search and treat the 2D array as a graph\n function dfs(emap, row, col, visited) {\n // Mark this cell as visited\n visited[row][col] = true;\n for (let i = -1; i <= 1; i = i + 1) {\n for (let j = -1; j <= 1; j = j + 1) {\n if ((i === -1 && j === 0) ||\n (i === 0 && j === -1) ||\n (i === 0 && j === 1) ||\n (i === 1 && j === 0)) {\n if(isSafe(emap, row + i, col + j, visited)) {\n dfs(emap, row + i, col + j, visited);\n } else {\n \n }\n } else {\n \n }\n }\n }\n \n }\n\n \n let counter = 0;\n \n // Trying to check the number of connected graphs\n for (let i = 0; i < len; i = i + 1) {\n for (let j = 0; j < len; j = j + 1) {\n if (emap[i][j] > 0 && !visited[i][j]) {\n // Check\n dfs(emap, i, j, visited);\n counter = counter + 1;\n } else {\n \n }\n }\n }\n\n return counter;\n}","function horizontalWinCheck() {\r\n for (var row = 0; row < 6; row++) {\r\n for (var col = 0; col < 4; col++) {\r\n if (colorMatchCheck(returnColor(row,col), returnColor(row,col+1) ,returnColor(row,col+2), returnColor(row,col+3))) {\r\n console.log('horiz');\r\n reportWin(row,col);\r\n return true;\r\n }else {\r\n continue;\r\n }\r\n }\r\n }\r\n}","_calcCellState(pos){\n var cell=pos.split(':');\n var x=Number (cell[0]);\n var y=Number (cell[1]);\n var currState=this._getCellState(x, y);\n // Get adjacent cells\n var sum=0;\n sum+=this._getCellState(x-1, y-1);\n sum+=this._getCellState(x, y-1);\n sum+=this._getCellState(x+1, y-1);\n sum+=this._getCellState(x-1, y);\n sum+=this._getCellState(x+1, y);\n sum+=this._getCellState(x-1, y+1);\n sum+=this._getCellState(x, y+1);\n sum+=this._getCellState(x+1, y+1);\n\n // Living cell\n if(currState===1){\n // < 2 live neighbors\n if(sum<2){return false;}\n // 2 or 3\n if(sum===2 || sum===3){return true;}\n // > 3\n if(sum>3){return false;}\n }else{\n if(sum===3){return true;}\n }\n return false\n }","function decide() {\n\t\t\t\tvar recognise = false;\n\t\t\t\tif(fromAbove && fromBelow) {\n\t\t\t\t\tif(fromAbove == fromBelow) {\n\t\t\t\t\t\talert(\"Pattern recognized\");\n\t\t\t\t\t\t// window['Cortex'].grid[self.childAddress[i].x][self.childAddress[i].y][self.childAddress[i].z](fromBelow);\n\t\t\t\t\t} else {\n\t\t\t\t\t\talert(\"Pattern not recognized\");\n\t\t\t\t\t\t// window['Cortex'].grid[self.parentAddress.x][self.parentAddress.y][self.parentAddress.z](fromBelow);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}","function match_pattern(state, pattern, player) {\n for(var idx1 = 0; idx1 < state.length; idx1++) {\n for(var idx2 = 0; idx2 < state[idx1].length; idx2++) {\n var matches = match_pattern_at(state, pattern, player, idx1, idx2);\n if(matches) {\n return true;\n }\n }\n }\n return false;\n}","function checkFlaggedMatrix(x,y) {\n count = 0;\n for (i=x-1; i<=x+1; i++) {\n for (j=y-1; j<=y+1; j++) {\n if ((i!=x) || (j!=y)) { //Don't check center point\n count = count + checkFlagged(i,j); } } }\n return count; }","function checkDiag(i, j, state) {\n //\t\tSystem.out.println(\"Diagnose starts!!!!!!!! I \" + i + \" j \" + j);\n var countb = 0;\n var countw = 0;\n var diagChoice = -1;\n if (i == j) {\n diagChoice = 1;\n } else if (i + j == 5) {\n diagChoice = 2;\n } else {\n return 0;\n }\n var tempb = [];\n var tempw = [];\n for (var k = 0; k < 6; k ++) {\n var l = k;\n if (diagChoice == 2) {\n l = 5 - k;\n }\n if (state[k][l] == 'b') {\n countb ++;\n tempw.push(countw);\n countw =0;\n } else if (state[k][l] == 'w'){\n countw ++;\n tempb.push(countb);\n countb = 0;\n } else {\n tempw.push(countw);\n countw =0;\n tempb.push(countb);\n countb =0;\n }\n }\n tempw.push(countw);\n countw =0;\n tempb.push(countb);\n countb =0;\n tempb.sort(function(a,b) {return b-a});\n tempw.sort(function(a,b) {return b-a});\n resultB[diagChoice + 11] = tempb[0];\n resultW[diagChoice + 11] = tempw[0];\n }","function checkOverlapse(direction) {\n\t\textraTop = newTop;\n\t\textraLeft = newLeft;\n\t\t\n\t\tlet overlapRows = false;\n\t\t let overlapCols = false;\n\t\t\n\t\tif (currTopPx % dimension != 0)\n\t\t\toverlapRows = true;\n\t\tif (currLeftPx % dimension != 0)\n\t\t\toverlapCols = true;\n\t\t\n\t\tswitch(direction) {\n\t\t\tcase leftKey:\n\t\t\tcase rightKey:\t \n\t\t\t\tif (overlapRows)\n\t\t\t\t\textraTop = newTop + 1;\n\t\t\t\tbreak;\n\t\n\t\t\tcase upKey:\n\t\t\tcase downKey: \n\t\t\t\tif (overlapCols)\n\t\t\t\t\textraLeft = newLeft + 1;\n\t\t\t\tbreak;\t\t\t\t\t\t\n\t\t}\n\t}","scan() {\n \n this.clearBuffer();\n var currentState = 0;\n var token, reservedToken;\n \n //loop through until stream has no more characters.\n do {\n \n let actionBlock = this.lookupState(currentState,this.currentChar);\n log.debug(\"[Scanner] CurrentState:\",currentState,\",CurrentChar:\",this.currentChar,\",NextChar:\",this.nextChar,\",ActionState:\",actionBlock.state,\",TokenBuffer:\",this.tokenBuffer);\n \n switch (actionBlock.action) {\n case Action.ERROR:\n //TODO a thing here\n break;\n case Action.MOVE_APPEND:\n currentState = actionBlock.state;\n this.tokenBuffer += this.currentChar;\n this.consumeChar();\n break;\n case Action.MOVE_NOAPPEND:\n currentState = actionBlock.state;\n this.consumeChar();\n break;\n case Action.HALT_APPEND:\n token = this.lookupCode(actionBlock.state);\n this.tokenBuffer += this.currentChar;\n reservedToken= this.checkExceptions(this.tokenBuffer);\n this.consumeChar();\n if (reservedToken !== undefined) {\n return reservedToken;\n } else if (token !== undefined && !token.skip) {\n return token.code;\n } else {\n //reset and keep moving\n this.clearBuffer();\n currentState = 0;\n }\n break;\n case Action.HALT_NOAPPEND:\n token = this.lookupCode(actionBlock.state);\n reservedToken = this.checkExceptions(this.tokenBuffer);\n this.consumeChar();\n if (reservedToken !== undefined) {\n return reservedToken;\n } else if (token.code !== undefined && !token.skip) {\n return token.code;\n } else {\n //reset and keep moving\n this.clearBuffer();\n currentState = 0;\n }\n break;\n case Action.HALT_REUSE:\n token = this.lookupCode(actionBlock.state);\n reservedToken = this.checkExceptions(this.tokenBuffer);\n if (reservedToken !== undefined) {\n return reservedToken;\n } else if (token.code !== undefined && !token.skip) {\n return token.code;\n } else {\n //reset and keep moving\n this.clearBuffer();\n currentState = 0;\n }\n break;\n }\n \n } while (this.currentChar !== null || this.tokenBuffer);\n \n return \"EofSym\";\n\n }","function checkForHorizontalMatches(grid, height, width){\n xMatchList = [];\n for (var a = 0; a < grid.length; a++){\n for (var b = 0; b < grid[a].length; b++){\n if (grid[a][b-1]){\n if (grid[a][b].stoneColor != grid[a][b-1].stoneColor){\n if (grid[a][b+1]){\n if (grid[a][b].stoneColor == grid[a][b + 1].stoneColor){\n var count = 1;\n var matches = [];\n matches.push(grid[a][b]);\n while (grid[a][b + count] != null && grid[a][b].stoneColor == grid[a][b + count].stoneColor){\n matches.push(grid[a][b + count]);\n count++;\n }\n if (matches.length >= 3){\n xMatchList.push(matches);\n }\n }\n }\n }\n }\n }\n }\n return xMatchList;\n }","getAlignmentPatternCoOrdinates() {\n let allign = null;\n switch ((this.mVersion)) {\n case 2:\n allign = [6, 18];\n break;\n case 3:\n allign = [6, 22];\n break;\n case 4:\n allign = [6, 26];\n break;\n case 5:\n allign = [6, 30];\n break;\n case 6:\n allign = [6, 34];\n break;\n case 7:\n allign = [6, 22, 38];\n break;\n case 8:\n allign = [6, 24, 42];\n break;\n case 9:\n allign = [6, 26, 46];\n break;\n case 10:\n allign = [6, 28, 50];\n break;\n case 11:\n allign = [6, 30, 54];\n break;\n case 12:\n allign = [6, 32, 58];\n break;\n case 13:\n allign = [6, 34, 62];\n break;\n case 14:\n allign = [6, 26, 46, 66];\n break;\n case 15:\n allign = [6, 26, 48, 70];\n break;\n case 16:\n allign = [6, 26, 50, 74];\n break;\n case 17:\n allign = [6, 30, 54, 78];\n break;\n case 18:\n allign = [6, 30, 56, 82];\n break;\n case 19:\n allign = [6, 30, 58, 86];\n break;\n case 20:\n allign = [6, 34, 62, 90];\n break;\n case 21:\n allign = [6, 28, 50, 72, 94];\n break;\n case 22:\n allign = [6, 26, 50, 74, 98];\n break;\n case 23:\n allign = [6, 30, 54, 78, 102];\n break;\n case 24:\n allign = [6, 28, 54, 80, 106];\n break;\n case 25:\n allign = [6, 32, 58, 84, 110];\n break;\n case 26:\n allign = [6, 30, 58, 86, 114];\n break;\n case 27:\n allign = [6, 34, 62, 90, 118];\n break;\n case 28:\n allign = [6, 26, 50, 74, 98, 122];\n break;\n case 29:\n allign = [6, 30, 54, 78, 102, 126];\n break;\n case 30:\n allign = [6, 26, 52, 78, 104, 130];\n break;\n case 31:\n allign = [6, 30, 56, 82, 108, 134];\n break;\n case 32:\n allign = [6, 34, 60, 86, 112, 138];\n break;\n case 33:\n allign = [6, 30, 58, 86, 114, 142];\n break;\n case 34:\n allign = [6, 34, 62, 90, 118, 146];\n break;\n case 35:\n allign = [6, 30, 54, 78, 102, 126, 150];\n break;\n case 36:\n allign = [6, 24, 50, 76, 102, 128, 154];\n break;\n case 37:\n allign = [6, 28, 54, 80, 106, 132, 158];\n break;\n case 38:\n allign = [6, 32, 58, 84, 110, 136, 162];\n break;\n case 39:\n allign = [6, 26, 54, 82, 110, 138, 166];\n break;\n case 40:\n allign = [6, 30, 58, 86, 114, 142, 170];\n break;\n }\n return allign;\n }","neighborCount(mtx, x, y) {\n var count = 0;\n for (var i = -1 ; i <= 1 ; i++) {\n for (var j = -1 ; j <= 1 ; j++) {\n if ((0 < (x+i)) && ((x+i) < this.width)\n && (0 < (y+j)) && ((y+j) < this.height)) {\n if (0 != mtx[y+j][x+i]) {\n count += 1;\n }\n }\n }\n }\n if (0 < count) {\n console.log(\"neighborCount(\", x, y, \") = \", count);\n }\n return count;\n }","function horizontalWinCheck() {\n for(var row=0;row<6;row++) {\n for(var col = 0;col < 4;col++){\n if(colorMatchCheck(returnColor(row,col), returnColor(row,col+1), returnColor(row,col+2))) {\n console.log('horizontal');\n reportWin(row,col);\n return true;\n }else {\n continue;\n }\n }\n }\n}","function verify_state() {\n let s=read_state();\n\n let cnt=Array(10).fill(0);\n for(let j=0;j<3;++j)\n for(let i=0;i<3;++i) {\n let pos=\"Row \"+j+\", Col \"+i;\n if(isNaN(s.grid[j][i])) {\n helper_log_write(pos+\" is not a number\");\n return false;\n }\n if(s.grid[j][i] < 0 || s.grid[j][i] > 8) {\n helper_log_write(pos+\" is out of range\");\n return false;\n }\n ++cnt[s.grid[j][i]];\n }\n \n for(let i=0;i<9;++i) {\n let val=\"\"+i;\n if(i==0) val=\"blank\";\n if(cnt[i]==0) {\n helper_log_write(\"Missing \"+val);\n return false;\n }\n if(cnt[i]>1) {\n helper_log_write(\"Too many \"+val+\"s\");\n return false;\n }\n }\n \n //Count inversions to see if puzzle is solveable\n let inv=0;\n let g=[];\n for(let j=0;j<3;++j)\n for(let i=0;i<3;++i)\n g.push(s.grid[j][i]);\n g=g.filter(function(x){return x>0;});\n for(let i=0;i<8;++i)\n for(let j=i+1;j<8;++j)\n if(g[i]>g[j]) ++inv;\n if(inv%2==0) {\n helper_log_write(\"Not solveable\");\n return false;\n }\n \n return true;\n}","function countSameColorIcons(startIcon, moveX, moveY) {\n\n var curX = startIcon.posX + moveX;\n var curY = startIcon.posY + moveY;\n var count = 0;\n\n while (curX >= 0 && curY >= 0 && curX < BOARD_COLS && curY < BOARD_ROWS && getIconColor(getIcon(curX, curY)) === getIconColor(startIcon))\n {\n count++;\n curX += moveX;\n curY += moveY;\n }\n\n return count;\n\n}","function check_counts(p) {\n //checks the rows and columns for the number of X's or O's\n for (var i = 0; i < 3; i++) {\n if (tempboard[(0 + i)] == p) {\n countrow0++;\n }\n if (tempboard[(3 + i)] == p) {\n countrow1++;\n }\n if (tempboard[(6 + i)] == p) {\n countrow2++;\n }\n if (tempboard[(i * 3 + 0)] == p) {\n countcol0++;\n }\n if (tempboard[(i * 3 + 1)] == p) {\n countcol1++;\n }\n if (tempboard[(i * 3 + 2)] == p) {\n countcol2++;\n }\n }\n //checks the diagonals for the number of X's or O's\n if (tempboard[0] == p) {\n countdiag1++;\n }\n if (tempboard[4] == p) {\n countdiag1++;\n countdiag2++;\n }\n if (tempboard[8] == p) {\n countdiag1++;\n }\n if (tempboard[2] == p) {\n countdiag2++;\n }\n if (tempboard[6] == p) {\n countdiag2++;\n }\n\n // if a row, column or diagonal has 3 X's or O's, we have a winner!\n if (countrow0 == 3 || countrow1 == 3 || countrow2 == 3 || countcol0 == 3 || countcol1 == 3 || countcol2 == 3 || countdiag1 == 3 || countdiag2 == 3) has_won = true;\n}","function searchOnDnaMatrix(dna, sequence, row, col, matchesFound) {\n var numSeq = 0;\n\n // try to search sequence only if the letter from the dna is part of the sequence\n // as the first position is already matched, start from the next one\n if (dna[row][col] === sequence[0]) {\n // there are only 4 possible directions to search: horizontal, vertical, main diagonal and secondary diagonal\n\n // Horizontal matches\n var n;\n var positions = [row + ',' + col];\n for (n = 1; n < sequence.length; n++) {\n if (col + n >= dna.length || col + n < 0) \n break;\n\n if (typeof dna[row][col + n] === 'undefined' || dna[row][col + n] !== sequence[n])\n break;\n\n positions.push( row + ',' + (col + n) );\n }\n\n // if the length of the sequence has the same value as n (length of the sequence in the dna) increment numSeq\n if (sequence.length === n) {\n numSeq++;\n matchesFound[sequence].push( positions );\n }\n\n // Vertical matches\n for (n = 1; n < sequence.length; n++) {\n if (row + n >= dna.length || row + n < 0) \n break;\n\n if (typeof dna[row + n][col] === 'undefined' || dna[row + n][col] !== sequence[n])\n break;\n\n positions.push( (row + n) + ',' + col );\n }\n\n // if the length of the sequence has the same value as n (length of the sequence in the dna) increment numSeq\n if (sequence.length === n) {\n numSeq++;\n matchesFound[sequence].push( positions );\n }\n\n // Main diagonal matches \n for (n = 1; n < sequence.length; n++) {\n if (row + n >= dna.length || row + n < 0 || col + n >= dna.length || col + n < 0) \n break;\n\n if (typeof dna[row + n][col + n] === 'undefined' || dna[row + n][col + n] !== sequence[n])\n break;\n\n positions.push( (row + n) + ',' + (col + n) );\n }\n\n // if the length of the sequence has the same value as n (length of the sequence in the dna) increment numSeq\n if (sequence.length === n) {\n numSeq++;\n matchesFound[sequence].push( positions );\n }\n\n // Secondary diagonal matches \n for (n = 1; n < sequence.length; n++) {\n if (row - n >= dna.length || row - n < 0 || col + n >= dna.length || col + n < 0) \n break;\n\n if (typeof dna[row - n][col + n] === 'undefined' || dna[row - n][col + n] !== sequence[n])\n break;\n\n positions.push( (row - n) + ',' + (col + n) );\n }\n\n // if the length of the sequence has the same value as n (length of the sequence in the dna) increment numSeq\n if (sequence.length === n) {\n numSeq++;\n matchesFound[sequence].push( positions );\n }\n\n }\n\n return numSeq; \n}","function NumberOfIsland(grid) {\n let n, m, count = 0;\n n = grid.length;\n if (n <= 0) return 0;\n m = grid[0].length;\n for (let i = 0; i < n; i++){\n for (let j = 0; j < m; j++) {\n if(grid[i][j] === \"1\"){\n DFSMark(grid, i, j);\n count++;\n }\n }\n }\n return count;\n}","Board_Evaluation(board, color) {\n let result = { two: 0, three: 0, four: 0 };\n\n for (var i = 0; i < 6; i++) {\n for (var j = 0; j < 7; j++) {\n if (board[i][j] === color) {\n let x = j;\n let y = i;\n let arr = [\n this.search2(x, y, color, 1, 0, 0, board),\n this.search2(x, y, color, -1, 0, 0, board),\n this.search2(x, y, color, 1, 1, 0, board),\n this.search2(x, y, color, -1, -1, 0, board),\n this.search2(x, y, color, -1, 1, 0, board),\n this.search2(x, y, color, 1, -1, 0, board),\n this.search2(x, y, color, 0, 1, 0, board),\n this.search2(x, y, color, 0, -1, 0, board),\n ];\n\n for (var q = 0; q < 4; q++) {\n switch (arr[2 * q].count + arr[2 * q + 1].count - 1) {\n case 2:\n if (arr[2 * q].live) result.two++;\n break;\n\n case 3:\n if (arr[2 * q].live + arr[2 * q + 1].live > 0) {\n result.three++;\n } else if (\n arr[2 * q].live + arr[2 * q + 1].live ===\n 2\n ) {\n console.log(1);\n result.four++;\n }\n break;\n\n case 4:\n result.four++;\n break;\n }\n }\n }\n }\n }\n return result;\n }","function findInSequence() {\n\tvar beginMatch = 0;\n\tvar endMatch = 0;\n\tvar i = 0;\n\tvar specChar = RegExp('[X]');\n\tvar test = specChar.exec(searchMotif);\n\tconsole.log(test);\n\tvar xs = [];\n\tvar generalCase = false;\n\tvar splitMotif = searchMotif.split(\"\");\n\tif (test != null && searchMotif.length >= 2){\n\t\t\n\t\tfor (var i = 0; i < searchMotif.length; i++){\n\t\t\tvar char = searchMotif.charAt(i);\n\t\t\tif(char == \"X\"){\n\t\t\t\txs.push(i);\n\t\t\t}\n\t\t}\n\t\tgeneralCase = true;\n\t}\nwhile (endMatch < seq.length){\n\tendMatch = beginMatch + searchMotif.length;\n\tvar currentlyChecked = seq.substring(beginMatch, endMatch);\n\t//check for spaces or new lines within the search portion of the sequence\n\tif(generalCase){\n\t\tvar currCheckedSplit = currentlyChecked.split(\"\");\n\t\t//process out x's\n\t\tfor(var i = 0; i < splitMotif.length; i++){\n\t\t\tif(xs[i] != null){\n\t\t\tcurrCheckedSplit.splice(xs[i],1,\"X\");\n\t\t\t}\n\t\t}\n\t\tcurrentlyChecked = currCheckedSplit.join(\"\");\n\t}\n\tif(currentlyChecked === searchMotif){\n\t\tvar indices = [beginMatch, endMatch];\n\t\tindicesOfMatches.push(indices);\n\t\tbeginMatch = endMatch;\n\t}\n\telse{\n\t\tbeginMatch++;\n\t}\n\tcurrentlyChecked = \"\";\n}\n\tinsertHighlightSpans();\n}","_getPartOfCount() {\n\n // 8-neighborhood around\n const n = [\n Point.val(this.x - 1, this.y - 1),\n Point.val(this.x - 1, this.y),\n Point.val(this.x - 1, this.y + 1),\n Point.val(this.x, this.y - 1),\n Point.val(this.x, this.y + 1),\n Point.val(this.x + 1, this.y - 1),\n Point.val(this.x + 1, this.y),\n Point.val(this.x + 1, this.y + 1),\n ];\n\n const edges = n.filter(p => p === '-' || p === '|').length;\n const ind = [];\n for (let i = 0; i < 8; i++) {\n if (n[i] === '-' || n[i] === '|') ind.push(i);\n }\n\n switch (edges) {\n\n case 2:\n switch (ind[0]) {\n case 1: \n return ind[1] === 3 ? (n[0] === n[7] ? 2 : 1) : (n[2] === n[5] ? 2 : 1);\n case 3: \n return n[2] === n[5] ? 2 : 1;\n case 4: \n return n[0] === n[7] ? 2 : 1;\n }\n\n case 3: \n return n.filter(p => p === ' ').length === 5 ? 3 : 2;\n\n case 4:\n return n.filter(p => p === ' ').length;\n }\n }","screenAlignmentPattern() {\n // prepare cell data\n const cell = new CellData();\n cell.content = 1 << 22 /* WIDTH_SHIFT */ | 'E'.charCodeAt(0);\n cell.fg = this._curAttrData.fg;\n cell.bg = this._curAttrData.bg;\n const buffer = this._bufferService.buffer;\n this._setCursor(0, 0);\n for (let yOffset = 0; yOffset < this._bufferService.rows; ++yOffset) {\n const row = buffer.ybase + buffer.y + yOffset;\n const line = buffer.lines.get(row);\n if (line) {\n line.fill(cell);\n line.isWrapped = false;\n }\n }\n this._dirtyRowService.markAllDirty();\n this._setCursor(0, 0);\n return true;\n }","checkForMatch() {\n\n // Matching horizontal lines\n if(this._topLeft.textContent === 'X' || this._topLeft.textContent === '0') {\n \n if(this._topLeft.textContent === this._topMiddle.textContent && this._topMiddle.textContent === this._topRight.textContent) {\n this._topLeft.style.backgroundColor = 'green'\n this._topMiddle.style.backgroundColor = 'green'\n this._topRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n if(this._middleLeft.textContent === 'X' || this._middleLeft.textContent === '0') {\n \n if(this._middleLeft.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._middleRight.textContent) {\n this._middleLeft.style.backgroundColor = 'green'\n this._middleMiddle.style.backgroundColor = 'green'\n this._middleRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n if(this._bottomLeft.textContent === 'X' || this._bottomLeft.textContent === '0') {\n \n if(this._bottomLeft.textContent === this._bottomMiddle.textContent && this._bottomMiddle.textContent === this._bottomRight.textContent) {\n this._bottomLeft.style.backgroundColor = 'green'\n this._bottomMiddle.style.backgroundColor = 'green'\n this._bottomRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n // Matching vertical lines\n if(this._topLeft.textContent === 'X' || this._topLeft.textContent === '0') {\n \n if(this._topLeft.textContent === this._middleLeft.textContent && this._middleLeft.textContent == this._bottomLeft.textContent) {\n this._topLeft.style.backgroundColor = 'green'\n this._middleLeft.style.backgroundColor = 'green'\n this._bottomLeft.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n if(this._topMiddle.textContent === 'X' || this._topMiddle.textContent === '0') {\n \n if(this._topMiddle.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent == this._bottomMiddle.textContent) {\n this._topMiddle.style.backgroundColor = 'green'\n this._middleMiddle.style.backgroundColor = 'green'\n this._bottomMiddle.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n\n if(this._topRight.textContent === 'X' || this._topRight.textContent === '0') {\n \n if(this._topRight.textContent === this._middleRight.textContent && this._middleRight.textContent == this._bottomRight.textContent) {\n this._topRight.style.backgroundColor = 'green'\n this._middleRight.style.backgroundColor = 'green'\n this._bottomRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n \n // Matching diagonal lines\n if(this._middleMiddle.textContent === 'X' || this._middleMiddle.textContent === '0') {\n \n if(this._topLeft.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._bottomRight.textContent) {\n this._topLeft.style.backgroundColor = 'green'\n this._middleMiddle.style.backgroundColor = 'green'\n this._bottomRight.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n\n if(this._topRight.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._bottomLeft.textContent) {\n this._topRight.style.backgroundColor = 'green'\n this._middleMiddle.style.backgroundColor = 'green'\n this._bottomLeft.style.backgroundColor = 'green'\n\n this.finishTheGame();\n }\n }\n }","function treasureIsland(grid) {\n\tlet queue = [];\n\tlet directions = [\n\t\t[-1, 0],\n\t\t[1, 0],\n\t\t[0, 1],\n\t\t[0, -1]\n\t];\n\tlet count = 0;\n\tqueue.push([0, 0]);\n\twhile (queue.length !== 0) {\n\t\tcount++;\n\t\tlet size = queue.length;\n\t\tfor (let i = 0; i < size; i++) {\n\t\t\tlet [startR, startC] = queue.shift();\n\t\t\tfor (let [dr, dc] of directions) {\n\t\t\t\tlet r = startR + dr;\n\t\t\t\tlet c = startC + dc;\n\t\t\t\tif (r >= 0 && r < grid.length && c >= 0 && c < grid[0].length) {\n\t\t\t\t\tif (grid[r][c] === 'X') {\n\t\t\t\t\t\treturn count;\n\t\t\t\t\t}\n\t\t\t\t\tif (grid[r][c] === 'O') {\n\t\t\t\t\t\tgrid[r][c] = 'D'; //make sure not going there again\n\t\t\t\t\t\tqueue.push([r, c]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}","step() {\n // !!!! IMPLEMENT ME !!!!\n let currentBuffer = this.cells[this.currentBufferIndex];\n let backBuffer = this.cells[this.currentBufferIndex === 0 ? 1 : 0];\n\n function countNeighbors(row, col) {\n let neighborCount = 0;\n\n for (let rowOffset = -1; rowOffset <= 1; rowOffset++) {\n let rowPos = row + rowOffset;\n\n if (rowPos < 0 || rowPos === this.height) {\n continue;\n }\n\n for (let colOffset = -1; colOffset <= 1; colOffset++) {\n let colPos = col + colOffset;\n\n if (colPos < 0 || colPos === this.width) {\n continue;\n }\n \n if (colOffset === 0 && rowOffset === 0) { // Current cell\n continue;\n }\n\n if (currentBuffer[rowPos][colPos] === 1) {\n neighborCount++;\n }\n }\n }\n return neighborCount;\n };\n\n for (let r = 0; r < this.height; r++) {\n for (let c = 0; c < this.width; c++) {\n let neighborCount = countNeighbors.call(this, r, c);\n\n if (currentBuffer[r][c] === 1) {\n if (neighborCount < 2 || neighborCount > 3) {\n backBuffer[r][c] = 0;\n } else {\n backBuffer[r][c] = 1;\n }\n } else {\n if (neighborCount === 3) {\n backBuffer[r][c] = 0;\n } else {\n backBuffer[r][c] = 1;\n }\n }\n }\n }\n\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n }","function islands(matrix){\n \n var count = 0;\n function traverse(x, y,count){\n \n if (x < 0 || y < 0 || x >= matrix[0].length || y >= matrix.length){\n return;\n } else if(matrix[y][x] === 0){\n \n \n \n return;\n \n }else if(matrix[y][x] === 0 && matrix[y][x+1] === 0){\n \n \n traverse(x+1,y,count);\n \n \n }else if(matrix[y][x] === 0 && matrix[y][x -1] === 0){\n \n \n traverse(x-1,y,count);\n \n \n }else if(matrix[y][x] === 0 && matrix[y+1][x] === 0){\n \n \n traverse(x,y+1,count);\n \n \n }else if(matrix[y][x] === 0 && matrix[y-1][x] === 0){\n \n \n traverse(x,y-1,count);\n \n \n }\n \n if(matrix[y][x] == 1){\n count++;\n matrix[y][x] = 0;\n console.log(x + '_' + y);\n \n traverse(x,y-1,count);\n traverse(x+1,y,count);\n traverse(x,y + 1,count);\n traverse(x-1, y,count);\n \n \n }\n \n \n let object = {\"X\":x,\"Y\":y};\n \n return count;\n }\n \n console.log(traverse(0, 0,count));\n \n \n}","function lookAhead(input,stateInformation) {\n let totalLength = input.length;\n let state = stateInformation.state.currentState;\n let idx = stateInformation.currentIndex;\n var result = undefined;\n while (state === stateInformation.state.currentState && idx < totalLength){\n let c = input.charAt(idx);\n if (stateInformation.state.transitions[stateInformation.state.currentState].lookFor.has(c)){\n stateInformation.state.currentState = stateInformation.state.nextState;\n if (stateInformation.state.currentState != stateInformation.finalState){\n stateInformation.state.nextState++;\n stateInformation.currentIndex = idx;\n stateInformation.capturedInformation = c;\n }\n else{\n stateInformation.done = true;\n }\n result = stateInformation;\n\n } else {\n idx++; \n }\n }\n return result;\n}","function getCount(possibility_matrix, count_arr, len) {\n let turn_1_index = 0;\n let turn_1_count = count_arr[0];\n let turn_2_count = 0;\n for (let i = 0; i < count_arr.length; i++) {\n if (count_arr[i] > turn_1_count) {\n turn_1_count = count_arr[i];\n turn_1_index = i;\n }\n }\n if (count_arr.length > 1) {\n let catched_salmon_arr = [];\n for (let i = 0; i < possibility_matrix[turn_1_index].length; i++) {\n if (possibility_matrix[turn_1_index][i]) {\n catched_salmon_arr[i] = true;\n }\n }\n // console.log(catched_salmon_arr, turn_1_index, turn_1_count);\n let turn_2_index;\n for (let i = 0; i < catched_salmon_arr.length; i++) {\n if (catched_salmon_arr[i]) {\n continue;\n } else {\n turn_2_index = i;\n turn_2_count = count_arr[i];\n break;\n }\n }\n\n for (let i = 0; i < count_arr.length; i++) {\n if (!catched_salmon_arr[i] && count_arr[i] > turn_2_count && (count_arr[i] + turn_1_count) <= len && checkNoneOfCurrentGroupCatched(possibility_matrix[i])) {\n turn_2_index = i;\n turn_2_count = count_arr[i];\n }\n }\n // console.log(catched_salmon_arr, turn_2_index, turn_2_count);\n } else {\n turn_2_count = 0; // turn 2 not possible\n }\n console.log(turn_1_count + turn_2_count);\n}","getSize() {\n\t\tlet pattern = this.getPattern();\n\t\tlet highestRow = 0;\n\t\tlet highestCol = 0;\n\t\tfor(let block of pattern){\n\t\t\tlet row = block[0] + 1;\n\t\t\tlet col = block[1] + 1;\n\n\t\t\tif(row >= highestRow){\n\t\t\t\thighestRow = row;\n\t\t\t}\n\t\t\tif(col >= highestCol){\n\t\t\t\thighestCol = col;\n\t\t\t}\n\n\t\t}\n\t\tthis.width = highestCol;\n\t\tthis.height = highestRow;\n\t}","function matchPattern(pattern,genome) {\n //console.log(pattern);\n //console.log(genome);\n //console.log(\"genome length : \" + genome.length);\n var positions = [];\n for(var i=0;i<=genome.length-pattern.length;i++) {\n var str = computeText(genome,i,pattern.length);\n // console.log(str);\n if(str==pattern) {\n positions.push(i);\n }\n }\n return positions;\n /*\n var output = \"\";\n for(var i=0;i -1) { \n adj_lr[0] = A*regions[r].height;\n adj_lr[1] = A*regions[r].width;\n adj_ul[0] = -1*A*regions[r].height;\n adj_ul[1] = -1*A*regions[r].width;\n } \n \n // Now, use the adjusted region boundaries in the test\n //\n if (y >= regions[r].ul[0]+adj_ul[0] && y <= regions[r].lr[0]+adj_lr[0] && // These checks are for a graphics coordinate\n x >= regions[r].ul[1]+adj_ul[1] && x <= regions[r].lr[1]+adj_lr[1] ) { // system with (0,0) in the top left\n regions[r].count += 1; \n occupied.push(r); \n }\n } \n return occupied; \n}","update(when) {\n console.log(\"input mtx bit count: \",\n this.bitCount(this.input_matrix()));\n console.log(\"output mtx bit count: \",\n this.bitCount(this.output_matrix()));\n this.compute_next_mtx(this.output_matrix(), this.input_matrix());\n this.sc.update();\n }","function checkIslands(matrix) {\n let count = 0;\n \n for (let i = 0; i < matrix.length; i++) {\n for (let j = 0; j < matrix[i].length; j++) {\n // if we hit 1\n if (matrix[i][j] == 1) {\n // and our top and left is either zero or outside the area\n if ((i - 1) < 0 || matrix[i - 1][j] === 0 &&\n (j - 1) < 0 || matrix[i][j - 1] === 0) {\n count++;\n }\n }\n }\n }\n \n /*\n if (matrix[i][j] == '1'):\n \n if ((i == 0 or matrix[i - 1][j] == 'O') and\n (j == 0 or matrix[i][j - 1] == 'O')):\n count = count + 1\n \n \n \n \n */\n \n \n \n \n \n return count;\n }","function vis_shift_and(p, text) {\n $(\"#the-haystack\").html(\"\");\n $(\"#the-needle\").html(\"\").css('left', 'inherit');\n $(\"#bitmask-table\").html(\"\");\n $(\"#match-run pre\").html(\"\");\n\n var b = {};\n var l = p.length;\n var tl = text.length;\n var alphabet = [];\n\n // initialize bitmask table\n // build alphabet array\n for (var i = 0; i < l; i++) {\n var ch = p.charAt(i);\n add_to_alphabet(alphabet, ch);\n b[ch] = 0;\n }\n\n //build bitmask table;\n for (var i = 0; i < l; i++) {\n b[p.charAt(i)] = b[p.charAt(i)] | (1 << i);\n }\n\n for (var i = 0; i < alphabet.length; i++) {\n var padded = pad_num(l, b[alphabet[i]].toString(2));\n display_mask(alphabet[i], padded);\n }\n \n display_mask('*', pad_num(l, (0).toString(2)));\n\n display_text(text);\n display_pattern(p);\n \n tx_as_array = text.split(\"\");\n\n var haystack_pos = $(\"#the-haystack\").position();\n var d = 0;\n var matchMask = 1 << l-1;\n var text_index = 0;\n var pat_letter_index = -1;\n\n function read_next_char(d, matchMask, text_index) {\n var ch = tx_as_array.shift();\n\n $.when(do_shift(d), get_from_table(b, ch)).done(function(shifted, from_table) {\n var d2 = shifted & from_table;\n\n function display_shift_table() {\n var deferred = $.Deferred();\n var d2_padded = pad_num(l, d2.toString(2));\n var pattern_pos = d2_padded.indexOf(\"1\");\n \n if (pattern_pos > -1) {\n pat_letter_index = pat_letter_index + 1;\n }\n\n $(\"div#match-run pre\").html(\"\");\n $(\"div#match-run pre\").append('D: ' + pad_num(l, d.toString(2)) + '<< 1 | 1\\n');\n\n // first_step: << 1 | 1 animation\n $.when(first_step(l, shifted)).done(function () {\n $(\"div#match-run pre\").append('Reading: ');\n\n $.when(highlight_read_letter(text_index)).done(function (){\n $(\"div#match-run pre\").append('\"' + ch + '\"');\n\n $.when(highlight_bitmask_row(b, ch)).done(function () {\n $(\"div#match-run pre\").append(' ' + pad_num(l, from_table.toString(2)) + \"\\n\");\n $.when(highlight_pad_from_table()).done(function() {\n $(\"div#match-run pre\").append('D & \"' + ch + '\" mask ' + d2_padded + \"\\n\");\n $.when(highlight_match_result(pattern_pos)).done(function () {\n var pattern_anim = $.Deferred();\n if (pattern_pos > -1) {\n // change pattern color to green when prefixes are matched\n highlight_pattern_letter(pattern_anim, pat_letter_index, 'green');\n } else {\n // restore all the letters;\n $.when(flash_colors(\"#pattern-letter-\" + (pat_letter_index + 1), 'red', '#ffffff', 500)).done(function () {\n pat_letter_index = -1;\n restore_pattern_letters(l, pattern_pos);\n move_pattern_letters(pattern_anim, tl, text_index);\n });\n }\n\n $.when(pattern_anim).done(function () {\n setTimeout(function(){\n deferred.resolve();\n }, 300);\n });\n });\n });\n });\n });\n });\n\n return deferred.promise();\n }\n\n $.when(display_shift_table()).done(function () {\n var matched = do_and(d2, matchMask);\n\n if (matched != 0) {\n $(\"div#match-run pre\").append(\"Match at: \" + (text_index - l + 1));\n } else if (eol(tl, text_index)) {\n $(\"div#match-run pre\").append(\"No Match\");\n } else {\n read_next_char(d2, matchMask, text_index+1);\n }\n \n enable_form();\n })\n });\n }\n\n read_next_char(d, matchMask, text_index);\n}","function check_vertical(row, col, color) {\n let count = 1\n let temp = row\n while (row > 0) {\n let $down_cell = get_cell(--row, col)\n if ($down_cell.css('backgroundColor') == color) {\n count += 1\n console.log('count +++ down')\n }\n else {\n break\n }\n }\n row = temp\n while (row < that.row) {\n let $up_cell = get_cell(++row, col)\n if ($up_cell.css('backgroundColor') == color) {\n count += 1\n console.log('count +++ right')\n }\n else {\n break\n }\n }\n if (count >= 4) {\n return true\n }\n return false\n }","function arrayMarkCount(iRows, iCols, iStartRow, iStartCol) {\n var i;\n var j;\n\n iMarkCount = 0;\n\n for (i = iStartRow; i < iStartRow + iRows; i++) {\n for (j = iStartCol; j < iStartCol + iCols; j++) {\n if (iMarkedCells[i % iMapRows][j % iMapCols] == 1) {\n iMarkCount++;\n } \n }\n } \n\n return iMarkCount;\n}","function connectFour(board) {\n var emptyCounter=0;\n for (let i=0; i< board.length; i++){\n for (let j=0; j=3) {\n winnerCheck.push([board[i][j], board[i - 1][j + 1], board[i - 2][j + 2], board[i - 3][j + 3]])\n }\n\n // //downward diagonal check\n if (i<=2) {\n winnerCheck.push([board[i][j], board[i + 1][j + 1], board[i + 2][j + 2], board[i + 3][j + 3]])\n }\n }\n if (i<=2) {\n //vertical check\n winnerCheck.push([board[i][j], board[i+1][j], board[i+2][j], board[i+3][j]])\n }\n\n //will now loop through the four directional checks, and check to see if any contain four in a row.\n for (var k=0; k0){\n return \"in progress\"\n } else{\n return \"draw\"\n }\n}","function countTexts(frameY) {\r totalCAP++;\r panelCAP++;\r\r if(frameY < 3000) {\r topRowCAP++;\r }\r}","function countLeft(x,y){\n\tfor(let i = x; i > 0; i--){\n\t\tif(boardArray[x + y * columns] == boardArray[(i - 1) + y * columns]){\n\t\t\twinConditionCount++;\n\t\t} else {\n\t\t\treturn;\n\t\t}\n\t}\n}","calcNextState() {\n\t\tlet liveN = this.countNeighbours();\n\t\tif( (liveN == 2 && this.state) || liveN == 3 ) {\n\t\t\tthis.nextState = true;\n\t\t} else {\n\t\t\tthis.nextState = false;\n\t\t}\n\t}","checkOpenNeighbors(grid, width, cellPos) {\n // we know there is at least one open cell next to the wall\n let numOpenCells = 0;\n\n // Check right\n if ((cellPos + 1) < grid.length && ((cellPos + 1) % width) > 0 &&\n grid[cellPos + 1] === OPENING_CHAR) {\n numOpenCells++;\n }\n // Check left\n if ((cellPos - 1) >= 0 && (cellPos % width) > 0 &&\n grid[cellPos - 1] === OPENING_CHAR) {\n numOpenCells++;\n }\n // Check above\n if ((cellPos - width) >= 0 && grid[cellPos - width] === OPENING_CHAR) {\n numOpenCells++;\n }\n // Check below\n if ((cellPos + width) < grid.length && grid[cellPos + width] === OPENING_CHAR) {\n numOpenCells++;\n }\n\n return numOpenCells;\n }","getLiveNeighborCount(h, w) {\n const currentCells = this.cells[this.activeBuffer];\n let c = 0;\n\n if (currentCells[h - 1] && currentCells[h - 1][w - 1]) ++c;\n if (currentCells[h - 1] && currentCells[h - 1][w - 0]) ++c;\n if (currentCells[h - 1] && currentCells[h - 1][w + 1]) ++c;\n\n if (currentCells[h - 0] && currentCells[h + 0][w - 1]) ++c;\n if (currentCells[h - 0] && currentCells[h + 0][w + 1]) ++c;\n\n if (currentCells[h + 1] && currentCells[h + 1][w - 1]) ++c;\n if (currentCells[h + 1] && currentCells[h + 1][w - 0]) ++c;\n if (currentCells[h + 1] && currentCells[h + 1][w + 1]) ++c;\n\n return c;\n }","function islandCounter(M){\n islands = 0\n if (M == null OR M.length == 0){\n return 0\n }\n row = M.length\n col = M[0].length\n\n for(i=0;i= maxVariance) {\r\n\t\t return false;\r\n\t\t }\r\n\t\t }\r\n\t\t return true;\r\n\t\t}","function comparison(){\n\n var a1,a2,a3,a4,b1,b2,b3,b4,hint1,hint2,hint3,hint4;\n a1 = row[nbrOfRows].h1;\n a2 = row[nbrOfRows].h2;\n a3 = row[nbrOfRows].h3;\n a4 = row[nbrOfRows].h4;\n b1 = row[0].h1;\n b2 = row[0].h2;\n b3 = row[0].h3;\n b4 = row[0].h4;\n\n\n correctPosition=0; //Nbr of correct colors on correct position\n if (a1 == b1){correctPosition++;a1=1;b1=0;hint1=1}\n if (a2 == b2){correctPosition++;a2=1;b2=0;hint2=1}\n if (a3 == b3){correctPosition++;a3=1;b3=0;hint3=1}\n if (a4 == b4){correctPosition++;a4=1;b4=0;hint4=1}\n\n correctColour=0; //Nbr of correct colors on wrong position\n if (a1 == b2){correctColour++;a1=1;b2=0}\n if (a1 == b3){correctColour++;a1=1;b3=0}\n if (a1 == b4){correctColour++;a1=1;b4=0}\n\n if (a2 == b1){correctColour++;a2=1;b1=0}\n if (a2 == b3){correctColour++;a2=1;b3=0}\n if (a2 == b4){correctColour++;a2=1;b4=0}\n\n if (a3 == b1){correctColour++;a3=1;b1=0}\n if (a3 == b2){correctColour++;a3=1;b2=0}\n if (a3 == b4){correctColour++;a3=1;b4=0}\n\n if (a4 == b1){correctColour++;a4=1;b1=0}\n if (a4 == b2){correctColour++;a4=1;b2=0}\n if (a4 == b3){correctColour++;a4=1;b3=0}\n\n //Draw the hints on the side of the board\n var p = 9*box+4.8;\n for (i=0;i<4;i++){\n if (i 5 || x+i > 6 || y+j < 0 || x+i < 0) continue; //ignore if not valid coordinate\n\t\t\t\tif (isVisited(x+i, y+j, visited)) continue; //ignore if already visited\n\t\t\t\tif (grid[x+i][y+j] !== color) continue; //ignore if wrong color or null\n\t\t\n\t\t\t\tif(Math.abs(j) == Math.abs(i)) { //if x and y offsets are equal to eachother, it is diagonal\n\t\t\t\t\tif(i*j > 0) d=0; //if their product is positive it is down-right\n\t\t\t\t\tif(i*j < 0) d=1; //if their product is negative is is up-right\n\t\t\t\t}\n\t\t\t\telse if(i != 0) d=2; //if x offset exists but y doesn't, it is horizontal\n\t\t\t\telse if(j != 0) d=3; //if y offset exists but x doesn't, it is vertical\n\t\t\t\t//if chip is in the correct direction, or if there is no direction yet\n\t\t\t\tif(direction==d || direction<0) { \n\t\t\t\t\tcount[d]++; //increase count for that direction\n\t\t\t\t\tcountNeighbors(x+i, y+j, color, visited, d); //find neighbours in that direction\n\t\t\t\t}\n }\n }\n }\n countNeighbors(x, y, grid[x][y], [], -1);\n\treturn count.some(e => e>=4); //if any of the directions have 4, return true\n}","checkWin() {\r\n for (let i = 0; i <= 2; i++) {\r\n //accross\r\n if (this.state[0+i*3] === this.state[1+i*3] && this.state[1+i*3] === this.state[2+i*3] && \r\n this.state[0+i*3] !== 0) return {spaces:[0+i*3,1+i*3,2+i*3], win: true}; \r\n //down\r\n if (this.state[0+i] === this.state[3+i] && this.state[3+i] === this.state[6+i] && \r\n this.state[0+i] !== 0) return {spaces:[0+i,3+i,6+i], win: true};\r\n }\r\n //diagonal\r\n if (this.state[0] === this.state[4] && this.state[4] === this.state[8] && \r\n this.state[0] !== 0) return {spaces:[0,4,8], win: true};\r\n if (this.state[2] === this.state[4] && this.state[4] === this.state[6] && \r\n this.state[2] !== 0) return {spaces:[2,4,6], win: true};\r\n //No winner, return boolean\r\n return {win: false};\r\n }","search(x, y, color, dx, dy, count, board = this.map) {\n if (x < 0 || x > 6 || y < 0 || y > 5) return count;\n if (color !== board[y][x]) return count;\n\n return this.search(x + dx, y + dy, color, dx, dy, count + 1, board);\n }","step() {\n const backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n const cB = this.buffer[this.currentBufferIndex]; // currentBuffer\n const bB = this.buffer[backBufferIndex]; // backBuffer\n const w = this.width, h = this.height;\n\n const countNeighbors = (x, y) => {\n let c = 0; // counter\n if (x > 0 && cB[y][x - 1]) c++;\n if (x < w - 1 && cB[y][x + 1]) c++;\n if (y > 0 && cB[y - 1][x]) c++;\n if (y < h - 1 && cB[y + 1][x]) c++;\n if (x > 0 && y < h - 1 && cB[y + 1][x - 1]) c++;\n if (y > 0 && x < w - 1 && cB[y - 1][x + 1]) c++;\n if (x > 0 && y > 0 && cB[y - 1][x - 1]) c++;\n if (x < w - 1 && y < h - 1 && cB[y + 1][x + 1]) c++;\n return c;\n }\n\n for (let y = 0; y < this.height; y++) {\n for (let x = 0; x < this.width; x++) {\n const counter = countNeighbors(x, y);\n const cell = cB[y][x];\n if (cell && counter === 2) bB[y][x] = 1;\n else if (cell && counter === 3) bB[y][x] = 1;\n else if (!cell && counter === 3) bB[y][x] = 1;\n else bB[y][x] = 0;\n }\n }\n\n this.currentBufferIndex = backBufferIndex;\n }","_getCellState(x,y){\n if(x>=0 && y>=0 && x= 0 && Qswitch[s] !== parseInt(this.Qbits[s], 10)) result = false;\n }\n // Check for NOT switch\n if (row.Negate) result = !result;\n\n // AND each row to get final result\n if (cnt[cPnt] === -1) {\n cnt[cPnt] = result;\n } else if (!result) {\n cnt[cPnt] = false;\n }\n }\n }\n\n // Negate the whole column, this allows A OR B by doing NOT(NOT A AND NOT B)\n for (let c=0;c<5;c++) {\n if (this.qbusswitches.condNegateAll && cnt[c] !== -1) cnt[c] = !cnt[c];\n }\n\n return cnt;\n }","step() {\n /* If you put logic from CCA here it works as should */\n\n /* In the Game of Life, these rules examine each cell of the grid. \n For each cell, it counts that cell's eight neighbors\n (up, down, left, right, and diagonals), and then act on that result.\n\n If the cell is alive and has 2 or 3 neighbors, then it remains alive. Else it dies.\n If the cell is dead and has exactly 3 neighbors, then it comes to life. Else if remains dead. */\n\n let currentBuffer = this.cells[this.currentBufferIndex];\n let backBuffer = this.cells[this.currentBufferIndex === 0 ? 1 : 0];\n \n // see if we have a neighbor that can infect this cell and change its color\n function checkNeighbors(w, h) {\n let neighbors = 0;\n\n // Check West\n if (w) {\n if (currentBuffer[h][w - 1]) {\n neighbors++;\n }\n }\n // Check NW\n if (h && w) {\n if (currentBuffer[h - 1][w - 1])\n neighbors++;\n }\n // Check North\n if (h) {\n if (currentBuffer[h - 1][w]) {\n neighbors++;\n }\n }\n // Check NE\n if ((w < this.width - 1) && h) {\n if (currentBuffer[h - 1][w + 1]) {\n neighbors++;\n }\n }\n // Check East\n if (w < this.width - 1) {\n if (currentBuffer[h][w + 1]) {\n neighbors++;\n }\n }\n // Check SE\n if ((h < this.height - 1) && (w < this.width - 1)) {\n if (currentBuffer[h + 1][w + 1]) {\n neighbors++;\n }\n }\n // Check South\n if (h < this.height - 1) {\n if (currentBuffer[h + 1][w]) {\n neighbors++;\n }\n }\n // Check SW\n if ((h < this.height - 1) && w) {\n if (currentBuffer[h + 1][w - 1]) {\n neighbors++;\n }\n }\n\n return neighbors;\n } // end: checkNeightbors()\n\n for (let h = 0; h < this.height; h++) {\n for (let w = 0; w < this.width; w++) {\n let neighborCount = checkNeighbors.call(this, w, h);\n\n // is current cell alive?\n if (currentBuffer[h][w]) {\n if (neighborCount === 2 || neighborCount === 3) {\n backBuffer[h][w] = currentBuffer[h][w]; // cell stay alives\n }\n else { // else it dies\n backBuffer[h][w] = (currentBuffer[h][w] + 1) % MODULO;\n }\n }\n else { // current cell is dead\n if (neighborCount === 3) {\n backBuffer[h][w] = (currentBuffer[h][w] + 1) % MODULO; // bring cell to life\n }\n else { // else cell remains dead\n backBuffer[h][w] = currentBuffer[h][w];\n }\n }\n }\n }\n\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\n }","function updateCount( x, y, regions, last_regions) {\n var occupied = []; \n if (typeof last_regions == 'undefined') last_regions = []; // Added this because we have arbitrary track ids, making it hard to guarantee a value here\n for (var r in regions) {\n // If already in the region, expand the boundaries\n var adj_lr = [0,0]; \n var adj_ul = [0,0]; \n var A = 0.12; // A 12% proportional \"expansion\" of the border to trigger leaving\n if (useRegionStickiness && last_regions.indexOf(r) > -1) { \n adj_lr[0] = A*regions[r].height;\n adj_lr[1] = A*regions[r].width;\n adj_ul[0] = -1*A*regions[r].height;\n adj_ul[1] = -1*A*regions[r].width;\n } \n \n // Now, use the adjusted region boundaries in the test\n //\n if (y >= regions[r].ul[0]+adj_ul[0] && y <= regions[r].lr[0]+adj_lr[0] && // These checks are for a graphics coordinate\n x >= regions[r].ul[1]+adj_ul[1] && x <= regions[r].lr[1]+adj_lr[1] ) { // system with (0,0) in the top left\n regions[r].count += 1; \n occupied.push(r); \n }\n } \n return occupied; \n}","defineStates() {\n // Maximum stack calls\n let maxStackCalls = 400;\n\n // Acquisition lambdas\n let queue = i => {\n return this.text.charAt(i);\n };\n let store = c => {\n this.buffer += c;\n };\n let flush = t => {\n if (this.buffer.length > 0) {\n // Special treatment for id tokens that contain only numbers\n let numberToken = t == Token.ID && !isNaN(this.buffer);\n this.list.push(\n new Token(numberToken ? Token.NUMBER : t, this.buffer, line)\n );\n }\n this.buffer = \"\";\n };\n\n // Line number updater\n let line = 0;\n let newline = i => {\n line++;\n };\n\n // State definitions\n let state = {\n // Transference function\n transference: (i, phase) => {\n if (i < this.text.length) {\n // Prevent stack overflow\n if (i % maxStackCalls == 0 && phase != true) {\n this.index = i;\n return;\n }\n\n // Transfer to the identifier state\n state.identifier(i);\n } else {\n flush(Token.ID);\n this.index = i;\n return;\n }\n },\n\n // For IDs\n identifier: (i, phase) => {\n let c = queue(i);\n\n switch (c) {\n case '\"':\n case \"'\":\n flush(Token.ID);\n state.string(i + 1, c);\n return;\n case \"\\\\\":\n flush(Token.ID);\n state.extension(i);\n return;\n case \" \":\n case \";\":\n flush(Token.ID);\n state.delimiter(i);\n return;\n case \"#\":\n flush(Token.ID);\n state.comment(i + 1);\n return;\n case \"(\":\n case \")\":\n flush(Token.ID);\n state.parenthesis(i, c);\n return;\n default:\n store(c);\n state.transference(i + 1);\n }\n },\n\n // For strings\n string: (i, phase) => {\n let c = queue(i);\n\n switch (c) {\n case phase:\n flush(Token.STRING);\n state.transference(i + 1, c);\n return;\n case \"\\\\\":\n state.extension(i + 1);\n return;\n default:\n store(c);\n state.string(i + 1, phase);\n }\n },\n\n // For escape characters\n extension: (i, phase) => {\n let c = queue(i);\n\n store(\"\\\\\" + c);\n state.transference(i + 1);\n },\n\n // For comments\n comment: (i, phase) => {\n let c = queue(i);\n\n switch (c) {\n case \";\":\n newline();\n flush(Token.COMMENT);\n state.transference(i + 1);\n return;\n default:\n store(c);\n state.comment(i + 1);\n }\n },\n\n // For parenthesis\n parenthesis: (i, phase) => {\n let c = queue(i);\n\n store(c);\n if (phase == \"(\") flush(Token.OPEN);\n else if (phase == \")\") flush(Token.CLOSE);\n state.transference(i + 1);\n },\n\n // For whitespaces and linefeeds\n delimiter: (i, phase) => {\n let c = queue(i);\n\n switch (c) {\n case \";\":\n newline();\n case \" \":\n store(c);\n state.delimiter(i + 1);\n return;\n default:\n flush(Token.SPACE);\n state.transference(i);\n }\n }\n };\n this.state = state;\n }","step() {\n // !!!! IMPLEMENT ME !!!!\n const currentCells = this.cells[this.activeBuffer];\n const nextCells = this.cells[this.activeBuffer === 1 ? 0 : 1];\n\n for (let h = 0; h < this.height; h++) {\n for (let w = 0; w < this.width; w++) {\n const count = this.getLiveNeighborCount.call(this, h, w);\n\n if (currentCells[h][w]) {\n if (count < 2 || count > 3) {\n nextCells[h][w] = false;\n } else {\n nextCells[h][w] = true;\n }\n } else {\n if (count === 3) {\n nextCells[h][w] = true;\n } else {\n nextCells[h][w] = false;\n }\n }\n }\n }\n this.activeBuffer = this.activeBuffer === 1 ? 0 : 1;\n }","function countUpLeft(x,y){\n\tfor(let i = y; i > 0; i--){\n\t\tfor(let j = x; j > 0; j--){\n\t\t\tif(boardArray[x + y * columns] == boardArray[(j - 1) + (i - 1) * columns]){\n\t\t\t\twinConditionCount++;\n\t\t\t} else {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(i - 1 > 0){\n\t\t\t\ti--;\n\t\t\t} else {\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n}","function nextState(r, c) {\n // number of on neightbors to the given call\n var onNeighbors = 0;\n // if given is alive itself count it\n if (field[r][c]) {\n onNeighbors -= 1;\n }\n // count alive neightbors\n for (var row = -1 ; row <= 1; row += 1) {\n for (var col = -1; col <= 1; col += 1) {\n if(field[r + row]) {\n }\n if(field[r + row] && field[r + row][c + col]) {\n onNeighbors += 1;\n }\n }\n }\n // return based on rules\n return (onNeighbors === 3) || ((onNeighbors === 2) && field[r][c]);\n }","countLiveNeighbors(x, y, grid) {\n const height = grid.length;\n const width = grid[0].length;\n const size = { width, height };\n let count = 0;\n let row;\n \n let prevY = y - 1;\n let nextY = y + 1;\n let prevX = x - 1;\n let nextX = x + 1;\n \n if (prevY < 0) {\n prevY = size.height -1;\n }\n if (nextY >= size.height) {\n nextY = 0; \n } \n if (prevX < 0) {\n prevX = size.width - 1;\n }\n if (nextX >= size.width) {\n nextX = 0;\n }\n\n // count cells in previous row\n row = grid[prevY];\n if (row) {\n if (row[prevX] && row[prevX] === \"live\") {\n count++;\n }\n if (row[x] && row[x] === \"live\") {\n count++;\n }\n if (row[nextX] && row[nextX] === \"live\") {\n count++;\n }\n }\n // count cells in current row\n row = grid[y];\n if (row[prevX] && row[prevX] === \"live\") {\n count++;\n }\n if (row[nextX] && row[nextX] === \"live\") {\n count++;\n }\n // count cells in next row\n row = grid[nextY];\n if (row) {\n if (row[prevX] && row[prevX] === \"live\") {\n count++;\n }\n if (row[x] && row[x] === \"live\") {\n count++;\n }\n if (row[nextX] && row[nextX] === \"live\") {\n count++;\n }\n }\n return count;\n }"],"string":"[\n \"function crossCheckVertical(startI, centerJ, maxCount, originalStateCountTotal, moduleSize, image) {\\r\\n\\t\\t var maxI = image.height;\\r\\n\\t\\t var stateCount = [0, 0, 0];\\r\\n\\t\\t // Start counting up from center\\r\\n\\t\\t var i = startI;\\r\\n\\t\\t while (i >= 0 && image.get(centerJ, i) && stateCount[1] <= maxCount) {\\r\\n\\t\\t stateCount[1]++;\\r\\n\\t\\t i--;\\r\\n\\t\\t }\\r\\n\\t\\t // If already too many modules in this state or ran off the edge:\\r\\n\\t\\t if (i < 0 || stateCount[1] > maxCount) {\\r\\n\\t\\t return null;\\r\\n\\t\\t }\\r\\n\\t\\t while (i >= 0 && !image.get(centerJ, i) && stateCount[0] <= maxCount) {\\r\\n\\t\\t stateCount[0]++;\\r\\n\\t\\t i--;\\r\\n\\t\\t }\\r\\n\\t\\t if (stateCount[0] > maxCount) {\\r\\n\\t\\t return null;\\r\\n\\t\\t }\\r\\n\\t\\t // Now also count down from center\\r\\n\\t\\t i = startI + 1;\\r\\n\\t\\t while (i < maxI && image.get(centerJ, i) && stateCount[1] <= maxCount) {\\r\\n\\t\\t stateCount[1]++;\\r\\n\\t\\t i++;\\r\\n\\t\\t }\\r\\n\\t\\t if (i == maxI || stateCount[1] > maxCount) {\\r\\n\\t\\t return null;\\r\\n\\t\\t }\\r\\n\\t\\t while (i < maxI && !image.get(centerJ, i) && stateCount[2] <= maxCount) {\\r\\n\\t\\t stateCount[2]++;\\r\\n\\t\\t i++;\\r\\n\\t\\t }\\r\\n\\t\\t if (stateCount[2] > maxCount) {\\r\\n\\t\\t return null;\\r\\n\\t\\t }\\r\\n\\t\\t var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\\r\\n\\t\\t if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {\\r\\n\\t\\t return null;\\r\\n\\t\\t }\\r\\n\\t\\t return foundPatternCross(stateCount, moduleSize) ? centerFromEnd(stateCount, i) : null;\\r\\n\\t\\t}\",\n \"function AlignmentPatternFinder(image, startX\\n /*int*/\\n , startY\\n /*int*/\\n , width\\n /*int*/\\n , height\\n /*int*/\\n , moduleSize\\n /*float*/\\n , resultPointCallback) {\\n _classCallCheck(this, AlignmentPatternFinder);\\n\\n this.image = image;\\n this.startX = startX;\\n this.startY = startY;\\n this.width = width;\\n this.height = height;\\n this.moduleSize = moduleSize;\\n this.resultPointCallback = resultPointCallback;\\n this.possibleCenters = []; // new Array(5))\\n // TYPESCRIPTPORT: array initialization without size as the length is checked below\\n\\n this.crossCheckStateCount = new Int32Array(3);\\n }\",\n \"check(x, y, board = this.map) {\\n let color = board[y][x];\\n if (color === \\\"⚪\\\") return 1;\\n //horizontal\\n if (\\n this.search(x, y, color, 1, 0, 0) +\\n this.search(x, y, color, -1, 0, 0) - 1 >= 4\\n ) {\\n return 2;\\n }\\n //lt-rb diagonal\\n if (\\n this.search(x, y, color, 1, 1, 0) +\\n this.search(x, y, color, -1, -1, 0) - 1 >= 4\\n ) {\\n return 2;\\n }\\n //lt-rb diagonal\\n if (\\n this.search(x, y, color, -1, 1, 0) +\\n this.search(x, y, color, 1, -1, 0) - 1 >= 4\\n ) {\\n return 2;\\n }\\n //vertical\\n if (\\n this.search(x, y, color, 0, 1, 0) +\\n this.search(x, y, color, 0, -1, 0) - 1 >= 4\\n ) {\\n return 2;\\n }\\n\\n // check how many pieces in a column\\n let countstack = 0;\\n for (let i = 0; i < 7; i++) {\\n if (this.stack[i] === -1) {\\n countstack++;\\n }\\n }\\n\\n // a column is full\\n if (countstack === 7) return 3;\\n\\n return 1;\\n }\",\n \"drawAlignmentPattern(x, y) {\\n let i;\\n let j;\\n for (i = x - 2, j = y - 2; i < x + 3; i++, j++) {\\n this.mModuleValue[i][y - 2].isBlack = true;\\n this.mModuleValue[i][y - 2].isFilled = true;\\n this.mModuleValue[i][y + 2].isBlack = true;\\n this.mModuleValue[i][y + 2].isFilled = true;\\n this.mModuleValue[x - 2][j].isBlack = true;\\n this.mModuleValue[x - 2][j].isFilled = true;\\n this.mModuleValue[x + 2][j].isBlack = true;\\n this.mModuleValue[x + 2][j].isFilled = true;\\n }\\n for (i = x - 1, j = y - 1; i < x + 2; i++, j++) {\\n this.mModuleValue[i][y - 1].isBlack = false;\\n this.mModuleValue[i][y - 1].isFilled = true;\\n this.mModuleValue[i][y + 1].isBlack = false;\\n this.mModuleValue[i][y + 1].isFilled = true;\\n this.mModuleValue[x - 1][j].isBlack = false;\\n this.mModuleValue[x - 1][j].isFilled = true;\\n this.mModuleValue[x + 1][j].isBlack = false;\\n this.mModuleValue[x + 1][j].isFilled = true;\\n }\\n this.mModuleValue[x][y].isBlack = true;\\n this.mModuleValue[x][y].isFilled = true;\\n }\",\n \"function lookAheadCount(nfa, testCombineIndex)\\n{ var testString=inputString.value;// var s=inputString.value; \\n var localCombineIndex={\\n localIndex:[],\\n localFinalIndex:[]\\n\\n };\\nlocalCombineIndex.localIndex=testCombineIndex.myIndex;\\n//localCombineIndex.myFinalIndex=testCombineIndex.myFinalIndex;\\n var CurrentActive=[];\\n var NextActive=[];\\n var MatchCount=0;\\n var temp=[];\\n \\n CurrentActive=_.union(CurrentActive, nfa.states);\\n for(var i=0; i= MAX_ROWS) {\\n // Something is wrong, since we have exceeded\\n // the maximum rows in the specification.\\n // TODO Maybe return error code\\n return null;\\n }\\n let rowDifference = 0;\\n // Scan a line of modules and check the\\n // difference between this and the previous line\\n for (let j = 0; j < width; j++) {\\n // Accumulate differences between this line and the\\n // previous line.\\n if (this.bitMatrix._get(j, i) != this.bitMatrix._get(j, i - 1)) {\\n rowDifference++;\\n }\\n }\\n\\n if (rowDifference <= moduleWidth * this.MAX_ROW_DIFFERENCE) {\\n for (let j2 = 0; j2 < width; j2++) {\\n // Accumulate the black pixels on this line\\n if (bitMatrix._get(j2, i)) {\\n rowCounters[j2]++;\\n }\\n }\\n // Increment the number of consecutive rows of pixels\\n // that are more or less the same\\n matchingConsecutiveScans++;\\n // Height of a row is a multiple of the module size in pixels\\n // Usually at least 3 times the module size\\n if (matchingConsecutiveScans >= moduleWidth * 2) { // MGMG\\n // We have some previous matches as well as a match here\\n // Set processing a unique row.\\n rowInProgress = true;\\n }\\n } else {\\n if (rowInProgress) {\\n // Process Row\\n next = processRow(rowCounters, rowNumber, rowHeight, codewords, next);\\n if (next == -1) {\\n // Something is wrong, since we have exceeded\\n // the maximum columns in the specification.\\n // TODO Maybe return error code\\n return null;\\n }\\n // Reinitialize the row counters.\\n for (let j3 = 0; j3 < rowCounters.length; j3++) {\\n rowCounters[j3] = 0;\\n }\\n rowNumber++;\\n rowHeight = 0;\\n }\\n matchingConsecutiveScans = 0;\\n rowInProgress = false;\\n }\\n rowHeight++;\\n }\\n // Check for a row that was in progress before we exited above.\\n if (rowInProgress) {\\n // Process Row\\n if (rowNumber >= this.MAX_ROWS) {\\n // Something is wrong, since we have exceeded\\n // the maximum rows in the specification.\\n // TODO Maybe return error code\\n return null;\\n }\\n\\n next = this.processRow(rowCounters, rowNumber, rowHeight, codewords, next);\\n rowNumber++;\\n rows = rowNumber;\\n }\\n erasures = trimArray(erasures, eraseCount);\\n return trimArray(codewords, next);\\n }\",\n \"didWin(mark) {\\n\\n // premenne na vypocet znacky\\n var vertical_count = 0,\\n horizontal_count = 0,\\n right_to_left_count = 0,\\n left_to_right_count = 0;\\n\\n // Loop 1\\n for (var i = 0; i < this.state.grid_size; i++) {\\n\\n\\n vertical_count = 0;\\n horizontal_count = 0;\\n\\n // Loop 2\\n for (var j = 0; j < this.state.grid_size; j++) {\\n\\n\\n if (this.state.data[i + '' + j] == mark) {\\n horizontal_count++;\\n }\\n\\n\\n if (this.state.data[j + '' + i] == mark) {\\n vertical_count++;\\n }\\n\\n }\\n\\n\\n if (this.state.data[i + '' + i] == mark) {\\n left_to_right_count++;\\n }\\n\\n\\n if (this.state.data[(this.state.grid_size - 1 - i) + '' + i] == mark) {\\n right_to_left_count++;\\n }\\n\\n // ak suhlasi vyhral\\n if (horizontal_count == this.state.grid_size || vertical_count == this.state.grid_size) {\\n return true;\\n }\\n\\n }\\n\\n // ak suhlasi diagonal vyhral\\n if (left_to_right_count == this.state.grid_size || right_to_left_count == this.state.grid_size) {\\n return true;\\n }\\n\\n // nikto nevyhral\\n return false;\\n }\",\n \"getNextValidPosition(inX, inY, state, stateHoriz, stateVert, currWord, lastOrientation){\\n let valid = false;\\n let currX = -1;\\n let currY = -1;\\n let newX = -1;\\n let newY = -1;\\n let partialScore = 0;\\n\\n let x = -1;\\n let y = -1;\\n let res = null;\\n let flagBreak = false;\\n if (lastOrientation == VERTICAL){\\n inY = inY + 1;\\n lastOrientation = null;\\n }\\n let currPosLetter = null;\\n for (y = inY; y < state.sizeY; y++) { \\n for (x = inX; x < state.sizeX; x++) {\\n // Simple first test, to see if the position can be used, and cut the processing weight.\\n // We will see if the position is not Empty and if it has a different letter then our first letter.\\n currPosLetter = state.board[x][y];\\n if ( (currPosLetter != EMPTY) && currPosLetter != currWord[0] ){\\n continue;\\n }\\n if ((lastOrientation == null) || (lastOrientation != HORIZONTAL)){\\n // Generate Horizontally placement.\\n lastOrientation = HORIZONTAL;\\n // Test if word can fit horizontally until the end.\\n if (x < state.sizeX - currWord.length){\\n [res, partialScore] = this.canWordBePlacedHorizontal(x, y, state, stateHoriz, stateVert, currWord);\\n if (res == true){\\n flagBreak = true;\\n break;\\n }\\n }\\n }\\n if (lastOrientation == HORIZONTAL){\\n // Generate Vertical placement.\\n lastOrientation = VERTICAL;\\n // Test if word can fit vertically until the bottom.\\n if (y < state.sizeY - currWord.length){\\n [res, partialScore] = this.canWordBePlacedVertical(x, y, state, stateHoriz, stateVert, currWord);\\n if (res == true){\\n flagBreak = true;\\n break;\\n }\\n }\\n }\\n }\\n if (flagBreak)\\n break;\\n }\\n\\n if ((res != null) && (res == true)){\\n valid = true;\\n currX = x;\\n currY = y;\\n newX = x;\\n newY = y;\\n }\\n\\n return [valid, currX, currY, newX, newY, lastOrientation, partialScore];\\n }\",\n \"function _tr_align() {\\n\\t\\t send_bits(STATIC_TREES << 1, 3);\\n\\t\\t send_code(END_BLOCK, StaticTree.static_ltree);\\n\\t\\t bi_flush(); // Of the 10 bits for the empty block, we have already sent\\n\\t\\t // (10 - bi_valid) bits. The lookahead for the last real code (before\\n\\t\\t // the EOB of the previous block) was thus at least one plus the length\\n\\t\\t // of the EOB plus what we have just sent of the empty static block.\\n \\n\\t\\t if (1 + last_eob_len + 10 - bi_valid < 9) {\\n\\t\\t\\tsend_bits(STATIC_TREES << 1, 3);\\n\\t\\t\\tsend_code(END_BLOCK, StaticTree.static_ltree);\\n\\t\\t\\tbi_flush();\\n\\t\\t }\\n \\n\\t\\t last_eob_len = 7;\\n\\t\\t} // Save the match info and tally the frequency counts. Return true if\",\n \"function AlignmentPattern(posX, posY, estimatedModuleSize)\\r\\n{\\r\\n\\tthis.x=posX;\\r\\n\\tthis.y=posY;\\r\\n\\tthis.count = 1;\\r\\n\\tthis.estimatedModuleSize = estimatedModuleSize;\\r\\n\\t\\r\\n\\tthis.__defineGetter__(\\\"EstimatedModuleSize\\\", function()\\r\\n\\t{\\r\\n\\t\\treturn this.estimatedModuleSize;\\r\\n\\t}); \\r\\n\\tthis.__defineGetter__(\\\"Count\\\", function()\\r\\n\\t{\\r\\n\\t\\treturn this.count;\\r\\n\\t});\\r\\n\\tthis.__defineGetter__(\\\"X\\\", function()\\r\\n\\t{\\r\\n\\t\\treturn Math.floor(this.x);\\r\\n\\t});\\r\\n\\tthis.__defineGetter__(\\\"Y\\\", function()\\r\\n\\t{\\r\\n\\t\\treturn Math.floor(this.y);\\r\\n\\t});\\r\\n\\tthis.incrementCount = function()\\r\\n\\t{\\r\\n\\t\\tthis.count++;\\r\\n\\t}\\r\\n\\tthis.aboutEquals=function( moduleSize, i, j)\\r\\n\\t\\t{\\r\\n\\t\\t\\tif (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tvar moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);\\r\\n\\t\\t\\t\\treturn moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t\\r\\n}\",\n \"function patternCheckOrientation(pattern, targetCell, qualityGoal, weight, orientation) {\\n var forwardFacingCells = FWD_CELLS[targetCell];\\n var totalDiscrepancies = 0;\\n DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\\\"Enter pCO([\\\" + pattern + \\\"]; \\\" + targetCell + \\\", \\\" + qualityGoal + \\\", \\\" + weight + \\\", \\\" + orientation + \\\"); compass: \\\" + compass);\\n fwdWrong = [];\\n rearWrong = [];\\n if ((Array.isArray(pattern[POS_CENTER]) && !pattern[POS_CENTER][myColor]) ||\\n\\t((pattern[POS_CENTER] > 0) && (myColor != pattern[POS_CENTER]))) {\\n\\tif (forwardFacingCells[POS_CENTER]) { // always true, in fact\\n\\t fwdWrong.push({p:POS_CENTER, v:POS_CENTER});\\n\\t totalDiscrepancies += 1;\\n\\t} else {\\n\\t rearWrong.push({p:POS_CENTER, v:POS_CENTER});\\n\\t totalDiscrepancies += weight;\\n\\t}\\n }\\n if ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\\n\\tDEBUG_PATTERN_CHECK_VERBOSELY && debugme(\\\"--- too bad\\\");\\n\\treturn PAT_NOMATCH;\\n }\\n var jFrom = 0;\\n switch (targetCell) {\\n case AIM_UP:\\n\\tjFrom = 4;\\n\\tbreak;\\n case AIM_LEFT:\\n\\tjFrom = 6;\\n\\tbreak;\\n case AIM_RIGHT:\\n\\tjFrom = 2;\\n\\tbreak;\\n case AIM_DOWN:\\n case POS_CENTER:\\n default:\\n\\tbreak;\\n }\\n for (var j = jFrom; j < TOTAL_NBRS + jFrom; j++) {\\n\\tvar posP = CCW[j];\\n\\tvar posV = CCW[orientation + j];\\n\\tvar c = view[posV].color;\\n\\tif ((Array.isArray(pattern[posP]) && !pattern[posP][c]) ||\\n\\t ((pattern[posP] > 0) && (c != pattern[posP]))) {\\n\\t if (forwardFacingCells[posP]) {\\n\\t\\tfwdWrong.push({p:posP, v:posV});\\n\\t\\t// #future# If it should ever be needed, we could push j as a\\n\\t\\t// third member of these objects (its absence indicating the\\n\\t\\t// center cell).\\n\\t\\ttotalDiscrepancies += 1;\\n\\t } else {\\n\\t\\trearWrong.push({p:posP, v:posV});\\n\\t\\ttotalDiscrepancies += weight;\\n\\t }\\n\\t}\\n\\tif ((compass < 0) && (totalDiscrepancies > qualityGoal)) {\\n\\t DEBUG_PATTERN_CHECK_VERBOSELY && debugme(\\\"--- too bad\\\");\\n\\t return PAT_NOMATCH;\\n\\t}\\n }\\n // Assert: totalDiscrepancies == fwdWrong.length + rearWrong.length;\\n // Assert: If compass < 0, then totalDiscrepancies <= qualityGoal\\n debugme(\\\"-> total \\\" + totalDiscrepancies + \\\" weighted discrepancies found.\\\");\\n if ((compass < 0)\\n\\t// && (totalDiscrepancies <= qualityGoal)\\n ) {\\n\\tcompass = orientation;\\n }\\n if (DEBUGME[myType]) {\\n\\t// Bypass the single-arg debugme() in order to get the objects printed.\\n\\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\\\"forwardD: [\\\", fwdWrong, \\\"]\\\");\\n\\tDEBUG_PATTERN_CHECK_VERBOSELY && console.log(\\\"rearD: [\\\", rearWrong, \\\"]\\\");\\n }\\n if (fwdWrong.length == 0) {\\n\\treturn (totalDiscrepancies);\\n } else {\\n\\treturn (-totalDiscrepancies);\\n }\\n}\",\n \"function analyze(str) {\\n function createResultRecord() {\\n resultsArr.push(`(${getToken(currentState)}, ${tokenString})`)\\n }\\n const initStrArr = str.trim().split(\\\"\\\")\\n\\n // Array contains previous states. Used to go back if sequence failed\\n let statesBuffer = []\\n let currentState = 0\\n let tokenString = \\\"\\\"\\n let resultsArr = [] // Results array in format [\\\"(number, 2)\\\", (id, asd), ...]\\n \\n for(let index = 0; index < initStrArr.length; index++) {\\n function iterateBack() {\\n let prevStep = 1\\n let revercedBufferArr = statesBuffer.slice(1).reverse()\\n\\n // From the end of buffered states iterate and find first successful state\\n while(!getToken(revercedBufferArr[prevStep]) &&\\n prevStep <= revercedBufferArr.length) {\\n prevStep += 1\\n }\\n // Set params to last known successfull state\\n currentState = revercedBufferArr[prevStep]\\n tokenString = tokenString.substr(0, tokenString.length - prevStep)\\n createResultRecord()\\n tokenString = \\\"\\\"\\n currentState = 0\\n index -= prevStep + 1\\n }\\n\\n const char = initStrArr[index]\\n const newState = getNewState(currentState, char)\\n statesBuffer.push(currentState)\\n\\n if (char == \\\" \\\") { continue; }\\n \\n if (newState) {\\n currentState = newState\\n tokenString += char\\n } else {\\n if (!tokenTable[currentState]) {\\n iterateBack(); continue;\\n }\\n createResultRecord()\\n tokenString = char\\n currentState = 0\\n currentState = getNewState(currentState, char)\\n }\\n \\n if(index === initStrArr.length - 1) {\\n if(getToken(currentState)) {\\n createResultRecord()\\n } else {\\n statesBuffer.push(currentState)\\n index += 1\\n iterateBack()\\n }\\n }\\n }\\n return resultsArr.join(\\\"; \\\") \\n}\",\n \"function checkSequence(){\\n\\t console.log(\\\"checking\\\");\\n\\t if (JSON.stringify(pattern) === JSON.stringify(userPattern)){\\n\\t\\t\\telementScore.innerHTML ++;\\n\\t\\t\\tif(elementHigh.innerHTML < elementScore.innerHTML){\\n\\t\\t\\t elementHigh.innerHTML++;\\n\\t\\t\\t}\\n\\t/* The next level function is called if they are, if not end game.*/\\t\\n\\t\\t \\n\\t\\t console.log(\\\"next\\\");\\n\\t nextLevel();\\n\\t }\\n\\t\\telse {\\n\\t\\t\\n\\t\\t\\tendGame();\\n\\t\\t} \\n }\",\n \"function check_block() {\\n var moved = false;\\n reset_counts();\\n check_counts(\\\"X\\\");\\n\\n if (countdiag1 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 3 + i);\\n }\\n }\\n if (countdiag2 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 2 + 2);\\n }\\n }\\n if (countrow0 == 2) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i);\\n }\\n }\\n if (countrow1 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(3 + i);\\n }\\n }\\n if (countrow2 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(6 + i);\\n }\\n }\\n if (countcol0 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 3);\\n }\\n }\\n if (countcol1 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 3 + 1);\\n }\\n }\\n if (countcol2 == 2 && !moved) {\\n for (i = 0; i < 3; i++) {\\n moved = take_space(i * 3 + 2);\\n }\\n }\\n return moved;\\n}\",\n \"function checkRow( g, ri ) {\\n var above_status = aliveAbove( g, ri );\\n var below_status = aliveBelow( g, ri );\\n var curr_status = g[ri]>0;\\n var alives = [];\\n var new_row = 0;\\n // If nothing around it is alive, return 0;\\n if ( above_status > 0 || below_status > 0 || curr_status > 0 ) {\\n // Check the positions\\n for( var i = 1; i < bits; i *= 2 ) {\\n var alive_or_dead = (g[ri]&i)>0;\\n var ac = 0;\\n if ( above_status == true ) {\\n (g[ri-1] & (i/2))>0?ac++:false;\\n (g[ri-1] & (i/1))>0?ac++:false;\\n (g[ri-1] & (i*2))>0?ac++:false;\\n }\\n if ( curr_status == true ) {\\n (g[ri] & (i/2))>0?ac++:false;\\n (g[ri] & (i*2))>0?ac++:false;\\n }\\n if ( below_status == true ) {\\n (g[ri+1] & (i/2))>0?ac++:false;\\n (g[ri+1] & (i/1))>0?ac++:false;\\n (g[ri+1] & (i*2))>0?ac++:false;\\n }\\n if ( alive_or_dead == true && ( ac == 2 || ac == 3 ) ) {\\n new_row += bits & i;\\n }\\n else if ( alive_or_dead == false && ac == 3 ) {\\n new_row += bits & i;\\n }\\n }\\n return new_row;\\n }\\n else {\\n return 0;\\n }\\n}\",\n \"canWordBePlacedHorizontal(x, y, state, stateHoriz, stateVert, word){\\n let result = false;\\n let partialScore = 0;\\n\\n // Test if we can put the word at x, y, Horizontal.\\n \\n // Test if the star and end position are over invalid state value terminate early.\\n let endX = x + word.length - 1;\\n if ((stateHoriz.board[x][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n (stateVert.board[x][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n (stateHoriz.board[x][y] == NO_HORIZ_NO_VERT) ||\\n (stateVert.board[x][y] == NO_HORIZ_NO_VERT) ||\\n \\n (stateHoriz.board[endX][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n (stateVert.board[endX][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n (stateHoriz.board[endX][y] == NO_HORIZ_NO_VERT) ||\\n (stateVert.board[endX][y] == NO_HORIZ_NO_VERT) ){\\n \\n result = false;\\n partialScore = 0;\\n return [result, partialScore]; \\n }\\n // Test if the word clash's with the Horizontal constrains, for all positions of the previous words placed.\\n for (let i = 0; i < word.length; i++) {\\n let xi = x + i; \\n if ((stateHoriz.board[xi][y] == HORIZONTAL) ||\\n (stateHoriz.board[xi][y] == NO_HORIZ_NO_VERT) ||\\n (stateVert.board[xi][y] == NO_HORIZ_NO_VERT) ||\\n (stateHoriz.board[xi][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n ( (state.board[xi][y] != EMPTY) && (state.board[xi][y] != word[i])) ){\\n\\n result = false;\\n partialScore = 0;\\n return [result, partialScore];\\n }\\n // Calculate the partial score of this move based on the number of crosses between words.\\n if ((state.board[xi][y] != EMPTY) && (state.board[xi][y] == word[i])){\\n partialScore = partialScore + 1;\\n }\\n }\\n \\n result = true;\\n return [result, partialScore];\\n }\",\n \"function AlignmentPattern(posX, posY, estimatedModuleSize)\\n{\\n\\tthis.x=posX;\\n\\tthis.y=posY;\\n\\tthis.count = 1;\\n\\tthis.estimatedModuleSize = estimatedModuleSize;\\n\\t\\n\\tthis.__defineGetter__(\\\"EstimatedModuleSize\\\", function()\\n\\t{\\n\\t\\treturn this.estimatedModuleSize;\\n\\t}); \\n\\tthis.__defineGetter__(\\\"Count\\\", function()\\n\\t{\\n\\t\\treturn this.count;\\n\\t});\\n\\tthis.__defineGetter__(\\\"X\\\", function()\\n\\t{\\n\\t\\treturn Math.floor(this.x);\\n\\t});\\n\\tthis.__defineGetter__(\\\"Y\\\", function()\\n\\t{\\n\\t\\treturn Math.floor(this.y);\\n\\t});\\n\\tthis.incrementCount = function()\\n\\t{\\n\\t\\tthis.count++;\\n\\t}\\n\\tthis.aboutEquals=function( moduleSize, i, j)\\n\\t\\t{\\n\\t\\t\\tif (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize)\\n\\t\\t\\t{\\n\\t\\t\\t\\tvar moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);\\n\\t\\t\\t\\treturn moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\n}\",\n \"function match_pattern_at(state, pattern, player, x, y) {\\n if(x >= 0 && x < state.length) {\\n if(y >= 0 && y < state[x].length) {\\n var element = pattern[0];\\n // Check whether the type of the part is 'p'\\n if(element[0] == 'p') {\\n if(state[x][y] !== player) {\\n return false;\\n }\\n } else if(element[0] == ' '){ // Check whether that the square is empty\\n if(state[x][y] !== undefined) {\\n return false;\\n }\\n }\\n /*\\n Check whether the pattern has more than one component in, if so then all the components\\n in the pattern have not been matched so therefore call the function to check the rest of the pattern.\\n The x and y cooridates are updated with the patterns second and third. If there is just one element in the pattern\\n then therefore we know the pattern has matched so return true.\\n */\\n if(pattern.length > 1) {\\n return match_pattern_at(state, pattern.slice(1), player, x + element[1], y + element[2])\\n } else {\\n return true;\\n }\\n }\\n }\\n return false;\\n}\",\n \"bitCount(mtx) {\\n var count = 0;\\n for (var y = 0 ; y < this.height ; y++) {\\n for (var x = 0 ; x < this.width ; x++) {\\n if (0 < mtx[y][x]) {\\n count += 1;\\n }\\n }\\n }\\n // console.log(\\\"bitCount: count = \\\", count);\\n return count;\\n }\",\n \"function check_horizontal(row, col, color) {\\n let count = 1\\n let temp = col\\n while (col > 0) {\\n let $left_cell = get_cell(row, --col)\\n console.log(col, color, 'left count')\\n console.log($left_cell)\\n if ($left_cell.css('backgroundColor') == color) {\\n count += 1\\n console.log('count +++ left')\\n }\\n else {\\n break\\n }\\n }\\n col = temp\\n while (col < that.col) {\\n let $right_cell = get_cell(row, ++col)\\n console.log(col, color, 'right count')\\n console.log($right_cell)\\n if ($right_cell.css('backgroundColor') == color) {\\n count += 1\\n console.log('count +++ right')\\n }\\n else {\\n break\\n }\\n }\\n if (count >= 4) {\\n return true\\n }\\n return false\\n }\",\n \"numValidDirections(board) {\\n let count = 0;\\n\\n if (this.isValidMove(board, DIRECTION.UP)) count++;\\n if (this.isValidMove(board, DIRECTION.DOWN)) count++;\\n if (this.isValidMove(board, DIRECTION.RIGHT)) count++;\\n if (this.isValidMove(board, DIRECTION.LEFT)) count++;\\n return count;\\n }\",\n \"function getGridStateAndNumFilled() {\\n let state = '';\\n let numFilled = 0\\n for (let i = 0; i < gridHeight; i++) {\\n for (let j = 0; j < gridWidth; j++) {\\n if (grid[i][j].notBlocked()) {\\n if (langMaxCharCodes == 1) {\\n state = state + grid[i][j].currentLetter\\n } else {\\n state = state + grid[i][j].currentLetter + '$'\\n }\\n if (grid[i][j].currentLetter != '0') {\\n numFilled++\\n }\\n } else {\\n state = state + '.'\\n }\\n }\\n }\\n numCellsFilled = numFilled\\n return state;\\n}\",\n \"function count_color(current_coordinate, desired_color, desired_direction, current_count) {\\n\\t\\t\\t\\tlet next_coordinate = [current_coordinate[0] + desired_direction[0],\\n\\t\\t\\t\\tcurrent_coordinate[1] + desired_direction[1]];\\n\\t\\t\\t\\tconsole.log(next_coordinate);\\n\\t\\t\\t\\tif (piece_position[next_coordinate[0]] && piece_position[next_coordinate[0]][next_coordinate[1]]) {\\n\\t\\t\\t\\t\\tif (piece_position[next_coordinate[0]][next_coordinate[1]].color != desired_color)\\n\\t\\t\\t\\t\\t\\treturn current_count;\\n\\t\\t\\t\\t\\tcurrent_count += 1;\\n\\t\\t\\t\\t\\tif (current_count == 3)\\n\\t\\t\\t\\t\\t\\treturn current_count;\\n\\t\\t\\t\\t\\treturn count_color(next_coordinate, desired_color, desired_direction, current_count);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn current_count;\\n\\t\\t\\t}\",\n \"setup() {\\n let statetotal = 0;\\n for (let i = 0; i < this.file.getRowCount(); i++) {\\n let statename = this.file.getString(i, 'State');\\n\\n if (statename == '') return 'Not Valid State Name';\\n else if (this.state.indexOf(statename) == -1) {\\n this.state[statetotal] = statename;\\n statetotal++;\\n }\\n }\\n }\",\n \"examine_possibles(count) {\\n let updates = 0;\\n //Loop through diagonally (hitting all rows/columns in n iterations)\\n for (var i = 0; i < this.size; i++) {\\n let node = this.nodes[i * (this.size + 1)];\\n updates += this.calculate_frequencies(node, 0, count); //Row\\n updates += this.calculate_frequencies(node, 1, count); //Col\\n }\\n\\n let inc = Math.sqrt(this.size);\\n\\n //Loop through top left of all sub_squares\\n for (var y = 0; y < this.size; y += inc) {\\n for (var x = 0; x < this.size; x += inc) {\\n updates += this.calculate_frequencies(this.nodes[x_y_to_index(x, y, this.size)], 2, count); //Sqr\\n }\\n }\\n\\n return updates;\\n }\",\n \"function charCountCompabilityCheck(seqs) {\\n\\tvar positionArray = new Array(seqs[0].length);\\n\\t// Create a base counter for each position:\\n\\tfor(var i = 0, n = seqs[0].length; i < n; i++) {\\n\\t\\tpositionArray[i] = {A:0, T:0, G:0, C:0};\\n\\t}\\n\\t// Iterate over all sequences:\\n\\tvar seq;\\n\\tfor(var i = 0, n = seqs.length; i < n ; i++) {\\n\\t\\tseq = seqs[i];\\n\\t\\t// Iterate over all positions in current sequence:\\n\\t\\tfor(var j = 0, m = seq.length; j < m; j++) {\\n\\t\\t\\t// Add one to the count for the base in this position:\\n\\t\\t\\tpositionArray[j][seq[j]] += 1;\\n\\t\\t}\\n\\t}\\n\\t// Sum channel distribution:\\n\\tvar green;\\n\\tvar red;\\n\\tfor(var i = 0, n = seqs[0].length; i < n ; i++) {\\n\\t\\tgreen = positionArray[i].T + positionArray[i].G;\\n\\t\\tred = positionArray[i].A + positionArray[i].C;\\n\\t}\\n\\treturn (green > 0 && red > 0);\\n}\",\n \"step() {\\n // Fill the offscreen buffer with the next cca generation built\\n // from the current buffer.\\n\\n let backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n let currentBuffer = this.buffer[this.currentBufferIndex];\\n let backBuffer = this.buffer[backBufferIndex];\\n\\n // See if we have a neighbor to infect this one\\n function hasInfectiousNeighbor(x, y) {\\n const nextValue = (currentBuffer[y][x] + 1) % MODULO;\\n\\n // Check the west neighbor of cell x, y\\n /*if (x > 0) {\\n if (currentBuffer[y][x - 1] === nextValue) {\\n return true;\\n }\\n }*/\\n\\n // North\\n if (y > 0) {\\n if (currentBuffer[y - 1][x] === nextValue) {\\n return true;\\n }\\n }\\n\\n // East\\n if (x < this.width - 1) {\\n if (currentBuffer[y][x + 1] === nextValue) {\\n return true;\\n }\\n }\\n\\n // South\\n if (y < this.height - 1) {\\n if (currentBuffer[y + 1][x] === nextValue) {\\n return true;\\n }\\n }\\n\\n // If we've made it this far we're not infected!\\n return false;\\n }\\n\\n // Loop through and decide the state of the next generation\\n // for each cell processed.\\n for (let y = 0; y < this.height; y++) {\\n for (let x = 0; x < this.width; x++) {\\n if (hasInfectiousNeighbor.call(this, x, y)) {\\n backBuffer[y][x] = (currentBuffer[y][x] + 1) % MODULO;\\n } else {\\n backBuffer[y][x] = currentBuffer[y][x];\\n }\\n }\\n }\\n\\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n }\",\n \"function patternCheck(pattern, targetCell, qualityGoal, weight) {\\n if (compass >= 0) { // already set\\n\\treturn (patternCheckOrientation(pattern, targetCell, qualityGoal, weight, compass));\\n } else {\\n\\tvar mismatch;\\n\\tfor (var o = 0; o < TOTAL_NBRS; o += 2) {\\n\\t debugme(\\\"patternCheck: hunting for compass (now \\\" + compass + \\\") at \\\" + o);\\n\\t mismatch = patternCheckOrientation(pattern, targetCell, qualityGoal, weight, o);\\n\\t debugme(\\\"-> got mismatch \\\" + mismatch + \\\" and compass \\\" + compass);\\n\\t if (compass >= 0) {\\n\\t\\treturn mismatch;\\n\\t }\\n\\t}\\n\\treturn PAT_NOMATCH;\\n }\\n}\",\n \"function findAlignmentInRegion(overallEstModuleSize, estAlignmentX, estAlignmentY, allowanceFactor, image) {\\r\\n\\t\\t estAlignmentX = Math.floor(estAlignmentX);\\r\\n\\t\\t estAlignmentY = Math.floor(estAlignmentY);\\r\\n\\t\\t // Look for an alignment pattern (3 modules in size) around where it should be\\r\\n\\t\\t var allowance = Math.floor(allowanceFactor * overallEstModuleSize);\\r\\n\\t\\t var alignmentAreaLeftX = Math.max(0, estAlignmentX - allowance);\\r\\n\\t\\t var alignmentAreaRightX = Math.min(image.width, estAlignmentX + allowance);\\r\\n\\t\\t if (alignmentAreaRightX - alignmentAreaLeftX < overallEstModuleSize * 3) {\\r\\n\\t\\t return null;\\r\\n\\t\\t }\\r\\n\\t\\t var alignmentAreaTopY = Math.max(0, estAlignmentY - allowance);\\r\\n\\t\\t var alignmentAreaBottomY = Math.min(image.height - 1, estAlignmentY + allowance);\\r\\n\\t\\t return alignment_finder_1.findAlignment(alignmentAreaLeftX, alignmentAreaTopY, alignmentAreaRightX - alignmentAreaLeftX, alignmentAreaBottomY - alignmentAreaTopY, overallEstModuleSize, image);\\r\\n\\t\\t}\",\n \"function headerCountLiveNeighbors(board, location){\\n var liveNeighbors = 0;\\n //check above\\n if(board[location - HEADERBOARDWIDTH] === HEADERALIVE && !headerInTopRow(location)){\\n liveNeighbors++;\\n }\\n //check below\\n if(board[location + HEADERBOARDWIDTH] === HEADERALIVE && !headerInBottomRow(location)){\\n liveNeighbors++;\\n }\\n //check right\\n if(board[location + 1] === HEADERALIVE && !headerInRightColumn(location)){\\n liveNeighbors++;\\n }\\n //check left\\n if(board[location - 1] === HEADERALIVE && !headerInLeftColumn(location)){\\n liveNeighbors++;\\n }\\n //check aboveright\\n if(board[location - HEADERBOARDWIDTH + 1] === HEADERALIVE && !headerInTopRow(location) && !headerInRightColumn(location)){\\n liveNeighbors++;\\n }\\n //check aboveleft\\n if(board[location - HEADERBOARDWIDTH - 1] === HEADERALIVE && !headerInTopRow(location) && !headerInLeftColumn(location)){\\n liveNeighbors++;\\n }\\n //check belowright\\n if(board[location + HEADERBOARDWIDTH + 1] === HEADERALIVE && !headerInBottomRow(location) && !headerInRightColumn(location)){\\n liveNeighbors++;\\n }\\n //check belowleft\\n if(board[location + HEADERBOARDWIDTH - 1] === HEADERALIVE && !headerInBottomRow(location) && !headerInLeftColumn(location)){\\n liveNeighbors++;\\n }\\n return liveNeighbors;\\n}\",\n \"function findNewState(){\\n\\n let newState = new Array();\\n let prev;\\n let anc;\\n let next;\\n\\n for(i = 0; i < cols; i++) {\\n\\n anc = state[i];\\n\\n if(i == 0){\\n prev = state[state.length-1];\\n next = state[i+1];\\n }\\n else if( i == state.length - 1) {\\n prev = state[i-1];\\n next = state[0];\\n }\\n else{\\n prev = state[i-1];\\n next = state[i+1];\\n }\\n\\n if(prev == 1 && anc == 1 && next == 1) {\\n newState[i] = 0;\\n }\\n else if (prev == 1 && anc == 1 && next == 0) {\\n newState[i] = 0;\\n }\\n else if (prev == 1 && anc == 0 && next == 1) {\\n newState[i] = 1;\\n }\\n else if (prev == 1 && anc == 0 && next == 0) {\\n newState[i] = 1;\\n }\\n else if (prev == 0 && anc == 1 && next == 1) {\\n newState[i] = 1;\\n }\\n else if (prev == 0 && anc == 1 && next == 0) {\\n newState[i] = 1;\\n }\\n else if (prev == 0 && anc == 0 && next == 1) {\\n newState[i] = 0;\\n }\\n else if (prev == 0 && anc == 0 && next == 0) {\\n newState[i] = 0;\\n }\\n }\\n state = newState.slice();\\n}\",\n \"function AlignmentPattern(posX, posY, estimatedModuleSize) {\\n this.x = posX;\\n this.y = posY;\\n this.count = 1;\\n this.estimatedModuleSize = estimatedModuleSize;\\n }\",\n \"setup() {\\n let validStateCount = 0;\\n // For each row, allocate a clickable object\\n for( let i = 0; i < this.statesTable.getRowCount(); i++ ) {\\n let className = this.statesTable.getString(i, 'ClassName');\\n \\n // if we have an image, we will call setImage() to load that image into that p5.clickable\\n if( className === \\\"\\\" ) {\\n print(\\\"empty className field in line #\\\" + i + \\\" of states file\\\");\\n return false; \\n }\\n \\n // this is the allocator itself\\n this.states[validStateCount] = eval(\\\"new \\\" + className);\\n \\n // store name of the state in the PNGRoom\\n this.states[validStateCount].setName(this.statesTable.getString(i, 'StateName'));\\n\\n // All classes (for now) have a PNGFilename, could add a blank room\\n this.states[validStateCount].setup( this.statesTable.getString(i, 'PNGFilename'),\\n this.statesTable.getString(i, 'CollisionFilename'));\\n \\n this.states[validStateCount].preload();\\n\\n validStateCount++;\\n }\\n \\n if( validStateCount > 0 ) {\\n this.hasValidStates = true;\\n this.currentStateName = this.statesTable.getString(0, 'StateName');\\n this.changeState(this.currentStateName,true);\\n }\\n else {\\n this.hasValidStates = false;\\n }\\n\\n return this.hasValidStates;\\n }\",\n \"canWordBePlacedVertical(x, y, state, stateHoriz, stateVert, word){\\n let result = false;\\n let partialScore = 0;\\n\\n // Test if we can put the word at x, y, Vertical.\\n \\n // Test if the star and end position are over invalid state value terminate early.\\n let endY = y + word.length - 1;\\n if ((stateHoriz.board[x][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n (stateVert.board[x][y] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n (stateHoriz.board[x][y] == NO_HORIZ_NO_VERT) || \\n (stateVert.board[x][y] == NO_HORIZ_NO_VERT) || \\n\\n (stateHoriz.board[x][endY] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n (stateVert.board[x][endY] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n (stateHoriz.board[x][endY] == NO_HORIZ_NO_VERT) || \\n (stateVert.board[x][endY] == NO_HORIZ_NO_VERT) ){\\n \\n result = false;\\n partialScore = 0;\\n return [result, partialScore]; \\n }\\n // Test if the word clash's with the Vertical constrains, for all positions of the previous words placed.\\n for (let i = 0; i < word.length; i++) {\\n let yi = y + i; \\n if ((stateVert.board[x][yi] == VERTICAL) ||\\n (stateVert.board[x][yi] == NO_HORIZ_NO_VERT) ||\\n (stateHoriz.board[x][yi] == NO_HORIZ_NO_VERT) ||\\n (stateVert.board[x][yi] == NO_CURR_ORIENT_AND_START_NO_END_OTHER) ||\\n ( (state.board[x][yi] != EMPTY) && (state.board[x][yi] != word[i])) ){\\n\\n result = false;\\n partialScore = 0;\\n return [result, partialScore];\\n }\\n // Calculate the partial score of this move based on the number of crosses between words.\\n if ((state.board[x][yi] != EMPTY) && (state.board[x][yi] == word[i])){\\n partialScore = partialScore + 1;\\n }\\n }\\n \\n result = true;\\n return [result, partialScore];\\n }\",\n \"lookupAndMarkFound() {\\n let m=0;\\n for (let n=1; n<=N; n++) {\\n for (let i=0;i {\\n let neighborCount = 0;\\n\\n // Actually count living neighbors\\n if (options.border === 'wrap') {\\n let north = y - 1;\\n let south = y + 1;\\n let west = x - 1;\\n let east = x + 1;\\n\\n if (north < 0) north = this.height - 1;\\n\\n if (south > this.height - 1) south = 0;\\n\\n if (west < 0) west = this.width - 1;\\n\\n if (east > this.width - 1) east = 0;\\n\\n neighborCount = \\n currentBuffer[north][west] + \\n currentBuffer[north][x] + \\n currentBuffer[north][east] + \\n currentBuffer[y][west] + \\n currentBuffer[y][east] + \\n currentBuffer[south][x] + \\n currentBuffer[south][east] + \\n currentBuffer[south][west];\\n\\n } else if (options.border === 'nowrap') {\\n // Treat out of bounds as zero\\n for (let yOffset = -1; yOffset <= 1; yOffset++) {\\n let yPos = y + yOffset;\\n if (yPos < 0 || yPos >= this.height) continue; // Out of bounds\\n\\n for (let xOffset = -1; xOffset <= 1; xOffset++) {\\n let xPos = x + xOffset;\\n if (xPos < 0 || xPos >= this.width) continue; // Out of bounds\\n if (yPos === y && xPos === x) continue; // Can't be your own neighbor\\n neighborCount += currentBuffer[yPos][xPos];\\n }\\n }\\n } else {\\n throw new Error('Unknown border option: ' + options.border);\\n }\\n return neighborCount;\\n }\\n\\n // Update backBuffer to have the next time state\\n for(let y = 0; y < this.height; y++) {\\n for (let x = 0; x < this.width; x++) {\\n const neighbors = countNeighbors(x, y);\\n const thisCell = currentBuffer[y][x];\\n\\n // Implement GoL rules\\n if (thisCell) {\\n //Current cell is alive\\n if (neighbors < 2 || neighbors > 3) {\\n // Death\\n backBuffer[y][x] = 0;\\n } else {\\n // Alive\\n backBuffer[y][x] = 1;\\n }\\n } else {\\n // Current cell is dead\\n if (neighbors === 3) {\\n // A cell is born\\n backBuffer[y][x] = 1;\\n } else {\\n // Still dead\\n backBuffer[y][x] = 0;\\n }\\n }\\n }\\n }\\n\\n this.currentBufferIndex = backBufferIndex;\\n }\",\n \"function numIslands(grid) {\\n //? Treat matrix as graph, recursive DFS on grid with row, column if land seen \\n let count = 0;\\n \\n function dfs(grid, row, col) {\\n if (row < 0 || col < 0 || row >= grid.length || col >= grid.length) return;\\n\\n let value = grid[row][col];\\n if (value === '1') {\\n grid[row][col] = '#';\\n dfs(grid, row+1, col);\\n dfs(grid, row-1, col);\\n dfs(grid, row, col-1);\\n dfs(grid, row, col+1);\\n }\\n }\\n\\n for (let i = 0; i < grid.length; i++) {\\n for (let j = 0; j < grid[0].length; j++) {\\n if (grid[i][j] === '1') {\\n count++;\\n dfs(grid, i, j);\\n }\\n }\\n }\\n return count;\\n}\",\n \"noOfScan() {\\n\\n return new Promise(async (resolve, reject) => {\\n\\n let imgBytes = await this.toIntegerArray();\\n\\n let scanCount = 0;\\n \\n let SOS = this.SOS;\\n\\n let imgBytesLength = imgBytes.length;\\n \\n //0xFFDA\\n for (let i = 0; i < imgBytesLength; i = i + 2) {\\n //0xFFDA\\n if (imgBytes[i] === SOS[0] && imgBytes[i + 1] === SOS[1]) {\\n scanCount++;\\n }\\n }\\n \\n resolve(scanCount);\\n });\\n }\",\n \"function count_islands(emap) {\\n \\n const len = array_length(emap);\\n const height = array_length(emap[0]);\\n \\n let visited = [];\\n\\n // Generate the visited 2D array -> This is to check whether the cell \\n // has already been checked\\n for (let i = 0; i < len; i = i + 1) {\\n visited[i] = [];\\n for (let j = 0; j < height; j = j + 1) {\\n visited[i][j] = false;\\n }\\n }\\n \\n // Check whether the neighboring cells are valid \\n function isSafe(emap, row, col, visited) {\\n // Check there is no negative / overflow index\\n return row >= 0 && row < len && col >= 0 && col < height \\n && emap[row][col] > 0 && !visited[row][col];\\n }\\n \\n\\n // Apply Depth-First search and treat the 2D array as a graph\\n function dfs(emap, row, col, visited) {\\n // Mark this cell as visited\\n visited[row][col] = true;\\n for (let i = -1; i <= 1; i = i + 1) {\\n for (let j = -1; j <= 1; j = j + 1) {\\n if ((i === -1 && j === 0) ||\\n (i === 0 && j === -1) ||\\n (i === 0 && j === 1) ||\\n (i === 1 && j === 0)) {\\n if(isSafe(emap, row + i, col + j, visited)) {\\n dfs(emap, row + i, col + j, visited);\\n } else {\\n \\n }\\n } else {\\n \\n }\\n }\\n }\\n \\n }\\n\\n \\n let counter = 0;\\n \\n // Trying to check the number of connected graphs\\n for (let i = 0; i < len; i = i + 1) {\\n for (let j = 0; j < len; j = j + 1) {\\n if (emap[i][j] > 0 && !visited[i][j]) {\\n // Check\\n dfs(emap, i, j, visited);\\n counter = counter + 1;\\n } else {\\n \\n }\\n }\\n }\\n\\n return counter;\\n}\",\n \"function horizontalWinCheck() {\\r\\n for (var row = 0; row < 6; row++) {\\r\\n for (var col = 0; col < 4; col++) {\\r\\n if (colorMatchCheck(returnColor(row,col), returnColor(row,col+1) ,returnColor(row,col+2), returnColor(row,col+3))) {\\r\\n console.log('horiz');\\r\\n reportWin(row,col);\\r\\n return true;\\r\\n }else {\\r\\n continue;\\r\\n }\\r\\n }\\r\\n }\\r\\n}\",\n \"_calcCellState(pos){\\n var cell=pos.split(':');\\n var x=Number (cell[0]);\\n var y=Number (cell[1]);\\n var currState=this._getCellState(x, y);\\n // Get adjacent cells\\n var sum=0;\\n sum+=this._getCellState(x-1, y-1);\\n sum+=this._getCellState(x, y-1);\\n sum+=this._getCellState(x+1, y-1);\\n sum+=this._getCellState(x-1, y);\\n sum+=this._getCellState(x+1, y);\\n sum+=this._getCellState(x-1, y+1);\\n sum+=this._getCellState(x, y+1);\\n sum+=this._getCellState(x+1, y+1);\\n\\n // Living cell\\n if(currState===1){\\n // < 2 live neighbors\\n if(sum<2){return false;}\\n // 2 or 3\\n if(sum===2 || sum===3){return true;}\\n // > 3\\n if(sum>3){return false;}\\n }else{\\n if(sum===3){return true;}\\n }\\n return false\\n }\",\n \"function decide() {\\n\\t\\t\\t\\tvar recognise = false;\\n\\t\\t\\t\\tif(fromAbove && fromBelow) {\\n\\t\\t\\t\\t\\tif(fromAbove == fromBelow) {\\n\\t\\t\\t\\t\\t\\talert(\\\"Pattern recognized\\\");\\n\\t\\t\\t\\t\\t\\t// window['Cortex'].grid[self.childAddress[i].x][self.childAddress[i].y][self.childAddress[i].z](fromBelow);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\talert(\\\"Pattern not recognized\\\");\\n\\t\\t\\t\\t\\t\\t// window['Cortex'].grid[self.parentAddress.x][self.parentAddress.y][self.parentAddress.z](fromBelow);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"function match_pattern(state, pattern, player) {\\n for(var idx1 = 0; idx1 < state.length; idx1++) {\\n for(var idx2 = 0; idx2 < state[idx1].length; idx2++) {\\n var matches = match_pattern_at(state, pattern, player, idx1, idx2);\\n if(matches) {\\n return true;\\n }\\n }\\n }\\n return false;\\n}\",\n \"function checkFlaggedMatrix(x,y) {\\n count = 0;\\n for (i=x-1; i<=x+1; i++) {\\n for (j=y-1; j<=y+1; j++) {\\n if ((i!=x) || (j!=y)) { //Don't check center point\\n count = count + checkFlagged(i,j); } } }\\n return count; }\",\n \"function checkDiag(i, j, state) {\\n //\\t\\tSystem.out.println(\\\"Diagnose starts!!!!!!!! I \\\" + i + \\\" j \\\" + j);\\n var countb = 0;\\n var countw = 0;\\n var diagChoice = -1;\\n if (i == j) {\\n diagChoice = 1;\\n } else if (i + j == 5) {\\n diagChoice = 2;\\n } else {\\n return 0;\\n }\\n var tempb = [];\\n var tempw = [];\\n for (var k = 0; k < 6; k ++) {\\n var l = k;\\n if (diagChoice == 2) {\\n l = 5 - k;\\n }\\n if (state[k][l] == 'b') {\\n countb ++;\\n tempw.push(countw);\\n countw =0;\\n } else if (state[k][l] == 'w'){\\n countw ++;\\n tempb.push(countb);\\n countb = 0;\\n } else {\\n tempw.push(countw);\\n countw =0;\\n tempb.push(countb);\\n countb =0;\\n }\\n }\\n tempw.push(countw);\\n countw =0;\\n tempb.push(countb);\\n countb =0;\\n tempb.sort(function(a,b) {return b-a});\\n tempw.sort(function(a,b) {return b-a});\\n resultB[diagChoice + 11] = tempb[0];\\n resultW[diagChoice + 11] = tempw[0];\\n }\",\n \"function checkOverlapse(direction) {\\n\\t\\textraTop = newTop;\\n\\t\\textraLeft = newLeft;\\n\\t\\t\\n\\t\\tlet overlapRows = false;\\n\\t\\t let overlapCols = false;\\n\\t\\t\\n\\t\\tif (currTopPx % dimension != 0)\\n\\t\\t\\toverlapRows = true;\\n\\t\\tif (currLeftPx % dimension != 0)\\n\\t\\t\\toverlapCols = true;\\n\\t\\t\\n\\t\\tswitch(direction) {\\n\\t\\t\\tcase leftKey:\\n\\t\\t\\tcase rightKey:\\t \\n\\t\\t\\t\\tif (overlapRows)\\n\\t\\t\\t\\t\\textraTop = newTop + 1;\\n\\t\\t\\t\\tbreak;\\n\\t\\n\\t\\t\\tcase upKey:\\n\\t\\t\\tcase downKey: \\n\\t\\t\\t\\tif (overlapCols)\\n\\t\\t\\t\\t\\textraLeft = newLeft + 1;\\n\\t\\t\\t\\tbreak;\\t\\t\\t\\t\\t\\t\\n\\t\\t}\\n\\t}\",\n \"scan() {\\n \\n this.clearBuffer();\\n var currentState = 0;\\n var token, reservedToken;\\n \\n //loop through until stream has no more characters.\\n do {\\n \\n let actionBlock = this.lookupState(currentState,this.currentChar);\\n log.debug(\\\"[Scanner] CurrentState:\\\",currentState,\\\",CurrentChar:\\\",this.currentChar,\\\",NextChar:\\\",this.nextChar,\\\",ActionState:\\\",actionBlock.state,\\\",TokenBuffer:\\\",this.tokenBuffer);\\n \\n switch (actionBlock.action) {\\n case Action.ERROR:\\n //TODO a thing here\\n break;\\n case Action.MOVE_APPEND:\\n currentState = actionBlock.state;\\n this.tokenBuffer += this.currentChar;\\n this.consumeChar();\\n break;\\n case Action.MOVE_NOAPPEND:\\n currentState = actionBlock.state;\\n this.consumeChar();\\n break;\\n case Action.HALT_APPEND:\\n token = this.lookupCode(actionBlock.state);\\n this.tokenBuffer += this.currentChar;\\n reservedToken= this.checkExceptions(this.tokenBuffer);\\n this.consumeChar();\\n if (reservedToken !== undefined) {\\n return reservedToken;\\n } else if (token !== undefined && !token.skip) {\\n return token.code;\\n } else {\\n //reset and keep moving\\n this.clearBuffer();\\n currentState = 0;\\n }\\n break;\\n case Action.HALT_NOAPPEND:\\n token = this.lookupCode(actionBlock.state);\\n reservedToken = this.checkExceptions(this.tokenBuffer);\\n this.consumeChar();\\n if (reservedToken !== undefined) {\\n return reservedToken;\\n } else if (token.code !== undefined && !token.skip) {\\n return token.code;\\n } else {\\n //reset and keep moving\\n this.clearBuffer();\\n currentState = 0;\\n }\\n break;\\n case Action.HALT_REUSE:\\n token = this.lookupCode(actionBlock.state);\\n reservedToken = this.checkExceptions(this.tokenBuffer);\\n if (reservedToken !== undefined) {\\n return reservedToken;\\n } else if (token.code !== undefined && !token.skip) {\\n return token.code;\\n } else {\\n //reset and keep moving\\n this.clearBuffer();\\n currentState = 0;\\n }\\n break;\\n }\\n \\n } while (this.currentChar !== null || this.tokenBuffer);\\n \\n return \\\"EofSym\\\";\\n\\n }\",\n \"function checkForHorizontalMatches(grid, height, width){\\n xMatchList = [];\\n for (var a = 0; a < grid.length; a++){\\n for (var b = 0; b < grid[a].length; b++){\\n if (grid[a][b-1]){\\n if (grid[a][b].stoneColor != grid[a][b-1].stoneColor){\\n if (grid[a][b+1]){\\n if (grid[a][b].stoneColor == grid[a][b + 1].stoneColor){\\n var count = 1;\\n var matches = [];\\n matches.push(grid[a][b]);\\n while (grid[a][b + count] != null && grid[a][b].stoneColor == grid[a][b + count].stoneColor){\\n matches.push(grid[a][b + count]);\\n count++;\\n }\\n if (matches.length >= 3){\\n xMatchList.push(matches);\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n return xMatchList;\\n }\",\n \"getAlignmentPatternCoOrdinates() {\\n let allign = null;\\n switch ((this.mVersion)) {\\n case 2:\\n allign = [6, 18];\\n break;\\n case 3:\\n allign = [6, 22];\\n break;\\n case 4:\\n allign = [6, 26];\\n break;\\n case 5:\\n allign = [6, 30];\\n break;\\n case 6:\\n allign = [6, 34];\\n break;\\n case 7:\\n allign = [6, 22, 38];\\n break;\\n case 8:\\n allign = [6, 24, 42];\\n break;\\n case 9:\\n allign = [6, 26, 46];\\n break;\\n case 10:\\n allign = [6, 28, 50];\\n break;\\n case 11:\\n allign = [6, 30, 54];\\n break;\\n case 12:\\n allign = [6, 32, 58];\\n break;\\n case 13:\\n allign = [6, 34, 62];\\n break;\\n case 14:\\n allign = [6, 26, 46, 66];\\n break;\\n case 15:\\n allign = [6, 26, 48, 70];\\n break;\\n case 16:\\n allign = [6, 26, 50, 74];\\n break;\\n case 17:\\n allign = [6, 30, 54, 78];\\n break;\\n case 18:\\n allign = [6, 30, 56, 82];\\n break;\\n case 19:\\n allign = [6, 30, 58, 86];\\n break;\\n case 20:\\n allign = [6, 34, 62, 90];\\n break;\\n case 21:\\n allign = [6, 28, 50, 72, 94];\\n break;\\n case 22:\\n allign = [6, 26, 50, 74, 98];\\n break;\\n case 23:\\n allign = [6, 30, 54, 78, 102];\\n break;\\n case 24:\\n allign = [6, 28, 54, 80, 106];\\n break;\\n case 25:\\n allign = [6, 32, 58, 84, 110];\\n break;\\n case 26:\\n allign = [6, 30, 58, 86, 114];\\n break;\\n case 27:\\n allign = [6, 34, 62, 90, 118];\\n break;\\n case 28:\\n allign = [6, 26, 50, 74, 98, 122];\\n break;\\n case 29:\\n allign = [6, 30, 54, 78, 102, 126];\\n break;\\n case 30:\\n allign = [6, 26, 52, 78, 104, 130];\\n break;\\n case 31:\\n allign = [6, 30, 56, 82, 108, 134];\\n break;\\n case 32:\\n allign = [6, 34, 60, 86, 112, 138];\\n break;\\n case 33:\\n allign = [6, 30, 58, 86, 114, 142];\\n break;\\n case 34:\\n allign = [6, 34, 62, 90, 118, 146];\\n break;\\n case 35:\\n allign = [6, 30, 54, 78, 102, 126, 150];\\n break;\\n case 36:\\n allign = [6, 24, 50, 76, 102, 128, 154];\\n break;\\n case 37:\\n allign = [6, 28, 54, 80, 106, 132, 158];\\n break;\\n case 38:\\n allign = [6, 32, 58, 84, 110, 136, 162];\\n break;\\n case 39:\\n allign = [6, 26, 54, 82, 110, 138, 166];\\n break;\\n case 40:\\n allign = [6, 30, 58, 86, 114, 142, 170];\\n break;\\n }\\n return allign;\\n }\",\n \"neighborCount(mtx, x, y) {\\n var count = 0;\\n for (var i = -1 ; i <= 1 ; i++) {\\n for (var j = -1 ; j <= 1 ; j++) {\\n if ((0 < (x+i)) && ((x+i) < this.width)\\n && (0 < (y+j)) && ((y+j) < this.height)) {\\n if (0 != mtx[y+j][x+i]) {\\n count += 1;\\n }\\n }\\n }\\n }\\n if (0 < count) {\\n console.log(\\\"neighborCount(\\\", x, y, \\\") = \\\", count);\\n }\\n return count;\\n }\",\n \"function horizontalWinCheck() {\\n for(var row=0;row<6;row++) {\\n for(var col = 0;col < 4;col++){\\n if(colorMatchCheck(returnColor(row,col), returnColor(row,col+1), returnColor(row,col+2))) {\\n console.log('horizontal');\\n reportWin(row,col);\\n return true;\\n }else {\\n continue;\\n }\\n }\\n }\\n}\",\n \"function verify_state() {\\n let s=read_state();\\n\\n let cnt=Array(10).fill(0);\\n for(let j=0;j<3;++j)\\n for(let i=0;i<3;++i) {\\n let pos=\\\"Row \\\"+j+\\\", Col \\\"+i;\\n if(isNaN(s.grid[j][i])) {\\n helper_log_write(pos+\\\" is not a number\\\");\\n return false;\\n }\\n if(s.grid[j][i] < 0 || s.grid[j][i] > 8) {\\n helper_log_write(pos+\\\" is out of range\\\");\\n return false;\\n }\\n ++cnt[s.grid[j][i]];\\n }\\n \\n for(let i=0;i<9;++i) {\\n let val=\\\"\\\"+i;\\n if(i==0) val=\\\"blank\\\";\\n if(cnt[i]==0) {\\n helper_log_write(\\\"Missing \\\"+val);\\n return false;\\n }\\n if(cnt[i]>1) {\\n helper_log_write(\\\"Too many \\\"+val+\\\"s\\\");\\n return false;\\n }\\n }\\n \\n //Count inversions to see if puzzle is solveable\\n let inv=0;\\n let g=[];\\n for(let j=0;j<3;++j)\\n for(let i=0;i<3;++i)\\n g.push(s.grid[j][i]);\\n g=g.filter(function(x){return x>0;});\\n for(let i=0;i<8;++i)\\n for(let j=i+1;j<8;++j)\\n if(g[i]>g[j]) ++inv;\\n if(inv%2==0) {\\n helper_log_write(\\\"Not solveable\\\");\\n return false;\\n }\\n \\n return true;\\n}\",\n \"function countSameColorIcons(startIcon, moveX, moveY) {\\n\\n var curX = startIcon.posX + moveX;\\n var curY = startIcon.posY + moveY;\\n var count = 0;\\n\\n while (curX >= 0 && curY >= 0 && curX < BOARD_COLS && curY < BOARD_ROWS && getIconColor(getIcon(curX, curY)) === getIconColor(startIcon))\\n {\\n count++;\\n curX += moveX;\\n curY += moveY;\\n }\\n\\n return count;\\n\\n}\",\n \"function check_counts(p) {\\n //checks the rows and columns for the number of X's or O's\\n for (var i = 0; i < 3; i++) {\\n if (tempboard[(0 + i)] == p) {\\n countrow0++;\\n }\\n if (tempboard[(3 + i)] == p) {\\n countrow1++;\\n }\\n if (tempboard[(6 + i)] == p) {\\n countrow2++;\\n }\\n if (tempboard[(i * 3 + 0)] == p) {\\n countcol0++;\\n }\\n if (tempboard[(i * 3 + 1)] == p) {\\n countcol1++;\\n }\\n if (tempboard[(i * 3 + 2)] == p) {\\n countcol2++;\\n }\\n }\\n //checks the diagonals for the number of X's or O's\\n if (tempboard[0] == p) {\\n countdiag1++;\\n }\\n if (tempboard[4] == p) {\\n countdiag1++;\\n countdiag2++;\\n }\\n if (tempboard[8] == p) {\\n countdiag1++;\\n }\\n if (tempboard[2] == p) {\\n countdiag2++;\\n }\\n if (tempboard[6] == p) {\\n countdiag2++;\\n }\\n\\n // if a row, column or diagonal has 3 X's or O's, we have a winner!\\n if (countrow0 == 3 || countrow1 == 3 || countrow2 == 3 || countcol0 == 3 || countcol1 == 3 || countcol2 == 3 || countdiag1 == 3 || countdiag2 == 3) has_won = true;\\n}\",\n \"function searchOnDnaMatrix(dna, sequence, row, col, matchesFound) {\\n var numSeq = 0;\\n\\n // try to search sequence only if the letter from the dna is part of the sequence\\n // as the first position is already matched, start from the next one\\n if (dna[row][col] === sequence[0]) {\\n // there are only 4 possible directions to search: horizontal, vertical, main diagonal and secondary diagonal\\n\\n // Horizontal matches\\n var n;\\n var positions = [row + ',' + col];\\n for (n = 1; n < sequence.length; n++) {\\n if (col + n >= dna.length || col + n < 0) \\n break;\\n\\n if (typeof dna[row][col + n] === 'undefined' || dna[row][col + n] !== sequence[n])\\n break;\\n\\n positions.push( row + ',' + (col + n) );\\n }\\n\\n // if the length of the sequence has the same value as n (length of the sequence in the dna) increment numSeq\\n if (sequence.length === n) {\\n numSeq++;\\n matchesFound[sequence].push( positions );\\n }\\n\\n // Vertical matches\\n for (n = 1; n < sequence.length; n++) {\\n if (row + n >= dna.length || row + n < 0) \\n break;\\n\\n if (typeof dna[row + n][col] === 'undefined' || dna[row + n][col] !== sequence[n])\\n break;\\n\\n positions.push( (row + n) + ',' + col );\\n }\\n\\n // if the length of the sequence has the same value as n (length of the sequence in the dna) increment numSeq\\n if (sequence.length === n) {\\n numSeq++;\\n matchesFound[sequence].push( positions );\\n }\\n\\n // Main diagonal matches \\n for (n = 1; n < sequence.length; n++) {\\n if (row + n >= dna.length || row + n < 0 || col + n >= dna.length || col + n < 0) \\n break;\\n\\n if (typeof dna[row + n][col + n] === 'undefined' || dna[row + n][col + n] !== sequence[n])\\n break;\\n\\n positions.push( (row + n) + ',' + (col + n) );\\n }\\n\\n // if the length of the sequence has the same value as n (length of the sequence in the dna) increment numSeq\\n if (sequence.length === n) {\\n numSeq++;\\n matchesFound[sequence].push( positions );\\n }\\n\\n // Secondary diagonal matches \\n for (n = 1; n < sequence.length; n++) {\\n if (row - n >= dna.length || row - n < 0 || col + n >= dna.length || col + n < 0) \\n break;\\n\\n if (typeof dna[row - n][col + n] === 'undefined' || dna[row - n][col + n] !== sequence[n])\\n break;\\n\\n positions.push( (row - n) + ',' + (col + n) );\\n }\\n\\n // if the length of the sequence has the same value as n (length of the sequence in the dna) increment numSeq\\n if (sequence.length === n) {\\n numSeq++;\\n matchesFound[sequence].push( positions );\\n }\\n\\n }\\n\\n return numSeq; \\n}\",\n \"function NumberOfIsland(grid) {\\n let n, m, count = 0;\\n n = grid.length;\\n if (n <= 0) return 0;\\n m = grid[0].length;\\n for (let i = 0; i < n; i++){\\n for (let j = 0; j < m; j++) {\\n if(grid[i][j] === \\\"1\\\"){\\n DFSMark(grid, i, j);\\n count++;\\n }\\n }\\n }\\n return count;\\n}\",\n \"Board_Evaluation(board, color) {\\n let result = { two: 0, three: 0, four: 0 };\\n\\n for (var i = 0; i < 6; i++) {\\n for (var j = 0; j < 7; j++) {\\n if (board[i][j] === color) {\\n let x = j;\\n let y = i;\\n let arr = [\\n this.search2(x, y, color, 1, 0, 0, board),\\n this.search2(x, y, color, -1, 0, 0, board),\\n this.search2(x, y, color, 1, 1, 0, board),\\n this.search2(x, y, color, -1, -1, 0, board),\\n this.search2(x, y, color, -1, 1, 0, board),\\n this.search2(x, y, color, 1, -1, 0, board),\\n this.search2(x, y, color, 0, 1, 0, board),\\n this.search2(x, y, color, 0, -1, 0, board),\\n ];\\n\\n for (var q = 0; q < 4; q++) {\\n switch (arr[2 * q].count + arr[2 * q + 1].count - 1) {\\n case 2:\\n if (arr[2 * q].live) result.two++;\\n break;\\n\\n case 3:\\n if (arr[2 * q].live + arr[2 * q + 1].live > 0) {\\n result.three++;\\n } else if (\\n arr[2 * q].live + arr[2 * q + 1].live ===\\n 2\\n ) {\\n console.log(1);\\n result.four++;\\n }\\n break;\\n\\n case 4:\\n result.four++;\\n break;\\n }\\n }\\n }\\n }\\n }\\n return result;\\n }\",\n \"function findInSequence() {\\n\\tvar beginMatch = 0;\\n\\tvar endMatch = 0;\\n\\tvar i = 0;\\n\\tvar specChar = RegExp('[X]');\\n\\tvar test = specChar.exec(searchMotif);\\n\\tconsole.log(test);\\n\\tvar xs = [];\\n\\tvar generalCase = false;\\n\\tvar splitMotif = searchMotif.split(\\\"\\\");\\n\\tif (test != null && searchMotif.length >= 2){\\n\\t\\t\\n\\t\\tfor (var i = 0; i < searchMotif.length; i++){\\n\\t\\t\\tvar char = searchMotif.charAt(i);\\n\\t\\t\\tif(char == \\\"X\\\"){\\n\\t\\t\\t\\txs.push(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tgeneralCase = true;\\n\\t}\\nwhile (endMatch < seq.length){\\n\\tendMatch = beginMatch + searchMotif.length;\\n\\tvar currentlyChecked = seq.substring(beginMatch, endMatch);\\n\\t//check for spaces or new lines within the search portion of the sequence\\n\\tif(generalCase){\\n\\t\\tvar currCheckedSplit = currentlyChecked.split(\\\"\\\");\\n\\t\\t//process out x's\\n\\t\\tfor(var i = 0; i < splitMotif.length; i++){\\n\\t\\t\\tif(xs[i] != null){\\n\\t\\t\\tcurrCheckedSplit.splice(xs[i],1,\\\"X\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcurrentlyChecked = currCheckedSplit.join(\\\"\\\");\\n\\t}\\n\\tif(currentlyChecked === searchMotif){\\n\\t\\tvar indices = [beginMatch, endMatch];\\n\\t\\tindicesOfMatches.push(indices);\\n\\t\\tbeginMatch = endMatch;\\n\\t}\\n\\telse{\\n\\t\\tbeginMatch++;\\n\\t}\\n\\tcurrentlyChecked = \\\"\\\";\\n}\\n\\tinsertHighlightSpans();\\n}\",\n \"_getPartOfCount() {\\n\\n // 8-neighborhood around\\n const n = [\\n Point.val(this.x - 1, this.y - 1),\\n Point.val(this.x - 1, this.y),\\n Point.val(this.x - 1, this.y + 1),\\n Point.val(this.x, this.y - 1),\\n Point.val(this.x, this.y + 1),\\n Point.val(this.x + 1, this.y - 1),\\n Point.val(this.x + 1, this.y),\\n Point.val(this.x + 1, this.y + 1),\\n ];\\n\\n const edges = n.filter(p => p === '-' || p === '|').length;\\n const ind = [];\\n for (let i = 0; i < 8; i++) {\\n if (n[i] === '-' || n[i] === '|') ind.push(i);\\n }\\n\\n switch (edges) {\\n\\n case 2:\\n switch (ind[0]) {\\n case 1: \\n return ind[1] === 3 ? (n[0] === n[7] ? 2 : 1) : (n[2] === n[5] ? 2 : 1);\\n case 3: \\n return n[2] === n[5] ? 2 : 1;\\n case 4: \\n return n[0] === n[7] ? 2 : 1;\\n }\\n\\n case 3: \\n return n.filter(p => p === ' ').length === 5 ? 3 : 2;\\n\\n case 4:\\n return n.filter(p => p === ' ').length;\\n }\\n }\",\n \"screenAlignmentPattern() {\\n // prepare cell data\\n const cell = new CellData();\\n cell.content = 1 << 22 /* WIDTH_SHIFT */ | 'E'.charCodeAt(0);\\n cell.fg = this._curAttrData.fg;\\n cell.bg = this._curAttrData.bg;\\n const buffer = this._bufferService.buffer;\\n this._setCursor(0, 0);\\n for (let yOffset = 0; yOffset < this._bufferService.rows; ++yOffset) {\\n const row = buffer.ybase + buffer.y + yOffset;\\n const line = buffer.lines.get(row);\\n if (line) {\\n line.fill(cell);\\n line.isWrapped = false;\\n }\\n }\\n this._dirtyRowService.markAllDirty();\\n this._setCursor(0, 0);\\n return true;\\n }\",\n \"checkForMatch() {\\n\\n // Matching horizontal lines\\n if(this._topLeft.textContent === 'X' || this._topLeft.textContent === '0') {\\n \\n if(this._topLeft.textContent === this._topMiddle.textContent && this._topMiddle.textContent === this._topRight.textContent) {\\n this._topLeft.style.backgroundColor = 'green'\\n this._topMiddle.style.backgroundColor = 'green'\\n this._topRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n if(this._middleLeft.textContent === 'X' || this._middleLeft.textContent === '0') {\\n \\n if(this._middleLeft.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._middleRight.textContent) {\\n this._middleLeft.style.backgroundColor = 'green'\\n this._middleMiddle.style.backgroundColor = 'green'\\n this._middleRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n if(this._bottomLeft.textContent === 'X' || this._bottomLeft.textContent === '0') {\\n \\n if(this._bottomLeft.textContent === this._bottomMiddle.textContent && this._bottomMiddle.textContent === this._bottomRight.textContent) {\\n this._bottomLeft.style.backgroundColor = 'green'\\n this._bottomMiddle.style.backgroundColor = 'green'\\n this._bottomRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n // Matching vertical lines\\n if(this._topLeft.textContent === 'X' || this._topLeft.textContent === '0') {\\n \\n if(this._topLeft.textContent === this._middleLeft.textContent && this._middleLeft.textContent == this._bottomLeft.textContent) {\\n this._topLeft.style.backgroundColor = 'green'\\n this._middleLeft.style.backgroundColor = 'green'\\n this._bottomLeft.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n if(this._topMiddle.textContent === 'X' || this._topMiddle.textContent === '0') {\\n \\n if(this._topMiddle.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent == this._bottomMiddle.textContent) {\\n this._topMiddle.style.backgroundColor = 'green'\\n this._middleMiddle.style.backgroundColor = 'green'\\n this._bottomMiddle.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n\\n if(this._topRight.textContent === 'X' || this._topRight.textContent === '0') {\\n \\n if(this._topRight.textContent === this._middleRight.textContent && this._middleRight.textContent == this._bottomRight.textContent) {\\n this._topRight.style.backgroundColor = 'green'\\n this._middleRight.style.backgroundColor = 'green'\\n this._bottomRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n \\n // Matching diagonal lines\\n if(this._middleMiddle.textContent === 'X' || this._middleMiddle.textContent === '0') {\\n \\n if(this._topLeft.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._bottomRight.textContent) {\\n this._topLeft.style.backgroundColor = 'green'\\n this._middleMiddle.style.backgroundColor = 'green'\\n this._bottomRight.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n\\n if(this._topRight.textContent === this._middleMiddle.textContent && this._middleMiddle.textContent === this._bottomLeft.textContent) {\\n this._topRight.style.backgroundColor = 'green'\\n this._middleMiddle.style.backgroundColor = 'green'\\n this._bottomLeft.style.backgroundColor = 'green'\\n\\n this.finishTheGame();\\n }\\n }\\n }\",\n \"function treasureIsland(grid) {\\n\\tlet queue = [];\\n\\tlet directions = [\\n\\t\\t[-1, 0],\\n\\t\\t[1, 0],\\n\\t\\t[0, 1],\\n\\t\\t[0, -1]\\n\\t];\\n\\tlet count = 0;\\n\\tqueue.push([0, 0]);\\n\\twhile (queue.length !== 0) {\\n\\t\\tcount++;\\n\\t\\tlet size = queue.length;\\n\\t\\tfor (let i = 0; i < size; i++) {\\n\\t\\t\\tlet [startR, startC] = queue.shift();\\n\\t\\t\\tfor (let [dr, dc] of directions) {\\n\\t\\t\\t\\tlet r = startR + dr;\\n\\t\\t\\t\\tlet c = startC + dc;\\n\\t\\t\\t\\tif (r >= 0 && r < grid.length && c >= 0 && c < grid[0].length) {\\n\\t\\t\\t\\t\\tif (grid[r][c] === 'X') {\\n\\t\\t\\t\\t\\t\\treturn count;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (grid[r][c] === 'O') {\\n\\t\\t\\t\\t\\t\\tgrid[r][c] = 'D'; //make sure not going there again\\n\\t\\t\\t\\t\\t\\tqueue.push([r, c]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn -1;\\n}\",\n \"step() {\\n // !!!! IMPLEMENT ME !!!!\\n let currentBuffer = this.cells[this.currentBufferIndex];\\n let backBuffer = this.cells[this.currentBufferIndex === 0 ? 1 : 0];\\n\\n function countNeighbors(row, col) {\\n let neighborCount = 0;\\n\\n for (let rowOffset = -1; rowOffset <= 1; rowOffset++) {\\n let rowPos = row + rowOffset;\\n\\n if (rowPos < 0 || rowPos === this.height) {\\n continue;\\n }\\n\\n for (let colOffset = -1; colOffset <= 1; colOffset++) {\\n let colPos = col + colOffset;\\n\\n if (colPos < 0 || colPos === this.width) {\\n continue;\\n }\\n \\n if (colOffset === 0 && rowOffset === 0) { // Current cell\\n continue;\\n }\\n\\n if (currentBuffer[rowPos][colPos] === 1) {\\n neighborCount++;\\n }\\n }\\n }\\n return neighborCount;\\n };\\n\\n for (let r = 0; r < this.height; r++) {\\n for (let c = 0; c < this.width; c++) {\\n let neighborCount = countNeighbors.call(this, r, c);\\n\\n if (currentBuffer[r][c] === 1) {\\n if (neighborCount < 2 || neighborCount > 3) {\\n backBuffer[r][c] = 0;\\n } else {\\n backBuffer[r][c] = 1;\\n }\\n } else {\\n if (neighborCount === 3) {\\n backBuffer[r][c] = 0;\\n } else {\\n backBuffer[r][c] = 1;\\n }\\n }\\n }\\n }\\n\\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n }\",\n \"function islands(matrix){\\n \\n var count = 0;\\n function traverse(x, y,count){\\n \\n if (x < 0 || y < 0 || x >= matrix[0].length || y >= matrix.length){\\n return;\\n } else if(matrix[y][x] === 0){\\n \\n \\n \\n return;\\n \\n }else if(matrix[y][x] === 0 && matrix[y][x+1] === 0){\\n \\n \\n traverse(x+1,y,count);\\n \\n \\n }else if(matrix[y][x] === 0 && matrix[y][x -1] === 0){\\n \\n \\n traverse(x-1,y,count);\\n \\n \\n }else if(matrix[y][x] === 0 && matrix[y+1][x] === 0){\\n \\n \\n traverse(x,y+1,count);\\n \\n \\n }else if(matrix[y][x] === 0 && matrix[y-1][x] === 0){\\n \\n \\n traverse(x,y-1,count);\\n \\n \\n }\\n \\n if(matrix[y][x] == 1){\\n count++;\\n matrix[y][x] = 0;\\n console.log(x + '_' + y);\\n \\n traverse(x,y-1,count);\\n traverse(x+1,y,count);\\n traverse(x,y + 1,count);\\n traverse(x-1, y,count);\\n \\n \\n }\\n \\n \\n let object = {\\\"X\\\":x,\\\"Y\\\":y};\\n \\n return count;\\n }\\n \\n console.log(traverse(0, 0,count));\\n \\n \\n}\",\n \"function lookAhead(input,stateInformation) {\\n let totalLength = input.length;\\n let state = stateInformation.state.currentState;\\n let idx = stateInformation.currentIndex;\\n var result = undefined;\\n while (state === stateInformation.state.currentState && idx < totalLength){\\n let c = input.charAt(idx);\\n if (stateInformation.state.transitions[stateInformation.state.currentState].lookFor.has(c)){\\n stateInformation.state.currentState = stateInformation.state.nextState;\\n if (stateInformation.state.currentState != stateInformation.finalState){\\n stateInformation.state.nextState++;\\n stateInformation.currentIndex = idx;\\n stateInformation.capturedInformation = c;\\n }\\n else{\\n stateInformation.done = true;\\n }\\n result = stateInformation;\\n\\n } else {\\n idx++; \\n }\\n }\\n return result;\\n}\",\n \"function getCount(possibility_matrix, count_arr, len) {\\n let turn_1_index = 0;\\n let turn_1_count = count_arr[0];\\n let turn_2_count = 0;\\n for (let i = 0; i < count_arr.length; i++) {\\n if (count_arr[i] > turn_1_count) {\\n turn_1_count = count_arr[i];\\n turn_1_index = i;\\n }\\n }\\n if (count_arr.length > 1) {\\n let catched_salmon_arr = [];\\n for (let i = 0; i < possibility_matrix[turn_1_index].length; i++) {\\n if (possibility_matrix[turn_1_index][i]) {\\n catched_salmon_arr[i] = true;\\n }\\n }\\n // console.log(catched_salmon_arr, turn_1_index, turn_1_count);\\n let turn_2_index;\\n for (let i = 0; i < catched_salmon_arr.length; i++) {\\n if (catched_salmon_arr[i]) {\\n continue;\\n } else {\\n turn_2_index = i;\\n turn_2_count = count_arr[i];\\n break;\\n }\\n }\\n\\n for (let i = 0; i < count_arr.length; i++) {\\n if (!catched_salmon_arr[i] && count_arr[i] > turn_2_count && (count_arr[i] + turn_1_count) <= len && checkNoneOfCurrentGroupCatched(possibility_matrix[i])) {\\n turn_2_index = i;\\n turn_2_count = count_arr[i];\\n }\\n }\\n // console.log(catched_salmon_arr, turn_2_index, turn_2_count);\\n } else {\\n turn_2_count = 0; // turn 2 not possible\\n }\\n console.log(turn_1_count + turn_2_count);\\n}\",\n \"getSize() {\\n\\t\\tlet pattern = this.getPattern();\\n\\t\\tlet highestRow = 0;\\n\\t\\tlet highestCol = 0;\\n\\t\\tfor(let block of pattern){\\n\\t\\t\\tlet row = block[0] + 1;\\n\\t\\t\\tlet col = block[1] + 1;\\n\\n\\t\\t\\tif(row >= highestRow){\\n\\t\\t\\t\\thighestRow = row;\\n\\t\\t\\t}\\n\\t\\t\\tif(col >= highestCol){\\n\\t\\t\\t\\thighestCol = col;\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\tthis.width = highestCol;\\n\\t\\tthis.height = highestRow;\\n\\t}\",\n \"function matchPattern(pattern,genome) {\\n //console.log(pattern);\\n //console.log(genome);\\n //console.log(\\\"genome length : \\\" + genome.length);\\n var positions = [];\\n for(var i=0;i<=genome.length-pattern.length;i++) {\\n var str = computeText(genome,i,pattern.length);\\n // console.log(str);\\n if(str==pattern) {\\n positions.push(i);\\n }\\n }\\n return positions;\\n /*\\n var output = \\\"\\\";\\n for(var i=0;i -1) { \\n adj_lr[0] = A*regions[r].height;\\n adj_lr[1] = A*regions[r].width;\\n adj_ul[0] = -1*A*regions[r].height;\\n adj_ul[1] = -1*A*regions[r].width;\\n } \\n \\n // Now, use the adjusted region boundaries in the test\\n //\\n if (y >= regions[r].ul[0]+adj_ul[0] && y <= regions[r].lr[0]+adj_lr[0] && // These checks are for a graphics coordinate\\n x >= regions[r].ul[1]+adj_ul[1] && x <= regions[r].lr[1]+adj_lr[1] ) { // system with (0,0) in the top left\\n regions[r].count += 1; \\n occupied.push(r); \\n }\\n } \\n return occupied; \\n}\",\n \"update(when) {\\n console.log(\\\"input mtx bit count: \\\",\\n this.bitCount(this.input_matrix()));\\n console.log(\\\"output mtx bit count: \\\",\\n this.bitCount(this.output_matrix()));\\n this.compute_next_mtx(this.output_matrix(), this.input_matrix());\\n this.sc.update();\\n }\",\n \"function checkIslands(matrix) {\\n let count = 0;\\n \\n for (let i = 0; i < matrix.length; i++) {\\n for (let j = 0; j < matrix[i].length; j++) {\\n // if we hit 1\\n if (matrix[i][j] == 1) {\\n // and our top and left is either zero or outside the area\\n if ((i - 1) < 0 || matrix[i - 1][j] === 0 &&\\n (j - 1) < 0 || matrix[i][j - 1] === 0) {\\n count++;\\n }\\n }\\n }\\n }\\n \\n /*\\n if (matrix[i][j] == '1'):\\n \\n if ((i == 0 or matrix[i - 1][j] == 'O') and\\n (j == 0 or matrix[i][j - 1] == 'O')):\\n count = count + 1\\n \\n \\n \\n \\n */\\n \\n \\n \\n \\n \\n return count;\\n }\",\n \"function vis_shift_and(p, text) {\\n $(\\\"#the-haystack\\\").html(\\\"\\\");\\n $(\\\"#the-needle\\\").html(\\\"\\\").css('left', 'inherit');\\n $(\\\"#bitmask-table\\\").html(\\\"\\\");\\n $(\\\"#match-run pre\\\").html(\\\"\\\");\\n\\n var b = {};\\n var l = p.length;\\n var tl = text.length;\\n var alphabet = [];\\n\\n // initialize bitmask table\\n // build alphabet array\\n for (var i = 0; i < l; i++) {\\n var ch = p.charAt(i);\\n add_to_alphabet(alphabet, ch);\\n b[ch] = 0;\\n }\\n\\n //build bitmask table;\\n for (var i = 0; i < l; i++) {\\n b[p.charAt(i)] = b[p.charAt(i)] | (1 << i);\\n }\\n\\n for (var i = 0; i < alphabet.length; i++) {\\n var padded = pad_num(l, b[alphabet[i]].toString(2));\\n display_mask(alphabet[i], padded);\\n }\\n \\n display_mask('*', pad_num(l, (0).toString(2)));\\n\\n display_text(text);\\n display_pattern(p);\\n \\n tx_as_array = text.split(\\\"\\\");\\n\\n var haystack_pos = $(\\\"#the-haystack\\\").position();\\n var d = 0;\\n var matchMask = 1 << l-1;\\n var text_index = 0;\\n var pat_letter_index = -1;\\n\\n function read_next_char(d, matchMask, text_index) {\\n var ch = tx_as_array.shift();\\n\\n $.when(do_shift(d), get_from_table(b, ch)).done(function(shifted, from_table) {\\n var d2 = shifted & from_table;\\n\\n function display_shift_table() {\\n var deferred = $.Deferred();\\n var d2_padded = pad_num(l, d2.toString(2));\\n var pattern_pos = d2_padded.indexOf(\\\"1\\\");\\n \\n if (pattern_pos > -1) {\\n pat_letter_index = pat_letter_index + 1;\\n }\\n\\n $(\\\"div#match-run pre\\\").html(\\\"\\\");\\n $(\\\"div#match-run pre\\\").append('D: ' + pad_num(l, d.toString(2)) + '<< 1 | 1\\\\n');\\n\\n // first_step: << 1 | 1 animation\\n $.when(first_step(l, shifted)).done(function () {\\n $(\\\"div#match-run pre\\\").append('Reading: ');\\n\\n $.when(highlight_read_letter(text_index)).done(function (){\\n $(\\\"div#match-run pre\\\").append('\\\"' + ch + '\\\"');\\n\\n $.when(highlight_bitmask_row(b, ch)).done(function () {\\n $(\\\"div#match-run pre\\\").append(' ' + pad_num(l, from_table.toString(2)) + \\\"\\\\n\\\");\\n $.when(highlight_pad_from_table()).done(function() {\\n $(\\\"div#match-run pre\\\").append('D & \\\"' + ch + '\\\" mask ' + d2_padded + \\\"\\\\n\\\");\\n $.when(highlight_match_result(pattern_pos)).done(function () {\\n var pattern_anim = $.Deferred();\\n if (pattern_pos > -1) {\\n // change pattern color to green when prefixes are matched\\n highlight_pattern_letter(pattern_anim, pat_letter_index, 'green');\\n } else {\\n // restore all the letters;\\n $.when(flash_colors(\\\"#pattern-letter-\\\" + (pat_letter_index + 1), 'red', '#ffffff', 500)).done(function () {\\n pat_letter_index = -1;\\n restore_pattern_letters(l, pattern_pos);\\n move_pattern_letters(pattern_anim, tl, text_index);\\n });\\n }\\n\\n $.when(pattern_anim).done(function () {\\n setTimeout(function(){\\n deferred.resolve();\\n }, 300);\\n });\\n });\\n });\\n });\\n });\\n });\\n\\n return deferred.promise();\\n }\\n\\n $.when(display_shift_table()).done(function () {\\n var matched = do_and(d2, matchMask);\\n\\n if (matched != 0) {\\n $(\\\"div#match-run pre\\\").append(\\\"Match at: \\\" + (text_index - l + 1));\\n } else if (eol(tl, text_index)) {\\n $(\\\"div#match-run pre\\\").append(\\\"No Match\\\");\\n } else {\\n read_next_char(d2, matchMask, text_index+1);\\n }\\n \\n enable_form();\\n })\\n });\\n }\\n\\n read_next_char(d, matchMask, text_index);\\n}\",\n \"function check_vertical(row, col, color) {\\n let count = 1\\n let temp = row\\n while (row > 0) {\\n let $down_cell = get_cell(--row, col)\\n if ($down_cell.css('backgroundColor') == color) {\\n count += 1\\n console.log('count +++ down')\\n }\\n else {\\n break\\n }\\n }\\n row = temp\\n while (row < that.row) {\\n let $up_cell = get_cell(++row, col)\\n if ($up_cell.css('backgroundColor') == color) {\\n count += 1\\n console.log('count +++ right')\\n }\\n else {\\n break\\n }\\n }\\n if (count >= 4) {\\n return true\\n }\\n return false\\n }\",\n \"function arrayMarkCount(iRows, iCols, iStartRow, iStartCol) {\\n var i;\\n var j;\\n\\n iMarkCount = 0;\\n\\n for (i = iStartRow; i < iStartRow + iRows; i++) {\\n for (j = iStartCol; j < iStartCol + iCols; j++) {\\n if (iMarkedCells[i % iMapRows][j % iMapCols] == 1) {\\n iMarkCount++;\\n } \\n }\\n } \\n\\n return iMarkCount;\\n}\",\n \"function connectFour(board) {\\n var emptyCounter=0;\\n for (let i=0; i< board.length; i++){\\n for (let j=0; j=3) {\\n winnerCheck.push([board[i][j], board[i - 1][j + 1], board[i - 2][j + 2], board[i - 3][j + 3]])\\n }\\n\\n // //downward diagonal check\\n if (i<=2) {\\n winnerCheck.push([board[i][j], board[i + 1][j + 1], board[i + 2][j + 2], board[i + 3][j + 3]])\\n }\\n }\\n if (i<=2) {\\n //vertical check\\n winnerCheck.push([board[i][j], board[i+1][j], board[i+2][j], board[i+3][j]])\\n }\\n\\n //will now loop through the four directional checks, and check to see if any contain four in a row.\\n for (var k=0; k0){\\n return \\\"in progress\\\"\\n } else{\\n return \\\"draw\\\"\\n }\\n}\",\n \"function countTexts(frameY) {\\r totalCAP++;\\r panelCAP++;\\r\\r if(frameY < 3000) {\\r topRowCAP++;\\r }\\r}\",\n \"function countLeft(x,y){\\n\\tfor(let i = x; i > 0; i--){\\n\\t\\tif(boardArray[x + y * columns] == boardArray[(i - 1) + y * columns]){\\n\\t\\t\\twinConditionCount++;\\n\\t\\t} else {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n}\",\n \"calcNextState() {\\n\\t\\tlet liveN = this.countNeighbours();\\n\\t\\tif( (liveN == 2 && this.state) || liveN == 3 ) {\\n\\t\\t\\tthis.nextState = true;\\n\\t\\t} else {\\n\\t\\t\\tthis.nextState = false;\\n\\t\\t}\\n\\t}\",\n \"checkOpenNeighbors(grid, width, cellPos) {\\n // we know there is at least one open cell next to the wall\\n let numOpenCells = 0;\\n\\n // Check right\\n if ((cellPos + 1) < grid.length && ((cellPos + 1) % width) > 0 &&\\n grid[cellPos + 1] === OPENING_CHAR) {\\n numOpenCells++;\\n }\\n // Check left\\n if ((cellPos - 1) >= 0 && (cellPos % width) > 0 &&\\n grid[cellPos - 1] === OPENING_CHAR) {\\n numOpenCells++;\\n }\\n // Check above\\n if ((cellPos - width) >= 0 && grid[cellPos - width] === OPENING_CHAR) {\\n numOpenCells++;\\n }\\n // Check below\\n if ((cellPos + width) < grid.length && grid[cellPos + width] === OPENING_CHAR) {\\n numOpenCells++;\\n }\\n\\n return numOpenCells;\\n }\",\n \"getLiveNeighborCount(h, w) {\\n const currentCells = this.cells[this.activeBuffer];\\n let c = 0;\\n\\n if (currentCells[h - 1] && currentCells[h - 1][w - 1]) ++c;\\n if (currentCells[h - 1] && currentCells[h - 1][w - 0]) ++c;\\n if (currentCells[h - 1] && currentCells[h - 1][w + 1]) ++c;\\n\\n if (currentCells[h - 0] && currentCells[h + 0][w - 1]) ++c;\\n if (currentCells[h - 0] && currentCells[h + 0][w + 1]) ++c;\\n\\n if (currentCells[h + 1] && currentCells[h + 1][w - 1]) ++c;\\n if (currentCells[h + 1] && currentCells[h + 1][w - 0]) ++c;\\n if (currentCells[h + 1] && currentCells[h + 1][w + 1]) ++c;\\n\\n return c;\\n }\",\n \"function islandCounter(M){\\n islands = 0\\n if (M == null OR M.length == 0){\\n return 0\\n }\\n row = M.length\\n col = M[0].length\\n\\n for(i=0;i= maxVariance) {\\r\\n\\t\\t return false;\\r\\n\\t\\t }\\r\\n\\t\\t }\\r\\n\\t\\t return true;\\r\\n\\t\\t}\",\n \"function comparison(){\\n\\n var a1,a2,a3,a4,b1,b2,b3,b4,hint1,hint2,hint3,hint4;\\n a1 = row[nbrOfRows].h1;\\n a2 = row[nbrOfRows].h2;\\n a3 = row[nbrOfRows].h3;\\n a4 = row[nbrOfRows].h4;\\n b1 = row[0].h1;\\n b2 = row[0].h2;\\n b3 = row[0].h3;\\n b4 = row[0].h4;\\n\\n\\n correctPosition=0; //Nbr of correct colors on correct position\\n if (a1 == b1){correctPosition++;a1=1;b1=0;hint1=1}\\n if (a2 == b2){correctPosition++;a2=1;b2=0;hint2=1}\\n if (a3 == b3){correctPosition++;a3=1;b3=0;hint3=1}\\n if (a4 == b4){correctPosition++;a4=1;b4=0;hint4=1}\\n\\n correctColour=0; //Nbr of correct colors on wrong position\\n if (a1 == b2){correctColour++;a1=1;b2=0}\\n if (a1 == b3){correctColour++;a1=1;b3=0}\\n if (a1 == b4){correctColour++;a1=1;b4=0}\\n\\n if (a2 == b1){correctColour++;a2=1;b1=0}\\n if (a2 == b3){correctColour++;a2=1;b3=0}\\n if (a2 == b4){correctColour++;a2=1;b4=0}\\n\\n if (a3 == b1){correctColour++;a3=1;b1=0}\\n if (a3 == b2){correctColour++;a3=1;b2=0}\\n if (a3 == b4){correctColour++;a3=1;b4=0}\\n\\n if (a4 == b1){correctColour++;a4=1;b1=0}\\n if (a4 == b2){correctColour++;a4=1;b2=0}\\n if (a4 == b3){correctColour++;a4=1;b3=0}\\n\\n //Draw the hints on the side of the board\\n var p = 9*box+4.8;\\n for (i=0;i<4;i++){\\n if (i 5 || x+i > 6 || y+j < 0 || x+i < 0) continue; //ignore if not valid coordinate\\n\\t\\t\\t\\tif (isVisited(x+i, y+j, visited)) continue; //ignore if already visited\\n\\t\\t\\t\\tif (grid[x+i][y+j] !== color) continue; //ignore if wrong color or null\\n\\t\\t\\n\\t\\t\\t\\tif(Math.abs(j) == Math.abs(i)) { //if x and y offsets are equal to eachother, it is diagonal\\n\\t\\t\\t\\t\\tif(i*j > 0) d=0; //if their product is positive it is down-right\\n\\t\\t\\t\\t\\tif(i*j < 0) d=1; //if their product is negative is is up-right\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(i != 0) d=2; //if x offset exists but y doesn't, it is horizontal\\n\\t\\t\\t\\telse if(j != 0) d=3; //if y offset exists but x doesn't, it is vertical\\n\\t\\t\\t\\t//if chip is in the correct direction, or if there is no direction yet\\n\\t\\t\\t\\tif(direction==d || direction<0) { \\n\\t\\t\\t\\t\\tcount[d]++; //increase count for that direction\\n\\t\\t\\t\\t\\tcountNeighbors(x+i, y+j, color, visited, d); //find neighbours in that direction\\n\\t\\t\\t\\t}\\n }\\n }\\n }\\n countNeighbors(x, y, grid[x][y], [], -1);\\n\\treturn count.some(e => e>=4); //if any of the directions have 4, return true\\n}\",\n \"checkWin() {\\r\\n for (let i = 0; i <= 2; i++) {\\r\\n //accross\\r\\n if (this.state[0+i*3] === this.state[1+i*3] && this.state[1+i*3] === this.state[2+i*3] && \\r\\n this.state[0+i*3] !== 0) return {spaces:[0+i*3,1+i*3,2+i*3], win: true}; \\r\\n //down\\r\\n if (this.state[0+i] === this.state[3+i] && this.state[3+i] === this.state[6+i] && \\r\\n this.state[0+i] !== 0) return {spaces:[0+i,3+i,6+i], win: true};\\r\\n }\\r\\n //diagonal\\r\\n if (this.state[0] === this.state[4] && this.state[4] === this.state[8] && \\r\\n this.state[0] !== 0) return {spaces:[0,4,8], win: true};\\r\\n if (this.state[2] === this.state[4] && this.state[4] === this.state[6] && \\r\\n this.state[2] !== 0) return {spaces:[2,4,6], win: true};\\r\\n //No winner, return boolean\\r\\n return {win: false};\\r\\n }\",\n \"search(x, y, color, dx, dy, count, board = this.map) {\\n if (x < 0 || x > 6 || y < 0 || y > 5) return count;\\n if (color !== board[y][x]) return count;\\n\\n return this.search(x + dx, y + dy, color, dx, dy, count + 1, board);\\n }\",\n \"step() {\\n const backBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n const cB = this.buffer[this.currentBufferIndex]; // currentBuffer\\n const bB = this.buffer[backBufferIndex]; // backBuffer\\n const w = this.width, h = this.height;\\n\\n const countNeighbors = (x, y) => {\\n let c = 0; // counter\\n if (x > 0 && cB[y][x - 1]) c++;\\n if (x < w - 1 && cB[y][x + 1]) c++;\\n if (y > 0 && cB[y - 1][x]) c++;\\n if (y < h - 1 && cB[y + 1][x]) c++;\\n if (x > 0 && y < h - 1 && cB[y + 1][x - 1]) c++;\\n if (y > 0 && x < w - 1 && cB[y - 1][x + 1]) c++;\\n if (x > 0 && y > 0 && cB[y - 1][x - 1]) c++;\\n if (x < w - 1 && y < h - 1 && cB[y + 1][x + 1]) c++;\\n return c;\\n }\\n\\n for (let y = 0; y < this.height; y++) {\\n for (let x = 0; x < this.width; x++) {\\n const counter = countNeighbors(x, y);\\n const cell = cB[y][x];\\n if (cell && counter === 2) bB[y][x] = 1;\\n else if (cell && counter === 3) bB[y][x] = 1;\\n else if (!cell && counter === 3) bB[y][x] = 1;\\n else bB[y][x] = 0;\\n }\\n }\\n\\n this.currentBufferIndex = backBufferIndex;\\n }\",\n \"_getCellState(x,y){\\n if(x>=0 && y>=0 && x= 0 && Qswitch[s] !== parseInt(this.Qbits[s], 10)) result = false;\\n }\\n // Check for NOT switch\\n if (row.Negate) result = !result;\\n\\n // AND each row to get final result\\n if (cnt[cPnt] === -1) {\\n cnt[cPnt] = result;\\n } else if (!result) {\\n cnt[cPnt] = false;\\n }\\n }\\n }\\n\\n // Negate the whole column, this allows A OR B by doing NOT(NOT A AND NOT B)\\n for (let c=0;c<5;c++) {\\n if (this.qbusswitches.condNegateAll && cnt[c] !== -1) cnt[c] = !cnt[c];\\n }\\n\\n return cnt;\\n }\",\n \"step() {\\n /* If you put logic from CCA here it works as should */\\n\\n /* In the Game of Life, these rules examine each cell of the grid. \\n For each cell, it counts that cell's eight neighbors\\n (up, down, left, right, and diagonals), and then act on that result.\\n\\n If the cell is alive and has 2 or 3 neighbors, then it remains alive. Else it dies.\\n If the cell is dead and has exactly 3 neighbors, then it comes to life. Else if remains dead. */\\n\\n let currentBuffer = this.cells[this.currentBufferIndex];\\n let backBuffer = this.cells[this.currentBufferIndex === 0 ? 1 : 0];\\n \\n // see if we have a neighbor that can infect this cell and change its color\\n function checkNeighbors(w, h) {\\n let neighbors = 0;\\n\\n // Check West\\n if (w) {\\n if (currentBuffer[h][w - 1]) {\\n neighbors++;\\n }\\n }\\n // Check NW\\n if (h && w) {\\n if (currentBuffer[h - 1][w - 1])\\n neighbors++;\\n }\\n // Check North\\n if (h) {\\n if (currentBuffer[h - 1][w]) {\\n neighbors++;\\n }\\n }\\n // Check NE\\n if ((w < this.width - 1) && h) {\\n if (currentBuffer[h - 1][w + 1]) {\\n neighbors++;\\n }\\n }\\n // Check East\\n if (w < this.width - 1) {\\n if (currentBuffer[h][w + 1]) {\\n neighbors++;\\n }\\n }\\n // Check SE\\n if ((h < this.height - 1) && (w < this.width - 1)) {\\n if (currentBuffer[h + 1][w + 1]) {\\n neighbors++;\\n }\\n }\\n // Check South\\n if (h < this.height - 1) {\\n if (currentBuffer[h + 1][w]) {\\n neighbors++;\\n }\\n }\\n // Check SW\\n if ((h < this.height - 1) && w) {\\n if (currentBuffer[h + 1][w - 1]) {\\n neighbors++;\\n }\\n }\\n\\n return neighbors;\\n } // end: checkNeightbors()\\n\\n for (let h = 0; h < this.height; h++) {\\n for (let w = 0; w < this.width; w++) {\\n let neighborCount = checkNeighbors.call(this, w, h);\\n\\n // is current cell alive?\\n if (currentBuffer[h][w]) {\\n if (neighborCount === 2 || neighborCount === 3) {\\n backBuffer[h][w] = currentBuffer[h][w]; // cell stay alives\\n }\\n else { // else it dies\\n backBuffer[h][w] = (currentBuffer[h][w] + 1) % MODULO;\\n }\\n }\\n else { // current cell is dead\\n if (neighborCount === 3) {\\n backBuffer[h][w] = (currentBuffer[h][w] + 1) % MODULO; // bring cell to life\\n }\\n else { // else cell remains dead\\n backBuffer[h][w] = currentBuffer[h][w];\\n }\\n }\\n }\\n }\\n\\n this.currentBufferIndex = this.currentBufferIndex === 0 ? 1 : 0;\\n }\",\n \"function updateCount( x, y, regions, last_regions) {\\n var occupied = []; \\n if (typeof last_regions == 'undefined') last_regions = []; // Added this because we have arbitrary track ids, making it hard to guarantee a value here\\n for (var r in regions) {\\n // If already in the region, expand the boundaries\\n var adj_lr = [0,0]; \\n var adj_ul = [0,0]; \\n var A = 0.12; // A 12% proportional \\\"expansion\\\" of the border to trigger leaving\\n if (useRegionStickiness && last_regions.indexOf(r) > -1) { \\n adj_lr[0] = A*regions[r].height;\\n adj_lr[1] = A*regions[r].width;\\n adj_ul[0] = -1*A*regions[r].height;\\n adj_ul[1] = -1*A*regions[r].width;\\n } \\n \\n // Now, use the adjusted region boundaries in the test\\n //\\n if (y >= regions[r].ul[0]+adj_ul[0] && y <= regions[r].lr[0]+adj_lr[0] && // These checks are for a graphics coordinate\\n x >= regions[r].ul[1]+adj_ul[1] && x <= regions[r].lr[1]+adj_lr[1] ) { // system with (0,0) in the top left\\n regions[r].count += 1; \\n occupied.push(r); \\n }\\n } \\n return occupied; \\n}\",\n \"defineStates() {\\n // Maximum stack calls\\n let maxStackCalls = 400;\\n\\n // Acquisition lambdas\\n let queue = i => {\\n return this.text.charAt(i);\\n };\\n let store = c => {\\n this.buffer += c;\\n };\\n let flush = t => {\\n if (this.buffer.length > 0) {\\n // Special treatment for id tokens that contain only numbers\\n let numberToken = t == Token.ID && !isNaN(this.buffer);\\n this.list.push(\\n new Token(numberToken ? Token.NUMBER : t, this.buffer, line)\\n );\\n }\\n this.buffer = \\\"\\\";\\n };\\n\\n // Line number updater\\n let line = 0;\\n let newline = i => {\\n line++;\\n };\\n\\n // State definitions\\n let state = {\\n // Transference function\\n transference: (i, phase) => {\\n if (i < this.text.length) {\\n // Prevent stack overflow\\n if (i % maxStackCalls == 0 && phase != true) {\\n this.index = i;\\n return;\\n }\\n\\n // Transfer to the identifier state\\n state.identifier(i);\\n } else {\\n flush(Token.ID);\\n this.index = i;\\n return;\\n }\\n },\\n\\n // For IDs\\n identifier: (i, phase) => {\\n let c = queue(i);\\n\\n switch (c) {\\n case '\\\"':\\n case \\\"'\\\":\\n flush(Token.ID);\\n state.string(i + 1, c);\\n return;\\n case \\\"\\\\\\\\\\\":\\n flush(Token.ID);\\n state.extension(i);\\n return;\\n case \\\" \\\":\\n case \\\";\\\":\\n flush(Token.ID);\\n state.delimiter(i);\\n return;\\n case \\\"#\\\":\\n flush(Token.ID);\\n state.comment(i + 1);\\n return;\\n case \\\"(\\\":\\n case \\\")\\\":\\n flush(Token.ID);\\n state.parenthesis(i, c);\\n return;\\n default:\\n store(c);\\n state.transference(i + 1);\\n }\\n },\\n\\n // For strings\\n string: (i, phase) => {\\n let c = queue(i);\\n\\n switch (c) {\\n case phase:\\n flush(Token.STRING);\\n state.transference(i + 1, c);\\n return;\\n case \\\"\\\\\\\\\\\":\\n state.extension(i + 1);\\n return;\\n default:\\n store(c);\\n state.string(i + 1, phase);\\n }\\n },\\n\\n // For escape characters\\n extension: (i, phase) => {\\n let c = queue(i);\\n\\n store(\\\"\\\\\\\\\\\" + c);\\n state.transference(i + 1);\\n },\\n\\n // For comments\\n comment: (i, phase) => {\\n let c = queue(i);\\n\\n switch (c) {\\n case \\\";\\\":\\n newline();\\n flush(Token.COMMENT);\\n state.transference(i + 1);\\n return;\\n default:\\n store(c);\\n state.comment(i + 1);\\n }\\n },\\n\\n // For parenthesis\\n parenthesis: (i, phase) => {\\n let c = queue(i);\\n\\n store(c);\\n if (phase == \\\"(\\\") flush(Token.OPEN);\\n else if (phase == \\\")\\\") flush(Token.CLOSE);\\n state.transference(i + 1);\\n },\\n\\n // For whitespaces and linefeeds\\n delimiter: (i, phase) => {\\n let c = queue(i);\\n\\n switch (c) {\\n case \\\";\\\":\\n newline();\\n case \\\" \\\":\\n store(c);\\n state.delimiter(i + 1);\\n return;\\n default:\\n flush(Token.SPACE);\\n state.transference(i);\\n }\\n }\\n };\\n this.state = state;\\n }\",\n \"step() {\\n // !!!! IMPLEMENT ME !!!!\\n const currentCells = this.cells[this.activeBuffer];\\n const nextCells = this.cells[this.activeBuffer === 1 ? 0 : 1];\\n\\n for (let h = 0; h < this.height; h++) {\\n for (let w = 0; w < this.width; w++) {\\n const count = this.getLiveNeighborCount.call(this, h, w);\\n\\n if (currentCells[h][w]) {\\n if (count < 2 || count > 3) {\\n nextCells[h][w] = false;\\n } else {\\n nextCells[h][w] = true;\\n }\\n } else {\\n if (count === 3) {\\n nextCells[h][w] = true;\\n } else {\\n nextCells[h][w] = false;\\n }\\n }\\n }\\n }\\n this.activeBuffer = this.activeBuffer === 1 ? 0 : 1;\\n }\",\n \"function countUpLeft(x,y){\\n\\tfor(let i = y; i > 0; i--){\\n\\t\\tfor(let j = x; j > 0; j--){\\n\\t\\t\\tif(boardArray[x + y * columns] == boardArray[(j - 1) + (i - 1) * columns]){\\n\\t\\t\\t\\twinConditionCount++;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tif(i - 1 > 0){\\n\\t\\t\\t\\ti--;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"function nextState(r, c) {\\n // number of on neightbors to the given call\\n var onNeighbors = 0;\\n // if given is alive itself count it\\n if (field[r][c]) {\\n onNeighbors -= 1;\\n }\\n // count alive neightbors\\n for (var row = -1 ; row <= 1; row += 1) {\\n for (var col = -1; col <= 1; col += 1) {\\n if(field[r + row]) {\\n }\\n if(field[r + row] && field[r + row][c + col]) {\\n onNeighbors += 1;\\n }\\n }\\n }\\n // return based on rules\\n return (onNeighbors === 3) || ((onNeighbors === 2) && field[r][c]);\\n }\",\n \"countLiveNeighbors(x, y, grid) {\\n const height = grid.length;\\n const width = grid[0].length;\\n const size = { width, height };\\n let count = 0;\\n let row;\\n \\n let prevY = y - 1;\\n let nextY = y + 1;\\n let prevX = x - 1;\\n let nextX = x + 1;\\n \\n if (prevY < 0) {\\n prevY = size.height -1;\\n }\\n if (nextY >= size.height) {\\n nextY = 0; \\n } \\n if (prevX < 0) {\\n prevX = size.width - 1;\\n }\\n if (nextX >= size.width) {\\n nextX = 0;\\n }\\n\\n // count cells in previous row\\n row = grid[prevY];\\n if (row) {\\n if (row[prevX] && row[prevX] === \\\"live\\\") {\\n count++;\\n }\\n if (row[x] && row[x] === \\\"live\\\") {\\n count++;\\n }\\n if (row[nextX] && row[nextX] === \\\"live\\\") {\\n count++;\\n }\\n }\\n // count cells in current row\\n row = grid[y];\\n if (row[prevX] && row[prevX] === \\\"live\\\") {\\n count++;\\n }\\n if (row[nextX] && row[nextX] === \\\"live\\\") {\\n count++;\\n }\\n // count cells in next row\\n row = grid[nextY];\\n if (row) {\\n if (row[prevX] && row[prevX] === \\\"live\\\") {\\n count++;\\n }\\n if (row[x] && row[x] === \\\"live\\\") {\\n count++;\\n }\\n if (row[nextX] && row[nextX] === \\\"live\\\") {\\n count++;\\n }\\n }\\n return count;\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.5969984","0.5400206","0.53992504","0.52994275","0.52473944","0.51983064","0.5144702","0.50957656","0.5084866","0.49859744","0.49690977","0.49683338","0.49647772","0.49170303","0.49112752","0.49109912","0.48912933","0.4882949","0.48457623","0.48057747","0.47958195","0.47929084","0.4790392","0.47896555","0.47430366","0.47345334","0.47339386","0.47301838","0.47208932","0.47195673","0.4719561","0.47130474","0.47043794","0.4696275","0.468874","0.46714982","0.4669726","0.4666194","0.46634883","0.4663471","0.4656054","0.46552128","0.46450177","0.4643916","0.46400893","0.46281135","0.46268323","0.46094218","0.46014383","0.4598292","0.45967552","0.45930696","0.45790714","0.4578122","0.456688","0.45481133","0.45466504","0.45423812","0.45323068","0.45295915","0.452545","0.44866046","0.44857803","0.4479348","0.4479188","0.44769537","0.44756314","0.44657695","0.44550267","0.44475666","0.44374275","0.44339007","0.44327608","0.44321385","0.44262853","0.44227716","0.44193894","0.4416535","0.44096798","0.44088832","0.4403573","0.43988955","0.4394963","0.43863028","0.4381686","0.43806866","0.4380275","0.43779328","0.43769795","0.43683612","0.43672422","0.43590152","0.4354501","0.43486375","0.43451956","0.43441647","0.43412277","0.43409467","0.4338518","0.43337762"],"string":"[\n \"0.5969984\",\n \"0.5400206\",\n \"0.53992504\",\n \"0.52994275\",\n \"0.52473944\",\n \"0.51983064\",\n \"0.5144702\",\n \"0.50957656\",\n \"0.5084866\",\n \"0.49859744\",\n \"0.49690977\",\n \"0.49683338\",\n \"0.49647772\",\n \"0.49170303\",\n \"0.49112752\",\n \"0.49109912\",\n \"0.48912933\",\n \"0.4882949\",\n \"0.48457623\",\n \"0.48057747\",\n \"0.47958195\",\n \"0.47929084\",\n \"0.4790392\",\n \"0.47896555\",\n \"0.47430366\",\n \"0.47345334\",\n \"0.47339386\",\n \"0.47301838\",\n \"0.47208932\",\n \"0.47195673\",\n \"0.4719561\",\n \"0.47130474\",\n \"0.47043794\",\n \"0.4696275\",\n \"0.468874\",\n \"0.46714982\",\n \"0.4669726\",\n \"0.4666194\",\n \"0.46634883\",\n \"0.4663471\",\n \"0.4656054\",\n \"0.46552128\",\n \"0.46450177\",\n \"0.4643916\",\n \"0.46400893\",\n \"0.46281135\",\n \"0.46268323\",\n \"0.46094218\",\n \"0.46014383\",\n \"0.4598292\",\n \"0.45967552\",\n \"0.45930696\",\n \"0.45790714\",\n \"0.4578122\",\n \"0.456688\",\n \"0.45481133\",\n \"0.45466504\",\n \"0.45423812\",\n \"0.45323068\",\n \"0.45295915\",\n \"0.452545\",\n \"0.44866046\",\n \"0.44857803\",\n \"0.4479348\",\n \"0.4479188\",\n \"0.44769537\",\n \"0.44756314\",\n \"0.44657695\",\n \"0.44550267\",\n \"0.44475666\",\n \"0.44374275\",\n \"0.44339007\",\n \"0.44327608\",\n \"0.44321385\",\n \"0.44262853\",\n \"0.44227716\",\n \"0.44193894\",\n \"0.4416535\",\n \"0.44096798\",\n \"0.44088832\",\n \"0.4403573\",\n \"0.43988955\",\n \"0.4394963\",\n \"0.43863028\",\n \"0.4381686\",\n \"0.43806866\",\n \"0.4380275\",\n \"0.43779328\",\n \"0.43769795\",\n \"0.43683612\",\n \"0.43672422\",\n \"0.43590152\",\n \"0.4354501\",\n \"0.43486375\",\n \"0.43451956\",\n \"0.43441647\",\n \"0.43412277\",\n \"0.43409467\",\n \"0.4338518\",\n \"0.43337762\"\n]"},"document_score":{"kind":"string","value":"0.4417581"},"document_rank":{"kind":"string","value":"77"}}},{"rowIdx":3071,"cells":{"query":{"kind":"string","value":"Taken from underscore JS"},"document":{"kind":"string","value":"function isNaN(obj) {\r\n\t\t return Object.prototype.toString.call(obj) === '[object Number]' && obj !== +obj;\r\n\t\t}"},"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 baseLodash() {}","function baseLodash() {}","function baseLodash() {}","function baseLodash() {}","function baseLodash() {}","function baseLodash(){}","function baseLodash() {// No operation performed.\n}","function baseLodash() {// No operation performed.\n}","function baseLodash(){}// No operation performed.","function baseLodash(){}// No operation performed.","function baseLodash(){}// No operation performed.","function baseLodash(){}// No operation performed.","function baseLodash(){}// No operation performed.","function baseLodash(){}// No operation performed.","function baseLodash(){}// No operation performed.","function baseLodash(){}// No operation performed.","function _() { }","function _() { }","function _() { }","function _() { }","function _() { }","function baseLodash() {\n }","function baseLodash() {// No operation performed.\n }","function _() { undefined; }","function u(e){if(e)return _(e)}","function baseLodash() {// No operation performed.\n }","function baseLodash(){\n// No operation performed.\n}","function baseLodash(){\n// No operation performed.\n}","function baseLodash(){// No operation performed.\n}","function baseLodash(){// No operation performed.\n}","function et(t,e){return new _(t,e)}","function __it() {}","function replace_with_underscore(l) {\n var r = l.replace(/[^a-z0-9\\s]/gi, '_').replace(/ /g,'_');\n return r;\n}","function baseLodash(){} // No operation performed.","function baseLodash(){} // No operation performed.","function baseLodash() {\n // No operation performed.\n}","function $t(t,e){Object.keys(t).forEach(function(n){return e(t[n],n)})}","function underscore(content) {\n return `__${content}__`;\n}","function underscore (strings, ...values) {\n return strings[0].replace(/\\s/g, '_');\n}","function underscore (strings, ...values) {\n return strings[0].replace(/\\s/g, '_');\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}","function baseLodash() {\n // No operation performed.\n}"],"string":"[\n \"function baseLodash() {}\",\n \"function baseLodash() {}\",\n \"function baseLodash() {}\",\n \"function baseLodash() {}\",\n \"function baseLodash() {}\",\n \"function baseLodash(){}\",\n \"function baseLodash() {// No operation performed.\\n}\",\n \"function baseLodash() {// No operation performed.\\n}\",\n \"function baseLodash(){}// No operation performed.\",\n \"function baseLodash(){}// No operation performed.\",\n \"function baseLodash(){}// No operation performed.\",\n \"function baseLodash(){}// No operation performed.\",\n \"function baseLodash(){}// No operation performed.\",\n \"function baseLodash(){}// No operation performed.\",\n \"function baseLodash(){}// No operation performed.\",\n \"function baseLodash(){}// No operation performed.\",\n \"function _() { }\",\n \"function _() { }\",\n \"function _() { }\",\n \"function _() { }\",\n \"function _() { }\",\n \"function baseLodash() {\\n }\",\n \"function baseLodash() {// No operation performed.\\n }\",\n \"function _() { undefined; }\",\n \"function u(e){if(e)return _(e)}\",\n \"function baseLodash() {// No operation performed.\\n }\",\n \"function baseLodash(){\\n// No operation performed.\\n}\",\n \"function baseLodash(){\\n// No operation performed.\\n}\",\n \"function baseLodash(){// No operation performed.\\n}\",\n \"function baseLodash(){// No operation performed.\\n}\",\n \"function et(t,e){return new _(t,e)}\",\n \"function __it() {}\",\n \"function replace_with_underscore(l) {\\n var r = l.replace(/[^a-z0-9\\\\s]/gi, '_').replace(/ /g,'_');\\n return r;\\n}\",\n \"function baseLodash(){} // No operation performed.\",\n \"function baseLodash(){} // No operation performed.\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function $t(t,e){Object.keys(t).forEach(function(n){return e(t[n],n)})}\",\n \"function underscore(content) {\\n return `__${content}__`;\\n}\",\n \"function underscore (strings, ...values) {\\n return strings[0].replace(/\\\\s/g, '_');\\n}\",\n \"function underscore (strings, ...values) {\\n return strings[0].replace(/\\\\s/g, '_');\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\",\n \"function baseLodash() {\\n // No operation performed.\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.6445014","0.6445014","0.6445014","0.6445014","0.6445014","0.62266994","0.61520755","0.61520755","0.60981864","0.60981864","0.60981864","0.60981864","0.60981864","0.60981864","0.60981864","0.60981864","0.60676235","0.60676235","0.60676235","0.60676235","0.60676235","0.6034641","0.6005005","0.58636254","0.586004","0.58553535","0.57733244","0.57733244","0.5747148","0.5747148","0.55556893","0.552579","0.55119705","0.54911137","0.54911137","0.54828936","0.54482645","0.54132265","0.541048","0.5374695","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662","0.535662"],"string":"[\n \"0.6445014\",\n \"0.6445014\",\n \"0.6445014\",\n \"0.6445014\",\n \"0.6445014\",\n \"0.62266994\",\n \"0.61520755\",\n \"0.61520755\",\n \"0.60981864\",\n \"0.60981864\",\n \"0.60981864\",\n \"0.60981864\",\n \"0.60981864\",\n \"0.60981864\",\n \"0.60981864\",\n \"0.60981864\",\n \"0.60676235\",\n \"0.60676235\",\n \"0.60676235\",\n \"0.60676235\",\n \"0.60676235\",\n \"0.6034641\",\n \"0.6005005\",\n \"0.58636254\",\n \"0.586004\",\n \"0.58553535\",\n \"0.57733244\",\n \"0.57733244\",\n \"0.5747148\",\n \"0.5747148\",\n \"0.55556893\",\n \"0.552579\",\n \"0.55119705\",\n \"0.54911137\",\n \"0.54911137\",\n \"0.54828936\",\n \"0.54482645\",\n \"0.54132265\",\n \"0.541048\",\n \"0.5374695\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\",\n \"0.535662\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":3072,"cells":{"query":{"kind":"string","value":"Takes in a byte array, a qr version number and an error correction level. Returns decoded data."},"document":{"kind":"string","value":"function decodeQRdata(data, version, ecl) {\r\n\t\t var symbolSequence = -1;\r\n\t\t var parityData = -1;\r\n\t\t var bits = new bitstream_1.BitStream(data);\r\n\t\t var result = { val: [] }; // Have to pass this around so functions can share a reference to a number[]\r\n\t\t var fc1InEffect = false;\r\n\t\t var mode;\r\n\t\t while (mode != TERMINATOR_MODE) {\r\n\t\t // While still another segment to read...\r\n\t\t if (bits.available() < 4) {\r\n\t\t // OK, assume we're done. Really, a TERMINATOR mode should have been recorded here\r\n\t\t mode = TERMINATOR_MODE;\r\n\t\t }\r\n\t\t else {\r\n\t\t mode = modeForBits(bits.readBits(4)); // mode is encoded by 4 bits\r\n\t\t }\r\n\t\t if (mode != TERMINATOR_MODE) {\r\n\t\t if (mode == FNC1_FIRST_POSITION_MODE || mode == FNC1_SECOND_POSITION_MODE) {\r\n\t\t // We do little with FNC1 except alter the parsed result a bit according to the spec\r\n\t\t fc1InEffect = true;\r\n\t\t }\r\n\t\t else if (mode == STRUCTURED_APPEND_MODE) {\r\n\t\t if (bits.available() < 16) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t // not really supported; but sequence number and parity is added later to the result metadata\r\n\t\t // Read next 8 bits (symbol sequence #) and 8 bits (parity data), then continue\r\n\t\t symbolSequence = bits.readBits(8);\r\n\t\t parityData = bits.readBits(8);\r\n\t\t }\r\n\t\t else if (mode == ECI_MODE) {\r\n\t\t // Ignore since we don't do character encoding in JS\r\n\t\t var value = parseECIValue(bits);\r\n\t\t if (value < 0 || value > 30) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t }\r\n\t\t else {\r\n\t\t // First handle Hanzi mode which does not start with character count\r\n\t\t if (mode == HANZI_MODE) {\r\n\t\t //chinese mode contains a sub set indicator right after mode indicator\r\n\t\t var subset = bits.readBits(4);\r\n\t\t var countHanzi = bits.readBits(mode.getCharacterCountBits(version));\r\n\t\t if (subset == GB2312_SUBSET) {\r\n\t\t if (!decodeHanziSegment(bits, result, countHanzi)) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t }\r\n\t\t }\r\n\t\t else {\r\n\t\t // \"Normal\" QR code modes:\r\n\t\t // How many characters will follow, encoded in this mode?\r\n\t\t var count = bits.readBits(mode.getCharacterCountBits(version));\r\n\t\t if (mode == NUMERIC_MODE) {\r\n\t\t if (!decodeNumericSegment(bits, result, count)) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t }\r\n\t\t else if (mode == ALPHANUMERIC_MODE) {\r\n\t\t if (!decodeAlphanumericSegment(bits, result, count, fc1InEffect)) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t }\r\n\t\t else if (mode == BYTE_MODE) {\r\n\t\t if (!decodeByteSegment(bits, result, count)) {\r\n\t\t return null;\r\n\t\t }\r\n\t\t }\r\n\t\t else if (mode == KANJI_MODE) {\r\n\t\t }\r\n\t\t else {\r\n\t\t return null;\r\n\t\t }\r\n\t\t }\r\n\t\t }\r\n\t\t }\r\n\t\t }\r\n\t\t return result.val;\r\n\t\t}"},"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 QR8bitByte(data) {\n this.mode = QRMode.MODE_8BIT_BYTE;\n this.data = data;\n this.parsedData = [];\n\n // Added to support UTF-8 Characters\n for (var i = 0, l = this.data.length; i < l; i++) {\n var byteArray = [];\n var code = this.data.charCodeAt(i);\n\n if (code > 0x10000) {\n byteArray[0] = 0xF0 | ((code & 0x1C0000) >>> 18);\n byteArray[1] = 0x80 | ((code & 0x3F000) >>> 12);\n byteArray[2] = 0x80 | ((code & 0xFC0) >>> 6);\n byteArray[3] = 0x80 | (code & 0x3F);\n } else if (code > 0x800) {\n byteArray[0] = 0xE0 | ((code & 0xF000) >>> 12);\n byteArray[1] = 0x80 | ((code & 0xFC0) >>> 6);\n byteArray[2] = 0x80 | (code & 0x3F);\n } else if (code > 0x80) {\n byteArray[0] = 0xC0 | ((code & 0x7C0) >>> 6);\n byteArray[1] = 0x80 | (code & 0x3F);\n } else {\n byteArray[0] = code;\n }\n\n this.parsedData.push(byteArray);\n }\n\n this.parsedData = Array.prototype.concat.apply([], this.parsedData);\n\n if (this.parsedData.length != this.data.length) {\n this.parsedData.unshift(191);\n this.parsedData.unshift(187);\n this.parsedData.unshift(239);\n }\n }","function QR8bitByte(data) {\n\t\tthis.mode = QRMode.MODE_8BIT_BYTE;\n\t\tthis.data = data;\n\t\tthis.parsedData = [];\n\n\t\t// Added to support UTF-8 Characters\n\t\tfor (var i = 0, l = this.data.length; i < l; i++) {\n\t\t\tvar byteArray = [];\n\t\t\tvar code = this.data.charCodeAt(i);\n\n\t\t\tif (code > 0x10000) {\n\t\t\t\tbyteArray[0] = 0xF0 | ((code & 0x1C0000) >>> 18);\n\t\t\t\tbyteArray[1] = 0x80 | ((code & 0x3F000) >>> 12);\n\t\t\t\tbyteArray[2] = 0x80 | ((code & 0xFC0) >>> 6);\n\t\t\t\tbyteArray[3] = 0x80 | (code & 0x3F);\n\t\t\t} else if (code > 0x800) {\n\t\t\t\tbyteArray[0] = 0xE0 | ((code & 0xF000) >>> 12);\n\t\t\t\tbyteArray[1] = 0x80 | ((code & 0xFC0) >>> 6);\n\t\t\t\tbyteArray[2] = 0x80 | (code & 0x3F);\n\t\t\t} else if (code > 0x80) {\n\t\t\t\tbyteArray[0] = 0xC0 | ((code & 0x7C0) >>> 6);\n\t\t\t\tbyteArray[1] = 0x80 | (code & 0x3F);\n\t\t\t} else {\n\t\t\t\tbyteArray[0] = code;\n\t\t\t}\n\n\t\t\tthis.parsedData.push(byteArray);\n\t\t}\n\n\t\tthis.parsedData = Array.prototype.concat.apply([], this.parsedData);\n\n\t\tif (this.parsedData.length != this.data.length) {\n\t\t\tthis.parsedData.unshift(191);\n\t\t\tthis.parsedData.unshift(187);\n\t\t\tthis.parsedData.unshift(239);\n\t\t}\n\t}","function QR8bitByte(data) {\n\t\tthis.mode = QRMode.MODE_8BIT_BYTE;\n\t\tthis.data = data;\n\t\tthis.parsedData = [];\n\n\t\t// Added to support UTF-8 Characters\n\t\tfor (var i = 0, l = this.data.length; i < l; i++) {\n\t\t\tvar byteArray = [];\n\t\t\tvar code = this.data.charCodeAt(i);\n\n\t\t\tif (code > 0x10000) {\n\t\t\t\tbyteArray[0] = 0xF0 | ((code & 0x1C0000) >>> 18);\n\t\t\t\tbyteArray[1] = 0x80 | ((code & 0x3F000) >>> 12);\n\t\t\t\tbyteArray[2] = 0x80 | ((code & 0xFC0) >>> 6);\n\t\t\t\tbyteArray[3] = 0x80 | (code & 0x3F);\n\t\t\t} else if (code > 0x800) {\n\t\t\t\tbyteArray[0] = 0xE0 | ((code & 0xF000) >>> 12);\n\t\t\t\tbyteArray[1] = 0x80 | ((code & 0xFC0) >>> 6);\n\t\t\t\tbyteArray[2] = 0x80 | (code & 0x3F);\n\t\t\t} else if (code > 0x80) {\n\t\t\t\tbyteArray[0] = 0xC0 | ((code & 0x7C0) >>> 6);\n\t\t\t\tbyteArray[1] = 0x80 | (code & 0x3F);\n\t\t\t} else {\n\t\t\t\tbyteArray[0] = code;\n\t\t\t}\n\n\t\t\tthis.parsedData.push(byteArray);\n\t\t}\n\n\t\tthis.parsedData = Array.prototype.concat.apply([], this.parsedData);\n\n\t\tif (this.parsedData.length != this.data.length) {\n\t\t\tthis.parsedData.unshift(191);\n\t\t\tthis.parsedData.unshift(187);\n\t\t\tthis.parsedData.unshift(239);\n\t\t}\n\t}","function QR8bitByte(data) {\n\t\tthis.mode = QRMode.MODE_8BIT_BYTE;\n\t\tthis.data = data;\n\t\tthis.parsedData = [];\n\n\t\t// Added to support UTF-8 Characters\n\t\tfor (var i = 0, l = this.data.length; i < l; i++) {\n\t\t\tvar byteArray = [];\n\t\t\tvar code = this.data.charCodeAt(i);\n\n\t\t\tif (code > 0x10000) {\n\t\t\t\tbyteArray[0] = 0xF0 | ((code & 0x1C0000) >>> 18);\n\t\t\t\tbyteArray[1] = 0x80 | ((code & 0x3F000) >>> 12);\n\t\t\t\tbyteArray[2] = 0x80 | ((code & 0xFC0) >>> 6);\n\t\t\t\tbyteArray[3] = 0x80 | (code & 0x3F);\n\t\t\t} else if (code > 0x800) {\n\t\t\t\tbyteArray[0] = 0xE0 | ((code & 0xF000) >>> 12);\n\t\t\t\tbyteArray[1] = 0x80 | ((code & 0xFC0) >>> 6);\n\t\t\t\tbyteArray[2] = 0x80 | (code & 0x3F);\n\t\t\t} else if (code > 0x80) {\n\t\t\t\tbyteArray[0] = 0xC0 | ((code & 0x7C0) >>> 6);\n\t\t\t\tbyteArray[1] = 0x80 | (code & 0x3F);\n\t\t\t} else {\n\t\t\t\tbyteArray[0] = code;\n\t\t\t}\n\n\t\t\tthis.parsedData.push(byteArray);\n\t\t}\n\n\t\tthis.parsedData = Array.prototype.concat.apply([], this.parsedData);\n\n\t\tif (this.parsedData.length != this.data.length) {\n\t\t\tthis.parsedData.unshift(191);\n\t\t\tthis.parsedData.unshift(187);\n\t\t\tthis.parsedData.unshift(239);\n\t\t}\n\t}","_parseQRCodeData(encodedString) {\n try {\n const compressedBytes = base32.decode.asBytes(encodedString);\n return this._decompressAndParseJSON(compressedBytes);\n } catch(base32DecodingError) {\n throw new Error(\"Unable to parse QR code (Base32 decode error).\");\n }\n }","function QR8bitByte(data) {\n\t\t\tthis.mode = QRMode.MODE_8BIT_BYTE;\n\t\t\tthis.data = data;\n\t\t\tthis.parsedData = [];\n\n\t\t\t// Added to support UTF-8 Characters\n\t\t\tfor (var i = 0, l = this.data.length; i < l; i++) {\n\t\t\t\tvar byteArray = [];\n\t\t\t\tvar code = this.data.charCodeAt(i);\n\n\t\t\t\tif (code > 0x10000) {\n\t\t\t\t\tbyteArray[0] = 0xF0 | (code & 0x1C0000) >>> 18;\n\t\t\t\t\tbyteArray[1] = 0x80 | (code & 0x3F000) >>> 12;\n\t\t\t\t\tbyteArray[2] = 0x80 | (code & 0xFC0) >>> 6;\n\t\t\t\t\tbyteArray[3] = 0x80 | code & 0x3F;\n\t\t\t\t} else if (code > 0x800) {\n\t\t\t\t\tbyteArray[0] = 0xE0 | (code & 0xF000) >>> 12;\n\t\t\t\t\tbyteArray[1] = 0x80 | (code & 0xFC0) >>> 6;\n\t\t\t\t\tbyteArray[2] = 0x80 | code & 0x3F;\n\t\t\t\t} else if (code > 0x80) {\n\t\t\t\t\tbyteArray[0] = 0xC0 | (code & 0x7C0) >>> 6;\n\t\t\t\t\tbyteArray[1] = 0x80 | code & 0x3F;\n\t\t\t\t} else {\n\t\t\t\t\tbyteArray[0] = code;\n\t\t\t\t}\n\n\t\t\t\tthis.parsedData.push(byteArray);\n\t\t\t}\n\n\t\t\tthis.parsedData = Array.prototype.concat.apply([], this.parsedData);\n\n\t\t\tif (this.parsedData.length != this.data.length) {\n\t\t\t\tthis.parsedData.unshift(191);\n\t\t\t\tthis.parsedData.unshift(187);\n\t\t\t\tthis.parsedData.unshift(239);\n\t\t\t}\n\t\t}","function QR8bitByte(data) {\n\t\t\tthis.mode = QRMode.MODE_8BIT_BYTE;\n\t\t\tthis.data = data;\n\t\t\tthis.parsedData = [];\n\n\t\t\t// Added to support UTF-8 Characters\n\t\t\tfor (var i = 0, l = this.data.length; i < l; i++) {\n\t\t\t\tvar byteArray = [];\n\t\t\t\tvar code = this.data.charCodeAt(i);\n\n\t\t\t\tif (code > 0x10000) {\n\t\t\t\t\tbyteArray[0] = 0xF0 | ((code & 0x1C0000) >>> 18);\n\t\t\t\t\tbyteArray[1] = 0x80 | ((code & 0x3F000) >>> 12);\n\t\t\t\t\tbyteArray[2] = 0x80 | ((code & 0xFC0) >>> 6);\n\t\t\t\t\tbyteArray[3] = 0x80 | (code & 0x3F);\n\t\t\t\t} else if (code > 0x800) {\n\t\t\t\t\tbyteArray[0] = 0xE0 | ((code & 0xF000) >>> 12);\n\t\t\t\t\tbyteArray[1] = 0x80 | ((code & 0xFC0) >>> 6);\n\t\t\t\t\tbyteArray[2] = 0x80 | (code & 0x3F);\n\t\t\t\t} else if (code > 0x80) {\n\t\t\t\t\tbyteArray[0] = 0xC0 | ((code & 0x7C0) >>> 6);\n\t\t\t\t\tbyteArray[1] = 0x80 | (code & 0x3F);\n\t\t\t\t} else {\n\t\t\t\t\tbyteArray[0] = code;\n\t\t\t\t}\n\n\t\t\t\tthis.parsedData.push(byteArray);\n\t\t\t}\n\n\t\t\tthis.parsedData = Array.prototype.concat.apply([], this.parsedData);\n\n\t\t\tif (this.parsedData.length != this.data.length) {\n\t\t\t\tthis.parsedData.unshift(191);\n\t\t\t\tthis.parsedData.unshift(187);\n\t\t\t\tthis.parsedData.unshift(239);\n\t\t\t}\n\t\t}","function parseQr (qrText) {\n // TODO: Could use base43 instead of hex for efficiency\n // Could use protocol buffers instead of JSON for even more efficiency\n var buf = new Buffer(qrText, 'hex')\n var rec = JSON.parse(buf)\n rec.tx = parseTx(rec.tx)\n}","function QRCode() {\n\n var undefined$1;\n /** Node.js global 检测. */\n\n var freeGlobal = (typeof global === \"undefined\" ? \"undefined\" : _typeof(global)) == 'object' && global && global.Object === Object && global;\n /** `self` å˜é‡æ£€æµ‹. */\n\n var freeSelf = (typeof self === \"undefined\" ? \"undefined\" : _typeof(self)) == 'object' && self && self.Object === Object && self;\n /** 全局对象检测. */\n\n var root = freeGlobal || freeSelf || Function('return this')();\n /** `exports` å˜é‡æ£€æµ‹. */\n\n var freeExports = (typeof exports === \"undefined\" ? \"undefined\" : _typeof(exports)) == 'object' && exports && !exports.nodeType && exports;\n /** `module` å˜é‡æ£€æµ‹. */\n\n var freeModule = freeExports && (typeof module === \"undefined\" ? \"undefined\" : _typeof(module)) == 'object' && module && !module.nodeType && module;\n var _QRCode = root.QRCode;\n var QRCode;\n\n function QR8bitByte(data, binary, utf8WithoutBOM) {\n this.mode = QRMode.MODE_8BIT_BYTE;\n this.data = data;\n this.parsedData = []; // Added to support UTF-8 Characters\n\n for (var i = 0, l = this.data.length; i < l; i++) {\n var byteArray = [];\n var code = this.data.charCodeAt(i);\n\n if (binary) {\n byteArray[0] = code;\n } else {\n if (code > 0x10000) {\n byteArray[0] = 0xf0 | (code & 0x1c0000) >>> 18;\n byteArray[1] = 0x80 | (code & 0x3f000) >>> 12;\n byteArray[2] = 0x80 | (code & 0xfc0) >>> 6;\n byteArray[3] = 0x80 | code & 0x3f;\n } else if (code > 0x800) {\n byteArray[0] = 0xe0 | (code & 0xf000) >>> 12;\n byteArray[1] = 0x80 | (code & 0xfc0) >>> 6;\n byteArray[2] = 0x80 | code & 0x3f;\n } else if (code > 0x80) {\n byteArray[0] = 0xc0 | (code & 0x7c0) >>> 6;\n byteArray[1] = 0x80 | code & 0x3f;\n } else {\n byteArray[0] = code;\n }\n }\n\n this.parsedData.push(byteArray);\n }\n\n this.parsedData = Array.prototype.concat.apply([], this.parsedData);\n\n if (!utf8WithoutBOM && this.parsedData.length != this.data.length) {\n this.parsedData.unshift(191);\n this.parsedData.unshift(187);\n this.parsedData.unshift(239);\n }\n }\n\n QR8bitByte.prototype = {\n getLength: function getLength(buffer) {\n return this.parsedData.length;\n },\n write: function write(buffer) {\n for (var i = 0, l = this.parsedData.length; i < l; i++) {\n buffer.put(this.parsedData[i], 8);\n }\n }\n };\n\n function QRCodeModel(typeNumber, errorCorrectLevel) {\n this.typeNumber = typeNumber;\n this.errorCorrectLevel = errorCorrectLevel;\n this.modules = null;\n this.moduleCount = 0;\n this.dataCache = null;\n this.dataList = [];\n }\n\n QRCodeModel.prototype = {\n addData: function addData(data, binary, utf8WithoutBOM) {\n var newData = new QR8bitByte(data, binary, utf8WithoutBOM);\n this.dataList.push(newData);\n this.dataCache = null;\n },\n isDark: function isDark(row, col) {\n if (row < 0 || this.moduleCount <= row || col < 0 || this.moduleCount <= col) {\n throw new Error(row + ',' + col);\n }\n\n return this.modules[row][col][0];\n },\n getEye: function getEye(row, col) {\n if (row < 0 || this.moduleCount <= row || col < 0 || this.moduleCount <= col) {\n throw new Error(row + ',' + col);\n }\n\n var block = this.modules[row][col]; // [isDark(ture/false), EyeOuterOrInner(O/I), Position(TL/TR/BL/A) ]\n\n if (block[1]) {\n var type = 'P' + block[1] + '_' + block[2]; //PO_TL, PI_TL, PO_TR, PI_TR, PO_BL, PI_BL\n\n if (block[2] == 'A') {\n type = 'A' + block[1]; // AI, AO\n }\n\n return {\n isDark: block[0],\n type: type\n };\n } else {\n return null;\n }\n },\n getModuleCount: function getModuleCount() {\n return this.moduleCount;\n },\n make: function make() {\n this.makeImpl(false, this.getBestMaskPattern());\n },\n makeImpl: function makeImpl(test, maskPattern) {\n this.moduleCount = this.typeNumber * 4 + 17;\n this.modules = new Array(this.moduleCount);\n\n for (var row = 0; row < this.moduleCount; row++) {\n this.modules[row] = new Array(this.moduleCount);\n\n for (var col = 0; col < this.moduleCount; col++) {\n this.modules[row][col] = []; // [isDark(ture/false), EyeOuterOrInner(O/I), Position(TL/TR/BL) ]\n }\n }\n\n this.setupPositionProbePattern(0, 0, 'TL'); // TopLeft, TL\n\n this.setupPositionProbePattern(this.moduleCount - 7, 0, 'BL'); // BotoomLeft, BL\n\n this.setupPositionProbePattern(0, this.moduleCount - 7, 'TR'); // TopRight, TR\n\n this.setupPositionAdjustPattern('A'); // Alignment, A\n\n this.setupTimingPattern();\n this.setupTypeInfo(test, maskPattern);\n\n if (this.typeNumber >= 7) {\n this.setupTypeNumber(test);\n }\n\n if (this.dataCache == null) {\n this.dataCache = QRCodeModel.createData(this.typeNumber, this.errorCorrectLevel, this.dataList);\n }\n\n this.mapData(this.dataCache, maskPattern);\n },\n setupPositionProbePattern: function setupPositionProbePattern(row, col, posName) {\n for (var r = -1; r <= 7; r++) {\n if (row + r <= -1 || this.moduleCount <= row + r) continue;\n\n for (var c = -1; c <= 7; c++) {\n if (col + c <= -1 || this.moduleCount <= col + c) continue;\n\n if (0 <= r && r <= 6 && (c == 0 || c == 6) || 0 <= c && c <= 6 && (r == 0 || r == 6) || 2 <= r && r <= 4 && 2 <= c && c <= 4) {\n this.modules[row + r][col + c][0] = true;\n this.modules[row + r][col + c][2] = posName; // Position\n\n if (r == -0 || c == -0 || r == 6 || c == 6) {\n this.modules[row + r][col + c][1] = 'O'; // Position Outer\n } else {\n this.modules[row + r][col + c][1] = 'I'; // Position Inner\n }\n } else {\n this.modules[row + r][col + c][0] = false;\n }\n }\n }\n },\n getBestMaskPattern: function getBestMaskPattern() {\n var minLostPoint = 0;\n var pattern = 0;\n\n for (var i = 0; i < 8; i++) {\n this.makeImpl(true, i);\n var lostPoint = QRUtil.getLostPoint(this);\n\n if (i == 0 || minLostPoint > lostPoint) {\n minLostPoint = lostPoint;\n pattern = i;\n }\n }\n\n return pattern;\n },\n createMovieClip: function createMovieClip(target_mc, instance_name, depth) {\n var qr_mc = target_mc.createEmptyMovieClip(instance_name, depth);\n var cs = 1;\n this.make();\n\n for (var row = 0; row < this.modules.length; row++) {\n var y = row * cs;\n\n for (var col = 0; col < this.modules[row].length; col++) {\n var x = col * cs;\n var dark = this.modules[row][col][0];\n\n if (dark) {\n qr_mc.beginFill(0, 100);\n qr_mc.moveTo(x, y);\n qr_mc.lineTo(x + cs, y);\n qr_mc.lineTo(x + cs, y + cs);\n qr_mc.lineTo(x, y + cs);\n qr_mc.endFill();\n }\n }\n }\n\n return qr_mc;\n },\n setupTimingPattern: function setupTimingPattern() {\n for (var r = 8; r < this.moduleCount - 8; r++) {\n if (this.modules[r][6][0] != null) {\n continue;\n }\n\n this.modules[r][6][0] = r % 2 == 0;\n }\n\n for (var c = 8; c < this.moduleCount - 8; c++) {\n if (this.modules[6][c][0] != null) {\n continue;\n }\n\n this.modules[6][c][0] = c % 2 == 0;\n }\n },\n setupPositionAdjustPattern: function setupPositionAdjustPattern(posName) {\n var pos = QRUtil.getPatternPosition(this.typeNumber);\n\n for (var i = 0; i < pos.length; i++) {\n for (var j = 0; j < pos.length; j++) {\n var row = pos[i];\n var col = pos[j];\n\n if (this.modules[row][col][0] != null) {\n continue;\n }\n\n for (var r = -2; r <= 2; r++) {\n for (var c = -2; c <= 2; c++) {\n if (r == -2 || r == 2 || c == -2 || c == 2 || r == 0 && c == 0) {\n this.modules[row + r][col + c][0] = true;\n this.modules[row + r][col + c][2] = posName; // Position\n\n if (r == -2 || c == -2 || r == 2 || c == 2) {\n this.modules[row + r][col + c][1] = 'O'; // Position Outer\n } else {\n this.modules[row + r][col + c][1] = 'I'; // Position Inner\n }\n } else {\n this.modules[row + r][col + c][0] = false;\n }\n }\n }\n }\n }\n },\n setupTypeNumber: function setupTypeNumber(test) {\n var bits = QRUtil.getBCHTypeNumber(this.typeNumber);\n\n for (var i = 0; i < 18; i++) {\n var mod = !test && (bits >> i & 1) == 1;\n this.modules[Math.floor(i / 3)][i % 3 + this.moduleCount - 8 - 3][0] = mod;\n }\n\n for (var i = 0; i < 18; i++) {\n var mod = !test && (bits >> i & 1) == 1;\n this.modules[i % 3 + this.moduleCount - 8 - 3][Math.floor(i / 3)][0] = mod;\n }\n },\n setupTypeInfo: function setupTypeInfo(test, maskPattern) {\n var data = this.errorCorrectLevel << 3 | maskPattern;\n var bits = QRUtil.getBCHTypeInfo(data);\n\n for (var i = 0; i < 15; i++) {\n var mod = !test && (bits >> i & 1) == 1;\n\n if (i < 6) {\n this.modules[i][8][0] = mod;\n } else if (i < 8) {\n this.modules[i + 1][8][0] = mod;\n } else {\n this.modules[this.moduleCount - 15 + i][8][0] = mod;\n }\n }\n\n for (var i = 0; i < 15; i++) {\n var mod = !test && (bits >> i & 1) == 1;\n\n if (i < 8) {\n this.modules[8][this.moduleCount - i - 1][0] = mod;\n } else if (i < 9) {\n this.modules[8][15 - i - 1 + 1][0] = mod;\n } else {\n this.modules[8][15 - i - 1][0] = mod;\n }\n }\n\n this.modules[this.moduleCount - 8][8][0] = !test;\n },\n mapData: function mapData(data, maskPattern) {\n var inc = -1;\n var row = this.moduleCount - 1;\n var bitIndex = 7;\n var byteIndex = 0;\n\n for (var col = this.moduleCount - 1; col > 0; col -= 2) {\n if (col == 6) col--;\n\n while (true) {\n for (var c = 0; c < 2; c++) {\n if (this.modules[row][col - c][0] == null) {\n var dark = false;\n\n if (byteIndex < data.length) {\n dark = (data[byteIndex] >>> bitIndex & 1) == 1;\n }\n\n var mask = QRUtil.getMask(maskPattern, row, col - c);\n\n if (mask) {\n dark = !dark;\n }\n\n this.modules[row][col - c][0] = dark;\n bitIndex--;\n\n if (bitIndex == -1) {\n byteIndex++;\n bitIndex = 7;\n }\n }\n }\n\n row += inc;\n\n if (row < 0 || this.moduleCount <= row) {\n row -= inc;\n inc = -inc;\n break;\n }\n }\n }\n }\n };\n QRCodeModel.PAD0 = 0xec;\n QRCodeModel.PAD1 = 0x11;\n\n QRCodeModel.createData = function (typeNumber, errorCorrectLevel, dataList) {\n var rsBlocks = QRRSBlock.getRSBlocks(typeNumber, errorCorrectLevel);\n var buffer = new QRBitBuffer();\n\n for (var i = 0; i < dataList.length; i++) {\n var data = dataList[i];\n buffer.put(data.mode, 4);\n buffer.put(data.getLength(), QRUtil.getLengthInBits(data.mode, typeNumber));\n data.write(buffer);\n }\n\n var totalDataCount = 0;\n\n for (var i = 0; i < rsBlocks.length; i++) {\n totalDataCount += rsBlocks[i].dataCount;\n }\n\n if (buffer.getLengthInBits() > totalDataCount * 8) {\n throw new Error('code length overflow. (' + buffer.getLengthInBits() + '>' + totalDataCount * 8 + ')');\n }\n\n if (buffer.getLengthInBits() + 4 <= totalDataCount * 8) {\n buffer.put(0, 4);\n }\n\n while (buffer.getLengthInBits() % 8 != 0) {\n buffer.putBit(false);\n }\n\n while (true) {\n if (buffer.getLengthInBits() >= totalDataCount * 8) {\n break;\n }\n\n buffer.put(QRCodeModel.PAD0, 8);\n\n if (buffer.getLengthInBits() >= totalDataCount * 8) {\n break;\n }\n\n buffer.put(QRCodeModel.PAD1, 8);\n }\n\n return QRCodeModel.createBytes(buffer, rsBlocks);\n };\n\n QRCodeModel.createBytes = function (buffer, rsBlocks) {\n var offset = 0;\n var maxDcCount = 0;\n var maxEcCount = 0;\n var dcdata = new Array(rsBlocks.length);\n var ecdata = new Array(rsBlocks.length);\n\n for (var r = 0; r < rsBlocks.length; r++) {\n var dcCount = rsBlocks[r].dataCount;\n var ecCount = rsBlocks[r].totalCount - dcCount;\n maxDcCount = Math.max(maxDcCount, dcCount);\n maxEcCount = Math.max(maxEcCount, ecCount);\n dcdata[r] = new Array(dcCount);\n\n for (var i = 0; i < dcdata[r].length; i++) {\n dcdata[r][i] = 0xff & buffer.buffer[i + offset];\n }\n\n offset += dcCount;\n var rsPoly = QRUtil.getErrorCorrectPolynomial(ecCount);\n var rawPoly = new QRPolynomial(dcdata[r], rsPoly.getLength() - 1);\n var modPoly = rawPoly.mod(rsPoly);\n ecdata[r] = new Array(rsPoly.getLength() - 1);\n\n for (var i = 0; i < ecdata[r].length; i++) {\n var modIndex = i + modPoly.getLength() - ecdata[r].length;\n ecdata[r][i] = modIndex >= 0 ? modPoly.get(modIndex) : 0;\n }\n }\n\n var totalCodeCount = 0;\n\n for (var i = 0; i < rsBlocks.length; i++) {\n totalCodeCount += rsBlocks[i].totalCount;\n }\n\n var data = new Array(totalCodeCount);\n var index = 0;\n\n for (var i = 0; i < maxDcCount; i++) {\n for (var r = 0; r < rsBlocks.length; r++) {\n if (i < dcdata[r].length) {\n data[index++] = dcdata[r][i];\n }\n }\n }\n\n for (var i = 0; i < maxEcCount; i++) {\n for (var r = 0; r < rsBlocks.length; r++) {\n if (i < ecdata[r].length) {\n data[index++] = ecdata[r][i];\n }\n }\n }\n\n return data;\n };\n\n var QRMode = {\n MODE_NUMBER: 1 << 0,\n MODE_ALPHA_NUM: 1 << 1,\n MODE_8BIT_BYTE: 1 << 2,\n MODE_KANJI: 1 << 3\n };\n var QRErrorCorrectLevel = {\n L: 1,\n M: 0,\n Q: 3,\n H: 2\n };\n var QRMaskPattern = {\n PATTERN000: 0,\n PATTERN001: 1,\n PATTERN010: 2,\n PATTERN011: 3,\n PATTERN100: 4,\n PATTERN101: 5,\n PATTERN110: 6,\n PATTERN111: 7\n };\n var QRUtil = {\n PATTERN_POSITION_TABLE: [[], [6, 18], [6, 22], [6, 26], [6, 30], [6, 34], [6, 22, 38], [6, 24, 42], [6, 26, 46], [6, 28, 50], [6, 30, 54], [6, 32, 58], [6, 34, 62], [6, 26, 46, 66], [6, 26, 48, 70], [6, 26, 50, 74], [6, 30, 54, 78], [6, 30, 56, 82], [6, 30, 58, 86], [6, 34, 62, 90], [6, 28, 50, 72, 94], [6, 26, 50, 74, 98], [6, 30, 54, 78, 102], [6, 28, 54, 80, 106], [6, 32, 58, 84, 110], [6, 30, 58, 86, 114], [6, 34, 62, 90, 118], [6, 26, 50, 74, 98, 122], [6, 30, 54, 78, 102, 126], [6, 26, 52, 78, 104, 130], [6, 30, 56, 82, 108, 134], [6, 34, 60, 86, 112, 138], [6, 30, 58, 86, 114, 142], [6, 34, 62, 90, 118, 146], [6, 30, 54, 78, 102, 126, 150], [6, 24, 50, 76, 102, 128, 154], [6, 28, 54, 80, 106, 132, 158], [6, 32, 58, 84, 110, 136, 162], [6, 26, 54, 82, 110, 138, 166], [6, 30, 58, 86, 114, 142, 170]],\n G15: 1 << 10 | 1 << 8 | 1 << 5 | 1 << 4 | 1 << 2 | 1 << 1 | 1 << 0,\n G18: 1 << 12 | 1 << 11 | 1 << 10 | 1 << 9 | 1 << 8 | 1 << 5 | 1 << 2 | 1 << 0,\n G15_MASK: 1 << 14 | 1 << 12 | 1 << 10 | 1 << 4 | 1 << 1,\n getBCHTypeInfo: function getBCHTypeInfo(data) {\n var d = data << 10;\n\n while (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G15) >= 0) {\n d ^= QRUtil.G15 << QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G15);\n }\n\n return (data << 10 | d) ^ QRUtil.G15_MASK;\n },\n getBCHTypeNumber: function getBCHTypeNumber(data) {\n var d = data << 12;\n\n while (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G18) >= 0) {\n d ^= QRUtil.G18 << QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G18);\n }\n\n return data << 12 | d;\n },\n getBCHDigit: function getBCHDigit(data) {\n var digit = 0;\n\n while (data != 0) {\n digit++;\n data >>>= 1;\n }\n\n return digit;\n },\n getPatternPosition: function getPatternPosition(typeNumber) {\n return QRUtil.PATTERN_POSITION_TABLE[typeNumber - 1];\n },\n getMask: function getMask(maskPattern, i, j) {\n switch (maskPattern) {\n case QRMaskPattern.PATTERN000:\n return (i + j) % 2 == 0;\n\n case QRMaskPattern.PATTERN001:\n return i % 2 == 0;\n\n case QRMaskPattern.PATTERN010:\n return j % 3 == 0;\n\n case QRMaskPattern.PATTERN011:\n return (i + j) % 3 == 0;\n\n case QRMaskPattern.PATTERN100:\n return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 == 0;\n\n case QRMaskPattern.PATTERN101:\n return i * j % 2 + i * j % 3 == 0;\n\n case QRMaskPattern.PATTERN110:\n return (i * j % 2 + i * j % 3) % 2 == 0;\n\n case QRMaskPattern.PATTERN111:\n return (i * j % 3 + (i + j) % 2) % 2 == 0;\n\n default:\n throw new Error('bad maskPattern:' + maskPattern);\n }\n },\n getErrorCorrectPolynomial: function getErrorCorrectPolynomial(errorCorrectLength) {\n var a = new QRPolynomial([1], 0);\n\n for (var i = 0; i < errorCorrectLength; i++) {\n a = a.multiply(new QRPolynomial([1, QRMath.gexp(i)], 0));\n }\n\n return a;\n },\n getLengthInBits: function getLengthInBits(mode, type) {\n if (1 <= type && type < 10) {\n switch (mode) {\n case QRMode.MODE_NUMBER:\n return 10;\n\n case QRMode.MODE_ALPHA_NUM:\n return 9;\n\n case QRMode.MODE_8BIT_BYTE:\n return 8;\n\n case QRMode.MODE_KANJI:\n return 8;\n\n default:\n throw new Error('mode:' + mode);\n }\n } else if (type < 27) {\n switch (mode) {\n case QRMode.MODE_NUMBER:\n return 12;\n\n case QRMode.MODE_ALPHA_NUM:\n return 11;\n\n case QRMode.MODE_8BIT_BYTE:\n return 16;\n\n case QRMode.MODE_KANJI:\n return 10;\n\n default:\n throw new Error('mode:' + mode);\n }\n } else if (type < 41) {\n switch (mode) {\n case QRMode.MODE_NUMBER:\n return 14;\n\n case QRMode.MODE_ALPHA_NUM:\n return 13;\n\n case QRMode.MODE_8BIT_BYTE:\n return 16;\n\n case QRMode.MODE_KANJI:\n return 12;\n\n default:\n throw new Error('mode:' + mode);\n }\n } else {\n throw new Error('type:' + type);\n }\n },\n getLostPoint: function getLostPoint(qrCode) {\n var moduleCount = qrCode.getModuleCount();\n var lostPoint = 0;\n\n for (var row = 0; row < moduleCount; row++) {\n for (var col = 0; col < moduleCount; col++) {\n var sameCount = 0;\n var dark = qrCode.isDark(row, col);\n\n for (var r = -1; r <= 1; r++) {\n if (row + r < 0 || moduleCount <= row + r) {\n continue;\n }\n\n for (var c = -1; c <= 1; c++) {\n if (col + c < 0 || moduleCount <= col + c) {\n continue;\n }\n\n if (r == 0 && c == 0) {\n continue;\n }\n\n if (dark == qrCode.isDark(row + r, col + c)) {\n sameCount++;\n }\n }\n }\n\n if (sameCount > 5) {\n lostPoint += 3 + sameCount - 5;\n }\n }\n }\n\n for (var row = 0; row < moduleCount - 1; row++) {\n for (var col = 0; col < moduleCount - 1; col++) {\n var count = 0;\n if (qrCode.isDark(row, col)) count++;\n if (qrCode.isDark(row + 1, col)) count++;\n if (qrCode.isDark(row, col + 1)) count++;\n if (qrCode.isDark(row + 1, col + 1)) count++;\n\n if (count == 0 || count == 4) {\n lostPoint += 3;\n }\n }\n }\n\n for (var row = 0; row < moduleCount; row++) {\n for (var col = 0; col < moduleCount - 6; col++) {\n if (qrCode.isDark(row, col) && !qrCode.isDark(row, col + 1) && qrCode.isDark(row, col + 2) && qrCode.isDark(row, col + 3) && qrCode.isDark(row, col + 4) && !qrCode.isDark(row, col + 5) && qrCode.isDark(row, col + 6)) {\n lostPoint += 40;\n }\n }\n }\n\n for (var col = 0; col < moduleCount; col++) {\n for (var row = 0; row < moduleCount - 6; row++) {\n if (qrCode.isDark(row, col) && !qrCode.isDark(row + 1, col) && qrCode.isDark(row + 2, col) && qrCode.isDark(row + 3, col) && qrCode.isDark(row + 4, col) && !qrCode.isDark(row + 5, col) && qrCode.isDark(row + 6, col)) {\n lostPoint += 40;\n }\n }\n }\n\n var darkCount = 0;\n\n for (var col = 0; col < moduleCount; col++) {\n for (var row = 0; row < moduleCount; row++) {\n if (qrCode.isDark(row, col)) {\n darkCount++;\n }\n }\n }\n\n var ratio = Math.abs(100 * darkCount / moduleCount / moduleCount - 50) / 5;\n lostPoint += ratio * 10;\n return lostPoint;\n }\n };\n var QRMath = {\n glog: function glog(n) {\n if (n < 1) {\n throw new Error('glog(' + n + ')');\n }\n\n return QRMath.LOG_TABLE[n];\n },\n gexp: function gexp(n) {\n while (n < 0) {\n n += 255;\n }\n\n while (n >= 256) {\n n -= 255;\n }\n\n return QRMath.EXP_TABLE[n];\n },\n EXP_TABLE: new Array(256),\n LOG_TABLE: new Array(256)\n };\n\n for (var i = 0; i < 8; i++) {\n QRMath.EXP_TABLE[i] = 1 << i;\n }\n\n for (var i = 8; i < 256; i++) {\n QRMath.EXP_TABLE[i] = QRMath.EXP_TABLE[i - 4] ^ QRMath.EXP_TABLE[i - 5] ^ QRMath.EXP_TABLE[i - 6] ^ QRMath.EXP_TABLE[i - 8];\n }\n\n for (var i = 0; i < 255; i++) {\n QRMath.LOG_TABLE[QRMath.EXP_TABLE[i]] = i;\n }\n\n function QRPolynomial(num, shift) {\n if (num.length == undefined$1) {\n throw new Error(num.length + '/' + shift);\n }\n\n var offset = 0;\n\n while (offset < num.length && num[offset] == 0) {\n offset++;\n }\n\n this.num = new Array(num.length - offset + shift);\n\n for (var i = 0; i < num.length - offset; i++) {\n this.num[i] = num[i + offset];\n }\n }\n\n QRPolynomial.prototype = {\n get: function get(index) {\n return this.num[index];\n },\n getLength: function getLength() {\n return this.num.length;\n },\n multiply: function multiply(e) {\n var num = new Array(this.getLength() + e.getLength() - 1);\n\n for (var i = 0; i < this.getLength(); i++) {\n for (var j = 0; j < e.getLength(); j++) {\n num[i + j] ^= QRMath.gexp(QRMath.glog(this.get(i)) + QRMath.glog(e.get(j)));\n }\n }\n\n return new QRPolynomial(num, 0);\n },\n mod: function mod(e) {\n if (this.getLength() - e.getLength() < 0) {\n return this;\n }\n\n var ratio = QRMath.glog(this.get(0)) - QRMath.glog(e.get(0));\n var num = new Array(this.getLength());\n\n for (var i = 0; i < this.getLength(); i++) {\n num[i] = this.get(i);\n }\n\n for (var i = 0; i < e.getLength(); i++) {\n num[i] ^= QRMath.gexp(QRMath.glog(e.get(i)) + ratio);\n }\n\n return new QRPolynomial(num, 0).mod(e);\n }\n };\n\n function QRRSBlock(totalCount, dataCount) {\n this.totalCount = totalCount;\n this.dataCount = dataCount;\n }\n\n QRRSBlock.RS_BLOCK_TABLE = [[1, 26, 19], [1, 26, 16], [1, 26, 13], [1, 26, 9], [1, 44, 34], [1, 44, 28], [1, 44, 22], [1, 44, 16], [1, 70, 55], [1, 70, 44], [2, 35, 17], [2, 35, 13], [1, 100, 80], [2, 50, 32], [2, 50, 24], [4, 25, 9], [1, 134, 108], [2, 67, 43], [2, 33, 15, 2, 34, 16], [2, 33, 11, 2, 34, 12], [2, 86, 68], [4, 43, 27], [4, 43, 19], [4, 43, 15], [2, 98, 78], [4, 49, 31], [2, 32, 14, 4, 33, 15], [4, 39, 13, 1, 40, 14], [2, 121, 97], [2, 60, 38, 2, 61, 39], [4, 40, 18, 2, 41, 19], [4, 40, 14, 2, 41, 15], [2, 146, 116], [3, 58, 36, 2, 59, 37], [4, 36, 16, 4, 37, 17], [4, 36, 12, 4, 37, 13], [2, 86, 68, 2, 87, 69], [4, 69, 43, 1, 70, 44], [6, 43, 19, 2, 44, 20], [6, 43, 15, 2, 44, 16], [4, 101, 81], [1, 80, 50, 4, 81, 51], [4, 50, 22, 4, 51, 23], [3, 36, 12, 8, 37, 13], [2, 116, 92, 2, 117, 93], [6, 58, 36, 2, 59, 37], [4, 46, 20, 6, 47, 21], [7, 42, 14, 4, 43, 15], [4, 133, 107], [8, 59, 37, 1, 60, 38], [8, 44, 20, 4, 45, 21], [12, 33, 11, 4, 34, 12], [3, 145, 115, 1, 146, 116], [4, 64, 40, 5, 65, 41], [11, 36, 16, 5, 37, 17], [11, 36, 12, 5, 37, 13], [5, 109, 87, 1, 110, 88], [5, 65, 41, 5, 66, 42], [5, 54, 24, 7, 55, 25], [11, 36, 12, 7, 37, 13], [5, 122, 98, 1, 123, 99], [7, 73, 45, 3, 74, 46], [15, 43, 19, 2, 44, 20], [3, 45, 15, 13, 46, 16], [1, 135, 107, 5, 136, 108], [10, 74, 46, 1, 75, 47], [1, 50, 22, 15, 51, 23], [2, 42, 14, 17, 43, 15], [5, 150, 120, 1, 151, 121], [9, 69, 43, 4, 70, 44], [17, 50, 22, 1, 51, 23], [2, 42, 14, 19, 43, 15], [3, 141, 113, 4, 142, 114], [3, 70, 44, 11, 71, 45], [17, 47, 21, 4, 48, 22], [9, 39, 13, 16, 40, 14], [3, 135, 107, 5, 136, 108], [3, 67, 41, 13, 68, 42], [15, 54, 24, 5, 55, 25], [15, 43, 15, 10, 44, 16], [4, 144, 116, 4, 145, 117], [17, 68, 42], [17, 50, 22, 6, 51, 23], [19, 46, 16, 6, 47, 17], [2, 139, 111, 7, 140, 112], [17, 74, 46], [7, 54, 24, 16, 55, 25], [34, 37, 13], [4, 151, 121, 5, 152, 122], [4, 75, 47, 14, 76, 48], [11, 54, 24, 14, 55, 25], [16, 45, 15, 14, 46, 16], [6, 147, 117, 4, 148, 118], [6, 73, 45, 14, 74, 46], [11, 54, 24, 16, 55, 25], [30, 46, 16, 2, 47, 17], [8, 132, 106, 4, 133, 107], [8, 75, 47, 13, 76, 48], [7, 54, 24, 22, 55, 25], [22, 45, 15, 13, 46, 16], [10, 142, 114, 2, 143, 115], [19, 74, 46, 4, 75, 47], [28, 50, 22, 6, 51, 23], [33, 46, 16, 4, 47, 17], [8, 152, 122, 4, 153, 123], [22, 73, 45, 3, 74, 46], [8, 53, 23, 26, 54, 24], [12, 45, 15, 28, 46, 16], [3, 147, 117, 10, 148, 118], [3, 73, 45, 23, 74, 46], [4, 54, 24, 31, 55, 25], [11, 45, 15, 31, 46, 16], [7, 146, 116, 7, 147, 117], [21, 73, 45, 7, 74, 46], [1, 53, 23, 37, 54, 24], [19, 45, 15, 26, 46, 16], [5, 145, 115, 10, 146, 116], [19, 75, 47, 10, 76, 48], [15, 54, 24, 25, 55, 25], [23, 45, 15, 25, 46, 16], [13, 145, 115, 3, 146, 116], [2, 74, 46, 29, 75, 47], [42, 54, 24, 1, 55, 25], [23, 45, 15, 28, 46, 16], [17, 145, 115], [10, 74, 46, 23, 75, 47], [10, 54, 24, 35, 55, 25], [19, 45, 15, 35, 46, 16], [17, 145, 115, 1, 146, 116], [14, 74, 46, 21, 75, 47], [29, 54, 24, 19, 55, 25], [11, 45, 15, 46, 46, 16], [13, 145, 115, 6, 146, 116], [14, 74, 46, 23, 75, 47], [44, 54, 24, 7, 55, 25], [59, 46, 16, 1, 47, 17], [12, 151, 121, 7, 152, 122], [12, 75, 47, 26, 76, 48], [39, 54, 24, 14, 55, 25], [22, 45, 15, 41, 46, 16], [6, 151, 121, 14, 152, 122], [6, 75, 47, 34, 76, 48], [46, 54, 24, 10, 55, 25], [2, 45, 15, 64, 46, 16], [17, 152, 122, 4, 153, 123], [29, 74, 46, 14, 75, 47], [49, 54, 24, 10, 55, 25], [24, 45, 15, 46, 46, 16], [4, 152, 122, 18, 153, 123], [13, 74, 46, 32, 75, 47], [48, 54, 24, 14, 55, 25], [42, 45, 15, 32, 46, 16], [20, 147, 117, 4, 148, 118], [40, 75, 47, 7, 76, 48], [43, 54, 24, 22, 55, 25], [10, 45, 15, 67, 46, 16], [19, 148, 118, 6, 149, 119], [18, 75, 47, 31, 76, 48], [34, 54, 24, 34, 55, 25], [20, 45, 15, 61, 46, 16]];\n\n QRRSBlock.getRSBlocks = function (typeNumber, errorCorrectLevel) {\n var rsBlock = QRRSBlock.getRsBlockTable(typeNumber, errorCorrectLevel);\n\n if (rsBlock == undefined$1) {\n throw new Error('bad rs block @ typeNumber:' + typeNumber + '/errorCorrectLevel:' + errorCorrectLevel);\n }\n\n var length = rsBlock.length / 3;\n var list = [];\n\n for (var i = 0; i < length; i++) {\n var count = rsBlock[i * 3 + 0];\n var totalCount = rsBlock[i * 3 + 1];\n var dataCount = rsBlock[i * 3 + 2];\n\n for (var j = 0; j < count; j++) {\n list.push(new QRRSBlock(totalCount, dataCount));\n }\n }\n\n return list;\n };\n\n QRRSBlock.getRsBlockTable = function (typeNumber, errorCorrectLevel) {\n switch (errorCorrectLevel) {\n case QRErrorCorrectLevel.L:\n return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 0];\n\n case QRErrorCorrectLevel.M:\n return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 1];\n\n case QRErrorCorrectLevel.Q:\n return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 2];\n\n case QRErrorCorrectLevel.H:\n return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 3];\n\n default:\n return undefined$1;\n }\n };\n\n function QRBitBuffer() {\n this.buffer = [];\n this.length = 0;\n }\n\n QRBitBuffer.prototype = {\n get: function get(index) {\n var bufIndex = Math.floor(index / 8);\n return (this.buffer[bufIndex] >>> 7 - index % 8 & 1) == 1;\n },\n put: function put(num, length) {\n for (var i = 0; i < length; i++) {\n this.putBit((num >>> length - i - 1 & 1) == 1);\n }\n },\n getLengthInBits: function getLengthInBits() {\n return this.length;\n },\n putBit: function putBit(bit) {\n var bufIndex = Math.floor(this.length / 8);\n\n if (this.buffer.length <= bufIndex) {\n this.buffer.push(0);\n }\n\n if (bit) {\n this.buffer[bufIndex] |= 0x80 >>> this.length % 8;\n }\n\n this.length++;\n }\n };\n var QRCodeLimitLength = [[17, 14, 11, 7], [32, 26, 20, 14], [53, 42, 32, 24], [78, 62, 46, 34], [106, 84, 60, 44], [134, 106, 74, 58], [154, 122, 86, 64], [192, 152, 108, 84], [230, 180, 130, 98], [271, 213, 151, 119], [321, 251, 177, 137], [367, 287, 203, 155], [425, 331, 241, 177], [458, 362, 258, 194], [520, 412, 292, 220], [586, 450, 322, 250], [644, 504, 364, 280], [718, 560, 394, 310], [792, 624, 442, 338], [858, 666, 482, 382], [929, 711, 509, 403], [1003, 779, 565, 439], [1091, 857, 611, 461], [1171, 911, 661, 511], [1273, 997, 715, 535], [1367, 1059, 751, 593], [1465, 1125, 805, 625], [1528, 1190, 868, 658], [1628, 1264, 908, 698], [1732, 1370, 982, 742], [1840, 1452, 1030, 790], [1952, 1538, 1112, 842], [2068, 1628, 1168, 898], [2188, 1722, 1228, 958], [2303, 1809, 1283, 983], [2431, 1911, 1351, 1051], [2563, 1989, 1423, 1093], [2699, 2099, 1499, 1139], [2809, 2213, 1579, 1219], [2953, 2331, 1663, 1273]];\n\n function _isSupportCanvas() {\n return typeof CanvasRenderingContext2D != 'undefined';\n } // android 2.x doesn't support Data-URI spec\n\n\n function _getAndroid() {\n var android = false;\n var sAgent = navigator.userAgent;\n\n if (/android/i.test(sAgent)) {\n // android\n android = true;\n var aMat = sAgent.toString().match(/android ([0-9]\\.[0-9])/i);\n\n if (aMat && aMat[1]) {\n android = parseFloat(aMat[1]);\n }\n }\n\n return android;\n } // Drawing in DOM by using Table tag\n\n\n var Drawing = !_isSupportCanvas() ? function () {\n var Drawing = function Drawing(el, htOption) {\n this._el = el;\n this._htOption = htOption;\n };\n /**\n * Draw the QRCode\n *\n * @param {QRCode} oQRCode\n */\n\n\n Drawing.prototype.draw = function (oQRCode) {\n var _htOption = this._htOption;\n var _el = this._el;\n var nCount = oQRCode.getModuleCount();\n var nWidth = Math.round(_htOption.width / nCount);\n var nHeight = Math.round((_htOption.height - _htOption.titleHeight) / nCount);\n\n if (nWidth <= 1) {\n nWidth = 1;\n }\n\n if (nHeight <= 1) {\n nHeight = 1;\n }\n\n this._htOption.width = nWidth * nCount;\n this._htOption.height = nHeight * nCount + _htOption.titleHeight;\n this._htOption.quietZone = Math.round(this._htOption.quietZone);\n var aHTML = [];\n var divStyle = '';\n var drawWidth = Math.round(nWidth * _htOption.dotScale);\n var drawHeight = Math.round(nHeight * _htOption.dotScale);\n\n if (drawWidth < 4) {\n drawWidth = 4;\n drawHeight = 4;\n }\n\n var nonRequiredColorDark = _htOption.colorDark;\n var nonRequiredcolorLight = _htOption.colorLight;\n\n if (_htOption.backgroundImage) {\n if (_htOption.autoColor) {\n _htOption.colorDark = \"rgba(0, 0, 0, .6);filter:progid:DXImageTransform.Microsoft.Gradient(GradientType=0, StartColorStr='#99000000', EndColorStr='#99000000');\";\n _htOption.colorLight = \"rgba(255, 255, 255, .7);filter:progid:DXImageTransform.Microsoft.Gradient(GradientType=0, StartColorStr='#B2FFFFFF', EndColorStr='#B2FFFFFF');\"; // _htOption.colorDark=\"rgba(0, 0, 0, .6)\";\n // _htOption.colorLight='rgba(255, 255, 255, .7)';\n } else {\n _htOption.colorLight = 'rgba(0,0,0,0)';\n }\n\n var backgroundImageEle = '
');\\n\\n if (_htOption.logo) {\\n // Logo Image\\n var img = new Image();\\n\\n if (_htOption.crossOrigin != null) {\\n img.crossOrigin = _htOption.crossOrigin;\\n } // img.crossOrigin=\\\"Anonymous\\\";\\n\\n\\n img.src = _htOption.logo;\\n var imgW = _htOption.width / 3.5;\\n var imgH = _htOption.height / 3.5;\\n\\n if (imgW != imgH) {\\n imgW = imgH;\\n }\\n\\n if (_htOption.logoWidth) {\\n imgW = _htOption.logoWidth;\\n }\\n\\n if (_htOption.logoHeight) {\\n imgH = _htOption.logoHeight;\\n }\\n\\n var imgDivStyle = 'position:relative; z-index:1;display:table-cell;top:-' + ((_htOption.height - _htOption.titleHeight) / 2 + imgH / 2 + _htOption.quietZone) + 'px;text-align:center; width:' + imgW + 'px; height:' + imgH + 'px;line-height:' + imgW + 'px; vertical-align: middle;';\\n\\n if (!_htOption.logoBackgroundTransparent) {\\n imgDivStyle += 'background:' + _htOption.logoBackgroundColor;\\n }\\n\\n aHTML.push('
');\\n }\\n\\n if (_htOption.onRenderingStart) {\\n _htOption.onRenderingStart(_htOption);\\n }\\n\\n _el.innerHTML = aHTML.join(''); // Fix the margin values as real size.\\n\\n var elTable = _el.childNodes[0];\\n var nLeftMarginTable = (_htOption.width - elTable.offsetWidth) / 2;\\n var nTopMarginTable = (_htOption.height - elTable.offsetHeight) / 2;\\n\\n if (nLeftMarginTable > 0 && nTopMarginTable > 0) {\\n elTable.style.margin = nTopMarginTable + 'px ' + nLeftMarginTable + 'px';\\n }\\n\\n if (this._htOption.onRenderingEnd) {\\n this._htOption.onRenderingEnd(this._htOption, null);\\n }\\n };\\n /**\\n * Clear the QRCode\\n */\\n\\n\\n Drawing.prototype.clear = function () {\\n this._el.innerHTML = '';\\n };\\n\\n return Drawing;\\n }() : function () {\\n // Drawing in Canvas\\n function _onMakeImage() {\\n if (this._htOption.drawer == 'svg') {\\n var svgData = this._oContext.getSerializedSvg(true);\\n\\n this.dataURL = svgData;\\n this._el.innerHTML = svgData;\\n } else {\\n // canvas\\n // this._elImage.crossOrigin='Anonymous';\\n try {\\n // if (this._htOption.crossOrigin != null) {\\n // this._elImage.crossOrigin = this._htOption.crossOrigin;\\n // }\\n var dataURL = this._elCanvas.toDataURL('image/png'); // this._elImage.src = dataURL;\\n\\n\\n this.dataURL = dataURL; // this._elImage.style.display = \\\"inline\\\";\\n // this._elCanvas.style.display = \\\"none\\\";\\n } catch (e) {\\n console.error(e);\\n }\\n }\\n\\n if (this._htOption.onRenderingEnd) {\\n if (!this.dataURL) {\\n console.error(\\\"Can not get base64 data, please check: 1. Published the page and image to the server 2. The image request support CORS 3. Configured `crossOrigin:'anonymous'` option\\\");\\n }\\n\\n this._htOption.onRenderingEnd(this._htOption, this.dataURL);\\n }\\n } // Android 2.1 bug workaround\\n // http://code.google.com/p/android/issues/detail?id=5141\\n\\n\\n if (root._android && root._android <= 2.1) {\\n var factor = 1 / window.devicePixelRatio;\\n var drawImage = CanvasRenderingContext2D.prototype.drawImage;\\n\\n CanvasRenderingContext2D.prototype.drawImage = function (image, sx, sy, sw, sh, dx, dy, dw, dh) {\\n if ('nodeName' in image && /img/i.test(image.nodeName)) {\\n for (var i = arguments.length - 1; i >= 1; i--) {\\n arguments[i] = arguments[i] * factor;\\n }\\n } else if (typeof dw == 'undefined') {\\n arguments[1] *= factor;\\n arguments[2] *= factor;\\n arguments[3] *= factor;\\n arguments[4] *= factor;\\n }\\n\\n drawImage.apply(this, arguments);\\n };\\n }\\n /**\\n * Check whether the user's browser supports Data URI or not\\n *\\n * @private\\n * @param {Function} fSuccess Occurs if it supports Data URI\\n * @param {Function} fFail Occurs if it doesn't support Data URI\\n */\\n\\n\\n function _safeSetDataURI(fSuccess, fFail) {\\n var self = this;\\n self._fFail = fFail;\\n self._fSuccess = fSuccess; // Check it just once\\n\\n if (self._bSupportDataURI === null) {\\n var el = document.createElement('img');\\n\\n var fOnError = function fOnError() {\\n self._bSupportDataURI = false;\\n\\n if (self._fFail) {\\n self._fFail.call(self);\\n }\\n };\\n\\n var fOnSuccess = function fOnSuccess() {\\n self._bSupportDataURI = true;\\n\\n if (self._fSuccess) {\\n self._fSuccess.call(self);\\n }\\n };\\n\\n el.onabort = fOnError;\\n el.onerror = fOnError;\\n el.onload = fOnSuccess;\\n el.src = 'data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAUAAAAFCAYAAACNbyblAAAAHElEQVQI12P4//8/w38GIAXDIBKE0DHxgljNBAAO9TXL0Y4OHwAAAABJRU5ErkJggg=='; // the Image contains 1px data.\\n\\n return;\\n } else if (self._bSupportDataURI === true && self._fSuccess) {\\n self._fSuccess.call(self);\\n } else if (self._bSupportDataURI === false && self._fFail) {\\n self._fFail.call(self);\\n }\\n }\\n /**\\n * Drawing QRCode by using canvas\\n *\\n * @constructor\\n * @param {HTMLElement} el\\n * @param {Object} htOption QRCode Options\\n */\\n\\n\\n var Drawing = function Drawing(el, htOption) {\\n this._bIsPainted = false;\\n this._android = _getAndroid();\\n this._el = el;\\n this._htOption = htOption;\\n\\n if (this._htOption.drawer == 'svg') {\\n this._oContext = {};\\n this._elCanvas = {};\\n } else {\\n // canvas\\n this._elCanvas = document.createElement('canvas');\\n\\n this._el.appendChild(this._elCanvas);\\n\\n this._oContext = this._elCanvas.getContext('2d'); // this._elImage = document.createElement(\\\"img\\\");\\n // this._elImage.alt = \\\"Scan me!\\\";\\n // this._elImage.style.display = \\\"none\\\";\\n // this._el.appendChild(this._elImage);\\n }\\n\\n this._bSupportDataURI = null;\\n this.dataURL = null;\\n };\\n /**\\n * Draw the QRCode\\n *\\n * @param {QRCode} oQRCode\\n */\\n\\n\\n Drawing.prototype.draw = function (oQRCode) {\\n // var _elImage = this._elImage;\\n var _htOption = this._htOption;\\n\\n if (!_htOption.title && !_htOption.subTitle) {\\n _htOption.height -= _htOption.titleHeight;\\n _htOption.titleHeight = 0;\\n }\\n\\n var nCount = oQRCode.getModuleCount();\\n var nWidth = Math.round(_htOption.width / nCount);\\n var nHeight = Math.round((_htOption.height - _htOption.titleHeight) / nCount);\\n\\n if (nWidth <= 1) {\\n nWidth = 1;\\n }\\n\\n if (nHeight <= 1) {\\n nHeight = 1;\\n }\\n\\n _htOption.width = nWidth * nCount;\\n _htOption.height = nHeight * nCount + _htOption.titleHeight;\\n _htOption.quietZone = Math.round(_htOption.quietZone);\\n this._elCanvas.width = _htOption.width + _htOption.quietZone * 2;\\n this._elCanvas.height = _htOption.height + _htOption.quietZone * 2;\\n\\n if (this._htOption.drawer != 'canvas') {\\n // _elImage.style.display = \\\"none\\\";\\n // } else {\\n this._oContext = new C2S(this._elCanvas.width, this._elCanvas.height);\\n }\\n\\n this.clear();\\n var _oContext = this._oContext;\\n _oContext.lineWidth = 0;\\n _oContext.fillStyle = _htOption.colorLight;\\n\\n _oContext.fillRect(0, 0, this._elCanvas.width, this._elCanvas.height);\\n\\n var t = this;\\n\\n function drawQuietZoneColor() {\\n if (_htOption.quietZone > 0 && _htOption.quietZoneColor) {\\n // top\\n _oContext.lineWidth = 0;\\n _oContext.fillStyle = _htOption.quietZoneColor;\\n\\n _oContext.fillRect(0, 0, t._elCanvas.width, _htOption.quietZone); // left\\n\\n\\n _oContext.fillRect(0, _htOption.quietZone, _htOption.quietZone, t._elCanvas.height - _htOption.quietZone * 2); // right\\n\\n\\n _oContext.fillRect(t._elCanvas.width - _htOption.quietZone, _htOption.quietZone, _htOption.quietZone, t._elCanvas.height - _htOption.quietZone * 2); // bottom\\n\\n\\n _oContext.fillRect(0, t._elCanvas.height - _htOption.quietZone, t._elCanvas.width, _htOption.quietZone);\\n }\\n }\\n\\n if (_htOption.backgroundImage) {\\n // Background Image\\n var bgImg = new Image();\\n\\n bgImg.onload = function () {\\n _oContext.globalAlpha = 1;\\n _oContext.globalAlpha = _htOption.backgroundImageAlpha;\\n var imageSmoothingQuality = _oContext.imageSmoothingQuality;\\n var imageSmoothingEnabled = _oContext.imageSmoothingEnabled;\\n _oContext.imageSmoothingEnabled = true;\\n _oContext.imageSmoothingQuality = 'high';\\n\\n _oContext.drawImage(bgImg, 0, _htOption.titleHeight, _htOption.width + _htOption.quietZone * 2, _htOption.height + _htOption.quietZone * 2 - _htOption.titleHeight);\\n\\n _oContext.imageSmoothingEnabled = imageSmoothingEnabled;\\n _oContext.imageSmoothingQuality = imageSmoothingQuality;\\n _oContext.globalAlpha = 1;\\n drawQrcode.call(t, oQRCode);\\n }; // bgImg.crossOrigin='Anonymous';\\n\\n\\n if (_htOption.crossOrigin != null) {\\n bgImg.crossOrigin = _htOption.crossOrigin;\\n }\\n\\n bgImg.originalSrc = _htOption.backgroundImage;\\n bgImg.src = _htOption.backgroundImage; // DoSomething\\n } else {\\n drawQrcode.call(t, oQRCode);\\n }\\n\\n function drawQrcode(oQRCode) {\\n if (_htOption.onRenderingStart) {\\n _htOption.onRenderingStart(_htOption);\\n }\\n\\n for (var row = 0; row < nCount; row++) {\\n for (var col = 0; col < nCount; col++) {\\n var nLeft = col * nWidth + _htOption.quietZone;\\n var nTop = row * nHeight + _htOption.quietZone;\\n var bIsDark = oQRCode.isDark(row, col);\\n var eye = oQRCode.getEye(row, col); // { isDark: true/false, type: PO_TL, PI_TL, PO_TR, PI_TR, PO_BL, PI_BL };\\n\\n var nowDotScale = _htOption.dotScale;\\n _oContext.lineWidth = 0; // Color handler\\n\\n var dColor;\\n var lColor;\\n\\n if (eye) {\\n dColor = _htOption[eye.type] || _htOption[eye.type.substring(0, 2)] || _htOption.colorDark;\\n lColor = _htOption.colorLight;\\n } else {\\n if (_htOption.backgroundImage) {\\n lColor = 'rgba(0,0,0,0)';\\n\\n if (row == 6) {\\n // dColor = _htOption.timing_H || _htOption.timing || _htOption.colorDark;\\n if (_htOption.autoColor) {\\n dColor = _htOption.timing_H || _htOption.timing || _htOption.autoColorDark;\\n lColor = _htOption.autoColorLight;\\n } else {\\n dColor = _htOption.timing_H || _htOption.timing || _htOption.colorDark;\\n }\\n } else if (col == 6) {\\n // dColor = _htOption.timing_V || _htOption.timing || _htOption.colorDark;\\n if (_htOption.autoColor) {\\n dColor = _htOption.timing_V || _htOption.timing || _htOption.autoColorDark;\\n lColor = _htOption.autoColorLight;\\n } else {\\n dColor = _htOption.timing_V || _htOption.timing || _htOption.colorDark;\\n }\\n } else {\\n if (_htOption.autoColor) {\\n dColor = _htOption.autoColorDark;\\n lColor = _htOption.autoColorLight;\\n } else {\\n dColor = _htOption.colorDark;\\n }\\n }\\n } else {\\n if (row == 6) {\\n dColor = _htOption.timing_H || _htOption.timing || _htOption.colorDark;\\n } else if (col == 6) {\\n dColor = _htOption.timing_V || _htOption.timing || _htOption.colorDark;\\n } else {\\n dColor = _htOption.colorDark;\\n }\\n\\n lColor = _htOption.colorLight;\\n }\\n }\\n\\n _oContext.strokeStyle = bIsDark ? dColor : lColor;\\n _oContext.fillStyle = bIsDark ? dColor : lColor;\\n\\n if (eye) {\\n if (eye.type == 'AO') {\\n nowDotScale = _htOption.dotScaleAO;\\n } else if (eye.type == 'AI') {\\n nowDotScale = _htOption.dotScaleAI;\\n } else {\\n nowDotScale = 1;\\n }\\n\\n if (_htOption.backgroundImage && _htOption.autoColor) {\\n dColor = (eye.type == 'AO' ? _htOption.AI : _htOption.AO) || _htOption.autoColorDark;\\n lColor = _htOption.autoColorLight;\\n } else {\\n dColor = (eye.type == 'AO' ? _htOption.AI : _htOption.AO) || dColor;\\n } // Is eye\\n\\n\\n bIsDark = eye.isDark;\\n\\n _oContext.fillRect(nLeft + nWidth * (1 - nowDotScale) / 2, _htOption.titleHeight + nTop + nHeight * (1 - nowDotScale) / 2, nWidth * nowDotScale, nHeight * nowDotScale);\\n } else {\\n if (row == 6) {\\n // Timing Pattern\\n nowDotScale = _htOption.dotScaleTiming_H;\\n\\n _oContext.fillRect(nLeft + nWidth * (1 - nowDotScale) / 2, _htOption.titleHeight + nTop + nHeight * (1 - nowDotScale) / 2, nWidth * nowDotScale, nHeight * nowDotScale);\\n } else if (col == 6) {\\n // Timing Pattern\\n nowDotScale = _htOption.dotScaleTiming_V;\\n\\n _oContext.fillRect(nLeft + nWidth * (1 - nowDotScale) / 2, _htOption.titleHeight + nTop + nHeight * (1 - nowDotScale) / 2, nWidth * nowDotScale, nHeight * nowDotScale);\\n } else {\\n if (_htOption.backgroundImage) {\\n _oContext.fillRect(nLeft + nWidth * (1 - nowDotScale) / 2, _htOption.titleHeight + nTop + nHeight * (1 - nowDotScale) / 2, nWidth * nowDotScale, nHeight * nowDotScale);\\n } else {\\n _oContext.fillRect(nLeft + nWidth * (1 - nowDotScale) / 2, _htOption.titleHeight + nTop + nHeight * (1 - nowDotScale) / 2, nWidth * nowDotScale, nHeight * nowDotScale);\\n }\\n }\\n }\\n\\n if (_htOption.dotScale != 1 && !eye) {\\n _oContext.strokeStyle = _htOption.colorLight;\\n }\\n }\\n }\\n\\n if (_htOption.title) {\\n _oContext.fillStyle = _htOption.titleBackgroundColor;\\n\\n _oContext.fillRect(0, 0, this._elCanvas.width, _htOption.titleHeight + _htOption.quietZone);\\n\\n _oContext.font = _htOption.titleFont;\\n _oContext.fillStyle = _htOption.titleColor;\\n _oContext.textAlign = 'center';\\n\\n _oContext.fillText(_htOption.title, this._elCanvas.width / 2, +_htOption.quietZone + _htOption.titleTop);\\n }\\n\\n if (_htOption.subTitle) {\\n _oContext.font = _htOption.subTitleFont;\\n _oContext.fillStyle = _htOption.subTitleColor;\\n\\n _oContext.fillText(_htOption.subTitle, this._elCanvas.width / 2, +_htOption.quietZone + _htOption.subTitleTop);\\n }\\n\\n function generateLogoImg(img) {\\n var imgContainerW = Math.round(_htOption.width / 3.5);\\n var imgContainerH = Math.round(_htOption.height / 3.5);\\n\\n if (imgContainerW !== imgContainerH) {\\n imgContainerW = imgContainerH;\\n }\\n\\n if (_htOption.logoMaxWidth) {\\n imgContainerW = Math.round(_htOption.logoMaxWidth);\\n } else if (_htOption.logoWidth) {\\n imgContainerW = Math.round(_htOption.logoWidth);\\n }\\n\\n if (_htOption.logoMaxHeight) {\\n imgContainerH = Math.round(_htOption.logoMaxHeight);\\n } else if (_htOption.logoHeight) {\\n imgContainerH = Math.round(_htOption.logoHeight);\\n }\\n\\n var nw;\\n var nh;\\n\\n if (typeof img.naturalWidth == 'undefined') {\\n // IE 6/7/8\\n nw = img.width;\\n nh = img.height;\\n } else {\\n // HTML5 browsers\\n nw = img.naturalWidth;\\n nh = img.naturalHeight;\\n }\\n\\n if (_htOption.logoMaxWidth || _htOption.logoMaxHeight) {\\n if (_htOption.logoMaxWidth && nw <= imgContainerW) {\\n imgContainerW = nw;\\n }\\n\\n if (_htOption.logoMaxHeight && nh <= imgContainerH) {\\n imgContainerH = nh;\\n }\\n\\n if (nw <= imgContainerW && nh <= imgContainerH) {\\n imgContainerW = nw;\\n imgContainerH = nh;\\n }\\n }\\n\\n var imgContainerX = (_htOption.width + _htOption.quietZone * 2 - imgContainerW) / 2;\\n var imgContainerY = (_htOption.height + _htOption.titleHeight + _htOption.quietZone * 2 - imgContainerH) / 2;\\n var imgScale = Math.min(imgContainerW / nw, imgContainerH / nh);\\n var imgW = nw * imgScale;\\n var imgH = nh * imgScale;\\n\\n if (_htOption.logoMaxWidth || _htOption.logoMaxHeight) {\\n imgContainerW = imgW;\\n imgContainerH = imgH;\\n imgContainerX = (_htOption.width + _htOption.quietZone * 2 - imgContainerW) / 2;\\n imgContainerY = (_htOption.height + _htOption.titleHeight + _htOption.quietZone * 2 - imgContainerH) / 2;\\n } // Did Not Use Transparent Logo Image\\n\\n\\n if (!_htOption.logoBackgroundTransparent) {\\n //if (!_htOption.logoBackgroundColor) {\\n //_htOption.logoBackgroundColor = '#ffffff';\\n //}\\n _oContext.fillStyle = _htOption.logoBackgroundColor;\\n\\n _oContext.fillRect(imgContainerX, imgContainerY, imgContainerW, imgContainerH);\\n }\\n\\n var imageSmoothingQuality = _oContext.imageSmoothingQuality;\\n var imageSmoothingEnabled = _oContext.imageSmoothingEnabled;\\n _oContext.imageSmoothingEnabled = true;\\n _oContext.imageSmoothingQuality = 'high';\\n\\n _oContext.drawImage(img, imgContainerX + (imgContainerW - imgW) / 2, imgContainerY + (imgContainerH - imgH) / 2, imgW, imgH);\\n\\n _oContext.imageSmoothingEnabled = imageSmoothingEnabled;\\n _oContext.imageSmoothingQuality = imageSmoothingQuality;\\n drawQuietZoneColor();\\n _this._bIsPainted = true;\\n\\n _this.makeImage();\\n }\\n\\n if (_htOption.logo) {\\n // Logo Image\\n var img = new Image();\\n\\n var _this = this;\\n\\n img.onload = function () {\\n generateLogoImg(img);\\n };\\n\\n img.onerror = function (e) {\\n console.error(e);\\n }; // img.crossOrigin=\\\"Anonymous\\\";\\n\\n\\n if (_htOption.crossOrigin != null) {\\n img.crossOrigin = _htOption.crossOrigin;\\n }\\n\\n img.originalSrc = _htOption.logo;\\n img.src = _htOption.logo;\\n } else {\\n drawQuietZoneColor();\\n this._bIsPainted = true;\\n this.makeImage();\\n }\\n }\\n };\\n /**\\n * Make the image from Canvas if the browser supports Data URI.\\n */\\n\\n\\n Drawing.prototype.makeImage = function () {\\n if (this._bIsPainted) {\\n _safeSetDataURI.call(this, _onMakeImage);\\n }\\n };\\n /**\\n * Return whether the QRCode is painted or not\\n *\\n * @return {Boolean}\\n */\\n\\n\\n Drawing.prototype.isPainted = function () {\\n return this._bIsPainted;\\n };\\n /**\\n * Clear the QRCode\\n */\\n\\n\\n Drawing.prototype.clear = function () {\\n this._oContext.clearRect(0, 0, this._elCanvas.width, this._elCanvas.height);\\n\\n this._bIsPainted = false;\\n };\\n\\n Drawing.prototype.remove = function () {\\n this._oContext.clearRect(0, 0, this._elCanvas.width, this._elCanvas.height);\\n\\n this._bIsPainted = false;\\n this._el.innerHTML = '';\\n };\\n /**\\n * @private\\n * @param {Number} nNumber\\n */\\n\\n\\n Drawing.prototype.round = function (nNumber) {\\n if (!nNumber) {\\n return nNumber;\\n }\\n\\n return Math.floor(nNumber * 1000) / 1000;\\n };\\n\\n return Drawing;\\n }();\\n /**\\n * Get the type by string length\\n *\\n * @private\\n * @param {String} sText\\n * @param {Number} nCorrectLevel\\n * @return {Number} type\\n */\\n\\n function _getTypeNumber(sText, _htOption) {\\n var nCorrectLevel = _htOption.correctLevel;\\n var nType = 1;\\n\\n var length = _getUTF8Length(sText);\\n\\n for (var i = 0, len = QRCodeLimitLength.length; i < len; i++) {\\n var nLimit = 0;\\n\\n switch (nCorrectLevel) {\\n case QRErrorCorrectLevel.L:\\n nLimit = QRCodeLimitLength[i][0];\\n break;\\n\\n case QRErrorCorrectLevel.M:\\n nLimit = QRCodeLimitLength[i][1];\\n break;\\n\\n case QRErrorCorrectLevel.Q:\\n nLimit = QRCodeLimitLength[i][2];\\n break;\\n\\n case QRErrorCorrectLevel.H:\\n nLimit = QRCodeLimitLength[i][3];\\n break;\\n }\\n\\n if (length <= nLimit) {\\n break;\\n } else {\\n nType++;\\n }\\n }\\n\\n if (nType > QRCodeLimitLength.length) {\\n throw new Error('Too long data. the CorrectLevel.' + ['M', 'L', 'H', 'Q'][nCorrectLevel] + ' limit length is ' + nLimit);\\n }\\n\\n if (_htOption.version != 0) {\\n if (nType <= _htOption.version) {\\n nType = _htOption.version;\\n _htOption.runVersion = nType;\\n } else {\\n console.warn('QR Code version ' + _htOption.version + ' too small, run version use ' + nType);\\n _htOption.runVersion = nType;\\n }\\n }\\n\\n return nType;\\n }\\n\\n function _getUTF8Length(sText) {\\n var replacedText = encodeURI(sText).toString().replace(/\\\\%[0-9a-fA-F]{2}/g, 'a');\\n return replacedText.length + (replacedText.length != sText.length ? 3 : 0);\\n }\\n\\n QRCode = function QRCode(el, vOption) {\\n this._htOption = {\\n width: 256,\\n height: 256,\\n typeNumber: 4,\\n colorDark: '#000000',\\n colorLight: '#ffffff',\\n correctLevel: QRErrorCorrectLevel.H,\\n dotScale: 1,\\n // For body block, must be greater than 0, less than or equal to 1. default is 1\\n dotScaleTiming: 1,\\n // Dafault for timing block , must be greater than 0, less than or equal to 1. default is 1\\n dotScaleTiming_H: undefined$1,\\n // For horizontal timing block, must be greater than 0, less than or equal to 1. default is 1\\n dotScaleTiming_V: undefined$1,\\n // For vertical timing block, must be greater than 0, less than or equal to 1. default is 1\\n dotScaleA: 1,\\n // Dafault for alignment block, must be greater than 0, less than or equal to 1. default is 1\\n dotScaleAO: undefined$1,\\n // For alignment outer block, must be greater than 0, less than or equal to 1. default is 1\\n dotScaleAI: undefined$1,\\n // For alignment inner block, must be greater than 0, less than or equal to 1. default is 1\\n quietZone: 0,\\n quietZoneColor: 'rgba(0,0,0,0)',\\n title: '',\\n titleFont: 'normal normal bold 16px Arial',\\n titleColor: '#000000',\\n titleBackgroundColor: '#ffffff',\\n titleHeight: 0,\\n // Title Height, Include subTitle\\n titleTop: 30,\\n // draws y coordinates. default is 30\\n subTitle: '',\\n subTitleFont: 'normal normal normal 14px Arial',\\n subTitleColor: '#4F4F4F',\\n subTitleTop: 60,\\n // draws y coordinates. default is 0\\n logo: undefined$1,\\n logoWidth: undefined$1,\\n logoHeight: undefined$1,\\n logoMaxWidth: undefined$1,\\n logoMaxHeight: undefined$1,\\n logoBackgroundColor: '#ffffff',\\n logoBackgroundTransparent: false,\\n // === Posotion Pattern(Eye) Color\\n PO: undefined$1,\\n // Global Posotion Outer color. if not set, the defaut is `colorDark`\\n PI: undefined$1,\\n // Global Posotion Inner color. if not set, the defaut is `colorDark`\\n PO_TL: undefined$1,\\n // Posotion Outer - Top Left\\n PI_TL: undefined$1,\\n // Posotion Inner - Top Left\\n PO_TR: undefined$1,\\n // Posotion Outer - Top Right\\n PI_TR: undefined$1,\\n // Posotion Inner - Top Right\\n PO_BL: undefined$1,\\n // Posotion Outer - Bottom Left\\n PI_BL: undefined$1,\\n // Posotion Inner - Bottom Left\\n // === Alignment Color\\n AO: undefined$1,\\n // Alignment Outer. if not set, the defaut is `colorDark`\\n AI: undefined$1,\\n // Alignment Inner. if not set, the defaut is `colorDark`\\n // === Timing Pattern Color\\n timing: undefined$1,\\n // Global Timing color. if not set, the defaut is `colorDark`\\n timing_H: undefined$1,\\n // Horizontal timing color\\n timing_V: undefined$1,\\n // Vertical timing color\\n // ==== Backgroud Image\\n backgroundImage: undefined$1,\\n // Background Image\\n backgroundImageAlpha: 1,\\n // Background image transparency, value between 0 and 1. default is 1.\\n autoColor: false,\\n // Automatic color adjustment(for data block)\\n autoColorDark: 'rgba(0, 0, 0, .6)',\\n // Automatic color: dark CSS color\\n autoColorLight: 'rgba(255, 255, 255, .7)',\\n // Automatic color: light CSS color\\n // ==== Event Handler\\n onRenderingStart: undefined$1,\\n onRenderingEnd: undefined$1,\\n // ==== Versions\\n version: 0,\\n // The symbol versions of QR Code range from Version 1 to Version 40. default 0 means automatically choose the closest version based on the text length.\\n // ==== Tooltip\\n tooltip: false,\\n // Whether set the QRCode Text as the title attribute value of the image\\n // ==== Binary(hex) data mode\\n binary: false,\\n // Whether it is binary mode, default is text mode.\\n // ==== Drawing method\\n drawer: 'canvas',\\n // Drawing method: canvas, svg(Chrome, FF, IE9+)\\n // ==== CORS\\n crossOrigin: null,\\n // String which specifies the CORS setting to use when retrieving the image. null means that the crossOrigin attribute is not set.\\n // UTF-8 without BOM\\n utf8WithoutBOM: true\\n };\\n\\n if (typeof vOption === 'string') {\\n vOption = {\\n text: vOption\\n };\\n } // Overwrites options\\n\\n\\n if (vOption) {\\n for (var i in vOption) {\\n this._htOption[i] = vOption[i];\\n }\\n }\\n\\n if (this._htOption.version < 0 || this._htOption.version > 40) {\\n console.warn(\\\"QR Code version '\\\" + this._htOption.version + \\\"' is invalidate, reset to 0\\\");\\n this._htOption.version = 0;\\n }\\n\\n if (this._htOption.dotScale < 0 || this._htOption.dotScale > 1) {\\n console.warn(this._htOption.dotScale + ' , is invalidate, dotScale must greater than 0, less than or equal to 1, now reset to 1. ');\\n this._htOption.dotScale = 1;\\n }\\n\\n if (this._htOption.dotScaleTiming < 0 || this._htOption.dotScaleTiming > 1) {\\n console.warn(this._htOption.dotScaleTiming + ' , is invalidate, dotScaleTiming must greater than 0, less than or equal to 1, now reset to 1. ');\\n this._htOption.dotScaleTiming = 1;\\n }\\n\\n if (this._htOption.dotScaleTiming_H) {\\n if (this._htOption.dotScaleTiming_H < 0 || this._htOption.dotScaleTiming_H > 1) {\\n console.warn(this._htOption.dotScaleTiming_H + ' , is invalidate, dotScaleTiming_H must greater than 0, less than or equal to 1, now reset to 1. ');\\n this._htOption.dotScaleTiming_H = 1;\\n }\\n } else {\\n this._htOption.dotScaleTiming_H = this._htOption.dotScaleTiming;\\n }\\n\\n if (this._htOption.dotScaleTiming_V) {\\n if (this._htOption.dotScaleTiming_V < 0 || this._htOption.dotScaleTiming_V > 1) {\\n console.warn(this._htOption.dotScaleTiming_V + ' , is invalidate, dotScaleTiming_V must greater than 0, less than or equal to 1, now reset to 1. ');\\n this._htOption.dotScaleTiming_V = 1;\\n }\\n } else {\\n this._htOption.dotScaleTiming_V = this._htOption.dotScaleTiming;\\n }\\n\\n if (this._htOption.dotScaleA < 0 || this._htOption.dotScaleA > 1) {\\n console.warn(this._htOption.dotScaleA + ' , is invalidate, dotScaleA must greater than 0, less than or equal to 1, now reset to 1. ');\\n this._htOption.dotScaleA = 1;\\n }\\n\\n if (this._htOption.dotScaleAO) {\\n if (this._htOption.dotScaleAO < 0 || this._htOption.dotScaleAO > 1) {\\n console.warn(this._htOption.dotScaleAO + ' , is invalidate, dotScaleAO must greater than 0, less than or equal to 1, now reset to 1. ');\\n this._htOption.dotScaleAO = 1;\\n }\\n } else {\\n this._htOption.dotScaleAO = this._htOption.dotScaleA;\\n }\\n\\n if (this._htOption.dotScaleAI) {\\n if (this._htOption.dotScaleAI < 0 || this._htOption.dotScaleAI > 1) {\\n console.warn(this._htOption.dotScaleAI + ' , is invalidate, dotScaleAI must greater than 0, less than or equal to 1, now reset to 1. ');\\n this._htOption.dotScaleAI = 1;\\n }\\n } else {\\n this._htOption.dotScaleAI = this._htOption.dotScaleA;\\n }\\n\\n if (this._htOption.backgroundImageAlpha < 0 || this._htOption.backgroundImageAlpha > 1) {\\n console.warn(this._htOption.backgroundImageAlpha + ' , is invalidate, backgroundImageAlpha must between 0 and 1, now reset to 1. ');\\n this._htOption.backgroundImageAlpha = 1;\\n }\\n\\n this._htOption.height = this._htOption.height + this._htOption.titleHeight;\\n\\n if (typeof el == 'string') {\\n el = document.getElementById(el);\\n }\\n\\n if (!this._htOption.drawer || this._htOption.drawer != 'svg' && this._htOption.drawer != 'canvas') {\\n this._htOption.drawer = 'canvas';\\n }\\n\\n this._android = _getAndroid();\\n this._el = el;\\n this._oQRCode = null;\\n var _htOptionClone = {};\\n\\n for (var i in this._htOption) {\\n _htOptionClone[i] = this._htOption[i];\\n }\\n\\n this._oDrawing = new Drawing(this._el, _htOptionClone);\\n\\n if (this._htOption.text) {\\n this.makeCode(this._htOption.text);\\n }\\n };\\n /**\\n * Make the QRCode\\n *\\n * @param {String} sText link data\\n */\\n\\n\\n QRCode.prototype.makeCode = function (sText) {\\n this._oQRCode = new QRCodeModel(_getTypeNumber(sText, this._htOption), this._htOption.correctLevel);\\n\\n this._oQRCode.addData(sText, this._htOption.binary, this._htOption.utf8WithoutBOM);\\n\\n this._oQRCode.make();\\n\\n if (this._htOption.tooltip) {\\n this._el.title = sText;\\n }\\n\\n this._oDrawing.draw(this._oQRCode); // this.makeImage();\\n\\n };\\n /**\\n * Make the Image from Canvas element\\n * - It occurs automatically\\n * - Android below 3 doesn't support Data-URI spec.\\n *\\n * @private\\n */\\n\\n\\n QRCode.prototype.makeImage = function () {\\n if (typeof this._oDrawing.makeImage == 'function' && (!this._android || this._android >= 3)) {\\n this._oDrawing.makeImage();\\n }\\n };\\n /**\\n * Clear the QRCode\\n */\\n\\n\\n QRCode.prototype.clear = function () {\\n this._oDrawing.remove();\\n };\\n /**\\n * Resize the QRCode\\n */\\n\\n\\n QRCode.prototype.resize = function (width, height) {\\n this._oDrawing._htOption.width = width;\\n this._oDrawing._htOption.height = height;\\n\\n this._oDrawing.draw(this._oQRCode);\\n };\\n /**\\n * No Conflict\\n * @return QRCode object\\n */\\n\\n\\n QRCode.prototype.noConflict = function () {\\n if (root.QRCode === this) {\\n root.QRCode = _QRCode;\\n }\\n\\n return QRCode;\\n };\\n /**\\n * @name QRCode.CorrectLevel\\n */\\n\\n\\n QRCode.CorrectLevel = QRErrorCorrectLevel;\\n /*--------------------------------------------------------------------------*/\\n // Export QRCode\\n // AMD & CMD Compatibility\\n\\n if (typeof define == 'function' && (define.amd || define.cmd)) {\\n // 1. Define an anonymous module\\n define([], function () {\\n return QRCode;\\n });\\n } // CommonJS Compatibility(include NodeJS)\\n else if (freeModule) {\\n // Node.js\\n (freeModule.exports = QRCode).QRCode = QRCode; // Other CommonJS\\n\\n freeExports.QRCode = QRCode;\\n } else {\\n // Export Global\\n root.QRCode = QRCode;\\n }\\n}\",\n \"function Decoder(bytes) {\\n var decode=[];\\n var string_bin=\\\"\\\";\\n var tab_bin=[];\\n var string_bin_elements=\\\"\\\"; \\n var buffer=[];\\n var i=0;\\n var j=0;\\n \\n // Mise en forme de la payload propre à TTN\\n for(i=0;i4){ // pour les données de tailles supérieures à 4 bits et inféireures ou égales à 8 bits\\t\\t\\n //tab_bin[i]=tab_bin[i].padStart(8,'0');\\n tab_bin[i]=parseInt(tab_bin[i] , 2).toString(16).toUpperCase(); // Puis on convertit les binaire en hexa (en string)\\n tab_bin[i]=parseInt(tab_bin[i],16) ;//puis on convertit les string en int\\t\\n }\\n else{ // pour les données de tailles inférieures ou égales à 4 bits\\n //tab_bin[i]=tab_bin[i].padStart(4,'0');\\n tab_bin[i]=parseInt(tab_bin[i] , 2).toString(16).toUpperCase();\\n tab_bin[i]=parseInt(tab_bin[i], 16);\\n }\\n }\\n }\\n \\n \\n function get_iaq (a){\\n var result=\\\"\\\";\\n switch(a){\\n case 0:\\n result=tab_adjectif[0];\\n break;\\n case 1:\\n result=tab_adjectif[1];\\n break;\\n case 2:\\n result=tab_adjectif[2];\\n break;\\n case 3:\\n result=tab_adjectif[3];\\n break;\\n case 4:\\n result=tab_adjectif[4];\\n break;\\n case 5:\\n result=tab_adjectif[5];\\n break;\\n }\\n return result; \\n }\\n \\n function get_iaq_SRC(a){\\n \\n var result=\\\"\\\";\\n switch(a){\\n case 0:\\n result=tab_adjectif[6];\\n break;\\n case 1:\\n result=tab_adjectif[7];\\n break;\\n case 2:\\n result=tab_adjectif[8];\\n break;\\n case 3:\\n result=tab_adjectif[9];\\n break;\\n case 4:\\n result=tab_adjectif[10];\\n break;\\n case 5:\\n result=tab_adjectif[11];\\n break;\\n case 15:\\n result=tab_adjectif[5];\\n break;\\n }\\n return result; \\n }\\n \\n function get_IAQ_HCI(a){\\n var result=\\\"\\\";\\n switch(a){\\n case 0:\\n result=tab_adjectif[1];\\n break;\\n case 1:\\n result=tab_adjectif[2];\\n break;\\n case 2:\\n result=tab_adjectif[4];\\n break;\\n case 3:\\n result=tab_adjectif[5];\\n break;\\n }\\n return result; \\n }\\n \\n \\n function tab_decode (tab){ // on rentre en paramètre la table propre à chaque message \\n var compteur=0;\\n for ( i=0; i4){ // pour les données de tailles supérieures à 4 bits et inféireures ou égales à 8 bits\\n var nb_zeros=8-tab_bin[i].length;\\n for (j=0;j input.length) {\\n throw new Error('invalid rlp: total length is larger than the data');\\n }\\n innerRemainder = input.slice(llength, totalLength);\\n if (innerRemainder.length === 0) {\\n throw new Error('invalid rlp, List has a invalid length');\\n }\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(totalLength),\\n };\\n }\\n}\",\n \"function _decode(input) {\\n var length, llength, data, innerRemainder, d;\\n var decoded = [];\\n var firstByte = input[0];\\n if (firstByte <= 0x7f) {\\n // a single byte whose value is in the [0x00, 0x7f] range, that byte is its own RLP encoding.\\n return {\\n data: input.slice(0, 1),\\n remainder: input.slice(1),\\n };\\n }\\n else if (firstByte <= 0xb7) {\\n // string is 0-55 bytes long. A single byte with value 0x80 plus the length of the string followed by the string\\n // The range of the first byte is [0x80, 0xb7]\\n length = firstByte - 0x7f;\\n // set 0x80 null to 0\\n if (firstByte === 0x80) {\\n data = Buffer.from([]);\\n }\\n else {\\n data = input.slice(1, length);\\n }\\n if (length === 2 && data[0] < 0x80) {\\n throw new Error('invalid rlp encoding: byte must be less 0x80');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length),\\n };\\n }\\n else if (firstByte <= 0xbf) {\\n // string is greater than 55 bytes long. A single byte with the value (0xb7 plus the length of the length),\\n // followed by the length, followed by the string\\n llength = firstByte - 0xb6;\\n if (input.length - 1 < llength) {\\n throw new Error('invalid RLP: not enough bytes for string length');\\n }\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n if (length <= 55) {\\n throw new Error('invalid RLP: expected string length to be greater than 55');\\n }\\n data = input.slice(llength, length + llength);\\n if (data.length < length) {\\n throw new Error('invalid RLP: not enough bytes for string');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length + llength),\\n };\\n }\\n else if (firstByte <= 0xf7) {\\n // a list between 0-55 bytes long\\n length = firstByte - 0xbf;\\n innerRemainder = input.slice(1, length);\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(length),\\n };\\n }\\n else {\\n // a list over 55 bytes long\\n llength = firstByte - 0xf6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n var totalLength = llength + length;\\n if (totalLength > input.length) {\\n throw new Error('invalid rlp: total length is larger than the data');\\n }\\n innerRemainder = input.slice(llength, totalLength);\\n if (innerRemainder.length === 0) {\\n throw new Error('invalid rlp, List has a invalid length');\\n }\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(totalLength),\\n };\\n }\\n}\",\n \"function fromByteArray(uint8) {\\n var i;\\n var extraBytes = uint8.length % 3; // if we have 1 byte left, pad 2 bytes\\n var output = '';\\n var temp;\\n var length;\\n function encode(num) {\\n return lookup.charAt(num);\\n }\\n function tripletToBase64(num) {\\n return encode((num >> 18) & 0x3f) + encode((num >> 12) & 0x3f) + encode((num >> 6) & 0x3f) + encode(num & 0x3f);\\n }\\n // go through the array every three bytes, we'll deal with trailing stuff later\\n for (i = 0, length = uint8.length - extraBytes; i < length; i += 3) {\\n temp = (uint8[i] << 16) + (uint8[i + 1] << 8) + uint8[i + 2];\\n output += tripletToBase64(temp);\\n }\\n // pad the end with zeros, but make sure to not forget the extra bytes\\n switch (extraBytes) {\\n case 1:\\n temp = uint8[uint8.length - 1];\\n output += encode(temp >> 2);\\n output += encode((temp << 4) & 0x3f);\\n output += '==';\\n break;\\n case 2:\\n temp = (uint8[uint8.length - 2] << 8) + uint8[uint8.length - 1];\\n output += encode(temp >> 10);\\n output += encode((temp >> 4) & 0x3f);\\n output += encode((temp << 2) & 0x3f);\\n output += '=';\\n break;\\n default:\\n break;\\n }\\n return output;\\n}\",\n \"function QRCodeDataBlockReader(blocks, version, numErrorCorrectionCode)\\r\\n{\\r\\n\\tthis.blockPointer = 0;\\r\\n\\tthis.bitPointer = 7;\\r\\n\\tthis.dataLength = 0;\\r\\n\\tthis.blocks = blocks;\\r\\n\\tthis.numErrorCorrectionCode = numErrorCorrectionCode;\\r\\n\\tif (version <= 9)\\r\\n\\t\\tthis.dataLengthMode = 0;\\r\\n\\telse if (version >= 10 && version <= 26)\\r\\n\\t\\tthis.dataLengthMode = 1;\\r\\n\\telse if (version >= 27 && version <= 40)\\r\\n\\t\\tthis.dataLengthMode = 2;\\r\\n\\t\\t\\r\\n\\tthis.getNextBits = function( numBits)\\r\\n\\t\\t{\\t\\t\\t\\r\\n\\t\\t\\tvar bits = 0;\\r\\n\\t\\t\\tif (numBits < this.bitPointer + 1)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// next word fits into current data block\\r\\n\\t\\t\\t\\tvar mask = 0;\\r\\n\\t\\t\\t\\tfor (var i = 0; i < numBits; i++)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tmask += (1 << i);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tmask <<= (this.bitPointer - numBits + 1);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tbits = (this.blocks[this.blockPointer] & mask) >> (this.bitPointer - numBits + 1);\\r\\n\\t\\t\\t\\tthis.bitPointer -= numBits;\\r\\n\\t\\t\\t\\treturn bits;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if (numBits < this.bitPointer + 1 + 8)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// next word crosses 2 data blocks\\r\\n\\t\\t\\t\\tvar mask1 = 0;\\r\\n\\t\\t\\t\\tfor (var i = 0; i < this.bitPointer + 1; i++)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tmask1 += (1 << i);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tbits = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));\\r\\n this.blockPointer++;\\r\\n\\t\\t\\t\\tbits += ((this.blocks[this.blockPointer]) >> (8 - (numBits - (this.bitPointer + 1))));\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tthis.bitPointer = this.bitPointer - numBits % 8;\\r\\n\\t\\t\\t\\tif (this.bitPointer < 0)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tthis.bitPointer = 8 + this.bitPointer;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\treturn bits;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if (numBits < this.bitPointer + 1 + 16)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// next word crosses 3 data blocks\\r\\n\\t\\t\\t\\tvar mask1 = 0; // mask of first block\\r\\n\\t\\t\\t\\tvar mask3 = 0; // mask of 3rd block\\r\\n\\t\\t\\t\\t//bitPointer + 1 : number of bits of the 1st block\\r\\n\\t\\t\\t\\t//8 : number of the 2nd block (note that use already 8bits because next word uses 3 data blocks)\\r\\n\\t\\t\\t\\t//numBits - (bitPointer + 1 + 8) : number of bits of the 3rd block \\r\\n\\t\\t\\t\\tfor (var i = 0; i < this.bitPointer + 1; i++)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tmask1 += (1 << i);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tvar bitsFirstBlock = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));\\r\\n\\t\\t\\t\\tthis.blockPointer++;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tvar bitsSecondBlock = this.blocks[this.blockPointer] << (numBits - (this.bitPointer + 1 + 8));\\r\\n\\t\\t\\t\\tthis.blockPointer++;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor (var i = 0; i < numBits - (this.bitPointer + 1 + 8); i++)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tmask3 += (1 << i);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tmask3 <<= 8 - (numBits - (this.bitPointer + 1 + 8));\\r\\n\\t\\t\\t\\tvar bitsThirdBlock = (this.blocks[this.blockPointer] & mask3) >> (8 - (numBits - (this.bitPointer + 1 + 8)));\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tbits = bitsFirstBlock + bitsSecondBlock + bitsThirdBlock;\\r\\n\\t\\t\\t\\tthis.bitPointer = this.bitPointer - (numBits - 8) % 8;\\r\\n\\t\\t\\t\\tif (this.bitPointer < 0)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tthis.bitPointer = 8 + this.bitPointer;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\treturn bits;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\treturn 0;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\tthis.NextMode=function()\\r\\n\\t{\\r\\n\\t\\tif ((this.blockPointer > this.blocks.length - this.numErrorCorrectionCode - 2))\\r\\n\\t\\t\\treturn 0;\\r\\n\\t\\telse\\r\\n\\t\\t\\treturn this.getNextBits(4);\\r\\n\\t}\\r\\n\\tthis.getDataLength=function( modeIndicator)\\r\\n\\t\\t{\\r\\n\\t\\t\\tvar index = 0;\\r\\n\\t\\t\\twhile (true)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif ((modeIndicator >> index) == 1)\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tindex++;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\treturn this.getNextBits(qrcode.sizeOfDataLengthInfo[this.dataLengthMode][index]);\\r\\n\\t\\t}\\r\\n\\tthis.getRomanAndFigureString=function( dataLength)\\r\\n\\t\\t{\\r\\n\\t\\t\\tvar length = dataLength;\\r\\n\\t\\t\\tvar intData = 0;\\r\\n\\t\\t\\tvar strData = \\\"\\\";\\r\\n\\t\\t\\tvar tableRomanAndFigure = new Array('0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', ' ', '$', '%', '*', '+', '-', '.', '/', ':');\\r\\n\\t\\t\\tdo \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (length > 1)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tintData = this.getNextBits(11);\\r\\n\\t\\t\\t\\t\\tvar firstLetter = Math.floor(intData / 45);\\r\\n\\t\\t\\t\\t\\tvar secondLetter = intData % 45;\\r\\n\\t\\t\\t\\t\\tstrData += tableRomanAndFigure[firstLetter];\\r\\n\\t\\t\\t\\t\\tstrData += tableRomanAndFigure[secondLetter];\\r\\n\\t\\t\\t\\t\\tlength -= 2;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse if (length == 1)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tintData = this.getNextBits(6);\\r\\n\\t\\t\\t\\t\\tstrData += tableRomanAndFigure[intData];\\r\\n\\t\\t\\t\\t\\tlength -= 1;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\twhile (length > 0);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\treturn strData;\\r\\n\\t\\t}\\r\\n\\tthis.getFigureString=function( dataLength)\\r\\n\\t\\t{\\r\\n\\t\\t\\tvar length = dataLength;\\r\\n\\t\\t\\tvar intData = 0;\\r\\n\\t\\t\\tvar strData = \\\"\\\";\\r\\n\\t\\t\\tdo \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (length >= 3)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tintData = this.getNextBits(10);\\r\\n\\t\\t\\t\\t\\tif (intData < 100)\\r\\n\\t\\t\\t\\t\\t\\tstrData += \\\"0\\\";\\r\\n\\t\\t\\t\\t\\tif (intData < 10)\\r\\n\\t\\t\\t\\t\\t\\tstrData += \\\"0\\\";\\r\\n\\t\\t\\t\\t\\tlength -= 3;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse if (length == 2)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tintData = this.getNextBits(7);\\r\\n\\t\\t\\t\\t\\tif (intData < 10)\\r\\n\\t\\t\\t\\t\\t\\tstrData += \\\"0\\\";\\r\\n\\t\\t\\t\\t\\tlength -= 2;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse if (length == 1)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tintData = this.getNextBits(4);\\r\\n\\t\\t\\t\\t\\tlength -= 1;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tstrData += intData;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\twhile (length > 0);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\treturn strData;\\r\\n\\t\\t}\\r\\n\\tthis.get8bitByteArray=function( dataLength)\\r\\n\\t\\t{\\r\\n\\t\\t\\tvar length = dataLength;\\r\\n\\t\\t\\tvar intData = 0;\\r\\n\\t\\t\\tvar output = new Array();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tdo \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tintData = this.getNextBits(8);\\r\\n\\t\\t\\t\\toutput.push( intData);\\r\\n\\t\\t\\t\\tlength--;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\twhile (length > 0);\\r\\n\\t\\t\\treturn output;\\r\\n\\t\\t}\\r\\n this.getKanjiString=function( dataLength)\\r\\n\\t\\t{\\r\\n\\t\\t\\tvar length = dataLength;\\r\\n\\t\\t\\tvar intData = 0;\\r\\n\\t\\t\\tvar unicodeString = \\\"\\\";\\r\\n\\t\\t\\tdo \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tintData = getNextBits(13);\\r\\n\\t\\t\\t\\tvar lowerByte = intData % 0xC0;\\r\\n\\t\\t\\t\\tvar higherByte = intData / 0xC0;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tvar tempWord = (higherByte << 8) + lowerByte;\\r\\n\\t\\t\\t\\tvar shiftjisWord = 0;\\r\\n\\t\\t\\t\\tif (tempWord + 0x8140 <= 0x9FFC)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t// between 8140 - 9FFC on Shift_JIS character set\\r\\n\\t\\t\\t\\t\\tshiftjisWord = tempWord + 0x8140;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t// between E040 - EBBF on Shift_JIS character set\\r\\n\\t\\t\\t\\t\\tshiftjisWord = tempWord + 0xC140;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//var tempByte = new Array(0,0);\\r\\n\\t\\t\\t\\t//tempByte[0] = (sbyte) (shiftjisWord >> 8);\\r\\n\\t\\t\\t\\t//tempByte[1] = (sbyte) (shiftjisWord & 0xFF);\\r\\n\\t\\t\\t\\t//unicodeString += new String(SystemUtils.ToCharArray(SystemUtils.ToByteArray(tempByte)));\\r\\n unicodeString += String.fromCharCode(shiftjisWord);\\r\\n\\t\\t\\t\\tlength--;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\twhile (length > 0);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\treturn unicodeString;\\r\\n\\t\\t}\\r\\n\\r\\n\\tthis.__defineGetter__(\\\"DataByte\\\", function()\\r\\n\\t{\\r\\n\\t\\tvar output = new Array();\\r\\n\\t\\tvar MODE_NUMBER = 1;\\r\\n\\t var MODE_ROMAN_AND_NUMBER = 2;\\r\\n\\t var MODE_8BIT_BYTE = 4;\\r\\n\\t var MODE_KANJI = 8;\\r\\n\\t\\tdo \\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tvar mode = this.NextMode();\\r\\n\\t\\t\\t\\t\\t\\t//canvas.println(\\\"mode: \\\" + mode);\\r\\n\\t\\t\\t\\t\\t\\tif (mode == 0)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tif (output.length > 0)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tthrow \\\"Empty data block\\\";\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//if (mode != 1 && mode != 2 && mode != 4 && mode != 8)\\r\\n\\t\\t\\t\\t\\t\\t//\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\tif (mode != MODE_NUMBER && mode != MODE_ROMAN_AND_NUMBER && mode != MODE_8BIT_BYTE && mode != MODE_KANJI)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t/*\\t\\t\\t\\t\\tcanvas.println(\\\"Invalid mode: \\\" + mode);\\r\\n\\t\\t\\t\\t\\t\\t\\tmode = guessMode(mode);\\r\\n\\t\\t\\t\\t\\t\\t\\tcanvas.println(\\\"Guessed mode: \\\" + mode); */\\r\\n\\t\\t\\t\\t\\t\\t\\tthrow \\\"Invalid mode: \\\" + mode + \\\" in (block:\\\" + this.blockPointer + \\\" bit:\\\" + this.bitPointer + \\\")\\\";\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\tdataLength = this.getDataLength(mode);\\r\\n\\t\\t\\t\\t\\t\\tif (dataLength < 1)\\r\\n\\t\\t\\t\\t\\t\\t\\tthrow \\\"Invalid data length: \\\" + dataLength;\\r\\n\\t\\t\\t\\t\\t\\t//canvas.println(\\\"length: \\\" + dataLength);\\r\\n\\t\\t\\t\\t\\t\\tswitch (mode)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tcase MODE_NUMBER: \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t//canvas.println(\\\"Mode: Figure\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tvar temp_str = this.getFigureString(dataLength);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tvar ta = new Array(temp_str.length);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(var j=0;j 3)\\n\\t\\tthrow 'invalid ECC level';\\n\\n\\tif (ver < 0) {\\n\\t\\tfor (ver = 1; ver <= 40; ++ver) {\\n\\t\\t\\tif (data.length <= getmaxdatalen(ver, mode, ecclevel))\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tif (ver > 40)\\n\\t\\t\\tthrow 'too large data for the Qr format';\\n\\t} else if (ver < 1 || ver > 40) {\\n\\t\\tthrow 'invalid Qr version! should be between 1 and 40';\\n\\t}\\n\\n\\tif (mask != -1 && (mask < 0 || mask > 8))\\n\\t\\tthrow 'invalid mask';\\n\\t//console.log('version:', ver, 'mode:', mode, 'ECC:', ecclevel, 'mask:', mask )\\n\\treturn generate(data, ver, mode, ecclevel, mask);\\n}\",\n \"function generateFrame(data, options) {\\n\\tvar MODES = {'numeric': MODE_NUMERIC, 'alphanumeric': MODE_ALPHANUMERIC,\\n\\t\\t'octet': MODE_OCTET};\\n\\tvar ECCLEVELS = {'L': ECCLEVEL_L, 'M': ECCLEVEL_M, 'Q': ECCLEVEL_Q,\\n\\t\\t'H': ECCLEVEL_H};\\n\\n\\toptions = options || {};\\n\\tvar ver = options.version || -1;\\n\\tvar ecclevel = ECCLEVELS[(options.eccLevel || 'L').toUpperCase()];\\n\\tvar mode = options.mode ? MODES[options.mode.toLowerCase()] : -1;\\n\\tvar mask = 'mask' in options ? options.mask : -1;\\n\\n\\tif (mode < 0) {\\n\\t\\tif (typeof data === 'string') {\\n\\t\\t\\tif (data.match(NUMERIC_REGEXP)) {\\n\\t\\t\\t\\tmode = MODE_NUMERIC;\\n\\t\\t\\t} else if (data.match(ALPHANUMERIC_OUT_REGEXP)) {\\n\\t\\t\\t\\t// while encode supports case-insensitive encoding, we restrict the data to be uppercased when auto-selecting the mode.\\n\\t\\t\\t\\tmode = MODE_ALPHANUMERIC;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tmode = MODE_OCTET;\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tmode = MODE_OCTET;\\n\\t\\t}\\n\\t} else if (!(mode == MODE_NUMERIC || mode == MODE_ALPHANUMERIC ||\\n\\t\\tmode == MODE_OCTET)) {\\n\\t\\tthrow 'invalid or unsupported mode';\\n\\t}\\n\\n\\tdata = validatedata(mode, data);\\n\\tif (data === null)\\n\\t\\tthrow 'invalid data format';\\n\\n\\tif (ecclevel < 0 || ecclevel > 3)\\n\\t\\tthrow 'invalid ECC level';\\n\\n\\tif (ver < 0) {\\n\\t\\tfor (ver = 1; ver <= 40; ++ver) {\\n\\t\\t\\tif (data.length <= getmaxdatalen(ver, mode, ecclevel))\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tif (ver > 40)\\n\\t\\t\\tthrow 'too large data for the Qr format';\\n\\t} else if (ver < 1 || ver > 40) {\\n\\t\\tthrow 'invalid Qr version! should be between 1 and 40';\\n\\t}\\n\\n\\tif (mask != -1 && (mask < 0 || mask > 8))\\n\\t\\tthrow 'invalid mask';\\n\\t//console.log('version:', ver, 'mode:', mode, 'ECC:', ecclevel, 'mask:', mask )\\n\\treturn generate(data, ver, mode, ecclevel, mask);\\n}\",\n \"function DT_DecoderDataResponse(decoderData, rawDecoderData, symbologyType, dlParsedObject) {\\n\\n // We recomend using the \\\"RAW\\\" Base64 data and decoding it with the built-in \\\"atob\\\" function\\n \\n // Now you can call processing functions to handle the barcode scanner data however you'd like.\\n // var ActiveObject = document.activeElement;\\n // ActiveObject.value = scanData;\\n // scanData = atob(dlParsedObject);\\n \\n // Alert the user with a naitive iOS alert box of the scan data\\n // DT_AlertBoxRequest(12345, 'Scan Data', 'first name: ' + dlParsedObject.firstName, ['OK']);\\n\\n // Check if we're in the survey section\\n if (currentSurveySection == 'final') {\\n scanCoupon(decoderData);\\n } else {\\n entryMethod = 'Barcode';\\n fillFormFields(decoderData, rawDecoderData, null, null, symbologyType, dlParsedObject);\\n }\\n}\",\n \"function _decode(input) {\\n var length, llength, data, innerRemainder, d;\\n var decoded = [];\\n var firstByte = input[0];\\n if (firstByte <= 0x7f) {\\n // a single byte whose value is in the [0x00, 0x7f] range, that byte is its own RLP encoding.\\n return {\\n data: input.slice(0, 1),\\n remainder: input.slice(1),\\n };\\n }\\n else if (firstByte <= 0xb7) {\\n // string is 0-55 bytes long. A single byte with value 0x80 plus the length of the string followed by the string\\n // The range of the first byte is [0x80, 0xb7]\\n length = firstByte - 0x7f;\\n // set 0x80 null to 0\\n if (firstByte === 0x80) {\\n data = Buffer.from([]);\\n }\\n else {\\n data = input.slice(1, length);\\n }\\n if (length === 2 && data[0] < 0x80) {\\n throw new Error('invalid rlp encoding: byte must be less 0x80');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length),\\n };\\n }\\n else if (firstByte <= 0xbf) {\\n llength = firstByte - 0xb6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n data = input.slice(llength, length + llength);\\n if (data.length < length) {\\n throw new Error('invalid RLP');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length + llength),\\n };\\n }\\n else if (firstByte <= 0xf7) {\\n // a list between 0-55 bytes long\\n length = firstByte - 0xbf;\\n innerRemainder = input.slice(1, length);\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(length),\\n };\\n }\\n else {\\n // a list over 55 bytes long\\n llength = firstByte - 0xf6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n var totalLength = llength + length;\\n if (totalLength > input.length) {\\n throw new Error('invalid rlp: total length is larger than the data');\\n }\\n innerRemainder = input.slice(llength, totalLength);\\n if (innerRemainder.length === 0) {\\n throw new Error('invalid rlp, List has a invalid length');\\n }\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(totalLength),\\n };\\n }\\n }\",\n \"function decode(t){let e=t.toLowerCase(),n=e.lastIndexOf(\\\"1\\\"),i=e.substring(0,n),r=e.substring(n+1,e.length-6),o=e.substring(e.length-6,e.length);if(!verify_checksum(i,bech32ToFiveBitArray(r+o)))throw\\\"Malformed request: checksum is incorrect\\\";return{human_readable_part:decodeHumanReadablePart(i),data:decodeData(r,i),checksum:o}}\",\n \"function _decode(input) {\\n var length, llength, data, innerRemainder, d;\\n var decoded = [];\\n var firstByte = input[0];\\n if (firstByte <= 0x7f) {\\n // a single byte whose value is in the [0x00, 0x7f] range, that byte is its own RLP encoding.\\n return {\\n data: input.slice(0, 1),\\n remainder: input.slice(1),\\n };\\n }\\n else if (firstByte <= 0xb7) {\\n // string is 0-55 bytes long. A single byte with value 0x80 plus the length of the string followed by the string\\n // The range of the first byte is [0x80, 0xb7]\\n length = firstByte - 0x7f;\\n // set 0x80 null to 0\\n if (firstByte === 0x80) {\\n data = Buffer.from([]);\\n }\\n else {\\n data = input.slice(1, length);\\n }\\n if (length === 2 && data[0] < 0x80) {\\n throw new Error('invalid rlp encoding: byte must be less 0x80');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length),\\n };\\n }\\n else if (firstByte <= 0xbf) {\\n llength = firstByte - 0xb6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n data = input.slice(llength, length + llength);\\n if (data.length < length) {\\n throw new Error('invalid RLP');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length + llength),\\n };\\n }\\n else if (firstByte <= 0xf7) {\\n // a list between 0-55 bytes long\\n length = firstByte - 0xbf;\\n innerRemainder = input.slice(1, length);\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(length),\\n };\\n }\\n else {\\n // a list over 55 bytes long\\n llength = firstByte - 0xf6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n var totalLength = llength + length;\\n if (totalLength > input.length) {\\n throw new Error('invalid rlp: total length is larger than the data');\\n }\\n innerRemainder = input.slice(llength, totalLength);\\n if (innerRemainder.length === 0) {\\n throw new Error('invalid rlp, List has a invalid length');\\n }\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(totalLength),\\n };\\n }\\n}\",\n \"function _decode(input) {\\n var length, llength, data, innerRemainder, d;\\n var decoded = [];\\n var firstByte = input[0];\\n if (firstByte <= 0x7f) {\\n // a single byte whose value is in the [0x00, 0x7f] range, that byte is its own RLP encoding.\\n return {\\n data: input.slice(0, 1),\\n remainder: input.slice(1),\\n };\\n }\\n else if (firstByte <= 0xb7) {\\n // string is 0-55 bytes long. A single byte with value 0x80 plus the length of the string followed by the string\\n // The range of the first byte is [0x80, 0xb7]\\n length = firstByte - 0x7f;\\n // set 0x80 null to 0\\n if (firstByte === 0x80) {\\n data = Buffer.from([]);\\n }\\n else {\\n data = input.slice(1, length);\\n }\\n if (length === 2 && data[0] < 0x80) {\\n throw new Error('invalid rlp encoding: byte must be less 0x80');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length),\\n };\\n }\\n else if (firstByte <= 0xbf) {\\n llength = firstByte - 0xb6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n data = input.slice(llength, length + llength);\\n if (data.length < length) {\\n throw new Error('invalid RLP');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length + llength),\\n };\\n }\\n else if (firstByte <= 0xf7) {\\n // a list between 0-55 bytes long\\n length = firstByte - 0xbf;\\n innerRemainder = input.slice(1, length);\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(length),\\n };\\n }\\n else {\\n // a list over 55 bytes long\\n llength = firstByte - 0xf6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n var totalLength = llength + length;\\n if (totalLength > input.length) {\\n throw new Error('invalid rlp: total length is larger than the data');\\n }\\n innerRemainder = input.slice(llength, totalLength);\\n if (innerRemainder.length === 0) {\\n throw new Error('invalid rlp, List has a invalid length');\\n }\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(totalLength),\\n };\\n }\\n}\",\n \"function _decode(input) {\\n var length, llength, data, innerRemainder, d;\\n var decoded = [];\\n var firstByte = input[0];\\n if (firstByte <= 0x7f) {\\n // a single byte whose value is in the [0x00, 0x7f] range, that byte is its own RLP encoding.\\n return {\\n data: input.slice(0, 1),\\n remainder: input.slice(1),\\n };\\n }\\n else if (firstByte <= 0xb7) {\\n // string is 0-55 bytes long. A single byte with value 0x80 plus the length of the string followed by the string\\n // The range of the first byte is [0x80, 0xb7]\\n length = firstByte - 0x7f;\\n // set 0x80 null to 0\\n if (firstByte === 0x80) {\\n data = Buffer.from([]);\\n }\\n else {\\n data = input.slice(1, length);\\n }\\n if (length === 2 && data[0] < 0x80) {\\n throw new Error('invalid rlp encoding: byte must be less 0x80');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length),\\n };\\n }\\n else if (firstByte <= 0xbf) {\\n llength = firstByte - 0xb6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n data = input.slice(llength, length + llength);\\n if (data.length < length) {\\n throw new Error('invalid RLP');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length + llength),\\n };\\n }\\n else if (firstByte <= 0xf7) {\\n // a list between 0-55 bytes long\\n length = firstByte - 0xbf;\\n innerRemainder = input.slice(1, length);\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(length),\\n };\\n }\\n else {\\n // a list over 55 bytes long\\n llength = firstByte - 0xf6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n var totalLength = llength + length;\\n if (totalLength > input.length) {\\n throw new Error('invalid rlp: total length is larger than the data');\\n }\\n innerRemainder = input.slice(llength, totalLength);\\n if (innerRemainder.length === 0) {\\n throw new Error('invalid rlp, List has a invalid length');\\n }\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(totalLength),\\n };\\n }\\n}\",\n \"function _decode(input) {\\n var length, llength, data, innerRemainder, d;\\n var decoded = [];\\n var firstByte = input[0];\\n if (firstByte <= 0x7f) {\\n // a single byte whose value is in the [0x00, 0x7f] range, that byte is its own RLP encoding.\\n return {\\n data: input.slice(0, 1),\\n remainder: input.slice(1),\\n };\\n }\\n else if (firstByte <= 0xb7) {\\n // string is 0-55 bytes long. A single byte with value 0x80 plus the length of the string followed by the string\\n // The range of the first byte is [0x80, 0xb7]\\n length = firstByte - 0x7f;\\n // set 0x80 null to 0\\n if (firstByte === 0x80) {\\n data = Buffer.from([]);\\n }\\n else {\\n data = input.slice(1, length);\\n }\\n if (length === 2 && data[0] < 0x80) {\\n throw new Error('invalid rlp encoding: byte must be less 0x80');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length),\\n };\\n }\\n else if (firstByte <= 0xbf) {\\n llength = firstByte - 0xb6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n data = input.slice(llength, length + llength);\\n if (data.length < length) {\\n throw new Error('invalid RLP');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length + llength),\\n };\\n }\\n else if (firstByte <= 0xf7) {\\n // a list between 0-55 bytes long\\n length = firstByte - 0xbf;\\n innerRemainder = input.slice(1, length);\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(length),\\n };\\n }\\n else {\\n // a list over 55 bytes long\\n llength = firstByte - 0xf6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n var totalLength = llength + length;\\n if (totalLength > input.length) {\\n throw new Error('invalid rlp: total length is larger than the data');\\n }\\n innerRemainder = input.slice(llength, totalLength);\\n if (innerRemainder.length === 0) {\\n throw new Error('invalid rlp, List has a invalid length');\\n }\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(totalLength),\\n };\\n }\\n}\",\n \"function _decode(input) {\\n var length, llength, data, innerRemainder, d;\\n var decoded = [];\\n var firstByte = input[0];\\n if (firstByte <= 0x7f) {\\n // a single byte whose value is in the [0x00, 0x7f] range, that byte is its own RLP encoding.\\n return {\\n data: input.slice(0, 1),\\n remainder: input.slice(1),\\n };\\n }\\n else if (firstByte <= 0xb7) {\\n // string is 0-55 bytes long. A single byte with value 0x80 plus the length of the string followed by the string\\n // The range of the first byte is [0x80, 0xb7]\\n length = firstByte - 0x7f;\\n // set 0x80 null to 0\\n if (firstByte === 0x80) {\\n data = Buffer.from([]);\\n }\\n else {\\n data = input.slice(1, length);\\n }\\n if (length === 2 && data[0] < 0x80) {\\n throw new Error('invalid rlp encoding: byte must be less 0x80');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length),\\n };\\n }\\n else if (firstByte <= 0xbf) {\\n llength = firstByte - 0xb6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n data = input.slice(llength, length + llength);\\n if (data.length < length) {\\n throw new Error('invalid RLP');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length + llength),\\n };\\n }\\n else if (firstByte <= 0xf7) {\\n // a list between 0-55 bytes long\\n length = firstByte - 0xbf;\\n innerRemainder = input.slice(1, length);\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(length),\\n };\\n }\\n else {\\n // a list over 55 bytes long\\n llength = firstByte - 0xf6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n var totalLength = llength + length;\\n if (totalLength > input.length) {\\n throw new Error('invalid rlp: total length is larger than the data');\\n }\\n innerRemainder = input.slice(llength, totalLength);\\n if (innerRemainder.length === 0) {\\n throw new Error('invalid rlp, List has a invalid length');\\n }\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(totalLength),\\n };\\n }\\n}\",\n \"function _decode(input) {\\n var length, llength, data, innerRemainder, d;\\n var decoded = [];\\n var firstByte = input[0];\\n if (firstByte <= 0x7f) {\\n // a single byte whose value is in the [0x00, 0x7f] range, that byte is its own RLP encoding.\\n return {\\n data: input.slice(0, 1),\\n remainder: input.slice(1),\\n };\\n }\\n else if (firstByte <= 0xb7) {\\n // string is 0-55 bytes long. A single byte with value 0x80 plus the length of the string followed by the string\\n // The range of the first byte is [0x80, 0xb7]\\n length = firstByte - 0x7f;\\n // set 0x80 null to 0\\n if (firstByte === 0x80) {\\n data = Buffer.from([]);\\n }\\n else {\\n data = input.slice(1, length);\\n }\\n if (length === 2 && data[0] < 0x80) {\\n throw new Error('invalid rlp encoding: byte must be less 0x80');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length),\\n };\\n }\\n else if (firstByte <= 0xbf) {\\n llength = firstByte - 0xb6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n data = input.slice(llength, length + llength);\\n if (data.length < length) {\\n throw new Error('invalid RLP');\\n }\\n return {\\n data: data,\\n remainder: input.slice(length + llength),\\n };\\n }\\n else if (firstByte <= 0xf7) {\\n // a list between 0-55 bytes long\\n length = firstByte - 0xbf;\\n innerRemainder = input.slice(1, length);\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(length),\\n };\\n }\\n else {\\n // a list over 55 bytes long\\n llength = firstByte - 0xf6;\\n length = safeParseInt(input.slice(1, llength).toString('hex'), 16);\\n var totalLength = llength + length;\\n if (totalLength > input.length) {\\n throw new Error('invalid rlp: total length is larger than the data');\\n }\\n innerRemainder = input.slice(llength, totalLength);\\n if (innerRemainder.length === 0) {\\n throw new Error('invalid rlp, List has a invalid length');\\n }\\n while (innerRemainder.length) {\\n d = _decode(innerRemainder);\\n decoded.push(d.data);\\n innerRemainder = d.remainder;\\n }\\n return {\\n data: decoded,\\n remainder: input.slice(totalLength),\\n };\\n }\\n}\",\n \"_encodeQRCodeData(data) {\\n try {\\n const jsonString = JSON.stringify(data);\\n return this._compressAndBase32Encode(jsonString);\\n } catch (encodeJSONError) {\\n console.error(encodeJSONError);\\n throw new Error(\\\"Unable to create QR code (JSON encode error).\\\");\\n }\\n }\",\n \"function generateFrame(data, options) {\\n var MODES = {\\n 'numeric': MODE_NUMERIC,\\n 'alphanumeric': MODE_ALPHANUMERIC,\\n 'octet': MODE_OCTET\\n };\\n var ECCLEVELS = {\\n 'L': ECCLEVEL_L,\\n 'M': ECCLEVEL_M,\\n 'Q': ECCLEVEL_Q,\\n 'H': ECCLEVEL_H\\n };\\n options = options || {};\\n var ver = options.version || -1;\\n var ecclevel = ECCLEVELS[(options.eccLevel || 'L').toUpperCase()];\\n var mode = options.mode ? MODES[options.mode.toLowerCase()] : -1;\\n var mask = 'mask' in options ? options.mask : -1;\\n\\n if (mode < 0) {\\n if (typeof data === 'string') {\\n if (data.match(NUMERIC_REGEXP)) {\\n mode = MODE_NUMERIC;\\n } else if (data.match(ALPHANUMERIC_OUT_REGEXP)) {\\n // while encode supports case-insensitive encoding, we restrict the data to be uppercased when auto-selecting the mode.\\n mode = MODE_ALPHANUMERIC;\\n } else {\\n mode = MODE_OCTET;\\n }\\n } else {\\n mode = MODE_OCTET;\\n }\\n } else if (!(mode == MODE_NUMERIC || mode == MODE_ALPHANUMERIC || mode == MODE_OCTET)) {\\n throw 'invalid or unsupported mode';\\n }\\n\\n data = validatedata(mode, data);\\n if (data === null) throw 'invalid data format';\\n if (ecclevel < 0 || ecclevel > 3) throw 'invalid ECC level';\\n\\n if (ver < 0) {\\n for (ver = 1; ver <= 40; ++ver) {\\n if (data.length <= getmaxdatalen(ver, mode, ecclevel)) break;\\n }\\n\\n if (ver > 40) throw 'too large data for the Qr format';\\n } else if (ver < 1 || ver > 40) {\\n throw 'invalid Qr version! should be between 1 and 40';\\n }\\n\\n if (mask != -1 && (mask < 0 || mask > 8)) throw 'invalid mask'; //console.log('version:', ver, 'mode:', mode, 'ECC:', ecclevel, 'mask:', mask )\\n\\n return generate(data, ver, mode, ecclevel, mask);\\n} // options\",\n \"function QR8bitByte(t){this.mode=QRMode.MODE_8BIT_BYTE,this.data=t}\",\n \"function QR() {\\n var typeNumber = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 6;\\n var errorCorrectLevel = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : errorCorrectLevel_1.ErrorCorrectLevel.L;\\n\\n _classCallCheck(this, QR);\\n\\n if (!numberHelper_1.NumberHelper.isInteger(typeNumber) || typeNumber < 0 || typeNumber > 40) {\\n throw Error(\\\"The typeNumber parameter should be a number >= 0 and <= 40\\\");\\n }\\n\\n this._typeNumber = typeNumber;\\n this._errorCorrectLevel = errorCorrectLevel;\\n this._qrData = [];\\n this._moduleCount = 0;\\n this._modules = [];\\n mathHelper_1.MathHelper.initialize();\\n }\",\n \"function QR8bitByte(data) {\\n\\tthis.mode = QRMode.MODE_8BIT_BYTE;\\n\\tthis.data = data;\\n}\",\n \"function QR8bitByte(data) {\\n this.mode = QRMode.MODE_8BIT_BYTE;\\n this.data = data;\\n }\",\n \"function decode(paddedInput) {\\n // Remove up to last two equal signs.\\n var input = paddedInput.replace(/==?$/, '');\\n var outputLength = Math.floor((input.length / 4) * 3);\\n // Prepare output buffer.\\n var data = new ArrayBuffer(outputLength);\\n var view = new Uint8Array(data);\\n var cursor = 0;\\n /**\\n * Returns the next integer representation of a sixtet of bytes from the input\\n * @returns sixtet of bytes\\n */\\n function nextSixtet() {\\n var char = input.charAt(cursor++);\\n var index = BASE64_CHARMAP.indexOf(char);\\n if (index === -1) {\\n throw new Error(\\\"Illegal character at \\\".concat(cursor, \\\": \\\").concat(input.charAt(cursor - 1)));\\n }\\n return index;\\n }\\n for (var i = 0; i < outputLength; i += 3) {\\n // Obtain four sixtets\\n var sx1 = nextSixtet();\\n var sx2 = nextSixtet();\\n var sx3 = nextSixtet();\\n var sx4 = nextSixtet();\\n // Encode them as three octets\\n var oc1 = ((sx1 & 63) << 2) | (sx2 >> 4);\\n var oc2 = ((sx2 & 15) << 4) | (sx3 >> 2);\\n var oc3 = ((sx3 & 3) << 6) | (sx4 >> 0);\\n view[i] = oc1;\\n // Skip padding bytes.\\n if (sx3 != 64)\\n view[i + 1] = oc2;\\n if (sx4 != 64)\\n view[i + 2] = oc3;\\n }\\n return data;\\n}\",\n \"function h$decodeUtf8(v,n0,start) {\\n// h$log(\\\"### decodeUtf8\\\");\\n// h$log(v);\\n var n = n0 || v.len;\\n var arr = [];\\n var i = start || 0;\\n var code;\\n var u8 = v.u8;\\n// h$log(\\\"### decoding, starting at: \\\" + i);\\n while(i < n) {\\n var c = u8[i];\\n while((c & 0xC0) === 0x80) {\\n c = u8[++i];\\n }\\n// h$log(\\\"### lead char: \\\" + c);\\n if((c & 0x80) === 0) {\\n code = (c & 0x7F);\\n i++;\\n } else if((c & 0xE0) === 0xC0) {\\n code = ( ((c & 0x1F) << 6)\\n | (u8[i+1] & 0x3F)\\n );\\n i+=2;\\n } else if((c & 0xF0) === 0xE0) {\\n code = ( ((c & 0x0F) << 12)\\n | ((u8[i+1] & 0x3F) << 6)\\n | (u8[i+2] & 0x3F)\\n );\\n i+=3;\\n } else if ((c & 0xF8) === 0xF0) {\\n code = ( ((c & 0x07) << 18)\\n | ((u8[i+1] & 0x3F) << 12)\\n | ((u8[i+2] & 0x3F) << 6)\\n | (u8[i+3] & 0x3F)\\n );\\n i+=4;\\n } else if((c & 0xFC) === 0xF8) {\\n code = ( ((c & 0x03) << 24)\\n | ((u8[i+1] & 0x3F) << 18)\\n | ((u8[i+2] & 0x3F) << 12)\\n | ((u8[i+3] & 0x3F) << 6)\\n | (u8[i+4] & 0x3F)\\n );\\n i+=5;\\n } else {\\n code = ( ((c & 0x01) << 30)\\n | ((u8[i+1] & 0x3F) << 24)\\n | ((u8[i+2] & 0x3F) << 18)\\n | ((u8[i+3] & 0x3F) << 12)\\n | ((u8[i+4] & 0x3F) << 6)\\n | (u8[i+5] & 0x3F)\\n );\\n i+=6;\\n }\\n // h$log(\\\"### decoded codePoint: \\\" + code + \\\" - \\\" + String.fromCharCode(code)); // String.fromCodePoint(code));\\n // need to deal with surrogate pairs\\n if(code > 0xFFFF) {\\n var offset = code - 0x10000;\\n arr.push(0xD800 + (offset >> 10), 0xDC00 + (offset & 0x3FF));\\n } else {\\n arr.push(code);\\n }\\n }\\n return h$charCodeArrayToString(arr);\\n}\",\n \"function h$decodeUtf8(v,n0,start) {\\n// h$log(\\\"### decodeUtf8\\\");\\n// h$log(v);\\n var n = n0 || v.len;\\n var arr = [];\\n var i = start || 0;\\n var code;\\n var u8 = v.u8;\\n// h$log(\\\"### decoding, starting at: \\\" + i);\\n while(i < n) {\\n var c = u8[i];\\n while((c & 0xC0) === 0x80) {\\n c = u8[++i];\\n }\\n// h$log(\\\"### lead char: \\\" + c);\\n if((c & 0x80) === 0) {\\n code = (c & 0x7F);\\n i++;\\n } else if((c & 0xE0) === 0xC0) {\\n code = ( ((c & 0x1F) << 6)\\n | (u8[i+1] & 0x3F)\\n );\\n i+=2;\\n } else if((c & 0xF0) === 0xE0) {\\n code = ( ((c & 0x0F) << 12)\\n | ((u8[i+1] & 0x3F) << 6)\\n | (u8[i+2] & 0x3F)\\n );\\n i+=3;\\n } else if ((c & 0xF8) === 0xF0) {\\n code = ( ((c & 0x07) << 18)\\n | ((u8[i+1] & 0x3F) << 12)\\n | ((u8[i+2] & 0x3F) << 6)\\n | (u8[i+3] & 0x3F)\\n );\\n i+=4;\\n } else if((c & 0xFC) === 0xF8) {\\n code = ( ((c & 0x03) << 24)\\n | ((u8[i+1] & 0x3F) << 18)\\n | ((u8[i+2] & 0x3F) << 12)\\n | ((u8[i+3] & 0x3F) << 6)\\n | (u8[i+4] & 0x3F)\\n );\\n i+=5;\\n } else {\\n code = ( ((c & 0x01) << 30)\\n | ((u8[i+1] & 0x3F) << 24)\\n | ((u8[i+2] & 0x3F) << 18)\\n | ((u8[i+3] & 0x3F) << 12)\\n | ((u8[i+4] & 0x3F) << 6)\\n | (u8[i+5] & 0x3F)\\n );\\n i+=6;\\n }\\n // h$log(\\\"### decoded codePoint: \\\" + code + \\\" - \\\" + String.fromCharCode(code)); // String.fromCodePoint(code));\\n // need to deal with surrogate pairs\\n if(code > 0xFFFF) {\\n var offset = code - 0x10000;\\n arr.push(0xD800 + (offset >> 10), 0xDC00 + (offset & 0x3FF));\\n } else {\\n arr.push(code);\\n }\\n }\\n return h$charCodeArrayToString(arr);\\n}\",\n \"function h$decodeUtf8(v,n0,start) {\\n// h$log(\\\"### decodeUtf8\\\");\\n// h$log(v);\\n var n = n0 || v.len;\\n var arr = [];\\n var i = start || 0;\\n var code;\\n var u8 = v.u8;\\n// h$log(\\\"### decoding, starting at: \\\" + i);\\n while(i < n) {\\n var c = u8[i];\\n while((c & 0xC0) === 0x80) {\\n c = u8[++i];\\n }\\n// h$log(\\\"### lead char: \\\" + c);\\n if((c & 0x80) === 0) {\\n code = (c & 0x7F);\\n i++;\\n } else if((c & 0xE0) === 0xC0) {\\n code = ( ((c & 0x1F) << 6)\\n | (u8[i+1] & 0x3F)\\n );\\n i+=2;\\n } else if((c & 0xF0) === 0xE0) {\\n code = ( ((c & 0x0F) << 12)\\n | ((u8[i+1] & 0x3F) << 6)\\n | (u8[i+2] & 0x3F)\\n );\\n i+=3;\\n } else if ((c & 0xF8) === 0xF0) {\\n code = ( ((c & 0x07) << 18)\\n | ((u8[i+1] & 0x3F) << 12)\\n | ((u8[i+2] & 0x3F) << 6)\\n | (u8[i+3] & 0x3F)\\n );\\n i+=4;\\n } else if((c & 0xFC) === 0xF8) {\\n code = ( ((c & 0x03) << 24)\\n | ((u8[i+1] & 0x3F) << 18)\\n | ((u8[i+2] & 0x3F) << 12)\\n | ((u8[i+3] & 0x3F) << 6)\\n | (u8[i+4] & 0x3F)\\n );\\n i+=5;\\n } else {\\n code = ( ((c & 0x01) << 30)\\n | ((u8[i+1] & 0x3F) << 24)\\n | ((u8[i+2] & 0x3F) << 18)\\n | ((u8[i+3] & 0x3F) << 12)\\n | ((u8[i+4] & 0x3F) << 6)\\n | (u8[i+5] & 0x3F)\\n );\\n i+=6;\\n }\\n // h$log(\\\"### decoded codePoint: \\\" + code + \\\" - \\\" + String.fromCharCode(code)); // String.fromCodePoint(code));\\n // need to deal with surrogate pairs\\n if(code > 0xFFFF) {\\n var offset = code - 0x10000;\\n arr.push(0xD800 + (offset >> 10), 0xDC00 + (offset & 0x3FF));\\n } else {\\n arr.push(code);\\n }\\n }\\n return h$charCodeArrayToString(arr);\\n}\",\n \"function h$decodeUtf8(v,n0,start) {\\n// h$log(\\\"### decodeUtf8\\\");\\n// h$log(v);\\n var n = n0 || v.len;\\n var arr = [];\\n var i = start || 0;\\n var code;\\n var u8 = v.u8;\\n// h$log(\\\"### decoding, starting at: \\\" + i);\\n while(i < n) {\\n var c = u8[i];\\n while((c & 0xC0) === 0x80) {\\n c = u8[++i];\\n }\\n// h$log(\\\"### lead char: \\\" + c);\\n if((c & 0x80) === 0) {\\n code = (c & 0x7F);\\n i++;\\n } else if((c & 0xE0) === 0xC0) {\\n code = ( ((c & 0x1F) << 6)\\n | (u8[i+1] & 0x3F)\\n );\\n i+=2;\\n } else if((c & 0xF0) === 0xE0) {\\n code = ( ((c & 0x0F) << 12)\\n | ((u8[i+1] & 0x3F) << 6)\\n | (u8[i+2] & 0x3F)\\n );\\n i+=3;\\n } else if ((c & 0xF8) === 0xF0) {\\n code = ( ((c & 0x07) << 18)\\n | ((u8[i+1] & 0x3F) << 12)\\n | ((u8[i+2] & 0x3F) << 6)\\n | (u8[i+3] & 0x3F)\\n );\\n i+=4;\\n } else if((c & 0xFC) === 0xF8) {\\n code = ( ((c & 0x03) << 24)\\n | ((u8[i+1] & 0x3F) << 18)\\n | ((u8[i+2] & 0x3F) << 12)\\n | ((u8[i+3] & 0x3F) << 6)\\n | (u8[i+4] & 0x3F)\\n );\\n i+=5;\\n } else {\\n code = ( ((c & 0x01) << 30)\\n | ((u8[i+1] & 0x3F) << 24)\\n | ((u8[i+2] & 0x3F) << 18)\\n | ((u8[i+3] & 0x3F) << 12)\\n | ((u8[i+4] & 0x3F) << 6)\\n | (u8[i+5] & 0x3F)\\n );\\n i+=6;\\n }\\n // h$log(\\\"### decoded codePoint: \\\" + code + \\\" - \\\" + String.fromCharCode(code)); // String.fromCodePoint(code));\\n // need to deal with surrogate pairs\\n if(code > 0xFFFF) {\\n var offset = code - 0x10000;\\n arr.push(0xD800 + (offset >> 10), 0xDC00 + (offset & 0x3FF));\\n } else {\\n arr.push(code);\\n }\\n }\\n return String.fromCharCode.apply(this, arr);\\n}\",\n \"function QRCodeDataBlockReader(e,t,n){this.blockPointer=0;this.bitPointer=7;this.dataLength=0;this.blocks=e;this.numErrorCorrectionCode=n;if(t<=9)this.dataLengthMode=0;else if(t>=10&&t<=26)this.dataLengthMode=1;else if(t>=27&&t<=40)this.dataLengthMode=2;this.getNextBits=function(e){var t=0;if(e>this.bitPointer-e+1;this.bitPointer-=e;return t}else if(e>8-(e-(this.bitPointer+1));this.bitPointer=this.bitPointer-e%8;if(this.bitPointer<0){this.bitPointer=8+this.bitPointer}return t}else if(e>8-(e-(this.bitPointer+1+8));t=o+u+a;this.bitPointer=this.bitPointer-(e-8)%8;if(this.bitPointer<0){this.bitPointer=8+this.bitPointer}return t}else{return 0}};this.NextMode=function(){if(this.blockPointer>this.blocks.length-this.numErrorCorrectionCode-2)return 0;else return this.getNextBits(4)};this.getDataLength=function(e){var t=0;while(true){if(e>>t==1)break;t++}return this.getNextBits(qrcode.sizeOfDataLengthInfo[this.dataLengthMode][t])};this.getRomanAndFigureString=function(e){var t=e;var n=0;var r=\\\"\\\";var i=new Array(\\\"0\\\",\\\"1\\\",\\\"2\\\",\\\"3\\\",\\\"4\\\",\\\"5\\\",\\\"6\\\",\\\"7\\\",\\\"8\\\",\\\"9\\\",\\\"A\\\",\\\"B\\\",\\\"C\\\",\\\"D\\\",\\\"E\\\",\\\"F\\\",\\\"G\\\",\\\"H\\\",\\\"I\\\",\\\"J\\\",\\\"K\\\",\\\"L\\\",\\\"M\\\",\\\"N\\\",\\\"O\\\",\\\"P\\\",\\\"Q\\\",\\\"R\\\",\\\"S\\\",\\\"T\\\",\\\"U\\\",\\\"V\\\",\\\"W\\\",\\\"X\\\",\\\"Y\\\",\\\"Z\\\",\\\" \\\",\\\"$\\\",\\\"%\\\",\\\"*\\\",\\\"+\\\",\\\"-\\\",\\\".\\\",\\\"/\\\",\\\":\\\");do{if(t>1){n=this.getNextBits(11);var s=Math.floor(n/45);var o=n%45;r+=i[s];r+=i[o];t-=2}else if(t==1){n=this.getNextBits(6);r+=i[n];t-=1}}while(t>0);return r};this.getFigureString=function(e){var t=e;var n=0;var r=\\\"\\\";do{if(t>=3){n=this.getNextBits(10);if(n<100)r+=\\\"0\\\";if(n<10)r+=\\\"0\\\";t-=3}else if(t==2){n=this.getNextBits(7);if(n<10)r+=\\\"0\\\";t-=2}else if(t==1){n=this.getNextBits(4);t-=1}r+=n}while(t>0);return r};this.get8bitByteArray=function(e){var t=e;var n=0;var r=new Array;do{n=this.getNextBits(8);r.push(n);t--}while(t>0);return r};this.getKanjiString=function(e){var t=e;var n=0;var r=\\\"\\\";do{n=getNextBits(13);var i=n%192;var s=n/192;var o=(s<<8)+i;var u=0;if(o+33088<=40956){u=o+33088}else{u=o+49472}r+=String.fromCharCode(u);t--}while(t>0);return r};this.__defineGetter__(\\\"DataByte\\\",function(){var e=new Array;var t=1;var n=2;var r=4;var i=8;do{var s=this.NextMode();if(s==0){if(e.length>0)break;else throw\\\"Empty data block\\\"}if(s!=t&&s!=n&&s!=r&&s!=i){throw\\\"Invalid mode: \\\"+s+\\\" in (block:\\\"+this.blockPointer+\\\" bit:\\\"+this.bitPointer+\\\")\\\"}dataLength=this.getDataLength(s);if(dataLength<1)throw\\\"Invalid data length: \\\"+dataLength;switch(s){case t:var o=this.getFigureString(dataLength);var u=new Array(o.length);for(var a=0;a= 10 && version <= 26)\\n\\t\\tthis.dataLengthMode = 1;\\n\\telse if (version >= 27 && version <= 40)\\n\\t\\tthis.dataLengthMode = 2;\\n\\t\\t\\n\\tthis.getNextBits = function( numBits)\\n\\t\\t{\\t\\t\\t\\n\\t\\t\\tvar bits = 0;\\n\\t\\t\\tif (numBits < this.bitPointer + 1)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// next word fits into current data block\\n\\t\\t\\t\\tvar mask = 0;\\n\\t\\t\\t\\tfor (var i = 0; i < numBits; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tmask += (1 << i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmask <<= (this.bitPointer - numBits + 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tbits = (this.blocks[this.blockPointer] & mask) >> (this.bitPointer - numBits + 1);\\n\\t\\t\\t\\tthis.bitPointer -= numBits;\\n\\t\\t\\t\\treturn bits;\\n\\t\\t\\t}\\n\\t\\t\\telse if (numBits < this.bitPointer + 1 + 8)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// next word crosses 2 data blocks\\n\\t\\t\\t\\tvar mask1 = 0;\\n\\t\\t\\t\\tfor (var i = 0; i < this.bitPointer + 1; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tmask1 += (1 << i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbits = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));\\n this.blockPointer++;\\n\\t\\t\\t\\tbits += ((this.blocks[this.blockPointer]) >> (8 - (numBits - (this.bitPointer + 1))));\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tthis.bitPointer = this.bitPointer - numBits % 8;\\n\\t\\t\\t\\tif (this.bitPointer < 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tthis.bitPointer = 8 + this.bitPointer;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn bits;\\n\\t\\t\\t}\\n\\t\\t\\telse if (numBits < this.bitPointer + 1 + 16)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// next word crosses 3 data blocks\\n\\t\\t\\t\\tvar mask1 = 0; // mask of first block\\n\\t\\t\\t\\tvar mask3 = 0; // mask of 3rd block\\n\\t\\t\\t\\t//bitPointer + 1 : number of bits of the 1st block\\n\\t\\t\\t\\t//8 : number of the 2nd block (note that use already 8bits because next word uses 3 data blocks)\\n\\t\\t\\t\\t//numBits - (bitPointer + 1 + 8) : number of bits of the 3rd block \\n\\t\\t\\t\\tfor (var i = 0; i < this.bitPointer + 1; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tmask1 += (1 << i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tvar bitsFirstBlock = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));\\n\\t\\t\\t\\tthis.blockPointer++;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tvar bitsSecondBlock = this.blocks[this.blockPointer] << (numBits - (this.bitPointer + 1 + 8));\\n\\t\\t\\t\\tthis.blockPointer++;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor (var i = 0; i < numBits - (this.bitPointer + 1 + 8); i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tmask3 += (1 << i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmask3 <<= 8 - (numBits - (this.bitPointer + 1 + 8));\\n\\t\\t\\t\\tvar bitsThirdBlock = (this.blocks[this.blockPointer] & mask3) >> (8 - (numBits - (this.bitPointer + 1 + 8)));\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tbits = bitsFirstBlock + bitsSecondBlock + bitsThirdBlock;\\n\\t\\t\\t\\tthis.bitPointer = this.bitPointer - (numBits - 8) % 8;\\n\\t\\t\\t\\tif (this.bitPointer < 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tthis.bitPointer = 8 + this.bitPointer;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn bits;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\tthis.NextMode=function()\\n\\t{\\n\\t\\tif ((this.blockPointer > this.blocks.length - this.numErrorCorrectionCode - 2))\\n\\t\\t\\treturn 0;\\n\\t\\telse\\n\\t\\t\\treturn this.getNextBits(4);\\n\\t}\\n\\tthis.getDataLength=function( modeIndicator)\\n\\t\\t{\\n\\t\\t\\tvar index = 0;\\n\\t\\t\\twhile (true)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif ((modeIndicator >> index) == 1)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tindex++;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\treturn this.getNextBits(qrcode.sizeOfDataLengthInfo[this.dataLengthMode][index]);\\n\\t\\t}\\n\\tthis.getRomanAndFigureString=function( dataLength)\\n\\t\\t{\\n\\t\\t\\tvar length = dataLength;\\n\\t\\t\\tvar intData = 0;\\n\\t\\t\\tvar strData = \\\"\\\";\\n\\t\\t\\tvar tableRomanAndFigure = new Array('0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', ' ', '$', '%', '*', '+', '-', '.', '/', ':');\\n\\t\\t\\tdo \\n\\t\\t\\t{\\n\\t\\t\\t\\tif (length > 1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tintData = this.getNextBits(11);\\n\\t\\t\\t\\t\\tvar firstLetter = Math.floor(intData / 45);\\n\\t\\t\\t\\t\\tvar secondLetter = intData % 45;\\n\\t\\t\\t\\t\\tstrData += tableRomanAndFigure[firstLetter];\\n\\t\\t\\t\\t\\tstrData += tableRomanAndFigure[secondLetter];\\n\\t\\t\\t\\t\\tlength -= 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (length == 1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tintData = this.getNextBits(6);\\n\\t\\t\\t\\t\\tstrData += tableRomanAndFigure[intData];\\n\\t\\t\\t\\t\\tlength -= 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\twhile (length > 0);\\n\\t\\t\\t\\n\\t\\t\\treturn strData;\\n\\t\\t}\\n\\tthis.getFigureString=function( dataLength)\\n\\t\\t{\\n\\t\\t\\tvar length = dataLength;\\n\\t\\t\\tvar intData = 0;\\n\\t\\t\\tvar strData = \\\"\\\";\\n\\t\\t\\tdo \\n\\t\\t\\t{\\n\\t\\t\\t\\tif (length >= 3)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tintData = this.getNextBits(10);\\n\\t\\t\\t\\t\\tif (intData < 100)\\n\\t\\t\\t\\t\\t\\tstrData += \\\"0\\\";\\n\\t\\t\\t\\t\\tif (intData < 10)\\n\\t\\t\\t\\t\\t\\tstrData += \\\"0\\\";\\n\\t\\t\\t\\t\\tlength -= 3;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (length == 2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tintData = this.getNextBits(7);\\n\\t\\t\\t\\t\\tif (intData < 10)\\n\\t\\t\\t\\t\\t\\tstrData += \\\"0\\\";\\n\\t\\t\\t\\t\\tlength -= 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (length == 1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tintData = this.getNextBits(4);\\n\\t\\t\\t\\t\\tlength -= 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstrData += intData;\\n\\t\\t\\t}\\n\\t\\t\\twhile (length > 0);\\n\\t\\t\\t\\n\\t\\t\\treturn strData;\\n\\t\\t}\\n\\tthis.get8bitByteArray=function( dataLength)\\n\\t\\t{\\n\\t\\t\\tvar length = dataLength;\\n\\t\\t\\tvar intData = 0;\\n\\t\\t\\tvar output = new Array();\\n\\t\\t\\t\\n\\t\\t\\tdo \\n\\t\\t\\t{\\n\\t\\t\\t\\tintData = this.getNextBits(8);\\n\\t\\t\\t\\toutput.push( intData);\\n\\t\\t\\t\\tlength--;\\n\\t\\t\\t}\\n\\t\\t\\twhile (length > 0);\\n\\t\\t\\treturn output;\\n\\t\\t}\\n this.getKanjiString=function( dataLength)\\n\\t\\t{\\n\\t\\t\\tvar length = dataLength;\\n\\t\\t\\tvar intData = 0;\\n\\t\\t\\tvar unicodeString = \\\"\\\";\\n\\t\\t\\tdo \\n\\t\\t\\t{\\n\\t\\t\\t\\tintData = this.getNextBits(13);\\n\\t\\t\\t\\tvar lowerByte = intData % 0xC0;\\n\\t\\t\\t\\tvar higherByte = intData / 0xC0;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tvar tempWord = (higherByte << 8) + lowerByte;\\n\\t\\t\\t\\tvar shiftjisWord = 0;\\n\\t\\t\\t\\tif (tempWord + 0x8140 <= 0x9FFC)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// between 8140 - 9FFC on Shift_JIS character set\\n\\t\\t\\t\\t\\tshiftjisWord = tempWord + 0x8140;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// between E040 - EBBF on Shift_JIS character set\\n\\t\\t\\t\\t\\tshiftjisWord = tempWord + 0xC140;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//var tempByte = new Array(0,0);\\n\\t\\t\\t\\t//tempByte[0] = (sbyte) (shiftjisWord >> 8);\\n\\t\\t\\t\\t//tempByte[1] = (sbyte) (shiftjisWord & 0xFF);\\n\\t\\t\\t\\t//unicodeString += new String(SystemUtils.ToCharArray(SystemUtils.ToByteArray(tempByte)));\\n unicodeString += String.fromCharCode(shiftjisWord);\\n\\t\\t\\t\\tlength--;\\n\\t\\t\\t}\\n\\t\\t\\twhile (length > 0);\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\treturn unicodeString;\\n\\t\\t}\\n\\n\\tthis.parseECIValue = function ()\\n\\t{\\n\\t\\tvar intData = 0;\\n\\t\\tvar firstByte = this.getNextBits(8);\\n\\t\\tif ((firstByte & 0x80) == 0) {\\n\\t\\t\\tintData = firstByte & 0x7F;\\n\\t\\t}\\n\\t\\tif ((firstByte & 0xC0) == 0x80) {\\n\\t\\t\\t// two bytes\\n\\t\\t\\tvar secondByte = this.getNextBits(8);\\n\\t\\t\\tintData = ((firstByte & 0x3F) << 8) | secondByte;\\n\\t\\t}\\n\\t\\tif ((firstByte & 0xE0) == 0xC0) {\\n\\t\\t\\t// three bytes\\n\\t\\t\\tvar secondThirdBytes = this.getNextBits(8);;\\n\\t\\t\\tintData = ((firstByte & 0x1F) << 16) | secondThirdBytes;\\n\\t\\t}\\n\\t\\treturn intData;\\n\\t}\\n\\n\\tthis.__defineGetter__(\\\"DataByte\\\", function()\\n\\t{\\n\\t\\tvar output = new Array();\\n\\t\\tvar MODE_NUMBER = 1;\\n\\t var MODE_ROMAN_AND_NUMBER = 2;\\n\\t var MODE_8BIT_BYTE = 4;\\n\\t\\tvar MODE_ECI = 7;\\n\\t var MODE_KANJI = 8;\\n\\t\\tdo \\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tvar mode = this.NextMode();\\n\\t\\t\\t\\t\\t\\t//canvas.println(\\\"mode: \\\" + mode);\\n\\t\\t\\t\\t\\t\\tif (mode == 0)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif (output.length > 0)\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t\\tthrow \\\"Empty data block\\\";\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (mode != MODE_NUMBER && mode != MODE_ROMAN_AND_NUMBER && mode != MODE_8BIT_BYTE && mode != MODE_KANJI && mode != MODE_ECI)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tthrow \\\"Invalid mode: \\\" + mode + \\\" in (block:\\\" + this.blockPointer + \\\" bit:\\\" + this.bitPointer + \\\")\\\";\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(mode == MODE_ECI)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tvar temp_sbyteArray3 = this.parseECIValue();\\n\\t\\t\\t\\t\\t\\t\\t//output.push(temp_sbyteArray3);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\t\\tvar dataLength = this.getDataLength(mode);\\n\\t\\t\\t\\t\\t\\t\\tif (dataLength < 1)\\n\\t\\t\\t\\t\\t\\t\\t\\tthrow \\\"Invalid data length: \\\" + dataLength;\\n\\t\\t\\t\\t\\t\\t\\tswitch (mode)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\tcase MODE_NUMBER: \\n\\t\\t\\t\\t\\t\\t\\t\\t\\tvar temp_str = this.getFigureString(dataLength);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tvar ta = new Array(temp_str.length);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfor(var j=0;j>>12];\\n var quality = this.qualityName[(tR&0x0f00)>>>8];\\n var inv = this.inversionName[(tR&0x00f0)>>>4];\\n var string = root;\\n if( quality!= \\\"M\\\")\\n string+=quality;\\n if(inv != \\\"r\\\")\\n string+= \\\" \\\"+inv;\\n return string;\\n }\",\n \"decideVersion(){\\n var length = messageString.length;\\n for(var i = 0; i < 40; i++){\\n if(character_capacities[i] >= length){\\n qrVersion = i + 1;\\n break;\\n }\\n }\\n }\",\n \"function decode(data) {\\n var current = data.data;\\n for (var i = data.encoding.length - 1; i >= 0; i--) {\\n current = Decoder.decodeStep(current, data.encoding[i]);\\n }\\n return current;\\n }\",\n \"function Decoder(bytes, port) {\\n // Decode an uplink message from a buffer\\n // (array) of bytes to an object of fields.\\n var decoded = {};\\n\\n if (! (port === 3))\\n return null;\\n\\n // see catena-message-port3-format.md\\n // i is used as the index into the message. Start with the flag byte.\\n // note that there's no discriminator.\\n // test vectors are also available there.\\n var i = 0;\\n // fetch the bitmap.\\n var flags = bytes[i++];\\n\\n if (flags & 0x1) {\\n // set Vraw to a uint16, and increment pointer\\n var Vraw = (bytes[i] << 8) + bytes[i + 1];\\n i += 2;\\n // interpret uint16 as an int16 instead.\\n if (Vraw & 0x8000)\\n Vraw += -0x10000;\\n // scale and save in result.\\n decoded.Vbat = Vraw / 4096.0;\\n }\\n\\n if (flags & 0x2) {\\n var Vraw = (bytes[i] << 8) + bytes[i + 1];\\n i += 2;\\n if (Vraw & 0x8000)\\n Vraw += -0x10000;\\n decoded.VDD = Vraw / 4096.0;\\n }\\n\\n if (flags & 0x4) {\\n var iBoot = bytes[i];\\n i += 1;\\n decoded.boot = iBoot;\\n }\\n\\n if (flags & 0x8) {\\n // we have temp, pressure, RH\\n var tRaw = (bytes[i] << 8) + bytes[i + 1];\\n if (tRaw & 0x8000)\\n tRaw = -0x10000 + tRaw;\\n i += 2;\\n var rhRaw = (bytes[i] << 8) + bytes[i + 1];\\n i += 2;\\n\\n decoded.t = tRaw / 256;\\n decoded.rh = rhRaw / 65535.0 * 100;\\n decoded.tDew = dewpoint(decoded.t, decoded.rh);\\n decoded.tHeatIndexC = CalculateHeatIndexCelsius(decoded.t, decoded.rh);\\n }\\n\\n if (flags & 0x10) {\\n // we have light irradiance info\\n var irradiance = {};\\n decoded.irradiance = irradiance;\\n\\n var lightRaw = (bytes[i] << 8) + bytes[i + 1];\\n i += 2;\\n irradiance.IR = lightRaw;\\n\\n lightRaw = (bytes[i] << 8) + bytes[i + 1];\\n i += 2;\\n irradiance.White = lightRaw;\\n\\n lightRaw = (bytes[i] << 8) + bytes[i + 1];\\n i += 2;\\n irradiance.UV = lightRaw;\\n }\\n\\n if (flags & 0x20) {\\n var Vraw = (bytes[i] << 8) + bytes[i + 1];\\n i += 2;\\n if (Vraw & 0x8000)\\n Vraw += -0x10000;\\n decoded.Vbus = Vraw / 4096.0;\\n }\\n\\n // at this point, decoded has the real values.\\n return decoded;\\n}\",\n \"function _decodePkcs7Data(data) {\\n // handle special case of \\\"chunked\\\" data content: an octet string composed\\n // of other octet strings\\n if(data.composed || data.constructed) {\\n var value = forge.util.createBuffer();\\n for(var i = 0; i < data.value.length; ++i) {\\n value.putBytes(data.value[i].value);\\n }\\n data.composed = data.constructed = false;\\n data.value = value.getBytes();\\n }\\n return data;\\n}\",\n \"function _decodePkcs7Data(data) {\\n // handle special case of \\\"chunked\\\" data content: an octet string composed\\n // of other octet strings\\n if(data.composed || data.constructed) {\\n var value = forge.util.createBuffer();\\n for(var i = 0; i < data.value.length; ++i) {\\n value.putBytes(data.value[i].value);\\n }\\n data.composed = data.constructed = false;\\n data.value = value.getBytes();\\n }\\n return data;\\n}\",\n \"function _decodePkcs7Data(data) {\\n // handle special case of \\\"chunked\\\" data content: an octet string composed\\n // of other octet strings\\n if(data.composed || data.constructed) {\\n var value = forge.util.createBuffer();\\n for(var i = 0; i < data.value.length; ++i) {\\n value.putBytes(data.value[i].value);\\n }\\n data.composed = data.constructed = false;\\n data.value = value.getBytes();\\n }\\n return data;\\n}\",\n \"function _decodePkcs7Data(data) {\\n // handle special case of \\\"chunked\\\" data content: an octet string composed\\n // of other octet strings\\n if(data.composed || data.constructed) {\\n var value = forge.util.createBuffer();\\n for(var i = 0; i < data.value.length; ++i) {\\n value.putBytes(data.value[i].value);\\n }\\n data.composed = data.constructed = false;\\n data.value = value.getBytes();\\n }\\n return data;\\n}\",\n \"function _decodePkcs7Data(data) {\\n // handle special case of \\\"chunked\\\" data content: an octet string composed\\n // of other octet strings\\n if(data.composed || data.constructed) {\\n var value = forge.util.createBuffer();\\n for(var i = 0; i < data.value.length; ++i) {\\n value.putBytes(data.value[i].value);\\n }\\n data.composed = data.constructed = false;\\n data.value = value.getBytes();\\n }\\n return data;\\n}\",\n \"function _decodePkcs7Data(data) {\\n // handle special case of \\\"chunked\\\" data content: an octet string composed\\n // of other octet strings\\n if(data.composed || data.constructed) {\\n var value = forge.util.createBuffer();\\n for(var i = 0; i < data.value.length; ++i) {\\n value.putBytes(data.value[i].value);\\n }\\n data.composed = data.constructed = false;\\n data.value = value.getBytes();\\n }\\n return data;\\n}\",\n \"function handleError(data) {\\n console.log(uint8arrayToString(data));\\n}\",\n \"function Bus_Phase(decoder_items) // 65001-65006\\n{\\n var str = \\\"\\\";\\n switch (data_nb)\\n {\\n case 0 :\\n {\\n start_item = decoder_items.start_sample_index;\\n multi_byte_value = hex_value;\\n skip_item = true;\\n break;\\n }\\n case 1 :\\n {\\n multi_byte_value += (hex_value<<8);\\n ScanaStudio.dec_item_new(decoder_items.channel_index,start_item, decoder_items.end_sample_index);\\n ScanaStudio.dec_item_add_content(\\\"Line-Line AC RMS Voltage : \\\" + (multi_byte_value.toString().replace(/(\\\\d)(?=(\\\\d{3})+\\\\b)/g,'$1 ')) + \\\" V\\\");\\n ScanaStudio.dec_item_add_content((multi_byte_value.toString().replace(/(\\\\d)(?=(\\\\d{3})+\\\\b)/g,'$1 ')) + \\\" V\\\");\\n ScanaStudio.dec_item_end();\\n // Packet View\\n ScanaStudio.packet_view_add_packet(false,\\n decoder_items.channel_index,\\n start_item,\\n decoder_items.end_sample_index,\\n \\\"Data\\\",\\n (\\\"Line-Line Voltage : \\\" + (multi_byte_value.toString().replace(/(\\\\d)(?=(\\\\d{3})+\\\\b)/g,'$1 ')) + \\\" V\\\"),\\n ScanaStudio.PacketColors.Data.Title,\\n ScanaStudio.PacketColors.Data.Content);\\n skip_item = true;\\n break;\\n }\\n case 2 :\\n {\\n start_item = decoder_items.start_sample_index;\\n multi_byte_value = hex_value;\\n skip_item = true;\\n break;\\n }\\n case 3 :\\n {\\n multi_byte_value += (hex_value<<8);\\n ScanaStudio.dec_item_new(decoder_items.channel_index,start_item, decoder_items.end_sample_index);\\n ScanaStudio.dec_item_add_content(\\\"Line-Neutral AC RMS Voltage : \\\" + (multi_byte_value.toString().replace(/(\\\\d)(?=(\\\\d{3})+\\\\b)/g,'$1 ')) + \\\" V\\\");\\n ScanaStudio.dec_item_add_content((multi_byte_value.toString().replace(/(\\\\d)(?=(\\\\d{3})+\\\\b)/g,'$1 ')) + \\\" V\\\");\\n ScanaStudio.dec_item_end();\\n // Packet View\\n ScanaStudio.packet_view_add_packet(false,\\n decoder_items.channel_index,\\n start_item,\\n decoder_items.end_sample_index,\\n \\\"Data\\\",\\n (\\\"Line-Neutral Voltage : \\\" + (multi_byte_value.toString().replace(/(\\\\d)(?=(\\\\d{3})+\\\\b)/g,'$1 ')) + \\\" V\\\"),\\n ScanaStudio.PacketColors.Data.Title,\\n ScanaStudio.PacketColors.Data.Content);\\n skip_item = true;\\n break;\\n }\\n case 4 :\\n {\\n start_item = decoder_items.start_sample_index;\\n multi_byte_value = hex_value;\\n skip_item = true;\\n break;\\n }\\n case 5 :\\n {\\n multi_byte_value += (hex_value<<8);\\n multi_byte_value = Math.floor(multi_byte_value/128);\\n ScanaStudio.dec_item_new(decoder_items.channel_index,start_item, decoder_items.end_sample_index);\\n ScanaStudio.dec_item_add_content(\\\"AC Frequency : \\\" + multi_byte_value + \\\"Hz\\\");\\n ScanaStudio.dec_item_add_content(multi_byte_value + \\\" kWh\\\");\\n ScanaStudio.dec_item_end();\\n // Packet View\\n ScanaStudio.packet_view_add_packet(false,\\n decoder_items.channel_index,\\n start_item,\\n decoder_items.end_sample_index,\\n \\\"Data\\\",\\n (\\\"AC Frequency : \\\" + multi_byte_value + \\\"Hz\\\"),\\n ScanaStudio.PacketColors.Data.Title,\\n ScanaStudio.PacketColors.Data.Content);\\n skip_item = true;\\n break;\\n }\\n default :\\n {\\n packet_title = \\\"Filled Data\\\";\\n if (hex_value == 255)\\n {\\n item_content = \\\"Filled with 0xFF\\\";\\n }\\n else\\n {\\n item_content = \\\"0x\\\" + pad(hex_value.toString(16),2) + \\\", should be 0xFF\\\";\\n types_title = ScanaStudio.PacketColors.Error.Title;\\n types_content = ScanaStudio.PacketColors.Error.Content;\\n }\\n break;\\n }\\n }//end switch (data_nb)\\n}//end function Bus_Phase_C\",\n \"function QrCode(\\n // The version number of this QR Code, which is between 1 and 40 (inclusive).\\n // This determines the size of this barcode.\\n version,\\n // The error correction level used in this QR Code.\\n errorCorrectionLevel, dataCodewords, msk) {\\n (0,_babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(this, QrCode);\\n this.version = version;\\n this.errorCorrectionLevel = errorCorrectionLevel;\\n // The modules of this QR Code (false = light, true = dark).\\n // Immutable after constructor finishes. Accessed through getModule().\\n this.modules = [];\\n // Indicates function modules that are not subjected to masking. Discarded when constructor finishes.\\n this.isFunction = [];\\n // Check scalar arguments\\n if (version < QrCode.MIN_VERSION || version > QrCode.MAX_VERSION) throw new RangeError('Version value out of range');\\n if (msk < -1 || msk > 7) throw new RangeError('Mask value out of range');\\n this.size = version * 4 + 17;\\n // Initialize both grids to be size*size arrays of Boolean false\\n var row = [];\\n for (var i = 0; i < this.size; i++) row.push(false);\\n for (var _i = 0; _i < this.size; _i++) {\\n this.modules.push(row.slice()); // Initially all light\\n this.isFunction.push(row.slice());\\n }\\n // Compute ECC, draw modules\\n this.drawFunctionPatterns();\\n var allCodewords = this.addEccAndInterleave(dataCodewords);\\n this.drawCodewords(allCodewords);\\n // Do masking\\n if (msk == -1) {\\n // Automatically choose best mask\\n var minPenalty = 1000000000;\\n for (var _i2 = 0; _i2 < 8; _i2++) {\\n this.applyMask(_i2);\\n this.drawFormatBits(_i2);\\n var penalty = this.getPenaltyScore();\\n if (penalty < minPenalty) {\\n msk = _i2;\\n minPenalty = penalty;\\n }\\n this.applyMask(_i2); // Undoes the mask due to XOR\\n }\\n }\\n\\n assert(0 <= msk && msk <= 7);\\n this.mask = msk;\\n this.applyMask(msk); // Apply the final choice of mask\\n this.drawFormatBits(msk); // Overwrite old format bits\\n this.isFunction = [];\\n }\",\n \"function decode()\\n{\\n\\tvar uartData;\\n\\tvar uartDataCnt = 0;\\n\\n\\tif (!check_scanastudio_support())\\n {\\n add_to_err_log(\\\"Please update your ScanaStudio software to the latest version to use this decoder\\\");\\n return;\\n }\\n\\n\\tPKT_COLOR_DATA = get_ch_light_color(ch);\\n\\tPKT_COLOR_GENER_TITLE = dark_colors.gray;\\n\\tPKT_COLOR_GPGGA_TITLE = dark_colors.blue;\\n\\tPKT_COLOR_GPGSA_TITLE = dark_colors.orange;\\n\\tPKT_COLOR_GPGSV_TITLE = dark_colors.green;\\n\\tPKT_COLOR_GPRMC_TITLE = dark_colors.violet;\\n\\n\\tget_ui_vals();\\n\\t\\n\\tvar decBuf = pre_decode(\\\"uart.js\\\", \\\"ch = \\\" + ch + \\\";\\\"\\n + \\\"baud = \\\" + baud + \\\";\\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"nbits = \\\" + 3 + \\\";\\\"\\t\\t// 8-bit word\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"parity = \\\" + 0 + \\\";\\\"\\t\\t// no parity\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"stop = \\\" + 0 + \\\";\\\" // 1 stop\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"order = \\\" + 0 + \\\";\\\" // LSB first\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"invert = \\\" + 0);\\t\\t\\t// non inverted\\n\\n\\twhile (decBuf.length > uartDataCnt)\\n\\t{\\n\\t\\tuartData = decBuf[uartDataCnt];\\n\\t\\tuartDataCnt++;\\n\\n\\t\\tif (uartData.data.length > 0)\\n\\t\\t{\\n\\t\\t\\tif (String.fromCharCode(uartData.data) == \\\"$\\\")\\n\\t\\t\\t{\\n\\t\\t\\t\\tvar msg = String.fromCharCode(uartData.data);\\n\\t\\t\\t\\tvar stOfMsg = uartData.start_s, endOfMsg;\\n\\n\\t\\t\\t\\twhile ((String.fromCharCode(uartData.data) != \\\"\\\\r\\\") && (decBuf.length > uartDataCnt))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tuartData = decBuf[uartDataCnt];\\n\\t\\t\\t\\t\\tuartDataCnt++;\\n\\n\\t\\t\\t\\t\\tendOfMsg = uartData.end_s;\\n\\n\\t\\t\\t\\t\\tif (uartData.data.length > 0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, uartData.data);\\n\\t\\t\\t\\t\\t\\tmsg += String.fromCharCode(uartData.data);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tvar outMsgArr = msg.split(\\\",\\\");\\n\\t\\t\\t\\tvar msgId = outMsgArr.shift();\\n\\t\\t\\t\\tmsgId = msgId.slice(1);\\n\\n\\t\\t\\t\\tdec_item_new(ch, stOfMsg , endOfMsg);\\n\\t\\t\\t\\tdec_item_add_pre_text(msg);\\n\\t\\t\\t\\tdec_item_add_pre_text(msgId);\\n\\n\\t\\t\\t\\tpkt_start(\\\"NMEA 0183\\\");\\n\\n\\t\\t\\t\\tif (msgId == \\\"GPGGA\\\")\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tpkt_add_item(-1, -1, msgId, \\\"\\\", PKT_COLOR_GPGGA_TITLE, PKT_COLOR_DATA);\\n\\t\\t\\t\\t\\tpkt_start(msgId);\\n\\n\\t\\t\\t\\t\\tvar utc = outMsgArr.shift();\\n\\n\\t\\t\\t\\t\\tif (utc.length > 0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tutc = utc.slice(0, 2) + \\\":\\\" + utc.slice(2, 4) + \\\":\\\" + utc.slice(4, 6) + \\\".\\\" + utc.slice(7, 10);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tadd_pkt_data(utc, \\\"\\\", \\\"UTC TIME\\\", PKT_COLOR_GPGGA_TITLE);\\n\\n\\t\\t\\t\\t\\tvar latitude = outMsgArr.shift();\\n\\t\\t\\t\\t\\tvar ns = outMsgArr.shift();\\n\\n\\t\\t\\t\\t\\tif (latitude.length > 0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tlatitude = latitude.slice(0, 2) + \\\"°\\\" + latitude.slice(2, 4) + \\\"'\\\" + latitude.slice(5, 9) + '\\\"';\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tadd_pkt_data(latitude, ns, \\\"LATITUDE\\\", PKT_COLOR_GPGGA_TITLE);\\n\\n\\t\\t\\t\\t\\tvar longitude = outMsgArr.shift();\\n\\t\\t\\t\\t\\tvar ew = outMsgArr.shift();\\n\\n\\t\\t\\t\\t\\tif (longitude.length > 0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tlongitude = longitude.slice(0, 2) + \\\"°\\\" + longitude.slice(2, 4) + \\\"'\\\" + longitude.slice(5, 9) + '\\\"';\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tadd_pkt_data(longitude, ew, \\\"LONGITUDE\\\", PKT_COLOR_GPGGA_TITLE);\\n\\n\\t\\t\\t\\t\\tvar posFix = outMsgArr.shift();\\n\\t\\t\\t\\t\\tvar posFixStr;\\n\\n\\t\\t\\t\\t\\tswitch (posFix)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tcase \\\"0\\\": posFixStr = \\\"Fix not available or invalid\\\"; break;\\n\\t\\t\\t\\t\\t\\tcase \\\"1\\\": posFixStr = \\\"SPS Mode\\\"; break;\\n\\t\\t\\t\\t\\t\\tcase \\\"2\\\": posFixStr = \\\"Diff SPS Mode\\\"; break;\\n\\t\\t\\t\\t\\t\\tcase \\\"3\\\": posFixStr = \\\"PPS Mode\\\"; break;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tadd_pkt_data(posFixStr, \\\"\\\", \\\"POS FIX IND\\\", PKT_COLOR_GPGGA_TITLE);\\n\\n\\t\\t\\t\\t\\tvar satNum = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(satNum, \\\"\\\", \\\"TOTAL SAT\\\", PKT_COLOR_GPGGA_TITLE);\\n\\n\\t\\t\\t\\t\\tvar hdop = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(satNum, \\\"\\\", \\\"HDOP\\\", PKT_COLOR_GPGGA_TITLE);\\n\\n\\t\\t\\t\\t\\tvar altitude = outMsgArr.shift();\\n\\t\\t\\t\\t\\tvar units = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(altitude, (\\\" \\\" + units), \\\"ALTITUDE\\\", PKT_COLOR_GPGGA_TITLE);\\n\\n\\t\\t\\t\\t\\tvar geoid = outMsgArr.shift();\\n\\t\\t\\t\\t\\tunits = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(geoid, (\\\" \\\" + units), \\\"GEOID SEP\\\", PKT_COLOR_GPGGA_TITLE);\\n\\n\\t\\t\\t\\t\\tvar ageDiff = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(ageDiff, \\\"\\\", \\\"AGE DIFF\\\", PKT_COLOR_GPGGA_TITLE);\\n\\n\\t\\t\\t\\t\\tvar checksum = verify_checksum(msg);\\n\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"CHECKSUM\\\", checksum, PKT_COLOR_GPGGA_TITLE, PKT_COLOR_DATA);\\n\\n\\t\\t\\t\\t\\tpkt_end();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (msgId == \\\"GPGSV\\\")\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tpkt_add_item(-1, -1, msgId, \\\"\\\", PKT_COLOR_GPGSV_TITLE, PKT_COLOR_DATA);\\n\\t\\t\\t\\t\\tpkt_start(msgId);\\n\\n\\t\\t\\t\\t\\tvar numMsg = outMsgArr.shift();\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tadd_pkt_data(numMsg, \\\"\\\", \\\"TOTAL MSG\\\", PKT_COLOR_GPGSV_TITLE);\\n\\n\\t\\t\\t\\t\\tvar msgNum = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(msgNum, \\\"\\\", \\\"MSG NUM\\\", PKT_COLOR_GPGSV_TITLE);\\n\\n\\t\\t\\t\\t\\tvar satNum = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(satNum, \\\"\\\", \\\"TOTAL SAT\\\", PKT_COLOR_GPGSV_TITLE);\\n\\n\\t\\t\\t\\t\\tdo\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tvar satId = outMsgArr.shift();\\n\\t\\t\\t\\t\\t\\tadd_pkt_data(satId, \\\"\\\", \\\"SAT ID\\\", PKT_COLOR_GPGSV_TITLE);\\n\\t\\t\\t\\t\\t\\tif (outMsgArr[0] == \\\"*\\\") break;\\n\\n\\t\\t\\t\\t\\t\\tvar elevation = outMsgArr.shift();\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tadd_pkt_data(elevation, \\\" deg\\\", \\\"ELEVATION\\\", PKT_COLOR_GPGSV_TITLE);\\n\\t\\t\\t\\t\\t\\tif (outMsgArr[0] == \\\"*\\\") break;\\n\\n\\t\\t\\t\\t\\t\\tvar azimuth = outMsgArr.shift();\\n\\t\\t\\t\\t\\t\\tadd_pkt_data(azimuth, \\\" deg\\\", \\\"AZIMUTH\\\", PKT_COLOR_GPGSV_TITLE);\\n\\t\\t\\t\\t\\t\\tif (outMsgArr[0] == \\\"*\\\") break;\\n\\n\\t\\t\\t\\t\\t\\tvar snr = outMsgArr.shift();\\n\\t\\t\\t\\t\\t\\tadd_pkt_data(azimuth, \\\" dB\\\", \\\"SNR\\\", PKT_COLOR_GPGSV_TITLE);\\n\\t\\t\\t\\t\\t\\tif (outMsgArr[0] == \\\"*\\\") break;\\n\\n\\t\\t\\t\\t\\t} while (outMsgArr.length > 0);\\n\\n\\t\\t\\t\\t\\tvar checksum = verify_checksum(msg);\\n\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"CHECKSUM\\\", checksum, PKT_COLOR_GPGSV_TITLE, PKT_COLOR_DATA);\\n\\n\\t\\t\\t\\t\\tpkt_end();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (msgId == \\\"GPRMC\\\")\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tpkt_add_item(-1, -1, msgId, \\\"\\\", PKT_COLOR_GPRMC_TITLE, PKT_COLOR_DATA);\\n\\t\\t\\t\\t\\tpkt_start(msgId);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar utc = outMsgArr.shift();\\n\\n\\t\\t\\t\\t\\tif (utc.length > 0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tutc = utc.slice(0, 2) + \\\":\\\" + utc.slice(2, 4) + \\\":\\\" + utc.slice(4, 6) + \\\".\\\" + utc.slice(7, 10);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tadd_pkt_data(utc, \\\"\\\", \\\"UTC TIME\\\", PKT_COLOR_GPRMC_TITLE);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar stat = outMsgArr.shift();\\n\\n\\t\\t\\t\\t\\tif (stat.length > 0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif (stat == \\\"A\\\") \\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tstat = \\\"data valid\\\";\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (stat == \\\"V\\\")\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tstat = \\\"data not valid\\\";\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tstat = \\\"invalid arg\\\";\\n\\t\\t\\t\\t\\t\\t}\\t\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tadd_pkt_data(stat, \\\"\\\", \\\"STATUS\\\", PKT_COLOR_GPRMC_TITLE);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar latitude = outMsgArr.shift();\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar ns = outMsgArr.shift();\\n\\n\\t\\t\\t\\t\\tif (latitude.length > 0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tlatitude = latitude.slice(0, 2) + \\\"°\\\" + latitude.slice(2, 4) + \\\"'\\\" + latitude.slice(5, 9) + '\\\"';\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tadd_pkt_data(latitude, ns, \\\"LATITUDE\\\", PKT_COLOR_GPRMC_TITLE);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar longitude = outMsgArr.shift();\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar ew = outMsgArr.shift();\\n\\n\\t\\t\\t\\t\\tif (longitude.length > 0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tlongitude = longitude.slice(0, 2) + \\\"°\\\" + longitude.slice(2, 4) + \\\"'\\\" + longitude.slice(5, 9) + '\\\"';\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tadd_pkt_data(longitude, ew, \\\"LONGITUDE\\\", PKT_COLOR_GPRMC_TITLE);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar speed = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(speed, \\\" knots\\\", \\\"SPEED\\\", PKT_COLOR_GPRMC_TITLE);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar course = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(course, \\\" deg\\\", \\\"COURSE\\\", PKT_COLOR_GPRMC_TITLE);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar date = outMsgArr.shift();\\n\\n\\t\\t\\t\\t\\tif (date.length > 0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tdate = date.slice(0, 2) + \\\"/\\\" + date.slice(2, 4) + \\\"/\\\" + date.slice(4, 6);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tadd_pkt_data(date, \\\"\\\", \\\"DATE\\\", PKT_COLOR_GPRMC_TITLE);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar magVar = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(magVar, \\\" deg\\\", \\\"MAGN VAR\\\", PKT_COLOR_GPRMC_TITLE);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar ewInd = outMsgArr.shift();\\n\\t\\t\\t\\t\\tadd_pkt_data(ewInd, \\\"\\\", \\\"E/W IND\\\", PKT_COLOR_GPRMC_TITLE);\\n\\n\\t\\t\\t\\t\\tif (isEmpty(outMsgArr)) break;\\n\\t\\t\\t\\t\\tvar checksum = verify_checksum(msg);\\n\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"CHECKSUM\\\", checksum, PKT_COLOR_GPRMC_TITLE, PKT_COLOR_DATA);\\n\\n\\t\\t\\t\\t\\tpkt_end();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tpkt_end();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"function decodeBuffer(arrBuff) {\\n\\t\\tlet u8arr = new Uint8Array(arrBuff);\\n\\t\\t\\n\\t\\tfunction byteToStr(byte) {\\n\\t\\t\\tlet str = byte.toString(2);\\n\\t\\t\\twhile (str.length < 8) {\\n\\t\\t\\t\\tstr = \\\"0\\\" + str;\\n\\t\\t\\t}\\n\\t\\t\\treturn str;\\n\\t\\t}\\n\\t\\t\\n\\t\\tlet headerLength = 4;\\n\\t\\tlet treeBytes = \\\"\\\";\\n\\t\\t\\n\\t\\tfor (var i = 0; i < headerLength; i++) {\\n\\t\\t\\ttreeBytes += byteToStr(u8arr[i]);\\n\\t\\t}\\n\\t\\ttreeBytes = Number(\\\"0b\\\" + treeBytes);\\n\\t\\t\\n\\t\\tlet arrOff = headerLength;\\n\\t\\tlet treeArr = new Uint8Array(treeBytes);\\n\\t\\t\\n\\t\\tfor (var i = 0; i < treeBytes; i++) {\\n\\t\\t\\ttreeArr[i] = u8arr[i + arrOff];\\n\\t\\t}\\n\\t\\t\\n\\t\\tlet tree = decodeTree(treeArr);\\n\\t\\t\\n\\t\\tarrOff = headerLength + treeBytes;\\n\\t\\tlet bitOff = u8arr[arrOff]\\n\\t\\tarrOff++;\\n\\t\\t\\n\\t\\tlet codes = Object.create(null);\\n\\t\\ttraverseTree(tree, function(tree, char, i, path) {\\n\\t\\t\\tcodes[path] = char;\\n\\t\\t});\\n\\t\\t\\n\\t\\tlet path = \\\"\\\";\\n\\t\\tlet body = \\\"\\\";\\n\\t\\tfor (var i = arrOff; i < u8arr.length; i++) {\\n\\t\\t\\tlet str = byteToStr(u8arr[i]);\\n\\t\\t\\tlet end = 8;\\n\\t\\t\\tif (i === u8arr.length - 1) {\\n\\t\\t\\t\\tend -= (8 - bitOff);\\n\\t\\t\\t\\t//console.log(end);\\n\\t\\t\\t}\\n\\t\\t\\tfor (var j = 0; j < end; j++) {\\n\\t\\t\\t\\tpath += str[j];\\n\\t\\t\\t\\tif (codes[path]) {\\n\\t\\t\\t\\t\\tbody += codes[path];\\n\\t\\t\\t\\t\\tpath = \\\"\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn body;\\n\\t}\",\n \"decode(buf) {\\n function isHex(hex) {\\n if ((hex >= 48 && hex <= 57) || (hex >= 65 && hex <= 70) || (hex >= 97 && hex <= 102)) {\\n return true;\\n }\\n return false;\\n }\\n function getx(i, len, bufArg) {\\n const ret = { char: null, nexti: i + 2, error: true };\\n if (i + 1 < len) {\\n if (isHex(bufArg[i]) && isHex(bufArg[i + 1])) {\\n const str = String.fromCodePoint(bufArg[i], bufArg[i + 1]);\\n ret.char = parseInt(str, 16);\\n if (!Number.isNaN(ret.char)) {\\n ret.error = false;\\n }\\n }\\n }\\n return ret;\\n }\\n function getu(i, len, bufArg) {\\n const ret = { char: null, nexti: i + 4, error: true };\\n if (i + 3 < len) {\\n if (isHex(bufArg[i]) && isHex(bufArg[i + 1]) && isHex(bufArg[i + 2]) && isHex(bufArg[i + 3])) {\\n const str = String.fromCodePoint(bufArg[i], bufArg[i + 1], bufArg[i + 2], bufArg[i + 3]);\\n ret.char = parseInt(str, 16);\\n if (!Number.isNaN(ret.char)) {\\n ret.error = false;\\n }\\n }\\n }\\n return ret;\\n }\\n function getU(i, len, bufArg) {\\n const ret = { char: null, nexti: i + 4, error: true };\\n let str = '';\\n while (i < len && isHex(bufArg[i])) {\\n str += String.fromCodePoint(bufArg[i]);\\n // eslint-disable-next-line no-param-reassign\\n i += 1;\\n }\\n ret.char = parseInt(str, 16);\\n if (bufArg[i] === 125 && !Number.isNaN(ret.char)) {\\n ret.error = false;\\n }\\n ret.nexti = i + 1;\\n return ret;\\n }\\n const chars = [];\\n const len = buf.length;\\n let i1;\\n let ret;\\n let error;\\n let i = 0;\\n while (i < len) {\\n const TRUE = true;\\n while (TRUE) {\\n error = true;\\n if (buf[i] !== 96) {\\n /* unescaped character */\\n chars.push(buf[i]);\\n i += 1;\\n error = false;\\n break;\\n }\\n i1 = i + 1;\\n if (i1 >= len) {\\n break;\\n }\\n if (buf[i1] === 96) {\\n /* escaped grave accent */\\n chars.push(96);\\n i += 2;\\n error = false;\\n break;\\n }\\n if (buf[i1] === 120) {\\n ret = getx(i1 + 1, len, buf);\\n if (ret.error) {\\n break;\\n }\\n /* escaped hex */\\n chars.push(ret.char);\\n i = ret.nexti;\\n error = false;\\n break;\\n }\\n if (buf[i1] === 117) {\\n if (buf[i1 + 1] === 123) {\\n ret = getU(i1 + 2, len, buf);\\n if (ret.error) {\\n break;\\n }\\n /* escaped utf-32 */\\n chars.push(ret.char);\\n i = ret.nexti;\\n error = false;\\n break;\\n }\\n ret = getu(i1 + 1, len, buf);\\n if (ret.error) {\\n break;\\n }\\n /* escaped utf-16 */\\n chars.push(ret.char);\\n i = ret.nexti;\\n error = false;\\n break;\\n }\\n break;\\n }\\n if (error) {\\n throw new Error(`escaped.decode: ill-formed escape sequence at buf[${i}]`);\\n }\\n }\\n return chars;\\n }\",\n \"function decode(data) {\\n let built = \\\"\\\"\\n for (let i = 0; i < data.length; i++) {\\n built += String.fromCharCode(data[i])\\n }\\n return built\\n }\",\n \"function getData (bytes) {\\n\\t\\tif (bytes[0] & 1 << 7 === 0) {\\n\\t\\t\\treturn {\\n\\t\\t\\t\\ttype: 'error',\\n\\t\\t\\t\\tmessage: 'First byte is not status'\\n\\t\\t\\t};\\n\\t\\t}\\n\\n\\t\\tvar channel = bytes[0] & 15;\\n\\n\\t\\tvar idx = (bytes[0] >> 4) & 7\\n\\t\\tvar type = typeMap[idx];\\n\\n\\t\\tvar data = {};\\n\\t\\tswitch (type) {\\n\\t\\t\\t// Note events\\n\\t\\t\\tcase 'noteOff':\\n\\t\\t\\tcase 'noteOn':\\n\\t\\t\\tcase 'afterTouch':\\n\\t\\t\\t\\tdata.note = bytes[1] - 60;\\n\\t\\t\\t\\tdata.value = bytes[2];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t// Controller events\\n\\t\\t\\tcase 'controllerChange':\\n\\t\\t\\t\\tdata.controllerIndex = bytes[1];\\n\\t\\t\\t\\tdata.value = bytes[2];\\n\\t\\t\\t\\tvar name = controllerMap[bytes[1]];\\n\\t\\t\\t\\tif (name) {\\n\\t\\t\\t\\t\\tdata.controllerName = name;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t// Channel wide events\\n\\t\\t\\tcase 'programChange':\\n\\t\\t\\t\\tdata.program = bytes[1];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'channelPressure':\\n\\t\\t\\t\\tdata.value = bytes[1];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'pitchBend':\\n\\t\\t\\t\\tdata.value = bytes[1] * 128 + bytes[2];\\n\\t\\t}\\n\\t\\treturn {\\n\\t\\t\\tchannel: channel,\\n\\t\\t\\ttype: type,\\n\\t\\t\\tdata: data\\n\\t\\t};\\n\\t}\",\n \"decode(str){\\n this.init()\\n var end = str.length\\n while(end>=0 && str.charAt(end-1)=='=') end--\\n if(end<2) throw '·Invalid Base64 string at· ' + end\\n var m = (end%4)\\n if(m==1) throw '·Invalid Base64 string at· ' + (end-1)\\n if(m>1) m--\\n var n = 3*Math.floor(end/4) + m\\n var blob = new Uint8Array(n)\\n var control =[[2,4,1],[4,2,1],[6,0,2]]\\n var left, right\\n var k=0\\n var c=0\\n for(var i=0; i> control[c][1])\\n k+=control[c][2]\\n c = (c+1)%3\\n } \\n return blob\\n }\",\n \"function _decodePkcs7Data(data) {\\n\\t // handle special case of \\\"chunked\\\" data content: an octet string composed\\n\\t // of other octet strings\\n\\t if(data.composed || data.constructed) {\\n\\t var value = forge.util.createBuffer();\\n\\t for(var i = 0; i < data.value.length; ++i) {\\n\\t value.putBytes(data.value[i].value);\\n\\t }\\n\\t data.composed = data.constructed = false;\\n\\t data.value = value.getBytes();\\n\\t }\\n\\t return data;\\n\\t}\",\n \"function Rn(t, e) {\\n return t.Bt ? e.toBase64() : e.toUint8Array();\\n}\",\n \"function Decoder() {\\n let string = 'ICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIA0KLi0uICAgICAuICAgICAgIC4gICAgICAgICAgIC4gICAgICAgICAuICAgIA0KfC0uLS4gIC18Li0uICAuLXwuLS4tLi0uLi0uLS4tLi0sICAgICB8LS4tLg0KJy1gLScgICAnYC0nICBgLSdgLXwtYC1gJyAnICcgYCctICBvICBgLWAtfA0KICAgICAgICAgICAgICAgICAgJyAgICAgICAgICAgICAgICAgICAgYC0nDQogICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgDQogIC4gIC4gICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgDQouLXwuLXwtLiAuLS4gICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgDQpgLSdgJ2AtJy1gLXwgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgDQogICAgICAgICBgLScgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAg';\\n let decodedString = atob(string);\\n console.log(decodedString);\\n\\n\\n}\",\n \"getqr(req, res) {\\n const url = req.body.url;\\n if (url.length === 0) res.send(\\\"Empty Data!\\\");\\n qr.toDataURL(url, (err, src) => {\\n if (err) res.send(\\\"Error occured\\\");\\n res.send(JSON.stringify(src));\\n });\\n }\",\n \"function onErrorMessageChanged(event) {\\n let value = new Uint8Array(event.target.value.buffer);\\n let utf8Decoder = new TextDecoder();\\n let errorMessage = utf8Decoder.decode(value);\\n console.log(\\\"Error message = \\\" + errorMessage);\\n}\",\n \"function decodeStream ( binary ) {\\n this.offset = 0;\\n this.buf = binary;\\n var self = this;\\n\\n this.remainingLength = function() {\\n return self.buf.length - self.offset;\\n };\\n\\n this.remainingData = function() {\\n if (self.buf.length == self.offset) {\\n return new Uint8Array(0);\\n } else {\\n return self.buf.slice(self.offset, self.buf.length);\\n }\\n };\\n\\n this.ensure = function( n ) {\\n if (self.offset + n > self.buf.length) {\\n throw \\\"incomplete_packet\\\";\\n }\\n };\\n\\n this.decodeVarint = function() {\\n var multiplier = 1;\\n var n = 0;\\n var digits = 0;\\n var digit;\\n do {\\n self.ensure(1);\\n if (++digits > 4) {\\n throw \\\"malformed\\\";\\n }\\n digit = self.buf[self.offset++];\\n n += ((digit & 0x7F) * multiplier);\\n multiplier *= 128;\\n } while ((digit & 0x80) !== 0);\\n return n;\\n };\\n\\n this.decode1 = function() {\\n self.ensure(1);\\n return self.buf[self.offset++];\\n };\\n\\n this.decodeUint16 = function() {\\n self.ensure(2);\\n var msb = self.buf[self.offset++];\\n var lsb = self.buf[self.offset++];\\n return (msb << 8) + lsb;\\n };\\n\\n this.decodeUint32 = function() {\\n self.ensure(4);\\n var b1 = self.buf[self.offset++];\\n var b2 = self.buf[self.offset++];\\n var b3 = self.buf[self.offset++];\\n var b4 = self.buf[self.offset++];\\n return (b1 << 24) + (b2 << 16) + (b3 << 8) + b4;\\n };\\n\\n this.decodeBin = function( length ) {\\n if (length == 0) {\\n return new Uint8Array(0);\\n } else {\\n self.ensure(length);\\n var offs = self.offset;\\n self.offset += length;\\n return self.buf.slice(offs, self.offset);\\n }\\n };\\n\\n this.decodeUtf8 = function() {\\n var length = self.decodeUint16();\\n return UTF8ToString( self.decodeBin(length) );\\n };\\n\\n this.decodeProperties = function() {\\n if (self.remainingLength() == 0) {\\n return {};\\n }\\n var len = self.decodeVarint();\\n var end = self.offset + len;\\n var props = {};\\n while (self.offset < end) {\\n var c = self.decode1();\\n var p = PROPERTY_DECODE[c];\\n if (p) {\\n var v;\\n var k = p[0];\\n switch (p[1]) {\\n case \\\"bool\\\":\\n v = !!(self.decode1());\\n break;\\n case \\\"uint32\\\":\\n v = self.decodeUint32();\\n break;\\n case \\\"uint16\\\":\\n v = self.decodeUint16();\\n break;\\n case \\\"uint8\\\":\\n v = self.decode1();\\n break;\\n case \\\"utf8\\\":\\n v = self.decodeUtf8();\\n break;\\n case \\\"bin\\\":\\n var count = self.decodeUint16();\\n v = self.decodeBin(count);\\n break;\\n case \\\"varint\\\":\\n v = self.decodeVarint();\\n break;\\n case \\\"user\\\":\\n default:\\n // User property\\n k = self.decodeUtf8();\\n v = self.decodeUtf8();\\n break;\\n }\\n if (p[2]) {\\n switch (typeof props[k]) {\\n case 'undefined':\\n props[k] = v;\\n break;\\n case 'object':\\n // assume array\\n props[k].push(v);\\n break;\\n default:\\n props[k] = new Array(props[k], v);\\n break;\\n }\\n } else {\\n props[k] = v;\\n }\\n } else {\\n throw \\\"Illegal property\\\";\\n }\\n }\\n return props;\\n };\\n}\",\n \"decodeFunctionResult(functionFragment, data) {\\n if (typeof (functionFragment) === \\\"string\\\") {\\n functionFragment = this.getFunction(functionFragment);\\n }\\n let bytes = Object(_ethersproject_bytes__WEBPACK_IMPORTED_MODULE_2__[/* arrayify */ \\\"a\\\"])(data);\\n let reason = null;\\n let errorArgs = null;\\n let errorName = null;\\n let errorSignature = null;\\n switch (bytes.length % this._abiCoder._getWordSize()) {\\n case 0:\\n try {\\n return this._abiCoder.decode(functionFragment.outputs, bytes);\\n }\\n catch (error) { }\\n break;\\n case 4: {\\n const selector = Object(_ethersproject_bytes__WEBPACK_IMPORTED_MODULE_2__[/* hexlify */ \\\"i\\\"])(bytes.slice(0, 4));\\n const builtin = BuiltinErrors[selector];\\n if (builtin) {\\n errorArgs = this._abiCoder.decode(builtin.inputs, bytes.slice(4));\\n errorName = builtin.name;\\n errorSignature = builtin.signature;\\n if (builtin.reason) {\\n reason = errorArgs[0];\\n }\\n }\\n else {\\n try {\\n const error = this.getError(selector);\\n errorArgs = this._abiCoder.decode(error.inputs, bytes.slice(4));\\n errorName = error.name;\\n errorSignature = error.format();\\n }\\n catch (error) {\\n console.log(error);\\n }\\n }\\n break;\\n }\\n }\\n return logger.throwError(\\\"call revert exception\\\", _ethersproject_logger__WEBPACK_IMPORTED_MODULE_8__[/* Logger */ \\\"b\\\"].errors.CALL_EXCEPTION, {\\n method: functionFragment.format(),\\n errorArgs, errorName, errorSignature, reason\\n });\\n }\",\n \"function parse_RC4Header(blob, length) {\\n\\tvar o = {};\\n\\tvar vers = o.EncryptionVersionInfo = parse_Version(blob, 4); length -= 4;\\n\\tif(vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\\n\\to.Salt = blob.read_shift(16);\\n\\to.EncryptedVerifier = blob.read_shift(16);\\n\\to.EncryptedVerifierHash = blob.read_shift(16);\\n\\treturn o;\\n}\",\n \"function parse_RC4Header(blob, length) {\\n\\tvar o = {};\\n\\tvar vers = o.EncryptionVersionInfo = parse_Version(blob, 4); length -= 4;\\n\\tif(vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\\n\\to.Salt = blob.read_shift(16);\\n\\to.EncryptedVerifier = blob.read_shift(16);\\n\\to.EncryptedVerifierHash = blob.read_shift(16);\\n\\treturn o;\\n}\",\n \"function parse_RC4Header(blob, length) {\\n\\tvar o = {};\\n\\tvar vers = o.EncryptionVersionInfo = parse_Version(blob, 4); length -= 4;\\n\\tif(vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\\n\\to.Salt = blob.read_shift(16);\\n\\to.EncryptedVerifier = blob.read_shift(16);\\n\\to.EncryptedVerifierHash = blob.read_shift(16);\\n\\treturn o;\\n}\",\n \"function parse_RC4Header(blob, length) {\\n\\tvar o = {};\\n\\tvar vers = o.EncryptionVersionInfo = parse_Version(blob, 4); length -= 4;\\n\\tif(vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\\n\\to.Salt = blob.read_shift(16);\\n\\to.EncryptedVerifier = blob.read_shift(16);\\n\\to.EncryptedVerifierHash = blob.read_shift(16);\\n\\treturn o;\\n}\",\n \"function ReedSolomonDecoder(field)\\r\\n{\\r\\n\\tthis.field = field;\\r\\n\\tthis.decode=function(received, twoS)\\r\\n\\t{\\r\\n\\t\\t\\tvar poly = new GF256Poly(this.field, received);\\r\\n\\t\\t\\tvar syndromeCoefficients = new Array(twoS);\\r\\n\\t\\t\\tfor(var i=0;i= b's\\r\\n\\t\\t\\tif (a.Degree < b.Degree)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tvar temp = a;\\r\\n\\t\\t\\t\\ta = b;\\r\\n\\t\\t\\t\\tb = temp;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tvar rLast = a;\\r\\n\\t\\t\\tvar r = b;\\r\\n\\t\\t\\tvar sLast = this.field.One;\\r\\n\\t\\t\\tvar s = this.field.Zero;\\r\\n\\t\\t\\tvar tLast = this.field.Zero;\\r\\n\\t\\t\\tvar t = this.field.One;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// Run Euclidean algorithm until r's degree is less than R/2\\r\\n\\t\\t\\twhile (r.Degree >= Math.floor(R / 2))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tvar rLastLast = rLast;\\r\\n\\t\\t\\t\\tvar sLastLast = sLast;\\r\\n\\t\\t\\t\\tvar tLastLast = tLast;\\r\\n\\t\\t\\t\\trLast = r;\\r\\n\\t\\t\\t\\tsLast = s;\\r\\n\\t\\t\\t\\ttLast = t;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// Divide rLastLast by rLast, with quotient in q and remainder in r\\r\\n\\t\\t\\t\\tif (rLast.Zero)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t// Oops, Euclidean algorithm already terminated?\\r\\n\\t\\t\\t\\t\\tthrow \\\"r_{i-1} was zero\\\";\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tr = rLastLast;\\r\\n\\t\\t\\t\\tvar q = this.field.Zero;\\r\\n\\t\\t\\t\\tvar denominatorLeadingTerm = rLast.getCoefficient(rLast.Degree);\\r\\n\\t\\t\\t\\tvar dltInverse = this.field.inverse(denominatorLeadingTerm);\\r\\n\\t\\t\\t\\twhile (r.Degree >= rLast.Degree && !r.Zero)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tvar degreeDiff = r.Degree - rLast.Degree;\\r\\n\\t\\t\\t\\t\\tvar scale = this.field.multiply(r.getCoefficient(r.Degree), dltInverse);\\r\\n\\t\\t\\t\\t\\tq = q.addOrSubtract(this.field.buildMonomial(degreeDiff, scale));\\r\\n\\t\\t\\t\\t\\tr = r.addOrSubtract(rLast.multiplyByMonomial(degreeDiff, scale));\\r\\n\\t\\t\\t\\t\\t//r.EXE();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\ts = q.multiply1(sLast).addOrSubtract(sLastLast);\\r\\n\\t\\t\\t\\tt = q.multiply1(tLast).addOrSubtract(tLastLast);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tvar sigmaTildeAtZero = t.getCoefficient(0);\\r\\n\\t\\t\\tif (sigmaTildeAtZero == 0)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tthrow \\\"ReedSolomonException sigmaTilde(0) was zero\\\";\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tvar inverse = this.field.inverse(sigmaTildeAtZero);\\r\\n\\t\\t\\tvar sigma = t.multiply2(inverse);\\r\\n\\t\\t\\tvar omega = r.multiply2(inverse);\\r\\n\\t\\t\\treturn new Array(sigma, omega);\\r\\n\\t\\t}\\r\\n\\tthis.findErrorLocations=function( errorLocator)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// This is a direct application of Chien's search\\r\\n\\t\\t\\tvar numErrors = errorLocator.Degree;\\r\\n\\t\\t\\tif (numErrors == 1)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// shortcut\\r\\n\\t\\t\\t\\treturn new Array(errorLocator.getCoefficient(1));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tvar result = new Array(numErrors);\\r\\n\\t\\t\\tvar e = 0;\\r\\n\\t\\t\\tfor (var i = 1; i < 256 && e < numErrors; i++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (errorLocator.evaluateAt(i) == 0)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tresult[e] = this.field.inverse(i);\\r\\n\\t\\t\\t\\t\\te++;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (e != numErrors)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tthrow \\\"Error locator degree does not match number of roots\\\";\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn result;\\r\\n\\t\\t}\\r\\n\\tthis.findErrorMagnitudes=function( errorEvaluator, errorLocations, dataMatrix)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// This is directly applying Forney's Formula\\r\\n\\t\\t\\tvar s = errorLocations.length;\\r\\n\\t\\t\\tvar result = new Array(s);\\r\\n\\t\\t\\tfor (var i = 0; i < s; i++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tvar xiInverse = this.field.inverse(errorLocations[i]);\\r\\n\\t\\t\\t\\tvar denominator = 1;\\r\\n\\t\\t\\t\\tfor (var j = 0; j < s; j++)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif (i != j)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tdenominator = this.field.multiply(denominator, GF256.addOrSubtract(1, this.field.multiply(errorLocations[j], xiInverse)));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tresult[i] = this.field.multiply(errorEvaluator.evaluateAt(xiInverse), this.field.inverse(denominator));\\r\\n\\t\\t\\t\\t// Thanks to sanfordsquires for this fix:\\r\\n\\t\\t\\t\\tif (dataMatrix)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tresult[i] = this.field.multiply(result[i], xiInverse);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn result;\\r\\n\\t\\t}\\r\\n}\",\n \"function qr(t) {\\n return new si((function(n, i) {\\n t.onsuccess = function(t) {\\n var i = t.target.result;\\n n(i);\\n }, t.onerror = function(t) {\\n var n = Qr(t.target.error);\\n i(n);\\n };\\n }));\\n}\",\n \"function qrPack() {\\n var qr = lapack.qr(this.elements);\\n\\n return {\\n\\tQ: $M(qr.Q),\\n\\tR: $M(qr.R)\\n };\\n}\",\n \"function qrPack() {\\n var qr = lapack.qr(this.elements);\\n\\n return {\\n\\tQ: $M(qr.Q),\\n\\tR: $M(qr.R)\\n };\\n}\",\n \"function qrPack() {\\n var qr = lapack.qr(this.elements);\\n\\n return {\\n\\tQ: $M(qr.Q),\\n\\tR: $M(qr.R)\\n };\\n}\",\n \"function decode(data) {\\n xmm.predictor.predict(data.slice(0, 8));\\n const { likeliest } = xmm.predictor.results;\\n $result.textContent = likeliest;\\n}\",\n \"function decodeString(string) {\\n var bytes = decode(string);\\n var hash = bytes.slice(0, 21);\\n var checksum = doubleSha256(hash);\\n\\n if (checksum[0] != bytes[21] ||\\n checksum[1] != bytes[22] ||\\n checksum[2] != bytes[23] ||\\n checksum[3] != bytes[24]) {\\n throw \\\"Checksum validation failed!\\\";\\n }\\n\\n var version = hash.shift();\\n\\n if (version != 0) {\\n throw \\\"Version \\\" + version + \\\" not supported!\\\";\\n }\\n\\n return hash;\\n}\",\n \"function decodeRLE(input) {\\n let handlers = {\\n onstart: (evt) => {},\\n ondata: (evt) => {},\\n onstop: (evt) => {},\\n onerror: (evt, msg) => {},\\n }\\n\\n let flushed = false\\n let lenPos = 0, len = Buffer.alloc(3)\\n let buffPos = -1, buff = Buffer.alloc(0)\\n\\n input.onstart = (evt) => { handlers.onstart(evt) }\\n input.ondata = (evt) => {\\n let currPos = 0, curr = Buffer.from(evt.data)\\n\\n for (; currPos < curr.byteLength; ) {\\n if (lenPos < 3) {\\n // Read the length of the payload.\\n len[lenPos] = curr[currPos]\\n lenPos++\\n } else {\\n // We just finished reading the length. Initialize the buffer for the\\n // payload.\\n if (buffPos == -1) {\\n buffPos = 0\\n buff = Buffer.alloc((65536*len[0]) + (256*len[1]) + len[2])\\n }\\n\\n buff[buffPos] = curr[currPos]\\n buffPos++\\n\\n // If we just read the last byte of the buffer, send the buffer down and\\n // start over.\\n if (buffPos == buff.byteLength) {\\n handlers.ondata({data: buff})\\n flushed = true\\n lenPos = 0\\n buffPos = -1\\n }\\n }\\n\\n currPos++\\n }\\n }\\n input.onstop = (evt) => {\\n if (isProbablyError(flushed, lenPos, len, buffPos, buff)) {\\n handlers.onerror(\\n new Error(\\\"server sent a text error message. (Message is displayed on page.)\\\"),\\n Buffer.concat([len, buff.slice(0, buffPos)]),\\n )\\n } else if (lenPos > 0 || buffPos != -1) {\\n handlers.onerror(new Error(\\\"stream stopped while in the middle of reading a chunk\\\"))\\n }\\n handlers.onstop(evt)\\n }\\n input.onerror = (evt, msg) => { handlers.onerror(evt, msg) }\\n\\n return handlers\\n}\",\n \"text(text, size, { errorCorrectionLevel = 'M' } = {}) {\\n const encodingHints = new Map();\\n encodingHints.set(EncodeHintType.ERROR_CORRECTION, ErrorCorrectionLevel[errorCorrectionLevel]);\\n const bitMatrix = this.writer.encode(text,\\n BarcodeFormat.QR_CODE,\\n size, // width\\n size, // height\\n encodingHints);\\n const writable = bitMatrixToPngBuffer(bitMatrix);\\n return writable;\\n }\",\n \"detectBarcodes(image) {\\n var that = this;\\n return new Promise(function executorBCD(resolve, reject) {\\n const what = that.getImageAsBase64(image);\\n\\n that._quagga.decodeSingle({\\n src: what,\\n numOfWorkers: 0, // Needs to be 0 when used within node\\n locate: true,\\n inputStream: {\\n size: image.width > image.height ? image.width : image.height\\n },\\n decoder: {\\n readers : [\\n 'upc_reader', 'code_128_reader', 'code_39_reader',\\n 'code_39_vin_reader', 'ean_8_reader', 'ean_reader',\\n 'upc_e_reader', 'codabar_reader'\\n ]\\n },\\n multiple: true,\\n }, function(result) {\\n var detectedBarcode = new Object;\\n detectedBarcode.boundingBox = undefined;\\n detectedBarcode.cornerPoints = [];\\n if(result) {\\n if (result.codeResult) {\\n console.log('detected: ', result.codeResult.code);\\n detectedBarcode.rawValue = result.codeResult.code;\\n\\n detectedBarcode.cornerPoints = [\\n { x: result.boxes[0][0][0], y:result.boxes[0][0][1] },\\n { x: result.boxes[0][1][0], y:result.boxes[0][1][1] },\\n { x: result.boxes[0][2][0], y:result.boxes[0][2][1] },\\n { x: result.boxes[0][3][0], y:result.boxes[0][3][1] }];\\n }\\n\\n } else {\\n console.error('no barcodes detected');\\n }\\n\\n resolve( [detectedBarcode] );\\n });\\n\\n });\\n }\",\n \"function QRCodeDataBlockReader(blocks, version, numErrorCorrectionCode) {\\n this.blockPointer = 0;\\n this.bitPointer = 7;\\n this.dataLength = 0;\\n this.blocks = blocks;\\n this.numErrorCorrectionCode = numErrorCorrectionCode;\\n if (version <= 9) this.dataLengthMode = 0;else if (version >= 10 && version <= 26) this.dataLengthMode = 1;else if (version >= 27 && version <= 40) this.dataLengthMode = 2;\\n }\",\n \"decodeAlectoV3(data, original_length) {\\n let id = utils.bin2dec(data.slice(4, 12));\\n let type = data.length === 40 ? 'TH' : 'R';\\n /*\\n There are multiple sensors that use the same protocol and similar encoding, but are\\n slightly different:\\n - Alecto WS-1100/WS-1200: has no sign bit; temperature value is 40 deg higher; has low battery bit (12)\\n - Fine Offset WH2(A): has sign bit (12); has no low battery status\\n */\\n let results = [];\\n let temperature = utils.bin2dec(data.slice(13, 24)) / 10;\\n let humidity = Number(utils.bin2dec(data.slice(24, 32)));\\n let sensor = (type === 'TH' ? 'WS-1100' : 'WS-1200');\\n let FineOffset = original_length === 42;\\n if (type === 'TH') {\\n if (humidity === 255) {\\n FineOffset = true;\\n type = 'T';\\n } else {\\n // Note: not ideal to check the temperature value to see if it is FineOffset or not (bit 14)\\n // FineOffset = FineOffset || (data[11] === '1' && data[14] === '0')\\n FineOffset = 'maybe';\\n }\\n }\\n if (FineOffset) {\\n let sign = (data[12] === '1' ? -1 : 1);\\n let result = {\\n id: id,\\n channel: Number(utils.bin2dec(data.slice(5, 8))) + 1,\\n pid: 'fineoffset',\\n name: 'WH2',\\n data: { temperature: Number((sign * temperature).toFixed(1)) }\\n };\\n if (data.slice(9, 12) !== '111' && type !== 'T') {\\n delete result.channel;\\n result.name = 'WH2A';\\n }\\n if (type === 'TH') {\\n result.data.humidity = humidity;\\n }\\n results.push(result);\\n }\\n if (!(FineOffset === true)) { // false or 'maybe'\\n // Alecto\\n let result = {\\n id: id,\\n channel: Number(utils.bin2dec(data.slice(2, 4))) + 1,\\n name: sensor,\\n data: { temperature: Number((-40 + temperature).toFixed(1)) }\\n };\\n if (type === 'TH') {\\n result.data.humidity = humidity;\\n } else { // Rain sensor (WS-1200)\\n let rain = utils.bin2dec(data.slice(32, 40)) * 256 + utils.bin2dec(data.slice(24, 32));\\n result.data.rainrate = rain * 0.3;\\n }\\n result.data.lowbattery = data[12] === '1';\\n results.push(result);\\n }\\n\\n return results;\\n }\",\n \"decodePdu( encoded ) {\\n\\n let values = [];\\n\\n let index = 0;\\n\\n while( index < encoded.length ) {\\n if( encoded[index] === MSG_TOKEN_ESC && index < encoded.length-1 ) {\\n index++;\\n\\n if( encoded[index] === MSG_START_STUFF ){\\n values.push( MSG_TOKEN_START );\\n }\\n else if( encoded[index] === MSG_ESC_STUFF ){\\n values.push( MSG_TOKEN_ESC );\\n }\\n\\n }\\n else {\\n values.push( encoded[index] );\\n }\\n\\n index++;\\n\\n }\\n\\n return values;\\n }\",\n \"function parse_RC4Header(blob, length) {\\n\\tvar o = {};\\n\\tvar vers = o.EncryptionVersionInfo = parse_CRYPTOVersion(blob, 4); length -= 4;\\n\\tif(vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\\n\\to.Salt = blob.read_shift(16);\\n\\to.EncryptedVerifier = blob.read_shift(16);\\n\\to.EncryptedVerifierHash = blob.read_shift(16);\\n\\treturn o;\\n}\",\n \"function parse_RC4Header(blob, length) {\\n\\tvar o = {};\\n\\tvar vers = o.EncryptionVersionInfo = parse_CRYPTOVersion(blob, 4); length -= 4;\\n\\tif(vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\\n\\to.Salt = blob.read_shift(16);\\n\\to.EncryptedVerifier = blob.read_shift(16);\\n\\to.EncryptedVerifierHash = blob.read_shift(16);\\n\\treturn o;\\n}\",\n \"function parse_RC4Header(blob, length) {\\n\\tvar o = {};\\n\\tvar vers = o.EncryptionVersionInfo = parse_CRYPTOVersion(blob, 4); length -= 4;\\n\\tif(vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\\n\\to.Salt = blob.read_shift(16);\\n\\to.EncryptedVerifier = blob.read_shift(16);\\n\\to.EncryptedVerifierHash = blob.read_shift(16);\\n\\treturn o;\\n}\",\n \"function parse_RC4Header(blob, length) {\\n\\tvar o = {};\\n\\tvar vers = o.EncryptionVersionInfo = parse_CRYPTOVersion(blob, 4); length -= 4;\\n\\tif(vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\\n\\to.Salt = blob.read_shift(16);\\n\\to.EncryptedVerifier = blob.read_shift(16);\\n\\to.EncryptedVerifierHash = blob.read_shift(16);\\n\\treturn o;\\n}\",\n \"onReceive( packet)\\n{\\n let packet_view = new Uint8Array(packet);\\n this.rxMsgArrayBuffer = appendArray(this.rxMsgArrayBuffer, packet_view);\\n let view = new Uint8Array(this.rxMsgArrayBuffer);\\n\\n if (this.size_Of_request)\\n {\\n let data = new Uint8Array(this.size_Of_request);\\n let offset = 0;\\n for(let index = 0; index < view.byteLength; ++index)\\n {\\n switch(view[index])\\n {\\n case ESC:\\n data[offset++] = this.xor_20(view[index]);\\n break;\\n\\n case SOP:\\n offset = 0;\\n break;\\n\\n case EOP:\\n break;\\n\\n default:\\n data[offset++] = view[index];\\n break;\\n }\\n }\\n\\n if (this.size_Of_request == offset)\\n {\\n //dumpArray(data);\\n if (this.postCallback)\\n this.postCallback(data);\\n this.rxMsgArrayBuffer = new ArrayBuffer();\\n\\n }\\n \\n }\\n}\",\n \"function ReedSolomonDecoder(field)\\n{\\n\\tthis.field = field;\\n\\tthis.decode=function(received, twoS)\\n\\t{\\n\\t\\t\\tvar poly = new GF256Poly(this.field, received);\\n\\t\\t\\tvar syndromeCoefficients = new Array(twoS);\\n\\t\\t\\tfor(var i=0;i= b's\\n\\t\\t\\tif (a.Degree < b.Degree)\\n\\t\\t\\t{\\n\\t\\t\\t\\tvar temp = a;\\n\\t\\t\\t\\ta = b;\\n\\t\\t\\t\\tb = temp;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tvar rLast = a;\\n\\t\\t\\tvar r = b;\\n\\t\\t\\tvar sLast = this.field.One;\\n\\t\\t\\tvar s = this.field.Zero;\\n\\t\\t\\tvar tLast = this.field.Zero;\\n\\t\\t\\tvar t = this.field.One;\\n\\t\\t\\t\\n\\t\\t\\t// Run Euclidean algorithm until r's degree is less than R/2\\n\\t\\t\\twhile (r.Degree >= Math.floor(R / 2))\\n\\t\\t\\t{\\n\\t\\t\\t\\tvar rLastLast = rLast;\\n\\t\\t\\t\\tvar sLastLast = sLast;\\n\\t\\t\\t\\tvar tLastLast = tLast;\\n\\t\\t\\t\\trLast = r;\\n\\t\\t\\t\\tsLast = s;\\n\\t\\t\\t\\ttLast = t;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Divide rLastLast by rLast, with quotient in q and remainder in r\\n\\t\\t\\t\\tif (rLast.Zero)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// Oops, Euclidean algorithm already terminated?\\n\\t\\t\\t\\t\\tthrow \\\"r_{i-1} was zero\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tr = rLastLast;\\n\\t\\t\\t\\tvar q = this.field.Zero;\\n\\t\\t\\t\\tvar denominatorLeadingTerm = rLast.getCoefficient(rLast.Degree);\\n\\t\\t\\t\\tvar dltInverse = this.field.inverse(denominatorLeadingTerm);\\n\\t\\t\\t\\twhile (r.Degree >= rLast.Degree && !r.Zero)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tvar degreeDiff = r.Degree - rLast.Degree;\\n\\t\\t\\t\\t\\tvar scale = this.field.multiply(r.getCoefficient(r.Degree), dltInverse);\\n\\t\\t\\t\\t\\tq = q.addOrSubtract(this.field.buildMonomial(degreeDiff, scale));\\n\\t\\t\\t\\t\\tr = r.addOrSubtract(rLast.multiplyByMonomial(degreeDiff, scale));\\n\\t\\t\\t\\t\\t//r.EXE();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\ts = q.multiply1(sLast).addOrSubtract(sLastLast);\\n\\t\\t\\t\\tt = q.multiply1(tLast).addOrSubtract(tLastLast);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tvar sigmaTildeAtZero = t.getCoefficient(0);\\n\\t\\t\\tif (sigmaTildeAtZero == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tthrow \\\"ReedSolomonException sigmaTilde(0) was zero\\\";\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tvar inverse = this.field.inverse(sigmaTildeAtZero);\\n\\t\\t\\tvar sigma = t.multiply2(inverse);\\n\\t\\t\\tvar omega = r.multiply2(inverse);\\n\\t\\t\\treturn new Array(sigma, omega);\\n\\t\\t}\\n\\tthis.findErrorLocations=function( errorLocator)\\n\\t\\t{\\n\\t\\t\\t// This is a direct application of Chien's search\\n\\t\\t\\tvar numErrors = errorLocator.Degree;\\n\\t\\t\\tif (numErrors == 1)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// shortcut\\n\\t\\t\\t\\treturn new Array(errorLocator.getCoefficient(1));\\n\\t\\t\\t}\\n\\t\\t\\tvar result = new Array(numErrors);\\n\\t\\t\\tvar e = 0;\\n\\t\\t\\tfor (var i = 1; i < 256 && e < numErrors; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (errorLocator.evaluateAt(i) == 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tresult[e] = this.field.inverse(i);\\n\\t\\t\\t\\t\\te++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (e != numErrors)\\n\\t\\t\\t{\\n\\t\\t\\t\\tthrow \\\"Error locator degree does not match number of roots\\\";\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t}\\n\\tthis.findErrorMagnitudes=function( errorEvaluator, errorLocations, dataMatrix)\\n\\t\\t{\\n\\t\\t\\t// This is directly applying Forney's Formula\\n\\t\\t\\tvar s = errorLocations.length;\\n\\t\\t\\tvar result = new Array(s);\\n\\t\\t\\tfor (var i = 0; i < s; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tvar xiInverse = this.field.inverse(errorLocations[i]);\\n\\t\\t\\t\\tvar denominator = 1;\\n\\t\\t\\t\\tfor (var j = 0; j < s; j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (i != j)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tdenominator = this.field.multiply(denominator, GF256.addOrSubtract(1, this.field.multiply(errorLocations[j], xiInverse)));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tresult[i] = this.field.multiply(errorEvaluator.evaluateAt(xiInverse), this.field.inverse(denominator));\\n\\t\\t\\t\\t// Thanks to sanfordsquires for this fix:\\n\\t\\t\\t\\tif (dataMatrix)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tresult[i] = this.field.multiply(result[i], xiInverse);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t}\\n}\",\n \"function getQRCode(text) {\\n var pattern = /\\\\'otpauth.*?\\\\'/\\n var match = pattern.exec(text);\\n text = match[0];\\n text = text.substring(1, text.length - 1);\\n var qrcode = new QRCode(document.getElementById(\\\"qrCode\\\"), {\\n width: 300,\\n height: 300\\n });\\n return qrcode.makeCode(text);\\n}\",\n \"function DecodeTrackData(/*uint8_t[]*/ Dest)\\n{\\n\\tvar Raw = D.data;\\n var /*uint16_t*/ p=0, r=0; // Offsets in data array\\n while( p= Sz) break; // End of track or error\\n while (p < Sz && Raw[p] == 0) p++; // Skip sync\\n if (p >= Sz) return false; // Something wrong\\n\\n if (p < Sz && Raw[p] == 0xa1) p++;\\n if (p < Sz && Raw[p] == 0xa1) p++;\\n if (p < Sz && Raw[p] == 0xa1) p++;\\n if (p >= Sz) return false; // Something wrong\\n if (Raw[p++] != 0xfe)\\n return false; // Marker not found\\n\\n var /*uint8_t*/ sectcyl, secthd, sectsec, sectno = 0;\\n if (p < Sz) sectcyl = Raw[p++];\\n if (p < Sz) secthd = Raw[p++];\\n if (p < Sz) sectsec = Raw[p++];\\n if (p < Sz) sectno = Raw[p++];\\n if (p >= Sz) return false; // Something wrong\\n\\n var /*int*/ z;\\t\\t// Sector size\\n if (sectno == 1) z = 256;\\n else if (sectno == 2) z = 512;\\n else if (sectno == 3) z = 1024;\\n else return false; // Something wrong: unknown sector size\\n // crc\\n if (p < Sz) p++;\\n if (p < Sz) p++;\\n\\n while (p < Sz && Raw[p] == 0x4e) p++; // Skip GAP2\\n if (p >= Sz) return false; // Something wrong\\n while (p < Sz && Raw[p] == 0x0) p++; // Skip sync\\n if (p >= Sz) return false; // Something wrong\\n\\n if (p < Sz && Raw[p] == 0xa1) p++;\\n if (p < Sz && Raw[p] == 0xa1) p++;\\n if (p < Sz && Raw[p] == 0xa1) p++;\\n if (p >= Sz) return false; // Something wrong\\n if (Raw[p++] != 0xfb)\\n return false; // Marker not found\\n\\n for (var c = 0; c < z; c++) // Copy sector data\\n {\\n if (r >= 5120) break; // End of track or error\\n Dest[r++] = Raw[p++];\\n if (p >= Sz)\\n return false; // Something wrong\\n }\\n if (p >= Sz)\\n return false; // Something wrong\\n // crc\\n if (p < Sz) p++;\\n if (p < Sz) p++;\\n }\\n\\n return true;\\n}\",\n \"function getDecodedData() {\\n return decoded_data;\\n}\",\n \"detectQRCodes(image) {\\n var that = this;\\n return new Promise(function executorQRD(resolve, reject) {\\n\\n that._qrcode.callback = function(err, result) {\\n var detectedBarcode = new Object;\\n detectedBarcode.boundingBox = undefined;\\n detectedBarcode.cornerPoints = [];\\n if (err != null) {\\n console.error('no qr codes detected: ' + err);\\n } else {\\n // |result.result| contains the decoded string, url or otherwise.\\n console.log('qr detected: ', result.result);\\n detectedBarcode.rawValue = result.result;\\n\\n if (result.points) {\\n detectedBarcode.cornerPoints = [\\n { x: result.points[0].X, y:result.points[0].Y },\\n { x: result.points[1].X, y:result.points[1].Y },\\n { x: result.points[2].X, y:result.points[2].Y },\\n { x: result.points[3].X, y:result.points[3].Y }];\\n }\\n }\\n resolve( [detectedBarcode] );\\n };\\n that._qrcode.decode(that.getImageAsBase64(image));\\n });\\n }\",\n \"function decode(data) {\\n\\tlet intext = false;\\n\\tlet bits = '';\\n\\n\\tfor (let i = 0; i < data.length; i++) {\\n\\t\\tif (intext) {\\n\\t\\t\\tif (data[i] == bit0)\\n\\t\\t\\t\\tbits += bit0;\\n\\t\\t\\tif (data[i] == bit1)\\n\\t\\t\\t\\tbits += bit1;\\n\\t\\t\\tconsole.log('bit'+bits + '| |' + bit1 + '| |' + bit0)\\n\\t\\t}\\n\\n\\t\\tif (istext(data[i])) intext = true;\\n\\t\\tif (iseol (data[i])) intext = false;\\n\\t}\\n\\treturn bits;\\n}\",\n \"function decodeMessage(message) {\\n const raw = message.raw;\\n return base64_decode(raw);\\n}\",\n \"extractCode(str) {\\n //console.log((new Buffer(str, 'base64')))\\n let res = {}, length;\\n // move the data into a byte array\\n let arr = str;\\n res.partType = arr[0]; // should be one of the PART_COMBINATIONS values\\n length = arr[1]; // length of the first key part\\n let c = 2;\\n res.part1 = arr.slice(c, c + length);\\n c += length;\\n length = arr[c]; // length of the second key part\\n c += 1;\\n res.part2 = arr.slice(c, c + length);\\n let keylength = arr[c + length];\\n c += length + 1;\\n res.pad1 = arr.slice(c, c + keylength);\\n c += keylength;\\n res.pad2 = arr.slice(c, c + keylength);\\n return res;\\n }\",\n \"function decode()\\n{\\n\\tget_ui_vals();\\n\\n\\n\\tif (typeof hex_opt === 'undefined')\\n\\t{\\n\\t\\thex_opt = 0;\\n\\t}\\n\\n\\n\\n\\tif (rate == 0)\\n\\t{\\n\\t\\treturn;\\n\\t}\\n\\n\\tspb = sample_rate / rate; \\t\\t// Calculate the number of Samples Per Bit.\\n\\n\\ttry\\n\\t{\\n\\t\\tspb_hs = sample_rate / high_rate;\\n\\t}\\n\\tcatch(e)\\n\\t{\\n\\t\\tspb_hs = sample_rate / 2000000;\\n\\t}\\n\\n\\tm = spb / 10; \\t\\t\\t\\t\\t// Margin = 1 tenth of a bit time (expresed in number of samples)\\n\\tm_hs = spb_hs / 10;\\n\\n\\tvar t = trs_get_first(ch);\\n\\n\\tchannel_color = get_ch_light_color(ch);\\n\\n\\twhile (trs_is_not_last(ch) && (stop == false))\\n\\t{\\n\\t if (abort_requested() == true)\\t\\t// Allow the user to abort this script\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\tswitch (state)\\n\\t\\t{\\n\\t\\t\\tcase GET_SOF:\\n\\n\\t\\t\\t\\twhile ((t.val != 0) && trs_is_not_last(ch))\\t\\t// Search for SOF\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tt = trs_get_next(ch);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\ts = t.sample + (spb * 0.5); \\t\\t// Position our reader on the middle of first bit\\n\\n\\t\\t\\t\\tbit_sampler_ini(ch,spb /2, spb); \\t// Initialize the bit sampler (to be able tu use \\\"bit_sampler_next()\\\")\\n\\t\\t\\t\\tbit_sampler_next(ch); \\t\\t\\t\\t// Read and skip the start bit\\n\\n\\t\\t\\t\\tdec_item_new(ch,t.sample,t.sample + spb - m); \\t// Add the start bit item\\n\\t\\t\\t\\tdec_item_add_pre_text(\\\"Start of Frame\\\");\\n\\t\\t\\t\\tdec_item_add_pre_text(\\\"Start\\\");\\n\\t\\t\\t\\tdec_item_add_pre_text(\\\"SOF\\\");\\n\\t\\t\\t\\tdec_item_add_pre_text(\\\"S\\\");\\n\\n\\t\\t\\t\\tpkt_start(\\\"CAN\\\");\\n\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"SOF\\\", \\\"\\\", dark_colors.blue, channel_color);\\n\\n\\t\\t\\t\\tbits = [];\\n\\t\\t\\t\\trb = 0;\\n\\t\\t\\t\\tframe_length_in_sample = 0;\\n\\t\\t\\t\\tb = 0; sb = 0;\\n\\t\\t\\t\\tbit_pos = [];\\n\\t\\t\\t\\tide_mode = false;\\n\\t\\t\\t\\tdata_size = 0;\\n\\t\\t\\t\\tbits.push(0); \\t\\t// Add the start bit to the bits table\\n\\t\\t\\t\\tbit_pos.push(s); \\t// Add its position\\n\\t\\t\\t\\tb++;\\n\\t\\t\\t\\trb++;\\n\\t\\t\\t\\tframe_length_in_sample += spb;\\n\\t\\t\\t\\tlast_bit = 0;\\n\\t\\t\\t\\tstate = GET_ID;\\n\\t\\t\\t\\trtr_mode = false;\\n\\t\\t\\t\\tide_mode = false;\\n\\t\\t\\t\\tedl_mode = false;\\n\\t\\t\\t\\tpotential_overload = true; \\t// This *may* be the beginning of an overload frame\\n\\n\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase GET_ID:\\n\\n\\t\\t\\t\\twhile (true) \\t// Read bits until we break\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (abort_requested() == true)\\t// Allow the user to abort this script\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(edl_mode && (((b==35)&&ide_mode) || ((b==16)&&!ide_mode)) )\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tbit_sampler_ini(ch,spb_hs / 2, spb_hs); \\t// use High speed since now\\n\\t\\t\\t\\t\\t\\tbit_sampler_next(ch);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (sb == 4)\\n\\t\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t\\tstuffing_ok = check_stuffing();\\t\\t// Stuffed bit\\n\\t\\t\\t\\t\\t\\tif (stuffing_ok == false) break; \\t// Break on the first stuffing error\\n\\t\\t\\t\\t\\t\\tsb = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tbits[b] = bit_sampler_next(ch);\\t\\t// Regular bit\\n\\t\\t\\t\\t\\t\\tif( (last_bit == 1)&&(bits[b] == 0) )\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(edl_mode && (((b>35)&&ide_mode) || ((b>16)&&!ide_mode)) )\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\ttrs_tmp = trs_get_prev(ch);\\n\\t\\t\\t\\t\\t\\t\\t\\tframe_length_in_sample = trs_tmp.sample - s + spb_hs/2;\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_pos.push(trs_tmp.sample + spb_hs/2); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, trs_tmp.sample + spb_hs/2, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_ini(ch,spb_hs / 2, spb_hs);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_next(ch);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\ttrs_tmp = trs_get_prev(ch);\\n\\t\\t\\t\\t\\t\\t\\t\\tframe_length_in_sample = trs_tmp.sample - s + spb/2;\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_pos.push(trs_tmp.sample + spb/2); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, trs_tmp.sample + spb/2, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_ini(ch,spb / 2, spb);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_next(ch);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbit_pos.push(s + frame_length_in_sample); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, s + frame_length_in_sample, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\n\\t\\t\\t\\t\\t\\tif (bits[b] == last_bit)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tsb++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tsb = 0;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tlast_bit = bits[b];\\n\\t\\t\\t\\t\\t\\tb++;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\trb++;\\n\\t\\t\\t\\t\\tif(edl_mode && (((b>35)&&ide_mode) || ((b>16)&&!ide_mode)) )\\n\\t\\t\\t\\t\\t\\tframe_length_in_sample += spb_hs;\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tframe_length_in_sample += spb;\\n\\n\\n\\t\\t\\t\\t\\tif(edl_mode && (((b==36)&&ide_mode) || ((b==17)&&!ide_mode)) )\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tbit_sampler_next(ch);\\n\\t\\t\\t\\t\\t\\tframe_length_in_sample += spb_hs;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif ((b == 14) && (bits[13] == 1))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tide_mode = true;\\n\\t\\t\\t\\t\\t\\trtr_mode = false; \\t// Reset rtr, will be checked at bit 32\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (ide_mode)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif ((b == 33) && (bits[32] == 1))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\trtr_mode = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif ((b == 34) && (bits[33] == 1))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tedl_mode = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif ((b == 13) && (bits[12] == 1))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\trtr_mode = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif ((b == 15) && (bits[14] == 1))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tedl_mode = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(edl_mode)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif ((ide_mode == true) && (b == 41))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif ((ide_mode == false) && (b == 22))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif ((ide_mode == true) && (b == 39))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif ((ide_mode == false) && (b == 19))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (stuffing_ok == false)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tt = trs_go_after(ch, bit_pos[b - 1] + (10.5 * spb));\\n\\t\\t\\t\\t\\tset_progress(100 * t.sample / n_samples);\\n\\t\\t\\t\\t\\tstate = GET_SOF;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(edl_mode) //if it's CAN-FD\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// Check if we are in normal or extended ID mode\\n\\t\\t\\t\\t\\tif (ide_mode == false)\\t \\t// Normal frame\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tval = 0;\\t\\t\\t\\t// Calculate the value of the ID\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 1; c < 12; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[1] - (0.5 * spb) + m, bit_pos[11] + (0.5 * spb) - m); \\t\\t// Add the ID item\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"IDENTIFIER: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"ID: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"ID\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\t\\t\\t\\t\\t\\tif (hex_opt > 0)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tvar tmp_val = (val >> 8);\\n\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_val);\\n\\t\\t\\t\\t\\t\\t\\ttmp_val = (val & 0xFF);\\n\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_val);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"ID\\\", int_to_str_hex(val), dark_colors.green, channel_color);\\n\\t\\t\\t\\t\\t\\tpkt_start(\\\"Frame Type\\\");\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[12] - (0.5 * spb) + m, bit_pos[12] + (0.5 * spb) - m); \\t// Add the RTR bit\\n\\n\\t\\t\\t\\t\\t\\tif (rtr_mode == true)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"RTR FRAME\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"RTR\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"R\\\");\\n\\t\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"RTR = 1\\\", \\\"RTR FRAME\\\", dark_colors.green, channel_color, true);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA FRAME\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"D\\\");\\n\\t\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"RTR = 0\\\", \\\"DATA FRAME\\\", dark_colors.green, channel_color, true);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[13] - (0.5 * spb) + m, bit_pos[13] + (0.5 * spb) - m);\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"BASE FRAME FORMAT\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"BASE FRAME\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"BASE\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"B\\\");\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"IDE = 0\\\",\\\"BASE FRAME FORMAT\\\", dark_colors.green, channel_color, true);\\n\\t\\t\\t\\t\\t\\tpkt_end();\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[14] - (0.5 * spb) + m, bit_pos[14] + (0.5 * spb) - m);\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"Extended Data Length\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"EDL\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[15] - (0.5 * spb) + m, bit_pos[15] + (0.5 * spb) - m);\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"r0\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[16] - (0.5 * spb) + m, bit_pos[16] + (0.5 * spb) - m);\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"Bit Rate Switch\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"BRS\\\");\\n\\t\\t\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[17] - (0.5 * spb) + m, bit_pos[17] + (0.5 * spb) - m);\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[17] - (0.5 * spb_hs) + m_hs, bit_pos[17] + (0.5 * spb_hs) - m_hs);\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"Error State Indicator)\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"ESI\\\");\\n\\t\\t\\t\\t\\t\\tval = 0;\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 18; c < 22; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdata_size = val;\\n\\n\\t\\t\\t\\t\\t\\tif(edl_mode)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tswitch (val)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tcase 0x9 : data_size = 12; crc_len=17; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xA : data_size = 16; crc_len=17; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xB : data_size = 20; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xC : data_size = 24; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xD : data_size = 32; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xE : data_size = 48; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xF : data_size = 64; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tdefault : break;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[18] - (0.5 * spb) + m, bit_pos[21] + (0.5 * spb) - m); \\t// Add the DLC item\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[18] - (0.5 * spb_hs) + m_hs, bit_pos[21] + (0.5 * spb_hs) - m_hs); \\t// Add the DLC item\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LENGTH CODE: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LENGTH: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LEN: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DLC: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"L:\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\n\\n\\t\\t\\t\\t\\t\\tif (hex_opt > 1)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, val);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"DLC\\\", int_to_str_hex(val), dark_colors.orange, channel_color, true);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tval = 0;\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 1; c < 12; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 14; c < 32; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[1] - (0.5 * spb) + m, bit_pos[31] + (0.5 * spb) - m); \\t// Add the EID item\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"EXTENDED IDENTIFIER: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"EID: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\t\\t\\t\\t\\t\\tif (hex_opt > 0)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tvar tmp_val = val;\\n\\n\\t\\t\\t\\t\\t\\t\\tfor (var i = 0; i < 4; i++)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tvar tmp_byte = (tmp_val & 0xFF);\\n\\t\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_byte);\\n\\t\\t\\t\\t\\t\\t\\t\\ttmp_val = (tmp_val - tmp_byte) / 256;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"EID\\\", int_to_str_hex(val), dark_colors.violet, channel_color);\\n\\t\\t\\t\\t\\t\\tpkt_start(\\\"Frame Type\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[32] - (0.5 * spb) + m, bit_pos[32] + (0.5 * spb) - m); // Add the RTR bit\\n\\n\\t\\t\\t\\t\\t\\tif (rtr_mode == true)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"RTR FRAME\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"RTR\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"R\\\");\\n\\t\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"RTR = 1\\\", \\\"RTR FRAME\\\", dark_colors.violet, channel_color, true);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA FRAME\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"D\\\");\\n\\t\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"RTR = 0\\\", \\\"DATA FRAME\\\", dark_colors.violet, channel_color, true);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[33] - (0.5 * spb) + m, bit_pos[33] + (0.5 * spb) - m);\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"Extended Data Length\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"EDL\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[34] - (0.5 * spb) + m, bit_pos[34] + (0.5 * spb) - m);\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"r0\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[35] - (0.5 * spb) + m, bit_pos[35] + (0.5 * spb) - m);\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"Bit Rate Switch\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"BRS\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[36] - (0.5 * spb_hs) + m_hs, bit_pos[36] + (0.5 * spb_hs) - m_hs);\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"Error State Indicator)\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"ESI\\\");\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(0, 0, \\\"IDE = 1\\\", \\\"EXTENDED FRAME FORMAT\\\", dark_colors.violet, channel_color, true);\\n\\t\\t\\t\\t\\t\\tpkt_end();\\n\\n\\t\\t\\t\\t\\t\\tval = 0;\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 37; c < 41; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdata_size = val;\\n\\n\\t\\t\\t\\t\\t\\tif(edl_mode)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tswitch (val)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tcase 0x9 : data_size = 12; crc_len=17; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xA : data_size = 16; crc_len=17; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xB : data_size = 20; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xC : data_size = 24; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xD : data_size = 32; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xE : data_size = 48; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tcase 0xF : data_size = 64; crc_len=21; break;\\n\\t\\t\\t\\t\\t\\t\\tdefault : break;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[37] - (0.5 * spb) + m, bit_pos[40] + (0.5 * spb) - m); \\t// Add the DLC item\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[37] - (0.5 * spb_hs) + m_hs, bit_pos[40] + (0.5 * spb_hs) - m_hs); \\t// Add the DLC item\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LENGTH CODE: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LENGTH: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LEN: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DLC: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"L:\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\t\\t\\t\\t\\t\\tif (hex_opt > 1)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, val);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(t.sample, t.sample + spb - m, \\\"DLC\\\", int_to_str_hex(val), dark_colors.orange, channel_color,true);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// Check if we are in normal or extended ID mode\\n\\t\\t\\t\\t\\tif (ide_mode == false)\\t \\t// Normal frame\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tval = 0;\\t\\t\\t\\t// Calculate the value of the ID\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 1; c < 12; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[1] - (0.5 * spb) + m, bit_pos[11] + (0.5 * spb) - m); \\t\\t// Add the ID item\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"IDENTIFIER: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"ID: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"ID\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\t\\t\\t\\t\\t\\tif (hex_opt > 0)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tvar tmp_val = (val >> 8);\\n\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_val);\\n\\t\\t\\t\\t\\t\\t\\ttmp_val = (val & 0xFF);\\n\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_val);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"ID\\\", int_to_str_hex(val), dark_colors.green, channel_color);\\n\\t\\t\\t\\t\\t\\tpkt_start(\\\"Frame Type\\\");\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[12] - (0.5 * spb) + m, bit_pos[12] + (0.5 * spb) - m); \\t// Add the RTR bit\\n\\n\\t\\t\\t\\t\\t\\tif (rtr_mode == true)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"RTR FRAME\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"RTR\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"R\\\");\\n\\t\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"RTR = 1\\\", \\\"RTR FRAME\\\", dark_colors.green, channel_color, true);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA FRAME\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"D\\\");\\n\\t\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"RTR = 0\\\", \\\"DATA FRAME\\\", dark_colors.green, channel_color, true);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[13] - (0.5 * spb) + m, bit_pos[13] + (0.5 * spb) - m); \\t// Add the IDE bit\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"BASE FRAME FORMAT\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"BASE FRAME\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"BASE\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"B\\\");\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"IDE = 0\\\",\\\"BASE FRAME FORMAT\\\", dark_colors.green, channel_color, true);\\n\\t\\t\\t\\t\\t\\tpkt_end();\\n\\n\\t\\t\\t\\t\\t\\tval = 0;\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 15; c < 19; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdata_size = val;\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[15] - (0.5 * spb) + m, bit_pos[18] + (0.5 * spb) - m); \\t// Add the DLC item\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LENGTH CODE: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LENGTH: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LEN: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DLC: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"L:\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\t\\t\\t\\t\\t\\tif (hex_opt > 1)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, val);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"DLC\\\", int_to_str_hex(val), dark_colors.orange, channel_color, true);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tval = 0;\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 1; c < 12; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 14; c < 32; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[1] - (0.5 * spb) + m, bit_pos[31] + (0.5 * spb) - m); \\t// Add the EID item\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"EXTENDED IDENTIFIER: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"EID: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\t\\t\\t\\t\\t\\tif (hex_opt > 0)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tvar tmp_val = val;\\n\\n\\t\\t\\t\\t\\t\\t\\tfor (var i = 0; i < 4; i++)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tvar tmp_byte = (tmp_val & 0xFF);\\n\\t\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_byte);\\n\\t\\t\\t\\t\\t\\t\\t\\ttmp_val = (tmp_val - tmp_byte) / 256;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"EID\\\", int_to_str_hex(val), dark_colors.violet, channel_color);\\n\\t\\t\\t\\t\\t\\tpkt_start(\\\"Frame Type\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[32] - (0.5 * spb) + m, bit_pos[32] + (0.5 * spb) - m); // Add the RTR bit\\n\\n\\t\\t\\t\\t\\t\\tif (rtr_mode == true)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"RTR FRAME\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"RTR\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"R\\\");\\n\\t\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"RTR = 1\\\", \\\"RTR FRAME\\\", dark_colors.violet, channel_color, true);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA FRAME\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA\\\");\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"D\\\");\\n\\t\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"RTR = 0\\\", \\\"DATA FRAME\\\", dark_colors.violet, channel_color, true);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(0, 0, \\\"IDE = 1\\\", \\\"EXTENDED FRAME FORMAT\\\", dark_colors.violet, channel_color, true);\\n\\t\\t\\t\\t\\t\\tpkt_end();\\n\\n\\t\\t\\t\\t\\t\\tval = 0;\\n\\n\\t\\t\\t\\t\\t\\tfor (c = 35; c < 39; c++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[c];\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tdata_size = val;\\n\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[35] - (0.5 * spb) + m, bit_pos[38] + (0.5 * spb) - m); \\t// Add the DLC item\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LENGTH CODE: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LENGTH: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA LEN: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DLC: \\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"L:\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\t\\t\\t\\t\\t\\tif (hex_opt > 1)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, val);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(t.sample, t.sample + spb - m, \\\"DLC\\\", int_to_str_hex(val), dark_colors.orange, channel_color,true);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (rtr_mode == false)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tstate = GET_DATA;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\t// Skip the data in case of RTR frame\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tstate = GET_CRC;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase GET_DATA:\\n\\t\\t\\t\\tdb = 0;\\n\\t\\t\\t\\tif(edl_mode)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tbit_sampler_ini(ch,spb_hs /2, spb_hs); \\t// use High speed since now\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\twhile (db < (data_size * 8)) \\t// Read data bits\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (sb == 4)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tstuffing_ok = check_stuffing();\\t\\t// Stuffed bit\\n\\n\\t\\t\\t\\t\\t\\tif (stuffing_ok == false)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tsb = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tbits[b] = bit_sampler_next(ch);\\t\\t// Regular bitif( (last_bit == 1)&&(bits[b] == 0) )\\n\\t\\t\\t\\t\\t\\tif( (last_bit == 1)&&(bits[b] == 0) )\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(edl_mode)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\ttrs_tmp = trs_get_prev(ch);\\n\\t\\t\\t\\t\\t\\t\\t\\tframe_length_in_sample = trs_tmp.sample - s + spb_hs/2;\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_pos.push(trs_tmp.sample + spb_hs/2); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, trs_tmp.sample + spb_hs/2, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_ini(ch,spb_hs / 2, spb_hs);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_next(ch);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\ttrs_tmp = trs_get_prev(ch);\\n\\t\\t\\t\\t\\t\\t\\t\\tframe_length_in_sample = trs_tmp.sample - s + spb/2;\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_pos.push(trs_tmp.sample + spb/2); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, trs_tmp.sample + spb/2, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_ini(ch,spb / 2, spb);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_next(ch);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbit_pos.push(s + frame_length_in_sample); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, s + frame_length_in_sample, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\t\\tif (bits[b] == last_bit)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tsb++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tsb = 0;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tlast_bit = bits[b];\\n\\t\\t\\t\\t\\t\\tb++;\\n\\t\\t\\t\\t\\t\\tdb++;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\trb++;\\n\\t\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\t\\tframe_length_in_sample += spb;\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tframe_length_in_sample += spb_hs;\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (stuffing_ok == false)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tt = trs_go_after(ch,bit_pos[b - 1] + (10.5 * spb));\\n\\t\\t\\t\\t\\tset_progress(100 * t.sample / n_samples);\\n\\t\\t\\t\\t\\tstate = GET_SOF;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tb -= (data_size * 8);\\t// Now interpret those bits as bytes\\n\\t\\t\\t\\tpkt_data = \\\"\\\";\\n\\n\\t\\t\\t\\tfor (i = 0; i < data_size; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tval = 0;\\n\\n\\t\\t\\t\\t\\tfor (c = 0; c < 8; c++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[b + (i * 8) + c];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[b + (i * 8)] - (0.5 * spb) + m, bit_pos[b + (i * 8) + 7] + (0.5 * spb) - m); \\t// Add the ID item\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[b + (i * 8)] - (0.5 * spb_hs) + m_hs, bit_pos[b + (i * 8) + 7] + (0.5 * spb_hs) - m_hs); \\t// Add the ID item\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"DATA: \\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"D: \\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"D \\\");\\n\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, val);\\n\\n\\t\\t\\t\\t\\tpkt_data += int_to_str_hex(val) + \\\" \\\";\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\tpkt_add_item(bit_pos[b] - (0.5 * spb), bit_pos[b + ((data_size - 1) * 8) + 7] + (0.5 * spb), \\\"DATA\\\", pkt_data, dark_colors.gray, channel_color);\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tpkt_add_item(bit_pos[b] - (0.5 * spb_hs), bit_pos[b + ((data_size - 1) * 8) + 7] + (0.5 * spb_hs), \\\"DATA\\\", pkt_data, dark_colors.gray, channel_color);\\n\\n\\t\\t\\t\\tb += (data_size * 8);\\n\\t\\t\\t\\tstate = GET_CRC;\\n\\n\\t\\t\\t\\t// TO DO:\\n\\t\\t\\t\\t// correct all start and end samples\\n\\t\\t\\t\\t// add packet for CRC, and error frames\\n\\t\\t\\t\\t// add the packet stop\\n\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase GET_CRC:\\n\\t\\t\\t\\tvar nbr_stf_b = 0;\\n\\t\\t\\t\\tdb = 0;\\n\\t\\t\\t\\tif(edl_mode)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tbit_sampler_ini(ch,spb_hs /2, spb_hs); \\t// use High speed since now\\n\\n\\t\\t\\t\\t\\twhile (db-nbr_stf_b < crc_len) //read crc bits\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif (db % 5 ==0)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbit_sampler_next(ch);\\n\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, s + frame_length_in_sample, DRAW_CROSS);\\n\\t\\t\\t\\t\\t\\t\\tdb++;\\n\\t\\t\\t\\t\\t\\t\\tnbr_stf_b++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbits[b] = bit_sampler_next(ch);\\t // Regular bit\\n\\t\\t\\t\\t\\t\\t\\tif( (last_bit == 1)&&(bits[b] == 0) )\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\ttrs_tmp = trs_get_prev(ch);\\n\\t\\t\\t\\t\\t\\t\\t\\tframe_length_in_sample = trs_tmp.sample - s + spb_hs/2;\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_pos.push(trs_tmp.sample + spb_hs/2); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, trs_tmp.sample + spb_hs/2, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_ini(ch,spb_hs / 2, spb_hs);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_next(ch);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_pos.push(s + frame_length_in_sample); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, s + frame_length_in_sample, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tlast_bit = bits[b];\\n\\n\\t\\t\\t\\t\\t\\t\\tb++;\\n\\t\\t\\t\\t\\t\\t\\tdb++;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\trb++;\\n\\t\\t\\t\\t\\t\\tframe_length_in_sample += spb_hs;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (stuffing_ok == false)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tt = trs_go_after(ch, bit_pos[b - 1] + (10.5 * spb));\\n\\t\\t\\t\\t\\t\\tset_progress(100 * t.sample / n_samples);\\n\\t\\t\\t\\t\\t\\tstate = GET_SOF;\\n\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tval = 0;\\n\\t\\t\\t\\t\\tb -= crc_len;\\n\\n\\t\\t\\t\\t\\tfor (c = 0; c < crc_len; c++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[b + c];\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tcrc_rg = 0;\\t\\t// Now calculate our own crc to compare\\n\\n\\n\\t\\t\\t\\t\\tfor (c = 1; c < b; c++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tcrc_nxt = bits[c] ^ ((crc_rg >> (crc_len)) & 0x1);\\n\\t\\t\\t\\t\\t\\tcrc_rg = crc_rg << 1;\\n\\n\\t\\t\\t\\t\\t\\tif (crc_nxt == 1)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif (crc_len==17)\\n\\t\\t\\t\\t\\t\\t\\t\\tcrc_rg ^= 0x3685B;\\n\\t\\t\\t\\t\\t\\t\\telse if (crc_len==21)\\n\\t\\t\\t\\t\\t\\t\\t\\tcrc_rg ^= 0x302898;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif (crc_len==17)\\n\\t\\t\\t\\t\\t\\t\\tcrc_rg &= 0x1ffff;\\n\\t\\t\\t\\t\\t\\telse if (crc_len==21)\\n\\t\\t\\t\\t\\t\\t\\tcrc_rg &= 0x1fffff\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[b] - (0.5 * spb_hs) + m_hs, bit_pos[b + crc_len-1] + (0.5 * spb_hs) - m_hs); \\t// Add the ID item\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"CRC : \\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"CRC \\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"CRC\\\");\\n\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\t\\t\\t\\t\\tif (hex_opt > 1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tvar tmp_val = (val >> 8);\\n\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_val);\\n\\t\\t\\t\\t\\t\\ttmp_val = (val & 0xFF);\\n\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_val);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (val == crc_rg)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\" OK\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\" OK\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\"\\\");\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1 ,\\\"CRC\\\", int_to_str_hex(val) + \\\" OK\\\", dark_colors.yellow, channel_color);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\" WRONG, Should be: \\\" + int_to_str_hex(crc_rg));\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\" WRONG!\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\"E!\\\");\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"CRC\\\", int_to_str_hex(val) + \\\"(WRONG)\\\", dark_colors.red, channel_color);\\n\\n\\t\\t\\t\\t\\t\\tpkt_start(\\\"CRC ERROR\\\");\\n\\t\\t\\t\\t\\t\\tpkt_add_item(0, 0, \\\"CRC (captured)\\\",int_to_str_hex(val), dark_colors.red, channel_color);\\n\\t\\t\\t\\t\\t\\tpkt_add_item(0, 0, \\\"CRC (calculated)\\\", int_to_str_hex(crc_rg), dark_colors.red, channel_color);\\n\\t\\t\\t\\t\\t\\tpkt_end();\\n\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\"!\\\");\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tb += crc_len-1;\\n\\t\\t\\t\\t\\tbit_pos[b] += spb;\\n\\t\\t\\t\\t\\tstate = GET_ACK;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\twhile (db < 16) //read crc bits\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif (sb == 4)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tstuffing_ok = check_stuffing();\\t\\t// Stuffed bit\\n\\n\\t\\t\\t\\t\\t\\t\\tif (stuffing_ok == false)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tsb = 0;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tbits[b] = bit_sampler_next(ch);\\t // Regular bit\\n\\t\\t\\t\\t\\t\\t\\tif( (last_bit == 1)&&(bits[b] == 0) )\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\ttrs_tmp = trs_get_prev(ch);\\n\\t\\t\\t\\t\\t\\t\\t\\tframe_length_in_sample = trs_tmp.sample - s + spb/2;\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_pos.push(trs_tmp.sample + spb/2); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, trs_tmp.sample + spb/2, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_ini(ch,spb / 2, spb);\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_sampler_next(ch);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tbit_pos.push(s + frame_length_in_sample); \\t\\t// Store the position of that bit\\n\\t\\t\\t\\t\\t\\t\\t\\tdec_item_add_sample_point(ch, s + frame_length_in_sample, DRAW_POINT);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t\\t\\t\\t\\tif (bits[b] == last_bit)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tsb++;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tsb = 0;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t\\tlast_bit = bits[b];\\n\\t\\t\\t\\t\\t\\t\\tb++;\\n\\t\\t\\t\\t\\t\\t\\tdb++;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\trb++;\\n\\t\\t\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\t\\t\\tframe_length_in_sample += spb;\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\tframe_length_in_sample += spb_hs;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (stuffing_ok == false)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tt = trs_go_after(ch, bit_pos[b - 1] + (10.5 * spb));\\n\\t\\t\\t\\t\\t\\tset_progress(100 * t.sample / n_samples);\\n\\t\\t\\t\\t\\t\\tstate = GET_SOF;\\n\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tval = 0;\\n\\t\\t\\t\\t\\tb -= 16;\\n\\n\\t\\t\\t\\t\\tfor (c = 0; c < 15; c++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tval = (val * 2) + bits[b + c];\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tcrc_rg = 0;\\t\\t// Now calculate our own crc to compare\\n\\n\\t\\t\\t\\t\\tfor (c = 0; c < b; c++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tcrc_nxt = bits[c] ^ ((crc_rg >> 14) & 0x1);\\n\\t\\t\\t\\t\\t\\tcrc_rg = crc_rg << 1;\\n\\n\\t\\t\\t\\t\\t\\tif (crc_nxt == 1)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tcrc_rg ^= 0x4599;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tcrc_rg &= 0x7fff;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[b] - (0.5 * spb) + m, bit_pos[b + 14] + (0.5 * spb) - m); \\t// Add the ID item\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[b] - (0.5 * spb_hs) + m_hs, bit_pos[b + 14] + (0.5 * spb_hs) - m_hs); \\t// Add the ID item\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"CRC : \\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"CRC \\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"CRC\\\");\\n\\t\\t\\t\\t\\tdec_item_add_data(val);\\n\\n\\t\\t\\t\\t\\tif (hex_opt > 1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tvar tmp_val = (val >> 8);\\n\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_val);\\n\\t\\t\\t\\t\\t\\ttmp_val = (val & 0xFF);\\n\\t\\t\\t\\t\\t\\thex_add_byte(ch, -1, -1, tmp_val);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (val == crc_rg)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\" OK\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\" OK\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\"\\\");\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1 ,\\\"CRC\\\", int_to_str_hex(val) + \\\" OK\\\", dark_colors.yellow, channel_color);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\" WRONG, Should be: \\\" + int_to_str_hex(crc_rg));\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\" WRONG!\\\");\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\"E!\\\");\\n\\n\\t\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"CRC\\\", int_to_str_hex(val) + \\\"(WRONG)\\\", dark_colors.red, channel_color);\\n\\n\\t\\t\\t\\t\\t\\tpkt_start(\\\"CRC ERROR\\\");\\n\\t\\t\\t\\t\\t\\tpkt_add_item(0, 0, \\\"CRC (captured)\\\",int_to_str_hex(val), dark_colors.red, channel_color);\\n\\t\\t\\t\\t\\t\\tpkt_add_item(0, 0, \\\"CRC (calculated)\\\", int_to_str_hex(crc_rg), dark_colors.red, channel_color);\\n\\t\\t\\t\\t\\t\\tpkt_end();\\n\\n\\t\\t\\t\\t\\t\\tdec_item_add_post_text(\\\"!\\\");\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tb += 15;\\n\\t\\t\\t\\t\\tstate = GET_ACK;\\n\\t\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase GET_ACK: \\t// and the EOF too.\\n\\t\\t\\t\\tbit_pos[b] -= spb;// CRC delimiter\\n\\t\\t\\t\\tack_chk = bit_sampler_next(ch);\\n\\t\\t\\t\\tbit_sampler_next(ch); \\t// ACK delimiter\\n\\n\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[b] + (1.5 * spb) + m, bit_pos[b] + (3.5 * spb) - m); \\t// Add the ACK item\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tdec_item_new(ch,bit_pos[b] + (2.5 * spb_hs) + m, bit_pos[b] + (2.5 * spb_hs) + 2*spb - m); \\t// Add the ACK item\\n\\n\\t\\t\\t\\tif(ack_chk == 1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"NO ACK\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"NACK\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"!A\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"ACK\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"ACK\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"A\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"ACK\\\", ack_chk.toString(10), dark_colors.black, channel_color);\\n\\t\\t\\t\\teof_chk = 0;\\n\\t\\t\\t\\tfor (c = 0; c < 7; c++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\teof_chk += bit_sampler_next(ch);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(!edl_mode)\\n\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[b] + (3.5 * spb) + m, bit_pos[b] + (10.5 * spb) - m); \\t// Add the EOF item\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tdec_item_new(ch, bit_pos[b] + (2.5 * spb_hs) + 2*spb - m, bit_pos[b] + (2.5 * spb_hs) + 9*spb - m); \\t// Add the EOF item\\n\\n\\t\\t\\t\\tif (eof_chk == 7)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"END OF FRAME OK\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"EOF OK\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"EOF\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"E\\\");\\n\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"EOF\\\", \\\"\\\", dark_colors.blue, channel_color);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"END OF FRAME ERR\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"EOF ERR!\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"!EOF!\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"!E!\\\");\\n\\t\\t\\t\\t\\tdec_item_add_pre_text(\\\"!\\\");\\n\\t\\t\\t\\t\\tpkt_add_item(-1, -1, \\\"EOF\\\",\\\"MISSING!\\\", dark_colors.red, channel_color);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tpkt_end();\\n\\n\\t\\t\\t\\tt = trs_go_after(ch, bit_pos[b] + (10.5 * spb));\\n\\t\\t\\t\\tset_progress(100 * t.sample / n_samples);\\n\\t\\t\\t\\tstate = GET_SOF;\\n\\t\\t\\t\\t//dec_item_new(ch, bit_pos[0] - (0.5 * spb) + m, bit_pos[b] + (0.5 * spb) - m); \\t//<=========================DEBUG ALL THE FRAME\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n}\",\n \"function decodeImpl(bytes) {\\n var pos = 0;\\n var len = bytes.length;\\n var out = [];\\n var substrings = [];\\n while (pos < len) {\\n var byte1 = bytes[pos++];\\n if (byte1 === 0) {\\n break; // NULL\\n }\\n if ((byte1 & 0x80) === 0) { // 1-byte\\n out.push(byte1);\\n }\\n else if ((byte1 & 0xe0) === 0xc0) { // 2-byte\\n var byte2 = bytes[pos++] & 0x3f;\\n out.push(((byte1 & 0x1f) << 6) | byte2);\\n }\\n else if ((byte1 & 0xf0) === 0xe0) {\\n var byte2 = bytes[pos++] & 0x3f;\\n var byte3 = bytes[pos++] & 0x3f;\\n out.push(((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3);\\n }\\n else if ((byte1 & 0xf8) === 0xf0) {\\n var byte2 = bytes[pos++] & 0x3f;\\n var byte3 = bytes[pos++] & 0x3f;\\n var byte4 = bytes[pos++] & 0x3f;\\n // this can be > 0xffff, so possibly generate surrogates\\n var codepoint = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;\\n if (codepoint > 0xffff) {\\n // codepoint &= ~0x10000;\\n codepoint -= 0x10000;\\n out.push((codepoint >>> 10) & 0x3ff | 0xd800);\\n codepoint = 0xdc00 | codepoint & 0x3ff;\\n }\\n out.push(codepoint);\\n }\\n else {\\n // FIXME: we're ignoring this\\n }\\n // As a workaround for https://github.com/samthor/fast-text-encoding/issues/1,\\n // make sure the 'out' array never gets too long. When it reaches a limit, we\\n // stringify what we have so far and append to a list of outputs.\\n if (out.length > 1024) {\\n substrings.push(String.fromCharCode.apply(null, out));\\n out.length = 0;\\n }\\n }\\n substrings.push(String.fromCharCode.apply(null, out));\\n return substrings.join('');\\n}\",\n \"function r(e){return e instanceof ArrayBuffer?a.default.resolve(e):e.toArrayBuffer?a.default.resolve(e.toArrayBuffer()):e.buffer?a.default.resolve(e.buffer):new a.default(function(t,n){var r=new FileReader;r.onload=function(){t(new Uint8Array(this.result))},r.onerror=n,r.readAsArrayBuffer(e)})}\",\n \"function initQrScanner(element){\\n \\tvar options = {\\n DecodeQRCodeRate: 5,\\n DecodeBarCodeRate: 5,\\n successTimeout: 500,\\n codeRepetition: true,\\n tryVertical: true,\\n frameRate: 15,\\n width: 320,\\n height: 480,\\n constraints: {\\n video: {\\n mandatory: {\\n maxWidth: 1280,\\n maxHeight: 1280\\n },\\n optional: [{\\n sourceId: true\\n }]\\n },\\n audio: false\\n },\\n flipVertical: false,\\n flipHorizontal: false,\\n zoom: -1,\\n decoderWorker: 'assets/webcodecamjs/js/DecoderWorker.js',\\n brightness: 0,\\n autoBrightnessValue: false,\\n grayScale: false,\\n contrast: 0,\\n threshold: 0,\\n sharpness: [],\\n resultFunction: qrSuccess,\\n cameraSuccess: function(stream) {\\n console.log('cameraSuccess');\\n },\\n canPlayFunction: function() {\\n console.log('canPlayFunction');\\n },\\n getDevicesError: function(error) {\\n \\tconsole.error('Error al encender la camara');\\n },\\n getUserMediaError: function(error) {\\n \\tconsole.error('Error al encender la camara');\\n },\\n cameraError: function(error) {\\n \\tconsole.error('Error al encender la camara');\\n }\\n };\\n \\tvar decoder = $(element).WebCodeCamJQuery(options).data().plugin_WebCodeCamJQuery;\\n \\tdecoder.init();\\n \\treturn decoder;\\n }\",\n \"function decode(string) {\\n\\tvar buffer = base58.decode(string)\\n\\n\\tvar message = buffer.slice(0, -4)\\n\\tvar checksum = buffer.slice(-4)\\n\\tvar newChecksum = sha256(message).slice(0, 4)\\n\\n\\tassert.deepEqual(newChecksum, checksum)\\n\\n\\tvar version = message.readUInt8(0)\\n\\tvar payload = message.slice(1)\\n\\n\\treturn {\\n\\t\\tversion : version,\\n\\t\\tpayload : payload,\\n\\t\\tchecksum : checksum\\n\\t}\\n}\",\n \"function parse_RC4Header(blob) {\\n var o = {};\\n var vers = o.EncryptionVersionInfo = parse_CRYPTOVersion(blob, 4);\\n if (vers.Major != 1 || vers.Minor != 1) throw 'unrecognized version code ' + vers.Major + ' : ' + vers.Minor;\\n o.Salt = blob.read_shift(16);\\n o.EncryptedVerifier = blob.read_shift(16);\\n o.EncryptedVerifierHash = blob.read_shift(16);\\n return o;\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.60470945","0.6000193","0.6000193","0.6000193","0.59892744","0.5986568","0.59758204","0.5876389","0.5847092","0.58175814","0.5387994","0.5387994","0.5336766","0.5256566","0.52518564","0.52518564","0.52463794","0.52461064","0.5236617","0.5228752","0.5228752","0.5228752","0.5228752","0.5228752","0.5228752","0.5222879","0.5220553","0.52113175","0.5180495","0.51506996","0.51475465","0.5136348","0.5116811","0.5116811","0.5116811","0.5116811","0.5101765","0.5084434","0.50603807","0.5038156","0.50107867","0.5006328","0.5005612","0.5005612","0.5005612","0.5005612","0.5005612","0.5005612","0.49818483","0.49520993","0.49514943","0.49230662","0.49130753","0.4911477","0.49058416","0.49009335","0.48972228","0.48707408","0.48624238","0.48461157","0.48283327","0.48269653","0.48102215","0.47991556","0.47966895","0.47966895","0.47966895","0.47966895","0.4765504","0.47653732","0.47628593","0.47628593","0.47628593","0.47575906","0.47518852","0.4741821","0.4740827","0.4734953","0.47247696","0.47133657","0.47005403","0.47003075","0.47003075","0.47003075","0.47003075","0.46995664","0.46912256","0.46880618","0.46807498","0.4679688","0.46742514","0.466103","0.4658282","0.46566877","0.465172","0.46439627","0.46247497","0.46243134","0.46183577","0.460578"],"string":"[\n \"0.60470945\",\n \"0.6000193\",\n \"0.6000193\",\n \"0.6000193\",\n \"0.59892744\",\n \"0.5986568\",\n \"0.59758204\",\n \"0.5876389\",\n \"0.5847092\",\n \"0.58175814\",\n \"0.5387994\",\n \"0.5387994\",\n \"0.5336766\",\n \"0.5256566\",\n \"0.52518564\",\n \"0.52518564\",\n \"0.52463794\",\n \"0.52461064\",\n \"0.5236617\",\n \"0.5228752\",\n \"0.5228752\",\n \"0.5228752\",\n \"0.5228752\",\n \"0.5228752\",\n \"0.5228752\",\n \"0.5222879\",\n \"0.5220553\",\n \"0.52113175\",\n \"0.5180495\",\n \"0.51506996\",\n \"0.51475465\",\n \"0.5136348\",\n \"0.5116811\",\n \"0.5116811\",\n \"0.5116811\",\n \"0.5116811\",\n \"0.5101765\",\n \"0.5084434\",\n \"0.50603807\",\n \"0.5038156\",\n \"0.50107867\",\n \"0.5006328\",\n \"0.5005612\",\n \"0.5005612\",\n \"0.5005612\",\n \"0.5005612\",\n \"0.5005612\",\n \"0.5005612\",\n \"0.49818483\",\n \"0.49520993\",\n \"0.49514943\",\n \"0.49230662\",\n \"0.49130753\",\n \"0.4911477\",\n \"0.49058416\",\n \"0.49009335\",\n \"0.48972228\",\n \"0.48707408\",\n \"0.48624238\",\n \"0.48461157\",\n \"0.48283327\",\n \"0.48269653\",\n \"0.48102215\",\n \"0.47991556\",\n \"0.47966895\",\n \"0.47966895\",\n \"0.47966895\",\n \"0.47966895\",\n \"0.4765504\",\n \"0.47653732\",\n \"0.47628593\",\n \"0.47628593\",\n \"0.47628593\",\n \"0.47575906\",\n \"0.47518852\",\n \"0.4741821\",\n \"0.4740827\",\n \"0.4734953\",\n \"0.47247696\",\n \"0.47133657\",\n \"0.47005403\",\n \"0.47003075\",\n \"0.47003075\",\n \"0.47003075\",\n \"0.47003075\",\n \"0.46995664\",\n \"0.46912256\",\n \"0.46880618\",\n \"0.46807498\",\n \"0.4679688\",\n \"0.46742514\",\n \"0.466103\",\n \"0.4658282\",\n \"0.46566877\",\n \"0.465172\",\n \"0.46439627\",\n \"0.46247497\",\n \"0.46243134\",\n \"0.46183577\",\n \"0.460578\"\n]"},"document_score":{"kind":"string","value":"0.65863824"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":3073,"cells":{"query":{"kind":"string","value":"Output the file creation details to the specified file"},"document":{"kind":"string","value":"function outputFileCreationInfo(file)\n{\n // Add the build information and header to the output file\n ccdd.writeToFileLn(file, \"# Created : \" + ccdd.getDateAndTime() + \"\\n# User : \" + ccdd.getUser() + \"\\n# Project : \" + ccdd.getProject() + \"\\n# Script : \" + ccdd.getScriptName());\n\n // Check if any table is associated with the script\n if (ccdd.getTableNumRows() != 0)\n {\n ccdd.writeToFileLn(file, \"# Table(s): \" + [].slice.call(ccdd.getTableNames()).sort().join(\",\\n# \"));\n }\n\n // Check if any groups is associated with the script\n if (ccdd.getAssociatedGroupNames().length != 0)\n {\n ccdd.writeToFileLn(file, \"# Group(s): \" + [].slice.call(ccdd.getAssociatedGroupNames()).sort().join(\",\\n# \"));\n }\n\n ccdd.writeToFileLn(file, \"\");\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 outputFileCreationInfo(file)\n{\n // Add the build information and header to the output file\n ccdd.writeToFileLn(file, \"/* Created : \" + ccdd.getDateAndTime() + \"\\n User : \" + ccdd.getUser() + \"\\n Project : \" + ccdd.getProject() + \"\\n Script : \" + ccdd.getScriptName());\n\n // Check if any table is associated with the script\n if (ccdd.getTableNumRows() != 0)\n {\n ccdd.writeToFileLn(file, \" Table(s): \" + [].slice.call(ccdd.getTableNames()).sort().join(\",\\n \"));\n }\n\n // Check if any groups is associated with the script\n if (ccdd.getAssociatedGroupNames().length != 0)\n {\n ccdd.writeToFileLn(file, \" Group(s): \" + [].slice.call(ccdd.getAssociatedGroupNames()).sort().join(\",\\n \"));\n }\n\n ccdd.writeToFileLn(file, \"*/\\n\");\n}","function fileCreate(fileName, data) {\n fs.writeFile(fileName, data, err => {\n if (err) {\n return console.log(err);\n }\n console.log('Your readme has been generated!')\n});\n}","function makeFile(info) {\n const { comment, upstream, config } = info\n return (\n `// ${comment}\\n` +\n '//\\n' +\n `// Auto-generated by ${packageJson.name}\\n` +\n `// based on rules from ${upstream}\\n` +\n '\\n' +\n '\"use strict\";\\n' +\n '\\n' +\n `module.exports = ${JSON.stringify(sortJson(config), null, 2)};\\n`\n )\n}","function createFile() {\n const renderedHTML = render(teamMembers);\n fs.writeFileSync(outputPath, renderedHTML);\n}","function OutFile() {\r\n}","function createFile(){\n if (projectType == \"Basic\") {\n internalReference = idAgency + \"-\" + padToFour(orderNumber) + \"-\" + padToTwo(version) + \"-\" + padToTwo(revision);\n updateListItem(fileId,internalReference,documentType,description,dateCreated,diffusionDate,externalReference,localization,form,status);\n //Internal Reference as Full\n } else if (projectType == \"Full\") {\n internalReference = documentType + \"-\" + padToFour(projectCode) + \"-\" + padToTwo(avenant) + \"-\" + idAgency + \"-\" + padToFour(orderNumber) + \"-\" + padToTwo(version) + \"-\" + padToTwo(revision);\n updateListItem(fileId, internalReference, documentType, description, dateCreated, diffusionDate, externalReference, localization, form, status);\n //Internal Reference as Full Without Project \n } else {\n\n internalReference = documentType + \"-\" + idAgency + \"-\" + padToFour(orderNumber) + \"-\" + padToTwo(version) + \"-\" + padToTwo(revision);\n updateListItem(fileId, internalReference, documentType, description, dateCreated, diffusionDate, externalReference, localization, form, status);\n }\n }","static txt ({ filepath, newFilepath, fileInfo }) {\n const info = '\\n\\nFile Info:\\n' +\n Object.keys(fileInfo)\n .map(k => `${k}: ${fileInfo[k]}`)\n .join('\\n')\n\n return fs.readFile(filepath)\n .then(file => fs.writeFile(newFilepath, file + info))\n }","function createLog(){\n var a = \"log_\" + moment().format('YYMMDD-HHmm') + \".txt\";\n logName = a;\n fs.writeFile(a,\"Starting Log:\\n\",(err)=>{\n if(err) throw(err); \n });\n}","function createFile() {\n var message = 'create file randomly',\n params = {\n message: message,\n committer: {\n name: 'yukihirai0505',\n email: 'hogehoge@gmail.com'\n },\n content: Utilities.base64Encode(message)\n },\n data = fetchJson(FILE_URL.replace(FILE_PATH_PLACEHOLDER, getRandomString()), 'PUT', params);\n Logger.log(data);\n}","create() {\n this.proc.args.file = null;\n\n this.emit('new-file');\n\n this.updateWindowTitle();\n }","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 writeFile(fileEntry, dataObj) {\n // Create a FileWriter object for our FileEntry (log.txt).\n fileEntry.createWriter(function (fileWriter) {\n // If data object is not passed in,\n // create a new Blob instead.\n if (!dataObj) {\n dataObj = new Blob([], { type: 'text/plain' });\n }\n fileWriter.write(dataObj);\n fileWriter.onwriteend = function() {\n console.log(dataObj);\n };\n fileWriter.onerror = function (e) {\n console.log(\"Failed file write: \" + e.toString());\n };\n });\n }","function writeFile(FPath, info, docName) {\n if ( $.os.search(/windows/i) !== -1 ) { // Detect line feed type\n fileLineFeed = \"Windows\";\n }\n else {\n fileLineFeed = \"Macintosh\";\n } \n try {\n var f = new File(FPath + \"/\" + docName + \".txt\");\n f.remove();\n f.open('a');\n f.lineFeed = fileLineFeed;\n f.write(info);\n f.close();\n }\n catch(e){}\n} //end function","function writeFile(fileEntry, dataObj) {\n\n // Create a FileWriter object for our FileEntry (log.txt).\n fileEntry.createWriter(function (fileWriter) {\n\n // If data object is not passed in,\n // create a new Blob instead.\n if (!dataObj) {\n dataObj = new Blob(['Hello'], { type: 'text/plain' });\n }\n\n fileWriter.write(dataObj);\n\n fileWriter.onwriteend = function() {\n console.log(\"Successful file write...\");\n };\n\n fileWriter.onerror = function (e) {\n console.log(\"Failed file write: \" + e.toString());\n };\n\n });\n}","function createNewFile() {\n file = {\n name: 'novo-arquivo.txt',\n content: '',\n saved: false,\n path: app.getPath('documents') + '/novo-arquivo.txt'\n }\n\n mainWindow.webContents.send('set-file', file)\n}","function makeTheFile(name, data){\n fs.writeFile('README.md', data, (err) => {\n if (err){\n console.log(err);\n }\n console.log(\"README has been successfully generated.\")\n })\n }","createFile() {\n try {\n fse.ensureDirSync(this.directory);\n } catch(e) {\n if ( e.code != 'EEXIST' ) throw e;\n }\n\n if (!utils.fileExists(this.file)) {\n fs.writeFileSync(this.file, this.serialize(this.defaultConfig));\n log.d('Created the default config file in ' + this.file);\n }\n }","function createFile() {\r\n const iterator1 = stories[Symbol.iterator]();\r\n var combos = \"\";\r\n for (const item of iterator1) {\r\n combos = combos + item[0] + '\\n' + splitConstant + '\\n' + item[1] + '\\n' + splitConstant + '\\n';\r\n }\r\n var text = combos;\r\n var filename = 'stories.txt';\r\n var element = document.createElement('a');\r\n element.setAttribute('href', 'data:text/plain;charset=utf-8,' + encodeURIComponent(text));\r\n element.setAttribute('download', filename);\r\n element.style.display = 'none';\r\n document.body.appendChild(element);\r\n element.click();\r\n document.body.removeChild(element);\r\n}","function writeToFile(fileName, createFile) {\n fs.writeFile(fileName, createFile, function (err) {\n if (err) {\n console.log(err);\n }\n console.log(\"Your README.md is created!\");\n });\n}","function generateOutputFile(channel, member) {\n const fileName = `recordings/${channelid}-${member.username}-${Date.now()}.pcm`;\n console.log(fileName);\n return fs.createWriteStream(fileName);\n}","function createFile(filePath, fileName, content) {\n fs.writeFile(filePath, content, function(err) {\n if (err) {\n return console.log(err);\n }\n console.log(`${fileName} was saved!`);\n });\n}","function writeToFile(fileName, data) {\n\n fs.appendFile(\n fileName, \n generateMarkdown(data) ,\n function(err) {\n if(err) {\n return console.log(err);\n }\n \n console.log(\"Your README file is created successfully!\");\n })\n\n fs.appendFile(\n fileName, \n generateLicense(data) ,\n function(err) {\n if(err) {\n return console.log(err);\n }\n \n console.log(\"Your README file is created successfully!\");\n })\n\n \n\n \n}","function writeFile(fileEntry, dataObj) {\n // Create a FileWriter object for our FileEntry (log.txt).\n fileEntry.createWriter(function (fileWriter) {\n\n fileWriter.onwriteend = function() {\n console.log(\"Successful file write...\"+fileEntry.name);\n\t\t\t//alert(\"Successful file write...\"+fileEntry.name);\n\t\t\treturn true;\n };\n\n fileWriter.onerror = function(e) {\n console.log(\"Failed file write: \" + e.toString());\n\t\t\t//alert(\"Failed file write: \" + e.toString());\n\t\t\treturn false;\n };\n\n // If data object is not passed in, dont continue\n if (!dataObj) {\n\t\t\tconsole.log(\"writeFile() failed, no dataObj passed\");\n return false;\n }\n\n fileWriter.write(dataObj);\n });\n}","function writeFile(name) {\n const ext = path.extname(name).substr(1);\n let data = config.headers[ext].join(\"\\n\");\n\n data += \"\\n\";\n if (config.endWithBlankline) {\n data += \"\\n\";\n }\n\n fs.writeFile(name, data, err => {\n if (!err && config.setExecutable) {\n fs.chmod(name, \"755\", err => {\n if (!err && config.symlink.create) {\n createSymlink(name);\n }\n });\n }\n });\n }","open() {\n this.close()\n\n const file = path.normalize(this._filename)\n const opts = {\n flags: this._append ? 'a' : 'w',\n encoding: 'utf8',\n }\n\n ensureDirectoryExistence(file)\n this._writer = fs.createWriteStream(file, opts)\n }","function writeToFile(filetype, data) {\n fs.writeFile(filetype, data, (err) =>\n err ? console.log(err) : console.log('Created your README!')\n )\n}","function createTxtErrorFile(fileErrorString, rootFldr, numFiles, fileAction) {\n\n // various file strings\n var arrowEnd = \"\\n\";\n var header_searchRoot = \"\\n\\n< --- ROOT SEARCH PATH --- >\\n\";\n var header_AIFiles = \"\\n\\n< --- AI FILE PATHS --- >\\n\";\n var dateHeader = \"< --- CREATED ON --- >\\n\" + new Date() + \"\\n\" + \"\\n\";\n \n // creates file\n if(fileAction == \"create\"){\n // extracts folder location \n var reg = /[^\\\\]+$/g; //last folder sting in full path\n var folderLocation = rootFldr.fsName.match(reg).toString().replace(/( +)/, \"\");\n \n // create a text file to store all the file and artboard data\n file_errorsInFile = File(rootFldr + '/' + 'log_errorFiles_' + folderLocation + '.txt');\n file_errorsInFile.open(\"w\");\n file_errorsInFile.write(dateHeader); // writes date header string to file\n \n file_errorsInFile.write(header_searchRoot + rootFldr +\"\\n\" + arrowEnd); \n file_errorsInFile.write(header_AIFiles);\n } // end of create action\n \n // write errors to file\n if(fileAction == \"write\"){\n file_errorsInFile.writeln(fileErrorString);\n }// end of write action\n\n // close file\n if(fileAction == \"close\"){ \n file_errorsInFile.write(\n arrowEnd +\n \"\\n\\n< --- PROCESS DATA --- >\"\n + \"\\n\" + \"Total number of files that failed check = \" + numFiles\n + \"\\n\" + arrowEnd);\n file_errorsInFile.close();\n } // end of close action\n}","function writeFile() {\n let overwrite = JSON.stringify(notes);\n fs.writeFile(outputPath, overwrite, function(err) {\n if (err) {\n console.log(err);\n } else {\n console.log(\"File written\");\n }\n });\n}","function writeToFile(fileName, data) {\n // Project Title\n fs.writeFileSync(fileName, \"# \" + data.projectTitle + '\\n\\n');\n\n // Badge\n fs.appendFileSync(fileName, '![' + data.projectTitle + ']' + '(https://img.shields.io/github/repo-size/' + data.username + '/' + data.repoName + ')\\n\\n');\n\n // Table of Contents\n fs.appendFileSync(fileName, \"## Table of Contents\" + '\\n\\n' + \"* \" + data.tableOfContents.split(\" \").join(\"\\n* \") + '\\n\\n');\n\n // Description\n fs.appendFileSync(fileName, \"## Description\" + '\\n\\n' + data.description + '\\n\\n');\n\n // Installation\n fs.appendFileSync(fileName, \"## Installation\" + '\\n\\n' + data.installation + '\\n\\n');\n\n // Usage\n fs.appendFileSync(fileName, \"## Usage\" + '\\n\\n' + data.usage + '\\n\\n');\n\n // License\n fs.appendFileSync(fileName, \"## License\" + '\\n\\n' + data.license + '\\n\\n');\n\n // Contributing\n fs.appendFileSync(fileName, \"## Contributing\" + '\\n\\n' + data.contributing + '\\n\\n');\n\n // Tests\n fs.appendFileSync(fileName, \"## Tests\" + '\\n\\n' + data.tests + '\\n\\n');\n\n // Contact (Profile Picture and E-mail)\n fs.appendFileSync(fileName, \"## Contact\" + '\\n\\n' + '\\n\\nE-mail: ' + data.questionsEmail);\n\n console.log(\"Success!\");\n\n}","function createFile(fullPathToFile, newFilePath, newFileName, newFileParentPath, timestamp, markAsPermanentlyNotRelevant) {\n\n //if this should be ignored due to the st-ignore.json file\n if(!ignoreThisFileOrDir(newFilePath)) {\n \n //create an id for this file\n var newFileId = \"fileId-\" + branchId + \"_\" + autoGeneratedFileId;\n \n //get the id ready for the next file/dir\n autoGeneratedFileId++;\n\n //create a new file object\n var newFile = {\n id: newFileId,\n parentId: getIdFromDirPath(newFileParentPath),\n currentName: newFileName,\n isDeleted: false\n };\n\n //add the file to the object of all files\n allFiles[newFileId] = newFile;\n\n //make a connection between the file path and an id \n addFilePathToIdMap(newFilePath, newFileId);\n \n //create a new empty 2D array to hold insert events for the default file\n allInsertEventsByFile[newFileId] = [];\n\n //create a new file event\n var createFileEvent = {\n id: \"ev_\" + branchId + \"_\" + autoGeneratedEventId, \n timestamp: timestamp,\n type: \"Create File\",\n initialName: newFileName,\n fileId: newFileId,\n parentDirectoryId: newFile.parentId,\n createdByDevGroupId: currentDeveloperGroup.id\n };\n \n //increase the id so the next event has a unique id\n autoGeneratedEventId++;\n \n //if the user wants to mark this file as NOT relevant (because it is an existing file\n //that is being reconciled in a new project)\n if(markAsPermanentlyNotRelevant === true) {\n\n //pre-mark the event as not even possible to become relevant\n createFileEvent.permanentRelevance = \"never relevant\";\n }\n\n //add the event to the collection of all events\n codeEvents.push(createFileEvent);\n\n //occassionally a new file has something in it, for example, if a tool has generated the file\n //if the file has anything in it, take the contents and make them events in the system\n\n //open the file and read the text\n var fileText = fs.readFileSync(fullPathToFile, \"utf8\");\n \n //if there is anything in the new file\n if(fileText !== \"\") {\n\n //add the text into \n insertText(newFilePath, fileText, 0, 0, false, [], new Date().getTime(), markAsPermanentlyNotRelevant);\n }\n }\t \n}","createFile(path) {\n touch.sync(path.absolute);\n }","function save_text(file_name,info_text) {\nif (!file_name) {save_text_count++; file_name = 'text' + save_text_count.toString() + '.txt';}\nvar fs = require('fs'); fs.write(file_name, info_text, 'w');}","function writeFile() {\n const ERR_MESS_WRITE = \"TODO: Trouble writing file\";\n\n todocl.dbx.filesUpload({\n contents: todocl.todoText,\n path: todocl.path,\n mode: 'overwrite',\n autorename: false,\n mute: true\n }).then(function (response) {\n\n }).catch(function (error) {\n todocl.dbx.accessToken = null;\n todocl.out.innerHTML = ERR_MESS_WRITE;\n });\n }","writeToFile () {\n let data = this.ghostToJson();\n\n fs.writeFileSync(this.ghostFileOutput, data, 'utf8');\n console.log( logSuccess('Ghost JSON generated successfully!') );\n }","function writeToFile(fileName, data) { \n // console.log(\"Inside function\", fileName);\n fs.writeFile(fileName, data, function (err) {\n if (err) return console.log(err);\n console.log(`Generated ${fileName} succesfully !!`);\n });\n}","function writeToFile(fileName, data) {\n fs.writeFile(\"./Generator/\"+fileName, data, function(err) {\n if (err) {\n return console.log(err);\n }\n console.log (\"Successfully wrote: \" + fileName);\n })\n \n}","function generateFile (requests, options) {\n\t var options = options || {};\n\t var EOL = options.eol || \"\\r\\n\";\n\t var plateNumber = options.plateNumber || 1;\n\t var textFile = [];\n\n\t for (var request of requests) {\n\t var holder=getHolder(request.position, plateNumber);\n\t var experimentNumber=getExperimentNumber(request.position);\n\t if (options.deleteExistingHolder) {\n\t textFile.push(\"USER \"+request.user);\n\t textFile.push(\"HOLDER \"+holder);\n\t textFile.push(\"DELETE\"); // this is required to delete already existing entries\n\t }\n\t textFile.push(\"USER \"+request.user);\n\t textFile.push(\"HOLDER \"+holder);\n\t if (! options.autosubmit) textFile.push(\"NO_SUBMIT\");\n\t textFile.push(\"NAME \"+request.name);\n\t textFile.push(\"TITLE \"+request.title);\n\t for (var experiment of request.experiments) {\n\t textFile.push(\"EXPNO \"+experimentNumber++);\n\t textFile.push(\"SOLVENT \"+experiment.solvent);\n\t textFile.push(\"EXPERIMENT \"+experiment.experiment);\n\t if (experiment.parameters && experiment.parameters.length>0) {\n\t var parameters=[];\n\t for (var parameter of experiment.parameters) {\n\t parameters.push(parameter.label, parameter.value);\n\t }\n\t textFile.push(\"PARAMETERS \"+parameters.join(','));\n\t }\n\t }\n\t textFile.push(\"\");\n\t }\n\t return textFile.join(EOL);\n\t}","function createHtmlFile(html) {\n\t// write HTML file into the dist folder\n\tfs.writeFile('dist/index.html', `${html}`, (err) => {\n\t\terr ? console.log(err) : console.log('Your HTML Document Was Successfully Generated!');\n\t});\n}","function writeToFile( data) {\n fs.writeFile(\"./generated-files/README.md\",generateMarkdown(data), err =>{\n if(err){\n throw err;\n }\n console.log(\"file generated!\")\n })\n}","function createFile(filename, content) {\n if (existsSync(filename)) return console.log(filename + ' already exists - exiting');\n const data = new Uint8Array(Buffer.from(content));\n writeFile(filename, data, (err) => {\n if (err) throw err;\n console.log(filename + ' created.');\n });\n}","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, (err) => \n err ? console.error(err) : console.log('README created!'))\n}","function writeToFile(fileName, data) {\n fs.writeFileSync('./generated/'+fileName, generateMarkdown(data), error => {\n console.log(\"Generating README\");\n if (error) throw error;\n console.log(\"README generated.\");\n });\n \n}","function createFileWriter(fileEntry, callbackFunction) {\n\tfileEntry.createWriter(callbackFunction, fail);\n}","function writeToFile(fileName, userInput) {\n fs.writeFile(`` + fileName, generatesite(userInput), function (err) {\n if (err) {\n return console.log(err);\n }\n\n console.log(\"Generating HTML...\");\n });\n}","function writeToFile(fileName, data) {\n console.log(\"writeToFile: Filename is \" + fileName);\n console.log(\"writeToFile: data is \" + data);\n fs.writeFile(fileName, data, function(err){\n if (err) {\n throw err;\n };\n console.log(\"The README was created successfully\");\n})\n }","function outputToFile(filename, content, callback) {\n\tfunction errorHandler(e) {\n\t var msg = '';\n\n\t switch (e.code) {\n\t case FileError.QUOTA_EXCEEDED_ERR:\n\t msg = 'QUOTA_EXCEEDED_ERR';\n\t break;\n\t case FileError.NOT_FOUND_ERR:\n\t msg = 'NOT_FOUND_ERR';\n\t break;\n\t case FileError.SECURITY_ERR:\n\t msg = 'SECURITY_ERR';\n\t break;\n\t case FileError.INVALID_MODIFICATION_ERR:\n\t msg = 'INVALID_MODIFICATION_ERR';\n\t break;\n\t case FileError.INVALID_STATE_ERR:\n\t msg = 'INVALID_STATE_ERR';\n\t break;\n\t default:\n\t msg = 'Unknown Error';\n\t break;\n\t };\n\n\t console.log('Error: ' + msg);\n\t}\n\tfunction onInitFs(fs) {\n\t\t//funcs\n\t\tfunction removeEntries(entries, nextstep) {\n\t\t\tentries.forEach(function(entry, i) {\n\t\t\t\tentry.remove(function(){}, function(e){console.log(e);});\n\t\t\t});\n\t\t\tnextstep.call();\n\t\t}\n\n\t\tfunction createFile() {\n\t\t\t fs.root.getFile(filename, {create: true}, function(fileEntry) {\n\n\t\t\t // Create a FileWriter object for our FileEntry (log.txt).\n\t\t\t fileEntry.createWriter(function(fileWriter) {\n\n\t\t\t fileWriter.onwriteend = function(e) {\n\t\t\t\tconsole.log('Write completed.');\n\t\t\t\tcallback(fileEntry.toURL());\n\t\t\t };\n\n\t\t\t fileWriter.onerror = function(e) {\n\t\t\t\tconsole.log('Write failed: ' + e.toString());\n\t\t\t\tcallback(false, e);\n\t\t\t };\n\n\t\t\t // Create a new Blob and write it to file.\n\t\t\t var BlobBuilder = window.BlobBuilder || window.WebKitBlobBuilder;\t\n\t\t\t var bb = new BlobBuilder(); // Note: window.WebKitBlobBuilder in Chrome 12.\n\t\t\t bb.append(content);\n\t\t\t fileWriter.write(bb.getBlob('text/plain'));\n\n\t\t\t }, errorHandler);\n\n\t\t\t }, errorHandler);\n\t\t}\n\n\t // remove old files ------------begin---\n\n\t var dirReader = fs.root.createReader();\n\t var entries = [];\n\n\t // Call the reader.readEntries() until no more results are returned.\n\t var readEntries = function() {\n\t dirReader.readEntries (function(results) {\n\t if (!results.length) {\n\t\tremoveEntries(entries.sort(), createFile);\n\t } else {\n\t\tentries = entries.concat(Array.prototype.slice.call(results || [], 0));\n\t\treadEntries();\n\t }\n\t }, errorHandler);\n\t };\n\n\t readEntries(); // Start reading dirs.\n\t // remove old files ------------begin---\n\t}\n\n\tvar requestFileSystem = window.requestFileSystem || window.webkitRequestFileSystem;\n\trequestFileSystem(window.TEMPORARY, 1024*1024, onInitFs, errorHandler);\n}","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, (err) =>\n err ? console.log(err) : console.log(\"README generated!\")\n );\n}","async _writeToOutput() {\n\t\tif (this.output === 'console') {\n\t\t\tconsole.log(JSON.stringify(this.profile));\n\t\t\treturn;\n\t\t}\n\t\tif (!await existsAsync('dist/')) {\n\t\t\tawait mkdirAsync('dist/');\n\t\t}\n\t\tif (this.output === 'yaml') {\n\t\t\treturn writeYamlAsync(`dist/${this.targetUsername}.yml`, this.profile);\n\t\t}\n\t\treturn writeFileAsync(\n\t\t\t\t`dist/${this.targetUsername}.json`,\n\t\t\t\tJSON.stringify(this.profile, null, 2)\n\t\t);\n\t}","function writeToFile(fileName, data) {\nfs.writeFile(`./${fileName}.md`,data, (err) => {\n if (err){\n console.log(err)\n }\n console.log (\"Generating README...\");\n})\n}","create (file,data) {\n fs.open(`${baseDir}/${file}.json`,'wx',(err,identifier)=>{\n if(!err && identifier){\n //Overide default to place objects inside of an array\n //let jsonArray = [];\n\n //jsonArray.push(data);\n\n let stringData = JSON.stringify(data,null,3);\n\n fs.writeFile(identifier,stringData,(err)=>{\n if(!err){\n fs.close(identifier,(err) =>{\n if(!err) console.log('no errors');\n else console.log(err);\n })\n } else console.log(err);\n })\n }\n else console.log(err);\n });\n }","function writeToFile(data) {\n\n /*var fileName = data.Title\n .toUpperCase()\n .split(' ')\n .join('') + '.md';*/\n\n var ReadMe = generate_markdown(data);\n console.log(\"Generating README......\");\n\n fs.writeFile(\"README.md\", ReadMe, function (err) {\n if (err) {\n return console.log(err);\n }\n });\n\n console.log(\"README.md generated!\")\n\n}","function writeToFile(fileName, data) {\n console.log(data);\n fs.writeFile(\"generatedREADME.md\", data, function(err){\n if (err){\n throw err;\n }\n console.log(data)\n })\n}","function FileDestination(options) {\n\tvar defaultOptions = {\n\t\tappend: true,\n\t\tfilename: false,\n\t\tlogTimestamp: false,\n\t\tlogTransactionID: false,\n\t\tlogProcessID: false\n\t};\n\n\t_.defaults(options, defaultOptions);\n\n\tif (!options.filename) {\n\t\tthrow new Error(\"filename is a required option\");\n\t}\n\n\tthis.options = options;\n\n\tvar filemode = options.append ? \"a\" : \"w\";\n\n\tthis.file = fs.openSync(options.filename, filemode);\n}","function writeToFile(fileName, data) {\n\nfs.writeFile(fileName + '.md', data, error => error ? console.error(error): console.log(`${fileName + '.md'} generated!`))\n\n}","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, err => {\n if (err) throw err;\n\n console.log('README has been generated!')\n });\n}","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, err => {\n if (err) {\n throw err;\n } else {\n console.log(\"README created!!! Check current repo for created file\")\n }\n });\n}","function writeToFile(template,fileName) {\n let fileNameProcessed = fileName.replace(/\\s/g, '');\n if(path.extname(fileNameProcessed) !== \".md\") {\n console.log(\"The file extension you entered is not valid. Only .md files are accepted (Ex: README.md). For your convenience, the questions will be presented again in 2 seconds.\");\n setTimeout(()=>{init()},2000);\n } else {\n fs.writeFile(fileNameProcessed, template, function(err) {\n if (err) throw err;\n console.log(`Your new file \"${fileNameProcessed}\" has been created/updated successfully!`);\n });\n }\n}","function createFile() {\n fileName = document.getElementById(\"miiText\").value\n newDir = path.join(FileSystem.currentDirectory, fileName)\n absolutePath = path.resolve(newDir);\n correctedPath = path.normalize(absolutePath);\n errorMessage = document.createElement(\"P\")\n errorMessage.style.position = \"absolute\"\n errorMessage.className = \"errorMessage\"\n errorMessage.id = \"miiErr\"\n document.getElementById(\"buttons\").appendChild(errorMessage)\n try {\n if(fs.existsSync(correctedPath))\n {\n document.getElementById(\"miiErr\").innerHTML = \"File Already Exists\"\n document.getElementById(\"miiPicture\").src = \"MiiBrawlPic.png\"\n }\n else {\n fs.closeSync(fs.openSync(correctedPath, 'a'))\n document.getElementById(\"miiErr\").innerHTML = \"File Successfully Created\"\n document.getElementById(\"miiPicture\").src = \"MiiGunnerPic.png\"\n }\n } catch {\n document.getElementById(\"miiErr\").innerHTML = \"File Could Not Be Created\"\n document.getElementById(\"miiPicture\").src = \"MiiBrawlPic.png\"\n\n }\n}","function writeToFile(fileName, data) {\n fs.writeFile(`./dist/${fileName}`, data, err => {\n if (err) {\n throw err\n };\n console.log('README created!')\n });\n}","function writeToFile(fileName, data) {\n fs.writeFileSync(fileName, data, function(error){\n if(error) throw error;\n console.log(\"file generated\");\n })\n}","function writeOutput(output){\n var now = new Date();\n var file_name = 'files/'+'Employee-table-' + now.getFullYear()+(now.getMonth()+1)+now.getDate()+now.getHours()+now.getMinutes()+now.getSeconds() +'.json';\n fs.writeFile(file_name,output,function(err){\n if(err){\n return console.log(err);\n } \n })\n}","saveContentToFile() {\n const newFileName = this.uuidv4() + \".txt\";\n return this.utility.saveToFile(newFileName, this.fileContent);\n }","function writeFile () {\n\tvar stringified = JSON.stringify(masterObject);\n\t\n\tfs.writeFile(newFilePath, stringified, function (err) {\n\t\tif (err) {console.log(err)};\n\t\tconsole.log(\"finished\");\n\t})\n}","function showFileInfo(file){\n console.log(\"name : \" + file.name);\n console.log(\"size : \" + file.size);\n console.log(\"type : \" + file.type);\n console.log(\"date : \" + file.lastModified);\n }","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, (err) => {\n if (err) {\n return console.log(err);\n }\n console.log('Success! Your file had been generated')\n\n })\n}","function writeToTxt(results, command){\n var resultsFinal = \"\\n\"+command + \"\\n=====================\\n\"+results+\"\\n\";\n fs.appendFile(\"log.txt\", resultsFinal, function(err){\n if (err) {\n console.log(err);\n } else {\n console.log(\"content added to log\");\n }\n \n });\n}","function createXMLFile()\n{\n\tvar currentURLToBeWritten, currentListOfOutGoingLinks = new Array(); \n\t\n\tfor (var i=0; i\n err\n ? console.log(err)\n : console.log(\n `${fileName}.md has been generated in your current directory.`\n )\n );\n}","filename(req, file, callback) {\n // callback(null, `${file.fieldname}-${Date.now()}`);\n callback(null, `${Date.now()}`);\n }","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, (err) =>\n err ? console.log(err): console.log(\"New README file created with success\")\n );\n}","async createFile(name) {\n let normalizedDir = this.fullPath;\n if (normalizedDir.charAt(normalizedDir.length - 1) === path_1.sep) {\n normalizedDir = normalizedDir.slice(0, -1);\n }\n const fd = await util_1.promisify(fs_1.open)(`${normalizedDir}${path_1.sep}${name}`, 'w');\n await util_1.promisify(fs_1.close)(fd);\n this.context.socketService.notifyRefresh(this.path.replace(/\\\\/g, '/').replace(/\\/$/, \"\"));\n return this.context.getHierarchyItem(this.path + name);\n }","function createTeam() {\n const team = render(teamMembers);\n fs.writeFile(outputPath, team , (err) =>\n \n err ? console.log(err) : console.log(\"Success!\"));\n}","function File(info) {\n this.name = info.name;\n this.kind = info.kind;\n this.genre = info.genre;\n this.size = info.size;\n this.last_revision = info.commit_revision;\n this.author = info.commit_author;\n this.last_date = info.commit_date;\n this.id = info.index;\n this.commit_history = {};\n this.comments = [];\n}","function writeToFile(fileName, data) { }","function writeToFile(filetype, data) {\n fs.writeFile(filetype, data, (err) =>\n err ? console.log(err) : console.log('Created your Team Page!')\n )\n}","function writeToFile(fileName, data) {}","function writeToFile(fileName, data) {}","function writeToFile(fileName, data) {}","function writeToFile(fileName, data) {}","function writeToFile(fileName, data) {}","function writeToFile(fileName, data) {}","function writeToFile(fileName, data) {}","function writeToFile(fileName, data) {}","function writeToFile(fileName, data) {}","function writeToFile(fileName, data) {}","function writeToFile(fileName, { title, description, usage, install, contribution, license, testing, github, email }) {\n const codeStyling = \"```\"\n const readme = `# ${title}\n## License\n\n## Description\n${description}\n## Table of Contents\n* [Installation](#installation)\n* [Usage](#usage)\n* [License](#license)\n* [Contributing](#contributing)\n* [Tests](#tests)\n* [Questions](#questions)\n## Installation\nTo install the necessary denpendencies, run the following command:\n${codeStyling}\n${install}\n${codeStyling}\n## Usage\n${usage}\n## Contributing\n${contribution}\n## Tests\n${testing}\n## Questions\nIf you have any questions you can email me at: ${email}\nAlso feel free to check out my GitHub page here: https://github.com/${github}\n`\n\n // console.log('readme: ', readme);\n\n fs.writeFile(fileName, readme, err => {\n if (err) {\n throw err;\n }\n console.log(`Saved`);\n },)\n .catch (err => console.log(err));\n}","static createFile(evt, {path=null, str=\"\"}){\n // must have file path\n if(!path){\n let err = \"No file name provided (path is null).\";\n IpcResponder.respond(evt, \"file-create\", {err});\n return;\n }\n\n // figure file path data from file string \n let fileName = path.split(\"/\").pop();\n let dir = path.split(`/${fileName}`)[0];\n let knownFolder = FolderData.folderPaths.includes(path);\n\n // create the file \n FileUtils.createFile(path, str)\n .then(() => {\n // file created\n IpcResponder.respond(evt, \"file-create\", {dir, fileName, knownFolder});\n\n // update recent files \n FolderData.updateRecentFiles([path]);\n })\n .catch(err => {\n // error\n IpcResponder.respond(evt, \"file-create\", {err: err.message});\n });\n }","createLoggerFile() {\n return new Promise(function (resolve, reject) {\n if (fs.existsSync(fileName)) {\n fs.appendFile(fileName, 'Server Started at ' + new Date()+\"\\r\\n\", function (err) {\n if (err) reject(err);\n resolve();\n });\n }\n else{\n fs.writeFile(fileName, 'Server Started at ' + new Date()+\"\\r\\n\", function (err) {\n if (err) reject(err);\n resolve();\n });\n }\n });\n }","function writeToFile(filename, data){\n fs.writeFile('./dist/README.md',(filename, data), err => {\n if (err){\n console.log(err);\n return\n }\n console.log ('README GENERATED!');\n })\n}","function writeToFile(fileName, data) {\n const badge = license.renderLicenseBadge(data.license);\n const licenseLink = license.renderLicenseLink(data.license);\n\n const readMe = `# ${data.title}\n\n${badge}\n\n## Description\n${data.description}\n\n## Table of Contents\n- [Installation](#installation)\n- [Usage](#usage)\n- [Credits](#credits)\n- [Test](#tests)\n- [License](#license)\n- [Questions](#questions)\n\n## Installations\n${data.installationInstructions}\n\n## Usage\n${data.usageInformation}\n\n## Credits\n${data.contributionGuidlines}\n\n## Tests\n${data.testInstructions}\n\n## License\n[${data.license}](${licenseLink})\n\n## Questions\nIf you have questions, please reach out here:\nGithub: ${data.github}\nEmail: ${data.email}`\n\n fs.writeFile(fileName, readMe, err => err ? console.log(err) : console.log('READme.md successfully created!'));\n}","function createFile(path, content) {\n fs.writeFileSync(path, content, { encoding: \"utf-8\" });\n}","_exportToText() {\n fs.writeFileSync(this.pathTemplate, '', 'utf-8');\n this.records.forEach(submitTime => fs.appendFileSync(this.pathTemplate, `${submitTime}\\n`));\n }","function writeFile(data) {\n fs.appendFile(output, data, err => {\n\t\tif(err) {console.log('error:', err);}\n\t});\n\tconsole.log('END');\n}","createJson(obj) {\n var outputFilename = __dirname+'/mappingOrder.json';\n\n fs.writeFile(outputFilename, JSON.stringify(obj, null, 4), function(err) {\n if(err) {\n console.log(err);\n } else {\n console.log(\"JSON saved to \" + outputFilename);\n }\n });\n }","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, err => {\n if (err) {\n return console.log(err);\n }\n console.log(\"YAY, your README was generated\")\n });\n}","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, (err) => {\n if(err) {\n console.error(err)\n }else {\n console.log(\"README file created successfully\");\n }\n });\n }","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, (err) => {\n if (err) console.log(err);\n console.log(\"Succesfully readme.me created\")\n });\n}","function writeToFile(fileName, data) {\n fs.writeFile(fileName, data, (err) => {\n err ? console.log(err):console.log(\"It successfully created README file!\")\n });\n}","function writeToFile(fileName, data) {\n fs.writeFile(fileName,generateMarkdown(data),err=>{\n if(err) throw err;\n console.log('readme created')\n })\n}","createNewfile(state, options) {\n //Get desired filename\n let name;\n if(options !== undefined && options.name !== undefined)\n name = getDefaultName(options.name);\n else\n name = getDefaultName();\n\n //Insert empty rows to fill up to the desired well count\n state.plate = plates[\"MWP 24\"];\n var values = [];\n for (let i = 0; i < state.plate.wells; i++) {\n values.push([0, 0]);\n }\n\n state.file = {\n substances: [\n { name: \"Water\", color: \"#6699ff\" },\n { name: \"Sample 1\", color: \"#66ff33\" },\n ],\n\n name: name,\n values: values,\n };\n }"],"string":"[\n \"function outputFileCreationInfo(file)\\n{\\n // Add the build information and header to the output file\\n ccdd.writeToFileLn(file, \\\"/* Created : \\\" + ccdd.getDateAndTime() + \\\"\\\\n User : \\\" + ccdd.getUser() + \\\"\\\\n Project : \\\" + ccdd.getProject() + \\\"\\\\n Script : \\\" + ccdd.getScriptName());\\n\\n // Check if any table is associated with the script\\n if (ccdd.getTableNumRows() != 0)\\n {\\n ccdd.writeToFileLn(file, \\\" Table(s): \\\" + [].slice.call(ccdd.getTableNames()).sort().join(\\\",\\\\n \\\"));\\n }\\n\\n // Check if any groups is associated with the script\\n if (ccdd.getAssociatedGroupNames().length != 0)\\n {\\n ccdd.writeToFileLn(file, \\\" Group(s): \\\" + [].slice.call(ccdd.getAssociatedGroupNames()).sort().join(\\\",\\\\n \\\"));\\n }\\n\\n ccdd.writeToFileLn(file, \\\"*/\\\\n\\\");\\n}\",\n \"function fileCreate(fileName, data) {\\n fs.writeFile(fileName, data, err => {\\n if (err) {\\n return console.log(err);\\n }\\n console.log('Your readme has been generated!')\\n});\\n}\",\n \"function makeFile(info) {\\n const { comment, upstream, config } = info\\n return (\\n `// ${comment}\\\\n` +\\n '//\\\\n' +\\n `// Auto-generated by ${packageJson.name}\\\\n` +\\n `// based on rules from ${upstream}\\\\n` +\\n '\\\\n' +\\n '\\\"use strict\\\";\\\\n' +\\n '\\\\n' +\\n `module.exports = ${JSON.stringify(sortJson(config), null, 2)};\\\\n`\\n )\\n}\",\n \"function createFile() {\\n const renderedHTML = render(teamMembers);\\n fs.writeFileSync(outputPath, renderedHTML);\\n}\",\n \"function OutFile() {\\r\\n}\",\n \"function createFile(){\\n if (projectType == \\\"Basic\\\") {\\n internalReference = idAgency + \\\"-\\\" + padToFour(orderNumber) + \\\"-\\\" + padToTwo(version) + \\\"-\\\" + padToTwo(revision);\\n updateListItem(fileId,internalReference,documentType,description,dateCreated,diffusionDate,externalReference,localization,form,status);\\n //Internal Reference as Full\\n } else if (projectType == \\\"Full\\\") {\\n internalReference = documentType + \\\"-\\\" + padToFour(projectCode) + \\\"-\\\" + padToTwo(avenant) + \\\"-\\\" + idAgency + \\\"-\\\" + padToFour(orderNumber) + \\\"-\\\" + padToTwo(version) + \\\"-\\\" + padToTwo(revision);\\n updateListItem(fileId, internalReference, documentType, description, dateCreated, diffusionDate, externalReference, localization, form, status);\\n //Internal Reference as Full Without Project \\n } else {\\n\\n internalReference = documentType + \\\"-\\\" + idAgency + \\\"-\\\" + padToFour(orderNumber) + \\\"-\\\" + padToTwo(version) + \\\"-\\\" + padToTwo(revision);\\n updateListItem(fileId, internalReference, documentType, description, dateCreated, diffusionDate, externalReference, localization, form, status);\\n }\\n }\",\n \"static txt ({ filepath, newFilepath, fileInfo }) {\\n const info = '\\\\n\\\\nFile Info:\\\\n' +\\n Object.keys(fileInfo)\\n .map(k => `${k}: ${fileInfo[k]}`)\\n .join('\\\\n')\\n\\n return fs.readFile(filepath)\\n .then(file => fs.writeFile(newFilepath, file + info))\\n }\",\n \"function createLog(){\\n var a = \\\"log_\\\" + moment().format('YYMMDD-HHmm') + \\\".txt\\\";\\n logName = a;\\n fs.writeFile(a,\\\"Starting Log:\\\\n\\\",(err)=>{\\n if(err) throw(err); \\n });\\n}\",\n \"function createFile() {\\n var message = 'create file randomly',\\n params = {\\n message: message,\\n committer: {\\n name: 'yukihirai0505',\\n email: 'hogehoge@gmail.com'\\n },\\n content: Utilities.base64Encode(message)\\n },\\n data = fetchJson(FILE_URL.replace(FILE_PATH_PLACEHOLDER, getRandomString()), 'PUT', params);\\n Logger.log(data);\\n}\",\n \"create() {\\n this.proc.args.file = null;\\n\\n this.emit('new-file');\\n\\n this.updateWindowTitle();\\n }\",\n \"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}\",\n \"function writeFile(fileEntry, dataObj) {\\n // Create a FileWriter object for our FileEntry (log.txt).\\n fileEntry.createWriter(function (fileWriter) {\\n // If data object is not passed in,\\n // create a new Blob instead.\\n if (!dataObj) {\\n dataObj = new Blob([], { type: 'text/plain' });\\n }\\n fileWriter.write(dataObj);\\n fileWriter.onwriteend = function() {\\n console.log(dataObj);\\n };\\n fileWriter.onerror = function (e) {\\n console.log(\\\"Failed file write: \\\" + e.toString());\\n };\\n });\\n }\",\n \"function writeFile(FPath, info, docName) {\\n if ( $.os.search(/windows/i) !== -1 ) { // Detect line feed type\\n fileLineFeed = \\\"Windows\\\";\\n }\\n else {\\n fileLineFeed = \\\"Macintosh\\\";\\n } \\n try {\\n var f = new File(FPath + \\\"/\\\" + docName + \\\".txt\\\");\\n f.remove();\\n f.open('a');\\n f.lineFeed = fileLineFeed;\\n f.write(info);\\n f.close();\\n }\\n catch(e){}\\n} //end function\",\n \"function writeFile(fileEntry, dataObj) {\\n\\n // Create a FileWriter object for our FileEntry (log.txt).\\n fileEntry.createWriter(function (fileWriter) {\\n\\n // If data object is not passed in,\\n // create a new Blob instead.\\n if (!dataObj) {\\n dataObj = new Blob(['Hello'], { type: 'text/plain' });\\n }\\n\\n fileWriter.write(dataObj);\\n\\n fileWriter.onwriteend = function() {\\n console.log(\\\"Successful file write...\\\");\\n };\\n\\n fileWriter.onerror = function (e) {\\n console.log(\\\"Failed file write: \\\" + e.toString());\\n };\\n\\n });\\n}\",\n \"function createNewFile() {\\n file = {\\n name: 'novo-arquivo.txt',\\n content: '',\\n saved: false,\\n path: app.getPath('documents') + '/novo-arquivo.txt'\\n }\\n\\n mainWindow.webContents.send('set-file', file)\\n}\",\n \"function makeTheFile(name, data){\\n fs.writeFile('README.md', data, (err) => {\\n if (err){\\n console.log(err);\\n }\\n console.log(\\\"README has been successfully generated.\\\")\\n })\\n }\",\n \"createFile() {\\n try {\\n fse.ensureDirSync(this.directory);\\n } catch(e) {\\n if ( e.code != 'EEXIST' ) throw e;\\n }\\n\\n if (!utils.fileExists(this.file)) {\\n fs.writeFileSync(this.file, this.serialize(this.defaultConfig));\\n log.d('Created the default config file in ' + this.file);\\n }\\n }\",\n \"function createFile() {\\r\\n const iterator1 = stories[Symbol.iterator]();\\r\\n var combos = \\\"\\\";\\r\\n for (const item of iterator1) {\\r\\n combos = combos + item[0] + '\\\\n' + splitConstant + '\\\\n' + item[1] + '\\\\n' + splitConstant + '\\\\n';\\r\\n }\\r\\n var text = combos;\\r\\n var filename = 'stories.txt';\\r\\n var element = document.createElement('a');\\r\\n element.setAttribute('href', 'data:text/plain;charset=utf-8,' + encodeURIComponent(text));\\r\\n element.setAttribute('download', filename);\\r\\n element.style.display = 'none';\\r\\n document.body.appendChild(element);\\r\\n element.click();\\r\\n document.body.removeChild(element);\\r\\n}\",\n \"function writeToFile(fileName, createFile) {\\n fs.writeFile(fileName, createFile, function (err) {\\n if (err) {\\n console.log(err);\\n }\\n console.log(\\\"Your README.md is created!\\\");\\n });\\n}\",\n \"function generateOutputFile(channel, member) {\\n const fileName = `recordings/${channelid}-${member.username}-${Date.now()}.pcm`;\\n console.log(fileName);\\n return fs.createWriteStream(fileName);\\n}\",\n \"function createFile(filePath, fileName, content) {\\n fs.writeFile(filePath, content, function(err) {\\n if (err) {\\n return console.log(err);\\n }\\n console.log(`${fileName} was saved!`);\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n\\n fs.appendFile(\\n fileName, \\n generateMarkdown(data) ,\\n function(err) {\\n if(err) {\\n return console.log(err);\\n }\\n \\n console.log(\\\"Your README file is created successfully!\\\");\\n })\\n\\n fs.appendFile(\\n fileName, \\n generateLicense(data) ,\\n function(err) {\\n if(err) {\\n return console.log(err);\\n }\\n \\n console.log(\\\"Your README file is created successfully!\\\");\\n })\\n\\n \\n\\n \\n}\",\n \"function writeFile(fileEntry, dataObj) {\\n // Create a FileWriter object for our FileEntry (log.txt).\\n fileEntry.createWriter(function (fileWriter) {\\n\\n fileWriter.onwriteend = function() {\\n console.log(\\\"Successful file write...\\\"+fileEntry.name);\\n\\t\\t\\t//alert(\\\"Successful file write...\\\"+fileEntry.name);\\n\\t\\t\\treturn true;\\n };\\n\\n fileWriter.onerror = function(e) {\\n console.log(\\\"Failed file write: \\\" + e.toString());\\n\\t\\t\\t//alert(\\\"Failed file write: \\\" + e.toString());\\n\\t\\t\\treturn false;\\n };\\n\\n // If data object is not passed in, dont continue\\n if (!dataObj) {\\n\\t\\t\\tconsole.log(\\\"writeFile() failed, no dataObj passed\\\");\\n return false;\\n }\\n\\n fileWriter.write(dataObj);\\n });\\n}\",\n \"function writeFile(name) {\\n const ext = path.extname(name).substr(1);\\n let data = config.headers[ext].join(\\\"\\\\n\\\");\\n\\n data += \\\"\\\\n\\\";\\n if (config.endWithBlankline) {\\n data += \\\"\\\\n\\\";\\n }\\n\\n fs.writeFile(name, data, err => {\\n if (!err && config.setExecutable) {\\n fs.chmod(name, \\\"755\\\", err => {\\n if (!err && config.symlink.create) {\\n createSymlink(name);\\n }\\n });\\n }\\n });\\n }\",\n \"open() {\\n this.close()\\n\\n const file = path.normalize(this._filename)\\n const opts = {\\n flags: this._append ? 'a' : 'w',\\n encoding: 'utf8',\\n }\\n\\n ensureDirectoryExistence(file)\\n this._writer = fs.createWriteStream(file, opts)\\n }\",\n \"function writeToFile(filetype, data) {\\n fs.writeFile(filetype, data, (err) =>\\n err ? console.log(err) : console.log('Created your README!')\\n )\\n}\",\n \"function createTxtErrorFile(fileErrorString, rootFldr, numFiles, fileAction) {\\n\\n // various file strings\\n var arrowEnd = \\\"\\\\n\\\";\\n var header_searchRoot = \\\"\\\\n\\\\n< --- ROOT SEARCH PATH --- >\\\\n\\\";\\n var header_AIFiles = \\\"\\\\n\\\\n< --- AI FILE PATHS --- >\\\\n\\\";\\n var dateHeader = \\\"< --- CREATED ON --- >\\\\n\\\" + new Date() + \\\"\\\\n\\\" + \\\"\\\\n\\\";\\n \\n // creates file\\n if(fileAction == \\\"create\\\"){\\n // extracts folder location \\n var reg = /[^\\\\\\\\]+$/g; //last folder sting in full path\\n var folderLocation = rootFldr.fsName.match(reg).toString().replace(/( +)/, \\\"\\\");\\n \\n // create a text file to store all the file and artboard data\\n file_errorsInFile = File(rootFldr + '/' + 'log_errorFiles_' + folderLocation + '.txt');\\n file_errorsInFile.open(\\\"w\\\");\\n file_errorsInFile.write(dateHeader); // writes date header string to file\\n \\n file_errorsInFile.write(header_searchRoot + rootFldr +\\\"\\\\n\\\" + arrowEnd); \\n file_errorsInFile.write(header_AIFiles);\\n } // end of create action\\n \\n // write errors to file\\n if(fileAction == \\\"write\\\"){\\n file_errorsInFile.writeln(fileErrorString);\\n }// end of write action\\n\\n // close file\\n if(fileAction == \\\"close\\\"){ \\n file_errorsInFile.write(\\n arrowEnd +\\n \\\"\\\\n\\\\n< --- PROCESS DATA --- >\\\"\\n + \\\"\\\\n\\\" + \\\"Total number of files that failed check = \\\" + numFiles\\n + \\\"\\\\n\\\" + arrowEnd);\\n file_errorsInFile.close();\\n } // end of close action\\n}\",\n \"function writeFile() {\\n let overwrite = JSON.stringify(notes);\\n fs.writeFile(outputPath, overwrite, function(err) {\\n if (err) {\\n console.log(err);\\n } else {\\n console.log(\\\"File written\\\");\\n }\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n // Project Title\\n fs.writeFileSync(fileName, \\\"# \\\" + data.projectTitle + '\\\\n\\\\n');\\n\\n // Badge\\n fs.appendFileSync(fileName, '![' + data.projectTitle + ']' + '(https://img.shields.io/github/repo-size/' + data.username + '/' + data.repoName + ')\\\\n\\\\n');\\n\\n // Table of Contents\\n fs.appendFileSync(fileName, \\\"## Table of Contents\\\" + '\\\\n\\\\n' + \\\"* \\\" + data.tableOfContents.split(\\\" \\\").join(\\\"\\\\n* \\\") + '\\\\n\\\\n');\\n\\n // Description\\n fs.appendFileSync(fileName, \\\"## Description\\\" + '\\\\n\\\\n' + data.description + '\\\\n\\\\n');\\n\\n // Installation\\n fs.appendFileSync(fileName, \\\"## Installation\\\" + '\\\\n\\\\n' + data.installation + '\\\\n\\\\n');\\n\\n // Usage\\n fs.appendFileSync(fileName, \\\"## Usage\\\" + '\\\\n\\\\n' + data.usage + '\\\\n\\\\n');\\n\\n // License\\n fs.appendFileSync(fileName, \\\"## License\\\" + '\\\\n\\\\n' + data.license + '\\\\n\\\\n');\\n\\n // Contributing\\n fs.appendFileSync(fileName, \\\"## Contributing\\\" + '\\\\n\\\\n' + data.contributing + '\\\\n\\\\n');\\n\\n // Tests\\n fs.appendFileSync(fileName, \\\"## Tests\\\" + '\\\\n\\\\n' + data.tests + '\\\\n\\\\n');\\n\\n // Contact (Profile Picture and E-mail)\\n fs.appendFileSync(fileName, \\\"## Contact\\\" + '\\\\n\\\\n' + '\\\\n\\\\nE-mail: ' + data.questionsEmail);\\n\\n console.log(\\\"Success!\\\");\\n\\n}\",\n \"function createFile(fullPathToFile, newFilePath, newFileName, newFileParentPath, timestamp, markAsPermanentlyNotRelevant) {\\n\\n //if this should be ignored due to the st-ignore.json file\\n if(!ignoreThisFileOrDir(newFilePath)) {\\n \\n //create an id for this file\\n var newFileId = \\\"fileId-\\\" + branchId + \\\"_\\\" + autoGeneratedFileId;\\n \\n //get the id ready for the next file/dir\\n autoGeneratedFileId++;\\n\\n //create a new file object\\n var newFile = {\\n id: newFileId,\\n parentId: getIdFromDirPath(newFileParentPath),\\n currentName: newFileName,\\n isDeleted: false\\n };\\n\\n //add the file to the object of all files\\n allFiles[newFileId] = newFile;\\n\\n //make a connection between the file path and an id \\n addFilePathToIdMap(newFilePath, newFileId);\\n \\n //create a new empty 2D array to hold insert events for the default file\\n allInsertEventsByFile[newFileId] = [];\\n\\n //create a new file event\\n var createFileEvent = {\\n id: \\\"ev_\\\" + branchId + \\\"_\\\" + autoGeneratedEventId, \\n timestamp: timestamp,\\n type: \\\"Create File\\\",\\n initialName: newFileName,\\n fileId: newFileId,\\n parentDirectoryId: newFile.parentId,\\n createdByDevGroupId: currentDeveloperGroup.id\\n };\\n \\n //increase the id so the next event has a unique id\\n autoGeneratedEventId++;\\n \\n //if the user wants to mark this file as NOT relevant (because it is an existing file\\n //that is being reconciled in a new project)\\n if(markAsPermanentlyNotRelevant === true) {\\n\\n //pre-mark the event as not even possible to become relevant\\n createFileEvent.permanentRelevance = \\\"never relevant\\\";\\n }\\n\\n //add the event to the collection of all events\\n codeEvents.push(createFileEvent);\\n\\n //occassionally a new file has something in it, for example, if a tool has generated the file\\n //if the file has anything in it, take the contents and make them events in the system\\n\\n //open the file and read the text\\n var fileText = fs.readFileSync(fullPathToFile, \\\"utf8\\\");\\n \\n //if there is anything in the new file\\n if(fileText !== \\\"\\\") {\\n\\n //add the text into \\n insertText(newFilePath, fileText, 0, 0, false, [], new Date().getTime(), markAsPermanentlyNotRelevant);\\n }\\n }\\t \\n}\",\n \"createFile(path) {\\n touch.sync(path.absolute);\\n }\",\n \"function save_text(file_name,info_text) {\\nif (!file_name) {save_text_count++; file_name = 'text' + save_text_count.toString() + '.txt';}\\nvar fs = require('fs'); fs.write(file_name, info_text, 'w');}\",\n \"function writeFile() {\\n const ERR_MESS_WRITE = \\\"TODO: Trouble writing file\\\";\\n\\n todocl.dbx.filesUpload({\\n contents: todocl.todoText,\\n path: todocl.path,\\n mode: 'overwrite',\\n autorename: false,\\n mute: true\\n }).then(function (response) {\\n\\n }).catch(function (error) {\\n todocl.dbx.accessToken = null;\\n todocl.out.innerHTML = ERR_MESS_WRITE;\\n });\\n }\",\n \"writeToFile () {\\n let data = this.ghostToJson();\\n\\n fs.writeFileSync(this.ghostFileOutput, data, 'utf8');\\n console.log( logSuccess('Ghost JSON generated successfully!') );\\n }\",\n \"function writeToFile(fileName, data) { \\n // console.log(\\\"Inside function\\\", fileName);\\n fs.writeFile(fileName, data, function (err) {\\n if (err) return console.log(err);\\n console.log(`Generated ${fileName} succesfully !!`);\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(\\\"./Generator/\\\"+fileName, data, function(err) {\\n if (err) {\\n return console.log(err);\\n }\\n console.log (\\\"Successfully wrote: \\\" + fileName);\\n })\\n \\n}\",\n \"function generateFile (requests, options) {\\n\\t var options = options || {};\\n\\t var EOL = options.eol || \\\"\\\\r\\\\n\\\";\\n\\t var plateNumber = options.plateNumber || 1;\\n\\t var textFile = [];\\n\\n\\t for (var request of requests) {\\n\\t var holder=getHolder(request.position, plateNumber);\\n\\t var experimentNumber=getExperimentNumber(request.position);\\n\\t if (options.deleteExistingHolder) {\\n\\t textFile.push(\\\"USER \\\"+request.user);\\n\\t textFile.push(\\\"HOLDER \\\"+holder);\\n\\t textFile.push(\\\"DELETE\\\"); // this is required to delete already existing entries\\n\\t }\\n\\t textFile.push(\\\"USER \\\"+request.user);\\n\\t textFile.push(\\\"HOLDER \\\"+holder);\\n\\t if (! options.autosubmit) textFile.push(\\\"NO_SUBMIT\\\");\\n\\t textFile.push(\\\"NAME \\\"+request.name);\\n\\t textFile.push(\\\"TITLE \\\"+request.title);\\n\\t for (var experiment of request.experiments) {\\n\\t textFile.push(\\\"EXPNO \\\"+experimentNumber++);\\n\\t textFile.push(\\\"SOLVENT \\\"+experiment.solvent);\\n\\t textFile.push(\\\"EXPERIMENT \\\"+experiment.experiment);\\n\\t if (experiment.parameters && experiment.parameters.length>0) {\\n\\t var parameters=[];\\n\\t for (var parameter of experiment.parameters) {\\n\\t parameters.push(parameter.label, parameter.value);\\n\\t }\\n\\t textFile.push(\\\"PARAMETERS \\\"+parameters.join(','));\\n\\t }\\n\\t }\\n\\t textFile.push(\\\"\\\");\\n\\t }\\n\\t return textFile.join(EOL);\\n\\t}\",\n \"function createHtmlFile(html) {\\n\\t// write HTML file into the dist folder\\n\\tfs.writeFile('dist/index.html', `${html}`, (err) => {\\n\\t\\terr ? console.log(err) : console.log('Your HTML Document Was Successfully Generated!');\\n\\t});\\n}\",\n \"function writeToFile( data) {\\n fs.writeFile(\\\"./generated-files/README.md\\\",generateMarkdown(data), err =>{\\n if(err){\\n throw err;\\n }\\n console.log(\\\"file generated!\\\")\\n })\\n}\",\n \"function createFile(filename, content) {\\n if (existsSync(filename)) return console.log(filename + ' already exists - exiting');\\n const data = new Uint8Array(Buffer.from(content));\\n writeFile(filename, data, (err) => {\\n if (err) throw err;\\n console.log(filename + ' created.');\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, (err) => \\n err ? console.error(err) : console.log('README created!'))\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFileSync('./generated/'+fileName, generateMarkdown(data), error => {\\n console.log(\\\"Generating README\\\");\\n if (error) throw error;\\n console.log(\\\"README generated.\\\");\\n });\\n \\n}\",\n \"function createFileWriter(fileEntry, callbackFunction) {\\n\\tfileEntry.createWriter(callbackFunction, fail);\\n}\",\n \"function writeToFile(fileName, userInput) {\\n fs.writeFile(`` + fileName, generatesite(userInput), function (err) {\\n if (err) {\\n return console.log(err);\\n }\\n\\n console.log(\\\"Generating HTML...\\\");\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n console.log(\\\"writeToFile: Filename is \\\" + fileName);\\n console.log(\\\"writeToFile: data is \\\" + data);\\n fs.writeFile(fileName, data, function(err){\\n if (err) {\\n throw err;\\n };\\n console.log(\\\"The README was created successfully\\\");\\n})\\n }\",\n \"function outputToFile(filename, content, callback) {\\n\\tfunction errorHandler(e) {\\n\\t var msg = '';\\n\\n\\t switch (e.code) {\\n\\t case FileError.QUOTA_EXCEEDED_ERR:\\n\\t msg = 'QUOTA_EXCEEDED_ERR';\\n\\t break;\\n\\t case FileError.NOT_FOUND_ERR:\\n\\t msg = 'NOT_FOUND_ERR';\\n\\t break;\\n\\t case FileError.SECURITY_ERR:\\n\\t msg = 'SECURITY_ERR';\\n\\t break;\\n\\t case FileError.INVALID_MODIFICATION_ERR:\\n\\t msg = 'INVALID_MODIFICATION_ERR';\\n\\t break;\\n\\t case FileError.INVALID_STATE_ERR:\\n\\t msg = 'INVALID_STATE_ERR';\\n\\t break;\\n\\t default:\\n\\t msg = 'Unknown Error';\\n\\t break;\\n\\t };\\n\\n\\t console.log('Error: ' + msg);\\n\\t}\\n\\tfunction onInitFs(fs) {\\n\\t\\t//funcs\\n\\t\\tfunction removeEntries(entries, nextstep) {\\n\\t\\t\\tentries.forEach(function(entry, i) {\\n\\t\\t\\t\\tentry.remove(function(){}, function(e){console.log(e);});\\n\\t\\t\\t});\\n\\t\\t\\tnextstep.call();\\n\\t\\t}\\n\\n\\t\\tfunction createFile() {\\n\\t\\t\\t fs.root.getFile(filename, {create: true}, function(fileEntry) {\\n\\n\\t\\t\\t // Create a FileWriter object for our FileEntry (log.txt).\\n\\t\\t\\t fileEntry.createWriter(function(fileWriter) {\\n\\n\\t\\t\\t fileWriter.onwriteend = function(e) {\\n\\t\\t\\t\\tconsole.log('Write completed.');\\n\\t\\t\\t\\tcallback(fileEntry.toURL());\\n\\t\\t\\t };\\n\\n\\t\\t\\t fileWriter.onerror = function(e) {\\n\\t\\t\\t\\tconsole.log('Write failed: ' + e.toString());\\n\\t\\t\\t\\tcallback(false, e);\\n\\t\\t\\t };\\n\\n\\t\\t\\t // Create a new Blob and write it to file.\\n\\t\\t\\t var BlobBuilder = window.BlobBuilder || window.WebKitBlobBuilder;\\t\\n\\t\\t\\t var bb = new BlobBuilder(); // Note: window.WebKitBlobBuilder in Chrome 12.\\n\\t\\t\\t bb.append(content);\\n\\t\\t\\t fileWriter.write(bb.getBlob('text/plain'));\\n\\n\\t\\t\\t }, errorHandler);\\n\\n\\t\\t\\t }, errorHandler);\\n\\t\\t}\\n\\n\\t // remove old files ------------begin---\\n\\n\\t var dirReader = fs.root.createReader();\\n\\t var entries = [];\\n\\n\\t // Call the reader.readEntries() until no more results are returned.\\n\\t var readEntries = function() {\\n\\t dirReader.readEntries (function(results) {\\n\\t if (!results.length) {\\n\\t\\tremoveEntries(entries.sort(), createFile);\\n\\t } else {\\n\\t\\tentries = entries.concat(Array.prototype.slice.call(results || [], 0));\\n\\t\\treadEntries();\\n\\t }\\n\\t }, errorHandler);\\n\\t };\\n\\n\\t readEntries(); // Start reading dirs.\\n\\t // remove old files ------------begin---\\n\\t}\\n\\n\\tvar requestFileSystem = window.requestFileSystem || window.webkitRequestFileSystem;\\n\\trequestFileSystem(window.TEMPORARY, 1024*1024, onInitFs, errorHandler);\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, (err) =>\\n err ? console.log(err) : console.log(\\\"README generated!\\\")\\n );\\n}\",\n \"async _writeToOutput() {\\n\\t\\tif (this.output === 'console') {\\n\\t\\t\\tconsole.log(JSON.stringify(this.profile));\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif (!await existsAsync('dist/')) {\\n\\t\\t\\tawait mkdirAsync('dist/');\\n\\t\\t}\\n\\t\\tif (this.output === 'yaml') {\\n\\t\\t\\treturn writeYamlAsync(`dist/${this.targetUsername}.yml`, this.profile);\\n\\t\\t}\\n\\t\\treturn writeFileAsync(\\n\\t\\t\\t\\t`dist/${this.targetUsername}.json`,\\n\\t\\t\\t\\tJSON.stringify(this.profile, null, 2)\\n\\t\\t);\\n\\t}\",\n \"function writeToFile(fileName, data) {\\nfs.writeFile(`./${fileName}.md`,data, (err) => {\\n if (err){\\n console.log(err)\\n }\\n console.log (\\\"Generating README...\\\");\\n})\\n}\",\n \"create (file,data) {\\n fs.open(`${baseDir}/${file}.json`,'wx',(err,identifier)=>{\\n if(!err && identifier){\\n //Overide default to place objects inside of an array\\n //let jsonArray = [];\\n\\n //jsonArray.push(data);\\n\\n let stringData = JSON.stringify(data,null,3);\\n\\n fs.writeFile(identifier,stringData,(err)=>{\\n if(!err){\\n fs.close(identifier,(err) =>{\\n if(!err) console.log('no errors');\\n else console.log(err);\\n })\\n } else console.log(err);\\n })\\n }\\n else console.log(err);\\n });\\n }\",\n \"function writeToFile(data) {\\n\\n /*var fileName = data.Title\\n .toUpperCase()\\n .split(' ')\\n .join('') + '.md';*/\\n\\n var ReadMe = generate_markdown(data);\\n console.log(\\\"Generating README......\\\");\\n\\n fs.writeFile(\\\"README.md\\\", ReadMe, function (err) {\\n if (err) {\\n return console.log(err);\\n }\\n });\\n\\n console.log(\\\"README.md generated!\\\")\\n\\n}\",\n \"function writeToFile(fileName, data) {\\n console.log(data);\\n fs.writeFile(\\\"generatedREADME.md\\\", data, function(err){\\n if (err){\\n throw err;\\n }\\n console.log(data)\\n })\\n}\",\n \"function FileDestination(options) {\\n\\tvar defaultOptions = {\\n\\t\\tappend: true,\\n\\t\\tfilename: false,\\n\\t\\tlogTimestamp: false,\\n\\t\\tlogTransactionID: false,\\n\\t\\tlogProcessID: false\\n\\t};\\n\\n\\t_.defaults(options, defaultOptions);\\n\\n\\tif (!options.filename) {\\n\\t\\tthrow new Error(\\\"filename is a required option\\\");\\n\\t}\\n\\n\\tthis.options = options;\\n\\n\\tvar filemode = options.append ? \\\"a\\\" : \\\"w\\\";\\n\\n\\tthis.file = fs.openSync(options.filename, filemode);\\n}\",\n \"function writeToFile(fileName, data) {\\n\\nfs.writeFile(fileName + '.md', data, error => error ? console.error(error): console.log(`${fileName + '.md'} generated!`))\\n\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, err => {\\n if (err) throw err;\\n\\n console.log('README has been generated!')\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, err => {\\n if (err) {\\n throw err;\\n } else {\\n console.log(\\\"README created!!! Check current repo for created file\\\")\\n }\\n });\\n}\",\n \"function writeToFile(template,fileName) {\\n let fileNameProcessed = fileName.replace(/\\\\s/g, '');\\n if(path.extname(fileNameProcessed) !== \\\".md\\\") {\\n console.log(\\\"The file extension you entered is not valid. Only .md files are accepted (Ex: README.md). For your convenience, the questions will be presented again in 2 seconds.\\\");\\n setTimeout(()=>{init()},2000);\\n } else {\\n fs.writeFile(fileNameProcessed, template, function(err) {\\n if (err) throw err;\\n console.log(`Your new file \\\"${fileNameProcessed}\\\" has been created/updated successfully!`);\\n });\\n }\\n}\",\n \"function createFile() {\\n fileName = document.getElementById(\\\"miiText\\\").value\\n newDir = path.join(FileSystem.currentDirectory, fileName)\\n absolutePath = path.resolve(newDir);\\n correctedPath = path.normalize(absolutePath);\\n errorMessage = document.createElement(\\\"P\\\")\\n errorMessage.style.position = \\\"absolute\\\"\\n errorMessage.className = \\\"errorMessage\\\"\\n errorMessage.id = \\\"miiErr\\\"\\n document.getElementById(\\\"buttons\\\").appendChild(errorMessage)\\n try {\\n if(fs.existsSync(correctedPath))\\n {\\n document.getElementById(\\\"miiErr\\\").innerHTML = \\\"File Already Exists\\\"\\n document.getElementById(\\\"miiPicture\\\").src = \\\"MiiBrawlPic.png\\\"\\n }\\n else {\\n fs.closeSync(fs.openSync(correctedPath, 'a'))\\n document.getElementById(\\\"miiErr\\\").innerHTML = \\\"File Successfully Created\\\"\\n document.getElementById(\\\"miiPicture\\\").src = \\\"MiiGunnerPic.png\\\"\\n }\\n } catch {\\n document.getElementById(\\\"miiErr\\\").innerHTML = \\\"File Could Not Be Created\\\"\\n document.getElementById(\\\"miiPicture\\\").src = \\\"MiiBrawlPic.png\\\"\\n\\n }\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(`./dist/${fileName}`, data, err => {\\n if (err) {\\n throw err\\n };\\n console.log('README created!')\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFileSync(fileName, data, function(error){\\n if(error) throw error;\\n console.log(\\\"file generated\\\");\\n })\\n}\",\n \"function writeOutput(output){\\n var now = new Date();\\n var file_name = 'files/'+'Employee-table-' + now.getFullYear()+(now.getMonth()+1)+now.getDate()+now.getHours()+now.getMinutes()+now.getSeconds() +'.json';\\n fs.writeFile(file_name,output,function(err){\\n if(err){\\n return console.log(err);\\n } \\n })\\n}\",\n \"saveContentToFile() {\\n const newFileName = this.uuidv4() + \\\".txt\\\";\\n return this.utility.saveToFile(newFileName, this.fileContent);\\n }\",\n \"function writeFile () {\\n\\tvar stringified = JSON.stringify(masterObject);\\n\\t\\n\\tfs.writeFile(newFilePath, stringified, function (err) {\\n\\t\\tif (err) {console.log(err)};\\n\\t\\tconsole.log(\\\"finished\\\");\\n\\t})\\n}\",\n \"function showFileInfo(file){\\n console.log(\\\"name : \\\" + file.name);\\n console.log(\\\"size : \\\" + file.size);\\n console.log(\\\"type : \\\" + file.type);\\n console.log(\\\"date : \\\" + file.lastModified);\\n }\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, (err) => {\\n if (err) {\\n return console.log(err);\\n }\\n console.log('Success! Your file had been generated')\\n\\n })\\n}\",\n \"function writeToTxt(results, command){\\n var resultsFinal = \\\"\\\\n\\\"+command + \\\"\\\\n=====================\\\\n\\\"+results+\\\"\\\\n\\\";\\n fs.appendFile(\\\"log.txt\\\", resultsFinal, function(err){\\n if (err) {\\n console.log(err);\\n } else {\\n console.log(\\\"content added to log\\\");\\n }\\n \\n });\\n}\",\n \"function createXMLFile()\\n{\\n\\tvar currentURLToBeWritten, currentListOfOutGoingLinks = new Array(); \\n\\t\\n\\tfor (var i=0; i\\n err\\n ? console.log(err)\\n : console.log(\\n `${fileName}.md has been generated in your current directory.`\\n )\\n );\\n}\",\n \"filename(req, file, callback) {\\n // callback(null, `${file.fieldname}-${Date.now()}`);\\n callback(null, `${Date.now()}`);\\n }\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, (err) =>\\n err ? console.log(err): console.log(\\\"New README file created with success\\\")\\n );\\n}\",\n \"async createFile(name) {\\n let normalizedDir = this.fullPath;\\n if (normalizedDir.charAt(normalizedDir.length - 1) === path_1.sep) {\\n normalizedDir = normalizedDir.slice(0, -1);\\n }\\n const fd = await util_1.promisify(fs_1.open)(`${normalizedDir}${path_1.sep}${name}`, 'w');\\n await util_1.promisify(fs_1.close)(fd);\\n this.context.socketService.notifyRefresh(this.path.replace(/\\\\\\\\/g, '/').replace(/\\\\/$/, \\\"\\\"));\\n return this.context.getHierarchyItem(this.path + name);\\n }\",\n \"function createTeam() {\\n const team = render(teamMembers);\\n fs.writeFile(outputPath, team , (err) =>\\n \\n err ? console.log(err) : console.log(\\\"Success!\\\"));\\n}\",\n \"function File(info) {\\n this.name = info.name;\\n this.kind = info.kind;\\n this.genre = info.genre;\\n this.size = info.size;\\n this.last_revision = info.commit_revision;\\n this.author = info.commit_author;\\n this.last_date = info.commit_date;\\n this.id = info.index;\\n this.commit_history = {};\\n this.comments = [];\\n}\",\n \"function writeToFile(fileName, data) { }\",\n \"function writeToFile(filetype, data) {\\n fs.writeFile(filetype, data, (err) =>\\n err ? console.log(err) : console.log('Created your Team Page!')\\n )\\n}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, data) {}\",\n \"function writeToFile(fileName, { title, description, usage, install, contribution, license, testing, github, email }) {\\n const codeStyling = \\\"```\\\"\\n const readme = `# ${title}\\n## License\\n\\n## Description\\n${description}\\n## Table of Contents\\n* [Installation](#installation)\\n* [Usage](#usage)\\n* [License](#license)\\n* [Contributing](#contributing)\\n* [Tests](#tests)\\n* [Questions](#questions)\\n## Installation\\nTo install the necessary denpendencies, run the following command:\\n${codeStyling}\\n${install}\\n${codeStyling}\\n## Usage\\n${usage}\\n## Contributing\\n${contribution}\\n## Tests\\n${testing}\\n## Questions\\nIf you have any questions you can email me at: ${email}\\nAlso feel free to check out my GitHub page here: https://github.com/${github}\\n`\\n\\n // console.log('readme: ', readme);\\n\\n fs.writeFile(fileName, readme, err => {\\n if (err) {\\n throw err;\\n }\\n console.log(`Saved`);\\n },)\\n .catch (err => console.log(err));\\n}\",\n \"static createFile(evt, {path=null, str=\\\"\\\"}){\\n // must have file path\\n if(!path){\\n let err = \\\"No file name provided (path is null).\\\";\\n IpcResponder.respond(evt, \\\"file-create\\\", {err});\\n return;\\n }\\n\\n // figure file path data from file string \\n let fileName = path.split(\\\"/\\\").pop();\\n let dir = path.split(`/${fileName}`)[0];\\n let knownFolder = FolderData.folderPaths.includes(path);\\n\\n // create the file \\n FileUtils.createFile(path, str)\\n .then(() => {\\n // file created\\n IpcResponder.respond(evt, \\\"file-create\\\", {dir, fileName, knownFolder});\\n\\n // update recent files \\n FolderData.updateRecentFiles([path]);\\n })\\n .catch(err => {\\n // error\\n IpcResponder.respond(evt, \\\"file-create\\\", {err: err.message});\\n });\\n }\",\n \"createLoggerFile() {\\n return new Promise(function (resolve, reject) {\\n if (fs.existsSync(fileName)) {\\n fs.appendFile(fileName, 'Server Started at ' + new Date()+\\\"\\\\r\\\\n\\\", function (err) {\\n if (err) reject(err);\\n resolve();\\n });\\n }\\n else{\\n fs.writeFile(fileName, 'Server Started at ' + new Date()+\\\"\\\\r\\\\n\\\", function (err) {\\n if (err) reject(err);\\n resolve();\\n });\\n }\\n });\\n }\",\n \"function writeToFile(filename, data){\\n fs.writeFile('./dist/README.md',(filename, data), err => {\\n if (err){\\n console.log(err);\\n return\\n }\\n console.log ('README GENERATED!');\\n })\\n}\",\n \"function writeToFile(fileName, data) {\\n const badge = license.renderLicenseBadge(data.license);\\n const licenseLink = license.renderLicenseLink(data.license);\\n\\n const readMe = `# ${data.title}\\n\\n${badge}\\n\\n## Description\\n${data.description}\\n\\n## Table of Contents\\n- [Installation](#installation)\\n- [Usage](#usage)\\n- [Credits](#credits)\\n- [Test](#tests)\\n- [License](#license)\\n- [Questions](#questions)\\n\\n## Installations\\n${data.installationInstructions}\\n\\n## Usage\\n${data.usageInformation}\\n\\n## Credits\\n${data.contributionGuidlines}\\n\\n## Tests\\n${data.testInstructions}\\n\\n## License\\n[${data.license}](${licenseLink})\\n\\n## Questions\\nIf you have questions, please reach out here:\\nGithub: ${data.github}\\nEmail: ${data.email}`\\n\\n fs.writeFile(fileName, readMe, err => err ? console.log(err) : console.log('READme.md successfully created!'));\\n}\",\n \"function createFile(path, content) {\\n fs.writeFileSync(path, content, { encoding: \\\"utf-8\\\" });\\n}\",\n \"_exportToText() {\\n fs.writeFileSync(this.pathTemplate, '', 'utf-8');\\n this.records.forEach(submitTime => fs.appendFileSync(this.pathTemplate, `${submitTime}\\\\n`));\\n }\",\n \"function writeFile(data) {\\n fs.appendFile(output, data, err => {\\n\\t\\tif(err) {console.log('error:', err);}\\n\\t});\\n\\tconsole.log('END');\\n}\",\n \"createJson(obj) {\\n var outputFilename = __dirname+'/mappingOrder.json';\\n\\n fs.writeFile(outputFilename, JSON.stringify(obj, null, 4), function(err) {\\n if(err) {\\n console.log(err);\\n } else {\\n console.log(\\\"JSON saved to \\\" + outputFilename);\\n }\\n });\\n }\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, err => {\\n if (err) {\\n return console.log(err);\\n }\\n console.log(\\\"YAY, your README was generated\\\")\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, (err) => {\\n if(err) {\\n console.error(err)\\n }else {\\n console.log(\\\"README file created successfully\\\");\\n }\\n });\\n }\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, (err) => {\\n if (err) console.log(err);\\n console.log(\\\"Succesfully readme.me created\\\")\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName, data, (err) => {\\n err ? console.log(err):console.log(\\\"It successfully created README file!\\\")\\n });\\n}\",\n \"function writeToFile(fileName, data) {\\n fs.writeFile(fileName,generateMarkdown(data),err=>{\\n if(err) throw err;\\n console.log('readme created')\\n })\\n}\",\n \"createNewfile(state, options) {\\n //Get desired filename\\n let name;\\n if(options !== undefined && options.name !== undefined)\\n name = getDefaultName(options.name);\\n else\\n name = getDefaultName();\\n\\n //Insert empty rows to fill up to the desired well count\\n state.plate = plates[\\\"MWP 24\\\"];\\n var values = [];\\n for (let i = 0; i < state.plate.wells; i++) {\\n values.push([0, 0]);\\n }\\n\\n state.file = {\\n substances: [\\n { name: \\\"Water\\\", color: \\\"#6699ff\\\" },\\n { name: \\\"Sample 1\\\", color: \\\"#66ff33\\\" },\\n ],\\n\\n name: name,\\n values: values,\\n };\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.7589007","0.6463051","0.6254441","0.6184719","0.6148196","0.6126077","0.611571","0.6045737","0.5959177","0.594336","0.5943259","0.58981055","0.5860408","0.5773959","0.5757392","0.57503754","0.5746891","0.5734899","0.573418","0.57076967","0.56968117","0.5690214","0.5660781","0.5613361","0.5583049","0.5571607","0.55711263","0.5551983","0.5550108","0.5544855","0.5542229","0.55386657","0.5503491","0.54901004","0.54763186","0.5474182","0.5454456","0.54408056","0.54081345","0.53891855","0.53845924","0.5378129","0.53641015","0.53637344","0.5361505","0.5347349","0.53449816","0.5338158","0.53142196","0.53100365","0.53056026","0.530546","0.5301372","0.5289239","0.5283041","0.5282935","0.52820003","0.5275167","0.5274769","0.52643615","0.526127","0.5261201","0.5258869","0.52530587","0.52491486","0.52478075","0.5246116","0.52439404","0.524036","0.52389085","0.5235822","0.5235056","0.52350146","0.52311933","0.5231106","0.52297825","0.52297825","0.52297825","0.52297825","0.52297825","0.52297825","0.52297825","0.52297825","0.52297825","0.52297825","0.52284396","0.5226169","0.52092224","0.52049965","0.5201829","0.5200858","0.5197238","0.51888746","0.518884","0.5187823","0.5186791","0.51820624","0.51787764","0.51762563","0.51755226"],"string":"[\n \"0.7589007\",\n \"0.6463051\",\n \"0.6254441\",\n \"0.6184719\",\n \"0.6148196\",\n \"0.6126077\",\n \"0.611571\",\n \"0.6045737\",\n \"0.5959177\",\n \"0.594336\",\n \"0.5943259\",\n \"0.58981055\",\n \"0.5860408\",\n \"0.5773959\",\n \"0.5757392\",\n \"0.57503754\",\n \"0.5746891\",\n \"0.5734899\",\n \"0.573418\",\n \"0.57076967\",\n \"0.56968117\",\n \"0.5690214\",\n \"0.5660781\",\n \"0.5613361\",\n \"0.5583049\",\n \"0.5571607\",\n \"0.55711263\",\n \"0.5551983\",\n \"0.5550108\",\n \"0.5544855\",\n \"0.5542229\",\n \"0.55386657\",\n \"0.5503491\",\n \"0.54901004\",\n \"0.54763186\",\n \"0.5474182\",\n \"0.5454456\",\n \"0.54408056\",\n \"0.54081345\",\n \"0.53891855\",\n \"0.53845924\",\n \"0.5378129\",\n \"0.53641015\",\n \"0.53637344\",\n \"0.5361505\",\n \"0.5347349\",\n \"0.53449816\",\n \"0.5338158\",\n \"0.53142196\",\n \"0.53100365\",\n \"0.53056026\",\n \"0.530546\",\n \"0.5301372\",\n \"0.5289239\",\n \"0.5283041\",\n \"0.5282935\",\n \"0.52820003\",\n \"0.5275167\",\n \"0.5274769\",\n \"0.52643615\",\n \"0.526127\",\n \"0.5261201\",\n \"0.5258869\",\n \"0.52530587\",\n \"0.52491486\",\n \"0.52478075\",\n \"0.5246116\",\n \"0.52439404\",\n \"0.524036\",\n \"0.52389085\",\n \"0.5235822\",\n \"0.5235056\",\n \"0.52350146\",\n \"0.52311933\",\n \"0.5231106\",\n \"0.52297825\",\n \"0.52297825\",\n \"0.52297825\",\n \"0.52297825\",\n \"0.52297825\",\n \"0.52297825\",\n \"0.52297825\",\n \"0.52297825\",\n \"0.52297825\",\n \"0.52297825\",\n \"0.52284396\",\n \"0.5226169\",\n \"0.52092224\",\n \"0.52049965\",\n \"0.5201829\",\n \"0.5200858\",\n \"0.5197238\",\n \"0.51888746\",\n \"0.518884\",\n \"0.5187823\",\n \"0.5186791\",\n \"0.51820624\",\n \"0.51787764\",\n \"0.51762563\",\n \"0.51755226\"\n]"},"document_score":{"kind":"string","value":"0.76575094"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":3074,"cells":{"query":{"kind":"string","value":"Determine if the row containing the specified variable is not an array definition. A row in a table is an array definition if a value is present in the Array Size column but the variable name does not end with a ']'"},"document":{"kind":"string","value":"function isVariable(variableName, arraySize)\n{\n // Only output non-array variables or array members (i.e., skip array\n // definitions)\n return variableName != null && arraySize != null && (arraySize.isEmpty() || variableName.endsWith(\"]\"));\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 arrayLike (data) {\n return assigned(data) && greaterOrEqual(data.length, 0);\n }","function typeIsArray(instance_var) {\n return getType(instance_var).includes(\"[]\") || getName(instance_var).includes(\"[]\");\n}","function isDataArray(x) {\n return Array.isArray(x);\n}","function isDataArray(x) {\n return Array.isArray(x);\n}","function isDataArray(x) {\n return Array.isArray(x);\n}","function arr_isArray(array){\n\t\treturn array != null\n\t\t\t&& typeof array.length === 'number'\n\t\t\t&& typeof array.splice === 'function';\n\t}","function validArray(A) {\n if (A) {\n return A.constructor === Array;\n }\n return false;\n}","function nonEmptyArray (data) {\n return array(data) && greater(data.length, 0);\n }","function isArrayElement(arraySize)\n{\n return arraySize != null && !arraySize.isEmpty();\n}","function isArray(e){return e!=null&&typeof e==\"object\"&&typeof e.length==\"number\"&&(e.length==0||defined(e[0]))}","function isArray (type) {\n\t return type.lastIndexOf(']') === type.length - 1\n\t}","function isDataArray(val, key) {\n\t\n\t var containers = ['annotations', 'shapes', 'range', 'domain', 'buttons'],\n\t isNotAContainer = containers.indexOf(key) === -1;\n\t\n\t return Array.isArray(val) && isNotAContainer;\n\t}","function isVBArray(x) \r\n{\r\n\ttry{\r\n\t\tx.lbound();\r\n\t} catch (e) {\r\n\t\treturn false;\r\n\t}\r\n\treturn true;\r\n}","static is_data_array_ok(data){\n return this.is_1d_array(data) ||\n this.is_2d_array(data) ||\n this.is_3d_array(data) ||\n this.is_heat_map_suitable_data(data)\n }","function isArray (type) {\n return type.lastIndexOf(']') === type.length - 1\n}","function isArray (type) {\n return type.lastIndexOf(']') === type.length - 1\n}","function isArray (type) {\n return type.lastIndexOf(']') === type.length - 1\n}","function BOT_isArray(x) {\r\n\tif( typeof(x) == \"object\") return (x.constructor.toString().indexOf(\"Array\") != -1);\r\n\telse return false;\r\n}","function is(arr){\n return typeof(arr) == \"object\" && arr.length >= 0;\n }","function isFieldArray(fieldName) {\n return fieldName.indexOf(\"/\") != -1;\n }","function isArray(testMesh) {\n return testMesh && !(testMesh.propertyIsEnumerable('length')) && typeof testMesh === 'object' && typeof testMesh.length === 'number';\n}","function IsLiteralArray(aTransform)\n{\n var retval = aTransform.constructor == Array;\n \n return retval\n}","function isArrayish (arr) {\n return /Array\\]$/.test(Object.prototype.toString.call(arr))\n}","function yellIsArray(testObject) {\n return testObject && !(testObject.propertyIsEnumerable('length'))\n && typeof testObject === 'object'\n && typeof testObject.length === 'number';\n}","function IsArray(val) {\n return Object.prototype.toString.call(val) == Object.prototype.toString.call([]);\n }","function is_array(input) {\n if (Object.prototype.toString.call(input) === \"[object Array]\") {\n return true;\n }\n return false;\n}","function array_test(x) {\n if (Array.isArray === undefined) {\n return x instanceof Array;\n } else {\n return Array.isArray(x);\n }\n}","function array_test(x) {\n if (Array.isArray === undefined) {\n return x instanceof Array;\n } else {\n return Array.isArray(x);\n }\n}","function isArrayish(arr) {\n return (/Array\\]$/.test(Object.prototype.toString.call(arr))\n );\n}","function isArray(a) {\r\n// This is not working, so testing if the length member is not undefined\r\n// return isObject(a) && a.constructor == Array;\r\n return isObject(a) && !isUndefined(a.length);\r\n}","function is2DArray(s) {\n var pattern = /type\\s=\\s.*\\s[[0-9]*][[0-9]*]/;\n return pattern.test(s);\n}","function isArrayLiteral(token, lastToken) {\n if (token.type.label != \"[\") {\n return false;\n }\n if (!lastToken) {\n return true;\n }\n if (lastToken.type.isAssign) {\n return true;\n }\n return !!PRE_ARRAY_LITERAL_TOKENS[\n lastToken.type.keyword || lastToken.type.label\n ];\n }","function IsItArray (cheetah){\n if (Array.isArray(cheetah) === true) {\n return 'It\\'s an array!'\n } else {\n return 'It\\'s not an array'\n }\n}","function likeArray(obj) {\n return obj && typeof obj === \"object\" && typeof obj.length === \"number\";\n }","function isArray(obj){return(typeof(obj.length)==\"undefined\")?false:true;}","function isArray (arr) {\n if (typeof arr === \"undefined\")\n {\n return false;\n } else if (arr === null) {\n return false;\n } else {\n return arr.constructor === Array;\n }\n}","function is_array(x)\r\n{\r\n return Array.isArray(x) ;\r\n}","is_array(val) {\n return Array.isArray(val);\n }","function isArray(a) {\n return (!!a) && (a.constructor === Array);\n}","function isArray(a) {\n return (!!a) && (a.constructor === Array);\n}","function checkArray(variable)\n{\n if (inputArray[0] === `0` && typeof inputArray[1] === `undefined`)\n {\n variable = 1;\n }\n\n return variable;\n}","function isArray(array)\n{\n\treturn !!(array && array.constructor == Array);\n}","function isArray(variable) {\n return Array.isArray(variable);\n}","function vt(t) {\n return !!t && \"arrayValue\" in t;\n}","_validateValueArrayDimensions() {\n const that = this;\n let dimensions = 0,\n tempArray = that.value,\n emptyArray = false;\n\n while (tempArray.constructor === Array) {\n dimensions++;\n tempArray = tempArray[0];\n\n if (tempArray === undefined) {\n emptyArray = true;\n break;\n }\n }\n\n if (that.dimensions > dimensions) {\n if (emptyArray) {\n that.value = that._returnEmptyArray();\n return;\n }\n\n while (that.dimensions > dimensions) {\n that._addDimensionToJSArray(dimensions);\n dimensions++;\n }\n }\n }","function isDefined(element, index, array){\n return (element !== undefined || element !=='\\n' || element !=='\\r\\n');\n }","function isArray(s) {\n var pattern = /type\\s=\\s.*\\s[[0-9]*]/;\n return pattern.test(s);\n}","function rowHasMultiple9s(arr) {\n\n}","function arrayIsValid(_array_) {\n return _array_ && Array.isArray(_array_) && _array_.length > 0;\n}","function isArray(a) {\n return isDefined(a) && !isString(a) && !isFunction(a) && isNumber(a.length);\n }","function X(t) {\n return !!t && \"arrayValue\" in t;\n}","function isAry(o) {\n\t\treturn typeof (o) == \"array\" || (isObj(o) && o != null && \"length\" in o && o.length > 0);\n\t}","function isArray(val){return(val instanceof Array);}","function isArrayLike (x) {\n\t return x != null && typeof x.length === 'number' && typeof x !== 'function'\n\t}","function Nt(t) {\n return !!t && \"arrayValue\" in t;\n}","function unemptyArray (a) {\n\t return low.isArray(a) && a.length > 0\n\t}","function arrayNotEmpty(array) {\n return array instanceof Array && array.length > 0;\n}","function isArray(a) {\r\n\treturn (a && a.constructor == Array);\r\n }","validateArraySize (req, array) {\n const FREEMIUM_INPUT_SIZE = 20\n const PRO_INPUT_SIZE = 20\n\n if (req.locals && req.locals.proLimit) {\n if (array.length <= PRO_INPUT_SIZE) return true\n } else if (array.length <= FREEMIUM_INPUT_SIZE) {\n return true\n }\n\n return false\n }","function isArray(a) {\n return (a && a.constructor == Array);\n}","function isArrayLike (x) {\n return x != null && typeof x.length === 'number' && typeof x !== 'function'\n}","function mt(t) {\n return !!t && \"arrayValue\" in t;\n}","get hasValues() {\n return this.arrayWidth > 0 && this.arrayHeight > 0;\n }","function baseIsTypedArray(value) {\n return (0, isObject_1.isObjectLike)(value) && (0, isLength_1.default)(value.length) && typedArrayTags[(0, baseGetTag_1.default)(value)];\n}","function hasArrayNature(obj) {\n return (\n // not null/false\n !!obj &&\n // arrays are objects, NodeLists are functions in Safari\n (typeof obj == 'object' || typeof obj == 'function') &&\n // quacks like an array\n ('length' in obj) &&\n // not window\n !('setInterval' in obj) &&\n // no DOM node should be considered an array-like\n // a 'select' element has 'length' and 'item' properties\n (typeof obj.nodeType != 'number') &&\n (\n // a real array\n (Array.isArray(obj) ||\n // arguments\n ('callee' in obj) || // HTMLCollection/NodeList\n 'item' in obj)\n )\n );\n}","function checkTypes(arr) {\n var y = true\n var x = typeof arr[0][0]\n for(var i = 0; i 0 ) {\n if ( parms ) {\n valid = ( parms.length == replaceableParms.length );\n }\n } else {\n valid = ( parms == null || parms.length == 0 );\n }\n return valid;\n }","function isArray(input) {\n\t return Object.prototype.toString.call(input) === '[object Array]';\n\t }","function isArray(input) {\n\t return Object.prototype.toString.call(input) === '[object Array]';\n\t }","function isArray(value) {\n if (value.startsWith('(')) {\n var tokens = value.split(\",\");\n if ((tokens.length < 4) || (tokens.length % 2 !== 0)) {\n return false;\n }\n var pos = 0;\n while (pos < tokens.length) {\n var val1 = tokens[pos].trim().substring(1).trim()\n if (isNaN(parseFloat(val1))) {\n return false;\n }\n var val2 = tokens[pos + 1].trim();\n val2 = val2.substring(0, val2.length - 1);\n if (isNaN(parseFloat(val2))) {\n return false;\n }\n pos += 2;\n }\n } else {\n var tokens = value.split(\",\");\n if (tokens.length < 2) {\n return false;\n }\n for (var i = 0; i < tokens.length; i++) {\n if (isNaN(parseFloat(tokens[i]))) {\n return false;\n }\n }\n }\n return true;\n}","isArray(value) {\n return value && typeof value === 'object' && value.constructor === Array;\n }","function in_array(variable, theArray)\n{\n\treturn $.inArray(variable, theArray) != -1;\n}","function isBytesArray(bytes) {\n return bytes.byteLength === 20;\n}","function w$(e){return Array.isArray(e)}","function arrayInArray(testArray,containerArray){\n var inArray=false;\n for(var i=0;i= 0);\n assert(maxLength >= minLength);\n return (Array.isArray(x) && x.length >= minLength && x.length <= maxLength &&\n x.every(function (e) { return typeof e === expectedType; }));\n}","function checkArrayTypeAndLength(x, expectedType, minLength, maxLength) {\n if (minLength === void 0) { minLength = 0; }\n if (maxLength === void 0) { maxLength = Infinity; }\n assert(minLength >= 0);\n assert(maxLength >= minLength);\n return (Array.isArray(x) && x.length >= minLength && x.length <= maxLength &&\n x.every(function (e) { return typeof e === expectedType; }));\n}","function isArray1D(a) {\n return !isArrayOrTypedArray(a[0]);\n}","function isArray(that_thing) {\n if(Object.prototype.toString.call( that_thing ) === \"[object Array]\") {\n return true;\n } else {\n return false;\n }\n }"],"string":"[\n \"function arrayLike (data) {\\n return assigned(data) && greaterOrEqual(data.length, 0);\\n }\",\n \"function typeIsArray(instance_var) {\\n return getType(instance_var).includes(\\\"[]\\\") || getName(instance_var).includes(\\\"[]\\\");\\n}\",\n \"function isDataArray(x) {\\n return Array.isArray(x);\\n}\",\n \"function isDataArray(x) {\\n return Array.isArray(x);\\n}\",\n \"function isDataArray(x) {\\n return Array.isArray(x);\\n}\",\n \"function arr_isArray(array){\\n\\t\\treturn array != null\\n\\t\\t\\t&& typeof array.length === 'number'\\n\\t\\t\\t&& typeof array.splice === 'function';\\n\\t}\",\n \"function validArray(A) {\\n if (A) {\\n return A.constructor === Array;\\n }\\n return false;\\n}\",\n \"function nonEmptyArray (data) {\\n return array(data) && greater(data.length, 0);\\n }\",\n \"function isArrayElement(arraySize)\\n{\\n return arraySize != null && !arraySize.isEmpty();\\n}\",\n \"function isArray(e){return e!=null&&typeof e==\\\"object\\\"&&typeof e.length==\\\"number\\\"&&(e.length==0||defined(e[0]))}\",\n \"function isArray (type) {\\n\\t return type.lastIndexOf(']') === type.length - 1\\n\\t}\",\n \"function isDataArray(val, key) {\\n\\t\\n\\t var containers = ['annotations', 'shapes', 'range', 'domain', 'buttons'],\\n\\t isNotAContainer = containers.indexOf(key) === -1;\\n\\t\\n\\t return Array.isArray(val) && isNotAContainer;\\n\\t}\",\n \"function isVBArray(x) \\r\\n{\\r\\n\\ttry{\\r\\n\\t\\tx.lbound();\\r\\n\\t} catch (e) {\\r\\n\\t\\treturn false;\\r\\n\\t}\\r\\n\\treturn true;\\r\\n}\",\n \"static is_data_array_ok(data){\\n return this.is_1d_array(data) ||\\n this.is_2d_array(data) ||\\n this.is_3d_array(data) ||\\n this.is_heat_map_suitable_data(data)\\n }\",\n \"function isArray (type) {\\n return type.lastIndexOf(']') === type.length - 1\\n}\",\n \"function isArray (type) {\\n return type.lastIndexOf(']') === type.length - 1\\n}\",\n \"function isArray (type) {\\n return type.lastIndexOf(']') === type.length - 1\\n}\",\n \"function BOT_isArray(x) {\\r\\n\\tif( typeof(x) == \\\"object\\\") return (x.constructor.toString().indexOf(\\\"Array\\\") != -1);\\r\\n\\telse return false;\\r\\n}\",\n \"function is(arr){\\n return typeof(arr) == \\\"object\\\" && arr.length >= 0;\\n }\",\n \"function isFieldArray(fieldName) {\\n return fieldName.indexOf(\\\"/\\\") != -1;\\n }\",\n \"function isArray(testMesh) {\\n return testMesh && !(testMesh.propertyIsEnumerable('length')) && typeof testMesh === 'object' && typeof testMesh.length === 'number';\\n}\",\n \"function IsLiteralArray(aTransform)\\n{\\n var retval = aTransform.constructor == Array;\\n \\n return retval\\n}\",\n \"function isArrayish (arr) {\\n return /Array\\\\]$/.test(Object.prototype.toString.call(arr))\\n}\",\n \"function yellIsArray(testObject) {\\n return testObject && !(testObject.propertyIsEnumerable('length'))\\n && typeof testObject === 'object'\\n && typeof testObject.length === 'number';\\n}\",\n \"function IsArray(val) {\\n return Object.prototype.toString.call(val) == Object.prototype.toString.call([]);\\n }\",\n \"function is_array(input) {\\n if (Object.prototype.toString.call(input) === \\\"[object Array]\\\") {\\n return true;\\n }\\n return false;\\n}\",\n \"function array_test(x) {\\n if (Array.isArray === undefined) {\\n return x instanceof Array;\\n } else {\\n return Array.isArray(x);\\n }\\n}\",\n \"function array_test(x) {\\n if (Array.isArray === undefined) {\\n return x instanceof Array;\\n } else {\\n return Array.isArray(x);\\n }\\n}\",\n \"function isArrayish(arr) {\\n return (/Array\\\\]$/.test(Object.prototype.toString.call(arr))\\n );\\n}\",\n \"function isArray(a) {\\r\\n// This is not working, so testing if the length member is not undefined\\r\\n// return isObject(a) && a.constructor == Array;\\r\\n return isObject(a) && !isUndefined(a.length);\\r\\n}\",\n \"function is2DArray(s) {\\n var pattern = /type\\\\s=\\\\s.*\\\\s[[0-9]*][[0-9]*]/;\\n return pattern.test(s);\\n}\",\n \"function isArrayLiteral(token, lastToken) {\\n if (token.type.label != \\\"[\\\") {\\n return false;\\n }\\n if (!lastToken) {\\n return true;\\n }\\n if (lastToken.type.isAssign) {\\n return true;\\n }\\n return !!PRE_ARRAY_LITERAL_TOKENS[\\n lastToken.type.keyword || lastToken.type.label\\n ];\\n }\",\n \"function IsItArray (cheetah){\\n if (Array.isArray(cheetah) === true) {\\n return 'It\\\\'s an array!'\\n } else {\\n return 'It\\\\'s not an array'\\n }\\n}\",\n \"function likeArray(obj) {\\n return obj && typeof obj === \\\"object\\\" && typeof obj.length === \\\"number\\\";\\n }\",\n \"function isArray(obj){return(typeof(obj.length)==\\\"undefined\\\")?false:true;}\",\n \"function isArray (arr) {\\n if (typeof arr === \\\"undefined\\\")\\n {\\n return false;\\n } else if (arr === null) {\\n return false;\\n } else {\\n return arr.constructor === Array;\\n }\\n}\",\n \"function is_array(x)\\r\\n{\\r\\n return Array.isArray(x) ;\\r\\n}\",\n \"is_array(val) {\\n return Array.isArray(val);\\n }\",\n \"function isArray(a) {\\n return (!!a) && (a.constructor === Array);\\n}\",\n \"function isArray(a) {\\n return (!!a) && (a.constructor === Array);\\n}\",\n \"function checkArray(variable)\\n{\\n if (inputArray[0] === `0` && typeof inputArray[1] === `undefined`)\\n {\\n variable = 1;\\n }\\n\\n return variable;\\n}\",\n \"function isArray(array)\\n{\\n\\treturn !!(array && array.constructor == Array);\\n}\",\n \"function isArray(variable) {\\n return Array.isArray(variable);\\n}\",\n \"function vt(t) {\\n return !!t && \\\"arrayValue\\\" in t;\\n}\",\n \"_validateValueArrayDimensions() {\\n const that = this;\\n let dimensions = 0,\\n tempArray = that.value,\\n emptyArray = false;\\n\\n while (tempArray.constructor === Array) {\\n dimensions++;\\n tempArray = tempArray[0];\\n\\n if (tempArray === undefined) {\\n emptyArray = true;\\n break;\\n }\\n }\\n\\n if (that.dimensions > dimensions) {\\n if (emptyArray) {\\n that.value = that._returnEmptyArray();\\n return;\\n }\\n\\n while (that.dimensions > dimensions) {\\n that._addDimensionToJSArray(dimensions);\\n dimensions++;\\n }\\n }\\n }\",\n \"function isDefined(element, index, array){\\n return (element !== undefined || element !=='\\\\n' || element !=='\\\\r\\\\n');\\n }\",\n \"function isArray(s) {\\n var pattern = /type\\\\s=\\\\s.*\\\\s[[0-9]*]/;\\n return pattern.test(s);\\n}\",\n \"function rowHasMultiple9s(arr) {\\n\\n}\",\n \"function arrayIsValid(_array_) {\\n return _array_ && Array.isArray(_array_) && _array_.length > 0;\\n}\",\n \"function isArray(a) {\\n return isDefined(a) && !isString(a) && !isFunction(a) && isNumber(a.length);\\n }\",\n \"function X(t) {\\n return !!t && \\\"arrayValue\\\" in t;\\n}\",\n \"function isAry(o) {\\n\\t\\treturn typeof (o) == \\\"array\\\" || (isObj(o) && o != null && \\\"length\\\" in o && o.length > 0);\\n\\t}\",\n \"function isArray(val){return(val instanceof Array);}\",\n \"function isArrayLike (x) {\\n\\t return x != null && typeof x.length === 'number' && typeof x !== 'function'\\n\\t}\",\n \"function Nt(t) {\\n return !!t && \\\"arrayValue\\\" in t;\\n}\",\n \"function unemptyArray (a) {\\n\\t return low.isArray(a) && a.length > 0\\n\\t}\",\n \"function arrayNotEmpty(array) {\\n return array instanceof Array && array.length > 0;\\n}\",\n \"function isArray(a) {\\r\\n\\treturn (a && a.constructor == Array);\\r\\n }\",\n \"validateArraySize (req, array) {\\n const FREEMIUM_INPUT_SIZE = 20\\n const PRO_INPUT_SIZE = 20\\n\\n if (req.locals && req.locals.proLimit) {\\n if (array.length <= PRO_INPUT_SIZE) return true\\n } else if (array.length <= FREEMIUM_INPUT_SIZE) {\\n return true\\n }\\n\\n return false\\n }\",\n \"function isArray(a) {\\n return (a && a.constructor == Array);\\n}\",\n \"function isArrayLike (x) {\\n return x != null && typeof x.length === 'number' && typeof x !== 'function'\\n}\",\n \"function mt(t) {\\n return !!t && \\\"arrayValue\\\" in t;\\n}\",\n \"get hasValues() {\\n return this.arrayWidth > 0 && this.arrayHeight > 0;\\n }\",\n \"function baseIsTypedArray(value) {\\n return (0, isObject_1.isObjectLike)(value) && (0, isLength_1.default)(value.length) && typedArrayTags[(0, baseGetTag_1.default)(value)];\\n}\",\n \"function hasArrayNature(obj) {\\n return (\\n // not null/false\\n !!obj &&\\n // arrays are objects, NodeLists are functions in Safari\\n (typeof obj == 'object' || typeof obj == 'function') &&\\n // quacks like an array\\n ('length' in obj) &&\\n // not window\\n !('setInterval' in obj) &&\\n // no DOM node should be considered an array-like\\n // a 'select' element has 'length' and 'item' properties\\n (typeof obj.nodeType != 'number') &&\\n (\\n // a real array\\n (Array.isArray(obj) ||\\n // arguments\\n ('callee' in obj) || // HTMLCollection/NodeList\\n 'item' in obj)\\n )\\n );\\n}\",\n \"function checkTypes(arr) {\\n var y = true\\n var x = typeof arr[0][0]\\n for(var i = 0; i 0 ) {\\n if ( parms ) {\\n valid = ( parms.length == replaceableParms.length );\\n }\\n } else {\\n valid = ( parms == null || parms.length == 0 );\\n }\\n return valid;\\n }\",\n \"function isArray(input) {\\n\\t return Object.prototype.toString.call(input) === '[object Array]';\\n\\t }\",\n \"function isArray(input) {\\n\\t return Object.prototype.toString.call(input) === '[object Array]';\\n\\t }\",\n \"function isArray(value) {\\n if (value.startsWith('(')) {\\n var tokens = value.split(\\\",\\\");\\n if ((tokens.length < 4) || (tokens.length % 2 !== 0)) {\\n return false;\\n }\\n var pos = 0;\\n while (pos < tokens.length) {\\n var val1 = tokens[pos].trim().substring(1).trim()\\n if (isNaN(parseFloat(val1))) {\\n return false;\\n }\\n var val2 = tokens[pos + 1].trim();\\n val2 = val2.substring(0, val2.length - 1);\\n if (isNaN(parseFloat(val2))) {\\n return false;\\n }\\n pos += 2;\\n }\\n } else {\\n var tokens = value.split(\\\",\\\");\\n if (tokens.length < 2) {\\n return false;\\n }\\n for (var i = 0; i < tokens.length; i++) {\\n if (isNaN(parseFloat(tokens[i]))) {\\n return false;\\n }\\n }\\n }\\n return true;\\n}\",\n \"isArray(value) {\\n return value && typeof value === 'object' && value.constructor === Array;\\n }\",\n \"function in_array(variable, theArray)\\n{\\n\\treturn $.inArray(variable, theArray) != -1;\\n}\",\n \"function isBytesArray(bytes) {\\n return bytes.byteLength === 20;\\n}\",\n \"function w$(e){return Array.isArray(e)}\",\n \"function arrayInArray(testArray,containerArray){\\n var inArray=false;\\n for(var i=0;i= 0);\\n assert(maxLength >= minLength);\\n return (Array.isArray(x) && x.length >= minLength && x.length <= maxLength &&\\n x.every(function (e) { return typeof e === expectedType; }));\\n}\",\n \"function checkArrayTypeAndLength(x, expectedType, minLength, maxLength) {\\n if (minLength === void 0) { minLength = 0; }\\n if (maxLength === void 0) { maxLength = Infinity; }\\n assert(minLength >= 0);\\n assert(maxLength >= minLength);\\n return (Array.isArray(x) && x.length >= minLength && x.length <= maxLength &&\\n x.every(function (e) { return typeof e === expectedType; }));\\n}\",\n \"function isArray1D(a) {\\n return !isArrayOrTypedArray(a[0]);\\n}\",\n \"function isArray(that_thing) {\\n if(Object.prototype.toString.call( that_thing ) === \\\"[object Array]\\\") {\\n return true;\\n } else {\\n return false;\\n }\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.62658256","0.6088386","0.6051291","0.6051291","0.6051291","0.60416573","0.6009855","0.59947145","0.59820694","0.59604335","0.59486055","0.5947597","0.5918841","0.59055036","0.588324","0.588324","0.588324","0.58347255","0.58346623","0.579784","0.577385","0.5748727","0.573058","0.57257545","0.57036567","0.5703327","0.5690478","0.5690478","0.56726557","0.5654048","0.56431973","0.5628427","0.5605553","0.5603744","0.55957425","0.5591044","0.5587815","0.55787444","0.5562354","0.5562354","0.555799","0.5545998","0.5539018","0.55384606","0.55359036","0.55313194","0.55260974","0.55108994","0.5509541","0.5494253","0.54921883","0.54721886","0.5471187","0.5456556","0.54544115","0.54321206","0.542234","0.5421543","0.54045373","0.54017055","0.5401192","0.5396742","0.5384692","0.5384009","0.537826","0.5373898","0.5370963","0.5370963","0.5369947","0.53688663","0.53661704","0.53661704","0.5363615","0.53621125","0.5360454","0.53592205","0.5357922","0.53561395","0.5350868","0.5345122","0.5340832","0.5338045","0.53373224","0.53367424","0.5331265","0.53279966","0.53234196","0.5312119","0.5302678","0.5302678","0.52909744","0.5280291","0.52741146","0.5270796","0.52694994","0.5264313","0.5264249","0.5264249","0.5263924","0.5259572"],"string":"[\n \"0.62658256\",\n \"0.6088386\",\n \"0.6051291\",\n \"0.6051291\",\n \"0.6051291\",\n \"0.60416573\",\n \"0.6009855\",\n \"0.59947145\",\n \"0.59820694\",\n \"0.59604335\",\n \"0.59486055\",\n \"0.5947597\",\n \"0.5918841\",\n \"0.59055036\",\n \"0.588324\",\n \"0.588324\",\n \"0.588324\",\n \"0.58347255\",\n \"0.58346623\",\n \"0.579784\",\n \"0.577385\",\n \"0.5748727\",\n \"0.573058\",\n \"0.57257545\",\n \"0.57036567\",\n \"0.5703327\",\n \"0.5690478\",\n \"0.5690478\",\n \"0.56726557\",\n \"0.5654048\",\n \"0.56431973\",\n \"0.5628427\",\n \"0.5605553\",\n \"0.5603744\",\n \"0.55957425\",\n \"0.5591044\",\n \"0.5587815\",\n \"0.55787444\",\n \"0.5562354\",\n \"0.5562354\",\n \"0.555799\",\n \"0.5545998\",\n \"0.5539018\",\n \"0.55384606\",\n \"0.55359036\",\n \"0.55313194\",\n \"0.55260974\",\n \"0.55108994\",\n \"0.5509541\",\n \"0.5494253\",\n \"0.54921883\",\n \"0.54721886\",\n \"0.5471187\",\n \"0.5456556\",\n \"0.54544115\",\n \"0.54321206\",\n \"0.542234\",\n \"0.5421543\",\n \"0.54045373\",\n \"0.54017055\",\n \"0.5401192\",\n \"0.5396742\",\n \"0.5384692\",\n \"0.5384009\",\n \"0.537826\",\n \"0.5373898\",\n \"0.5370963\",\n \"0.5370963\",\n \"0.5369947\",\n \"0.53688663\",\n \"0.53661704\",\n \"0.53661704\",\n \"0.5363615\",\n \"0.53621125\",\n \"0.5360454\",\n \"0.53592205\",\n \"0.5357922\",\n \"0.53561395\",\n \"0.5350868\",\n \"0.5345122\",\n \"0.5340832\",\n \"0.5338045\",\n \"0.53373224\",\n \"0.53367424\",\n \"0.5331265\",\n \"0.53279966\",\n \"0.53234196\",\n \"0.5312119\",\n \"0.5302678\",\n \"0.5302678\",\n \"0.52909744\",\n \"0.5280291\",\n \"0.52741146\",\n \"0.5270796\",\n \"0.52694994\",\n \"0.5264313\",\n \"0.5264249\",\n \"0.5264249\",\n \"0.5263924\",\n \"0.5259572\"\n]"},"document_score":{"kind":"string","value":"0.6629437"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":3075,"cells":{"query":{"kind":"string","value":"Convert an array member variable name by replacing left square brackets with underscores and removing right square brackets (example: a[2] becomes a_2)"},"document":{"kind":"string","value":"function convertArrayMember(variableName)\n{\n return variableName.replaceAll(\"[\\\\[]\", \"_\").replaceAll(\"[\\\\]]\", \"\");\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 underscore (name) {\n return varname.split(name).join('_');\n}","function underscore (name) {\n return varname.split(name).join('_');\n}","function normalize_dataset_name(name) { // 214\n\treturn name.replace(/[\\]\\[\\.]/g, '_'); // 215\n} // 216","function cleanFieldName_v1(name) {\n return name.replace(/[^A-Za-z0-9]+/g, '_');\n }","function fixIdentifier(name) {\n return name.replace(/[\\[\\]]/g, '');\n }","function cleanFieldName(name) {\n return name.replace(/[-\\s]+/g, '_');\n }","function filterFieldName(temp) {\r\n\ttemp = trim(temp);\r\n\ttemp = temp.toLowerCase();\r\n\ttemp = temp.replace(/[^a-z0-9]/ig,\"_\");\r\n\ttemp = temp.replace(/[_]+/g,\"_\");\r\n\twhile (temp.length > 0 && (temp.charAt(0) == \"_\" || temp.charAt(0)*1 == temp.charAt(0))) {\r\n\t\ttemp = temp.substr(1,temp.length);\r\n\t}\r\n\twhile (temp.length > 0 && temp.charAt(temp.length-1) == \"_\") { \r\n\t\ttemp = temp.substr(0,temp.length-1);\r\n\t}\r\n\treturn temp;\r\n}","function normalizeAttributeName( attributeName ) {\n\t\tattributeName = attributeName.replace( rDataAttrPrefix, \"\" );\n\n\t\t//if subscription involve with more than one events, you can\n\t\t//concatenate them with \"_\", here we need to revert them back\n\t\t//such as \"$click_mouseover\" need to be changed to \"$click mouseover\"\n\t\tif (attributeName.startsWith( \"!\" ) || attributeName.startsWith( \"$\" )) {\n\n\t\t\tattributeName = attributeName.replace( reUnderscore, \" \" );\n\n\t\t}\n\t\treturn attributeName.replace( reAttrDash, replaceAttrDashWithCapitalCharacter );\n\t}","function normalizeName(name) {\n s = name;\n var pos = 0;\n while (true)\n {\n pos = s.search(' ');\n if (pos === -1) return s;\n else s = s.replace(' ','_');\n }\n}","function mungePropertyName(name, prefix) {\n\t\tif (!prefix) {\n\t\t\treturn name;\n\t\t}\n\n\t\tvar parts = name.split(\".\");\n\t\tvar result = \"\";\n\t\tfor (var i = 0; i < parts.length - 1; i++) {\n\t\t\tresult += parts[i] + \".\";\n\t\t}\n\t\tvar lastPart = parts[parts.length - 1];\n\t\tif (prefixRequiresNextInitialCap(prefix)) {\n\t\t\tresult += prefix + lastPart.substring(0, 1).toUpperCase() + lastPart.substring(1);\n\t\t} else {\n\t\t\tresult += prefix + lastPart;\n\t\t}\n\t\treturn result;\n\t}","function beautifyString(mname) {\n\n mname = mname.split('.').join(' ');\n mname = mname.split('-').join(' ');\n mname = mname.split('_').join(' ');\n\n return mname;\n}","function underscore (strings, ...values) {\n return strings[0].replace(/\\s/g, '_');\n}","function adjustFieldName(name, maxLen, i) {\n var name2, suff;\n maxLen = maxLen || 256;\n if (!i) {\n name2 = name.substr(0, maxLen);\n } else {\n suff = String(i);\n if (suff.length == 1) {\n suff = '_' + suff;\n }\n name2 = name.substr(0, maxLen - suff.length) + suff;\n }\n return name2;\n }","function normalizeName(name) {\n return name\n .toUpperCase()\n .replace(/[^A-Z0-9]/g, \" \")\n .trim()\n .split(/\\s+/)\n .join(\"_\");\n}","function underscore (strings, ...values) {\n return strings[0].replace(/\\s/g, '_');\n}","function unescapePropertyName(name) {\n // pre-test to improve performance\n if (REGEXP_IS_ESCAPED.test(name)) {\n name = name.replace(REGEXP_DOT, '.');\n name = name.replace(REGEXP_DOLLAR, '$');\n name = name.replace(REGEXP_TO_BSON, 'toBSON');\n name = name.replace(REGEXP_TO_STRING, 'toString');\n name = name.replace(REGEXP_BSON_TYPE, '_bsontype');\n }\n return name;\n}","function make_name(a, n) {\n var sub = [];\n for (var i = 0; i < n; i++) {\n sub.push(a[i].toString());\n }\n return sub.join('.');\n}","function convertFieldName(input) {\n return input.id.charAt(0).toUpperCase() + input.id.slice(1);\n }","function strReplace(){\n for(let i = 0; i < wordSplit.length; i++)\n {\n underscoreArray.push(wordSplit[i].replace(/[a-zA-Z]/gi, \"_\"));\n console.log(underscoreArray);\n }\n document.getElementById(\"underscores\").innerHTML = underscoreArray;\n}","function displayUnderscores() {\n return wordSplit.map((el) => {\n return (el = \"_\");\n });\n}","function parseObjArray(arr) {\n let ret = [];\n for (obj of arr) {\n let key = obj[0];\n let val = obj[1];\n let new_key = key;\n if (key.includes('_')) {\n new_key = key.split('_')[1];\n }\n new_key = new_key[0].toUpperCase() + new_key.substring(1);\n let string = new_key + \": \" + val;\n ret.push(string);\n }\n return ret;\n}","function formatString(arr) {\n const camelArr = [];\n\n for (const str of arr) {\n const wordArr = str.split(\"_\");\n const camelWord = [];\n for (const s of wordArr) {\n if (s === wordArr[0]) {\n camelWord.push(s);\n } else {\n camelWord.push(s[0].toUpperCase() + s.slice(1));\n }\n }\n camelArr.push(camelWord.join(\"\"));\n }\n return camelArr;\n}","function sanitise(name){\n\treturn name.replace(/[^a-zA-Z0-9\\.\\-]/g, '_');\n}","function unBase(arr){\n var base = arr.reduce(commonBase, arr[0]);\n return arr.map(function(x){\n x = x.substr(base.length);\n x = x.charAt(0).toLowerCase() + x.substr(1);\n x = camelCase(x);\n return x;\n })\n}","function underscore(){\n\tarrayU=[null];\n\tfor (var i=0; i word.charAt(0).toUpperCase() + word.substr(1)).join(\" \")\n}","function formatName(name) {\n if(name.includes(\",\") || name.includes(' ') || name.includes(\"&\")){\n if(name.includes(\".\")){\n name = name.substring(0, name.length-1);\n }\n return name.replace(/[,& ]+/g, '_');\n } else {\n return name\n }\n}","function capMe(arr){\n return arr.map(name => name[0].toUpperCase()+name.slice(1).toLowerCase())\n}","function varName(s) {\n // Replace non-alphanumeric characters (anything besides a-zA-Z0-9_) with _\n var alphanumericS = s.replace(/\\W/g, '_');\n // Add _ if the string has leading numbers.\n return (s.match(/^\\d+/) ? '_' : '') + alphanumericS;\n }","function sanitizeClassname(name) {\n return name.replace(/[^a-z0-9]/g, function(s) {\n var c = s.charCodeAt(0);\n if (c == 32) return '-';\n if (c >= 65 && c <= 90) return '_' + s.toLowerCase();\n return '__' + ('000' + c.toString(16)).slice(-4);\n });\n }","function charReplacer(cBand) {\n for (i = 0; i < cBand.length; i++) {\n underscoredBand.push(\"_\");\n }\n console.log(underscoredBand);\n }","function varName(s) {\n\t // Replace non-alphanumeric characters (anything besides a-zA-Z0-9_) with _\n\t const alphanumericS = s.replace(/\\W/g, '_');\n\t // Add _ if the string has leading numbers.\n\t return (s.match(/^\\d+/) ? '_' : '') + alphanumericS;\n\t}","formatAttributeName(attr) {\n return attr.replace(/([a-zA-Z])(?=[A-Z])/g, '$1-').toLowerCase();\n }","function capitalizeNames(arr){\r\n return arr.map(name => name.charAt(0).toUpperCase() + name.substring(1).toLowerCase())\r\n }","function getAttrNameFromPropName$1(propName) {\n if (isUndefined$3(PropNameToAttrNameMap$1[propName])) {\n PropNameToAttrNameMap$1[propName] = StringReplace$1$1.call(propName, CAPS_REGEX$1, match => '-' + match.toLowerCase());\n }\n\n return PropNameToAttrNameMap$1[propName];\n }","function camelize(arr){\n let temp=arr.split('-');\n \n return temp.map(s=> s.substring(0,1).toUpperCase()+s.substring(1)).join('');\n ;\n}","function varName(s) {\n // Replace non-alphanumeric characters (anything besides a-zA-Z0-9_) with _\n var alphanumericS = s.replace(/\\W/g, '_');\n // Add _ if the string has leading numbers.\n return (s.match(/^\\d+/) ? '_' : '') + alphanumericS;\n}","function jum_normalize_func_name(funcname) {\n if (funcname.substring(0,5) == 'test_') return funcname.substring('test_'.length);\n if (funcname.substring(0,4) == 'test') return funcname.substring('test'.length);\n return funcname;\n}","function toPublicName(internalName){return internalName.toUpperCase().replace(/[^A-Z0-9_]/g,'_');}","function getFieldName(input){\n // TODO slice vs substring?\n return input.id.charAt(0).toUpperCase() + input.id.slice(1);\n}","function changePropertyName(obj, old, _new) {\n obj[_new] = obj[old];\n delete obj[old];\n}","function encodeMemberName(memberName){\n var memName = memberName.replace(/\\.+/g, '');\n memName = memName.replace(/\\(+/g, '-');\n memName = memName.replace(/\\)+/g, '-');\n memName = memName.replace(/\\<+/g, '-');\n memName = memName.replace(/\\>+/g, '-');\n memName = memName.replace(/\\:+/g, '-');\n \n return memName;\n}","function getIndex(name)\n{\n // Split the variable name on the underscores and use the last part as the\n // array index\n var parts = name.split(\"_\");\n return parts[parts.length - 1];\n}","function $HjyR$var$toIdentifier(str) {\n return str.split(' ').map(function (token) {\n return token.slice(0, 1).toUpperCase() + token.slice(1);\n }).join('').replace(/[^ _0-9a-z]/gi, '');\n}","function camelToUnderscore(key) {\n var result = key.replace(/([A-Z])/g, \" $1\");\n return result\n .split(\" \")\n .join(\"-\")\n .toLowerCase()\n .substr(1);\n}","function _processName(pfx, eltDescName) {\n\t if (pfx === undefined || pfx === null) {\n\t pfx = EMPTY;\n\t }\n\t if (eltDescName === undefined || eltDescName === null) {\n\t return pfx;\n\t }\n\t if (pfx === EMPTY) {\n\t return eltDescName;\n\t }\n\t return pfx + '.' + eltDescName;\n\t}","function nameInspector(string) {\n var isArray = /\\[\\]$/.test(string);\n var name = (isArray) ? string.match(/[^\\[]*/)[0] : string;\n return {name: name, observerName: name+\"Obs\", isArray: isArray};\n}","function ConvertInputsToBeAsArrayItem(elem, arrayName, index) {\n $(elem).find(\"input, select\").each(function (i, e) {\n $(e).attr(\"id\", arrayName + \"_\" + index + \"__\" + $(e).attr(\"id\"));\n $(e).attr(\"name\", arrayName + \"[\" + index + \"].\" + $(e).attr(\"name\"));\n });\n return elem;\n}","function normalize(namePath) {\n return namePath.map(function (cell) {\n return \"\".concat((0, _typeof2.default)(cell), \":\").concat(cell);\n }) // Magic split\n .join(SPLIT);\n}","function _underscoreToDollar( data ) {\n\t\tfor( key in data ) {\n\t\t\tif ( key[0] == '_' ) {\n\t\t\t\tvar value = data[key];\n\t\t\t\tdelete data[key];\n\t\t\t\tdata['$'+key.substr(1)] = value;\n\t\t\t}\n\t\t}\n\t\treturn data;\n\t}","function unMungeNetworkName(name)\n{\n name = ecmaUnescape(name);\n return name.replace(/_/g, \":\").replace(/-/g, \".\");\n}","function ___R$$priv$project$rome$$internal$codec$config$json$parse_ts$removeUnderscores(\n\t\tparser,\n\t\tindex,\n\t\traw,\n\t) {\n\t\tlet str = \"\";\n\n\t\tfor (let i = 0; i < raw.length; i++) {\n\t\t\tconst char = raw[i];\n\n\t\t\tif (char === \"_\") {\n\t\t\t\t// Don't allow separators in JSON\n\t\t\t\tif (parser.meta.type !== \"rjson\") {\n\t\t\t\t\tthrow parser.unexpected({\n\t\t\t\t\t\tdescription: ___R$project$rome$$internal$diagnostics$descriptions$index_ts$descriptions.JSON.NUMERIC_SEPARATORS_IN_JSON,\n\t\t\t\t\t\tstart: parser.getPositionFromIndex(index.increment()),\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tstr += char;\n\t\t\t}\n\t\t}\n\n\t\treturn str;\n\t}","function accessor(proto, k) {\n\t\tif (k.length > 0 && k.charAt(0) == \"_\") {\n\t\t\tproto[k.substr(1)] = function(v) {\n\t\t\t\tif (typeof v == \"undefined\") return this[k];\n\t\t\t\tif (arguments.length > 1) {\n\t\t\t\t\tthis[k + \"_array\"] = [];\n\t\t\t\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\t\t\t\tthis[k + \"_array\"][i] = arguments[i];\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tdelete this[k + \"_array\"];\n\t\t\t\t}\n\t\t\t\tthis[k] = v;\n\t\t\t\tthis.updated[k.substr(1)] = true;\n\t\t\t\treturn this;\n\t\t\t};\n\t\t}\n\t}","function normalize$3(a) {\n\t if (!(a instanceof Array)) {\n\t a = [a, a];\n\t }\n\t\n\t return a;\n\t }","function buildPropertyAccess(objExpr, propertyName) {\n if (/^[A-Za-z_][A-Za-z0-9_]*$/.test(propertyName)) {\n return objExpr + \".\" + propertyName;\n } else {\n if (!isNaN(Number(propertyName))) {\n return objExpr + \"[\" + propertyName + \"]\";\n } else {\n return objExpr + \"[\" + buildLiteralString(propertyName) + \"]\";\n }\n }\n }","function normalizaNomeInputArray(nomeInput) {\n\tif (nomeInput.indexOf('.') == -1) {\n\t\treturn nomeInput;\n\t}\n\n\t// Quebra em partes\n\tnomeInput = nomeInput.split('.');\n\n\t// Unifica no formato certo e retorna\n\treturn nomeInput.shift() +'['+ nomeInput.join('][') +']';\n}","function translate(str){\r\n\treturn str.replace(\"_\",\" \");\r\n}","function showPropertyName(y){\n return ($.isString(y) ?\n ( (/[\\/;\\.]/).test(y) ? \"[\\\"\" + y + \"\\\"]\" : \".\" + y ) : \"[\" + y + \"]\");\n}","function printArrayFieldHelpers(prefix, fields) {\r\n return fields.filter(p => !p.isDuplicate && !p.emit && isArrayType(p.type)).map(p => {\r\n return prefix \r\n + templates.arrayFieldHelper\r\n .replace(\"[NAME]\", stringToUnionCase(p.name))\r\n .replace(\"[NAME_FOR_ARRAY]\", stringToUnionCase(p.name + \"A\"))\r\n .replace(\"[TYPE]\", escape(p.type))\r\n .replace(\"[ITEM_TYPE]\", escape(getArrayItemType(p.type)))\r\n .replace(\"[COMMENT]\", p.parentName ? (\"// \" + p.parentName) : \"\");\r\n }).filter(x => x.trim().length > 0).join(\"\\n\");\r\n}","function getPropName(prop) {\n return (Array.isArray(prop)) ? prop[0] : prop;\n }","function unescapeIdentifier(identifier){return identifier.startsWith('___')?identifier.substr(1):identifier;}","function stripUnderscoresFromValue(str){\r\n\tif (str){\r\n\t\tif (str.indexOf('_') != -1){\r\n\t\t\tvar newValue;\r\n\t\t\tvar newLength = str.length;\r\n\t\t\tfor (var i = str.length - 1; i >= 0; i--){\r\n\t\t\t\tif (str.charAt(i) == '_'){\r\n\t\t\t\t\tnewLength--;\r\n\t\t\t\t} else {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t// Build the new value (underscored strippes from the end of the string, replaced with spaces)\r\n\t\t\tif (newLength < str.length){\r\n\t\t\t\tnewValue = str.substring(0, newLength);\r\n\t\t\t\tfor(var i=0,iL=(str.length-newLength);i typeof x === \"string\")) return null;\n return arr.map((x) => x.trim());\n}","function normalize(name) {\n return name.replace(/[- _]+/g, '').toLowerCase();\n }","function normalize(name) {\n return name.replace(/[- _]+/g, '').toLowerCase();\n }","function removeSpaces(word){\n var newString = word.split(' ').join('_');\n return newString;\n}","function findVariableNameInAString(input) {\n const regex = /\\b_([a-zA-Z\\d]+)\\b/gm;\n let match = regex.exec(input);\n let result = [];\n while(match) {\n result.push(match[1]);\n match = regex.exec(input);\n }\n\n console.log(result.join(','));\n}","function capitalizeNames(arr){\r\n return arr.map(function(word){\r\n var name = word.charAt().toUpperCase()\r\n var fullname = word.slice(1).toLowerCase()\r\n return name+fullname \r\n\r\n\r\n });\r\n \r\n}","mapValue(value) {\n return `${value}`.replace(/\\-/g, \"_\")\n }","function convertPropertyName( str ) {\n\t\t\treturn str.replace( /\\-([A-Za-z])/g, function ( match, character ) {\n\t\t\t\treturn character.toUpperCase();\n\t\t\t});\n\t\t}","function convertPropertyName( str ) {\n\t\t\treturn str.replace( /\\-([A-Za-z])/g, function ( match, character ) {\n\t\t\t\treturn character.toUpperCase();\n\t\t\t});\n\t\t}","function toUnderscore(string) {\n string = string.toString()\n string = string.split('')\n string[0] = string[0].toLowerCase()\n for (let i = 0; i < string.length; i++) {\n if (parseInt(string[i])){\n continue\n }\n \n if (string[i] === string[i].toUpperCase()){\n string[i] = string[i].toLowerCase()\n string.splice(i, 0, '_')\n }\n }\n string = string.join('')\n return string\n }","function toIdentifier(str){return str.split(' ').map(function(token){return token.slice(0,1).toUpperCase()+token.slice(1);}).join('').replace(/[^ _0-9a-z]/gi,'');}","makeIdentifier(parts = []) {\n if (_.isString(parts)) {\n parts = [parts];\n }\n else if (!_.isArrayLikeObject(parts)) {\n throw new Error(\n 'input provided to makeIdentifier no array or object-like.'\n );\n }\n\n let formatted = _.filter(\n _.map(_.filter(parts), p => {\n return p\n .toString()\n .replace(/([0-9]{4})-([0-9]{2})-([0-9]{2})/g, '$1$2$3')\n .replace(/(^|\\s)u\\.s\\.a?(\\s|\\.|$)/gi, '$1us$2')\n .replace(/[^0-9a-z-]/gi, '')\n .trim();\n })\n );\n\n return _.kebabCase(formatted.join(' '));\n }","function elementaryName (name) {\n\t if (name.startsWith('int[')) {\n\t return 'int256' + name.slice(3)\n\t } else if (name === 'int') {\n\t return 'int256'\n\t } else if (name.startsWith('uint[')) {\n\t return 'uint256' + name.slice(4)\n\t } else if (name === 'uint') {\n\t return 'uint256'\n\t } else if (name.startsWith('fixed[')) {\n\t return 'fixed128x128' + name.slice(5)\n\t } else if (name === 'fixed') {\n\t return 'fixed128x128'\n\t } else if (name.startsWith('ufixed[')) {\n\t return 'ufixed128x128' + name.slice(6)\n\t } else if (name === 'ufixed') {\n\t return 'ufixed128x128'\n\t }\n\t return name\n\t}","static getSortKeyIgnoringUnderscore(identifier) {\n let parts;\n if (identifier[0] === '_') {\n const withoutUnderscore = identifier.substr(1);\n parts = [withoutUnderscore.toLowerCase(), '*', withoutUnderscore, '*', '_'];\n }\n else {\n parts = [identifier.toLowerCase(), '*', identifier];\n }\n return parts.join('');\n }","function tidyName(name) {\n var result = name.replace(/-/g, \" \");\n result = result.substr(0, 1).toUpperCase() + result.substr(1);\n return result;\n}","function capitalizeNames(arr){\n properNames = arr.map(function(name){\n lowercase = name.toLowerCase()\n uppercase = lowercase[0].toUpperCase()\n proper = uppercase + lowercase.substring(1,lowercase.length)\n return proper\n })\n //console.log (properNames)\n}","function getFieldName(input){\n\treturn input.id.charAt(0).toUpperCase() + input.id.slice(1);\n}","function underscore (s) {\n return s.replace(/-/g, '_')\n}","function underscoreToSpaces(string) {\n return string.split(\"_\").join(\" \");\n}","function getPropertyName(parentName, parent, indexer) {\n\t\tvar propertyName = parentName || \"\";\n\t\tif (exports.getType(parent) === \"array\") {\n\t\t\tif (parentName) {\n\t\t\t\tpropertyName += \"[\" + indexer + \"]\";\n\t\t\t}\n\t\t} else {\n\t\t\tif (parentName) {\n\t\t\t\tpropertyName += \".\";\n\t\t\t}\n\t\t\tpropertyName += indexer;\n\t\t}\n\t\treturn propertyName;\n\t}"],"string":"[\n \"function underscore (name) {\\n return varname.split(name).join('_');\\n}\",\n \"function underscore (name) {\\n return varname.split(name).join('_');\\n}\",\n \"function normalize_dataset_name(name) { // 214\\n\\treturn name.replace(/[\\\\]\\\\[\\\\.]/g, '_'); // 215\\n} // 216\",\n \"function cleanFieldName_v1(name) {\\n return name.replace(/[^A-Za-z0-9]+/g, '_');\\n }\",\n \"function fixIdentifier(name) {\\n return name.replace(/[\\\\[\\\\]]/g, '');\\n }\",\n \"function cleanFieldName(name) {\\n return name.replace(/[-\\\\s]+/g, '_');\\n }\",\n \"function filterFieldName(temp) {\\r\\n\\ttemp = trim(temp);\\r\\n\\ttemp = temp.toLowerCase();\\r\\n\\ttemp = temp.replace(/[^a-z0-9]/ig,\\\"_\\\");\\r\\n\\ttemp = temp.replace(/[_]+/g,\\\"_\\\");\\r\\n\\twhile (temp.length > 0 && (temp.charAt(0) == \\\"_\\\" || temp.charAt(0)*1 == temp.charAt(0))) {\\r\\n\\t\\ttemp = temp.substr(1,temp.length);\\r\\n\\t}\\r\\n\\twhile (temp.length > 0 && temp.charAt(temp.length-1) == \\\"_\\\") { \\r\\n\\t\\ttemp = temp.substr(0,temp.length-1);\\r\\n\\t}\\r\\n\\treturn temp;\\r\\n}\",\n \"function normalizeAttributeName( attributeName ) {\\n\\t\\tattributeName = attributeName.replace( rDataAttrPrefix, \\\"\\\" );\\n\\n\\t\\t//if subscription involve with more than one events, you can\\n\\t\\t//concatenate them with \\\"_\\\", here we need to revert them back\\n\\t\\t//such as \\\"$click_mouseover\\\" need to be changed to \\\"$click mouseover\\\"\\n\\t\\tif (attributeName.startsWith( \\\"!\\\" ) || attributeName.startsWith( \\\"$\\\" )) {\\n\\n\\t\\t\\tattributeName = attributeName.replace( reUnderscore, \\\" \\\" );\\n\\n\\t\\t}\\n\\t\\treturn attributeName.replace( reAttrDash, replaceAttrDashWithCapitalCharacter );\\n\\t}\",\n \"function normalizeName(name) {\\n s = name;\\n var pos = 0;\\n while (true)\\n {\\n pos = s.search(' ');\\n if (pos === -1) return s;\\n else s = s.replace(' ','_');\\n }\\n}\",\n \"function mungePropertyName(name, prefix) {\\n\\t\\tif (!prefix) {\\n\\t\\t\\treturn name;\\n\\t\\t}\\n\\n\\t\\tvar parts = name.split(\\\".\\\");\\n\\t\\tvar result = \\\"\\\";\\n\\t\\tfor (var i = 0; i < parts.length - 1; i++) {\\n\\t\\t\\tresult += parts[i] + \\\".\\\";\\n\\t\\t}\\n\\t\\tvar lastPart = parts[parts.length - 1];\\n\\t\\tif (prefixRequiresNextInitialCap(prefix)) {\\n\\t\\t\\tresult += prefix + lastPart.substring(0, 1).toUpperCase() + lastPart.substring(1);\\n\\t\\t} else {\\n\\t\\t\\tresult += prefix + lastPart;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\",\n \"function beautifyString(mname) {\\n\\n mname = mname.split('.').join(' ');\\n mname = mname.split('-').join(' ');\\n mname = mname.split('_').join(' ');\\n\\n return mname;\\n}\",\n \"function underscore (strings, ...values) {\\n return strings[0].replace(/\\\\s/g, '_');\\n}\",\n \"function adjustFieldName(name, maxLen, i) {\\n var name2, suff;\\n maxLen = maxLen || 256;\\n if (!i) {\\n name2 = name.substr(0, maxLen);\\n } else {\\n suff = String(i);\\n if (suff.length == 1) {\\n suff = '_' + suff;\\n }\\n name2 = name.substr(0, maxLen - suff.length) + suff;\\n }\\n return name2;\\n }\",\n \"function normalizeName(name) {\\n return name\\n .toUpperCase()\\n .replace(/[^A-Z0-9]/g, \\\" \\\")\\n .trim()\\n .split(/\\\\s+/)\\n .join(\\\"_\\\");\\n}\",\n \"function underscore (strings, ...values) {\\n return strings[0].replace(/\\\\s/g, '_');\\n}\",\n \"function unescapePropertyName(name) {\\n // pre-test to improve performance\\n if (REGEXP_IS_ESCAPED.test(name)) {\\n name = name.replace(REGEXP_DOT, '.');\\n name = name.replace(REGEXP_DOLLAR, '$');\\n name = name.replace(REGEXP_TO_BSON, 'toBSON');\\n name = name.replace(REGEXP_TO_STRING, 'toString');\\n name = name.replace(REGEXP_BSON_TYPE, '_bsontype');\\n }\\n return name;\\n}\",\n \"function make_name(a, n) {\\n var sub = [];\\n for (var i = 0; i < n; i++) {\\n sub.push(a[i].toString());\\n }\\n return sub.join('.');\\n}\",\n \"function convertFieldName(input) {\\n return input.id.charAt(0).toUpperCase() + input.id.slice(1);\\n }\",\n \"function strReplace(){\\n for(let i = 0; i < wordSplit.length; i++)\\n {\\n underscoreArray.push(wordSplit[i].replace(/[a-zA-Z]/gi, \\\"_\\\"));\\n console.log(underscoreArray);\\n }\\n document.getElementById(\\\"underscores\\\").innerHTML = underscoreArray;\\n}\",\n \"function displayUnderscores() {\\n return wordSplit.map((el) => {\\n return (el = \\\"_\\\");\\n });\\n}\",\n \"function parseObjArray(arr) {\\n let ret = [];\\n for (obj of arr) {\\n let key = obj[0];\\n let val = obj[1];\\n let new_key = key;\\n if (key.includes('_')) {\\n new_key = key.split('_')[1];\\n }\\n new_key = new_key[0].toUpperCase() + new_key.substring(1);\\n let string = new_key + \\\": \\\" + val;\\n ret.push(string);\\n }\\n return ret;\\n}\",\n \"function formatString(arr) {\\n const camelArr = [];\\n\\n for (const str of arr) {\\n const wordArr = str.split(\\\"_\\\");\\n const camelWord = [];\\n for (const s of wordArr) {\\n if (s === wordArr[0]) {\\n camelWord.push(s);\\n } else {\\n camelWord.push(s[0].toUpperCase() + s.slice(1));\\n }\\n }\\n camelArr.push(camelWord.join(\\\"\\\"));\\n }\\n return camelArr;\\n}\",\n \"function sanitise(name){\\n\\treturn name.replace(/[^a-zA-Z0-9\\\\.\\\\-]/g, '_');\\n}\",\n \"function unBase(arr){\\n var base = arr.reduce(commonBase, arr[0]);\\n return arr.map(function(x){\\n x = x.substr(base.length);\\n x = x.charAt(0).toLowerCase() + x.substr(1);\\n x = camelCase(x);\\n return x;\\n })\\n}\",\n \"function underscore(){\\n\\tarrayU=[null];\\n\\tfor (var i=0; i word.charAt(0).toUpperCase() + word.substr(1)).join(\\\" \\\")\\n}\",\n \"function formatName(name) {\\n if(name.includes(\\\",\\\") || name.includes(' ') || name.includes(\\\"&\\\")){\\n if(name.includes(\\\".\\\")){\\n name = name.substring(0, name.length-1);\\n }\\n return name.replace(/[,& ]+/g, '_');\\n } else {\\n return name\\n }\\n}\",\n \"function capMe(arr){\\n return arr.map(name => name[0].toUpperCase()+name.slice(1).toLowerCase())\\n}\",\n \"function varName(s) {\\n // Replace non-alphanumeric characters (anything besides a-zA-Z0-9_) with _\\n var alphanumericS = s.replace(/\\\\W/g, '_');\\n // Add _ if the string has leading numbers.\\n return (s.match(/^\\\\d+/) ? '_' : '') + alphanumericS;\\n }\",\n \"function sanitizeClassname(name) {\\n return name.replace(/[^a-z0-9]/g, function(s) {\\n var c = s.charCodeAt(0);\\n if (c == 32) return '-';\\n if (c >= 65 && c <= 90) return '_' + s.toLowerCase();\\n return '__' + ('000' + c.toString(16)).slice(-4);\\n });\\n }\",\n \"function charReplacer(cBand) {\\n for (i = 0; i < cBand.length; i++) {\\n underscoredBand.push(\\\"_\\\");\\n }\\n console.log(underscoredBand);\\n }\",\n \"function varName(s) {\\n\\t // Replace non-alphanumeric characters (anything besides a-zA-Z0-9_) with _\\n\\t const alphanumericS = s.replace(/\\\\W/g, '_');\\n\\t // Add _ if the string has leading numbers.\\n\\t return (s.match(/^\\\\d+/) ? '_' : '') + alphanumericS;\\n\\t}\",\n \"formatAttributeName(attr) {\\n return attr.replace(/([a-zA-Z])(?=[A-Z])/g, '$1-').toLowerCase();\\n }\",\n \"function capitalizeNames(arr){\\r\\n return arr.map(name => name.charAt(0).toUpperCase() + name.substring(1).toLowerCase())\\r\\n }\",\n \"function getAttrNameFromPropName$1(propName) {\\n if (isUndefined$3(PropNameToAttrNameMap$1[propName])) {\\n PropNameToAttrNameMap$1[propName] = StringReplace$1$1.call(propName, CAPS_REGEX$1, match => '-' + match.toLowerCase());\\n }\\n\\n return PropNameToAttrNameMap$1[propName];\\n }\",\n \"function camelize(arr){\\n let temp=arr.split('-');\\n \\n return temp.map(s=> s.substring(0,1).toUpperCase()+s.substring(1)).join('');\\n ;\\n}\",\n \"function varName(s) {\\n // Replace non-alphanumeric characters (anything besides a-zA-Z0-9_) with _\\n var alphanumericS = s.replace(/\\\\W/g, '_');\\n // Add _ if the string has leading numbers.\\n return (s.match(/^\\\\d+/) ? '_' : '') + alphanumericS;\\n}\",\n \"function jum_normalize_func_name(funcname) {\\n if (funcname.substring(0,5) == 'test_') return funcname.substring('test_'.length);\\n if (funcname.substring(0,4) == 'test') return funcname.substring('test'.length);\\n return funcname;\\n}\",\n \"function toPublicName(internalName){return internalName.toUpperCase().replace(/[^A-Z0-9_]/g,'_');}\",\n \"function getFieldName(input){\\n // TODO slice vs substring?\\n return input.id.charAt(0).toUpperCase() + input.id.slice(1);\\n}\",\n \"function changePropertyName(obj, old, _new) {\\n obj[_new] = obj[old];\\n delete obj[old];\\n}\",\n \"function encodeMemberName(memberName){\\n var memName = memberName.replace(/\\\\.+/g, '');\\n memName = memName.replace(/\\\\(+/g, '-');\\n memName = memName.replace(/\\\\)+/g, '-');\\n memName = memName.replace(/\\\\<+/g, '-');\\n memName = memName.replace(/\\\\>+/g, '-');\\n memName = memName.replace(/\\\\:+/g, '-');\\n \\n return memName;\\n}\",\n \"function getIndex(name)\\n{\\n // Split the variable name on the underscores and use the last part as the\\n // array index\\n var parts = name.split(\\\"_\\\");\\n return parts[parts.length - 1];\\n}\",\n \"function $HjyR$var$toIdentifier(str) {\\n return str.split(' ').map(function (token) {\\n return token.slice(0, 1).toUpperCase() + token.slice(1);\\n }).join('').replace(/[^ _0-9a-z]/gi, '');\\n}\",\n \"function camelToUnderscore(key) {\\n var result = key.replace(/([A-Z])/g, \\\" $1\\\");\\n return result\\n .split(\\\" \\\")\\n .join(\\\"-\\\")\\n .toLowerCase()\\n .substr(1);\\n}\",\n \"function _processName(pfx, eltDescName) {\\n\\t if (pfx === undefined || pfx === null) {\\n\\t pfx = EMPTY;\\n\\t }\\n\\t if (eltDescName === undefined || eltDescName === null) {\\n\\t return pfx;\\n\\t }\\n\\t if (pfx === EMPTY) {\\n\\t return eltDescName;\\n\\t }\\n\\t return pfx + '.' + eltDescName;\\n\\t}\",\n \"function nameInspector(string) {\\n var isArray = /\\\\[\\\\]$/.test(string);\\n var name = (isArray) ? string.match(/[^\\\\[]*/)[0] : string;\\n return {name: name, observerName: name+\\\"Obs\\\", isArray: isArray};\\n}\",\n \"function ConvertInputsToBeAsArrayItem(elem, arrayName, index) {\\n $(elem).find(\\\"input, select\\\").each(function (i, e) {\\n $(e).attr(\\\"id\\\", arrayName + \\\"_\\\" + index + \\\"__\\\" + $(e).attr(\\\"id\\\"));\\n $(e).attr(\\\"name\\\", arrayName + \\\"[\\\" + index + \\\"].\\\" + $(e).attr(\\\"name\\\"));\\n });\\n return elem;\\n}\",\n \"function normalize(namePath) {\\n return namePath.map(function (cell) {\\n return \\\"\\\".concat((0, _typeof2.default)(cell), \\\":\\\").concat(cell);\\n }) // Magic split\\n .join(SPLIT);\\n}\",\n \"function _underscoreToDollar( data ) {\\n\\t\\tfor( key in data ) {\\n\\t\\t\\tif ( key[0] == '_' ) {\\n\\t\\t\\t\\tvar value = data[key];\\n\\t\\t\\t\\tdelete data[key];\\n\\t\\t\\t\\tdata['$'+key.substr(1)] = value;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn data;\\n\\t}\",\n \"function unMungeNetworkName(name)\\n{\\n name = ecmaUnescape(name);\\n return name.replace(/_/g, \\\":\\\").replace(/-/g, \\\".\\\");\\n}\",\n \"function ___R$$priv$project$rome$$internal$codec$config$json$parse_ts$removeUnderscores(\\n\\t\\tparser,\\n\\t\\tindex,\\n\\t\\traw,\\n\\t) {\\n\\t\\tlet str = \\\"\\\";\\n\\n\\t\\tfor (let i = 0; i < raw.length; i++) {\\n\\t\\t\\tconst char = raw[i];\\n\\n\\t\\t\\tif (char === \\\"_\\\") {\\n\\t\\t\\t\\t// Don't allow separators in JSON\\n\\t\\t\\t\\tif (parser.meta.type !== \\\"rjson\\\") {\\n\\t\\t\\t\\t\\tthrow parser.unexpected({\\n\\t\\t\\t\\t\\t\\tdescription: ___R$project$rome$$internal$diagnostics$descriptions$index_ts$descriptions.JSON.NUMERIC_SEPARATORS_IN_JSON,\\n\\t\\t\\t\\t\\t\\tstart: parser.getPositionFromIndex(index.increment()),\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tstr += char;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn str;\\n\\t}\",\n \"function accessor(proto, k) {\\n\\t\\tif (k.length > 0 && k.charAt(0) == \\\"_\\\") {\\n\\t\\t\\tproto[k.substr(1)] = function(v) {\\n\\t\\t\\t\\tif (typeof v == \\\"undefined\\\") return this[k];\\n\\t\\t\\t\\tif (arguments.length > 1) {\\n\\t\\t\\t\\t\\tthis[k + \\\"_array\\\"] = [];\\n\\t\\t\\t\\t\\tfor (var i = 0; i < arguments.length; i++) {\\n\\t\\t\\t\\t\\t\\tthis[k + \\\"_array\\\"][i] = arguments[i];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tdelete this[k + \\\"_array\\\"];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tthis[k] = v;\\n\\t\\t\\t\\tthis.updated[k.substr(1)] = true;\\n\\t\\t\\t\\treturn this;\\n\\t\\t\\t};\\n\\t\\t}\\n\\t}\",\n \"function normalize$3(a) {\\n\\t if (!(a instanceof Array)) {\\n\\t a = [a, a];\\n\\t }\\n\\t\\n\\t return a;\\n\\t }\",\n \"function buildPropertyAccess(objExpr, propertyName) {\\n if (/^[A-Za-z_][A-Za-z0-9_]*$/.test(propertyName)) {\\n return objExpr + \\\".\\\" + propertyName;\\n } else {\\n if (!isNaN(Number(propertyName))) {\\n return objExpr + \\\"[\\\" + propertyName + \\\"]\\\";\\n } else {\\n return objExpr + \\\"[\\\" + buildLiteralString(propertyName) + \\\"]\\\";\\n }\\n }\\n }\",\n \"function normalizaNomeInputArray(nomeInput) {\\n\\tif (nomeInput.indexOf('.') == -1) {\\n\\t\\treturn nomeInput;\\n\\t}\\n\\n\\t// Quebra em partes\\n\\tnomeInput = nomeInput.split('.');\\n\\n\\t// Unifica no formato certo e retorna\\n\\treturn nomeInput.shift() +'['+ nomeInput.join('][') +']';\\n}\",\n \"function translate(str){\\r\\n\\treturn str.replace(\\\"_\\\",\\\" \\\");\\r\\n}\",\n \"function showPropertyName(y){\\n return ($.isString(y) ?\\n ( (/[\\\\/;\\\\.]/).test(y) ? \\\"[\\\\\\\"\\\" + y + \\\"\\\\\\\"]\\\" : \\\".\\\" + y ) : \\\"[\\\" + y + \\\"]\\\");\\n}\",\n \"function printArrayFieldHelpers(prefix, fields) {\\r\\n return fields.filter(p => !p.isDuplicate && !p.emit && isArrayType(p.type)).map(p => {\\r\\n return prefix \\r\\n + templates.arrayFieldHelper\\r\\n .replace(\\\"[NAME]\\\", stringToUnionCase(p.name))\\r\\n .replace(\\\"[NAME_FOR_ARRAY]\\\", stringToUnionCase(p.name + \\\"A\\\"))\\r\\n .replace(\\\"[TYPE]\\\", escape(p.type))\\r\\n .replace(\\\"[ITEM_TYPE]\\\", escape(getArrayItemType(p.type)))\\r\\n .replace(\\\"[COMMENT]\\\", p.parentName ? (\\\"// \\\" + p.parentName) : \\\"\\\");\\r\\n }).filter(x => x.trim().length > 0).join(\\\"\\\\n\\\");\\r\\n}\",\n \"function getPropName(prop) {\\n return (Array.isArray(prop)) ? prop[0] : prop;\\n }\",\n \"function unescapeIdentifier(identifier){return identifier.startsWith('___')?identifier.substr(1):identifier;}\",\n \"function stripUnderscoresFromValue(str){\\r\\n\\tif (str){\\r\\n\\t\\tif (str.indexOf('_') != -1){\\r\\n\\t\\t\\tvar newValue;\\r\\n\\t\\t\\tvar newLength = str.length;\\r\\n\\t\\t\\tfor (var i = str.length - 1; i >= 0; i--){\\r\\n\\t\\t\\t\\tif (str.charAt(i) == '_'){\\r\\n\\t\\t\\t\\t\\tnewLength--;\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t// Build the new value (underscored strippes from the end of the string, replaced with spaces)\\r\\n\\t\\t\\tif (newLength < str.length){\\r\\n\\t\\t\\t\\tnewValue = str.substring(0, newLength);\\r\\n\\t\\t\\t\\tfor(var i=0,iL=(str.length-newLength);i typeof x === \\\"string\\\")) return null;\\n return arr.map((x) => x.trim());\\n}\",\n \"function normalize(name) {\\n return name.replace(/[- _]+/g, '').toLowerCase();\\n }\",\n \"function normalize(name) {\\n return name.replace(/[- _]+/g, '').toLowerCase();\\n }\",\n \"function removeSpaces(word){\\n var newString = word.split(' ').join('_');\\n return newString;\\n}\",\n \"function findVariableNameInAString(input) {\\n const regex = /\\\\b_([a-zA-Z\\\\d]+)\\\\b/gm;\\n let match = regex.exec(input);\\n let result = [];\\n while(match) {\\n result.push(match[1]);\\n match = regex.exec(input);\\n }\\n\\n console.log(result.join(','));\\n}\",\n \"function capitalizeNames(arr){\\r\\n return arr.map(function(word){\\r\\n var name = word.charAt().toUpperCase()\\r\\n var fullname = word.slice(1).toLowerCase()\\r\\n return name+fullname \\r\\n\\r\\n\\r\\n });\\r\\n \\r\\n}\",\n \"mapValue(value) {\\n return `${value}`.replace(/\\\\-/g, \\\"_\\\")\\n }\",\n \"function convertPropertyName( str ) {\\n\\t\\t\\treturn str.replace( /\\\\-([A-Za-z])/g, function ( match, character ) {\\n\\t\\t\\t\\treturn character.toUpperCase();\\n\\t\\t\\t});\\n\\t\\t}\",\n \"function convertPropertyName( str ) {\\n\\t\\t\\treturn str.replace( /\\\\-([A-Za-z])/g, function ( match, character ) {\\n\\t\\t\\t\\treturn character.toUpperCase();\\n\\t\\t\\t});\\n\\t\\t}\",\n \"function toUnderscore(string) {\\n string = string.toString()\\n string = string.split('')\\n string[0] = string[0].toLowerCase()\\n for (let i = 0; i < string.length; i++) {\\n if (parseInt(string[i])){\\n continue\\n }\\n \\n if (string[i] === string[i].toUpperCase()){\\n string[i] = string[i].toLowerCase()\\n string.splice(i, 0, '_')\\n }\\n }\\n string = string.join('')\\n return string\\n }\",\n \"function toIdentifier(str){return str.split(' ').map(function(token){return token.slice(0,1).toUpperCase()+token.slice(1);}).join('').replace(/[^ _0-9a-z]/gi,'');}\",\n \"makeIdentifier(parts = []) {\\n if (_.isString(parts)) {\\n parts = [parts];\\n }\\n else if (!_.isArrayLikeObject(parts)) {\\n throw new Error(\\n 'input provided to makeIdentifier no array or object-like.'\\n );\\n }\\n\\n let formatted = _.filter(\\n _.map(_.filter(parts), p => {\\n return p\\n .toString()\\n .replace(/([0-9]{4})-([0-9]{2})-([0-9]{2})/g, '$1$2$3')\\n .replace(/(^|\\\\s)u\\\\.s\\\\.a?(\\\\s|\\\\.|$)/gi, '$1us$2')\\n .replace(/[^0-9a-z-]/gi, '')\\n .trim();\\n })\\n );\\n\\n return _.kebabCase(formatted.join(' '));\\n }\",\n \"function elementaryName (name) {\\n\\t if (name.startsWith('int[')) {\\n\\t return 'int256' + name.slice(3)\\n\\t } else if (name === 'int') {\\n\\t return 'int256'\\n\\t } else if (name.startsWith('uint[')) {\\n\\t return 'uint256' + name.slice(4)\\n\\t } else if (name === 'uint') {\\n\\t return 'uint256'\\n\\t } else if (name.startsWith('fixed[')) {\\n\\t return 'fixed128x128' + name.slice(5)\\n\\t } else if (name === 'fixed') {\\n\\t return 'fixed128x128'\\n\\t } else if (name.startsWith('ufixed[')) {\\n\\t return 'ufixed128x128' + name.slice(6)\\n\\t } else if (name === 'ufixed') {\\n\\t return 'ufixed128x128'\\n\\t }\\n\\t return name\\n\\t}\",\n \"static getSortKeyIgnoringUnderscore(identifier) {\\n let parts;\\n if (identifier[0] === '_') {\\n const withoutUnderscore = identifier.substr(1);\\n parts = [withoutUnderscore.toLowerCase(), '*', withoutUnderscore, '*', '_'];\\n }\\n else {\\n parts = [identifier.toLowerCase(), '*', identifier];\\n }\\n return parts.join('');\\n }\",\n \"function tidyName(name) {\\n var result = name.replace(/-/g, \\\" \\\");\\n result = result.substr(0, 1).toUpperCase() + result.substr(1);\\n return result;\\n}\",\n \"function capitalizeNames(arr){\\n properNames = arr.map(function(name){\\n lowercase = name.toLowerCase()\\n uppercase = lowercase[0].toUpperCase()\\n proper = uppercase + lowercase.substring(1,lowercase.length)\\n return proper\\n })\\n //console.log (properNames)\\n}\",\n \"function getFieldName(input){\\n\\treturn input.id.charAt(0).toUpperCase() + input.id.slice(1);\\n}\",\n \"function underscore (s) {\\n return s.replace(/-/g, '_')\\n}\",\n \"function underscoreToSpaces(string) {\\n return string.split(\\\"_\\\").join(\\\" \\\");\\n}\",\n \"function getPropertyName(parentName, parent, indexer) {\\n\\t\\tvar propertyName = parentName || \\\"\\\";\\n\\t\\tif (exports.getType(parent) === \\\"array\\\") {\\n\\t\\t\\tif (parentName) {\\n\\t\\t\\t\\tpropertyName += \\\"[\\\" + indexer + \\\"]\\\";\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tif (parentName) {\\n\\t\\t\\t\\tpropertyName += \\\".\\\";\\n\\t\\t\\t}\\n\\t\\t\\tpropertyName += indexer;\\n\\t\\t}\\n\\t\\treturn propertyName;\\n\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.6083765","0.6083765","0.6016209","0.59452313","0.5863515","0.56995344","0.5670354","0.55625224","0.5526872","0.54653025","0.5438944","0.53927195","0.53881425","0.5387266","0.53272283","0.5309225","0.5305594","0.52917945","0.5289355","0.5289287","0.52698845","0.5251565","0.5219054","0.5213395","0.5211208","0.5174757","0.51736945","0.5155324","0.51497066","0.5144773","0.5132557","0.5081723","0.5080561","0.5077508","0.5072107","0.5061086","0.50520897","0.5047754","0.5047704","0.5034467","0.50258505","0.50251514","0.50200313","0.50045824","0.49944592","0.4978709","0.49770257","0.49675453","0.4930321","0.49236912","0.4923317","0.49192834","0.489867","0.4894994","0.48875314","0.48860952","0.488151","0.48786125","0.48708805","0.48675779","0.4865805","0.48536304","0.485288","0.48487318","0.48460743","0.48404846","0.48374197","0.48230052","0.48181355","0.4817017","0.4816465","0.48157334","0.48137128","0.48137128","0.48119575","0.4801647","0.4799714","0.47988194","0.4788699","0.47871125","0.47869876","0.47863492","0.47863492","0.4780775","0.47739765","0.4771311","0.47707343","0.47677916","0.47677916","0.47658405","0.47650555","0.4764326","0.47565356","0.47544414","0.4754072","0.47530913","0.47495964","0.47454822","0.4742722","0.47375783"],"string":"[\n \"0.6083765\",\n \"0.6083765\",\n \"0.6016209\",\n \"0.59452313\",\n \"0.5863515\",\n \"0.56995344\",\n \"0.5670354\",\n \"0.55625224\",\n \"0.5526872\",\n \"0.54653025\",\n \"0.5438944\",\n \"0.53927195\",\n \"0.53881425\",\n \"0.5387266\",\n \"0.53272283\",\n \"0.5309225\",\n \"0.5305594\",\n \"0.52917945\",\n \"0.5289355\",\n \"0.5289287\",\n \"0.52698845\",\n \"0.5251565\",\n \"0.5219054\",\n \"0.5213395\",\n \"0.5211208\",\n \"0.5174757\",\n \"0.51736945\",\n \"0.5155324\",\n \"0.51497066\",\n \"0.5144773\",\n \"0.5132557\",\n \"0.5081723\",\n \"0.5080561\",\n \"0.5077508\",\n \"0.5072107\",\n \"0.5061086\",\n \"0.50520897\",\n \"0.5047754\",\n \"0.5047704\",\n \"0.5034467\",\n \"0.50258505\",\n \"0.50251514\",\n \"0.50200313\",\n \"0.50045824\",\n \"0.49944592\",\n \"0.4978709\",\n \"0.49770257\",\n \"0.49675453\",\n \"0.4930321\",\n \"0.49236912\",\n \"0.4923317\",\n \"0.49192834\",\n \"0.489867\",\n \"0.4894994\",\n \"0.48875314\",\n \"0.48860952\",\n \"0.488151\",\n \"0.48786125\",\n \"0.48708805\",\n \"0.48675779\",\n \"0.4865805\",\n \"0.48536304\",\n \"0.485288\",\n \"0.48487318\",\n \"0.48460743\",\n \"0.48404846\",\n \"0.48374197\",\n \"0.48230052\",\n \"0.48181355\",\n \"0.4817017\",\n \"0.4816465\",\n \"0.48157334\",\n \"0.48137128\",\n \"0.48137128\",\n \"0.48119575\",\n \"0.4801647\",\n \"0.4799714\",\n \"0.47988194\",\n \"0.4788699\",\n \"0.47871125\",\n \"0.47869876\",\n \"0.47863492\",\n \"0.47863492\",\n \"0.4780775\",\n \"0.47739765\",\n \"0.4771311\",\n \"0.47707343\",\n \"0.47677916\",\n \"0.47677916\",\n \"0.47658405\",\n \"0.47650555\",\n \"0.4764326\",\n \"0.47565356\",\n \"0.47544414\",\n \"0.4754072\",\n \"0.47530913\",\n \"0.47495964\",\n \"0.47454822\",\n \"0.4742722\",\n \"0.47375783\"\n]"},"document_score":{"kind":"string","value":"0.8395666"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":3076,"cells":{"query":{"kind":"string","value":"Adjust the row counter to the next row. If the number of rows exceeds the maximum start a new column"},"document":{"kind":"string","value":"function nextRow(pageFile, variableName, fullVariableName, row)\n{\n // Check if the row counter is at the maximum\n if (rowCount >= maxNumRows)\n {\n // Step through the rows in the data that have been processed\n for (; row >= 0; row--)\n {\n // Get the header (structure) name for this row\n var headerName = fullHeaderNames[row];\n\n // Check if the variable belongs to the same structure\n if (headerName != \"\" && fullVariableName.equals(headerName + \"_\" + variableName))\n {\n // Update the column header\n lastSubStructureName = headerNames[row];\n }\n }\n\n // Go to the next column\n columnCount++;\n ccdd.writeToFileLn(pageFile, \"## col_max_len going from \" + maxColumnLength + \" back to \" + columnStep);\n rowCount = 1;\n columnOffset = +columnOffset + +maxColumnLength + 2;\n maxColumnLength = columnStep;\n\n // Check if the current variable is a member within an array\n if (inMiddleOfArray)\n {\n ccdd.writeToFileLn(pageFile, \"array_fmt(1, \" + columnOffset + \",\\\"\" + nextColumnHeader + \"\\\")\");\n }\n // Not a variable within an array\n else\n {\n ccdd.writeToFileLn(pageFile, \"(1, \" + columnOffset + \",\\\"\" + lastSubStructureName + \"\\\")\");\n }\n }\n // Not at the maximum row\n else\n {\n rowCount++;\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 render_next_row() {\n\n current_row = (current_row + 1) % DataManager.imported_data.length;\n render_row(current_row);\n\n}","function getNextEditableRow() {\r\n\t\t\trowNum = parseInt(rowNum) + 1;\r\n\t\t\teditableFieldsList = getEditableFieldListInOrder(nmsp, rowNum);\r\n\t\t\tvar maxVisibleRowNum = parseInt(grid.getRowCount()) + parseInt(initRowNum);\r\n\t\t\tif (editableFieldsList && editableFieldsList.length > 0) {\r\n\t\t\t\tnextEditableCol = editableFieldsList[0];\r\n\t\t\t\tnextEditableFieldId = getNextGridFieldId(rowNum, nextEditableCol);\r\n\t\t\t} else if (maxVisibleRowNum < rowNum && grid.getBodyContainer().maxVerticalScrollPosition > $(gridBlockElem).scrollTop()) { // if maximum number visible rows exceeded then scroll write the next set\r\n\t\t\t\tvar ypos = $(gridBlockElem).scrollTop() + grid.getBodyContainer().height - grid.getBodyContainer().verticalMask;\r\n\t\t\t\tif (grid.getBodyContainer()._calculatedTotalHeight > ypos) {\r\n\t\t\t\t\t$(gridBlockElem).animate({\r\n\t\t\t\t\t\t'scrollTop': ypos\r\n\t\t\t\t\t}, 300, '', function () {\r\n\t\t\t\t\t\tsetTimeout(function () {\r\n\t\t\t\t\t\t\trowNum = initRowNum;\r\n\t\t\t\t\t\t\tgetNextEditableRow();\r\n\t\t\t\t\t\t}, 400);\r\n\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\t\t\t} else if ((grid.getBodyContainer().maxVerticalScrollPosition > $(gridBlockElem).scrollTop()) || (Object.keys(nmsp.rowEditableColumnMap).length > rowNum))\r\n\t\t\t\tgetNextEditableRow();\r\n\t\t}","function WSetRow(num)\n{\n if (num < 0) \n this.currow = 0;\n else if (num >= this.rows)\n this.currow = this.rows - 1;\n else\n this.currow = num;\n}","function WNextRec()\n{\n this.WSetRow(this.currow + 1);\n}","function setRowNumber() {\n $self.find('td.js-row-no').each(function (i) {\n i = i + 1;\n $(this).text(i);\n });\n }","setNextRowActive() {\n this._activeRowIndex < 0 ? this.setFirstCellActive() : this._setActiveCellByDelta(1, 0);\n }","function startNewRow (index, count) {\n console.log(index, count);\n return ((index) % count) === 0;\n }","function renumberRemainingRows(newRow, isIncreasing) {\n\n\tvar currentRow = $(newRow).next();\n\twhile($(currentRow).html() != null) {\n\t\t// Call changeRowNumbering to set attributes of currentRow\n\t\tchangeRowNumbering(currentRow, isIncreasing, false);\n\t currentRow = $(currentRow).next();\n\t}\n}","@computed get currentRow() { return `row_${this.currentStep - 1}` }","editNextCell() {\n if (!this.editing)\n return;\n var rowCount = this.table.find('tr.row').length - 1;\n var colCount = this.columns.count;\n var row = this._editingTd.data('rowIndex');\n var col = this._editingTd.data('columnIndex');\n if (col == colCount - 1 && row == rowCount - 1)\n return;\n if (col == colCount - 1) {\n col = 0;\n row++;\n }\n else {\n col++;\n }\n this.editCellAt(col, row);\n }","function updateRowNumberColumn() {\n // Update row number column size\n if (component.controller.rowNumbers) {\n // Get string size\n var rowNumberColumnSize = (String(getLastRecord()).length + 1) * component.scope.charSize;\n // Change column width\n var column = grid.api.grid.getColumn(\"rowNum\");\n var prevRowNumberWidth = column.width;\n if (prevRowNumberWidth !== rowNumberColumnSize) {\n column.width = Math.max(column.minWidth, rowNumberColumnSize);\n finishPendingActions();\n }\n }\n }","insertRowAfter() {\n this.insertRow(1);\n }","setNextColumnActive() {\n this._activeRowIndex < 0 ? this.setFirstCellActive() : this._setActiveCellByDelta(0, 1);\n }","updateRowCount(highestRowCount6)\n { \n let tempAddRowcount = highestRowCount6 - currentRowCount6\n let i = 0;\n \n for(i;i<(tempAddRowcount*6);i++)\n {\n //Add row empties with ids\n this.createEmptyRow();\n }\n\n this.rowCount6 = highestRowCount;\n }","function onNewTopRow() {\n increaseScore(20);\n }","function fillrowuntil(rownum, colnum){\n \ttn = {};\n \tbeforelength = two_dim_arr[rownum].length;\n \tconsole.info( typeof two_dim_arr[rownum][beforelength-1] == 'object' ? two_dim_arr[rownum][beforelength-1].colnum + two_dim_arr[rownum][beforelength-1].colspan : 0+1);\n \t\n \tvar pointer = ( typeof two_dim_arr[rownum][beforelength-1] == 'object' ? two_dim_arr[rownum][beforelength-1].colnum + two_dim_arr[rownum][beforelength-1].colspan : 0+1);\n \tfor(pointer; pointer <= colnum; pointer ++){\n \t\ttn.raw = '|';\n\t\t\t\ttn.text = ' ' + '\\n';\n\t\t\t\ttn.l = ' ';\n\t\t\t\ttn.r = ' ';\n\t\t\t\ttn.colnum = pointer;\n\t\t\t\ttn.rownum = rownum;\n\t\t\t\ttn.colspan = 1;\n\t\t\t\ttn.rowspan = 1;\n\t\t\t\ttn.height = 1;\n\t\t\t\ttn.h_align = 'default';\n\t\t\t\ttn.v_align = 'default';\n\t\t\t\t\n\t\t\t\ttwo_dim_arr[rownum].push(tn);\n\t\t\t\tconsole.warn('this row was extended to be able to put the content somewhere');\n if(debug){\n console.log(two_dim_arr[rownum]);\n }\n\t\t\t}\n }","function addRowIndex() {\r\n const table = $('#main').DataTable();\r\n \r\n table.rows().every( function ( rowIdx, tableLoop, rowLoop ) {\r\n const data = this.data();\r\n data[0] = rowIdx + 1;\r\n this.data(data);\r\n });\r\n}","function incrementColumn() {\n GameData.column = correctColumn(GameData.column++);\n}","function addRow(table) {\n var row = table.insertRow(table.rows.length);\n var cell = null;\n for (var i = 0; i < 5; i++) {\n cell = row.insertCell(i);\n if (i == 0) {\n cell.innerHTML = table.rows.length - 1;\n } else {\n cell.setAttribute(\"contenteditable\", \"true\");\n }\n }\n }","function component_viewer_res_data_calc_next_avail() {\n\tvar next_row = ic_soa_data_getSheetMetrics()[\"RESOURCEALLOCATION\"].toprow;\n\tfor (var cur_do = 0; cur_do < dataObjects.RESOURCEALLOCATIONkeys.length; cur_do++) {\n\t\tvar res_alloc_obj = dataObjects.RESOURCEALLOCATIONs[dataObjects.RESOURCEALLOCATIONkeys[cur_do]];\n\t\tif (res_alloc_obj.sheet_row >= next_row) next_row = res_alloc_obj.sheet_row+1;\n\t};\n\tcomponent_viewer_res_data_glob.next_avail = {\n\t\tnext_row: next_row\n\t};\n\t//console.log(\"Next row is \" + next_row);\n}","function changeRowNumbering(row, isIncreasing, creatingNewRow) {\n\n // Change row label contents\n var rowLabelElt = row.find(\"label\");\n var curRowNum = rowLabelElt.html();\n var rowQstIdAttr = rowLabelElt.attr(\"for\");\n \n // Update row label\n if(isIncreasing) {\n curRowNum++;\n }\n else {\n curRowNum--;\n }\n rowLabelElt.html(curRowNum);\n\n // Update question input\n var rowQstInputElt = row.find(\"input#\"+rowQstIdAttr);\n //var increaseNumbering = true;\n //steve talk to me about this change\n var increaseNumbering = isIncreasing;\n var newRowQstIdAttr = changeNumInString(rowQstIdAttr, increaseNumbering);\n var newRowQstNameAttr = changeNumInString(rowQstInputElt.attr(\"name\"), increaseNumbering);\n rowLabelElt.attr(\"for\",newRowQstIdAttr);\n rowQstInputElt.attr(\"id\",newRowQstIdAttr);\n rowQstInputElt.attr(\"name\",newRowQstNameAttr);\n\n // Update answer input\n var rowAnsInputElt = row.find(\"input:last\");\n var newRowIdAttr = changeNumInString(rowAnsInputElt.attr(\"id\"), increaseNumbering);\n var newRowNameAttr = changeNumInString(rowAnsInputElt.attr(\"name\"), increaseNumbering);\n rowAnsInputElt.attr(\"id\",newRowIdAttr);\n rowAnsInputElt.attr(\"name\",newRowNameAttr);\n \n // Update Order value\n var rowOrderInputElt = row.find(\"input[name$='[card_order]']\");\n var rowOrderIdAttr = rowOrderInputElt.attr(\"id\");\n var rowOrderValueAttr = parseFloat(rowOrderInputElt.attr(\"value\"));\n var newRowOrderIdAttr = changeNumInString(rowOrderIdAttr, increaseNumbering);\n var newRowOrderNameAttr = changeNumInString(rowOrderInputElt.attr(\"name\"), increaseNumbering);\n \n rowOrderInputElt.attr(\"id\",newRowOrderIdAttr);\n rowOrderInputElt.attr(\"name\",newRowOrderNameAttr);\n \n if(increaseNumbering) {\n newRowOrderValueAttr = rowOrderValueAttr + 1;\n }\n else {\n newRowOrderValueAttr = rowOrderValueAttr - 1;\n }\n rowOrderInputElt.attr(\"value\",newRowOrderValueAttr);\n \n \n // Update Id value\n var rowIdInputElt = row.find(\"input[name$='[id]']\");\n var rowIdIdAttr = rowIdInputElt.attr(\"id\");\n //checks to make sure this input element exists\n //this only exists on the edit decks page\n if (rowIdIdAttr != null) {\n \n var newRowIdIdAttr = changeNumInString(rowIdIdAttr, increaseNumbering);\n var newRowIdNameAttr = changeNumInString(rowIdInputElt.attr(\"name\"), increaseNumbering);\n \n rowIdInputElt.attr(\"id\",newRowIdIdAttr);\n rowIdInputElt.attr(\"name\",newRowIdNameAttr);\n //alert(rowIdInputElt.attr(\"value\") + \" \" + rowIdIdAttr +\" \" + newRowIdNameAttr);\n }\n \n // Clear the field values if row is new\n if(creatingNewRow) {\n rowQstInputElt.attr(\"value\",\"\");\n rowAnsInputElt.attr(\"value\",\"\");\n rowIdInputElt.attr(\"value\",\"\");\n \n }\n}","function addNextCell(row, attributes) {\n const aCell = row.insertCell(-1);\n [aCell.colSpan] = attributes;\n if (attributes[2]) { aCell.className = 'header'; }\n insertElement(aCell, attributes[1]);\n return aCell;\n}","function TableInitial(table_id, col_count, max_row_count) {\n if (max_row_count == undefined)\n {\n max_row_count = TABLE_ROW_COUNT;\n }\n\n if (col_count == undefined)\n {\n col_count = 14;\n }\n var table = document.getElementById(table_id);\n\n var row_count = table.tBodies[0].rows.length;\n\n\n while (row_count < max_row_count) {\n var new_row = table.tBodies[0].insertRow(row_count);\n\n for (var cell_index = 0; cell_index < col_count; cell_index++) {\n var cell = new_row.insertCell(-1);\n }\n //new_row.style.height = TABLE_ROW_HEIGHT;\n row_count = table.tBodies[0].rows.length;\n }\n\n // set row height\n\n for (var row_index = 0; row_index < row_count; row_index++) {\n var rows = table.tBodies[0].rows;\n rows[row_index].style.height = TABLE_ROW_HEIGHT;\n }\n\n // bind checkbox function\n TableCheckBoxInit(table_id);\n // TODO: highlight row by row\n}","function createNextFieldsCell(dataGridRecordNumber) {\n var cell, table;\n if (dataGridRecordNumber === self.recordHeader || dataGridRecordNumber === self.recordSearchInsert) {\n table = self.headerElem;\n } else {\n table = self.tableElem;\n }\n var recordNumber = dataGridRecordNumber - self.recordHeader;\n if (typeof self.pivot !== \"undefined\" && self.pivot == true) {\n // maybe move this into create record?? no b/c I have to set the row each time I iterate to new field\n self.tbl_cols = recordNumber;\n if (self.tbl_rows >= table.rows.length) { // row not there so create it\n debugger;\n alert(\"when is this code ever executed\");\n row = table.insertRow(self.tbl_rows);\n\n } else {\n row = table.rows[self.tbl_rows];\n }\n\n cell = row.insertCell(self.tbl_cols);\n cell.id = table.id+\",\"+ self.tbl_rows + \",\" + self.tbl_cols;\n self.tbl_rows++;\n } else {\n cell = row.insertCell(self.tbl_cols);\n cell.id = table.id+\",\"+ recordNumber + \",\" + self.tbl_cols;\n self.tbl_cols++;\n }\n // highlight rows after a sort\n if (typeof self.idsHighlighted !== 'undefined') {\n for (var i = 0; i < self.idsHighlighted.length; i += 1) {\n if (self.idsHighlighted[i] === data.grid[dataGridRecordNumber][self.primaryKey]) {\n self.highlightRow(row, true);\n //cell.className = 'highlightedrow ' + cell.className;\n break;\n }\n }\n }\n return cell;\n }","updateSize() {\n\t\tvar t = this;\n\t\tvar len = t.getLength();\n\t\tif (len == 0) {\n\t\t\tt.setLength(1);\n\t\t} if (len > 0) {\n\t\t\tvar needsNew = !t.isRowBlank(t.getRow(len - 1));\n\t\t\tif (needsNew)\n\t\t\t\tt.setLength(len + 1);\n\t\t\telse if (len > 1) {\n\t\t\t\tvar needsRem = t.isRowBlank(t.getRow(len - 1));\n\t\t\t\tif (needsRem) {\n\t\t\t\t\tt.setLength(len - 1);\n\t\t\t\t\tt.updateSize();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","set _physicalStart(val){val=val%this._physicalCount;if(0>val){val=this._physicalCount+val}if(this.grid){val=val-val%this._itemsPerRow}this._physicalStartVal=val}","function dap_nextRow()\n{\n\tthis.saveData(this.getCurrentRow());\n\tif (this.DynamicTable.nextRow() == true)\n\t{\n\t\tvar boolflag = this.DataSource[this.getRecordIndex(\n\t\t\t\tthis.getCurrentRow())][this.DataSource[0].length-1];\n\t\tthis.DynamicTable.disableRow(this.getCurrentRow(),\n\t\t\t\t((boolflag == constLoadStatus)||(boolflag == constUpdateStatus)));\n\t}\n}","function addColumn(){\r\n $('tr').append('
');\r\n column++;\r\n }","_addRow() {\n const indicativeRow = this._hoveredCell.closest('TR');\n let index = this._getHoveredSideOfContainer();\n\n if (index === 1) {\n index = indicativeRow.sectionRowIndex;\n // if inserting after hovered cell\n index = index + this._isBottomOrRight();\n }\n\n this._table.addRow(index);\n }","function render_prev_row() {\n\n current_row = (current_row == 0) ? current_row : current_row - 1;\n render_row(current_row)\n\n}","grow() {\n let lastTail = this.tail[tail.length - 1];\n if (this.tail.length < 1) {\n lastTail = this.tail[tail.length];\n }\n this.tail.push(new Position(lastTail.row, lastTail.column));\n score += 10;\n }","function numberRows() {\n if(name != meshShorts) {\n $(\".row_number\").each(function(i) {\n var n = ++i;\n var row_number = (\"0\" + n).slice(-2);\n $(this).find(\"font\").text(row_number);\n });\n $(\".row_number_mobile\").each(function() {\n var row_number_mobile = $(this).parent().prev().find('td:first').text()\n $(this).find(\"font\").text(row_number_mobile);\n });\n }\n }","initRow() {\n let prevSetNr = 1; // previous set number holder\n for (let i = 1; i <= this.width; i++) {\n // Initialize cells that are not yet initialized by previous row\n if (!this.cell[i]) {\n for (let j = prevSetNr; j <= this.width; j++) {\n if (!this.set[j]) {\n prevSetNr = j;\n break;\n }\n }\n this.set[prevSetNr] = [i];\n this.cell[i] = prevSetNr;\n }\n }\n }","_incrementMaxIndex() {\n if (this._maxIndex < this._capacity) {\n this._maxIndex++;\n }\n }","_updateGridRows() {\n\n [...this.element.children].forEach((item, i) => {\n let index = i % this.maxItemsPerRow;\n let position;\n if ( index === 0){\n this.rows.push([]);\n }\n\n position = this._getItemPosition(index);\n this.rows[this.lastIndex].push({item: item, position: position});\n });\n }","function handleNextButtonClick() {\n count++;\n renderTable();\n}","function handleNextButtonClick() {\n count++;\n renderTable();\n}","function ResetRowNumber(grd) {\n var items = grd.getData();\n if (items != null) {\n for (var i = 0; i < items.length; i++) {\n items[i].RowNum = i + 1;\n grd.updateRow(i, items);\n grd.updateRowCount();\n grd.render();\n }\n }\n }","function rowCalc(num){\n var row = num;\n while (row>3){\n row -= 3;\n }\n return row;\n}","next() {\n const that = this,\n availableItems = that.dataSource.length;\n \n if (that.disabled || availableItems === 0) {\n return;\n }\n\n let nextItem = that._currentIndex;\n\n if(that.loop){\n nextItem = nextItem >= availableItems-1 ? 0 : nextItem + 1;\n }\n else {\n nextItem = nextItem >= availableItems-1 ? nextItem : nextItem + 1;\n }\n\n that._goToItem(nextItem);\n }","function WEndRec()\n{\n this.WSetRow(this.rows - 1);\n}","function adjustRowStatuses() {\n for (var i = 0; i < $scope.rows.length; i++) {\n if ($scope.rows[i].status === 'Not Started') {\n $scope.rows[i].status = 'Next';\n break;\n }\n }\n }","function renumberColumns(){\n\t\t$(table + \"tr:first td\").each(function(i){\n\t\t\t$(this).attr(\"id\", i+1);\t\n\t\t});\n\t}","set _physicalStart(val){val=val%this._physicalCount;if(val<0){val=this._physicalCount+val;}if(this.grid){val=val-val%this._itemsPerRow;}this._physicalStartVal=val;}","next () {\n const before = this.value\n if (this.value < this.list.length - 1) this.$emit('input', this.value + 1)\n if (!this.scroll) return\n\n this.$nextTick(() => {\n if (this.value === before) return\n const list = this.$refs.list\n const cur = list.querySelector('.sm-over').getBoundingClientRect()\n const listPos = list.getBoundingClientRect()\n const dist = (list.scrollTop + cur.bottom) - listPos.bottom\n if (dist > 0) {\n // when current row is the last row, the scroll bar moves directly to the bottom\n if (this.value === this.list.length - 1) {\n list.scrollTop = dist + Number.parseInt(window.getComputedStyle(list).paddingBottom)\n } else {\n list.scrollTop = dist\n }\n }\n })\n }","function agregarNumeracionItem() {\n var tablaC = document.getElementById(\"tablaBodyCotizacion\"),\n rIndex;\n var nFilas = $(\"#tablaBodyCotizacion > tr\").length;\n for (var i = 0; i < nFilas; i++) {\n tablaC.rows[i].cells[0].innerHTML = i + 1;\n\n }\n\n}","function changeCurrentRow(){\r\n currentRow -= 1;\r\n var mult = 4;\r\n\r\n currentBoardCells = [\r\n \"board\" + (currentRow*mult-4), \r\n \"board\" + (currentRow*mult-3), \r\n \"board\" + (currentRow*mult-2), \r\n \"board\" + (currentRow*mult-1)];\r\n currentPegCells = [\r\n \"peg\" + (currentRow*mult-4), \r\n \"peg\" + (currentRow*mult-3), \r\n \"peg\" + (currentRow*mult-2), \r\n \"peg\" + (currentRow*mult-1)];\r\n }","insertColumnAfter() {\n this.insertColumn(1);\n }","function _pushMoreRows(prevInd, limit, pushMoreID) {\n if ($rootScope.pushMoreID === pushMoreID) {\n var nextLimit = prevInd + limit;\n // combines all of the second array (rowValues) with the first one (vm.rowValues)\n Array.prototype.push.apply(vm.rowValues, rowValues.slice(prevInd, nextLimit));\n if (rowValues[nextLimit]) {\n $log.debug(\"counter\", current, \": recurse with\", vm.rowValues.length);\n $timeout(function () {\n if ($rootScope.pushMoreID === pushMoreID) {\n _pushMoreRows(nextLimit, limit, pushMoreID);\n } else {\n $log.debug(\"current global counter: \", vm.flowControlObject.counter);\n $log.debug(\"counter\", current, \": break out of timeout inside push more rows\");\n $log.debug(\"counter\", current, \": with uuid\", pushMoreID);\n $log.debug(\"counter\", current, \": with global uuid\", $rootScope.pushMoreID);\n vm.pushRowsSpinner = false;\n }\n });\n } else {\n // we reached the end of the data to page in\n vm.pushRowsSpinner = false;\n }\n } else {\n $log.debug(\"current global counter: \", vm.flowControlObject.counter);\n $log.debug(\"counter\", current, \": break out of push more rows\");\n $log.debug(\"counter\", current, \": with uuid\", pushMoreID);\n $log.debug(\"counter\", current, \": with global uuid\", $rootScope.pushMoreID);\n vm.pushRowsSpinner = false;\n }\n }","function prepData(rows) {\n var i = 1;\n rows.forEach( (row) => {\n row.index = i;\n if (row.Count) {\n row.Count = +row.Count;\n }\n i++;\n });\n return rows;\n}","function getRow(i) {\n return Math.ceil((i+1)/3);\n}","function _addDeadRow(amount) {\n for (const i = 0; i < amount; i++) {\n let row = [];\n for(let j = 0; j < consts.COLUMN_COUNT; j++){\n row.push('#000000');\n }\n matrix.push(row);\n matrix.shift();\n }\n}","_transform(row, encoding, callback) {\n const xlsxRow = (0, _templates.Row)(this.rowCount, row, this.format, this.styles);\n this.rowCount++;\n callback(null, xlsxRow);\n }","nextStop(x) {\n if (x === null || x === undefined) {\n x = this.x;\n }\n while (!this.tabs[++x] && x < this._cols)\n ;\n return x >= this._cols ? this._cols - 1 : x < 0 ? 0 : x;\n }","function addRowDrag(){\n\tvar column = $(this).prop(\"columnIndex\")\n\tvar workingIndex;\n\t$(this).addClass(\"loop\")\n\t\t .bind(\"mousedown\", startRowDrag)\n\t$(workingMiniLoop).each(function(index) { \n\t\t$(getTheButton(rowAffected + 12, workingMiniLoop[index])).removeClass(\"loop\")\n\t\t\t\t\t\t\t\t\t\t\t\t .addClass(\"punch\");\n\t});\n\tworkingMiniLoop = [mightJumpToHere];\n\tif(column > workingMiniLoop[0]){\n\t\tworkingIndex = column\n\t\tfor(i = 0; i < column - workingMiniLoop[0]; i++){\n\t\t\tworkingMiniLoop.push(workingIndex);\n\t\t\tworkingIndex--;\t\t\t\n\t\t}\n\t}\n\telse{\n\t\tworkingIndex = column\n\t\tfor(i = 0; i < workingMiniLoop[0] - column ; i++){\n\t\t\tworkingMiniLoop.push(workingIndex);\n\t\t\tworkingIndex++;\t\t\t\n\t\t}\n\t}\n\t$(workingMiniLoop).each(function(index) { \n\t\t$(getTheButton(rowAffected + 12,workingMiniLoop[index]))\n\t\t\t\t\t\t\t\t\t\t\t\t .addClass(\"loop\");\n\t});\n}","function appendRowNumbers() {\n\n // Append row number to row classes\n var numberOfRows = $('.row').length;\n\n for (var i=1; i<=numberOfRows; i++) {\n var thisClass = 'row-' + i;\n var thisRow = $('.row').eq(i-1)\n thisRow.addClass(thisClass);\n }\n\n}","function nextButtonClick() {\r\n count++;\r\n renderTable();\r\n}","resize(newCols, newRows) {\n // store reference to null cell with default attrs\n const nullCell = this.getNullCell(DEFAULT_ATTR_DATA);\n // Increase max length if needed before adjustments to allow space to fill\n // as required.\n const newMaxLength = this._getCorrectBufferLength(newRows);\n if (newMaxLength > this.lines.maxLength) {\n this.lines.maxLength = newMaxLength;\n }\n // The following adjustments should only happen if the buffer has been\n // initialized/filled.\n if (this.lines.length > 0) {\n // Deal with columns increasing (reducing needs to happen after reflow)\n if (this._cols < newCols) {\n for (let i = 0; i < this.lines.length; i++) {\n this.lines.get(i).resize(newCols, nullCell);\n }\n }\n // Resize rows in both directions as needed\n let addToY = 0;\n if (this._rows < newRows) {\n for (let y = this._rows; y < newRows; y++) {\n if (this.lines.length < newRows + this.ybase) {\n if (this._optionsService.options.windowsMode) {\n // Just add the new missing rows on Windows as conpty reprints the screen with it's\n // view of the world. Once a line enters scrollback for conpty it remains there\n this.lines.push(new BufferLine(newCols, nullCell));\n }\n else {\n if (this.ybase > 0 && this.lines.length <= this.ybase + this.y + addToY + 1) {\n // There is room above the buffer and there are no empty elements below the line,\n // scroll up\n this.ybase--;\n addToY++;\n if (this.ydisp > 0) {\n // Viewport is at the top of the buffer, must increase downwards\n this.ydisp--;\n }\n }\n else {\n // Add a blank line if there is no buffer left at the top to scroll to, or if there\n // are blank lines after the cursor\n this.lines.push(new BufferLine(newCols, nullCell));\n }\n }\n }\n }\n }\n else { // (this._rows >= newRows)\n for (let y = this._rows; y > newRows; y--) {\n if (this.lines.length > newRows + this.ybase) {\n if (this.lines.length > this.ybase + this.y + 1) {\n // The line is a blank line below the cursor, remove it\n this.lines.pop();\n }\n else {\n // The line is the cursor, scroll down\n this.ybase++;\n this.ydisp++;\n }\n }\n }\n }\n // Reduce max length if needed after adjustments, this is done after as it\n // would otherwise cut data from the bottom of the buffer.\n if (newMaxLength < this.lines.maxLength) {\n // Trim from the top of the buffer and adjust ybase and ydisp.\n const amountToTrim = this.lines.length - newMaxLength;\n if (amountToTrim > 0) {\n this.lines.trimStart(amountToTrim);\n this.ybase = Math.max(this.ybase - amountToTrim, 0);\n this.ydisp = Math.max(this.ydisp - amountToTrim, 0);\n this.savedY = Math.max(this.savedY - amountToTrim, 0);\n }\n this.lines.maxLength = newMaxLength;\n }\n // Make sure that the cursor stays on screen\n this.x = Math.min(this.x, newCols - 1);\n this.y = Math.min(this.y, newRows - 1);\n if (addToY) {\n this.y += addToY;\n }\n this.savedX = Math.min(this.savedX, newCols - 1);\n this.scrollTop = 0;\n }\n this.scrollBottom = newRows - 1;\n if (this._isReflowEnabled) {\n this._reflow(newCols, newRows);\n // Trim the end of the line off if cols shrunk\n if (this._cols > newCols) {\n for (let i = 0; i < this.lines.length; i++) {\n this.lines.get(i).resize(newCols, nullCell);\n }\n }\n }\n this._cols = newCols;\n this._rows = newRows;\n }","function nextRow( bSuccess )\n{\n // Clear highlighting\n $( '#bgt_table > tbody .' + g_sPendingClass ).removeClass( g_sPendingClass );\n $( '#bgt_table > tbody .' + g_sSuccessClass ).removeClass( g_sSuccessClass );\n\n // If current row contains new, live data, highlight it\n if ( bSuccess && ! g_tCachedValues )\n {\n $( '#row_' + g_iRow ).addClass( g_sSuccessClass );\n }\n\n // Advance row index\n if ( g_iRow < ( g_aRows.length - 1 ) )\n {\n // Advance to next row\n g_iRow ++;\n if ( ! g_tCachedValues )\n {\n enableRefreshButton( true );\n }\n }\n else\n {\n // Finished last row\n g_iRow = 0;\n g_tCachedValues = null;\n stopRefresh();\n enableRefreshButton( true );\n $( '.sortable' ).removeClass( 'sorter-false' );\n console.log( '=> View initialized in ' + ( Date.now() - g_iStartTime ) + ' ms' );\n }\n\n // Reinitialize variables\n g_iInstanceOffset = 2;\n g_aRowData = [];\n\n // Update tablesorter event handlers\n g_tTable.off( 'sortEnd' );\n g_tTable.off( 'filterEnd' );\n g_tTable.on( 'sortEnd', onSortEnd );\n g_tTable.on( 'filterEnd', onFilterEnd );\n g_tTable.on( 'tablesorter-ready', onTablesorterReady );\n\n // Trigger event to update tablesorter cache\n g_tTable.trigger( 'update' );\n}","function WPrevRec()\n{\n this.WSetRow(this.currow - 1);\n}","function wrappedRowsForRow(bufferService, currentRow) {\n let rowCount = 0;\n let line = bufferService.buffer.lines.get(currentRow);\n let lineWraps = line && line.isWrapped;\n while (lineWraps && currentRow >= 0 && currentRow < bufferService.rows) {\n rowCount++;\n line = bufferService.buffer.lines.get(--currentRow);\n lineWraps = line && line.isWrapped;\n }\n return rowCount;\n}","add6Row()\n {\n\n //loop through (6 times)*(rowCount)\n //give ids based on row\n\n }","function addColumn(row) {\n\n var gridSize = 0;\n for (var i = 0; i < row.cols.length; i++) {\n\n var size = row.cols[i].cssClass.substr(row.cols[i].cssClass.length - 2);\n size = parseInt(size.replace(/-/g, ''));\n gridSize = gridSize + size;\n }\n if (gridSize < 12) {\n row.cols.push(OdsFormService.newColumnObject(12 - gridSize));\n } else {\n dialogs.notify('Notification', 'Columns can\\'t be greater than 12 columns, please fix it!!!',\n {size: 'sm', windowClass: 'ods-dialog'}).result.then(function () {\n });\n }\n }","function populateCurrentColumn(){\n for( var i = 0; i < totalTableRows; i++ ){\n var x = tbl.tBodies[0].rows[i].cells[currentIndex];\n //currentColumn.push(x);\n currentColumn.push(x.cloneNode(true));\n }\n }","function increaseDifficulty() {\n setGridInvisible();\n if (!isGreatestDimension()) {\n if (row < col) {\n setGrid(row+1, col);\n } else {\n setGrid(row, col+1);\n }\n }\n resetGrid(\"increase\");\n}","function appendDownRow(x)\n{\n\tvar tb1 = document.getElementById('qis');\n\tvar row = tb1.insertRow(x + 1); //localizar el ultimo renglon de la tabla para añadir uno nuevo\n\tvar i = 0;\n\tfor(i = 0; i < tb1.rows[0].cells.length; i++)//conocer cuantas celdas hay en los renglones para añadirlos al nuevo renglon.\n\t{\n\t\tcreateCell(row.insertCell(i),i,0);\n\t}\n}","function maxRow(add,remove,max,index)\r\n{\t\r\n\tif(index)\n this.setState(\n {\n rows: newRow\n }\n )\n }","function _helper(lastRow){\n // console.log('xx helper');\n if (options.maxRows && rows > options.maxRows || options.truncate && lastRow && rows > 1) row[currentImageIndex][0].style.display = 'none';\n else {\n // console.log(row[currentImageIndex][4]);\n if (row[currentImageIndex][4]) {\n row[currentImageIndex][3].setAttribute('src', row[currentImageIndex][4]);\n row[currentImageIndex][4] = '';\n }\n row[currentImageIndex][0].style.width = newWidth+'px';\n row[currentImageIndex][0].style.height = row_h+'px';\n row[currentImageIndex][0].style.display = 'block';\n }\n }","incrCursor() {\n const last = this.getLastHistory().groups;\n if (this.cursorIndex === null) {\n this.cursorIndex = 0;\n return;\n }\n if (this._overwrite) {\n if (this.cursorIndex < last.length) {\n // ?\n this.cursorIndex++;\n } else {\n return;\n }\n }\n if (!this._overwrite) {\n if (this.cursorIndex < last.length - 1) {\n // ?\n this.cursorIndex++;\n } else {\n }\n }\n }","function emptyCellsUntil(endCol) {\n while (col < endCol) {\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\n td = (loneCellMatrix[i - 1] || [])[col];\n\n if (td) {\n td.rowSpan = (td.rowSpan || 1) + 1;\n } else {\n td = document.createElement('td');\n tr.appendChild(td);\n }\n\n cellMatrix[i][col] = td;\n loneCellMatrix[i][col] = td;\n col++;\n }\n }","boldColumn(lastSlotNum) {\n for (let i = lastSlotNum; i >= 0; i -= 7) {\n this.getSlot(i).style.border = '4px solid black';\n }\n }","function extendList(btn) { // btn is an a-tag in this case\n const ROWS_TO_EXPAND = 10;\n var addedRows = 0;\n var showMoreRow = btn.parentNode.parentNode;\n var currentRow = showMoreRow;\n\n while (currentRow.nextElementSibling !== null && addedRows < ROWS_TO_EXPAND) {\n currentRow.nextElementSibling.removeAttribute('style');\n currentRow = currentRow.nextElementSibling;\n addedRows++;\n }\n if (currentRow.nextElementSibling !== null) currentRow.insertAdjacentHTML('afterend', '
' + showMoreRow.innerHTML + '
');\n showMoreRow.remove();\n}","fillBelow(newTop) {\n const me = this,\n fillHeight = newTop - me.topRow.top - me.prependBufferHeight,\n recordCount = me.store.count,\n rowCount = me.rowCount;\n\n let accumulatedHeight = 0;\n\n // Repeat until we have filled empty height\n while (\n accumulatedHeight < fillHeight && // fill empty height\n me.topIndex + rowCount < recordCount && // as long as we have records left\n me.topRow.top + me.topRow.offsetHeight < newTop // and do not run move top row fully into view (can happen with var row height)\n ) {\n // We want to show next record at bottom of rows\n accumulatedHeight += me.displayRecordAtBottom();\n }\n }","set rows(value) {\n Helper.UpdateInputAttribute(this, 'rows', value);\n }","function insert_Row() {\n const table = document.getElementById('sampleTable');\n let rowNumber = table.children.length+1;\n \n const newElement = `\n
Row${rowNumber} cell1
\n
Row${rowNumber} cell2
`\n ;\n table.innerHTML += newElement;\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 reloadNumbers() {\n\n var counts = 0;\n\n $('tr.active').each(function() {\n if (counts === 0) {\n this.cells[0].innerHTML = '>';\n } else {\n this.cells[0].innerHTML = counts;\n }\n $('#total_columns').text('Total: ' + counts);\n\n counts++;\n });\n\n}","initialize(size){\n for (let i = 0; i < size; i++) {\n let $row = this.$table.insertRow(i);\n for (let j = 0; j < size; j++) {\n $row.insertCell(j);\n }\n }\n }","function onInsertRowAfter() {\n onInsertRow(1);\n }","fillBelow(newTop) {\n const me = this,\n fillHeight = newTop - me.topRow.top - me.prependBufferHeight,\n recordCount = me.store.count,\n rowCount = me.rowCount;\n let accumulatedHeight = 0; // Repeat until we have filled empty height\n\n while (accumulatedHeight < fillHeight && // fill empty height\n me.topIndex + rowCount < recordCount && // as long as we have records left\n me.topRow.top + me.topRow.offsetHeight < newTop // and do not move top row fully into view (can happen with var row height)\n ) {\n // We want to show next record at bottom of rows\n accumulatedHeight += me.displayRecordAtBottom();\n }\n\n me.trigger('renderDone');\n }","__increment() {\n const { step, max } = this.values;\n const newValue = this.currentValue + step;\n if (newValue <= max || max === Infinity) {\n this.value = newValue;\n this.__toggleSpinnerButtonsState();\n }\n }","handlerForwardClick() {\n let dealers = this.state.delers;\n let rows = [];\n var count = 0;\n\n if (dealers.length < this.state.pointer + 10) {\n for (var i = this.state.pointer; i < dealers.length; i++) {\n rows[count] = dealers[i];\n count++;\n }\n this.state.page += 1;\n this.setState({\n rows: rows,\n forwardDisabled: true,\n backDisabled: false\n });\n } else {\n this.state.nextPointer = this.state.pointer + 10;\n for (var i = this.state.pointer; i < this.state.nextPointer; i++) {\n rows[count] = dealers[i];\n count++;\n }\n let pointer = this.state.pointer + 10;\n this.state.page += 1;\n this.setState({\n rows: rows,\n backDisabled: false,\n pointer: pointer\n });\n }\n }","function emptyCellsUntil(endCol) {\n while (col < endCol) {\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\n td = (loneCellMatrix[i - 1] || [])[col];\n if (td) {\n td.rowSpan = (td.rowSpan || 1) + 1;\n }\n else {\n td = document.createElement('td');\n tr.appendChild(td);\n }\n cellMatrix[i][col] = td;\n loneCellMatrix[i][col] = td;\n col++;\n }\n }","function emptyCellsUntil(endCol) {\n while (col < endCol) {\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\n td = (loneCellMatrix[i - 1] || [])[col];\n if (td) {\n td.rowSpan = (td.rowSpan || 1) + 1;\n }\n else {\n td = document.createElement('td');\n tr.appendChild(td);\n }\n cellMatrix[i][col] = td;\n loneCellMatrix[i][col] = td;\n col++;\n }\n }","function emptyCellsUntil(endCol) {\n while (col < endCol) {\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\n td = (loneCellMatrix[i - 1] || [])[col];\n if (td) {\n td.rowSpan = (td.rowSpan || 1) + 1;\n }\n else {\n td = document.createElement('td');\n tr.appendChild(td);\n }\n cellMatrix[i][col] = td;\n loneCellMatrix[i][col] = td;\n col++;\n }\n }","function addColumn() {\n if (row === 0) {\n let newRow = document.createElement(\"tr\");\n let newcol = document.createElement(\"td\");\n\n newRow.appendChild(newcol);\n table.appendChild(newRow);\n row = 1;\n } else {\n let currentRow = document.getElementsByTagName(\"tr\");\n let rowArray = Array.from(currentRow);\n rowArray.forEach((row) => {\n let newcol = document.createElement(\"td\");\n row.appendChild(newcol);\n });\n row++;\n }\n column++;\n}","function randomRowColumnNumber(max){\n const number= Math.floor(Math.random() * max) + 1;\n return number;\n}","function emptyCellsUntil(endCol) {\n while (col < endCol) {\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\n td = (loneCellMatrix[i - 1] || [])[col];\n if (td) {\n td.rowSpan = (td.rowSpan || 1) + 1;\n }\n else {\n td = document.createElement('td');\n tr.appendChild(td);\n }\n cellMatrix[i][col] = td;\n loneCellMatrix[i][col] = td;\n col++;\n }\n }","function setThePositions(currentR, currentC, nextR, nextC, incrNextRow, incrNextColl) {\r\n\tif(currentR && currentC && currentR !== null && currentC !== null) {\r\n\t\tlastRow = currentR;\r\n\t\tlastColl = currentC;\r\n\t}\r\n\tif(nextR && nextC && nextR !== null && nextC !== null) {\r\n\t\tcurrentRow = nextR;\r\n\t\tcurrentColl = nextC;\r\n\t}\r\n\tif(incrNextRow && incrNextColl && incrNextRow !== null && incrNextColl !== null) {\r\n\t\tnextRow = incrNextRow;\r\n\t\tnextColl = incrNextColl;\r\n\t} else {\r\n\t\tnextRow = currentRow + 1;\r\n\t\tnextColl = currentColl;\r\n\t}\r\n}","function setNumbers() {\n\t\tvar count = 1;\n\t\t$(\"#displayTable\").find(\"tr\").each(function(count) {\n\t\t\tvar s = count;\n\t\t\t$(this).children(\"td:first\").html(s);\n\t\t\ts++;\n\t\t\t\n\t\t});\n\t\tcount = 1;\n\t}","function emptyCellsUntil(endCol) { // goes from current `col` to `endCol`\n while (col < endCol) {\n cell = _this.getCell(row, col);\n segsBelow = _this.getCellSegs(cell, levelLimit);\n if (segsBelow.length) {\n td = cellMatrix[levelLimit - 1][col];\n moreLink = _this.renderMoreLink(cell, segsBelow);\n moreWrap = $('').append(moreLink);\n td.append(moreWrap);\n moreNodes.push(moreWrap[0]);\n }\n col++;\n }\n }","function increaseMatrix() {\r\n storeMatrix();\r\n var matrix = getMatrix().map(row => {\r\n row.push('1');\r\n return row;\r\n });\r\n matrix.push(new Array(matrix.length + 1).fill('1'));\r\n localStorage.setItem('matrix', JSON.stringify(matrix));\r\n createTable();\r\n}","function removeTableRow() {\n if (Number($(\"#rows\").val()) > 4) {\n $(\"tr\").last().remove();\n $(\"#rows\").prop(\"value\", Number($(\"#rows\").val()) - 1);\n }\n changes = true;\n}","function addRow(){\r\n $('#pixel_canvas').append('
');\r\n var newRow=$('#pixel_canvas').children().last();\r\n for(var i=0;i');\r\n }\r\n row++;\r\n }","function add_horizontal_hint_row() {\n var total_litags = 0;\n var total_limit = 1;\n jQuery('#crosswordsContainerDivRowColumn .crosswords-hint-hrow-litag').each(function (index, value) {\n index += 1;\n var valueIs = jQuery('.crosswords-hint-hrowline-' + index).is(\":visible\");\n if (valueIs) {\n total_litags += 1;\n }\n total_limit++;\n });\n total_litags += 1;\n if (total_litags < total_limit) {\n jQuery('.crosswords-hint-hrowline-' + total_litags).show();\n } else {\n jQuery('.add_remove_horizontal_row_hint_msg').html('Can\\'t Add anymore!');\n jQuery('.add_remove_horizontal_row_hint_msg').delay(5000).fadeOut(1600);\n }\n var horizontal_rowcolinpval = get_all_inputfrom_hrorizontal_hint();\n jQuery('#edit-field-crosswords-hrow-0-value').val(horizontal_rowcolinpval);\n }","function unshift(row) {\n while (row.length != 4) {\n row.unshift(0)\n }\n return row;\n}","function emptyCellsUntil(endCol) {\n while (col < endCol) {\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\n td = (loneCellMatrix[i - 1] || [])[col];\n if (td) {\n td.attr(\n 'rowspan',\n parseInt(td.attr('rowspan') || 1, 10) + 1\n );\n }\n else {\n td = $('
');\n tr.append(td);\n }\n cellMatrix[i][col] = td;\n loneCellMatrix[i][col] = td;\n col++;\n }\n }"],"string":"[\n \"function render_next_row() {\\n\\n current_row = (current_row + 1) % DataManager.imported_data.length;\\n render_row(current_row);\\n\\n}\",\n \"function getNextEditableRow() {\\r\\n\\t\\t\\trowNum = parseInt(rowNum) + 1;\\r\\n\\t\\t\\teditableFieldsList = getEditableFieldListInOrder(nmsp, rowNum);\\r\\n\\t\\t\\tvar maxVisibleRowNum = parseInt(grid.getRowCount()) + parseInt(initRowNum);\\r\\n\\t\\t\\tif (editableFieldsList && editableFieldsList.length > 0) {\\r\\n\\t\\t\\t\\tnextEditableCol = editableFieldsList[0];\\r\\n\\t\\t\\t\\tnextEditableFieldId = getNextGridFieldId(rowNum, nextEditableCol);\\r\\n\\t\\t\\t} else if (maxVisibleRowNum < rowNum && grid.getBodyContainer().maxVerticalScrollPosition > $(gridBlockElem).scrollTop()) { // if maximum number visible rows exceeded then scroll write the next set\\r\\n\\t\\t\\t\\tvar ypos = $(gridBlockElem).scrollTop() + grid.getBodyContainer().height - grid.getBodyContainer().verticalMask;\\r\\n\\t\\t\\t\\tif (grid.getBodyContainer()._calculatedTotalHeight > ypos) {\\r\\n\\t\\t\\t\\t\\t$(gridBlockElem).animate({\\r\\n\\t\\t\\t\\t\\t\\t'scrollTop': ypos\\r\\n\\t\\t\\t\\t\\t}, 300, '', function () {\\r\\n\\t\\t\\t\\t\\t\\tsetTimeout(function () {\\r\\n\\t\\t\\t\\t\\t\\t\\trowNum = initRowNum;\\r\\n\\t\\t\\t\\t\\t\\t\\tgetNextEditableRow();\\r\\n\\t\\t\\t\\t\\t\\t}, 400);\\r\\n\\r\\n\\t\\t\\t\\t\\t});\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else if ((grid.getBodyContainer().maxVerticalScrollPosition > $(gridBlockElem).scrollTop()) || (Object.keys(nmsp.rowEditableColumnMap).length > rowNum))\\r\\n\\t\\t\\t\\tgetNextEditableRow();\\r\\n\\t\\t}\",\n \"function WSetRow(num)\\n{\\n if (num < 0) \\n this.currow = 0;\\n else if (num >= this.rows)\\n this.currow = this.rows - 1;\\n else\\n this.currow = num;\\n}\",\n \"function WNextRec()\\n{\\n this.WSetRow(this.currow + 1);\\n}\",\n \"function setRowNumber() {\\n $self.find('td.js-row-no').each(function (i) {\\n i = i + 1;\\n $(this).text(i);\\n });\\n }\",\n \"setNextRowActive() {\\n this._activeRowIndex < 0 ? this.setFirstCellActive() : this._setActiveCellByDelta(1, 0);\\n }\",\n \"function startNewRow (index, count) {\\n console.log(index, count);\\n return ((index) % count) === 0;\\n }\",\n \"function renumberRemainingRows(newRow, isIncreasing) {\\n\\n\\tvar currentRow = $(newRow).next();\\n\\twhile($(currentRow).html() != null) {\\n\\t\\t// Call changeRowNumbering to set attributes of currentRow\\n\\t\\tchangeRowNumbering(currentRow, isIncreasing, false);\\n\\t currentRow = $(currentRow).next();\\n\\t}\\n}\",\n \"@computed get currentRow() { return `row_${this.currentStep - 1}` }\",\n \"editNextCell() {\\n if (!this.editing)\\n return;\\n var rowCount = this.table.find('tr.row').length - 1;\\n var colCount = this.columns.count;\\n var row = this._editingTd.data('rowIndex');\\n var col = this._editingTd.data('columnIndex');\\n if (col == colCount - 1 && row == rowCount - 1)\\n return;\\n if (col == colCount - 1) {\\n col = 0;\\n row++;\\n }\\n else {\\n col++;\\n }\\n this.editCellAt(col, row);\\n }\",\n \"function updateRowNumberColumn() {\\n // Update row number column size\\n if (component.controller.rowNumbers) {\\n // Get string size\\n var rowNumberColumnSize = (String(getLastRecord()).length + 1) * component.scope.charSize;\\n // Change column width\\n var column = grid.api.grid.getColumn(\\\"rowNum\\\");\\n var prevRowNumberWidth = column.width;\\n if (prevRowNumberWidth !== rowNumberColumnSize) {\\n column.width = Math.max(column.minWidth, rowNumberColumnSize);\\n finishPendingActions();\\n }\\n }\\n }\",\n \"insertRowAfter() {\\n this.insertRow(1);\\n }\",\n \"setNextColumnActive() {\\n this._activeRowIndex < 0 ? this.setFirstCellActive() : this._setActiveCellByDelta(0, 1);\\n }\",\n \"updateRowCount(highestRowCount6)\\n { \\n let tempAddRowcount = highestRowCount6 - currentRowCount6\\n let i = 0;\\n \\n for(i;i<(tempAddRowcount*6);i++)\\n {\\n //Add row empties with ids\\n this.createEmptyRow();\\n }\\n\\n this.rowCount6 = highestRowCount;\\n }\",\n \"function onNewTopRow() {\\n increaseScore(20);\\n }\",\n \"function fillrowuntil(rownum, colnum){\\n \\ttn = {};\\n \\tbeforelength = two_dim_arr[rownum].length;\\n \\tconsole.info( typeof two_dim_arr[rownum][beforelength-1] == 'object' ? two_dim_arr[rownum][beforelength-1].colnum + two_dim_arr[rownum][beforelength-1].colspan : 0+1);\\n \\t\\n \\tvar pointer = ( typeof two_dim_arr[rownum][beforelength-1] == 'object' ? two_dim_arr[rownum][beforelength-1].colnum + two_dim_arr[rownum][beforelength-1].colspan : 0+1);\\n \\tfor(pointer; pointer <= colnum; pointer ++){\\n \\t\\ttn.raw = '|';\\n\\t\\t\\t\\ttn.text = ' ' + '\\\\n';\\n\\t\\t\\t\\ttn.l = ' ';\\n\\t\\t\\t\\ttn.r = ' ';\\n\\t\\t\\t\\ttn.colnum = pointer;\\n\\t\\t\\t\\ttn.rownum = rownum;\\n\\t\\t\\t\\ttn.colspan = 1;\\n\\t\\t\\t\\ttn.rowspan = 1;\\n\\t\\t\\t\\ttn.height = 1;\\n\\t\\t\\t\\ttn.h_align = 'default';\\n\\t\\t\\t\\ttn.v_align = 'default';\\n\\t\\t\\t\\t\\n\\t\\t\\t\\ttwo_dim_arr[rownum].push(tn);\\n\\t\\t\\t\\tconsole.warn('this row was extended to be able to put the content somewhere');\\n if(debug){\\n console.log(two_dim_arr[rownum]);\\n }\\n\\t\\t\\t}\\n }\",\n \"function addRowIndex() {\\r\\n const table = $('#main').DataTable();\\r\\n \\r\\n table.rows().every( function ( rowIdx, tableLoop, rowLoop ) {\\r\\n const data = this.data();\\r\\n data[0] = rowIdx + 1;\\r\\n this.data(data);\\r\\n });\\r\\n}\",\n \"function incrementColumn() {\\n GameData.column = correctColumn(GameData.column++);\\n}\",\n \"function addRow(table) {\\n var row = table.insertRow(table.rows.length);\\n var cell = null;\\n for (var i = 0; i < 5; i++) {\\n cell = row.insertCell(i);\\n if (i == 0) {\\n cell.innerHTML = table.rows.length - 1;\\n } else {\\n cell.setAttribute(\\\"contenteditable\\\", \\\"true\\\");\\n }\\n }\\n }\",\n \"function component_viewer_res_data_calc_next_avail() {\\n\\tvar next_row = ic_soa_data_getSheetMetrics()[\\\"RESOURCEALLOCATION\\\"].toprow;\\n\\tfor (var cur_do = 0; cur_do < dataObjects.RESOURCEALLOCATIONkeys.length; cur_do++) {\\n\\t\\tvar res_alloc_obj = dataObjects.RESOURCEALLOCATIONs[dataObjects.RESOURCEALLOCATIONkeys[cur_do]];\\n\\t\\tif (res_alloc_obj.sheet_row >= next_row) next_row = res_alloc_obj.sheet_row+1;\\n\\t};\\n\\tcomponent_viewer_res_data_glob.next_avail = {\\n\\t\\tnext_row: next_row\\n\\t};\\n\\t//console.log(\\\"Next row is \\\" + next_row);\\n}\",\n \"function changeRowNumbering(row, isIncreasing, creatingNewRow) {\\n\\n // Change row label contents\\n var rowLabelElt = row.find(\\\"label\\\");\\n var curRowNum = rowLabelElt.html();\\n var rowQstIdAttr = rowLabelElt.attr(\\\"for\\\");\\n \\n // Update row label\\n if(isIncreasing) {\\n curRowNum++;\\n }\\n else {\\n curRowNum--;\\n }\\n rowLabelElt.html(curRowNum);\\n\\n // Update question input\\n var rowQstInputElt = row.find(\\\"input#\\\"+rowQstIdAttr);\\n //var increaseNumbering = true;\\n //steve talk to me about this change\\n var increaseNumbering = isIncreasing;\\n var newRowQstIdAttr = changeNumInString(rowQstIdAttr, increaseNumbering);\\n var newRowQstNameAttr = changeNumInString(rowQstInputElt.attr(\\\"name\\\"), increaseNumbering);\\n rowLabelElt.attr(\\\"for\\\",newRowQstIdAttr);\\n rowQstInputElt.attr(\\\"id\\\",newRowQstIdAttr);\\n rowQstInputElt.attr(\\\"name\\\",newRowQstNameAttr);\\n\\n // Update answer input\\n var rowAnsInputElt = row.find(\\\"input:last\\\");\\n var newRowIdAttr = changeNumInString(rowAnsInputElt.attr(\\\"id\\\"), increaseNumbering);\\n var newRowNameAttr = changeNumInString(rowAnsInputElt.attr(\\\"name\\\"), increaseNumbering);\\n rowAnsInputElt.attr(\\\"id\\\",newRowIdAttr);\\n rowAnsInputElt.attr(\\\"name\\\",newRowNameAttr);\\n \\n // Update Order value\\n var rowOrderInputElt = row.find(\\\"input[name$='[card_order]']\\\");\\n var rowOrderIdAttr = rowOrderInputElt.attr(\\\"id\\\");\\n var rowOrderValueAttr = parseFloat(rowOrderInputElt.attr(\\\"value\\\"));\\n var newRowOrderIdAttr = changeNumInString(rowOrderIdAttr, increaseNumbering);\\n var newRowOrderNameAttr = changeNumInString(rowOrderInputElt.attr(\\\"name\\\"), increaseNumbering);\\n \\n rowOrderInputElt.attr(\\\"id\\\",newRowOrderIdAttr);\\n rowOrderInputElt.attr(\\\"name\\\",newRowOrderNameAttr);\\n \\n if(increaseNumbering) {\\n newRowOrderValueAttr = rowOrderValueAttr + 1;\\n }\\n else {\\n newRowOrderValueAttr = rowOrderValueAttr - 1;\\n }\\n rowOrderInputElt.attr(\\\"value\\\",newRowOrderValueAttr);\\n \\n \\n // Update Id value\\n var rowIdInputElt = row.find(\\\"input[name$='[id]']\\\");\\n var rowIdIdAttr = rowIdInputElt.attr(\\\"id\\\");\\n //checks to make sure this input element exists\\n //this only exists on the edit decks page\\n if (rowIdIdAttr != null) {\\n \\n var newRowIdIdAttr = changeNumInString(rowIdIdAttr, increaseNumbering);\\n var newRowIdNameAttr = changeNumInString(rowIdInputElt.attr(\\\"name\\\"), increaseNumbering);\\n \\n rowIdInputElt.attr(\\\"id\\\",newRowIdIdAttr);\\n rowIdInputElt.attr(\\\"name\\\",newRowIdNameAttr);\\n //alert(rowIdInputElt.attr(\\\"value\\\") + \\\" \\\" + rowIdIdAttr +\\\" \\\" + newRowIdNameAttr);\\n }\\n \\n // Clear the field values if row is new\\n if(creatingNewRow) {\\n rowQstInputElt.attr(\\\"value\\\",\\\"\\\");\\n rowAnsInputElt.attr(\\\"value\\\",\\\"\\\");\\n rowIdInputElt.attr(\\\"value\\\",\\\"\\\");\\n \\n }\\n}\",\n \"function addNextCell(row, attributes) {\\n const aCell = row.insertCell(-1);\\n [aCell.colSpan] = attributes;\\n if (attributes[2]) { aCell.className = 'header'; }\\n insertElement(aCell, attributes[1]);\\n return aCell;\\n}\",\n \"function TableInitial(table_id, col_count, max_row_count) {\\n if (max_row_count == undefined)\\n {\\n max_row_count = TABLE_ROW_COUNT;\\n }\\n\\n if (col_count == undefined)\\n {\\n col_count = 14;\\n }\\n var table = document.getElementById(table_id);\\n\\n var row_count = table.tBodies[0].rows.length;\\n\\n\\n while (row_count < max_row_count) {\\n var new_row = table.tBodies[0].insertRow(row_count);\\n\\n for (var cell_index = 0; cell_index < col_count; cell_index++) {\\n var cell = new_row.insertCell(-1);\\n }\\n //new_row.style.height = TABLE_ROW_HEIGHT;\\n row_count = table.tBodies[0].rows.length;\\n }\\n\\n // set row height\\n\\n for (var row_index = 0; row_index < row_count; row_index++) {\\n var rows = table.tBodies[0].rows;\\n rows[row_index].style.height = TABLE_ROW_HEIGHT;\\n }\\n\\n // bind checkbox function\\n TableCheckBoxInit(table_id);\\n // TODO: highlight row by row\\n}\",\n \"function createNextFieldsCell(dataGridRecordNumber) {\\n var cell, table;\\n if (dataGridRecordNumber === self.recordHeader || dataGridRecordNumber === self.recordSearchInsert) {\\n table = self.headerElem;\\n } else {\\n table = self.tableElem;\\n }\\n var recordNumber = dataGridRecordNumber - self.recordHeader;\\n if (typeof self.pivot !== \\\"undefined\\\" && self.pivot == true) {\\n // maybe move this into create record?? no b/c I have to set the row each time I iterate to new field\\n self.tbl_cols = recordNumber;\\n if (self.tbl_rows >= table.rows.length) { // row not there so create it\\n debugger;\\n alert(\\\"when is this code ever executed\\\");\\n row = table.insertRow(self.tbl_rows);\\n\\n } else {\\n row = table.rows[self.tbl_rows];\\n }\\n\\n cell = row.insertCell(self.tbl_cols);\\n cell.id = table.id+\\\",\\\"+ self.tbl_rows + \\\",\\\" + self.tbl_cols;\\n self.tbl_rows++;\\n } else {\\n cell = row.insertCell(self.tbl_cols);\\n cell.id = table.id+\\\",\\\"+ recordNumber + \\\",\\\" + self.tbl_cols;\\n self.tbl_cols++;\\n }\\n // highlight rows after a sort\\n if (typeof self.idsHighlighted !== 'undefined') {\\n for (var i = 0; i < self.idsHighlighted.length; i += 1) {\\n if (self.idsHighlighted[i] === data.grid[dataGridRecordNumber][self.primaryKey]) {\\n self.highlightRow(row, true);\\n //cell.className = 'highlightedrow ' + cell.className;\\n break;\\n }\\n }\\n }\\n return cell;\\n }\",\n \"updateSize() {\\n\\t\\tvar t = this;\\n\\t\\tvar len = t.getLength();\\n\\t\\tif (len == 0) {\\n\\t\\t\\tt.setLength(1);\\n\\t\\t} if (len > 0) {\\n\\t\\t\\tvar needsNew = !t.isRowBlank(t.getRow(len - 1));\\n\\t\\t\\tif (needsNew)\\n\\t\\t\\t\\tt.setLength(len + 1);\\n\\t\\t\\telse if (len > 1) {\\n\\t\\t\\t\\tvar needsRem = t.isRowBlank(t.getRow(len - 1));\\n\\t\\t\\t\\tif (needsRem) {\\n\\t\\t\\t\\t\\tt.setLength(len - 1);\\n\\t\\t\\t\\t\\tt.updateSize();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"set _physicalStart(val){val=val%this._physicalCount;if(0>val){val=this._physicalCount+val}if(this.grid){val=val-val%this._itemsPerRow}this._physicalStartVal=val}\",\n \"function dap_nextRow()\\n{\\n\\tthis.saveData(this.getCurrentRow());\\n\\tif (this.DynamicTable.nextRow() == true)\\n\\t{\\n\\t\\tvar boolflag = this.DataSource[this.getRecordIndex(\\n\\t\\t\\t\\tthis.getCurrentRow())][this.DataSource[0].length-1];\\n\\t\\tthis.DynamicTable.disableRow(this.getCurrentRow(),\\n\\t\\t\\t\\t((boolflag == constLoadStatus)||(boolflag == constUpdateStatus)));\\n\\t}\\n}\",\n \"function addColumn(){\\r\\n $('tr').append('
');\\r\\n column++;\\r\\n }\",\n \"_addRow() {\\n const indicativeRow = this._hoveredCell.closest('TR');\\n let index = this._getHoveredSideOfContainer();\\n\\n if (index === 1) {\\n index = indicativeRow.sectionRowIndex;\\n // if inserting after hovered cell\\n index = index + this._isBottomOrRight();\\n }\\n\\n this._table.addRow(index);\\n }\",\n \"function render_prev_row() {\\n\\n current_row = (current_row == 0) ? current_row : current_row - 1;\\n render_row(current_row)\\n\\n}\",\n \"grow() {\\n let lastTail = this.tail[tail.length - 1];\\n if (this.tail.length < 1) {\\n lastTail = this.tail[tail.length];\\n }\\n this.tail.push(new Position(lastTail.row, lastTail.column));\\n score += 10;\\n }\",\n \"function numberRows() {\\n if(name != meshShorts) {\\n $(\\\".row_number\\\").each(function(i) {\\n var n = ++i;\\n var row_number = (\\\"0\\\" + n).slice(-2);\\n $(this).find(\\\"font\\\").text(row_number);\\n });\\n $(\\\".row_number_mobile\\\").each(function() {\\n var row_number_mobile = $(this).parent().prev().find('td:first').text()\\n $(this).find(\\\"font\\\").text(row_number_mobile);\\n });\\n }\\n }\",\n \"initRow() {\\n let prevSetNr = 1; // previous set number holder\\n for (let i = 1; i <= this.width; i++) {\\n // Initialize cells that are not yet initialized by previous row\\n if (!this.cell[i]) {\\n for (let j = prevSetNr; j <= this.width; j++) {\\n if (!this.set[j]) {\\n prevSetNr = j;\\n break;\\n }\\n }\\n this.set[prevSetNr] = [i];\\n this.cell[i] = prevSetNr;\\n }\\n }\\n }\",\n \"_incrementMaxIndex() {\\n if (this._maxIndex < this._capacity) {\\n this._maxIndex++;\\n }\\n }\",\n \"_updateGridRows() {\\n\\n [...this.element.children].forEach((item, i) => {\\n let index = i % this.maxItemsPerRow;\\n let position;\\n if ( index === 0){\\n this.rows.push([]);\\n }\\n\\n position = this._getItemPosition(index);\\n this.rows[this.lastIndex].push({item: item, position: position});\\n });\\n }\",\n \"function handleNextButtonClick() {\\n count++;\\n renderTable();\\n}\",\n \"function handleNextButtonClick() {\\n count++;\\n renderTable();\\n}\",\n \"function ResetRowNumber(grd) {\\n var items = grd.getData();\\n if (items != null) {\\n for (var i = 0; i < items.length; i++) {\\n items[i].RowNum = i + 1;\\n grd.updateRow(i, items);\\n grd.updateRowCount();\\n grd.render();\\n }\\n }\\n }\",\n \"function rowCalc(num){\\n var row = num;\\n while (row>3){\\n row -= 3;\\n }\\n return row;\\n}\",\n \"next() {\\n const that = this,\\n availableItems = that.dataSource.length;\\n \\n if (that.disabled || availableItems === 0) {\\n return;\\n }\\n\\n let nextItem = that._currentIndex;\\n\\n if(that.loop){\\n nextItem = nextItem >= availableItems-1 ? 0 : nextItem + 1;\\n }\\n else {\\n nextItem = nextItem >= availableItems-1 ? nextItem : nextItem + 1;\\n }\\n\\n that._goToItem(nextItem);\\n }\",\n \"function WEndRec()\\n{\\n this.WSetRow(this.rows - 1);\\n}\",\n \"function adjustRowStatuses() {\\n for (var i = 0; i < $scope.rows.length; i++) {\\n if ($scope.rows[i].status === 'Not Started') {\\n $scope.rows[i].status = 'Next';\\n break;\\n }\\n }\\n }\",\n \"function renumberColumns(){\\n\\t\\t$(table + \\\"tr:first td\\\").each(function(i){\\n\\t\\t\\t$(this).attr(\\\"id\\\", i+1);\\t\\n\\t\\t});\\n\\t}\",\n \"set _physicalStart(val){val=val%this._physicalCount;if(val<0){val=this._physicalCount+val;}if(this.grid){val=val-val%this._itemsPerRow;}this._physicalStartVal=val;}\",\n \"next () {\\n const before = this.value\\n if (this.value < this.list.length - 1) this.$emit('input', this.value + 1)\\n if (!this.scroll) return\\n\\n this.$nextTick(() => {\\n if (this.value === before) return\\n const list = this.$refs.list\\n const cur = list.querySelector('.sm-over').getBoundingClientRect()\\n const listPos = list.getBoundingClientRect()\\n const dist = (list.scrollTop + cur.bottom) - listPos.bottom\\n if (dist > 0) {\\n // when current row is the last row, the scroll bar moves directly to the bottom\\n if (this.value === this.list.length - 1) {\\n list.scrollTop = dist + Number.parseInt(window.getComputedStyle(list).paddingBottom)\\n } else {\\n list.scrollTop = dist\\n }\\n }\\n })\\n }\",\n \"function agregarNumeracionItem() {\\n var tablaC = document.getElementById(\\\"tablaBodyCotizacion\\\"),\\n rIndex;\\n var nFilas = $(\\\"#tablaBodyCotizacion > tr\\\").length;\\n for (var i = 0; i < nFilas; i++) {\\n tablaC.rows[i].cells[0].innerHTML = i + 1;\\n\\n }\\n\\n}\",\n \"function changeCurrentRow(){\\r\\n currentRow -= 1;\\r\\n var mult = 4;\\r\\n\\r\\n currentBoardCells = [\\r\\n \\\"board\\\" + (currentRow*mult-4), \\r\\n \\\"board\\\" + (currentRow*mult-3), \\r\\n \\\"board\\\" + (currentRow*mult-2), \\r\\n \\\"board\\\" + (currentRow*mult-1)];\\r\\n currentPegCells = [\\r\\n \\\"peg\\\" + (currentRow*mult-4), \\r\\n \\\"peg\\\" + (currentRow*mult-3), \\r\\n \\\"peg\\\" + (currentRow*mult-2), \\r\\n \\\"peg\\\" + (currentRow*mult-1)];\\r\\n }\",\n \"insertColumnAfter() {\\n this.insertColumn(1);\\n }\",\n \"function _pushMoreRows(prevInd, limit, pushMoreID) {\\n if ($rootScope.pushMoreID === pushMoreID) {\\n var nextLimit = prevInd + limit;\\n // combines all of the second array (rowValues) with the first one (vm.rowValues)\\n Array.prototype.push.apply(vm.rowValues, rowValues.slice(prevInd, nextLimit));\\n if (rowValues[nextLimit]) {\\n $log.debug(\\\"counter\\\", current, \\\": recurse with\\\", vm.rowValues.length);\\n $timeout(function () {\\n if ($rootScope.pushMoreID === pushMoreID) {\\n _pushMoreRows(nextLimit, limit, pushMoreID);\\n } else {\\n $log.debug(\\\"current global counter: \\\", vm.flowControlObject.counter);\\n $log.debug(\\\"counter\\\", current, \\\": break out of timeout inside push more rows\\\");\\n $log.debug(\\\"counter\\\", current, \\\": with uuid\\\", pushMoreID);\\n $log.debug(\\\"counter\\\", current, \\\": with global uuid\\\", $rootScope.pushMoreID);\\n vm.pushRowsSpinner = false;\\n }\\n });\\n } else {\\n // we reached the end of the data to page in\\n vm.pushRowsSpinner = false;\\n }\\n } else {\\n $log.debug(\\\"current global counter: \\\", vm.flowControlObject.counter);\\n $log.debug(\\\"counter\\\", current, \\\": break out of push more rows\\\");\\n $log.debug(\\\"counter\\\", current, \\\": with uuid\\\", pushMoreID);\\n $log.debug(\\\"counter\\\", current, \\\": with global uuid\\\", $rootScope.pushMoreID);\\n vm.pushRowsSpinner = false;\\n }\\n }\",\n \"function prepData(rows) {\\n var i = 1;\\n rows.forEach( (row) => {\\n row.index = i;\\n if (row.Count) {\\n row.Count = +row.Count;\\n }\\n i++;\\n });\\n return rows;\\n}\",\n \"function getRow(i) {\\n return Math.ceil((i+1)/3);\\n}\",\n \"function _addDeadRow(amount) {\\n for (const i = 0; i < amount; i++) {\\n let row = [];\\n for(let j = 0; j < consts.COLUMN_COUNT; j++){\\n row.push('#000000');\\n }\\n matrix.push(row);\\n matrix.shift();\\n }\\n}\",\n \"_transform(row, encoding, callback) {\\n const xlsxRow = (0, _templates.Row)(this.rowCount, row, this.format, this.styles);\\n this.rowCount++;\\n callback(null, xlsxRow);\\n }\",\n \"nextStop(x) {\\n if (x === null || x === undefined) {\\n x = this.x;\\n }\\n while (!this.tabs[++x] && x < this._cols)\\n ;\\n return x >= this._cols ? this._cols - 1 : x < 0 ? 0 : x;\\n }\",\n \"function addRowDrag(){\\n\\tvar column = $(this).prop(\\\"columnIndex\\\")\\n\\tvar workingIndex;\\n\\t$(this).addClass(\\\"loop\\\")\\n\\t\\t .bind(\\\"mousedown\\\", startRowDrag)\\n\\t$(workingMiniLoop).each(function(index) { \\n\\t\\t$(getTheButton(rowAffected + 12, workingMiniLoop[index])).removeClass(\\\"loop\\\")\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t .addClass(\\\"punch\\\");\\n\\t});\\n\\tworkingMiniLoop = [mightJumpToHere];\\n\\tif(column > workingMiniLoop[0]){\\n\\t\\tworkingIndex = column\\n\\t\\tfor(i = 0; i < column - workingMiniLoop[0]; i++){\\n\\t\\t\\tworkingMiniLoop.push(workingIndex);\\n\\t\\t\\tworkingIndex--;\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\telse{\\n\\t\\tworkingIndex = column\\n\\t\\tfor(i = 0; i < workingMiniLoop[0] - column ; i++){\\n\\t\\t\\tworkingMiniLoop.push(workingIndex);\\n\\t\\t\\tworkingIndex++;\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\t$(workingMiniLoop).each(function(index) { \\n\\t\\t$(getTheButton(rowAffected + 12,workingMiniLoop[index]))\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t .addClass(\\\"loop\\\");\\n\\t});\\n}\",\n \"function appendRowNumbers() {\\n\\n // Append row number to row classes\\n var numberOfRows = $('.row').length;\\n\\n for (var i=1; i<=numberOfRows; i++) {\\n var thisClass = 'row-' + i;\\n var thisRow = $('.row').eq(i-1)\\n thisRow.addClass(thisClass);\\n }\\n\\n}\",\n \"function nextButtonClick() {\\r\\n count++;\\r\\n renderTable();\\r\\n}\",\n \"resize(newCols, newRows) {\\n // store reference to null cell with default attrs\\n const nullCell = this.getNullCell(DEFAULT_ATTR_DATA);\\n // Increase max length if needed before adjustments to allow space to fill\\n // as required.\\n const newMaxLength = this._getCorrectBufferLength(newRows);\\n if (newMaxLength > this.lines.maxLength) {\\n this.lines.maxLength = newMaxLength;\\n }\\n // The following adjustments should only happen if the buffer has been\\n // initialized/filled.\\n if (this.lines.length > 0) {\\n // Deal with columns increasing (reducing needs to happen after reflow)\\n if (this._cols < newCols) {\\n for (let i = 0; i < this.lines.length; i++) {\\n this.lines.get(i).resize(newCols, nullCell);\\n }\\n }\\n // Resize rows in both directions as needed\\n let addToY = 0;\\n if (this._rows < newRows) {\\n for (let y = this._rows; y < newRows; y++) {\\n if (this.lines.length < newRows + this.ybase) {\\n if (this._optionsService.options.windowsMode) {\\n // Just add the new missing rows on Windows as conpty reprints the screen with it's\\n // view of the world. Once a line enters scrollback for conpty it remains there\\n this.lines.push(new BufferLine(newCols, nullCell));\\n }\\n else {\\n if (this.ybase > 0 && this.lines.length <= this.ybase + this.y + addToY + 1) {\\n // There is room above the buffer and there are no empty elements below the line,\\n // scroll up\\n this.ybase--;\\n addToY++;\\n if (this.ydisp > 0) {\\n // Viewport is at the top of the buffer, must increase downwards\\n this.ydisp--;\\n }\\n }\\n else {\\n // Add a blank line if there is no buffer left at the top to scroll to, or if there\\n // are blank lines after the cursor\\n this.lines.push(new BufferLine(newCols, nullCell));\\n }\\n }\\n }\\n }\\n }\\n else { // (this._rows >= newRows)\\n for (let y = this._rows; y > newRows; y--) {\\n if (this.lines.length > newRows + this.ybase) {\\n if (this.lines.length > this.ybase + this.y + 1) {\\n // The line is a blank line below the cursor, remove it\\n this.lines.pop();\\n }\\n else {\\n // The line is the cursor, scroll down\\n this.ybase++;\\n this.ydisp++;\\n }\\n }\\n }\\n }\\n // Reduce max length if needed after adjustments, this is done after as it\\n // would otherwise cut data from the bottom of the buffer.\\n if (newMaxLength < this.lines.maxLength) {\\n // Trim from the top of the buffer and adjust ybase and ydisp.\\n const amountToTrim = this.lines.length - newMaxLength;\\n if (amountToTrim > 0) {\\n this.lines.trimStart(amountToTrim);\\n this.ybase = Math.max(this.ybase - amountToTrim, 0);\\n this.ydisp = Math.max(this.ydisp - amountToTrim, 0);\\n this.savedY = Math.max(this.savedY - amountToTrim, 0);\\n }\\n this.lines.maxLength = newMaxLength;\\n }\\n // Make sure that the cursor stays on screen\\n this.x = Math.min(this.x, newCols - 1);\\n this.y = Math.min(this.y, newRows - 1);\\n if (addToY) {\\n this.y += addToY;\\n }\\n this.savedX = Math.min(this.savedX, newCols - 1);\\n this.scrollTop = 0;\\n }\\n this.scrollBottom = newRows - 1;\\n if (this._isReflowEnabled) {\\n this._reflow(newCols, newRows);\\n // Trim the end of the line off if cols shrunk\\n if (this._cols > newCols) {\\n for (let i = 0; i < this.lines.length; i++) {\\n this.lines.get(i).resize(newCols, nullCell);\\n }\\n }\\n }\\n this._cols = newCols;\\n this._rows = newRows;\\n }\",\n \"function nextRow( bSuccess )\\n{\\n // Clear highlighting\\n $( '#bgt_table > tbody .' + g_sPendingClass ).removeClass( g_sPendingClass );\\n $( '#bgt_table > tbody .' + g_sSuccessClass ).removeClass( g_sSuccessClass );\\n\\n // If current row contains new, live data, highlight it\\n if ( bSuccess && ! g_tCachedValues )\\n {\\n $( '#row_' + g_iRow ).addClass( g_sSuccessClass );\\n }\\n\\n // Advance row index\\n if ( g_iRow < ( g_aRows.length - 1 ) )\\n {\\n // Advance to next row\\n g_iRow ++;\\n if ( ! g_tCachedValues )\\n {\\n enableRefreshButton( true );\\n }\\n }\\n else\\n {\\n // Finished last row\\n g_iRow = 0;\\n g_tCachedValues = null;\\n stopRefresh();\\n enableRefreshButton( true );\\n $( '.sortable' ).removeClass( 'sorter-false' );\\n console.log( '=> View initialized in ' + ( Date.now() - g_iStartTime ) + ' ms' );\\n }\\n\\n // Reinitialize variables\\n g_iInstanceOffset = 2;\\n g_aRowData = [];\\n\\n // Update tablesorter event handlers\\n g_tTable.off( 'sortEnd' );\\n g_tTable.off( 'filterEnd' );\\n g_tTable.on( 'sortEnd', onSortEnd );\\n g_tTable.on( 'filterEnd', onFilterEnd );\\n g_tTable.on( 'tablesorter-ready', onTablesorterReady );\\n\\n // Trigger event to update tablesorter cache\\n g_tTable.trigger( 'update' );\\n}\",\n \"function WPrevRec()\\n{\\n this.WSetRow(this.currow - 1);\\n}\",\n \"function wrappedRowsForRow(bufferService, currentRow) {\\n let rowCount = 0;\\n let line = bufferService.buffer.lines.get(currentRow);\\n let lineWraps = line && line.isWrapped;\\n while (lineWraps && currentRow >= 0 && currentRow < bufferService.rows) {\\n rowCount++;\\n line = bufferService.buffer.lines.get(--currentRow);\\n lineWraps = line && line.isWrapped;\\n }\\n return rowCount;\\n}\",\n \"add6Row()\\n {\\n\\n //loop through (6 times)*(rowCount)\\n //give ids based on row\\n\\n }\",\n \"function addColumn(row) {\\n\\n var gridSize = 0;\\n for (var i = 0; i < row.cols.length; i++) {\\n\\n var size = row.cols[i].cssClass.substr(row.cols[i].cssClass.length - 2);\\n size = parseInt(size.replace(/-/g, ''));\\n gridSize = gridSize + size;\\n }\\n if (gridSize < 12) {\\n row.cols.push(OdsFormService.newColumnObject(12 - gridSize));\\n } else {\\n dialogs.notify('Notification', 'Columns can\\\\'t be greater than 12 columns, please fix it!!!',\\n {size: 'sm', windowClass: 'ods-dialog'}).result.then(function () {\\n });\\n }\\n }\",\n \"function populateCurrentColumn(){\\n for( var i = 0; i < totalTableRows; i++ ){\\n var x = tbl.tBodies[0].rows[i].cells[currentIndex];\\n //currentColumn.push(x);\\n currentColumn.push(x.cloneNode(true));\\n }\\n }\",\n \"function increaseDifficulty() {\\n setGridInvisible();\\n if (!isGreatestDimension()) {\\n if (row < col) {\\n setGrid(row+1, col);\\n } else {\\n setGrid(row, col+1);\\n }\\n }\\n resetGrid(\\\"increase\\\");\\n}\",\n \"function appendDownRow(x)\\n{\\n\\tvar tb1 = document.getElementById('qis');\\n\\tvar row = tb1.insertRow(x + 1); //localizar el ultimo renglon de la tabla para añadir uno nuevo\\n\\tvar i = 0;\\n\\tfor(i = 0; i < tb1.rows[0].cells.length; i++)//conocer cuantas celdas hay en los renglones para añadirlos al nuevo renglon.\\n\\t{\\n\\t\\tcreateCell(row.insertCell(i),i,0);\\n\\t}\\n}\",\n \"function maxRow(add,remove,max,index)\\r\\n{\\t\\r\\n\\tif(index)\\n this.setState(\\n {\\n rows: newRow\\n }\\n )\\n }\",\n \"function _helper(lastRow){\\n // console.log('xx helper');\\n if (options.maxRows && rows > options.maxRows || options.truncate && lastRow && rows > 1) row[currentImageIndex][0].style.display = 'none';\\n else {\\n // console.log(row[currentImageIndex][4]);\\n if (row[currentImageIndex][4]) {\\n row[currentImageIndex][3].setAttribute('src', row[currentImageIndex][4]);\\n row[currentImageIndex][4] = '';\\n }\\n row[currentImageIndex][0].style.width = newWidth+'px';\\n row[currentImageIndex][0].style.height = row_h+'px';\\n row[currentImageIndex][0].style.display = 'block';\\n }\\n }\",\n \"incrCursor() {\\n const last = this.getLastHistory().groups;\\n if (this.cursorIndex === null) {\\n this.cursorIndex = 0;\\n return;\\n }\\n if (this._overwrite) {\\n if (this.cursorIndex < last.length) {\\n // ?\\n this.cursorIndex++;\\n } else {\\n return;\\n }\\n }\\n if (!this._overwrite) {\\n if (this.cursorIndex < last.length - 1) {\\n // ?\\n this.cursorIndex++;\\n } else {\\n }\\n }\\n }\",\n \"function emptyCellsUntil(endCol) {\\n while (col < endCol) {\\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\\n td = (loneCellMatrix[i - 1] || [])[col];\\n\\n if (td) {\\n td.rowSpan = (td.rowSpan || 1) + 1;\\n } else {\\n td = document.createElement('td');\\n tr.appendChild(td);\\n }\\n\\n cellMatrix[i][col] = td;\\n loneCellMatrix[i][col] = td;\\n col++;\\n }\\n }\",\n \"boldColumn(lastSlotNum) {\\n for (let i = lastSlotNum; i >= 0; i -= 7) {\\n this.getSlot(i).style.border = '4px solid black';\\n }\\n }\",\n \"function extendList(btn) { // btn is an a-tag in this case\\n const ROWS_TO_EXPAND = 10;\\n var addedRows = 0;\\n var showMoreRow = btn.parentNode.parentNode;\\n var currentRow = showMoreRow;\\n\\n while (currentRow.nextElementSibling !== null && addedRows < ROWS_TO_EXPAND) {\\n currentRow.nextElementSibling.removeAttribute('style');\\n currentRow = currentRow.nextElementSibling;\\n addedRows++;\\n }\\n if (currentRow.nextElementSibling !== null) currentRow.insertAdjacentHTML('afterend', '
' + showMoreRow.innerHTML + '
');\\n showMoreRow.remove();\\n}\",\n \"fillBelow(newTop) {\\n const me = this,\\n fillHeight = newTop - me.topRow.top - me.prependBufferHeight,\\n recordCount = me.store.count,\\n rowCount = me.rowCount;\\n\\n let accumulatedHeight = 0;\\n\\n // Repeat until we have filled empty height\\n while (\\n accumulatedHeight < fillHeight && // fill empty height\\n me.topIndex + rowCount < recordCount && // as long as we have records left\\n me.topRow.top + me.topRow.offsetHeight < newTop // and do not run move top row fully into view (can happen with var row height)\\n ) {\\n // We want to show next record at bottom of rows\\n accumulatedHeight += me.displayRecordAtBottom();\\n }\\n }\",\n \"set rows(value) {\\n Helper.UpdateInputAttribute(this, 'rows', value);\\n }\",\n \"function insert_Row() {\\n const table = document.getElementById('sampleTable');\\n let rowNumber = table.children.length+1;\\n \\n const newElement = `\\n
Row${rowNumber} cell1
\\n
Row${rowNumber} cell2
`\\n ;\\n table.innerHTML += newElement;\\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 reloadNumbers() {\\n\\n var counts = 0;\\n\\n $('tr.active').each(function() {\\n if (counts === 0) {\\n this.cells[0].innerHTML = '>';\\n } else {\\n this.cells[0].innerHTML = counts;\\n }\\n $('#total_columns').text('Total: ' + counts);\\n\\n counts++;\\n });\\n\\n}\",\n \"initialize(size){\\n for (let i = 0; i < size; i++) {\\n let $row = this.$table.insertRow(i);\\n for (let j = 0; j < size; j++) {\\n $row.insertCell(j);\\n }\\n }\\n }\",\n \"function onInsertRowAfter() {\\n onInsertRow(1);\\n }\",\n \"fillBelow(newTop) {\\n const me = this,\\n fillHeight = newTop - me.topRow.top - me.prependBufferHeight,\\n recordCount = me.store.count,\\n rowCount = me.rowCount;\\n let accumulatedHeight = 0; // Repeat until we have filled empty height\\n\\n while (accumulatedHeight < fillHeight && // fill empty height\\n me.topIndex + rowCount < recordCount && // as long as we have records left\\n me.topRow.top + me.topRow.offsetHeight < newTop // and do not move top row fully into view (can happen with var row height)\\n ) {\\n // We want to show next record at bottom of rows\\n accumulatedHeight += me.displayRecordAtBottom();\\n }\\n\\n me.trigger('renderDone');\\n }\",\n \"__increment() {\\n const { step, max } = this.values;\\n const newValue = this.currentValue + step;\\n if (newValue <= max || max === Infinity) {\\n this.value = newValue;\\n this.__toggleSpinnerButtonsState();\\n }\\n }\",\n \"handlerForwardClick() {\\n let dealers = this.state.delers;\\n let rows = [];\\n var count = 0;\\n\\n if (dealers.length < this.state.pointer + 10) {\\n for (var i = this.state.pointer; i < dealers.length; i++) {\\n rows[count] = dealers[i];\\n count++;\\n }\\n this.state.page += 1;\\n this.setState({\\n rows: rows,\\n forwardDisabled: true,\\n backDisabled: false\\n });\\n } else {\\n this.state.nextPointer = this.state.pointer + 10;\\n for (var i = this.state.pointer; i < this.state.nextPointer; i++) {\\n rows[count] = dealers[i];\\n count++;\\n }\\n let pointer = this.state.pointer + 10;\\n this.state.page += 1;\\n this.setState({\\n rows: rows,\\n backDisabled: false,\\n pointer: pointer\\n });\\n }\\n }\",\n \"function emptyCellsUntil(endCol) {\\n while (col < endCol) {\\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\\n td = (loneCellMatrix[i - 1] || [])[col];\\n if (td) {\\n td.rowSpan = (td.rowSpan || 1) + 1;\\n }\\n else {\\n td = document.createElement('td');\\n tr.appendChild(td);\\n }\\n cellMatrix[i][col] = td;\\n loneCellMatrix[i][col] = td;\\n col++;\\n }\\n }\",\n \"function emptyCellsUntil(endCol) {\\n while (col < endCol) {\\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\\n td = (loneCellMatrix[i - 1] || [])[col];\\n if (td) {\\n td.rowSpan = (td.rowSpan || 1) + 1;\\n }\\n else {\\n td = document.createElement('td');\\n tr.appendChild(td);\\n }\\n cellMatrix[i][col] = td;\\n loneCellMatrix[i][col] = td;\\n col++;\\n }\\n }\",\n \"function emptyCellsUntil(endCol) {\\n while (col < endCol) {\\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\\n td = (loneCellMatrix[i - 1] || [])[col];\\n if (td) {\\n td.rowSpan = (td.rowSpan || 1) + 1;\\n }\\n else {\\n td = document.createElement('td');\\n tr.appendChild(td);\\n }\\n cellMatrix[i][col] = td;\\n loneCellMatrix[i][col] = td;\\n col++;\\n }\\n }\",\n \"function addColumn() {\\n if (row === 0) {\\n let newRow = document.createElement(\\\"tr\\\");\\n let newcol = document.createElement(\\\"td\\\");\\n\\n newRow.appendChild(newcol);\\n table.appendChild(newRow);\\n row = 1;\\n } else {\\n let currentRow = document.getElementsByTagName(\\\"tr\\\");\\n let rowArray = Array.from(currentRow);\\n rowArray.forEach((row) => {\\n let newcol = document.createElement(\\\"td\\\");\\n row.appendChild(newcol);\\n });\\n row++;\\n }\\n column++;\\n}\",\n \"function randomRowColumnNumber(max){\\n const number= Math.floor(Math.random() * max) + 1;\\n return number;\\n}\",\n \"function emptyCellsUntil(endCol) {\\n while (col < endCol) {\\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\\n td = (loneCellMatrix[i - 1] || [])[col];\\n if (td) {\\n td.rowSpan = (td.rowSpan || 1) + 1;\\n }\\n else {\\n td = document.createElement('td');\\n tr.appendChild(td);\\n }\\n cellMatrix[i][col] = td;\\n loneCellMatrix[i][col] = td;\\n col++;\\n }\\n }\",\n \"function setThePositions(currentR, currentC, nextR, nextC, incrNextRow, incrNextColl) {\\r\\n\\tif(currentR && currentC && currentR !== null && currentC !== null) {\\r\\n\\t\\tlastRow = currentR;\\r\\n\\t\\tlastColl = currentC;\\r\\n\\t}\\r\\n\\tif(nextR && nextC && nextR !== null && nextC !== null) {\\r\\n\\t\\tcurrentRow = nextR;\\r\\n\\t\\tcurrentColl = nextC;\\r\\n\\t}\\r\\n\\tif(incrNextRow && incrNextColl && incrNextRow !== null && incrNextColl !== null) {\\r\\n\\t\\tnextRow = incrNextRow;\\r\\n\\t\\tnextColl = incrNextColl;\\r\\n\\t} else {\\r\\n\\t\\tnextRow = currentRow + 1;\\r\\n\\t\\tnextColl = currentColl;\\r\\n\\t}\\r\\n}\",\n \"function setNumbers() {\\n\\t\\tvar count = 1;\\n\\t\\t$(\\\"#displayTable\\\").find(\\\"tr\\\").each(function(count) {\\n\\t\\t\\tvar s = count;\\n\\t\\t\\t$(this).children(\\\"td:first\\\").html(s);\\n\\t\\t\\ts++;\\n\\t\\t\\t\\n\\t\\t});\\n\\t\\tcount = 1;\\n\\t}\",\n \"function emptyCellsUntil(endCol) { // goes from current `col` to `endCol`\\n while (col < endCol) {\\n cell = _this.getCell(row, col);\\n segsBelow = _this.getCellSegs(cell, levelLimit);\\n if (segsBelow.length) {\\n td = cellMatrix[levelLimit - 1][col];\\n moreLink = _this.renderMoreLink(cell, segsBelow);\\n moreWrap = $('').append(moreLink);\\n td.append(moreWrap);\\n moreNodes.push(moreWrap[0]);\\n }\\n col++;\\n }\\n }\",\n \"function increaseMatrix() {\\r\\n storeMatrix();\\r\\n var matrix = getMatrix().map(row => {\\r\\n row.push('1');\\r\\n return row;\\r\\n });\\r\\n matrix.push(new Array(matrix.length + 1).fill('1'));\\r\\n localStorage.setItem('matrix', JSON.stringify(matrix));\\r\\n createTable();\\r\\n}\",\n \"function removeTableRow() {\\n if (Number($(\\\"#rows\\\").val()) > 4) {\\n $(\\\"tr\\\").last().remove();\\n $(\\\"#rows\\\").prop(\\\"value\\\", Number($(\\\"#rows\\\").val()) - 1);\\n }\\n changes = true;\\n}\",\n \"function addRow(){\\r\\n $('#pixel_canvas').append('
');\\r\\n var newRow=$('#pixel_canvas').children().last();\\r\\n for(var i=0;i');\\r\\n }\\r\\n row++;\\r\\n }\",\n \"function add_horizontal_hint_row() {\\n var total_litags = 0;\\n var total_limit = 1;\\n jQuery('#crosswordsContainerDivRowColumn .crosswords-hint-hrow-litag').each(function (index, value) {\\n index += 1;\\n var valueIs = jQuery('.crosswords-hint-hrowline-' + index).is(\\\":visible\\\");\\n if (valueIs) {\\n total_litags += 1;\\n }\\n total_limit++;\\n });\\n total_litags += 1;\\n if (total_litags < total_limit) {\\n jQuery('.crosswords-hint-hrowline-' + total_litags).show();\\n } else {\\n jQuery('.add_remove_horizontal_row_hint_msg').html('Can\\\\'t Add anymore!');\\n jQuery('.add_remove_horizontal_row_hint_msg').delay(5000).fadeOut(1600);\\n }\\n var horizontal_rowcolinpval = get_all_inputfrom_hrorizontal_hint();\\n jQuery('#edit-field-crosswords-hrow-0-value').val(horizontal_rowcolinpval);\\n }\",\n \"function unshift(row) {\\n while (row.length != 4) {\\n row.unshift(0)\\n }\\n return row;\\n}\",\n \"function emptyCellsUntil(endCol) {\\n while (col < endCol) {\\n // try to grab a cell from the level above and extend its rowspan. otherwise, create a fresh cell\\n td = (loneCellMatrix[i - 1] || [])[col];\\n if (td) {\\n td.attr(\\n 'rowspan',\\n parseInt(td.attr('rowspan') || 1, 10) + 1\\n );\\n }\\n else {\\n td = $('
');\\n tr.append(td);\\n }\\n cellMatrix[i][col] = td;\\n loneCellMatrix[i][col] = td;\\n col++;\\n }\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.6844505","0.6307189","0.62610507","0.6174487","0.611505","0.60943776","0.6078653","0.6068298","0.5975301","0.58927864","0.58509856","0.58067775","0.5770341","0.5749379","0.55931467","0.5588367","0.5585682","0.5549195","0.5530309","0.5527462","0.5525426","0.5508305","0.5503325","0.5491633","0.5490333","0.54894584","0.5474748","0.5461443","0.5434278","0.5433155","0.5422539","0.5398072","0.538703","0.5354622","0.5351801","0.5338508","0.5338508","0.5313979","0.53026426","0.52935773","0.5285301","0.52727765","0.527025","0.52628905","0.52624017","0.5249995","0.52495915","0.5244615","0.52356595","0.52218556","0.51916844","0.51893497","0.5179749","0.5171309","0.51712763","0.5169552","0.5147553","0.5135376","0.5132684","0.5127312","0.5124116","0.51228917","0.5104308","0.5103665","0.50978315","0.5086428","0.50828046","0.50815636","0.5077339","0.5072776","0.50718176","0.50673467","0.5065278","0.5064925","0.5063846","0.5058279","0.5052661","0.5052147","0.504851","0.50475276","0.5044315","0.5040618","0.5037574","0.503735","0.5022159","0.49987978","0.49987978","0.49987978","0.4995513","0.49944302","0.49919683","0.49904686","0.4983485","0.49814227","0.49696702","0.49684322","0.4966544","0.4965281","0.49607846","0.49499288"],"string":"[\n \"0.6844505\",\n \"0.6307189\",\n \"0.62610507\",\n \"0.6174487\",\n \"0.611505\",\n \"0.60943776\",\n \"0.6078653\",\n \"0.6068298\",\n \"0.5975301\",\n \"0.58927864\",\n \"0.58509856\",\n \"0.58067775\",\n \"0.5770341\",\n \"0.5749379\",\n \"0.55931467\",\n \"0.5588367\",\n \"0.5585682\",\n \"0.5549195\",\n \"0.5530309\",\n \"0.5527462\",\n \"0.5525426\",\n \"0.5508305\",\n \"0.5503325\",\n \"0.5491633\",\n \"0.5490333\",\n \"0.54894584\",\n \"0.5474748\",\n \"0.5461443\",\n \"0.5434278\",\n \"0.5433155\",\n \"0.5422539\",\n \"0.5398072\",\n \"0.538703\",\n \"0.5354622\",\n \"0.5351801\",\n \"0.5338508\",\n \"0.5338508\",\n \"0.5313979\",\n \"0.53026426\",\n \"0.52935773\",\n \"0.5285301\",\n \"0.52727765\",\n \"0.527025\",\n \"0.52628905\",\n \"0.52624017\",\n \"0.5249995\",\n \"0.52495915\",\n \"0.5244615\",\n \"0.52356595\",\n \"0.52218556\",\n \"0.51916844\",\n \"0.51893497\",\n \"0.5179749\",\n \"0.5171309\",\n \"0.51712763\",\n \"0.5169552\",\n \"0.5147553\",\n \"0.5135376\",\n \"0.5132684\",\n \"0.5127312\",\n \"0.5124116\",\n \"0.51228917\",\n \"0.5104308\",\n \"0.5103665\",\n \"0.50978315\",\n \"0.5086428\",\n \"0.50828046\",\n \"0.50815636\",\n \"0.5077339\",\n \"0.5072776\",\n \"0.50718176\",\n \"0.50673467\",\n \"0.5065278\",\n \"0.5064925\",\n \"0.5063846\",\n \"0.5058279\",\n \"0.5052661\",\n \"0.5052147\",\n \"0.504851\",\n \"0.50475276\",\n \"0.5044315\",\n \"0.5040618\",\n \"0.5037574\",\n \"0.503735\",\n \"0.5022159\",\n \"0.49987978\",\n \"0.49987978\",\n \"0.49987978\",\n \"0.4995513\",\n \"0.49944302\",\n \"0.49919683\",\n \"0.49904686\",\n \"0.4983485\",\n \"0.49814227\",\n \"0.49696702\",\n \"0.49684322\",\n \"0.4966544\",\n \"0.4965281\",\n \"0.49607846\",\n \"0.49499288\"\n]"},"document_score":{"kind":"string","value":"0.53259367"},"document_rank":{"kind":"string","value":"37"}}},{"rowIdx":3077,"cells":{"query":{"kind":"string","value":"Check if the supplied array size contains a value"},"document":{"kind":"string","value":"function isArrayElement(arraySize)\n{\n return arraySize != null && !arraySize.isEmpty();\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":["get hasValues() {\n return this.arrayWidth > 0 && this.arrayHeight > 0;\n }","validateArraySize (req, array) {\n const FREEMIUM_INPUT_SIZE = 20\n const PRO_INPUT_SIZE = 20\n\n if (req.locals && req.locals.proLimit) {\n if (array.length <= PRO_INPUT_SIZE) return true\n } else if (array.length <= FREEMIUM_INPUT_SIZE) {\n return true\n }\n\n return false\n }","function is(arr){\n return typeof(arr) == \"object\" && arr.length >= 0;\n }","function isFull(array) {\n if (array.length < maxItems) {\n return false;\n } else {\n return true;\n }\n}","function isBigEnough(element, index, array) {\n return element >= 10;\n }","function arrayLike (data) {\n return assigned(data) && greaterOrEqual(data.length, 0);\n }","function arrayHasValue(arr, value) {\n var idx = arr.indexOf(value);\n if (idx !== -1) {\n return true;\n }\n return false;\n }","static hasValue(array, value) {\n for (var tI = 0; tI < array.length; tI++) {\n if (array[tI] === value) {\n return true;\n }\n }\n return false;\n }","function length (data, value) {\n assert.not.undefined(value);\n\n return assigned(data) && data.length === value;\n }","function checkArray(array, n) {\n for (var i = 0; i < array.length; i++) {\n if (array[i] === n) {\n return true\n }\n }\n return false\n}","get length() {\n return array.length == 0\n }","function containsDuplicate(numArr) {\n // iterate through the array\n let result;\n const checkArr = new Set(numArr);\n\n if (numArr.length !== checkArr.size) {\n result = true;\n } else {\n result = false;\n }\n console.log(numArr.length);\n console.log(checkArr.size);\n console.log(result)\n}","function hasItem(num, arr) {\n for (let i = 0; i < arr.length; i++) { // n\n if (arr[i] === num) { // 1\n return true // 1\n }\n }\n return false // 1\n}","function isNumberLength_11(array) {\n return array.length === 11;\n}","hasValues() {\n\t\treturn this.data.length > 0;\n\t}","function arrayContainsPrimitives(value) {\n const n = Math.min(nChecks, value.length);\n if (!(n > 0)) return false;\n let type;\n let hasPrimitive = false; // ensure we encounter 1+ primitives\n for (let i = 0; i < n; ++i) {\n const v = value[i];\n if (v == null) continue; // ignore null and undefined\n const t = typeof v;\n if (type === undefined) {\n switch (t) {\n case \"number\":\n case \"boolean\":\n case \"string\":\n case \"bigint\":\n type = t;\n break;\n default:\n return false;\n }\n } else if (t !== type) {\n return false;\n }\n hasPrimitive = true;\n }\n return hasPrimitive;\n}","contains(num, arr) {\n\n for (let i = 0; i < arr.length; i++) {\n if (arr[i] === num) {\n return true;\n }\n }\n return false;\n }","function isArray(value) {\n return Array.isArray(value) || ArrayBuffer.isView(value) && value.length !== undefined;\n}","function isArray(value) {\n return Array.isArray(value) || ArrayBuffer.isView(value) && value.length !== undefined;\n}","function hasLength (data, length) {\n return assigned(data) && data.length === length;\n }","function isInArray(value, array) {\n \treturn array.indexOf(value) > -1;\n }","function hasValidSampleSize() {\n return offsetSamples.length >= 5;\n }","function arrayNotEmpty(array) {\n return array instanceof Array && array.length > 0;\n}","function ArrayFilled(o) {\n\treturn o && o instanceof Array && o.length > 0\n\t\t\t&& Number(o.length) === o.length;\n}","function isInArray(value, array) {\n return array.indexOf(value) > -1;\n }","function isInArray(value, array) {\n return array.indexOf(value) > -1;\n }","function isInArray(value, array) {\n return array.indexOf(value) > -1;\n }","function isInArray(value, array) {\n return array.indexOf(value) > -1;\n }","function isSize(value) {\n return typ.isUInt(value) && (value > 0);\n}","function isSize(value) {\n return typ.isUInt(value) && (value > 0);\n}","function isNotEmptyArray( arg ) {\n\n return Array.isArray( arg ) && arg.length > 0;\n }","function containsValue(array, x){\n if(array.length == 0) {\n return 0;\n } else {\n \n if(array[0] == x) {\n return 1 + containsValue(array.slice(1), x);\n }\n return 0 + containsValue(array.slice(1), x);\n }\n}","function hasArrayElement(arr) {\n for (var i=0; i -1; // n \n}","function checkArray(arr, num) {\n for (var i = 0; i < arr.length; i++) {\n if (arr[i] == num) {\n return true;\n }\n }\n return false;\n}","function isInArray(value, array) {\n return array.indexOf(value) > -1;\n}","function isInArray(value, array) {\n return array.indexOf(value) > -1;\n}","function isInArray(random_array, num) {\n if (random_array.indexOf(num) !== -1) {\n return true;\n }\n else {\n return false;\n }\n}","function inArray(array, value){\n arrLength = array.length;\n //While loop in reverse is the fastest way to loop through an array\n while(arrLength--){\n if(value == array[arrLength]){\n return true;\n }\n }\n return false;\n}","function inArray(number) {\n\tfor (i = 0; i < unavailableSpot.length; i++) {\n\t\tif (number == unavailableSpot[i]) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}","checkIfArrayLengthChanged(value) {\n // If we've already detected a change, just return\n if (this.snapshotChanged === true) {\n return;\n }\n if (this.currentPath.baseSnapshotValue !== undefined &&\n this.currentPath.baseSnapshotValue !== null) {\n this.snapshotChanged = this.currentPath.baseSnapshotValue.length !== value.length;\n }\n }","function isInArray(array, value) {\n return array.indexOf(value) > -1;\n }","function has(key) {\n\t var val = this.node[key];\n\t if (val && Array.isArray(val)) {\n\t return !!val.length;\n\t } else {\n\t return !!val;\n\t }\n\t}","function has(key) {\n\t var val = this.node[key];\n\t if (val && Array.isArray(val)) {\n\t return !!val.length;\n\t } else {\n\t return !!val;\n\t }\n\t}","function isArray(obj){return(typeof(obj.length)==\"undefined\")?false:true;}","function checkArguments(array){\n for (var element of array) {\n if (typeof element !== \"number\") return undefined;\n }\n return true;\n }","function inArray(value, array){\n\t\t for(var i=0;i {\n return total + el;\n });\n\n return (sumOfArrayElements == arr.length);\n}","function has(key) {\n var val = this.node[key];\n if (val && Array.isArray(val)) {\n return !!val.length;\n } else {\n return !!val;\n }\n}","function isInArray(value, array) {\n\n for ( var item of array ) {\n if ( item == value ) { return true; }\n }\n return false;\n}","function containsAll(arr){\r\n\tfor(let k=1; k 0){\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}","function hasItems(array) {\n return array[0] !== undefined \n}","set arraySize(value) {}","function isEmpty(arr) {\n return !arr.length;\n}","function haveAllData(array) { \n\n // should have a 2 element array\n if (_.isArray(array) && array.length === 2) \n\n // neither element should be empty\n if (! (_.isEmpty(array[0]) || _.isEmpty(array[1]))) \n return true;\n\n return false;\n}","function containsAll(arr){\n for (let k = 1; k < arguments.length; k++){\n let num = arguments[k];\n if (arr.indexOf(num) === -1){\n return false;\n }\n }\n return true;\n}","static is_data_array_ok(data){\n return this.is_1d_array(data) ||\n this.is_2d_array(data) ||\n this.is_3d_array(data) ||\n this.is_heat_map_suitable_data(data)\n }","function arrayIsValid(_array_) {\n return _array_ && Array.isArray(_array_) && _array_.length > 0;\n}","function is_new_value_in_array(array, value) {\n\tfor (u=0; u < array.length; u++) {\n\t\tif (array[u] == value) \n\t\t\treturn false;\n\t}\n\treturn true;\n}","function nonEmptyArray (data) {\n return array(data) && greater(data.length, 0);\n }","function hasAtLeastOneItem(val) {\n return val.length >= 1;\n}","function is31Flavors(array){\n if(array.length === 31) {\n console.log(true);\n } else{\n console.log(false)\n }\n}","function checkArrayTypeAndLength(x, expectedType, minLength, maxLength) {\n if (minLength === void 0) { minLength = 0; }\n if (maxLength === void 0) { maxLength = Infinity; }\n assert(minLength >= 0);\n assert(maxLength >= minLength);\n return (Array.isArray(x) && x.length >= minLength && x.length <= maxLength &&\n x.every(function (e) { return typeof e === expectedType; }));\n}","function checkArrayTypeAndLength(x, expectedType, minLength, maxLength) {\n if (minLength === void 0) { minLength = 0; }\n if (maxLength === void 0) { maxLength = Infinity; }\n assert(minLength >= 0);\n assert(maxLength >= minLength);\n return (Array.isArray(x) && x.length >= minLength && x.length <= maxLength &&\n x.every(function (e) { return typeof e === expectedType; }));\n}","function isNotEmpty(array) {\n return (array && array.length > 0)\n }","function validarExistenciaValorDeArray(value, array, x_value) {\n for (let i = 0; i < array.length; i++) {\n if (value === array[i][x_value]) {\n return true;\n }\n }\n return false;\n}","function isEmpty(val) {\n if (val === undefined) return true;\n if (val === null) return true;\n if (val.length <= 0) return true;\n if (Array.isArray(val)) {\n var cnt = 0;\n val.forEach(el => {\n if (isEmpty(el)) cnt++;\n });\n if (cnt === val.length) return true;\n }\n return false;\n}","function IsInArray(value, array) {\n return array.indexOf(value) > -1;\n}","function containsElement(arr, x){\n for(var r = 0; r < arr.length; r++){\n if(r == x){\n return true;\n }else{\n return false;\n }\n }\n return containsElement;\n }","function size(found) {\n return sizes[found] || 1;\n }","hasElement(index) {\n this._ensureUnpacked();\n if (this.unpackedArray) {\n return (index >= 0 && index < this.unpackedArray.length);\n }\n return this.unpackedAssocArray.has(index);\n }","function contains(arr, value) {\n\tfor (var i = 0; i < arr.length; i++) {\n\t\tif (arr[i] === value) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}","function beenUsed(val, arr) {\n for(let i = 0; i < arr.length; i++) {\n if(arr[i] == val) return true;\n }\n return false;\n}","function contains(arr, value) {\n\t\tfor (var i = 0; i < arr.length; i++) {\n\t\t\tif (arr[i] === value) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","function contains(arr, value) {\n\t\tfor (var i = 0; i < arr.length; i++) {\n\t\t\tif (arr[i] === value) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","function contains(arr, value) {\n\t\tfor (var i = 0; i < arr.length; i++) {\n\t\t\tif (arr[i] === value) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","function contains(arr, value) {\n\t\tfor (var i = 0; i < arr.length; i++) {\n\t\t\tif (arr[i] == value) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","function arrayValueExist(array, value){\n\t\tfor(var i = 0; i < array.length; i++) if (array[i] == value) return true;\n\t\treturn false;\n\t}","_validateValueArrayDimensions() {\n const that = this;\n let dimensions = 0,\n tempArray = that.value,\n emptyArray = false;\n\n while (tempArray.constructor === Array) {\n dimensions++;\n tempArray = tempArray[0];\n\n if (tempArray === undefined) {\n emptyArray = true;\n break;\n }\n }\n\n if (that.dimensions > dimensions) {\n if (emptyArray) {\n that.value = that._returnEmptyArray();\n return;\n }\n\n while (that.dimensions > dimensions) {\n that._addDimensionToJSArray(dimensions);\n dimensions++;\n }\n }\n }","function arrayValueExist(array, value){\r\n\t\tfor(var i = 0; i < array.length; i++) if (array[i] == value) return true;\r\n\r\n\t\treturn false;\r\n\t}","function isArray(e){return e!=null&&typeof e==\"object\"&&typeof e.length==\"number\"&&(e.length==0||defined(e[0]))}","function checkNumber(numbersArray) { return numbersArray >= 5; }","function isEmpty(array) {\n return !array || !array.length;\n }","function check_array(arr, value, law)\n{\n var op = law;\n\n for (key_temp in arr)\n {\n if (op)\n {\n if (operators[op](arr[key_temp], value))\n {\n return true;\n }\n }\n }\n return false;\n}","function arrayMinSize(array, min) {\n return array instanceof Array && array.length >= min;\n}","function isArray(a) {\r\n// This is not working, so testing if the length member is not undefined\r\n// return isObject(a) && a.constructor == Array;\r\n return isObject(a) && !isUndefined(a.length);\r\n}","function createSizePropertyCheck(getSizeProperty) {\n return function(collection) {\n var sizeProperty = getSizeProperty(collection);\n return typeof sizeProperty == 'number' && sizeProperty >= 0 && sizeProperty <= _setup.MAX_ARRAY_INDEX;\n }\n }","function exists(value, array) {\n return array.some((e) => e === value);\n}","function smallEnough(a, limit){\n let count = 0;\n for(let i = 0; i < a.length; i++){\n if(a[i] > limit) count++\n }\n return count > 0 ? false : true\n}","function oneOf (arr, x) {\n\t if (!Array.isArray(arr)) {\n\t throw new Error('expected an array')\n\t }\n\t return arr.indexOf(x) !== -1\n\t}","function in_array(variable, theArray)\n{\n\treturn $.inArray(variable, theArray) != -1;\n}","function check_array(arr, value, law)\r\n{\r\n var op = law;\r\n for (key_temp in arr)\r\n {\r\n if (op)\r\n {\r\n if (operators[op](arr[key_temp], value))\r\n {\r\n return true;\r\n }\r\n }\r\n }\r\n return false;\r\n}","function isSameArrLength(arr) {\r\n const length = arr[0].length;\r\n\r\n for (let i = 1; i < arr.length; i++) {\r\n if (!Array.isArray(arr) || arr[i].length !== length) {\r\n return false;\r\n }\r\n }\r\n\r\n return true;\r\n}","function has(key) {\n\t var val = this.node && this.node[key];\n\t if (val && Array.isArray(val)) {\n\t return !!val.length;\n\t } else {\n\t return !!val;\n\t }\n\t}","function checkInputSize(input) {\n return input.length < 7;\n}","function isVariable(variableName, arraySize)\n{\n // Only output non-array variables or array members (i.e., skip array\n // definitions)\n return variableName != null && arraySize != null && (arraySize.isEmpty() || variableName.endsWith(\"]\"));\n}","function isArray(value) {\n return value && typeof value === 'object' && value instanceof Array && typeof value.length === 'number' && typeof value.splice === 'function' && !(value.propertyIsEnumerable('length'));\n}","function in_array(value, array)\n{\n\tfor (var i in array)\n\t\tif (array[i] == value)\n\t\t\treturn true;\n\treturn false;\n}"],"string":"[\n \"get hasValues() {\\n return this.arrayWidth > 0 && this.arrayHeight > 0;\\n }\",\n \"validateArraySize (req, array) {\\n const FREEMIUM_INPUT_SIZE = 20\\n const PRO_INPUT_SIZE = 20\\n\\n if (req.locals && req.locals.proLimit) {\\n if (array.length <= PRO_INPUT_SIZE) return true\\n } else if (array.length <= FREEMIUM_INPUT_SIZE) {\\n return true\\n }\\n\\n return false\\n }\",\n \"function is(arr){\\n return typeof(arr) == \\\"object\\\" && arr.length >= 0;\\n }\",\n \"function isFull(array) {\\n if (array.length < maxItems) {\\n return false;\\n } else {\\n return true;\\n }\\n}\",\n \"function isBigEnough(element, index, array) {\\n return element >= 10;\\n }\",\n \"function arrayLike (data) {\\n return assigned(data) && greaterOrEqual(data.length, 0);\\n }\",\n \"function arrayHasValue(arr, value) {\\n var idx = arr.indexOf(value);\\n if (idx !== -1) {\\n return true;\\n }\\n return false;\\n }\",\n \"static hasValue(array, value) {\\n for (var tI = 0; tI < array.length; tI++) {\\n if (array[tI] === value) {\\n return true;\\n }\\n }\\n return false;\\n }\",\n \"function length (data, value) {\\n assert.not.undefined(value);\\n\\n return assigned(data) && data.length === value;\\n }\",\n \"function checkArray(array, n) {\\n for (var i = 0; i < array.length; i++) {\\n if (array[i] === n) {\\n return true\\n }\\n }\\n return false\\n}\",\n \"get length() {\\n return array.length == 0\\n }\",\n \"function containsDuplicate(numArr) {\\n // iterate through the array\\n let result;\\n const checkArr = new Set(numArr);\\n\\n if (numArr.length !== checkArr.size) {\\n result = true;\\n } else {\\n result = false;\\n }\\n console.log(numArr.length);\\n console.log(checkArr.size);\\n console.log(result)\\n}\",\n \"function hasItem(num, arr) {\\n for (let i = 0; i < arr.length; i++) { // n\\n if (arr[i] === num) { // 1\\n return true // 1\\n }\\n }\\n return false // 1\\n}\",\n \"function isNumberLength_11(array) {\\n return array.length === 11;\\n}\",\n \"hasValues() {\\n\\t\\treturn this.data.length > 0;\\n\\t}\",\n \"function arrayContainsPrimitives(value) {\\n const n = Math.min(nChecks, value.length);\\n if (!(n > 0)) return false;\\n let type;\\n let hasPrimitive = false; // ensure we encounter 1+ primitives\\n for (let i = 0; i < n; ++i) {\\n const v = value[i];\\n if (v == null) continue; // ignore null and undefined\\n const t = typeof v;\\n if (type === undefined) {\\n switch (t) {\\n case \\\"number\\\":\\n case \\\"boolean\\\":\\n case \\\"string\\\":\\n case \\\"bigint\\\":\\n type = t;\\n break;\\n default:\\n return false;\\n }\\n } else if (t !== type) {\\n return false;\\n }\\n hasPrimitive = true;\\n }\\n return hasPrimitive;\\n}\",\n \"contains(num, arr) {\\n\\n for (let i = 0; i < arr.length; i++) {\\n if (arr[i] === num) {\\n return true;\\n }\\n }\\n return false;\\n }\",\n \"function isArray(value) {\\n return Array.isArray(value) || ArrayBuffer.isView(value) && value.length !== undefined;\\n}\",\n \"function isArray(value) {\\n return Array.isArray(value) || ArrayBuffer.isView(value) && value.length !== undefined;\\n}\",\n \"function hasLength (data, length) {\\n return assigned(data) && data.length === length;\\n }\",\n \"function isInArray(value, array) {\\n \\treturn array.indexOf(value) > -1;\\n }\",\n \"function hasValidSampleSize() {\\n return offsetSamples.length >= 5;\\n }\",\n \"function arrayNotEmpty(array) {\\n return array instanceof Array && array.length > 0;\\n}\",\n \"function ArrayFilled(o) {\\n\\treturn o && o instanceof Array && o.length > 0\\n\\t\\t\\t&& Number(o.length) === o.length;\\n}\",\n \"function isInArray(value, array) {\\n return array.indexOf(value) > -1;\\n }\",\n \"function isInArray(value, array) {\\n return array.indexOf(value) > -1;\\n }\",\n \"function isInArray(value, array) {\\n return array.indexOf(value) > -1;\\n }\",\n \"function isInArray(value, array) {\\n return array.indexOf(value) > -1;\\n }\",\n \"function isSize(value) {\\n return typ.isUInt(value) && (value > 0);\\n}\",\n \"function isSize(value) {\\n return typ.isUInt(value) && (value > 0);\\n}\",\n \"function isNotEmptyArray( arg ) {\\n\\n return Array.isArray( arg ) && arg.length > 0;\\n }\",\n \"function containsValue(array, x){\\n if(array.length == 0) {\\n return 0;\\n } else {\\n \\n if(array[0] == x) {\\n return 1 + containsValue(array.slice(1), x);\\n }\\n return 0 + containsValue(array.slice(1), x);\\n }\\n}\",\n \"function hasArrayElement(arr) {\\n for (var i=0; i -1; // n \\n}\",\n \"function checkArray(arr, num) {\\n for (var i = 0; i < arr.length; i++) {\\n if (arr[i] == num) {\\n return true;\\n }\\n }\\n return false;\\n}\",\n \"function isInArray(value, array) {\\n return array.indexOf(value) > -1;\\n}\",\n \"function isInArray(value, array) {\\n return array.indexOf(value) > -1;\\n}\",\n \"function isInArray(random_array, num) {\\n if (random_array.indexOf(num) !== -1) {\\n return true;\\n }\\n else {\\n return false;\\n }\\n}\",\n \"function inArray(array, value){\\n arrLength = array.length;\\n //While loop in reverse is the fastest way to loop through an array\\n while(arrLength--){\\n if(value == array[arrLength]){\\n return true;\\n }\\n }\\n return false;\\n}\",\n \"function inArray(number) {\\n\\tfor (i = 0; i < unavailableSpot.length; i++) {\\n\\t\\tif (number == unavailableSpot[i]) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\",\n \"checkIfArrayLengthChanged(value) {\\n // If we've already detected a change, just return\\n if (this.snapshotChanged === true) {\\n return;\\n }\\n if (this.currentPath.baseSnapshotValue !== undefined &&\\n this.currentPath.baseSnapshotValue !== null) {\\n this.snapshotChanged = this.currentPath.baseSnapshotValue.length !== value.length;\\n }\\n }\",\n \"function isInArray(array, value) {\\n return array.indexOf(value) > -1;\\n }\",\n \"function has(key) {\\n\\t var val = this.node[key];\\n\\t if (val && Array.isArray(val)) {\\n\\t return !!val.length;\\n\\t } else {\\n\\t return !!val;\\n\\t }\\n\\t}\",\n \"function has(key) {\\n\\t var val = this.node[key];\\n\\t if (val && Array.isArray(val)) {\\n\\t return !!val.length;\\n\\t } else {\\n\\t return !!val;\\n\\t }\\n\\t}\",\n \"function isArray(obj){return(typeof(obj.length)==\\\"undefined\\\")?false:true;}\",\n \"function checkArguments(array){\\n for (var element of array) {\\n if (typeof element !== \\\"number\\\") return undefined;\\n }\\n return true;\\n }\",\n \"function inArray(value, array){\\n\\t\\t for(var i=0;i {\\n return total + el;\\n });\\n\\n return (sumOfArrayElements == arr.length);\\n}\",\n \"function has(key) {\\n var val = this.node[key];\\n if (val && Array.isArray(val)) {\\n return !!val.length;\\n } else {\\n return !!val;\\n }\\n}\",\n \"function isInArray(value, array) {\\n\\n for ( var item of array ) {\\n if ( item == value ) { return true; }\\n }\\n return false;\\n}\",\n \"function containsAll(arr){\\r\\n\\tfor(let k=1; k 0){\\n\\t\\treturn true;\\n\\t} else {\\n\\t\\treturn false;\\n\\t}\\n}\",\n \"function hasItems(array) {\\n return array[0] !== undefined \\n}\",\n \"set arraySize(value) {}\",\n \"function isEmpty(arr) {\\n return !arr.length;\\n}\",\n \"function haveAllData(array) { \\n\\n // should have a 2 element array\\n if (_.isArray(array) && array.length === 2) \\n\\n // neither element should be empty\\n if (! (_.isEmpty(array[0]) || _.isEmpty(array[1]))) \\n return true;\\n\\n return false;\\n}\",\n \"function containsAll(arr){\\n for (let k = 1; k < arguments.length; k++){\\n let num = arguments[k];\\n if (arr.indexOf(num) === -1){\\n return false;\\n }\\n }\\n return true;\\n}\",\n \"static is_data_array_ok(data){\\n return this.is_1d_array(data) ||\\n this.is_2d_array(data) ||\\n this.is_3d_array(data) ||\\n this.is_heat_map_suitable_data(data)\\n }\",\n \"function arrayIsValid(_array_) {\\n return _array_ && Array.isArray(_array_) && _array_.length > 0;\\n}\",\n \"function is_new_value_in_array(array, value) {\\n\\tfor (u=0; u < array.length; u++) {\\n\\t\\tif (array[u] == value) \\n\\t\\t\\treturn false;\\n\\t}\\n\\treturn true;\\n}\",\n \"function nonEmptyArray (data) {\\n return array(data) && greater(data.length, 0);\\n }\",\n \"function hasAtLeastOneItem(val) {\\n return val.length >= 1;\\n}\",\n \"function is31Flavors(array){\\n if(array.length === 31) {\\n console.log(true);\\n } else{\\n console.log(false)\\n }\\n}\",\n \"function checkArrayTypeAndLength(x, expectedType, minLength, maxLength) {\\n if (minLength === void 0) { minLength = 0; }\\n if (maxLength === void 0) { maxLength = Infinity; }\\n assert(minLength >= 0);\\n assert(maxLength >= minLength);\\n return (Array.isArray(x) && x.length >= minLength && x.length <= maxLength &&\\n x.every(function (e) { return typeof e === expectedType; }));\\n}\",\n \"function checkArrayTypeAndLength(x, expectedType, minLength, maxLength) {\\n if (minLength === void 0) { minLength = 0; }\\n if (maxLength === void 0) { maxLength = Infinity; }\\n assert(minLength >= 0);\\n assert(maxLength >= minLength);\\n return (Array.isArray(x) && x.length >= minLength && x.length <= maxLength &&\\n x.every(function (e) { return typeof e === expectedType; }));\\n}\",\n \"function isNotEmpty(array) {\\n return (array && array.length > 0)\\n }\",\n \"function validarExistenciaValorDeArray(value, array, x_value) {\\n for (let i = 0; i < array.length; i++) {\\n if (value === array[i][x_value]) {\\n return true;\\n }\\n }\\n return false;\\n}\",\n \"function isEmpty(val) {\\n if (val === undefined) return true;\\n if (val === null) return true;\\n if (val.length <= 0) return true;\\n if (Array.isArray(val)) {\\n var cnt = 0;\\n val.forEach(el => {\\n if (isEmpty(el)) cnt++;\\n });\\n if (cnt === val.length) return true;\\n }\\n return false;\\n}\",\n \"function IsInArray(value, array) {\\n return array.indexOf(value) > -1;\\n}\",\n \"function containsElement(arr, x){\\n for(var r = 0; r < arr.length; r++){\\n if(r == x){\\n return true;\\n }else{\\n return false;\\n }\\n }\\n return containsElement;\\n }\",\n \"function size(found) {\\n return sizes[found] || 1;\\n }\",\n \"hasElement(index) {\\n this._ensureUnpacked();\\n if (this.unpackedArray) {\\n return (index >= 0 && index < this.unpackedArray.length);\\n }\\n return this.unpackedAssocArray.has(index);\\n }\",\n \"function contains(arr, value) {\\n\\tfor (var i = 0; i < arr.length; i++) {\\n\\t\\tif (arr[i] === value) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\",\n \"function beenUsed(val, arr) {\\n for(let i = 0; i < arr.length; i++) {\\n if(arr[i] == val) return true;\\n }\\n return false;\\n}\",\n \"function contains(arr, value) {\\n\\t\\tfor (var i = 0; i < arr.length; i++) {\\n\\t\\t\\tif (arr[i] === value) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"function contains(arr, value) {\\n\\t\\tfor (var i = 0; i < arr.length; i++) {\\n\\t\\t\\tif (arr[i] === value) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"function contains(arr, value) {\\n\\t\\tfor (var i = 0; i < arr.length; i++) {\\n\\t\\t\\tif (arr[i] === value) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"function contains(arr, value) {\\n\\t\\tfor (var i = 0; i < arr.length; i++) {\\n\\t\\t\\tif (arr[i] == value) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"function arrayValueExist(array, value){\\n\\t\\tfor(var i = 0; i < array.length; i++) if (array[i] == value) return true;\\n\\t\\treturn false;\\n\\t}\",\n \"_validateValueArrayDimensions() {\\n const that = this;\\n let dimensions = 0,\\n tempArray = that.value,\\n emptyArray = false;\\n\\n while (tempArray.constructor === Array) {\\n dimensions++;\\n tempArray = tempArray[0];\\n\\n if (tempArray === undefined) {\\n emptyArray = true;\\n break;\\n }\\n }\\n\\n if (that.dimensions > dimensions) {\\n if (emptyArray) {\\n that.value = that._returnEmptyArray();\\n return;\\n }\\n\\n while (that.dimensions > dimensions) {\\n that._addDimensionToJSArray(dimensions);\\n dimensions++;\\n }\\n }\\n }\",\n \"function arrayValueExist(array, value){\\r\\n\\t\\tfor(var i = 0; i < array.length; i++) if (array[i] == value) return true;\\r\\n\\r\\n\\t\\treturn false;\\r\\n\\t}\",\n \"function isArray(e){return e!=null&&typeof e==\\\"object\\\"&&typeof e.length==\\\"number\\\"&&(e.length==0||defined(e[0]))}\",\n \"function checkNumber(numbersArray) { return numbersArray >= 5; }\",\n \"function isEmpty(array) {\\n return !array || !array.length;\\n }\",\n \"function check_array(arr, value, law)\\n{\\n var op = law;\\n\\n for (key_temp in arr)\\n {\\n if (op)\\n {\\n if (operators[op](arr[key_temp], value))\\n {\\n return true;\\n }\\n }\\n }\\n return false;\\n}\",\n \"function arrayMinSize(array, min) {\\n return array instanceof Array && array.length >= min;\\n}\",\n \"function isArray(a) {\\r\\n// This is not working, so testing if the length member is not undefined\\r\\n// return isObject(a) && a.constructor == Array;\\r\\n return isObject(a) && !isUndefined(a.length);\\r\\n}\",\n \"function createSizePropertyCheck(getSizeProperty) {\\n return function(collection) {\\n var sizeProperty = getSizeProperty(collection);\\n return typeof sizeProperty == 'number' && sizeProperty >= 0 && sizeProperty <= _setup.MAX_ARRAY_INDEX;\\n }\\n }\",\n \"function exists(value, array) {\\n return array.some((e) => e === value);\\n}\",\n \"function smallEnough(a, limit){\\n let count = 0;\\n for(let i = 0; i < a.length; i++){\\n if(a[i] > limit) count++\\n }\\n return count > 0 ? false : true\\n}\",\n \"function oneOf (arr, x) {\\n\\t if (!Array.isArray(arr)) {\\n\\t throw new Error('expected an array')\\n\\t }\\n\\t return arr.indexOf(x) !== -1\\n\\t}\",\n \"function in_array(variable, theArray)\\n{\\n\\treturn $.inArray(variable, theArray) != -1;\\n}\",\n \"function check_array(arr, value, law)\\r\\n{\\r\\n var op = law;\\r\\n for (key_temp in arr)\\r\\n {\\r\\n if (op)\\r\\n {\\r\\n if (operators[op](arr[key_temp], value))\\r\\n {\\r\\n return true;\\r\\n }\\r\\n }\\r\\n }\\r\\n return false;\\r\\n}\",\n \"function isSameArrLength(arr) {\\r\\n const length = arr[0].length;\\r\\n\\r\\n for (let i = 1; i < arr.length; i++) {\\r\\n if (!Array.isArray(arr) || arr[i].length !== length) {\\r\\n return false;\\r\\n }\\r\\n }\\r\\n\\r\\n return true;\\r\\n}\",\n \"function has(key) {\\n\\t var val = this.node && this.node[key];\\n\\t if (val && Array.isArray(val)) {\\n\\t return !!val.length;\\n\\t } else {\\n\\t return !!val;\\n\\t }\\n\\t}\",\n \"function checkInputSize(input) {\\n return input.length < 7;\\n}\",\n \"function isVariable(variableName, arraySize)\\n{\\n // Only output non-array variables or array members (i.e., skip array\\n // definitions)\\n return variableName != null && arraySize != null && (arraySize.isEmpty() || variableName.endsWith(\\\"]\\\"));\\n}\",\n \"function isArray(value) {\\n return value && typeof value === 'object' && value instanceof Array && typeof value.length === 'number' && typeof value.splice === 'function' && !(value.propertyIsEnumerable('length'));\\n}\",\n \"function in_array(value, array)\\n{\\n\\tfor (var i in array)\\n\\t\\tif (array[i] == value)\\n\\t\\t\\treturn true;\\n\\treturn false;\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.67656267","0.6722253","0.6622202","0.6506073","0.64943284","0.64565045","0.64473206","0.63594013","0.63058066","0.6303271","0.6277014","0.62455976","0.62435305","0.6223165","0.6206438","0.6189157","0.6183994","0.61791366","0.61791366","0.6156779","0.6149414","0.6136477","0.61292684","0.61274105","0.6113191","0.60916907","0.60916907","0.60916907","0.6088811","0.6088811","0.6078422","0.6068497","0.6062232","0.6049607","0.60485715","0.6005608","0.6003113","0.6003113","0.5998116","0.5995067","0.5967659","0.5951725","0.59427756","0.5931315","0.5931315","0.5925516","0.59181225","0.59121984","0.59114426","0.5893719","0.58907574","0.5887895","0.5880528","0.58783144","0.5874916","0.5874534","0.5874337","0.5862277","0.5861761","0.5853878","0.5843937","0.5840562","0.58405435","0.5832937","0.58286077","0.58286077","0.5828527","0.58273834","0.582733","0.5826173","0.5825917","0.5822742","0.5813942","0.58131516","0.5812185","0.5802994","0.5802994","0.5802994","0.5794045","0.57928675","0.57880497","0.57848585","0.57831275","0.57821286","0.5763959","0.57359153","0.5734818","0.57312876","0.5730949","0.57303077","0.5725686","0.5723554","0.57230204","0.5710882","0.57079566","0.5705348","0.5705012","0.57046646","0.5704335","0.5702667"],"string":"[\n \"0.67656267\",\n \"0.6722253\",\n \"0.6622202\",\n \"0.6506073\",\n \"0.64943284\",\n \"0.64565045\",\n \"0.64473206\",\n \"0.63594013\",\n \"0.63058066\",\n \"0.6303271\",\n \"0.6277014\",\n \"0.62455976\",\n \"0.62435305\",\n \"0.6223165\",\n \"0.6206438\",\n \"0.6189157\",\n \"0.6183994\",\n \"0.61791366\",\n \"0.61791366\",\n \"0.6156779\",\n \"0.6149414\",\n \"0.6136477\",\n \"0.61292684\",\n \"0.61274105\",\n \"0.6113191\",\n \"0.60916907\",\n \"0.60916907\",\n \"0.60916907\",\n \"0.6088811\",\n \"0.6088811\",\n \"0.6078422\",\n \"0.6068497\",\n \"0.6062232\",\n \"0.6049607\",\n \"0.60485715\",\n \"0.6005608\",\n \"0.6003113\",\n \"0.6003113\",\n \"0.5998116\",\n \"0.5995067\",\n \"0.5967659\",\n \"0.5951725\",\n \"0.59427756\",\n \"0.5931315\",\n \"0.5931315\",\n \"0.5925516\",\n \"0.59181225\",\n \"0.59121984\",\n \"0.59114426\",\n \"0.5893719\",\n \"0.58907574\",\n \"0.5887895\",\n \"0.5880528\",\n \"0.58783144\",\n \"0.5874916\",\n \"0.5874534\",\n \"0.5874337\",\n \"0.5862277\",\n \"0.5861761\",\n \"0.5853878\",\n \"0.5843937\",\n \"0.5840562\",\n \"0.58405435\",\n \"0.5832937\",\n \"0.58286077\",\n \"0.58286077\",\n \"0.5828527\",\n \"0.58273834\",\n \"0.582733\",\n \"0.5826173\",\n \"0.5825917\",\n \"0.5822742\",\n \"0.5813942\",\n \"0.58131516\",\n \"0.5812185\",\n \"0.5802994\",\n \"0.5802994\",\n \"0.5802994\",\n \"0.5794045\",\n \"0.57928675\",\n \"0.57880497\",\n \"0.57848585\",\n \"0.57831275\",\n \"0.57821286\",\n \"0.5763959\",\n \"0.57359153\",\n \"0.5734818\",\n \"0.57312876\",\n \"0.5730949\",\n \"0.57303077\",\n \"0.5725686\",\n \"0.5723554\",\n \"0.57230204\",\n \"0.5710882\",\n \"0.57079566\",\n \"0.5705348\",\n \"0.5705012\",\n \"0.57046646\",\n \"0.5704335\",\n \"0.5702667\"\n]"},"document_score":{"kind":"string","value":"0.7749507"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":3078,"cells":{"query":{"kind":"string","value":"Get the array index value from the variable name"},"document":{"kind":"string","value":"function getIndex(name)\n{\n // Split the variable name on the underscores and use the last part as the\n // array index\n var parts = name.split(\"_\");\n return parts[parts.length - 1];\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":["variableAt(index) {\n\t\treturn this._vars[index];\n\t}","function nthArray(arrayName, number) {\n\n return arrayName[number];\n}","function index(arr, name) {\n return _.findIndex(arr, matchName(name));\n}","function getVarValue(index){\n return varList[index].value;\n}","function getIndexByName(theArray, name) {\n var ix = _.findIndex(theArray, function(element) { return element.name==name; });\n if (ix < 0) {\n throw 'Unknown name: '+name;\n }\n return ix;\n }","function retr(input)\n{\n var index = names.indexOf(input);\n return variables[index];\n}","value(num, arr) {\n return arr[num];\n }","nameAtIndex(index) {\n const names = this.getPathNames()\n return names[util.mod(index, names.length)]\n }","function getArrayKey( arr, ix)\n{\n\n var i = 0;\n for( key in arr) {\n if( i == ix) {\n return key;\n }\n i++;\n }\n\n return '';\n}","getIndexByName(name) {\n return this.nameIndex[name];\n }","arrayIndex(key) {\n let start = key.indexOf(\"[\");\n let end = key.indexOf(\"]\");\n if (start >= 0 && end > 0 && start < end) {\n return parseInt(key.substring(start + 1, end));\n }\n else {\n return -1;\n }\n }","getIndex(name){\n var result;\n if(isNaN(name)){\n result=this.layerNames[name];\n if(result)\n return result.id;\n }else return name;\n return undefined;\n //return (isNaN(name))? this.layerNames[name].id:name;\n }","getValueAt (ix, key) {\n const { elements } = this.specs[key]\n const array = this.arrays[key]\n if (elements === 0) return array\n return array[ix]\n }","function getindex(mapping_name)\r{\r\tvar entry;\r\tfor(var i=0; i 2 ) return parseInt(vararray[1]);\n}","function scanVariable(input, index, variableSet) {\n\tvar variableName = tryReadVariableName(input, index);\n\t/* variableName should not be null here, by contract. */\n\t\n\tvariableSet[variableName] = true;\n\treturn variableName;\n}","function getPropertyNameForIndexedAccess(indexArgumentExpression, indexArgumentType) {\n if (indexArgumentExpression.kind === 9 /* StringLiteral */ || indexArgumentExpression.kind === 8 /* NumericLiteral */) {\n return indexArgumentExpression.text;\n }\n if (indexArgumentExpression.kind === 173 /* ElementAccessExpression */ || indexArgumentExpression.kind === 172 /* PropertyAccessExpression */) {\n var value = getConstantValue(indexArgumentExpression);\n if (value !== undefined) {\n return value.toString();\n }\n }\n if (checkThatExpressionIsProperSymbolReference(indexArgumentExpression, indexArgumentType, /*reportError*/ false)) {\n var rightHandSideName = indexArgumentExpression.name.text;\n return ts.getPropertyNameForKnownSymbolName(rightHandSideName);\n }\n return undefined;\n }","function f(arr) {\n words = arr[0]\n idx = arr[1]\n if (typeof words !== \"string\" && typeof idx !== \"number\"){\n return undefined\n }\n return words[idx]\n}","function convertArrayMember(variableName)\n{\n return variableName.replaceAll(\"[\\\\[]\", \"_\").replaceAll(\"[\\\\]]\", \"\");\n}","function accessElementInArray(array, index){\n var element = array[index]\n return element\n}","getWordAtIndex(index) {\n return this.args[5+index];\n }","function getID(array, key) {\n let index = array\n .map(function (e) {\n return e.name;\n })\n .indexOf(key);\n return array[index].id;\n}","function myFindIndex(list, name) {\n for (var i = 0; i < list.length; i++) {\n if (list[i] == name) {\n return i;\n }\n }\n}","function accessElementInArray(array, index) {\n return array[index];\n}","getAt(idx) {\n return this._get(idx).val;\n }","function findIndex(arr, val) {\n\n}","checkInside(sym, arr){\n let ind= -1;\n for(let i=0; i= array.length)) caml_array_bound_error();\n return array[index+1];\n}","function getLetterAtIndex(arr, index) {\n let letters = arr.split(\"\");\n return letters[index];\n}","function IndexCal(letter)\n{\n var sentence=\"Maryum\";\n\ndocument.write((sentence[letter]));\n\n}","function findVariable (dataClass, varName)\n{\n\t\n\t//search qualitative\n\tif(dataClass=='super')\n\t{\n\t\tfor(var j in superUsage.names)\n\t\t{\n\t\t\tif(superUsage.names[j].toLowerCase()==varName)\n\t\t\t\treturn j;\n\t\t}\n\t}\n\t\n\t//search quantitative\n\telse\t\n\t{\n\t\tfor(var j in varUsage.names)\n\t\t{\n\t\t\tif(varUsage.names[j].toLowerCase()==varName)\n\t\t\t{\n\t\t\t\treturn j;\n\t\t\t}\n\t\t}\n\t}\n\t\n\t//no match\n\tconsole.error(\"ERROR: Invalid dataset name: \"+varName);\n\treturn -1;\n}","function getIndex(s){\n for(p in alphaObj){\n if (alphaObj[p] == s){\n return p;\n }\n }\n}","parseVarName() {\n const token = this.input.next();\n if (token.type != \"var\") this.input.croak(\"Expect variable name\");\n return token.value;\n }","function xIndex(squareDiv) {\n var x = squareDiv.split(\"_\");\n var i = parseInt(x[1]);\n return i;\n}","get(){return this[n]}","function indexOfArray(arr,index){\r\n\treturn arr[index]\r\n}","function getLetters(stringArray, arrayIndexValue) {\n\n for (let i = 0; i < stringArray.length; i++) {\n if (stringArray[arrayIndexValue]) {\n\n }\n\n return stringArray.arrayIndexValue\n }\n\n}","function getBindingNameFromIndex(stylingContext, offset, directiveIndex, isClassBased) {\n var singleIndex = getSinglePropIndexValue(stylingContext, directiveIndex, offset, isClassBased);\n return getProp(stylingContext, singleIndex);\n}","getKey(value, index) {\n return index;\n }","findIndexVertex(name, vertexBufferArray){\n for(let i = 0; i < vertexBufferArray.length; i++){\n if(vertexBufferArray[i].getName() === name){\n return i;\n }\n }\n return -1;\n }","function getKeyValue(gl, name) {\n // If not a string, return (assume number)\n if (typeof name !== 'string') {\n return name;\n } // If string converts to number, return number\n\n\n var number = Number(name);\n\n if (!isNaN(number)) {\n return number;\n } // Look up string, after removing any 'GL.' or 'gl.' prefix\n\n\n name = name.replace(/^.*\\./, '');\n var value = gl[name];\n (0, _assert.default)(value !== undefined, \"Accessing undefined constant GL.\".concat(name));\n return value;\n}","function getIndex(name) {\n return vm.results ? vm.results.indexOf(name): 0;\n }","function indexer2(name){\n var index = -2;\n var row = -2;\n var sheet = SpreadsheetApp.getActive().getSheets()[0].getDataRange().getValues();\n for(var b in sheet){\n for(var a in sheet[0]){\n if(sheet[b][a] == name){\n index = a;\n row = b;\n break;\n }\n }\n }\n return [parseInt(index)+1, parseInt(row)+1];\n}","getFirstIndex() {\n this._ensureUnpacked();\n if (this.unpackedArray) {\n return 0;\n } else if (this.unpackedAssocArray) {\n this._ensureAssocKeys();\n return this.unpackedAssocKeys[0];\n }\n }","function namedParamsWithIndex() {\n const namedUrlParams = getPathNames(namedUrl);\n\n return namedUrlParams.reduce((validParams, param, index) => {\n if (param[0] === \":\") {\n validParams.push({ value: param.slice(1), index });\n }\n return validParams;\n }, []);\n }","function getKeyValue(gl, name) {\n // If not a string, return (assume number)\n if (typeof name !== 'string') {\n return name;\n }\n\n // If string converts to number, return number\n var number = Number(name);\n if (!isNaN(number)) {\n return number;\n }\n\n // Look up string, after removing any 'GL.' or 'gl.' prefix\n name = name.replace(/^.*\\./, '');\n var value = gl[name];\n __WEBPACK_IMPORTED_MODULE_0_assert___default()(value !== undefined, 'Accessing undefined constant GL.' + name);\n return value;\n}","function getLabelIndex(label){\n for (var i in chartData){\n if (chartData[i].label == label){\n return i;\n }\n }\n return -1;\n}","function names(arr) {\n return names.name;\n}","function getIndex(array, attr, value) {\n for (var i = 0; i < array.length; i++) {\n if (array[i].hasOwnProperty(attr) && array[i][attr] === value) {\n return i;\n }\n }\n return -1;\n }","function findIndexInArray(array, target) {\n\tfor (var i = 0; i < array.length; i++) {\n\t\tif(array[i].hasOwnProperty('name')) {\n\t\t\tif(array[i].name == target) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}","name(n) {\n return this.slots[n * 2];\n }","function indexing(input){\n var arr = process.argv.indexOf(input);\n return (arr === -1) ? null : process.argv[++arr];\n}","getAt(idx) {\n if(idx >= this.length || idx < 0) {\n throw new Error(\"Invalid index.\");\n }\n return this._get(idx).val;\n }","function pgp_getVar(varName){\r\n\treturn varName+pgp_location;\r\n}","function keyVal(arr, key){\n if (arr.indexOf(key) == -1){ \n } else{\n return key;\n }\n}","function findSubObjIndex(arr, indexToFind) {\n for(var i=0; i < arr.length; i++) {\n if(arr[i].$$i == indexToFind) {\n return i;\n }\n }\n return -1;\n}","getVar(variable) {\n\t\tconst tag = variable.toLowerCase();\n\t\treturn this._customVar[tag];\n\t}","function valAtIndex (view, index) {\n return view.viewAtIndex(index).stringValue()\n}","function findIndexFromId(array, attr, value) {\n for (var i = 0; i < array.length; i += 1) {\n if (array[i][attr] === value) {\n return i;\n }\n }\n return -1;\n }","function a (name)\n{\n return (typeof name == \"string\") ? memory.identifiers[name] : name;\n}","getValues(varName) {\n return this.values[varName];\n }","function get_index(attr) {\r\n\r\n try {\r\n return attr.match(/[0-9]+/);\r\n } catch (err) {\r\n alert(err);\r\n }\r\n }","function valueKey(input){\n for (var qqchose in input ){\n var numqqchose = input[qqchose];\n console.log(numqqchose);\n } \n return numqqchose;\n}","function f(x) {\n var a = [1, 2];\n a[x];\n return a[0 - x];\n}","function indexOfArray(arr,i){\n \n return arr[i];\n }","function getItemByName(anArray, name) {\r\n for (var i = 0; i < anArray.length; i += 1) {\r\n if (anArray[i].name === name) {\r\n return anArray[i];\r\n }\r\n }\r\n}","function getName(index){\n\treturn cachedPinInfo[index].n;\n}"],"string":"[\n \"variableAt(index) {\\n\\t\\treturn this._vars[index];\\n\\t}\",\n \"function nthArray(arrayName, number) {\\n\\n return arrayName[number];\\n}\",\n \"function index(arr, name) {\\n return _.findIndex(arr, matchName(name));\\n}\",\n \"function getVarValue(index){\\n return varList[index].value;\\n}\",\n \"function getIndexByName(theArray, name) {\\n var ix = _.findIndex(theArray, function(element) { return element.name==name; });\\n if (ix < 0) {\\n throw 'Unknown name: '+name;\\n }\\n return ix;\\n }\",\n \"function retr(input)\\n{\\n var index = names.indexOf(input);\\n return variables[index];\\n}\",\n \"value(num, arr) {\\n return arr[num];\\n }\",\n \"nameAtIndex(index) {\\n const names = this.getPathNames()\\n return names[util.mod(index, names.length)]\\n }\",\n \"function getArrayKey( arr, ix)\\n{\\n\\n var i = 0;\\n for( key in arr) {\\n if( i == ix) {\\n return key;\\n }\\n i++;\\n }\\n\\n return '';\\n}\",\n \"getIndexByName(name) {\\n return this.nameIndex[name];\\n }\",\n \"arrayIndex(key) {\\n let start = key.indexOf(\\\"[\\\");\\n let end = key.indexOf(\\\"]\\\");\\n if (start >= 0 && end > 0 && start < end) {\\n return parseInt(key.substring(start + 1, end));\\n }\\n else {\\n return -1;\\n }\\n }\",\n \"getIndex(name){\\n var result;\\n if(isNaN(name)){\\n result=this.layerNames[name];\\n if(result)\\n return result.id;\\n }else return name;\\n return undefined;\\n //return (isNaN(name))? this.layerNames[name].id:name;\\n }\",\n \"getValueAt (ix, key) {\\n const { elements } = this.specs[key]\\n const array = this.arrays[key]\\n if (elements === 0) return array\\n return array[ix]\\n }\",\n \"function getindex(mapping_name)\\r{\\r\\tvar entry;\\r\\tfor(var i=0; i 2 ) return parseInt(vararray[1]);\\n}\",\n \"function scanVariable(input, index, variableSet) {\\n\\tvar variableName = tryReadVariableName(input, index);\\n\\t/* variableName should not be null here, by contract. */\\n\\t\\n\\tvariableSet[variableName] = true;\\n\\treturn variableName;\\n}\",\n \"function getPropertyNameForIndexedAccess(indexArgumentExpression, indexArgumentType) {\\n if (indexArgumentExpression.kind === 9 /* StringLiteral */ || indexArgumentExpression.kind === 8 /* NumericLiteral */) {\\n return indexArgumentExpression.text;\\n }\\n if (indexArgumentExpression.kind === 173 /* ElementAccessExpression */ || indexArgumentExpression.kind === 172 /* PropertyAccessExpression */) {\\n var value = getConstantValue(indexArgumentExpression);\\n if (value !== undefined) {\\n return value.toString();\\n }\\n }\\n if (checkThatExpressionIsProperSymbolReference(indexArgumentExpression, indexArgumentType, /*reportError*/ false)) {\\n var rightHandSideName = indexArgumentExpression.name.text;\\n return ts.getPropertyNameForKnownSymbolName(rightHandSideName);\\n }\\n return undefined;\\n }\",\n \"function f(arr) {\\n words = arr[0]\\n idx = arr[1]\\n if (typeof words !== \\\"string\\\" && typeof idx !== \\\"number\\\"){\\n return undefined\\n }\\n return words[idx]\\n}\",\n \"function convertArrayMember(variableName)\\n{\\n return variableName.replaceAll(\\\"[\\\\\\\\[]\\\", \\\"_\\\").replaceAll(\\\"[\\\\\\\\]]\\\", \\\"\\\");\\n}\",\n \"function accessElementInArray(array, index){\\n var element = array[index]\\n return element\\n}\",\n \"getWordAtIndex(index) {\\n return this.args[5+index];\\n }\",\n \"function getID(array, key) {\\n let index = array\\n .map(function (e) {\\n return e.name;\\n })\\n .indexOf(key);\\n return array[index].id;\\n}\",\n \"function myFindIndex(list, name) {\\n for (var i = 0; i < list.length; i++) {\\n if (list[i] == name) {\\n return i;\\n }\\n }\\n}\",\n \"function accessElementInArray(array, index) {\\n return array[index];\\n}\",\n \"getAt(idx) {\\n return this._get(idx).val;\\n }\",\n \"function findIndex(arr, val) {\\n\\n}\",\n \"checkInside(sym, arr){\\n let ind= -1;\\n for(let i=0; i= array.length)) caml_array_bound_error();\\n return array[index+1];\\n}\",\n \"function getLetterAtIndex(arr, index) {\\n let letters = arr.split(\\\"\\\");\\n return letters[index];\\n}\",\n \"function IndexCal(letter)\\n{\\n var sentence=\\\"Maryum\\\";\\n\\ndocument.write((sentence[letter]));\\n\\n}\",\n \"function findVariable (dataClass, varName)\\n{\\n\\t\\n\\t//search qualitative\\n\\tif(dataClass=='super')\\n\\t{\\n\\t\\tfor(var j in superUsage.names)\\n\\t\\t{\\n\\t\\t\\tif(superUsage.names[j].toLowerCase()==varName)\\n\\t\\t\\t\\treturn j;\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//search quantitative\\n\\telse\\t\\n\\t{\\n\\t\\tfor(var j in varUsage.names)\\n\\t\\t{\\n\\t\\t\\tif(varUsage.names[j].toLowerCase()==varName)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\t//no match\\n\\tconsole.error(\\\"ERROR: Invalid dataset name: \\\"+varName);\\n\\treturn -1;\\n}\",\n \"function getIndex(s){\\n for(p in alphaObj){\\n if (alphaObj[p] == s){\\n return p;\\n }\\n }\\n}\",\n \"parseVarName() {\\n const token = this.input.next();\\n if (token.type != \\\"var\\\") this.input.croak(\\\"Expect variable name\\\");\\n return token.value;\\n }\",\n \"function xIndex(squareDiv) {\\n var x = squareDiv.split(\\\"_\\\");\\n var i = parseInt(x[1]);\\n return i;\\n}\",\n \"get(){return this[n]}\",\n \"function indexOfArray(arr,index){\\r\\n\\treturn arr[index]\\r\\n}\",\n \"function getLetters(stringArray, arrayIndexValue) {\\n\\n for (let i = 0; i < stringArray.length; i++) {\\n if (stringArray[arrayIndexValue]) {\\n\\n }\\n\\n return stringArray.arrayIndexValue\\n }\\n\\n}\",\n \"function getBindingNameFromIndex(stylingContext, offset, directiveIndex, isClassBased) {\\n var singleIndex = getSinglePropIndexValue(stylingContext, directiveIndex, offset, isClassBased);\\n return getProp(stylingContext, singleIndex);\\n}\",\n \"getKey(value, index) {\\n return index;\\n }\",\n \"findIndexVertex(name, vertexBufferArray){\\n for(let i = 0; i < vertexBufferArray.length; i++){\\n if(vertexBufferArray[i].getName() === name){\\n return i;\\n }\\n }\\n return -1;\\n }\",\n \"function getKeyValue(gl, name) {\\n // If not a string, return (assume number)\\n if (typeof name !== 'string') {\\n return name;\\n } // If string converts to number, return number\\n\\n\\n var number = Number(name);\\n\\n if (!isNaN(number)) {\\n return number;\\n } // Look up string, after removing any 'GL.' or 'gl.' prefix\\n\\n\\n name = name.replace(/^.*\\\\./, '');\\n var value = gl[name];\\n (0, _assert.default)(value !== undefined, \\\"Accessing undefined constant GL.\\\".concat(name));\\n return value;\\n}\",\n \"function getIndex(name) {\\n return vm.results ? vm.results.indexOf(name): 0;\\n }\",\n \"function indexer2(name){\\n var index = -2;\\n var row = -2;\\n var sheet = SpreadsheetApp.getActive().getSheets()[0].getDataRange().getValues();\\n for(var b in sheet){\\n for(var a in sheet[0]){\\n if(sheet[b][a] == name){\\n index = a;\\n row = b;\\n break;\\n }\\n }\\n }\\n return [parseInt(index)+1, parseInt(row)+1];\\n}\",\n \"getFirstIndex() {\\n this._ensureUnpacked();\\n if (this.unpackedArray) {\\n return 0;\\n } else if (this.unpackedAssocArray) {\\n this._ensureAssocKeys();\\n return this.unpackedAssocKeys[0];\\n }\\n }\",\n \"function namedParamsWithIndex() {\\n const namedUrlParams = getPathNames(namedUrl);\\n\\n return namedUrlParams.reduce((validParams, param, index) => {\\n if (param[0] === \\\":\\\") {\\n validParams.push({ value: param.slice(1), index });\\n }\\n return validParams;\\n }, []);\\n }\",\n \"function getKeyValue(gl, name) {\\n // If not a string, return (assume number)\\n if (typeof name !== 'string') {\\n return name;\\n }\\n\\n // If string converts to number, return number\\n var number = Number(name);\\n if (!isNaN(number)) {\\n return number;\\n }\\n\\n // Look up string, after removing any 'GL.' or 'gl.' prefix\\n name = name.replace(/^.*\\\\./, '');\\n var value = gl[name];\\n __WEBPACK_IMPORTED_MODULE_0_assert___default()(value !== undefined, 'Accessing undefined constant GL.' + name);\\n return value;\\n}\",\n \"function getLabelIndex(label){\\n for (var i in chartData){\\n if (chartData[i].label == label){\\n return i;\\n }\\n }\\n return -1;\\n}\",\n \"function names(arr) {\\n return names.name;\\n}\",\n \"function getIndex(array, attr, value) {\\n for (var i = 0; i < array.length; i++) {\\n if (array[i].hasOwnProperty(attr) && array[i][attr] === value) {\\n return i;\\n }\\n }\\n return -1;\\n }\",\n \"function findIndexInArray(array, target) {\\n\\tfor (var i = 0; i < array.length; i++) {\\n\\t\\tif(array[i].hasOwnProperty('name')) {\\n\\t\\t\\tif(array[i].name == target) {\\n\\t\\t\\t\\treturn i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn -1;\\n}\",\n \"name(n) {\\n return this.slots[n * 2];\\n }\",\n \"function indexing(input){\\n var arr = process.argv.indexOf(input);\\n return (arr === -1) ? null : process.argv[++arr];\\n}\",\n \"getAt(idx) {\\n if(idx >= this.length || idx < 0) {\\n throw new Error(\\\"Invalid index.\\\");\\n }\\n return this._get(idx).val;\\n }\",\n \"function pgp_getVar(varName){\\r\\n\\treturn varName+pgp_location;\\r\\n}\",\n \"function keyVal(arr, key){\\n if (arr.indexOf(key) == -1){ \\n } else{\\n return key;\\n }\\n}\",\n \"function findSubObjIndex(arr, indexToFind) {\\n for(var i=0; i < arr.length; i++) {\\n if(arr[i].$$i == indexToFind) {\\n return i;\\n }\\n }\\n return -1;\\n}\",\n \"getVar(variable) {\\n\\t\\tconst tag = variable.toLowerCase();\\n\\t\\treturn this._customVar[tag];\\n\\t}\",\n \"function valAtIndex (view, index) {\\n return view.viewAtIndex(index).stringValue()\\n}\",\n \"function findIndexFromId(array, attr, value) {\\n for (var i = 0; i < array.length; i += 1) {\\n if (array[i][attr] === value) {\\n return i;\\n }\\n }\\n return -1;\\n }\",\n \"function a (name)\\n{\\n return (typeof name == \\\"string\\\") ? memory.identifiers[name] : name;\\n}\",\n \"getValues(varName) {\\n return this.values[varName];\\n }\",\n \"function get_index(attr) {\\r\\n\\r\\n try {\\r\\n return attr.match(/[0-9]+/);\\r\\n } catch (err) {\\r\\n alert(err);\\r\\n }\\r\\n }\",\n \"function valueKey(input){\\n for (var qqchose in input ){\\n var numqqchose = input[qqchose];\\n console.log(numqqchose);\\n } \\n return numqqchose;\\n}\",\n \"function f(x) {\\n var a = [1, 2];\\n a[x];\\n return a[0 - x];\\n}\",\n \"function indexOfArray(arr,i){\\n \\n return arr[i];\\n }\",\n \"function getItemByName(anArray, name) {\\r\\n for (var i = 0; i < anArray.length; i += 1) {\\r\\n if (anArray[i].name === name) {\\r\\n return anArray[i];\\r\\n }\\r\\n }\\r\\n}\",\n \"function getName(index){\\n\\treturn cachedPinInfo[index].n;\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.66877156","0.6651087","0.640118","0.6385651","0.63771635","0.63339627","0.619989","0.6096024","0.6087681","0.6075198","0.6040069","0.59576315","0.5896634","0.5833155","0.5832128","0.58292294","0.57799965","0.5752793","0.57407445","0.57022464","0.5697944","0.5693981","0.56915563","0.56729484","0.56607383","0.5646932","0.5623587","0.5615731","0.5588605","0.556459","0.5563107","0.55621475","0.5561702","0.55283993","0.55066967","0.5504526","0.5498881","0.54855824","0.5483611","0.54684544","0.5457128","0.5448134","0.544153","0.5414194","0.5410875","0.5409689","0.54075915","0.5393284","0.5373222","0.5358881","0.53568333","0.53555834","0.53547055","0.5354271","0.5352411","0.5352411","0.5343514","0.53434885","0.53428537","0.53376085","0.53366","0.53237927","0.5315691","0.5314383","0.52853644","0.5274541","0.5269976","0.52453214","0.52287006","0.521598","0.5215229","0.5212844","0.520504","0.5183517","0.5180872","0.51802534","0.517075","0.51651615","0.5161097","0.5158573","0.5155579","0.5152213","0.5149163","0.5145085","0.5141695","0.5138741","0.5130978","0.51280105","0.5116336","0.5114097","0.51114964","0.5100398","0.5098598","0.50831044","0.5076684","0.50748056","0.50729793","0.50724274","0.5070262","0.50701976"],"string":"[\n \"0.66877156\",\n \"0.6651087\",\n \"0.640118\",\n \"0.6385651\",\n \"0.63771635\",\n \"0.63339627\",\n \"0.619989\",\n \"0.6096024\",\n \"0.6087681\",\n \"0.6075198\",\n \"0.6040069\",\n \"0.59576315\",\n \"0.5896634\",\n \"0.5833155\",\n \"0.5832128\",\n \"0.58292294\",\n \"0.57799965\",\n \"0.5752793\",\n \"0.57407445\",\n \"0.57022464\",\n \"0.5697944\",\n \"0.5693981\",\n \"0.56915563\",\n \"0.56729484\",\n \"0.56607383\",\n \"0.5646932\",\n \"0.5623587\",\n \"0.5615731\",\n \"0.5588605\",\n \"0.556459\",\n \"0.5563107\",\n \"0.55621475\",\n \"0.5561702\",\n \"0.55283993\",\n \"0.55066967\",\n \"0.5504526\",\n \"0.5498881\",\n \"0.54855824\",\n \"0.5483611\",\n \"0.54684544\",\n \"0.5457128\",\n \"0.5448134\",\n \"0.544153\",\n \"0.5414194\",\n \"0.5410875\",\n \"0.5409689\",\n \"0.54075915\",\n \"0.5393284\",\n \"0.5373222\",\n \"0.5358881\",\n \"0.53568333\",\n \"0.53555834\",\n \"0.53547055\",\n \"0.5354271\",\n \"0.5352411\",\n \"0.5352411\",\n \"0.5343514\",\n \"0.53434885\",\n \"0.53428537\",\n \"0.53376085\",\n \"0.53366\",\n \"0.53237927\",\n \"0.5315691\",\n \"0.5314383\",\n \"0.52853644\",\n \"0.5274541\",\n \"0.5269976\",\n \"0.52453214\",\n \"0.52287006\",\n \"0.521598\",\n \"0.5215229\",\n \"0.5212844\",\n \"0.520504\",\n \"0.5183517\",\n \"0.5180872\",\n \"0.51802534\",\n \"0.517075\",\n \"0.51651615\",\n \"0.5161097\",\n \"0.5158573\",\n \"0.5155579\",\n \"0.5152213\",\n \"0.5149163\",\n \"0.5145085\",\n \"0.5141695\",\n \"0.5138741\",\n \"0.5130978\",\n \"0.51280105\",\n \"0.5116336\",\n \"0.5114097\",\n \"0.51114964\",\n \"0.5100398\",\n \"0.5098598\",\n \"0.50831044\",\n \"0.5076684\",\n \"0.50748056\",\n \"0.50729793\",\n \"0.50724274\",\n \"0.5070262\",\n \"0.50701976\"\n]"},"document_score":{"kind":"string","value":"0.8149556"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":3079,"cells":{"query":{"kind":"string","value":"Selects the format arguments to use for a particular ITOS type, based on its type"},"document":{"kind":"string","value":"function setITOSFormatFlag(itosEncode)\n{\n var itosFormat = \"\";\n var withSign = 0;\n modNum = modNumDefault;\n\n // Select based on the data type character (F, I, U, S)\n switch (itosEncode.substr(0, 1))\n {\n // Floating point\n case 'F':\n // Get the number of bytes that define the floating point\n var numBytes = itosEncode.length() - 1;\n\n // Check if the number of bytes is greater than 4 (i.e., it's a\n // double precision floating point)\n if (numBytes > 4)\n {\n // Set the format string and parameters for a double\n itosFormat = \"%13.3f\";\n numITOSDigits = 14;\n modNum = modNumDefault / 2;\n }\n // The number of bytes is equal to or less than 4 (i.e., it's a\n // single precision floating point)\n else\n {\n // Set the format string and parameters for a float\n itosFormat = \"%6.3f\";\n numITOSDigits = 7;\n modNum = modNumDefault / 2;\n }\n\n break;\n\n // Signed integer\n case 'I':\n // Set the value to add a space for the sign\n withSign = 1;\n\n // Unsigned integer\n case 'U':\n // Get the number of bytes that define the (unsigned) integer\n var numBytes = itosEncode.length() - 1;\n\n // Determine the number of digits required to display the largest\n // possible value for the (unsigned) integer with the specified\n // number of bytes\n var nDigits = 2 * numBytes + 1 + Math.floor(numBytes / 4);\n\n // Add a digit for a +/- if signed integer\n nDigits += +withSign;\n\n // Set the format string and parameters for a (unsigned) integer\n itosFormat = \"%\" + nDigits.toString() + \"d\";\n numITOSDigits = nDigits;\n\n // Check if the number of bytes is greater than 2\n if (numBytes > 2)\n {\n // Set the format parameter\n modNum = modNumDefault / 2;\n }\n\n break;\n\n // Character or string\n case 'S':\n // Set the format string and parameters for a character or string\n itosFormat = \"%s\";\n numITOSDigits = 10;\n modNum = modNumDefault / 2;\n break;\n\n default:\n break;\n }\n\n return itosFormat;\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 asPrintFormat(type)\n{\n if (StringHelper.isString(type)) {\n return '%s';\n }\n\n function fn(pkgId)\n {\n const options = { 'hash' : {} };\n return zclHelper.asUnderlyingZclType.call(this, type, options).then(zclType => {\n const basicType = ChipTypesHelper.asBasicType(zclType);\n switch (basicType) {\n case 'bool':\n return '%d';\n case 'int8_t':\n return '%\" PRId8 \"';\n case 'uint8_t':\n return '%\" PRIu8 \"';\n case 'int16_t':\n return '%\" PRId16 \"';\n case 'uint16_t':\n return '%\" PRIu16 \"';\n case 'int24_t':\n return '%\" PRId32 \"';\n case 'uint24_t':\n return '%\" PRIu32 \"';\n case 'int32_t':\n return '%\" PRId32 \"';\n case 'uint32_t':\n return '%\" PRIu32 \"';\n case 'int64_t':\n return '%\" PRId64 \"';\n case 'uint64_t':\n return '%\" PRIu64 \"';\n default:\n return '%p';\n }\n })\n }\n\n const promise = templateUtil.ensureZclPackageId(this).then(fn.bind(this)).catch(err => {\n console.log(err);\n throw err;\n });\n return templateUtil.templatePromise(this.global, promise)\n}","function format(number, type, input){\n if(type === 'time'){\n var dateMili = Object.keys(input)[(number - 1) * 2].split('name')[1] * 10;\n return dateMili;\n }\n else if(type === 'name'){\n x = Object.keys(input).map(function (key){\n return input[key];\n });\n return x[(number -1) * 2];\n }\n else if(type === 'message'){\n x = Object.keys(input).map(function (key){\n return input[key];\n });\n return x[(number -1) * 2 + 1];\n }\n}","inputType() {\n // Unsigned integer\n if (this.argument.type[0] == 'U') {\n // Supports binary, hex, ocatal, and digital\n return [\"text\", \"0[bB][01]+|0[oO][0-7]+|0[xX][0-9a-fA-F]+|[1-9]\\\\\\\\d*\"];\n }\n else if (this.argument.type[0] == 'F') {\n return [\"number\", \"\\\\d*.?\\\\d*\"];\n }\n return [\"text\", \".*\"];\n }","inputType() {\n // Unsigned integer\n if (this.argument.type[0] == 'U') {\n // Supports binary, hex, octal, and digital\n return [\"text\", \"0[bB][01]+|0[oO][0-7]+|0[xX][0-9a-fA-F]+|[1-9]\\\\\\\\d*\"];\n }\n else if (this.argument.type[0] == 'F') {\n return [\"number\", \"\\\\d*.?\\\\d*\"];\n }\n return [\"text\", \".*\"];\n }","function format() {\r\n var format = arguments[0] || \"\";\r\n var match = format.match(/%s|%d|%j/g);\r\n if (!match) return format;\r\n\r\n if (match.length != arguments.length - 1) throw { name: \"Argument Error\", message: \"Number of arguments mismatch\" };\r\n for (var i = 1; i < arguments.length; i++) {\r\n var matchIndex = i - 1;\r\n var value = (match[matchIndex] == \"%j\") ? JSON.stringify(arguments[i]) : arguments[i];\r\n format = format.replace(match[matchIndex], value);\r\n }\r\n return format;\r\n }","function formatType(type) {\n if (type == 0) {\n return '次';\n } else if (type == 1) {\n return '月';\n } else if (type == 2) {\n return '年';\n }\n }","function getDefaultInputFormat() {\n var type = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 'date';\n return DEFAULT_INPUT_DATE_FORMAT[type];\n}","function sformat(format) {\n var args = arguments;\n var i = 0;\n return format.replace(/{(\\d*)}/g, function sformatReplace(match, number) {\n i += 1;\n if (typeof args[number] !== 'undefined') {\n return args[number];\n }\n if (typeof args[i] !== 'undefined') {\n return args[i];\n }\n return match;\n });\n}","function numberFormat(type, specifiedFormat, config) {\n // Specified format in axis/legend has higher precedence than fieldDef.format\n if (isString(specifiedFormat)) {\n return specifiedFormat;\n }\n\n if (type === QUANTITATIVE) {\n // we only apply the default if the field is quantitative\n return config.numberFormat;\n }\n\n return undefined;\n }","get formatOptions() {\n return [\n { label: 'Delimited String', value: 'String'},\n { label: 'Text Collection', value: 'Collection'},\n { label: 'Record Collection', value: 'Object'},\n ];\n }","function normalizeFormat() {\n var args = [].slice.call(arguments);\n\n switch (utils.typeOf(args[0])) {\n case 'string':\n return normalizeString.apply(null, args);\n case 'object':\n return normalizeObject.apply(null, args);\n case 'array':\n return normalizeArray.apply(null, args);\n case 'function':\n return normalizeFn.apply(null, args);\n default:\n return args;\n }\n}","function sformat(format) {\n var args = arguments;\n var i = 0;\n return format.replace(/{(\\d*)}/g, function sformatReplace(match, number) {\n i += 1;\n if (typeof args[number] !== 'undefined') {\n return args[number];\n }\n if (typeof args[i] !== 'undefined') {\n return args[i];\n }\n return match;\n });\n}","function formatToArgAndSymbols(format, c, arg) {\n switch (c) {\n case 'N':\n return argToName(arg);\n case 'L':\n return argToLiteral(arg);\n case 'S':\n return argToString(arg);\n case 'T':\n return argToType(arg);\n case 'F':\n return [arg, []];\n default:\n throw new Error(`invalid format string: '${format}'`);\n }\n}","function getFormatString(formatType) {\r\n if(formatType == '0') formatString = 'DD/MM HH:mm';\r\n else if(formatType == 1) formatString = 'DD/MM/YYYY';\r\n else if(formatType == 2) formatString = 'DD/MM/YYYY';\r\n else if(formatType == 3) formatString = 'DD/MM/YYYY';\r\n return formatString;\r\n}","function dataType(input) {\nconsole.log(`The argument type is:`,typeof(input));\n}","function Format() {}","function Format() {}","formatter(params) { return params.name; }","function format(string) {\n var args = arguments;\n var pattern = new RegExp(\"%([1-\" + arguments.length + \"])\", \"g\");\n console.log(pattern);\n return String(string).replace(pattern, function(match, index) {\n \tif(Number.isInteger(args[index])){\n \t\treturn args[index];\n \t} else {\n \t\treturn '\"'+args[index]+'\"';\n \t}\n });\n}","function getTypeParser (oid, format) {\n format = format || 'text';\n if (!typeParsers[format]) {\n return noParse;\n }\n return typeParsers[format][oid] || noParse;\n}","function getTypeParser (oid, format) {\n format = format || 'text';\n if (!typeParsers[format]) {\n return noParse;\n }\n return typeParsers[format][oid] || noParse;\n}","function getTypeParser (oid, format) {\n format = format || 'text';\n if (!typeParsers[format]) {\n return noParse;\n }\n return typeParsers[format][oid] || noParse;\n}","function getTypeParser (oid, format) {\n format = format || 'text';\n if (!typeParsers[format]) {\n return noParse;\n }\n return typeParsers[format][oid] || noParse;\n}","function _fmt(str, formats) {\n // first, replace any ORDERED replacements.\n var idx = 0; // the current index for non-numerical replacements\n\n return str.replace(/%@([0-9]+)?/g, function (_s, argIndex) {\n var i = argIndex ? parseInt(argIndex, 10) - 1 : idx++;\n var r = i < formats.length ? formats[i] : undefined;\n return typeof r === 'string' ? r : r === null ? '(null)' : r === undefined ? '' : String(r);\n });\n }","function formatType(type, checker) {\n return !isAssignableToSimpleTypeKind(type, SimpleTypeKind.ANY, checker) ? markdownHighlight(toTypeString(type, checker)) : undefined;\n}","function format() {\n // The string containing the format items (e.g. \"{0}\")\n // will and always has to be the first argument.\n var string = arguments[0];\n // Start with the second argument (i = 1)\n for (var i = 1; i < arguments.length; i++) {\n // \"gm\" = RegEx options for Global search (more than one instance)\n // and for Multiline search.\n var regEx = new RegExp(\"\\\\{\" + (i - 1) + \"\\\\}\", \"gm\");\n string = string.replace(regEx, arguments[i]);\n }\n\n return string;\n }","function datatypeHandler(format) {\n\tvar dt;\n\tif (format == 'json') {\n\t\tdt = 'json';\n\t} else if (format == 'xml') {\n\t\tdt = 'xml';\n\t} else {\n\t\tdt = 'text';\n\t}\n\treturn dt;\n}","function doFormat(format) {\n var argv = [];\n for (var _i = 1; _i < arguments.length; _i++) {\n argv[_i - 1] = arguments[_i];\n }\n if (typeof arguments == \"undefined\") {\n return null;\n }\n if (arguments.length < 1) {\n return null;\n }\n if (typeof arguments[0] != \"string\") {\n return null;\n }\n if (typeof RegExp == \"undefined\") {\n return null;\n }\n var parsed = sprintf.parseFormat(format, argv);\n var convCount = parsed.convCount;\n if (parsed.matches.length == 0) {\n // 没有格式化参数的占位符，则直接输出原本的字符串\n return format;\n }\n else {\n TypeScript.logging.log(\"string format parse result:\", TypeScript.ConsoleColors.Magenta);\n TypeScript.logging.log(parsed);\n }\n if (argv.length < convCount) {\n // 格式化参数的数量少于占位符的数量，则抛出错误\n throw \"Mismatch format argument numbers (\" + argv.length + \" !== \" + convCount + \")!\";\n }\n else {\n return sprintf.doSubstitute(parsed.matches, parsed.strings);\n }\n }","function formatter(fmt) {\n var codeRxp = /%([',+0]*)([1-9]?)((?:\\.[1-9])?)([sdifxX%])/g;\n var literals = [],\n formatCodes = [],\n startIdx = 0,\n prefix = \"\",\n matches = codeRxp.exec(fmt),\n literal;\n\n while (matches) {\n literal = fmt.substring(startIdx, codeRxp.lastIndex - matches[0].length);\n if (matches[0] == '%%') {\n prefix += literal + '%';\n } else {\n literals.push(prefix + literal);\n prefix = '';\n formatCodes.push(matches);\n }\n startIdx = codeRxp.lastIndex;\n matches = codeRxp.exec(fmt);\n }\n literals.push(prefix + fmt.substr(startIdx));\n\n return function() {\n var str = literals[0],\n n = arguments.length;\n if (n != formatCodes.length) {\n error(\"[format()] Data does not match format string; format:\", fmt, \"data:\", arguments);\n }\n for (var i=0; i t.def))) {\n return [null, []];\n }\n\n const result = format(this, args, entity);\n return [result[0].toString(), result[1]];\n }","function helpFor(format){\n switch (format){\n\n case 'hex':\n return '000, #000, 000000 or #000000';\n\n case 'rgb':\n return 'rgb(255, 255, 255), rgba(255, 255, 255, 1) or 255, 145, 124';\n\n case 'hsl':\n return 'hsl(0, 0%, 100%), hsla(0, 0%, 100%, 1) or 0, 85%, 50%';\n\n case 'hwb':\n return 'hwb(0, 0%, 100%) or 0, 85%, 50%';\n\n case 'css':\n return 'yellow, blue, red';\n }\n }","function logType(input) {\n console.log(input);\n}","function logType(input) {\n console.log(input);\n}","analyzeFormat(item) {\n if (!item.javaType || !item.entityFieldName)\n return;\n\n // match from enums\n if (JavaUtils.isEnumJavaType(item.javaType)) {\n let enums = this.getEnums;\n if (ARRAY.hasAny(enums, x => x.baseInfo.name.toLowerCase() == item.entityFieldName.toLowerCase())) {\n item.format = UiUtils.FORMAT_TYPE.ENUM;;\n item.pattern = STR.upperFirstLetter(item.entityFieldName);\n return;\n }\n }\n\n // match from default matchers\n for (let matcher of FormatMatchers) {\n if (matcher.matcher(item.javaType, item.entityFieldName)) {\n matcher.handler(item);\n return;\n }\n }\n }","function variablesTypes(input) {\n console.log(\"My name: \" + input[0] + '//type is ' + typeof(input[0]) +\n '. My age: ' + input[1] + ' //type is ' + typeof(input[1]) +\n '. I am male: ' + input[2] + '//type is ' + typeof(input[2]) + '. My favorite foods are:' + input[3].toString() + '. //type is ' + typeof(input[3]));\n}","between(hkFormat, veraType) {\n switch(hkFormat) {\n // case 'boolean':\n case Formats.BOOL:\n return bool;\n\n // case 'i1':\n // case 'i4':\n // case 'int':\n case Formats.INT:\n // case 'number':\n case Formats.FLOAT:\n // case 'string':\n case Formats.STRING:\n // case 'ui1':\n case Formats.UINT8:\n // case 'ui2':\n case Formats.UINT16:\n // case 'ui4':\n case Formats.UINT32:\n default:\n // Default conversion is -no- conversion.\n return undefined;\n }\n }","function log(type){\n var args = Array.prototype.slice.call(arguments, 1);\n\n /**\n * Note that we replace the first parameter rather than inserting before it,\n * since it might contain formatting information. In other words, we want\n * this:\n *\n * logger.info('ourtask: completed part %d of %d', part, total);\n *\n * rather than:\n *\n * logger.info('ourtask:', 'completed part %d of %d', part, total);\n *\n * since the second version won't do proper formatting.\n */\n\n args[0] = type + ': ' + args[0];\n logger.info.apply(logger, args);\n}","function printArgsInfo() {\n if (arguments.length === 0) {\n console.log(\"No arguments.\");\n }\n\n for (var i = 0; i < arguments.length; i++) {\n\n var type = arguments[i] ? arguments[i].constructor.name.toLocaleLowerCase() : typeof arguments[i];\n console.log(arguments[i] + ' (' + type + ')');\n }\n}","function parse_Format(blob, length, opts) {\n var numFmtId = blob.read_shift(2);\n var fmtstr = parse_XLUnicodeString2(blob, 0, opts);\n return [numFmtId, fmtstr];\n }","function getTimeOptions(time_type){\n var time_options = { unit: 'minute', displayFormats: { 'second': 'mm:ss', 'minute': 'mm:ss'},tooltipFormat: \"mm:ss\" };\n\n if(time_type == 'time'){\n return time_options;\n }\n}","function getLineType(line, state) {\n let linetype = 'text'\n if (regexps.dashes.test(line)) {\n linetype = 'dashes'\n } else if (regexps.propvalue.test(line)) {\n linetype = 'propvalue'\n }\n return linetype\n}","function parseSelectedType(optionSelect) {\n // read the selected option and format to pass into selectType()\n var ERROR_RATE = \"Error Rate\";\n var ASSISTANCE_SCORE = \"Assistance Score\";\n var NUM_INCORRECTS = \"Number of Incorrects\";\n var NUM_HINTS = \"Number of Hints\";\n var STEP_DURATION = \"Step Duration\";\n var CORRECT_STEP_DURATION = \"Correct Step Duration\";\n var ERROR_STEP_DURATION = \"Error Step Duration\";\n\n if (optionSelect == ASSISTANCE_SCORE) { selectType(ASSISTANCE_SCORE_TYPE); }\n else if (optionSelect == ERROR_RATE) { selectType(ERROR_RATE_TYPE); }\n else if (optionSelect == NUM_INCORRECTS) {selectType(AVG_INCORRECTS_TYPE); }\n else if (optionSelect == NUM_HINTS) { selectType(AVG_HINTS_TYPE); }\n else if (optionSelect == STEP_DURATION) { selectType(STEP_DURATION_TYPE); }\n else if (optionSelect == CORRECT_STEP_DURATION) { selectType(CORRECT_STEP_DURATION_TYPE); }\n else if (optionSelect == ERROR_STEP_DURATION) { selectType(ERROR_STEP_DURATION_TYPE); }\n}","function xf(format) {\n var args = Array.prototype.slice.call(arguments, 1);\n return format.replace(/\\{(\\d+)\\}/g, function(m, i) {\n return args[i];\n });\n}","function xf(format) {\n var args = Array.prototype.slice.call(arguments, 1);\n return format.replace(/\\{(\\d+)\\}/g, function(m, i) {\n return args[i];\n });\n}","function _formatEventName(template, type) {\n var uppercasePluralType = type.charAt(0).toUpperCase() + type.slice(1) + 's';\n return template.replace('Shapes', uppercasePluralType);\n }","function parse_Format(blob, length, opts) {\n\tvar numFmtId = blob.read_shift(2);\n\tvar fmtstr = parse_XLUnicodeString2(blob, 0, opts);\n\treturn [numFmtId, fmtstr];\n}","function parse_Format(blob, length, opts) {\n\tvar numFmtId = blob.read_shift(2);\n\tvar fmtstr = parse_XLUnicodeString2(blob, 0, opts);\n\treturn [numFmtId, fmtstr];\n}","function parse_Format(blob, length, opts) {\n\tvar numFmtId = blob.read_shift(2);\n\tvar fmtstr = parse_XLUnicodeString2(blob, 0, opts);\n\treturn [numFmtId, fmtstr];\n}","function parse_Format(blob, length, opts) {\n\tvar numFmtId = blob.read_shift(2);\n\tvar fmtstr = parse_XLUnicodeString2(blob, 0, opts);\n\treturn [numFmtId, fmtstr];\n}","function fType(type) {\n\t\tif (directives.indexOf(type) > -1) {\n\t\t\treturn '@' + type;\n\t\t}\n\n\t\treturn type;\n\t}","getTipo(pType) {\n if (pType.includes('int')) {\n return 'Integer';\n }\n else if (pType.includes('varchar')) {\n return 'string';\n }\n else if (pType.includes('decimal')) {\n return 'Extended';\n }\n else if (pType.includes('char')) {\n return 'string';\n }\n else if (pType.includes('text')) {\n return 'string';\n }\n else if (pType.includes('date')) {\n return 'TDateTime';\n }\n }","function mapTextFormat (e) {\n if ((e === undefined) || (e === null)) return undefined;\n\n return {\n textType: getAttrValue(e, 'textType'),\n isSequence: toBoolean(getAttrValue(e, 'isSequence')),\n interval: toNumeric(getAttrValue(e, 'interval')),\n startValue: toNumeric(getAttrValue(e, 'startValue')),\n endValue: toNumeric(getAttrValue(e, 'endValue')),\n timeInterval: getAttrValue(getAttrValue(e, 'timeInterval')),\n startTime: toNumeric(getAttrValue(e, 'startTime')),\n endTime: toNumeric(getAttrValue(e, 'endTime')),\n minLength: toNumeric(getAttrValue(e, 'minLength')),\n maxLength: toNumeric(getAttrValue(e, 'maxLength')),\n minValue: toNumeric(getAttrValue(e, 'minValue')),\n maxValue: toNumeric(getAttrValue(e, 'maxValue')),\n decimals: toNumeric(getAttrValue(e, 'decimals')),\n pattern: getAttrValue(e, 'pattern'),\n isMultiLingual: toBoolean(getAttrValue(e, 'isMultiLingual'))\n };\n }","function generate_type_name(fn, args) {\n var name = fn.name;\n if (null != args.__name__) {\n name += '(' + args.__name__ + ')'; \n }\n else if (is_str(args)) {\n name += '(' + args + ')'; \n }\n else if (is_args(args) || is_array(args)) {\n name += '(';\n for (var i = 0; i < args.length; ++i) {\n if (i > 0) {\n name += ',';\n }\n if (args[i].__name__) {\n name += args[i].__name__;\n }\n else {\n name += args[i];\n }\n }\n name += ')';\n }\n else if (is_json(args)) {\n name += '(json)';\n }\n return name;\n }","function formatScriptArgument(){\r\n\ttry{\r\n\t\tdebug(\"FORMAT SCRIPT ARGUMENT\");\r\n\t\t//debug(typeof input);\r\n\t\t//debug(typeof json);\r\n\t\tinput.format = \"\";\r\n\t\tvar format = \"\";\r\n\t\t switch(input.unit){\r\n\t\t\t case \"minutes\":\r\n\t\t\t\t format = \"mm\";\r\n\t\t\t\t debug('format:' + format);\r\n\t\t\t case \"hours\":\r\n\t\t\t\t format = \"HH\" + format;\r\n\t\t\t\t debug('format:' + format);\r\n\t\t\t case \"days\" || \"weeks\":\r\n\t\t\t\t format = \"dd\" + format;\r\n\t\t\t\t debug('format:' + format);\r\n\t\t\t case \"months\":\r\n\t\t\t\t format = \"MM\" + format;\r\n\t\t\t\t debug('format:' + format);\r\n\t\t\tdefault:\r\n\t\t\t\tformat = \"YYYY\" + format;\r\n\t\t\t\tdebug('format:' + format);\r\n\t\t };\r\n\t\t input.format = format;\r\n\t}catch(err){\r\n\t\tdebug('format: %s',err.message);\r\n\t\tthrow err;\r\n\t}\r\n\treturn input;\r\n}","function formatValidator(stringFormat) {\n\t switch (stringFormat) {\n\t case StringFormat.RAW:\n\t case StringFormat.BASE64:\n\t case StringFormat.BASE64URL:\n\t case StringFormat.DATA_URL:\n\t return;\n\t default:\n\t throw 'Expected one of the event types: [' + StringFormat.RAW + ', ' + StringFormat.BASE64 + ', ' + StringFormat.BASE64URL + ', ' + StringFormat.DATA_URL + '].';\n\t }\n\t}","static formatPII(format, excludePII, args) {\n return format.replace(DebugSession._formatPIIRegexp, function (match, paramName) {\n if (excludePII && paramName.length > 0 && paramName[0] !== '_') {\n return match;\n }\n return args[paramName] && args.hasOwnProperty(paramName) ?\n args[paramName] :\n match;\n });\n }","function format(t) {\n t = Number(t); // force conversion from Date\n switch (type) {\n case \"short\":\n {\n if (t >= 31536e6) {\n return (t / 31536e6).toFixed(1) + \" years\";\n } else if (t >= 6048e5) {\n return (t / 6048e5).toFixed(1) + \" weeks\";\n } else if (t >= 864e5) {\n return (t / 864e5).toFixed(1) + \" days\";\n } else if (t >= 36e5) {\n return (t / 36e5).toFixed(1) + \" hours\";\n } else if (t >= 6e4) {\n return (t / 6e4).toFixed(1) + \" minutes\";\n }\n return (t / 1e3).toFixed(1) + \" seconds\";\n }\n case \"long\":\n {\n var a = [],\n s = ((t % 6e4) / 1e3) >> 0,\n m = ((t % 36e5) / 6e4) >> 0;\n a.push(pad(\"0\", 2, s));\n if (t >= 36e5) {\n var h = ((t % 864e5) / 36e5) >> 0;\n a.push(pad(\"0\", 2, m));\n if (t >= 864e5) {\n a.push(pad(\"0\", 2, h));\n a.push(Math.floor(t / 864e5).toFixed());\n } else {\n a.push(h.toFixed());\n }\n } else {\n a.push(m.toFixed());\n }\n return a.reverse().join(\":\");\n }\n }\n }","function getStr(idx, option) {\r\tif (option == \"TYPE\") {\r\t\tvar type = DATA.init[idx].type;\r\t\t// trace(\"\\n\" + type + \"\\n\");\r\t\tif (type == \"binary\" || type == \"lock\") {\r\t\t\treturn \"On/Off\";\r\t\t}\r\t\treturn \"?type\";\r\t}\r\telse if (option == \"TIMING\") {\r\t\t// return \"24 to 24\";// probably showing this way (a proposal)\r\t\tvar timing = DATA.init[idx].timing;\r\t\tif (timing) {\r\t\t\treturn \"Set\";\r\t\t\t//return DATA.init[idx].time_start + \" to \" + DATA.init[idx].time_end;\r\t\t}\r\t\treturn \"None\";\r\t}\r\treturn \"NULL\";\r}","function fnIsValidFormat(obj, _type) {\n var _pattern = null,\n _text = input.isText(obj) ? obj.value : obj.toString();\n switch (_type) {\n case \"d\": //Validates Date format: dd/MM/yyyy\n _pattern = /^((0[1-9])|([1-2][0-9])|(3[0-1]))\\/((0[1-9])|(1[0-2]))\\/([1-2][0,9][0-9][0-9])$/;\n break;\n case \"t\": //Validates Time format: HH:mm:ss\n _pattern = /^([0-1][0-9]|[2][0-3]):([0-5][0-9]):([0-5][0-9])$/;\n break;\n case \"dt\": //Validates DateTime format: dd/MM/yyyy HH:mm:ss\n _pattern = /^((0[1-9])|([1-2][0-9])|(3[0-1]))\\/((0[1-9])|(1[0-2]))\\/([1-2][0,9][0-9][0-9])\\s([0-1][0-9]|[2][0-3]):([0-5][0-9]):([0-5][0-9])$/;\n break;\n case \"email\": //Validates an email address\n _pattern = /^([0-9a-zA-Zñ](?:[\\-.\\w]*[0-9a-zA-Zñ])*@(?:[0-9a-zA-Zñ][\\-\\wñ]*[0-9a-zA-Zñ]\\.)+[a-zA-Z]{2,9})$/i;\n break;\n case \"pass\": //Validates the password strength (must have 8-20 characters, at least one number, at least one uppercase)\n _pattern = /^(?=.*\\d)(?=.*[a-z])(?=.*[A-Z]).{8,20}$/;\n break;\n case \"lat\": //Validates the latitude\n _pattern = /^-?([1-8]?[1-9]|[1-9]0|0)\\,{1}\\d{1,6}$/;\n break;\n case \"lon\": //Validates the longitude\n _pattern = /^-?([1]?[1-7][1-9]|[1]?[1-8][0]|[1-9]?[0-9])\\,{1}\\d{1,6}$/;\n break;\n }\n return !!_pattern && _pattern.test(_text);\n }","function inputTypes(type) {\n if (type.startsWith('image')) {\n return ImageType\n }\n\n if (type == \"file.other\") {\n return ImageType\n }\n\n if (type == 'number') {\n return NumberType\n }\n\n return TextType\n}","function $formatter(type, d, {user,sId,ip,ref}) {\n if (!config.log || !config.log.trk[type]) return\n var ident = user != null ? `${user.name||user._id}`.gray : `${sId.substring(0,12)}`.cyan\n\n var jdata = type == 'view'\n ? `${(d.url||'').cyan} ${ref?ref.replace(/https\\:\\/\\/|http\\:\\/\\//g,'<<< ').replace('www.','').blue:''}`\n : JSON.stringify(d.data||{}).replace(/^\\{/,'').replace(/\\}$/,'').replace(/\\\"([^(\\\")\"]+)\\\":/g,\"$1:\".dim).gray\n var label = type\n if (type == 'event') label = d.name\n if (type == 'view') label = `VIEW:${d.type}`\n $logIt(`trk.${type}`\n , label.toUpperCase()\n , `${ip.replace(':ffff','')}`.cyan+`\\t${ident}`\n , jdata\n )\n}","static typeNameToInfo(typeName = \"UNKNOWN\") {\n\n switch (typeName.toUpperCase()) {\n case \"DATE\": return { clazz: DateValue };\n case \"LIST,\": return { clazz: List, delimiter: ', ' };\n case \"LIST;\": return { clazz: List, delimiter: '; ' };\n case \"POLICIES\": return { clazz: Policies };\n case \"VALUE\": return { clazz: Value };\n\n default: return {};\n }\n }","function formatString(string,fieldType){\r if (string.search(/./) === -1) {\r string = 'Click here to add a '+fieldType+'';//change class if another is preferred by Antoine.\r }else{\r string = string.replace('&','&');\r string = string.replace(/ {\n format = format.replace('##', arg);\n });\n return format;\n }","function formatDate(date, text, type) {\n if (date == null) {\n return \"\";\n }\n\n var monthNames = [\n text.January,\n text.February,\n text.March,\n text.April,\n text.May,\n text.June,\n text.July,\n text.August,\n text.September,\n text.October,\n text.November,\n text.December\n ];\n\n date = new Date(date);\n\n const day = date.getDate();\n const monthIndex = date.getMonth();\n const year = date.getFullYear();\n const hours = date.getHours();\n const minutes = date.getMinutes();\n\n if (type === \"date\") {\n return year + \" \" + monthNames[monthIndex] + \" \" + day;\n } else if (type === \"date-time\") {\n return (\n year +\n \" \" +\n monthNames[monthIndex] +\n \" \" +\n day +\n \", \" +\n hours +\n \":\" +\n minutes\n );\n } else if (type === \"time\") {\n return hours + \":\" + minutes;\n } else {\n return date;\n }\n}","function extractNumber(arg, type) {\n // according to the API.AI documentation the @sys.date-period entity will return the date in a \n // ISO-8601 format. I.e. 2014-01-01/2014-12-31. The year is the first one in the return value, so\n // my regular expression will match the numbers before the '-'. Similarly, I will need to account for the\n // case when type is @sys.date, which will have the day as the last digits before the '-'.\n var pattern = type == DATE_ARGUMENT ? /[\\d]+$/ : /[\\d]+/;\n //var numb = arg.match(/[\\d]+/);\n var numb = arg.match(pattern);\n return numb.join(\"\");\n }","function formatArgs() {\n var args = arguments;\n var useColors = this.useColors;\n\n args[0] = (useColors ? '%c' : '')\n + this.namespace\n + (useColors ? ' %c' : ' ')\n + args[0]\n + (useColors ? '%c ' : ' ');\n\n if (!useColors) return args;\n\n var c = 'color: ' + this.color;\n args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\n // the final \"%c\" is somewhat tricky, because there could be other\n // arguments passed either before or after the %c, so we need to\n // figure out the correct index to insert the CSS into\n var index = 0;\n var lastC = 0;\n args[0].replace(/%[a-z%]/g, function(match) {\n if ('%%' === match) return;\n index++;\n if ('%c' === match) {\n // we only are interested in the *last* %c\n // (the user may have provided their own)\n lastC = index;\n }\n });\n\n args.splice(lastC, 0, c);\n return args;\n}","function formatArgs(){var args=arguments;var useColors=this.useColors;args[0] = (useColors?'%c':'') + this.namespace + (useColors?' %c':' ') + args[0] + (useColors?'%c ':' ') + '+' + exports.humanize(this.diff);if(!useColors)return args;var c='color: ' + this.color;args = [args[0],c,'color: inherit'].concat(Array.prototype.slice.call(args,1)); // the final \"%c\" is somewhat tricky, because there could be other\n// arguments passed either before or after the %c, so we need to\n// figure out the correct index to insert the CSS into\nvar index=0;var lastC=0;args[0].replace(/%[a-z%]/g,function(match){if('%%' === match)return;index++;if('%c' === match){ // we only are interested in the *last* %c\n// (the user may have provided their own)\nlastC = index;}});args.splice(lastC,0,c);return args;}","function IpadicFormatter() {\n}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '') + this.namespace + (useColors ? ' %c' : ' ') + args[0] + (useColors ? '%c ' : ' ') + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function (match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\t\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\t\n\t if (!useColors) return args;\n\t\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\t\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\t\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n var args = arguments;\n var useColors = this.useColors;\n\n args[0] = (useColors ? '%c' : '') + this.namespace + (useColors ? ' %c' : ' ') + args[0] + (useColors ? '%c ' : ' ') + '+' + exports.humanize(this.diff);\n\n if (!useColors) return args;\n\n var c = 'color: ' + this.color;\n args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\n // the final \"%c\" is somewhat tricky, because there could be other\n // arguments passed either before or after the %c, so we need to\n // figure out the correct index to insert the CSS into\n var index = 0;\n var lastC = 0;\n args[0].replace(/%[a-z%]/g, function (match) {\n if ('%%' === match) return;\n index++;\n if ('%c' === match) {\n // we only are interested in the *last* %c\n // (the user may have provided their own)\n lastC = index;\n }\n });\n\n args.splice(lastC, 0, c);\n return args;\n }","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\n\t if (!useColors) return args;\n\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\n\t if (!useColors) return args;\n\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\n\t if (!useColors) return args;\n\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\n\t if (!useColors) return args;\n\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\n\t if (!useColors) return args;\n\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}","function formatArgs() {\n\t var args = arguments;\n\t var useColors = this.useColors;\n\n\t args[0] = (useColors ? '%c' : '')\n\t + this.namespace\n\t + (useColors ? ' %c' : ' ')\n\t + args[0]\n\t + (useColors ? '%c ' : ' ')\n\t + '+' + exports.humanize(this.diff);\n\n\t if (!useColors) return args;\n\n\t var c = 'color: ' + this.color;\n\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\n\n\t // the final \"%c\" is somewhat tricky, because there could be other\n\t // arguments passed either before or after the %c, so we need to\n\t // figure out the correct index to insert the CSS into\n\t var index = 0;\n\t var lastC = 0;\n\t args[0].replace(/%[a-z%]/g, function(match) {\n\t if ('%%' === match) return;\n\t index++;\n\t if ('%c' === match) {\n\t // we only are interested in the *last* %c\n\t // (the user may have provided their own)\n\t lastC = index;\n\t }\n\t });\n\n\t args.splice(lastC, 0, c);\n\t return args;\n\t}"],"string":"[\n \"function asPrintFormat(type)\\n{\\n if (StringHelper.isString(type)) {\\n return '%s';\\n }\\n\\n function fn(pkgId)\\n {\\n const options = { 'hash' : {} };\\n return zclHelper.asUnderlyingZclType.call(this, type, options).then(zclType => {\\n const basicType = ChipTypesHelper.asBasicType(zclType);\\n switch (basicType) {\\n case 'bool':\\n return '%d';\\n case 'int8_t':\\n return '%\\\" PRId8 \\\"';\\n case 'uint8_t':\\n return '%\\\" PRIu8 \\\"';\\n case 'int16_t':\\n return '%\\\" PRId16 \\\"';\\n case 'uint16_t':\\n return '%\\\" PRIu16 \\\"';\\n case 'int24_t':\\n return '%\\\" PRId32 \\\"';\\n case 'uint24_t':\\n return '%\\\" PRIu32 \\\"';\\n case 'int32_t':\\n return '%\\\" PRId32 \\\"';\\n case 'uint32_t':\\n return '%\\\" PRIu32 \\\"';\\n case 'int64_t':\\n return '%\\\" PRId64 \\\"';\\n case 'uint64_t':\\n return '%\\\" PRIu64 \\\"';\\n default:\\n return '%p';\\n }\\n })\\n }\\n\\n const promise = templateUtil.ensureZclPackageId(this).then(fn.bind(this)).catch(err => {\\n console.log(err);\\n throw err;\\n });\\n return templateUtil.templatePromise(this.global, promise)\\n}\",\n \"function format(number, type, input){\\n if(type === 'time'){\\n var dateMili = Object.keys(input)[(number - 1) * 2].split('name')[1] * 10;\\n return dateMili;\\n }\\n else if(type === 'name'){\\n x = Object.keys(input).map(function (key){\\n return input[key];\\n });\\n return x[(number -1) * 2];\\n }\\n else if(type === 'message'){\\n x = Object.keys(input).map(function (key){\\n return input[key];\\n });\\n return x[(number -1) * 2 + 1];\\n }\\n}\",\n \"inputType() {\\n // Unsigned integer\\n if (this.argument.type[0] == 'U') {\\n // Supports binary, hex, ocatal, and digital\\n return [\\\"text\\\", \\\"0[bB][01]+|0[oO][0-7]+|0[xX][0-9a-fA-F]+|[1-9]\\\\\\\\\\\\\\\\d*\\\"];\\n }\\n else if (this.argument.type[0] == 'F') {\\n return [\\\"number\\\", \\\"\\\\\\\\d*.?\\\\\\\\d*\\\"];\\n }\\n return [\\\"text\\\", \\\".*\\\"];\\n }\",\n \"inputType() {\\n // Unsigned integer\\n if (this.argument.type[0] == 'U') {\\n // Supports binary, hex, octal, and digital\\n return [\\\"text\\\", \\\"0[bB][01]+|0[oO][0-7]+|0[xX][0-9a-fA-F]+|[1-9]\\\\\\\\\\\\\\\\d*\\\"];\\n }\\n else if (this.argument.type[0] == 'F') {\\n return [\\\"number\\\", \\\"\\\\\\\\d*.?\\\\\\\\d*\\\"];\\n }\\n return [\\\"text\\\", \\\".*\\\"];\\n }\",\n \"function format() {\\r\\n var format = arguments[0] || \\\"\\\";\\r\\n var match = format.match(/%s|%d|%j/g);\\r\\n if (!match) return format;\\r\\n\\r\\n if (match.length != arguments.length - 1) throw { name: \\\"Argument Error\\\", message: \\\"Number of arguments mismatch\\\" };\\r\\n for (var i = 1; i < arguments.length; i++) {\\r\\n var matchIndex = i - 1;\\r\\n var value = (match[matchIndex] == \\\"%j\\\") ? JSON.stringify(arguments[i]) : arguments[i];\\r\\n format = format.replace(match[matchIndex], value);\\r\\n }\\r\\n return format;\\r\\n }\",\n \"function formatType(type) {\\n if (type == 0) {\\n return '次';\\n } else if (type == 1) {\\n return '月';\\n } else if (type == 2) {\\n return '年';\\n }\\n }\",\n \"function getDefaultInputFormat() {\\n var type = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 'date';\\n return DEFAULT_INPUT_DATE_FORMAT[type];\\n}\",\n \"function sformat(format) {\\n var args = arguments;\\n var i = 0;\\n return format.replace(/{(\\\\d*)}/g, function sformatReplace(match, number) {\\n i += 1;\\n if (typeof args[number] !== 'undefined') {\\n return args[number];\\n }\\n if (typeof args[i] !== 'undefined') {\\n return args[i];\\n }\\n return match;\\n });\\n}\",\n \"function numberFormat(type, specifiedFormat, config) {\\n // Specified format in axis/legend has higher precedence than fieldDef.format\\n if (isString(specifiedFormat)) {\\n return specifiedFormat;\\n }\\n\\n if (type === QUANTITATIVE) {\\n // we only apply the default if the field is quantitative\\n return config.numberFormat;\\n }\\n\\n return undefined;\\n }\",\n \"get formatOptions() {\\n return [\\n { label: 'Delimited String', value: 'String'},\\n { label: 'Text Collection', value: 'Collection'},\\n { label: 'Record Collection', value: 'Object'},\\n ];\\n }\",\n \"function normalizeFormat() {\\n var args = [].slice.call(arguments);\\n\\n switch (utils.typeOf(args[0])) {\\n case 'string':\\n return normalizeString.apply(null, args);\\n case 'object':\\n return normalizeObject.apply(null, args);\\n case 'array':\\n return normalizeArray.apply(null, args);\\n case 'function':\\n return normalizeFn.apply(null, args);\\n default:\\n return args;\\n }\\n}\",\n \"function sformat(format) {\\n var args = arguments;\\n var i = 0;\\n return format.replace(/{(\\\\d*)}/g, function sformatReplace(match, number) {\\n i += 1;\\n if (typeof args[number] !== 'undefined') {\\n return args[number];\\n }\\n if (typeof args[i] !== 'undefined') {\\n return args[i];\\n }\\n return match;\\n });\\n}\",\n \"function formatToArgAndSymbols(format, c, arg) {\\n switch (c) {\\n case 'N':\\n return argToName(arg);\\n case 'L':\\n return argToLiteral(arg);\\n case 'S':\\n return argToString(arg);\\n case 'T':\\n return argToType(arg);\\n case 'F':\\n return [arg, []];\\n default:\\n throw new Error(`invalid format string: '${format}'`);\\n }\\n}\",\n \"function getFormatString(formatType) {\\r\\n if(formatType == '0') formatString = 'DD/MM HH:mm';\\r\\n else if(formatType == 1) formatString = 'DD/MM/YYYY';\\r\\n else if(formatType == 2) formatString = 'DD/MM/YYYY';\\r\\n else if(formatType == 3) formatString = 'DD/MM/YYYY';\\r\\n return formatString;\\r\\n}\",\n \"function dataType(input) {\\nconsole.log(`The argument type is:`,typeof(input));\\n}\",\n \"function Format() {}\",\n \"function Format() {}\",\n \"formatter(params) { return params.name; }\",\n \"function format(string) {\\n var args = arguments;\\n var pattern = new RegExp(\\\"%([1-\\\" + arguments.length + \\\"])\\\", \\\"g\\\");\\n console.log(pattern);\\n return String(string).replace(pattern, function(match, index) {\\n \\tif(Number.isInteger(args[index])){\\n \\t\\treturn args[index];\\n \\t} else {\\n \\t\\treturn '\\\"'+args[index]+'\\\"';\\n \\t}\\n });\\n}\",\n \"function getTypeParser (oid, format) {\\n format = format || 'text';\\n if (!typeParsers[format]) {\\n return noParse;\\n }\\n return typeParsers[format][oid] || noParse;\\n}\",\n \"function getTypeParser (oid, format) {\\n format = format || 'text';\\n if (!typeParsers[format]) {\\n return noParse;\\n }\\n return typeParsers[format][oid] || noParse;\\n}\",\n \"function getTypeParser (oid, format) {\\n format = format || 'text';\\n if (!typeParsers[format]) {\\n return noParse;\\n }\\n return typeParsers[format][oid] || noParse;\\n}\",\n \"function getTypeParser (oid, format) {\\n format = format || 'text';\\n if (!typeParsers[format]) {\\n return noParse;\\n }\\n return typeParsers[format][oid] || noParse;\\n}\",\n \"function _fmt(str, formats) {\\n // first, replace any ORDERED replacements.\\n var idx = 0; // the current index for non-numerical replacements\\n\\n return str.replace(/%@([0-9]+)?/g, function (_s, argIndex) {\\n var i = argIndex ? parseInt(argIndex, 10) - 1 : idx++;\\n var r = i < formats.length ? formats[i] : undefined;\\n return typeof r === 'string' ? r : r === null ? '(null)' : r === undefined ? '' : String(r);\\n });\\n }\",\n \"function formatType(type, checker) {\\n return !isAssignableToSimpleTypeKind(type, SimpleTypeKind.ANY, checker) ? markdownHighlight(toTypeString(type, checker)) : undefined;\\n}\",\n \"function format() {\\n // The string containing the format items (e.g. \\\"{0}\\\")\\n // will and always has to be the first argument.\\n var string = arguments[0];\\n // Start with the second argument (i = 1)\\n for (var i = 1; i < arguments.length; i++) {\\n // \\\"gm\\\" = RegEx options for Global search (more than one instance)\\n // and for Multiline search.\\n var regEx = new RegExp(\\\"\\\\\\\\{\\\" + (i - 1) + \\\"\\\\\\\\}\\\", \\\"gm\\\");\\n string = string.replace(regEx, arguments[i]);\\n }\\n\\n return string;\\n }\",\n \"function datatypeHandler(format) {\\n\\tvar dt;\\n\\tif (format == 'json') {\\n\\t\\tdt = 'json';\\n\\t} else if (format == 'xml') {\\n\\t\\tdt = 'xml';\\n\\t} else {\\n\\t\\tdt = 'text';\\n\\t}\\n\\treturn dt;\\n}\",\n \"function doFormat(format) {\\n var argv = [];\\n for (var _i = 1; _i < arguments.length; _i++) {\\n argv[_i - 1] = arguments[_i];\\n }\\n if (typeof arguments == \\\"undefined\\\") {\\n return null;\\n }\\n if (arguments.length < 1) {\\n return null;\\n }\\n if (typeof arguments[0] != \\\"string\\\") {\\n return null;\\n }\\n if (typeof RegExp == \\\"undefined\\\") {\\n return null;\\n }\\n var parsed = sprintf.parseFormat(format, argv);\\n var convCount = parsed.convCount;\\n if (parsed.matches.length == 0) {\\n // 没有格式化参数的占位符，则直接输出原本的字符串\\n return format;\\n }\\n else {\\n TypeScript.logging.log(\\\"string format parse result:\\\", TypeScript.ConsoleColors.Magenta);\\n TypeScript.logging.log(parsed);\\n }\\n if (argv.length < convCount) {\\n // 格式化参数的数量少于占位符的数量，则抛出错误\\n throw \\\"Mismatch format argument numbers (\\\" + argv.length + \\\" !== \\\" + convCount + \\\")!\\\";\\n }\\n else {\\n return sprintf.doSubstitute(parsed.matches, parsed.strings);\\n }\\n }\",\n \"function formatter(fmt) {\\n var codeRxp = /%([',+0]*)([1-9]?)((?:\\\\.[1-9])?)([sdifxX%])/g;\\n var literals = [],\\n formatCodes = [],\\n startIdx = 0,\\n prefix = \\\"\\\",\\n matches = codeRxp.exec(fmt),\\n literal;\\n\\n while (matches) {\\n literal = fmt.substring(startIdx, codeRxp.lastIndex - matches[0].length);\\n if (matches[0] == '%%') {\\n prefix += literal + '%';\\n } else {\\n literals.push(prefix + literal);\\n prefix = '';\\n formatCodes.push(matches);\\n }\\n startIdx = codeRxp.lastIndex;\\n matches = codeRxp.exec(fmt);\\n }\\n literals.push(prefix + fmt.substr(startIdx));\\n\\n return function() {\\n var str = literals[0],\\n n = arguments.length;\\n if (n != formatCodes.length) {\\n error(\\\"[format()] Data does not match format string; format:\\\", fmt, \\\"data:\\\", arguments);\\n }\\n for (var i=0; i t.def))) {\\n return [null, []];\\n }\\n\\n const result = format(this, args, entity);\\n return [result[0].toString(), result[1]];\\n }\",\n \"function helpFor(format){\\n switch (format){\\n\\n case 'hex':\\n return '000, #000, 000000 or #000000';\\n\\n case 'rgb':\\n return 'rgb(255, 255, 255), rgba(255, 255, 255, 1) or 255, 145, 124';\\n\\n case 'hsl':\\n return 'hsl(0, 0%, 100%), hsla(0, 0%, 100%, 1) or 0, 85%, 50%';\\n\\n case 'hwb':\\n return 'hwb(0, 0%, 100%) or 0, 85%, 50%';\\n\\n case 'css':\\n return 'yellow, blue, red';\\n }\\n }\",\n \"function logType(input) {\\n console.log(input);\\n}\",\n \"function logType(input) {\\n console.log(input);\\n}\",\n \"analyzeFormat(item) {\\n if (!item.javaType || !item.entityFieldName)\\n return;\\n\\n // match from enums\\n if (JavaUtils.isEnumJavaType(item.javaType)) {\\n let enums = this.getEnums;\\n if (ARRAY.hasAny(enums, x => x.baseInfo.name.toLowerCase() == item.entityFieldName.toLowerCase())) {\\n item.format = UiUtils.FORMAT_TYPE.ENUM;;\\n item.pattern = STR.upperFirstLetter(item.entityFieldName);\\n return;\\n }\\n }\\n\\n // match from default matchers\\n for (let matcher of FormatMatchers) {\\n if (matcher.matcher(item.javaType, item.entityFieldName)) {\\n matcher.handler(item);\\n return;\\n }\\n }\\n }\",\n \"function variablesTypes(input) {\\n console.log(\\\"My name: \\\" + input[0] + '//type is ' + typeof(input[0]) +\\n '. My age: ' + input[1] + ' //type is ' + typeof(input[1]) +\\n '. I am male: ' + input[2] + '//type is ' + typeof(input[2]) + '. My favorite foods are:' + input[3].toString() + '. //type is ' + typeof(input[3]));\\n}\",\n \"between(hkFormat, veraType) {\\n switch(hkFormat) {\\n // case 'boolean':\\n case Formats.BOOL:\\n return bool;\\n\\n // case 'i1':\\n // case 'i4':\\n // case 'int':\\n case Formats.INT:\\n // case 'number':\\n case Formats.FLOAT:\\n // case 'string':\\n case Formats.STRING:\\n // case 'ui1':\\n case Formats.UINT8:\\n // case 'ui2':\\n case Formats.UINT16:\\n // case 'ui4':\\n case Formats.UINT32:\\n default:\\n // Default conversion is -no- conversion.\\n return undefined;\\n }\\n }\",\n \"function log(type){\\n var args = Array.prototype.slice.call(arguments, 1);\\n\\n /**\\n * Note that we replace the first parameter rather than inserting before it,\\n * since it might contain formatting information. In other words, we want\\n * this:\\n *\\n * logger.info('ourtask: completed part %d of %d', part, total);\\n *\\n * rather than:\\n *\\n * logger.info('ourtask:', 'completed part %d of %d', part, total);\\n *\\n * since the second version won't do proper formatting.\\n */\\n\\n args[0] = type + ': ' + args[0];\\n logger.info.apply(logger, args);\\n}\",\n \"function printArgsInfo() {\\n if (arguments.length === 0) {\\n console.log(\\\"No arguments.\\\");\\n }\\n\\n for (var i = 0; i < arguments.length; i++) {\\n\\n var type = arguments[i] ? arguments[i].constructor.name.toLocaleLowerCase() : typeof arguments[i];\\n console.log(arguments[i] + ' (' + type + ')');\\n }\\n}\",\n \"function parse_Format(blob, length, opts) {\\n var numFmtId = blob.read_shift(2);\\n var fmtstr = parse_XLUnicodeString2(blob, 0, opts);\\n return [numFmtId, fmtstr];\\n }\",\n \"function getTimeOptions(time_type){\\n var time_options = { unit: 'minute', displayFormats: { 'second': 'mm:ss', 'minute': 'mm:ss'},tooltipFormat: \\\"mm:ss\\\" };\\n\\n if(time_type == 'time'){\\n return time_options;\\n }\\n}\",\n \"function getLineType(line, state) {\\n let linetype = 'text'\\n if (regexps.dashes.test(line)) {\\n linetype = 'dashes'\\n } else if (regexps.propvalue.test(line)) {\\n linetype = 'propvalue'\\n }\\n return linetype\\n}\",\n \"function parseSelectedType(optionSelect) {\\n // read the selected option and format to pass into selectType()\\n var ERROR_RATE = \\\"Error Rate\\\";\\n var ASSISTANCE_SCORE = \\\"Assistance Score\\\";\\n var NUM_INCORRECTS = \\\"Number of Incorrects\\\";\\n var NUM_HINTS = \\\"Number of Hints\\\";\\n var STEP_DURATION = \\\"Step Duration\\\";\\n var CORRECT_STEP_DURATION = \\\"Correct Step Duration\\\";\\n var ERROR_STEP_DURATION = \\\"Error Step Duration\\\";\\n\\n if (optionSelect == ASSISTANCE_SCORE) { selectType(ASSISTANCE_SCORE_TYPE); }\\n else if (optionSelect == ERROR_RATE) { selectType(ERROR_RATE_TYPE); }\\n else if (optionSelect == NUM_INCORRECTS) {selectType(AVG_INCORRECTS_TYPE); }\\n else if (optionSelect == NUM_HINTS) { selectType(AVG_HINTS_TYPE); }\\n else if (optionSelect == STEP_DURATION) { selectType(STEP_DURATION_TYPE); }\\n else if (optionSelect == CORRECT_STEP_DURATION) { selectType(CORRECT_STEP_DURATION_TYPE); }\\n else if (optionSelect == ERROR_STEP_DURATION) { selectType(ERROR_STEP_DURATION_TYPE); }\\n}\",\n \"function xf(format) {\\n var args = Array.prototype.slice.call(arguments, 1);\\n return format.replace(/\\\\{(\\\\d+)\\\\}/g, function(m, i) {\\n return args[i];\\n });\\n}\",\n \"function xf(format) {\\n var args = Array.prototype.slice.call(arguments, 1);\\n return format.replace(/\\\\{(\\\\d+)\\\\}/g, function(m, i) {\\n return args[i];\\n });\\n}\",\n \"function _formatEventName(template, type) {\\n var uppercasePluralType = type.charAt(0).toUpperCase() + type.slice(1) + 's';\\n return template.replace('Shapes', uppercasePluralType);\\n }\",\n \"function parse_Format(blob, length, opts) {\\n\\tvar numFmtId = blob.read_shift(2);\\n\\tvar fmtstr = parse_XLUnicodeString2(blob, 0, opts);\\n\\treturn [numFmtId, fmtstr];\\n}\",\n \"function parse_Format(blob, length, opts) {\\n\\tvar numFmtId = blob.read_shift(2);\\n\\tvar fmtstr = parse_XLUnicodeString2(blob, 0, opts);\\n\\treturn [numFmtId, fmtstr];\\n}\",\n \"function parse_Format(blob, length, opts) {\\n\\tvar numFmtId = blob.read_shift(2);\\n\\tvar fmtstr = parse_XLUnicodeString2(blob, 0, opts);\\n\\treturn [numFmtId, fmtstr];\\n}\",\n \"function parse_Format(blob, length, opts) {\\n\\tvar numFmtId = blob.read_shift(2);\\n\\tvar fmtstr = parse_XLUnicodeString2(blob, 0, opts);\\n\\treturn [numFmtId, fmtstr];\\n}\",\n \"function fType(type) {\\n\\t\\tif (directives.indexOf(type) > -1) {\\n\\t\\t\\treturn '@' + type;\\n\\t\\t}\\n\\n\\t\\treturn type;\\n\\t}\",\n \"getTipo(pType) {\\n if (pType.includes('int')) {\\n return 'Integer';\\n }\\n else if (pType.includes('varchar')) {\\n return 'string';\\n }\\n else if (pType.includes('decimal')) {\\n return 'Extended';\\n }\\n else if (pType.includes('char')) {\\n return 'string';\\n }\\n else if (pType.includes('text')) {\\n return 'string';\\n }\\n else if (pType.includes('date')) {\\n return 'TDateTime';\\n }\\n }\",\n \"function mapTextFormat (e) {\\n if ((e === undefined) || (e === null)) return undefined;\\n\\n return {\\n textType: getAttrValue(e, 'textType'),\\n isSequence: toBoolean(getAttrValue(e, 'isSequence')),\\n interval: toNumeric(getAttrValue(e, 'interval')),\\n startValue: toNumeric(getAttrValue(e, 'startValue')),\\n endValue: toNumeric(getAttrValue(e, 'endValue')),\\n timeInterval: getAttrValue(getAttrValue(e, 'timeInterval')),\\n startTime: toNumeric(getAttrValue(e, 'startTime')),\\n endTime: toNumeric(getAttrValue(e, 'endTime')),\\n minLength: toNumeric(getAttrValue(e, 'minLength')),\\n maxLength: toNumeric(getAttrValue(e, 'maxLength')),\\n minValue: toNumeric(getAttrValue(e, 'minValue')),\\n maxValue: toNumeric(getAttrValue(e, 'maxValue')),\\n decimals: toNumeric(getAttrValue(e, 'decimals')),\\n pattern: getAttrValue(e, 'pattern'),\\n isMultiLingual: toBoolean(getAttrValue(e, 'isMultiLingual'))\\n };\\n }\",\n \"function generate_type_name(fn, args) {\\n var name = fn.name;\\n if (null != args.__name__) {\\n name += '(' + args.__name__ + ')'; \\n }\\n else if (is_str(args)) {\\n name += '(' + args + ')'; \\n }\\n else if (is_args(args) || is_array(args)) {\\n name += '(';\\n for (var i = 0; i < args.length; ++i) {\\n if (i > 0) {\\n name += ',';\\n }\\n if (args[i].__name__) {\\n name += args[i].__name__;\\n }\\n else {\\n name += args[i];\\n }\\n }\\n name += ')';\\n }\\n else if (is_json(args)) {\\n name += '(json)';\\n }\\n return name;\\n }\",\n \"function formatScriptArgument(){\\r\\n\\ttry{\\r\\n\\t\\tdebug(\\\"FORMAT SCRIPT ARGUMENT\\\");\\r\\n\\t\\t//debug(typeof input);\\r\\n\\t\\t//debug(typeof json);\\r\\n\\t\\tinput.format = \\\"\\\";\\r\\n\\t\\tvar format = \\\"\\\";\\r\\n\\t\\t switch(input.unit){\\r\\n\\t\\t\\t case \\\"minutes\\\":\\r\\n\\t\\t\\t\\t format = \\\"mm\\\";\\r\\n\\t\\t\\t\\t debug('format:' + format);\\r\\n\\t\\t\\t case \\\"hours\\\":\\r\\n\\t\\t\\t\\t format = \\\"HH\\\" + format;\\r\\n\\t\\t\\t\\t debug('format:' + format);\\r\\n\\t\\t\\t case \\\"days\\\" || \\\"weeks\\\":\\r\\n\\t\\t\\t\\t format = \\\"dd\\\" + format;\\r\\n\\t\\t\\t\\t debug('format:' + format);\\r\\n\\t\\t\\t case \\\"months\\\":\\r\\n\\t\\t\\t\\t format = \\\"MM\\\" + format;\\r\\n\\t\\t\\t\\t debug('format:' + format);\\r\\n\\t\\t\\tdefault:\\r\\n\\t\\t\\t\\tformat = \\\"YYYY\\\" + format;\\r\\n\\t\\t\\t\\tdebug('format:' + format);\\r\\n\\t\\t };\\r\\n\\t\\t input.format = format;\\r\\n\\t}catch(err){\\r\\n\\t\\tdebug('format: %s',err.message);\\r\\n\\t\\tthrow err;\\r\\n\\t}\\r\\n\\treturn input;\\r\\n}\",\n \"function formatValidator(stringFormat) {\\n\\t switch (stringFormat) {\\n\\t case StringFormat.RAW:\\n\\t case StringFormat.BASE64:\\n\\t case StringFormat.BASE64URL:\\n\\t case StringFormat.DATA_URL:\\n\\t return;\\n\\t default:\\n\\t throw 'Expected one of the event types: [' + StringFormat.RAW + ', ' + StringFormat.BASE64 + ', ' + StringFormat.BASE64URL + ', ' + StringFormat.DATA_URL + '].';\\n\\t }\\n\\t}\",\n \"static formatPII(format, excludePII, args) {\\n return format.replace(DebugSession._formatPIIRegexp, function (match, paramName) {\\n if (excludePII && paramName.length > 0 && paramName[0] !== '_') {\\n return match;\\n }\\n return args[paramName] && args.hasOwnProperty(paramName) ?\\n args[paramName] :\\n match;\\n });\\n }\",\n \"function format(t) {\\n t = Number(t); // force conversion from Date\\n switch (type) {\\n case \\\"short\\\":\\n {\\n if (t >= 31536e6) {\\n return (t / 31536e6).toFixed(1) + \\\" years\\\";\\n } else if (t >= 6048e5) {\\n return (t / 6048e5).toFixed(1) + \\\" weeks\\\";\\n } else if (t >= 864e5) {\\n return (t / 864e5).toFixed(1) + \\\" days\\\";\\n } else if (t >= 36e5) {\\n return (t / 36e5).toFixed(1) + \\\" hours\\\";\\n } else if (t >= 6e4) {\\n return (t / 6e4).toFixed(1) + \\\" minutes\\\";\\n }\\n return (t / 1e3).toFixed(1) + \\\" seconds\\\";\\n }\\n case \\\"long\\\":\\n {\\n var a = [],\\n s = ((t % 6e4) / 1e3) >> 0,\\n m = ((t % 36e5) / 6e4) >> 0;\\n a.push(pad(\\\"0\\\", 2, s));\\n if (t >= 36e5) {\\n var h = ((t % 864e5) / 36e5) >> 0;\\n a.push(pad(\\\"0\\\", 2, m));\\n if (t >= 864e5) {\\n a.push(pad(\\\"0\\\", 2, h));\\n a.push(Math.floor(t / 864e5).toFixed());\\n } else {\\n a.push(h.toFixed());\\n }\\n } else {\\n a.push(m.toFixed());\\n }\\n return a.reverse().join(\\\":\\\");\\n }\\n }\\n }\",\n \"function getStr(idx, option) {\\r\\tif (option == \\\"TYPE\\\") {\\r\\t\\tvar type = DATA.init[idx].type;\\r\\t\\t// trace(\\\"\\\\n\\\" + type + \\\"\\\\n\\\");\\r\\t\\tif (type == \\\"binary\\\" || type == \\\"lock\\\") {\\r\\t\\t\\treturn \\\"On/Off\\\";\\r\\t\\t}\\r\\t\\treturn \\\"?type\\\";\\r\\t}\\r\\telse if (option == \\\"TIMING\\\") {\\r\\t\\t// return \\\"24 to 24\\\";// probably showing this way (a proposal)\\r\\t\\tvar timing = DATA.init[idx].timing;\\r\\t\\tif (timing) {\\r\\t\\t\\treturn \\\"Set\\\";\\r\\t\\t\\t//return DATA.init[idx].time_start + \\\" to \\\" + DATA.init[idx].time_end;\\r\\t\\t}\\r\\t\\treturn \\\"None\\\";\\r\\t}\\r\\treturn \\\"NULL\\\";\\r}\",\n \"function fnIsValidFormat(obj, _type) {\\n var _pattern = null,\\n _text = input.isText(obj) ? obj.value : obj.toString();\\n switch (_type) {\\n case \\\"d\\\": //Validates Date format: dd/MM/yyyy\\n _pattern = /^((0[1-9])|([1-2][0-9])|(3[0-1]))\\\\/((0[1-9])|(1[0-2]))\\\\/([1-2][0,9][0-9][0-9])$/;\\n break;\\n case \\\"t\\\": //Validates Time format: HH:mm:ss\\n _pattern = /^([0-1][0-9]|[2][0-3]):([0-5][0-9]):([0-5][0-9])$/;\\n break;\\n case \\\"dt\\\": //Validates DateTime format: dd/MM/yyyy HH:mm:ss\\n _pattern = /^((0[1-9])|([1-2][0-9])|(3[0-1]))\\\\/((0[1-9])|(1[0-2]))\\\\/([1-2][0,9][0-9][0-9])\\\\s([0-1][0-9]|[2][0-3]):([0-5][0-9]):([0-5][0-9])$/;\\n break;\\n case \\\"email\\\": //Validates an email address\\n _pattern = /^([0-9a-zA-Zñ](?:[\\\\-.\\\\w]*[0-9a-zA-Zñ])*@(?:[0-9a-zA-Zñ][\\\\-\\\\wñ]*[0-9a-zA-Zñ]\\\\.)+[a-zA-Z]{2,9})$/i;\\n break;\\n case \\\"pass\\\": //Validates the password strength (must have 8-20 characters, at least one number, at least one uppercase)\\n _pattern = /^(?=.*\\\\d)(?=.*[a-z])(?=.*[A-Z]).{8,20}$/;\\n break;\\n case \\\"lat\\\": //Validates the latitude\\n _pattern = /^-?([1-8]?[1-9]|[1-9]0|0)\\\\,{1}\\\\d{1,6}$/;\\n break;\\n case \\\"lon\\\": //Validates the longitude\\n _pattern = /^-?([1]?[1-7][1-9]|[1]?[1-8][0]|[1-9]?[0-9])\\\\,{1}\\\\d{1,6}$/;\\n break;\\n }\\n return !!_pattern && _pattern.test(_text);\\n }\",\n \"function inputTypes(type) {\\n if (type.startsWith('image')) {\\n return ImageType\\n }\\n\\n if (type == \\\"file.other\\\") {\\n return ImageType\\n }\\n\\n if (type == 'number') {\\n return NumberType\\n }\\n\\n return TextType\\n}\",\n \"function $formatter(type, d, {user,sId,ip,ref}) {\\n if (!config.log || !config.log.trk[type]) return\\n var ident = user != null ? `${user.name||user._id}`.gray : `${sId.substring(0,12)}`.cyan\\n\\n var jdata = type == 'view'\\n ? `${(d.url||'').cyan} ${ref?ref.replace(/https\\\\:\\\\/\\\\/|http\\\\:\\\\/\\\\//g,'<<< ').replace('www.','').blue:''}`\\n : JSON.stringify(d.data||{}).replace(/^\\\\{/,'').replace(/\\\\}$/,'').replace(/\\\\\\\"([^(\\\\\\\")\\\"]+)\\\\\\\":/g,\\\"$1:\\\".dim).gray\\n var label = type\\n if (type == 'event') label = d.name\\n if (type == 'view') label = `VIEW:${d.type}`\\n $logIt(`trk.${type}`\\n , label.toUpperCase()\\n , `${ip.replace(':ffff','')}`.cyan+`\\\\t${ident}`\\n , jdata\\n )\\n}\",\n \"static typeNameToInfo(typeName = \\\"UNKNOWN\\\") {\\n\\n switch (typeName.toUpperCase()) {\\n case \\\"DATE\\\": return { clazz: DateValue };\\n case \\\"LIST,\\\": return { clazz: List, delimiter: ', ' };\\n case \\\"LIST;\\\": return { clazz: List, delimiter: '; ' };\\n case \\\"POLICIES\\\": return { clazz: Policies };\\n case \\\"VALUE\\\": return { clazz: Value };\\n\\n default: return {};\\n }\\n }\",\n \"function formatString(string,fieldType){\\r if (string.search(/./) === -1) {\\r string = 'Click here to add a '+fieldType+'';//change class if another is preferred by Antoine.\\r }else{\\r string = string.replace('&','&');\\r string = string.replace(/ {\\n format = format.replace('##', arg);\\n });\\n return format;\\n }\",\n \"function formatDate(date, text, type) {\\n if (date == null) {\\n return \\\"\\\";\\n }\\n\\n var monthNames = [\\n text.January,\\n text.February,\\n text.March,\\n text.April,\\n text.May,\\n text.June,\\n text.July,\\n text.August,\\n text.September,\\n text.October,\\n text.November,\\n text.December\\n ];\\n\\n date = new Date(date);\\n\\n const day = date.getDate();\\n const monthIndex = date.getMonth();\\n const year = date.getFullYear();\\n const hours = date.getHours();\\n const minutes = date.getMinutes();\\n\\n if (type === \\\"date\\\") {\\n return year + \\\" \\\" + monthNames[monthIndex] + \\\" \\\" + day;\\n } else if (type === \\\"date-time\\\") {\\n return (\\n year +\\n \\\" \\\" +\\n monthNames[monthIndex] +\\n \\\" \\\" +\\n day +\\n \\\", \\\" +\\n hours +\\n \\\":\\\" +\\n minutes\\n );\\n } else if (type === \\\"time\\\") {\\n return hours + \\\":\\\" + minutes;\\n } else {\\n return date;\\n }\\n}\",\n \"function extractNumber(arg, type) {\\n // according to the API.AI documentation the @sys.date-period entity will return the date in a \\n // ISO-8601 format. I.e. 2014-01-01/2014-12-31. The year is the first one in the return value, so\\n // my regular expression will match the numbers before the '-'. Similarly, I will need to account for the\\n // case when type is @sys.date, which will have the day as the last digits before the '-'.\\n var pattern = type == DATE_ARGUMENT ? /[\\\\d]+$/ : /[\\\\d]+/;\\n //var numb = arg.match(/[\\\\d]+/);\\n var numb = arg.match(pattern);\\n return numb.join(\\\"\\\");\\n }\",\n \"function formatArgs() {\\n var args = arguments;\\n var useColors = this.useColors;\\n\\n args[0] = (useColors ? '%c' : '')\\n + this.namespace\\n + (useColors ? ' %c' : ' ')\\n + args[0]\\n + (useColors ? '%c ' : ' ');\\n\\n if (!useColors) return args;\\n\\n var c = 'color: ' + this.color;\\n args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\n // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n // arguments passed either before or after the %c, so we need to\\n // figure out the correct index to insert the CSS into\\n var index = 0;\\n var lastC = 0;\\n args[0].replace(/%[a-z%]/g, function(match) {\\n if ('%%' === match) return;\\n index++;\\n if ('%c' === match) {\\n // we only are interested in the *last* %c\\n // (the user may have provided their own)\\n lastC = index;\\n }\\n });\\n\\n args.splice(lastC, 0, c);\\n return args;\\n}\",\n \"function formatArgs(){var args=arguments;var useColors=this.useColors;args[0] = (useColors?'%c':'') + this.namespace + (useColors?' %c':' ') + args[0] + (useColors?'%c ':' ') + '+' + exports.humanize(this.diff);if(!useColors)return args;var c='color: ' + this.color;args = [args[0],c,'color: inherit'].concat(Array.prototype.slice.call(args,1)); // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n// arguments passed either before or after the %c, so we need to\\n// figure out the correct index to insert the CSS into\\nvar index=0;var lastC=0;args[0].replace(/%[a-z%]/g,function(match){if('%%' === match)return;index++;if('%c' === match){ // we only are interested in the *last* %c\\n// (the user may have provided their own)\\nlastC = index;}});args.splice(lastC,0,c);return args;}\",\n \"function IpadicFormatter() {\\n}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '') + this.namespace + (useColors ? ' %c' : ' ') + args[0] + (useColors ? '%c ' : ' ') + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function (match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\t\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\t\\n\\t if (!useColors) return args;\\n\\t\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\t\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\t\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n var args = arguments;\\n var useColors = this.useColors;\\n\\n args[0] = (useColors ? '%c' : '') + this.namespace + (useColors ? ' %c' : ' ') + args[0] + (useColors ? '%c ' : ' ') + '+' + exports.humanize(this.diff);\\n\\n if (!useColors) return args;\\n\\n var c = 'color: ' + this.color;\\n args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\n // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n // arguments passed either before or after the %c, so we need to\\n // figure out the correct index to insert the CSS into\\n var index = 0;\\n var lastC = 0;\\n args[0].replace(/%[a-z%]/g, function (match) {\\n if ('%%' === match) return;\\n index++;\\n if ('%c' === match) {\\n // we only are interested in the *last* %c\\n // (the user may have provided their own)\\n lastC = index;\\n }\\n });\\n\\n args.splice(lastC, 0, c);\\n return args;\\n }\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\n\\t if (!useColors) return args;\\n\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\n\\t if (!useColors) return args;\\n\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\n\\t if (!useColors) return args;\\n\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\n\\t if (!useColors) return args;\\n\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\n\\t if (!useColors) return args;\\n\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\",\n \"function formatArgs() {\\n\\t var args = arguments;\\n\\t var useColors = this.useColors;\\n\\n\\t args[0] = (useColors ? '%c' : '')\\n\\t + this.namespace\\n\\t + (useColors ? ' %c' : ' ')\\n\\t + args[0]\\n\\t + (useColors ? '%c ' : ' ')\\n\\t + '+' + exports.humanize(this.diff);\\n\\n\\t if (!useColors) return args;\\n\\n\\t var c = 'color: ' + this.color;\\n\\t args = [args[0], c, 'color: inherit'].concat(Array.prototype.slice.call(args, 1));\\n\\n\\t // the final \\\"%c\\\" is somewhat tricky, because there could be other\\n\\t // arguments passed either before or after the %c, so we need to\\n\\t // figure out the correct index to insert the CSS into\\n\\t var index = 0;\\n\\t var lastC = 0;\\n\\t args[0].replace(/%[a-z%]/g, function(match) {\\n\\t if ('%%' === match) return;\\n\\t index++;\\n\\t if ('%c' === match) {\\n\\t // we only are interested in the *last* %c\\n\\t // (the user may have provided their own)\\n\\t lastC = index;\\n\\t }\\n\\t });\\n\\n\\t args.splice(lastC, 0, c);\\n\\t return args;\\n\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.54740864","0.545433","0.5341621","0.5326154","0.5245996","0.5173307","0.5153685","0.5115746","0.51004386","0.5072338","0.5057002","0.50463784","0.5003069","0.49909866","0.49246162","0.4914578","0.4914578","0.4887306","0.48745137","0.48443437","0.48443437","0.48443437","0.48443437","0.48235178","0.4735865","0.47130033","0.47083235","0.47033742","0.46957892","0.46897504","0.46894726","0.46835512","0.46835512","0.4681538","0.46813178","0.46732417","0.46484914","0.4643311","0.46212757","0.46185955","0.4611994","0.46083575","0.4605591","0.4605591","0.4598739","0.45918483","0.45918483","0.45918483","0.45918483","0.45882353","0.4581434","0.457487","0.45716986","0.45641127","0.45629093","0.45595416","0.45532566","0.45489112","0.45439428","0.4537307","0.4534731","0.4523864","0.4518249","0.45172444","0.45149294","0.45119238","0.45082706","0.45082706","0.45082706","0.45041877","0.45041877","0.45028192","0.45025173","0.4498082","0.44947213","0.44899935","0.44844538","0.44800273","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.44763345","0.4475989","0.4466109","0.4466109","0.4466109","0.4466109","0.4466109","0.4466109"],"string":"[\n \"0.54740864\",\n \"0.545433\",\n \"0.5341621\",\n \"0.5326154\",\n \"0.5245996\",\n \"0.5173307\",\n \"0.5153685\",\n \"0.5115746\",\n \"0.51004386\",\n \"0.5072338\",\n \"0.5057002\",\n \"0.50463784\",\n \"0.5003069\",\n \"0.49909866\",\n \"0.49246162\",\n \"0.4914578\",\n \"0.4914578\",\n \"0.4887306\",\n \"0.48745137\",\n \"0.48443437\",\n \"0.48443437\",\n \"0.48443437\",\n \"0.48443437\",\n \"0.48235178\",\n \"0.4735865\",\n \"0.47130033\",\n \"0.47083235\",\n \"0.47033742\",\n \"0.46957892\",\n \"0.46897504\",\n \"0.46894726\",\n \"0.46835512\",\n \"0.46835512\",\n \"0.4681538\",\n \"0.46813178\",\n \"0.46732417\",\n \"0.46484914\",\n \"0.4643311\",\n \"0.46212757\",\n \"0.46185955\",\n \"0.4611994\",\n \"0.46083575\",\n \"0.4605591\",\n \"0.4605591\",\n \"0.4598739\",\n \"0.45918483\",\n \"0.45918483\",\n \"0.45918483\",\n \"0.45918483\",\n \"0.45882353\",\n \"0.4581434\",\n \"0.457487\",\n \"0.45716986\",\n \"0.45641127\",\n \"0.45629093\",\n \"0.45595416\",\n \"0.45532566\",\n \"0.45489112\",\n \"0.45439428\",\n \"0.4537307\",\n \"0.4534731\",\n \"0.4523864\",\n \"0.4518249\",\n \"0.45172444\",\n \"0.45149294\",\n \"0.45119238\",\n \"0.45082706\",\n \"0.45082706\",\n \"0.45082706\",\n \"0.45041877\",\n \"0.45041877\",\n \"0.45028192\",\n \"0.45025173\",\n \"0.4498082\",\n \"0.44947213\",\n \"0.44899935\",\n \"0.44844538\",\n \"0.44800273\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.44763345\",\n \"0.4475989\",\n \"0.4466109\",\n \"0.4466109\",\n \"0.4466109\",\n \"0.4466109\",\n \"0.4466109\",\n \"0.4466109\"\n]"},"document_score":{"kind":"string","value":"0.5289269"},"document_rank":{"kind":"string","value":"4"}}},{"rowIdx":3080,"cells":{"query":{"kind":"string","value":"Output a single mnemonic definition"},"document":{"kind":"string","value":"function outputMnemonic(pageFile, row, fltCompName)\n{\n var isOutput = false;\n var itosFormat = \"\";\n\n var variableName = ccdd.getStructureVariableName(row);\n var dataType = ccdd.getStructureDataType(row);\n\n // Get the ITOS encoded form of the data type\n var itosEncode = ccdd.getITOSEncodedDataType(dataType, \"BIG_ENDIAN\");\n\n // Check if this data type is a recognized base type or structure\n if (itosEncode != null)\n {\n // Check if the data type is a primitive (not a structure)\n if (!itosEncode.equals(dataType))\n {\n // Get the ITOS output format string based on the encoding\n itosFormat = setITOSFormatFlag(itosEncode);\n }\n\n // Get the variable name and array size\n var arraySize = ccdd.getStructureArraySize(row);\n var fullVariableName = ccdd.getFullVariableName(row);\n \n // See if this row would exceed the maximum. If so start another column\n nextRow(pageFile, variableName, fullVariableName, row);\n\n // Get the full variable name (including the variable's structure path)\n var tmp = ccdd.getFullVariableName(row, \" \");\n \n // Find number of spaces (i.e. \" \") in tmp and makes prepad a string\n // containing only that many spaces\n var prepad = new java.lang.String(String(tmp.match(/ /g))).replaceAll(\"[\\\\,]\", \"\");\n var len = 0;\n\n // Only output non-array variables or array members (i.e., skip array\n // definitions)\n if (isVariable(variableName, arraySize))\n {\n // In case this is an array member replace the square brackets\n variableName = convertArrayMember(variableName);\n \n // Create the mnemonic definition\n var fullVariableName2 = prepad + fltCompName + fullVariableName;\n len = prepad.length() + variableName.length();\n \n // Check if the data type is a structure\n if (itosEncode.equals(dataType))\n {\n nextColumnHeader = prepad + variableName;\n lastSubStructureName = nextColumnHeader;\n headerNames[row] = lastSubStructureName;\n fullHeaderNames[row] = fullVariableName;\n ccdd.writeToFileLn(pageFile, \"(+, \" + columnOffset + \", \\\"\" + nextColumnHeader + \"\\\")\");\n }\n // Not a structure; it's a primitive type\n else\n {\n if (isArrayElement(arraySize))\n {\n var maxDigits = Math.ceil(Math.log(arraySize) / Math.LN10);\n var digitPad = new Array(maxDigits + 1).join(\" \");\n\n // Output number with leading spaces\n var index = getIndex(variableName);\n var indexPadded = index.toString().padLeft(maxDigits);\n\n inMiddleOfArray = true;\n var arrayPad = 13;\n\n // This item is first on a row\n if (index % modNum != 0)\n {\n ccdd.writeToFileLn(pageFile, fullVariableName2 + \"(=, +, \\\" :v\" + itosFormat + \":\\\", raw)\");\n len = 0;\n }\n // This array item is NOT first item on a row\n else\n {\n var lastIndex = Math.min(arraySize - 1, +index + +modNum - 1).toString().padLeft(digitPad);\n var arrayMessage = new java.lang.String(String(prepad + \"[\" + indexPadded + \"-\" + lastIndex + \"]\"));\n len = arrayMessage.length() + (numITOSDigits + 1) * Math.min(modNum, arraySize);\n ccdd.writeToFileLn(pageFile, fullVariableName2 + \"(+, \" + columnOffset + \", \\\"\" + arrayMessage + \" :v\" + itosFormat + \":\\\", raw)\");\n }\n\n if (index != +arraySize - 1 && (+index + 1) % modNum != 0)\n {\n rowCount = +rowCount - 1;\n }\n\n if (index == (+arraySize - 1))\n {\n inMiddleOfArray = false;\n nextColumnHeader = lastSubStructureName;\n }\n }\n // Not an array item, print normally\n else\n {\n ccdd.writeToFileLn(pageFile, fullVariableName2 + \"(+, \" + columnOffset + \", \\\"\" + prepad + variableName + \" :v\" + itosFormat + \":\\\", raw)\");\n\n len = prepad.length() + variableName.length() + numITOSDigits + 2;\n }\n }\n\n isOutput = true;\n }\n else\n {\n nextColumnHeader = prepad + variableName + \"[\" + arraySize + \"] - \" + itosEncode;\n len = new java.lang.String(String(nextColumnHeader)).length();\n ccdd.writeToFileLn(pageFile, \"array_fmt(+, \" + columnOffset + \", \\\"\" + nextColumnHeader + \"\\\")\");\n }\n\n if (maxColumnLength < +len)\n {\n ccdd.writeToFileLn(pageFile, \"## col_max_len is now = \" + len + \" (was \" + maxColumnLength + \")\");\n maxColumnLength = +len;\n }\n }\n else\n {\n ccdd.writeToFileLn(pageFile, \"#### NOT printing \" + variableName);\n }\n\n return isOutput;\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 generateMnemonic() {\n const mnemonic = bip39.generateMnemonic();\n return mnemonic.split(\" \").slice(0, 3).join(\" \");\n}","function outputMnemonics(pageFile, fltCompName)\n{\n ccdd.writeToFileLn(pageFile, \"# Mnemonics\");\n\n // Step through each of the structure table rows\n for (var row = 0; row < ccdd.getStructureTableNumRows(); row++)\n {\n // Initialize the header name array values to blanks\n fullHeaderNames[row] = \"\";\n headerNames[row] = \"\";\n }\n\n // Step through each row in the table\n for (row = 0; row < ccdd.getStructureTableNumRows(); row++)\n {\n // Output the mnemonic for this row in the data table\n var isOutput = outputMnemonic(pageFile, row, fltCompName);\n\n // Check if a mnemonic definition was output to the file\n if (isOutput)\n {\n // Add an end of line to file to get ready for next line\n ccdd.writeToFileLn(pageFile, \"\");\n }\n }\n}","lldisplayWordDefinition() {\r\n console.log(`\\nDefinition: ${this.definition}`);\r\n }","formatSynopsis() {\n if (this.demand) {\n return ` <${this.name}>`\n }\n return ` [${this.name}]`\n }","helpText(){\n\n if(this.getStep() === 0 ){\n return ` -== HELP ==-\n The first line is 1 integer, consisting of the number of the number of lines of source code (N).\n The second line is 1 integer, constiting of the number of queries (Q).\n The next N lines consiste of HRML source code, consisting of either an opening tag with zero or more attributes or a closing tag. \n Then the next Q lines contains the queries. \n Each line is a string that references an attribute in the HRML source code.`;\n\n }else if(this.getStep() === 1){\n return 'START';\n }\n }","function help () {\n return `INSTRUCTIONS:\n Blacksmith is a simple text base game. \n \n As a blacksmith you convert ore and wood into swords and axes. You buy your resources using gold and sell your weapons for gold.\n \n COMMANDS:\n - buy(item)\n - make(item)\n - sell(item)\n - fire()\n - inventory()\n - help()`\n }","man() {\n console.log('Peano - Expression := ');\n console.log('0 | ++expr | --expr | definition');\n console.log('definition = (i, j, ...) { }');\n console.log('\\n');\n }","static definition() {\n return 'A tree is a perennial plant with an elongated stem, or trunk, supporting branches and leaves.'\n }","help() {\n const lines = [];\n if (this.banner) { lines.unshift(`${this.banner}\\n`); }\n for (const rule of Array.from(this.rules)) {\n let spaces = 15 - rule.longFlag.length;\n spaces = spaces > 0 ? repeat(' ', spaces) : '';\n const letPart = rule.shortFlag ? `${rule.shortFlag}, ` : ' ';\n lines.push(` ${letPart}${rule.longFlag}${spaces}${rule.description}`);\n }\n return `\\n${lines.join('\\n')}\\n`;\n }","function mnemonicFromSeed(seed) {\n // Sanity length check\n if (seed.length !== nacl.SEED_BTYES_LENGTH) {\n throw new RangeError(`Seed length must be ${nacl.SEED_BTYES_LENGTH}`);\n }\n const uint11Array = toUint11Array(seed);\n const words = applyWords(uint11Array);\n const checksumWord = computeChecksum(seed);\n return `${words.join(' ')} ${checksumWord}`;\n}","setMasterMnemonic (state, _mnemonic) {\n /* Update master seed. */\n state.masterMnemonic = _mnemonic\n }","outputKey(key) {\n return \"[[[output of \" + key + \"]]]\";\n }","function getMnemonic(walletRPC, keyIncludes, chain) {\n\twalletRPC.mnemonic()\n\t\t.then(mnemonic => {\n\t\t\tconsole.log(\"Your mnemonic is: \"+mnemonic.key)\n\t\t\tchain(walletRPC, { keyIncluded: mnemonic.key.includes(keyIncludes), mnemonic:mnemonic.key })\n\t\t})\n\t\t.catch(err => {\n\t\t\tconsole.error(err);\n\t\t});\n}","getHelpText(){\n return \"Tree Authoring Shell: Commands: cd {id} | @{id}. set tag {tags} | #{tag}, set value {variable} {value} | ${variable}: {value}, rm {id}, link {id} {id} | {id} > {id}, stash, unstash, prior | <, search {type} {variable} {value}\";\n\n }","function secretKeyToMnemonic(sk) {\n // get the seed from the sk\n const seed = sk.slice(0, nacl.SEED_BTYES_LENGTH);\n return mnemonicFromSeed(seed);\n}","showMnemonic() {\n this.setState({ showMnemonic: true });\n }","function getFinalTerm(card){\n return card.displayTerm + \" (\" + card.definition.toString() + \")\";\n}","getMarkDown() {\n const data = this.getExportableObject();\n\n let result = \"\";\n\n // title section\n result += \"# DiagnoSys - *A Differential Diagnosis Tool*\\n\\n\";\n result += \"TODO: add logo image here\\n\\n\\n\";\n\n // critical\n result += \"## Critical Diagnoses\\n\\n\";\n result += \"#| Diagnosis | SNOMED Code | Note\\n\";\n result += \":--- | :--- | :--- | :---\\n\";\n data[\"Critical Diagnoses\"].forEach((diagnosis, index) => {\n result += `${index} | ${diagnosis.Name} | ${diagnosis[\"SNOMED Code\"]} | ${diagnosis.Note}\\n`;\n });\n result += \"\\n\\n\";\n\n // likely\n result += \"## Likely Diagnoses\\n\\n\";\n result += \"#| Diagnosis | SNOMED Code | Note\\n\";\n result += \":--- | :--- | :--- | :---\\n\";\n data[\"Likely Diagnoses\"].forEach((diagnosis, index) => {\n result += `${index} | ${diagnosis.Name} | ${diagnosis[\"SNOMED Code\"]} | ${diagnosis.Note}\\n`;\n });\n\n return result;\n }","function help() {\n printLine('The following commands work. Hover them for more information.');\n printLine('' +\n ' help,' +\n ' clear,' +\n ' ls,' +\n ' tree,' +\n ' cd ' +\n 'dirname,' +\n ' cat ' +\n 'filename'\n );\n printLine(' ');\n printLine('You can also use the' +\n ' Up and' +\n ' Down' +\n ' keys to navigate through your command history.'\n );\n printLine('You can click on tree nodes if CLI is not your thing.' +\n ' You\\'ll still need to hit Enter.'\n );\n}","man() {\n console.log('Grammaire de la machine de Peano :');\n this.expression.man();\n this.definition.man();\n }","constructor(mnemonic, isMatch, disasm, exec) {\r\n this.mnemonic = mnemonic;\r\n this.isMatch = isMatch;\r\n this.disasm = disasm;\r\n this.exec = exec;\r\n }","function generateMarkDown(answers) {\nreturn `\n\n\n# Table of Contents\n1. [Title](#title)\n2. [Description](#description)\n3. [Installation](#installation)\n4. [Contributing](#contributing)\n5. [Test](#test)\n6. [License](#license)\n7. [Questions](#questions)\n\n\n\n\n# The title of the project is ${answers.Title} \n\n\n# ${answers.Description} \n\n\n# The project is installed by ${answers.Installation} \n\n\n# The guidelines are: ${answers.Contributing} \n\n\n# Was a test added? ${answers.Tests} \n\n\n# Licence used : ${answers.license} \n\n\n# Questions \n * My GitHub username is \n * Please email me at ${answers.email} with anymore questions\n \n \n [Return to Top](#return)\n ` \n\n\n\n}","function help () {\n return `Welcome to Scramble. \n The game where you unscramble letters to make words.\n \n Once you start the game, you will be given a scrambled word.\n If you correctly guess the word, you will receive a point.\n If you guess incorrectly you will receive a strike.\n You can also pass on a word. \n \n To start a new game use start().\n To make guess use guess('word').\n To skip a word use pass().\n To show these instructions again use help().`\n }","function help () {\n return `Welcome to Scramble. \nThe game where you unscramble letters to make words.\n\nOnce you start the game, you will be given a scrambled word.\nIf you correctly guess the word, you will receive a point.\nIf you guess incorrectly you will receive a strike.\nYou can also pass on a word. \n\nTo start a new game use start().\nTo make guess use guess('word').\nTo skip a word use pass().\nTo show these instructions again use help().`\n}","function help () {\n return `Welcome to Scramble. \nThe game where you unscramble letters to make words.\n\nOnce you start the game, you will be given a scrambled word.\nIf you correctly guess the word, you will receive a point.\nIf you guess incorrectly you will receive a strike.\nYou can also pass on a word. \n\nTo start a new game use start().\nTo make guess use guess('word').\nTo skip a word use pass().\nTo show these instructions again use help().`\n}","function help () {\n return `Welcome to Scramble. \nThe game where you unscramble letters to make words.\n\nOnce you start the game, you will be given a scrambled word.\nIf you correctly guess the word, you will receive a point.\nIf you guess incorrectly you will receive a strike.\nYou can also pass on a word. \n\nTo start a new game use start().\nTo make guess use guess('word').\nTo skip a word use pass().\nTo show these instructions again use help().`\n}","function id(m) {\n\t var meaning = lang_1.isPresent(m.meaning) ? m.meaning : '';\n\t var content = lang_1.isPresent(m.content) ? m.content : '';\n\t return lang_1.escape(\"$ng|\" + meaning + \"|\" + content);\n\t}","function help () {\n return `Welcome to Scramble.\nThe game where you unscramble letters to make words.\n\nOnce you start the game, you will be given a scrambled word.\nIf you correctly guess the word, you will receive a point.\nIf you guess incorrectly you will receive a strike.\nYou can also pass on a word.\n\nTo start a new game use start().\nTo make guess use guess('word').\nTo skip a word use pass().\nTo show these instructions again use help().`\n}","generate() {\n const cmd = this.command;\n const flags = util.sortBy(\n Object.entries(cmd.flags || {})\n .filter(([, v]) => !v.hidden)\n .map(([k, v]) => {\n v.name = k;\n return v;\n }),\n (f) => [!f.char, f.char, f.name],\n );\n const args = (cmd.args || []).filter((a) => !a.hidden);\n let output = util\n .compact([\n this.usage(flags),\n this.args(args),\n this.flags(flags),\n this.description(),\n this.aliases(cmd.aliases),\n this.examples(cmd.examples || cmd.example),\n this.docs(),\n ])\n .join('\\n\\n');\n if (this.opts.stripAnsi) output = stripAnsi(output);\n return output;\n }","function showHelpUsage() {\n let helpString = \"Hei, olen Relluassari! Yritän auttaa sinua relaatioiden ratkonnassa ;) \\n\" +\n \"<<< Koska olen vielä beta, älä pahastu jos en osaa jotain, tai kaadun kesken kaiken >>> \\n\" +\n \" \\n Miten kutsua minut apuun? \\n \" +\n \" TL;DR? Klikkaa tunnettua -> klikkaa tuntematonta -> klikkaa tuntematonta -> ... -> Repeat \\n\" +\n \" \\nEli miten? \\n\" +\n \" 1) Klikkaa graafista tunnettua sanaa \\n\" +\n \" -> Relluassari tekee Wikipediasta, Bingistä, Wiktionarystä ja Ratkojista lähdehaut ko. sanalla. \\n\" +\n \" 2) Kun haku valmis, klikkaa graafista tunnettuun kytkettyä tuntematonta sanaa \\n\" +\n \" -> Relluassari parsii hakutuloksista klikatun pituiset sanat ja brutettaa rellua niillä. \\n\" +\n \" 3) Kun brutetus valmis, klikkaa seuraavaa tunnettuun kytkettyä tuntematonta \\n\" +\n \" -> Relluassari parsii hakutuloksista klikatun pituiset sanat ja brutettaa rellua niillä. \\n\" +\n \" 4) Valitse uusi tunnettu sana lähteeksi ja siirry kohtaan 1) \\n\" +\n \"\\nAdvanced usage: \\n\" +\n \" Menu>Suorita lähdehaku (teemasana) - tekee lähdehaun vain teemasanalla \\n\" +\n \" Menu>Suorita lähdehaku (oma sana) - tekee lähdehaun syöttämälläsi sanalla/sanoilla (esim. usean sanan hakuun Bingistä) \\n\" +\n \" Menu>Parsi hakutulos sanoiksi - parsii hakutuloksesta *kaikkien* näkyvien tuntemattomien pituiset sanat \\n\" +\n \" Menu>Bruteta sanalista - brutettaa rellua sen hetken muistissa olevalla koko sanalistalla \\n\";\n alert(helpString);\n}","get format() {\n\t\t// start with command name\n\t\tlet response = this._name;\n\n\t\t// loop through parameters to add description\n\t\tthis._parameters.forEach(\n\t\t\tfunction(param) {\n\t\t\t\tresponse += \" (\" + param.description + \")\"\n\t\t\t}\n\t\t);\n\n\t\t// add remainder description with slightly different symbols\n\t\tif (this._remainderDescription) response += \" [\" + this._remainderDescription + \"]\"\n\n\t\treturn response;\n\t}","function masterDerivationKeyToMnemonic(mdk) {\n return mnemonicFromSeed(mdk);\n}","helpMessage() {\n return \"*!who-knows *\\n\" +\n \"Gibt eine Liste von Kollegen zurück, die den angegebenen Skill beherrschen.\\n\" +\n \"Die Liste wird durch die API von HBT Power bereitgestellt, die Suche ist (noch) case sensitive.\\n\" +\n \" Alias: !wer-weiß, !häää?, !who-knows, wat?\";\n }","function mnemButton(evt, mnemonic) {\n let text = document.getElementById(\"textBox\").value;\n if (text != '') {\n text += '\\n';\n }\n text += mnemonic;\n document.getElementById(\"textBox\").value = text;\n}","function generateReadme (answer) {\n return `\n# ${answer.title}\n\n\n\n# Table of Contents\n\n\n- [Description](#description)\n- [Installation](#installation)\n- [Usage](#usage)\n- [License](#license)\n- [Contributing](#contributing)\n- [Tests](#tests)\n- [Questions](#questions)\n\n## Description:\n This area is designed for leaving a report of what the project is and it's purpose.\n ${answer.description}\n\n## Installation:\n These are the necessary steps to follow/files to download that you need in order to run the application.\n ${answer.installation}\n\n## Usage:\n ${answer.usage}\n\n## License:\n[](https://opensource.org/licenses/${answer.license})\n\n## Contributing:\n ${answer.contributing}\n\n## Tests:\n\n\n\n\n## Questions:\n- GitHub: [${answer.username}](https://github.com/${answer.username})\n- Email: Contact me @ ${answer.email} for any other questions you might have!\n\n `\n\n}","function generateRandomMnemonic() {\n return bip39.generateMnemonic(256);\n}","function toSyllable(){\n if(syllables.length > 1){\n currentColor = syllables[syllables.length-1].color;\n }\n document.getElementById(\"input\").innerHTML = syllableForm();\n document.getElementById(\"meiOutput\").value = createMEIOutput();\n}","function displayHelpText() {\n console.log();\n console.log(' Usage: astrum figma [command]');\n console.log();\n console.log(' Commands:');\n console.log(' info\\tdisplays current Figma settings');\n console.log(' edit\\tedits Figma settings');\n console.log();\n}","function generateMarkdown(answer) {\n\treturn `# ${answer.title}\n## Description\n${answer.description}\n## Table of Contents\n1. [Installation](#installation)\n2. [Usage](#usage)\n\t1. [Testing](#test)\n3. [Contribution](#contribution)\n4. [Contact Me](#contact)\n5. [License](#license)\n## Installation \n\\`\\`\\`bash\n${answer.installation}\n\\`\\`\\`\n## Usage \n${answer.usage}\nTo run the tests: \n\\`\\`\\`bash\n${answer.test}\n\\`\\`\\`\n## Contribution \n${answer.contributing}\n## Have a question? \n[Github Account](https://github.com/${answer.github})\nEmail me at ${answer.email}\n## License \n${renderLicenseBadge(answer.license)}\n\n`;\n}","function code(c) {\n return DEFINITIONS[c] || c.toUpperCase().charCodeAt(0);\n }","function code(c) {\n return DEFINITIONS[c] || c.toUpperCase().charCodeAt(0);\n }","function getHelpMaster() {\n var help = \"\\\n #b (#public, set room as public) \\\n #k {user} (#kick, kick a user out of current room) \\\n #m {user} (#master, assign another room user as master) \\\n #s {size} (#size, set room max size, 0 means no limit) \\\n #v (#private, set room as private) \\\n\";\n return help;\n }","function createMnemonic(walletRPC, keyIncludes) {\n\tcreateAndOpenWallet(walletRPC, TheWalletName, function(walletRPC) {\n\t\tgetMnemonic(walletRPC, keyIncludes, function(walletRPC, mnemonicOutput) {\n\t\t\tif (mnemonicOutput.keyIncluded) { return mnemonic; }\n\t\t\telse {\n\t\t\t\tfs.unlink(\"./wallets/\"+TheWalletName+\".keys\", function() { // delete previous new-wallet.key\n\t\t\t\t\tfs.unlink(\"./wallets/\"+TheWalletName, function() { // delete previous new-wallet\n\t\t\t\t\t\tcreateMnemonic(walletRPC, keyIncludes);\n\t\t\t\t\t});\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\t});\n\t\n}","static fromString(mnemonic) {\n return new Mnemonic(mnemonic.split(\" \"));\n }","function generateControlDefinition(ctrl, indent) {\n const indented_1 = indentLevel(indent, 1);\n let text = '';\n text += generateControlDefintionBeginning(ctrl, indent);\n text += generateLabeledControlProperties(ctrl, indented_1);\n text += generateControlDefintionEnding(indent);\n return text;\n }","function StringHelp() {\n}","function showState(state) {\n\treturn `[${state.content[0].show()} ${state.content[1].show()}]`;\n}","function qname(m)\r\n{\r\n\treturn \"\\x22\" + m + \"\\x22\";\r\n}","function symbol(name){\r\n return lexeme(string(name));\r\n}","showGetMnemonicButton() {\n return(\n \n \n { mnemonicScreenConstants.mnemonicScreenExplanationText }\n \n \n GET MNEMONIC\n \n \n );\n }","describeKimfer() {\n return `Meet ${this.name}! He has ${this.health} health points and a strength of ${this.strength}. He have ${this.xp} experience points`;\n }","function readInp(){\n\tvar inp = document.getElementById(\"cfg\").value;\n\tvar without = interpret(inp);\n\tvar SymSet = new SymbolSet(without);\n\tvar startSym = SymSet.findSym(\"S\");\n\tvar sentence = SymSet.writeSymbol(startSym);\n\t//console.log(sentence);\n\tdocument.getElementById(\"output\").innerHTML += \"
\" + sentence + \"
\";\n}","getHelp ( input, output ) {\n output.standardOutput.writeLine( 'Usage:' );\n this.getUsage().split( '\\n' ).forEach( line => output.standardOutput.writeLine( line ) );\n output.standardOutput.writeLine( '' );\n\n if ( this.getDescription() ) {\n output.standardOutput.writeLine( 'Description:' );\n output.standardOutput.writeLine( this.getDescription() );\n }\n\n output.standardOutput.writeLine( '' );\n }","get help() {\n\t\tlet response = \"\"\n\t\tif (this._description) { \n\t\t\tresponse = this._description; \n\t\t}\n\n\t\tresponse += \" - Usage: \" + this.format;\n\t\tresponse += \" - Ex: \" + this.example;\n\n\t\treturn response;\n\t}","function explainPuzzle(){\n\tlet ed = display.explanationDisplay;\n\ted.innerHTML = underground.selected.explanationDisplay();\n}","function createLabelMaker(title, instructions, callback) {\n var newStrP = new StringPad();\n newStrP.open(title, instructions, callback);\n }","function writeInstructions() {\n noStroke();\n fill(252, 118, 172);\n textSize(54)\n text('my name is', width / 2, height / 3)\n text('i was born in', width / 2, height * 1 / 2);\n textSize(25);\n text('click on your sign to get your horoscope!', width / 2, height * 2 / 3)\n}","function generateHaiku() {\n // Make a DIV with the new sentence\n var expansion = cfree.getExpansion('');\n expansion = expansion.replace(/%/g, ' ');\n var par = createP(expansion);\n par.class('text');\n}","function XDisplaySentence(targetId, WordIdPrefix, punctuation) {\n //alert('Display Function');\n //Build the Sentence\n var sentence = \"\".concat($(WordIdPrefix + LastSentenceSelections[0]).text(), \" \", $(WordIdPrefix + LastSentenceSelections[1]).text(), \" \", $(WordIdPrefix + LastSentenceSelections[2]).text(), \" \", $(WordIdPrefix + LastSentenceSelections[3]).text(), punctuation);\n\n $(targetId).text(sentence);//Display the sentence in the header\n}","function Term(hiragana, kanji, definition) {\n this.hiragana_ = hiragana;\n this.kanji_ = kanji;\n this.definition_ = definition;\n}","function word(name, definition){\n this.name = name;\n this.definition = definition;\n}","get displayText PS_displayText() {\n var {matchedName: sentence, _arguments: args} = this._verb;\n for (let x in args) {\n let obj = x === \"direct_object\";\n let {text} = this._argSuggs[x] || 0;\n if (text) sentence += (\" \" +\n (obj ? \"\" : args[x].flag + \" \") +\n (obj ? \"[ \" + text + \" ]\" : text));\n }\n return sentence;\n }","function help() {\n console.log(\n \"\\n\" +\n \"STRUCTURE\" +\n \"\\033[38;5;6m\" + \"\\n node liri.js (command) + (search(artist, concert, movie))\\n\" + \"\\033[0m\" +\n \"\\nCOMMAND OPTIONS\" +\n \"\\033[38;5;10m\" +\n \"\\n spotify-this-song\" + \"\\033[0m\" + \" search for artist details\" +\n \"\\033[38;5;10m\" +\n \"\\n concert-this\" + \"\\033[0m\" + \" search for concert details\" +\n \"\\033[38;5;10m\" +\n \"\\n movie-this\" + \"\\033[0m\" + \" search for movie details\" +\n \"\\033[38;5;10m\" +\n \"\\n do-what-it-says\" + \"\\033[0m\" + \" run a search based on what is written in 'random.txt'\"\n )\n}","function entry (name) {\n let lastWord = env.compilationVocabulary.word;\n env.compilationVocabulary.word = env.dp;\n\n memWriteNextByte(0); // flags\n memWriteNextCell(lastWord); // link to previous word\n memWriteNextString(name); // word name\n}","function getLabelDescriptions () {\n return {\n 'Walk' : {\n 'id' : 'Walk',\n 'text' : 'Walk'\n },\n 'StopSign' : {\n 'id' : 'StopSign',\n 'text' : 'Bus Stop Sign'\n },\n 'StopSign_OneLeg' : {\n 'id' : 'StopSign_OneLeg',\n 'text' : 'One-leg Stop Sign'\n },\n 'StopSign_TwoLegs' : {\n 'id' : 'StopSign_TwoLegs',\n 'text' : 'Two-leg Stop Sign'\n },\n 'StopSign_Column' : {\n 'id' : 'StopSign_Column',\n 'text' : 'Column Stop Sign'\n },\n 'StopSign_None' : {\n 'id' : 'StopSign_None',\n 'text' : 'Not provided'\n },\n 'Landmark_Shelter' : {\n 'id' : 'Landmark_Shelter',\n 'text' : 'Bus Stop Shelter'\n },\n 'Landmark_Bench' : {\n 'id' : 'Landmark_Bench',\n 'text' : 'Bench'\n },\n 'Landmark_TrashCan' : {\n 'id' : 'Landmark_TrashCan',\n 'text' : 'Trash Can / Recycle Can'\n },\n 'Landmark_MailboxAndNewsPaperBox' : {\n 'id' : 'Landmark_MailboxAndNewsPaperBox',\n 'text' : 'Mailbox / News Paper Box'\n },\n 'Landmark_OtherPole' : {\n 'id' : 'Landmark_OtherPole',\n 'text' : 'Traffic Sign / Pole'\n }\n }\n}","function label(node) {\n var type = node.referenceType;\n var value = type === 'full' ? node.identifier : '';\n\n return type === 'shortcut' ? value : '[' + value + ']';\n}","get abbrButton() {\n return {\n command: \"wrapRange\",\n commandVal: \"ABBR\",\n toggles: true,\n label: \"Abbr\",\n type: \"rich-text-editor-button\",\n };\n }","function explainShortName(name, tTable) {\n return \" title='\"+name+\"' \";\n}","function generateText(text) {\n let mm = new MarkovMachine(text);\n console.log(mm.makeText());\n}","function description(state) {\n if(typeof state === \"object\") return \" \" + state.join(\" \");\n var descr = \"\";\n for(var i = 0, h = state.length - 1; h >= 0; --h) {\n var hex = parseInt(state[h], 16);\n if(hex & 1) descr += \" \" + root.predicates[i]; ++i;\n if(hex & 2) descr += \" \" + root.predicates[i]; ++i;\n if(hex & 4) descr += \" \" + root.predicates[i]; ++i;\n if(hex & 8) descr += \" \" + root.predicates[i]; ++i;\n }\n return descr;\n}","getHelp() {\n return {\n syntax: `esm link source-path`,\n short: `links the dependency from source-path to the current project. Links just the version specicifed in the source-path and semver compatible versions, nothitng else.`,\n description: ``,\n examples: [{\n syntax: `esm link ../http2-server`,\n short: `links the http2-server library to the current projects esm folder`,\n }]\n }\n }","function generateReadMe(answers) {\n createkey(answers)\n return `\n${answers.title}\n\n${myIcon}\n\n## Description\n${answers.description}\n## Table of Contents\n- [Description](#Description)\n- [Installation_instructions](#Installation_instructions)\n- [Usage](#Usage)\n- [License](#License)\n- [Contributors](#Contributors)\n- [Testing](#Testing)\n- [Questions](#Questions)\n\n## Installation_instructions\n${answers.installation_instructions}\n\n## Usage\n${answers.usage}\n\n${myImg}\n\nThis application is covered by the ${myIcon} license. \n\n${myLink}\n\n## Contributors\n${answers.contributors}\n\n## Testing \n${answers.testing}\n\n## Questions\nEmail me with any questions: ${answers.email}\n\nGitHub: [${answers.GitHub}](https://github.com/${answers.GitHub})`\n}","static help() {\n console.log(\n`Usage: \n\\nversion [ -v semver ] [-p [ 0 => PATCH, 1 => MINOR, 2 => MAJOR ] ]\nE.g version -v 0.2.3 -p 1 ## 0.3.3\n\nversion [ -f file ] [ -d delimeter ]\n `);\n }","make(m) {\n\t\treturn [`%c[TCFS]:%c ${m}`, 'color: purple; font-weight: bold', ''];\n\t}","title() { return this.owner.name + \" - \" + this.label.replace('\\n', ' ') }","function generate (type) {\n var chain = markovChain(type)\n if (chain) {\n return markovName(chain)\n }\n return ''\n}","function help() {\n\tvar commandsArray = ['Help: List of available commands', '>help', '>about', '>contact', '>ping', '>time', '>clear', '>say'];\n\tfor (var i = 0; i < commandsArray.length; i++) {\n\t\tvar out = '' + commandsArray[i] + ' '\n\t\tOutput(out);\n\t}\n}","generate() {\n return {\n instructions: 'instructions here',\n question: 'question here',\n diagram: 'diagram here',\n answer: 'answer here',\n }\n }","function generate_md(parsed_code, language, callback) {\n var outfile,\n outcode = '';\n \n for (var i = 0, l = parsed_code.length; i < l; i++) {\n if (parsed_code[i].comment !== '') outcode += parsed_code[i].comment + '\\n\\n';\n if (parsed_code[i].code !== '') outcode += '```' + language.name + '\\n' + parsed_code[i].code + '\\n```\\n\\n';\n }\n\n callback(null, outcode);\n}","function CreateAbnfGrammar(myna) {\r\n // Setup a shorthand for the Myna parsing library object\r\n let m = myna; \r\n\r\n let g = new function() {\t\t\r\n\t\t// comment and whitespace\r\n\t\tthis.WSP = m.char(\" \\t\"); /* white space SP / HTAB */\r\n\t\t// comment \t= \";\" *(WSP / VCHAR) CRLF\r\n\t\tthis.comment \t= m.seq(\";\", m.advanceUntilPast(m.newLine));\r\n\t\tthis.c_nl = m.choice(m.newLine, this.comment); /* comment or newline */\r\n\t\tthis.c_wsp = m.choice(this.WSP, m.seq(this.c_nl, this.WSP)).zeroOrMore;\r\n\t\t\r\n\t\t// terminals\r\n\t\t// prose-val \t= \"<\" *(%x20-3D / %x3F-7E) \">\"\r\n\t\tthis.prose_val = m.tagged(m.notChar('>').zeroOrMore).ast; /* bracketed string of SP and VCHAR without angles prose description, to be used as last resort */\r\n\t\tthis.hex_val = m.seq(\"x\", m.hexDigit.oneOrMore, m.choice(m.seq(\".\", m.hexDigit.oneOrMore).oneOrMore, m.seq(\"-\", m.hexDigit.oneOrMore)).opt);\r\n\t\tthis.dec_val = m.seq(\"d\", m.digit.oneOrMore, m.choice(m.seq(\".\", m.digit.oneOrMore).oneOrMore, m.seq(\"-\", m.digit.oneOrMore)).opt);\r\n\t\tthis.bin_val = m.seq(\"b\", m.binaryDigit.oneOrMore, m.choice(m.seq(\".\", m.binaryDigit.oneOrMore).oneOrMore, m.seq(\"-\", m.binaryDigit.oneOrMore)).opt); /* series of concatenated bit values or single ONEOF range */\r\n\t\tthis.num_val = m.seq(\"%\", m.choice(this.bin_val, this.dec_val, this.hex_val)).ast;\r\n\t\t// char-val \t= DQUOTE *(%x20-21 / %x23-7E) DQUOTE\r\n\t\tthis.char_val = m.doubleQuoted(m.notChar('\"').oneOrMore).ast; /* quoted string of SP and VCHAR without DQUOTE */\r\n\t\t\r\n\t\tthis.rulename = m.seq(m.letter, m.choice(m.letter, m.digit, \"-\").zeroOrMore).ast;\r\n\t\t\r\n\t\t// patterns\r\n\t\tlet _this = this;\r\n\t\tthis.option = m.seq(\"[\", this.c_wsp, m.delay(function() { return _this.pattern; }), this.c_wsp, \"]\").ast;\r\n\t\tthis.group = m.seq(\"(\", this.c_wsp, m.delay(function() { return _this.pattern; }), this.c_wsp, \")\");\t\t\r\n\t\tthis.element = m.choice(this.rulename, this.group, this.option, this.char_val, this.num_val, this.prose_val);\r\n\t\tthis.repeat = m.choice(m.seq(m.digit.zeroOrMore, \"*\", m.digit.zeroOrMore), m.digit.oneOrMore).ast;\r\n\t\tthis.repetition = m.seq(this.repeat.opt, this.element).ast;\r\n\t\tthis.concatenation = m.seq(this.repetition, m.seq(this.c_wsp, this.repetition).zeroOrMore);\r\n\t\tthis.alternation\t= m.seq(this.c_wsp, \"/\", this.c_wsp, this.concatenation).ast;\r\n\t\tthis.pattern \t= m.seq(this.concatenation, this.alternation.zeroOrMore).ast;\r\n\t\t\r\n\t\t// rule\r\n\t\tthis.defined_as = m.choice(\"::=\", \":=\", \"=\").ast; /* basic rules definition; incremental alternatives \"=/\" is not supported */\r\n\t\tthis.rule = m.seq(this.rulename, this.c_wsp, this.defined_as, this.c_wsp, this.pattern, this.c_wsp, this.c_nl).ast; /* continues if next line starts with white space */\r\n\t\tthis.grammar\t\t= m.choice(this.rule, m.seq(this.c_wsp, this.c_nl)).oneOrMore.ast;\r\n };\r\n\r\n // Register the grammar, providing a name and the default parse rule\r\n return m.registerGrammar(\"abnf\", g, g.grammar);\r\n}","helpInformation() {\n let desc = [];\n\n if (this._description) {\n desc = [this._description, ''];\n const {\n argsDescription\n } = this;\n\n if (argsDescription && this._args.length) {\n const width = this.padWidth();\n desc.push('Arguments:');\n desc.push('');\n\n this._args.forEach(({\n name\n }) => {\n desc.push(` ${pad(name, width)} ${argsDescription[name]}`);\n });\n\n desc.push('');\n }\n }\n\n let cmdName = this._name;\n\n if (this._alias) {\n cmdName = `${cmdName}|${this._alias}`;\n }\n\n const usage = [`Usage: ${cmdName} ${this.getUsage()}`, ''];\n let cmds = [];\n const commandHelp = this.commandHelp();\n if (commandHelp) cmds = [commandHelp];\n const options = ['Options:', `${this.optionHelp().replace(/^/gm, ' ')}`, ''];\n return usage.concat(desc).concat(options).concat(cmds).join('\\n');\n }","function newAnchorLabel() {\n count = ++that.anchor_count;\n anchor_label = strval((count + 1)); //generating footnote number starting at 1 instead of 0\n /* yil original letter generating label code\n anchor_label = '';\n do {\n anchor_label = chr(ord('a') + (count % 26)) + anchor_label;\n count = (int) floor(count / 26);\n } while (count > 0);*/\n return anchor_label;\n }","function TutorialInstruction({ commandName, iconName }) {\n return (\n \n \n {commandName}\n \n );\n}","function t(text) { return {'macro_name': 'plaintext', 'text': text}; }","function showInstructions() {\n\t\t\tclear();\n\t\t\tdiv.update('' + lang.instructions + '');\n\t\t}","toString() {\r\n\t\treturn (this.ctrl? \"Ctrl+\":\"\") +\r\n\t\t\t(this.alt? \"Alt+\":\"\") +\r\n\t\t\t(this.shift? \"Shift+\":\"\") +\r\n\t\t\tthis.name\r\n\t}","function showInstructions() {\r\n\tconst INSTRUCTIONS = \"1. Identify the morphological boundaries. \" \r\n\t\t\t\t\t + \"When you mouse over the word, grey slashes will appear in the spaces between the letters, indicating possible morphological boundaries.
\"\r\n\t\t\t\t\t + \"a. To mark a morphological boundary, click on the space where you think the boundary is using your mouse.
\" \r\n\t\t\t\t\t + \"b. Once you've made your selection, click on the check button to see whether you've identified the boundaries correctly.
\"\r\n\t\t\t\t\t + \"c. If you've selected your boundaries correctly, the morphological categories of the word's components will automatically appear above the word.\"\r\n\t\t\t\t\t + \"If you haven't, you will be given the opportunity to try again \"\r\n\t\t\t\t\t + \"(remember, after three tries, the program will provide the correct answer).\"; \r\n\tshowModal(INSTRUCTIONS, false);\r\n}","toString() {\n return this.symbol + \"_\" + this.subscript;\n }","get formula() { return this.ast ? this.ast.toString(this.id) : ''; }","function createAnswer(state, currentFlow) {\nvar flowText = 'Current Flow: ' + currentFlow + 'FT3/S';\n$('#current-flow > .container').append(flowText).css('font-size', '18px').css('letter-spacing', '2px');\n$('#answer > .container').text(state.toUpperCase());\n}","function displayStatement(nmbr){\n stellingTitle.innerHTML = (nmbr + 1).toString() + '. ' + subjects[nmbr].title;\n stellingDes.innerHTML = subjects[nmbr].statement;\n}","function drawManga('anime stories') {\r\n alert(Bakuman + 'is my favorite anime and Manga of all time');\r\n}","commandHelp() {\n if (!this.commands.length) return '';\n const commands = this.prepareCommands();\n const width = this.padWidth();\n return ['Commands:', commands.map(cmd => {\n const desc = cmd[1] ? ` ${cmd[1]}` : '';\n return (desc ? pad(cmd[0], width) : cmd[0]) + desc;\n }).join('\\n').replace(/^/gm, ' '), ''].join('\\n');\n }","function createText(text){\n let mm = new markov.MarkovMachine(text)\n console.log(mm.makeText())\n}","function generateSentence() {\r\n return selectChud()+' '+selectVerb()+' '+selectLefty()+' With '+selectAdjective()+' '+selectEnding();\r\n}","function help() {\n\tvar commandsArray = ['Help: List of available commands',\n\t\t'>about',\n\t\t'>contact',\n\t\t'>projects',\n\t\t'>skills',\n\t\t'>experiences',\n\t\t'>help',\n\t\t'>ping',\n\t\t'>time',\n\t\t'>clear',\n\t\t'>say',\n\t\t'>info',\n\t\t'>exit'];\n\tseperator();\n\tfor (var i = 0; i < commandsArray.length; i++) {\n\t\tvar out = '' + commandsArray[i] + ' '\n\t\tOutput(out);\n\t}\n}","function madlib(verb, adj, noun) {\n return `We shall ${verb.toUpperCase()} the ${adj.toUpperCase()} ${noun.toUpperCase()}`\n}","_renderInstructions(parseState) {\n var firstQuestionNumber = parseState.firstQuestionRef;\n var firstSentenceRef = parseState.firstSentenceRef;\n var instructions = \"\";\n\n if (firstQuestionNumber) {\n instructions += i18n._(\"The symbol %(questionSymbol)s indicates that question \" + \"%(questionNumber)s references this portion of the \" + \"passage.\", {\n questionSymbol: \"[[\" + firstQuestionNumber + \"]]\",\n questionNumber: firstQuestionNumber\n });\n }\n\n if (firstSentenceRef) {\n instructions += i18n._(\" The symbol %(sentenceSymbol)s indicates that the \" + \"following sentence is referenced in a question.\", {\n sentenceSymbol: \"[\" + firstSentenceRef + \"]\"\n });\n }\n\n var parsedInstructions = PassageMarkdown.parse(instructions);\n return /*#__PURE__*/React$13.createElement(\"div\", {\n className: \"perseus-widget-passage-instructions\"\n }, PassageMarkdown.output(parsedInstructions));\n }","function generateMarkdown(answers) {\n return `# ${title} \\n ${description} \\n ## Table of Contents \\n * [Installation Instructions](#Installation-Instructions) \\n * [Contribution Guidelines](#Contribution-Guidelines) \\n * [Testing Instructions](#Testing-Instructions) \\n * [Questions](#Questions) \\n * [License](#License) \\n ## Installation Instructions \\n ${installationInstructions} \\n ## Instructions for Use \\n ${usage} \\n ## Contribution Guidelines \\n ${contribution} \\n ## Testing Instructions \\n ${test} \\n ## Questions \\n * Github Username: ${github} \\n * Email: ${email} \\n * How to contact: ${contact}`;\n }","function symbolNode(value, height, depth, italic, skew, classes, style) {\n this.value = value || \"\";\n this.height = height || 0;\n this.depth = depth || 0;\n this.italic = italic || 0;\n this.skew = skew || 0;\n this.classes = classes || [];\n this.style = style || {};\n this.maxFontSize = 0;\n}"],"string":"[\n \"function generateMnemonic() {\\n const mnemonic = bip39.generateMnemonic();\\n return mnemonic.split(\\\" \\\").slice(0, 3).join(\\\" \\\");\\n}\",\n \"function outputMnemonics(pageFile, fltCompName)\\n{\\n ccdd.writeToFileLn(pageFile, \\\"# Mnemonics\\\");\\n\\n // Step through each of the structure table rows\\n for (var row = 0; row < ccdd.getStructureTableNumRows(); row++)\\n {\\n // Initialize the header name array values to blanks\\n fullHeaderNames[row] = \\\"\\\";\\n headerNames[row] = \\\"\\\";\\n }\\n\\n // Step through each row in the table\\n for (row = 0; row < ccdd.getStructureTableNumRows(); row++)\\n {\\n // Output the mnemonic for this row in the data table\\n var isOutput = outputMnemonic(pageFile, row, fltCompName);\\n\\n // Check if a mnemonic definition was output to the file\\n if (isOutput)\\n {\\n // Add an end of line to file to get ready for next line\\n ccdd.writeToFileLn(pageFile, \\\"\\\");\\n }\\n }\\n}\",\n \"lldisplayWordDefinition() {\\r\\n console.log(`\\\\nDefinition: ${this.definition}`);\\r\\n }\",\n \"formatSynopsis() {\\n if (this.demand) {\\n return ` <${this.name}>`\\n }\\n return ` [${this.name}]`\\n }\",\n \"helpText(){\\n\\n if(this.getStep() === 0 ){\\n return ` -== HELP ==-\\n The first line is 1 integer, consisting of the number of the number of lines of source code (N).\\n The second line is 1 integer, constiting of the number of queries (Q).\\n The next N lines consiste of HRML source code, consisting of either an opening tag with zero or more attributes or a closing tag. \\n Then the next Q lines contains the queries. \\n Each line is a string that references an attribute in the HRML source code.`;\\n\\n }else if(this.getStep() === 1){\\n return 'START';\\n }\\n }\",\n \"function help () {\\n return `INSTRUCTIONS:\\n Blacksmith is a simple text base game. \\n \\n As a blacksmith you convert ore and wood into swords and axes. You buy your resources using gold and sell your weapons for gold.\\n \\n COMMANDS:\\n - buy(item)\\n - make(item)\\n - sell(item)\\n - fire()\\n - inventory()\\n - help()`\\n }\",\n \"man() {\\n console.log('Peano - Expression := ');\\n console.log('0 | ++expr | --expr | definition');\\n console.log('definition = (i, j, ...) { }');\\n console.log('\\\\n');\\n }\",\n \"static definition() {\\n return 'A tree is a perennial plant with an elongated stem, or trunk, supporting branches and leaves.'\\n }\",\n \"help() {\\n const lines = [];\\n if (this.banner) { lines.unshift(`${this.banner}\\\\n`); }\\n for (const rule of Array.from(this.rules)) {\\n let spaces = 15 - rule.longFlag.length;\\n spaces = spaces > 0 ? repeat(' ', spaces) : '';\\n const letPart = rule.shortFlag ? `${rule.shortFlag}, ` : ' ';\\n lines.push(` ${letPart}${rule.longFlag}${spaces}${rule.description}`);\\n }\\n return `\\\\n${lines.join('\\\\n')}\\\\n`;\\n }\",\n \"function mnemonicFromSeed(seed) {\\n // Sanity length check\\n if (seed.length !== nacl.SEED_BTYES_LENGTH) {\\n throw new RangeError(`Seed length must be ${nacl.SEED_BTYES_LENGTH}`);\\n }\\n const uint11Array = toUint11Array(seed);\\n const words = applyWords(uint11Array);\\n const checksumWord = computeChecksum(seed);\\n return `${words.join(' ')} ${checksumWord}`;\\n}\",\n \"setMasterMnemonic (state, _mnemonic) {\\n /* Update master seed. */\\n state.masterMnemonic = _mnemonic\\n }\",\n \"outputKey(key) {\\n return \\\"[[[output of \\\" + key + \\\"]]]\\\";\\n }\",\n \"function getMnemonic(walletRPC, keyIncludes, chain) {\\n\\twalletRPC.mnemonic()\\n\\t\\t.then(mnemonic => {\\n\\t\\t\\tconsole.log(\\\"Your mnemonic is: \\\"+mnemonic.key)\\n\\t\\t\\tchain(walletRPC, { keyIncluded: mnemonic.key.includes(keyIncludes), mnemonic:mnemonic.key })\\n\\t\\t})\\n\\t\\t.catch(err => {\\n\\t\\t\\tconsole.error(err);\\n\\t\\t});\\n}\",\n \"getHelpText(){\\n return \\\"Tree Authoring Shell: Commands: cd {id} | @{id}. set tag {tags} | #{tag}, set value {variable} {value} | ${variable}: {value}, rm {id}, link {id} {id} | {id} > {id}, stash, unstash, prior | <, search {type} {variable} {value}\\\";\\n\\n }\",\n \"function secretKeyToMnemonic(sk) {\\n // get the seed from the sk\\n const seed = sk.slice(0, nacl.SEED_BTYES_LENGTH);\\n return mnemonicFromSeed(seed);\\n}\",\n \"showMnemonic() {\\n this.setState({ showMnemonic: true });\\n }\",\n \"function getFinalTerm(card){\\n return card.displayTerm + \\\" (\\\" + card.definition.toString() + \\\")\\\";\\n}\",\n \"getMarkDown() {\\n const data = this.getExportableObject();\\n\\n let result = \\\"\\\";\\n\\n // title section\\n result += \\\"# DiagnoSys - *A Differential Diagnosis Tool*\\\\n\\\\n\\\";\\n result += \\\"TODO: add logo image here\\\\n\\\\n\\\\n\\\";\\n\\n // critical\\n result += \\\"## Critical Diagnoses\\\\n\\\\n\\\";\\n result += \\\"#| Diagnosis | SNOMED Code | Note\\\\n\\\";\\n result += \\\":--- | :--- | :--- | :---\\\\n\\\";\\n data[\\\"Critical Diagnoses\\\"].forEach((diagnosis, index) => {\\n result += `${index} | ${diagnosis.Name} | ${diagnosis[\\\"SNOMED Code\\\"]} | ${diagnosis.Note}\\\\n`;\\n });\\n result += \\\"\\\\n\\\\n\\\";\\n\\n // likely\\n result += \\\"## Likely Diagnoses\\\\n\\\\n\\\";\\n result += \\\"#| Diagnosis | SNOMED Code | Note\\\\n\\\";\\n result += \\\":--- | :--- | :--- | :---\\\\n\\\";\\n data[\\\"Likely Diagnoses\\\"].forEach((diagnosis, index) => {\\n result += `${index} | ${diagnosis.Name} | ${diagnosis[\\\"SNOMED Code\\\"]} | ${diagnosis.Note}\\\\n`;\\n });\\n\\n return result;\\n }\",\n \"function help() {\\n printLine('The following commands work. Hover them for more information.');\\n printLine('' +\\n ' help,' +\\n ' clear,' +\\n ' ls,' +\\n ' tree,' +\\n ' cd ' +\\n 'dirname,' +\\n ' cat ' +\\n 'filename'\\n );\\n printLine(' ');\\n printLine('You can also use the' +\\n ' Up and' +\\n ' Down' +\\n ' keys to navigate through your command history.'\\n );\\n printLine('You can click on tree nodes if CLI is not your thing.' +\\n ' You\\\\'ll still need to hit Enter.'\\n );\\n}\",\n \"man() {\\n console.log('Grammaire de la machine de Peano :');\\n this.expression.man();\\n this.definition.man();\\n }\",\n \"constructor(mnemonic, isMatch, disasm, exec) {\\r\\n this.mnemonic = mnemonic;\\r\\n this.isMatch = isMatch;\\r\\n this.disasm = disasm;\\r\\n this.exec = exec;\\r\\n }\",\n \"function generateMarkDown(answers) {\\nreturn `\\n\\n\\n# Table of Contents\\n1. [Title](#title)\\n2. [Description](#description)\\n3. [Installation](#installation)\\n4. [Contributing](#contributing)\\n5. [Test](#test)\\n6. [License](#license)\\n7. [Questions](#questions)\\n\\n\\n\\n\\n# The title of the project is ${answers.Title} \\n\\n\\n# ${answers.Description} \\n\\n\\n# The project is installed by ${answers.Installation} \\n\\n\\n# The guidelines are: ${answers.Contributing} \\n\\n\\n# Was a test added? ${answers.Tests} \\n\\n\\n# Licence used : ${answers.license} \\n\\n\\n# Questions \\n * My GitHub username is \\n * Please email me at ${answers.email} with anymore questions\\n \\n \\n [Return to Top](#return)\\n ` \\n\\n\\n\\n}\",\n \"function help () {\\n return `Welcome to Scramble. \\n The game where you unscramble letters to make words.\\n \\n Once you start the game, you will be given a scrambled word.\\n If you correctly guess the word, you will receive a point.\\n If you guess incorrectly you will receive a strike.\\n You can also pass on a word. \\n \\n To start a new game use start().\\n To make guess use guess('word').\\n To skip a word use pass().\\n To show these instructions again use help().`\\n }\",\n \"function help () {\\n return `Welcome to Scramble. \\nThe game where you unscramble letters to make words.\\n\\nOnce you start the game, you will be given a scrambled word.\\nIf you correctly guess the word, you will receive a point.\\nIf you guess incorrectly you will receive a strike.\\nYou can also pass on a word. \\n\\nTo start a new game use start().\\nTo make guess use guess('word').\\nTo skip a word use pass().\\nTo show these instructions again use help().`\\n}\",\n \"function help () {\\n return `Welcome to Scramble. \\nThe game where you unscramble letters to make words.\\n\\nOnce you start the game, you will be given a scrambled word.\\nIf you correctly guess the word, you will receive a point.\\nIf you guess incorrectly you will receive a strike.\\nYou can also pass on a word. \\n\\nTo start a new game use start().\\nTo make guess use guess('word').\\nTo skip a word use pass().\\nTo show these instructions again use help().`\\n}\",\n \"function help () {\\n return `Welcome to Scramble. \\nThe game where you unscramble letters to make words.\\n\\nOnce you start the game, you will be given a scrambled word.\\nIf you correctly guess the word, you will receive a point.\\nIf you guess incorrectly you will receive a strike.\\nYou can also pass on a word. \\n\\nTo start a new game use start().\\nTo make guess use guess('word').\\nTo skip a word use pass().\\nTo show these instructions again use help().`\\n}\",\n \"function id(m) {\\n\\t var meaning = lang_1.isPresent(m.meaning) ? m.meaning : '';\\n\\t var content = lang_1.isPresent(m.content) ? m.content : '';\\n\\t return lang_1.escape(\\\"$ng|\\\" + meaning + \\\"|\\\" + content);\\n\\t}\",\n \"function help () {\\n return `Welcome to Scramble.\\nThe game where you unscramble letters to make words.\\n\\nOnce you start the game, you will be given a scrambled word.\\nIf you correctly guess the word, you will receive a point.\\nIf you guess incorrectly you will receive a strike.\\nYou can also pass on a word.\\n\\nTo start a new game use start().\\nTo make guess use guess('word').\\nTo skip a word use pass().\\nTo show these instructions again use help().`\\n}\",\n \"generate() {\\n const cmd = this.command;\\n const flags = util.sortBy(\\n Object.entries(cmd.flags || {})\\n .filter(([, v]) => !v.hidden)\\n .map(([k, v]) => {\\n v.name = k;\\n return v;\\n }),\\n (f) => [!f.char, f.char, f.name],\\n );\\n const args = (cmd.args || []).filter((a) => !a.hidden);\\n let output = util\\n .compact([\\n this.usage(flags),\\n this.args(args),\\n this.flags(flags),\\n this.description(),\\n this.aliases(cmd.aliases),\\n this.examples(cmd.examples || cmd.example),\\n this.docs(),\\n ])\\n .join('\\\\n\\\\n');\\n if (this.opts.stripAnsi) output = stripAnsi(output);\\n return output;\\n }\",\n \"function showHelpUsage() {\\n let helpString = \\\"Hei, olen Relluassari! Yritän auttaa sinua relaatioiden ratkonnassa ;) \\\\n\\\" +\\n \\\"<<< Koska olen vielä beta, älä pahastu jos en osaa jotain, tai kaadun kesken kaiken >>> \\\\n\\\" +\\n \\\" \\\\n Miten kutsua minut apuun? \\\\n \\\" +\\n \\\" TL;DR? Klikkaa tunnettua -> klikkaa tuntematonta -> klikkaa tuntematonta -> ... -> Repeat \\\\n\\\" +\\n \\\" \\\\nEli miten? \\\\n\\\" +\\n \\\" 1) Klikkaa graafista tunnettua sanaa \\\\n\\\" +\\n \\\" -> Relluassari tekee Wikipediasta, Bingistä, Wiktionarystä ja Ratkojista lähdehaut ko. sanalla. \\\\n\\\" +\\n \\\" 2) Kun haku valmis, klikkaa graafista tunnettuun kytkettyä tuntematonta sanaa \\\\n\\\" +\\n \\\" -> Relluassari parsii hakutuloksista klikatun pituiset sanat ja brutettaa rellua niillä. \\\\n\\\" +\\n \\\" 3) Kun brutetus valmis, klikkaa seuraavaa tunnettuun kytkettyä tuntematonta \\\\n\\\" +\\n \\\" -> Relluassari parsii hakutuloksista klikatun pituiset sanat ja brutettaa rellua niillä. \\\\n\\\" +\\n \\\" 4) Valitse uusi tunnettu sana lähteeksi ja siirry kohtaan 1) \\\\n\\\" +\\n \\\"\\\\nAdvanced usage: \\\\n\\\" +\\n \\\" Menu>Suorita lähdehaku (teemasana) - tekee lähdehaun vain teemasanalla \\\\n\\\" +\\n \\\" Menu>Suorita lähdehaku (oma sana) - tekee lähdehaun syöttämälläsi sanalla/sanoilla (esim. usean sanan hakuun Bingistä) \\\\n\\\" +\\n \\\" Menu>Parsi hakutulos sanoiksi - parsii hakutuloksesta *kaikkien* näkyvien tuntemattomien pituiset sanat \\\\n\\\" +\\n \\\" Menu>Bruteta sanalista - brutettaa rellua sen hetken muistissa olevalla koko sanalistalla \\\\n\\\";\\n alert(helpString);\\n}\",\n \"get format() {\\n\\t\\t// start with command name\\n\\t\\tlet response = this._name;\\n\\n\\t\\t// loop through parameters to add description\\n\\t\\tthis._parameters.forEach(\\n\\t\\t\\tfunction(param) {\\n\\t\\t\\t\\tresponse += \\\" (\\\" + param.description + \\\")\\\"\\n\\t\\t\\t}\\n\\t\\t);\\n\\n\\t\\t// add remainder description with slightly different symbols\\n\\t\\tif (this._remainderDescription) response += \\\" [\\\" + this._remainderDescription + \\\"]\\\"\\n\\n\\t\\treturn response;\\n\\t}\",\n \"function masterDerivationKeyToMnemonic(mdk) {\\n return mnemonicFromSeed(mdk);\\n}\",\n \"helpMessage() {\\n return \\\"*!who-knows *\\\\n\\\" +\\n \\\"Gibt eine Liste von Kollegen zurück, die den angegebenen Skill beherrschen.\\\\n\\\" +\\n \\\"Die Liste wird durch die API von HBT Power bereitgestellt, die Suche ist (noch) case sensitive.\\\\n\\\" +\\n \\\" Alias: !wer-weiß, !häää?, !who-knows, wat?\\\";\\n }\",\n \"function mnemButton(evt, mnemonic) {\\n let text = document.getElementById(\\\"textBox\\\").value;\\n if (text != '') {\\n text += '\\\\n';\\n }\\n text += mnemonic;\\n document.getElementById(\\\"textBox\\\").value = text;\\n}\",\n \"function generateReadme (answer) {\\n return `\\n# ${answer.title}\\n\\n\\n\\n# Table of Contents\\n\\n\\n- [Description](#description)\\n- [Installation](#installation)\\n- [Usage](#usage)\\n- [License](#license)\\n- [Contributing](#contributing)\\n- [Tests](#tests)\\n- [Questions](#questions)\\n\\n## Description:\\n This area is designed for leaving a report of what the project is and it's purpose.\\n ${answer.description}\\n\\n## Installation:\\n These are the necessary steps to follow/files to download that you need in order to run the application.\\n ${answer.installation}\\n\\n## Usage:\\n ${answer.usage}\\n\\n## License:\\n[](https://opensource.org/licenses/${answer.license})\\n\\n## Contributing:\\n ${answer.contributing}\\n\\n## Tests:\\n\\n\\n\\n\\n## Questions:\\n- GitHub: [${answer.username}](https://github.com/${answer.username})\\n- Email: Contact me @ ${answer.email} for any other questions you might have!\\n\\n `\\n\\n}\",\n \"function generateRandomMnemonic() {\\n return bip39.generateMnemonic(256);\\n}\",\n \"function toSyllable(){\\n if(syllables.length > 1){\\n currentColor = syllables[syllables.length-1].color;\\n }\\n document.getElementById(\\\"input\\\").innerHTML = syllableForm();\\n document.getElementById(\\\"meiOutput\\\").value = createMEIOutput();\\n}\",\n \"function displayHelpText() {\\n console.log();\\n console.log(' Usage: astrum figma [command]');\\n console.log();\\n console.log(' Commands:');\\n console.log(' info\\\\tdisplays current Figma settings');\\n console.log(' edit\\\\tedits Figma settings');\\n console.log();\\n}\",\n \"function generateMarkdown(answer) {\\n\\treturn `# ${answer.title}\\n## Description\\n${answer.description}\\n## Table of Contents\\n1. [Installation](#installation)\\n2. [Usage](#usage)\\n\\t1. [Testing](#test)\\n3. [Contribution](#contribution)\\n4. [Contact Me](#contact)\\n5. [License](#license)\\n## Installation \\n\\\\`\\\\`\\\\`bash\\n${answer.installation}\\n\\\\`\\\\`\\\\`\\n## Usage \\n${answer.usage}\\nTo run the tests: \\n\\\\`\\\\`\\\\`bash\\n${answer.test}\\n\\\\`\\\\`\\\\`\\n## Contribution \\n${answer.contributing}\\n## Have a question? \\n[Github Account](https://github.com/${answer.github})\\nEmail me at ${answer.email}\\n## License \\n${renderLicenseBadge(answer.license)}\\n\\n`;\\n}\",\n \"function code(c) {\\n return DEFINITIONS[c] || c.toUpperCase().charCodeAt(0);\\n }\",\n \"function code(c) {\\n return DEFINITIONS[c] || c.toUpperCase().charCodeAt(0);\\n }\",\n \"function getHelpMaster() {\\n var help = \\\"\\\\\\n #b (#public, set room as public) \\\\\\n #k {user} (#kick, kick a user out of current room) \\\\\\n #m {user} (#master, assign another room user as master) \\\\\\n #s {size} (#size, set room max size, 0 means no limit) \\\\\\n #v (#private, set room as private) \\\\\\n\\\";\\n return help;\\n }\",\n \"function createMnemonic(walletRPC, keyIncludes) {\\n\\tcreateAndOpenWallet(walletRPC, TheWalletName, function(walletRPC) {\\n\\t\\tgetMnemonic(walletRPC, keyIncludes, function(walletRPC, mnemonicOutput) {\\n\\t\\t\\tif (mnemonicOutput.keyIncluded) { return mnemonic; }\\n\\t\\t\\telse {\\n\\t\\t\\t\\tfs.unlink(\\\"./wallets/\\\"+TheWalletName+\\\".keys\\\", function() { // delete previous new-wallet.key\\n\\t\\t\\t\\t\\tfs.unlink(\\\"./wallets/\\\"+TheWalletName, function() { // delete previous new-wallet\\n\\t\\t\\t\\t\\t\\tcreateMnemonic(walletRPC, keyIncludes);\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t});\\n\\t});\\n\\t\\n}\",\n \"static fromString(mnemonic) {\\n return new Mnemonic(mnemonic.split(\\\" \\\"));\\n }\",\n \"function generateControlDefinition(ctrl, indent) {\\n const indented_1 = indentLevel(indent, 1);\\n let text = '';\\n text += generateControlDefintionBeginning(ctrl, indent);\\n text += generateLabeledControlProperties(ctrl, indented_1);\\n text += generateControlDefintionEnding(indent);\\n return text;\\n }\",\n \"function StringHelp() {\\n}\",\n \"function showState(state) {\\n\\treturn `[${state.content[0].show()} ${state.content[1].show()}]`;\\n}\",\n \"function qname(m)\\r\\n{\\r\\n\\treturn \\\"\\\\x22\\\" + m + \\\"\\\\x22\\\";\\r\\n}\",\n \"function symbol(name){\\r\\n return lexeme(string(name));\\r\\n}\",\n \"showGetMnemonicButton() {\\n return(\\n \\n \\n { mnemonicScreenConstants.mnemonicScreenExplanationText }\\n \\n \\n GET MNEMONIC\\n \\n \\n );\\n }\",\n \"describeKimfer() {\\n return `Meet ${this.name}! He has ${this.health} health points and a strength of ${this.strength}. He have ${this.xp} experience points`;\\n }\",\n \"function readInp(){\\n\\tvar inp = document.getElementById(\\\"cfg\\\").value;\\n\\tvar without = interpret(inp);\\n\\tvar SymSet = new SymbolSet(without);\\n\\tvar startSym = SymSet.findSym(\\\"S\\\");\\n\\tvar sentence = SymSet.writeSymbol(startSym);\\n\\t//console.log(sentence);\\n\\tdocument.getElementById(\\\"output\\\").innerHTML += \\\"
\\\" + sentence + \\\"
\\\";\\n}\",\n \"getHelp ( input, output ) {\\n output.standardOutput.writeLine( 'Usage:' );\\n this.getUsage().split( '\\\\n' ).forEach( line => output.standardOutput.writeLine( line ) );\\n output.standardOutput.writeLine( '' );\\n\\n if ( this.getDescription() ) {\\n output.standardOutput.writeLine( 'Description:' );\\n output.standardOutput.writeLine( this.getDescription() );\\n }\\n\\n output.standardOutput.writeLine( '' );\\n }\",\n \"get help() {\\n\\t\\tlet response = \\\"\\\"\\n\\t\\tif (this._description) { \\n\\t\\t\\tresponse = this._description; \\n\\t\\t}\\n\\n\\t\\tresponse += \\\" - Usage: \\\" + this.format;\\n\\t\\tresponse += \\\" - Ex: \\\" + this.example;\\n\\n\\t\\treturn response;\\n\\t}\",\n \"function explainPuzzle(){\\n\\tlet ed = display.explanationDisplay;\\n\\ted.innerHTML = underground.selected.explanationDisplay();\\n}\",\n \"function createLabelMaker(title, instructions, callback) {\\n var newStrP = new StringPad();\\n newStrP.open(title, instructions, callback);\\n }\",\n \"function writeInstructions() {\\n noStroke();\\n fill(252, 118, 172);\\n textSize(54)\\n text('my name is', width / 2, height / 3)\\n text('i was born in', width / 2, height * 1 / 2);\\n textSize(25);\\n text('click on your sign to get your horoscope!', width / 2, height * 2 / 3)\\n}\",\n \"function generateHaiku() {\\n // Make a DIV with the new sentence\\n var expansion = cfree.getExpansion('');\\n expansion = expansion.replace(/%/g, ' ');\\n var par = createP(expansion);\\n par.class('text');\\n}\",\n \"function XDisplaySentence(targetId, WordIdPrefix, punctuation) {\\n //alert('Display Function');\\n //Build the Sentence\\n var sentence = \\\"\\\".concat($(WordIdPrefix + LastSentenceSelections[0]).text(), \\\" \\\", $(WordIdPrefix + LastSentenceSelections[1]).text(), \\\" \\\", $(WordIdPrefix + LastSentenceSelections[2]).text(), \\\" \\\", $(WordIdPrefix + LastSentenceSelections[3]).text(), punctuation);\\n\\n $(targetId).text(sentence);//Display the sentence in the header\\n}\",\n \"function Term(hiragana, kanji, definition) {\\n this.hiragana_ = hiragana;\\n this.kanji_ = kanji;\\n this.definition_ = definition;\\n}\",\n \"function word(name, definition){\\n this.name = name;\\n this.definition = definition;\\n}\",\n \"get displayText PS_displayText() {\\n var {matchedName: sentence, _arguments: args} = this._verb;\\n for (let x in args) {\\n let obj = x === \\\"direct_object\\\";\\n let {text} = this._argSuggs[x] || 0;\\n if (text) sentence += (\\\" \\\" +\\n (obj ? \\\"\\\" : args[x].flag + \\\" \\\") +\\n (obj ? \\\"[ \\\" + text + \\\" ]\\\" : text));\\n }\\n return sentence;\\n }\",\n \"function help() {\\n console.log(\\n \\\"\\\\n\\\" +\\n \\\"STRUCTURE\\\" +\\n \\\"\\\\033[38;5;6m\\\" + \\\"\\\\n node liri.js (command) + (search(artist, concert, movie))\\\\n\\\" + \\\"\\\\033[0m\\\" +\\n \\\"\\\\nCOMMAND OPTIONS\\\" +\\n \\\"\\\\033[38;5;10m\\\" +\\n \\\"\\\\n spotify-this-song\\\" + \\\"\\\\033[0m\\\" + \\\" search for artist details\\\" +\\n \\\"\\\\033[38;5;10m\\\" +\\n \\\"\\\\n concert-this\\\" + \\\"\\\\033[0m\\\" + \\\" search for concert details\\\" +\\n \\\"\\\\033[38;5;10m\\\" +\\n \\\"\\\\n movie-this\\\" + \\\"\\\\033[0m\\\" + \\\" search for movie details\\\" +\\n \\\"\\\\033[38;5;10m\\\" +\\n \\\"\\\\n do-what-it-says\\\" + \\\"\\\\033[0m\\\" + \\\" run a search based on what is written in 'random.txt'\\\"\\n )\\n}\",\n \"function entry (name) {\\n let lastWord = env.compilationVocabulary.word;\\n env.compilationVocabulary.word = env.dp;\\n\\n memWriteNextByte(0); // flags\\n memWriteNextCell(lastWord); // link to previous word\\n memWriteNextString(name); // word name\\n}\",\n \"function getLabelDescriptions () {\\n return {\\n 'Walk' : {\\n 'id' : 'Walk',\\n 'text' : 'Walk'\\n },\\n 'StopSign' : {\\n 'id' : 'StopSign',\\n 'text' : 'Bus Stop Sign'\\n },\\n 'StopSign_OneLeg' : {\\n 'id' : 'StopSign_OneLeg',\\n 'text' : 'One-leg Stop Sign'\\n },\\n 'StopSign_TwoLegs' : {\\n 'id' : 'StopSign_TwoLegs',\\n 'text' : 'Two-leg Stop Sign'\\n },\\n 'StopSign_Column' : {\\n 'id' : 'StopSign_Column',\\n 'text' : 'Column Stop Sign'\\n },\\n 'StopSign_None' : {\\n 'id' : 'StopSign_None',\\n 'text' : 'Not provided'\\n },\\n 'Landmark_Shelter' : {\\n 'id' : 'Landmark_Shelter',\\n 'text' : 'Bus Stop Shelter'\\n },\\n 'Landmark_Bench' : {\\n 'id' : 'Landmark_Bench',\\n 'text' : 'Bench'\\n },\\n 'Landmark_TrashCan' : {\\n 'id' : 'Landmark_TrashCan',\\n 'text' : 'Trash Can / Recycle Can'\\n },\\n 'Landmark_MailboxAndNewsPaperBox' : {\\n 'id' : 'Landmark_MailboxAndNewsPaperBox',\\n 'text' : 'Mailbox / News Paper Box'\\n },\\n 'Landmark_OtherPole' : {\\n 'id' : 'Landmark_OtherPole',\\n 'text' : 'Traffic Sign / Pole'\\n }\\n }\\n}\",\n \"function label(node) {\\n var type = node.referenceType;\\n var value = type === 'full' ? node.identifier : '';\\n\\n return type === 'shortcut' ? value : '[' + value + ']';\\n}\",\n \"get abbrButton() {\\n return {\\n command: \\\"wrapRange\\\",\\n commandVal: \\\"ABBR\\\",\\n toggles: true,\\n label: \\\"Abbr\\\",\\n type: \\\"rich-text-editor-button\\\",\\n };\\n }\",\n \"function explainShortName(name, tTable) {\\n return \\\" title='\\\"+name+\\\"' \\\";\\n}\",\n \"function generateText(text) {\\n let mm = new MarkovMachine(text);\\n console.log(mm.makeText());\\n}\",\n \"function description(state) {\\n if(typeof state === \\\"object\\\") return \\\" \\\" + state.join(\\\" \\\");\\n var descr = \\\"\\\";\\n for(var i = 0, h = state.length - 1; h >= 0; --h) {\\n var hex = parseInt(state[h], 16);\\n if(hex & 1) descr += \\\" \\\" + root.predicates[i]; ++i;\\n if(hex & 2) descr += \\\" \\\" + root.predicates[i]; ++i;\\n if(hex & 4) descr += \\\" \\\" + root.predicates[i]; ++i;\\n if(hex & 8) descr += \\\" \\\" + root.predicates[i]; ++i;\\n }\\n return descr;\\n}\",\n \"getHelp() {\\n return {\\n syntax: `esm link source-path`,\\n short: `links the dependency from source-path to the current project. Links just the version specicifed in the source-path and semver compatible versions, nothitng else.`,\\n description: ``,\\n examples: [{\\n syntax: `esm link ../http2-server`,\\n short: `links the http2-server library to the current projects esm folder`,\\n }]\\n }\\n }\",\n \"function generateReadMe(answers) {\\n createkey(answers)\\n return `\\n${answers.title}\\n\\n${myIcon}\\n\\n## Description\\n${answers.description}\\n## Table of Contents\\n- [Description](#Description)\\n- [Installation_instructions](#Installation_instructions)\\n- [Usage](#Usage)\\n- [License](#License)\\n- [Contributors](#Contributors)\\n- [Testing](#Testing)\\n- [Questions](#Questions)\\n\\n## Installation_instructions\\n${answers.installation_instructions}\\n\\n## Usage\\n${answers.usage}\\n\\n${myImg}\\n\\nThis application is covered by the ${myIcon} license. \\n\\n${myLink}\\n\\n## Contributors\\n${answers.contributors}\\n\\n## Testing \\n${answers.testing}\\n\\n## Questions\\nEmail me with any questions: ${answers.email}\\n\\nGitHub: [${answers.GitHub}](https://github.com/${answers.GitHub})`\\n}\",\n \"static help() {\\n console.log(\\n`Usage: \\n\\\\nversion [ -v semver ] [-p [ 0 => PATCH, 1 => MINOR, 2 => MAJOR ] ]\\nE.g version -v 0.2.3 -p 1 ## 0.3.3\\n\\nversion [ -f file ] [ -d delimeter ]\\n `);\\n }\",\n \"make(m) {\\n\\t\\treturn [`%c[TCFS]:%c ${m}`, 'color: purple; font-weight: bold', ''];\\n\\t}\",\n \"title() { return this.owner.name + \\\" - \\\" + this.label.replace('\\\\n', ' ') }\",\n \"function generate (type) {\\n var chain = markovChain(type)\\n if (chain) {\\n return markovName(chain)\\n }\\n return ''\\n}\",\n \"function help() {\\n\\tvar commandsArray = ['Help: List of available commands', '>help', '>about', '>contact', '>ping', '>time', '>clear', '>say'];\\n\\tfor (var i = 0; i < commandsArray.length; i++) {\\n\\t\\tvar out = '' + commandsArray[i] + ' '\\n\\t\\tOutput(out);\\n\\t}\\n}\",\n \"generate() {\\n return {\\n instructions: 'instructions here',\\n question: 'question here',\\n diagram: 'diagram here',\\n answer: 'answer here',\\n }\\n }\",\n \"function generate_md(parsed_code, language, callback) {\\n var outfile,\\n outcode = '';\\n \\n for (var i = 0, l = parsed_code.length; i < l; i++) {\\n if (parsed_code[i].comment !== '') outcode += parsed_code[i].comment + '\\\\n\\\\n';\\n if (parsed_code[i].code !== '') outcode += '```' + language.name + '\\\\n' + parsed_code[i].code + '\\\\n```\\\\n\\\\n';\\n }\\n\\n callback(null, outcode);\\n}\",\n \"function CreateAbnfGrammar(myna) {\\r\\n // Setup a shorthand for the Myna parsing library object\\r\\n let m = myna; \\r\\n\\r\\n let g = new function() {\\t\\t\\r\\n\\t\\t// comment and whitespace\\r\\n\\t\\tthis.WSP = m.char(\\\" \\\\t\\\"); /* white space SP / HTAB */\\r\\n\\t\\t// comment \\t= \\\";\\\" *(WSP / VCHAR) CRLF\\r\\n\\t\\tthis.comment \\t= m.seq(\\\";\\\", m.advanceUntilPast(m.newLine));\\r\\n\\t\\tthis.c_nl = m.choice(m.newLine, this.comment); /* comment or newline */\\r\\n\\t\\tthis.c_wsp = m.choice(this.WSP, m.seq(this.c_nl, this.WSP)).zeroOrMore;\\r\\n\\t\\t\\r\\n\\t\\t// terminals\\r\\n\\t\\t// prose-val \\t= \\\"<\\\" *(%x20-3D / %x3F-7E) \\\">\\\"\\r\\n\\t\\tthis.prose_val = m.tagged(m.notChar('>').zeroOrMore).ast; /* bracketed string of SP and VCHAR without angles prose description, to be used as last resort */\\r\\n\\t\\tthis.hex_val = m.seq(\\\"x\\\", m.hexDigit.oneOrMore, m.choice(m.seq(\\\".\\\", m.hexDigit.oneOrMore).oneOrMore, m.seq(\\\"-\\\", m.hexDigit.oneOrMore)).opt);\\r\\n\\t\\tthis.dec_val = m.seq(\\\"d\\\", m.digit.oneOrMore, m.choice(m.seq(\\\".\\\", m.digit.oneOrMore).oneOrMore, m.seq(\\\"-\\\", m.digit.oneOrMore)).opt);\\r\\n\\t\\tthis.bin_val = m.seq(\\\"b\\\", m.binaryDigit.oneOrMore, m.choice(m.seq(\\\".\\\", m.binaryDigit.oneOrMore).oneOrMore, m.seq(\\\"-\\\", m.binaryDigit.oneOrMore)).opt); /* series of concatenated bit values or single ONEOF range */\\r\\n\\t\\tthis.num_val = m.seq(\\\"%\\\", m.choice(this.bin_val, this.dec_val, this.hex_val)).ast;\\r\\n\\t\\t// char-val \\t= DQUOTE *(%x20-21 / %x23-7E) DQUOTE\\r\\n\\t\\tthis.char_val = m.doubleQuoted(m.notChar('\\\"').oneOrMore).ast; /* quoted string of SP and VCHAR without DQUOTE */\\r\\n\\t\\t\\r\\n\\t\\tthis.rulename = m.seq(m.letter, m.choice(m.letter, m.digit, \\\"-\\\").zeroOrMore).ast;\\r\\n\\t\\t\\r\\n\\t\\t// patterns\\r\\n\\t\\tlet _this = this;\\r\\n\\t\\tthis.option = m.seq(\\\"[\\\", this.c_wsp, m.delay(function() { return _this.pattern; }), this.c_wsp, \\\"]\\\").ast;\\r\\n\\t\\tthis.group = m.seq(\\\"(\\\", this.c_wsp, m.delay(function() { return _this.pattern; }), this.c_wsp, \\\")\\\");\\t\\t\\r\\n\\t\\tthis.element = m.choice(this.rulename, this.group, this.option, this.char_val, this.num_val, this.prose_val);\\r\\n\\t\\tthis.repeat = m.choice(m.seq(m.digit.zeroOrMore, \\\"*\\\", m.digit.zeroOrMore), m.digit.oneOrMore).ast;\\r\\n\\t\\tthis.repetition = m.seq(this.repeat.opt, this.element).ast;\\r\\n\\t\\tthis.concatenation = m.seq(this.repetition, m.seq(this.c_wsp, this.repetition).zeroOrMore);\\r\\n\\t\\tthis.alternation\\t= m.seq(this.c_wsp, \\\"/\\\", this.c_wsp, this.concatenation).ast;\\r\\n\\t\\tthis.pattern \\t= m.seq(this.concatenation, this.alternation.zeroOrMore).ast;\\r\\n\\t\\t\\r\\n\\t\\t// rule\\r\\n\\t\\tthis.defined_as = m.choice(\\\"::=\\\", \\\":=\\\", \\\"=\\\").ast; /* basic rules definition; incremental alternatives \\\"=/\\\" is not supported */\\r\\n\\t\\tthis.rule = m.seq(this.rulename, this.c_wsp, this.defined_as, this.c_wsp, this.pattern, this.c_wsp, this.c_nl).ast; /* continues if next line starts with white space */\\r\\n\\t\\tthis.grammar\\t\\t= m.choice(this.rule, m.seq(this.c_wsp, this.c_nl)).oneOrMore.ast;\\r\\n };\\r\\n\\r\\n // Register the grammar, providing a name and the default parse rule\\r\\n return m.registerGrammar(\\\"abnf\\\", g, g.grammar);\\r\\n}\",\n \"helpInformation() {\\n let desc = [];\\n\\n if (this._description) {\\n desc = [this._description, ''];\\n const {\\n argsDescription\\n } = this;\\n\\n if (argsDescription && this._args.length) {\\n const width = this.padWidth();\\n desc.push('Arguments:');\\n desc.push('');\\n\\n this._args.forEach(({\\n name\\n }) => {\\n desc.push(` ${pad(name, width)} ${argsDescription[name]}`);\\n });\\n\\n desc.push('');\\n }\\n }\\n\\n let cmdName = this._name;\\n\\n if (this._alias) {\\n cmdName = `${cmdName}|${this._alias}`;\\n }\\n\\n const usage = [`Usage: ${cmdName} ${this.getUsage()}`, ''];\\n let cmds = [];\\n const commandHelp = this.commandHelp();\\n if (commandHelp) cmds = [commandHelp];\\n const options = ['Options:', `${this.optionHelp().replace(/^/gm, ' ')}`, ''];\\n return usage.concat(desc).concat(options).concat(cmds).join('\\\\n');\\n }\",\n \"function newAnchorLabel() {\\n count = ++that.anchor_count;\\n anchor_label = strval((count + 1)); //generating footnote number starting at 1 instead of 0\\n /* yil original letter generating label code\\n anchor_label = '';\\n do {\\n anchor_label = chr(ord('a') + (count % 26)) + anchor_label;\\n count = (int) floor(count / 26);\\n } while (count > 0);*/\\n return anchor_label;\\n }\",\n \"function TutorialInstruction({ commandName, iconName }) {\\n return (\\n \\n \\n {commandName}\\n \\n );\\n}\",\n \"function t(text) { return {'macro_name': 'plaintext', 'text': text}; }\",\n \"function showInstructions() {\\n\\t\\t\\tclear();\\n\\t\\t\\tdiv.update('' + lang.instructions + '');\\n\\t\\t}\",\n \"toString() {\\r\\n\\t\\treturn (this.ctrl? \\\"Ctrl+\\\":\\\"\\\") +\\r\\n\\t\\t\\t(this.alt? \\\"Alt+\\\":\\\"\\\") +\\r\\n\\t\\t\\t(this.shift? \\\"Shift+\\\":\\\"\\\") +\\r\\n\\t\\t\\tthis.name\\r\\n\\t}\",\n \"function showInstructions() {\\r\\n\\tconst INSTRUCTIONS = \\\"1. Identify the morphological boundaries. \\\" \\r\\n\\t\\t\\t\\t\\t + \\\"When you mouse over the word, grey slashes will appear in the spaces between the letters, indicating possible morphological boundaries.
\\\"\\r\\n\\t\\t\\t\\t\\t + \\\"a. To mark a morphological boundary, click on the space where you think the boundary is using your mouse.
\\\" \\r\\n\\t\\t\\t\\t\\t + \\\"b. Once you've made your selection, click on the check button to see whether you've identified the boundaries correctly.
\\\"\\r\\n\\t\\t\\t\\t\\t + \\\"c. If you've selected your boundaries correctly, the morphological categories of the word's components will automatically appear above the word.\\\"\\r\\n\\t\\t\\t\\t\\t + \\\"If you haven't, you will be given the opportunity to try again \\\"\\r\\n\\t\\t\\t\\t\\t + \\\"(remember, after three tries, the program will provide the correct answer).\\\"; \\r\\n\\tshowModal(INSTRUCTIONS, false);\\r\\n}\",\n \"toString() {\\n return this.symbol + \\\"_\\\" + this.subscript;\\n }\",\n \"get formula() { return this.ast ? this.ast.toString(this.id) : ''; }\",\n \"function createAnswer(state, currentFlow) {\\nvar flowText = 'Current Flow: ' + currentFlow + 'FT3/S';\\n$('#current-flow > .container').append(flowText).css('font-size', '18px').css('letter-spacing', '2px');\\n$('#answer > .container').text(state.toUpperCase());\\n}\",\n \"function displayStatement(nmbr){\\n stellingTitle.innerHTML = (nmbr + 1).toString() + '. ' + subjects[nmbr].title;\\n stellingDes.innerHTML = subjects[nmbr].statement;\\n}\",\n \"function drawManga('anime stories') {\\r\\n alert(Bakuman + 'is my favorite anime and Manga of all time');\\r\\n}\",\n \"commandHelp() {\\n if (!this.commands.length) return '';\\n const commands = this.prepareCommands();\\n const width = this.padWidth();\\n return ['Commands:', commands.map(cmd => {\\n const desc = cmd[1] ? ` ${cmd[1]}` : '';\\n return (desc ? pad(cmd[0], width) : cmd[0]) + desc;\\n }).join('\\\\n').replace(/^/gm, ' '), ''].join('\\\\n');\\n }\",\n \"function createText(text){\\n let mm = new markov.MarkovMachine(text)\\n console.log(mm.makeText())\\n}\",\n \"function generateSentence() {\\r\\n return selectChud()+' '+selectVerb()+' '+selectLefty()+' With '+selectAdjective()+' '+selectEnding();\\r\\n}\",\n \"function help() {\\n\\tvar commandsArray = ['Help: List of available commands',\\n\\t\\t'>about',\\n\\t\\t'>contact',\\n\\t\\t'>projects',\\n\\t\\t'>skills',\\n\\t\\t'>experiences',\\n\\t\\t'>help',\\n\\t\\t'>ping',\\n\\t\\t'>time',\\n\\t\\t'>clear',\\n\\t\\t'>say',\\n\\t\\t'>info',\\n\\t\\t'>exit'];\\n\\tseperator();\\n\\tfor (var i = 0; i < commandsArray.length; i++) {\\n\\t\\tvar out = '' + commandsArray[i] + ' '\\n\\t\\tOutput(out);\\n\\t}\\n}\",\n \"function madlib(verb, adj, noun) {\\n return `We shall ${verb.toUpperCase()} the ${adj.toUpperCase()} ${noun.toUpperCase()}`\\n}\",\n \"_renderInstructions(parseState) {\\n var firstQuestionNumber = parseState.firstQuestionRef;\\n var firstSentenceRef = parseState.firstSentenceRef;\\n var instructions = \\\"\\\";\\n\\n if (firstQuestionNumber) {\\n instructions += i18n._(\\\"The symbol %(questionSymbol)s indicates that question \\\" + \\\"%(questionNumber)s references this portion of the \\\" + \\\"passage.\\\", {\\n questionSymbol: \\\"[[\\\" + firstQuestionNumber + \\\"]]\\\",\\n questionNumber: firstQuestionNumber\\n });\\n }\\n\\n if (firstSentenceRef) {\\n instructions += i18n._(\\\" The symbol %(sentenceSymbol)s indicates that the \\\" + \\\"following sentence is referenced in a question.\\\", {\\n sentenceSymbol: \\\"[\\\" + firstSentenceRef + \\\"]\\\"\\n });\\n }\\n\\n var parsedInstructions = PassageMarkdown.parse(instructions);\\n return /*#__PURE__*/React$13.createElement(\\\"div\\\", {\\n className: \\\"perseus-widget-passage-instructions\\\"\\n }, PassageMarkdown.output(parsedInstructions));\\n }\",\n \"function generateMarkdown(answers) {\\n return `# ${title} \\\\n ${description} \\\\n ## Table of Contents \\\\n * [Installation Instructions](#Installation-Instructions) \\\\n * [Contribution Guidelines](#Contribution-Guidelines) \\\\n * [Testing Instructions](#Testing-Instructions) \\\\n * [Questions](#Questions) \\\\n * [License](#License) \\\\n ## Installation Instructions \\\\n ${installationInstructions} \\\\n ## Instructions for Use \\\\n ${usage} \\\\n ## Contribution Guidelines \\\\n ${contribution} \\\\n ## Testing Instructions \\\\n ${test} \\\\n ## Questions \\\\n * Github Username: ${github} \\\\n * Email: ${email} \\\\n * How to contact: ${contact}`;\\n }\",\n \"function symbolNode(value, height, depth, italic, skew, classes, style) {\\n this.value = value || \\\"\\\";\\n this.height = height || 0;\\n this.depth = depth || 0;\\n this.italic = italic || 0;\\n this.skew = skew || 0;\\n this.classes = classes || [];\\n this.style = style || {};\\n this.maxFontSize = 0;\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.63409716","0.6065563","0.5815374","0.5640102","0.562062","0.5616697","0.54599607","0.54352874","0.5415095","0.536314","0.5349442","0.53401595","0.5324772","0.52343404","0.5215487","0.5205382","0.51888996","0.51871806","0.51363534","0.51294446","0.5117688","0.51163834","0.5105172","0.50996596","0.50996596","0.50996596","0.5098203","0.5087997","0.50856286","0.5064781","0.5061929","0.5029022","0.49770063","0.4974142","0.4972839","0.49597374","0.49561375","0.49359974","0.4932485","0.49194548","0.49194548","0.49002144","0.48861986","0.48819327","0.4879831","0.48782623","0.48618427","0.48553473","0.485396","0.48517883","0.4846086","0.48441738","0.48386338","0.48317733","0.48262647","0.48256436","0.4823566","0.48228577","0.48083365","0.47979435","0.4791382","0.4784813","0.47788233","0.47741675","0.4772696","0.477115","0.4770628","0.4765253","0.47648275","0.47480747","0.47472155","0.47407162","0.4740495","0.47335255","0.47314972","0.4730208","0.4729313","0.4725378","0.47242868","0.47201604","0.47199857","0.47188136","0.47109795","0.47087482","0.47085428","0.4704255","0.46924525","0.46892148","0.4686013","0.46821612","0.46717408","0.46687335","0.46683806","0.4661652","0.4660013","0.4659648","0.4658101","0.4657112","0.4652982","0.46502313"],"string":"[\n \"0.63409716\",\n \"0.6065563\",\n \"0.5815374\",\n \"0.5640102\",\n \"0.562062\",\n \"0.5616697\",\n \"0.54599607\",\n \"0.54352874\",\n \"0.5415095\",\n \"0.536314\",\n \"0.5349442\",\n \"0.53401595\",\n \"0.5324772\",\n \"0.52343404\",\n \"0.5215487\",\n \"0.5205382\",\n \"0.51888996\",\n \"0.51871806\",\n \"0.51363534\",\n \"0.51294446\",\n \"0.5117688\",\n \"0.51163834\",\n \"0.5105172\",\n \"0.50996596\",\n \"0.50996596\",\n \"0.50996596\",\n \"0.5098203\",\n \"0.5087997\",\n \"0.50856286\",\n \"0.5064781\",\n \"0.5061929\",\n \"0.5029022\",\n \"0.49770063\",\n \"0.4974142\",\n \"0.4972839\",\n \"0.49597374\",\n \"0.49561375\",\n \"0.49359974\",\n \"0.4932485\",\n \"0.49194548\",\n \"0.49194548\",\n \"0.49002144\",\n \"0.48861986\",\n \"0.48819327\",\n \"0.4879831\",\n \"0.48782623\",\n \"0.48618427\",\n \"0.48553473\",\n \"0.485396\",\n \"0.48517883\",\n \"0.4846086\",\n \"0.48441738\",\n \"0.48386338\",\n \"0.48317733\",\n \"0.48262647\",\n \"0.48256436\",\n \"0.4823566\",\n \"0.48228577\",\n \"0.48083365\",\n \"0.47979435\",\n \"0.4791382\",\n \"0.4784813\",\n \"0.47788233\",\n \"0.47741675\",\n \"0.4772696\",\n \"0.477115\",\n \"0.4770628\",\n \"0.4765253\",\n \"0.47648275\",\n \"0.47480747\",\n \"0.47472155\",\n \"0.47407162\",\n \"0.4740495\",\n \"0.47335255\",\n \"0.47314972\",\n \"0.4730208\",\n \"0.4729313\",\n \"0.4725378\",\n \"0.47242868\",\n \"0.47201604\",\n \"0.47199857\",\n \"0.47188136\",\n \"0.47109795\",\n \"0.47087482\",\n \"0.47085428\",\n \"0.4704255\",\n \"0.46924525\",\n \"0.46892148\",\n \"0.4686013\",\n \"0.46821612\",\n \"0.46717408\",\n \"0.46687335\",\n \"0.46683806\",\n \"0.4661652\",\n \"0.4660013\",\n \"0.4659648\",\n \"0.4658101\",\n \"0.4657112\",\n \"0.4652982\",\n \"0.46502313\"\n]"},"document_score":{"kind":"string","value":"0.58402765"},"document_rank":{"kind":"string","value":"2"}}},{"rowIdx":3081,"cells":{"query":{"kind":"string","value":"Output all of the mnemonic for display"},"document":{"kind":"string","value":"function outputMnemonics(pageFile, fltCompName)\n{\n ccdd.writeToFileLn(pageFile, \"# Mnemonics\");\n\n // Step through each of the structure table rows\n for (var row = 0; row < ccdd.getStructureTableNumRows(); row++)\n {\n // Initialize the header name array values to blanks\n fullHeaderNames[row] = \"\";\n headerNames[row] = \"\";\n }\n\n // Step through each row in the table\n for (row = 0; row < ccdd.getStructureTableNumRows(); row++)\n {\n // Output the mnemonic for this row in the data table\n var isOutput = outputMnemonic(pageFile, row, fltCompName);\n\n // Check if a mnemonic definition was output to the file\n if (isOutput)\n {\n // Add an end of line to file to get ready for next line\n ccdd.writeToFileLn(pageFile, \"\");\n }\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function showAll (text) {\n\n\tasciify.getFonts(function (err, fonts) {\n\t\tif (err) { return console.error(err); }\n\n\t\tvar padSize = ('' + fonts.length).length;\n\n\t\tfonts.forEach(function(font, index) {\n\t\t\tvar opts = {\n\t\t\t\tfont: font,\n\t\t\t\tcolor: argv.color\n\t\t\t};\n\n\t\t\tasciify(exampleText, opts, function (err, result) {\n\t\t\t\tconsole.log(pad(padSize, index+1, '0') + ': ' + font);\n\t\t\t\tconsole.log(result);\n\t\t\t\tconsole.log('');\n\t\t\t});\n\t\t});\n\t});\n}","function generateMnemonic() {\n const mnemonic = bip39.generateMnemonic();\n return mnemonic.split(\" \").slice(0, 3).join(\" \");\n}","function showInstructions() {\n\t\t\tclear();\n\t\t\tdiv.update('' + lang.instructions + '');\n\t\t}","displayAll() {\n for (var i = 0; i < Object.getOwnPropertyNames(this).length; i++) {\n this.displayKey(Object.getOwnPropertyNames(this)[i])\n }\n }","function help() {\n printLine('The following commands work. Hover them for more information.');\n printLine('' +\n ' help,' +\n ' clear,' +\n ' ls,' +\n ' tree,' +\n ' cd ' +\n 'dirname,' +\n ' cat ' +\n 'filename'\n );\n printLine(' ');\n printLine('You can also use the' +\n ' Up and' +\n ' Down' +\n ' keys to navigate through your command history.'\n );\n printLine('You can click on tree nodes if CLI is not your thing.' +\n ' You\\'ll still need to hit Enter.'\n );\n}","displayCmd() {\r\n var cmdText = \"Commands \\n\";\r\n for (let i = 0; i < this.cmdOrder.length; ++i) {\r\n cmdText += this.cmdOrder[i] + \": \";\r\n cmdText += keyboardMap[this.cmdKeyCode[this.cmdIdx[this.cmdOrder[i]]]];\r\n cmdText += \"\\n\";\r\n }\r\n this.document.getElementById('commands').innerText = cmdText;\r\n }","function help() {\n\tvar commandsArray = ['Help: List of available commands', '>help', '>about', '>contact', '>ping', '>time', '>clear', '>say'];\n\tfor (var i = 0; i < commandsArray.length; i++) {\n\t\tvar out = '' + commandsArray[i] + ' '\n\t\tOutput(out);\n\t}\n}","function outputMnemonic(pageFile, row, fltCompName)\n{\n var isOutput = false;\n var itosFormat = \"\";\n\n var variableName = ccdd.getStructureVariableName(row);\n var dataType = ccdd.getStructureDataType(row);\n\n // Get the ITOS encoded form of the data type\n var itosEncode = ccdd.getITOSEncodedDataType(dataType, \"BIG_ENDIAN\");\n\n // Check if this data type is a recognized base type or structure\n if (itosEncode != null)\n {\n // Check if the data type is a primitive (not a structure)\n if (!itosEncode.equals(dataType))\n {\n // Get the ITOS output format string based on the encoding\n itosFormat = setITOSFormatFlag(itosEncode);\n }\n\n // Get the variable name and array size\n var arraySize = ccdd.getStructureArraySize(row);\n var fullVariableName = ccdd.getFullVariableName(row);\n \n // See if this row would exceed the maximum. If so start another column\n nextRow(pageFile, variableName, fullVariableName, row);\n\n // Get the full variable name (including the variable's structure path)\n var tmp = ccdd.getFullVariableName(row, \" \");\n \n // Find number of spaces (i.e. \" \") in tmp and makes prepad a string\n // containing only that many spaces\n var prepad = new java.lang.String(String(tmp.match(/ /g))).replaceAll(\"[\\\\,]\", \"\");\n var len = 0;\n\n // Only output non-array variables or array members (i.e., skip array\n // definitions)\n if (isVariable(variableName, arraySize))\n {\n // In case this is an array member replace the square brackets\n variableName = convertArrayMember(variableName);\n \n // Create the mnemonic definition\n var fullVariableName2 = prepad + fltCompName + fullVariableName;\n len = prepad.length() + variableName.length();\n \n // Check if the data type is a structure\n if (itosEncode.equals(dataType))\n {\n nextColumnHeader = prepad + variableName;\n lastSubStructureName = nextColumnHeader;\n headerNames[row] = lastSubStructureName;\n fullHeaderNames[row] = fullVariableName;\n ccdd.writeToFileLn(pageFile, \"(+, \" + columnOffset + \", \\\"\" + nextColumnHeader + \"\\\")\");\n }\n // Not a structure; it's a primitive type\n else\n {\n if (isArrayElement(arraySize))\n {\n var maxDigits = Math.ceil(Math.log(arraySize) / Math.LN10);\n var digitPad = new Array(maxDigits + 1).join(\" \");\n\n // Output number with leading spaces\n var index = getIndex(variableName);\n var indexPadded = index.toString().padLeft(maxDigits);\n\n inMiddleOfArray = true;\n var arrayPad = 13;\n\n // This item is first on a row\n if (index % modNum != 0)\n {\n ccdd.writeToFileLn(pageFile, fullVariableName2 + \"(=, +, \\\" :v\" + itosFormat + \":\\\", raw)\");\n len = 0;\n }\n // This array item is NOT first item on a row\n else\n {\n var lastIndex = Math.min(arraySize - 1, +index + +modNum - 1).toString().padLeft(digitPad);\n var arrayMessage = new java.lang.String(String(prepad + \"[\" + indexPadded + \"-\" + lastIndex + \"]\"));\n len = arrayMessage.length() + (numITOSDigits + 1) * Math.min(modNum, arraySize);\n ccdd.writeToFileLn(pageFile, fullVariableName2 + \"(+, \" + columnOffset + \", \\\"\" + arrayMessage + \" :v\" + itosFormat + \":\\\", raw)\");\n }\n\n if (index != +arraySize - 1 && (+index + 1) % modNum != 0)\n {\n rowCount = +rowCount - 1;\n }\n\n if (index == (+arraySize - 1))\n {\n inMiddleOfArray = false;\n nextColumnHeader = lastSubStructureName;\n }\n }\n // Not an array item, print normally\n else\n {\n ccdd.writeToFileLn(pageFile, fullVariableName2 + \"(+, \" + columnOffset + \", \\\"\" + prepad + variableName + \" :v\" + itosFormat + \":\\\", raw)\");\n\n len = prepad.length() + variableName.length() + numITOSDigits + 2;\n }\n }\n\n isOutput = true;\n }\n else\n {\n nextColumnHeader = prepad + variableName + \"[\" + arraySize + \"] - \" + itosEncode;\n len = new java.lang.String(String(nextColumnHeader)).length();\n ccdd.writeToFileLn(pageFile, \"array_fmt(+, \" + columnOffset + \", \\\"\" + nextColumnHeader + \"\\\")\");\n }\n\n if (maxColumnLength < +len)\n {\n ccdd.writeToFileLn(pageFile, \"## col_max_len is now = \" + len + \" (was \" + maxColumnLength + \")\");\n maxColumnLength = +len;\n }\n }\n else\n {\n ccdd.writeToFileLn(pageFile, \"#### NOT printing \" + variableName);\n }\n\n return isOutput;\n}","displayWordInfo() {\r\n this.displayHangman();\r\n this.displayLives();\r\n this.displayLetters();\r\n this.displayLettersToGuess();\r\n }","function displayHelpText() {\n console.log();\n console.log(' Usage: astrum figma [command]');\n console.log();\n console.log(' Commands:');\n console.log(' info\\tdisplays current Figma settings');\n console.log(' edit\\tedits Figma settings');\n console.log();\n}","function help() {\n\tvar commandsArray = ['Help: List of available commands',\n\t\t'>about',\n\t\t'>contact',\n\t\t'>projects',\n\t\t'>skills',\n\t\t'>experiences',\n\t\t'>help',\n\t\t'>ping',\n\t\t'>time',\n\t\t'>clear',\n\t\t'>say',\n\t\t'>info',\n\t\t'>exit'];\n\tseperator();\n\tfor (var i = 0; i < commandsArray.length; i++) {\n\t\tvar out = '' + commandsArray[i] + ' '\n\t\tOutput(out);\n\t}\n}","function printInstructions(){\n console.log(\"\\nHello! My Name is Liri. I am an AI assistant.\");\n console.log(\"I can perform the following tasks:\");\n console.log(`\\n\"my-tweets\": This command will return Yuen's latest tweets.`);\n console.log(`\\n\"spotify-this-song\": This command will return information about a song of your choice.`);\n console.log(`\\n\"movie-this\": This command will return information about a movie of your choice.`);\n console.log(`\\n\"do-what-it-says\": This command will perform a random command on a predefined query`);\n console.log(`-------------------`);\n}","function showUsedLetters() {\n\t\t$(displayLetters).html(usedLetters.sort().join(\"\\xa0\\xa0\"));\n\t}","function displayAll() {\n\n\t// get information\n\tvar firstCorpus = getFirstCorpus();\n\tvar firstAlignType = getFirstAlignType();\n\tif (firstCorpus === 'error') console.log(\"[Error] 存取文獻集名稱錯誤，系統上已無文本。\");\n\tif (firstAlignType === 'error') console.log(\"[Error] 存取段落對讀設定錯誤，系統上已無文本。\");\n\n\t// para setting\n\t_para['metadata'] = 'filename';\n\t_para['aligntype'] = firstAlignType;\n\t_para['corpus'] = firstCorpus;\n\t_para['mode'] = 'DocOrder';\n\n\t// display\n\tdisplayDocuManager();\n\tdisplayMetadataList(_para['metadata']);\n\tdisplayAlignTypeList(_para['aligntype']);\n\tdisplaySearchCorpus(_para['corpus']);\n\tdisplaySearchMode(_para['mode']);\n\tdisplayCompareContent(_para['metadata'], _para['aligntype']);\n}","showMnemonic() {\n this.setState({ showMnemonic: true });\n }","displayLetters() {\r\n let wordHidden = \"\\n\";\r\n for (let i = 0; i < this.text.length; i++) {\r\n if (this.lettersToGuess.includes(this.text.charAt(i))) {\r\n wordHidden += HangmanUtils.symbol;\r\n }\r\n else {\r\n wordHidden += this.text.charAt(i);\r\n }\r\n wordHidden += \" \";\r\n }\r\n console.log(wordHidden);\r\n }","function show(){\n\tconsole.log(\"Wins \" + wins);\n\tconsole.log(\"Losses \" + losses);\n\tconsole.log(\"Guesses left \" + guessLeft);\n\tconsole.log(newWord.displayValue());\n\tconsole.log(letterArray);\n}","function mnemButton(evt, mnemonic) {\n let text = document.getElementById(\"textBox\").value;\n if (text != '') {\n text += '\\n';\n }\n text += mnemonic;\n document.getElementById(\"textBox\").value = text;\n}","function printKey() {\n\t\tvar tableHtml = \"
\";\n\t\tfor (var i = 0; i < 25; i = i + 5) {\n\t\t\ttableHtml += \"
\";\n\t\t\tvar row = keyPhrase.substring(i, i + 5);\n\t\t\tvar chars = row.split(\"\");\n\t\t\tfor (var x = 0; x < 5; x++) {\n\t\t\t\ttableHtml += \"
\" + chars[x] + \"
\";\n\t\t\t}\n\t\t\ttableHtml += \"
\";\n\t\t}\n\t\ttableHtml += \"
\";\n\t\t$(\"#keyTable\").html(tableHtml);\n\t}","function help () {\n return `INSTRUCTIONS:\n Blacksmith is a simple text base game. \n \n As a blacksmith you convert ore and wood into swords and axes. You buy your resources using gold and sell your weapons for gold.\n \n COMMANDS:\n - buy(item)\n - make(item)\n - sell(item)\n - fire()\n - inventory()\n - help()`\n }","show() {\n\t\tlet self=this;\n\t\tfor(let i in self.queue) {\n\t\t\tlet indent=0;\n\t\t\tself.prettyCommandObject(self.queue[i],indent);\n\t\t\tfor(let j in self.queue[i].commands) {\n\t\t\t\tindent++;\n\t\t\t\tself.prettyCommandObject(self.queue[i].commands[j],indent);\n\n\t\t\t}\n\t\t}\n\t}","function showHelpUsage() {\n let helpString = \"Hei, olen Relluassari! Yritän auttaa sinua relaatioiden ratkonnassa ;) \\n\" +\n \"<<< Koska olen vielä beta, älä pahastu jos en osaa jotain, tai kaadun kesken kaiken >>> \\n\" +\n \" \\n Miten kutsua minut apuun? \\n \" +\n \" TL;DR? Klikkaa tunnettua -> klikkaa tuntematonta -> klikkaa tuntematonta -> ... -> Repeat \\n\" +\n \" \\nEli miten? \\n\" +\n \" 1) Klikkaa graafista tunnettua sanaa \\n\" +\n \" -> Relluassari tekee Wikipediasta, Bingistä, Wiktionarystä ja Ratkojista lähdehaut ko. sanalla. \\n\" +\n \" 2) Kun haku valmis, klikkaa graafista tunnettuun kytkettyä tuntematonta sanaa \\n\" +\n \" -> Relluassari parsii hakutuloksista klikatun pituiset sanat ja brutettaa rellua niillä. \\n\" +\n \" 3) Kun brutetus valmis, klikkaa seuraavaa tunnettuun kytkettyä tuntematonta \\n\" +\n \" -> Relluassari parsii hakutuloksista klikatun pituiset sanat ja brutettaa rellua niillä. \\n\" +\n \" 4) Valitse uusi tunnettu sana lähteeksi ja siirry kohtaan 1) \\n\" +\n \"\\nAdvanced usage: \\n\" +\n \" Menu>Suorita lähdehaku (teemasana) - tekee lähdehaun vain teemasanalla \\n\" +\n \" Menu>Suorita lähdehaku (oma sana) - tekee lähdehaun syöttämälläsi sanalla/sanoilla (esim. usean sanan hakuun Bingistä) \\n\" +\n \" Menu>Parsi hakutulos sanoiksi - parsii hakutuloksesta *kaikkien* näkyvien tuntemattomien pituiset sanat \\n\" +\n \" Menu>Bruteta sanalista - brutettaa rellua sen hetken muistissa olevalla koko sanalistalla \\n\";\n alert(helpString);\n}","function writeInstructions() {\n noStroke();\n fill(252, 118, 172);\n textSize(54)\n text('my name is', width / 2, height / 3)\n text('i was born in', width / 2, height * 1 / 2);\n textSize(25);\n text('click on your sign to get your horoscope!', width / 2, height * 2 / 3)\n}","function show() {\n best.html(population.pop[0].genes);\n averageFitness.html(population.averageFitness);\n generationNum.html(gNum);\n phrases.html(\"\");\n\n var phrs = \"\";\n\n for (let i = 1; i < population.pop.length && i < nPhrases.val(); i++) {\n phrs += '' + population.pop[i].genes.join(\"\") + '';\n }\n\n phrases.html(phrs);\n }","displayInConsole() {\n console.log(\"{ name: \" + this.name + \", colors: \" + this.colors + \", manaCost: \" + this.manaCost + \", type: \" + this.modifier + \", TCGPlayer price: \" + this.tcgprice + \", Card Kingdom price: \" + this.ckprice);\n }","generate() {\n const cmd = this.command;\n const flags = util.sortBy(\n Object.entries(cmd.flags || {})\n .filter(([, v]) => !v.hidden)\n .map(([k, v]) => {\n v.name = k;\n return v;\n }),\n (f) => [!f.char, f.char, f.name],\n );\n const args = (cmd.args || []).filter((a) => !a.hidden);\n let output = util\n .compact([\n this.usage(flags),\n this.args(args),\n this.flags(flags),\n this.description(),\n this.aliases(cmd.aliases),\n this.examples(cmd.examples || cmd.example),\n this.docs(),\n ])\n .join('\\n\\n');\n if (this.opts.stripAnsi) output = stripAnsi(output);\n return output;\n }","function showSymbols(e) {\n let letters = findSymbols(e.target.value, names, nameMap);\n let list = '';\n for (const index in letters) {\n list +=\n `
${letters[index][0]}
` +\n ``;\n }\n nameList.innerHTML = list;\n}","function showInstructions() {\r\n\tconst INSTRUCTIONS = \"1. Identify the morphological boundaries. \" \r\n\t\t\t\t\t + \"When you mouse over the word, grey slashes will appear in the spaces between the letters, indicating possible morphological boundaries.
\"\r\n\t\t\t\t\t + \"a. To mark a morphological boundary, click on the space where you think the boundary is using your mouse.
\" \r\n\t\t\t\t\t + \"b. Once you've made your selection, click on the check button to see whether you've identified the boundaries correctly.
\"\r\n\t\t\t\t\t + \"c. If you've selected your boundaries correctly, the morphological categories of the word's components will automatically appear above the word.\"\r\n\t\t\t\t\t + \"If you haven't, you will be given the opportunity to try again \"\r\n\t\t\t\t\t + \"(remember, after three tries, the program will provide the correct answer).\"; \r\n\tshowModal(INSTRUCTIONS, false);\r\n}","kanaToDisplayForLesson(lesson) {\n const lessonWithKanaObjects = [];\n lesson.map(syllable =>\n lessonWithKanaObjects.push(new KanaSyllable(syllable.alphabet, syllable.consonant, syllable.vowel)));\n\n return lessonWithKanaObjects[0].display();\n }","help() {\n const lines = [];\n if (this.banner) { lines.unshift(`${this.banner}\\n`); }\n for (const rule of Array.from(this.rules)) {\n let spaces = 15 - rule.longFlag.length;\n spaces = spaces > 0 ? repeat(' ', spaces) : '';\n const letPart = rule.shortFlag ? `${rule.shortFlag}, ` : ' ';\n lines.push(` ${letPart}${rule.longFlag}${spaces}${rule.description}`);\n }\n return `\\n${lines.join('\\n')}\\n`;\n }","function keystroke_menu() {\n var htmlstr = '
Keystroke commands for selected readings
Click the pen to enable reading ' +\n 'selection. Readings can be selected by clicking, or by dragging across ' +\n 'the screen in edit mode. Press any of the following keys to take the ' +\n 'corresponding action:
Double-click a reading to access its properties; drag a reading to another one to create a relationship. For fuller documentation see the \"About/Help\" link.
';\n return htmlstr;\n}","function print_mac(n)\n{\n\tvar str=\"\";\n\tvar j;\n\n\tfor(i=1;i<7;i++)\n\t{\n\t\tif(i==6) j=6;\n\t\telse j=i+1;\n\n\t\tstr+=\"\";\n\t\tif(i!=6) str+=\" : \";\n\n\t}\n\tdocument.write(str);\n}","get displayText PS_displayText() {\n var {matchedName: sentence, _arguments: args} = this._verb;\n for (let x in args) {\n let obj = x === \"direct_object\";\n let {text} = this._argSuggs[x] || 0;\n if (text) sentence += (\" \" +\n (obj ? \"\" : args[x].flag + \" \") +\n (obj ? \"[ \" + text + \" ]\" : text));\n }\n return sentence;\n }","show() {\n console.log(`id\\t${this.name}`);\n for (const [key, value] of this.entries()) {\n console.log(key, value);\n }\n }","function printUsage(){\n\tconsole.log('Usage: ');\n\tconsole.log('node sag_coder.js encode /this/will/be/the/input/file');\n\tconsole.log('node sag_coder.js encode /this/will/be/the/input/file /this/will/be/the/output/file');\n\tconsole.log('');\n\tconsole.log('node sag_coder.js decode /this/will/be/the/input/file');\n\tconsole.log('node sag_coder.js decode /this/will/be/the/input/file /this/will/be/the/output/file');\n}","function showHelpText() {\n ctx.save();\n\n if (lastUsedInput === 'keyboard') {\n setFont(18);\n ctx.fillStyle = 'white';\n ctx.fillText(translation.spacebar + ' ' + translation.select, 28 - fontMeasurement, kontra.canvas.height - 25 + fontMeasurement / 2.5);\n }\n else if (lastUsedInput === 'gamepad') {\n drawAButton(28, kontra.canvas.height - 25);\n setFont(18);\n ctx.fillStyle = 'white';\n ctx.fillText(translation.select, 28 + fontMeasurement * 1.75, kontra.canvas.height - 25 + fontMeasurement / 2.5);\n }\n\n ctx.restore();\n}","outputKey(key) {\n return \"[[[output of \" + key + \"]]]\";\n }","function help() {\n console.log(\n \"\\n\" +\n \"STRUCTURE\" +\n \"\\033[38;5;6m\" + \"\\n node liri.js (command) + (search(artist, concert, movie))\\n\" + \"\\033[0m\" +\n \"\\nCOMMAND OPTIONS\" +\n \"\\033[38;5;10m\" +\n \"\\n spotify-this-song\" + \"\\033[0m\" + \" search for artist details\" +\n \"\\033[38;5;10m\" +\n \"\\n concert-this\" + \"\\033[0m\" + \" search for concert details\" +\n \"\\033[38;5;10m\" +\n \"\\n movie-this\" + \"\\033[0m\" + \" search for movie details\" +\n \"\\033[38;5;10m\" +\n \"\\n do-what-it-says\" + \"\\033[0m\" + \" run a search based on what is written in 'random.txt'\"\n )\n}","async print() {\n\t\tfor (let i = 0; i < 9; i++) {\n\t\t\tfor (let j = 0; j < 9; j++) {\n\t\t\t\tlet index = i * 9 + j\n\t\t\t\tlet value = '*'\n\t\t\t\tif (this.cells[index].possibilities.length === 0) {\n\t\t\t\t\tvalue = '!'\n\t\t\t\t} else if (this.cells[index].possibilities.length === 1) {\n\t\t\t\t\tvalue = `${this.cells[index].possibilities[0]}`\n\t\t\t\t}\n\t\t\t\tif (j % 3 === 2 && j !== 8) {\n\t\t\t\t\tvalue += ' |'\n\t\t\t\t}\n\t\t\t\tawait Deno.writeAll(Deno.stdout, new TextEncoder().encode(`${value} `))\n\t\t\t}\n\t\t\tif (i % 3 == 2 && i !== 8) {\n\t\t\t\tconsole.log('\\n---------------------')\n\t\t\t} else {\n\t\t\t\tconsole.log('')\n\t\t\t}\n\t\t}\n\t}","function info() {\n\tseperator();\n\tOutput('>info: ');\n\tOutput('Console simulator by Mario Duarte https://codepen.io/MarioDesigns/pen/JbOyqe');\n}","function display() {\n\tfor (let key in this.dataStore) {\n\t\tconsole.log(`${key} ${this.dataStore[key]}`);\n\t}\n}","addphrasetoDisplay(){\n const phraseUL = document.querySelector('#phrase ul');\n this.phrase.forEach(letter => {\n if(letter.match(/^\\s+$/)){\n phraseUL.innerHTML += `\n
\n `;\n } else{\n phraseUL.innerHTML += `\n
${letter.toUpperCase()}
`;\n }\n })\n }","function help() {\n console.log(\" \");\n console.log(\n \" ╔════════════════════════════════════════════════════════════════════════╗\"\n .rainbow\n );\n console.log(\n \" ║ ║\"\n .rainbow\n );\n console.log(\n \" ║ Hi my name is LUIRI, like Siri but better, Ill be assisting you... ║\"\n .rainbow\n );\n console.log(\n \" ║ ║\"\n .rainbow\n );\n console.log(\n \" ╠════════════════════════════════════════════════════════════════════════╣\"\n .rainbow\n );\n console.log(\n \" ║ To see your tweets: luiri tweets ║\"\n .red\n );\n console.log(\n ' ║ To track a tweet: luiri twitterTrack \"word\" ║'\n .red\n );\n console.log(\n ' ║ To search for a song: luiri spotify \"song name\" ║'\n .green\n );\n console.log(\n ' ║ To search for a movie: luiri movie \"movie name\" ║'\n .yellow\n );\n console.log(\n \" ║ Saved: luiri saved ║\"\n .blue\n );\n console.log(\n \" ║ To view the log: luiri log ║\"\n .green\n );\n console.log(\n \" ╚════════════════════════════════════════════════════════════════════════╝\"\n .rainbow\n );\n}","function getMnemonic(walletRPC, keyIncludes, chain) {\n\twalletRPC.mnemonic()\n\t\t.then(mnemonic => {\n\t\t\tconsole.log(\"Your mnemonic is: \"+mnemonic.key)\n\t\t\tchain(walletRPC, { keyIncluded: mnemonic.key.includes(keyIncludes), mnemonic:mnemonic.key })\n\t\t})\n\t\t.catch(err => {\n\t\t\tconsole.error(err);\n\t\t});\n}","function getPopupText(output){\n\t\tvar result = \"\";\n\t\tfor(var attr in output){\n\t\t\tif(attr == 'operator_id'){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(output.hasOwnProperty(attr)){\n\t\t\t\tvar splitString = attr.split(\"_\");\n\t\t\t\tfor(var splitPart in splitString){\n\t\t\t\t\tresult += ' ' + splitString[splitPart].charAt(0).toUpperCase() + splitString[splitPart].slice(1);\n\t\t\t\t}\n\t\t\t\tresult += \": \";\n\t\t\t\tresult += '' + output[attr] + '' + ' ';\n\t\t\t}\n\t\t}\n\t\tresult += ' ';\n\t\treturn result;\n\t}","function printAnswer(){\n var print = \" \";\n for (var i = 0; i < answer.length; i++) {\n print = print.concat(answer[i].toUpperCase());\n }\n document.getElementById(\"updateScreen\").innerText = \" Name: \" + print;\n}","function showCode() {\n\t\t\t//Reset game\n\t\t\tabortGame();\n\t\t\tvm.secretCode = Mastermind.secretCode();\n\t\t}","function Kenalan () {\n console.log(`Nama Saya, Jane`)\n console.log(`Saya Suka Masak`)\n console.log(`Sekian`)\n}","function printPin(pin) {\n console.log(\"Scan this code with your HomeKit App on your iOS device:\");\n console.log(\"\\x1b[30;47m%s\\x1b[0m\", \" \");\n console.log(\"\\x1b[30;47m%s\\x1b[0m\", \" ┌────────────┐ \");\n console.log(\"\\x1b[30;47m%s\\x1b[0m\", \" │ \" + pin + \" │ \");\n console.log(\"\\x1b[30;47m%s\\x1b[0m\", \" └────────────┘ \");\n console.log(\"\\x1b[30;47m%s\\x1b[0m\", \" \");\n}","getHelpText(){\n return \"Tree Authoring Shell: Commands: cd {id} | @{id}. set tag {tags} | #{tag}, set value {variable} {value} | ${variable}: {value}, rm {id}, link {id} {id} | {id} > {id}, stash, unstash, prior | <, search {type} {variable} {value}\";\n\n }","function printMenu() {\n console.log(\"\\n<====== PENDAFATARAN SISWA BARU ======>\");\n console.log(\"<====== SMKN 1 RPL ======>\");\n console.log(\"\\n<====== Menu ======>\");\n console.log(\"1. Registrasi\");\n console.log(\"2. Input Nilai\");\n console.log(\"3. Lihat Profil\");\n console.log(\"4. Informasi Kelulusan\");\n console.log(\"5. keluar\");\n }","function displayBasicQuestion(answerSet, idStem) {\r\n //Variables\r\n ///An array to store all of the HTMl for the display - returned from the function as a joined string\r\n var answerBox = [];\r\n\r\n //Generate display\r\n ///For each question prompt\r\n for(var i = 0; i < answerSet.length; i++){\r\n ///Push an answer box with an answer from the answer set\r\n answerBox.push('');\r\n }\r\n\r\n return answerBox.join(\"\");\r\n}","function updateDisplay() {\n display.innerHTML = activeLetters.join('');\n }","revealPhrase() {\n for (const node of letterNodes) { // for all the letter nodes\n for (const className of node.classList) { // for all class names in each letter\n if (className === 'hide') {\n node.classList.add('show');\n node.classList.add('reveal');\n node.classList.remove('hide');\n }\n }\n }\n }","getMarkDown() {\n const data = this.getExportableObject();\n\n let result = \"\";\n\n // title section\n result += \"# DiagnoSys - *A Differential Diagnosis Tool*\\n\\n\";\n result += \"TODO: add logo image here\\n\\n\\n\";\n\n // critical\n result += \"## Critical Diagnoses\\n\\n\";\n result += \"#| Diagnosis | SNOMED Code | Note\\n\";\n result += \":--- | :--- | :--- | :---\\n\";\n data[\"Critical Diagnoses\"].forEach((diagnosis, index) => {\n result += `${index} | ${diagnosis.Name} | ${diagnosis[\"SNOMED Code\"]} | ${diagnosis.Note}\\n`;\n });\n result += \"\\n\\n\";\n\n // likely\n result += \"## Likely Diagnoses\\n\\n\";\n result += \"#| Diagnosis | SNOMED Code | Note\\n\";\n result += \":--- | :--- | :--- | :---\\n\";\n data[\"Likely Diagnoses\"].forEach((diagnosis, index) => {\n result += `${index} | ${diagnosis.Name} | ${diagnosis[\"SNOMED Code\"]} | ${diagnosis.Note}\\n`;\n });\n\n return result;\n }","function help () {\n return `Welcome to Scramble. \nThe game where you unscramble letters to make words.\n\nOnce you start the game, you will be given a scrambled word.\nIf you correctly guess the word, you will receive a point.\nIf you guess incorrectly you will receive a strike.\nYou can also pass on a word. \n\nTo start a new game use start().\nTo make guess use guess('word').\nTo skip a word use pass().\nTo show these instructions again use help().`\n}","function help () {\n return `Welcome to Scramble. \nThe game where you unscramble letters to make words.\n\nOnce you start the game, you will be given a scrambled word.\nIf you correctly guess the word, you will receive a point.\nIf you guess incorrectly you will receive a strike.\nYou can also pass on a word. \n\nTo start a new game use start().\nTo make guess use guess('word').\nTo skip a word use pass().\nTo show these instructions again use help().`\n}","function help () {\n return `Welcome to Scramble. \nThe game where you unscramble letters to make words.\n\nOnce you start the game, you will be given a scrambled word.\nIf you correctly guess the word, you will receive a point.\nIf you guess incorrectly you will receive a strike.\nYou can also pass on a word. \n\nTo start a new game use start().\nTo make guess use guess('word').\nTo skip a word use pass().\nTo show these instructions again use help().`\n}","print() {\n // we'll return a string derived from our nodes\n return nodes.map(({ neighbors, key }) => {\n // the string will start with the key\n let result = key\n // if there are neighbors we'll map over them and concatenate them into our result\n if (neighbors.length) {\n result += ` => ${neighbors\n .map(node => node.key)\n .join(' ')}`\n }\n\n return result\n })\n .join('\\n')\n }","function help () {\n return `Welcome to Scramble.\nThe game where you unscramble letters to make words.\n\nOnce you start the game, you will be given a scrambled word.\nIf you correctly guess the word, you will receive a point.\nIf you guess incorrectly you will receive a strike.\nYou can also pass on a word.\n\nTo start a new game use start().\nTo make guess use guess('word').\nTo skip a word use pass().\nTo show these instructions again use help().`\n}","function showState(state) {\n\treturn `[${state.content[0].show()} ${state.content[1].show()}]`;\n}","function show_emoticons() {\n\n // YOUR CODE GOES HERE\n var result = \"\";\n var para_arr_node = document.querySelectorAll(\"#book_chapter ul li p\");\n for(each_para_node of para_arr_node){\n var para_arr = each_para_node.innerText.split(\"\\n\");\n each_para_node.innerHTML = \"\";\n for(each_para of para_arr){\n var word_arr = each_para.split(\" \");\n for(each_word of word_arr){\n //checking if there is a comma, ? or ! in the word\n if(each_word.indexOf(\",\") > -1){\n result += each_word.replace(\",\", String.fromCodePoint(0x2B50));\n }\n else if(each_word.indexOf(\"?\") > -1){\n result += each_word.replace(\"?\", String.fromCodePoint(0x2753));\n }\n else if(each_word.indexOf(\"!\") > -1){\n result += each_word.replace(\"!\", String.fromCodePoint(0x2757));\n }\n else{\n result += each_word + \" \";\n }\n }\n }\n\n each_para_node.innerHTML += result;\n result = \"\";\n }\n\n}","function toSyllable(){\n if(syllables.length > 1){\n currentColor = syllables[syllables.length-1].color;\n }\n document.getElementById(\"input\").innerHTML = syllableForm();\n document.getElementById(\"meiOutput\").value = createMEIOutput();\n}","function currentWordDisplay() {\n var activeCharacterDisplay = document.querySelector(\"#activeCharacterDisplay\");\n activeCharacterDisplay.textContent = answerArray.join(\" \");\n}","function toEmojis() {\n document.getElementById('keyboardMinus').style.display = \"none\";\n document.getElementById('keyboardMayus').style.display = \"none\";\n document.getElementById('keyboardNum').style.display = \"none\";\n document.getElementById('keyboardSymb').style.display = \"none\";\n document.getElementById('keyboardGif').style.display = \"block\";\n document.getElementById('keyboard2Gif').style.display = \"none\";\n document.getElementById('gif2Keyboard').style.display = \"block\";\n document.getElementById('keyboardPersonas').style.display=\"none\";\n document.getElementById('keyboardObjects').style.display=\"none\";\n document.getElementById('keyboardWeather').style.display=\"none\";\n document.getElementById('keyboardFeelings').style.display=\"none\";\n document.getElementById('keyboardObjects2').style.display=\"none\";\n}","function showWord(word) {\n var i;\n for (i = 0; i < word.length; i ++) {\n process.stdout.write(word[i]);\n }\n playAgain();\n}","function help () {\n return `Welcome to Scramble. \n The game where you unscramble letters to make words.\n \n Once you start the game, you will be given a scrambled word.\n If you correctly guess the word, you will receive a point.\n If you guess incorrectly you will receive a strike.\n You can also pass on a word. \n \n To start a new game use start().\n To make guess use guess('word').\n To skip a word use pass().\n To show these instructions again use help().`\n }","function show(cset){var i,l,ret=[],c\n if(cset.length % 2) cset.push(0x110000)\n for(i=0,l=cset.length;i `
${person.name}
`).join(\"\")\n}","function printCommandList(mapper) {\n console.log(\"-----------------------------------------------\");\n console.log(\"The following commands are accepted: \")\n var accepted_commands = Object.keys(mapper);\n\n if (accepted_commands.length == 0) {\n console.log(\"No commands have been defined!\");\n console.log(\"-----------------------------------------------\");\n return\n }\n\n for (var i = 0; i < accepted_commands.length; ++i) {\n console.log(\"\\t\" + accepted_commands[i]);\n }\n console.log(\"-----------------------------------------------\");\n}","show() {\n\t\tconsole.log(`Pokemon '${this.name}', level: ${this.level}`);\n\t}","function treeDisplay(tree) {\n var h = tree.tall;\n for (var i = 0; i < tree.tall; i++) {\n var whitespace = (h - 1) - i;\n var num = 2 * i + 1;\n\n console.log(\" \".repeat(whitespace) + tree.char.repeat(num));\n }\n}","function displayCode(tab) {\n var text = \"\";\n for (let i = 0; i < tab.length; i++) {\n if (tab[i] == '<') {\n text = text + '<';\n } else if (tab[i] == '>') {\n text = text + '>';\n } else {\n text = text + tab[i];\n }\n }\n $('#code main').html(text);\n}","commandHelp() {\n if (!this.commands.length) return '';\n const commands = this.prepareCommands();\n const width = this.padWidth();\n return ['Commands:', commands.map(cmd => {\n const desc = cmd[1] ? ` ${cmd[1]}` : '';\n return (desc ? pad(cmd[0], width) : cmd[0]) + desc;\n }).join('\\n').replace(/^/gm, ' '), ''].join('\\n');\n }","helpText(){\n\n if(this.getStep() === 0 ){\n return ` -== HELP ==-\n The first line is 1 integer, consisting of the number of the number of lines of source code (N).\n The second line is 1 integer, constiting of the number of queries (Q).\n The next N lines consiste of HRML source code, consisting of either an opening tag with zero or more attributes or a closing tag. \n Then the next Q lines contains the queries. \n Each line is a string that references an attribute in the HRML source code.`;\n\n }else if(this.getStep() === 1){\n return 'START';\n }\n }","display() {\n let o = {\n data: {},\n rawData: ''\n };\n this.getAllTrie(this.head, '', o, true);\n }","_constructDisplayWord(){\n let displayWord = \"\";\n for (let i=0;i\n \n { mnemonicScreenConstants.mnemonicScreenExplanationText }\n \n \n GET MNEMONIC\n \n \n );\n }","function showLatex(){\n\tif(masterNode.getLatex() == '\\\\bigstar'){\n\t\twindow.alert('Create a deduction and then press this button to get the Virginia Lake LaTeX code for it.');\n\t\treturn false;\n\t}\n const text = toLatex(masterNode);\n\t// if successful, show and return true\n\tif(text){\n\t\twindow.prompt('Copy the LaTeX markup below and paste it into your LaTeX editor.\\nMake sure to include the Virginia Lake package.', text);\n\t\treturn true;\n\t}\n\t// if unsuccessful, show help text and return false. May be error or just no deduction\n\telse{\n\t\twindow.alert('Create a deduction and then press this button to get the Virginia Lake LaTeX code for it.');\n\t\treturn false;\n\t}\n}","function displayStandardAttributes() {\n let standardAttributeArray = Object.keys(STANDARD_QUALIFICATION_DATA);\n let standardAttributeHtml = \"\";\n for (let i = 0; i < standardAttributeArray.length; i++) {\n standardAttributeHtml = standardAttributeHtml +\n standardAttributeArray[i]+\":\"+\n \"\"+\n \" \";\n }\n document.getElementById('standardAttributes').innerHTML = standardAttributeHtml;\n}","display() {\n document.querySelector(\"#question\").innerHTML = this.question;\n for (let i = 0; i < 4; i++)\n showAnswer = selectValue(showAnswer, 4);\n answer1.innerHTML = this.answers[showAnswer[0]];\n answer2.innerHTML = this.answers[showAnswer[1]];\n answer3.innerHTML = this.answers[showAnswer[2]];\n answer4.innerHTML = this.answers[showAnswer[3]];\n }","toString() {\r\n\t\treturn (this.ctrl? \"Ctrl+\":\"\") +\r\n\t\t\t(this.alt? \"Alt+\":\"\") +\r\n\t\t\t(this.shift? \"Shift+\":\"\") +\r\n\t\t\tthis.name\r\n\t}","function displayMenu() {\n var menu = \"1/ Afficher les personnages\\n\";\n menu += \"2/ Calcule de la moyenne d'Age\\n\";\n menu += \"3/ Ajouter un personnage\\n\";\n menu += \"4/ Supprimer un personnage\\n\";\n menu += \"5/ Afficher un personnage\\n\";\n menu += \"0/ Quitter\\n\";\n return menu;\n}","function printMenu() {\n var menu = 'check - check program\\'s variables\\n';\n menu += 'clear - clear screen\\n';\n menu += 'date - set article date to scrape from\\n';\n menu += 'file - set file output for scraped data\\n';\n menu += 'index - set article index\\n';\n menu += 'page - set page to scrape from\\n';\n menu += 'scrape - start scraping\\n';\n menu += 'exit - exit program';\n\n console.log(menu);\n}","function printWords() {\r\n let words = READLINE.question(\"What do you want the computer to print?: \");\r\n console.log(`${words}`);\r\n}","function displayInterests (zero, one, two, three) {\n console.log(\"* \" + zero);\n console.log(\"* \" + one);\n console.log(\"* \" + two);\n console.log(\"* \" + three);\n console.log(\"\");//adds a blank space\n}","function writeLabels(){\n\t\t\n\t\t//// SLIDE OUT MENU VARIABLES\n\t\tvar menuArray = [ \"Create Station\", \"Manage Stations\" , \"Customize Stations\", \"History\",\"Settings\", \"Help\"];\n\t\t\n\t\t// Loop that adds individual items to the menu\n\t\tfor ( var i = 0; i < menuArray.length; i++ ) {\n\t\t $('.side-menu').append(\"
\"+menuArray[i] +\"
\");\n\t\t}\n\t\t$('.side-menu').append(\"\");\n\t}","function asciiConverter() {\n var code;\n var output = '';\n var phrase = document.getElementById('phrase').value; \n phrase = phrase.split('');\n for (var i =0; i < phrase.length; i++) {\n code = phrase[i].charCodeAt(0).toString(2);\n //accounts for the possibility of missing up to 3 0s at the beginning of the binary code \n if (code.length !== 8) {\n code = '0' + code;\n if (code.length !== 8) {\n code = '0' + code;\n }\n if (code.length !== 8) {\n code = '0' + code;\n }\n }\n output += code + \" \";\n } \n document.getElementById('ascii').innerHTML = output; \n}","show(hideFirstCard = false)\n\t{\n\t\tif (this.numCards == 0)\n\t\t\treturn;\n\n\t\tif (hideFirstCard == true)\n\t\t\tcout(\"** \");\n\t\telse\n\t\t{\n\t\t\tthis.cards[0].print(true);\n\t\t\tcout(\" \");\n\t\t}\n\n\t\tfor (let x = 1; x < this.numCards; x++)\n\t\t{\n\t\t\tthis.cards[x].print(true);\n\t\t\tcout(\" \");\n\t\t}\n\t}","function instructions(){\n // \\n for a new line in the text, extra lines are concatenated on the end with \"+\"\n alert(\"Choose your name, then click start, then click on the planet/moon you want to go to or press a number from 1 to 8\\n\\n\"+\n \"Arrow keys or WASD to move\\nT to toggle force arrow visibility\\nR to restart\\nM to go to the menu screen\\nNever gonna press Q key\\n\"+\n \"In free flight mode you can press '+' or '-' to increase or decrease the gravity\\n\\n\"+\n \"Remember to land the lander gently\\nLand on the blue landing zone for extra points\\nDon't let your fuel get to 0, or you'll crash!\\n\\n\"+\n \"Go to https://doc.co/ys85jg for the User Guide\\n\\n\");\n}","function info(...rest) {\n const args = [].slice.call(rest);\n args.unshift('todoist-shortcuts:');\n args.push('(this is fine)');\n // eslint-disable-next-line no-console\n console.log.apply(null, args);\n }","_renderInstructions(parseState) {\n var firstQuestionNumber = parseState.firstQuestionRef;\n var firstSentenceRef = parseState.firstSentenceRef;\n var instructions = \"\";\n\n if (firstQuestionNumber) {\n instructions += i18n._(\"The symbol %(questionSymbol)s indicates that question \" + \"%(questionNumber)s references this portion of the \" + \"passage.\", {\n questionSymbol: \"[[\" + firstQuestionNumber + \"]]\",\n questionNumber: firstQuestionNumber\n });\n }\n\n if (firstSentenceRef) {\n instructions += i18n._(\" The symbol %(sentenceSymbol)s indicates that the \" + \"following sentence is referenced in a question.\", {\n sentenceSymbol: \"[\" + firstSentenceRef + \"]\"\n });\n }\n\n var parsedInstructions = PassageMarkdown.parse(instructions);\n return /*#__PURE__*/React$13.createElement(\"div\", {\n className: \"perseus-widget-passage-instructions\"\n }, PassageMarkdown.output(parsedInstructions));\n }","function showWords(){\n return profanities;\n }","function printResults() {\n print.classList.add('active');\n inputWindow.classList.add('disappear');\n songInfo.classList.add('active');\n\n print.innerHTML = `\n I see ${inputs[0].value} of ${inputs[1].value}, ${inputs[2].value} ${inputs[3].value}, too.\n \n I see ${inputs[4].value} for me and you.\n \n And I think to myself, what a ${inputs[5].value} world.\n `\n}","function changeAlgTitle(algorithm) {\r\n\t$(\"#alg-title\").html(algorithm);\r\n\t$(\".instruction-icon\").css(\"display\",\"inline-block\").show();\r\n}"],"string":"[\n \"function showAll (text) {\\n\\n\\tasciify.getFonts(function (err, fonts) {\\n\\t\\tif (err) { return console.error(err); }\\n\\n\\t\\tvar padSize = ('' + fonts.length).length;\\n\\n\\t\\tfonts.forEach(function(font, index) {\\n\\t\\t\\tvar opts = {\\n\\t\\t\\t\\tfont: font,\\n\\t\\t\\t\\tcolor: argv.color\\n\\t\\t\\t};\\n\\n\\t\\t\\tasciify(exampleText, opts, function (err, result) {\\n\\t\\t\\t\\tconsole.log(pad(padSize, index+1, '0') + ': ' + font);\\n\\t\\t\\t\\tconsole.log(result);\\n\\t\\t\\t\\tconsole.log('');\\n\\t\\t\\t});\\n\\t\\t});\\n\\t});\\n}\",\n \"function generateMnemonic() {\\n const mnemonic = bip39.generateMnemonic();\\n return mnemonic.split(\\\" \\\").slice(0, 3).join(\\\" \\\");\\n}\",\n \"function showInstructions() {\\n\\t\\t\\tclear();\\n\\t\\t\\tdiv.update('' + lang.instructions + '');\\n\\t\\t}\",\n \"displayAll() {\\n for (var i = 0; i < Object.getOwnPropertyNames(this).length; i++) {\\n this.displayKey(Object.getOwnPropertyNames(this)[i])\\n }\\n }\",\n \"function help() {\\n printLine('The following commands work. Hover them for more information.');\\n printLine('' +\\n ' help,' +\\n ' clear,' +\\n ' ls,' +\\n ' tree,' +\\n ' cd ' +\\n 'dirname,' +\\n ' cat ' +\\n 'filename'\\n );\\n printLine(' ');\\n printLine('You can also use the' +\\n ' Up and' +\\n ' Down' +\\n ' keys to navigate through your command history.'\\n );\\n printLine('You can click on tree nodes if CLI is not your thing.' +\\n ' You\\\\'ll still need to hit Enter.'\\n );\\n}\",\n \"displayCmd() {\\r\\n var cmdText = \\\"Commands \\\\n\\\";\\r\\n for (let i = 0; i < this.cmdOrder.length; ++i) {\\r\\n cmdText += this.cmdOrder[i] + \\\": \\\";\\r\\n cmdText += keyboardMap[this.cmdKeyCode[this.cmdIdx[this.cmdOrder[i]]]];\\r\\n cmdText += \\\"\\\\n\\\";\\r\\n }\\r\\n this.document.getElementById('commands').innerText = cmdText;\\r\\n }\",\n \"function help() {\\n\\tvar commandsArray = ['Help: List of available commands', '>help', '>about', '>contact', '>ping', '>time', '>clear', '>say'];\\n\\tfor (var i = 0; i < commandsArray.length; i++) {\\n\\t\\tvar out = '' + commandsArray[i] + ' '\\n\\t\\tOutput(out);\\n\\t}\\n}\",\n \"function outputMnemonic(pageFile, row, fltCompName)\\n{\\n var isOutput = false;\\n var itosFormat = \\\"\\\";\\n\\n var variableName = ccdd.getStructureVariableName(row);\\n var dataType = ccdd.getStructureDataType(row);\\n\\n // Get the ITOS encoded form of the data type\\n var itosEncode = ccdd.getITOSEncodedDataType(dataType, \\\"BIG_ENDIAN\\\");\\n\\n // Check if this data type is a recognized base type or structure\\n if (itosEncode != null)\\n {\\n // Check if the data type is a primitive (not a structure)\\n if (!itosEncode.equals(dataType))\\n {\\n // Get the ITOS output format string based on the encoding\\n itosFormat = setITOSFormatFlag(itosEncode);\\n }\\n\\n // Get the variable name and array size\\n var arraySize = ccdd.getStructureArraySize(row);\\n var fullVariableName = ccdd.getFullVariableName(row);\\n \\n // See if this row would exceed the maximum. If so start another column\\n nextRow(pageFile, variableName, fullVariableName, row);\\n\\n // Get the full variable name (including the variable's structure path)\\n var tmp = ccdd.getFullVariableName(row, \\\" \\\");\\n \\n // Find number of spaces (i.e. \\\" \\\") in tmp and makes prepad a string\\n // containing only that many spaces\\n var prepad = new java.lang.String(String(tmp.match(/ /g))).replaceAll(\\\"[\\\\\\\\,]\\\", \\\"\\\");\\n var len = 0;\\n\\n // Only output non-array variables or array members (i.e., skip array\\n // definitions)\\n if (isVariable(variableName, arraySize))\\n {\\n // In case this is an array member replace the square brackets\\n variableName = convertArrayMember(variableName);\\n \\n // Create the mnemonic definition\\n var fullVariableName2 = prepad + fltCompName + fullVariableName;\\n len = prepad.length() + variableName.length();\\n \\n // Check if the data type is a structure\\n if (itosEncode.equals(dataType))\\n {\\n nextColumnHeader = prepad + variableName;\\n lastSubStructureName = nextColumnHeader;\\n headerNames[row] = lastSubStructureName;\\n fullHeaderNames[row] = fullVariableName;\\n ccdd.writeToFileLn(pageFile, \\\"(+, \\\" + columnOffset + \\\", \\\\\\\"\\\" + nextColumnHeader + \\\"\\\\\\\")\\\");\\n }\\n // Not a structure; it's a primitive type\\n else\\n {\\n if (isArrayElement(arraySize))\\n {\\n var maxDigits = Math.ceil(Math.log(arraySize) / Math.LN10);\\n var digitPad = new Array(maxDigits + 1).join(\\\" \\\");\\n\\n // Output number with leading spaces\\n var index = getIndex(variableName);\\n var indexPadded = index.toString().padLeft(maxDigits);\\n\\n inMiddleOfArray = true;\\n var arrayPad = 13;\\n\\n // This item is first on a row\\n if (index % modNum != 0)\\n {\\n ccdd.writeToFileLn(pageFile, fullVariableName2 + \\\"(=, +, \\\\\\\" :v\\\" + itosFormat + \\\":\\\\\\\", raw)\\\");\\n len = 0;\\n }\\n // This array item is NOT first item on a row\\n else\\n {\\n var lastIndex = Math.min(arraySize - 1, +index + +modNum - 1).toString().padLeft(digitPad);\\n var arrayMessage = new java.lang.String(String(prepad + \\\"[\\\" + indexPadded + \\\"-\\\" + lastIndex + \\\"]\\\"));\\n len = arrayMessage.length() + (numITOSDigits + 1) * Math.min(modNum, arraySize);\\n ccdd.writeToFileLn(pageFile, fullVariableName2 + \\\"(+, \\\" + columnOffset + \\\", \\\\\\\"\\\" + arrayMessage + \\\" :v\\\" + itosFormat + \\\":\\\\\\\", raw)\\\");\\n }\\n\\n if (index != +arraySize - 1 && (+index + 1) % modNum != 0)\\n {\\n rowCount = +rowCount - 1;\\n }\\n\\n if (index == (+arraySize - 1))\\n {\\n inMiddleOfArray = false;\\n nextColumnHeader = lastSubStructureName;\\n }\\n }\\n // Not an array item, print normally\\n else\\n {\\n ccdd.writeToFileLn(pageFile, fullVariableName2 + \\\"(+, \\\" + columnOffset + \\\", \\\\\\\"\\\" + prepad + variableName + \\\" :v\\\" + itosFormat + \\\":\\\\\\\", raw)\\\");\\n\\n len = prepad.length() + variableName.length() + numITOSDigits + 2;\\n }\\n }\\n\\n isOutput = true;\\n }\\n else\\n {\\n nextColumnHeader = prepad + variableName + \\\"[\\\" + arraySize + \\\"] - \\\" + itosEncode;\\n len = new java.lang.String(String(nextColumnHeader)).length();\\n ccdd.writeToFileLn(pageFile, \\\"array_fmt(+, \\\" + columnOffset + \\\", \\\\\\\"\\\" + nextColumnHeader + \\\"\\\\\\\")\\\");\\n }\\n\\n if (maxColumnLength < +len)\\n {\\n ccdd.writeToFileLn(pageFile, \\\"## col_max_len is now = \\\" + len + \\\" (was \\\" + maxColumnLength + \\\")\\\");\\n maxColumnLength = +len;\\n }\\n }\\n else\\n {\\n ccdd.writeToFileLn(pageFile, \\\"#### NOT printing \\\" + variableName);\\n }\\n\\n return isOutput;\\n}\",\n \"displayWordInfo() {\\r\\n this.displayHangman();\\r\\n this.displayLives();\\r\\n this.displayLetters();\\r\\n this.displayLettersToGuess();\\r\\n }\",\n \"function displayHelpText() {\\n console.log();\\n console.log(' Usage: astrum figma [command]');\\n console.log();\\n console.log(' Commands:');\\n console.log(' info\\\\tdisplays current Figma settings');\\n console.log(' edit\\\\tedits Figma settings');\\n console.log();\\n}\",\n \"function help() {\\n\\tvar commandsArray = ['Help: List of available commands',\\n\\t\\t'>about',\\n\\t\\t'>contact',\\n\\t\\t'>projects',\\n\\t\\t'>skills',\\n\\t\\t'>experiences',\\n\\t\\t'>help',\\n\\t\\t'>ping',\\n\\t\\t'>time',\\n\\t\\t'>clear',\\n\\t\\t'>say',\\n\\t\\t'>info',\\n\\t\\t'>exit'];\\n\\tseperator();\\n\\tfor (var i = 0; i < commandsArray.length; i++) {\\n\\t\\tvar out = '' + commandsArray[i] + ' '\\n\\t\\tOutput(out);\\n\\t}\\n}\",\n \"function printInstructions(){\\n console.log(\\\"\\\\nHello! My Name is Liri. I am an AI assistant.\\\");\\n console.log(\\\"I can perform the following tasks:\\\");\\n console.log(`\\\\n\\\"my-tweets\\\": This command will return Yuen's latest tweets.`);\\n console.log(`\\\\n\\\"spotify-this-song\\\": This command will return information about a song of your choice.`);\\n console.log(`\\\\n\\\"movie-this\\\": This command will return information about a movie of your choice.`);\\n console.log(`\\\\n\\\"do-what-it-says\\\": This command will perform a random command on a predefined query`);\\n console.log(`-------------------`);\\n}\",\n \"function showUsedLetters() {\\n\\t\\t$(displayLetters).html(usedLetters.sort().join(\\\"\\\\xa0\\\\xa0\\\"));\\n\\t}\",\n \"function displayAll() {\\n\\n\\t// get information\\n\\tvar firstCorpus = getFirstCorpus();\\n\\tvar firstAlignType = getFirstAlignType();\\n\\tif (firstCorpus === 'error') console.log(\\\"[Error] 存取文獻集名稱錯誤，系統上已無文本。\\\");\\n\\tif (firstAlignType === 'error') console.log(\\\"[Error] 存取段落對讀設定錯誤，系統上已無文本。\\\");\\n\\n\\t// para setting\\n\\t_para['metadata'] = 'filename';\\n\\t_para['aligntype'] = firstAlignType;\\n\\t_para['corpus'] = firstCorpus;\\n\\t_para['mode'] = 'DocOrder';\\n\\n\\t// display\\n\\tdisplayDocuManager();\\n\\tdisplayMetadataList(_para['metadata']);\\n\\tdisplayAlignTypeList(_para['aligntype']);\\n\\tdisplaySearchCorpus(_para['corpus']);\\n\\tdisplaySearchMode(_para['mode']);\\n\\tdisplayCompareContent(_para['metadata'], _para['aligntype']);\\n}\",\n \"showMnemonic() {\\n this.setState({ showMnemonic: true });\\n }\",\n \"displayLetters() {\\r\\n let wordHidden = \\\"\\\\n\\\";\\r\\n for (let i = 0; i < this.text.length; i++) {\\r\\n if (this.lettersToGuess.includes(this.text.charAt(i))) {\\r\\n wordHidden += HangmanUtils.symbol;\\r\\n }\\r\\n else {\\r\\n wordHidden += this.text.charAt(i);\\r\\n }\\r\\n wordHidden += \\\" \\\";\\r\\n }\\r\\n console.log(wordHidden);\\r\\n }\",\n \"function show(){\\n\\tconsole.log(\\\"Wins \\\" + wins);\\n\\tconsole.log(\\\"Losses \\\" + losses);\\n\\tconsole.log(\\\"Guesses left \\\" + guessLeft);\\n\\tconsole.log(newWord.displayValue());\\n\\tconsole.log(letterArray);\\n}\",\n \"function mnemButton(evt, mnemonic) {\\n let text = document.getElementById(\\\"textBox\\\").value;\\n if (text != '') {\\n text += '\\\\n';\\n }\\n text += mnemonic;\\n document.getElementById(\\\"textBox\\\").value = text;\\n}\",\n \"function printKey() {\\n\\t\\tvar tableHtml = \\\"
\\\";\\n\\t\\tfor (var i = 0; i < 25; i = i + 5) {\\n\\t\\t\\ttableHtml += \\\"
\\\";\\n\\t\\t\\tvar row = keyPhrase.substring(i, i + 5);\\n\\t\\t\\tvar chars = row.split(\\\"\\\");\\n\\t\\t\\tfor (var x = 0; x < 5; x++) {\\n\\t\\t\\t\\ttableHtml += \\\"
\\\" + chars[x] + \\\"
\\\";\\n\\t\\t\\t}\\n\\t\\t\\ttableHtml += \\\"
\\\";\\n\\t\\t}\\n\\t\\ttableHtml += \\\"
\\\";\\n\\t\\t$(\\\"#keyTable\\\").html(tableHtml);\\n\\t}\",\n \"function help () {\\n return `INSTRUCTIONS:\\n Blacksmith is a simple text base game. \\n \\n As a blacksmith you convert ore and wood into swords and axes. You buy your resources using gold and sell your weapons for gold.\\n \\n COMMANDS:\\n - buy(item)\\n - make(item)\\n - sell(item)\\n - fire()\\n - inventory()\\n - help()`\\n }\",\n \"show() {\\n\\t\\tlet self=this;\\n\\t\\tfor(let i in self.queue) {\\n\\t\\t\\tlet indent=0;\\n\\t\\t\\tself.prettyCommandObject(self.queue[i],indent);\\n\\t\\t\\tfor(let j in self.queue[i].commands) {\\n\\t\\t\\t\\tindent++;\\n\\t\\t\\t\\tself.prettyCommandObject(self.queue[i].commands[j],indent);\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"function showHelpUsage() {\\n let helpString = \\\"Hei, olen Relluassari! Yritän auttaa sinua relaatioiden ratkonnassa ;) \\\\n\\\" +\\n \\\"<<< Koska olen vielä beta, älä pahastu jos en osaa jotain, tai kaadun kesken kaiken >>> \\\\n\\\" +\\n \\\" \\\\n Miten kutsua minut apuun? \\\\n \\\" +\\n \\\" TL;DR? Klikkaa tunnettua -> klikkaa tuntematonta -> klikkaa tuntematonta -> ... -> Repeat \\\\n\\\" +\\n \\\" \\\\nEli miten? \\\\n\\\" +\\n \\\" 1) Klikkaa graafista tunnettua sanaa \\\\n\\\" +\\n \\\" -> Relluassari tekee Wikipediasta, Bingistä, Wiktionarystä ja Ratkojista lähdehaut ko. sanalla. \\\\n\\\" +\\n \\\" 2) Kun haku valmis, klikkaa graafista tunnettuun kytkettyä tuntematonta sanaa \\\\n\\\" +\\n \\\" -> Relluassari parsii hakutuloksista klikatun pituiset sanat ja brutettaa rellua niillä. \\\\n\\\" +\\n \\\" 3) Kun brutetus valmis, klikkaa seuraavaa tunnettuun kytkettyä tuntematonta \\\\n\\\" +\\n \\\" -> Relluassari parsii hakutuloksista klikatun pituiset sanat ja brutettaa rellua niillä. \\\\n\\\" +\\n \\\" 4) Valitse uusi tunnettu sana lähteeksi ja siirry kohtaan 1) \\\\n\\\" +\\n \\\"\\\\nAdvanced usage: \\\\n\\\" +\\n \\\" Menu>Suorita lähdehaku (teemasana) - tekee lähdehaun vain teemasanalla \\\\n\\\" +\\n \\\" Menu>Suorita lähdehaku (oma sana) - tekee lähdehaun syöttämälläsi sanalla/sanoilla (esim. usean sanan hakuun Bingistä) \\\\n\\\" +\\n \\\" Menu>Parsi hakutulos sanoiksi - parsii hakutuloksesta *kaikkien* näkyvien tuntemattomien pituiset sanat \\\\n\\\" +\\n \\\" Menu>Bruteta sanalista - brutettaa rellua sen hetken muistissa olevalla koko sanalistalla \\\\n\\\";\\n alert(helpString);\\n}\",\n \"function writeInstructions() {\\n noStroke();\\n fill(252, 118, 172);\\n textSize(54)\\n text('my name is', width / 2, height / 3)\\n text('i was born in', width / 2, height * 1 / 2);\\n textSize(25);\\n text('click on your sign to get your horoscope!', width / 2, height * 2 / 3)\\n}\",\n \"function show() {\\n best.html(population.pop[0].genes);\\n averageFitness.html(population.averageFitness);\\n generationNum.html(gNum);\\n phrases.html(\\\"\\\");\\n\\n var phrs = \\\"\\\";\\n\\n for (let i = 1; i < population.pop.length && i < nPhrases.val(); i++) {\\n phrs += '' + population.pop[i].genes.join(\\\"\\\") + '';\\n }\\n\\n phrases.html(phrs);\\n }\",\n \"displayInConsole() {\\n console.log(\\\"{ name: \\\" + this.name + \\\", colors: \\\" + this.colors + \\\", manaCost: \\\" + this.manaCost + \\\", type: \\\" + this.modifier + \\\", TCGPlayer price: \\\" + this.tcgprice + \\\", Card Kingdom price: \\\" + this.ckprice);\\n }\",\n \"generate() {\\n const cmd = this.command;\\n const flags = util.sortBy(\\n Object.entries(cmd.flags || {})\\n .filter(([, v]) => !v.hidden)\\n .map(([k, v]) => {\\n v.name = k;\\n return v;\\n }),\\n (f) => [!f.char, f.char, f.name],\\n );\\n const args = (cmd.args || []).filter((a) => !a.hidden);\\n let output = util\\n .compact([\\n this.usage(flags),\\n this.args(args),\\n this.flags(flags),\\n this.description(),\\n this.aliases(cmd.aliases),\\n this.examples(cmd.examples || cmd.example),\\n this.docs(),\\n ])\\n .join('\\\\n\\\\n');\\n if (this.opts.stripAnsi) output = stripAnsi(output);\\n return output;\\n }\",\n \"function showSymbols(e) {\\n let letters = findSymbols(e.target.value, names, nameMap);\\n let list = '';\\n for (const index in letters) {\\n list +=\\n `
${letters[index][0]}
` +\\n ``;\\n }\\n nameList.innerHTML = list;\\n}\",\n \"function showInstructions() {\\r\\n\\tconst INSTRUCTIONS = \\\"1. Identify the morphological boundaries. \\\" \\r\\n\\t\\t\\t\\t\\t + \\\"When you mouse over the word, grey slashes will appear in the spaces between the letters, indicating possible morphological boundaries.
\\\"\\r\\n\\t\\t\\t\\t\\t + \\\"a. To mark a morphological boundary, click on the space where you think the boundary is using your mouse.
\\\" \\r\\n\\t\\t\\t\\t\\t + \\\"b. Once you've made your selection, click on the check button to see whether you've identified the boundaries correctly.
\\\"\\r\\n\\t\\t\\t\\t\\t + \\\"c. If you've selected your boundaries correctly, the morphological categories of the word's components will automatically appear above the word.\\\"\\r\\n\\t\\t\\t\\t\\t + \\\"If you haven't, you will be given the opportunity to try again \\\"\\r\\n\\t\\t\\t\\t\\t + \\\"(remember, after three tries, the program will provide the correct answer).\\\"; \\r\\n\\tshowModal(INSTRUCTIONS, false);\\r\\n}\",\n \"kanaToDisplayForLesson(lesson) {\\n const lessonWithKanaObjects = [];\\n lesson.map(syllable =>\\n lessonWithKanaObjects.push(new KanaSyllable(syllable.alphabet, syllable.consonant, syllable.vowel)));\\n\\n return lessonWithKanaObjects[0].display();\\n }\",\n \"help() {\\n const lines = [];\\n if (this.banner) { lines.unshift(`${this.banner}\\\\n`); }\\n for (const rule of Array.from(this.rules)) {\\n let spaces = 15 - rule.longFlag.length;\\n spaces = spaces > 0 ? repeat(' ', spaces) : '';\\n const letPart = rule.shortFlag ? `${rule.shortFlag}, ` : ' ';\\n lines.push(` ${letPart}${rule.longFlag}${spaces}${rule.description}`);\\n }\\n return `\\\\n${lines.join('\\\\n')}\\\\n`;\\n }\",\n \"function keystroke_menu() {\\n var htmlstr = '
Keystroke commands for selected readings
Click the pen to enable reading ' +\\n 'selection. Readings can be selected by clicking, or by dragging across ' +\\n 'the screen in edit mode. Press any of the following keys to take the ' +\\n 'corresponding action:
Double-click a reading to access its properties; drag a reading to another one to create a relationship. For fuller documentation see the \\\"About/Help\\\" link.
';\\n return htmlstr;\\n}\",\n \"function print_mac(n)\\n{\\n\\tvar str=\\\"\\\";\\n\\tvar j;\\n\\n\\tfor(i=1;i<7;i++)\\n\\t{\\n\\t\\tif(i==6) j=6;\\n\\t\\telse j=i+1;\\n\\n\\t\\tstr+=\\\"\\\";\\n\\t\\tif(i!=6) str+=\\\" : \\\";\\n\\n\\t}\\n\\tdocument.write(str);\\n}\",\n \"get displayText PS_displayText() {\\n var {matchedName: sentence, _arguments: args} = this._verb;\\n for (let x in args) {\\n let obj = x === \\\"direct_object\\\";\\n let {text} = this._argSuggs[x] || 0;\\n if (text) sentence += (\\\" \\\" +\\n (obj ? \\\"\\\" : args[x].flag + \\\" \\\") +\\n (obj ? \\\"[ \\\" + text + \\\" ]\\\" : text));\\n }\\n return sentence;\\n }\",\n \"show() {\\n console.log(`id\\\\t${this.name}`);\\n for (const [key, value] of this.entries()) {\\n console.log(key, value);\\n }\\n }\",\n \"function printUsage(){\\n\\tconsole.log('Usage: ');\\n\\tconsole.log('node sag_coder.js encode /this/will/be/the/input/file');\\n\\tconsole.log('node sag_coder.js encode /this/will/be/the/input/file /this/will/be/the/output/file');\\n\\tconsole.log('');\\n\\tconsole.log('node sag_coder.js decode /this/will/be/the/input/file');\\n\\tconsole.log('node sag_coder.js decode /this/will/be/the/input/file /this/will/be/the/output/file');\\n}\",\n \"function showHelpText() {\\n ctx.save();\\n\\n if (lastUsedInput === 'keyboard') {\\n setFont(18);\\n ctx.fillStyle = 'white';\\n ctx.fillText(translation.spacebar + ' ' + translation.select, 28 - fontMeasurement, kontra.canvas.height - 25 + fontMeasurement / 2.5);\\n }\\n else if (lastUsedInput === 'gamepad') {\\n drawAButton(28, kontra.canvas.height - 25);\\n setFont(18);\\n ctx.fillStyle = 'white';\\n ctx.fillText(translation.select, 28 + fontMeasurement * 1.75, kontra.canvas.height - 25 + fontMeasurement / 2.5);\\n }\\n\\n ctx.restore();\\n}\",\n \"outputKey(key) {\\n return \\\"[[[output of \\\" + key + \\\"]]]\\\";\\n }\",\n \"function help() {\\n console.log(\\n \\\"\\\\n\\\" +\\n \\\"STRUCTURE\\\" +\\n \\\"\\\\033[38;5;6m\\\" + \\\"\\\\n node liri.js (command) + (search(artist, concert, movie))\\\\n\\\" + \\\"\\\\033[0m\\\" +\\n \\\"\\\\nCOMMAND OPTIONS\\\" +\\n \\\"\\\\033[38;5;10m\\\" +\\n \\\"\\\\n spotify-this-song\\\" + \\\"\\\\033[0m\\\" + \\\" search for artist details\\\" +\\n \\\"\\\\033[38;5;10m\\\" +\\n \\\"\\\\n concert-this\\\" + \\\"\\\\033[0m\\\" + \\\" search for concert details\\\" +\\n \\\"\\\\033[38;5;10m\\\" +\\n \\\"\\\\n movie-this\\\" + \\\"\\\\033[0m\\\" + \\\" search for movie details\\\" +\\n \\\"\\\\033[38;5;10m\\\" +\\n \\\"\\\\n do-what-it-says\\\" + \\\"\\\\033[0m\\\" + \\\" run a search based on what is written in 'random.txt'\\\"\\n )\\n}\",\n \"async print() {\\n\\t\\tfor (let i = 0; i < 9; i++) {\\n\\t\\t\\tfor (let j = 0; j < 9; j++) {\\n\\t\\t\\t\\tlet index = i * 9 + j\\n\\t\\t\\t\\tlet value = '*'\\n\\t\\t\\t\\tif (this.cells[index].possibilities.length === 0) {\\n\\t\\t\\t\\t\\tvalue = '!'\\n\\t\\t\\t\\t} else if (this.cells[index].possibilities.length === 1) {\\n\\t\\t\\t\\t\\tvalue = `${this.cells[index].possibilities[0]}`\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (j % 3 === 2 && j !== 8) {\\n\\t\\t\\t\\t\\tvalue += ' |'\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tawait Deno.writeAll(Deno.stdout, new TextEncoder().encode(`${value} `))\\n\\t\\t\\t}\\n\\t\\t\\tif (i % 3 == 2 && i !== 8) {\\n\\t\\t\\t\\tconsole.log('\\\\n---------------------')\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tconsole.log('')\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"function info() {\\n\\tseperator();\\n\\tOutput('>info: ');\\n\\tOutput('Console simulator by Mario Duarte https://codepen.io/MarioDesigns/pen/JbOyqe');\\n}\",\n \"function display() {\\n\\tfor (let key in this.dataStore) {\\n\\t\\tconsole.log(`${key} ${this.dataStore[key]}`);\\n\\t}\\n}\",\n \"addphrasetoDisplay(){\\n const phraseUL = document.querySelector('#phrase ul');\\n this.phrase.forEach(letter => {\\n if(letter.match(/^\\\\s+$/)){\\n phraseUL.innerHTML += `\\n
\\n `;\\n } else{\\n phraseUL.innerHTML += `\\n
${letter.toUpperCase()}
`;\\n }\\n })\\n }\",\n \"function help() {\\n console.log(\\\" \\\");\\n console.log(\\n \\\" ╔════════════════════════════════════════════════════════════════════════╗\\\"\\n .rainbow\\n );\\n console.log(\\n \\\" ║ ║\\\"\\n .rainbow\\n );\\n console.log(\\n \\\" ║ Hi my name is LUIRI, like Siri but better, Ill be assisting you... ║\\\"\\n .rainbow\\n );\\n console.log(\\n \\\" ║ ║\\\"\\n .rainbow\\n );\\n console.log(\\n \\\" ╠════════════════════════════════════════════════════════════════════════╣\\\"\\n .rainbow\\n );\\n console.log(\\n \\\" ║ To see your tweets: luiri tweets ║\\\"\\n .red\\n );\\n console.log(\\n ' ║ To track a tweet: luiri twitterTrack \\\"word\\\" ║'\\n .red\\n );\\n console.log(\\n ' ║ To search for a song: luiri spotify \\\"song name\\\" ║'\\n .green\\n );\\n console.log(\\n ' ║ To search for a movie: luiri movie \\\"movie name\\\" ║'\\n .yellow\\n );\\n console.log(\\n \\\" ║ Saved: luiri saved ║\\\"\\n .blue\\n );\\n console.log(\\n \\\" ║ To view the log: luiri log ║\\\"\\n .green\\n );\\n console.log(\\n \\\" ╚════════════════════════════════════════════════════════════════════════╝\\\"\\n .rainbow\\n );\\n}\",\n \"function getMnemonic(walletRPC, keyIncludes, chain) {\\n\\twalletRPC.mnemonic()\\n\\t\\t.then(mnemonic => {\\n\\t\\t\\tconsole.log(\\\"Your mnemonic is: \\\"+mnemonic.key)\\n\\t\\t\\tchain(walletRPC, { keyIncluded: mnemonic.key.includes(keyIncludes), mnemonic:mnemonic.key })\\n\\t\\t})\\n\\t\\t.catch(err => {\\n\\t\\t\\tconsole.error(err);\\n\\t\\t});\\n}\",\n \"function getPopupText(output){\\n\\t\\tvar result = \\\"\\\";\\n\\t\\tfor(var attr in output){\\n\\t\\t\\tif(attr == 'operator_id'){\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif(output.hasOwnProperty(attr)){\\n\\t\\t\\t\\tvar splitString = attr.split(\\\"_\\\");\\n\\t\\t\\t\\tfor(var splitPart in splitString){\\n\\t\\t\\t\\t\\tresult += ' ' + splitString[splitPart].charAt(0).toUpperCase() + splitString[splitPart].slice(1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tresult += \\\": \\\";\\n\\t\\t\\t\\tresult += '' + output[attr] + '' + ' ';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tresult += ' ';\\n\\t\\treturn result;\\n\\t}\",\n \"function printAnswer(){\\n var print = \\\" \\\";\\n for (var i = 0; i < answer.length; i++) {\\n print = print.concat(answer[i].toUpperCase());\\n }\\n document.getElementById(\\\"updateScreen\\\").innerText = \\\" Name: \\\" + print;\\n}\",\n \"function showCode() {\\n\\t\\t\\t//Reset game\\n\\t\\t\\tabortGame();\\n\\t\\t\\tvm.secretCode = Mastermind.secretCode();\\n\\t\\t}\",\n \"function Kenalan () {\\n console.log(`Nama Saya, Jane`)\\n console.log(`Saya Suka Masak`)\\n console.log(`Sekian`)\\n}\",\n \"function printPin(pin) {\\n console.log(\\\"Scan this code with your HomeKit App on your iOS device:\\\");\\n console.log(\\\"\\\\x1b[30;47m%s\\\\x1b[0m\\\", \\\" \\\");\\n console.log(\\\"\\\\x1b[30;47m%s\\\\x1b[0m\\\", \\\" ┌────────────┐ \\\");\\n console.log(\\\"\\\\x1b[30;47m%s\\\\x1b[0m\\\", \\\" │ \\\" + pin + \\\" │ \\\");\\n console.log(\\\"\\\\x1b[30;47m%s\\\\x1b[0m\\\", \\\" └────────────┘ \\\");\\n console.log(\\\"\\\\x1b[30;47m%s\\\\x1b[0m\\\", \\\" \\\");\\n}\",\n \"getHelpText(){\\n return \\\"Tree Authoring Shell: Commands: cd {id} | @{id}. set tag {tags} | #{tag}, set value {variable} {value} | ${variable}: {value}, rm {id}, link {id} {id} | {id} > {id}, stash, unstash, prior | <, search {type} {variable} {value}\\\";\\n\\n }\",\n \"function printMenu() {\\n console.log(\\\"\\\\n<====== PENDAFATARAN SISWA BARU ======>\\\");\\n console.log(\\\"<====== SMKN 1 RPL ======>\\\");\\n console.log(\\\"\\\\n<====== Menu ======>\\\");\\n console.log(\\\"1. Registrasi\\\");\\n console.log(\\\"2. Input Nilai\\\");\\n console.log(\\\"3. Lihat Profil\\\");\\n console.log(\\\"4. Informasi Kelulusan\\\");\\n console.log(\\\"5. keluar\\\");\\n }\",\n \"function displayBasicQuestion(answerSet, idStem) {\\r\\n //Variables\\r\\n ///An array to store all of the HTMl for the display - returned from the function as a joined string\\r\\n var answerBox = [];\\r\\n\\r\\n //Generate display\\r\\n ///For each question prompt\\r\\n for(var i = 0; i < answerSet.length; i++){\\r\\n ///Push an answer box with an answer from the answer set\\r\\n answerBox.push('');\\r\\n }\\r\\n\\r\\n return answerBox.join(\\\"\\\");\\r\\n}\",\n \"function updateDisplay() {\\n display.innerHTML = activeLetters.join('');\\n }\",\n \"revealPhrase() {\\n for (const node of letterNodes) { // for all the letter nodes\\n for (const className of node.classList) { // for all class names in each letter\\n if (className === 'hide') {\\n node.classList.add('show');\\n node.classList.add('reveal');\\n node.classList.remove('hide');\\n }\\n }\\n }\\n }\",\n \"getMarkDown() {\\n const data = this.getExportableObject();\\n\\n let result = \\\"\\\";\\n\\n // title section\\n result += \\\"# DiagnoSys - *A Differential Diagnosis Tool*\\\\n\\\\n\\\";\\n result += \\\"TODO: add logo image here\\\\n\\\\n\\\\n\\\";\\n\\n // critical\\n result += \\\"## Critical Diagnoses\\\\n\\\\n\\\";\\n result += \\\"#| Diagnosis | SNOMED Code | Note\\\\n\\\";\\n result += \\\":--- | :--- | :--- | :---\\\\n\\\";\\n data[\\\"Critical Diagnoses\\\"].forEach((diagnosis, index) => {\\n result += `${index} | ${diagnosis.Name} | ${diagnosis[\\\"SNOMED Code\\\"]} | ${diagnosis.Note}\\\\n`;\\n });\\n result += \\\"\\\\n\\\\n\\\";\\n\\n // likely\\n result += \\\"## Likely Diagnoses\\\\n\\\\n\\\";\\n result += \\\"#| Diagnosis | SNOMED Code | Note\\\\n\\\";\\n result += \\\":--- | :--- | :--- | :---\\\\n\\\";\\n data[\\\"Likely Diagnoses\\\"].forEach((diagnosis, index) => {\\n result += `${index} | ${diagnosis.Name} | ${diagnosis[\\\"SNOMED Code\\\"]} | ${diagnosis.Note}\\\\n`;\\n });\\n\\n return result;\\n }\",\n \"function help () {\\n return `Welcome to Scramble. \\nThe game where you unscramble letters to make words.\\n\\nOnce you start the game, you will be given a scrambled word.\\nIf you correctly guess the word, you will receive a point.\\nIf you guess incorrectly you will receive a strike.\\nYou can also pass on a word. \\n\\nTo start a new game use start().\\nTo make guess use guess('word').\\nTo skip a word use pass().\\nTo show these instructions again use help().`\\n}\",\n \"function help () {\\n return `Welcome to Scramble. \\nThe game where you unscramble letters to make words.\\n\\nOnce you start the game, you will be given a scrambled word.\\nIf you correctly guess the word, you will receive a point.\\nIf you guess incorrectly you will receive a strike.\\nYou can also pass on a word. \\n\\nTo start a new game use start().\\nTo make guess use guess('word').\\nTo skip a word use pass().\\nTo show these instructions again use help().`\\n}\",\n \"function help () {\\n return `Welcome to Scramble. \\nThe game where you unscramble letters to make words.\\n\\nOnce you start the game, you will be given a scrambled word.\\nIf you correctly guess the word, you will receive a point.\\nIf you guess incorrectly you will receive a strike.\\nYou can also pass on a word. \\n\\nTo start a new game use start().\\nTo make guess use guess('word').\\nTo skip a word use pass().\\nTo show these instructions again use help().`\\n}\",\n \"print() {\\n // we'll return a string derived from our nodes\\n return nodes.map(({ neighbors, key }) => {\\n // the string will start with the key\\n let result = key\\n // if there are neighbors we'll map over them and concatenate them into our result\\n if (neighbors.length) {\\n result += ` => ${neighbors\\n .map(node => node.key)\\n .join(' ')}`\\n }\\n\\n return result\\n })\\n .join('\\\\n')\\n }\",\n \"function help () {\\n return `Welcome to Scramble.\\nThe game where you unscramble letters to make words.\\n\\nOnce you start the game, you will be given a scrambled word.\\nIf you correctly guess the word, you will receive a point.\\nIf you guess incorrectly you will receive a strike.\\nYou can also pass on a word.\\n\\nTo start a new game use start().\\nTo make guess use guess('word').\\nTo skip a word use pass().\\nTo show these instructions again use help().`\\n}\",\n \"function showState(state) {\\n\\treturn `[${state.content[0].show()} ${state.content[1].show()}]`;\\n}\",\n \"function show_emoticons() {\\n\\n // YOUR CODE GOES HERE\\n var result = \\\"\\\";\\n var para_arr_node = document.querySelectorAll(\\\"#book_chapter ul li p\\\");\\n for(each_para_node of para_arr_node){\\n var para_arr = each_para_node.innerText.split(\\\"\\\\n\\\");\\n each_para_node.innerHTML = \\\"\\\";\\n for(each_para of para_arr){\\n var word_arr = each_para.split(\\\" \\\");\\n for(each_word of word_arr){\\n //checking if there is a comma, ? or ! in the word\\n if(each_word.indexOf(\\\",\\\") > -1){\\n result += each_word.replace(\\\",\\\", String.fromCodePoint(0x2B50));\\n }\\n else if(each_word.indexOf(\\\"?\\\") > -1){\\n result += each_word.replace(\\\"?\\\", String.fromCodePoint(0x2753));\\n }\\n else if(each_word.indexOf(\\\"!\\\") > -1){\\n result += each_word.replace(\\\"!\\\", String.fromCodePoint(0x2757));\\n }\\n else{\\n result += each_word + \\\" \\\";\\n }\\n }\\n }\\n\\n each_para_node.innerHTML += result;\\n result = \\\"\\\";\\n }\\n\\n}\",\n \"function toSyllable(){\\n if(syllables.length > 1){\\n currentColor = syllables[syllables.length-1].color;\\n }\\n document.getElementById(\\\"input\\\").innerHTML = syllableForm();\\n document.getElementById(\\\"meiOutput\\\").value = createMEIOutput();\\n}\",\n \"function currentWordDisplay() {\\n var activeCharacterDisplay = document.querySelector(\\\"#activeCharacterDisplay\\\");\\n activeCharacterDisplay.textContent = answerArray.join(\\\" \\\");\\n}\",\n \"function toEmojis() {\\n document.getElementById('keyboardMinus').style.display = \\\"none\\\";\\n document.getElementById('keyboardMayus').style.display = \\\"none\\\";\\n document.getElementById('keyboardNum').style.display = \\\"none\\\";\\n document.getElementById('keyboardSymb').style.display = \\\"none\\\";\\n document.getElementById('keyboardGif').style.display = \\\"block\\\";\\n document.getElementById('keyboard2Gif').style.display = \\\"none\\\";\\n document.getElementById('gif2Keyboard').style.display = \\\"block\\\";\\n document.getElementById('keyboardPersonas').style.display=\\\"none\\\";\\n document.getElementById('keyboardObjects').style.display=\\\"none\\\";\\n document.getElementById('keyboardWeather').style.display=\\\"none\\\";\\n document.getElementById('keyboardFeelings').style.display=\\\"none\\\";\\n document.getElementById('keyboardObjects2').style.display=\\\"none\\\";\\n}\",\n \"function showWord(word) {\\n var i;\\n for (i = 0; i < word.length; i ++) {\\n process.stdout.write(word[i]);\\n }\\n playAgain();\\n}\",\n \"function help () {\\n return `Welcome to Scramble. \\n The game where you unscramble letters to make words.\\n \\n Once you start the game, you will be given a scrambled word.\\n If you correctly guess the word, you will receive a point.\\n If you guess incorrectly you will receive a strike.\\n You can also pass on a word. \\n \\n To start a new game use start().\\n To make guess use guess('word').\\n To skip a word use pass().\\n To show these instructions again use help().`\\n }\",\n \"function show(cset){var i,l,ret=[],c\\n if(cset.length % 2) cset.push(0x110000)\\n for(i=0,l=cset.length;i `
${person.name}
`).join(\\\"\\\")\\n}\",\n \"function printCommandList(mapper) {\\n console.log(\\\"-----------------------------------------------\\\");\\n console.log(\\\"The following commands are accepted: \\\")\\n var accepted_commands = Object.keys(mapper);\\n\\n if (accepted_commands.length == 0) {\\n console.log(\\\"No commands have been defined!\\\");\\n console.log(\\\"-----------------------------------------------\\\");\\n return\\n }\\n\\n for (var i = 0; i < accepted_commands.length; ++i) {\\n console.log(\\\"\\\\t\\\" + accepted_commands[i]);\\n }\\n console.log(\\\"-----------------------------------------------\\\");\\n}\",\n \"show() {\\n\\t\\tconsole.log(`Pokemon '${this.name}', level: ${this.level}`);\\n\\t}\",\n \"function treeDisplay(tree) {\\n var h = tree.tall;\\n for (var i = 0; i < tree.tall; i++) {\\n var whitespace = (h - 1) - i;\\n var num = 2 * i + 1;\\n\\n console.log(\\\" \\\".repeat(whitespace) + tree.char.repeat(num));\\n }\\n}\",\n \"function displayCode(tab) {\\n var text = \\\"\\\";\\n for (let i = 0; i < tab.length; i++) {\\n if (tab[i] == '<') {\\n text = text + '<';\\n } else if (tab[i] == '>') {\\n text = text + '>';\\n } else {\\n text = text + tab[i];\\n }\\n }\\n $('#code main').html(text);\\n}\",\n \"commandHelp() {\\n if (!this.commands.length) return '';\\n const commands = this.prepareCommands();\\n const width = this.padWidth();\\n return ['Commands:', commands.map(cmd => {\\n const desc = cmd[1] ? ` ${cmd[1]}` : '';\\n return (desc ? pad(cmd[0], width) : cmd[0]) + desc;\\n }).join('\\\\n').replace(/^/gm, ' '), ''].join('\\\\n');\\n }\",\n \"helpText(){\\n\\n if(this.getStep() === 0 ){\\n return ` -== HELP ==-\\n The first line is 1 integer, consisting of the number of the number of lines of source code (N).\\n The second line is 1 integer, constiting of the number of queries (Q).\\n The next N lines consiste of HRML source code, consisting of either an opening tag with zero or more attributes or a closing tag. \\n Then the next Q lines contains the queries. \\n Each line is a string that references an attribute in the HRML source code.`;\\n\\n }else if(this.getStep() === 1){\\n return 'START';\\n }\\n }\",\n \"display() {\\n let o = {\\n data: {},\\n rawData: ''\\n };\\n this.getAllTrie(this.head, '', o, true);\\n }\",\n \"_constructDisplayWord(){\\n let displayWord = \\\"\\\";\\n for (let i=0;i\\n \\n { mnemonicScreenConstants.mnemonicScreenExplanationText }\\n \\n \\n GET MNEMONIC\\n \\n \\n );\\n }\",\n \"function showLatex(){\\n\\tif(masterNode.getLatex() == '\\\\\\\\bigstar'){\\n\\t\\twindow.alert('Create a deduction and then press this button to get the Virginia Lake LaTeX code for it.');\\n\\t\\treturn false;\\n\\t}\\n const text = toLatex(masterNode);\\n\\t// if successful, show and return true\\n\\tif(text){\\n\\t\\twindow.prompt('Copy the LaTeX markup below and paste it into your LaTeX editor.\\\\nMake sure to include the Virginia Lake package.', text);\\n\\t\\treturn true;\\n\\t}\\n\\t// if unsuccessful, show help text and return false. May be error or just no deduction\\n\\telse{\\n\\t\\twindow.alert('Create a deduction and then press this button to get the Virginia Lake LaTeX code for it.');\\n\\t\\treturn false;\\n\\t}\\n}\",\n \"function displayStandardAttributes() {\\n let standardAttributeArray = Object.keys(STANDARD_QUALIFICATION_DATA);\\n let standardAttributeHtml = \\\"\\\";\\n for (let i = 0; i < standardAttributeArray.length; i++) {\\n standardAttributeHtml = standardAttributeHtml +\\n standardAttributeArray[i]+\\\":\\\"+\\n \\\"\\\"+\\n \\\" \\\";\\n }\\n document.getElementById('standardAttributes').innerHTML = standardAttributeHtml;\\n}\",\n \"display() {\\n document.querySelector(\\\"#question\\\").innerHTML = this.question;\\n for (let i = 0; i < 4; i++)\\n showAnswer = selectValue(showAnswer, 4);\\n answer1.innerHTML = this.answers[showAnswer[0]];\\n answer2.innerHTML = this.answers[showAnswer[1]];\\n answer3.innerHTML = this.answers[showAnswer[2]];\\n answer4.innerHTML = this.answers[showAnswer[3]];\\n }\",\n \"toString() {\\r\\n\\t\\treturn (this.ctrl? \\\"Ctrl+\\\":\\\"\\\") +\\r\\n\\t\\t\\t(this.alt? \\\"Alt+\\\":\\\"\\\") +\\r\\n\\t\\t\\t(this.shift? \\\"Shift+\\\":\\\"\\\") +\\r\\n\\t\\t\\tthis.name\\r\\n\\t}\",\n \"function displayMenu() {\\n var menu = \\\"1/ Afficher les personnages\\\\n\\\";\\n menu += \\\"2/ Calcule de la moyenne d'Age\\\\n\\\";\\n menu += \\\"3/ Ajouter un personnage\\\\n\\\";\\n menu += \\\"4/ Supprimer un personnage\\\\n\\\";\\n menu += \\\"5/ Afficher un personnage\\\\n\\\";\\n menu += \\\"0/ Quitter\\\\n\\\";\\n return menu;\\n}\",\n \"function printMenu() {\\n var menu = 'check - check program\\\\'s variables\\\\n';\\n menu += 'clear - clear screen\\\\n';\\n menu += 'date - set article date to scrape from\\\\n';\\n menu += 'file - set file output for scraped data\\\\n';\\n menu += 'index - set article index\\\\n';\\n menu += 'page - set page to scrape from\\\\n';\\n menu += 'scrape - start scraping\\\\n';\\n menu += 'exit - exit program';\\n\\n console.log(menu);\\n}\",\n \"function printWords() {\\r\\n let words = READLINE.question(\\\"What do you want the computer to print?: \\\");\\r\\n console.log(`${words}`);\\r\\n}\",\n \"function displayInterests (zero, one, two, three) {\\n console.log(\\\"* \\\" + zero);\\n console.log(\\\"* \\\" + one);\\n console.log(\\\"* \\\" + two);\\n console.log(\\\"* \\\" + three);\\n console.log(\\\"\\\");//adds a blank space\\n}\",\n \"function writeLabels(){\\n\\t\\t\\n\\t\\t//// SLIDE OUT MENU VARIABLES\\n\\t\\tvar menuArray = [ \\\"Create Station\\\", \\\"Manage Stations\\\" , \\\"Customize Stations\\\", \\\"History\\\",\\\"Settings\\\", \\\"Help\\\"];\\n\\t\\t\\n\\t\\t// Loop that adds individual items to the menu\\n\\t\\tfor ( var i = 0; i < menuArray.length; i++ ) {\\n\\t\\t $('.side-menu').append(\\\"
\\\"+menuArray[i] +\\\"
\\\");\\n\\t\\t}\\n\\t\\t$('.side-menu').append(\\\"\\\");\\n\\t}\",\n \"function asciiConverter() {\\n var code;\\n var output = '';\\n var phrase = document.getElementById('phrase').value; \\n phrase = phrase.split('');\\n for (var i =0; i < phrase.length; i++) {\\n code = phrase[i].charCodeAt(0).toString(2);\\n //accounts for the possibility of missing up to 3 0s at the beginning of the binary code \\n if (code.length !== 8) {\\n code = '0' + code;\\n if (code.length !== 8) {\\n code = '0' + code;\\n }\\n if (code.length !== 8) {\\n code = '0' + code;\\n }\\n }\\n output += code + \\\" \\\";\\n } \\n document.getElementById('ascii').innerHTML = output; \\n}\",\n \"show(hideFirstCard = false)\\n\\t{\\n\\t\\tif (this.numCards == 0)\\n\\t\\t\\treturn;\\n\\n\\t\\tif (hideFirstCard == true)\\n\\t\\t\\tcout(\\\"** \\\");\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tthis.cards[0].print(true);\\n\\t\\t\\tcout(\\\" \\\");\\n\\t\\t}\\n\\n\\t\\tfor (let x = 1; x < this.numCards; x++)\\n\\t\\t{\\n\\t\\t\\tthis.cards[x].print(true);\\n\\t\\t\\tcout(\\\" \\\");\\n\\t\\t}\\n\\t}\",\n \"function instructions(){\\n // \\\\n for a new line in the text, extra lines are concatenated on the end with \\\"+\\\"\\n alert(\\\"Choose your name, then click start, then click on the planet/moon you want to go to or press a number from 1 to 8\\\\n\\\\n\\\"+\\n \\\"Arrow keys or WASD to move\\\\nT to toggle force arrow visibility\\\\nR to restart\\\\nM to go to the menu screen\\\\nNever gonna press Q key\\\\n\\\"+\\n \\\"In free flight mode you can press '+' or '-' to increase or decrease the gravity\\\\n\\\\n\\\"+\\n \\\"Remember to land the lander gently\\\\nLand on the blue landing zone for extra points\\\\nDon't let your fuel get to 0, or you'll crash!\\\\n\\\\n\\\"+\\n \\\"Go to https://doc.co/ys85jg for the User Guide\\\\n\\\\n\\\");\\n}\",\n \"function info(...rest) {\\n const args = [].slice.call(rest);\\n args.unshift('todoist-shortcuts:');\\n args.push('(this is fine)');\\n // eslint-disable-next-line no-console\\n console.log.apply(null, args);\\n }\",\n \"_renderInstructions(parseState) {\\n var firstQuestionNumber = parseState.firstQuestionRef;\\n var firstSentenceRef = parseState.firstSentenceRef;\\n var instructions = \\\"\\\";\\n\\n if (firstQuestionNumber) {\\n instructions += i18n._(\\\"The symbol %(questionSymbol)s indicates that question \\\" + \\\"%(questionNumber)s references this portion of the \\\" + \\\"passage.\\\", {\\n questionSymbol: \\\"[[\\\" + firstQuestionNumber + \\\"]]\\\",\\n questionNumber: firstQuestionNumber\\n });\\n }\\n\\n if (firstSentenceRef) {\\n instructions += i18n._(\\\" The symbol %(sentenceSymbol)s indicates that the \\\" + \\\"following sentence is referenced in a question.\\\", {\\n sentenceSymbol: \\\"[\\\" + firstSentenceRef + \\\"]\\\"\\n });\\n }\\n\\n var parsedInstructions = PassageMarkdown.parse(instructions);\\n return /*#__PURE__*/React$13.createElement(\\\"div\\\", {\\n className: \\\"perseus-widget-passage-instructions\\\"\\n }, PassageMarkdown.output(parsedInstructions));\\n }\",\n \"function showWords(){\\n return profanities;\\n }\",\n \"function printResults() {\\n print.classList.add('active');\\n inputWindow.classList.add('disappear');\\n songInfo.classList.add('active');\\n\\n print.innerHTML = `\\n I see ${inputs[0].value} of ${inputs[1].value}, ${inputs[2].value} ${inputs[3].value}, too.\\n \\n I see ${inputs[4].value} for me and you.\\n \\n And I think to myself, what a ${inputs[5].value} world.\\n `\\n}\",\n \"function changeAlgTitle(algorithm) {\\r\\n\\t$(\\\"#alg-title\\\").html(algorithm);\\r\\n\\t$(\\\".instruction-icon\\\").css(\\\"display\\\",\\\"inline-block\\\").show();\\r\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.6431226","0.617171","0.61614263","0.59077364","0.59055066","0.5897718","0.5867943","0.5835313","0.58263713","0.57487714","0.56595045","0.5656799","0.55863965","0.5564248","0.55637693","0.5557289","0.55472785","0.5522315","0.55000573","0.54943234","0.54871035","0.5475143","0.54469967","0.54399717","0.5438532","0.5430151","0.54297894","0.54116374","0.5393133","0.5391194","0.5389042","0.53514075","0.53513557","0.53496","0.53466934","0.533523","0.5317253","0.53131044","0.5306732","0.53037506","0.5274458","0.52661765","0.52640235","0.5249098","0.52469206","0.5241223","0.5239332","0.52382857","0.5230715","0.5214441","0.5208801","0.51902705","0.5188734","0.5188668","0.51773775","0.5174807","0.5174807","0.5174807","0.51722264","0.5171104","0.5161399","0.51613307","0.51582515","0.51443005","0.51402026","0.5138694","0.5133894","0.51294345","0.512885","0.51221323","0.5118749","0.5114662","0.511384","0.51102185","0.5108123","0.5106637","0.51040655","0.50993556","0.5085317","0.5079418","0.50750244","0.50630516","0.5054524","0.5054462","0.50540394","0.50537366","0.505014","0.504699","0.5044262","0.50433254","0.5041761","0.50336593","0.5031754","0.5024296","0.5017509","0.501149","0.50073254","0.50010544","0.50001234","0.49981427"],"string":"[\n \"0.6431226\",\n \"0.617171\",\n \"0.61614263\",\n \"0.59077364\",\n \"0.59055066\",\n \"0.5897718\",\n \"0.5867943\",\n \"0.5835313\",\n \"0.58263713\",\n \"0.57487714\",\n \"0.56595045\",\n \"0.5656799\",\n \"0.55863965\",\n \"0.5564248\",\n \"0.55637693\",\n \"0.5557289\",\n \"0.55472785\",\n \"0.5522315\",\n \"0.55000573\",\n \"0.54943234\",\n \"0.54871035\",\n \"0.5475143\",\n \"0.54469967\",\n \"0.54399717\",\n \"0.5438532\",\n \"0.5430151\",\n \"0.54297894\",\n \"0.54116374\",\n \"0.5393133\",\n \"0.5391194\",\n \"0.5389042\",\n \"0.53514075\",\n \"0.53513557\",\n \"0.53496\",\n \"0.53466934\",\n \"0.533523\",\n \"0.5317253\",\n \"0.53131044\",\n \"0.5306732\",\n \"0.53037506\",\n \"0.5274458\",\n \"0.52661765\",\n \"0.52640235\",\n \"0.5249098\",\n \"0.52469206\",\n \"0.5241223\",\n \"0.5239332\",\n \"0.52382857\",\n \"0.5230715\",\n \"0.5214441\",\n \"0.5208801\",\n \"0.51902705\",\n \"0.5188734\",\n \"0.5188668\",\n \"0.51773775\",\n \"0.5174807\",\n \"0.5174807\",\n \"0.5174807\",\n \"0.51722264\",\n \"0.5171104\",\n \"0.5161399\",\n \"0.51613307\",\n \"0.51582515\",\n \"0.51443005\",\n \"0.51402026\",\n \"0.5138694\",\n \"0.5133894\",\n \"0.51294345\",\n \"0.512885\",\n \"0.51221323\",\n \"0.5118749\",\n \"0.5114662\",\n \"0.511384\",\n \"0.51102185\",\n \"0.5108123\",\n \"0.5106637\",\n \"0.51040655\",\n \"0.50993556\",\n \"0.5085317\",\n \"0.5079418\",\n \"0.50750244\",\n \"0.50630516\",\n \"0.5054524\",\n \"0.5054462\",\n \"0.50540394\",\n \"0.50537366\",\n \"0.505014\",\n \"0.504699\",\n \"0.5044262\",\n \"0.50433254\",\n \"0.5041761\",\n \"0.50336593\",\n \"0.5031754\",\n \"0.5024296\",\n \"0.5017509\",\n \"0.501149\",\n \"0.50073254\",\n \"0.50010544\",\n \"0.50001234\",\n \"0.49981427\"\n]"},"document_score":{"kind":"string","value":"0.60421604"},"document_rank":{"kind":"string","value":"3"}}},{"rowIdx":3082,"cells":{"query":{"kind":"string","value":"Output the page file"},"document":{"kind":"string","value":"function outputPageFile(fltCompName)\n{\n // Initialize the name, row, and column parameters\n nextColumnHeader = fltCompName + ccdd.getRootStructureTableNames()[0];\n lastSubStructureName = nextColumnHeader;\n columnStep = 20;\n maxColumnLength = columnStep;\n columnOffset = -columnStep - 1;\n maxNumRows = 46;\n rowCount = maxNumRows;\n columnCount = 0;\n inMiddleOfArray = false;\n\n // Check if structure data is provided\n if (numStructRows != 0)\n {\n // Build the page file name and open the page output file\n var baseName = \"auto_\" + fltCompName + ccdd.getRootStructureTableNames()[0];\n var pageFileName = ccdd.getOutputPath() + baseName + \".page\";\n var pageFile = ccdd.openOutputFile(pageFileName);\n\n // Check if the page output file successfully opened\n if (pageFile != null)\n {\n // Begin building the page display. The \"page\" statement must be on\n // the first row\n ccdd.writeToFileLn(pageFile, \"page \" + baseName);\n ccdd.writeToFileLn(pageFile, \"\");\n outputFileCreationInfo(pageFile);\n ccdd.writeToFileLn(pageFile, \"color default (orange, default)\");\n ccdd.writeToFileLn(pageFile, \"color mnedef (text (white, black) )\");\n ccdd.writeToFileLn(pageFile, \"color subpage (lightblue, blue)\");\n ccdd.writeToFileLn(pageFile, \"color array_fmt (royalblue, black)\");\n ccdd.writeToFileLn(pageFile, \"\");\n\n // Output the telemetry display definitions\n outputMnemonics(pageFile, fltCompName);\n\n // Close the page output file\n ccdd.closeFile(pageFile);\n }\n // The page output file cannot be opened\n else\n {\n // Display an error dialog\n ccdd.showErrorDialog(\"Error opening telemetry output file '\" + pageFileName + \"'\");\n }\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function writeOut(page) {\n var n = Math.floor(fs.readdirSync(getFolder()).length / subreddits.length);\n n = n === 0 ? 1 : n;\n // save the text version of this page for your viewing pleasure\n fs.writeFile(\n // file name\n getFolder() + String(n) + \"-\" + page.post.title.toCamelCase(18) + \".txt\", \n // file content\n page.header + page.post.content + page.comments, \n // If things went well, add to cache so we don't re-reddget it\n function (err) { fs.appendFileSync(getFolder().slice(0, -9) + '.cache', id + '\\n'); });\n }","function writePage() {\n readFiles(src);\n\n const page = src + \"/index.html\";\n const content = getContent(filesArr);\n const data = template.replace(\"<% code %>\", content);\n\n fs.writeFile(page, data, (err) => {\n if (err) throw err;\n console.log(\"It's saved!\");\n });\n}","display() {\n fs.writeFile(outputFile, makeHtml(this.team), function (err){\n if (err) {\n console.log(err)\n } else {\n console.log(\"Made file!\");\n }\n });\n }","function printHTML() {\n const html = render(employeeArr);\n fs.writeFile(outputPath, html, (err) => {\n if (err) throw err;\n console.log(\"HTML successfully generated and saved to ./output.\");\n return;\n });\n}","function buildPage(file, data) {\n // Create a file called teamprofilepage.html, adding the input data transformed by generateHTML.js formatting.\n fs.writeFile(\"./dist/teampage.html\", generateHTML(data), function (error) {\n // If file created successfull, notify user of success in the command line interface. If error, notify user in the command line interface.\n if(error) {\n console.log(\"An unknown error occurred.\")\n }\n else {\n console.log(\"Your teampage.html file has been created successfully!\")\n }\n })\n}","function OutFile() {\r\n}","saveAsOneFile() {\r\n // HTML exportation\r\n this.saveFile('index', 'HTML', this.content)\r\n // We show the export result\r\n setTimeout(this.showOutput, 2500)\r\n }","function exportPage() {\n // generate html page\n const page = `${html}`;\n \n // create html blob with html we created\n const blob = new Blob([ page ], { type: \"text/html\" });\n\n // create a download link\n const el = window.document.createElement(\"a\");\n el.href = window.URL.createObjectURL(blob);\n el.download = \"htmlearn_export.html\"; \n\n // add link to document so we can click, then remove it\n document.body.appendChild(el);\n el.click(); \n document.body.removeChild(el);\n}","function outputPageContent() {\n \n $('#APIdata').html(outhtml); // this prints the apidata in the blank div section in the html\n }","function _generateFooterReport() {\n\t\n\n\tthis.htmlFile.writeln( \"\");\n\tthis.htmlFile.writeln( \"
![](\\\"images/fine_tune.png\\\")
\");\n\t}","function asciiConverter() {\n var code;\n var output = '';\n var phrase = document.getElementById('phrase').value; \n phrase = phrase.split('');\n for (var i =0; i < phrase.length; i++) {\n code = phrase[i].charCodeAt(0).toString(2);\n //accounts for the possibility of missing up to 3 0s at the beginning of the binary code \n if (code.length !== 8) {\n code = '0' + code;\n if (code.length !== 8) {\n code = '0' + code;\n }\n if (code.length !== 8) {\n code = '0' + code;\n }\n }\n output += code + \" \";\n } \n document.getElementById('ascii').innerHTML = output; \n}","show(hideFirstCard = false)\n\t{\n\t\tif (this.numCards == 0)\n\t\t\treturn;\n\n\t\tif (hideFirstCard == true)\n\t\t\tcout(\"** \");\n\t\telse\n\t\t{\n\t\t\tthis.cards[0].print(true);\n\t\t\tcout(\" \");\n\t\t}\n\n\t\tfor (let x = 1; x < this.numCards; x++)\n\t\t{\n\t\t\tthis.cards[x].print(true);\n\t\t\tcout(\" \");\n\t\t}\n\t}","function instructions(){\n // \\n for a new line in the text, extra lines are concatenated on the end with \"+\"\n alert(\"Choose your name, then click start, then click on the planet/moon you want to go to or press a number from 1 to 8\\n\\n\"+\n \"Arrow keys or WASD to move\\nT to toggle force arrow visibility\\nR to restart\\nM to go to the menu screen\\nNever gonna press Q key\\n\"+\n \"In free flight mode you can press '+' or '-' to increase or decrease the gravity\\n\\n\"+\n \"Remember to land the lander gently\\nLand on the blue landing zone for extra points\\nDon't let your fuel get to 0, or you'll crash!\\n\\n\"+\n \"Go to https://doc.co/ys85jg for the User Guide\\n\\n\");\n}","function info(...rest) {\n const args = [].slice.call(rest);\n args.unshift('todoist-shortcuts:');\n args.push('(this is fine)');\n // eslint-disable-next-line no-console\n console.log.apply(null, args);\n }","_renderInstructions(parseState) {\n var firstQuestionNumber = parseState.firstQuestionRef;\n var firstSentenceRef = parseState.firstSentenceRef;\n var instructions = \"\";\n\n if (firstQuestionNumber) {\n instructions += i18n._(\"The symbol %(questionSymbol)s indicates that question \" + \"%(questionNumber)s references this portion of the \" + \"passage.\", {\n questionSymbol: \"[[\" + firstQuestionNumber + \"]]\",\n questionNumber: firstQuestionNumber\n });\n }\n\n if (firstSentenceRef) {\n instructions += i18n._(\" The symbol %(sentenceSymbol)s indicates that the \" + \"following sentence is referenced in a question.\", {\n sentenceSymbol: \"[\" + firstSentenceRef + \"]\"\n });\n }\n\n var parsedInstructions = PassageMarkdown.parse(instructions);\n return /*#__PURE__*/React$13.createElement(\"div\", {\n className: \"perseus-widget-passage-instructions\"\n }, PassageMarkdown.output(parsedInstructions));\n }","function showWords(){\n return profanities;\n }","function printResults() {\n print.classList.add('active');\n inputWindow.classList.add('disappear');\n songInfo.classList.add('active');\n\n print.innerHTML = `\n I see ${inputs[0].value} of ${inputs[1].value}, ${inputs[2].value} ${inputs[3].value}, too.\n ![](\\\\\\\"images/fine_tune.png\\\\\\\")
\\\");\\n\\t}\",\n \"function asciiConverter() {\\n var code;\\n var output = '';\\n var phrase = document.getElementById('phrase').value; \\n phrase = phrase.split('');\\n for (var i =0; i < phrase.length; i++) {\\n code = phrase[i].charCodeAt(0).toString(2);\\n //accounts for the possibility of missing up to 3 0s at the beginning of the binary code \\n if (code.length !== 8) {\\n code = '0' + code;\\n if (code.length !== 8) {\\n code = '0' + code;\\n }\\n if (code.length !== 8) {\\n code = '0' + code;\\n }\\n }\\n output += code + \\\" \\\";\\n } \\n document.getElementById('ascii').innerHTML = output; \\n}\",\n \"show(hideFirstCard = false)\\n\\t{\\n\\t\\tif (this.numCards == 0)\\n\\t\\t\\treturn;\\n\\n\\t\\tif (hideFirstCard == true)\\n\\t\\t\\tcout(\\\"** \\\");\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tthis.cards[0].print(true);\\n\\t\\t\\tcout(\\\" \\\");\\n\\t\\t}\\n\\n\\t\\tfor (let x = 1; x < this.numCards; x++)\\n\\t\\t{\\n\\t\\t\\tthis.cards[x].print(true);\\n\\t\\t\\tcout(\\\" \\\");\\n\\t\\t}\\n\\t}\",\n \"function instructions(){\\n // \\\\n for a new line in the text, extra lines are concatenated on the end with \\\"+\\\"\\n alert(\\\"Choose your name, then click start, then click on the planet/moon you want to go to or press a number from 1 to 8\\\\n\\\\n\\\"+\\n \\\"Arrow keys or WASD to move\\\\nT to toggle force arrow visibility\\\\nR to restart\\\\nM to go to the menu screen\\\\nNever gonna press Q key\\\\n\\\"+\\n \\\"In free flight mode you can press '+' or '-' to increase or decrease the gravity\\\\n\\\\n\\\"+\\n \\\"Remember to land the lander gently\\\\nLand on the blue landing zone for extra points\\\\nDon't let your fuel get to 0, or you'll crash!\\\\n\\\\n\\\"+\\n \\\"Go to https://doc.co/ys85jg for the User Guide\\\\n\\\\n\\\");\\n}\",\n \"function info(...rest) {\\n const args = [].slice.call(rest);\\n args.unshift('todoist-shortcuts:');\\n args.push('(this is fine)');\\n // eslint-disable-next-line no-console\\n console.log.apply(null, args);\\n }\",\n \"_renderInstructions(parseState) {\\n var firstQuestionNumber = parseState.firstQuestionRef;\\n var firstSentenceRef = parseState.firstSentenceRef;\\n var instructions = \\\"\\\";\\n\\n if (firstQuestionNumber) {\\n instructions += i18n._(\\\"The symbol %(questionSymbol)s indicates that question \\\" + \\\"%(questionNumber)s references this portion of the \\\" + \\\"passage.\\\", {\\n questionSymbol: \\\"[[\\\" + firstQuestionNumber + \\\"]]\\\",\\n questionNumber: firstQuestionNumber\\n });\\n }\\n\\n if (firstSentenceRef) {\\n instructions += i18n._(\\\" The symbol %(sentenceSymbol)s indicates that the \\\" + \\\"following sentence is referenced in a question.\\\", {\\n sentenceSymbol: \\\"[\\\" + firstSentenceRef + \\\"]\\\"\\n });\\n }\\n\\n var parsedInstructions = PassageMarkdown.parse(instructions);\\n return /*#__PURE__*/React$13.createElement(\\\"div\\\", {\\n className: \\\"perseus-widget-passage-instructions\\\"\\n }, PassageMarkdown.output(parsedInstructions));\\n }\",\n \"function showWords(){\\n return profanities;\\n }\",\n \"function printResults() {\\n print.classList.add('active');\\n inputWindow.classList.add('disappear');\\n songInfo.classList.add('active');\\n\\n print.innerHTML = `\\n I see ${inputs[0].value} of ${inputs[1].value}, ${inputs[2].value} ${inputs[3].value}, too.\\n