0) {\n\t\t\txx += m.gap * slope;\n\t\t\tyy += m.gap;\n\t\t}\n\n\t\t// Calculate actual coordinates, moving padding away from the center.\n\t\txx0 = 2 * xx + m.padding;\n\t\tyy0 = 2 * yy - slope * m.padding;\n\n\t\t// Shift the whole along the panel’s leg when on the other (left) side.\n\t\tif (leftHalf) {\n\t\t\txx0 -= z.leg;\n\t\t\tyy0 += slope * z.leg;\n\t\t}\n\n\t\t// Now we’re at the origin. Calculate transform strings here.\n\t\tpanel.transform = translate(xx0, yy0);\n\n\t\t// In the lowerHalf, align the start of the text with the previous\n\t\t// start position, so shift it right by one unit.\n\t\tpanel.originText = translate(xx0 + (lowerHalf ? -2 * slope : 0), yy0);\n\t\tpanel.originEntries = translate(2 * slope, 2);\n\n\t\txx += panel.entries.length * slope;\n\t\tyy += panel.entries.length;\n\t}\n\treturn yy;\n}","title":""},{"docid":"896bcfb40b1a6402feb10526ec6adfd9","score":"0.5237274","text":"updateCameraMatrix () {\n mat4.fromRotationTranslation (this.view, this.rotation, this.position);\n mat4.invert (this.view, this.view);\n }","title":""},{"docid":"db76a9603a7e471290a2aeaa92482548","score":"0.52325594","text":"function rotateMatrixInPlace(matrix){\n for(var layer = 0; layer < matrix.length / 2; layer++){\n var first = layer;\n var last = matrix.length-1-layer;\n for(var i = first; i < last; i++){\n var offset = i - layer;\n\n var top = matrix[first][i]\n //left to top\n matrix[first][i] = matrix[last - offset][first];\n\n //bottom to left\n matrix[last-offset][first] = matrix[last][last - offset];\n\n // right to bottom\n matrix[last][last-offset] = matrix[i][last];\n\n //top to right\n matrix[i][last] = top;\n }\n }\n return matrix\n}","title":""},{"docid":"d1723956e47673c080b6f6d828a84e34","score":"0.52302504","text":"function arrayRotateFrontClockwise() {\n arrayRotateFaceClockwise(\"F\");\n \n var s1 = new Cubelet(), s2 = new Cubelet(), s3 = new Cubelet();\n\n createDeepCopy(s1, cubelets[3][2][0]);\n createDeepCopy(s2, cubelets[3][2][1]);\n createDeepCopy(s3, cubelets[3][2][2]);\n\n arrayShiftCol (2, 0, s1, s2, s3);\n arrayShiftRowReverse(4, 0, s1, s2, s3);\n arrayShiftCol(1, 2, s1, s2, s3);\n arrayShiftRowReverse(3, 2, s1, s2, s3);\n\n}","title":""},{"docid":"cbd3b2c0c9ac34f5d37f3fdfcc4dd184","score":"0.5224209","text":"function setupBuffers() {\n vertexPositionBuffer = gl.createBuffer();\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexPositionBuffer);\n triangleVertices = [\n //Top Bar\n -0.65 , 0.9, 0.0,\n -0.65, 0.75, 0.0,\n 0.65, 0.75, 0.0,\n \n -0.65, 0.9, 0.0,\n 0.65, 0.9, 0.0,\n 0.65, 0.75, 0.0,\n //Left of I\n -0.55, 0.75, 0.0,\n -0.25, 0.75, 0.0,\n -0.25, 0.55, 0.0,\n \n -0.55, 0.75, 0.0,\n -0.25, 0.55, 0.0,\n -0.55, 0.02, 0.0,\n\n -0.55, 0.02, 0.0,\n -0.25, 0.55, 0.0,\n -0.25, 0.02, 0.0,\n \n -0.25, 0.55, 0.0,\n -0.15, 0.55, 0.0,\n -0.15, 0.2, 0.0,\n \n -0.25, 0.55, 0.0,\n -0.25, 0.2, 0.0,\n -0.15, 0.2, 0.0,\n //Right of I\n 0.55, 0.75, 0.0,\n 0.25, 0.75, 0.0,\n 0.25, 0.55, 0.0,\n \n 0.55, 0.75, 0.0,\n 0.25, 0.55, 0.0,\n 0.55, 0.02, 0.0,\n\n 0.55, 0.02, 0.0,\n 0.25, 0.55, 0.0,\n 0.25, 0.02, 0.0,\n \n 0.25, 0.55, 0.0,\n 0.15, 0.55, 0.0,\n 0.15, 0.2, 0.0,\n \n 0.25, 0.55, 0.0,\n 0.25, 0.2, 0.0,\n 0.15, 0.2, 0.0,\n //Red/orange Lining (left)\n -0.55, -0.02, 0.0,\n -0.45, -0.02, 0.0,\n -0.55, -0.1, 0.0,\n \n -0.45, -0.02, 0.0,\n -0.55, -0.1, 0.0,\n -0.45, -0.15, 0.0,\n\n -0.35, -0.02, 0.0,\n -0.35, -0.2, 0.0,\n -0.25, -0.02, 0.0,\n \n -0.35, -0.2, 0.0,\n -0.25, -0.25, 0.0,\n -0.25, -0.02, 0.0,\n \n -0.15, -0.02, 0.0,\n -0.15, -0.3, 0.0,\n -0.05, -0.02, 0.0,\n \n -0.05, -0.02, 0.0,\n -0.15, -0.3, 0.0,\n -0.05, -0.35, 0.0,\n //Orange Lining (right)\n 0.55, -0.02, 0.0,\n 0.45, -0.02, 0.0,\n 0.55, -0.1, 0.0,\n \n 0.45, -0.02, 0.0,\n 0.55, -0.1, 0.0,\n 0.45, -0.15, 0.0,\n\n 0.35, -0.02, 0.0,\n 0.35, -0.2, 0.0,\n 0.25, -0.02, 0.0,\n \n 0.35, -0.2, 0.0,\n 0.25, -0.25, 0.0,\n 0.25, -0.02, 0.0,\n \n 0.15, -0.02, 0.0,\n 0.15, -0.3, 0.0,\n 0.05, -0.02, 0.0,\n \n 0.05, -0.02, 0.0,\n 0.15, -0.3, 0.0,\n 0.05, -0.35, 0.0\n ]\n \n \n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(triangleVertices), gl.STATIC_DRAW);\n vertexPositionBuffer.itemSize = 3;\n vertexPositionBuffer.numberOfItems = (3*24);\n \n vertexColorBuffer = gl.createBuffer();\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexColorBuffer);\n var colors = [\n //top bar\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n \n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n //left of I\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n \n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n \n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n \n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n \n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n //Right of I\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n \n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n \n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n \n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n \n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n 0.0, 0.0, 0.3, 1.0,\n //Orange Lining\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n //Orange Lining\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n \n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0,\n 1.0, 0.2, 0.0, 1.0\n ];\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(colors), gl.STATIC_DRAW);\n vertexColorBuffer.itemSize = 4;\n vertexColorBuffer.numItems = (3*24); \n}","title":""},{"docid":"5c43c7d7ebc5d1d2fb4995c5d065dbe7","score":"0.5224195","text":"function transformTo2D(vertex) {\n return { x: vertex.x, y: vertex.y };\n }","title":""},{"docid":"39396601a6bd7ff45ae9761055f031e2","score":"0.522289","text":"function loadVertices() {\r\n cubeVertexBuffer0 = gl.createBuffer();\r\n cubeVertexBuffer1 = gl.createBuffer();\r\n cubeVertexBuffer2 = gl.createBuffer();\r\n cubeVertexBuffer3 = gl.createBuffer();\r\n cubeVertexBuffer4 = gl.createBuffer();\r\n cubeVertexBuffer5 = gl.createBuffer();\r\n var vright = [\r\n 0.5, -0.5, -0.5,\r\n 0.5, 0.5, -0.5,\r\n 0.5, 0.5, 0.5,\r\n 0.5, -0.5, 0.5\r\n ];\r\n var vleft = [\r\n -0.5, -0.5, -0.5,\r\n -0.5, -0.5, 0.5,\r\n -0.5, 0.5, 0.5,\r\n -0.5, 0.5, -0.5\r\n ];\r\n\r\n var vfront = [\r\n -0.5, -0.5, 0.5,\r\n 0.5, -0.5, 0.5,\r\n 0.5, 0.5, 0.5,\r\n -0.5, 0.5, 0.5\r\n ];\r\n\r\n var vback = [\r\n -0.5, -0.5, -0.5,\r\n -0.5, 0.5, -0.5,\r\n 0.5, 0.5, -0.5,\r\n 0.5, -0.5, -0.5\r\n];\r\n var vbottom = [\r\n -0.5, -0.5, -0.5,\r\n 0.5, -0.5, -0.5,\r\n 0.5, -0.5, 0.5,\r\n -0.5, -0.5, 0.5,\r\n ];\r\n var vtop = [\r\n -0.5, 0.5, -0.5,\r\n -0.5, 0.5, 0.5,\r\n 0.5, 0.5, 0.5,\r\n 0.5, 0.5, -0.5\r\n];\r\n\r\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer0);\r\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vleft), gl.STATIC_DRAW);\r\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer1);\r\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vright), gl.STATIC_DRAW);\r\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer2);\r\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vbottom), gl.STATIC_DRAW);\r\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer3);\r\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vtop), gl.STATIC_DRAW);\r\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer4);\r\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vback), gl.STATIC_DRAW);\r\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer5);\r\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vfront), gl.STATIC_DRAW);\r\n\r\n}","title":""},{"docid":"5796b23c1940939c688fcf68b4bc50cb","score":"0.5220593","text":"edges() {\n if (this.pos.x <= this.r) {\n this.pos.x = this.r;\n this.vel.x *= -1;\n }\n\n if (this.pos.x >= width - this.r) {\n this.pos.x = width - this.r;\n this.vel.x *= -1;\n }\n\n if (this.pos.y <= this.r) {\n this.pos.y = this.r;\n this.vel.y *= -1;\n }\n\n if (this.pos.y >= height - this.r) {\n this.pos.y = height - this.r;\n this.vel.y *= -1;\n }\n }","title":""},{"docid":"0a15e33b3bcd442695c22abfd19cd346","score":"0.52129316","text":"function updateCurrentSide(){\n if(mouseX < width/2){\n onLeft = true;\n onRight = false;\n }\n else{\n onLeft = false;\n onRight = true;\n }\n}","title":""},{"docid":"9b3c3e39bcdba5fbaf11cf02902a1221","score":"0.5203084","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n }","title":""},{"docid":"9b3c3e39bcdba5fbaf11cf02902a1221","score":"0.5203084","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n }","title":""},{"docid":"f06db9676522f6127bb4cb6a79278ba3","score":"0.51958585","text":"function flip(triangle1, triangle2)\n{\n // Each triangle is made up of three points and in this case two of\n // them are shared, because the triangles must have a common edge --\n // we search for the indices of the points that are *not* shared\n // between the two.\n var index1 = findNotContainedPoint(triangle1.points, triangle2.points);\n var index2 = findNotContainedPoint(triangle2.points, triangle1.points);\n\n //DEBUG: assert(index1 != null);\n //DEBUG: assert(index2 != null);\n //DEBUG: assert(0 <= index1 && index1 <= 2);\n //DEBUG: assert(0 <= index2 && index2 <= 2);\n\n //DEBUG: console.log(\"flipping: \" + triangle1 + \" with \" + triangle2);\n\n var swapIndex1 = (index1 + 1) % 3;\n var swapIndex2 = findRemainingIndex(triangle2.points, triangle2.points[index2], triangle1.points[swapIndex1]);\n\n // The actual edge flip is pretty simple.\n triangle1.setPoint(swapIndex1, triangle2.points[index2]);\n triangle2.setPoint(swapIndex2, triangle1.points[index1]);\n\n // Backup the neighbors of the triangles (actually we only need\n // oldNeighbors1 but for orthogonality we copy both).\n var oldNeighbors1 = triangle1.neighbors.concat([]);\n var oldNeighbors2 = triangle2.neighbors.concat([]);\n\n // Calculate the indices of the neighbors that need to be updated.\n var index11 = (swapIndex1 + 2) % 3;\n var index12 = swapIndex1;\n var index21 = (swapIndex2 + 2) % 3;\n var index22 = swapIndex2;\n\n // Fix the references to (and from) other neighboring triangles.\n replaceNeighbor(triangle1.neighbors[index11], triangle1, triangle2);\n triangle1.neighbors[index11] = triangle2;\n triangle1.neighbors[index12] = oldNeighbors2[index2];\n\n replaceNeighbor(triangle2.neighbors[index21], triangle2, triangle1);\n triangle2.neighbors[index21] = triangle1;\n triangle2.neighbors[index22] = oldNeighbors1[index1];\n\n //DEBUG: console.log(\"done: \" + triangle1 + \" with \" + triangle2);\n}","title":""},{"docid":"9be9574ff18c6c6fa9facc0a5ebd0832","score":"0.51935583","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t\t// coords are transformed into non-negative 15-bit integer range\n\n\t\tx = 32767 * ( x - minX ) * invSize;\n\t\ty = 32767 * ( y - minY ) * invSize;\n\n\t\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\t\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\t\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\t\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\t\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\t\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\t\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\t\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\t\treturn x | ( y << 1 );\n\n\t}","title":""},{"docid":"9be9574ff18c6c6fa9facc0a5ebd0832","score":"0.51935583","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t\t// coords are transformed into non-negative 15-bit integer range\n\n\t\tx = 32767 * ( x - minX ) * invSize;\n\t\ty = 32767 * ( y - minY ) * invSize;\n\n\t\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\t\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\t\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\t\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\t\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\t\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\t\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\t\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\t\treturn x | ( y << 1 );\n\n\t}","title":""},{"docid":"9be9574ff18c6c6fa9facc0a5ebd0832","score":"0.51935583","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t\t// coords are transformed into non-negative 15-bit integer range\n\n\t\tx = 32767 * ( x - minX ) * invSize;\n\t\ty = 32767 * ( y - minY ) * invSize;\n\n\t\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\t\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\t\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\t\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\t\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\t\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\t\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\t\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\t\treturn x | ( y << 1 );\n\n\t}","title":""},{"docid":"9be9574ff18c6c6fa9facc0a5ebd0832","score":"0.51935583","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t\t// coords are transformed into non-negative 15-bit integer range\n\n\t\tx = 32767 * ( x - minX ) * invSize;\n\t\ty = 32767 * ( y - minY ) * invSize;\n\n\t\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\t\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\t\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\t\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\t\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\t\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\t\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\t\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\t\treturn x | ( y << 1 );\n\n\t}","title":""},{"docid":"e98c134955c1bca13c266ed881821fe5","score":"0.51932603","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t\t// coords are transformed into non-negative 15-bit integer range\n\t\tx = 32767 * ( x - minX ) * invSize;\n\t\ty = 32767 * ( y - minY ) * invSize;\n\n\t\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\t\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\t\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\t\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\t\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\t\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\t\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\t\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\t\treturn x | ( y << 1 );\n\n\t}","title":""},{"docid":"65ca0b8013b31403c2c469aeba4d1f4a","score":"0.5188302","text":"paintFaceX(verts) {\n // Compute the 2D coordinates\n let v2D = verts.map(v => [v[0]-v[2], v[1]]);\n this.paintFace(v2D, verts, false);\n }","title":""},{"docid":"1400fbb37f1162ee27615478670538b2","score":"0.51853716","text":"changeCubePosition(face) {\n let temp;\n for (let x = 0; x < 3; x++) {\n for (let y = 0; y < 3; y++) {\n for (let z = 0; z < 3; z++) {\n switch (face) {\n case \"L\":\n if (this.cubes[x][y][z].cubePosition[0] === -1) {\n temp = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[1];\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[2]);\n this.cubes[x][y][z].rotationAxis[2] = temp;\n }\n break;\n case \"l\":\n if (this.cubes[x][y][z].cubePosition[0] === -1) {\n temp = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[2];\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[1]);\n this.cubes[x][y][z].rotationAxis[1] = temp;\n }\n break;\n case \"R\":\n if (this.cubes[x][y][z].cubePosition[0] === 1) {\n temp = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[2];\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[1]);\n this.cubes[x][y][z].rotationAxis[1] = temp;\n }\n break;\n case \"r\":\n if (this.cubes[x][y][z].cubePosition[0] === 1) {\n temp = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = -temp;\n\n\n temp = this.cubes[x][y][z].rotationAxis[1];\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[2]);\n this.cubes[x][y][z].rotationAxis[2] = temp;\n }\n break;\n case \"U\":\n if (this.cubes[x][y][z].cubePosition[1] === 1) {\n temp = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[0];\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[2]);\n this.cubes[x][y][z].rotationAxis[2] = temp;\n }\n break;\n case \"u\":\n if (this.cubes[x][y][z].cubePosition[1] === 1) {\n temp = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[2];\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[0]);\n this.cubes[x][y][z].rotationAxis[0] = temp;\n }\n break;\n case \"D\":\n if (this.cubes[x][y][z].cubePosition[1] === -1) {\n temp = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[2];\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[0]);\n this.cubes[x][y][z].rotationAxis[0] = temp;\n }\n break;\n case \"d\":\n if (this.cubes[x][y][z].cubePosition[1] === -1) {\n temp = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[0];\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[2]);\n this.cubes[x][y][z].rotationAxis[2] = temp;\n }\n break;\n case \"E\":\n if (this.cubes[x][y][z].cubePosition[1] === 0) {\n temp = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[2];\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[0]);\n this.cubes[x][y][z].rotationAxis[0] = temp;\n }\n break;\n case \"e\":\n if (this.cubes[x][y][z].cubePosition[1] === 0) {\n temp = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[0];\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[2]);\n this.cubes[x][y][z].rotationAxis[2] = temp;\n }\n break;\n case \"F\":\n if (this.cubes[x][y][z].cubePosition[2] === 1) {\n temp = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[1];\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[0]);\n this.cubes[x][y][z].rotationAxis[0] = temp;\n }\n break;\n case \"f\":\n if (this.cubes[x][y][z].cubePosition[2] === 1) {\n temp = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[0];\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[1]);\n this.cubes[x][y][z].rotationAxis[1] = temp;\n }\n break;\n case \"S\":\n if (this.cubes[x][y][z].cubePosition[2] === 0) {\n temp = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[1];\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[0]);\n this.cubes[x][y][z].rotationAxis[0] = temp;\n }\n break;\n case \"s\":\n if (this.cubes[x][y][z].cubePosition[2] === 0) {\n temp = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[0];\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[1]);\n this.cubes[x][y][z].rotationAxis[1] = temp;\n }\n break;\n case \"B\":\n if (this.cubes[x][y][z].cubePosition[2] === -1) {\n temp = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[0];\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[1]);\n this.cubes[x][y][z].rotationAxis[1] = temp;\n }\n break;\n case \"b\":\n if (this.cubes[x][y][z].cubePosition[2] === -1) {\n temp = this.cubes[x][y][z].cubePosition[0];\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[1];\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[0]);\n this.cubes[x][y][z].rotationAxis[0] = temp;\n }\n break;\n case \"M\":\n if (this.cubes[x][y][z].cubePosition[0] === 0) {\n temp = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[1];\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[2]);\n this.cubes[x][y][z].rotationAxis[2] = temp;\n }\n break;\n case \"m\":\n if (this.cubes[x][y][z].cubePosition[0] === 0) {\n temp = this.cubes[x][y][z].cubePosition[1];\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[2];\n this.cubes[x][y][z].cubePosition[2] = -temp;\n\n temp = this.cubes[x][y][z].rotationAxis[2];\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[1]);\n this.cubes[x][y][z].rotationAxis[1] = temp;\n }\n }\n }\n }\n }\n }","title":""},{"docid":"ed5712446f2b57052256716c733acbae","score":"0.5184816","text":"function matrix_invert(matrix) {\n var M = matrix.m;\n // I use Guassian Elimination to calculate the inverse:\n // (1) 'augment' the matrix (left) by the identity (on the right)\n // (2) Turn the matrix on the left into the identity by elemetry row ops\n // (3) The matrix on the right is the inverse (was the identity matrix)\n // There are 3 elemtary row ops: (I combine b and c in my code)\n // (a) Swap 2 rows\n // (b) Multiply a row by a scalar\n // (c) Add 2 rows\n\n //if the matrix isn't square: exit (error)\n if (M.length !== M[0].length) {\n return;\n }\n\n //create the identity matrix (I), and a copy (C) of the original\n var i = 0,\n ii = 0,\n j = 0,\n dim = M.length,\n e = 0,\n t = 0;\n var I = [],\n C = [];\n for (i = 0; i < dim; i += 1) {\n // Create the row\n I[I.length] = [];\n C[C.length] = [];\n for (j = 0; j < dim; j += 1) {\n //if we're on the diagonal, put a 1 (for identity)\n if (i == j) {\n I[i][j] = 1;\n } else {\n I[i][j] = 0;\n }\n\n // Also, make the copy of the original\n C[i][j] = M[i][j];\n }\n }\n\n // Perform elementary row operations\n for (i = 0; i < dim; i += 1) {\n // get the element e on the diagonal\n e = C[i][i];\n\n // if we have a 0 on the diagonal (we'll need to swap with a lower row)\n if (e == 0) {\n //look through every row below the i'th row\n for (ii = i + 1; ii < dim; ii += 1) {\n //if the ii'th row has a non-0 in the i'th col\n if (C[ii][i] != 0) {\n //it would make the diagonal have a non-0 so swap it\n for (j = 0; j < dim; j++) {\n e = C[i][j]; //temp store i'th row\n C[i][j] = C[ii][j]; //replace i'th row by ii'th\n C[ii][j] = e; //repace ii'th by temp\n e = I[i][j]; //temp store i'th row\n I[i][j] = I[ii][j]; //replace i'th row by ii'th\n I[ii][j] = e; //repace ii'th by temp\n }\n //don't bother checking other rows since we've swapped\n break;\n }\n }\n //get the new diagonal\n e = C[i][i];\n //if it's still 0, not invertable (error)\n if (e == 0) {\n return;\n }\n }\n\n // Scale this row down by e (so we have a 1 on the diagonal)\n for (j = 0; j < dim; j++) {\n C[i][j] = C[i][j] / e; //apply to original matrix\n I[i][j] = I[i][j] / e; //apply to identity\n }\n\n // Subtract this row (scaled appropriately for each row) from ALL of\n // the other rows so that there will be 0's in this column in the\n // rows above and below this one\n for (ii = 0; ii < dim; ii++) {\n // Only apply to other rows (we want a 1 on the diagonal)\n if (ii == i) {\n continue;\n }\n\n // We want to change this element to 0\n e = C[ii][i];\n\n // Subtract (the row above(or below) scaled by e) from (the\n // current row) but start at the i'th column and assume all the\n // stuff left of diagonal is 0 (which it should be if we made this\n // algorithm correctly)\n for (j = 0; j < dim; j++) {\n C[ii][j] -= e * C[i][j]; //apply to original matrix\n I[ii][j] -= e * I[i][j]; //apply to identity\n }\n }\n }\n\n //we've done all operations, C should be the identity\n //matrix I should be the inverse:\n return I;\n}","title":""},{"docid":"ae2b23506ee188265a81570fb4f8cb9b","score":"0.51790154","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n }","title":""},{"docid":"ae2b23506ee188265a81570fb4f8cb9b","score":"0.51790154","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n }","title":""},{"docid":"ed88f73aa1248e6e65879469dbce3f50","score":"0.516717","text":"synchronizeTransform() {\r\n this.m_xf.R.set$float(this.m_sweep.a);\r\n let v1 = this.m_sweep.localCenter;\r\n this.m_xf.position.x = Math.fround(this.m_sweep.c.x - (Math.fround(Math.fround(this.m_xf.R.col1.x * v1.x) + Math.fround(this.m_xf.R.col2.x * v1.y))));\r\n this.m_xf.position.y = Math.fround(this.m_sweep.c.y - (Math.fround(Math.fround(this.m_xf.R.col1.y * v1.x) + Math.fround(this.m_xf.R.col2.y * v1.y))));\r\n }","title":""},{"docid":"49d83c5e0a823294498676f1bd1193f8","score":"0.516669","text":"constructor(color) {\n super(color);\n\n this.vertices = new Float32Array([ // Coordinates\n 1.0, 1.0, 1.0, -1.0, 1.0, 1.0, -1.0,-1.0, 1.0, 1.0,-1.0, 1.0, // v0-v1-v2-v3 front\n 1.0, 1.0, 1.0, 1.0,-1.0, 1.0, 1.0,-1.0,-1.0, 1.0, 1.0,-1.0, // v0-v3-v4-v5 right\n 1.0, 1.0, 1.0, 1.0, 1.0,-1.0, -1.0, 1.0,-1.0, -1.0, 1.0, 1.0, // v0-v5-v6-v1 up\n -1.0, 1.0, 1.0, -1.0, 1.0,-1.0, -1.0,-1.0,-1.0, -1.0,-1.0, 1.0, // v1-v6-v7-v2 left\n -1.0,-1.0,-1.0, 1.0,-1.0,-1.0, 1.0,-1.0, 1.0, -1.0,-1.0, 1.0, // v7-v4-v3-v2 down\n 1.0,-1.0,-1.0, -1.0,-1.0,-1.0, -1.0, 1.0,-1.0, 1.0, 1.0,-1.0 // v4-v7-v6-v5 back\n ]);\n\n this.normals = new Float32Array([ // Normal\n 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, // v0-v1-v2-v3 front\n 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, // v0-v3-v4-v5 right\n 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, // v0-v5-v6-v1 up\n -1.0, 0.0, 0.0, -1.0, 0.0, 0.0, -1.0, 0.0, 0.0, -1.0, 0.0, 0.0, // v1-v6-v7-v2 left\n 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, // v7-v4-v3-v2 down\n 0.0, 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, 0.0,-1.0 // v4-v7-v6-v5 back\n ]);\n\n // Indices of the vertices\n this.indices = new Uint16Array([\n 0, 1, 2, 0, 2, 3, // front\n 4, 5, 6, 4, 6, 7, // right\n 8, 9,10, 8,10,11, // up\n 12,13,14, 12,14,15, // left\n 16,17,18, 16,18,19, // down\n 20,21,22, 20,22,23 // back\n ]);\n }","title":""},{"docid":"3c3f93e642cda86063b85542bdfaf1b2","score":"0.5165795","text":"function uploadInvViewMatrixToShader() {\r\n gl.uniformMatrix3fv(shaderProgram.uInvVMatrix, false, invVMatrix);\r\n}","title":""},{"docid":"8d9a7dc7a934b7ebf6058c9d404d74f4","score":"0.5163623","text":"function draw2(){\r\n gl.viewport(0, 0, gl.viewportWidth, gl.viewportHeight);\r\n gl.clear(gl.COLOR_BUFFER_BIT | gl.DEPTH_BUFFER_BIT); \r\n mat4.identity(mvMatrix);\r\n mat4.rotateY(mvMatrix, mvMatrix, degToRad(rotAngle));\r\n // var rotateM = mat4.create();\r\n // var scaleM = mat4.create();\r\n // var scale = Math.abs(Math.cos(degToRad(rotAngle)));\r\n // mat4.fromScaling(scaleM,[0.5+0.5*scale,1.0,1.0]);\r\n // mat4.fromRotation(rotateM,degToRad(rotAngle),[0.0,0.0,1.0]);\r\n // mat4.multiply(mvMatrix,mvMatrix,rotateM);\r\n // mat4.multiply(mvMatrix,scaleM,mvMatrix);\r\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexPositionBuffer);\r\n gl.vertexAttribPointer(shaderProgram.vertexPositionAttribute, \r\n vertexPositionBuffer.itemSize, gl.FLOAT, false, 0, 0);\r\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexColorBuffer);\r\n gl.vertexAttribPointer(shaderProgram.vertexColorAttribute, \r\n vertexColorBuffer.itemSize, gl.FLOAT, false, 0, 0);\r\n \r\n setMatrixUniforms();\r\n gl.drawArrays(gl.TRIANGLES, 0, vertexPositionBuffer.numberOfItems);\r\n}","title":""},{"docid":"8463767ded788b6ad9a301ababee730c","score":"0.5161947","text":"function setupBuffers() {//set up the picture\r\n vertexPositionBuffer = gl.createBuffer(); //set up the buffer\r\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexPositionBuffer);\r\n var triangleVertices = [//matrix of 30 triangles consists of 90 vertices\r\n \r\n //below lists 30 triangles\r\n //the first 20 triangles is the \"I\" part\r\n -0.95, 0.95, 0.0,//1\r\n 0.95, 0.95, 0.0,\r\n -0.95, 0.63, 0.0,\r\n \r\n -0.95, 0.63, 0.0,//2\r\n 0.95, 0.95, 0.0,\r\n -0.75, 0.63, 0.0,\r\n \r\n -0.75, 0.63, 0.0,//3\r\n 0.95, 0.95, 0.0,\r\n -0.35, 0.63, 0.0,\r\n \r\n -0.35, 0.63, 0.0,//4\r\n 0.95, 0.95, 0.0,\r\n 0.35, 0.63, 0.0,\r\n \r\n 0.35, 0.63, 0.0,//5\r\n 0.95, 0.95, 0.0,\r\n 0.75, 0.63, 0.0,\r\n \r\n 0.75, 0.63, 0.0,//6\r\n 0.95, 0.95, 0.0,\r\n 0.95, 0.63, 0.0,\r\n \r\n -0.75, 0.63, 0.0,//7\r\n -0.35, 0.63, 0.0,\r\n -0.75, -0.3, 0.0,\r\n \r\n -0.75, -0.3, 0.0,//8\r\n -0.35, 0.63, 0.0,\r\n -0.35, 0.368, 0.0,\r\n \r\n -0.75, -0.3, 0.0,//9\r\n -0.35, 0.368, 0.0,\r\n -0.35, -0.05, 0.0,\r\n \r\n -0.35, -0.05, 0.0,//10\r\n -0.35, 0.368, 0.0,\r\n -0.2, -0.05, 0.0,\r\n \r\n -0.2, -0.05, 0.0,//11\r\n -0.35, 0.368, 0.0,\r\n -0.2, 0.368, 0.0,\r\n \r\n -0.75, -0.3, 0.0,//12\r\n -0.35, -0.05, 0.0,\r\n -0.35, -0.3, 0.0,\r\n \r\n 0.2, -0.05, 0.0,//13\r\n 0.35, 0.368, 0.0,\r\n 0.2, 0.368, 0.0,\r\n \r\n 0.35, -0.05, 0.0,//14\r\n 0.35, 0.368, 0.0,\r\n 0.2, -0.05, 0.0,\r\n \r\n 0.75, -0.3, 0.0,//15\r\n 0.35, 0.368, 0.0,\r\n 0.35, -0.05, 0.0,\r\n \r\n 0.75, -0.3, 0.0,//16\r\n 0.35, 0.63, 0.0,\r\n 0.35, 0.368, 0.0,\r\n \r\n 0.75, 0.63, 0.0,//17\r\n 0.35, 0.63, 0.0,\r\n 0.75, -0.3, 0.0,\r\n \r\n 0.75, -0.3, 0.0,//18\r\n 0.35, -0.05, 0.0,\r\n 0.35, -0.3, 0.0,\r\n \r\n //the below 10 parts is the organle part of the badge\r\n -0.75, -0.4, 0.0,//19\r\n -0.75, -0.45, 0.0,\r\n -0.6, -0.57, 0.0,\r\n \r\n -0.6, -0.57, 0.0,//20\r\n -0.75, -0.4, 0.0,\r\n -0.6, -0.4, 0.0,\r\n \r\n -0.5, -0.4, 0.0,//21\r\n -0.5, -0.67, 0.0,\r\n -0.35, -0.75, 0.0,\r\n \r\n -0.35, -0.75, 0.0,//22\r\n -0.5, -0.4, 0.0,\r\n -0.35, -0.4, 0.0,\r\n \r\n -0.2, -0.4, 0.0,//23\r\n -0.2, -0.8, 0.0,\r\n -0.05, -0.9, 0.0,\r\n \r\n -0.05, -0.9, 0.0,//24\r\n -0.2, -0.4, 0.0,\r\n -0.05, -0.4, 0.0,\r\n \r\n 0.05, -0.9, 0.0, //25\r\n 0.2, -0.4, 0.0,\r\n 0.05, -0.4, 0.0,\r\n \r\n 0.2, -0.4, 0.0,//26\r\n 0.2, -0.8, 0.0,\r\n 0.05, -0.9, 0.0,\r\n \r\n 0.35, -0.75, 0.0,//27\r\n 0.5, -0.4, 0.0, \r\n 0.35, -0.4, 0.0,\r\n \r\n 0.5, -0.4, 0.0, //28\r\n 0.5, -0.67, 0.0, \r\n 0.35, -0.75, 0.0, \r\n \r\n 0.6, -0.57, 0.0, //29\r\n 0.75, -0.4, 0.0, \r\n 0.6, -0.4, 0.0,\r\n \r\n 0.75, -0.4, 0.0, //30\r\n 0.75, -0.45, 0.0,\r\n 0.6, -0.57, 0.0,\r\n ];\r\n \r\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(triangleVertices), gl.STATIC_DRAW);\r\n vertexPositionBuffer.itemSize = 3;//each vertices has size three: x,y,z\r\n vertexPositionBuffer.numberOfItems = 90;//there are 90 vertices in this buffer\r\n \r\n vertexColorBuffer = gl.createBuffer();\r\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexColorBuffer);\r\n var colors = [//set up the color vertices\r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n \r\n 0.0, 0.0, 0.7, 1.0, //blue\r\n 0.0, 0.0, 0.7, 1.0,\r\n 0.0, 0.0, 0.7, 1.0,\r\n //below are 12 organges\r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n \r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n \r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n \r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n \r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n \r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n 1.0, 0.0, 0.0, 1.0,\r\n \r\n 1.0, 0.0, 0.0,1.0,\r\n 1.0, 0.0,0.0, 1.0,\r\n 1.0, 0.0,0.0,1.0,\r\n \r\n 1.0, 0.0, 0.0,1.0,\r\n 1.0, 0.0,0.0, 1.0,\r\n 1.0, 0.0,0.0,1.0,\r\n \r\n 1.0, 0.0, 0.0,1.0,\r\n 1.0, 0.0,0.0, 1.0,\r\n 1.0, 0.0,0.0,1.0,\r\n \r\n 1.0, 0.0, 0.0,1.0,\r\n 1.0, 0.0,0.0, 1.0,\r\n 1.0, 0.0,0.0,1.0,\r\n \r\n 1.0, 0.0, 0.0,1.0,\r\n 1.0, 0.0,0.0, 1.0,\r\n 1.0, 0.0,0.0,1.0,\r\n \r\n 1.0, 0.0, 0.0,1.0,\r\n 1.0, 0.0,0.0, 1.0,\r\n 1.0, 0.0,0.0,1.0,\r\n ];\r\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(colors), gl.STATIC_DRAW);\r\n vertexColorBuffer.itemSize = 4;//the item size is 4 including R,G,B and alpha\r\n vertexColorBuffer.numItems = 90; //there are 90 color vertices\r\n}","title":""},{"docid":"ddb9abb16fe33b3088a18d5147d5db5b","score":"0.5156649","text":"function setGeometry(gl) {\r\n var positions = new Float32Array(\r\n [\r\n -0.5, -0.5, -0.5,\r\n -0.5, 0.5, -0.5,\r\n 0.5, -0.5, -0.5,\r\n -0.5, 0.5, -0.5,\r\n 0.5, 0.5, -0.5,\r\n 0.5, -0.5, -0.5,\r\n\r\n -0.5, -0.5, 0.5,\r\n 0.5, -0.5, 0.5,\r\n -0.5, 0.5, 0.5,\r\n -0.5, 0.5, 0.5,\r\n 0.5, -0.5, 0.5,\r\n 0.5, 0.5, 0.5,\r\n\r\n -0.5, 0.5, -0.5,\r\n -0.5, 0.5, 0.5,\r\n 0.5, 0.5, -0.5,\r\n -0.5, 0.5, 0.5,\r\n 0.5, 0.5, 0.5,\r\n 0.5, 0.5, -0.5,\r\n\r\n -0.5, -0.5, -0.5,\r\n 0.5, -0.5, -0.5,\r\n -0.5, -0.5, 0.5,\r\n -0.5, -0.5, 0.5,\r\n 0.5, -0.5, -0.5,\r\n 0.5, -0.5, 0.5,\r\n\r\n -0.5, -0.5, -0.5,\r\n -0.5, -0.5, 0.5,\r\n -0.5, 0.5, -0.5,\r\n -0.5, -0.5, 0.5,\r\n -0.5, 0.5, 0.5,\r\n -0.5, 0.5, -0.5,\r\n\r\n 0.5, -0.5, -0.5,\r\n 0.5, 0.5, -0.5,\r\n 0.5, -0.5, 0.5,\r\n 0.5, -0.5, 0.5,\r\n 0.5, 0.5, -0.5,\r\n 0.5, 0.5, 0.5,\r\n\r\n ]);\r\n gl.bufferData(gl.ARRAY_BUFFER, positions, gl.STATIC_DRAW);\r\n}","title":""},{"docid":"1e3f3613302ed71bfee36152db285133","score":"0.514158","text":"function zOrder$1( x, y, minX, minY, invSize ) {\n\n \t// coords are transformed into non-negative 15-bit integer range\n \tx = 32767 * ( x - minX ) * invSize;\n \ty = 32767 * ( y - minY ) * invSize;\n\n \tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n \tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n \tx = ( x | ( x << 2 ) ) & 0x33333333;\n \tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n \ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n \ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n \ty = ( y | ( y << 2 ) ) & 0x33333333;\n \ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n \treturn x | ( y << 1 );\n\n }","title":""},{"docid":"47a48d428043032497e882a9db207855","score":"0.51414764","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"47a48d428043032497e882a9db207855","score":"0.51414764","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"47a48d428043032497e882a9db207855","score":"0.51414764","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"47a48d428043032497e882a9db207855","score":"0.51414764","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"47a48d428043032497e882a9db207855","score":"0.51414764","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"47a48d428043032497e882a9db207855","score":"0.51414764","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"c28e66da722f3fb8cfbda699abe32f94","score":"0.51383257","text":"static vectorToWorldSpace (vec, vAgentHeading, vAgentSide) {\n // make a copy of the point\n var transVec = new Vector2D(vec);\n\n // create a transformation matrix\n var matTransform = new C2DMatrix();\n\n //rotate\n matTransform.rotate(vAgentHeading, vAgentSide);\n\n //now transform the vertices\n matTransform.transformVector2Ds(transVec);\n\n return transVec;\n }","title":""},{"docid":"c3673cf5f445e4e5f9afff45634f3353","score":"0.5137185","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n}","title":""},{"docid":"c3673cf5f445e4e5f9afff45634f3353","score":"0.5137185","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n}","title":""},{"docid":"c3673cf5f445e4e5f9afff45634f3353","score":"0.5137185","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n}","title":""},{"docid":"c3673cf5f445e4e5f9afff45634f3353","score":"0.5137185","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n}","title":""},{"docid":"c3673cf5f445e4e5f9afff45634f3353","score":"0.5137185","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n}","title":""},{"docid":"c3673cf5f445e4e5f9afff45634f3353","score":"0.5137185","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n}","title":""},{"docid":"c3673cf5f445e4e5f9afff45634f3353","score":"0.5137185","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = 32767 * (x - minX) * invSize;\n y = 32767 * (y - minY) * invSize;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n}","title":""},{"docid":"0b7e787d26c4e13b1cd2dacf274a2750","score":"0.5132477","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"0b7e787d26c4e13b1cd2dacf274a2750","score":"0.5132477","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"0b7e787d26c4e13b1cd2dacf274a2750","score":"0.5132477","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"0b7e787d26c4e13b1cd2dacf274a2750","score":"0.5132477","text":"function zOrder( x, y, minX, minY, invSize ) {\n\n\t// coords are transformed into non-negative 15-bit integer range\n\n\tx = 32767 * ( x - minX ) * invSize;\n\ty = 32767 * ( y - minY ) * invSize;\n\n\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\n\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\n\tx = ( x | ( x << 2 ) ) & 0x33333333;\n\tx = ( x | ( x << 1 ) ) & 0x55555555;\n\n\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\n\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\n\ty = ( y | ( y << 2 ) ) & 0x33333333;\n\ty = ( y | ( y << 1 ) ) & 0x55555555;\n\n\treturn x | ( y << 1 );\n\n}","title":""},{"docid":"d749804c29976222855414306c67f496","score":"0.5128188","text":"convertToWireframe() {\n let result = new PolygonMesh();\n let i;\n result.setVertexData(this.vertexData);\n let newIndices = [];\n switch (this.faceType) {\n case FaceType.Triangle:\n for (i = 0; i < this.indices.length; i += 3) {\n newIndices.push(this.indices[i]);\n newIndices.push(this.indices[i + 1]);\n newIndices.push(this.indices[i + 1]);\n newIndices.push(this.indices[i + 2]);\n newIndices.push(this.indices[i + 2]);\n newIndices.push(this.indices[i]);\n }\n break;\n case FaceType.TriangleFan:\n for (i = 1; i < this.indices.length - 1; i += 1) {\n newIndices.push(this.indices[0]);\n newIndices.push(this.indices[i]);\n newIndices.push(this.indices[i]);\n newIndices.push(this.indices[i + 1]);\n newIndices.push(this.indices[0]);\n newIndices.push(this.indices[i + 1]);\n }\n break;\n case FaceType.TriangleStrip:\n for (i = 0; i < this.indices.length - 2; i++) {\n newIndices.push(this.indices[i]);\n newIndices.push(this.indices[i + 1]);\n newIndices.push(this.indices[i + 1]);\n newIndices.push(this.indices[i + 2]);\n newIndices.push(this.indices[i + 2]);\n newIndices.push(this.indices[i]);\n }\n break;\n }\n result.setPrimitives(newIndices, FaceType.Lines);\n return result;\n }","title":""},{"docid":"65beefaa4d560c8bcbe5ec6bbbf607e2","score":"0.51243913","text":"updateViewMatrix() {\n if(this.mode === Camera.MODE_FREE){\n this.transform.matView.reset()\n .vtranslate(this.transform.position)\n .rotateX(this.transform.rotation.x * Transform.deg2Rad)\n .rotateY(this.transform.rotation.y * Transform.deg2Rad)\n } else {\n // Notice the different order of operations\n this.transform.matView.reset()\n .rotateX(this.transform.rotation.x * Transform.deg2Rad)\n .rotateY(this.transform.rotation.y * Transform.deg2Rad)\n .vtranslate(this.transform.position)\n }\n\n this.transform.updateDirection(); // Need to know the direction for panning\n\n // Cameras work by doing the inverse transformation of all meshes!\n Matrix4.invert(this.viewMatrix, this.transform.getViewMatrix())\n\n return this.viewMatrix\n }","title":""},{"docid":"cbc6543b0525cbf28c949a55fcec4b6c","score":"0.51185715","text":"setIdentity() {\r\n this.col1.x = 1.0;\r\n this.col2.x = 0.0;\r\n this.col1.y = 0.0;\r\n this.col2.y = 1.0;\r\n }","title":""},{"docid":"25a8086a9333e25fad90e79053511c24","score":"0.5116514","text":"function setMatrixTransform(){\n if(x <= y+0.2){ // scale up\n if(y < x){\n y = 1.21;\n }\n x += 0.01;\n mat4.fromScaling(mvMatrix, [1, x, 1]); \n space += 0.1;\n }\n else{ // scale down\n if(y < -1.2){\n y = 1.21;\n }\n y = y-0.01;\n mat4.fromScaling(mvMatrix, [1, y, 1]);\n //count += 1;\n space += 0.1;\n }\n mat4.rotate(mvMatrix, mvMatrix, space * 3.1415926 / 180, [0.6, 0.7, 0.6]); //rotate after scaling\n}","title":""},{"docid":"154c1033b97daca81ae2bb6a3e81f142","score":"0.5115767","text":"function zOrder(x, y, minX, minY, invSize) {\n // coords are transformed into non-negative 15-bit integer range\n x = (x - minX) * invSize | 0;\n y = (y - minY) * invSize | 0;\n\n x = (x | (x << 8)) & 0x00FF00FF;\n x = (x | (x << 4)) & 0x0F0F0F0F;\n x = (x | (x << 2)) & 0x33333333;\n x = (x | (x << 1)) & 0x55555555;\n\n y = (y | (y << 8)) & 0x00FF00FF;\n y = (y | (y << 4)) & 0x0F0F0F0F;\n y = (y | (y << 2)) & 0x33333333;\n y = (y | (y << 1)) & 0x55555555;\n\n return x | (y << 1);\n}","title":""},{"docid":"ccb9f0e399ab0a7878abeb2ad24d17e3","score":"0.51121175","text":"flip() {\n return new hamonengine.math.vector2(this.x, -this.y);\n }","title":""},{"docid":"2959b876a797dd2c0972c8dc4d1f665b","score":"0.51097864","text":"function f_wingFront(){\n var baseModelView = modelview;\n\n applyTexture(textWingFront);\n\n\n normalMatrix = extractNormalMatrix(modelview); // always extract the normal matrix before scaling\n modelview = mult(modelview, scale4(0.4 , 0.2, 0.25));\n triangleRectangle.render();\n\n\n modelview = baseModelView;\n}","title":""},{"docid":"7799c2e72ab85a170667170b199ce34b","score":"0.5108827","text":"mapTriangle(ctx, p0, p1, p2, p_0, p_1, p_2) {\n // break out the individual triangles x's & y's\n var x0 = p_0.x,\n y0 = p_0.y;\n var x1 = p_1.x,\n y1 = p_1.y;\n var x2 = p_2.x,\n y2 = p_2.y;\n var u0 = p0.x,\n v0 = p0.y;\n var u1 = p1.x,\n v1 = p1.y;\n var u2 = p2.x,\n v2 = p2.y;\n\n // save the unclipped & untransformed destination canvas\n ctx.save();\n\n // clip the destination canvas to the unwarped destination triangle\n ctx.beginPath();\n ctx.moveTo(x0, y0);\n ctx.lineTo(x1, y1);\n ctx.lineTo(x2, y2);\n ctx.closePath();\n ctx.clip();\n\n // Compute matrix transform\n var delta = u0 * v1 + v0 * u2 + u1 * v2 - v1 * u2 - v0 * u1 - u0 * v2;\n var delta_a = x0 * v1 + v0 * x2 + x1 * v2 - v1 * x2 - v0 * x1 - x0 * v2;\n var delta_b = u0 * x1 + x0 * u2 + u1 * x2 - x1 * u2 - x0 * u1 - u0 * x2;\n var delta_c =\n u0 * v1 * x2 +\n v0 * x1 * u2 +\n x0 * u1 * v2 -\n x0 * v1 * u2 -\n v0 * u1 * x2 -\n u0 * x1 * v2;\n var delta_d = y0 * v1 + v0 * y2 + y1 * v2 - v1 * y2 - v0 * y1 - y0 * v2;\n var delta_e = u0 * y1 + y0 * u2 + u1 * y2 - y1 * u2 - y0 * u1 - u0 * y2;\n var delta_f =\n u0 * v1 * y2 +\n v0 * y1 * u2 +\n y0 * u1 * v2 -\n y0 * v1 * u2 -\n v0 * u1 * y2 -\n u0 * y1 * v2;\n\n // Draw the transformed image\n ctx.transform(\n delta_a / delta,\n delta_d / delta,\n delta_b / delta,\n delta_e / delta,\n delta_c / delta,\n delta_f / delta,\n );\n\n // draw the transformed source image to the destination canvas\n ctx.drawImage(this.img, 0, 0);\n\n // restore the context to it's unclipped untransformed state\n ctx.restore();\n }","title":""},{"docid":"2856f9c3493c45f2b740a1155673068c","score":"0.51026535","text":"function matrix_invert(M){\n // I use Guassian Elimination to calculate the inverse:\n // (1) 'augment' the matrix (left) by the identity (on the right)\n // (2) Turn the matrix on the left into the identity by elemetry row ops\n // (3) The matrix on the right is the inverse (was the identity matrix)\n // There are 3 elemtary row ops: (I combine b and c in my code)\n // (a) Swap 2 rows\n // (b) Multiply a row by a scalar\n // (c) Add 2 rows\n \n //if the matrix isn't square: exit (error)\n if(M.length !== M[0].length){return;}\n \n //create the identity matrix (I), and a copy (C) of the original\n var i=0, ii=0, j=0, dim=M.length, e=0, t=0;\n var I = [], C = [];\n for(i=0; i= width || this.x - this.r <= 0){\n this.x = 0;\n }\n if(this.y + this.r >= height || this.y - this.r <= 0){\n this.y = 0;\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"758ad06f67dfdb684befaf73cfc51255\",\n \"score\": \"0.6051587\",\n \"text\": \"inversed() {\\n const r = this.orientation()\\n const t = this.position()\\n const o = this.offset()\\n const s = this.size()\\n\\n return mat4.translate(-o.x, -o.y, -o.z)\\n .xM(mat4.scale(1/s.x, 1/s.y, 1/s.z))\\n .xM(mat4.inverseRotate(-r.y, -r.x, -r.z))\\n .xM(mat4.translate(-t.x, -t.y, -t.z))\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f65e3927cbefe69b4748b263b3043d5\",\n \"score\": \"0.59371567\",\n \"text\": \"function trans(mat, x, y) {\\n mat[6] += mat[0] * x + mat[3] * y\\n mat[7] += mat[1] * x + mat[4] * y\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4db17caba184e40e9176b11324be621d\",\n \"score\": \"0.5756141\",\n \"text\": \"updateDirection(){\\n Matrix4.transformVec4(this.forward, [0,0,1,0], this.matView.raw) //Z\\n Matrix4.transformVec4(this.up, [0,0,1,0], this.matView.raw) //Y\\n Matrix4.transformVec4(this.right, [0,0,1,0], this.matView.raw) //X\\n\\n return this\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55ded2b9724e56a06b802cbb51beece7\",\n \"score\": \"0.5747146\",\n \"text\": \"function ortho_front() { update_trans(rotateY(0)); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d41dbfdab7b367f5b620113eb327efb\",\n \"score\": \"0.5696957\",\n \"text\": \"invert () {\\n const queue = [this]\\n let node\\n for (let i = 0; i < queue.length; i++) {\\n node = queue[i]\\n if (node.plane) node.plane = plane.flip(plane.create(), node.plane)\\n if (node.front) queue.push(node.front)\\n if (node.back) queue.push(node.back)\\n const temp = node.front\\n node.front = node.back\\n node.back = temp\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bfc44665b5b7b1bebbf41c8f35aa8d4\",\n \"score\": \"0.55533844\",\n \"text\": \"function getTransformCoordinates(dTop, dBottom, dLeft, dRight) {\\n // anchors defining the warped rectangle\\n // bottom plane\\n var imgWidth = texture.image.width;\\n var imgHeight = texture.image.height;\\n var sourceLocalBottom={\\n // edge points: ul ur ll lr\\n TL:{x:dots.geometry.vertices[1].x, y:dots.geometry.vertices[1].y}, \\n TR:{x:dots.geometry.vertices[4].x, y: dots.geometry.vertices[4].y}, \\n BR:{x:edgeDotMesh.geometry.vertices[3].x, y:edgeDotMesh.geometry.vertices[3].y}, \\n BL:{x:edgeDotMesh.geometry.vertices[2].x, y:edgeDotMesh.geometry.vertices[2].y} \\n }\\n var sourceBottom = convertToPixelCoord(sourceLocalBottom, imgPlaneWidth, imgPlaneHeight, imgWidth, imgHeight);\\n\\n console.log(\\\"sourceLocalBottom\\\", sourceLocalBottom);\\n console.log(\\\"sourceBottom\\\", sourceBottom);\\n // cornerpoints defining the desire unwarped rectangle\\n var targetBottom={\\n TL:{x:0, y: 0},\\n TR:{x:imgWidth, y:0 },\\n BR:{x:imgWidth, y:dBottom/imgPlaneHeight * imgHeight},\\n BL:{x:0, y:dBottom/imgPlaneHeight * imgHeight}\\n }\\n console.log(\\\"targetBottom\\\", targetBottom);\\n // rear\\n var sourceLocalRear={\\n // edge points: ul ur ll lr\\n TL:{x:dots.geometry.vertices[2].x, y:dots.geometry.vertices[2].y}, \\n TR:{x:dots.geometry.vertices[3].x, y:dots.geometry.vertices[3].y}, \\n BR:{x:dots.geometry.vertices[4].x, y: dots.geometry.vertices[4].y}, \\n BL:{x:dots.geometry.vertices[1].x, y:dots.geometry.vertices[1].y} \\n }\\n var sourceRear = convertToPixelCoord(sourceLocalRear, imgPlaneWidth, imgPlaneHeight, imgWidth, imgHeight);\\n console.log(\\\"sourceLocalRear\\\", sourceLocalRear);\\n console.log(\\\"sourceRear\\\", sourceRear);\\n var targetRear={\\n TL:{x:0, y: 0},\\n TR:{x:imgWidth, y:0 },\\n BR:{x:imgWidth, y:imgHeight},\\n BL:{x:0, y:imgHeight}\\n }\\n console.log(\\\"targetRear\\\", targetRear);\\n // left\\n var sourceLocalLeft={\\n // edge points: ul ur ll lr\\n TL:{x:edgeDotMesh.geometry.vertices[0].x, y:edgeDotMesh.geometry.vertices[0].y}, \\n TR:{x:dots.geometry.vertices[2].x, y:dots.geometry.vertices[2].y}, \\n BR:{x:dots.geometry.vertices[1].x, y: dots.geometry.vertices[1].y}, \\n BL:{x:edgeDotMesh.geometry.vertices[2].x, y:edgeDotMesh.geometry.vertices[2].y} \\n }\\n var sourceLeft = convertToPixelCoord(sourceLocalLeft, imgPlaneWidth, imgPlaneHeight, imgWidth, imgHeight);\\n console.log(\\\"sourceLocalLeft\\\", sourceLocalLeft);\\n console.log(\\\"sourceLeft\\\", sourceLeft);\\n var targetLeft={\\n TL:{x:0, y: 0},\\n TR:{x:dLeft/imgPlaneWidth * imgWidth, y:0 },\\n BR:{x:dLeft/imgPlaneWidth * imgWidth, y:imgHeight},\\n BL:{x:0, y:imgHeight}\\n }\\n console.log(\\\"targetLeft\\\", targetLeft);\\n // right\\n var sourceLocalRight={\\n // edge points: ul ur ll lr\\n TL:{x:dots.geometry.vertices[3].x, y: dots.geometry.vertices[3].y}, \\n TR:{x:edgeDotMesh.geometry.vertices[1].x, y:edgeDotMesh.geometry.vertices[1].y}, \\n BR:{x:edgeDotMesh.geometry.vertices[3].x, y:edgeDotMesh.geometry.vertices[3].y}, \\n BL:{x:dots.geometry.vertices[4].x, y: dots.geometry.vertices[4].y}\\n }\\n var sourceRight = convertToPixelCoord(sourceLocalRight, imgPlaneWidth, imgPlaneHeight, imgWidth, imgHeight);\\n console.log(\\\"sourceLocalRight\\\", sourceLocalRight);\\n console.log(\\\"sourceRight\\\", sourceRight);\\n var targetRight={\\n TL:{x:0, y: 0},\\n TR:{x:dRight/imgPlaneWidth * imgWidth, y:0 },\\n BR:{x:dRight/imgPlaneWidth * imgWidth, y:imgHeight},\\n BL:{x:0, y:imgHeight}\\n }\\n console.log(\\\"targetRight\\\", targetRight);\\n // top\\n var sourceLocalTop={\\n // edge points: ul ur ll lr\\n TL:{x:edgeDotMesh.geometry.vertices[0].x, y:edgeDotMesh.geometry.vertices[0].y}, \\n TR:{x:edgeDotMesh.geometry.vertices[1].x, y:edgeDotMesh.geometry.vertices[1].y}, \\n BR:{x:dots.geometry.vertices[3].x, y: dots.geometry.vertices[3].y}, \\n BL:{x:dots.geometry.vertices[2].x, y:dots.geometry.vertices[2].y} \\n }\\n var sourceTop = convertToPixelCoord(sourceLocalTop, imgPlaneWidth, imgPlaneHeight, imgWidth, imgHeight);\\n console.log(\\\"sourceLocalTop\\\", sourceLocalTop);\\n console.log(\\\"sourceTop\\\", sourceTop);\\n var targetTop={\\n TL:{x:0, y: 0},\\n TR:{x:imgWidth, y:0 },\\n BR:{x:imgWidth, y:dTop/imgPlaneHeight * imgHeight},\\n BL:{x:0, y:dTop/imgPlaneHeight * imgHeight}\\n }\\n console.log(\\\"targetTop\\\", targetTop);\\n var coordinates={\\n Bottom: {source: sourceBottom, target: targetBottom},\\n Rear: {source: sourceRear, target: targetRear},\\n Left: {source: sourceLeft, target: targetLeft},\\n Right: {source: sourceRight, target: targetRight},\\n Top: {source: sourceTop, target: targetTop}\\n }\\n return coordinates;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7916047163bf96e6ef66926d2a388915\",\n \"score\": \"0.55443794\",\n \"text\": \"function swapYZ(verts) {\\n for(var i = 0; i < verts.length; ++i) {\\n var z = verts[i].y;\\n verts[i].y = -verts[i].z;\\n verts[i].z = z;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b49514b1f483ed16351f8072e579749\",\n \"score\": \"0.5510458\",\n \"text\": \"function flipVecToOpenGLFrame(vec){\\n //vec.x = vec.x;\\n // var temp = vec.z;\\n // vec.z = -1.0 * vec.y;\\n // vec.y = temp;\\n \\n return new Vec3(vec.x, vec.z, -1.0 * vec.y);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7409f2d4c45c310bf009ff4980983b0\",\n \"score\": \"0.5494796\",\n \"text\": \"function sewer(a_verts, b_verts){\\r\\n if (a_verts.length !== b_verts.length){\\r\\n console.warn('vertices number mismatch 😑');\\r\\n return;\\r\\n }\\r\\n\\r\\n var vertices = new Float32Array(a_verts.length*3*2);\\r\\n var vertices1 = new Float32Array(a_verts.length*3);\\r\\n var vertices2 = new Float32Array(a_verts.length*3);\\r\\n\\r\\n for (var k=0; k 0 && models['transformer'].position.x > 0) return true;\\n\\telse if(pos < 0 && models['transformer'].position.x < 0) return true;\\n\\telse if(pos == 0 && models['transformer'].position.x == 0) return true;\\n\\telse return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58fec82725033be7b8db9c9b1854f2fb\",\n \"score\": \"0.544711\",\n \"text\": \"rotateMatrixToTheLeft(matrix) {\\n // reverse the individual rows\\n matrix = matrix.map(row => row.reverse());\\n // swap the symmetric elements\\n for (let i = 0; i < matrix.length; i += 1) {\\n for (let j = 0; j < i; j += 1) {\\n const temp = matrix[i][j];\\n matrix[i][j] = matrix[j][i];\\n matrix[j][i] = temp;\\n }\\n }\\n return matrix;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70276dbe3320462fb6cf94034ec004ed\",\n \"score\": \"0.54455096\",\n \"text\": \"function animate() {//animation is the function that create the wiggle action for the lower part of the picture\\r\\n sinscalar += 0.1;//increment\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexPositionBuffer);\\r\\n var triangleVertices = [//vertices that discrible the movement for the picture\\r\\n //the first 18 vertices does not move\\r\\n -0.95, 0.95, 0.0,//1\\r\\n 0.95, 0.95, 0.0,\\r\\n -0.95, 0.63, 0.0,\\r\\n \\r\\n -0.95, 0.63, 0.0,//2\\r\\n 0.95, 0.95, 0.0,\\r\\n -0.75, 0.63, 0.0,\\r\\n \\r\\n -0.75, 0.63, 0.0,//3\\r\\n 0.95, 0.95, 0.0,\\r\\n -0.35, 0.63, 0.0,\\r\\n \\r\\n -0.35, 0.63, 0.0,//4\\r\\n 0.95, 0.95, 0.0,\\r\\n 0.35, 0.63, 0.0,\\r\\n \\r\\n 0.35, 0.63, 0.0,//5\\r\\n 0.95, 0.95, 0.0,\\r\\n 0.75, 0.63, 0.0,\\r\\n \\r\\n 0.75, 0.63, 0.0,//6\\r\\n 0.95, 0.95, 0.0,\\r\\n 0.95, 0.63, 0.0,\\r\\n \\r\\n -0.75, 0.63, 0.0,//7\\r\\n -0.35, 0.63, 0.0,\\r\\n -0.75, -0.3, 0.0,\\r\\n \\r\\n -0.75, -0.3, 0.0,//8\\r\\n -0.35, 0.63, 0.0,\\r\\n -0.35, 0.368, 0.0,\\r\\n \\r\\n -0.75, -0.3, 0.0,//9\\r\\n -0.35, 0.368, 0.0,\\r\\n -0.35, -0.05, 0.0,\\r\\n \\r\\n -0.35, -0.05, 0.0,//10\\r\\n -0.35, 0.368, 0.0,\\r\\n -0.2, -0.05, 0.0,\\r\\n \\r\\n -0.2, -0.05, 0.0,//11\\r\\n -0.35, 0.368, 0.0,\\r\\n -0.2, 0.368, 0.0,\\r\\n \\r\\n -0.75, -0.3, 0.0,//12\\r\\n -0.35, -0.05, 0.0,\\r\\n -0.35, -0.3, 0.0,\\r\\n \\r\\n 0.2, -0.05, 0.0,//13\\r\\n 0.35, 0.368, 0.0,\\r\\n 0.2, 0.368, 0.0,\\r\\n \\r\\n 0.35, -0.05, 0.0,//14\\r\\n 0.35, 0.368, 0.0,\\r\\n 0.2, -0.05, 0.0,\\r\\n \\r\\n 0.75, -0.3, 0.0,//15\\r\\n 0.35, 0.368, 0.0,\\r\\n 0.35, -0.05, 0.0,\\r\\n \\r\\n 0.75, -0.3, 0.0,//16\\r\\n 0.35, 0.63, 0.0,\\r\\n 0.35, 0.368, 0.0,\\r\\n \\r\\n 0.75, 0.63, 0.0,//17\\r\\n 0.35, 0.63, 0.0,\\r\\n 0.75, -0.3, 0.0,\\r\\n \\r\\n 0.75, -0.3, 0.0,//18\\r\\n 0.35, -0.05, 0.0,\\r\\n 0.35, -0.3, 0.0,\\r\\n \\r\\n //the next 12 vertices will move\\r\\n -0.75+Math.sin(sinscalar-0.2)*0.03, -0.4+Math.sin(sinscalar-0.2)*0.03, 0.0,\\r\\n -0.75+Math.sin(sinscalar-0.2)*0.03, -0.45+Math.sin(sinscalar-0.2)*0.03, 0.0,\\r\\n -0.6+Math.sin(sinscalar-0.2)*0.03, -0.57+Math.sin(sinscalar-0.2)*0.03, 0.0,\\r\\n \\r\\n -0.6+Math.sin(sinscalar-0.2)*0.03, -0.57+Math.sin(sinscalar-0.2)*0.03, 0.0,\\r\\n -0.75+Math.sin(sinscalar-0.2)*0.03, -0.4+Math.sin(sinscalar-0.2)*0.03, 0.0,\\r\\n -0.6+Math.sin(sinscalar-0.2)*0.03, -0.4+Math.sin(sinscalar-0.2)*0.03, 0.0,\\r\\n \\r\\n -0.5, -0.4+Math.sin(sinscalar-0.2)*0.04, 0.0,\\r\\n -0.5, -0.67+Math.sin(sinscalar-0.2)*0.04, 0.0,\\r\\n -0.35, -0.75+Math.sin(sinscalar-0.2)*0.04, 0.0,\\r\\n \\r\\n -0.35, -0.75+Math.sin(sinscalar-0.2)*0.04, 0.0,\\r\\n -0.5, -0.4+Math.sin(sinscalar-0.2)*0.04, 0.0,\\r\\n -0.35, -0.4+Math.sin(sinscalar-0.2)*0.04, 0.0,\\r\\n \\r\\n -0.2+Math.sin(sinscalar-0.2)*0.02, -0.4+Math.sin(sinscalar-0.2)*0.06, 0.0,\\r\\n -0.2+Math.sin(sinscalar-0.2)*0.02, -0.8+Math.sin(sinscalar-0.2)*0.06, 0.0,\\r\\n -0.05+Math.sin(sinscalar-0.2)*0.02, -0.9+Math.sin(sinscalar-0.2)*0.06, 0.0,\\r\\n \\r\\n -0.05+Math.sin(sinscalar-0.2)*0.02, -0.9+Math.sin(sinscalar-0.2)*0.06, 0.0,\\r\\n -0.2+Math.sin(sinscalar-0.2)*0.02, -0.4+Math.sin(sinscalar-0.2)*0.06, 0.0,\\r\\n -0.05+Math.sin(sinscalar-0.2)*0.02, -0.4+Math.sin(sinscalar-0.2)*0.06, 0.0,\\r\\n \\r\\n 0.05, -0.9+Math.sin(sinscalar-0.2)*0.02, 0.0, //symmetry\\r\\n 0.2, -0.4+Math.sin(sinscalar-0.2)*0.02, 0.0,\\r\\n 0.05, -0.4+Math.sin(sinscalar-0.2)*0.02, 0.0,\\r\\n \\r\\n 0.2, -0.4+Math.sin(sinscalar-0.2)*0.02, 0.0,\\r\\n 0.2, -0.8+Math.sin(sinscalar-0.2)*0.02, 0.0,\\r\\n 0.05, -0.9+Math.sin(sinscalar-0.2)*0.02, 0.0,\\r\\n \\r\\n 0.35+Math.sin(sinscalar-0.2)*0.02, -0.75+Math.sin(sinscalar-0.2)*0.06, 0.0, \\r\\n 0.5+Math.sin(sinscalar-0.2)*0.02, -0.4+Math.sin(sinscalar-0.2)*0.06, 0.0, \\r\\n 0.35+Math.sin(sinscalar-0.2)*0.02, -0.4+Math.sin(sinscalar-0.2)*0.06, 0.0,\\r\\n \\r\\n 0.5+Math.sin(sinscalar-0.2)*0.02, -0.4+Math.sin(sinscalar-0.2)*0.06, 0.0, \\r\\n 0.5+Math.sin(sinscalar-0.2)*0.02, -0.67+Math.sin(sinscalar-0.2)*0.06, 0.0, \\r\\n 0.35+Math.sin(sinscalar-0.2)*0.02, -0.75+Math.sin(sinscalar-0.2)*0.06, 0.0, \\r\\n \\r\\n 0.6+Math.sin(sinscalar-0.2)*0.03, -0.57+Math.sin(sinscalar-0.2)*0.01, 0.0, \\r\\n 0.75+Math.sin(sinscalar-0.2)*0.03, -0.4+Math.sin(sinscalar-0.2)*0.01, 0.0, \\r\\n 0.6+Math.sin(sinscalar-0.2)*0.03, -0.4+Math.sin(sinscalar-0.2)*0.01, 0.0,\\r\\n \\r\\n 0.75+Math.sin(sinscalar-0.2)*0.03, -0.4+Math.sin(sinscalar-0.2)*0.01, 0.0, \\r\\n 0.75+Math.sin(sinscalar-0.2)*0.03, -0.45+Math.sin(sinscalar-0.2)*0.01, 0.0,\\r\\n 0.6+Math.sin(sinscalar-0.2)*0.03, -0.57+Math.sin(sinscalar-0.2)*0.01, 0.0,\\r\\n ];\\r\\n\\r\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(triangleVertices), gl.STATIC_DRAW);\\r\\n vertexPositionBuffer.itemSize = 3;\\r\\n vertexPositionBuffer.numberOfItems = 90;\\r\\n \\r\\n var timeNow = new Date().getTime();\\r\\n if (lastTime != 0) {\\r\\n var elapsed = timeNow\\r\\n- lastTime;\\r\\n rotAngle= (rotAngle+1.0) % 360;\\r\\n }\\r\\n lastTime = timeNow;\\r\\n \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8c5d02f16b4bf57992b8577a8bf6e30\",\n \"score\": \"0.54277104\",\n \"text\": \"function sideToSide() {\\r\\n\\r\\n console.log(\\\"in Side to Side\\\");\\r\\n\\r\\n $theTree.animate({\\r\\n 'left': 620\\r\\n }, 1000);\\r\\n\\r\\n // send to left edge\\r\\n $theTree.animate({\\r\\n 'left': 0\\r\\n }, 2000);\\r\\n\\r\\n // then back to center:\\r\\n $theTree.animate({\\r\\n 'left': 310\\r\\n }, 2000);\\r\\n\\r\\n\\r\\n }// end sideToSide\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9042371231abc3e9abd69fab2b6cd0d\",\n \"score\": \"0.53905356\",\n \"text\": \"function initTransforms()\\n{\\n\\txInvert[0] = -1;\\n\\txInvert[4] = 0;\\n\\txInvert[8] = 0;\\n\\n\\tyInvert[0] = 0;\\n\\tyInvert[4] = -1;\\n\\tyInvert[8] = 0;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79e65cb85d88304ef1d8345ba7257805\",\n \"score\": \"0.5365239\",\n \"text\": \"get flippedHorizontally() {\\n return this._at;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7695ac182526dc7f965dd8d91df573c\",\n \"score\": \"0.536267\",\n \"text\": \"function initTransforms(){\\n\\tmat4.identity(mvMatrix);\\n\\tmat4.translate(mvMatrix, HOME);\\n\\n\\tmat4.identity(pMatrix);\\n\\n\\tmat4.identity(nMatrix);\\n\\tmat4.set(mvMatrix, nMatrix);\\n\\tmat4.inverse(nMatrix);\\n\\tmat4.transpose(nMatrix);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f99e72c5d5b6cd53b05f98844707f782\",\n \"score\": \"0.53554523\",\n \"text\": \"static worldTransform (points, vPos, vForward, vSide, vScale) {\\n // copy the original vertices into the buffer about to be transformed\\n var points = Vector2D.cloneVectors(points);\\n\\n // create a transformation matrix\\n var matTransform = new C2DMatrix();\\n\\n // scale\\n if (vScale && (vScale.x != 1 || vScale.y != 1)) {\\n matTransform.scale(vScale.x, vScale.y);\\n }\\n\\n // rotate\\n matTransform.rotate(vForward, vSide);\\n\\n // and translate\\n matTransform.translate(vPos.x, vPos.y);\\n\\n // now transform the object's vertices\\n matTransform.transformVector2Ds(points);\\n\\n return points;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3fd117b385ce36f2c42a389e65ec984\",\n \"score\": \"0.53453434\",\n \"text\": \"rotate() {\\n // left\\n // console.log(this.selectedCube1.coordinates);\\n // console.log(this.selectedCube2.coordinates);\\n // console.log(this.selectedFace1);\\n // console.log(this.selectedFace2);\\n this.selectedCube1.coordinates.map(x => Math.round(x));\\n this.selectedCube2.coordinates.map(x => Math.round(x));\\n\\n // white && orange\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 1, 1]) || arraysEqual(this.selectedCube1.coordinates, [1, 0, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 0, 1]) || arraysEqual(this.selectedCube2.coordinates, [1, -1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"F\\\");\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"r\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 0, 1]) || arraysEqual(this.selectedCube1.coordinates, [1, -1, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 1, 1]) || arraysEqual(this.selectedCube2.coordinates, [1, 0, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"f\\\");\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"R\\\");\\n }\\n }\\n\\n // red && white\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 1, 1]) || arraysEqual(this.selectedCube1.coordinates, [-1, 0, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 0, 1]) || arraysEqual(this.selectedCube2.coordinates, [-1, -1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"L\\\");\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"f\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, -1, 1]) || arraysEqual(this.selectedCube1.coordinates, [-1, 0, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 0, 1]) || arraysEqual(this.selectedCube2.coordinates, [-1, 1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"l\\\");\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"F\\\");\\n }\\n }\\n\\n // yellow && orange\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 1, -1]) || arraysEqual(this.selectedCube1.coordinates, [1, 0, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 0, -1]) || arraysEqual(this.selectedCube2.coordinates, [1, -1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"R\\\");\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"b\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, -1, -1]) || arraysEqual(this.selectedCube1.coordinates, [1, 0, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 0, -1]) || arraysEqual(this.selectedCube2.coordinates, [1, 1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"r\\\");\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"B\\\");\\n }\\n }\\n\\n // red && yello\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 1, -1]) || arraysEqual(this.selectedCube1.coordinates, [-1, 0, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 0, -1]) || arraysEqual(this.selectedCube2.coordinates, [-1, -1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"B\\\");\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"l\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, -1, -1]) || arraysEqual(this.selectedCube1.coordinates, [-1, 0, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 0, -1]) || arraysEqual(this.selectedCube2.coordinates, [-1, 1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"b\\\");\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"L\\\");\\n }\\n }\\n\\n //green && orange\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 1, -1]) || arraysEqual(this.selectedCube1.coordinates, [1, 1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 1, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, 1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"r\\\");\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"U\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 1, 1]) || arraysEqual(this.selectedCube1.coordinates, [1, 1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 1, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, 1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"R\\\");\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"u\\\");\\n }\\n }\\n\\n //red && green\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 1, -1]) || arraysEqual(this.selectedCube1.coordinates, [-1, 1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 1, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, 1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"L\\\");\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"u\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 1, 1]) || arraysEqual(this.selectedCube1.coordinates, [-1, 1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 1, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, 1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"l\\\");\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"U\\\");\\n }\\n }\\n\\n //red && blue\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, -1, -1]) || arraysEqual(this.selectedCube1.coordinates, [-1, -1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, -1, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, -1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"D\\\");\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"l\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, -1, 1]) || arraysEqual(this.selectedCube1.coordinates, [-1, -1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, -1, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, -1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"d\\\");\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"L\\\");\\n }\\n }\\n\\n //orange && blue\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, -1, 1]) || arraysEqual(this.selectedCube1.coordinates, [1, -1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, -1, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, -1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"D\\\");\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"r\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, -1, -1]) || arraysEqual(this.selectedCube1.coordinates, [1, -1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, -1, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, -1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"d\\\");\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"R\\\");\\n }\\n }\\n\\n // white && green\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 1, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, 1, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 1, 1]) || arraysEqual(this.selectedCube2.coordinates, [-1, 1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"U\\\");\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"f\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 1, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, 1, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 1, 1]) || arraysEqual(this.selectedCube2.coordinates, [1, 1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"u\\\");\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"F\\\");\\n }\\n }\\n\\n // yellow && green\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 1, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, 1, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 1, -1]) || arraysEqual(this.selectedCube2.coordinates, [1, 1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"U\\\");\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"b\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 1, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, 1, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 1, -1]) || arraysEqual(this.selectedCube2.coordinates, [-1, 1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"u\\\");\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"B\\\");\\n }\\n }\\n\\n // yellow && blue\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, -1, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, -1, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, -1, -1]) || arraysEqual(this.selectedCube2.coordinates, [1, -1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"d\\\");\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"B\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, -1, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, -1, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, -1, -1]) || arraysEqual(this.selectedCube2.coordinates, [-1, -1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"D\\\");\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"b\\\");\\n }\\n }\\n\\n // white && blue\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, -1, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, -1, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, -1, 1]) || arraysEqual(this.selectedCube2.coordinates, [1, -1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"D\\\");\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"f\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, -1, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, -1, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, -1, 1]) || arraysEqual(this.selectedCube2.coordinates, [-1, -1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"d\\\");\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"F\\\");\\n }\\n }\\n\\n // middle\\n // green\\n if ((arraysEqual(this.selectedCube1.coordinates, [0, 1, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, 1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 1, 0]) || arraysEqual(this.selectedCube2.coordinates, [0, 1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"M\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [0, 1, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, 1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 1, 0]) || arraysEqual(this.selectedCube2.coordinates, [0, 1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"m\\\");\\n }\\n }\\n\\n // white\\n if ((arraysEqual(this.selectedCube1.coordinates, [0, 1, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, 0, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 0, 1]) || arraysEqual(this.selectedCube2.coordinates, [0, -1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"M\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [0, -1, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, 0, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 0, 1]) || arraysEqual(this.selectedCube2.coordinates, [0, 1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"m\\\");\\n }\\n }\\n\\n // blue\\n if ((arraysEqual(this.selectedCube1.coordinates, [0, -1, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, -1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, -1, 0]) || arraysEqual(this.selectedCube2.coordinates, [0, -1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"M\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [0, -1, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, -1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, -1, 0]) || arraysEqual(this.selectedCube2.coordinates, [0, -1, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"m\\\");\\n }\\n }\\n\\n // yellow\\n if ((arraysEqual(this.selectedCube1.coordinates, [0, -1, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, 0, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 0, -1]) || arraysEqual(this.selectedCube2.coordinates, [0, 1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"M\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [0, 1, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, 0, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 0, -1]) || arraysEqual(this.selectedCube2.coordinates, [0, -1, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"m\\\");\\n }\\n }\\n\\n // green\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 1, 0]) || arraysEqual(this.selectedCube1.coordinates, [0, 1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 1, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, 1, 0]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"S\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 1, 0]) || arraysEqual(this.selectedCube1.coordinates, [0, 1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 1, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, 1, 0]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 5) rubiksCube.pushTurn(\\\"s\\\");\\n }\\n }\\n\\n // red\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, -1, 0]) || arraysEqual(this.selectedCube1.coordinates, [-1, 0, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 0, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, 1, 0]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"S\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 1, 0]) || arraysEqual(this.selectedCube1.coordinates, [-1, 0, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 0, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, -1, 0]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"s\\\");\\n }\\n }\\n\\n // blue\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, -1, 0]) || arraysEqual(this.selectedCube1.coordinates, [0, -1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, -1, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, -1, 0]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"S\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, -1, 0]) || arraysEqual(this.selectedCube1.coordinates, [0, -1, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, -1, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, -1, 0]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 6) rubiksCube.pushTurn(\\\"s\\\");\\n }\\n }\\n\\n // orange\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 1, 0]) || arraysEqual(this.selectedCube1.coordinates, [1, 0, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 0, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, -1, 0]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"S\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, -1, 0]) || arraysEqual(this.selectedCube1.coordinates, [1, 0, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 0, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, 1, 0]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"s\\\");\\n }\\n }\\n\\n // white\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 0, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, 0, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 0, 1]) || arraysEqual(this.selectedCube2.coordinates, [1, 0, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"E\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 0, 1]) || arraysEqual(this.selectedCube1.coordinates, [0, 0, 1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 0, 1]) || arraysEqual(this.selectedCube2.coordinates, [-1, 0, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 1) rubiksCube.pushTurn(\\\"e\\\");\\n }\\n }\\n\\n // orange\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 0, 1]) || arraysEqual(this.selectedCube1.coordinates, [1, 0, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 0, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, 0, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"E\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 0, -1]) || arraysEqual(this.selectedCube1.coordinates, [1, 0, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [1, 0, 0]) || arraysEqual(this.selectedCube2.coordinates, [1, 0, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 2) rubiksCube.pushTurn(\\\"e\\\");\\n }\\n }\\n\\n // yellow\\n if ((arraysEqual(this.selectedCube1.coordinates, [1, 0, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, 0, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 0, -1]) || arraysEqual(this.selectedCube2.coordinates, [-1, 0, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"E\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 0, -1]) || arraysEqual(this.selectedCube1.coordinates, [0, 0, -1])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [0, 0, -1]) || arraysEqual(this.selectedCube2.coordinates, [1, 0, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 3) rubiksCube.pushTurn(\\\"e\\\");\\n }\\n }\\n\\n // red\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 0, -1]) || arraysEqual(this.selectedCube1.coordinates, [-1, 0, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 0, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, 0, 1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"E\\\");\\n }\\n }\\n if ((arraysEqual(this.selectedCube1.coordinates, [-1, 0, 1]) || arraysEqual(this.selectedCube1.coordinates, [-1, 0, 0])) &&\\n (arraysEqual(this.selectedCube2.coordinates, [-1, 0, 0]) || arraysEqual(this.selectedCube2.coordinates, [-1, 0, -1]))) {\\n if (this.selectedFace1 === this.selectedFace2) {\\n if (this.selectedFace1 === 4) rubiksCube.pushTurn(\\\"e\\\");\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39ef0418a78f98eb85be132712b35299\",\n \"score\": \"0.5344788\",\n \"text\": \"getTranslatelessMatrix() {\\n const mat = new Float32Array(this.viewMatrix)\\n mat[12] = mat[13] = mat[14] = 0 //Reset Translation position in the matrix to zero\\n return mat\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f91c3abf07705c02d3b41553495315f8\",\n \"score\": \"0.53290445\",\n \"text\": \"function rotateMatrixTwo(matrix) {\\n var edge = matrix.length - 1;\\n \\n function movePixels(row, col) {\\n // starts at m[row][col]\\n // moves to m[col][edge - row]\\n var fromRow;\\n var fromCol;\\n var fromPixel;\\n \\n // first transformation\\n var toRow = row; // 0\\n var toCol = col; // 0\\n var toPixel = matrix[row][col]; // 1\\n\\n // console.log('toRow', toRow)\\n // console.log('toCol', toCol)\\n // console.log('toPixel', toPixel, '\\\\n')\\n \\n // Do rotational transformation 4 times\\n for (var i = 0; i < 4; i++) {\\n // console.log('i', i)\\n // console.log('old matrix', matrix)\\n fromRow = toRow;\\n fromCol = toCol;\\n toRow = fromCol;\\n toCol = edge - fromRow;\\n\\n // console.log('fromRow', fromRow)\\n // console.log('fromCol', fromCol)\\n // console.log('toRow', toRow)\\n // console.log('toCol', toCol)\\n \\n fromPixel = toPixel;\\n toPixel = matrix[toRow][toCol];\\n matrix[toRow][toCol] = fromPixel;\\n\\n // console.log('fromPixel', fromPixel)\\n // console.log('toPixel', toPixel)\\n // console.log(`matrix[${toRow}][${toCol}]`, matrix[toRow][toCol])\\n // console.log('matrix', matrix, '\\\\n')\\n }\\n }\\n \\n for (var i = 0; i < matrix.length / 2; i++) {\\n for (var j = i; j < edge - i; j++) {\\n console.log('row', i, 'col', j);\\n movePixels(i, j);\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85d5cf20790c12827ac134834896e44f\",\n \"score\": \"0.53205705\",\n \"text\": \"function translate(x, y, vr){\\n\\t\\tvr= vr||v4.create();\\n\\t \\t\\n\\t \\tvar dot3= v4.dot3(x, y);\\n\\t \\tvar xmul= +y[3] + dot3/(x[3]+1);\\n\\t \\tvr[0]= xmul*x[0] + y[0];\\n\\t \\tvr[1]= xmul*x[1] + y[1]; \\n\\t \\tvr[2]= xmul*x[2] + y[2];\\n\\t \\tvr[3]=+dot3 + x[3]*y[3];\\n\\t \\t\\n\\t \\treturn vr;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a0a1eab430fd47047fbbd2d3ff89f1a\",\n \"score\": \"0.5314145\",\n \"text\": \"function translateTo2D(){\\n\\taxisX =$V([ox-ex, oy-ey, oz-ez]);\\n\\n\\taxisX = axisX.toUnitVector();\\n\\n\\tvecR = $V([px-ex,py-ey,pz-ez]);\\n\\t\\n\\n\\tvecR = vecR.toUnitVector();\\n\\n\\tvar axisZ = axisX.cross(vecR);\\n\\n\\taxisZ = axisZ.toUnitVector();\\n\\n\\tvar axisY = axisZ.cross(axisX);\\n\\n\\t//alert(\\\"axisX.axisY =\\\"+ axisX.dot(axisY) +\\\" axisY.axisZ =\\\"+ axisY.dot(axisZ) +\\\" axisX.axisZ =\\\"+ axisX.dot(axisZ) )\\n//\\talert(\\\"X :[ \\\"+axisX.e(1)+\\\" \\\"+axisX.e(2)+\\\" \\\"+ axisX.e(3) +\\\"] \\\\n Y :[ \\\"+axisY.e(1)+\\\" \\\"+axisY.e(2)+\\\" \\\"+ axisY.e(3) +\\\"] \\\\n Z :[ \\\"+axisZ.e(1)+\\\" \\\"+axisZ.e(2)+\\\" \\\"+ axisZ.e(3)+\\\"]\\\" )\\n\\t\\n\\tvar tempO = $V([ox,oy,oz]);\\n\\t//alert(\\\"O :\\\"+ox+\\\" \\\"+ oy+ \\\" \\\"+ oz)\\n\\tox = axisX.dot(tempO);\\n\\t//alert(\\\"O :\\\"+ox+\\\" \\\"+ oy+ \\\" \\\"+ oz)\\n\\toy = axisY.dot(tempO);\\n\\t//alert(\\\"O :\\\"+ox+\\\" \\\"+ oy+ \\\" \\\"+ oz)\\n\\toz = axisZ.dot(tempO);\\n\\t\\n\\t\\n\\tvar tempE = $V([ex,ey,ez]);\\n\\tex = axisX.dot(tempE)\\n\\tey = axisY.dot(tempE)\\n\\tez = axisZ.dot(tempE)\\n\\t\\n\\t// we need to find the new point on the ray and ray direction\\n\\tvar tempP = $V([px,py,pz])\\n\\tpx = axisX.dot(tempP)\\n\\tpy = axisY.dot(tempP)\\n\\tpz = axisZ.dot(tempP)\\n\\t\\n\\tvecR = $V([px-ex,py-ey,pz-ez]);\\n\\n\\tvecR = vecR.toUnitVector();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bba1e94c28cf22c0541ba092e923567\",\n \"score\": \"0.5308205\",\n \"text\": \"updateMatrix() {\\n // Order of ops is important\\n // TransformedVector = TranslationMatrix * RotationMatrix * ScaleMatrix * OriginalVector;\\n // !!! BEWARE !!! This lines actually performs the scaling FIRST, and THEN the rotation, and THEN the translation. This is how matrix multiplication works.\\n\\n this.matView.reset() // Back to identity matrix (1, 0, 0, 0 , 1 ...)\\n .vtranslate(this.position)\\n .rotateX(this.rotation.x * Transform.deg2Rad)\\n .rotateZ(this.rotation.z * Transform.deg2Rad)\\n .rotateY(this.rotation.y * Transform.deg2Rad)\\n .vscale(this.scale)\\n\\n //Calculate the Normal Matrix which doesn't need translate, then transpose and inverse the mat4 to mat 3\\n // this operates directly on this.matNormal\\n Matrix4.normalMat3(this.matNormal, this.matView.raw)\\n\\n // Determine Direction after all the transformations.\\n // Operate directly on our direction vec (first arg).\\n Matrix4.transformVec4(this.forward, [0,0,1,0], this.matView.raw) //Z\\n Matrix4.transformVec4(this.up, [0,0,1,0], this.matView.raw) //Y\\n Matrix4.transformVec4(this.right, [0,0,1,0], this.matView.raw) //X\\n\\n return this.matView.raw\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a73a0fe39633fb18406e4316a65edbb\",\n \"score\": \"0.5291329\",\n \"text\": \"function translate(dx, dy, dz) {\\n var translateMatrix = mat4.create();\\n translateMatrix[3] = dx;\\n translateMatrix[7] = dy;\\n translateMatrix[11] = dz;\\n //console.log(translateMatrix);\\n mat4.transpose(translateMatrix, translateMatrix);\\n return translateMatrix;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fc671e8b2611814646ece1fe6d13d12\",\n \"score\": \"0.5286679\",\n \"text\": \"updateVertices()\\n {\\n const vertices = this._vertices;\\n const center = this.center;\\n const hw = this.hw;\\n const hh = this.hh;\\n if (this.noRotate)\\n {\\n const AABB = this.AABB;\\n vertices[0] = AABB[0];\\n vertices[1] = AABB[1];\\n vertices[2] = AABB[2];\\n vertices[3] = AABB[1];\\n vertices[4] = AABB[2];\\n vertices[5] = AABB[3];\\n vertices[6] = AABB[0];\\n vertices[7] = AABB[3];\\n }\\n else\\n {\\n const rotation = this.rotation.rotation;\\n const sin = Math.sin(rotation);\\n const cos = Math.cos(rotation);\\n\\n vertices[0] = center.x - hw * cos + hh * sin;\\n vertices[1] = center.y - hw * sin - hh * cos;\\n vertices[2] = center.x + hw * cos + hh * sin;\\n vertices[3] = center.y + hw * sin - hh * cos;\\n vertices[4] = center.x + hw * cos - hh * sin;\\n vertices[5] = center.y + hw * sin + hh * cos;\\n vertices[6] = center.x - hw * cos - hh * sin;\\n vertices[7] = center.y - hw * sin + hh * cos;\\n }\\n this.verticesDirty = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6ed955d959c9308a1034b8a773509f4\",\n \"score\": \"0.5281988\",\n \"text\": \"function flipField(field)\\n{\\n if (field == null || field.length == 0)\\n {\\n return null;\\n }\\n\\n var maxRow = field.length / 2;\\n if (field.length % 2 == 1)\\n {\\n maxRow++;\\n }\\n\\n for (var row = 0; row < maxRow; row++)\\n {\\n for (var col = 0; col < field[row].length; col++)\\n {\\n var coord1 =\\n {\\n row : row,\\n col : col\\n };\\n var coord2 = flipCoordinate(coord1, field.length, field[row].length);\\n var temp = field[row][col];\\n field[row][col] = field[coord2.row][coord2.col];\\n field[coord2.row][coord2.col] = temp;\\n }\\n }\\n return field;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73e641e943eb9b90f17e0a0d536c5e01\",\n \"score\": \"0.5279299\",\n \"text\": \"static pointToWorldSpace (vPoint, vAgentHeading, vAgentSide, vAgentPosition) {\\n // make a copy of the point\\n var transPoint = new Vector2D(vPoint);\\n\\n // create a transformation matrix\\n var matTransform = new C2DMatrix();\\n\\n // rotate\\n matTransform.rotate(vAgentHeading, vAgentSide);\\n\\n // and translate\\n matTransform.translate(vAgentPosition.x, vAgentPosition.y);\\n\\n // now transform the vertices\\n matTransform.transformVector2D(transPoint);\\n\\n return transPoint;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ca96ff37125aac2a3fe81a9f530c9ea\",\n \"score\": \"0.5278481\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | x << 8) & 0x00FF00FF;\\n x = (x | x << 4) & 0x0F0F0F0F;\\n x = (x | x << 2) & 0x33333333;\\n x = (x | x << 1) & 0x55555555;\\n\\n y = (y | y << 8) & 0x00FF00FF;\\n y = (y | y << 4) & 0x0F0F0F0F;\\n y = (y | y << 2) & 0x33333333;\\n y = (y | y << 1) & 0x55555555;\\n\\n return x | y << 1;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b930b7e5345fb7f3056f0d4537c6be5\",\n \"score\": \"0.52709365\",\n \"text\": \"fromMatrix(vMatrix, pMatrix) {\\n const vpMatrix = mat4.create()\\n mat4.multiply(vpMatrix, pMatrix, vMatrix)\\n const row1 = vec3.fromValues(vpMatrix[0], vpMatrix[4], vpMatrix[8]) //12\\n const row2 = vec3.fromValues(vpMatrix[1], vpMatrix[5], vpMatrix[9]) //13\\n const row3 = vec3.fromValues(vpMatrix[2], vpMatrix[6], vpMatrix[10]) //14\\n const row4 = vec3.fromValues(vpMatrix[3], vpMatrix[7], vpMatrix[11]) //15\\n vec3.add(this.left.normal, row4, row1)\\n vec3.subtract(this.right.normal, row4, row1)\\n vec3.add(this.bottom.normal, row4, row2)\\n vec3.subtract(this.top.normal, row4, row2)\\n vec3.add(this.near.normal, row4, row3)\\n vec3.subtract(this.far.normal, row4, row3)\\n\\n this.left.distance = vpMatrix[15] + vpMatrix[12]\\n this.right.distance = vpMatrix[15] - vpMatrix[12]\\n this.bottom.distance = vpMatrix[15] + vpMatrix[13]\\n this.top.distance = vpMatrix[15] - vpMatrix[13]\\n this.near.distance = vpMatrix[15] + vpMatrix[14]\\n this.far.distance = vpMatrix[15] - vpMatrix[14]\\n\\n for(let i = 0; i < 6; ++i) {\\n let magnitude = 1 / vec3.length(this.planes[i].normal)\\n vec3.scale(this.planes[i].normal, this.planes[i].normal, magnitude)\\n this.planes[i].distance *= magnitude\\n }\\n return this\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b037792c789a6522174eb380355c651b\",\n \"score\": \"0.52649206\",\n \"text\": \"inverse(xy) {\\n return xy;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4963477f20bf70095e7bbe4a2bac97c2\",\n \"score\": \"0.52626306\",\n \"text\": \"function draw() { \\n gl.viewport(0, 0, gl.viewportWidth, gl.viewportHeight);\\n gl.clear(gl.COLOR_BUFFER_BIT | gl.DEPTH_BUFFER_BIT); \\n\\n mat4.identity(mvMatrix);\\n mat4.identity(pMatrix);\\n \\n /*\\n mat4.ortho(pMatrix,-1,0.7,-0.5,0.9,0.2,-1);\\n vec3.set(transformVec,0.0,0.0,0.0);\\n mat4.translate(mvMatrix, mvMatrix,transformVec); \\n //console.log(mat4.str(pMatrix));\\n mat4.rotateX(mvMatrix, mvMatrix, degToRad(rotAngle)); \\n */\\n mat4.perspective(pMatrix,degToRad(100), 0.8 , 0.2, 100.0);\\n vec3.set(transformVec,0.0,0.0,-1);\\n mat4.translate(mvMatrix, mvMatrix,transformVec);\\n //console.log(mat4.str(pMatrix));\\n mat4.rotateX(mvMatrix, mvMatrix, degToRad(rotAngle)); \\n \\n\\n \\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexPositionBuffer);\\n gl.vertexAttribPointer(shaderProgram.vertexPositionAttribute, \\n vertexPositionBuffer.itemSize, gl.FLOAT, false, 0, 0);\\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexColorBuffer);\\n gl.vertexAttribPointer(shaderProgram.vertexColorAttribute, \\n vertexColorBuffer.itemSize, gl.FLOAT, false, 0, 0);\\n \\n setMatrixUniforms();\\n gl.drawArrays(gl.TRIANGLES, 0, vertexPositionBuffer.numberOfItems);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee65c0536395ea0474b330ecbd4eb3a5\",\n \"score\": \"0.52584076\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n \\t// coords are transformed into non-negative 15-bit integer range\\n \\tx = 32767 * ( x - minX ) * invSize;\\n \\ty = 32767 * ( y - minY ) * invSize;\\n\\n \\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n \\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n \\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n \\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n \\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n \\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n \\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n \\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n \\treturn x | ( y << 1 );\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee65c0536395ea0474b330ecbd4eb3a5\",\n \"score\": \"0.52584076\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n \\t// coords are transformed into non-negative 15-bit integer range\\n \\tx = 32767 * ( x - minX ) * invSize;\\n \\ty = 32767 * ( y - minY ) * invSize;\\n\\n \\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n \\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n \\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n \\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n \\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n \\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n \\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n \\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n \\treturn x | ( y << 1 );\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9e9c54c5685c7b5febac8bd411db7d2\",\n \"score\": \"0.52568203\",\n \"text\": \"function setupSide(m, z, s, slope) {\\n\\tlet panels = z.panels;\\n\\tlet xx = yy = s; // origin is at (s, s)\\n\\tlet xx0 = 0;\\n\\tlet yy0 = 0;\\n\\t//console.log(l);\\n\\n\\tfor (j = 0; j < panels.length; j++) {\\n\\t\\tlet panel = panels[j];\\n\\n\\t\\tlet northEast = (slope == +1) && (panel.anchor == \\\"start\\\");\\n\\t\\tlet northWest = (slope == -1) && (panel.anchor == \\\"end\\\");\\n\\t\\tlet southEast = (slope == -1) && (panel.anchor == \\\"start\\\");\\n\\t\\tlet southWest = (slope == +1) && (panel.anchor == \\\"end\\\");\\n\\n\\t\\tlet upperHalf = northEast || northWest;\\n\\t\\tlet lowerHalf = southEast || southWest;\\n\\n\\t\\tlet leftHalf = northWest || southWest;\\n\\t\\tlet rightHalf = northEast || southEast;\\n\\n\\t\\t// At each entry store the slope, so consecutive entries staircase\\n\\t\\t// in the right direction.\\n\\t\\tfor (let e = 0; e < panel.entries.length; e++) {\\n\\t\\t\\tpanel.entries[e].slope = slope;\\n\\t\\t\\tpanel.entries[e].dxIndex = 1.5 * (upperHalf ? -slope : slope);\\n\\t\\t}\\n\\n\\t\\t// At each panel, store local transformation strings.\\n\\t\\t// Used by both both panels and gridLines.\\n\\t\\t// Since panels and grids all draw from (0,0), they need to\\n\\t\\t// nudge themselves #rows left&down when flipped vertically and\\n\\t\\t// #rows right&down when flipped both vertically & horizontally.\\n\\t\\tlet nudgeX = upperHalf ? 0 : 2 * slope * panel.entries.length;\\n\\t\\tlet nudgeY = slope * nudgeX;\\n\\t\\t// Flip left-right when we are in the left side.\\n\\t\\tlet scaleX = rightHalf ? +1 : -1;\\n\\t\\t// Flip up-down when we are in the lower half.\\n\\t\\tlet scaleY = upperHalf ? +1 : -1;\\n\\n\\t\\t// Add local transformation string for panel or gridLines.\\n\\t\\tpanel.originPanel = translate(nudgeX, nudgeY) + scale(scaleX, scaleY);\\n\\n\\t\\t// At panel, create and store string for panel path.\\n\\t\\tpanel.panelPath = panelPath(panel.entries.length, z.leg, m.arm);\\n\\n\\t\\t// At panel, create and store a path string for grid lines\\n\\t\\tpanel.gridLines = gridLines(panel.entries.length, z.leg, m.arm);\\n\\n\\t\\t//-------------------------------------------------------------------\\n\\t\\t// At each panel, store its origin (x0, y0).\\n\\t\\t// Panels, grid lines and text entries all render relative to this origin,\\n\\t\\t// and locally nudge into place if needed .\\n\\n\\t\\t// Add a gap before every panel but the first one.\\n\\t\\tif (j > 0) {\\n\\t\\t\\txx += m.gap * slope;\\n\\t\\t\\tyy += m.gap;\\n\\t\\t}\\n\\n\\t\\t// Calculate actual coordinates, moving padding away from the center.\\n\\t\\txx0 = 2 * xx + m.padding;\\n\\t\\tyy0 = 2 * yy - slope * m.padding;\\n\\n\\t\\t// Shift the whole along the panel’s leg when on the other (left) side.\\n\\t\\tif (leftHalf) {\\n\\t\\t\\txx0 -= z.leg;\\n\\t\\t\\tyy0 += slope * z.leg;\\n\\t\\t}\\n\\n\\t\\t// Now we’re at the origin. Calculate transform strings here.\\n\\t\\tpanel.transform = translate(xx0, yy0);\\n\\n\\t\\t// In the lowerHalf, align the start of the text with the previous\\n\\t\\t// start position, so shift it right by one unit.\\n\\t\\tpanel.originText = translate(xx0 + (lowerHalf ? -2 * slope : 0), yy0);\\n\\t\\tpanel.originEntries = translate(2 * slope, 2);\\n\\n\\t\\txx += panel.entries.length * slope;\\n\\t\\tyy += panel.entries.length;\\n\\t}\\n\\treturn yy;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"896bcfb40b1a6402feb10526ec6adfd9\",\n \"score\": \"0.5237274\",\n \"text\": \"updateCameraMatrix () {\\n mat4.fromRotationTranslation (this.view, this.rotation, this.position);\\n mat4.invert (this.view, this.view);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db76a9603a7e471290a2aeaa92482548\",\n \"score\": \"0.52325594\",\n \"text\": \"function rotateMatrixInPlace(matrix){\\n for(var layer = 0; layer < matrix.length / 2; layer++){\\n var first = layer;\\n var last = matrix.length-1-layer;\\n for(var i = first; i < last; i++){\\n var offset = i - layer;\\n\\n var top = matrix[first][i]\\n //left to top\\n matrix[first][i] = matrix[last - offset][first];\\n\\n //bottom to left\\n matrix[last-offset][first] = matrix[last][last - offset];\\n\\n // right to bottom\\n matrix[last][last-offset] = matrix[i][last];\\n\\n //top to right\\n matrix[i][last] = top;\\n }\\n }\\n return matrix\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1723956e47673c080b6f6d828a84e34\",\n \"score\": \"0.52302504\",\n \"text\": \"function arrayRotateFrontClockwise() {\\n arrayRotateFaceClockwise(\\\"F\\\");\\n \\n var s1 = new Cubelet(), s2 = new Cubelet(), s3 = new Cubelet();\\n\\n createDeepCopy(s1, cubelets[3][2][0]);\\n createDeepCopy(s2, cubelets[3][2][1]);\\n createDeepCopy(s3, cubelets[3][2][2]);\\n\\n arrayShiftCol (2, 0, s1, s2, s3);\\n arrayShiftRowReverse(4, 0, s1, s2, s3);\\n arrayShiftCol(1, 2, s1, s2, s3);\\n arrayShiftRowReverse(3, 2, s1, s2, s3);\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbd3b2c0c9ac34f5d37f3fdfcc4dd184\",\n \"score\": \"0.5224209\",\n \"text\": \"function setupBuffers() {\\n vertexPositionBuffer = gl.createBuffer();\\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexPositionBuffer);\\n triangleVertices = [\\n //Top Bar\\n -0.65 , 0.9, 0.0,\\n -0.65, 0.75, 0.0,\\n 0.65, 0.75, 0.0,\\n \\n -0.65, 0.9, 0.0,\\n 0.65, 0.9, 0.0,\\n 0.65, 0.75, 0.0,\\n //Left of I\\n -0.55, 0.75, 0.0,\\n -0.25, 0.75, 0.0,\\n -0.25, 0.55, 0.0,\\n \\n -0.55, 0.75, 0.0,\\n -0.25, 0.55, 0.0,\\n -0.55, 0.02, 0.0,\\n\\n -0.55, 0.02, 0.0,\\n -0.25, 0.55, 0.0,\\n -0.25, 0.02, 0.0,\\n \\n -0.25, 0.55, 0.0,\\n -0.15, 0.55, 0.0,\\n -0.15, 0.2, 0.0,\\n \\n -0.25, 0.55, 0.0,\\n -0.25, 0.2, 0.0,\\n -0.15, 0.2, 0.0,\\n //Right of I\\n 0.55, 0.75, 0.0,\\n 0.25, 0.75, 0.0,\\n 0.25, 0.55, 0.0,\\n \\n 0.55, 0.75, 0.0,\\n 0.25, 0.55, 0.0,\\n 0.55, 0.02, 0.0,\\n\\n 0.55, 0.02, 0.0,\\n 0.25, 0.55, 0.0,\\n 0.25, 0.02, 0.0,\\n \\n 0.25, 0.55, 0.0,\\n 0.15, 0.55, 0.0,\\n 0.15, 0.2, 0.0,\\n \\n 0.25, 0.55, 0.0,\\n 0.25, 0.2, 0.0,\\n 0.15, 0.2, 0.0,\\n //Red/orange Lining (left)\\n -0.55, -0.02, 0.0,\\n -0.45, -0.02, 0.0,\\n -0.55, -0.1, 0.0,\\n \\n -0.45, -0.02, 0.0,\\n -0.55, -0.1, 0.0,\\n -0.45, -0.15, 0.0,\\n\\n -0.35, -0.02, 0.0,\\n -0.35, -0.2, 0.0,\\n -0.25, -0.02, 0.0,\\n \\n -0.35, -0.2, 0.0,\\n -0.25, -0.25, 0.0,\\n -0.25, -0.02, 0.0,\\n \\n -0.15, -0.02, 0.0,\\n -0.15, -0.3, 0.0,\\n -0.05, -0.02, 0.0,\\n \\n -0.05, -0.02, 0.0,\\n -0.15, -0.3, 0.0,\\n -0.05, -0.35, 0.0,\\n //Orange Lining (right)\\n 0.55, -0.02, 0.0,\\n 0.45, -0.02, 0.0,\\n 0.55, -0.1, 0.0,\\n \\n 0.45, -0.02, 0.0,\\n 0.55, -0.1, 0.0,\\n 0.45, -0.15, 0.0,\\n\\n 0.35, -0.02, 0.0,\\n 0.35, -0.2, 0.0,\\n 0.25, -0.02, 0.0,\\n \\n 0.35, -0.2, 0.0,\\n 0.25, -0.25, 0.0,\\n 0.25, -0.02, 0.0,\\n \\n 0.15, -0.02, 0.0,\\n 0.15, -0.3, 0.0,\\n 0.05, -0.02, 0.0,\\n \\n 0.05, -0.02, 0.0,\\n 0.15, -0.3, 0.0,\\n 0.05, -0.35, 0.0\\n ]\\n \\n \\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(triangleVertices), gl.STATIC_DRAW);\\n vertexPositionBuffer.itemSize = 3;\\n vertexPositionBuffer.numberOfItems = (3*24);\\n \\n vertexColorBuffer = gl.createBuffer();\\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexColorBuffer);\\n var colors = [\\n //top bar\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n \\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n //left of I\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n \\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n \\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n \\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n \\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n //Right of I\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n \\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n \\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n \\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n \\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n 0.0, 0.0, 0.3, 1.0,\\n //Orange Lining\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n //Orange Lining\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n \\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0,\\n 1.0, 0.2, 0.0, 1.0\\n ];\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(colors), gl.STATIC_DRAW);\\n vertexColorBuffer.itemSize = 4;\\n vertexColorBuffer.numItems = (3*24); \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c43c7d7ebc5d1d2fb4995c5d065dbe7\",\n \"score\": \"0.5224195\",\n \"text\": \"function transformTo2D(vertex) {\\n return { x: vertex.x, y: vertex.y };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39396601a6bd7ff45ae9761055f031e2\",\n \"score\": \"0.522289\",\n \"text\": \"function loadVertices() {\\r\\n cubeVertexBuffer0 = gl.createBuffer();\\r\\n cubeVertexBuffer1 = gl.createBuffer();\\r\\n cubeVertexBuffer2 = gl.createBuffer();\\r\\n cubeVertexBuffer3 = gl.createBuffer();\\r\\n cubeVertexBuffer4 = gl.createBuffer();\\r\\n cubeVertexBuffer5 = gl.createBuffer();\\r\\n var vright = [\\r\\n 0.5, -0.5, -0.5,\\r\\n 0.5, 0.5, -0.5,\\r\\n 0.5, 0.5, 0.5,\\r\\n 0.5, -0.5, 0.5\\r\\n ];\\r\\n var vleft = [\\r\\n -0.5, -0.5, -0.5,\\r\\n -0.5, -0.5, 0.5,\\r\\n -0.5, 0.5, 0.5,\\r\\n -0.5, 0.5, -0.5\\r\\n ];\\r\\n\\r\\n var vfront = [\\r\\n -0.5, -0.5, 0.5,\\r\\n 0.5, -0.5, 0.5,\\r\\n 0.5, 0.5, 0.5,\\r\\n -0.5, 0.5, 0.5\\r\\n ];\\r\\n\\r\\n var vback = [\\r\\n -0.5, -0.5, -0.5,\\r\\n -0.5, 0.5, -0.5,\\r\\n 0.5, 0.5, -0.5,\\r\\n 0.5, -0.5, -0.5\\r\\n];\\r\\n var vbottom = [\\r\\n -0.5, -0.5, -0.5,\\r\\n 0.5, -0.5, -0.5,\\r\\n 0.5, -0.5, 0.5,\\r\\n -0.5, -0.5, 0.5,\\r\\n ];\\r\\n var vtop = [\\r\\n -0.5, 0.5, -0.5,\\r\\n -0.5, 0.5, 0.5,\\r\\n 0.5, 0.5, 0.5,\\r\\n 0.5, 0.5, -0.5\\r\\n];\\r\\n\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer0);\\r\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vleft), gl.STATIC_DRAW);\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer1);\\r\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vright), gl.STATIC_DRAW);\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer2);\\r\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vbottom), gl.STATIC_DRAW);\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer3);\\r\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vtop), gl.STATIC_DRAW);\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer4);\\r\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vback), gl.STATIC_DRAW);\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, cubeVertexBuffer5);\\r\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vfront), gl.STATIC_DRAW);\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5796b23c1940939c688fcf68b4bc50cb\",\n \"score\": \"0.5220593\",\n \"text\": \"edges() {\\n if (this.pos.x <= this.r) {\\n this.pos.x = this.r;\\n this.vel.x *= -1;\\n }\\n\\n if (this.pos.x >= width - this.r) {\\n this.pos.x = width - this.r;\\n this.vel.x *= -1;\\n }\\n\\n if (this.pos.y <= this.r) {\\n this.pos.y = this.r;\\n this.vel.y *= -1;\\n }\\n\\n if (this.pos.y >= height - this.r) {\\n this.pos.y = height - this.r;\\n this.vel.y *= -1;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a15e33b3bcd442695c22abfd19cd346\",\n \"score\": \"0.52129316\",\n \"text\": \"function updateCurrentSide(){\\n if(mouseX < width/2){\\n onLeft = true;\\n onRight = false;\\n }\\n else{\\n onLeft = false;\\n onRight = true;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b3c3e39bcdba5fbaf11cf02902a1221\",\n \"score\": \"0.5203084\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b3c3e39bcdba5fbaf11cf02902a1221\",\n \"score\": \"0.5203084\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f06db9676522f6127bb4cb6a79278ba3\",\n \"score\": \"0.51958585\",\n \"text\": \"function flip(triangle1, triangle2)\\n{\\n // Each triangle is made up of three points and in this case two of\\n // them are shared, because the triangles must have a common edge --\\n // we search for the indices of the points that are *not* shared\\n // between the two.\\n var index1 = findNotContainedPoint(triangle1.points, triangle2.points);\\n var index2 = findNotContainedPoint(triangle2.points, triangle1.points);\\n\\n //DEBUG: assert(index1 != null);\\n //DEBUG: assert(index2 != null);\\n //DEBUG: assert(0 <= index1 && index1 <= 2);\\n //DEBUG: assert(0 <= index2 && index2 <= 2);\\n\\n //DEBUG: console.log(\\\"flipping: \\\" + triangle1 + \\\" with \\\" + triangle2);\\n\\n var swapIndex1 = (index1 + 1) % 3;\\n var swapIndex2 = findRemainingIndex(triangle2.points, triangle2.points[index2], triangle1.points[swapIndex1]);\\n\\n // The actual edge flip is pretty simple.\\n triangle1.setPoint(swapIndex1, triangle2.points[index2]);\\n triangle2.setPoint(swapIndex2, triangle1.points[index1]);\\n\\n // Backup the neighbors of the triangles (actually we only need\\n // oldNeighbors1 but for orthogonality we copy both).\\n var oldNeighbors1 = triangle1.neighbors.concat([]);\\n var oldNeighbors2 = triangle2.neighbors.concat([]);\\n\\n // Calculate the indices of the neighbors that need to be updated.\\n var index11 = (swapIndex1 + 2) % 3;\\n var index12 = swapIndex1;\\n var index21 = (swapIndex2 + 2) % 3;\\n var index22 = swapIndex2;\\n\\n // Fix the references to (and from) other neighboring triangles.\\n replaceNeighbor(triangle1.neighbors[index11], triangle1, triangle2);\\n triangle1.neighbors[index11] = triangle2;\\n triangle1.neighbors[index12] = oldNeighbors2[index2];\\n\\n replaceNeighbor(triangle2.neighbors[index21], triangle2, triangle1);\\n triangle2.neighbors[index21] = triangle1;\\n triangle2.neighbors[index22] = oldNeighbors1[index1];\\n\\n //DEBUG: console.log(\\\"done: \\\" + triangle1 + \\\" with \\\" + triangle2);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9be9574ff18c6c6fa9facc0a5ebd0832\",\n \"score\": \"0.51935583\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t\\t// coords are transformed into non-negative 15-bit integer range\\n\\n\\t\\tx = 32767 * ( x - minX ) * invSize;\\n\\t\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\t\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\t\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\t\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\t\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\t\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\t\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\t\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\t\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\t\\treturn x | ( y << 1 );\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9be9574ff18c6c6fa9facc0a5ebd0832\",\n \"score\": \"0.51935583\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t\\t// coords are transformed into non-negative 15-bit integer range\\n\\n\\t\\tx = 32767 * ( x - minX ) * invSize;\\n\\t\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\t\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\t\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\t\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\t\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\t\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\t\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\t\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\t\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\t\\treturn x | ( y << 1 );\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9be9574ff18c6c6fa9facc0a5ebd0832\",\n \"score\": \"0.51935583\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t\\t// coords are transformed into non-negative 15-bit integer range\\n\\n\\t\\tx = 32767 * ( x - minX ) * invSize;\\n\\t\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\t\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\t\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\t\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\t\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\t\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\t\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\t\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\t\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\t\\treturn x | ( y << 1 );\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9be9574ff18c6c6fa9facc0a5ebd0832\",\n \"score\": \"0.51935583\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t\\t// coords are transformed into non-negative 15-bit integer range\\n\\n\\t\\tx = 32767 * ( x - minX ) * invSize;\\n\\t\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\t\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\t\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\t\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\t\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\t\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\t\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\t\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\t\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\t\\treturn x | ( y << 1 );\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e98c134955c1bca13c266ed881821fe5\",\n \"score\": \"0.51932603\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t\\t// coords are transformed into non-negative 15-bit integer range\\n\\t\\tx = 32767 * ( x - minX ) * invSize;\\n\\t\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\t\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\t\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\t\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\t\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\t\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\t\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\t\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\t\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\t\\treturn x | ( y << 1 );\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65ca0b8013b31403c2c469aeba4d1f4a\",\n \"score\": \"0.5188302\",\n \"text\": \"paintFaceX(verts) {\\n // Compute the 2D coordinates\\n let v2D = verts.map(v => [v[0]-v[2], v[1]]);\\n this.paintFace(v2D, verts, false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1400fbb37f1162ee27615478670538b2\",\n \"score\": \"0.51853716\",\n \"text\": \"changeCubePosition(face) {\\n let temp;\\n for (let x = 0; x < 3; x++) {\\n for (let y = 0; y < 3; y++) {\\n for (let z = 0; z < 3; z++) {\\n switch (face) {\\n case \\\"L\\\":\\n if (this.cubes[x][y][z].cubePosition[0] === -1) {\\n temp = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[1];\\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[2]);\\n this.cubes[x][y][z].rotationAxis[2] = temp;\\n }\\n break;\\n case \\\"l\\\":\\n if (this.cubes[x][y][z].cubePosition[0] === -1) {\\n temp = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[2];\\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[1]);\\n this.cubes[x][y][z].rotationAxis[1] = temp;\\n }\\n break;\\n case \\\"R\\\":\\n if (this.cubes[x][y][z].cubePosition[0] === 1) {\\n temp = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[2];\\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[1]);\\n this.cubes[x][y][z].rotationAxis[1] = temp;\\n }\\n break;\\n case \\\"r\\\":\\n if (this.cubes[x][y][z].cubePosition[0] === 1) {\\n temp = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = -temp;\\n\\n\\n temp = this.cubes[x][y][z].rotationAxis[1];\\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[2]);\\n this.cubes[x][y][z].rotationAxis[2] = temp;\\n }\\n break;\\n case \\\"U\\\":\\n if (this.cubes[x][y][z].cubePosition[1] === 1) {\\n temp = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[0];\\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[2]);\\n this.cubes[x][y][z].rotationAxis[2] = temp;\\n }\\n break;\\n case \\\"u\\\":\\n if (this.cubes[x][y][z].cubePosition[1] === 1) {\\n temp = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[2];\\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[0]);\\n this.cubes[x][y][z].rotationAxis[0] = temp;\\n }\\n break;\\n case \\\"D\\\":\\n if (this.cubes[x][y][z].cubePosition[1] === -1) {\\n temp = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[2];\\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[0]);\\n this.cubes[x][y][z].rotationAxis[0] = temp;\\n }\\n break;\\n case \\\"d\\\":\\n if (this.cubes[x][y][z].cubePosition[1] === -1) {\\n temp = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[0];\\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[2]);\\n this.cubes[x][y][z].rotationAxis[2] = temp;\\n }\\n break;\\n case \\\"E\\\":\\n if (this.cubes[x][y][z].cubePosition[1] === 0) {\\n temp = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[2];\\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[0]);\\n this.cubes[x][y][z].rotationAxis[0] = temp;\\n }\\n break;\\n case \\\"e\\\":\\n if (this.cubes[x][y][z].cubePosition[1] === 0) {\\n temp = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[0];\\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[2]);\\n this.cubes[x][y][z].rotationAxis[2] = temp;\\n }\\n break;\\n case \\\"F\\\":\\n if (this.cubes[x][y][z].cubePosition[2] === 1) {\\n temp = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[1];\\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[0]);\\n this.cubes[x][y][z].rotationAxis[0] = temp;\\n }\\n break;\\n case \\\"f\\\":\\n if (this.cubes[x][y][z].cubePosition[2] === 1) {\\n temp = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[0];\\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[1]);\\n this.cubes[x][y][z].rotationAxis[1] = temp;\\n }\\n break;\\n case \\\"S\\\":\\n if (this.cubes[x][y][z].cubePosition[2] === 0) {\\n temp = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[1];\\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[0]);\\n this.cubes[x][y][z].rotationAxis[0] = temp;\\n }\\n break;\\n case \\\"s\\\":\\n if (this.cubes[x][y][z].cubePosition[2] === 0) {\\n temp = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[0];\\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[1]);\\n this.cubes[x][y][z].rotationAxis[1] = temp;\\n }\\n break;\\n case \\\"B\\\":\\n if (this.cubes[x][y][z].cubePosition[2] === -1) {\\n temp = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[0];\\n this.cubes[x][y][z].rotationAxis[0] = negate(this.cubes[x][y][z].rotationAxis[1]);\\n this.cubes[x][y][z].rotationAxis[1] = temp;\\n }\\n break;\\n case \\\"b\\\":\\n if (this.cubes[x][y][z].cubePosition[2] === -1) {\\n temp = this.cubes[x][y][z].cubePosition[0];\\n this.cubes[x][y][z].cubePosition[0] = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[1];\\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[0]);\\n this.cubes[x][y][z].rotationAxis[0] = temp;\\n }\\n break;\\n case \\\"M\\\":\\n if (this.cubes[x][y][z].cubePosition[0] === 0) {\\n temp = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[1];\\n this.cubes[x][y][z].rotationAxis[1] = negate(this.cubes[x][y][z].rotationAxis[2]);\\n this.cubes[x][y][z].rotationAxis[2] = temp;\\n }\\n break;\\n case \\\"m\\\":\\n if (this.cubes[x][y][z].cubePosition[0] === 0) {\\n temp = this.cubes[x][y][z].cubePosition[1];\\n this.cubes[x][y][z].cubePosition[1] = this.cubes[x][y][z].cubePosition[2];\\n this.cubes[x][y][z].cubePosition[2] = -temp;\\n\\n temp = this.cubes[x][y][z].rotationAxis[2];\\n this.cubes[x][y][z].rotationAxis[2] = negate(this.cubes[x][y][z].rotationAxis[1]);\\n this.cubes[x][y][z].rotationAxis[1] = temp;\\n }\\n }\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed5712446f2b57052256716c733acbae\",\n \"score\": \"0.5184816\",\n \"text\": \"function matrix_invert(matrix) {\\n var M = matrix.m;\\n // I use Guassian Elimination to calculate the inverse:\\n // (1) 'augment' the matrix (left) by the identity (on the right)\\n // (2) Turn the matrix on the left into the identity by elemetry row ops\\n // (3) The matrix on the right is the inverse (was the identity matrix)\\n // There are 3 elemtary row ops: (I combine b and c in my code)\\n // (a) Swap 2 rows\\n // (b) Multiply a row by a scalar\\n // (c) Add 2 rows\\n\\n //if the matrix isn't square: exit (error)\\n if (M.length !== M[0].length) {\\n return;\\n }\\n\\n //create the identity matrix (I), and a copy (C) of the original\\n var i = 0,\\n ii = 0,\\n j = 0,\\n dim = M.length,\\n e = 0,\\n t = 0;\\n var I = [],\\n C = [];\\n for (i = 0; i < dim; i += 1) {\\n // Create the row\\n I[I.length] = [];\\n C[C.length] = [];\\n for (j = 0; j < dim; j += 1) {\\n //if we're on the diagonal, put a 1 (for identity)\\n if (i == j) {\\n I[i][j] = 1;\\n } else {\\n I[i][j] = 0;\\n }\\n\\n // Also, make the copy of the original\\n C[i][j] = M[i][j];\\n }\\n }\\n\\n // Perform elementary row operations\\n for (i = 0; i < dim; i += 1) {\\n // get the element e on the diagonal\\n e = C[i][i];\\n\\n // if we have a 0 on the diagonal (we'll need to swap with a lower row)\\n if (e == 0) {\\n //look through every row below the i'th row\\n for (ii = i + 1; ii < dim; ii += 1) {\\n //if the ii'th row has a non-0 in the i'th col\\n if (C[ii][i] != 0) {\\n //it would make the diagonal have a non-0 so swap it\\n for (j = 0; j < dim; j++) {\\n e = C[i][j]; //temp store i'th row\\n C[i][j] = C[ii][j]; //replace i'th row by ii'th\\n C[ii][j] = e; //repace ii'th by temp\\n e = I[i][j]; //temp store i'th row\\n I[i][j] = I[ii][j]; //replace i'th row by ii'th\\n I[ii][j] = e; //repace ii'th by temp\\n }\\n //don't bother checking other rows since we've swapped\\n break;\\n }\\n }\\n //get the new diagonal\\n e = C[i][i];\\n //if it's still 0, not invertable (error)\\n if (e == 0) {\\n return;\\n }\\n }\\n\\n // Scale this row down by e (so we have a 1 on the diagonal)\\n for (j = 0; j < dim; j++) {\\n C[i][j] = C[i][j] / e; //apply to original matrix\\n I[i][j] = I[i][j] / e; //apply to identity\\n }\\n\\n // Subtract this row (scaled appropriately for each row) from ALL of\\n // the other rows so that there will be 0's in this column in the\\n // rows above and below this one\\n for (ii = 0; ii < dim; ii++) {\\n // Only apply to other rows (we want a 1 on the diagonal)\\n if (ii == i) {\\n continue;\\n }\\n\\n // We want to change this element to 0\\n e = C[ii][i];\\n\\n // Subtract (the row above(or below) scaled by e) from (the\\n // current row) but start at the i'th column and assume all the\\n // stuff left of diagonal is 0 (which it should be if we made this\\n // algorithm correctly)\\n for (j = 0; j < dim; j++) {\\n C[ii][j] -= e * C[i][j]; //apply to original matrix\\n I[ii][j] -= e * I[i][j]; //apply to identity\\n }\\n }\\n }\\n\\n //we've done all operations, C should be the identity\\n //matrix I should be the inverse:\\n return I;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae2b23506ee188265a81570fb4f8cb9b\",\n \"score\": \"0.51790154\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae2b23506ee188265a81570fb4f8cb9b\",\n \"score\": \"0.51790154\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed88f73aa1248e6e65879469dbce3f50\",\n \"score\": \"0.516717\",\n \"text\": \"synchronizeTransform() {\\r\\n this.m_xf.R.set$float(this.m_sweep.a);\\r\\n let v1 = this.m_sweep.localCenter;\\r\\n this.m_xf.position.x = Math.fround(this.m_sweep.c.x - (Math.fround(Math.fround(this.m_xf.R.col1.x * v1.x) + Math.fround(this.m_xf.R.col2.x * v1.y))));\\r\\n this.m_xf.position.y = Math.fround(this.m_sweep.c.y - (Math.fround(Math.fround(this.m_xf.R.col1.y * v1.x) + Math.fround(this.m_xf.R.col2.y * v1.y))));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49d83c5e0a823294498676f1bd1193f8\",\n \"score\": \"0.516669\",\n \"text\": \"constructor(color) {\\n super(color);\\n\\n this.vertices = new Float32Array([ // Coordinates\\n 1.0, 1.0, 1.0, -1.0, 1.0, 1.0, -1.0,-1.0, 1.0, 1.0,-1.0, 1.0, // v0-v1-v2-v3 front\\n 1.0, 1.0, 1.0, 1.0,-1.0, 1.0, 1.0,-1.0,-1.0, 1.0, 1.0,-1.0, // v0-v3-v4-v5 right\\n 1.0, 1.0, 1.0, 1.0, 1.0,-1.0, -1.0, 1.0,-1.0, -1.0, 1.0, 1.0, // v0-v5-v6-v1 up\\n -1.0, 1.0, 1.0, -1.0, 1.0,-1.0, -1.0,-1.0,-1.0, -1.0,-1.0, 1.0, // v1-v6-v7-v2 left\\n -1.0,-1.0,-1.0, 1.0,-1.0,-1.0, 1.0,-1.0, 1.0, -1.0,-1.0, 1.0, // v7-v4-v3-v2 down\\n 1.0,-1.0,-1.0, -1.0,-1.0,-1.0, -1.0, 1.0,-1.0, 1.0, 1.0,-1.0 // v4-v7-v6-v5 back\\n ]);\\n\\n this.normals = new Float32Array([ // Normal\\n 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, // v0-v1-v2-v3 front\\n 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, // v0-v3-v4-v5 right\\n 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, 0.0, 1.0, 0.0, // v0-v5-v6-v1 up\\n -1.0, 0.0, 0.0, -1.0, 0.0, 0.0, -1.0, 0.0, 0.0, -1.0, 0.0, 0.0, // v1-v6-v7-v2 left\\n 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, // v7-v4-v3-v2 down\\n 0.0, 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, 0.0,-1.0, 0.0, 0.0,-1.0 // v4-v7-v6-v5 back\\n ]);\\n\\n // Indices of the vertices\\n this.indices = new Uint16Array([\\n 0, 1, 2, 0, 2, 3, // front\\n 4, 5, 6, 4, 6, 7, // right\\n 8, 9,10, 8,10,11, // up\\n 12,13,14, 12,14,15, // left\\n 16,17,18, 16,18,19, // down\\n 20,21,22, 20,22,23 // back\\n ]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c3f93e642cda86063b85542bdfaf1b2\",\n \"score\": \"0.5165795\",\n \"text\": \"function uploadInvViewMatrixToShader() {\\r\\n gl.uniformMatrix3fv(shaderProgram.uInvVMatrix, false, invVMatrix);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d9a7dc7a934b7ebf6058c9d404d74f4\",\n \"score\": \"0.5163623\",\n \"text\": \"function draw2(){\\r\\n gl.viewport(0, 0, gl.viewportWidth, gl.viewportHeight);\\r\\n gl.clear(gl.COLOR_BUFFER_BIT | gl.DEPTH_BUFFER_BIT); \\r\\n mat4.identity(mvMatrix);\\r\\n mat4.rotateY(mvMatrix, mvMatrix, degToRad(rotAngle));\\r\\n // var rotateM = mat4.create();\\r\\n // var scaleM = mat4.create();\\r\\n // var scale = Math.abs(Math.cos(degToRad(rotAngle)));\\r\\n // mat4.fromScaling(scaleM,[0.5+0.5*scale,1.0,1.0]);\\r\\n // mat4.fromRotation(rotateM,degToRad(rotAngle),[0.0,0.0,1.0]);\\r\\n // mat4.multiply(mvMatrix,mvMatrix,rotateM);\\r\\n // mat4.multiply(mvMatrix,scaleM,mvMatrix);\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexPositionBuffer);\\r\\n gl.vertexAttribPointer(shaderProgram.vertexPositionAttribute, \\r\\n vertexPositionBuffer.itemSize, gl.FLOAT, false, 0, 0);\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexColorBuffer);\\r\\n gl.vertexAttribPointer(shaderProgram.vertexColorAttribute, \\r\\n vertexColorBuffer.itemSize, gl.FLOAT, false, 0, 0);\\r\\n \\r\\n setMatrixUniforms();\\r\\n gl.drawArrays(gl.TRIANGLES, 0, vertexPositionBuffer.numberOfItems);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8463767ded788b6ad9a301ababee730c\",\n \"score\": \"0.5161947\",\n \"text\": \"function setupBuffers() {//set up the picture\\r\\n vertexPositionBuffer = gl.createBuffer(); //set up the buffer\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexPositionBuffer);\\r\\n var triangleVertices = [//matrix of 30 triangles consists of 90 vertices\\r\\n \\r\\n //below lists 30 triangles\\r\\n //the first 20 triangles is the \\\"I\\\" part\\r\\n -0.95, 0.95, 0.0,//1\\r\\n 0.95, 0.95, 0.0,\\r\\n -0.95, 0.63, 0.0,\\r\\n \\r\\n -0.95, 0.63, 0.0,//2\\r\\n 0.95, 0.95, 0.0,\\r\\n -0.75, 0.63, 0.0,\\r\\n \\r\\n -0.75, 0.63, 0.0,//3\\r\\n 0.95, 0.95, 0.0,\\r\\n -0.35, 0.63, 0.0,\\r\\n \\r\\n -0.35, 0.63, 0.0,//4\\r\\n 0.95, 0.95, 0.0,\\r\\n 0.35, 0.63, 0.0,\\r\\n \\r\\n 0.35, 0.63, 0.0,//5\\r\\n 0.95, 0.95, 0.0,\\r\\n 0.75, 0.63, 0.0,\\r\\n \\r\\n 0.75, 0.63, 0.0,//6\\r\\n 0.95, 0.95, 0.0,\\r\\n 0.95, 0.63, 0.0,\\r\\n \\r\\n -0.75, 0.63, 0.0,//7\\r\\n -0.35, 0.63, 0.0,\\r\\n -0.75, -0.3, 0.0,\\r\\n \\r\\n -0.75, -0.3, 0.0,//8\\r\\n -0.35, 0.63, 0.0,\\r\\n -0.35, 0.368, 0.0,\\r\\n \\r\\n -0.75, -0.3, 0.0,//9\\r\\n -0.35, 0.368, 0.0,\\r\\n -0.35, -0.05, 0.0,\\r\\n \\r\\n -0.35, -0.05, 0.0,//10\\r\\n -0.35, 0.368, 0.0,\\r\\n -0.2, -0.05, 0.0,\\r\\n \\r\\n -0.2, -0.05, 0.0,//11\\r\\n -0.35, 0.368, 0.0,\\r\\n -0.2, 0.368, 0.0,\\r\\n \\r\\n -0.75, -0.3, 0.0,//12\\r\\n -0.35, -0.05, 0.0,\\r\\n -0.35, -0.3, 0.0,\\r\\n \\r\\n 0.2, -0.05, 0.0,//13\\r\\n 0.35, 0.368, 0.0,\\r\\n 0.2, 0.368, 0.0,\\r\\n \\r\\n 0.35, -0.05, 0.0,//14\\r\\n 0.35, 0.368, 0.0,\\r\\n 0.2, -0.05, 0.0,\\r\\n \\r\\n 0.75, -0.3, 0.0,//15\\r\\n 0.35, 0.368, 0.0,\\r\\n 0.35, -0.05, 0.0,\\r\\n \\r\\n 0.75, -0.3, 0.0,//16\\r\\n 0.35, 0.63, 0.0,\\r\\n 0.35, 0.368, 0.0,\\r\\n \\r\\n 0.75, 0.63, 0.0,//17\\r\\n 0.35, 0.63, 0.0,\\r\\n 0.75, -0.3, 0.0,\\r\\n \\r\\n 0.75, -0.3, 0.0,//18\\r\\n 0.35, -0.05, 0.0,\\r\\n 0.35, -0.3, 0.0,\\r\\n \\r\\n //the below 10 parts is the organle part of the badge\\r\\n -0.75, -0.4, 0.0,//19\\r\\n -0.75, -0.45, 0.0,\\r\\n -0.6, -0.57, 0.0,\\r\\n \\r\\n -0.6, -0.57, 0.0,//20\\r\\n -0.75, -0.4, 0.0,\\r\\n -0.6, -0.4, 0.0,\\r\\n \\r\\n -0.5, -0.4, 0.0,//21\\r\\n -0.5, -0.67, 0.0,\\r\\n -0.35, -0.75, 0.0,\\r\\n \\r\\n -0.35, -0.75, 0.0,//22\\r\\n -0.5, -0.4, 0.0,\\r\\n -0.35, -0.4, 0.0,\\r\\n \\r\\n -0.2, -0.4, 0.0,//23\\r\\n -0.2, -0.8, 0.0,\\r\\n -0.05, -0.9, 0.0,\\r\\n \\r\\n -0.05, -0.9, 0.0,//24\\r\\n -0.2, -0.4, 0.0,\\r\\n -0.05, -0.4, 0.0,\\r\\n \\r\\n 0.05, -0.9, 0.0, //25\\r\\n 0.2, -0.4, 0.0,\\r\\n 0.05, -0.4, 0.0,\\r\\n \\r\\n 0.2, -0.4, 0.0,//26\\r\\n 0.2, -0.8, 0.0,\\r\\n 0.05, -0.9, 0.0,\\r\\n \\r\\n 0.35, -0.75, 0.0,//27\\r\\n 0.5, -0.4, 0.0, \\r\\n 0.35, -0.4, 0.0,\\r\\n \\r\\n 0.5, -0.4, 0.0, //28\\r\\n 0.5, -0.67, 0.0, \\r\\n 0.35, -0.75, 0.0, \\r\\n \\r\\n 0.6, -0.57, 0.0, //29\\r\\n 0.75, -0.4, 0.0, \\r\\n 0.6, -0.4, 0.0,\\r\\n \\r\\n 0.75, -0.4, 0.0, //30\\r\\n 0.75, -0.45, 0.0,\\r\\n 0.6, -0.57, 0.0,\\r\\n ];\\r\\n \\r\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(triangleVertices), gl.STATIC_DRAW);\\r\\n vertexPositionBuffer.itemSize = 3;//each vertices has size three: x,y,z\\r\\n vertexPositionBuffer.numberOfItems = 90;//there are 90 vertices in this buffer\\r\\n \\r\\n vertexColorBuffer = gl.createBuffer();\\r\\n gl.bindBuffer(gl.ARRAY_BUFFER, vertexColorBuffer);\\r\\n var colors = [//set up the color vertices\\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n \\r\\n 0.0, 0.0, 0.7, 1.0, //blue\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n 0.0, 0.0, 0.7, 1.0,\\r\\n //below are 12 organges\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n 1.0, 0.0, 0.0, 1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0,1.0,\\r\\n 1.0, 0.0,0.0, 1.0,\\r\\n 1.0, 0.0,0.0,1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0,1.0,\\r\\n 1.0, 0.0,0.0, 1.0,\\r\\n 1.0, 0.0,0.0,1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0,1.0,\\r\\n 1.0, 0.0,0.0, 1.0,\\r\\n 1.0, 0.0,0.0,1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0,1.0,\\r\\n 1.0, 0.0,0.0, 1.0,\\r\\n 1.0, 0.0,0.0,1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0,1.0,\\r\\n 1.0, 0.0,0.0, 1.0,\\r\\n 1.0, 0.0,0.0,1.0,\\r\\n \\r\\n 1.0, 0.0, 0.0,1.0,\\r\\n 1.0, 0.0,0.0, 1.0,\\r\\n 1.0, 0.0,0.0,1.0,\\r\\n ];\\r\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(colors), gl.STATIC_DRAW);\\r\\n vertexColorBuffer.itemSize = 4;//the item size is 4 including R,G,B and alpha\\r\\n vertexColorBuffer.numItems = 90; //there are 90 color vertices\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddb9abb16fe33b3088a18d5147d5db5b\",\n \"score\": \"0.5156649\",\n \"text\": \"function setGeometry(gl) {\\r\\n var positions = new Float32Array(\\r\\n [\\r\\n -0.5, -0.5, -0.5,\\r\\n -0.5, 0.5, -0.5,\\r\\n 0.5, -0.5, -0.5,\\r\\n -0.5, 0.5, -0.5,\\r\\n 0.5, 0.5, -0.5,\\r\\n 0.5, -0.5, -0.5,\\r\\n\\r\\n -0.5, -0.5, 0.5,\\r\\n 0.5, -0.5, 0.5,\\r\\n -0.5, 0.5, 0.5,\\r\\n -0.5, 0.5, 0.5,\\r\\n 0.5, -0.5, 0.5,\\r\\n 0.5, 0.5, 0.5,\\r\\n\\r\\n -0.5, 0.5, -0.5,\\r\\n -0.5, 0.5, 0.5,\\r\\n 0.5, 0.5, -0.5,\\r\\n -0.5, 0.5, 0.5,\\r\\n 0.5, 0.5, 0.5,\\r\\n 0.5, 0.5, -0.5,\\r\\n\\r\\n -0.5, -0.5, -0.5,\\r\\n 0.5, -0.5, -0.5,\\r\\n -0.5, -0.5, 0.5,\\r\\n -0.5, -0.5, 0.5,\\r\\n 0.5, -0.5, -0.5,\\r\\n 0.5, -0.5, 0.5,\\r\\n\\r\\n -0.5, -0.5, -0.5,\\r\\n -0.5, -0.5, 0.5,\\r\\n -0.5, 0.5, -0.5,\\r\\n -0.5, -0.5, 0.5,\\r\\n -0.5, 0.5, 0.5,\\r\\n -0.5, 0.5, -0.5,\\r\\n\\r\\n 0.5, -0.5, -0.5,\\r\\n 0.5, 0.5, -0.5,\\r\\n 0.5, -0.5, 0.5,\\r\\n 0.5, -0.5, 0.5,\\r\\n 0.5, 0.5, -0.5,\\r\\n 0.5, 0.5, 0.5,\\r\\n\\r\\n ]);\\r\\n gl.bufferData(gl.ARRAY_BUFFER, positions, gl.STATIC_DRAW);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e3f3613302ed71bfee36152db285133\",\n \"score\": \"0.514158\",\n \"text\": \"function zOrder$1( x, y, minX, minY, invSize ) {\\n\\n \\t// coords are transformed into non-negative 15-bit integer range\\n \\tx = 32767 * ( x - minX ) * invSize;\\n \\ty = 32767 * ( y - minY ) * invSize;\\n\\n \\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n \\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n \\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n \\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n \\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n \\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n \\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n \\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n \\treturn x | ( y << 1 );\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a48d428043032497e882a9db207855\",\n \"score\": \"0.51414764\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a48d428043032497e882a9db207855\",\n \"score\": \"0.51414764\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a48d428043032497e882a9db207855\",\n \"score\": \"0.51414764\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a48d428043032497e882a9db207855\",\n \"score\": \"0.51414764\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a48d428043032497e882a9db207855\",\n \"score\": \"0.51414764\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a48d428043032497e882a9db207855\",\n \"score\": \"0.51414764\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c28e66da722f3fb8cfbda699abe32f94\",\n \"score\": \"0.51383257\",\n \"text\": \"static vectorToWorldSpace (vec, vAgentHeading, vAgentSide) {\\n // make a copy of the point\\n var transVec = new Vector2D(vec);\\n\\n // create a transformation matrix\\n var matTransform = new C2DMatrix();\\n\\n //rotate\\n matTransform.rotate(vAgentHeading, vAgentSide);\\n\\n //now transform the vertices\\n matTransform.transformVector2Ds(transVec);\\n\\n return transVec;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3673cf5f445e4e5f9afff45634f3353\",\n \"score\": \"0.5137185\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3673cf5f445e4e5f9afff45634f3353\",\n \"score\": \"0.5137185\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3673cf5f445e4e5f9afff45634f3353\",\n \"score\": \"0.5137185\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3673cf5f445e4e5f9afff45634f3353\",\n \"score\": \"0.5137185\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3673cf5f445e4e5f9afff45634f3353\",\n \"score\": \"0.5137185\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3673cf5f445e4e5f9afff45634f3353\",\n \"score\": \"0.5137185\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3673cf5f445e4e5f9afff45634f3353\",\n \"score\": \"0.5137185\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = 32767 * (x - minX) * invSize;\\n y = 32767 * (y - minY) * invSize;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b7e787d26c4e13b1cd2dacf274a2750\",\n \"score\": \"0.5132477\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b7e787d26c4e13b1cd2dacf274a2750\",\n \"score\": \"0.5132477\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b7e787d26c4e13b1cd2dacf274a2750\",\n \"score\": \"0.5132477\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b7e787d26c4e13b1cd2dacf274a2750\",\n \"score\": \"0.5132477\",\n \"text\": \"function zOrder( x, y, minX, minY, invSize ) {\\n\\n\\t// coords are transformed into non-negative 15-bit integer range\\n\\n\\tx = 32767 * ( x - minX ) * invSize;\\n\\ty = 32767 * ( y - minY ) * invSize;\\n\\n\\tx = ( x | ( x << 8 ) ) & 0x00FF00FF;\\n\\tx = ( x | ( x << 4 ) ) & 0x0F0F0F0F;\\n\\tx = ( x | ( x << 2 ) ) & 0x33333333;\\n\\tx = ( x | ( x << 1 ) ) & 0x55555555;\\n\\n\\ty = ( y | ( y << 8 ) ) & 0x00FF00FF;\\n\\ty = ( y | ( y << 4 ) ) & 0x0F0F0F0F;\\n\\ty = ( y | ( y << 2 ) ) & 0x33333333;\\n\\ty = ( y | ( y << 1 ) ) & 0x55555555;\\n\\n\\treturn x | ( y << 1 );\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d749804c29976222855414306c67f496\",\n \"score\": \"0.5128188\",\n \"text\": \"convertToWireframe() {\\n let result = new PolygonMesh();\\n let i;\\n result.setVertexData(this.vertexData);\\n let newIndices = [];\\n switch (this.faceType) {\\n case FaceType.Triangle:\\n for (i = 0; i < this.indices.length; i += 3) {\\n newIndices.push(this.indices[i]);\\n newIndices.push(this.indices[i + 1]);\\n newIndices.push(this.indices[i + 1]);\\n newIndices.push(this.indices[i + 2]);\\n newIndices.push(this.indices[i + 2]);\\n newIndices.push(this.indices[i]);\\n }\\n break;\\n case FaceType.TriangleFan:\\n for (i = 1; i < this.indices.length - 1; i += 1) {\\n newIndices.push(this.indices[0]);\\n newIndices.push(this.indices[i]);\\n newIndices.push(this.indices[i]);\\n newIndices.push(this.indices[i + 1]);\\n newIndices.push(this.indices[0]);\\n newIndices.push(this.indices[i + 1]);\\n }\\n break;\\n case FaceType.TriangleStrip:\\n for (i = 0; i < this.indices.length - 2; i++) {\\n newIndices.push(this.indices[i]);\\n newIndices.push(this.indices[i + 1]);\\n newIndices.push(this.indices[i + 1]);\\n newIndices.push(this.indices[i + 2]);\\n newIndices.push(this.indices[i + 2]);\\n newIndices.push(this.indices[i]);\\n }\\n break;\\n }\\n result.setPrimitives(newIndices, FaceType.Lines);\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65beefaa4d560c8bcbe5ec6bbbf607e2\",\n \"score\": \"0.51243913\",\n \"text\": \"updateViewMatrix() {\\n if(this.mode === Camera.MODE_FREE){\\n this.transform.matView.reset()\\n .vtranslate(this.transform.position)\\n .rotateX(this.transform.rotation.x * Transform.deg2Rad)\\n .rotateY(this.transform.rotation.y * Transform.deg2Rad)\\n } else {\\n // Notice the different order of operations\\n this.transform.matView.reset()\\n .rotateX(this.transform.rotation.x * Transform.deg2Rad)\\n .rotateY(this.transform.rotation.y * Transform.deg2Rad)\\n .vtranslate(this.transform.position)\\n }\\n\\n this.transform.updateDirection(); // Need to know the direction for panning\\n\\n // Cameras work by doing the inverse transformation of all meshes!\\n Matrix4.invert(this.viewMatrix, this.transform.getViewMatrix())\\n\\n return this.viewMatrix\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbc6543b0525cbf28c949a55fcec4b6c\",\n \"score\": \"0.51185715\",\n \"text\": \"setIdentity() {\\r\\n this.col1.x = 1.0;\\r\\n this.col2.x = 0.0;\\r\\n this.col1.y = 0.0;\\r\\n this.col2.y = 1.0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25a8086a9333e25fad90e79053511c24\",\n \"score\": \"0.5116514\",\n \"text\": \"function setMatrixTransform(){\\n if(x <= y+0.2){ // scale up\\n if(y < x){\\n y = 1.21;\\n }\\n x += 0.01;\\n mat4.fromScaling(mvMatrix, [1, x, 1]); \\n space += 0.1;\\n }\\n else{ // scale down\\n if(y < -1.2){\\n y = 1.21;\\n }\\n y = y-0.01;\\n mat4.fromScaling(mvMatrix, [1, y, 1]);\\n //count += 1;\\n space += 0.1;\\n }\\n mat4.rotate(mvMatrix, mvMatrix, space * 3.1415926 / 180, [0.6, 0.7, 0.6]); //rotate after scaling\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"154c1033b97daca81ae2bb6a3e81f142\",\n \"score\": \"0.5115767\",\n \"text\": \"function zOrder(x, y, minX, minY, invSize) {\\n // coords are transformed into non-negative 15-bit integer range\\n x = (x - minX) * invSize | 0;\\n y = (y - minY) * invSize | 0;\\n\\n x = (x | (x << 8)) & 0x00FF00FF;\\n x = (x | (x << 4)) & 0x0F0F0F0F;\\n x = (x | (x << 2)) & 0x33333333;\\n x = (x | (x << 1)) & 0x55555555;\\n\\n y = (y | (y << 8)) & 0x00FF00FF;\\n y = (y | (y << 4)) & 0x0F0F0F0F;\\n y = (y | (y << 2)) & 0x33333333;\\n y = (y | (y << 1)) & 0x55555555;\\n\\n return x | (y << 1);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ccb9f0e399ab0a7878abeb2ad24d17e3\",\n \"score\": \"0.51121175\",\n \"text\": \"flip() {\\n return new hamonengine.math.vector2(this.x, -this.y);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2959b876a797dd2c0972c8dc4d1f665b\",\n \"score\": \"0.51097864\",\n \"text\": \"function f_wingFront(){\\n var baseModelView = modelview;\\n\\n applyTexture(textWingFront);\\n\\n\\n normalMatrix = extractNormalMatrix(modelview); // always extract the normal matrix before scaling\\n modelview = mult(modelview, scale4(0.4 , 0.2, 0.25));\\n triangleRectangle.render();\\n\\n\\n modelview = baseModelView;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7799c2e72ab85a170667170b199ce34b\",\n \"score\": \"0.5108827\",\n \"text\": \"mapTriangle(ctx, p0, p1, p2, p_0, p_1, p_2) {\\n // break out the individual triangles x's & y's\\n var x0 = p_0.x,\\n y0 = p_0.y;\\n var x1 = p_1.x,\\n y1 = p_1.y;\\n var x2 = p_2.x,\\n y2 = p_2.y;\\n var u0 = p0.x,\\n v0 = p0.y;\\n var u1 = p1.x,\\n v1 = p1.y;\\n var u2 = p2.x,\\n v2 = p2.y;\\n\\n // save the unclipped & untransformed destination canvas\\n ctx.save();\\n\\n // clip the destination canvas to the unwarped destination triangle\\n ctx.beginPath();\\n ctx.moveTo(x0, y0);\\n ctx.lineTo(x1, y1);\\n ctx.lineTo(x2, y2);\\n ctx.closePath();\\n ctx.clip();\\n\\n // Compute matrix transform\\n var delta = u0 * v1 + v0 * u2 + u1 * v2 - v1 * u2 - v0 * u1 - u0 * v2;\\n var delta_a = x0 * v1 + v0 * x2 + x1 * v2 - v1 * x2 - v0 * x1 - x0 * v2;\\n var delta_b = u0 * x1 + x0 * u2 + u1 * x2 - x1 * u2 - x0 * u1 - u0 * x2;\\n var delta_c =\\n u0 * v1 * x2 +\\n v0 * x1 * u2 +\\n x0 * u1 * v2 -\\n x0 * v1 * u2 -\\n v0 * u1 * x2 -\\n u0 * x1 * v2;\\n var delta_d = y0 * v1 + v0 * y2 + y1 * v2 - v1 * y2 - v0 * y1 - y0 * v2;\\n var delta_e = u0 * y1 + y0 * u2 + u1 * y2 - y1 * u2 - y0 * u1 - u0 * y2;\\n var delta_f =\\n u0 * v1 * y2 +\\n v0 * y1 * u2 +\\n y0 * u1 * v2 -\\n y0 * v1 * u2 -\\n v0 * u1 * y2 -\\n u0 * y1 * v2;\\n\\n // Draw the transformed image\\n ctx.transform(\\n delta_a / delta,\\n delta_d / delta,\\n delta_b / delta,\\n delta_e / delta,\\n delta_c / delta,\\n delta_f / delta,\\n );\\n\\n // draw the transformed source image to the destination canvas\\n ctx.drawImage(this.img, 0, 0);\\n\\n // restore the context to it's unclipped untransformed state\\n ctx.restore();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2856f9c3493c45f2b740a1155673068c\",\n \"score\": \"0.51026535\",\n \"text\": \"function matrix_invert(M){\\n // I use Guassian Elimination to calculate the inverse:\\n // (1) 'augment' the matrix (left) by the identity (on the right)\\n // (2) Turn the matrix on the left into the identity by elemetry row ops\\n // (3) The matrix on the right is the inverse (was the identity matrix)\\n // There are 3 elemtary row ops: (I combine b and c in my code)\\n // (a) Swap 2 rows\\n // (b) Multiply a row by a scalar\\n // (c) Add 2 rows\\n \\n //if the matrix isn't square: exit (error)\\n if(M.length !== M[0].length){return;}\\n \\n //create the identity matrix (I), and a copy (C) of the original\\n var i=0, ii=0, j=0, dim=M.length, e=0, t=0;\\n var I = [], C = [];\\n for(i=0; i= width || this.x - this.r <= 0){\\n this.x = 0;\\n }\\n if(this.y + this.r >= height || this.y - this.r <= 0){\\n this.y = 0;\\n }\\n }\",\n \"title\": \"\"\n }\n]"}}},{"rowIdx":2367,"cells":{"query_id":{"kind":"string","value":"a55cd3a6aed8078c9d5c044b4ab36ae2"},"query":{"kind":"string","value":"Merges two schemas/instances together."},"positive_passages":{"kind":"list like","value":[{"docid":"431517a2b76e3655c9c8ccba68118108","score":"0.0","text":"function inherits(base, extra, extension) {\n\t\tvar baseType = typeOf(base),\n\t\t\textraType = typeOf(extra),\n\t\t\tchild, x;\n\t\t\n\t\tif (extraType === \"undefined\") {\n\t\t\treturn clone(base, true);\n\t\t} else if (baseType === \"undefined\" || extraType !== baseType) {\n\t\t\treturn clone(extra, true);\n\t\t} else if (extraType === \"object\") {\n\t\t\tif (base instanceof JSONSchema) {\n\t\t\t\tbase = base.getAttributes();\n\t\t\t}\n\t\t\tif (extra instanceof JSONSchema) {\n\t\t\t\textra = extra.getAttributes();\n\t\t\t\tif (extra[\"extends\"] && extension && extra[\"extends\"] instanceof JSONSchema) {\n\t\t\t\t\textra[\"extends\"] = [ extra[\"extends\"] ];\n\t\t\t\t}\n\t\t\t}\n\t\t\tchild = clone(base, true); //this could be optimized as some properties get overwritten\n\t\t\tfor (x in extra) {\n\t\t\t\tif (extra[x] !== O[x]) {\n\t\t\t\t\tchild[x] = inherits(base[x], extra[x], extension);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn child;\n\t\t} else {\n\t\t\treturn clone(extra, true);\n\t\t}\n\t}","title":""}],"string":"[\n {\n \"docid\": \"431517a2b76e3655c9c8ccba68118108\",\n \"score\": \"0.0\",\n \"text\": \"function inherits(base, extra, extension) {\\n\\t\\tvar baseType = typeOf(base),\\n\\t\\t\\textraType = typeOf(extra),\\n\\t\\t\\tchild, x;\\n\\t\\t\\n\\t\\tif (extraType === \\\"undefined\\\") {\\n\\t\\t\\treturn clone(base, true);\\n\\t\\t} else if (baseType === \\\"undefined\\\" || extraType !== baseType) {\\n\\t\\t\\treturn clone(extra, true);\\n\\t\\t} else if (extraType === \\\"object\\\") {\\n\\t\\t\\tif (base instanceof JSONSchema) {\\n\\t\\t\\t\\tbase = base.getAttributes();\\n\\t\\t\\t}\\n\\t\\t\\tif (extra instanceof JSONSchema) {\\n\\t\\t\\t\\textra = extra.getAttributes();\\n\\t\\t\\t\\tif (extra[\\\"extends\\\"] && extension && extra[\\\"extends\\\"] instanceof JSONSchema) {\\n\\t\\t\\t\\t\\textra[\\\"extends\\\"] = [ extra[\\\"extends\\\"] ];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tchild = clone(base, true); //this could be optimized as some properties get overwritten\\n\\t\\t\\tfor (x in extra) {\\n\\t\\t\\t\\tif (extra[x] !== O[x]) {\\n\\t\\t\\t\\t\\tchild[x] = inherits(base[x], extra[x], extension);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn child;\\n\\t\\t} else {\\n\\t\\t\\treturn clone(extra, true);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n }\n]"},"negative_passages":{"kind":"list like","value":[{"docid":"7aa510681f674fba8725c38c15a0f509","score":"0.65103585","text":"function union (schema, instance) {\n var type = primitiveType(instance);\n if (type == 'undefined') {\n // TODO: handle this case. What should I do with an array of values like\n // `['laugh', 100, undefined]`? change all of the schemas to optional?\n // schemas.forEach(schema => schema.optional = true);\n return schema;\n }\n else if (type == 'object') {\n // TODO: clone the schema instead of mutating it\n var objectSchema = schema;\n if (!typeMatches(type, objectSchema.type)) {\n // the schema does not currently handle objects, so we need to add the type\n objectSchema.type = addType(type, objectSchema.type);\n // and the appropriate field\n objectSchema.properties = {};\n }\n // now we can merge the object's fields\n for (var key in instance) {\n // should we do a `hasOwnProperty` check?\n objectSchema.properties[key] = union(objectSchema.properties[key] || {}, instance[key]);\n }\n return objectSchema;\n }\n else if (type == 'array') {\n // TODO: support tuple-type arrays?\n // TODO: clone the existing schema\n var arraySchema_1 = schema;\n if (!typeMatches(type, arraySchema_1.type)) {\n // the schema does not currently handle arrays, so we need to add the type\n arraySchema_1.type = addType(type, arraySchema_1.type);\n // and the appropriate field\n arraySchema_1.items = {};\n }\n // now we can merge the array's schema\n instance.forEach(function (item) {\n arraySchema_1.items = union(arraySchema_1.items, item);\n });\n return arraySchema_1;\n }\n else {\n if (!typeMatches(type, schema.type)) {\n schema.type = addType(type, schema.type);\n }\n // only the nested types, object and array, require merging. otherwise, nothing needs to be done.\n return schema;\n }\n}","title":""},{"docid":"9c9e09c9b82c5ceb16ad1596ca115252","score":"0.5906787","text":"function mergeSchemas(config) {\n const typeDefs = mergeTypes(config);\n const extractedResolvers = [];\n const extractedExtensions = [];\n for (const schema of config.schemas) {\n extractedResolvers.push(utils.getResolversFromSchema(schema));\n extractedExtensions.push(extractExtensionsFromSchema(schema));\n }\n extractedResolvers.push(...ensureResolvers(config));\n const resolvers = mergeResolvers(extractedResolvers, config);\n const extensions = mergeExtensions(extractedExtensions);\n return makeSchema({ resolvers, typeDefs, extensions }, config);\n}","title":""},{"docid":"25de7b279f851e21ffc32bc9953bc399","score":"0.5782577","text":"function merge (schema, doc, self) {\n var keys = Object.keys(doc);\n\n for (var i = 0; i < keys.length; ++i) {\n var key = keys[i];\n var type;\n\n // if nothing in schema yet, just assign\n if ('undefined' == typeof schema[key]) {\n var type = self.getType(doc, key);\n if (undefined !== type) {\n schema[key] = type;\n }\n continue;\n }\n\n // exists in schema and incoming is an object?\n if (isObject(doc[key])) {\n if (isObject(schema[key])) {\n merge(schema[key], doc[key], self);\n\n } else {\n type = self.getType(doc, key);\n if (undefined !== type) {\n if ('null' == schema[key]) {\n schema[key] = type;\n } else if (type != schema[key]) {\n schema[key] = 'Mixed';\n }\n }\n }\n } else {\n // exists in schema and incoming is not an object.\n var type = self.getType(doc, key);\n if (undefined === type) {\n continue;\n }\n\n if ('null' == schema[key]) {\n schema[key] = type;\n\n } else if ('null' == type) {\n // ignore\n\n } else if (Array.isArray(schema[key]) && Array.isArray(type)) {\n\n if (0 === schema[key].length) {\n schema[key] = type;\n\n } else if (schema[key][0] instanceof Schema && isObject(type[0])) {\n // merge schemas\n schema[key][0].combine(type[0]);\n\n } else if (!equalType(schema[key], type)) {\n schema[key] = ['Mixed'];\n }\n\n } else if (!equalType(schema[key], type)) {\n schema[key] = 'Mixed';\n }\n }\n }\n}","title":""},{"docid":"f079c6cabd0445f1773664cdb3690ef8","score":"0.53333455","text":"function mergeUpdates(a, b) {\n\tif(typeof a === \"object\" && typeof b === \"object\") {\n\t\tvar res = {};\n\t\tObject.keys(a).concat(Object.keys(b)).forEach(function(key) {\n\t\t\tif(a[key] && b[key]) {\n\t\t\t\tswitch(key) {\n\t\t\t\t\tcase \"$push\":\n\t\t\t\t\t\tres[key] = a[key].concat(b[key]);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"$unshift\":\n\t\t\t\t\t\tres[key] = b[key].concat(a[key]);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"$splice\":\n\t\t\t\t\t\tres[key] = a[key].concat(b[key]);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"$set\":\n\t\t\t\t\t\tres[key] = b[key];\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"$merge\":\n\t\t\t\t\t\tvar o = res[key] = {};\n\t\t\t\t\t\tObject.keys(a[key]).forEach(function(x) {\n\t\t\t\t\t\t\to[x] = a[key][x]\n\t\t\t\t\t\t});\n\t\t\t\t\t\tObject.keys(b[key]).forEach(function(x) {\n\t\t\t\t\t\t\to[x] = b[key][x]\n\t\t\t\t\t\t});\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tres[key] = mergeUpdates(a[key], b[key]);\n\t\t\t} else if(a[key])\n\t\t\t\tres[key] = a[key];\n\t\t\telse\n\t\t\t\tres[key] = b[key];\n\t\t});\n\t}\n\treturn a || b;\n}","title":""},{"docid":"1d15bba7ab7a3da16d4136e7bf4b5016","score":"0.5298907","text":"function mergeSchemas(functionType, lhsSchema, rhsSchema, passign) {\n // handle parameter name conflicts by having the second primitive win\n const newArgNames = new Set;\n const newArgs = [];\n for (let arg of rhsSchema.iterateArguments()) {\n if (arg.name === passign)\n continue;\n newArgNames.add(arg.name);\n newArgs.push(arg);\n }\n for (let arg of lhsSchema.iterateArguments()) {\n if (newArgNames.has(arg.name))\n continue;\n /*if (!lhsSchema.isArgInput(arg.name))\n continue;*/\n newArgNames.add(arg.name);\n newArgs.push(arg);\n }\n\n return new Ast.ExpressionSignature(null, functionType, null /* class */, [] /* extends */, newArgs, {\n is_list: lhsSchema.is_list || rhsSchema.is_list,\n is_monitorable: lhsSchema.is_monitorable && rhsSchema.is_monitorable,\n require_filter: lhsSchema.require_filter || rhsSchema.require_filter,\n default_projection: [...new Set(lhsSchema.default_projection.concat(rhsSchema.default_projection))],\n minimal_projection: [...new Set(lhsSchema.minimal_projection.concat(rhsSchema.minimal_projection))],\n no_filter: lhsSchema.no_filter && rhsSchema.no_filter\n });\n}","title":""},{"docid":"07f528d7d0a9c0c163c76fb19daf2084","score":"0.52729154","text":"function merge(dst, src) {\n const keys = Object.keys(src);\n for (let i = 0; i < keys.length; ++i) {\n const key = keys[i];\n if (typeOf(dst[key]) === 'object' && typeOf(src[key]) === 'object') {\n Vue.set(dst, key, merge(dst[key], src[key]));\n } else {\n Vue.set(dst, key, src[key]);\n }\n }\n return dst;\n}","title":""},{"docid":"925568208a83905a8f0523071c609df1","score":"0.524971","text":"function combineAllOf(schema) {\n if (!isObject(schema) || !isArray(schema.allOf)) {\n return schema;\n }\n var mergedSchema = mergeSchemas.apply(void 0, __spread(schema.allOf));\n if (Object.keys(schema).length > 1) {\n var extraKeys = __assign({}, schema);\n delete extraKeys.allOf;\n mergedSchema = mergeSchemas(mergedSchema, extraKeys);\n }\n return mergedSchema;\n}","title":""},{"docid":"5a9495e9d4cbee09dad45e59f7f75d55","score":"0.5189018","text":"function mergeSchemaGroup(group, mergeSchemas, source) {\n var allKeys = allUniqueKeys(source || group)\n var extractor = source\n ? getItemSchemas\n : getValues\n return allKeys.reduce(function(all, key) {\n var schemas = extractor(group, key)\n var compacted = uniqWith(schemas.filter(notUndefined), compare)\n all[key] = mergeSchemas(compacted, key)\n return all\n }, source\n ? []\n : {})\n}","title":""},{"docid":"7673d605d209bdc195b29a8ec448116b","score":"0.51573783","text":"function importSchema(schema, schemas) {\n var sdl = read(schema, schemas) || schema;\n var document = getDocumentFromSDL(sdl);\n // Recursively process the imports, starting by importing all types from the initial schema\n var _a = collectDefinitions(['*'], sdl, schema, schemas), allDefinitions = _a.allDefinitions, typeDefinitions = _a.typeDefinitions;\n // Post processing of the final schema (missing types, unused types, etc.)\n // Query, Mutation and Subscription should be merged\n // And should always be in the first set, to make sure they\n // are not filtered out.\n var firstTypes = lodash_1.flatten(typeDefinitions).filter(function (d) {\n return lodash_1.includes(rootFields, d.name.value);\n });\n var otherFirstTypes = typeDefinitions[0].filter(function (d) { return !lodash_1.includes(rootFields, d.name.value); });\n var firstSet = firstTypes.concat(otherFirstTypes);\n var processedTypeNames = [];\n var mergedFirstTypes = [];\n var _loop_1 = function (type) {\n if (!lodash_1.includes(processedTypeNames, type.name.value)) {\n processedTypeNames.push(type.name.value);\n mergedFirstTypes.push(type);\n }\n else {\n var existingType = mergedFirstTypes.find(function (t) { return t.name.value === type.name.value; });\n existingType.fields = existingType.fields.concat(type.fields);\n }\n };\n for (var _i = 0, firstSet_1 = firstSet; _i < firstSet_1.length; _i++) {\n var type = firstSet_1[_i];\n _loop_1(type);\n }\n document = __assign({}, document, { definitions: definition_1.completeDefinitionPool(lodash_1.flatten(allDefinitions), firstSet, lodash_1.flatten(typeDefinitions)) });\n // Return the schema as string\n return graphql_1.print(document);\n}","title":""},{"docid":"a3ee4c7f911f0084af2dd5422524d39c","score":"0.5084623","text":"function extendSchema(schema, documentAST, options) {\n !Object(__WEBPACK_IMPORTED_MODULE_7__type_schema__[\"b\" /* isSchema */])(schema) ? Object(__WEBPACK_IMPORTED_MODULE_0__jsutils_invariant__[\"a\" /* default */])(0, 'Must provide valid GraphQLSchema') : void 0;\n !(documentAST && documentAST.kind === __WEBPACK_IMPORTED_MODULE_12__language_kinds__[\"a\" /* Kind */].DOCUMENT) ? Object(__WEBPACK_IMPORTED_MODULE_0__jsutils_invariant__[\"a\" /* default */])(0, 'Must provide valid Document AST') : void 0;\n\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\n Object(__WEBPACK_IMPORTED_MODULE_5__validation_validate__[\"b\" /* assertValidSDLExtension */])(documentAST, schema);\n } // Collect the type definitions and extensions found in the document.\n\n\n var typeDefinitionMap = Object.create(null);\n var typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\n // have the same name. For example, a type named \"skip\".\n\n var directiveDefinitions = [];\n var schemaDef; // Schema extensions are collected which may add additional operation types.\n\n var schemaExtensions = [];\n\n for (var i = 0; i < documentAST.definitions.length; i++) {\n var def = documentAST.definitions[i];\n\n if (def.kind === __WEBPACK_IMPORTED_MODULE_12__language_kinds__[\"a\" /* Kind */].SCHEMA_DEFINITION) {\n schemaDef = def;\n } else if (def.kind === __WEBPACK_IMPORTED_MODULE_12__language_kinds__[\"a\" /* Kind */].SCHEMA_EXTENSION) {\n schemaExtensions.push(def);\n } else if (Object(__WEBPACK_IMPORTED_MODULE_13__language_predicates__[\"b\" /* isTypeDefinitionNode */])(def)) {\n // Sanity check that none of the defined types conflict with the\n // schema's existing types.\n var typeName = def.name.value;\n\n if (schema.getType(typeName)) {\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\"a\" /* GraphQLError */](\"Type \\\"\".concat(typeName, \"\\\" already exists in the schema. It cannot also \") + 'be defined in this type definition.', [def]);\n }\n\n typeDefinitionMap[typeName] = def;\n } else if (Object(__WEBPACK_IMPORTED_MODULE_13__language_predicates__[\"c\" /* isTypeExtensionNode */])(def)) {\n // Sanity check that this type extension exists within the\n // schema's existing types.\n var extendedTypeName = def.name.value;\n var existingType = schema.getType(extendedTypeName);\n\n if (!existingType) {\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\"a\" /* GraphQLError */](\"Cannot extend type \\\"\".concat(extendedTypeName, \"\\\" because it does not \") + 'exist in the existing schema.', [def]);\n }\n\n checkExtensionNode(existingType, def);\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\n } else if (def.kind === __WEBPACK_IMPORTED_MODULE_12__language_kinds__[\"a\" /* Kind */].DIRECTIVE_DEFINITION) {\n var directiveName = def.name.value;\n var existingDirective = schema.getDirective(directiveName);\n\n if (existingDirective) {\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\"a\" /* GraphQLError */](\"Directive \\\"\".concat(directiveName, \"\\\" already exists in the schema. It \") + 'cannot be redefined.', [def]);\n }\n\n directiveDefinitions.push(def);\n }\n } // If this document contains no new types, extensions, or directives then\n // return the same unmodified GraphQLSchema instance.\n\n\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0 && schemaExtensions.length === 0 && !schemaDef) {\n return schema;\n }\n\n var astBuilder = new __WEBPACK_IMPORTED_MODULE_4__buildASTSchema__[\"a\" /* ASTDefinitionBuilder */](typeDefinitionMap, options, function (typeRef) {\n var typeName = typeRef.name.value;\n var existingType = schema.getType(typeName);\n\n if (existingType) {\n return extendNamedType(existingType);\n }\n\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\"a\" /* GraphQLError */](\"Unknown type: \\\"\".concat(typeName, \"\\\". Ensure that this type exists \") + 'either in the original schema, or is added in a type definition.', [typeRef]);\n });\n var extendTypeCache = Object.create(null); // Get the extended root operation types.\n\n var operationTypes = {\n query: extendMaybeNamedType(schema.getQueryType()),\n mutation: extendMaybeNamedType(schema.getMutationType()),\n subscription: extendMaybeNamedType(schema.getSubscriptionType())\n };\n\n if (schemaDef) {\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = schemaDef.operationTypes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var _ref2 = _step.value;\n var operation = _ref2.operation,\n type = _ref2.type;\n\n if (operationTypes[operation]) {\n throw new Error(\"Must provide only one \".concat(operation, \" type in schema.\"));\n } // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n\n\n operationTypes[operation] = astBuilder.buildType(type);\n }\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return != null) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n } // Then, incorporate schema definition and all schema extensions.\n\n\n for (var _i = 0; _i < schemaExtensions.length; _i++) {\n var schemaExtension = schemaExtensions[_i];\n\n if (schemaExtension.operationTypes) {\n var _iteratorNormalCompletion12 = true;\n var _didIteratorError12 = false;\n var _iteratorError12 = undefined;\n\n try {\n for (var _iterator12 = schemaExtension.operationTypes[Symbol.iterator](), _step12; !(_iteratorNormalCompletion12 = (_step12 = _iterator12.next()).done); _iteratorNormalCompletion12 = true) {\n var _ref4 = _step12.value;\n var operation = _ref4.operation,\n type = _ref4.type;\n\n if (operationTypes[operation]) {\n throw new Error(\"Must provide only one \".concat(operation, \" type in schema.\"));\n } // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n\n\n operationTypes[operation] = astBuilder.buildType(type);\n }\n } catch (err) {\n _didIteratorError12 = true;\n _iteratorError12 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion12 && _iterator12.return != null) {\n _iterator12.return();\n }\n } finally {\n if (_didIteratorError12) {\n throw _iteratorError12;\n }\n }\n }\n }\n }\n\n var schemaExtensionASTNodes = schemaExtensions ? schema.extensionASTNodes ? schema.extensionASTNodes.concat(schemaExtensions) : schemaExtensions : schema.extensionASTNodes;\n var types = Object(__WEBPACK_IMPORTED_MODULE_3__jsutils_objectValues__[\"a\" /* default */])(schema.getTypeMap()).map(function (type) {\n return extendNamedType(type);\n }).concat(Object(__WEBPACK_IMPORTED_MODULE_3__jsutils_objectValues__[\"a\" /* default */])(typeDefinitionMap).map(function (type) {\n return astBuilder.buildType(type);\n })); // Support both original legacy names and extended legacy names.\n\n var allowedLegacyNames = schema.__allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\n\n\n return new __WEBPACK_IMPORTED_MODULE_7__type_schema__[\"a\" /* GraphQLSchema */](_objectSpread({}, operationTypes, {\n types: types,\n directives: getMergedDirectives(),\n astNode: schema.astNode,\n extensionASTNodes: schemaExtensionASTNodes,\n allowedLegacyNames: allowedLegacyNames\n })); // Below are functions used for producing this schema that have closed over\n // this scope and have access to the schema, cache, and newly defined types.\n\n function getMergedDirectives() {\n var existingDirectives = schema.getDirectives().map(extendDirective);\n !existingDirectives ? Object(__WEBPACK_IMPORTED_MODULE_0__jsutils_invariant__[\"a\" /* default */])(0, 'schema must have default directives') : void 0;\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\n return astBuilder.buildDirective(node);\n }));\n }\n\n function extendMaybeNamedType(type) {\n return type ? extendNamedType(type) : null;\n }\n\n function extendNamedType(type) {\n if (Object(__WEBPACK_IMPORTED_MODULE_8__type_introspection__[\"g\" /* isIntrospectionType */])(type) || Object(__WEBPACK_IMPORTED_MODULE_9__type_scalars__[\"d\" /* isSpecifiedScalarType */])(type)) {\n // Builtin types are not extended.\n return type;\n }\n\n var name = type.name;\n\n if (!extendTypeCache[name]) {\n if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"B\" /* isScalarType */])(type)) {\n extendTypeCache[name] = extendScalarType(type);\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"x\" /* isObjectType */])(type)) {\n extendTypeCache[name] = extendObjectType(type);\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"s\" /* isInterfaceType */])(type)) {\n extendTypeCache[name] = extendInterfaceType(type);\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"D\" /* isUnionType */])(type)) {\n extendTypeCache[name] = extendUnionType(type);\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"p\" /* isEnumType */])(type)) {\n extendTypeCache[name] = extendEnumType(type);\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"q\" /* isInputObjectType */])(type)) {\n extendTypeCache[name] = extendInputObjectType(type);\n }\n }\n\n return extendTypeCache[name];\n }\n\n function extendDirective(directive) {\n return new __WEBPACK_IMPORTED_MODULE_11__type_directives__[\"c\" /* GraphQLDirective */]({\n name: directive.name,\n description: directive.description,\n locations: directive.locations,\n args: extendArgs(directive.args),\n astNode: directive.astNode\n });\n }\n\n function extendInputObjectType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\"b\" /* GraphQLInputObjectType */]({\n name: name,\n description: type.description,\n fields: function fields() {\n return extendInputFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendInputFieldMap(type) {\n var newFieldMap = Object.create(null);\n var oldFieldMap = type.getFields();\n\n var _arr = Object.keys(oldFieldMap);\n\n for (var _i2 = 0; _i2 < _arr.length; _i2++) {\n var _fieldName = _arr[_i2];\n var _field = oldFieldMap[_fieldName];\n newFieldMap[_fieldName] = {\n description: _field.description,\n type: extendType(_field.type),\n defaultValue: _field.defaultValue,\n astNode: _field.astNode\n };\n } // If there are any extensions to the fields, apply those here.\n\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion2 = true;\n var _didIteratorError2 = false;\n var _iteratorError2 = undefined;\n\n try {\n for (var _iterator2 = extensions[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n var extension = _step2.value;\n var _iteratorNormalCompletion3 = true;\n var _didIteratorError3 = false;\n var _iteratorError3 = undefined;\n\n try {\n for (var _iterator3 = extension.fields[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\n var field = _step3.value;\n var fieldName = field.name.value;\n\n if (oldFieldMap[fieldName]) {\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\"a\" /* GraphQLError */](\"Field \\\"\".concat(type.name, \".\").concat(fieldName, \"\\\" already exists in the \") + 'schema. It cannot also be defined in this type extension.', [field]);\n }\n\n newFieldMap[fieldName] = astBuilder.buildInputField(field);\n }\n } catch (err) {\n _didIteratorError3 = true;\n _iteratorError3 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\n _iterator3.return();\n }\n } finally {\n if (_didIteratorError3) {\n throw _iteratorError3;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError2 = true;\n _iteratorError2 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\n _iterator2.return();\n }\n } finally {\n if (_didIteratorError2) {\n throw _iteratorError2;\n }\n }\n }\n }\n\n return newFieldMap;\n }\n\n function extendEnumType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\"a\" /* GraphQLEnumType */]({\n name: name,\n description: type.description,\n values: extendValueMap(type),\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendValueMap(type) {\n var newValueMap = Object.create(null);\n var oldValueMap = Object(__WEBPACK_IMPORTED_MODULE_1__jsutils_keyMap__[\"a\" /* default */])(type.getValues(), function (value) {\n return value.name;\n });\n\n var _arr2 = Object.keys(oldValueMap);\n\n for (var _i3 = 0; _i3 < _arr2.length; _i3++) {\n var _valueName = _arr2[_i3];\n var _value = oldValueMap[_valueName];\n newValueMap[_valueName] = {\n name: _value.name,\n description: _value.description,\n value: _value.value,\n deprecationReason: _value.deprecationReason,\n astNode: _value.astNode\n };\n } // If there are any extensions to the values, apply those here.\n\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion4 = true;\n var _didIteratorError4 = false;\n var _iteratorError4 = undefined;\n\n try {\n for (var _iterator4 = extensions[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\n var extension = _step4.value;\n var _iteratorNormalCompletion5 = true;\n var _didIteratorError5 = false;\n var _iteratorError5 = undefined;\n\n try {\n for (var _iterator5 = extension.values[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\n var value = _step5.value;\n var valueName = value.name.value;\n\n if (oldValueMap[valueName]) {\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\"a\" /* GraphQLError */](\"Enum value \\\"\".concat(type.name, \".\").concat(valueName, \"\\\" already exists in the \") + 'schema. It cannot also be defined in this type extension.', [value]);\n }\n\n newValueMap[valueName] = astBuilder.buildEnumValue(value);\n }\n } catch (err) {\n _didIteratorError5 = true;\n _iteratorError5 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\n _iterator5.return();\n }\n } finally {\n if (_didIteratorError5) {\n throw _iteratorError5;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError4 = true;\n _iteratorError4 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\n _iterator4.return();\n }\n } finally {\n if (_didIteratorError4) {\n throw _iteratorError4;\n }\n }\n }\n }\n\n return newValueMap;\n }\n\n function extendScalarType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\"g\" /* GraphQLScalarType */]({\n name: name,\n description: type.description,\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n serialize: type.serialize,\n parseValue: type.parseValue,\n parseLiteral: type.parseLiteral\n });\n }\n\n function extendObjectType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\"f\" /* GraphQLObjectType */]({\n name: name,\n description: type.description,\n interfaces: function interfaces() {\n return extendImplementedInterfaces(type);\n },\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n isTypeOf: type.isTypeOf\n });\n }\n\n function extendArgs(args) {\n return Object(__WEBPACK_IMPORTED_MODULE_2__jsutils_keyValMap__[\"a\" /* default */])(args, function (arg) {\n return arg.name;\n }, function (arg) {\n return {\n type: extendType(arg.type),\n defaultValue: arg.defaultValue,\n description: arg.description,\n astNode: arg.astNode\n };\n });\n }\n\n function extendInterfaceType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\"c\" /* GraphQLInterfaceType */]({\n name: type.name,\n description: type.description,\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n resolveType: type.resolveType\n });\n }\n\n function extendUnionType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\"h\" /* GraphQLUnionType */]({\n name: name,\n description: type.description,\n types: function types() {\n return extendPossibleTypes(type);\n },\n astNode: type.astNode,\n resolveType: type.resolveType,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendPossibleTypes(type) {\n var possibleTypes = type.getTypes().map(extendNamedType); // If there are any extensions to the union, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion6 = true;\n var _didIteratorError6 = false;\n var _iteratorError6 = undefined;\n\n try {\n for (var _iterator6 = extensions[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\n var extension = _step6.value;\n var _iteratorNormalCompletion7 = true;\n var _didIteratorError7 = false;\n var _iteratorError7 = undefined;\n\n try {\n for (var _iterator7 = extension.types[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {\n var namedType = _step7.value;\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n possibleTypes.push(astBuilder.buildType(namedType));\n }\n } catch (err) {\n _didIteratorError7 = true;\n _iteratorError7 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion7 && _iterator7.return != null) {\n _iterator7.return();\n }\n } finally {\n if (_didIteratorError7) {\n throw _iteratorError7;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError6 = true;\n _iteratorError6 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\n _iterator6.return();\n }\n } finally {\n if (_didIteratorError6) {\n throw _iteratorError6;\n }\n }\n }\n }\n\n return possibleTypes;\n }\n\n function extendImplementedInterfaces(type) {\n var interfaces = type.getInterfaces().map(extendNamedType); // If there are any extensions to the interfaces, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion8 = true;\n var _didIteratorError8 = false;\n var _iteratorError8 = undefined;\n\n try {\n for (var _iterator8 = extensions[Symbol.iterator](), _step8; !(_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done); _iteratorNormalCompletion8 = true) {\n var extension = _step8.value;\n var _iteratorNormalCompletion9 = true;\n var _didIteratorError9 = false;\n var _iteratorError9 = undefined;\n\n try {\n for (var _iterator9 = extension.interfaces[Symbol.iterator](), _step9; !(_iteratorNormalCompletion9 = (_step9 = _iterator9.next()).done); _iteratorNormalCompletion9 = true) {\n var namedType = _step9.value;\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n interfaces.push(astBuilder.buildType(namedType));\n }\n } catch (err) {\n _didIteratorError9 = true;\n _iteratorError9 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion9 && _iterator9.return != null) {\n _iterator9.return();\n }\n } finally {\n if (_didIteratorError9) {\n throw _iteratorError9;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError8 = true;\n _iteratorError8 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion8 && _iterator8.return != null) {\n _iterator8.return();\n }\n } finally {\n if (_didIteratorError8) {\n throw _iteratorError8;\n }\n }\n }\n }\n\n return interfaces;\n }\n\n function extendFieldMap(type) {\n var newFieldMap = Object.create(null);\n var oldFieldMap = type.getFields();\n\n var _arr3 = Object.keys(oldFieldMap);\n\n for (var _i4 = 0; _i4 < _arr3.length; _i4++) {\n var _fieldName2 = _arr3[_i4];\n var _field2 = oldFieldMap[_fieldName2];\n newFieldMap[_fieldName2] = {\n description: _field2.description,\n deprecationReason: _field2.deprecationReason,\n type: extendType(_field2.type),\n args: extendArgs(_field2.args),\n astNode: _field2.astNode,\n resolve: _field2.resolve\n };\n } // If there are any extensions to the fields, apply those here.\n\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion10 = true;\n var _didIteratorError10 = false;\n var _iteratorError10 = undefined;\n\n try {\n for (var _iterator10 = extensions[Symbol.iterator](), _step10; !(_iteratorNormalCompletion10 = (_step10 = _iterator10.next()).done); _iteratorNormalCompletion10 = true) {\n var extension = _step10.value;\n var _iteratorNormalCompletion11 = true;\n var _didIteratorError11 = false;\n var _iteratorError11 = undefined;\n\n try {\n for (var _iterator11 = extension.fields[Symbol.iterator](), _step11; !(_iteratorNormalCompletion11 = (_step11 = _iterator11.next()).done); _iteratorNormalCompletion11 = true) {\n var field = _step11.value;\n var fieldName = field.name.value;\n\n if (oldFieldMap[fieldName]) {\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\"a\" /* GraphQLError */](\"Field \\\"\".concat(type.name, \".\").concat(fieldName, \"\\\" already exists in the \") + 'schema. It cannot also be defined in this type extension.', [field]);\n }\n\n newFieldMap[fieldName] = astBuilder.buildField(field);\n }\n } catch (err) {\n _didIteratorError11 = true;\n _iteratorError11 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion11 && _iterator11.return != null) {\n _iterator11.return();\n }\n } finally {\n if (_didIteratorError11) {\n throw _iteratorError11;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError10 = true;\n _iteratorError10 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion10 && _iterator10.return != null) {\n _iterator10.return();\n }\n } finally {\n if (_didIteratorError10) {\n throw _iteratorError10;\n }\n }\n }\n }\n\n return newFieldMap;\n }\n\n function extendType(typeDef) {\n if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"u\" /* isListType */])(typeDef)) {\n return Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"d\" /* GraphQLList */])(extendType(typeDef.ofType));\n }\n\n if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"w\" /* isNonNullType */])(typeDef)) {\n return Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\"e\" /* GraphQLNonNull */])(extendType(typeDef.ofType));\n }\n\n return extendNamedType(typeDef);\n }\n}","title":""},{"docid":"4021e78a656826ee529398aed28869aa","score":"0.50598526","text":"updateSchema () {}","title":""},{"docid":"50277082d639d9817296e67eb2001223","score":"0.50280523","text":"function _mergeConfig(config1, config2){ //must be called with App.DataTable context.\n\t\treturn this.$.extend(config1, config2);\n\t}","title":""},{"docid":"e64fb62967dcbfb1ceac1aa56acfc35e","score":"0.5015154","text":"function merge(a, b) {\n if (a && b) {\n for (var key in b) {\n a[key] = b[key];\n }\n }\n return a;\n}","title":""},{"docid":"9489c275aeb95e7ec22b71d827adc929","score":"0.50115395","text":"loadSharedSchemas () {\n this.loadSchemasFromDirectory(BASE_DIR)\n }","title":""},{"docid":"0fa6d5e7ada3f04c07ea337532bf4630","score":"0.500577","text":"function updateFromV1ToV2(schema) {\r\n let updated = {\r\n schemaVersion: 2,\r\n themes: {}\r\n };\r\n\r\n for (let themeName in schema.themes) {\r\n let theme = schema.themes[themeName];\r\n\r\n updated.themes[themeName] = Object.assign({}, theme, {\r\n name: themeName\r\n });\r\n }\r\n\r\n return updated;\r\n}","title":""},{"docid":"935949007f5b1309be7502c935482c70","score":"0.49434566","text":"merge(a, b) {\n for (var key in b) {\n if (!a.hasOwnProperty(key)) {\n a[key] = b[key]\n } else if (this.isObject(b[key],1) && this.isObject(a[key],1)) {\n this.merge(a[key], b[key])\n }\n }\n return a;\n }","title":""},{"docid":"e1f2e11365f68acbd987eff5209d815c","score":"0.4934107","text":"function merge(a, b) {\n if ( a ) {\n for ( var property in b ) {\n if ( !hasOwnProperty.call(a, property) ) {\n a[property] = b[property];\n }\n }\n } else {\n a = b;\n }\n\n return a;\n }","title":""},{"docid":"2e11fcb98306aaada8982d2d099c567b","score":"0.49147728","text":"function extendSchema(schema, documentAST, options) {\n !(0, _schema.isSchema)(schema) ? (0, _invariant.default)(0, 'Must provide valid GraphQLSchema') : void 0;\n !(documentAST && documentAST.kind === _kinds.Kind.DOCUMENT) ? (0, _invariant.default)(0, 'Must provide valid Document AST') : void 0;\n\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\n (0, _validate.assertValidSDLExtension)(documentAST, schema);\n } // Collect the type definitions and extensions found in the document.\n\n\n var typeDefinitionMap = Object.create(null);\n var typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\n // have the same name. For example, a type named \"skip\".\n\n var directiveDefinitions = [];\n var schemaDef; // Schema extensions are collected which may add additional operation types.\n\n var schemaExtensions = [];\n\n for (var i = 0; i < documentAST.definitions.length; i++) {\n var def = documentAST.definitions[i];\n\n if (def.kind === _kinds.Kind.SCHEMA_DEFINITION) {\n schemaDef = def;\n } else if (def.kind === _kinds.Kind.SCHEMA_EXTENSION) {\n schemaExtensions.push(def);\n } else if ((0, _predicates.isTypeDefinitionNode)(def)) {\n // Sanity check that none of the defined types conflict with the\n // schema's existing types.\n var typeName = def.name.value;\n\n if (schema.getType(typeName)) {\n throw new _GraphQLError.GraphQLError(\"Type \\\"\".concat(typeName, \"\\\" already exists in the schema. It cannot also \") + 'be defined in this type definition.', [def]);\n }\n\n typeDefinitionMap[typeName] = def;\n } else if ((0, _predicates.isTypeExtensionNode)(def)) {\n // Sanity check that this type extension exists within the\n // schema's existing types.\n var extendedTypeName = def.name.value;\n var existingType = schema.getType(extendedTypeName);\n\n if (!existingType) {\n throw new _GraphQLError.GraphQLError(\"Cannot extend type \\\"\".concat(extendedTypeName, \"\\\" because it does not \") + 'exist in the existing schema.', [def]);\n }\n\n checkExtensionNode(existingType, def);\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\n } else if (def.kind === _kinds.Kind.DIRECTIVE_DEFINITION) {\n var directiveName = def.name.value;\n var existingDirective = schema.getDirective(directiveName);\n\n if (existingDirective) {\n throw new _GraphQLError.GraphQLError(\"Directive \\\"\".concat(directiveName, \"\\\" already exists in the schema. It \") + 'cannot be redefined.', [def]);\n }\n\n directiveDefinitions.push(def);\n }\n } // If this document contains no new types, extensions, or directives then\n // return the same unmodified GraphQLSchema instance.\n\n\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0 && schemaExtensions.length === 0 && !schemaDef) {\n return schema;\n }\n\n var astBuilder = new _buildASTSchema.ASTDefinitionBuilder(typeDefinitionMap, options, function (typeRef) {\n var typeName = typeRef.name.value;\n var existingType = schema.getType(typeName);\n\n if (existingType) {\n return extendNamedType(existingType);\n }\n\n throw new _GraphQLError.GraphQLError(\"Unknown type: \\\"\".concat(typeName, \"\\\". Ensure that this type exists \") + 'either in the original schema, or is added in a type definition.', [typeRef]);\n });\n var extendTypeCache = Object.create(null); // Get the extended root operation types.\n\n var operationTypes = {\n query: extendMaybeNamedType(schema.getQueryType()),\n mutation: extendMaybeNamedType(schema.getMutationType()),\n subscription: extendMaybeNamedType(schema.getSubscriptionType())\n };\n\n if (schemaDef) {\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = schemaDef.operationTypes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var _ref2 = _step.value;\n var operation = _ref2.operation,\n type = _ref2.type;\n\n if (operationTypes[operation]) {\n throw new Error(\"Must provide only one \".concat(operation, \" type in schema.\"));\n } // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n\n\n operationTypes[operation] = astBuilder.buildType(type);\n }\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return != null) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n } // Then, incorporate schema definition and all schema extensions.\n\n\n for (var _i = 0; _i < schemaExtensions.length; _i++) {\n var schemaExtension = schemaExtensions[_i];\n\n if (schemaExtension.operationTypes) {\n var _iteratorNormalCompletion12 = true;\n var _didIteratorError12 = false;\n var _iteratorError12 = undefined;\n\n try {\n for (var _iterator12 = schemaExtension.operationTypes[Symbol.iterator](), _step12; !(_iteratorNormalCompletion12 = (_step12 = _iterator12.next()).done); _iteratorNormalCompletion12 = true) {\n var _ref4 = _step12.value;\n var operation = _ref4.operation,\n type = _ref4.type;\n\n if (operationTypes[operation]) {\n throw new Error(\"Must provide only one \".concat(operation, \" type in schema.\"));\n } // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n\n\n operationTypes[operation] = astBuilder.buildType(type);\n }\n } catch (err) {\n _didIteratorError12 = true;\n _iteratorError12 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion12 && _iterator12.return != null) {\n _iterator12.return();\n }\n } finally {\n if (_didIteratorError12) {\n throw _iteratorError12;\n }\n }\n }\n }\n }\n\n var schemaExtensionASTNodes = schemaExtensions ? schema.extensionASTNodes ? schema.extensionASTNodes.concat(schemaExtensions) : schemaExtensions : schema.extensionASTNodes;\n var types = (0, _objectValues.default)(schema.getTypeMap()).map(function (type) {\n return extendNamedType(type);\n }).concat((0, _objectValues.default)(typeDefinitionMap).map(function (type) {\n return astBuilder.buildType(type);\n })); // Support both original legacy names and extended legacy names.\n\n var allowedLegacyNames = schema.__allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\n\n\n return new _schema.GraphQLSchema(_objectSpread({}, operationTypes, {\n types: types,\n directives: getMergedDirectives(),\n astNode: schema.astNode,\n extensionASTNodes: schemaExtensionASTNodes,\n allowedLegacyNames: allowedLegacyNames\n })); // Below are functions used for producing this schema that have closed over\n // this scope and have access to the schema, cache, and newly defined types.\n\n function getMergedDirectives() {\n var existingDirectives = schema.getDirectives().map(extendDirective);\n !existingDirectives ? (0, _invariant.default)(0, 'schema must have default directives') : void 0;\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\n return astBuilder.buildDirective(node);\n }));\n }\n\n function extendMaybeNamedType(type) {\n return type ? extendNamedType(type) : null;\n }\n\n function extendNamedType(type) {\n if ((0, _introspection.isIntrospectionType)(type) || (0, _scalars.isSpecifiedScalarType)(type)) {\n // Builtin types are not extended.\n return type;\n }\n\n var name = type.name;\n\n if (!extendTypeCache[name]) {\n if ((0, _definition.isScalarType)(type)) {\n extendTypeCache[name] = extendScalarType(type);\n } else if ((0, _definition.isObjectType)(type)) {\n extendTypeCache[name] = extendObjectType(type);\n } else if ((0, _definition.isInterfaceType)(type)) {\n extendTypeCache[name] = extendInterfaceType(type);\n } else if ((0, _definition.isUnionType)(type)) {\n extendTypeCache[name] = extendUnionType(type);\n } else if ((0, _definition.isEnumType)(type)) {\n extendTypeCache[name] = extendEnumType(type);\n } else if ((0, _definition.isInputObjectType)(type)) {\n extendTypeCache[name] = extendInputObjectType(type);\n }\n }\n\n return extendTypeCache[name];\n }\n\n function extendDirective(directive) {\n return new _directives.GraphQLDirective({\n name: directive.name,\n description: directive.description,\n locations: directive.locations,\n args: extendArgs(directive.args),\n astNode: directive.astNode\n });\n }\n\n function extendInputObjectType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLInputObjectType({\n name: name,\n description: type.description,\n fields: function fields() {\n return extendInputFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendInputFieldMap(type) {\n var newFieldMap = Object.create(null);\n var oldFieldMap = type.getFields();\n\n var _arr = Object.keys(oldFieldMap);\n\n for (var _i2 = 0; _i2 < _arr.length; _i2++) {\n var _fieldName = _arr[_i2];\n var _field = oldFieldMap[_fieldName];\n newFieldMap[_fieldName] = {\n description: _field.description,\n type: extendType(_field.type),\n defaultValue: _field.defaultValue,\n astNode: _field.astNode\n };\n } // If there are any extensions to the fields, apply those here.\n\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion2 = true;\n var _didIteratorError2 = false;\n var _iteratorError2 = undefined;\n\n try {\n for (var _iterator2 = extensions[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n var extension = _step2.value;\n var _iteratorNormalCompletion3 = true;\n var _didIteratorError3 = false;\n var _iteratorError3 = undefined;\n\n try {\n for (var _iterator3 = extension.fields[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\n var field = _step3.value;\n var fieldName = field.name.value;\n\n if (oldFieldMap[fieldName]) {\n throw new _GraphQLError.GraphQLError(\"Field \\\"\".concat(type.name, \".\").concat(fieldName, \"\\\" already exists in the \") + 'schema. It cannot also be defined in this type extension.', [field]);\n }\n\n newFieldMap[fieldName] = astBuilder.buildInputField(field);\n }\n } catch (err) {\n _didIteratorError3 = true;\n _iteratorError3 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\n _iterator3.return();\n }\n } finally {\n if (_didIteratorError3) {\n throw _iteratorError3;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError2 = true;\n _iteratorError2 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\n _iterator2.return();\n }\n } finally {\n if (_didIteratorError2) {\n throw _iteratorError2;\n }\n }\n }\n }\n\n return newFieldMap;\n }\n\n function extendEnumType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLEnumType({\n name: name,\n description: type.description,\n values: extendValueMap(type),\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendValueMap(type) {\n var newValueMap = Object.create(null);\n var oldValueMap = (0, _keyMap.default)(type.getValues(), function (value) {\n return value.name;\n });\n\n var _arr2 = Object.keys(oldValueMap);\n\n for (var _i3 = 0; _i3 < _arr2.length; _i3++) {\n var _valueName = _arr2[_i3];\n var _value = oldValueMap[_valueName];\n newValueMap[_valueName] = {\n name: _value.name,\n description: _value.description,\n value: _value.value,\n deprecationReason: _value.deprecationReason,\n astNode: _value.astNode\n };\n } // If there are any extensions to the values, apply those here.\n\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion4 = true;\n var _didIteratorError4 = false;\n var _iteratorError4 = undefined;\n\n try {\n for (var _iterator4 = extensions[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\n var extension = _step4.value;\n var _iteratorNormalCompletion5 = true;\n var _didIteratorError5 = false;\n var _iteratorError5 = undefined;\n\n try {\n for (var _iterator5 = extension.values[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\n var value = _step5.value;\n var valueName = value.name.value;\n\n if (oldValueMap[valueName]) {\n throw new _GraphQLError.GraphQLError(\"Enum value \\\"\".concat(type.name, \".\").concat(valueName, \"\\\" already exists in the \") + 'schema. It cannot also be defined in this type extension.', [value]);\n }\n\n newValueMap[valueName] = astBuilder.buildEnumValue(value);\n }\n } catch (err) {\n _didIteratorError5 = true;\n _iteratorError5 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\n _iterator5.return();\n }\n } finally {\n if (_didIteratorError5) {\n throw _iteratorError5;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError4 = true;\n _iteratorError4 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\n _iterator4.return();\n }\n } finally {\n if (_didIteratorError4) {\n throw _iteratorError4;\n }\n }\n }\n }\n\n return newValueMap;\n }\n\n function extendScalarType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLScalarType({\n name: name,\n description: type.description,\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n serialize: type.serialize,\n parseValue: type.parseValue,\n parseLiteral: type.parseLiteral\n });\n }\n\n function extendObjectType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLObjectType({\n name: name,\n description: type.description,\n interfaces: function interfaces() {\n return extendImplementedInterfaces(type);\n },\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n isTypeOf: type.isTypeOf\n });\n }\n\n function extendArgs(args) {\n return (0, _keyValMap.default)(args, function (arg) {\n return arg.name;\n }, function (arg) {\n return {\n type: extendType(arg.type),\n defaultValue: arg.defaultValue,\n description: arg.description,\n astNode: arg.astNode\n };\n });\n }\n\n function extendInterfaceType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLInterfaceType({\n name: type.name,\n description: type.description,\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n resolveType: type.resolveType\n });\n }\n\n function extendUnionType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLUnionType({\n name: name,\n description: type.description,\n types: function types() {\n return extendPossibleTypes(type);\n },\n astNode: type.astNode,\n resolveType: type.resolveType,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendPossibleTypes(type) {\n var possibleTypes = type.getTypes().map(extendNamedType); // If there are any extensions to the union, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion6 = true;\n var _didIteratorError6 = false;\n var _iteratorError6 = undefined;\n\n try {\n for (var _iterator6 = extensions[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\n var extension = _step6.value;\n var _iteratorNormalCompletion7 = true;\n var _didIteratorError7 = false;\n var _iteratorError7 = undefined;\n\n try {\n for (var _iterator7 = extension.types[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {\n var namedType = _step7.value;\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n possibleTypes.push(astBuilder.buildType(namedType));\n }\n } catch (err) {\n _didIteratorError7 = true;\n _iteratorError7 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion7 && _iterator7.return != null) {\n _iterator7.return();\n }\n } finally {\n if (_didIteratorError7) {\n throw _iteratorError7;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError6 = true;\n _iteratorError6 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\n _iterator6.return();\n }\n } finally {\n if (_didIteratorError6) {\n throw _iteratorError6;\n }\n }\n }\n }\n\n return possibleTypes;\n }\n\n function extendImplementedInterfaces(type) {\n var interfaces = type.getInterfaces().map(extendNamedType); // If there are any extensions to the interfaces, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion8 = true;\n var _didIteratorError8 = false;\n var _iteratorError8 = undefined;\n\n try {\n for (var _iterator8 = extensions[Symbol.iterator](), _step8; !(_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done); _iteratorNormalCompletion8 = true) {\n var extension = _step8.value;\n var _iteratorNormalCompletion9 = true;\n var _didIteratorError9 = false;\n var _iteratorError9 = undefined;\n\n try {\n for (var _iterator9 = extension.interfaces[Symbol.iterator](), _step9; !(_iteratorNormalCompletion9 = (_step9 = _iterator9.next()).done); _iteratorNormalCompletion9 = true) {\n var namedType = _step9.value;\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n interfaces.push(astBuilder.buildType(namedType));\n }\n } catch (err) {\n _didIteratorError9 = true;\n _iteratorError9 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion9 && _iterator9.return != null) {\n _iterator9.return();\n }\n } finally {\n if (_didIteratorError9) {\n throw _iteratorError9;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError8 = true;\n _iteratorError8 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion8 && _iterator8.return != null) {\n _iterator8.return();\n }\n } finally {\n if (_didIteratorError8) {\n throw _iteratorError8;\n }\n }\n }\n }\n\n return interfaces;\n }\n\n function extendFieldMap(type) {\n var newFieldMap = Object.create(null);\n var oldFieldMap = type.getFields();\n\n var _arr3 = Object.keys(oldFieldMap);\n\n for (var _i4 = 0; _i4 < _arr3.length; _i4++) {\n var _fieldName2 = _arr3[_i4];\n var _field2 = oldFieldMap[_fieldName2];\n newFieldMap[_fieldName2] = {\n description: _field2.description,\n deprecationReason: _field2.deprecationReason,\n type: extendType(_field2.type),\n args: extendArgs(_field2.args),\n astNode: _field2.astNode,\n resolve: _field2.resolve\n };\n } // If there are any extensions to the fields, apply those here.\n\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion10 = true;\n var _didIteratorError10 = false;\n var _iteratorError10 = undefined;\n\n try {\n for (var _iterator10 = extensions[Symbol.iterator](), _step10; !(_iteratorNormalCompletion10 = (_step10 = _iterator10.next()).done); _iteratorNormalCompletion10 = true) {\n var extension = _step10.value;\n var _iteratorNormalCompletion11 = true;\n var _didIteratorError11 = false;\n var _iteratorError11 = undefined;\n\n try {\n for (var _iterator11 = extension.fields[Symbol.iterator](), _step11; !(_iteratorNormalCompletion11 = (_step11 = _iterator11.next()).done); _iteratorNormalCompletion11 = true) {\n var field = _step11.value;\n var fieldName = field.name.value;\n\n if (oldFieldMap[fieldName]) {\n throw new _GraphQLError.GraphQLError(\"Field \\\"\".concat(type.name, \".\").concat(fieldName, \"\\\" already exists in the \") + 'schema. It cannot also be defined in this type extension.', [field]);\n }\n\n newFieldMap[fieldName] = astBuilder.buildField(field);\n }\n } catch (err) {\n _didIteratorError11 = true;\n _iteratorError11 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion11 && _iterator11.return != null) {\n _iterator11.return();\n }\n } finally {\n if (_didIteratorError11) {\n throw _iteratorError11;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError10 = true;\n _iteratorError10 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion10 && _iterator10.return != null) {\n _iterator10.return();\n }\n } finally {\n if (_didIteratorError10) {\n throw _iteratorError10;\n }\n }\n }\n }\n\n return newFieldMap;\n }\n\n function extendType(typeDef) {\n if ((0, _definition.isListType)(typeDef)) {\n return (0, _definition.GraphQLList)(extendType(typeDef.ofType));\n }\n\n if ((0, _definition.isNonNullType)(typeDef)) {\n return (0, _definition.GraphQLNonNull)(extendType(typeDef.ofType));\n }\n\n return extendNamedType(typeDef);\n }\n}","title":""},{"docid":"43ca22257c545785f89730da047ada5f","score":"0.49147728","text":"function extendSchema(schema, documentAST, options) {\n !(0, _schema.isSchema)(schema) ? (0, _invariant.default)(0, 'Must provide valid GraphQLSchema') : void 0;\n !(documentAST && documentAST.kind === _kinds.Kind.DOCUMENT) ? (0, _invariant.default)(0, 'Must provide valid Document AST') : void 0;\n\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\n (0, _validate.assertValidSDLExtension)(documentAST, schema);\n } // Collect the type definitions and extensions found in the document.\n\n\n var typeDefinitionMap = Object.create(null);\n var typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\n // have the same name. For example, a type named \"skip\".\n\n var directiveDefinitions = [];\n var schemaDef; // Schema extensions are collected which may add additional operation types.\n\n var schemaExtensions = [];\n\n for (var i = 0; i < documentAST.definitions.length; i++) {\n var def = documentAST.definitions[i];\n\n if (def.kind === _kinds.Kind.SCHEMA_DEFINITION) {\n schemaDef = def;\n } else if (def.kind === _kinds.Kind.SCHEMA_EXTENSION) {\n schemaExtensions.push(def);\n } else if ((0, _predicates.isTypeDefinitionNode)(def)) {\n // Sanity check that none of the defined types conflict with the\n // schema's existing types.\n var typeName = def.name.value;\n\n if (schema.getType(typeName)) {\n throw new _GraphQLError.GraphQLError(\"Type \\\"\".concat(typeName, \"\\\" already exists in the schema. It cannot also \") + 'be defined in this type definition.', [def]);\n }\n\n typeDefinitionMap[typeName] = def;\n } else if ((0, _predicates.isTypeExtensionNode)(def)) {\n // Sanity check that this type extension exists within the\n // schema's existing types.\n var extendedTypeName = def.name.value;\n var existingType = schema.getType(extendedTypeName);\n\n if (!existingType) {\n throw new _GraphQLError.GraphQLError(\"Cannot extend type \\\"\".concat(extendedTypeName, \"\\\" because it does not \") + 'exist in the existing schema.', [def]);\n }\n\n checkExtensionNode(existingType, def);\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\n } else if (def.kind === _kinds.Kind.DIRECTIVE_DEFINITION) {\n var directiveName = def.name.value;\n var existingDirective = schema.getDirective(directiveName);\n\n if (existingDirective) {\n throw new _GraphQLError.GraphQLError(\"Directive \\\"\".concat(directiveName, \"\\\" already exists in the schema. It \") + 'cannot be redefined.', [def]);\n }\n\n directiveDefinitions.push(def);\n }\n } // If this document contains no new types, extensions, or directives then\n // return the same unmodified GraphQLSchema instance.\n\n\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0 && schemaExtensions.length === 0 && !schemaDef) {\n return schema;\n }\n\n var astBuilder = new _buildASTSchema.ASTDefinitionBuilder(typeDefinitionMap, options, function (typeRef) {\n var typeName = typeRef.name.value;\n var existingType = schema.getType(typeName);\n\n if (existingType) {\n return extendNamedType(existingType);\n }\n\n throw new _GraphQLError.GraphQLError(\"Unknown type: \\\"\".concat(typeName, \"\\\". Ensure that this type exists \") + 'either in the original schema, or is added in a type definition.', [typeRef]);\n });\n var extendTypeCache = Object.create(null); // Get the extended root operation types.\n\n var operationTypes = {\n query: extendMaybeNamedType(schema.getQueryType()),\n mutation: extendMaybeNamedType(schema.getMutationType()),\n subscription: extendMaybeNamedType(schema.getSubscriptionType())\n };\n\n if (schemaDef) {\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = schemaDef.operationTypes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var _ref2 = _step.value;\n var operation = _ref2.operation,\n type = _ref2.type;\n\n if (operationTypes[operation]) {\n throw new Error(\"Must provide only one \".concat(operation, \" type in schema.\"));\n } // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n\n\n operationTypes[operation] = astBuilder.buildType(type);\n }\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return != null) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n } // Then, incorporate schema definition and all schema extensions.\n\n\n for (var _i = 0; _i < schemaExtensions.length; _i++) {\n var schemaExtension = schemaExtensions[_i];\n\n if (schemaExtension.operationTypes) {\n var _iteratorNormalCompletion12 = true;\n var _didIteratorError12 = false;\n var _iteratorError12 = undefined;\n\n try {\n for (var _iterator12 = schemaExtension.operationTypes[Symbol.iterator](), _step12; !(_iteratorNormalCompletion12 = (_step12 = _iterator12.next()).done); _iteratorNormalCompletion12 = true) {\n var _ref4 = _step12.value;\n var operation = _ref4.operation,\n type = _ref4.type;\n\n if (operationTypes[operation]) {\n throw new Error(\"Must provide only one \".concat(operation, \" type in schema.\"));\n } // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n\n\n operationTypes[operation] = astBuilder.buildType(type);\n }\n } catch (err) {\n _didIteratorError12 = true;\n _iteratorError12 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion12 && _iterator12.return != null) {\n _iterator12.return();\n }\n } finally {\n if (_didIteratorError12) {\n throw _iteratorError12;\n }\n }\n }\n }\n }\n\n var schemaExtensionASTNodes = schemaExtensions ? schema.extensionASTNodes ? schema.extensionASTNodes.concat(schemaExtensions) : schemaExtensions : schema.extensionASTNodes;\n var types = (0, _objectValues.default)(schema.getTypeMap()).map(function (type) {\n return extendNamedType(type);\n }).concat((0, _objectValues.default)(typeDefinitionMap).map(function (type) {\n return astBuilder.buildType(type);\n })); // Support both original legacy names and extended legacy names.\n\n var allowedLegacyNames = schema.__allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\n\n\n return new _schema.GraphQLSchema(_objectSpread({}, operationTypes, {\n types: types,\n directives: getMergedDirectives(),\n astNode: schema.astNode,\n extensionASTNodes: schemaExtensionASTNodes,\n allowedLegacyNames: allowedLegacyNames\n })); // Below are functions used for producing this schema that have closed over\n // this scope and have access to the schema, cache, and newly defined types.\n\n function getMergedDirectives() {\n var existingDirectives = schema.getDirectives().map(extendDirective);\n !existingDirectives ? (0, _invariant.default)(0, 'schema must have default directives') : void 0;\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\n return astBuilder.buildDirective(node);\n }));\n }\n\n function extendMaybeNamedType(type) {\n return type ? extendNamedType(type) : null;\n }\n\n function extendNamedType(type) {\n if ((0, _introspection.isIntrospectionType)(type) || (0, _scalars.isSpecifiedScalarType)(type)) {\n // Builtin types are not extended.\n return type;\n }\n\n var name = type.name;\n\n if (!extendTypeCache[name]) {\n if ((0, _definition.isScalarType)(type)) {\n extendTypeCache[name] = extendScalarType(type);\n } else if ((0, _definition.isObjectType)(type)) {\n extendTypeCache[name] = extendObjectType(type);\n } else if ((0, _definition.isInterfaceType)(type)) {\n extendTypeCache[name] = extendInterfaceType(type);\n } else if ((0, _definition.isUnionType)(type)) {\n extendTypeCache[name] = extendUnionType(type);\n } else if ((0, _definition.isEnumType)(type)) {\n extendTypeCache[name] = extendEnumType(type);\n } else if ((0, _definition.isInputObjectType)(type)) {\n extendTypeCache[name] = extendInputObjectType(type);\n }\n }\n\n return extendTypeCache[name];\n }\n\n function extendDirective(directive) {\n return new _directives.GraphQLDirective({\n name: directive.name,\n description: directive.description,\n locations: directive.locations,\n args: extendArgs(directive.args),\n astNode: directive.astNode\n });\n }\n\n function extendInputObjectType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLInputObjectType({\n name: name,\n description: type.description,\n fields: function fields() {\n return extendInputFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendInputFieldMap(type) {\n var newFieldMap = Object.create(null);\n var oldFieldMap = type.getFields();\n\n var _arr = Object.keys(oldFieldMap);\n\n for (var _i2 = 0; _i2 < _arr.length; _i2++) {\n var _fieldName = _arr[_i2];\n var _field = oldFieldMap[_fieldName];\n newFieldMap[_fieldName] = {\n description: _field.description,\n type: extendType(_field.type),\n defaultValue: _field.defaultValue,\n astNode: _field.astNode\n };\n } // If there are any extensions to the fields, apply those here.\n\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion2 = true;\n var _didIteratorError2 = false;\n var _iteratorError2 = undefined;\n\n try {\n for (var _iterator2 = extensions[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n var extension = _step2.value;\n var _iteratorNormalCompletion3 = true;\n var _didIteratorError3 = false;\n var _iteratorError3 = undefined;\n\n try {\n for (var _iterator3 = extension.fields[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\n var field = _step3.value;\n var fieldName = field.name.value;\n\n if (oldFieldMap[fieldName]) {\n throw new _GraphQLError.GraphQLError(\"Field \\\"\".concat(type.name, \".\").concat(fieldName, \"\\\" already exists in the \") + 'schema. It cannot also be defined in this type extension.', [field]);\n }\n\n newFieldMap[fieldName] = astBuilder.buildInputField(field);\n }\n } catch (err) {\n _didIteratorError3 = true;\n _iteratorError3 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\n _iterator3.return();\n }\n } finally {\n if (_didIteratorError3) {\n throw _iteratorError3;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError2 = true;\n _iteratorError2 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\n _iterator2.return();\n }\n } finally {\n if (_didIteratorError2) {\n throw _iteratorError2;\n }\n }\n }\n }\n\n return newFieldMap;\n }\n\n function extendEnumType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLEnumType({\n name: name,\n description: type.description,\n values: extendValueMap(type),\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendValueMap(type) {\n var newValueMap = Object.create(null);\n var oldValueMap = (0, _keyMap.default)(type.getValues(), function (value) {\n return value.name;\n });\n\n var _arr2 = Object.keys(oldValueMap);\n\n for (var _i3 = 0; _i3 < _arr2.length; _i3++) {\n var _valueName = _arr2[_i3];\n var _value = oldValueMap[_valueName];\n newValueMap[_valueName] = {\n name: _value.name,\n description: _value.description,\n value: _value.value,\n deprecationReason: _value.deprecationReason,\n astNode: _value.astNode\n };\n } // If there are any extensions to the values, apply those here.\n\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion4 = true;\n var _didIteratorError4 = false;\n var _iteratorError4 = undefined;\n\n try {\n for (var _iterator4 = extensions[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\n var extension = _step4.value;\n var _iteratorNormalCompletion5 = true;\n var _didIteratorError5 = false;\n var _iteratorError5 = undefined;\n\n try {\n for (var _iterator5 = extension.values[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\n var value = _step5.value;\n var valueName = value.name.value;\n\n if (oldValueMap[valueName]) {\n throw new _GraphQLError.GraphQLError(\"Enum value \\\"\".concat(type.name, \".\").concat(valueName, \"\\\" already exists in the \") + 'schema. It cannot also be defined in this type extension.', [value]);\n }\n\n newValueMap[valueName] = astBuilder.buildEnumValue(value);\n }\n } catch (err) {\n _didIteratorError5 = true;\n _iteratorError5 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\n _iterator5.return();\n }\n } finally {\n if (_didIteratorError5) {\n throw _iteratorError5;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError4 = true;\n _iteratorError4 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\n _iterator4.return();\n }\n } finally {\n if (_didIteratorError4) {\n throw _iteratorError4;\n }\n }\n }\n }\n\n return newValueMap;\n }\n\n function extendScalarType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLScalarType({\n name: name,\n description: type.description,\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n serialize: type.serialize,\n parseValue: type.parseValue,\n parseLiteral: type.parseLiteral\n });\n }\n\n function extendObjectType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLObjectType({\n name: name,\n description: type.description,\n interfaces: function interfaces() {\n return extendImplementedInterfaces(type);\n },\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n isTypeOf: type.isTypeOf\n });\n }\n\n function extendArgs(args) {\n return (0, _keyValMap.default)(args, function (arg) {\n return arg.name;\n }, function (arg) {\n return {\n type: extendType(arg.type),\n defaultValue: arg.defaultValue,\n description: arg.description,\n astNode: arg.astNode\n };\n });\n }\n\n function extendInterfaceType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLInterfaceType({\n name: type.name,\n description: type.description,\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n resolveType: type.resolveType\n });\n }\n\n function extendUnionType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLUnionType({\n name: name,\n description: type.description,\n types: function types() {\n return extendPossibleTypes(type);\n },\n astNode: type.astNode,\n resolveType: type.resolveType,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendPossibleTypes(type) {\n var possibleTypes = type.getTypes().map(extendNamedType); // If there are any extensions to the union, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion6 = true;\n var _didIteratorError6 = false;\n var _iteratorError6 = undefined;\n\n try {\n for (var _iterator6 = extensions[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\n var extension = _step6.value;\n var _iteratorNormalCompletion7 = true;\n var _didIteratorError7 = false;\n var _iteratorError7 = undefined;\n\n try {\n for (var _iterator7 = extension.types[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {\n var namedType = _step7.value; // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n\n possibleTypes.push(astBuilder.buildType(namedType));\n }\n } catch (err) {\n _didIteratorError7 = true;\n _iteratorError7 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion7 && _iterator7.return != null) {\n _iterator7.return();\n }\n } finally {\n if (_didIteratorError7) {\n throw _iteratorError7;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError6 = true;\n _iteratorError6 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\n _iterator6.return();\n }\n } finally {\n if (_didIteratorError6) {\n throw _iteratorError6;\n }\n }\n }\n }\n\n return possibleTypes;\n }\n\n function extendImplementedInterfaces(type) {\n var interfaces = type.getInterfaces().map(extendNamedType); // If there are any extensions to the interfaces, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion8 = true;\n var _didIteratorError8 = false;\n var _iteratorError8 = undefined;\n\n try {\n for (var _iterator8 = extensions[Symbol.iterator](), _step8; !(_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done); _iteratorNormalCompletion8 = true) {\n var extension = _step8.value;\n var _iteratorNormalCompletion9 = true;\n var _didIteratorError9 = false;\n var _iteratorError9 = undefined;\n\n try {\n for (var _iterator9 = extension.interfaces[Symbol.iterator](), _step9; !(_iteratorNormalCompletion9 = (_step9 = _iterator9.next()).done); _iteratorNormalCompletion9 = true) {\n var namedType = _step9.value; // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n\n interfaces.push(astBuilder.buildType(namedType));\n }\n } catch (err) {\n _didIteratorError9 = true;\n _iteratorError9 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion9 && _iterator9.return != null) {\n _iterator9.return();\n }\n } finally {\n if (_didIteratorError9) {\n throw _iteratorError9;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError8 = true;\n _iteratorError8 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion8 && _iterator8.return != null) {\n _iterator8.return();\n }\n } finally {\n if (_didIteratorError8) {\n throw _iteratorError8;\n }\n }\n }\n }\n\n return interfaces;\n }\n\n function extendFieldMap(type) {\n var newFieldMap = Object.create(null);\n var oldFieldMap = type.getFields();\n\n var _arr3 = Object.keys(oldFieldMap);\n\n for (var _i4 = 0; _i4 < _arr3.length; _i4++) {\n var _fieldName2 = _arr3[_i4];\n var _field2 = oldFieldMap[_fieldName2];\n newFieldMap[_fieldName2] = {\n description: _field2.description,\n deprecationReason: _field2.deprecationReason,\n type: extendType(_field2.type),\n args: extendArgs(_field2.args),\n astNode: _field2.astNode,\n resolve: _field2.resolve\n };\n } // If there are any extensions to the fields, apply those here.\n\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion10 = true;\n var _didIteratorError10 = false;\n var _iteratorError10 = undefined;\n\n try {\n for (var _iterator10 = extensions[Symbol.iterator](), _step10; !(_iteratorNormalCompletion10 = (_step10 = _iterator10.next()).done); _iteratorNormalCompletion10 = true) {\n var extension = _step10.value;\n var _iteratorNormalCompletion11 = true;\n var _didIteratorError11 = false;\n var _iteratorError11 = undefined;\n\n try {\n for (var _iterator11 = extension.fields[Symbol.iterator](), _step11; !(_iteratorNormalCompletion11 = (_step11 = _iterator11.next()).done); _iteratorNormalCompletion11 = true) {\n var field = _step11.value;\n var fieldName = field.name.value;\n\n if (oldFieldMap[fieldName]) {\n throw new _GraphQLError.GraphQLError(\"Field \\\"\".concat(type.name, \".\").concat(fieldName, \"\\\" already exists in the \") + 'schema. It cannot also be defined in this type extension.', [field]);\n }\n\n newFieldMap[fieldName] = astBuilder.buildField(field);\n }\n } catch (err) {\n _didIteratorError11 = true;\n _iteratorError11 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion11 && _iterator11.return != null) {\n _iterator11.return();\n }\n } finally {\n if (_didIteratorError11) {\n throw _iteratorError11;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError10 = true;\n _iteratorError10 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion10 && _iterator10.return != null) {\n _iterator10.return();\n }\n } finally {\n if (_didIteratorError10) {\n throw _iteratorError10;\n }\n }\n }\n }\n\n return newFieldMap;\n }\n\n function extendType(typeDef) {\n if ((0, _definition.isListType)(typeDef)) {\n return (0, _definition.GraphQLList)(extendType(typeDef.ofType));\n }\n\n if ((0, _definition.isNonNullType)(typeDef)) {\n return (0, _definition.GraphQLNonNull)(extendType(typeDef.ofType));\n }\n\n return extendNamedType(typeDef);\n }\n}","title":""},{"docid":"cbf654a1a079664d8dce8d149cb62c55","score":"0.49089834","text":"function merge(s1, s2) {\n for (var key in s2) {\n if (tipe(s1) !== 'object') s1 = {}\n if (tipe(s2[key]) === 'object') {\n s1[key] = merge(s1[key], s2[key])\n }\n else {\n if (tipe(s1[key]) === 'array' && tipe(s2[key]) === 'array') {\n s1[key] = s1[key].concat(s2[key])\n }\n else s1[key] = s2[key]\n }\n }\n return s1\n }","title":""},{"docid":"94f1af2985ca0bdeb92ded2d37bb1843","score":"0.4884164","text":"function merge (a, b) {\n b.forEach(function (doc) {\n if (a.indexOf(doc) === -1)\n a.push(doc);\n });\n\n return a;\n}","title":""},{"docid":"54fef18f4c0fc776c517c2fac042ebee","score":"0.48836803","text":"function extendSchema(schema, documentAST, options) {\n\t !isSchema(schema) ? invariant(0, 'Must provide valid GraphQLSchema') : void 0;\n\n\t !(documentAST && documentAST.kind === Kind.DOCUMENT) ? invariant(0, 'Must provide valid Document AST') : void 0;\n\n\t // Collect the type definitions and extensions found in the document.\n\t var typeDefinitionMap = Object.create(null);\n\t var typeExtensionsMap = Object.create(null);\n\n\t // New directives and types are separate because a directives and types can\n\t // have the same name. For example, a type named \"skip\".\n\t var directiveDefinitions = [];\n\n\t for (var i = 0; i < documentAST.definitions.length; i++) {\n\t var def = documentAST.definitions[i];\n\t switch (def.kind) {\n\t case Kind.OBJECT_TYPE_DEFINITION:\n\t case Kind.INTERFACE_TYPE_DEFINITION:\n\t case Kind.ENUM_TYPE_DEFINITION:\n\t case Kind.UNION_TYPE_DEFINITION:\n\t case Kind.SCALAR_TYPE_DEFINITION:\n\t case Kind.INPUT_OBJECT_TYPE_DEFINITION:\n\t // Sanity check that none of the defined types conflict with the\n\t // schema's existing types.\n\t var typeName = def.name.value;\n\t if (schema.getType(typeName)) {\n\t throw new GraphQLError('Type \"' + typeName + '\" already exists in the schema. It cannot also ' + 'be defined in this type definition.', [def]);\n\t }\n\t typeDefinitionMap[typeName] = def;\n\t break;\n\t case Kind.OBJECT_TYPE_EXTENSION:\n\t // Sanity check that this type extension exists within the\n\t // schema's existing types.\n\t var extendedTypeName = def.name.value;\n\t var existingType = schema.getType(extendedTypeName);\n\t if (!existingType) {\n\t throw new GraphQLError('Cannot extend type \"' + extendedTypeName + '\" because it does not ' + 'exist in the existing schema.', [def]);\n\t }\n\t if (!isObjectType(existingType)) {\n\t throw new GraphQLError('Cannot extend non-object type \"' + extendedTypeName + '\".', [def]);\n\t }\n\t var extensions = typeExtensionsMap[extendedTypeName];\n\t if (extensions) {\n\t extensions.push(def);\n\t } else {\n\t extensions = [def];\n\t }\n\t typeExtensionsMap[extendedTypeName] = extensions;\n\t break;\n\t case Kind.DIRECTIVE_DEFINITION:\n\t var directiveName = def.name.value;\n\t var existingDirective = schema.getDirective(directiveName);\n\t if (existingDirective) {\n\t throw new GraphQLError('Directive \"' + directiveName + '\" already exists in the schema. It ' + 'cannot be redefined.', [def]);\n\t }\n\t directiveDefinitions.push(def);\n\t break;\n\t case Kind.SCALAR_TYPE_EXTENSION:\n\t case Kind.INTERFACE_TYPE_EXTENSION:\n\t case Kind.UNION_TYPE_EXTENSION:\n\t case Kind.ENUM_TYPE_EXTENSION:\n\t case Kind.INPUT_OBJECT_TYPE_EXTENSION:\n\t throw new Error('The ' + def.kind + ' kind is not yet supported by extendSchema().');\n\t }\n\t }\n\n\t // If this document contains no new types, extensions, or directives then\n\t // return the same unmodified GraphQLSchema instance.\n\t if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0) {\n\t return schema;\n\t }\n\n\t var definitionBuilder = new ASTDefinitionBuilder(typeDefinitionMap, options, function (typeName, node) {\n\t var existingType = schema.getType(typeName);\n\t if (existingType) {\n\t return extendType(existingType);\n\t }\n\n\t if (node) {\n\t throw new GraphQLError('Unknown type: \"' + typeName + '\". Ensure that this type exists ' + 'either in the original schema, or is added in a type definition.', [node]);\n\t }\n\t throw GraphQLError('Missing type from schema');\n\t });\n\n\t // Get the root Query, Mutation, and Subscription object types.\n\t // Note: While this could make early assertions to get the correctly\n\t // typed values below, that would throw immediately while type system\n\t // validation with validateSchema() will produce more actionable results.\n\t var existingQueryType = schema.getQueryType();\n\t var queryType = existingQueryType ? definitionBuilder.buildType(existingQueryType.name) : null;\n\n\t var existingMutationType = schema.getMutationType();\n\t var mutationType = existingMutationType ? definitionBuilder.buildType(existingMutationType.name) : null;\n\n\t var existingSubscriptionType = schema.getSubscriptionType();\n\t var subscriptionType = existingSubscriptionType ? definitionBuilder.buildType(existingSubscriptionType.name) : null;\n\n\t // Iterate through all types, getting the type definition for each, ensuring\n\t // that any type not directly referenced by a field will get created.\n\t var typeMap = schema.getTypeMap();\n\t var types = Object.keys(typeMap).map(function (typeName) {\n\t return definitionBuilder.buildType(typeName);\n\t });\n\n\t // Do the same with new types, appending to the list of defined types.\n\t Object.keys(typeDefinitionMap).forEach(function (typeName) {\n\t types.push(definitionBuilder.buildType(typeName));\n\t });\n\n\t // Then produce and return a Schema with these types.\n\t return new GraphQLSchema({\n\t query: queryType,\n\t mutation: mutationType,\n\t subscription: subscriptionType,\n\t types: types,\n\t directives: getMergedDirectives(),\n\t astNode: schema.astNode,\n\t allowedLegacyNames: schema.__allowedLegacyNames && schema.__allowedLegacyNames.slice()\n\t });\n\n\t // Below are functions used for producing this schema that have closed over\n\t // this scope and have access to the schema, cache, and newly defined types.\n\n\t function getMergedDirectives() {\n\t var existingDirectives = schema.getDirectives();\n\t !existingDirectives ? invariant(0, 'schema must have default directives') : void 0;\n\n\t var newDirectives = directiveDefinitions.map(function (directiveNode) {\n\t return definitionBuilder.buildDirective(directiveNode);\n\t });\n\t return existingDirectives.concat(newDirectives);\n\t }\n\n\t function getTypeFromDef(typeDef) {\n\t var type = definitionBuilder.buildType(typeDef.name);\n\t return type;\n\t }\n\n\t // Given a type's introspection result, construct the correct\n\t // GraphQLType instance.\n\t function extendType(type) {\n\t if (isObjectType(type)) {\n\t return extendObjectType(type);\n\t }\n\t if (isInterfaceType(type)) {\n\t return extendInterfaceType(type);\n\t }\n\t if (isUnionType(type)) {\n\t return extendUnionType(type);\n\t }\n\t return type;\n\t }\n\n\t function extendObjectType(type) {\n\t var name = type.name;\n\t var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n\t return new GraphQLObjectType({\n\t name: name,\n\t description: type.description,\n\t interfaces: function interfaces() {\n\t return extendImplementedInterfaces(type);\n\t },\n\t fields: function fields() {\n\t return extendFieldMap(type);\n\t },\n\t astNode: type.astNode,\n\t extensionASTNodes: extensionASTNodes,\n\t isTypeOf: type.isTypeOf\n\t });\n\t }\n\n\t function extendInterfaceType(type) {\n\t return new GraphQLInterfaceType({\n\t name: type.name,\n\t description: type.description,\n\t fields: function fields() {\n\t return extendFieldMap(type);\n\t },\n\t astNode: type.astNode,\n\t resolveType: type.resolveType\n\t });\n\t }\n\n\t function extendUnionType(type) {\n\t return new GraphQLUnionType({\n\t name: type.name,\n\t description: type.description,\n\t types: type.getTypes().map(getTypeFromDef),\n\t astNode: type.astNode,\n\t resolveType: type.resolveType\n\t });\n\t }\n\n\t function extendImplementedInterfaces(type) {\n\t var interfaces = type.getInterfaces().map(getTypeFromDef);\n\n\t // If there are any extensions to the interfaces, apply those here.\n\t var extensions = typeExtensionsMap[type.name];\n\t if (extensions) {\n\t extensions.forEach(function (extension) {\n\t extension.interfaces.forEach(function (namedType) {\n\t // Note: While this could make early assertions to get the correctly\n\t // typed values, that would throw immediately while type system\n\t // validation with validateSchema() will produce more actionable results.\n\t interfaces.push(definitionBuilder.buildType(namedType));\n\t });\n\t });\n\t }\n\n\t return interfaces;\n\t }\n\n\t function extendFieldMap(type) {\n\t var newFieldMap = Object.create(null);\n\t var oldFieldMap = type.getFields();\n\t Object.keys(oldFieldMap).forEach(function (fieldName) {\n\t var field = oldFieldMap[fieldName];\n\t newFieldMap[fieldName] = {\n\t description: field.description,\n\t deprecationReason: field.deprecationReason,\n\t type: extendFieldType(field.type),\n\t args: keyMap(field.args, function (arg) {\n\t return arg.name;\n\t }),\n\t astNode: field.astNode,\n\t resolve: field.resolve\n\t };\n\t });\n\n\t // If there are any extensions to the fields, apply those here.\n\t var extensions = typeExtensionsMap[type.name];\n\t if (extensions) {\n\t extensions.forEach(function (extension) {\n\t extension.fields.forEach(function (field) {\n\t var fieldName = field.name.value;\n\t if (oldFieldMap[fieldName]) {\n\t throw new GraphQLError('Field \"' + type.name + '.' + fieldName + '\" already exists in the ' + 'schema. It cannot also be defined in this type extension.', [field]);\n\t }\n\t newFieldMap[fieldName] = definitionBuilder.buildField(field);\n\t });\n\t });\n\t }\n\n\t return newFieldMap;\n\t }\n\n\t function extendFieldType(typeDef) {\n\t if (isListType(typeDef)) {\n\t return GraphQLList(extendFieldType(typeDef.ofType));\n\t }\n\t if (isNonNullType(typeDef)) {\n\t return GraphQLNonNull(extendFieldType(typeDef.ofType));\n\t }\n\t return getTypeFromDef(typeDef);\n\t }\n\t}","title":""},{"docid":"6d76f2905cee696511f8d7a692484f03","score":"0.4878745","text":"function mergeInstance(target, source) {\n lodash.extend(target, lodash.cloneDeep(source));\n }","title":""},{"docid":"136042edf67e370f80c1f572dfaba25d","score":"0.48773625","text":"function SchemaExtend () {\n\tvar self=this;\n\n\tthis.extend = function (toExtend,extendBy){\n\t\tvar retval={};\n\t\tObject.getOwnPropertyNames(toExtend).map(function(prop){\n\t\t\tretval[prop]= toExtend[prop];\n\t\t});\n\n\t\tObject.getOwnPropertyNames(extendBy).map(function(prop){\n\t\t\t\tvar value=extendBy[prop];\n\t\t\t\tswitch(typeof value){\n\n\t\t\t\t\tcase 'object':\n\t\t\t\t\t\tvar v1=toExtend[prop];\n\t\t\t\t\t\tif (value && typeof v1 == 'object' && !Array.isArray(value)){\n\t\t\t\t\t\t\tretval[prop]= self.extend( v1 , value);\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tretval[prop]=value;\n\t\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tretval[prop]=value;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\t\t});\n\t\treturn retval;\n\t};\n}","title":""},{"docid":"ffeb3165cfa000548f730791986080d8","score":"0.48730093","text":"async function loadSchema(schemaPointers, options) {\n const sources = await loadTypedefs(schemaPointers, {\n filterKinds: OPERATION_KINDS,\n ...options,\n });\n const { schemas, typeDefs } = collectSchemasAndTypeDefs(sources);\n const mergeSchemasOptions = {\n schemas,\n typeDefs,\n ...options,\n };\n const schema = await merge.mergeSchemasAsync(mergeSchemasOptions);\n if (options === null || options === void 0 ? void 0 : options.includeSources) {\n includeSources(schema, sources);\n }\n return schema;\n}","title":""},{"docid":"7e6d7bbbc92eb3c8d17d9e78c287676f","score":"0.48546883","text":"async function mergeSchemasAsync(config) {\n const [typeDefs, resolvers, extensions] = await Promise.all([\n mergeTypes(config),\n Promise.all(config.schemas.map(async (schema) => utils.getResolversFromSchema(schema))).then(extractedResolvers => mergeResolvers([...extractedResolvers, ...ensureResolvers(config)], config)),\n Promise.all(config.schemas.map(async (schema) => extractExtensionsFromSchema(schema))).then(extractedExtensions => mergeExtensions(extractedExtensions)),\n ]);\n return makeSchema({ resolvers, typeDefs, extensions }, config);\n}","title":""},{"docid":"b86779fbb229873c866b3851e5a06e38","score":"0.48539004","text":"function extendSchema(schema, documentAST, options) {\n !(0, _schema.isSchema)(schema) ? (0, _invariant2.default)(0, 'Must provide valid GraphQLSchema') : void 0;\n\n !(documentAST && documentAST.kind === _kinds.Kind.DOCUMENT) ? (0, _invariant2.default)(0, 'Must provide valid Document AST') : void 0;\n\n // Collect the type definitions and extensions found in the document.\n var typeDefinitionMap = Object.create(null);\n var typeExtensionsMap = Object.create(null);\n\n // New directives and types are separate because a directives and types can\n // have the same name. For example, a type named \"skip\".\n var directiveDefinitions = [];\n\n for (var i = 0; i < documentAST.definitions.length; i++) {\n var def = documentAST.definitions[i];\n switch (def.kind) {\n case _kinds.Kind.OBJECT_TYPE_DEFINITION:\n case _kinds.Kind.INTERFACE_TYPE_DEFINITION:\n case _kinds.Kind.ENUM_TYPE_DEFINITION:\n case _kinds.Kind.UNION_TYPE_DEFINITION:\n case _kinds.Kind.SCALAR_TYPE_DEFINITION:\n case _kinds.Kind.INPUT_OBJECT_TYPE_DEFINITION:\n // Sanity check that none of the defined types conflict with the\n // schema's existing types.\n var typeName = def.name.value;\n if (schema.getType(typeName)) {\n throw new _GraphQLError.GraphQLError('Type \"' + typeName + '\" already exists in the schema. It cannot also ' + 'be defined in this type definition.', [def]);\n }\n typeDefinitionMap[typeName] = def;\n break;\n case _kinds.Kind.OBJECT_TYPE_EXTENSION:\n case _kinds.Kind.INTERFACE_TYPE_EXTENSION:\n // Sanity check that this type extension exists within the\n // schema's existing types.\n var extendedTypeName = def.name.value;\n var existingType = schema.getType(extendedTypeName);\n if (!existingType) {\n throw new _GraphQLError.GraphQLError('Cannot extend type \"' + extendedTypeName + '\" because it does not ' + 'exist in the existing schema.', [def]);\n }\n checkExtensionNode(existingType, def);\n\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\n break;\n case _kinds.Kind.DIRECTIVE_DEFINITION:\n var directiveName = def.name.value;\n var existingDirective = schema.getDirective(directiveName);\n if (existingDirective) {\n throw new _GraphQLError.GraphQLError('Directive \"' + directiveName + '\" already exists in the schema. It ' + 'cannot be redefined.', [def]);\n }\n directiveDefinitions.push(def);\n break;\n case _kinds.Kind.SCALAR_TYPE_EXTENSION:\n case _kinds.Kind.UNION_TYPE_EXTENSION:\n case _kinds.Kind.ENUM_TYPE_EXTENSION:\n case _kinds.Kind.INPUT_OBJECT_TYPE_EXTENSION:\n throw new Error('The ' + def.kind + ' kind is not yet supported by extendSchema().');\n }\n }\n\n // If this document contains no new types, extensions, or directives then\n // return the same unmodified GraphQLSchema instance.\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0) {\n return schema;\n }\n\n var astBuilder = new _buildASTSchema.ASTDefinitionBuilder(typeDefinitionMap, options, function (typeRef) {\n var typeName = typeRef.name.value;\n var existingType = schema.getType(typeName);\n if (existingType) {\n return getExtendedType(existingType);\n }\n\n throw new _GraphQLError.GraphQLError('Unknown type: \"' + typeName + '\". Ensure that this type exists ' + 'either in the original schema, or is added in a type definition.', [typeRef]);\n });\n\n var extendTypeCache = Object.create(null);\n\n // Get the root Query, Mutation, and Subscription object types.\n var existingQueryType = schema.getQueryType();\n var queryType = existingQueryType ? getExtendedType(existingQueryType) : null;\n\n var existingMutationType = schema.getMutationType();\n var mutationType = existingMutationType ? getExtendedType(existingMutationType) : null;\n\n var existingSubscriptionType = schema.getSubscriptionType();\n var subscriptionType = existingSubscriptionType ? getExtendedType(existingSubscriptionType) : null;\n\n var types = [].concat((0, _objectValues2.default)(schema.getTypeMap()).map(function (type) {\n return getExtendedType(type);\n }), astBuilder.buildTypes((0, _objectValues2.default)(typeDefinitionMap)));\n\n // Support both original legacy names and extended legacy names.\n var schemaAllowedLegacyNames = schema.__allowedLegacyNames;\n var extendAllowedLegacyNames = options && options.allowedLegacyNames;\n var allowedLegacyNames = schemaAllowedLegacyNames && extendAllowedLegacyNames ? schemaAllowedLegacyNames.concat(extendAllowedLegacyNames) : schemaAllowedLegacyNames || extendAllowedLegacyNames;\n\n // Then produce and return a Schema with these types.\n return new _schema.GraphQLSchema({\n query: queryType,\n mutation: mutationType,\n subscription: subscriptionType,\n types: types,\n directives: getMergedDirectives(),\n astNode: schema.astNode,\n allowedLegacyNames: allowedLegacyNames\n });\n\n // Below are functions used for producing this schema that have closed over\n // this scope and have access to the schema, cache, and newly defined types.\n\n function getMergedDirectives() {\n var existingDirectives = schema.getDirectives();\n !existingDirectives ? (0, _invariant2.default)(0, 'schema must have default directives') : void 0;\n\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\n return astBuilder.buildDirective(node);\n }));\n }\n\n function getExtendedType(type) {\n if (!extendTypeCache[type.name]) {\n extendTypeCache[type.name] = extendType(type);\n }\n return extendTypeCache[type.name];\n }\n\n // To be called at most once per type. Only getExtendedType should call this.\n function extendType(type) {\n if ((0, _introspection.isIntrospectionType)(type)) {\n // Introspection types are not extended.\n return type;\n }\n if ((0, _definition.isObjectType)(type)) {\n return extendObjectType(type);\n }\n if ((0, _definition.isInterfaceType)(type)) {\n return extendInterfaceType(type);\n }\n if ((0, _definition.isUnionType)(type)) {\n return extendUnionType(type);\n }\n // This type is not yet extendable.\n return type;\n }\n\n function extendObjectType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLObjectType({\n name: name,\n description: type.description,\n interfaces: function interfaces() {\n return extendImplementedInterfaces(type);\n },\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n isTypeOf: type.isTypeOf\n });\n }\n\n function extendInterfaceType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLInterfaceType({\n name: type.name,\n description: type.description,\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n resolveType: type.resolveType\n });\n }\n\n function extendUnionType(type) {\n return new _definition.GraphQLUnionType({\n name: type.name,\n description: type.description,\n types: type.getTypes().map(getExtendedType),\n astNode: type.astNode,\n resolveType: type.resolveType\n });\n }\n\n function extendImplementedInterfaces(type) {\n var interfaces = type.getInterfaces().map(getExtendedType);\n\n // If there are any extensions to the interfaces, apply those here.\n var extensions = typeExtensionsMap[type.name];\n if (extensions) {\n extensions.forEach(function (extension) {\n extension.interfaces.forEach(function (namedType) {\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n interfaces.push(astBuilder.buildType(namedType));\n });\n });\n }\n\n return interfaces;\n }\n\n function extendFieldMap(type) {\n var newFieldMap = Object.create(null);\n var oldFieldMap = type.getFields();\n Object.keys(oldFieldMap).forEach(function (fieldName) {\n var field = oldFieldMap[fieldName];\n newFieldMap[fieldName] = {\n description: field.description,\n deprecationReason: field.deprecationReason,\n type: extendFieldType(field.type),\n args: (0, _keyMap2.default)(field.args, function (arg) {\n return arg.name;\n }),\n astNode: field.astNode,\n resolve: field.resolve\n };\n });\n\n // If there are any extensions to the fields, apply those here.\n var extensions = typeExtensionsMap[type.name];\n if (extensions) {\n extensions.forEach(function (extension) {\n extension.fields.forEach(function (field) {\n var fieldName = field.name.value;\n if (oldFieldMap[fieldName]) {\n throw new _GraphQLError.GraphQLError('Field \"' + type.name + '.' + fieldName + '\" already exists in the ' + 'schema. It cannot also be defined in this type extension.', [field]);\n }\n newFieldMap[fieldName] = astBuilder.buildField(field);\n });\n });\n }\n\n return newFieldMap;\n }\n\n function extendFieldType(typeDef) {\n if ((0, _definition.isListType)(typeDef)) {\n return (0, _definition.GraphQLList)(extendFieldType(typeDef.ofType));\n }\n if ((0, _definition.isNonNullType)(typeDef)) {\n return (0, _definition.GraphQLNonNull)(extendFieldType(typeDef.ofType));\n }\n return getExtendedType(typeDef);\n }\n}","title":""},{"docid":"dc6ac16c5d56d86fb6d920d2446b8873","score":"0.4837815","text":"function mergeStyles(s1, s2) {\n if (!s2) {\n return s1;\n }\n\n for (var url in s1) {\n\t\t// it's the new format\n\t\tif (s1[url]['_rules']) {\n\t\t\ts2[url] = s1[url];\n\t\t}\n\t\t// old format\n\t\telse {\n\t\t\ts2[url] = {};\n\t\t\ts2[url]['_rules'] = s1[url];\n\t\t}\n }\n return s2;\n}","title":""},{"docid":"ae01c64e91f5df582588004d5a4068a9","score":"0.47855014","text":"function mergeConfig(c1, c2) {\n for (let k in c2) {\n if (isUndefined(c1[k])) {\n c1[k] = c2[k];\n }\n }\n return c1;\n}","title":""},{"docid":"ed85f538386ed1e5b9972f4e1e1f5302","score":"0.47340152","text":"function mergeRecursive(obj1, obj2) {\n\t\t for (var p in obj2) {\n\t\t try { // Property in destination object set; update its value.\n\t\t if ( obj2[p].constructor==Object ) {\n\t\t obj1[p] = mergeRecursive(obj1[p], obj2[p])\n\t\t } else if ( Array.isArray(obj2[p]) ) {\n\t\t\t\tif(Array.isArray(obj1[p])) { // both are arrays: concatenating...\n\t\t\t obj1[p] = obj1[p].concat(obj2[p])\n\t\t\t\t} else if(!obj1[p]) { // source does not exist, creating it...\n\t\t\t obj1[p] = obj2[p]\n\t\t\t\t} else { // source is not array and target is array: problem: do nothing\n\t\t\t\t console.log('Storyrevealer::init::mergeRecursive: warning non matching objects types', p)\n\t\t\t\t}\n\t\t\t } else{\n\t\t if (!obj1[p]) {\n obj1[p] = obj2[p];\n }\n\t\t }\n\t\t } catch(e) { // Property in destination object not set; create it and set its value.\n\t\t if (!obj1[p]) {\n obj1[p] = obj2[p];\n }\n\t\t }\n\t\t }\n\t\t return obj1;\n\t\t}","title":""},{"docid":"6bf7a1ce658195e5bc7928d08cf8c193","score":"0.47196612","text":"constructor(newSchemas = []) {\n this._validator = new AJV({ schemaId: 'auto' });\n this._validator.addSchema(values(schemas_1.schemas).filter(s => s !== undefined && s.id !== undefined));\n this._validator.addSchema(newSchemas.filter(s => s !== undefined));\n }","title":""},{"docid":"f29ae09ecd8d4dec868632f9bfcc47aa","score":"0.471536","text":"function extendSchema(schema, documentAST) {\n\t (0, _invariant2.default)(schema instanceof _schema.GraphQLSchema, 'Must provide valid GraphQLSchema');\n\n\t (0, _invariant2.default)(documentAST && documentAST.kind === Kind.DOCUMENT, 'Must provide valid Document AST');\n\n\t // Collect the type definitions and extensions found in the document.\n\t var typeDefinitionMap = Object.create(null);\n\t var typeExtensionsMap = Object.create(null);\n\n\t // New directives and types are separate because a directives and types can\n\t // have the same name. For example, a type named \"skip\".\n\t var directiveDefinitions = [];\n\n\t for (var i = 0; i < documentAST.definitions.length; i++) {\n\t var def = documentAST.definitions[i];\n\t switch (def.kind) {\n\t case Kind.OBJECT_TYPE_DEFINITION:\n\t case Kind.INTERFACE_TYPE_DEFINITION:\n\t case Kind.ENUM_TYPE_DEFINITION:\n\t case Kind.UNION_TYPE_DEFINITION:\n\t case Kind.SCALAR_TYPE_DEFINITION:\n\t case Kind.INPUT_OBJECT_TYPE_DEFINITION:\n\t // Sanity check that none of the defined types conflict with the\n\t // schema's existing types.\n\t var typeName = def.name.value;\n\t if (schema.getType(typeName)) {\n\t throw new _GraphQLError.GraphQLError('Type \"' + typeName + '\" already exists in the schema. It cannot also ' + 'be defined in this type definition.', [def]);\n\t }\n\t typeDefinitionMap[typeName] = def;\n\t break;\n\t case Kind.TYPE_EXTENSION_DEFINITION:\n\t // Sanity check that this type extension exists within the\n\t // schema's existing types.\n\t var extendedTypeName = def.definition.name.value;\n\t var existingType = schema.getType(extendedTypeName);\n\t if (!existingType) {\n\t throw new _GraphQLError.GraphQLError('Cannot extend type \"' + extendedTypeName + '\" because it does not ' + 'exist in the existing schema.', [def.definition]);\n\t }\n\t if (!(existingType instanceof _definition.GraphQLObjectType)) {\n\t throw new _GraphQLError.GraphQLError('Cannot extend non-object type \"' + extendedTypeName + '\".', [def.definition]);\n\t }\n\t var extensions = typeExtensionsMap[extendedTypeName];\n\t if (extensions) {\n\t extensions.push(def);\n\t } else {\n\t extensions = [def];\n\t }\n\t typeExtensionsMap[extendedTypeName] = extensions;\n\t break;\n\t case Kind.DIRECTIVE_DEFINITION:\n\t var directiveName = def.name.value;\n\t var existingDirective = schema.getDirective(directiveName);\n\t if (existingDirective) {\n\t throw new _GraphQLError.GraphQLError('Directive \"' + directiveName + '\" already exists in the schema. It ' + 'cannot be redefined.', [def]);\n\t }\n\t directiveDefinitions.push(def);\n\t break;\n\t }\n\t }\n\n\t // If this document contains no new types, extensions, or directives then\n\t // return the same unmodified GraphQLSchema instance.\n\t if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0) {\n\t return schema;\n\t }\n\n\t // A cache to use to store the actual GraphQLType definition objects by name.\n\t // Initialize to the GraphQL built in scalars and introspection types. All\n\t // functions below are inline so that this type def cache is within the scope\n\t // of the closure.\n\t var typeDefCache = {\n\t String: _scalars.GraphQLString,\n\t Int: _scalars.GraphQLInt,\n\t Float: _scalars.GraphQLFloat,\n\t Boolean: _scalars.GraphQLBoolean,\n\t ID: _scalars.GraphQLID,\n\t __Schema: _introspection.__Schema,\n\t __Directive: _introspection.__Directive,\n\t __DirectiveLocation: _introspection.__DirectiveLocation,\n\t __Type: _introspection.__Type,\n\t __Field: _introspection.__Field,\n\t __InputValue: _introspection.__InputValue,\n\t __EnumValue: _introspection.__EnumValue,\n\t __TypeKind: _introspection.__TypeKind\n\t };\n\n\t // Get the root Query, Mutation, and Subscription object types.\n\t var queryType = getTypeFromDef(schema.getQueryType());\n\n\t var existingMutationType = schema.getMutationType();\n\t var mutationType = existingMutationType ? getTypeFromDef(existingMutationType) : null;\n\n\t var existingSubscriptionType = schema.getSubscriptionType();\n\t var subscriptionType = existingSubscriptionType ? getTypeFromDef(existingSubscriptionType) : null;\n\n\t // Iterate through all types, getting the type definition for each, ensuring\n\t // that any type not directly referenced by a field will get created.\n\t var typeMap = schema.getTypeMap();\n\t var types = Object.keys(typeMap).map(function (typeName) {\n\t return getTypeFromDef(typeMap[typeName]);\n\t });\n\n\t // Do the same with new types, appending to the list of defined types.\n\t Object.keys(typeDefinitionMap).forEach(function (typeName) {\n\t types.push(getTypeFromAST(typeDefinitionMap[typeName]));\n\t });\n\n\t // Then produce and return a Schema with these types.\n\t return new _schema.GraphQLSchema({\n\t query: queryType,\n\t mutation: mutationType,\n\t subscription: subscriptionType,\n\t types: types,\n\t directives: getMergedDirectives()\n\t });\n\n\t // Below are functions used for producing this schema that have closed over\n\t // this scope and have access to the schema, cache, and newly defined types.\n\n\t function getMergedDirectives() {\n\t var existingDirectives = schema.getDirectives();\n\t (0, _invariant2.default)(existingDirectives, 'schema must have default directives');\n\n\t var newDirectives = directiveDefinitions.map(function (directiveNode) {\n\t return getDirective(directiveNode);\n\t });\n\t return existingDirectives.concat(newDirectives);\n\t }\n\n\t function getTypeFromDef(typeDef) {\n\t var type = _getNamedType(typeDef.name);\n\t (0, _invariant2.default)(type, 'Missing type from schema');\n\t return type;\n\t }\n\n\t function getTypeFromAST(node) {\n\t var type = _getNamedType(node.name.value);\n\t if (!type) {\n\t throw new _GraphQLError.GraphQLError('Unknown type: \"' + node.name.value + '\". Ensure that this type exists ' + 'either in the original schema, or is added in a type definition.', [node]);\n\t }\n\t return type;\n\t }\n\n\t function getObjectTypeFromAST(node) {\n\t var type = getTypeFromAST(node);\n\t (0, _invariant2.default)(type instanceof _definition.GraphQLObjectType, 'Must be Object type.');\n\t return type;\n\t }\n\n\t function getInterfaceTypeFromAST(node) {\n\t var type = getTypeFromAST(node);\n\t (0, _invariant2.default)(type instanceof _definition.GraphQLInterfaceType, 'Must be Interface type.');\n\t return type;\n\t }\n\n\t function getInputTypeFromAST(node) {\n\t return (0, _definition.assertInputType)(getTypeFromAST(node));\n\t }\n\n\t function getOutputTypeFromAST(node) {\n\t return (0, _definition.assertOutputType)(getTypeFromAST(node));\n\t }\n\n\t // Given a name, returns a type from either the existing schema or an\n\t // added type.\n\t function _getNamedType(typeName) {\n\t var cachedTypeDef = typeDefCache[typeName];\n\t if (cachedTypeDef) {\n\t return cachedTypeDef;\n\t }\n\n\t var existingType = schema.getType(typeName);\n\t if (existingType) {\n\t var typeDef = extendType(existingType);\n\t typeDefCache[typeName] = typeDef;\n\t return typeDef;\n\t }\n\n\t var typeNode = typeDefinitionMap[typeName];\n\t if (typeNode) {\n\t var _typeDef = buildType(typeNode);\n\t typeDefCache[typeName] = _typeDef;\n\t return _typeDef;\n\t }\n\t }\n\n\t // Given a type's introspection result, construct the correct\n\t // GraphQLType instance.\n\t function extendType(type) {\n\t if (type instanceof _definition.GraphQLObjectType) {\n\t return extendObjectType(type);\n\t }\n\t if (type instanceof _definition.GraphQLInterfaceType) {\n\t return extendInterfaceType(type);\n\t }\n\t if (type instanceof _definition.GraphQLUnionType) {\n\t return extendUnionType(type);\n\t }\n\t return type;\n\t }\n\n\t function extendObjectType(type) {\n\t return new _definition.GraphQLObjectType({\n\t name: type.name,\n\t description: type.description,\n\t interfaces: function interfaces() {\n\t return extendImplementedInterfaces(type);\n\t },\n\t fields: function fields() {\n\t return extendFieldMap(type);\n\t },\n\t isTypeOf: type.isTypeOf\n\t });\n\t }\n\n\t function extendInterfaceType(type) {\n\t return new _definition.GraphQLInterfaceType({\n\t name: type.name,\n\t description: type.description,\n\t fields: function fields() {\n\t return extendFieldMap(type);\n\t },\n\t resolveType: type.resolveType\n\t });\n\t }\n\n\t function extendUnionType(type) {\n\t return new _definition.GraphQLUnionType({\n\t name: type.name,\n\t description: type.description,\n\t types: type.getTypes().map(getTypeFromDef),\n\t resolveType: type.resolveType\n\t });\n\t }\n\n\t function extendImplementedInterfaces(type) {\n\t var interfaces = type.getInterfaces().map(getTypeFromDef);\n\n\t // If there are any extensions to the interfaces, apply those here.\n\t var extensions = typeExtensionsMap[type.name];\n\t if (extensions) {\n\t extensions.forEach(function (extension) {\n\t extension.definition.interfaces.forEach(function (namedType) {\n\t var interfaceName = namedType.name.value;\n\t if (interfaces.some(function (def) {\n\t return def.name === interfaceName;\n\t })) {\n\t throw new _GraphQLError.GraphQLError('Type \"' + type.name + '\" already implements \"' + interfaceName + '\". ' + 'It cannot also be implemented in this type extension.', [namedType]);\n\t }\n\t interfaces.push(getInterfaceTypeFromAST(namedType));\n\t });\n\t });\n\t }\n\n\t return interfaces;\n\t }\n\n\t function extendFieldMap(type) {\n\t var newFieldMap = Object.create(null);\n\t var oldFieldMap = type.getFields();\n\t Object.keys(oldFieldMap).forEach(function (fieldName) {\n\t var field = oldFieldMap[fieldName];\n\t newFieldMap[fieldName] = {\n\t description: field.description,\n\t deprecationReason: field.deprecationReason,\n\t type: extendFieldType(field.type),\n\t args: (0, _keyMap2.default)(field.args, function (arg) {\n\t return arg.name;\n\t }),\n\t resolve: field.resolve\n\t };\n\t });\n\n\t // If there are any extensions to the fields, apply those here.\n\t var extensions = typeExtensionsMap[type.name];\n\t if (extensions) {\n\t extensions.forEach(function (extension) {\n\t extension.definition.fields.forEach(function (field) {\n\t var fieldName = field.name.value;\n\t if (oldFieldMap[fieldName]) {\n\t throw new _GraphQLError.GraphQLError('Field \"' + type.name + '.' + fieldName + '\" already exists in the ' + 'schema. It cannot also be defined in this type extension.', [field]);\n\t }\n\t newFieldMap[fieldName] = {\n\t description: (0, _buildASTSchema.getDescription)(field),\n\t type: buildOutputFieldType(field.type),\n\t args: buildInputValues(field.arguments),\n\t deprecationReason: (0, _buildASTSchema.getDeprecationReason)(field)\n\t };\n\t });\n\t });\n\t }\n\n\t return newFieldMap;\n\t }\n\n\t function extendFieldType(typeDef) {\n\t if (typeDef instanceof _definition.GraphQLList) {\n\t return new _definition.GraphQLList(extendFieldType(typeDef.ofType));\n\t }\n\t if (typeDef instanceof _definition.GraphQLNonNull) {\n\t return new _definition.GraphQLNonNull(extendFieldType(typeDef.ofType));\n\t }\n\t return getTypeFromDef(typeDef);\n\t }\n\n\t function buildType(typeNode) {\n\t switch (typeNode.kind) {\n\t case Kind.OBJECT_TYPE_DEFINITION:\n\t return buildObjectType(typeNode);\n\t case Kind.INTERFACE_TYPE_DEFINITION:\n\t return buildInterfaceType(typeNode);\n\t case Kind.UNION_TYPE_DEFINITION:\n\t return buildUnionType(typeNode);\n\t case Kind.SCALAR_TYPE_DEFINITION:\n\t return buildScalarType(typeNode);\n\t case Kind.ENUM_TYPE_DEFINITION:\n\t return buildEnumType(typeNode);\n\t case Kind.INPUT_OBJECT_TYPE_DEFINITION:\n\t return buildInputObjectType(typeNode);\n\t }\n\t throw new TypeError('Unknown type kind ' + typeNode.kind);\n\t }\n\n\t function buildObjectType(typeNode) {\n\t return new _definition.GraphQLObjectType({\n\t name: typeNode.name.value,\n\t description: (0, _buildASTSchema.getDescription)(typeNode),\n\t interfaces: function interfaces() {\n\t return buildImplementedInterfaces(typeNode);\n\t },\n\t fields: function fields() {\n\t return buildFieldMap(typeNode);\n\t }\n\t });\n\t }\n\n\t function buildInterfaceType(typeNode) {\n\t return new _definition.GraphQLInterfaceType({\n\t name: typeNode.name.value,\n\t description: (0, _buildASTSchema.getDescription)(typeNode),\n\t fields: function fields() {\n\t return buildFieldMap(typeNode);\n\t },\n\t resolveType: cannotExecuteExtendedSchema\n\t });\n\t }\n\n\t function buildUnionType(typeNode) {\n\t return new _definition.GraphQLUnionType({\n\t name: typeNode.name.value,\n\t description: (0, _buildASTSchema.getDescription)(typeNode),\n\t types: typeNode.types.map(getObjectTypeFromAST),\n\t resolveType: cannotExecuteExtendedSchema\n\t });\n\t }\n\n\t function buildScalarType(typeNode) {\n\t return new _definition.GraphQLScalarType({\n\t name: typeNode.name.value,\n\t description: (0, _buildASTSchema.getDescription)(typeNode),\n\t serialize: function serialize(id) {\n\t return id;\n\t },\n\t // Note: validation calls the parse functions to determine if a\n\t // literal value is correct. Returning null would cause use of custom\n\t // scalars to always fail validation. Returning false causes them to\n\t // always pass validation.\n\t parseValue: function parseValue() {\n\t return false;\n\t },\n\t parseLiteral: function parseLiteral() {\n\t return false;\n\t }\n\t });\n\t }\n\n\t function buildEnumType(typeNode) {\n\t return new _definition.GraphQLEnumType({\n\t name: typeNode.name.value,\n\t description: (0, _buildASTSchema.getDescription)(typeNode),\n\t values: (0, _keyValMap2.default)(typeNode.values, function (enumValue) {\n\t return enumValue.name.value;\n\t }, function (enumValue) {\n\t return {\n\t description: (0, _buildASTSchema.getDescription)(enumValue),\n\t deprecationReason: (0, _buildASTSchema.getDeprecationReason)(enumValue)\n\t };\n\t })\n\t });\n\t }\n\n\t function buildInputObjectType(typeNode) {\n\t return new _definition.GraphQLInputObjectType({\n\t name: typeNode.name.value,\n\t description: (0, _buildASTSchema.getDescription)(typeNode),\n\t fields: function fields() {\n\t return buildInputValues(typeNode.fields);\n\t }\n\t });\n\t }\n\n\t function getDirective(directiveNode) {\n\t return new _directives.GraphQLDirective({\n\t name: directiveNode.name.value,\n\t locations: directiveNode.locations.map(function (node) {\n\t return node.value;\n\t }),\n\t args: directiveNode.arguments && buildInputValues(directiveNode.arguments)\n\t });\n\t }\n\n\t function buildImplementedInterfaces(typeNode) {\n\t return typeNode.interfaces && typeNode.interfaces.map(getInterfaceTypeFromAST);\n\t }\n\n\t function buildFieldMap(typeNode) {\n\t return (0, _keyValMap2.default)(typeNode.fields, function (field) {\n\t return field.name.value;\n\t }, function (field) {\n\t return {\n\t type: buildOutputFieldType(field.type),\n\t description: (0, _buildASTSchema.getDescription)(field),\n\t args: buildInputValues(field.arguments),\n\t deprecationReason: (0, _buildASTSchema.getDeprecationReason)(field)\n\t };\n\t });\n\t }\n\n\t function buildInputValues(values) {\n\t return (0, _keyValMap2.default)(values, function (value) {\n\t return value.name.value;\n\t }, function (value) {\n\t var type = buildInputFieldType(value.type);\n\t return {\n\t type: type,\n\t description: (0, _buildASTSchema.getDescription)(value),\n\t defaultValue: (0, _valueFromAST.valueFromAST)(value.defaultValue, type)\n\t };\n\t });\n\t }\n\n\t function buildInputFieldType(typeNode) {\n\t if (typeNode.kind === Kind.LIST_TYPE) {\n\t return new _definition.GraphQLList(buildInputFieldType(typeNode.type));\n\t }\n\t if (typeNode.kind === Kind.NON_NULL_TYPE) {\n\t var nullableType = buildInputFieldType(typeNode.type);\n\t (0, _invariant2.default)(!(nullableType instanceof _definition.GraphQLNonNull), 'Must be nullable');\n\t return new _definition.GraphQLNonNull(nullableType);\n\t }\n\t return getInputTypeFromAST(typeNode);\n\t }\n\n\t function buildOutputFieldType(typeNode) {\n\t if (typeNode.kind === Kind.LIST_TYPE) {\n\t return new _definition.GraphQLList(buildOutputFieldType(typeNode.type));\n\t }\n\t if (typeNode.kind === Kind.NON_NULL_TYPE) {\n\t var nullableType = buildOutputFieldType(typeNode.type);\n\t (0, _invariant2.default)(!(nullableType instanceof _definition.GraphQLNonNull), 'Must be nullable');\n\t return new _definition.GraphQLNonNull(nullableType);\n\t }\n\t return getOutputTypeFromAST(typeNode);\n\t }\n\t}","title":""},{"docid":"f2f9961f90acc84545765404a91d83d9","score":"0.47066635","text":"function registerSchemas() {\r\n let schemas = [{template: '#img-template', selector: '.img-box', properties: ['geometry', 'position', 'rotation', 'scale', \"material\"]},\r\n {template: '#obj-template', selector: '.obj-model-test', properties: ['position', 'rotation', 'scale', 'obj-model']},\r\n {template: '#vid-template', selector: '.vid-box', properties: ['position', 'rotation', 'scale', \"material\"]}] \r\n\r\n //This builds schemas dynamically based on the list above. Check NAF github or NPM docs for more details on what this looks like unrolled\r\n schemas.forEach((schema) => {\r\n let components = schema.properties.map((property) => {\r\n return {\r\n selector: schema.selector,\r\n component: property\r\n }\r\n })\r\n\r\n window.NAF.schemas.add({\r\n template: schema.template,\r\n components: components.concat(['position', 'rotation', 'scale'])\r\n })\r\n })\r\n}","title":""},{"docid":"4a6d065c46dc4ad03e8bc4e03d5406d6","score":"0.47026902","text":"function merge(obj1, obj2) {\n\tfor (var key in obj2) {\n\t\tobj1[key] = obj2[key];\n\t}\n\treturn obj1;\n}","title":""},{"docid":"262c188e4f18dd5c21fedc4588fd2b43","score":"0.46985942","text":"function merge(original, updates) {\n return mergeWithOptions(original, updates);\n }","title":""},{"docid":"83d37c10129d7d2d97f58174179cb578","score":"0.46794203","text":"function externalApi(input1orig, input2orig, originalOpts) {\n if (!arguments.length) {\n throw new TypeError(\"object-merge-advanced/mergeAdvanced(): [THROW_ID_01] Both inputs are missing\");\n } // notice we have first argument tracking the current path, which is not\n // exposed to the external API.\n return mergeAdvanced({\n key: null,\n path: \"\",\n type: [getType(input1orig), getType(input2orig)]\n }, input1orig, input2orig, originalOpts);\n}","title":""},{"docid":"466862cbf1ad7d04296b1c25b61bde26","score":"0.46742883","text":"function mergeWith(obj1, obj2) {\n\tfor (let prop in obj1) {\n\t\tif (obj1.hasOwnProperty(prop)) {\n\t\t\tobj1[prop].push(...obj2[prop])\n\t\t}\n\t}\n\treturn obj1;\n}","title":""},{"docid":"f2a6f8511accd1430a3dd967fb2d3b55","score":"0.46610644","text":"static async load(sources) {\r\n await MongooseLoader.loadSchemas(sources[0]);\r\n\r\n return await MongooseLoader.loadModels(sources[1]);\r\n }","title":""},{"docid":"a8472886aa2ef36effdc08b15620217f","score":"0.46544036","text":"function extendSchema(schema, documentAST, options) {\n (0, _schema.assertSchema)(schema);\n !(documentAST && documentAST.kind === _kinds.Kind.DOCUMENT) ? (0, _invariant.default)(0, 'Must provide valid Document AST') : void 0;\n\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\n (0, _validate.assertValidSDLExtension)(documentAST, schema);\n } // Collect the type definitions and extensions found in the document.\n\n\n var typeDefinitionMap = Object.create(null);\n var typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\n // have the same name. For example, a type named \"skip\".\n\n var directiveDefinitions = [];\n var schemaDef; // Schema extensions are collected which may add additional operation types.\n\n var schemaExtensions = [];\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = documentAST.definitions[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var def = _step.value;\n\n if (def.kind === _kinds.Kind.SCHEMA_DEFINITION) {\n schemaDef = def;\n } else if (def.kind === _kinds.Kind.SCHEMA_EXTENSION) {\n schemaExtensions.push(def);\n } else if ((0, _predicates.isTypeDefinitionNode)(def)) {\n var typeName = def.name.value;\n typeDefinitionMap[typeName] = def;\n } else if ((0, _predicates.isTypeExtensionNode)(def)) {\n var extendedTypeName = def.name.value;\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\n } else if (def.kind === _kinds.Kind.DIRECTIVE_DEFINITION) {\n directiveDefinitions.push(def);\n }\n } // If this document contains no new types, extensions, or directives then\n // return the same unmodified GraphQLSchema instance.\n\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return != null) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0 && schemaExtensions.length === 0 && !schemaDef) {\n return schema;\n }\n\n var astBuilder = new _buildASTSchema.ASTDefinitionBuilder(typeDefinitionMap, options, function (typeName) {\n var existingType = schema.getType(typeName);\n !existingType ? (0, _invariant.default)(0, \"Unknown type: \\\"\".concat(typeName, \"\\\".\")) : void 0;\n return extendNamedType(existingType);\n });\n var extendTypeCache = Object.create(null); // Get the extended root operation types.\n\n var operationTypes = {\n query: extendMaybeNamedType(schema.getQueryType()),\n mutation: extendMaybeNamedType(schema.getMutationType()),\n subscription: extendMaybeNamedType(schema.getSubscriptionType())\n };\n\n if (schemaDef) {\n var _iteratorNormalCompletion2 = true;\n var _didIteratorError2 = false;\n var _iteratorError2 = undefined;\n\n try {\n for (var _iterator2 = schemaDef.operationTypes[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n var _ref2 = _step2.value;\n var operation = _ref2.operation;\n var type = _ref2.type;\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n operationTypes[operation] = astBuilder.buildType(type);\n }\n } catch (err) {\n _didIteratorError2 = true;\n _iteratorError2 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\n _iterator2.return();\n }\n } finally {\n if (_didIteratorError2) {\n throw _iteratorError2;\n }\n }\n }\n } // Then, incorporate schema definition and all schema extensions.\n\n\n for (var _i = 0; _i < schemaExtensions.length; _i++) {\n var schemaExtension = schemaExtensions[_i];\n\n if (schemaExtension.operationTypes) {\n var _iteratorNormalCompletion14 = true;\n var _didIteratorError14 = false;\n var _iteratorError14 = undefined;\n\n try {\n for (var _iterator14 = schemaExtension.operationTypes[Symbol.iterator](), _step14; !(_iteratorNormalCompletion14 = (_step14 = _iterator14.next()).done); _iteratorNormalCompletion14 = true) {\n var _ref4 = _step14.value;\n var _operation = _ref4.operation;\n var _type = _ref4.type;\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n operationTypes[_operation] = astBuilder.buildType(_type);\n }\n } catch (err) {\n _didIteratorError14 = true;\n _iteratorError14 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion14 && _iterator14.return != null) {\n _iterator14.return();\n }\n } finally {\n if (_didIteratorError14) {\n throw _iteratorError14;\n }\n }\n }\n }\n }\n\n var schemaExtensionASTNodes = schemaExtensions ? schema.extensionASTNodes ? schema.extensionASTNodes.concat(schemaExtensions) : schemaExtensions : schema.extensionASTNodes;\n var types = [].concat((0, _objectValues.default)(schema.getTypeMap()).map(function (type) {\n return extendNamedType(type);\n }), (0, _objectValues.default)(typeDefinitionMap).map(function (type) {\n return astBuilder.buildType(type);\n })); // Support both original legacy names and extended legacy names.\n\n var allowedLegacyNames = schema.__allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\n\n\n return new _schema.GraphQLSchema(_objectSpread({}, operationTypes, {\n types: types,\n directives: getMergedDirectives(),\n astNode: schema.astNode,\n extensionASTNodes: schemaExtensionASTNodes,\n allowedLegacyNames: allowedLegacyNames\n })); // Below are functions used for producing this schema that have closed over\n // this scope and have access to the schema, cache, and newly defined types.\n\n function getMergedDirectives() {\n var existingDirectives = schema.getDirectives().map(extendDirective);\n !existingDirectives ? (0, _invariant.default)(0, 'schema must have default directives') : void 0;\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\n return astBuilder.buildDirective(node);\n }));\n }\n\n function extendMaybeNamedType(type) {\n return type ? extendNamedType(type) : null;\n }\n\n function extendNamedType(type) {\n if ((0, _introspection.isIntrospectionType)(type) || (0, _scalars.isSpecifiedScalarType)(type)) {\n // Builtin types are not extended.\n return type;\n }\n\n var name = type.name;\n\n if (!extendTypeCache[name]) {\n if ((0, _definition.isScalarType)(type)) {\n extendTypeCache[name] = extendScalarType(type);\n } else if ((0, _definition.isObjectType)(type)) {\n extendTypeCache[name] = extendObjectType(type);\n } else if ((0, _definition.isInterfaceType)(type)) {\n extendTypeCache[name] = extendInterfaceType(type);\n } else if ((0, _definition.isUnionType)(type)) {\n extendTypeCache[name] = extendUnionType(type);\n } else if ((0, _definition.isEnumType)(type)) {\n extendTypeCache[name] = extendEnumType(type);\n } else if ((0, _definition.isInputObjectType)(type)) {\n extendTypeCache[name] = extendInputObjectType(type);\n }\n }\n\n return extendTypeCache[name];\n }\n\n function extendDirective(directive) {\n return new _directives.GraphQLDirective({\n name: directive.name,\n description: directive.description,\n locations: directive.locations,\n args: extendArgs(directive.args),\n astNode: directive.astNode\n });\n }\n\n function extendInputObjectType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLInputObjectType({\n name: name,\n description: type.description,\n fields: function fields() {\n return extendInputFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendInputFieldMap(type) {\n var newFieldMap = (0, _mapValue.default)(type.getFields(), function (field) {\n return {\n description: field.description,\n type: extendType(field.type),\n defaultValue: field.defaultValue,\n astNode: field.astNode\n };\n }); // If there are any extensions to the fields, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion3 = true;\n var _didIteratorError3 = false;\n var _iteratorError3 = undefined;\n\n try {\n for (var _iterator3 = extensions[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\n var extension = _step3.value;\n var _iteratorNormalCompletion4 = true;\n var _didIteratorError4 = false;\n var _iteratorError4 = undefined;\n\n try {\n for (var _iterator4 = extension.fields[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\n var field = _step4.value;\n newFieldMap[field.name.value] = astBuilder.buildInputField(field);\n }\n } catch (err) {\n _didIteratorError4 = true;\n _iteratorError4 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\n _iterator4.return();\n }\n } finally {\n if (_didIteratorError4) {\n throw _iteratorError4;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError3 = true;\n _iteratorError3 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\n _iterator3.return();\n }\n } finally {\n if (_didIteratorError3) {\n throw _iteratorError3;\n }\n }\n }\n }\n\n return newFieldMap;\n }\n\n function extendEnumType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLEnumType({\n name: name,\n description: type.description,\n values: extendValueMap(type),\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendValueMap(type) {\n var newValueMap = Object.create(null);\n var _iteratorNormalCompletion5 = true;\n var _didIteratorError5 = false;\n var _iteratorError5 = undefined;\n\n try {\n for (var _iterator5 = type.getValues()[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\n var _value = _step5.value;\n newValueMap[_value.name] = {\n description: _value.description,\n value: _value.value,\n deprecationReason: _value.deprecationReason,\n astNode: _value.astNode\n };\n } // If there are any extensions to the values, apply those here.\n\n } catch (err) {\n _didIteratorError5 = true;\n _iteratorError5 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\n _iterator5.return();\n }\n } finally {\n if (_didIteratorError5) {\n throw _iteratorError5;\n }\n }\n }\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion6 = true;\n var _didIteratorError6 = false;\n var _iteratorError6 = undefined;\n\n try {\n for (var _iterator6 = extensions[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\n var extension = _step6.value;\n var _iteratorNormalCompletion7 = true;\n var _didIteratorError7 = false;\n var _iteratorError7 = undefined;\n\n try {\n for (var _iterator7 = extension.values[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {\n var value = _step7.value;\n newValueMap[value.name.value] = astBuilder.buildEnumValue(value);\n }\n } catch (err) {\n _didIteratorError7 = true;\n _iteratorError7 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion7 && _iterator7.return != null) {\n _iterator7.return();\n }\n } finally {\n if (_didIteratorError7) {\n throw _iteratorError7;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError6 = true;\n _iteratorError6 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\n _iterator6.return();\n }\n } finally {\n if (_didIteratorError6) {\n throw _iteratorError6;\n }\n }\n }\n }\n\n return newValueMap;\n }\n\n function extendScalarType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLScalarType({\n name: name,\n description: type.description,\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n serialize: type.serialize,\n parseValue: type.parseValue,\n parseLiteral: type.parseLiteral\n });\n }\n\n function extendObjectType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLObjectType({\n name: name,\n description: type.description,\n interfaces: function interfaces() {\n return extendImplementedInterfaces(type);\n },\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n isTypeOf: type.isTypeOf\n });\n }\n\n function extendArgs(args) {\n return (0, _keyValMap.default)(args, function (arg) {\n return arg.name;\n }, function (arg) {\n return {\n type: extendType(arg.type),\n defaultValue: arg.defaultValue,\n description: arg.description,\n astNode: arg.astNode\n };\n });\n }\n\n function extendInterfaceType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLInterfaceType({\n name: type.name,\n description: type.description,\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n resolveType: type.resolveType\n });\n }\n\n function extendUnionType(type) {\n var name = type.name;\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\n return new _definition.GraphQLUnionType({\n name: name,\n description: type.description,\n types: function types() {\n return extendPossibleTypes(type);\n },\n astNode: type.astNode,\n resolveType: type.resolveType,\n extensionASTNodes: extensionASTNodes\n });\n }\n\n function extendPossibleTypes(type) {\n var possibleTypes = type.getTypes().map(extendNamedType); // If there are any extensions to the union, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion8 = true;\n var _didIteratorError8 = false;\n var _iteratorError8 = undefined;\n\n try {\n for (var _iterator8 = extensions[Symbol.iterator](), _step8; !(_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done); _iteratorNormalCompletion8 = true) {\n var extension = _step8.value;\n var _iteratorNormalCompletion9 = true;\n var _didIteratorError9 = false;\n var _iteratorError9 = undefined;\n\n try {\n for (var _iterator9 = extension.types[Symbol.iterator](), _step9; !(_iteratorNormalCompletion9 = (_step9 = _iterator9.next()).done); _iteratorNormalCompletion9 = true) {\n var namedType = _step9.value;\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n possibleTypes.push(astBuilder.buildType(namedType));\n }\n } catch (err) {\n _didIteratorError9 = true;\n _iteratorError9 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion9 && _iterator9.return != null) {\n _iterator9.return();\n }\n } finally {\n if (_didIteratorError9) {\n throw _iteratorError9;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError8 = true;\n _iteratorError8 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion8 && _iterator8.return != null) {\n _iterator8.return();\n }\n } finally {\n if (_didIteratorError8) {\n throw _iteratorError8;\n }\n }\n }\n }\n\n return possibleTypes;\n }\n\n function extendImplementedInterfaces(type) {\n var interfaces = type.getInterfaces().map(extendNamedType); // If there are any extensions to the interfaces, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion10 = true;\n var _didIteratorError10 = false;\n var _iteratorError10 = undefined;\n\n try {\n for (var _iterator10 = extensions[Symbol.iterator](), _step10; !(_iteratorNormalCompletion10 = (_step10 = _iterator10.next()).done); _iteratorNormalCompletion10 = true) {\n var extension = _step10.value;\n var _iteratorNormalCompletion11 = true;\n var _didIteratorError11 = false;\n var _iteratorError11 = undefined;\n\n try {\n for (var _iterator11 = extension.interfaces[Symbol.iterator](), _step11; !(_iteratorNormalCompletion11 = (_step11 = _iterator11.next()).done); _iteratorNormalCompletion11 = true) {\n var namedType = _step11.value;\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n interfaces.push(astBuilder.buildType(namedType));\n }\n } catch (err) {\n _didIteratorError11 = true;\n _iteratorError11 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion11 && _iterator11.return != null) {\n _iterator11.return();\n }\n } finally {\n if (_didIteratorError11) {\n throw _iteratorError11;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError10 = true;\n _iteratorError10 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion10 && _iterator10.return != null) {\n _iterator10.return();\n }\n } finally {\n if (_didIteratorError10) {\n throw _iteratorError10;\n }\n }\n }\n }\n\n return interfaces;\n }\n\n function extendFieldMap(type) {\n var newFieldMap = (0, _mapValue.default)(type.getFields(), function (field) {\n return {\n description: field.description,\n deprecationReason: field.deprecationReason,\n type: extendType(field.type),\n args: extendArgs(field.args),\n astNode: field.astNode,\n resolve: field.resolve\n };\n }); // If there are any extensions to the fields, apply those here.\n\n var extensions = typeExtensionsMap[type.name];\n\n if (extensions) {\n var _iteratorNormalCompletion12 = true;\n var _didIteratorError12 = false;\n var _iteratorError12 = undefined;\n\n try {\n for (var _iterator12 = extensions[Symbol.iterator](), _step12; !(_iteratorNormalCompletion12 = (_step12 = _iterator12.next()).done); _iteratorNormalCompletion12 = true) {\n var extension = _step12.value;\n var _iteratorNormalCompletion13 = true;\n var _didIteratorError13 = false;\n var _iteratorError13 = undefined;\n\n try {\n for (var _iterator13 = extension.fields[Symbol.iterator](), _step13; !(_iteratorNormalCompletion13 = (_step13 = _iterator13.next()).done); _iteratorNormalCompletion13 = true) {\n var field = _step13.value;\n newFieldMap[field.name.value] = astBuilder.buildField(field);\n }\n } catch (err) {\n _didIteratorError13 = true;\n _iteratorError13 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion13 && _iterator13.return != null) {\n _iterator13.return();\n }\n } finally {\n if (_didIteratorError13) {\n throw _iteratorError13;\n }\n }\n }\n }\n } catch (err) {\n _didIteratorError12 = true;\n _iteratorError12 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion12 && _iterator12.return != null) {\n _iterator12.return();\n }\n } finally {\n if (_didIteratorError12) {\n throw _iteratorError12;\n }\n }\n }\n }\n\n return newFieldMap;\n }\n\n function extendType(typeDef) {\n if ((0, _definition.isListType)(typeDef)) {\n return (0, _definition.GraphQLList)(extendType(typeDef.ofType));\n }\n\n if ((0, _definition.isNonNullType)(typeDef)) {\n return (0, _definition.GraphQLNonNull)(extendType(typeDef.ofType));\n }\n\n return extendNamedType(typeDef);\n }\n}","title":""},{"docid":"d946c9dcdfd9f16cc0f280fcfd359a7b","score":"0.46540397","text":"function merge(a, b) {\n return keys(b).reduce((c, k) => {\n // no merge\n if (a[k] === b[k]) {\n return c;\n // deep merge\n } else if ((isPojo(a[k]) && isPojo(b[k])) || (isArray(a[k]) && isArray(b[k]))) {\n return assign(c, { [k]: merge(a[k], b[k]) });\n // override merge\n } else {\n return assign(c, { [k]: b[k] });\n }\n }, isArray(a) ? [...a] : { ...a });\n}","title":""},{"docid":"13447710907a7dcce4a1e5018287a271","score":"0.464966","text":"function extendSchema(schema, documentAST) {\n !(schema instanceof _schema.GraphQLSchema) ? (0, _invariant2.default)(0, 'Must provide valid GraphQLSchema') : void 0;\n\n !(documentAST && documentAST.kind === Kind.DOCUMENT) ? (0, _invariant2.default)(0, 'Must provide valid Document AST') : void 0;\n\n // Collect the type definitions and extensions found in the document.\n var typeDefinitionMap = Object.create(null);\n var typeExtensionsMap = Object.create(null);\n\n // New directives and types are separate because a directives and types can\n // have the same name. For example, a type named \"skip\".\n var directiveDefinitions = [];\n\n for (var i = 0; i < documentAST.definitions.length; i++) {\n var def = documentAST.definitions[i];\n switch (def.kind) {\n case Kind.OBJECT_TYPE_DEFINITION:\n case Kind.INTERFACE_TYPE_DEFINITION:\n case Kind.ENUM_TYPE_DEFINITION:\n case Kind.UNION_TYPE_DEFINITION:\n case Kind.SCALAR_TYPE_DEFINITION:\n case Kind.INPUT_OBJECT_TYPE_DEFINITION:\n // Sanity check that none of the defined types conflict with the\n // schema's existing types.\n var typeName = def.name.value;\n if (schema.getType(typeName)) {\n throw new _GraphQLError.GraphQLError('Type \"' + typeName + '\" already exists in the schema. It cannot also ' + 'be defined in this type definition.', [def]);\n }\n typeDefinitionMap[typeName] = def;\n break;\n case Kind.TYPE_EXTENSION_DEFINITION:\n // Sanity check that this type extension exists within the\n // schema's existing types.\n var extendedTypeName = def.definition.name.value;\n var existingType = schema.getType(extendedTypeName);\n if (!existingType) {\n throw new _GraphQLError.GraphQLError('Cannot extend type \"' + extendedTypeName + '\" because it does not ' + 'exist in the existing schema.', [def.definition]);\n }\n if (!(existingType instanceof _definition.GraphQLObjectType)) {\n throw new _GraphQLError.GraphQLError('Cannot extend non-object type \"' + extendedTypeName + '\".', [def.definition]);\n }\n var extensions = typeExtensionsMap[extendedTypeName];\n if (extensions) {\n extensions.push(def);\n } else {\n extensions = [def];\n }\n typeExtensionsMap[extendedTypeName] = extensions;\n break;\n case Kind.DIRECTIVE_DEFINITION:\n var directiveName = def.name.value;\n var existingDirective = schema.getDirective(directiveName);\n if (existingDirective) {\n throw new _GraphQLError.GraphQLError('Directive \"' + directiveName + '\" already exists in the schema. It ' + 'cannot be redefined.', [def]);\n }\n directiveDefinitions.push(def);\n break;\n }\n }\n\n // If this document contains no new types, extensions, or directives then\n // return the same unmodified GraphQLSchema instance.\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0) {\n return schema;\n }\n\n // A cache to use to store the actual GraphQLType definition objects by name.\n // Initialize to the GraphQL built in scalars and introspection types. All\n // functions below are inline so that this type def cache is within the scope\n // of the closure.\n var typeDefCache = {\n String: _scalars.GraphQLString,\n Int: _scalars.GraphQLInt,\n Float: _scalars.GraphQLFloat,\n Boolean: _scalars.GraphQLBoolean,\n ID: _scalars.GraphQLID,\n __Schema: _introspection.__Schema,\n __Directive: _introspection.__Directive,\n __DirectiveLocation: _introspection.__DirectiveLocation,\n __Type: _introspection.__Type,\n __Field: _introspection.__Field,\n __InputValue: _introspection.__InputValue,\n __EnumValue: _introspection.__EnumValue,\n __TypeKind: _introspection.__TypeKind\n };\n\n // Get the root Query, Mutation, and Subscription object types.\n var queryType = getTypeFromDef(schema.getQueryType());\n\n var existingMutationType = schema.getMutationType();\n var mutationType = existingMutationType ? getTypeFromDef(existingMutationType) : null;\n\n var existingSubscriptionType = schema.getSubscriptionType();\n var subscriptionType = existingSubscriptionType ? getTypeFromDef(existingSubscriptionType) : null;\n\n // Iterate through all types, getting the type definition for each, ensuring\n // that any type not directly referenced by a field will get created.\n var typeMap = schema.getTypeMap();\n var types = Object.keys(typeMap).map(function (typeName) {\n return getTypeFromDef(typeMap[typeName]);\n });\n\n // Do the same with new types, appending to the list of defined types.\n Object.keys(typeDefinitionMap).forEach(function (typeName) {\n types.push(getTypeFromAST(typeDefinitionMap[typeName]));\n });\n\n // Then produce and return a Schema with these types.\n return new _schema.GraphQLSchema({\n query: queryType,\n mutation: mutationType,\n subscription: subscriptionType,\n types: types,\n directives: getMergedDirectives(),\n astNode: schema.astNode\n });\n\n // Below are functions used for producing this schema that have closed over\n // this scope and have access to the schema, cache, and newly defined types.\n\n function getMergedDirectives() {\n var existingDirectives = schema.getDirectives();\n !existingDirectives ? (0, _invariant2.default)(0, 'schema must have default directives') : void 0;\n\n var newDirectives = directiveDefinitions.map(function (directiveNode) {\n return getDirective(directiveNode);\n });\n return existingDirectives.concat(newDirectives);\n }\n\n function getTypeFromDef(typeDef) {\n var type = _getNamedType(typeDef.name);\n !type ? (0, _invariant2.default)(0, 'Missing type from schema') : void 0;\n return type;\n }\n\n function getTypeFromAST(node) {\n var type = _getNamedType(node.name.value);\n if (!type) {\n throw new _GraphQLError.GraphQLError('Unknown type: \"' + node.name.value + '\". Ensure that this type exists ' + 'either in the original schema, or is added in a type definition.', [node]);\n }\n return type;\n }\n\n function getObjectTypeFromAST(node) {\n var type = getTypeFromAST(node);\n !(type instanceof _definition.GraphQLObjectType) ? (0, _invariant2.default)(0, 'Must be Object type.') : void 0;\n return type;\n }\n\n function getInterfaceTypeFromAST(node) {\n var type = getTypeFromAST(node);\n !(type instanceof _definition.GraphQLInterfaceType) ? (0, _invariant2.default)(0, 'Must be Interface type.') : void 0;\n return type;\n }\n\n function getInputTypeFromAST(node) {\n return (0, _definition.assertInputType)(getTypeFromAST(node));\n }\n\n function getOutputTypeFromAST(node) {\n return (0, _definition.assertOutputType)(getTypeFromAST(node));\n }\n\n // Given a name, returns a type from either the existing schema or an\n // added type.\n function _getNamedType(typeName) {\n var cachedTypeDef = typeDefCache[typeName];\n if (cachedTypeDef) {\n return cachedTypeDef;\n }\n\n var existingType = schema.getType(typeName);\n if (existingType) {\n var typeDef = extendType(existingType);\n typeDefCache[typeName] = typeDef;\n return typeDef;\n }\n\n var typeNode = typeDefinitionMap[typeName];\n if (typeNode) {\n var _typeDef = buildType(typeNode);\n typeDefCache[typeName] = _typeDef;\n return _typeDef;\n }\n }\n\n // Given a type's introspection result, construct the correct\n // GraphQLType instance.\n function extendType(type) {\n if (type instanceof _definition.GraphQLObjectType) {\n return extendObjectType(type);\n }\n if (type instanceof _definition.GraphQLInterfaceType) {\n return extendInterfaceType(type);\n }\n if (type instanceof _definition.GraphQLUnionType) {\n return extendUnionType(type);\n }\n return type;\n }\n\n function extendObjectType(type) {\n var name = type.name;\n var extensionASTNodes = type.extensionASTNodes;\n if (typeExtensionsMap[name]) {\n extensionASTNodes = extensionASTNodes.concat(typeExtensionsMap[name]);\n }\n\n return new _definition.GraphQLObjectType({\n name: name,\n description: type.description,\n interfaces: function interfaces() {\n return extendImplementedInterfaces(type);\n },\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n extensionASTNodes: extensionASTNodes,\n isTypeOf: type.isTypeOf\n });\n }\n\n function extendInterfaceType(type) {\n return new _definition.GraphQLInterfaceType({\n name: type.name,\n description: type.description,\n fields: function fields() {\n return extendFieldMap(type);\n },\n astNode: type.astNode,\n resolveType: type.resolveType\n });\n }\n\n function extendUnionType(type) {\n return new _definition.GraphQLUnionType({\n name: type.name,\n description: type.description,\n types: type.getTypes().map(getTypeFromDef),\n astNode: type.astNode,\n resolveType: type.resolveType\n });\n }\n\n function extendImplementedInterfaces(type) {\n var interfaces = type.getInterfaces().map(getTypeFromDef);\n\n // If there are any extensions to the interfaces, apply those here.\n var extensions = typeExtensionsMap[type.name];\n if (extensions) {\n extensions.forEach(function (extension) {\n extension.definition.interfaces.forEach(function (namedType) {\n var interfaceName = namedType.name.value;\n if (interfaces.some(function (def) {\n return def.name === interfaceName;\n })) {\n throw new _GraphQLError.GraphQLError('Type \"' + type.name + '\" already implements \"' + interfaceName + '\". ' + 'It cannot also be implemented in this type extension.', [namedType]);\n }\n interfaces.push(getInterfaceTypeFromAST(namedType));\n });\n });\n }\n\n return interfaces;\n }\n\n function extendFieldMap(type) {\n var newFieldMap = Object.create(null);\n var oldFieldMap = type.getFields();\n Object.keys(oldFieldMap).forEach(function (fieldName) {\n var field = oldFieldMap[fieldName];\n newFieldMap[fieldName] = {\n description: field.description,\n deprecationReason: field.deprecationReason,\n type: extendFieldType(field.type),\n args: (0, _keyMap2.default)(field.args, function (arg) {\n return arg.name;\n }),\n astNode: field.astNode,\n resolve: field.resolve\n };\n });\n\n // If there are any extensions to the fields, apply those here.\n var extensions = typeExtensionsMap[type.name];\n if (extensions) {\n extensions.forEach(function (extension) {\n extension.definition.fields.forEach(function (field) {\n var fieldName = field.name.value;\n if (oldFieldMap[fieldName]) {\n throw new _GraphQLError.GraphQLError('Field \"' + type.name + '.' + fieldName + '\" already exists in the ' + 'schema. It cannot also be defined in this type extension.', [field]);\n }\n newFieldMap[fieldName] = {\n description: (0, _buildASTSchema.getDescription)(field),\n type: buildOutputFieldType(field.type),\n args: buildInputValues(field.arguments),\n deprecationReason: (0, _buildASTSchema.getDeprecationReason)(field),\n astNode: field\n };\n });\n });\n }\n\n return newFieldMap;\n }\n\n function extendFieldType(typeDef) {\n if (typeDef instanceof _definition.GraphQLList) {\n return new _definition.GraphQLList(extendFieldType(typeDef.ofType));\n }\n if (typeDef instanceof _definition.GraphQLNonNull) {\n return new _definition.GraphQLNonNull(extendFieldType(typeDef.ofType));\n }\n return getTypeFromDef(typeDef);\n }\n\n function buildType(typeNode) {\n switch (typeNode.kind) {\n case Kind.OBJECT_TYPE_DEFINITION:\n return buildObjectType(typeNode);\n case Kind.INTERFACE_TYPE_DEFINITION:\n return buildInterfaceType(typeNode);\n case Kind.UNION_TYPE_DEFINITION:\n return buildUnionType(typeNode);\n case Kind.SCALAR_TYPE_DEFINITION:\n return buildScalarType(typeNode);\n case Kind.ENUM_TYPE_DEFINITION:\n return buildEnumType(typeNode);\n case Kind.INPUT_OBJECT_TYPE_DEFINITION:\n return buildInputObjectType(typeNode);\n }\n throw new TypeError('Unknown type kind ' + typeNode.kind);\n }\n\n function buildObjectType(typeNode) {\n return new _definition.GraphQLObjectType({\n name: typeNode.name.value,\n description: (0, _buildASTSchema.getDescription)(typeNode),\n interfaces: function interfaces() {\n return buildImplementedInterfaces(typeNode);\n },\n fields: function fields() {\n return buildFieldMap(typeNode);\n },\n astNode: typeNode\n });\n }\n\n function buildInterfaceType(typeNode) {\n return new _definition.GraphQLInterfaceType({\n name: typeNode.name.value,\n description: (0, _buildASTSchema.getDescription)(typeNode),\n fields: function fields() {\n return buildFieldMap(typeNode);\n },\n astNode: typeNode,\n resolveType: cannotExecuteExtendedSchema\n });\n }\n\n function buildUnionType(typeNode) {\n return new _definition.GraphQLUnionType({\n name: typeNode.name.value,\n description: (0, _buildASTSchema.getDescription)(typeNode),\n types: typeNode.types.map(getObjectTypeFromAST),\n astNode: typeNode,\n resolveType: cannotExecuteExtendedSchema\n });\n }\n\n function buildScalarType(typeNode) {\n return new _definition.GraphQLScalarType({\n name: typeNode.name.value,\n description: (0, _buildASTSchema.getDescription)(typeNode),\n astNode: typeNode,\n serialize: function serialize(id) {\n return id;\n },\n // Note: validation calls the parse functions to determine if a\n // literal value is correct. Returning null would cause use of custom\n // scalars to always fail validation. Returning false causes them to\n // always pass validation.\n parseValue: function parseValue() {\n return false;\n },\n parseLiteral: function parseLiteral() {\n return false;\n }\n });\n }\n\n function buildEnumType(typeNode) {\n return new _definition.GraphQLEnumType({\n name: typeNode.name.value,\n description: (0, _buildASTSchema.getDescription)(typeNode),\n values: (0, _keyValMap2.default)(typeNode.values, function (enumValue) {\n return enumValue.name.value;\n }, function (enumValue) {\n return {\n description: (0, _buildASTSchema.getDescription)(enumValue),\n deprecationReason: (0, _buildASTSchema.getDeprecationReason)(enumValue),\n astNode: enumValue\n };\n }),\n astNode: typeNode\n });\n }\n\n function buildInputObjectType(typeNode) {\n return new _definition.GraphQLInputObjectType({\n name: typeNode.name.value,\n description: (0, _buildASTSchema.getDescription)(typeNode),\n fields: function fields() {\n return buildInputValues(typeNode.fields);\n },\n astNode: typeNode\n });\n }\n\n function getDirective(directiveNode) {\n return new _directives.GraphQLDirective({\n name: directiveNode.name.value,\n description: (0, _buildASTSchema.getDescription)(directiveNode),\n locations: directiveNode.locations.map(function (node) {\n return node.value;\n }),\n args: directiveNode.arguments && buildInputValues(directiveNode.arguments),\n astNode: directiveNode\n });\n }\n\n function buildImplementedInterfaces(typeNode) {\n return typeNode.interfaces && typeNode.interfaces.map(getInterfaceTypeFromAST);\n }\n\n function buildFieldMap(typeNode) {\n return (0, _keyValMap2.default)(typeNode.fields, function (field) {\n return field.name.value;\n }, function (field) {\n return {\n type: buildOutputFieldType(field.type),\n description: (0, _buildASTSchema.getDescription)(field),\n args: buildInputValues(field.arguments),\n deprecationReason: (0, _buildASTSchema.getDeprecationReason)(field),\n astNode: field\n };\n });\n }\n\n function buildInputValues(values) {\n return (0, _keyValMap2.default)(values, function (value) {\n return value.name.value;\n }, function (value) {\n var type = buildInputFieldType(value.type);\n return {\n type: type,\n description: (0, _buildASTSchema.getDescription)(value),\n defaultValue: (0, _valueFromAST.valueFromAST)(value.defaultValue, type),\n astNode: value\n };\n });\n }\n\n function buildInputFieldType(typeNode) {\n if (typeNode.kind === Kind.LIST_TYPE) {\n return new _definition.GraphQLList(buildInputFieldType(typeNode.type));\n }\n if (typeNode.kind === Kind.NON_NULL_TYPE) {\n var nullableType = buildInputFieldType(typeNode.type);\n !!(nullableType instanceof _definition.GraphQLNonNull) ? (0, _invariant2.default)(0, 'Must be nullable') : void 0;\n return new _definition.GraphQLNonNull(nullableType);\n }\n return getInputTypeFromAST(typeNode);\n }\n\n function buildOutputFieldType(typeNode) {\n if (typeNode.kind === Kind.LIST_TYPE) {\n return new _definition.GraphQLList(buildOutputFieldType(typeNode.type));\n }\n if (typeNode.kind === Kind.NON_NULL_TYPE) {\n var nullableType = buildOutputFieldType(typeNode.type);\n !!(nullableType instanceof _definition.GraphQLNonNull) ? (0, _invariant2.default)(0, 'Must be nullable') : void 0;\n return new _definition.GraphQLNonNull(nullableType);\n }\n return getOutputTypeFromAST(typeNode);\n }\n}","title":""},{"docid":"aa4d2ca9b14e4adefe2392b4afaebf11","score":"0.46334943","text":"function deepMergeStyles(dest, src) {\n\t Object.keys(src).forEach(function (expr) {\n\t dest[expr] = dest[expr] || {};\n\t Object.keys(src[expr]).forEach(function (type) {\n\t dest[expr][type] = dest[expr][type] || {};\n\t Object.assign(dest[expr][type], src[expr][type]);\n\t });\n\t });\n\t}","title":""},{"docid":"436fe8f32b7038d69b8eb777a7260354","score":"0.46265915","text":"function getMergedDirectives() {\n\t var existingDirectives = schema.getDirectives();\n\t (0, _invariant2.default)(existingDirectives, 'schema must have default directives');\n\n\t var newDirectives = directiveDefinitions.map(function (directiveNode) {\n\t return getDirective(directiveNode);\n\t });\n\t return existingDirectives.concat(newDirectives);\n\t }","title":""},{"docid":"be4e74639a893c59321c18a68447b8c2","score":"0.4625794","text":"function getMergedDirectives() {\n var existingDirectives = schema.getDirectives();\n !existingDirectives ? (0, _invariant2.default)(0, 'schema must have default directives') : void 0;\n\n var newDirectives = directiveDefinitions.map(function (directiveNode) {\n return getDirective(directiveNode);\n });\n return existingDirectives.concat(newDirectives);\n }","title":""},{"docid":"1d6c33a1ec0a98055b63ee3a883bfcb2","score":"0.461278","text":"function merge_databases(db_main, db_sub, server) {\r\n let keys = Object.keys(db_sub);\r\n let mainKeys = Object.keys(db_main).map((d) => { return +d; }).sort((a,b) => { return a-b; });\r\n for (var item of keys) { //iterate through everything in object\r\n var id = +item;\r\n // if (db_main[item] !== undefined) { //exists, so just add date add time\r\n if(_.sortedIndexOf(mainKeys,id) > -1){\r\n if (db_main[item].server.indexOf(server) == -1) {\r\n db_main[item].server.push(server);\r\n }\r\n } else { //doesn't exist, so add it\r\n db_main[item] = db_sub[item];\r\n db_main[item].server = [server];\r\n }\r\n delete db_sub[item];\r\n }\r\n }","title":""},{"docid":"dd2ddd1f5e64383656a98d0068cf71af","score":"0.46059272","text":"function loadSchemaSync(schemaPointers, options) {\n const sources = loadTypedefsSync(schemaPointers, {\n filterKinds: OPERATION_KINDS,\n ...options,\n });\n const { schemas, typeDefs } = collectSchemasAndTypeDefs(sources);\n const mergeSchemasOptions = {\n schemas,\n typeDefs,\n ...options,\n };\n const schema = merge.mergeSchemas(mergeSchemasOptions);\n if (options === null || options === void 0 ? void 0 : options.includeSources) {\n includeSources(schema, sources);\n }\n return schema;\n}","title":""},{"docid":"771cc6810485d836f7e00caee01e1683","score":"0.4593318","text":"function merge(a, b) {\n\n if (b) {\n for (var key in b) {\n // avoid immediately resolving b's contents\n a.__defineGetter__(key, function() {\n return b[key];\n });\n }\n }\n return a;\n }","title":""},{"docid":"72fe443bddc2be49a2daab8633cac8e5","score":"0.45898345","text":"function merge(obj1, obj2) {\n\t\tfor (var attrname in obj2) { obj1[attrname] = obj2[attrname]; }\n\t\treturn obj1;\n\t}","title":""},{"docid":"5d06bcd308678f9b86327602077b11c6","score":"0.45852926","text":"function addType (instanceType, schemaType) {\n if (schemaType === undefined) {\n // if we are adding a type to an empty schema, its type will be undefined\n return instanceType;\n }\n else if (Array.isArray(schemaType)) {\n return schemaType.concat(instanceType);\n }\n else {\n return [schemaType, instanceType];\n }\n}","title":""},{"docid":"ba08cfe751caa54f62682a5d0500260f","score":"0.45841995","text":"function objMerge(a, b) {\n Object.keys(b).forEach(function (k) {\n a[k] = b[k];\n });\n return a;\n}","title":""},{"docid":"e2265d0efa67c043dccce751c2269201","score":"0.45837656","text":"function merge(obj1, obj2) {\n var obj3 = {};\n\n mergeInto(obj3, obj1);\n mergeInto(obj3, obj2);\n\n return obj3;\n}","title":""},{"docid":"ded7c4d7bb96cbb793e8acda35df31a5","score":"0.4583331","text":"function combineObjectsAndAddAttribute(obj1,obj2) {}","title":""},{"docid":"170f694690bcf059f9deff26af2b6d93","score":"0.4578722","text":"function mergeGedcomx(gx1, gx2) {\n function checkForIdCollisions(listName, list1, list2) {\n let ids1 = new Set();\n for (let element of list1) {\n if (element.id) {\n if (ids1.has(element.id)) {\n throw new Error(\"Odd. Two \" + listName + \" with same ID in gedcomx1\");\n }\n ids1.add(element.id);\n }\n }\n for (let element of list2) {\n if (element.id && ids1.has(element.id)) {\n // If you hit this error, then take the time to write the code so that when merging two GedcomX objects,\n // we make sure all of the ids of all kinds are unique, and that all of the references to them use the\n // new IDs. (i.e., relationship.person1/2=>new person IDs; source[references] => new sourceDescription ids; place references=>new place description ids;\n // and attributions => new agent Ids.\n throw new Error(\"Error: Same id '\" + element.id + \"' in \" + listName + \" list in Gedcomx1 and Gedcomx2. Fancier code needed...\");\n }\n }\n }\n\n function mergeArrays(listName) {\n let list1 = gx1[listName];\n let list2 = gx2[listName];\n if (list2 && list2.length > 0) {\n if (!list1 || list1.length === 0) {\n gx1[listName] = gx2[listName];\n }\n else {\n checkForIdCollisions(listName, list1, list2);\n list1.push(...list2);\n }\n }\n }\n\n if (!gx2) {\n return; // nothing to do\n }\n for (let listName of [\"persons\", \"relationships\", \"sourceDescriptions\", \"agents\", \"events\", \"places\", \"documents\", \"collections\", \"fields\", \"recordDescriptors\"]) {\n mergeArrays(listName);\n }\n}","title":""},{"docid":"5104b066a47b72ed352806ab8eeeb31f","score":"0.45760557","text":"function getMergedDirectives() {\n\t var existingDirectives = schema.getDirectives();\n\t !existingDirectives ? invariant(0, 'schema must have default directives') : void 0;\n\n\t var newDirectives = directiveDefinitions.map(function (directiveNode) {\n\t return definitionBuilder.buildDirective(directiveNode);\n\t });\n\t return existingDirectives.concat(newDirectives);\n\t }","title":""},{"docid":"51d029462183258601b3952cbefd3584","score":"0.4571091","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeA)) {\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isSubType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isSubType(typeA, typeB);\n }\n\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isSubType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n}","title":""},{"docid":"51d029462183258601b3952cbefd3584","score":"0.4571091","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeA)) {\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isSubType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isSubType(typeA, typeB);\n }\n\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isSubType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n}","title":""},{"docid":"ecb5f59f7d5b9a1e3946ebf8197bdbe6","score":"0.45661542","text":"getAdditionalSchemas() {\n const additionalSchemas = this.schemas.join('\\n');\n return additionalSchemas;\n }","title":""},{"docid":"3a1d36b5e58a7eccebd34e3ac90a72e5","score":"0.45627776","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeA)) {\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isPossibleType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isPossibleType(typeA, typeB);\n }\n\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isPossibleType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n}","title":""},{"docid":"a819c40db84ba92cfcae7070a8ce97c5","score":"0.45545125","text":"merge(...sources) {\n for (const source of sources) {\n for (let k in source) {\n let vs = source[k],\n vt = this[k];\n if (Object(vs) == vs && Object(vt) === vt) {\n this[k] = this.merge(vt, vs);\n continue;\n }\n this[k] = source[k];\n }\n }\n return this;\n }","title":""},{"docid":"af6bd185b786e537d855db577db0fd7f","score":"0.4545793","text":"merge(...sources) {\n for (const source of sources) {\n for (let k in source) {\n let vs = source[k],\n vt = this[k];\n if (Object(vs) === vs && Object(vt) === vt) {\n this[k] = this.mergeHelp(vt, vs);\n continue;\n }\n this[k] = source[k];\n }\n }\n return this;\n }","title":""},{"docid":"0e1076527bf4f22ead71fba045c22bde","score":"0.45432764","text":"function extend(first, second) {\n const result = {};\n for (const id in second) {\n if (hasOwnProperty.call(second, id)) {\n result[id] = second[id];\n }\n }\n for (const id in first) {\n if (hasOwnProperty.call(first, id)) {\n result[id] = first[id];\n }\n }\n return result;\n }","title":""},{"docid":"4a4eb66e5e3cd3c827dfffaf124abf77","score":"0.45281678","text":"function merge(target, source) {\n // base props\n target = Object.assign( {}, target, _.pick(source, ['devtool', 'mode', 'target']) )\n\n target.entry = Object.assign({}, target.entry, source.entry)\n target.output = Object.assign({}, target.output, source.output)\n target.plugins = target.plugins.concat( source.plugins )\n\n\n return target\n}","title":""},{"docid":"55cbef2e70ad9def21ec7f0d8cf27a73","score":"0.45250246","text":"function externalApi(input1orig, input2orig, originalOpts) {\n if (!arguments.length) {\n throw new TypeError(\"object-merge-advanced/mergeAdvanced(): [THROW_ID_01] Both inputs are missing\");\n }\n // notice we have first argument tracking the current path, which is not\n // exposed to the external API.\n return mergeAdvanced({ key: null, path: \"\", type: [getType(input1orig), getType(input2orig)] }, input1orig, input2orig, originalOpts);\n}","title":""},{"docid":"bce4933ffd4406c5e43e176fa5789c5f","score":"0.45248154","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeA)) {\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isSubType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isSubType(typeA, typeB);\n }\n\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\"isAbstractType\"])(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isSubType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n }","title":""},{"docid":"40b8e1de3f1cb2e21d476f27f8d5aa6a","score":"0.45201898","text":"function addSchemaToProduct(ProductQuery, SchemaName, SchemaId){ //Product query should usualyl be the Product Id, SchemaName = Model name, SchemaId = individual schema id from our Helpers dbs\n let collectionObj = mongoose.model('Product');\n let schemaObj = mongoose.model(SchemaName);\n let SchemaKey = Object.keys(SchemaId)[0]\n let ObjDestination = SchemaName.toLowerCase()+'s'\n return new Promise(function(resolve, reject) {\n schemaObj.findOne(SchemaId)\n .then((Schema)=>{\n let ProductObj = Schema\n //console.log('Schema Id added:',Schema._id)\n collectionObj.findOne(ProductQuery)\n .then((Product)=>{\n Product[ObjDestination].push(Schema); return Product\n })\n .then((Product)=>{Product.save();console.log('Adding '+SchemaName+' to Product with Id:',Product._id);return Product})\n .then((Product)=>{resolve(Product)}) //injects into the Product\n })\n })}","title":""},{"docid":"7ec0a63cab33a8f714d2bdc6186f5092","score":"0.45150247","text":"function merge(a, b) {\n var merged;\n if (a instanceof immutable.Sequence) {\n // Use merge to create another immutable seq\n merged = a.merge(b);\n } else if (Array.isArray(a)) { // Object.create(Array.prototype) doesn't work :'(\n merged = Array.prototype.slice.call(a);\n Sequence(b).forEach(function(v, k) { merged[k] = v; });\n } else {\n var proto = Object.getPrototypeOf(a);\n merged = Object.create(proto);\n Object.keys(a).forEach(function(k) { merged[k] = a[k]; });\n Sequence(b).forEach(function(v, k) { merged[k] = v; });\n }\n return merged;\n}","title":""},{"docid":"fb0d78eb3d139306b15db0e2d28224c0","score":"0.4514686","text":"function doMerge(group1, group2) {\n let merged = _.clone(group1);\n Object.keys(group2).forEach(nodeType => {\n if(merged[nodeType]) {\n merged[nodeType] = doSetMerge(merged[nodeType],group2[nodeType]);\n }\n else {\n merged[nodeType] = group2[nodeType]\n }\n });\n return merged;\n }","title":""},{"docid":"a34d0c23debf015dde749c3fdbfb7048","score":"0.45079502","text":"function cloneSchema(schema) {\n // TODO(ejoebstl): It would be better to have a concrete implementation for\n // each SDL object and require a clone method on interface level.\n var copy = __assign({}, schema);\n cloneComments(copy, schema);\n copy.types = [];\n for (var _i = 0, _a = schema.types; _i < _a.length; _i++) {\n var type = _a[_i];\n copy.types.push(cloneType(type));\n }\n // Re-Assign type pointer for relations\n for (var _b = 0, _c = copy.types; _b < _c.length; _b++) {\n var type = _c[_b];\n var _loop_1 = function (field) {\n if (typeof field.type !== 'string') {\n var typeName_1 = field.type.name;\n var fieldType = copy.types.filter(function (x) { return x.name === typeName_1; })[0];\n console.assert(fieldType !== undefined); // This case should never happen\n field.type = fieldType;\n }\n };\n for (var _d = 0, _e = type.fields; _d < _e.length; _d++) {\n var field = _e[_d];\n _loop_1(field);\n }\n }\n // Re-Assign field pointer for indices\n for (var _f = 0, _g = copy.types; _f < _g.length; _f++) {\n var type = _g[_f];\n if (type.indices !== undefined) {\n for (var _h = 0, _j = type.indices; _h < _j.length; _h++) {\n var index = _j[_h];\n var _loop_2 = function (i) {\n var fieldName = index.fields[i].name;\n var field = type.fields.filter(function (x) { return x.name === fieldName; })[0];\n console.assert(field !== undefined); // This case should never happen\n index.fields[i] = field;\n };\n // We need an index for setting the element\n // tslint:disable-next-line:prefer-for-of\n for (var i = 0; i < index.fields.length; i++) {\n _loop_2(i);\n }\n }\n }\n }\n return copy;\n}","title":""},{"docid":"161b6a2b04bc61cb47cfe0eda932e37c","score":"0.4506351","text":"function mergeConfig(c1, c2) {\n if (!c2) {\n return c1;\n }\n return __assign(__assign(__assign({}, (c1 || {})), (c2 || {})), Object.keys(c1).reduce(function (all, k) {\n all[k] = __assign(__assign({}, c1[k]), (c2[k] || {}));\n return all;\n }, {}));\n }","title":""},{"docid":"2a1baea2324f3c051870041dc95efc0b","score":"0.45049804","text":"function _extend() {\n // Get arguments\n var objects = arguments;\n\n // Bail if nothing to merge\n if (!objects.length) {\n return;\n }\n\n // Return first if specified but nothing to merge\n if (objects.lenth == 1) {\n return objects[0];\n }\n\n // First object is the destination\n var destination = Array.prototype.shift.call(objects),\n length = objects.length;\n\n // Loop through all objects to merge\n for (var i = 0; i < length; i++) {\n var source = objects[i];\n\n for (var property in source) {\n if (source[property] && source[property].constructor && source[property].constructor === Object) {\n destination[property] = destination[property] || {};\n _extend(destination[property], source[property]);\n }\n else {\n destination[property] = source[property];\n }\n }\n }\n\n return destination;\n }","title":""},{"docid":"f3feec1217c490c0a57a6cfc154b95da","score":"0.4496471","text":"function mergeOptions(options1, options2) {\n options1 = options1 || {}\n options2 = options2 || {}\n const result = { ...options1, ...options2 }\n Object.keys(result).forEach(key => {\n if (Array.isArray(options1[key]) && Array.isArray(options2[key])) {\n result[key] = mergeArrays(options1[key], options2[key])\n }\n })\n return result\n}","title":""},{"docid":"8c5f4c619e72861425da2a49facd1e17","score":"0.44958407","text":"function extendSchema(schema, documentAST, options) {\n Object(_type_schema__WEBPACK_IMPORTED_MODULE_8__[\"assertSchema\"])(schema);\n !(documentAST && documentAST.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[\"Kind\"].DOCUMENT) ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(0, 'Must provide valid Document AST') : void 0;\n\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\n Object(_validation_validate__WEBPACK_IMPORTED_MODULE_7__[\"assertValidSDLExtension\"])(documentAST, schema);\n } // Collect the type definitions and extensions found in the document.\n\n\n var typeDefs = [];\n var typeExtsMap = Object.create(null); // New directives and types are separate because a directives and types can\n // have the same name. For example, a type named \"skip\".\n\n var directiveDefs = [];\n var schemaDef; // Schema extensions are collected which may add additional operation types.\n\n var schemaExts = [];\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = documentAST.definitions[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var def = _step.value;\n\n if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[\"Kind\"].SCHEMA_DEFINITION) {\n schemaDef = def;\n } else if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[\"Kind\"].SCHEMA_EXTENSION) {\n schemaExts.push(def);\n } else if (Object(_language_predicates__WEBPACK_IMPORTED_MODULE_14__[\"isTypeDefinitionNode\"])(def)) {\n typeDefs.push(def);\n } else if (Object(_language_predicates__WEBPACK_IMPORTED_MODULE_14__[\"isTypeExtensionNode\"])(def)) {\n var extendedTypeName = def.name.value;\n var existingTypeExts = typeExtsMap[extendedTypeName];\n typeExtsMap[extendedTypeName] = existingTypeExts ? existingTypeExts.concat([def]) : [def];\n } else if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[\"Kind\"].DIRECTIVE_DEFINITION) {\n directiveDefs.push(def);\n }\n } // If this document contains no new types, extensions, or directives then\n // return the same unmodified GraphQLSchema instance.\n\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return != null) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n\n if (Object.keys(typeExtsMap).length === 0 && typeDefs.length === 0 && directiveDefs.length === 0 && schemaExts.length === 0 && !schemaDef) {\n return schema;\n }\n\n var schemaConfig = schema.toConfig();\n var astBuilder = new _buildASTSchema__WEBPACK_IMPORTED_MODULE_6__[\"ASTDefinitionBuilder\"](options, function (typeName) {\n var type = typeMap[typeName];\n !type ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(0, \"Unknown type: \\\"\".concat(typeName, \"\\\".\")) : void 0;\n return type;\n });\n var typeMap = Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\"default\"])(typeDefs, function (node) {\n return node.name.value;\n }, function (node) {\n return astBuilder.buildType(node);\n });\n var _iteratorNormalCompletion2 = true;\n var _didIteratorError2 = false;\n var _iteratorError2 = undefined;\n\n try {\n for (var _iterator2 = schemaConfig.types[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n var existingType = _step2.value;\n typeMap[existingType.name] = extendNamedType(existingType);\n } // Get the extended root operation types.\n\n } catch (err) {\n _didIteratorError2 = true;\n _iteratorError2 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\n _iterator2.return();\n }\n } finally {\n if (_didIteratorError2) {\n throw _iteratorError2;\n }\n }\n }\n\n var operationTypes = {\n query: schemaConfig.query && schemaConfig.query.name,\n mutation: schemaConfig.mutation && schemaConfig.mutation.name,\n subscription: schemaConfig.subscription && schemaConfig.subscription.name\n };\n\n if (schemaDef) {\n var _iteratorNormalCompletion3 = true;\n var _didIteratorError3 = false;\n var _iteratorError3 = undefined;\n\n try {\n for (var _iterator3 = schemaDef.operationTypes[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\n var _ref2 = _step3.value;\n var operation = _ref2.operation;\n var type = _ref2.type;\n operationTypes[operation] = type.name.value;\n }\n } catch (err) {\n _didIteratorError3 = true;\n _iteratorError3 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\n _iterator3.return();\n }\n } finally {\n if (_didIteratorError3) {\n throw _iteratorError3;\n }\n }\n }\n } // Then, incorporate schema definition and all schema extensions.\n\n\n for (var _i = 0, _schemaExts = schemaExts; _i < _schemaExts.length; _i++) {\n var schemaExt = _schemaExts[_i];\n\n if (schemaExt.operationTypes) {\n var _iteratorNormalCompletion4 = true;\n var _didIteratorError4 = false;\n var _iteratorError4 = undefined;\n\n try {\n for (var _iterator4 = schemaExt.operationTypes[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\n var _ref4 = _step4.value;\n var _operation = _ref4.operation;\n var _type = _ref4.type;\n operationTypes[_operation] = _type.name.value;\n }\n } catch (err) {\n _didIteratorError4 = true;\n _iteratorError4 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\n _iterator4.return();\n }\n } finally {\n if (_didIteratorError4) {\n throw _iteratorError4;\n }\n }\n }\n }\n } // Support both original legacy names and extended legacy names.\n\n\n var allowedLegacyNames = schemaConfig.allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\n\n return new _type_schema__WEBPACK_IMPORTED_MODULE_8__[\"GraphQLSchema\"]({\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n query: getMaybeTypeByName(operationTypes.query),\n mutation: getMaybeTypeByName(operationTypes.mutation),\n subscription: getMaybeTypeByName(operationTypes.subscription),\n types: Object(_polyfills_objectValues__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(typeMap),\n directives: getMergedDirectives(),\n astNode: schemaDef || schemaConfig.astNode,\n extensionASTNodes: schemaConfig.extensionASTNodes.concat(schemaExts),\n allowedLegacyNames: allowedLegacyNames\n }); // Below are functions used for producing this schema that have closed over\n // this scope and have access to the schema, cache, and newly defined types.\n\n function replaceType(type) {\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\"isListType\"])(type)) {\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\"GraphQLList\"](replaceType(type.ofType));\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\"isNonNullType\"])(type)) {\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\"GraphQLNonNull\"](replaceType(type.ofType));\n }\n\n return replaceNamedType(type);\n }\n\n function replaceNamedType(type) {\n return typeMap[type.name];\n }\n\n function getMaybeTypeByName(typeName) {\n return typeName ? typeMap[typeName] : null;\n }\n\n function getMergedDirectives() {\n var existingDirectives = schema.getDirectives().map(extendDirective);\n !existingDirectives ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(0, 'schema must have default directives') : void 0;\n return existingDirectives.concat(directiveDefs.map(function (node) {\n return astBuilder.buildDirective(node);\n }));\n }\n\n function extendNamedType(type) {\n if (Object(_type_introspection__WEBPACK_IMPORTED_MODULE_9__[\"isIntrospectionType\"])(type) || Object(_type_scalars__WEBPACK_IMPORTED_MODULE_10__[\"isSpecifiedScalarType\"])(type)) {\n // Builtin types are not extended.\n return type;\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\"isScalarType\"])(type)) {\n return extendScalarType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\"isObjectType\"])(type)) {\n return extendObjectType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\"isInterfaceType\"])(type)) {\n return extendInterfaceType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\"isUnionType\"])(type)) {\n return extendUnionType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\"isEnumType\"])(type)) {\n return extendEnumType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\"isInputObjectType\"])(type)) {\n return extendInputObjectType(type);\n } // Not reachable. All possible types have been considered.\n\n /* istanbul ignore next */\n\n\n throw new Error(\"Unexpected type: \\\"\".concat(Object(_jsutils_inspect__WEBPACK_IMPORTED_MODULE_2__[\"default\"])(type), \"\\\".\"));\n }\n\n function extendDirective(directive) {\n var config = directive.toConfig();\n return new _type_directives__WEBPACK_IMPORTED_MODULE_12__[\"GraphQLDirective\"](_objectSpread({}, config, {\n args: Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(config.args, extendArg)\n }));\n }\n\n function extendInputObjectType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(extensions, function (node) {\n return node.fields || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\"GraphQLInputObjectType\"](_objectSpread({}, config, {\n fields: function fields() {\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(config.fields, function (field) {\n return _objectSpread({}, field, {\n type: replaceType(field.type)\n });\n }), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\"default\"])(fieldNodes, function (field) {\n return field.name.value;\n }, function (field) {\n return astBuilder.buildInputField(field);\n }));\n },\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendEnumType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[type.name] || [];\n var valueNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(extensions, function (node) {\n return node.values || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\"GraphQLEnumType\"](_objectSpread({}, config, {\n values: _objectSpread({}, config.values, Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\"default\"])(valueNodes, function (value) {\n return value.name.value;\n }, function (value) {\n return astBuilder.buildEnumValue(value);\n })),\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendScalarType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\"GraphQLScalarType\"](_objectSpread({}, config, {\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendObjectType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n var interfaceNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(extensions, function (node) {\n return node.interfaces || [];\n });\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(extensions, function (node) {\n return node.fields || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\"GraphQLObjectType\"](_objectSpread({}, config, {\n interfaces: function interfaces() {\n return [].concat(type.getInterfaces().map(replaceNamedType), interfaceNodes.map(function (node) {\n return astBuilder.getNamedType(node);\n }));\n },\n fields: function fields() {\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(config.fields, extendField), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\"default\"])(fieldNodes, function (node) {\n return node.name.value;\n }, function (node) {\n return astBuilder.buildField(node);\n }));\n },\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendInterfaceType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(extensions, function (node) {\n return node.fields || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\"GraphQLInterfaceType\"](_objectSpread({}, config, {\n fields: function fields() {\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(config.fields, extendField), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\"default\"])(fieldNodes, function (node) {\n return node.name.value;\n }, function (node) {\n return astBuilder.buildField(node);\n }));\n },\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendUnionType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n var typeNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(extensions, function (node) {\n return node.types || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\"GraphQLUnionType\"](_objectSpread({}, config, {\n types: function types() {\n return [].concat(type.getTypes().map(replaceNamedType), typeNodes.map(function (node) {\n return astBuilder.getNamedType(node);\n }));\n },\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendField(field) {\n return _objectSpread({}, field, {\n type: replaceType(field.type),\n args: Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(field.args, extendArg)\n });\n }\n\n function extendArg(arg) {\n return _objectSpread({}, arg, {\n type: replaceType(arg.type)\n });\n }\n}","title":""},{"docid":"74f12cc30c357fc37ca6f49ad891d272","score":"0.4484635","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if (Object(__WEBPACK_IMPORTED_MODULE_0__type_definition__[\"n\" /* isAbstractType */])(typeA)) {\n if (Object(__WEBPACK_IMPORTED_MODULE_0__type_definition__[\"n\" /* isAbstractType */])(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isPossibleType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isPossibleType(typeA, typeB);\n }\n\n if (Object(__WEBPACK_IMPORTED_MODULE_0__type_definition__[\"n\" /* isAbstractType */])(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isPossibleType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n}","title":""},{"docid":"3243f18cccea52ab99ec741aeebf525d","score":"0.44803166","text":"function merge(objA, objB) {\n return Object.assign(objA, objB);\n }","title":""},{"docid":"b6743daf49facdbc4b5480ee711bd44f","score":"0.44745222","text":"function merge(object1, object2) {\r\n return Object.assign({}, object1, object2);\r\n}","title":""},{"docid":"aee1b4167376a5b8ffdf8f3958179094","score":"0.44701302","text":"function importDefinition() {\n if (isGraphQL) {\n updateGraphQLSchema();\n } else if (isSOAP) {\n updateWSDL();\n } else {\n updateOASDefinition();\n }\n }","title":""},{"docid":"2b6faaf4face81c49d7eb56c598a63bc","score":"0.4468192","text":"reset() { Object.assign(this, this.getSchema()) }","title":""},{"docid":"dda7d5d3093082623ec81c0a3563a5e2","score":"0.4468166","text":"function mergeCompletionObjects(first, second) {\n return _.mergeWith({}, first, second, function customizer(objValue, srcValue) {\n if (_.isArray(objValue)) {\n return objValue.concat(srcValue);\n }\n });\n}","title":""},{"docid":"7583f2fa79bcbab3735370bb2ab1bc1a","score":"0.44674328","text":"function merge(objA, objB) {\n return Object.assign(objA, objB);\n}","title":""},{"docid":"81a915e6b6324e57c7d6f5c674b40fff","score":"0.44662043","text":"function mergeInto(obj1, obj2) {\n for (var attrname in obj2) {\n obj1[attrname] = obj2[attrname];\n }\n\n return obj1;\n}","title":""},{"docid":"ae7cf8f295363dab85feee5983ffa1df","score":"0.44647837","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if ((0, _definition.isAbstractType)(typeA)) {\n if ((0, _definition.isAbstractType)(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isSubType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isSubType(typeA, typeB);\n }\n\n if ((0, _definition.isAbstractType)(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isSubType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n}","title":""},{"docid":"ae7cf8f295363dab85feee5983ffa1df","score":"0.44647837","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if ((0, _definition.isAbstractType)(typeA)) {\n if ((0, _definition.isAbstractType)(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isSubType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isSubType(typeA, typeB);\n }\n\n if ((0, _definition.isAbstractType)(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isSubType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n}","title":""},{"docid":"ae7cf8f295363dab85feee5983ffa1df","score":"0.44647837","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if ((0, _definition.isAbstractType)(typeA)) {\n if ((0, _definition.isAbstractType)(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isSubType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isSubType(typeA, typeB);\n }\n\n if ((0, _definition.isAbstractType)(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isSubType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n}","title":""},{"docid":"1f3eccb9981cbbe245a733d92cf3d8eb","score":"0.4464484","text":"function merge(target, source) {\n var key;\n for (key in source) {\n if (source.hasOwnProperty(key)) {\n target[key] = source[key];\n }\n }\n}","title":""},{"docid":"7f9d5756dbbd8f72a2931f2dce92dcdb","score":"0.4461791","text":"function merge(a, b) {\n return apply(copy(a), b);\n}","title":""},{"docid":"57d0af93279ce4ec74a0aad6d5c573cb","score":"0.4458747","text":"function copySchemaFiles() {\n const resolvedSrcSchemaPaths = path.resolve(rootDir, srcSchemaPaths);\n\n glob.sync(resolvedSrcSchemaPaths, void 0).forEach(function(filePath) {\n let destSchemaPath = filePath.replace(/(\\bsrc\\b)(?!.*\\1)/, destDir);\n destSchemaPath =\n destSchemaPath.substr(0, destSchemaPath.lastIndexOf(\".ts\")) + \".json\";\n fs.copyFileSync(filePath, destSchemaPath);\n const fileContents = fs.readFileSync(destSchemaPath).toString();\n const commonJS = \"module.exports = \".concat(\n fileContents.substring(fileContents.indexOf(\"{\"))\n );\n const tempPath = path.resolve(\n path.dirname(filePath),\n `.tmp/${path.basename(filePath)}.js`\n );\n\n try {\n if (!fs.existsSync(path.dirname(tempPath))) {\n fs.mkdirSync(path.dirname(tempPath));\n }\n fs.writeFileSync(tempPath, commonJS);\n const schemaData = require(tempPath);\n const json = JSON.stringify(schemaData, null, 2);\n fs.writeFileSync(destSchemaPath, json);\n } catch (e) {\n console.error(e);\n exit = 1;\n } finally {\n if (fs.existsSync(tempPath)) {\n fs.unlinkSync(tempPath);\n }\n }\n });\n\n process.exit(exit);\n}","title":""},{"docid":"547a5efcc910e0c3877c3880aa61286a","score":"0.44567397","text":"function mergeInto(obj1, obj2) {\n var to_ret = $.extend( {}, obj1, obj2 );\n return to_ret;\n}","title":""},{"docid":"e20416381ff828fccbcf0c5670bc2bb8","score":"0.44480723","text":"function merge(obj1, obj2) {\r\n obj1 = obj1 || {};\r\n obj2 = obj2 || {};\r\n var obj3 = {};\r\n for (var attrname in obj2) obj3[attrname] = obj2[attrname];\r\n for (var attrname2 in obj1) obj3[attrname2] = obj1[attrname2];\r\n return obj3;\r\n}","title":""},{"docid":"b1834e77d4cdba0982bf5bbbbd2a5ed2","score":"0.44327652","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if ((0, _definition.isAbstractType)(typeA)) {\n if ((0, _definition.isAbstractType)(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isPossibleType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isPossibleType(typeA, typeB);\n }\n\n if ((0, _definition.isAbstractType)(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isPossibleType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n}","title":""},{"docid":"b1834e77d4cdba0982bf5bbbbd2a5ed2","score":"0.44327652","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if ((0, _definition.isAbstractType)(typeA)) {\n if ((0, _definition.isAbstractType)(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isPossibleType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isPossibleType(typeA, typeB);\n }\n\n if ((0, _definition.isAbstractType)(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isPossibleType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n}","title":""},{"docid":"86a0ee9e507be117550221a26419dffd","score":"0.4430818","text":"function extendSchema(schema, documentAST, options) {\n Object(_type_schema__WEBPACK_IMPORTED_MODULE_8__[/* assertSchema */ \"b\"])(schema);\n !(documentAST && documentAST.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[/* Kind */ \"a\"].DOCUMENT) ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[/* default */ \"a\"])(0, 'Must provide valid Document AST') : void 0;\n\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\n Object(_validation_validate__WEBPACK_IMPORTED_MODULE_7__[/* assertValidSDLExtension */ \"b\"])(documentAST, schema);\n } // Collect the type definitions and extensions found in the document.\n\n\n var typeDefs = [];\n var typeExtsMap = Object.create(null); // New directives and types are separate because a directives and types can\n // have the same name. For example, a type named \"skip\".\n\n var directiveDefs = [];\n var schemaDef; // Schema extensions are collected which may add additional operation types.\n\n var schemaExts = [];\n var _iteratorNormalCompletion = true;\n var _didIteratorError = false;\n var _iteratorError = undefined;\n\n try {\n for (var _iterator = documentAST.definitions[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\n var def = _step.value;\n\n if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[/* Kind */ \"a\"].SCHEMA_DEFINITION) {\n schemaDef = def;\n } else if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[/* Kind */ \"a\"].SCHEMA_EXTENSION) {\n schemaExts.push(def);\n } else if (Object(_language_predicates__WEBPACK_IMPORTED_MODULE_14__[/* isTypeDefinitionNode */ \"d\"])(def)) {\n typeDefs.push(def);\n } else if (Object(_language_predicates__WEBPACK_IMPORTED_MODULE_14__[/* isTypeExtensionNode */ \"e\"])(def)) {\n var extendedTypeName = def.name.value;\n var existingTypeExts = typeExtsMap[extendedTypeName];\n typeExtsMap[extendedTypeName] = existingTypeExts ? existingTypeExts.concat([def]) : [def];\n } else if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[/* Kind */ \"a\"].DIRECTIVE_DEFINITION) {\n directiveDefs.push(def);\n }\n } // If this document contains no new types, extensions, or directives then\n // return the same unmodified GraphQLSchema instance.\n\n } catch (err) {\n _didIteratorError = true;\n _iteratorError = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion && _iterator.return != null) {\n _iterator.return();\n }\n } finally {\n if (_didIteratorError) {\n throw _iteratorError;\n }\n }\n }\n\n if (Object.keys(typeExtsMap).length === 0 && typeDefs.length === 0 && directiveDefs.length === 0 && schemaExts.length === 0 && !schemaDef) {\n return schema;\n }\n\n var schemaConfig = schema.toConfig();\n var astBuilder = new _buildASTSchema__WEBPACK_IMPORTED_MODULE_6__[/* ASTDefinitionBuilder */ \"a\"](options, function (typeName) {\n var type = typeMap[typeName];\n !type ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[/* default */ \"a\"])(0, \"Unknown type: \\\"\".concat(typeName, \"\\\".\")) : void 0;\n return type;\n });\n var typeMap = Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \"a\"])(typeDefs, function (node) {\n return node.name.value;\n }, function (node) {\n return astBuilder.buildType(node);\n });\n var _iteratorNormalCompletion2 = true;\n var _didIteratorError2 = false;\n var _iteratorError2 = undefined;\n\n try {\n for (var _iterator2 = schemaConfig.types[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\n var existingType = _step2.value;\n typeMap[existingType.name] = extendNamedType(existingType);\n } // Get the extended root operation types.\n\n } catch (err) {\n _didIteratorError2 = true;\n _iteratorError2 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\n _iterator2.return();\n }\n } finally {\n if (_didIteratorError2) {\n throw _iteratorError2;\n }\n }\n }\n\n var operationTypes = {\n query: schemaConfig.query && schemaConfig.query.name,\n mutation: schemaConfig.mutation && schemaConfig.mutation.name,\n subscription: schemaConfig.subscription && schemaConfig.subscription.name\n };\n\n if (schemaDef) {\n var _iteratorNormalCompletion3 = true;\n var _didIteratorError3 = false;\n var _iteratorError3 = undefined;\n\n try {\n for (var _iterator3 = schemaDef.operationTypes[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\n var _ref2 = _step3.value;\n var operation = _ref2.operation;\n var type = _ref2.type;\n operationTypes[operation] = type.name.value;\n }\n } catch (err) {\n _didIteratorError3 = true;\n _iteratorError3 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\n _iterator3.return();\n }\n } finally {\n if (_didIteratorError3) {\n throw _iteratorError3;\n }\n }\n }\n } // Then, incorporate schema definition and all schema extensions.\n\n\n for (var _i = 0, _schemaExts = schemaExts; _i < _schemaExts.length; _i++) {\n var schemaExt = _schemaExts[_i];\n\n if (schemaExt.operationTypes) {\n var _iteratorNormalCompletion4 = true;\n var _didIteratorError4 = false;\n var _iteratorError4 = undefined;\n\n try {\n for (var _iterator4 = schemaExt.operationTypes[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\n var _ref4 = _step4.value;\n var _operation = _ref4.operation;\n var _type = _ref4.type;\n operationTypes[_operation] = _type.name.value;\n }\n } catch (err) {\n _didIteratorError4 = true;\n _iteratorError4 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\n _iterator4.return();\n }\n } finally {\n if (_didIteratorError4) {\n throw _iteratorError4;\n }\n }\n }\n }\n } // Support both original legacy names and extended legacy names.\n\n\n var allowedLegacyNames = schemaConfig.allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\n\n return new _type_schema__WEBPACK_IMPORTED_MODULE_8__[/* GraphQLSchema */ \"a\"]({\n // Note: While this could make early assertions to get the correctly\n // typed values, that would throw immediately while type system\n // validation with validateSchema() will produce more actionable results.\n query: getMaybeTypeByName(operationTypes.query),\n mutation: getMaybeTypeByName(operationTypes.mutation),\n subscription: getMaybeTypeByName(operationTypes.subscription),\n types: Object(_polyfills_objectValues__WEBPACK_IMPORTED_MODULE_1__[/* default */ \"a\"])(typeMap),\n directives: getMergedDirectives(),\n astNode: schemaDef || schemaConfig.astNode,\n extensionASTNodes: schemaConfig.extensionASTNodes.concat(schemaExts),\n allowedLegacyNames: allowedLegacyNames\n }); // Below are functions used for producing this schema that have closed over\n // this scope and have access to the schema, cache, and newly defined types.\n\n function replaceType(type) {\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isListType */ \"J\"])(type)) {\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLList */ \"d\"](replaceType(type.ofType));\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isNonNullType */ \"L\"])(type)) {\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLNonNull */ \"e\"](replaceType(type.ofType));\n }\n\n return replaceNamedType(type);\n }\n\n function replaceNamedType(type) {\n return typeMap[type.name];\n }\n\n function getMaybeTypeByName(typeName) {\n return typeName ? typeMap[typeName] : null;\n }\n\n function getMergedDirectives() {\n var existingDirectives = schema.getDirectives().map(extendDirective);\n !existingDirectives ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[/* default */ \"a\"])(0, 'schema must have default directives') : void 0;\n return existingDirectives.concat(directiveDefs.map(function (node) {\n return astBuilder.buildDirective(node);\n }));\n }\n\n function extendNamedType(type) {\n if (Object(_type_introspection__WEBPACK_IMPORTED_MODULE_9__[/* isIntrospectionType */ \"n\"])(type) || Object(_type_scalars__WEBPACK_IMPORTED_MODULE_10__[/* isSpecifiedScalarType */ \"f\"])(type)) {\n // Builtin types are not extended.\n return type;\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isScalarType */ \"R\"])(type)) {\n return extendScalarType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isObjectType */ \"N\"])(type)) {\n return extendObjectType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isInterfaceType */ \"H\"])(type)) {\n return extendInterfaceType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isUnionType */ \"T\"])(type)) {\n return extendUnionType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isEnumType */ \"E\"])(type)) {\n return extendEnumType(type);\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isInputObjectType */ \"F\"])(type)) {\n return extendInputObjectType(type);\n } // Not reachable. All possible types have been considered.\n\n /* istanbul ignore next */\n\n\n throw new Error(\"Unexpected type: \\\"\".concat(Object(_jsutils_inspect__WEBPACK_IMPORTED_MODULE_2__[/* default */ \"a\"])(type), \"\\\".\"));\n }\n\n function extendDirective(directive) {\n var config = directive.toConfig();\n return new _type_directives__WEBPACK_IMPORTED_MODULE_12__[/* GraphQLDirective */ \"c\"](_objectSpread({}, config, {\n args: Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \"a\"])(config.args, extendArg)\n }));\n }\n\n function extendInputObjectType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \"a\"])(extensions, function (node) {\n return node.fields || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLInputObjectType */ \"b\"](_objectSpread({}, config, {\n fields: function fields() {\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \"a\"])(config.fields, function (field) {\n return _objectSpread({}, field, {\n type: replaceType(field.type)\n });\n }), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \"a\"])(fieldNodes, function (field) {\n return field.name.value;\n }, function (field) {\n return astBuilder.buildInputField(field);\n }));\n },\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendEnumType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[type.name] || [];\n var valueNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \"a\"])(extensions, function (node) {\n return node.values || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLEnumType */ \"a\"](_objectSpread({}, config, {\n values: _objectSpread({}, config.values, Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \"a\"])(valueNodes, function (value) {\n return value.name.value;\n }, function (value) {\n return astBuilder.buildEnumValue(value);\n })),\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendScalarType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLScalarType */ \"g\"](_objectSpread({}, config, {\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendObjectType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n var interfaceNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \"a\"])(extensions, function (node) {\n return node.interfaces || [];\n });\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \"a\"])(extensions, function (node) {\n return node.fields || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLObjectType */ \"f\"](_objectSpread({}, config, {\n interfaces: function interfaces() {\n return [].concat(type.getInterfaces().map(replaceNamedType), interfaceNodes.map(function (node) {\n return astBuilder.getNamedType(node);\n }));\n },\n fields: function fields() {\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \"a\"])(config.fields, extendField), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \"a\"])(fieldNodes, function (node) {\n return node.name.value;\n }, function (node) {\n return astBuilder.buildField(node);\n }));\n },\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendInterfaceType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \"a\"])(extensions, function (node) {\n return node.fields || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLInterfaceType */ \"c\"](_objectSpread({}, config, {\n fields: function fields() {\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \"a\"])(config.fields, extendField), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \"a\"])(fieldNodes, function (node) {\n return node.name.value;\n }, function (node) {\n return astBuilder.buildField(node);\n }));\n },\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendUnionType(type) {\n var config = type.toConfig();\n var extensions = typeExtsMap[config.name] || [];\n var typeNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \"a\"])(extensions, function (node) {\n return node.types || [];\n });\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLUnionType */ \"h\"](_objectSpread({}, config, {\n types: function types() {\n return [].concat(type.getTypes().map(replaceNamedType), typeNodes.map(function (node) {\n return astBuilder.getNamedType(node);\n }));\n },\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\n }));\n }\n\n function extendField(field) {\n return _objectSpread({}, field, {\n type: replaceType(field.type),\n args: Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \"a\"])(field.args, extendArg)\n });\n }\n\n function extendArg(arg) {\n return _objectSpread({}, arg, {\n type: replaceType(arg.type)\n });\n }\n}","title":""},{"docid":"efee0b06863aaab2fd779d6ade5ebd31","score":"0.44305128","text":"function addTypes(schema, newTypesOrDirectives) {\n const queryType = schema.getQueryType();\n const mutationType = schema.getMutationType();\n const subscriptionType = schema.getSubscriptionType();\n const queryTypeName = queryType != null ? queryType.name : undefined;\n const mutationTypeName = mutationType != null ? mutationType.name : undefined;\n const subscriptionTypeName = subscriptionType != null ? subscriptionType.name : undefined;\n const config = schema.toConfig();\n const originalTypeMap = {};\n config.types.forEach(type => {\n originalTypeMap[type.name] = type;\n });\n const originalDirectiveMap = {};\n config.directives.forEach(directive => {\n originalDirectiveMap[directive.name] = directive;\n });\n newTypesOrDirectives.forEach(newTypeOrDirective => {\n if (graphql.isNamedType(newTypeOrDirective)) {\n originalTypeMap[newTypeOrDirective.name] = newTypeOrDirective;\n }\n else if (graphql.isDirective(newTypeOrDirective)) {\n originalDirectiveMap[newTypeOrDirective.name] = newTypeOrDirective;\n }\n });\n const { typeMap, directives } = rewireTypes(originalTypeMap, Object.keys(originalDirectiveMap).map(directiveName => originalDirectiveMap[directiveName]));\n return new graphql.GraphQLSchema({\n ...config,\n query: queryTypeName ? typeMap[queryTypeName] : undefined,\n mutation: mutationTypeName ? typeMap[mutationTypeName] : undefined,\n subscription: subscriptionTypeName != null ? typeMap[subscriptionTypeName] : undefined,\n types: Object.keys(typeMap).map(typeName => typeMap[typeName]),\n directives,\n });\n}","title":""},{"docid":"0cb5ec442d553da4113bbf4f2da5beba","score":"0.44285235","text":"function doTypesOverlap(schema, typeA, typeB) {\n // Equivalent types overlap\n if (typeA === typeB) {\n return true;\n }\n\n if ((0, _definition$v.isAbstractType)(typeA)) {\n if ((0, _definition$v.isAbstractType)(typeB)) {\n // If both types are abstract, then determine if there is any intersection\n // between possible concrete types of each.\n return schema.getPossibleTypes(typeA).some(function (type) {\n return schema.isSubType(typeB, type);\n });\n } // Determine if the latter type is a possible concrete type of the former.\n\n\n return schema.isSubType(typeA, typeB);\n }\n\n if ((0, _definition$v.isAbstractType)(typeB)) {\n // Determine if the former type is a possible concrete type of the latter.\n return schema.isSubType(typeB, typeA);\n } // Otherwise the types do not overlap.\n\n\n return false;\n }","title":""},{"docid":"7c9d0bdb261e961034568b66013588c4","score":"0.44262516","text":"function findTypesAddedToUnions(oldSchema, newSchema) {\n var oldTypeMap = oldSchema.getTypeMap();\n var newTypeMap = newSchema.getTypeMap();\n var typesAddedToUnion = [];\n\n for (var _i11 = 0, _Object$keys11 = Object.keys(newTypeMap); _i11 < _Object$keys11.length; _i11++) {\n var typeName = _Object$keys11[_i11];\n var oldType = oldTypeMap[typeName];\n var newType = newTypeMap[typeName];\n\n if (!Object(_type_definition__WEBPACK_IMPORTED_MODULE_2__[/* isUnionType */ \"T\"])(oldType) || !Object(_type_definition__WEBPACK_IMPORTED_MODULE_2__[/* isUnionType */ \"T\"])(newType)) {\n continue;\n }\n\n var typeNamesInOldUnion = Object.create(null);\n var _iteratorNormalCompletion5 = true;\n var _didIteratorError5 = false;\n var _iteratorError5 = undefined;\n\n try {\n for (var _iterator5 = oldType.getTypes()[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\n var type = _step5.value;\n typeNamesInOldUnion[type.name] = true;\n }\n } catch (err) {\n _didIteratorError5 = true;\n _iteratorError5 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\n _iterator5.return();\n }\n } finally {\n if (_didIteratorError5) {\n throw _iteratorError5;\n }\n }\n }\n\n var _iteratorNormalCompletion6 = true;\n var _didIteratorError6 = false;\n var _iteratorError6 = undefined;\n\n try {\n for (var _iterator6 = newType.getTypes()[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\n var _type2 = _step6.value;\n\n if (!typeNamesInOldUnion[_type2.name]) {\n typesAddedToUnion.push({\n type: DangerousChangeType.TYPE_ADDED_TO_UNION,\n description: \"\".concat(_type2.name, \" was added to union type \").concat(typeName, \".\")\n });\n }\n }\n } catch (err) {\n _didIteratorError6 = true;\n _iteratorError6 = err;\n } finally {\n try {\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\n _iterator6.return();\n }\n } finally {\n if (_didIteratorError6) {\n throw _iteratorError6;\n }\n }\n }\n }\n\n return typesAddedToUnion;\n}","title":""},{"docid":"87480c17677c9c9d97fbcd8a39dd448c","score":"0.4420803","text":"mergeObjects(obj1, obj2){\n let newObj = {}\n\n Object.keys(obj1).forEach(function(key){ newObj[key] = obj1[key]; });\n Object.keys(obj2).forEach(function(key){ newObj[key] = obj2[key]; });\n\n return newObj;\n }","title":""},{"docid":"ff5d82592e70734d56cb4f9c14505e04","score":"0.44176102","text":"function addSchemaIfNeeded(schemaList, schemaObj) {\n const name = schemaObj.schema.name;\n if (schemaList.find((obj) => obj && (obj.name === name || (obj.schema && obj.schema.name === name))) === undefined) {\n schemaList.push(schemaObj);\n }\n}","title":""},{"docid":"a93ca6e9f3a53e06297c2ec4f5293c14","score":"0.44162917","text":"function mergeObjects(first, second) {\n if (first) {\n if (second) {\n // Both objects exist. Copy the first.\n var result = {};\n for (var property in first) {\n result[property] = first[property];\n }\n // Override with the second.\n for (var property2 in second) {\n result[property2] = second[property2];\n }\n return result;\n } else {\n // First but no second object.\n return first;\n }\n } else if (second) {\n // Second but no first object.\n return second;\n }\n // No first or second.\n return {};\n}","title":""},{"docid":"4dad7922b80dc7473ac8ea8a5b1c6ba7","score":"0.4414967","text":"function merge(obj1, obj2) { \n var returnObj = {};\n var args = [].slice.call(arguments, 0);\n var argLen = args.length;\n\n for(var i = 0; i < argLen; i++) {\n for (var key in args[i]) {\n returnObj[key] = args[i][key];\n }\n }\n\n return returnObj;\n\n}","title":""},{"docid":"016bda8d9b5222fa8f22415db0e6f375","score":"0.44120467","text":"addSchema(_schemas) {\n this._validator.addSchema(_schemas); // AJV validates upon adding\n }","title":""},{"docid":"3c561321d130ae4b5992431411b79721","score":"0.44114268","text":"function mergeObjects(to, from, Overwrite) {\r\n\tfor(p in from) {\r\n\t\tif(overwrite) {\r\n\t\t\tto[p] = from[p];\r\n\t\t}\r\n\t\telse if(to[p] === undefined) {\r\n\t\t\tto[p] = from[p];\r\n\t\t}\r\n\t}\r\n}","title":""},{"docid":"551c4405e70780a06c2ed0cf13472227","score":"0.43998182","text":"function union(site1, site2) {\n const site1Root = root(site1);\n const site2Root = root(site2);\n\n groups[site1Root] = site2Root;\n if (site1 === site2) {\n return;\n }\n if (size[site1Root] < size[site2Root]) {\n groups[site1Root] = site2Root;\n size[site2Root] += size[site1Root];\n } else {\n groups[site2Root] = site1Root;\n size[site1Root] += size[site2Root];\n }\n}","title":""}],"string":"[\n {\n \"docid\": \"7aa510681f674fba8725c38c15a0f509\",\n \"score\": \"0.65103585\",\n \"text\": \"function union (schema, instance) {\\n var type = primitiveType(instance);\\n if (type == 'undefined') {\\n // TODO: handle this case. What should I do with an array of values like\\n // `['laugh', 100, undefined]`? change all of the schemas to optional?\\n // schemas.forEach(schema => schema.optional = true);\\n return schema;\\n }\\n else if (type == 'object') {\\n // TODO: clone the schema instead of mutating it\\n var objectSchema = schema;\\n if (!typeMatches(type, objectSchema.type)) {\\n // the schema does not currently handle objects, so we need to add the type\\n objectSchema.type = addType(type, objectSchema.type);\\n // and the appropriate field\\n objectSchema.properties = {};\\n }\\n // now we can merge the object's fields\\n for (var key in instance) {\\n // should we do a `hasOwnProperty` check?\\n objectSchema.properties[key] = union(objectSchema.properties[key] || {}, instance[key]);\\n }\\n return objectSchema;\\n }\\n else if (type == 'array') {\\n // TODO: support tuple-type arrays?\\n // TODO: clone the existing schema\\n var arraySchema_1 = schema;\\n if (!typeMatches(type, arraySchema_1.type)) {\\n // the schema does not currently handle arrays, so we need to add the type\\n arraySchema_1.type = addType(type, arraySchema_1.type);\\n // and the appropriate field\\n arraySchema_1.items = {};\\n }\\n // now we can merge the array's schema\\n instance.forEach(function (item) {\\n arraySchema_1.items = union(arraySchema_1.items, item);\\n });\\n return arraySchema_1;\\n }\\n else {\\n if (!typeMatches(type, schema.type)) {\\n schema.type = addType(type, schema.type);\\n }\\n // only the nested types, object and array, require merging. otherwise, nothing needs to be done.\\n return schema;\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c9e09c9b82c5ceb16ad1596ca115252\",\n \"score\": \"0.5906787\",\n \"text\": \"function mergeSchemas(config) {\\n const typeDefs = mergeTypes(config);\\n const extractedResolvers = [];\\n const extractedExtensions = [];\\n for (const schema of config.schemas) {\\n extractedResolvers.push(utils.getResolversFromSchema(schema));\\n extractedExtensions.push(extractExtensionsFromSchema(schema));\\n }\\n extractedResolvers.push(...ensureResolvers(config));\\n const resolvers = mergeResolvers(extractedResolvers, config);\\n const extensions = mergeExtensions(extractedExtensions);\\n return makeSchema({ resolvers, typeDefs, extensions }, config);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25de7b279f851e21ffc32bc9953bc399\",\n \"score\": \"0.5782577\",\n \"text\": \"function merge (schema, doc, self) {\\n var keys = Object.keys(doc);\\n\\n for (var i = 0; i < keys.length; ++i) {\\n var key = keys[i];\\n var type;\\n\\n // if nothing in schema yet, just assign\\n if ('undefined' == typeof schema[key]) {\\n var type = self.getType(doc, key);\\n if (undefined !== type) {\\n schema[key] = type;\\n }\\n continue;\\n }\\n\\n // exists in schema and incoming is an object?\\n if (isObject(doc[key])) {\\n if (isObject(schema[key])) {\\n merge(schema[key], doc[key], self);\\n\\n } else {\\n type = self.getType(doc, key);\\n if (undefined !== type) {\\n if ('null' == schema[key]) {\\n schema[key] = type;\\n } else if (type != schema[key]) {\\n schema[key] = 'Mixed';\\n }\\n }\\n }\\n } else {\\n // exists in schema and incoming is not an object.\\n var type = self.getType(doc, key);\\n if (undefined === type) {\\n continue;\\n }\\n\\n if ('null' == schema[key]) {\\n schema[key] = type;\\n\\n } else if ('null' == type) {\\n // ignore\\n\\n } else if (Array.isArray(schema[key]) && Array.isArray(type)) {\\n\\n if (0 === schema[key].length) {\\n schema[key] = type;\\n\\n } else if (schema[key][0] instanceof Schema && isObject(type[0])) {\\n // merge schemas\\n schema[key][0].combine(type[0]);\\n\\n } else if (!equalType(schema[key], type)) {\\n schema[key] = ['Mixed'];\\n }\\n\\n } else if (!equalType(schema[key], type)) {\\n schema[key] = 'Mixed';\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f079c6cabd0445f1773664cdb3690ef8\",\n \"score\": \"0.53333455\",\n \"text\": \"function mergeUpdates(a, b) {\\n\\tif(typeof a === \\\"object\\\" && typeof b === \\\"object\\\") {\\n\\t\\tvar res = {};\\n\\t\\tObject.keys(a).concat(Object.keys(b)).forEach(function(key) {\\n\\t\\t\\tif(a[key] && b[key]) {\\n\\t\\t\\t\\tswitch(key) {\\n\\t\\t\\t\\t\\tcase \\\"$push\\\":\\n\\t\\t\\t\\t\\t\\tres[key] = a[key].concat(b[key]);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\tcase \\\"$unshift\\\":\\n\\t\\t\\t\\t\\t\\tres[key] = b[key].concat(a[key]);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\tcase \\\"$splice\\\":\\n\\t\\t\\t\\t\\t\\tres[key] = a[key].concat(b[key]);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\tcase \\\"$set\\\":\\n\\t\\t\\t\\t\\t\\tres[key] = b[key];\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\tcase \\\"$merge\\\":\\n\\t\\t\\t\\t\\t\\tvar o = res[key] = {};\\n\\t\\t\\t\\t\\t\\tObject.keys(a[key]).forEach(function(x) {\\n\\t\\t\\t\\t\\t\\t\\to[x] = a[key][x]\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\tObject.keys(b[key]).forEach(function(x) {\\n\\t\\t\\t\\t\\t\\t\\to[x] = b[key][x]\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tres[key] = mergeUpdates(a[key], b[key]);\\n\\t\\t\\t} else if(a[key])\\n\\t\\t\\t\\tres[key] = a[key];\\n\\t\\t\\telse\\n\\t\\t\\t\\tres[key] = b[key];\\n\\t\\t});\\n\\t}\\n\\treturn a || b;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d15bba7ab7a3da16d4136e7bf4b5016\",\n \"score\": \"0.5298907\",\n \"text\": \"function mergeSchemas(functionType, lhsSchema, rhsSchema, passign) {\\n // handle parameter name conflicts by having the second primitive win\\n const newArgNames = new Set;\\n const newArgs = [];\\n for (let arg of rhsSchema.iterateArguments()) {\\n if (arg.name === passign)\\n continue;\\n newArgNames.add(arg.name);\\n newArgs.push(arg);\\n }\\n for (let arg of lhsSchema.iterateArguments()) {\\n if (newArgNames.has(arg.name))\\n continue;\\n /*if (!lhsSchema.isArgInput(arg.name))\\n continue;*/\\n newArgNames.add(arg.name);\\n newArgs.push(arg);\\n }\\n\\n return new Ast.ExpressionSignature(null, functionType, null /* class */, [] /* extends */, newArgs, {\\n is_list: lhsSchema.is_list || rhsSchema.is_list,\\n is_monitorable: lhsSchema.is_monitorable && rhsSchema.is_monitorable,\\n require_filter: lhsSchema.require_filter || rhsSchema.require_filter,\\n default_projection: [...new Set(lhsSchema.default_projection.concat(rhsSchema.default_projection))],\\n minimal_projection: [...new Set(lhsSchema.minimal_projection.concat(rhsSchema.minimal_projection))],\\n no_filter: lhsSchema.no_filter && rhsSchema.no_filter\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07f528d7d0a9c0c163c76fb19daf2084\",\n \"score\": \"0.52729154\",\n \"text\": \"function merge(dst, src) {\\n const keys = Object.keys(src);\\n for (let i = 0; i < keys.length; ++i) {\\n const key = keys[i];\\n if (typeOf(dst[key]) === 'object' && typeOf(src[key]) === 'object') {\\n Vue.set(dst, key, merge(dst[key], src[key]));\\n } else {\\n Vue.set(dst, key, src[key]);\\n }\\n }\\n return dst;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"925568208a83905a8f0523071c609df1\",\n \"score\": \"0.524971\",\n \"text\": \"function combineAllOf(schema) {\\n if (!isObject(schema) || !isArray(schema.allOf)) {\\n return schema;\\n }\\n var mergedSchema = mergeSchemas.apply(void 0, __spread(schema.allOf));\\n if (Object.keys(schema).length > 1) {\\n var extraKeys = __assign({}, schema);\\n delete extraKeys.allOf;\\n mergedSchema = mergeSchemas(mergedSchema, extraKeys);\\n }\\n return mergedSchema;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a9495e9d4cbee09dad45e59f7f75d55\",\n \"score\": \"0.5189018\",\n \"text\": \"function mergeSchemaGroup(group, mergeSchemas, source) {\\n var allKeys = allUniqueKeys(source || group)\\n var extractor = source\\n ? getItemSchemas\\n : getValues\\n return allKeys.reduce(function(all, key) {\\n var schemas = extractor(group, key)\\n var compacted = uniqWith(schemas.filter(notUndefined), compare)\\n all[key] = mergeSchemas(compacted, key)\\n return all\\n }, source\\n ? []\\n : {})\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7673d605d209bdc195b29a8ec448116b\",\n \"score\": \"0.51573783\",\n \"text\": \"function importSchema(schema, schemas) {\\n var sdl = read(schema, schemas) || schema;\\n var document = getDocumentFromSDL(sdl);\\n // Recursively process the imports, starting by importing all types from the initial schema\\n var _a = collectDefinitions(['*'], sdl, schema, schemas), allDefinitions = _a.allDefinitions, typeDefinitions = _a.typeDefinitions;\\n // Post processing of the final schema (missing types, unused types, etc.)\\n // Query, Mutation and Subscription should be merged\\n // And should always be in the first set, to make sure they\\n // are not filtered out.\\n var firstTypes = lodash_1.flatten(typeDefinitions).filter(function (d) {\\n return lodash_1.includes(rootFields, d.name.value);\\n });\\n var otherFirstTypes = typeDefinitions[0].filter(function (d) { return !lodash_1.includes(rootFields, d.name.value); });\\n var firstSet = firstTypes.concat(otherFirstTypes);\\n var processedTypeNames = [];\\n var mergedFirstTypes = [];\\n var _loop_1 = function (type) {\\n if (!lodash_1.includes(processedTypeNames, type.name.value)) {\\n processedTypeNames.push(type.name.value);\\n mergedFirstTypes.push(type);\\n }\\n else {\\n var existingType = mergedFirstTypes.find(function (t) { return t.name.value === type.name.value; });\\n existingType.fields = existingType.fields.concat(type.fields);\\n }\\n };\\n for (var _i = 0, firstSet_1 = firstSet; _i < firstSet_1.length; _i++) {\\n var type = firstSet_1[_i];\\n _loop_1(type);\\n }\\n document = __assign({}, document, { definitions: definition_1.completeDefinitionPool(lodash_1.flatten(allDefinitions), firstSet, lodash_1.flatten(typeDefinitions)) });\\n // Return the schema as string\\n return graphql_1.print(document);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3ee4c7f911f0084af2dd5422524d39c\",\n \"score\": \"0.5084623\",\n \"text\": \"function extendSchema(schema, documentAST, options) {\\n !Object(__WEBPACK_IMPORTED_MODULE_7__type_schema__[\\\"b\\\" /* isSchema */])(schema) ? Object(__WEBPACK_IMPORTED_MODULE_0__jsutils_invariant__[\\\"a\\\" /* default */])(0, 'Must provide valid GraphQLSchema') : void 0;\\n !(documentAST && documentAST.kind === __WEBPACK_IMPORTED_MODULE_12__language_kinds__[\\\"a\\\" /* Kind */].DOCUMENT) ? Object(__WEBPACK_IMPORTED_MODULE_0__jsutils_invariant__[\\\"a\\\" /* default */])(0, 'Must provide valid Document AST') : void 0;\\n\\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\\n Object(__WEBPACK_IMPORTED_MODULE_5__validation_validate__[\\\"b\\\" /* assertValidSDLExtension */])(documentAST, schema);\\n } // Collect the type definitions and extensions found in the document.\\n\\n\\n var typeDefinitionMap = Object.create(null);\\n var typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\\n // have the same name. For example, a type named \\\"skip\\\".\\n\\n var directiveDefinitions = [];\\n var schemaDef; // Schema extensions are collected which may add additional operation types.\\n\\n var schemaExtensions = [];\\n\\n for (var i = 0; i < documentAST.definitions.length; i++) {\\n var def = documentAST.definitions[i];\\n\\n if (def.kind === __WEBPACK_IMPORTED_MODULE_12__language_kinds__[\\\"a\\\" /* Kind */].SCHEMA_DEFINITION) {\\n schemaDef = def;\\n } else if (def.kind === __WEBPACK_IMPORTED_MODULE_12__language_kinds__[\\\"a\\\" /* Kind */].SCHEMA_EXTENSION) {\\n schemaExtensions.push(def);\\n } else if (Object(__WEBPACK_IMPORTED_MODULE_13__language_predicates__[\\\"b\\\" /* isTypeDefinitionNode */])(def)) {\\n // Sanity check that none of the defined types conflict with the\\n // schema's existing types.\\n var typeName = def.name.value;\\n\\n if (schema.getType(typeName)) {\\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\\\"a\\\" /* GraphQLError */](\\\"Type \\\\\\\"\\\".concat(typeName, \\\"\\\\\\\" already exists in the schema. It cannot also \\\") + 'be defined in this type definition.', [def]);\\n }\\n\\n typeDefinitionMap[typeName] = def;\\n } else if (Object(__WEBPACK_IMPORTED_MODULE_13__language_predicates__[\\\"c\\\" /* isTypeExtensionNode */])(def)) {\\n // Sanity check that this type extension exists within the\\n // schema's existing types.\\n var extendedTypeName = def.name.value;\\n var existingType = schema.getType(extendedTypeName);\\n\\n if (!existingType) {\\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\\\"a\\\" /* GraphQLError */](\\\"Cannot extend type \\\\\\\"\\\".concat(extendedTypeName, \\\"\\\\\\\" because it does not \\\") + 'exist in the existing schema.', [def]);\\n }\\n\\n checkExtensionNode(existingType, def);\\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\\n } else if (def.kind === __WEBPACK_IMPORTED_MODULE_12__language_kinds__[\\\"a\\\" /* Kind */].DIRECTIVE_DEFINITION) {\\n var directiveName = def.name.value;\\n var existingDirective = schema.getDirective(directiveName);\\n\\n if (existingDirective) {\\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\\\"a\\\" /* GraphQLError */](\\\"Directive \\\\\\\"\\\".concat(directiveName, \\\"\\\\\\\" already exists in the schema. It \\\") + 'cannot be redefined.', [def]);\\n }\\n\\n directiveDefinitions.push(def);\\n }\\n } // If this document contains no new types, extensions, or directives then\\n // return the same unmodified GraphQLSchema instance.\\n\\n\\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0 && schemaExtensions.length === 0 && !schemaDef) {\\n return schema;\\n }\\n\\n var astBuilder = new __WEBPACK_IMPORTED_MODULE_4__buildASTSchema__[\\\"a\\\" /* ASTDefinitionBuilder */](typeDefinitionMap, options, function (typeRef) {\\n var typeName = typeRef.name.value;\\n var existingType = schema.getType(typeName);\\n\\n if (existingType) {\\n return extendNamedType(existingType);\\n }\\n\\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\\\"a\\\" /* GraphQLError */](\\\"Unknown type: \\\\\\\"\\\".concat(typeName, \\\"\\\\\\\". Ensure that this type exists \\\") + 'either in the original schema, or is added in a type definition.', [typeRef]);\\n });\\n var extendTypeCache = Object.create(null); // Get the extended root operation types.\\n\\n var operationTypes = {\\n query: extendMaybeNamedType(schema.getQueryType()),\\n mutation: extendMaybeNamedType(schema.getMutationType()),\\n subscription: extendMaybeNamedType(schema.getSubscriptionType())\\n };\\n\\n if (schemaDef) {\\n var _iteratorNormalCompletion = true;\\n var _didIteratorError = false;\\n var _iteratorError = undefined;\\n\\n try {\\n for (var _iterator = schemaDef.operationTypes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\\n var _ref2 = _step.value;\\n var operation = _ref2.operation,\\n type = _ref2.type;\\n\\n if (operationTypes[operation]) {\\n throw new Error(\\\"Must provide only one \\\".concat(operation, \\\" type in schema.\\\"));\\n } // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n\\n\\n operationTypes[operation] = astBuilder.buildType(type);\\n }\\n } catch (err) {\\n _didIteratorError = true;\\n _iteratorError = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion && _iterator.return != null) {\\n _iterator.return();\\n }\\n } finally {\\n if (_didIteratorError) {\\n throw _iteratorError;\\n }\\n }\\n }\\n } // Then, incorporate schema definition and all schema extensions.\\n\\n\\n for (var _i = 0; _i < schemaExtensions.length; _i++) {\\n var schemaExtension = schemaExtensions[_i];\\n\\n if (schemaExtension.operationTypes) {\\n var _iteratorNormalCompletion12 = true;\\n var _didIteratorError12 = false;\\n var _iteratorError12 = undefined;\\n\\n try {\\n for (var _iterator12 = schemaExtension.operationTypes[Symbol.iterator](), _step12; !(_iteratorNormalCompletion12 = (_step12 = _iterator12.next()).done); _iteratorNormalCompletion12 = true) {\\n var _ref4 = _step12.value;\\n var operation = _ref4.operation,\\n type = _ref4.type;\\n\\n if (operationTypes[operation]) {\\n throw new Error(\\\"Must provide only one \\\".concat(operation, \\\" type in schema.\\\"));\\n } // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n\\n\\n operationTypes[operation] = astBuilder.buildType(type);\\n }\\n } catch (err) {\\n _didIteratorError12 = true;\\n _iteratorError12 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion12 && _iterator12.return != null) {\\n _iterator12.return();\\n }\\n } finally {\\n if (_didIteratorError12) {\\n throw _iteratorError12;\\n }\\n }\\n }\\n }\\n }\\n\\n var schemaExtensionASTNodes = schemaExtensions ? schema.extensionASTNodes ? schema.extensionASTNodes.concat(schemaExtensions) : schemaExtensions : schema.extensionASTNodes;\\n var types = Object(__WEBPACK_IMPORTED_MODULE_3__jsutils_objectValues__[\\\"a\\\" /* default */])(schema.getTypeMap()).map(function (type) {\\n return extendNamedType(type);\\n }).concat(Object(__WEBPACK_IMPORTED_MODULE_3__jsutils_objectValues__[\\\"a\\\" /* default */])(typeDefinitionMap).map(function (type) {\\n return astBuilder.buildType(type);\\n })); // Support both original legacy names and extended legacy names.\\n\\n var allowedLegacyNames = schema.__allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\\n\\n\\n return new __WEBPACK_IMPORTED_MODULE_7__type_schema__[\\\"a\\\" /* GraphQLSchema */](_objectSpread({}, operationTypes, {\\n types: types,\\n directives: getMergedDirectives(),\\n astNode: schema.astNode,\\n extensionASTNodes: schemaExtensionASTNodes,\\n allowedLegacyNames: allowedLegacyNames\\n })); // Below are functions used for producing this schema that have closed over\\n // this scope and have access to the schema, cache, and newly defined types.\\n\\n function getMergedDirectives() {\\n var existingDirectives = schema.getDirectives().map(extendDirective);\\n !existingDirectives ? Object(__WEBPACK_IMPORTED_MODULE_0__jsutils_invariant__[\\\"a\\\" /* default */])(0, 'schema must have default directives') : void 0;\\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\\n return astBuilder.buildDirective(node);\\n }));\\n }\\n\\n function extendMaybeNamedType(type) {\\n return type ? extendNamedType(type) : null;\\n }\\n\\n function extendNamedType(type) {\\n if (Object(__WEBPACK_IMPORTED_MODULE_8__type_introspection__[\\\"g\\\" /* isIntrospectionType */])(type) || Object(__WEBPACK_IMPORTED_MODULE_9__type_scalars__[\\\"d\\\" /* isSpecifiedScalarType */])(type)) {\\n // Builtin types are not extended.\\n return type;\\n }\\n\\n var name = type.name;\\n\\n if (!extendTypeCache[name]) {\\n if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"B\\\" /* isScalarType */])(type)) {\\n extendTypeCache[name] = extendScalarType(type);\\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"x\\\" /* isObjectType */])(type)) {\\n extendTypeCache[name] = extendObjectType(type);\\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"s\\\" /* isInterfaceType */])(type)) {\\n extendTypeCache[name] = extendInterfaceType(type);\\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"D\\\" /* isUnionType */])(type)) {\\n extendTypeCache[name] = extendUnionType(type);\\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"p\\\" /* isEnumType */])(type)) {\\n extendTypeCache[name] = extendEnumType(type);\\n } else if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"q\\\" /* isInputObjectType */])(type)) {\\n extendTypeCache[name] = extendInputObjectType(type);\\n }\\n }\\n\\n return extendTypeCache[name];\\n }\\n\\n function extendDirective(directive) {\\n return new __WEBPACK_IMPORTED_MODULE_11__type_directives__[\\\"c\\\" /* GraphQLDirective */]({\\n name: directive.name,\\n description: directive.description,\\n locations: directive.locations,\\n args: extendArgs(directive.args),\\n astNode: directive.astNode\\n });\\n }\\n\\n function extendInputObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"b\\\" /* GraphQLInputObjectType */]({\\n name: name,\\n description: type.description,\\n fields: function fields() {\\n return extendInputFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendInputFieldMap(type) {\\n var newFieldMap = Object.create(null);\\n var oldFieldMap = type.getFields();\\n\\n var _arr = Object.keys(oldFieldMap);\\n\\n for (var _i2 = 0; _i2 < _arr.length; _i2++) {\\n var _fieldName = _arr[_i2];\\n var _field = oldFieldMap[_fieldName];\\n newFieldMap[_fieldName] = {\\n description: _field.description,\\n type: extendType(_field.type),\\n defaultValue: _field.defaultValue,\\n astNode: _field.astNode\\n };\\n } // If there are any extensions to the fields, apply those here.\\n\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion2 = true;\\n var _didIteratorError2 = false;\\n var _iteratorError2 = undefined;\\n\\n try {\\n for (var _iterator2 = extensions[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\\n var extension = _step2.value;\\n var _iteratorNormalCompletion3 = true;\\n var _didIteratorError3 = false;\\n var _iteratorError3 = undefined;\\n\\n try {\\n for (var _iterator3 = extension.fields[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\\n var field = _step3.value;\\n var fieldName = field.name.value;\\n\\n if (oldFieldMap[fieldName]) {\\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\\\"a\\\" /* GraphQLError */](\\\"Field \\\\\\\"\\\".concat(type.name, \\\".\\\").concat(fieldName, \\\"\\\\\\\" already exists in the \\\") + 'schema. It cannot also be defined in this type extension.', [field]);\\n }\\n\\n newFieldMap[fieldName] = astBuilder.buildInputField(field);\\n }\\n } catch (err) {\\n _didIteratorError3 = true;\\n _iteratorError3 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\\n _iterator3.return();\\n }\\n } finally {\\n if (_didIteratorError3) {\\n throw _iteratorError3;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError2 = true;\\n _iteratorError2 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\\n _iterator2.return();\\n }\\n } finally {\\n if (_didIteratorError2) {\\n throw _iteratorError2;\\n }\\n }\\n }\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendEnumType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"a\\\" /* GraphQLEnumType */]({\\n name: name,\\n description: type.description,\\n values: extendValueMap(type),\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendValueMap(type) {\\n var newValueMap = Object.create(null);\\n var oldValueMap = Object(__WEBPACK_IMPORTED_MODULE_1__jsutils_keyMap__[\\\"a\\\" /* default */])(type.getValues(), function (value) {\\n return value.name;\\n });\\n\\n var _arr2 = Object.keys(oldValueMap);\\n\\n for (var _i3 = 0; _i3 < _arr2.length; _i3++) {\\n var _valueName = _arr2[_i3];\\n var _value = oldValueMap[_valueName];\\n newValueMap[_valueName] = {\\n name: _value.name,\\n description: _value.description,\\n value: _value.value,\\n deprecationReason: _value.deprecationReason,\\n astNode: _value.astNode\\n };\\n } // If there are any extensions to the values, apply those here.\\n\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion4 = true;\\n var _didIteratorError4 = false;\\n var _iteratorError4 = undefined;\\n\\n try {\\n for (var _iterator4 = extensions[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\\n var extension = _step4.value;\\n var _iteratorNormalCompletion5 = true;\\n var _didIteratorError5 = false;\\n var _iteratorError5 = undefined;\\n\\n try {\\n for (var _iterator5 = extension.values[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\\n var value = _step5.value;\\n var valueName = value.name.value;\\n\\n if (oldValueMap[valueName]) {\\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\\\"a\\\" /* GraphQLError */](\\\"Enum value \\\\\\\"\\\".concat(type.name, \\\".\\\").concat(valueName, \\\"\\\\\\\" already exists in the \\\") + 'schema. It cannot also be defined in this type extension.', [value]);\\n }\\n\\n newValueMap[valueName] = astBuilder.buildEnumValue(value);\\n }\\n } catch (err) {\\n _didIteratorError5 = true;\\n _iteratorError5 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\\n _iterator5.return();\\n }\\n } finally {\\n if (_didIteratorError5) {\\n throw _iteratorError5;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError4 = true;\\n _iteratorError4 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\\n _iterator4.return();\\n }\\n } finally {\\n if (_didIteratorError4) {\\n throw _iteratorError4;\\n }\\n }\\n }\\n }\\n\\n return newValueMap;\\n }\\n\\n function extendScalarType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"g\\\" /* GraphQLScalarType */]({\\n name: name,\\n description: type.description,\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n serialize: type.serialize,\\n parseValue: type.parseValue,\\n parseLiteral: type.parseLiteral\\n });\\n }\\n\\n function extendObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"f\\\" /* GraphQLObjectType */]({\\n name: name,\\n description: type.description,\\n interfaces: function interfaces() {\\n return extendImplementedInterfaces(type);\\n },\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n isTypeOf: type.isTypeOf\\n });\\n }\\n\\n function extendArgs(args) {\\n return Object(__WEBPACK_IMPORTED_MODULE_2__jsutils_keyValMap__[\\\"a\\\" /* default */])(args, function (arg) {\\n return arg.name;\\n }, function (arg) {\\n return {\\n type: extendType(arg.type),\\n defaultValue: arg.defaultValue,\\n description: arg.description,\\n astNode: arg.astNode\\n };\\n });\\n }\\n\\n function extendInterfaceType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"c\\\" /* GraphQLInterfaceType */]({\\n name: type.name,\\n description: type.description,\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n resolveType: type.resolveType\\n });\\n }\\n\\n function extendUnionType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new __WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"h\\\" /* GraphQLUnionType */]({\\n name: name,\\n description: type.description,\\n types: function types() {\\n return extendPossibleTypes(type);\\n },\\n astNode: type.astNode,\\n resolveType: type.resolveType,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendPossibleTypes(type) {\\n var possibleTypes = type.getTypes().map(extendNamedType); // If there are any extensions to the union, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion6 = true;\\n var _didIteratorError6 = false;\\n var _iteratorError6 = undefined;\\n\\n try {\\n for (var _iterator6 = extensions[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\\n var extension = _step6.value;\\n var _iteratorNormalCompletion7 = true;\\n var _didIteratorError7 = false;\\n var _iteratorError7 = undefined;\\n\\n try {\\n for (var _iterator7 = extension.types[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {\\n var namedType = _step7.value;\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n possibleTypes.push(astBuilder.buildType(namedType));\\n }\\n } catch (err) {\\n _didIteratorError7 = true;\\n _iteratorError7 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion7 && _iterator7.return != null) {\\n _iterator7.return();\\n }\\n } finally {\\n if (_didIteratorError7) {\\n throw _iteratorError7;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError6 = true;\\n _iteratorError6 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\\n _iterator6.return();\\n }\\n } finally {\\n if (_didIteratorError6) {\\n throw _iteratorError6;\\n }\\n }\\n }\\n }\\n\\n return possibleTypes;\\n }\\n\\n function extendImplementedInterfaces(type) {\\n var interfaces = type.getInterfaces().map(extendNamedType); // If there are any extensions to the interfaces, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion8 = true;\\n var _didIteratorError8 = false;\\n var _iteratorError8 = undefined;\\n\\n try {\\n for (var _iterator8 = extensions[Symbol.iterator](), _step8; !(_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done); _iteratorNormalCompletion8 = true) {\\n var extension = _step8.value;\\n var _iteratorNormalCompletion9 = true;\\n var _didIteratorError9 = false;\\n var _iteratorError9 = undefined;\\n\\n try {\\n for (var _iterator9 = extension.interfaces[Symbol.iterator](), _step9; !(_iteratorNormalCompletion9 = (_step9 = _iterator9.next()).done); _iteratorNormalCompletion9 = true) {\\n var namedType = _step9.value;\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n interfaces.push(astBuilder.buildType(namedType));\\n }\\n } catch (err) {\\n _didIteratorError9 = true;\\n _iteratorError9 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion9 && _iterator9.return != null) {\\n _iterator9.return();\\n }\\n } finally {\\n if (_didIteratorError9) {\\n throw _iteratorError9;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError8 = true;\\n _iteratorError8 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion8 && _iterator8.return != null) {\\n _iterator8.return();\\n }\\n } finally {\\n if (_didIteratorError8) {\\n throw _iteratorError8;\\n }\\n }\\n }\\n }\\n\\n return interfaces;\\n }\\n\\n function extendFieldMap(type) {\\n var newFieldMap = Object.create(null);\\n var oldFieldMap = type.getFields();\\n\\n var _arr3 = Object.keys(oldFieldMap);\\n\\n for (var _i4 = 0; _i4 < _arr3.length; _i4++) {\\n var _fieldName2 = _arr3[_i4];\\n var _field2 = oldFieldMap[_fieldName2];\\n newFieldMap[_fieldName2] = {\\n description: _field2.description,\\n deprecationReason: _field2.deprecationReason,\\n type: extendType(_field2.type),\\n args: extendArgs(_field2.args),\\n astNode: _field2.astNode,\\n resolve: _field2.resolve\\n };\\n } // If there are any extensions to the fields, apply those here.\\n\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion10 = true;\\n var _didIteratorError10 = false;\\n var _iteratorError10 = undefined;\\n\\n try {\\n for (var _iterator10 = extensions[Symbol.iterator](), _step10; !(_iteratorNormalCompletion10 = (_step10 = _iterator10.next()).done); _iteratorNormalCompletion10 = true) {\\n var extension = _step10.value;\\n var _iteratorNormalCompletion11 = true;\\n var _didIteratorError11 = false;\\n var _iteratorError11 = undefined;\\n\\n try {\\n for (var _iterator11 = extension.fields[Symbol.iterator](), _step11; !(_iteratorNormalCompletion11 = (_step11 = _iterator11.next()).done); _iteratorNormalCompletion11 = true) {\\n var field = _step11.value;\\n var fieldName = field.name.value;\\n\\n if (oldFieldMap[fieldName]) {\\n throw new __WEBPACK_IMPORTED_MODULE_6__error_GraphQLError__[\\\"a\\\" /* GraphQLError */](\\\"Field \\\\\\\"\\\".concat(type.name, \\\".\\\").concat(fieldName, \\\"\\\\\\\" already exists in the \\\") + 'schema. It cannot also be defined in this type extension.', [field]);\\n }\\n\\n newFieldMap[fieldName] = astBuilder.buildField(field);\\n }\\n } catch (err) {\\n _didIteratorError11 = true;\\n _iteratorError11 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion11 && _iterator11.return != null) {\\n _iterator11.return();\\n }\\n } finally {\\n if (_didIteratorError11) {\\n throw _iteratorError11;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError10 = true;\\n _iteratorError10 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion10 && _iterator10.return != null) {\\n _iterator10.return();\\n }\\n } finally {\\n if (_didIteratorError10) {\\n throw _iteratorError10;\\n }\\n }\\n }\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendType(typeDef) {\\n if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"u\\\" /* isListType */])(typeDef)) {\\n return Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"d\\\" /* GraphQLList */])(extendType(typeDef.ofType));\\n }\\n\\n if (Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"w\\\" /* isNonNullType */])(typeDef)) {\\n return Object(__WEBPACK_IMPORTED_MODULE_10__type_definition__[\\\"e\\\" /* GraphQLNonNull */])(extendType(typeDef.ofType));\\n }\\n\\n return extendNamedType(typeDef);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4021e78a656826ee529398aed28869aa\",\n \"score\": \"0.50598526\",\n \"text\": \"updateSchema () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50277082d639d9817296e67eb2001223\",\n \"score\": \"0.50280523\",\n \"text\": \"function _mergeConfig(config1, config2){ //must be called with App.DataTable context.\\n\\t\\treturn this.$.extend(config1, config2);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e64fb62967dcbfb1ceac1aa56acfc35e\",\n \"score\": \"0.5015154\",\n \"text\": \"function merge(a, b) {\\n if (a && b) {\\n for (var key in b) {\\n a[key] = b[key];\\n }\\n }\\n return a;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9489c275aeb95e7ec22b71d827adc929\",\n \"score\": \"0.50115395\",\n \"text\": \"loadSharedSchemas () {\\n this.loadSchemasFromDirectory(BASE_DIR)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fa6d5e7ada3f04c07ea337532bf4630\",\n \"score\": \"0.500577\",\n \"text\": \"function updateFromV1ToV2(schema) {\\r\\n let updated = {\\r\\n schemaVersion: 2,\\r\\n themes: {}\\r\\n };\\r\\n\\r\\n for (let themeName in schema.themes) {\\r\\n let theme = schema.themes[themeName];\\r\\n\\r\\n updated.themes[themeName] = Object.assign({}, theme, {\\r\\n name: themeName\\r\\n });\\r\\n }\\r\\n\\r\\n return updated;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"935949007f5b1309be7502c935482c70\",\n \"score\": \"0.49434566\",\n \"text\": \"merge(a, b) {\\n for (var key in b) {\\n if (!a.hasOwnProperty(key)) {\\n a[key] = b[key]\\n } else if (this.isObject(b[key],1) && this.isObject(a[key],1)) {\\n this.merge(a[key], b[key])\\n }\\n }\\n return a;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1f2e11365f68acbd987eff5209d815c\",\n \"score\": \"0.4934107\",\n \"text\": \"function merge(a, b) {\\n if ( a ) {\\n for ( var property in b ) {\\n if ( !hasOwnProperty.call(a, property) ) {\\n a[property] = b[property];\\n }\\n }\\n } else {\\n a = b;\\n }\\n\\n return a;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e11fcb98306aaada8982d2d099c567b\",\n \"score\": \"0.49147728\",\n \"text\": \"function extendSchema(schema, documentAST, options) {\\n !(0, _schema.isSchema)(schema) ? (0, _invariant.default)(0, 'Must provide valid GraphQLSchema') : void 0;\\n !(documentAST && documentAST.kind === _kinds.Kind.DOCUMENT) ? (0, _invariant.default)(0, 'Must provide valid Document AST') : void 0;\\n\\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\\n (0, _validate.assertValidSDLExtension)(documentAST, schema);\\n } // Collect the type definitions and extensions found in the document.\\n\\n\\n var typeDefinitionMap = Object.create(null);\\n var typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\\n // have the same name. For example, a type named \\\"skip\\\".\\n\\n var directiveDefinitions = [];\\n var schemaDef; // Schema extensions are collected which may add additional operation types.\\n\\n var schemaExtensions = [];\\n\\n for (var i = 0; i < documentAST.definitions.length; i++) {\\n var def = documentAST.definitions[i];\\n\\n if (def.kind === _kinds.Kind.SCHEMA_DEFINITION) {\\n schemaDef = def;\\n } else if (def.kind === _kinds.Kind.SCHEMA_EXTENSION) {\\n schemaExtensions.push(def);\\n } else if ((0, _predicates.isTypeDefinitionNode)(def)) {\\n // Sanity check that none of the defined types conflict with the\\n // schema's existing types.\\n var typeName = def.name.value;\\n\\n if (schema.getType(typeName)) {\\n throw new _GraphQLError.GraphQLError(\\\"Type \\\\\\\"\\\".concat(typeName, \\\"\\\\\\\" already exists in the schema. It cannot also \\\") + 'be defined in this type definition.', [def]);\\n }\\n\\n typeDefinitionMap[typeName] = def;\\n } else if ((0, _predicates.isTypeExtensionNode)(def)) {\\n // Sanity check that this type extension exists within the\\n // schema's existing types.\\n var extendedTypeName = def.name.value;\\n var existingType = schema.getType(extendedTypeName);\\n\\n if (!existingType) {\\n throw new _GraphQLError.GraphQLError(\\\"Cannot extend type \\\\\\\"\\\".concat(extendedTypeName, \\\"\\\\\\\" because it does not \\\") + 'exist in the existing schema.', [def]);\\n }\\n\\n checkExtensionNode(existingType, def);\\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\\n } else if (def.kind === _kinds.Kind.DIRECTIVE_DEFINITION) {\\n var directiveName = def.name.value;\\n var existingDirective = schema.getDirective(directiveName);\\n\\n if (existingDirective) {\\n throw new _GraphQLError.GraphQLError(\\\"Directive \\\\\\\"\\\".concat(directiveName, \\\"\\\\\\\" already exists in the schema. It \\\") + 'cannot be redefined.', [def]);\\n }\\n\\n directiveDefinitions.push(def);\\n }\\n } // If this document contains no new types, extensions, or directives then\\n // return the same unmodified GraphQLSchema instance.\\n\\n\\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0 && schemaExtensions.length === 0 && !schemaDef) {\\n return schema;\\n }\\n\\n var astBuilder = new _buildASTSchema.ASTDefinitionBuilder(typeDefinitionMap, options, function (typeRef) {\\n var typeName = typeRef.name.value;\\n var existingType = schema.getType(typeName);\\n\\n if (existingType) {\\n return extendNamedType(existingType);\\n }\\n\\n throw new _GraphQLError.GraphQLError(\\\"Unknown type: \\\\\\\"\\\".concat(typeName, \\\"\\\\\\\". Ensure that this type exists \\\") + 'either in the original schema, or is added in a type definition.', [typeRef]);\\n });\\n var extendTypeCache = Object.create(null); // Get the extended root operation types.\\n\\n var operationTypes = {\\n query: extendMaybeNamedType(schema.getQueryType()),\\n mutation: extendMaybeNamedType(schema.getMutationType()),\\n subscription: extendMaybeNamedType(schema.getSubscriptionType())\\n };\\n\\n if (schemaDef) {\\n var _iteratorNormalCompletion = true;\\n var _didIteratorError = false;\\n var _iteratorError = undefined;\\n\\n try {\\n for (var _iterator = schemaDef.operationTypes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\\n var _ref2 = _step.value;\\n var operation = _ref2.operation,\\n type = _ref2.type;\\n\\n if (operationTypes[operation]) {\\n throw new Error(\\\"Must provide only one \\\".concat(operation, \\\" type in schema.\\\"));\\n } // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n\\n\\n operationTypes[operation] = astBuilder.buildType(type);\\n }\\n } catch (err) {\\n _didIteratorError = true;\\n _iteratorError = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion && _iterator.return != null) {\\n _iterator.return();\\n }\\n } finally {\\n if (_didIteratorError) {\\n throw _iteratorError;\\n }\\n }\\n }\\n } // Then, incorporate schema definition and all schema extensions.\\n\\n\\n for (var _i = 0; _i < schemaExtensions.length; _i++) {\\n var schemaExtension = schemaExtensions[_i];\\n\\n if (schemaExtension.operationTypes) {\\n var _iteratorNormalCompletion12 = true;\\n var _didIteratorError12 = false;\\n var _iteratorError12 = undefined;\\n\\n try {\\n for (var _iterator12 = schemaExtension.operationTypes[Symbol.iterator](), _step12; !(_iteratorNormalCompletion12 = (_step12 = _iterator12.next()).done); _iteratorNormalCompletion12 = true) {\\n var _ref4 = _step12.value;\\n var operation = _ref4.operation,\\n type = _ref4.type;\\n\\n if (operationTypes[operation]) {\\n throw new Error(\\\"Must provide only one \\\".concat(operation, \\\" type in schema.\\\"));\\n } // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n\\n\\n operationTypes[operation] = astBuilder.buildType(type);\\n }\\n } catch (err) {\\n _didIteratorError12 = true;\\n _iteratorError12 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion12 && _iterator12.return != null) {\\n _iterator12.return();\\n }\\n } finally {\\n if (_didIteratorError12) {\\n throw _iteratorError12;\\n }\\n }\\n }\\n }\\n }\\n\\n var schemaExtensionASTNodes = schemaExtensions ? schema.extensionASTNodes ? schema.extensionASTNodes.concat(schemaExtensions) : schemaExtensions : schema.extensionASTNodes;\\n var types = (0, _objectValues.default)(schema.getTypeMap()).map(function (type) {\\n return extendNamedType(type);\\n }).concat((0, _objectValues.default)(typeDefinitionMap).map(function (type) {\\n return astBuilder.buildType(type);\\n })); // Support both original legacy names and extended legacy names.\\n\\n var allowedLegacyNames = schema.__allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\\n\\n\\n return new _schema.GraphQLSchema(_objectSpread({}, operationTypes, {\\n types: types,\\n directives: getMergedDirectives(),\\n astNode: schema.astNode,\\n extensionASTNodes: schemaExtensionASTNodes,\\n allowedLegacyNames: allowedLegacyNames\\n })); // Below are functions used for producing this schema that have closed over\\n // this scope and have access to the schema, cache, and newly defined types.\\n\\n function getMergedDirectives() {\\n var existingDirectives = schema.getDirectives().map(extendDirective);\\n !existingDirectives ? (0, _invariant.default)(0, 'schema must have default directives') : void 0;\\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\\n return astBuilder.buildDirective(node);\\n }));\\n }\\n\\n function extendMaybeNamedType(type) {\\n return type ? extendNamedType(type) : null;\\n }\\n\\n function extendNamedType(type) {\\n if ((0, _introspection.isIntrospectionType)(type) || (0, _scalars.isSpecifiedScalarType)(type)) {\\n // Builtin types are not extended.\\n return type;\\n }\\n\\n var name = type.name;\\n\\n if (!extendTypeCache[name]) {\\n if ((0, _definition.isScalarType)(type)) {\\n extendTypeCache[name] = extendScalarType(type);\\n } else if ((0, _definition.isObjectType)(type)) {\\n extendTypeCache[name] = extendObjectType(type);\\n } else if ((0, _definition.isInterfaceType)(type)) {\\n extendTypeCache[name] = extendInterfaceType(type);\\n } else if ((0, _definition.isUnionType)(type)) {\\n extendTypeCache[name] = extendUnionType(type);\\n } else if ((0, _definition.isEnumType)(type)) {\\n extendTypeCache[name] = extendEnumType(type);\\n } else if ((0, _definition.isInputObjectType)(type)) {\\n extendTypeCache[name] = extendInputObjectType(type);\\n }\\n }\\n\\n return extendTypeCache[name];\\n }\\n\\n function extendDirective(directive) {\\n return new _directives.GraphQLDirective({\\n name: directive.name,\\n description: directive.description,\\n locations: directive.locations,\\n args: extendArgs(directive.args),\\n astNode: directive.astNode\\n });\\n }\\n\\n function extendInputObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLInputObjectType({\\n name: name,\\n description: type.description,\\n fields: function fields() {\\n return extendInputFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendInputFieldMap(type) {\\n var newFieldMap = Object.create(null);\\n var oldFieldMap = type.getFields();\\n\\n var _arr = Object.keys(oldFieldMap);\\n\\n for (var _i2 = 0; _i2 < _arr.length; _i2++) {\\n var _fieldName = _arr[_i2];\\n var _field = oldFieldMap[_fieldName];\\n newFieldMap[_fieldName] = {\\n description: _field.description,\\n type: extendType(_field.type),\\n defaultValue: _field.defaultValue,\\n astNode: _field.astNode\\n };\\n } // If there are any extensions to the fields, apply those here.\\n\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion2 = true;\\n var _didIteratorError2 = false;\\n var _iteratorError2 = undefined;\\n\\n try {\\n for (var _iterator2 = extensions[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\\n var extension = _step2.value;\\n var _iteratorNormalCompletion3 = true;\\n var _didIteratorError3 = false;\\n var _iteratorError3 = undefined;\\n\\n try {\\n for (var _iterator3 = extension.fields[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\\n var field = _step3.value;\\n var fieldName = field.name.value;\\n\\n if (oldFieldMap[fieldName]) {\\n throw new _GraphQLError.GraphQLError(\\\"Field \\\\\\\"\\\".concat(type.name, \\\".\\\").concat(fieldName, \\\"\\\\\\\" already exists in the \\\") + 'schema. It cannot also be defined in this type extension.', [field]);\\n }\\n\\n newFieldMap[fieldName] = astBuilder.buildInputField(field);\\n }\\n } catch (err) {\\n _didIteratorError3 = true;\\n _iteratorError3 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\\n _iterator3.return();\\n }\\n } finally {\\n if (_didIteratorError3) {\\n throw _iteratorError3;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError2 = true;\\n _iteratorError2 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\\n _iterator2.return();\\n }\\n } finally {\\n if (_didIteratorError2) {\\n throw _iteratorError2;\\n }\\n }\\n }\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendEnumType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLEnumType({\\n name: name,\\n description: type.description,\\n values: extendValueMap(type),\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendValueMap(type) {\\n var newValueMap = Object.create(null);\\n var oldValueMap = (0, _keyMap.default)(type.getValues(), function (value) {\\n return value.name;\\n });\\n\\n var _arr2 = Object.keys(oldValueMap);\\n\\n for (var _i3 = 0; _i3 < _arr2.length; _i3++) {\\n var _valueName = _arr2[_i3];\\n var _value = oldValueMap[_valueName];\\n newValueMap[_valueName] = {\\n name: _value.name,\\n description: _value.description,\\n value: _value.value,\\n deprecationReason: _value.deprecationReason,\\n astNode: _value.astNode\\n };\\n } // If there are any extensions to the values, apply those here.\\n\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion4 = true;\\n var _didIteratorError4 = false;\\n var _iteratorError4 = undefined;\\n\\n try {\\n for (var _iterator4 = extensions[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\\n var extension = _step4.value;\\n var _iteratorNormalCompletion5 = true;\\n var _didIteratorError5 = false;\\n var _iteratorError5 = undefined;\\n\\n try {\\n for (var _iterator5 = extension.values[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\\n var value = _step5.value;\\n var valueName = value.name.value;\\n\\n if (oldValueMap[valueName]) {\\n throw new _GraphQLError.GraphQLError(\\\"Enum value \\\\\\\"\\\".concat(type.name, \\\".\\\").concat(valueName, \\\"\\\\\\\" already exists in the \\\") + 'schema. It cannot also be defined in this type extension.', [value]);\\n }\\n\\n newValueMap[valueName] = astBuilder.buildEnumValue(value);\\n }\\n } catch (err) {\\n _didIteratorError5 = true;\\n _iteratorError5 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\\n _iterator5.return();\\n }\\n } finally {\\n if (_didIteratorError5) {\\n throw _iteratorError5;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError4 = true;\\n _iteratorError4 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\\n _iterator4.return();\\n }\\n } finally {\\n if (_didIteratorError4) {\\n throw _iteratorError4;\\n }\\n }\\n }\\n }\\n\\n return newValueMap;\\n }\\n\\n function extendScalarType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLScalarType({\\n name: name,\\n description: type.description,\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n serialize: type.serialize,\\n parseValue: type.parseValue,\\n parseLiteral: type.parseLiteral\\n });\\n }\\n\\n function extendObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLObjectType({\\n name: name,\\n description: type.description,\\n interfaces: function interfaces() {\\n return extendImplementedInterfaces(type);\\n },\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n isTypeOf: type.isTypeOf\\n });\\n }\\n\\n function extendArgs(args) {\\n return (0, _keyValMap.default)(args, function (arg) {\\n return arg.name;\\n }, function (arg) {\\n return {\\n type: extendType(arg.type),\\n defaultValue: arg.defaultValue,\\n description: arg.description,\\n astNode: arg.astNode\\n };\\n });\\n }\\n\\n function extendInterfaceType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLInterfaceType({\\n name: type.name,\\n description: type.description,\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n resolveType: type.resolveType\\n });\\n }\\n\\n function extendUnionType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLUnionType({\\n name: name,\\n description: type.description,\\n types: function types() {\\n return extendPossibleTypes(type);\\n },\\n astNode: type.astNode,\\n resolveType: type.resolveType,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendPossibleTypes(type) {\\n var possibleTypes = type.getTypes().map(extendNamedType); // If there are any extensions to the union, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion6 = true;\\n var _didIteratorError6 = false;\\n var _iteratorError6 = undefined;\\n\\n try {\\n for (var _iterator6 = extensions[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\\n var extension = _step6.value;\\n var _iteratorNormalCompletion7 = true;\\n var _didIteratorError7 = false;\\n var _iteratorError7 = undefined;\\n\\n try {\\n for (var _iterator7 = extension.types[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {\\n var namedType = _step7.value;\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n possibleTypes.push(astBuilder.buildType(namedType));\\n }\\n } catch (err) {\\n _didIteratorError7 = true;\\n _iteratorError7 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion7 && _iterator7.return != null) {\\n _iterator7.return();\\n }\\n } finally {\\n if (_didIteratorError7) {\\n throw _iteratorError7;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError6 = true;\\n _iteratorError6 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\\n _iterator6.return();\\n }\\n } finally {\\n if (_didIteratorError6) {\\n throw _iteratorError6;\\n }\\n }\\n }\\n }\\n\\n return possibleTypes;\\n }\\n\\n function extendImplementedInterfaces(type) {\\n var interfaces = type.getInterfaces().map(extendNamedType); // If there are any extensions to the interfaces, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion8 = true;\\n var _didIteratorError8 = false;\\n var _iteratorError8 = undefined;\\n\\n try {\\n for (var _iterator8 = extensions[Symbol.iterator](), _step8; !(_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done); _iteratorNormalCompletion8 = true) {\\n var extension = _step8.value;\\n var _iteratorNormalCompletion9 = true;\\n var _didIteratorError9 = false;\\n var _iteratorError9 = undefined;\\n\\n try {\\n for (var _iterator9 = extension.interfaces[Symbol.iterator](), _step9; !(_iteratorNormalCompletion9 = (_step9 = _iterator9.next()).done); _iteratorNormalCompletion9 = true) {\\n var namedType = _step9.value;\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n interfaces.push(astBuilder.buildType(namedType));\\n }\\n } catch (err) {\\n _didIteratorError9 = true;\\n _iteratorError9 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion9 && _iterator9.return != null) {\\n _iterator9.return();\\n }\\n } finally {\\n if (_didIteratorError9) {\\n throw _iteratorError9;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError8 = true;\\n _iteratorError8 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion8 && _iterator8.return != null) {\\n _iterator8.return();\\n }\\n } finally {\\n if (_didIteratorError8) {\\n throw _iteratorError8;\\n }\\n }\\n }\\n }\\n\\n return interfaces;\\n }\\n\\n function extendFieldMap(type) {\\n var newFieldMap = Object.create(null);\\n var oldFieldMap = type.getFields();\\n\\n var _arr3 = Object.keys(oldFieldMap);\\n\\n for (var _i4 = 0; _i4 < _arr3.length; _i4++) {\\n var _fieldName2 = _arr3[_i4];\\n var _field2 = oldFieldMap[_fieldName2];\\n newFieldMap[_fieldName2] = {\\n description: _field2.description,\\n deprecationReason: _field2.deprecationReason,\\n type: extendType(_field2.type),\\n args: extendArgs(_field2.args),\\n astNode: _field2.astNode,\\n resolve: _field2.resolve\\n };\\n } // If there are any extensions to the fields, apply those here.\\n\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion10 = true;\\n var _didIteratorError10 = false;\\n var _iteratorError10 = undefined;\\n\\n try {\\n for (var _iterator10 = extensions[Symbol.iterator](), _step10; !(_iteratorNormalCompletion10 = (_step10 = _iterator10.next()).done); _iteratorNormalCompletion10 = true) {\\n var extension = _step10.value;\\n var _iteratorNormalCompletion11 = true;\\n var _didIteratorError11 = false;\\n var _iteratorError11 = undefined;\\n\\n try {\\n for (var _iterator11 = extension.fields[Symbol.iterator](), _step11; !(_iteratorNormalCompletion11 = (_step11 = _iterator11.next()).done); _iteratorNormalCompletion11 = true) {\\n var field = _step11.value;\\n var fieldName = field.name.value;\\n\\n if (oldFieldMap[fieldName]) {\\n throw new _GraphQLError.GraphQLError(\\\"Field \\\\\\\"\\\".concat(type.name, \\\".\\\").concat(fieldName, \\\"\\\\\\\" already exists in the \\\") + 'schema. It cannot also be defined in this type extension.', [field]);\\n }\\n\\n newFieldMap[fieldName] = astBuilder.buildField(field);\\n }\\n } catch (err) {\\n _didIteratorError11 = true;\\n _iteratorError11 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion11 && _iterator11.return != null) {\\n _iterator11.return();\\n }\\n } finally {\\n if (_didIteratorError11) {\\n throw _iteratorError11;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError10 = true;\\n _iteratorError10 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion10 && _iterator10.return != null) {\\n _iterator10.return();\\n }\\n } finally {\\n if (_didIteratorError10) {\\n throw _iteratorError10;\\n }\\n }\\n }\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendType(typeDef) {\\n if ((0, _definition.isListType)(typeDef)) {\\n return (0, _definition.GraphQLList)(extendType(typeDef.ofType));\\n }\\n\\n if ((0, _definition.isNonNullType)(typeDef)) {\\n return (0, _definition.GraphQLNonNull)(extendType(typeDef.ofType));\\n }\\n\\n return extendNamedType(typeDef);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43ca22257c545785f89730da047ada5f\",\n \"score\": \"0.49147728\",\n \"text\": \"function extendSchema(schema, documentAST, options) {\\n !(0, _schema.isSchema)(schema) ? (0, _invariant.default)(0, 'Must provide valid GraphQLSchema') : void 0;\\n !(documentAST && documentAST.kind === _kinds.Kind.DOCUMENT) ? (0, _invariant.default)(0, 'Must provide valid Document AST') : void 0;\\n\\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\\n (0, _validate.assertValidSDLExtension)(documentAST, schema);\\n } // Collect the type definitions and extensions found in the document.\\n\\n\\n var typeDefinitionMap = Object.create(null);\\n var typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\\n // have the same name. For example, a type named \\\"skip\\\".\\n\\n var directiveDefinitions = [];\\n var schemaDef; // Schema extensions are collected which may add additional operation types.\\n\\n var schemaExtensions = [];\\n\\n for (var i = 0; i < documentAST.definitions.length; i++) {\\n var def = documentAST.definitions[i];\\n\\n if (def.kind === _kinds.Kind.SCHEMA_DEFINITION) {\\n schemaDef = def;\\n } else if (def.kind === _kinds.Kind.SCHEMA_EXTENSION) {\\n schemaExtensions.push(def);\\n } else if ((0, _predicates.isTypeDefinitionNode)(def)) {\\n // Sanity check that none of the defined types conflict with the\\n // schema's existing types.\\n var typeName = def.name.value;\\n\\n if (schema.getType(typeName)) {\\n throw new _GraphQLError.GraphQLError(\\\"Type \\\\\\\"\\\".concat(typeName, \\\"\\\\\\\" already exists in the schema. It cannot also \\\") + 'be defined in this type definition.', [def]);\\n }\\n\\n typeDefinitionMap[typeName] = def;\\n } else if ((0, _predicates.isTypeExtensionNode)(def)) {\\n // Sanity check that this type extension exists within the\\n // schema's existing types.\\n var extendedTypeName = def.name.value;\\n var existingType = schema.getType(extendedTypeName);\\n\\n if (!existingType) {\\n throw new _GraphQLError.GraphQLError(\\\"Cannot extend type \\\\\\\"\\\".concat(extendedTypeName, \\\"\\\\\\\" because it does not \\\") + 'exist in the existing schema.', [def]);\\n }\\n\\n checkExtensionNode(existingType, def);\\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\\n } else if (def.kind === _kinds.Kind.DIRECTIVE_DEFINITION) {\\n var directiveName = def.name.value;\\n var existingDirective = schema.getDirective(directiveName);\\n\\n if (existingDirective) {\\n throw new _GraphQLError.GraphQLError(\\\"Directive \\\\\\\"\\\".concat(directiveName, \\\"\\\\\\\" already exists in the schema. It \\\") + 'cannot be redefined.', [def]);\\n }\\n\\n directiveDefinitions.push(def);\\n }\\n } // If this document contains no new types, extensions, or directives then\\n // return the same unmodified GraphQLSchema instance.\\n\\n\\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0 && schemaExtensions.length === 0 && !schemaDef) {\\n return schema;\\n }\\n\\n var astBuilder = new _buildASTSchema.ASTDefinitionBuilder(typeDefinitionMap, options, function (typeRef) {\\n var typeName = typeRef.name.value;\\n var existingType = schema.getType(typeName);\\n\\n if (existingType) {\\n return extendNamedType(existingType);\\n }\\n\\n throw new _GraphQLError.GraphQLError(\\\"Unknown type: \\\\\\\"\\\".concat(typeName, \\\"\\\\\\\". Ensure that this type exists \\\") + 'either in the original schema, or is added in a type definition.', [typeRef]);\\n });\\n var extendTypeCache = Object.create(null); // Get the extended root operation types.\\n\\n var operationTypes = {\\n query: extendMaybeNamedType(schema.getQueryType()),\\n mutation: extendMaybeNamedType(schema.getMutationType()),\\n subscription: extendMaybeNamedType(schema.getSubscriptionType())\\n };\\n\\n if (schemaDef) {\\n var _iteratorNormalCompletion = true;\\n var _didIteratorError = false;\\n var _iteratorError = undefined;\\n\\n try {\\n for (var _iterator = schemaDef.operationTypes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\\n var _ref2 = _step.value;\\n var operation = _ref2.operation,\\n type = _ref2.type;\\n\\n if (operationTypes[operation]) {\\n throw new Error(\\\"Must provide only one \\\".concat(operation, \\\" type in schema.\\\"));\\n } // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n\\n\\n operationTypes[operation] = astBuilder.buildType(type);\\n }\\n } catch (err) {\\n _didIteratorError = true;\\n _iteratorError = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion && _iterator.return != null) {\\n _iterator.return();\\n }\\n } finally {\\n if (_didIteratorError) {\\n throw _iteratorError;\\n }\\n }\\n }\\n } // Then, incorporate schema definition and all schema extensions.\\n\\n\\n for (var _i = 0; _i < schemaExtensions.length; _i++) {\\n var schemaExtension = schemaExtensions[_i];\\n\\n if (schemaExtension.operationTypes) {\\n var _iteratorNormalCompletion12 = true;\\n var _didIteratorError12 = false;\\n var _iteratorError12 = undefined;\\n\\n try {\\n for (var _iterator12 = schemaExtension.operationTypes[Symbol.iterator](), _step12; !(_iteratorNormalCompletion12 = (_step12 = _iterator12.next()).done); _iteratorNormalCompletion12 = true) {\\n var _ref4 = _step12.value;\\n var operation = _ref4.operation,\\n type = _ref4.type;\\n\\n if (operationTypes[operation]) {\\n throw new Error(\\\"Must provide only one \\\".concat(operation, \\\" type in schema.\\\"));\\n } // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n\\n\\n operationTypes[operation] = astBuilder.buildType(type);\\n }\\n } catch (err) {\\n _didIteratorError12 = true;\\n _iteratorError12 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion12 && _iterator12.return != null) {\\n _iterator12.return();\\n }\\n } finally {\\n if (_didIteratorError12) {\\n throw _iteratorError12;\\n }\\n }\\n }\\n }\\n }\\n\\n var schemaExtensionASTNodes = schemaExtensions ? schema.extensionASTNodes ? schema.extensionASTNodes.concat(schemaExtensions) : schemaExtensions : schema.extensionASTNodes;\\n var types = (0, _objectValues.default)(schema.getTypeMap()).map(function (type) {\\n return extendNamedType(type);\\n }).concat((0, _objectValues.default)(typeDefinitionMap).map(function (type) {\\n return astBuilder.buildType(type);\\n })); // Support both original legacy names and extended legacy names.\\n\\n var allowedLegacyNames = schema.__allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\\n\\n\\n return new _schema.GraphQLSchema(_objectSpread({}, operationTypes, {\\n types: types,\\n directives: getMergedDirectives(),\\n astNode: schema.astNode,\\n extensionASTNodes: schemaExtensionASTNodes,\\n allowedLegacyNames: allowedLegacyNames\\n })); // Below are functions used for producing this schema that have closed over\\n // this scope and have access to the schema, cache, and newly defined types.\\n\\n function getMergedDirectives() {\\n var existingDirectives = schema.getDirectives().map(extendDirective);\\n !existingDirectives ? (0, _invariant.default)(0, 'schema must have default directives') : void 0;\\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\\n return astBuilder.buildDirective(node);\\n }));\\n }\\n\\n function extendMaybeNamedType(type) {\\n return type ? extendNamedType(type) : null;\\n }\\n\\n function extendNamedType(type) {\\n if ((0, _introspection.isIntrospectionType)(type) || (0, _scalars.isSpecifiedScalarType)(type)) {\\n // Builtin types are not extended.\\n return type;\\n }\\n\\n var name = type.name;\\n\\n if (!extendTypeCache[name]) {\\n if ((0, _definition.isScalarType)(type)) {\\n extendTypeCache[name] = extendScalarType(type);\\n } else if ((0, _definition.isObjectType)(type)) {\\n extendTypeCache[name] = extendObjectType(type);\\n } else if ((0, _definition.isInterfaceType)(type)) {\\n extendTypeCache[name] = extendInterfaceType(type);\\n } else if ((0, _definition.isUnionType)(type)) {\\n extendTypeCache[name] = extendUnionType(type);\\n } else if ((0, _definition.isEnumType)(type)) {\\n extendTypeCache[name] = extendEnumType(type);\\n } else if ((0, _definition.isInputObjectType)(type)) {\\n extendTypeCache[name] = extendInputObjectType(type);\\n }\\n }\\n\\n return extendTypeCache[name];\\n }\\n\\n function extendDirective(directive) {\\n return new _directives.GraphQLDirective({\\n name: directive.name,\\n description: directive.description,\\n locations: directive.locations,\\n args: extendArgs(directive.args),\\n astNode: directive.astNode\\n });\\n }\\n\\n function extendInputObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLInputObjectType({\\n name: name,\\n description: type.description,\\n fields: function fields() {\\n return extendInputFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendInputFieldMap(type) {\\n var newFieldMap = Object.create(null);\\n var oldFieldMap = type.getFields();\\n\\n var _arr = Object.keys(oldFieldMap);\\n\\n for (var _i2 = 0; _i2 < _arr.length; _i2++) {\\n var _fieldName = _arr[_i2];\\n var _field = oldFieldMap[_fieldName];\\n newFieldMap[_fieldName] = {\\n description: _field.description,\\n type: extendType(_field.type),\\n defaultValue: _field.defaultValue,\\n astNode: _field.astNode\\n };\\n } // If there are any extensions to the fields, apply those here.\\n\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion2 = true;\\n var _didIteratorError2 = false;\\n var _iteratorError2 = undefined;\\n\\n try {\\n for (var _iterator2 = extensions[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\\n var extension = _step2.value;\\n var _iteratorNormalCompletion3 = true;\\n var _didIteratorError3 = false;\\n var _iteratorError3 = undefined;\\n\\n try {\\n for (var _iterator3 = extension.fields[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\\n var field = _step3.value;\\n var fieldName = field.name.value;\\n\\n if (oldFieldMap[fieldName]) {\\n throw new _GraphQLError.GraphQLError(\\\"Field \\\\\\\"\\\".concat(type.name, \\\".\\\").concat(fieldName, \\\"\\\\\\\" already exists in the \\\") + 'schema. It cannot also be defined in this type extension.', [field]);\\n }\\n\\n newFieldMap[fieldName] = astBuilder.buildInputField(field);\\n }\\n } catch (err) {\\n _didIteratorError3 = true;\\n _iteratorError3 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\\n _iterator3.return();\\n }\\n } finally {\\n if (_didIteratorError3) {\\n throw _iteratorError3;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError2 = true;\\n _iteratorError2 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\\n _iterator2.return();\\n }\\n } finally {\\n if (_didIteratorError2) {\\n throw _iteratorError2;\\n }\\n }\\n }\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendEnumType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLEnumType({\\n name: name,\\n description: type.description,\\n values: extendValueMap(type),\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendValueMap(type) {\\n var newValueMap = Object.create(null);\\n var oldValueMap = (0, _keyMap.default)(type.getValues(), function (value) {\\n return value.name;\\n });\\n\\n var _arr2 = Object.keys(oldValueMap);\\n\\n for (var _i3 = 0; _i3 < _arr2.length; _i3++) {\\n var _valueName = _arr2[_i3];\\n var _value = oldValueMap[_valueName];\\n newValueMap[_valueName] = {\\n name: _value.name,\\n description: _value.description,\\n value: _value.value,\\n deprecationReason: _value.deprecationReason,\\n astNode: _value.astNode\\n };\\n } // If there are any extensions to the values, apply those here.\\n\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion4 = true;\\n var _didIteratorError4 = false;\\n var _iteratorError4 = undefined;\\n\\n try {\\n for (var _iterator4 = extensions[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\\n var extension = _step4.value;\\n var _iteratorNormalCompletion5 = true;\\n var _didIteratorError5 = false;\\n var _iteratorError5 = undefined;\\n\\n try {\\n for (var _iterator5 = extension.values[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\\n var value = _step5.value;\\n var valueName = value.name.value;\\n\\n if (oldValueMap[valueName]) {\\n throw new _GraphQLError.GraphQLError(\\\"Enum value \\\\\\\"\\\".concat(type.name, \\\".\\\").concat(valueName, \\\"\\\\\\\" already exists in the \\\") + 'schema. It cannot also be defined in this type extension.', [value]);\\n }\\n\\n newValueMap[valueName] = astBuilder.buildEnumValue(value);\\n }\\n } catch (err) {\\n _didIteratorError5 = true;\\n _iteratorError5 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\\n _iterator5.return();\\n }\\n } finally {\\n if (_didIteratorError5) {\\n throw _iteratorError5;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError4 = true;\\n _iteratorError4 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\\n _iterator4.return();\\n }\\n } finally {\\n if (_didIteratorError4) {\\n throw _iteratorError4;\\n }\\n }\\n }\\n }\\n\\n return newValueMap;\\n }\\n\\n function extendScalarType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLScalarType({\\n name: name,\\n description: type.description,\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n serialize: type.serialize,\\n parseValue: type.parseValue,\\n parseLiteral: type.parseLiteral\\n });\\n }\\n\\n function extendObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLObjectType({\\n name: name,\\n description: type.description,\\n interfaces: function interfaces() {\\n return extendImplementedInterfaces(type);\\n },\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n isTypeOf: type.isTypeOf\\n });\\n }\\n\\n function extendArgs(args) {\\n return (0, _keyValMap.default)(args, function (arg) {\\n return arg.name;\\n }, function (arg) {\\n return {\\n type: extendType(arg.type),\\n defaultValue: arg.defaultValue,\\n description: arg.description,\\n astNode: arg.astNode\\n };\\n });\\n }\\n\\n function extendInterfaceType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLInterfaceType({\\n name: type.name,\\n description: type.description,\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n resolveType: type.resolveType\\n });\\n }\\n\\n function extendUnionType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLUnionType({\\n name: name,\\n description: type.description,\\n types: function types() {\\n return extendPossibleTypes(type);\\n },\\n astNode: type.astNode,\\n resolveType: type.resolveType,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendPossibleTypes(type) {\\n var possibleTypes = type.getTypes().map(extendNamedType); // If there are any extensions to the union, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion6 = true;\\n var _didIteratorError6 = false;\\n var _iteratorError6 = undefined;\\n\\n try {\\n for (var _iterator6 = extensions[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\\n var extension = _step6.value;\\n var _iteratorNormalCompletion7 = true;\\n var _didIteratorError7 = false;\\n var _iteratorError7 = undefined;\\n\\n try {\\n for (var _iterator7 = extension.types[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {\\n var namedType = _step7.value; // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n\\n possibleTypes.push(astBuilder.buildType(namedType));\\n }\\n } catch (err) {\\n _didIteratorError7 = true;\\n _iteratorError7 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion7 && _iterator7.return != null) {\\n _iterator7.return();\\n }\\n } finally {\\n if (_didIteratorError7) {\\n throw _iteratorError7;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError6 = true;\\n _iteratorError6 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\\n _iterator6.return();\\n }\\n } finally {\\n if (_didIteratorError6) {\\n throw _iteratorError6;\\n }\\n }\\n }\\n }\\n\\n return possibleTypes;\\n }\\n\\n function extendImplementedInterfaces(type) {\\n var interfaces = type.getInterfaces().map(extendNamedType); // If there are any extensions to the interfaces, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion8 = true;\\n var _didIteratorError8 = false;\\n var _iteratorError8 = undefined;\\n\\n try {\\n for (var _iterator8 = extensions[Symbol.iterator](), _step8; !(_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done); _iteratorNormalCompletion8 = true) {\\n var extension = _step8.value;\\n var _iteratorNormalCompletion9 = true;\\n var _didIteratorError9 = false;\\n var _iteratorError9 = undefined;\\n\\n try {\\n for (var _iterator9 = extension.interfaces[Symbol.iterator](), _step9; !(_iteratorNormalCompletion9 = (_step9 = _iterator9.next()).done); _iteratorNormalCompletion9 = true) {\\n var namedType = _step9.value; // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n\\n interfaces.push(astBuilder.buildType(namedType));\\n }\\n } catch (err) {\\n _didIteratorError9 = true;\\n _iteratorError9 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion9 && _iterator9.return != null) {\\n _iterator9.return();\\n }\\n } finally {\\n if (_didIteratorError9) {\\n throw _iteratorError9;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError8 = true;\\n _iteratorError8 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion8 && _iterator8.return != null) {\\n _iterator8.return();\\n }\\n } finally {\\n if (_didIteratorError8) {\\n throw _iteratorError8;\\n }\\n }\\n }\\n }\\n\\n return interfaces;\\n }\\n\\n function extendFieldMap(type) {\\n var newFieldMap = Object.create(null);\\n var oldFieldMap = type.getFields();\\n\\n var _arr3 = Object.keys(oldFieldMap);\\n\\n for (var _i4 = 0; _i4 < _arr3.length; _i4++) {\\n var _fieldName2 = _arr3[_i4];\\n var _field2 = oldFieldMap[_fieldName2];\\n newFieldMap[_fieldName2] = {\\n description: _field2.description,\\n deprecationReason: _field2.deprecationReason,\\n type: extendType(_field2.type),\\n args: extendArgs(_field2.args),\\n astNode: _field2.astNode,\\n resolve: _field2.resolve\\n };\\n } // If there are any extensions to the fields, apply those here.\\n\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion10 = true;\\n var _didIteratorError10 = false;\\n var _iteratorError10 = undefined;\\n\\n try {\\n for (var _iterator10 = extensions[Symbol.iterator](), _step10; !(_iteratorNormalCompletion10 = (_step10 = _iterator10.next()).done); _iteratorNormalCompletion10 = true) {\\n var extension = _step10.value;\\n var _iteratorNormalCompletion11 = true;\\n var _didIteratorError11 = false;\\n var _iteratorError11 = undefined;\\n\\n try {\\n for (var _iterator11 = extension.fields[Symbol.iterator](), _step11; !(_iteratorNormalCompletion11 = (_step11 = _iterator11.next()).done); _iteratorNormalCompletion11 = true) {\\n var field = _step11.value;\\n var fieldName = field.name.value;\\n\\n if (oldFieldMap[fieldName]) {\\n throw new _GraphQLError.GraphQLError(\\\"Field \\\\\\\"\\\".concat(type.name, \\\".\\\").concat(fieldName, \\\"\\\\\\\" already exists in the \\\") + 'schema. It cannot also be defined in this type extension.', [field]);\\n }\\n\\n newFieldMap[fieldName] = astBuilder.buildField(field);\\n }\\n } catch (err) {\\n _didIteratorError11 = true;\\n _iteratorError11 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion11 && _iterator11.return != null) {\\n _iterator11.return();\\n }\\n } finally {\\n if (_didIteratorError11) {\\n throw _iteratorError11;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError10 = true;\\n _iteratorError10 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion10 && _iterator10.return != null) {\\n _iterator10.return();\\n }\\n } finally {\\n if (_didIteratorError10) {\\n throw _iteratorError10;\\n }\\n }\\n }\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendType(typeDef) {\\n if ((0, _definition.isListType)(typeDef)) {\\n return (0, _definition.GraphQLList)(extendType(typeDef.ofType));\\n }\\n\\n if ((0, _definition.isNonNullType)(typeDef)) {\\n return (0, _definition.GraphQLNonNull)(extendType(typeDef.ofType));\\n }\\n\\n return extendNamedType(typeDef);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbf654a1a079664d8dce8d149cb62c55\",\n \"score\": \"0.49089834\",\n \"text\": \"function merge(s1, s2) {\\n for (var key in s2) {\\n if (tipe(s1) !== 'object') s1 = {}\\n if (tipe(s2[key]) === 'object') {\\n s1[key] = merge(s1[key], s2[key])\\n }\\n else {\\n if (tipe(s1[key]) === 'array' && tipe(s2[key]) === 'array') {\\n s1[key] = s1[key].concat(s2[key])\\n }\\n else s1[key] = s2[key]\\n }\\n }\\n return s1\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94f1af2985ca0bdeb92ded2d37bb1843\",\n \"score\": \"0.4884164\",\n \"text\": \"function merge (a, b) {\\n b.forEach(function (doc) {\\n if (a.indexOf(doc) === -1)\\n a.push(doc);\\n });\\n\\n return a;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54fef18f4c0fc776c517c2fac042ebee\",\n \"score\": \"0.48836803\",\n \"text\": \"function extendSchema(schema, documentAST, options) {\\n\\t !isSchema(schema) ? invariant(0, 'Must provide valid GraphQLSchema') : void 0;\\n\\n\\t !(documentAST && documentAST.kind === Kind.DOCUMENT) ? invariant(0, 'Must provide valid Document AST') : void 0;\\n\\n\\t // Collect the type definitions and extensions found in the document.\\n\\t var typeDefinitionMap = Object.create(null);\\n\\t var typeExtensionsMap = Object.create(null);\\n\\n\\t // New directives and types are separate because a directives and types can\\n\\t // have the same name. For example, a type named \\\"skip\\\".\\n\\t var directiveDefinitions = [];\\n\\n\\t for (var i = 0; i < documentAST.definitions.length; i++) {\\n\\t var def = documentAST.definitions[i];\\n\\t switch (def.kind) {\\n\\t case Kind.OBJECT_TYPE_DEFINITION:\\n\\t case Kind.INTERFACE_TYPE_DEFINITION:\\n\\t case Kind.ENUM_TYPE_DEFINITION:\\n\\t case Kind.UNION_TYPE_DEFINITION:\\n\\t case Kind.SCALAR_TYPE_DEFINITION:\\n\\t case Kind.INPUT_OBJECT_TYPE_DEFINITION:\\n\\t // Sanity check that none of the defined types conflict with the\\n\\t // schema's existing types.\\n\\t var typeName = def.name.value;\\n\\t if (schema.getType(typeName)) {\\n\\t throw new GraphQLError('Type \\\"' + typeName + '\\\" already exists in the schema. It cannot also ' + 'be defined in this type definition.', [def]);\\n\\t }\\n\\t typeDefinitionMap[typeName] = def;\\n\\t break;\\n\\t case Kind.OBJECT_TYPE_EXTENSION:\\n\\t // Sanity check that this type extension exists within the\\n\\t // schema's existing types.\\n\\t var extendedTypeName = def.name.value;\\n\\t var existingType = schema.getType(extendedTypeName);\\n\\t if (!existingType) {\\n\\t throw new GraphQLError('Cannot extend type \\\"' + extendedTypeName + '\\\" because it does not ' + 'exist in the existing schema.', [def]);\\n\\t }\\n\\t if (!isObjectType(existingType)) {\\n\\t throw new GraphQLError('Cannot extend non-object type \\\"' + extendedTypeName + '\\\".', [def]);\\n\\t }\\n\\t var extensions = typeExtensionsMap[extendedTypeName];\\n\\t if (extensions) {\\n\\t extensions.push(def);\\n\\t } else {\\n\\t extensions = [def];\\n\\t }\\n\\t typeExtensionsMap[extendedTypeName] = extensions;\\n\\t break;\\n\\t case Kind.DIRECTIVE_DEFINITION:\\n\\t var directiveName = def.name.value;\\n\\t var existingDirective = schema.getDirective(directiveName);\\n\\t if (existingDirective) {\\n\\t throw new GraphQLError('Directive \\\"' + directiveName + '\\\" already exists in the schema. It ' + 'cannot be redefined.', [def]);\\n\\t }\\n\\t directiveDefinitions.push(def);\\n\\t break;\\n\\t case Kind.SCALAR_TYPE_EXTENSION:\\n\\t case Kind.INTERFACE_TYPE_EXTENSION:\\n\\t case Kind.UNION_TYPE_EXTENSION:\\n\\t case Kind.ENUM_TYPE_EXTENSION:\\n\\t case Kind.INPUT_OBJECT_TYPE_EXTENSION:\\n\\t throw new Error('The ' + def.kind + ' kind is not yet supported by extendSchema().');\\n\\t }\\n\\t }\\n\\n\\t // If this document contains no new types, extensions, or directives then\\n\\t // return the same unmodified GraphQLSchema instance.\\n\\t if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0) {\\n\\t return schema;\\n\\t }\\n\\n\\t var definitionBuilder = new ASTDefinitionBuilder(typeDefinitionMap, options, function (typeName, node) {\\n\\t var existingType = schema.getType(typeName);\\n\\t if (existingType) {\\n\\t return extendType(existingType);\\n\\t }\\n\\n\\t if (node) {\\n\\t throw new GraphQLError('Unknown type: \\\"' + typeName + '\\\". Ensure that this type exists ' + 'either in the original schema, or is added in a type definition.', [node]);\\n\\t }\\n\\t throw GraphQLError('Missing type from schema');\\n\\t });\\n\\n\\t // Get the root Query, Mutation, and Subscription object types.\\n\\t // Note: While this could make early assertions to get the correctly\\n\\t // typed values below, that would throw immediately while type system\\n\\t // validation with validateSchema() will produce more actionable results.\\n\\t var existingQueryType = schema.getQueryType();\\n\\t var queryType = existingQueryType ? definitionBuilder.buildType(existingQueryType.name) : null;\\n\\n\\t var existingMutationType = schema.getMutationType();\\n\\t var mutationType = existingMutationType ? definitionBuilder.buildType(existingMutationType.name) : null;\\n\\n\\t var existingSubscriptionType = schema.getSubscriptionType();\\n\\t var subscriptionType = existingSubscriptionType ? definitionBuilder.buildType(existingSubscriptionType.name) : null;\\n\\n\\t // Iterate through all types, getting the type definition for each, ensuring\\n\\t // that any type not directly referenced by a field will get created.\\n\\t var typeMap = schema.getTypeMap();\\n\\t var types = Object.keys(typeMap).map(function (typeName) {\\n\\t return definitionBuilder.buildType(typeName);\\n\\t });\\n\\n\\t // Do the same with new types, appending to the list of defined types.\\n\\t Object.keys(typeDefinitionMap).forEach(function (typeName) {\\n\\t types.push(definitionBuilder.buildType(typeName));\\n\\t });\\n\\n\\t // Then produce and return a Schema with these types.\\n\\t return new GraphQLSchema({\\n\\t query: queryType,\\n\\t mutation: mutationType,\\n\\t subscription: subscriptionType,\\n\\t types: types,\\n\\t directives: getMergedDirectives(),\\n\\t astNode: schema.astNode,\\n\\t allowedLegacyNames: schema.__allowedLegacyNames && schema.__allowedLegacyNames.slice()\\n\\t });\\n\\n\\t // Below are functions used for producing this schema that have closed over\\n\\t // this scope and have access to the schema, cache, and newly defined types.\\n\\n\\t function getMergedDirectives() {\\n\\t var existingDirectives = schema.getDirectives();\\n\\t !existingDirectives ? invariant(0, 'schema must have default directives') : void 0;\\n\\n\\t var newDirectives = directiveDefinitions.map(function (directiveNode) {\\n\\t return definitionBuilder.buildDirective(directiveNode);\\n\\t });\\n\\t return existingDirectives.concat(newDirectives);\\n\\t }\\n\\n\\t function getTypeFromDef(typeDef) {\\n\\t var type = definitionBuilder.buildType(typeDef.name);\\n\\t return type;\\n\\t }\\n\\n\\t // Given a type's introspection result, construct the correct\\n\\t // GraphQLType instance.\\n\\t function extendType(type) {\\n\\t if (isObjectType(type)) {\\n\\t return extendObjectType(type);\\n\\t }\\n\\t if (isInterfaceType(type)) {\\n\\t return extendInterfaceType(type);\\n\\t }\\n\\t if (isUnionType(type)) {\\n\\t return extendUnionType(type);\\n\\t }\\n\\t return type;\\n\\t }\\n\\n\\t function extendObjectType(type) {\\n\\t var name = type.name;\\n\\t var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n\\t return new GraphQLObjectType({\\n\\t name: name,\\n\\t description: type.description,\\n\\t interfaces: function interfaces() {\\n\\t return extendImplementedInterfaces(type);\\n\\t },\\n\\t fields: function fields() {\\n\\t return extendFieldMap(type);\\n\\t },\\n\\t astNode: type.astNode,\\n\\t extensionASTNodes: extensionASTNodes,\\n\\t isTypeOf: type.isTypeOf\\n\\t });\\n\\t }\\n\\n\\t function extendInterfaceType(type) {\\n\\t return new GraphQLInterfaceType({\\n\\t name: type.name,\\n\\t description: type.description,\\n\\t fields: function fields() {\\n\\t return extendFieldMap(type);\\n\\t },\\n\\t astNode: type.astNode,\\n\\t resolveType: type.resolveType\\n\\t });\\n\\t }\\n\\n\\t function extendUnionType(type) {\\n\\t return new GraphQLUnionType({\\n\\t name: type.name,\\n\\t description: type.description,\\n\\t types: type.getTypes().map(getTypeFromDef),\\n\\t astNode: type.astNode,\\n\\t resolveType: type.resolveType\\n\\t });\\n\\t }\\n\\n\\t function extendImplementedInterfaces(type) {\\n\\t var interfaces = type.getInterfaces().map(getTypeFromDef);\\n\\n\\t // If there are any extensions to the interfaces, apply those here.\\n\\t var extensions = typeExtensionsMap[type.name];\\n\\t if (extensions) {\\n\\t extensions.forEach(function (extension) {\\n\\t extension.interfaces.forEach(function (namedType) {\\n\\t // Note: While this could make early assertions to get the correctly\\n\\t // typed values, that would throw immediately while type system\\n\\t // validation with validateSchema() will produce more actionable results.\\n\\t interfaces.push(definitionBuilder.buildType(namedType));\\n\\t });\\n\\t });\\n\\t }\\n\\n\\t return interfaces;\\n\\t }\\n\\n\\t function extendFieldMap(type) {\\n\\t var newFieldMap = Object.create(null);\\n\\t var oldFieldMap = type.getFields();\\n\\t Object.keys(oldFieldMap).forEach(function (fieldName) {\\n\\t var field = oldFieldMap[fieldName];\\n\\t newFieldMap[fieldName] = {\\n\\t description: field.description,\\n\\t deprecationReason: field.deprecationReason,\\n\\t type: extendFieldType(field.type),\\n\\t args: keyMap(field.args, function (arg) {\\n\\t return arg.name;\\n\\t }),\\n\\t astNode: field.astNode,\\n\\t resolve: field.resolve\\n\\t };\\n\\t });\\n\\n\\t // If there are any extensions to the fields, apply those here.\\n\\t var extensions = typeExtensionsMap[type.name];\\n\\t if (extensions) {\\n\\t extensions.forEach(function (extension) {\\n\\t extension.fields.forEach(function (field) {\\n\\t var fieldName = field.name.value;\\n\\t if (oldFieldMap[fieldName]) {\\n\\t throw new GraphQLError('Field \\\"' + type.name + '.' + fieldName + '\\\" already exists in the ' + 'schema. It cannot also be defined in this type extension.', [field]);\\n\\t }\\n\\t newFieldMap[fieldName] = definitionBuilder.buildField(field);\\n\\t });\\n\\t });\\n\\t }\\n\\n\\t return newFieldMap;\\n\\t }\\n\\n\\t function extendFieldType(typeDef) {\\n\\t if (isListType(typeDef)) {\\n\\t return GraphQLList(extendFieldType(typeDef.ofType));\\n\\t }\\n\\t if (isNonNullType(typeDef)) {\\n\\t return GraphQLNonNull(extendFieldType(typeDef.ofType));\\n\\t }\\n\\t return getTypeFromDef(typeDef);\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d76f2905cee696511f8d7a692484f03\",\n \"score\": \"0.4878745\",\n \"text\": \"function mergeInstance(target, source) {\\n lodash.extend(target, lodash.cloneDeep(source));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"136042edf67e370f80c1f572dfaba25d\",\n \"score\": \"0.48773625\",\n \"text\": \"function SchemaExtend () {\\n\\tvar self=this;\\n\\n\\tthis.extend = function (toExtend,extendBy){\\n\\t\\tvar retval={};\\n\\t\\tObject.getOwnPropertyNames(toExtend).map(function(prop){\\n\\t\\t\\tretval[prop]= toExtend[prop];\\n\\t\\t});\\n\\n\\t\\tObject.getOwnPropertyNames(extendBy).map(function(prop){\\n\\t\\t\\t\\tvar value=extendBy[prop];\\n\\t\\t\\t\\tswitch(typeof value){\\n\\n\\t\\t\\t\\t\\tcase 'object':\\n\\t\\t\\t\\t\\t\\tvar v1=toExtend[prop];\\n\\t\\t\\t\\t\\t\\tif (value && typeof v1 == 'object' && !Array.isArray(value)){\\n\\t\\t\\t\\t\\t\\t\\tretval[prop]= self.extend( v1 , value);\\n\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\tretval[prop]=value;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\t\\tretval[prop]=value;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t}\\n\\t\\t});\\n\\t\\treturn retval;\\n\\t};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffeb3165cfa000548f730791986080d8\",\n \"score\": \"0.48730093\",\n \"text\": \"async function loadSchema(schemaPointers, options) {\\n const sources = await loadTypedefs(schemaPointers, {\\n filterKinds: OPERATION_KINDS,\\n ...options,\\n });\\n const { schemas, typeDefs } = collectSchemasAndTypeDefs(sources);\\n const mergeSchemasOptions = {\\n schemas,\\n typeDefs,\\n ...options,\\n };\\n const schema = await merge.mergeSchemasAsync(mergeSchemasOptions);\\n if (options === null || options === void 0 ? void 0 : options.includeSources) {\\n includeSources(schema, sources);\\n }\\n return schema;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e6d7bbbc92eb3c8d17d9e78c287676f\",\n \"score\": \"0.48546883\",\n \"text\": \"async function mergeSchemasAsync(config) {\\n const [typeDefs, resolvers, extensions] = await Promise.all([\\n mergeTypes(config),\\n Promise.all(config.schemas.map(async (schema) => utils.getResolversFromSchema(schema))).then(extractedResolvers => mergeResolvers([...extractedResolvers, ...ensureResolvers(config)], config)),\\n Promise.all(config.schemas.map(async (schema) => extractExtensionsFromSchema(schema))).then(extractedExtensions => mergeExtensions(extractedExtensions)),\\n ]);\\n return makeSchema({ resolvers, typeDefs, extensions }, config);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b86779fbb229873c866b3851e5a06e38\",\n \"score\": \"0.48539004\",\n \"text\": \"function extendSchema(schema, documentAST, options) {\\n !(0, _schema.isSchema)(schema) ? (0, _invariant2.default)(0, 'Must provide valid GraphQLSchema') : void 0;\\n\\n !(documentAST && documentAST.kind === _kinds.Kind.DOCUMENT) ? (0, _invariant2.default)(0, 'Must provide valid Document AST') : void 0;\\n\\n // Collect the type definitions and extensions found in the document.\\n var typeDefinitionMap = Object.create(null);\\n var typeExtensionsMap = Object.create(null);\\n\\n // New directives and types are separate because a directives and types can\\n // have the same name. For example, a type named \\\"skip\\\".\\n var directiveDefinitions = [];\\n\\n for (var i = 0; i < documentAST.definitions.length; i++) {\\n var def = documentAST.definitions[i];\\n switch (def.kind) {\\n case _kinds.Kind.OBJECT_TYPE_DEFINITION:\\n case _kinds.Kind.INTERFACE_TYPE_DEFINITION:\\n case _kinds.Kind.ENUM_TYPE_DEFINITION:\\n case _kinds.Kind.UNION_TYPE_DEFINITION:\\n case _kinds.Kind.SCALAR_TYPE_DEFINITION:\\n case _kinds.Kind.INPUT_OBJECT_TYPE_DEFINITION:\\n // Sanity check that none of the defined types conflict with the\\n // schema's existing types.\\n var typeName = def.name.value;\\n if (schema.getType(typeName)) {\\n throw new _GraphQLError.GraphQLError('Type \\\"' + typeName + '\\\" already exists in the schema. It cannot also ' + 'be defined in this type definition.', [def]);\\n }\\n typeDefinitionMap[typeName] = def;\\n break;\\n case _kinds.Kind.OBJECT_TYPE_EXTENSION:\\n case _kinds.Kind.INTERFACE_TYPE_EXTENSION:\\n // Sanity check that this type extension exists within the\\n // schema's existing types.\\n var extendedTypeName = def.name.value;\\n var existingType = schema.getType(extendedTypeName);\\n if (!existingType) {\\n throw new _GraphQLError.GraphQLError('Cannot extend type \\\"' + extendedTypeName + '\\\" because it does not ' + 'exist in the existing schema.', [def]);\\n }\\n checkExtensionNode(existingType, def);\\n\\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\\n break;\\n case _kinds.Kind.DIRECTIVE_DEFINITION:\\n var directiveName = def.name.value;\\n var existingDirective = schema.getDirective(directiveName);\\n if (existingDirective) {\\n throw new _GraphQLError.GraphQLError('Directive \\\"' + directiveName + '\\\" already exists in the schema. It ' + 'cannot be redefined.', [def]);\\n }\\n directiveDefinitions.push(def);\\n break;\\n case _kinds.Kind.SCALAR_TYPE_EXTENSION:\\n case _kinds.Kind.UNION_TYPE_EXTENSION:\\n case _kinds.Kind.ENUM_TYPE_EXTENSION:\\n case _kinds.Kind.INPUT_OBJECT_TYPE_EXTENSION:\\n throw new Error('The ' + def.kind + ' kind is not yet supported by extendSchema().');\\n }\\n }\\n\\n // If this document contains no new types, extensions, or directives then\\n // return the same unmodified GraphQLSchema instance.\\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0) {\\n return schema;\\n }\\n\\n var astBuilder = new _buildASTSchema.ASTDefinitionBuilder(typeDefinitionMap, options, function (typeRef) {\\n var typeName = typeRef.name.value;\\n var existingType = schema.getType(typeName);\\n if (existingType) {\\n return getExtendedType(existingType);\\n }\\n\\n throw new _GraphQLError.GraphQLError('Unknown type: \\\"' + typeName + '\\\". Ensure that this type exists ' + 'either in the original schema, or is added in a type definition.', [typeRef]);\\n });\\n\\n var extendTypeCache = Object.create(null);\\n\\n // Get the root Query, Mutation, and Subscription object types.\\n var existingQueryType = schema.getQueryType();\\n var queryType = existingQueryType ? getExtendedType(existingQueryType) : null;\\n\\n var existingMutationType = schema.getMutationType();\\n var mutationType = existingMutationType ? getExtendedType(existingMutationType) : null;\\n\\n var existingSubscriptionType = schema.getSubscriptionType();\\n var subscriptionType = existingSubscriptionType ? getExtendedType(existingSubscriptionType) : null;\\n\\n var types = [].concat((0, _objectValues2.default)(schema.getTypeMap()).map(function (type) {\\n return getExtendedType(type);\\n }), astBuilder.buildTypes((0, _objectValues2.default)(typeDefinitionMap)));\\n\\n // Support both original legacy names and extended legacy names.\\n var schemaAllowedLegacyNames = schema.__allowedLegacyNames;\\n var extendAllowedLegacyNames = options && options.allowedLegacyNames;\\n var allowedLegacyNames = schemaAllowedLegacyNames && extendAllowedLegacyNames ? schemaAllowedLegacyNames.concat(extendAllowedLegacyNames) : schemaAllowedLegacyNames || extendAllowedLegacyNames;\\n\\n // Then produce and return a Schema with these types.\\n return new _schema.GraphQLSchema({\\n query: queryType,\\n mutation: mutationType,\\n subscription: subscriptionType,\\n types: types,\\n directives: getMergedDirectives(),\\n astNode: schema.astNode,\\n allowedLegacyNames: allowedLegacyNames\\n });\\n\\n // Below are functions used for producing this schema that have closed over\\n // this scope and have access to the schema, cache, and newly defined types.\\n\\n function getMergedDirectives() {\\n var existingDirectives = schema.getDirectives();\\n !existingDirectives ? (0, _invariant2.default)(0, 'schema must have default directives') : void 0;\\n\\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\\n return astBuilder.buildDirective(node);\\n }));\\n }\\n\\n function getExtendedType(type) {\\n if (!extendTypeCache[type.name]) {\\n extendTypeCache[type.name] = extendType(type);\\n }\\n return extendTypeCache[type.name];\\n }\\n\\n // To be called at most once per type. Only getExtendedType should call this.\\n function extendType(type) {\\n if ((0, _introspection.isIntrospectionType)(type)) {\\n // Introspection types are not extended.\\n return type;\\n }\\n if ((0, _definition.isObjectType)(type)) {\\n return extendObjectType(type);\\n }\\n if ((0, _definition.isInterfaceType)(type)) {\\n return extendInterfaceType(type);\\n }\\n if ((0, _definition.isUnionType)(type)) {\\n return extendUnionType(type);\\n }\\n // This type is not yet extendable.\\n return type;\\n }\\n\\n function extendObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLObjectType({\\n name: name,\\n description: type.description,\\n interfaces: function interfaces() {\\n return extendImplementedInterfaces(type);\\n },\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n isTypeOf: type.isTypeOf\\n });\\n }\\n\\n function extendInterfaceType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLInterfaceType({\\n name: type.name,\\n description: type.description,\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n resolveType: type.resolveType\\n });\\n }\\n\\n function extendUnionType(type) {\\n return new _definition.GraphQLUnionType({\\n name: type.name,\\n description: type.description,\\n types: type.getTypes().map(getExtendedType),\\n astNode: type.astNode,\\n resolveType: type.resolveType\\n });\\n }\\n\\n function extendImplementedInterfaces(type) {\\n var interfaces = type.getInterfaces().map(getExtendedType);\\n\\n // If there are any extensions to the interfaces, apply those here.\\n var extensions = typeExtensionsMap[type.name];\\n if (extensions) {\\n extensions.forEach(function (extension) {\\n extension.interfaces.forEach(function (namedType) {\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n interfaces.push(astBuilder.buildType(namedType));\\n });\\n });\\n }\\n\\n return interfaces;\\n }\\n\\n function extendFieldMap(type) {\\n var newFieldMap = Object.create(null);\\n var oldFieldMap = type.getFields();\\n Object.keys(oldFieldMap).forEach(function (fieldName) {\\n var field = oldFieldMap[fieldName];\\n newFieldMap[fieldName] = {\\n description: field.description,\\n deprecationReason: field.deprecationReason,\\n type: extendFieldType(field.type),\\n args: (0, _keyMap2.default)(field.args, function (arg) {\\n return arg.name;\\n }),\\n astNode: field.astNode,\\n resolve: field.resolve\\n };\\n });\\n\\n // If there are any extensions to the fields, apply those here.\\n var extensions = typeExtensionsMap[type.name];\\n if (extensions) {\\n extensions.forEach(function (extension) {\\n extension.fields.forEach(function (field) {\\n var fieldName = field.name.value;\\n if (oldFieldMap[fieldName]) {\\n throw new _GraphQLError.GraphQLError('Field \\\"' + type.name + '.' + fieldName + '\\\" already exists in the ' + 'schema. It cannot also be defined in this type extension.', [field]);\\n }\\n newFieldMap[fieldName] = astBuilder.buildField(field);\\n });\\n });\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendFieldType(typeDef) {\\n if ((0, _definition.isListType)(typeDef)) {\\n return (0, _definition.GraphQLList)(extendFieldType(typeDef.ofType));\\n }\\n if ((0, _definition.isNonNullType)(typeDef)) {\\n return (0, _definition.GraphQLNonNull)(extendFieldType(typeDef.ofType));\\n }\\n return getExtendedType(typeDef);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc6ac16c5d56d86fb6d920d2446b8873\",\n \"score\": \"0.4837815\",\n \"text\": \"function mergeStyles(s1, s2) {\\n if (!s2) {\\n return s1;\\n }\\n\\n for (var url in s1) {\\n\\t\\t// it's the new format\\n\\t\\tif (s1[url]['_rules']) {\\n\\t\\t\\ts2[url] = s1[url];\\n\\t\\t}\\n\\t\\t// old format\\n\\t\\telse {\\n\\t\\t\\ts2[url] = {};\\n\\t\\t\\ts2[url]['_rules'] = s1[url];\\n\\t\\t}\\n }\\n return s2;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae01c64e91f5df582588004d5a4068a9\",\n \"score\": \"0.47855014\",\n \"text\": \"function mergeConfig(c1, c2) {\\n for (let k in c2) {\\n if (isUndefined(c1[k])) {\\n c1[k] = c2[k];\\n }\\n }\\n return c1;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed85f538386ed1e5b9972f4e1e1f5302\",\n \"score\": \"0.47340152\",\n \"text\": \"function mergeRecursive(obj1, obj2) {\\n\\t\\t for (var p in obj2) {\\n\\t\\t try { // Property in destination object set; update its value.\\n\\t\\t if ( obj2[p].constructor==Object ) {\\n\\t\\t obj1[p] = mergeRecursive(obj1[p], obj2[p])\\n\\t\\t } else if ( Array.isArray(obj2[p]) ) {\\n\\t\\t\\t\\tif(Array.isArray(obj1[p])) { // both are arrays: concatenating...\\n\\t\\t\\t obj1[p] = obj1[p].concat(obj2[p])\\n\\t\\t\\t\\t} else if(!obj1[p]) { // source does not exist, creating it...\\n\\t\\t\\t obj1[p] = obj2[p]\\n\\t\\t\\t\\t} else { // source is not array and target is array: problem: do nothing\\n\\t\\t\\t\\t console.log('Storyrevealer::init::mergeRecursive: warning non matching objects types', p)\\n\\t\\t\\t\\t}\\n\\t\\t\\t } else{\\n\\t\\t if (!obj1[p]) {\\n obj1[p] = obj2[p];\\n }\\n\\t\\t }\\n\\t\\t } catch(e) { // Property in destination object not set; create it and set its value.\\n\\t\\t if (!obj1[p]) {\\n obj1[p] = obj2[p];\\n }\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return obj1;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6bf7a1ce658195e5bc7928d08cf8c193\",\n \"score\": \"0.47196612\",\n \"text\": \"constructor(newSchemas = []) {\\n this._validator = new AJV({ schemaId: 'auto' });\\n this._validator.addSchema(values(schemas_1.schemas).filter(s => s !== undefined && s.id !== undefined));\\n this._validator.addSchema(newSchemas.filter(s => s !== undefined));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f29ae09ecd8d4dec868632f9bfcc47aa\",\n \"score\": \"0.471536\",\n \"text\": \"function extendSchema(schema, documentAST) {\\n\\t (0, _invariant2.default)(schema instanceof _schema.GraphQLSchema, 'Must provide valid GraphQLSchema');\\n\\n\\t (0, _invariant2.default)(documentAST && documentAST.kind === Kind.DOCUMENT, 'Must provide valid Document AST');\\n\\n\\t // Collect the type definitions and extensions found in the document.\\n\\t var typeDefinitionMap = Object.create(null);\\n\\t var typeExtensionsMap = Object.create(null);\\n\\n\\t // New directives and types are separate because a directives and types can\\n\\t // have the same name. For example, a type named \\\"skip\\\".\\n\\t var directiveDefinitions = [];\\n\\n\\t for (var i = 0; i < documentAST.definitions.length; i++) {\\n\\t var def = documentAST.definitions[i];\\n\\t switch (def.kind) {\\n\\t case Kind.OBJECT_TYPE_DEFINITION:\\n\\t case Kind.INTERFACE_TYPE_DEFINITION:\\n\\t case Kind.ENUM_TYPE_DEFINITION:\\n\\t case Kind.UNION_TYPE_DEFINITION:\\n\\t case Kind.SCALAR_TYPE_DEFINITION:\\n\\t case Kind.INPUT_OBJECT_TYPE_DEFINITION:\\n\\t // Sanity check that none of the defined types conflict with the\\n\\t // schema's existing types.\\n\\t var typeName = def.name.value;\\n\\t if (schema.getType(typeName)) {\\n\\t throw new _GraphQLError.GraphQLError('Type \\\"' + typeName + '\\\" already exists in the schema. It cannot also ' + 'be defined in this type definition.', [def]);\\n\\t }\\n\\t typeDefinitionMap[typeName] = def;\\n\\t break;\\n\\t case Kind.TYPE_EXTENSION_DEFINITION:\\n\\t // Sanity check that this type extension exists within the\\n\\t // schema's existing types.\\n\\t var extendedTypeName = def.definition.name.value;\\n\\t var existingType = schema.getType(extendedTypeName);\\n\\t if (!existingType) {\\n\\t throw new _GraphQLError.GraphQLError('Cannot extend type \\\"' + extendedTypeName + '\\\" because it does not ' + 'exist in the existing schema.', [def.definition]);\\n\\t }\\n\\t if (!(existingType instanceof _definition.GraphQLObjectType)) {\\n\\t throw new _GraphQLError.GraphQLError('Cannot extend non-object type \\\"' + extendedTypeName + '\\\".', [def.definition]);\\n\\t }\\n\\t var extensions = typeExtensionsMap[extendedTypeName];\\n\\t if (extensions) {\\n\\t extensions.push(def);\\n\\t } else {\\n\\t extensions = [def];\\n\\t }\\n\\t typeExtensionsMap[extendedTypeName] = extensions;\\n\\t break;\\n\\t case Kind.DIRECTIVE_DEFINITION:\\n\\t var directiveName = def.name.value;\\n\\t var existingDirective = schema.getDirective(directiveName);\\n\\t if (existingDirective) {\\n\\t throw new _GraphQLError.GraphQLError('Directive \\\"' + directiveName + '\\\" already exists in the schema. It ' + 'cannot be redefined.', [def]);\\n\\t }\\n\\t directiveDefinitions.push(def);\\n\\t break;\\n\\t }\\n\\t }\\n\\n\\t // If this document contains no new types, extensions, or directives then\\n\\t // return the same unmodified GraphQLSchema instance.\\n\\t if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0) {\\n\\t return schema;\\n\\t }\\n\\n\\t // A cache to use to store the actual GraphQLType definition objects by name.\\n\\t // Initialize to the GraphQL built in scalars and introspection types. All\\n\\t // functions below are inline so that this type def cache is within the scope\\n\\t // of the closure.\\n\\t var typeDefCache = {\\n\\t String: _scalars.GraphQLString,\\n\\t Int: _scalars.GraphQLInt,\\n\\t Float: _scalars.GraphQLFloat,\\n\\t Boolean: _scalars.GraphQLBoolean,\\n\\t ID: _scalars.GraphQLID,\\n\\t __Schema: _introspection.__Schema,\\n\\t __Directive: _introspection.__Directive,\\n\\t __DirectiveLocation: _introspection.__DirectiveLocation,\\n\\t __Type: _introspection.__Type,\\n\\t __Field: _introspection.__Field,\\n\\t __InputValue: _introspection.__InputValue,\\n\\t __EnumValue: _introspection.__EnumValue,\\n\\t __TypeKind: _introspection.__TypeKind\\n\\t };\\n\\n\\t // Get the root Query, Mutation, and Subscription object types.\\n\\t var queryType = getTypeFromDef(schema.getQueryType());\\n\\n\\t var existingMutationType = schema.getMutationType();\\n\\t var mutationType = existingMutationType ? getTypeFromDef(existingMutationType) : null;\\n\\n\\t var existingSubscriptionType = schema.getSubscriptionType();\\n\\t var subscriptionType = existingSubscriptionType ? getTypeFromDef(existingSubscriptionType) : null;\\n\\n\\t // Iterate through all types, getting the type definition for each, ensuring\\n\\t // that any type not directly referenced by a field will get created.\\n\\t var typeMap = schema.getTypeMap();\\n\\t var types = Object.keys(typeMap).map(function (typeName) {\\n\\t return getTypeFromDef(typeMap[typeName]);\\n\\t });\\n\\n\\t // Do the same with new types, appending to the list of defined types.\\n\\t Object.keys(typeDefinitionMap).forEach(function (typeName) {\\n\\t types.push(getTypeFromAST(typeDefinitionMap[typeName]));\\n\\t });\\n\\n\\t // Then produce and return a Schema with these types.\\n\\t return new _schema.GraphQLSchema({\\n\\t query: queryType,\\n\\t mutation: mutationType,\\n\\t subscription: subscriptionType,\\n\\t types: types,\\n\\t directives: getMergedDirectives()\\n\\t });\\n\\n\\t // Below are functions used for producing this schema that have closed over\\n\\t // this scope and have access to the schema, cache, and newly defined types.\\n\\n\\t function getMergedDirectives() {\\n\\t var existingDirectives = schema.getDirectives();\\n\\t (0, _invariant2.default)(existingDirectives, 'schema must have default directives');\\n\\n\\t var newDirectives = directiveDefinitions.map(function (directiveNode) {\\n\\t return getDirective(directiveNode);\\n\\t });\\n\\t return existingDirectives.concat(newDirectives);\\n\\t }\\n\\n\\t function getTypeFromDef(typeDef) {\\n\\t var type = _getNamedType(typeDef.name);\\n\\t (0, _invariant2.default)(type, 'Missing type from schema');\\n\\t return type;\\n\\t }\\n\\n\\t function getTypeFromAST(node) {\\n\\t var type = _getNamedType(node.name.value);\\n\\t if (!type) {\\n\\t throw new _GraphQLError.GraphQLError('Unknown type: \\\"' + node.name.value + '\\\". Ensure that this type exists ' + 'either in the original schema, or is added in a type definition.', [node]);\\n\\t }\\n\\t return type;\\n\\t }\\n\\n\\t function getObjectTypeFromAST(node) {\\n\\t var type = getTypeFromAST(node);\\n\\t (0, _invariant2.default)(type instanceof _definition.GraphQLObjectType, 'Must be Object type.');\\n\\t return type;\\n\\t }\\n\\n\\t function getInterfaceTypeFromAST(node) {\\n\\t var type = getTypeFromAST(node);\\n\\t (0, _invariant2.default)(type instanceof _definition.GraphQLInterfaceType, 'Must be Interface type.');\\n\\t return type;\\n\\t }\\n\\n\\t function getInputTypeFromAST(node) {\\n\\t return (0, _definition.assertInputType)(getTypeFromAST(node));\\n\\t }\\n\\n\\t function getOutputTypeFromAST(node) {\\n\\t return (0, _definition.assertOutputType)(getTypeFromAST(node));\\n\\t }\\n\\n\\t // Given a name, returns a type from either the existing schema or an\\n\\t // added type.\\n\\t function _getNamedType(typeName) {\\n\\t var cachedTypeDef = typeDefCache[typeName];\\n\\t if (cachedTypeDef) {\\n\\t return cachedTypeDef;\\n\\t }\\n\\n\\t var existingType = schema.getType(typeName);\\n\\t if (existingType) {\\n\\t var typeDef = extendType(existingType);\\n\\t typeDefCache[typeName] = typeDef;\\n\\t return typeDef;\\n\\t }\\n\\n\\t var typeNode = typeDefinitionMap[typeName];\\n\\t if (typeNode) {\\n\\t var _typeDef = buildType(typeNode);\\n\\t typeDefCache[typeName] = _typeDef;\\n\\t return _typeDef;\\n\\t }\\n\\t }\\n\\n\\t // Given a type's introspection result, construct the correct\\n\\t // GraphQLType instance.\\n\\t function extendType(type) {\\n\\t if (type instanceof _definition.GraphQLObjectType) {\\n\\t return extendObjectType(type);\\n\\t }\\n\\t if (type instanceof _definition.GraphQLInterfaceType) {\\n\\t return extendInterfaceType(type);\\n\\t }\\n\\t if (type instanceof _definition.GraphQLUnionType) {\\n\\t return extendUnionType(type);\\n\\t }\\n\\t return type;\\n\\t }\\n\\n\\t function extendObjectType(type) {\\n\\t return new _definition.GraphQLObjectType({\\n\\t name: type.name,\\n\\t description: type.description,\\n\\t interfaces: function interfaces() {\\n\\t return extendImplementedInterfaces(type);\\n\\t },\\n\\t fields: function fields() {\\n\\t return extendFieldMap(type);\\n\\t },\\n\\t isTypeOf: type.isTypeOf\\n\\t });\\n\\t }\\n\\n\\t function extendInterfaceType(type) {\\n\\t return new _definition.GraphQLInterfaceType({\\n\\t name: type.name,\\n\\t description: type.description,\\n\\t fields: function fields() {\\n\\t return extendFieldMap(type);\\n\\t },\\n\\t resolveType: type.resolveType\\n\\t });\\n\\t }\\n\\n\\t function extendUnionType(type) {\\n\\t return new _definition.GraphQLUnionType({\\n\\t name: type.name,\\n\\t description: type.description,\\n\\t types: type.getTypes().map(getTypeFromDef),\\n\\t resolveType: type.resolveType\\n\\t });\\n\\t }\\n\\n\\t function extendImplementedInterfaces(type) {\\n\\t var interfaces = type.getInterfaces().map(getTypeFromDef);\\n\\n\\t // If there are any extensions to the interfaces, apply those here.\\n\\t var extensions = typeExtensionsMap[type.name];\\n\\t if (extensions) {\\n\\t extensions.forEach(function (extension) {\\n\\t extension.definition.interfaces.forEach(function (namedType) {\\n\\t var interfaceName = namedType.name.value;\\n\\t if (interfaces.some(function (def) {\\n\\t return def.name === interfaceName;\\n\\t })) {\\n\\t throw new _GraphQLError.GraphQLError('Type \\\"' + type.name + '\\\" already implements \\\"' + interfaceName + '\\\". ' + 'It cannot also be implemented in this type extension.', [namedType]);\\n\\t }\\n\\t interfaces.push(getInterfaceTypeFromAST(namedType));\\n\\t });\\n\\t });\\n\\t }\\n\\n\\t return interfaces;\\n\\t }\\n\\n\\t function extendFieldMap(type) {\\n\\t var newFieldMap = Object.create(null);\\n\\t var oldFieldMap = type.getFields();\\n\\t Object.keys(oldFieldMap).forEach(function (fieldName) {\\n\\t var field = oldFieldMap[fieldName];\\n\\t newFieldMap[fieldName] = {\\n\\t description: field.description,\\n\\t deprecationReason: field.deprecationReason,\\n\\t type: extendFieldType(field.type),\\n\\t args: (0, _keyMap2.default)(field.args, function (arg) {\\n\\t return arg.name;\\n\\t }),\\n\\t resolve: field.resolve\\n\\t };\\n\\t });\\n\\n\\t // If there are any extensions to the fields, apply those here.\\n\\t var extensions = typeExtensionsMap[type.name];\\n\\t if (extensions) {\\n\\t extensions.forEach(function (extension) {\\n\\t extension.definition.fields.forEach(function (field) {\\n\\t var fieldName = field.name.value;\\n\\t if (oldFieldMap[fieldName]) {\\n\\t throw new _GraphQLError.GraphQLError('Field \\\"' + type.name + '.' + fieldName + '\\\" already exists in the ' + 'schema. It cannot also be defined in this type extension.', [field]);\\n\\t }\\n\\t newFieldMap[fieldName] = {\\n\\t description: (0, _buildASTSchema.getDescription)(field),\\n\\t type: buildOutputFieldType(field.type),\\n\\t args: buildInputValues(field.arguments),\\n\\t deprecationReason: (0, _buildASTSchema.getDeprecationReason)(field)\\n\\t };\\n\\t });\\n\\t });\\n\\t }\\n\\n\\t return newFieldMap;\\n\\t }\\n\\n\\t function extendFieldType(typeDef) {\\n\\t if (typeDef instanceof _definition.GraphQLList) {\\n\\t return new _definition.GraphQLList(extendFieldType(typeDef.ofType));\\n\\t }\\n\\t if (typeDef instanceof _definition.GraphQLNonNull) {\\n\\t return new _definition.GraphQLNonNull(extendFieldType(typeDef.ofType));\\n\\t }\\n\\t return getTypeFromDef(typeDef);\\n\\t }\\n\\n\\t function buildType(typeNode) {\\n\\t switch (typeNode.kind) {\\n\\t case Kind.OBJECT_TYPE_DEFINITION:\\n\\t return buildObjectType(typeNode);\\n\\t case Kind.INTERFACE_TYPE_DEFINITION:\\n\\t return buildInterfaceType(typeNode);\\n\\t case Kind.UNION_TYPE_DEFINITION:\\n\\t return buildUnionType(typeNode);\\n\\t case Kind.SCALAR_TYPE_DEFINITION:\\n\\t return buildScalarType(typeNode);\\n\\t case Kind.ENUM_TYPE_DEFINITION:\\n\\t return buildEnumType(typeNode);\\n\\t case Kind.INPUT_OBJECT_TYPE_DEFINITION:\\n\\t return buildInputObjectType(typeNode);\\n\\t }\\n\\t throw new TypeError('Unknown type kind ' + typeNode.kind);\\n\\t }\\n\\n\\t function buildObjectType(typeNode) {\\n\\t return new _definition.GraphQLObjectType({\\n\\t name: typeNode.name.value,\\n\\t description: (0, _buildASTSchema.getDescription)(typeNode),\\n\\t interfaces: function interfaces() {\\n\\t return buildImplementedInterfaces(typeNode);\\n\\t },\\n\\t fields: function fields() {\\n\\t return buildFieldMap(typeNode);\\n\\t }\\n\\t });\\n\\t }\\n\\n\\t function buildInterfaceType(typeNode) {\\n\\t return new _definition.GraphQLInterfaceType({\\n\\t name: typeNode.name.value,\\n\\t description: (0, _buildASTSchema.getDescription)(typeNode),\\n\\t fields: function fields() {\\n\\t return buildFieldMap(typeNode);\\n\\t },\\n\\t resolveType: cannotExecuteExtendedSchema\\n\\t });\\n\\t }\\n\\n\\t function buildUnionType(typeNode) {\\n\\t return new _definition.GraphQLUnionType({\\n\\t name: typeNode.name.value,\\n\\t description: (0, _buildASTSchema.getDescription)(typeNode),\\n\\t types: typeNode.types.map(getObjectTypeFromAST),\\n\\t resolveType: cannotExecuteExtendedSchema\\n\\t });\\n\\t }\\n\\n\\t function buildScalarType(typeNode) {\\n\\t return new _definition.GraphQLScalarType({\\n\\t name: typeNode.name.value,\\n\\t description: (0, _buildASTSchema.getDescription)(typeNode),\\n\\t serialize: function serialize(id) {\\n\\t return id;\\n\\t },\\n\\t // Note: validation calls the parse functions to determine if a\\n\\t // literal value is correct. Returning null would cause use of custom\\n\\t // scalars to always fail validation. Returning false causes them to\\n\\t // always pass validation.\\n\\t parseValue: function parseValue() {\\n\\t return false;\\n\\t },\\n\\t parseLiteral: function parseLiteral() {\\n\\t return false;\\n\\t }\\n\\t });\\n\\t }\\n\\n\\t function buildEnumType(typeNode) {\\n\\t return new _definition.GraphQLEnumType({\\n\\t name: typeNode.name.value,\\n\\t description: (0, _buildASTSchema.getDescription)(typeNode),\\n\\t values: (0, _keyValMap2.default)(typeNode.values, function (enumValue) {\\n\\t return enumValue.name.value;\\n\\t }, function (enumValue) {\\n\\t return {\\n\\t description: (0, _buildASTSchema.getDescription)(enumValue),\\n\\t deprecationReason: (0, _buildASTSchema.getDeprecationReason)(enumValue)\\n\\t };\\n\\t })\\n\\t });\\n\\t }\\n\\n\\t function buildInputObjectType(typeNode) {\\n\\t return new _definition.GraphQLInputObjectType({\\n\\t name: typeNode.name.value,\\n\\t description: (0, _buildASTSchema.getDescription)(typeNode),\\n\\t fields: function fields() {\\n\\t return buildInputValues(typeNode.fields);\\n\\t }\\n\\t });\\n\\t }\\n\\n\\t function getDirective(directiveNode) {\\n\\t return new _directives.GraphQLDirective({\\n\\t name: directiveNode.name.value,\\n\\t locations: directiveNode.locations.map(function (node) {\\n\\t return node.value;\\n\\t }),\\n\\t args: directiveNode.arguments && buildInputValues(directiveNode.arguments)\\n\\t });\\n\\t }\\n\\n\\t function buildImplementedInterfaces(typeNode) {\\n\\t return typeNode.interfaces && typeNode.interfaces.map(getInterfaceTypeFromAST);\\n\\t }\\n\\n\\t function buildFieldMap(typeNode) {\\n\\t return (0, _keyValMap2.default)(typeNode.fields, function (field) {\\n\\t return field.name.value;\\n\\t }, function (field) {\\n\\t return {\\n\\t type: buildOutputFieldType(field.type),\\n\\t description: (0, _buildASTSchema.getDescription)(field),\\n\\t args: buildInputValues(field.arguments),\\n\\t deprecationReason: (0, _buildASTSchema.getDeprecationReason)(field)\\n\\t };\\n\\t });\\n\\t }\\n\\n\\t function buildInputValues(values) {\\n\\t return (0, _keyValMap2.default)(values, function (value) {\\n\\t return value.name.value;\\n\\t }, function (value) {\\n\\t var type = buildInputFieldType(value.type);\\n\\t return {\\n\\t type: type,\\n\\t description: (0, _buildASTSchema.getDescription)(value),\\n\\t defaultValue: (0, _valueFromAST.valueFromAST)(value.defaultValue, type)\\n\\t };\\n\\t });\\n\\t }\\n\\n\\t function buildInputFieldType(typeNode) {\\n\\t if (typeNode.kind === Kind.LIST_TYPE) {\\n\\t return new _definition.GraphQLList(buildInputFieldType(typeNode.type));\\n\\t }\\n\\t if (typeNode.kind === Kind.NON_NULL_TYPE) {\\n\\t var nullableType = buildInputFieldType(typeNode.type);\\n\\t (0, _invariant2.default)(!(nullableType instanceof _definition.GraphQLNonNull), 'Must be nullable');\\n\\t return new _definition.GraphQLNonNull(nullableType);\\n\\t }\\n\\t return getInputTypeFromAST(typeNode);\\n\\t }\\n\\n\\t function buildOutputFieldType(typeNode) {\\n\\t if (typeNode.kind === Kind.LIST_TYPE) {\\n\\t return new _definition.GraphQLList(buildOutputFieldType(typeNode.type));\\n\\t }\\n\\t if (typeNode.kind === Kind.NON_NULL_TYPE) {\\n\\t var nullableType = buildOutputFieldType(typeNode.type);\\n\\t (0, _invariant2.default)(!(nullableType instanceof _definition.GraphQLNonNull), 'Must be nullable');\\n\\t return new _definition.GraphQLNonNull(nullableType);\\n\\t }\\n\\t return getOutputTypeFromAST(typeNode);\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2f9961f90acc84545765404a91d83d9\",\n \"score\": \"0.47066635\",\n \"text\": \"function registerSchemas() {\\r\\n let schemas = [{template: '#img-template', selector: '.img-box', properties: ['geometry', 'position', 'rotation', 'scale', \\\"material\\\"]},\\r\\n {template: '#obj-template', selector: '.obj-model-test', properties: ['position', 'rotation', 'scale', 'obj-model']},\\r\\n {template: '#vid-template', selector: '.vid-box', properties: ['position', 'rotation', 'scale', \\\"material\\\"]}] \\r\\n\\r\\n //This builds schemas dynamically based on the list above. Check NAF github or NPM docs for more details on what this looks like unrolled\\r\\n schemas.forEach((schema) => {\\r\\n let components = schema.properties.map((property) => {\\r\\n return {\\r\\n selector: schema.selector,\\r\\n component: property\\r\\n }\\r\\n })\\r\\n\\r\\n window.NAF.schemas.add({\\r\\n template: schema.template,\\r\\n components: components.concat(['position', 'rotation', 'scale'])\\r\\n })\\r\\n })\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a6d065c46dc4ad03e8bc4e03d5406d6\",\n \"score\": \"0.47026902\",\n \"text\": \"function merge(obj1, obj2) {\\n\\tfor (var key in obj2) {\\n\\t\\tobj1[key] = obj2[key];\\n\\t}\\n\\treturn obj1;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"262c188e4f18dd5c21fedc4588fd2b43\",\n \"score\": \"0.46985942\",\n \"text\": \"function merge(original, updates) {\\n return mergeWithOptions(original, updates);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83d37c10129d7d2d97f58174179cb578\",\n \"score\": \"0.46794203\",\n \"text\": \"function externalApi(input1orig, input2orig, originalOpts) {\\n if (!arguments.length) {\\n throw new TypeError(\\\"object-merge-advanced/mergeAdvanced(): [THROW_ID_01] Both inputs are missing\\\");\\n } // notice we have first argument tracking the current path, which is not\\n // exposed to the external API.\\n return mergeAdvanced({\\n key: null,\\n path: \\\"\\\",\\n type: [getType(input1orig), getType(input2orig)]\\n }, input1orig, input2orig, originalOpts);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"466862cbf1ad7d04296b1c25b61bde26\",\n \"score\": \"0.46742883\",\n \"text\": \"function mergeWith(obj1, obj2) {\\n\\tfor (let prop in obj1) {\\n\\t\\tif (obj1.hasOwnProperty(prop)) {\\n\\t\\t\\tobj1[prop].push(...obj2[prop])\\n\\t\\t}\\n\\t}\\n\\treturn obj1;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2a6f8511accd1430a3dd967fb2d3b55\",\n \"score\": \"0.46610644\",\n \"text\": \"static async load(sources) {\\r\\n await MongooseLoader.loadSchemas(sources[0]);\\r\\n\\r\\n return await MongooseLoader.loadModels(sources[1]);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8472886aa2ef36effdc08b15620217f\",\n \"score\": \"0.46544036\",\n \"text\": \"function extendSchema(schema, documentAST, options) {\\n (0, _schema.assertSchema)(schema);\\n !(documentAST && documentAST.kind === _kinds.Kind.DOCUMENT) ? (0, _invariant.default)(0, 'Must provide valid Document AST') : void 0;\\n\\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\\n (0, _validate.assertValidSDLExtension)(documentAST, schema);\\n } // Collect the type definitions and extensions found in the document.\\n\\n\\n var typeDefinitionMap = Object.create(null);\\n var typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can\\n // have the same name. For example, a type named \\\"skip\\\".\\n\\n var directiveDefinitions = [];\\n var schemaDef; // Schema extensions are collected which may add additional operation types.\\n\\n var schemaExtensions = [];\\n var _iteratorNormalCompletion = true;\\n var _didIteratorError = false;\\n var _iteratorError = undefined;\\n\\n try {\\n for (var _iterator = documentAST.definitions[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\\n var def = _step.value;\\n\\n if (def.kind === _kinds.Kind.SCHEMA_DEFINITION) {\\n schemaDef = def;\\n } else if (def.kind === _kinds.Kind.SCHEMA_EXTENSION) {\\n schemaExtensions.push(def);\\n } else if ((0, _predicates.isTypeDefinitionNode)(def)) {\\n var typeName = def.name.value;\\n typeDefinitionMap[typeName] = def;\\n } else if ((0, _predicates.isTypeExtensionNode)(def)) {\\n var extendedTypeName = def.name.value;\\n var existingTypeExtensions = typeExtensionsMap[extendedTypeName];\\n typeExtensionsMap[extendedTypeName] = existingTypeExtensions ? existingTypeExtensions.concat([def]) : [def];\\n } else if (def.kind === _kinds.Kind.DIRECTIVE_DEFINITION) {\\n directiveDefinitions.push(def);\\n }\\n } // If this document contains no new types, extensions, or directives then\\n // return the same unmodified GraphQLSchema instance.\\n\\n } catch (err) {\\n _didIteratorError = true;\\n _iteratorError = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion && _iterator.return != null) {\\n _iterator.return();\\n }\\n } finally {\\n if (_didIteratorError) {\\n throw _iteratorError;\\n }\\n }\\n }\\n\\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0 && schemaExtensions.length === 0 && !schemaDef) {\\n return schema;\\n }\\n\\n var astBuilder = new _buildASTSchema.ASTDefinitionBuilder(typeDefinitionMap, options, function (typeName) {\\n var existingType = schema.getType(typeName);\\n !existingType ? (0, _invariant.default)(0, \\\"Unknown type: \\\\\\\"\\\".concat(typeName, \\\"\\\\\\\".\\\")) : void 0;\\n return extendNamedType(existingType);\\n });\\n var extendTypeCache = Object.create(null); // Get the extended root operation types.\\n\\n var operationTypes = {\\n query: extendMaybeNamedType(schema.getQueryType()),\\n mutation: extendMaybeNamedType(schema.getMutationType()),\\n subscription: extendMaybeNamedType(schema.getSubscriptionType())\\n };\\n\\n if (schemaDef) {\\n var _iteratorNormalCompletion2 = true;\\n var _didIteratorError2 = false;\\n var _iteratorError2 = undefined;\\n\\n try {\\n for (var _iterator2 = schemaDef.operationTypes[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\\n var _ref2 = _step2.value;\\n var operation = _ref2.operation;\\n var type = _ref2.type;\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n operationTypes[operation] = astBuilder.buildType(type);\\n }\\n } catch (err) {\\n _didIteratorError2 = true;\\n _iteratorError2 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\\n _iterator2.return();\\n }\\n } finally {\\n if (_didIteratorError2) {\\n throw _iteratorError2;\\n }\\n }\\n }\\n } // Then, incorporate schema definition and all schema extensions.\\n\\n\\n for (var _i = 0; _i < schemaExtensions.length; _i++) {\\n var schemaExtension = schemaExtensions[_i];\\n\\n if (schemaExtension.operationTypes) {\\n var _iteratorNormalCompletion14 = true;\\n var _didIteratorError14 = false;\\n var _iteratorError14 = undefined;\\n\\n try {\\n for (var _iterator14 = schemaExtension.operationTypes[Symbol.iterator](), _step14; !(_iteratorNormalCompletion14 = (_step14 = _iterator14.next()).done); _iteratorNormalCompletion14 = true) {\\n var _ref4 = _step14.value;\\n var _operation = _ref4.operation;\\n var _type = _ref4.type;\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n operationTypes[_operation] = astBuilder.buildType(_type);\\n }\\n } catch (err) {\\n _didIteratorError14 = true;\\n _iteratorError14 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion14 && _iterator14.return != null) {\\n _iterator14.return();\\n }\\n } finally {\\n if (_didIteratorError14) {\\n throw _iteratorError14;\\n }\\n }\\n }\\n }\\n }\\n\\n var schemaExtensionASTNodes = schemaExtensions ? schema.extensionASTNodes ? schema.extensionASTNodes.concat(schemaExtensions) : schemaExtensions : schema.extensionASTNodes;\\n var types = [].concat((0, _objectValues.default)(schema.getTypeMap()).map(function (type) {\\n return extendNamedType(type);\\n }), (0, _objectValues.default)(typeDefinitionMap).map(function (type) {\\n return astBuilder.buildType(type);\\n })); // Support both original legacy names and extended legacy names.\\n\\n var allowedLegacyNames = schema.__allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\\n\\n\\n return new _schema.GraphQLSchema(_objectSpread({}, operationTypes, {\\n types: types,\\n directives: getMergedDirectives(),\\n astNode: schema.astNode,\\n extensionASTNodes: schemaExtensionASTNodes,\\n allowedLegacyNames: allowedLegacyNames\\n })); // Below are functions used for producing this schema that have closed over\\n // this scope and have access to the schema, cache, and newly defined types.\\n\\n function getMergedDirectives() {\\n var existingDirectives = schema.getDirectives().map(extendDirective);\\n !existingDirectives ? (0, _invariant.default)(0, 'schema must have default directives') : void 0;\\n return existingDirectives.concat(directiveDefinitions.map(function (node) {\\n return astBuilder.buildDirective(node);\\n }));\\n }\\n\\n function extendMaybeNamedType(type) {\\n return type ? extendNamedType(type) : null;\\n }\\n\\n function extendNamedType(type) {\\n if ((0, _introspection.isIntrospectionType)(type) || (0, _scalars.isSpecifiedScalarType)(type)) {\\n // Builtin types are not extended.\\n return type;\\n }\\n\\n var name = type.name;\\n\\n if (!extendTypeCache[name]) {\\n if ((0, _definition.isScalarType)(type)) {\\n extendTypeCache[name] = extendScalarType(type);\\n } else if ((0, _definition.isObjectType)(type)) {\\n extendTypeCache[name] = extendObjectType(type);\\n } else if ((0, _definition.isInterfaceType)(type)) {\\n extendTypeCache[name] = extendInterfaceType(type);\\n } else if ((0, _definition.isUnionType)(type)) {\\n extendTypeCache[name] = extendUnionType(type);\\n } else if ((0, _definition.isEnumType)(type)) {\\n extendTypeCache[name] = extendEnumType(type);\\n } else if ((0, _definition.isInputObjectType)(type)) {\\n extendTypeCache[name] = extendInputObjectType(type);\\n }\\n }\\n\\n return extendTypeCache[name];\\n }\\n\\n function extendDirective(directive) {\\n return new _directives.GraphQLDirective({\\n name: directive.name,\\n description: directive.description,\\n locations: directive.locations,\\n args: extendArgs(directive.args),\\n astNode: directive.astNode\\n });\\n }\\n\\n function extendInputObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLInputObjectType({\\n name: name,\\n description: type.description,\\n fields: function fields() {\\n return extendInputFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendInputFieldMap(type) {\\n var newFieldMap = (0, _mapValue.default)(type.getFields(), function (field) {\\n return {\\n description: field.description,\\n type: extendType(field.type),\\n defaultValue: field.defaultValue,\\n astNode: field.astNode\\n };\\n }); // If there are any extensions to the fields, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion3 = true;\\n var _didIteratorError3 = false;\\n var _iteratorError3 = undefined;\\n\\n try {\\n for (var _iterator3 = extensions[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\\n var extension = _step3.value;\\n var _iteratorNormalCompletion4 = true;\\n var _didIteratorError4 = false;\\n var _iteratorError4 = undefined;\\n\\n try {\\n for (var _iterator4 = extension.fields[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\\n var field = _step4.value;\\n newFieldMap[field.name.value] = astBuilder.buildInputField(field);\\n }\\n } catch (err) {\\n _didIteratorError4 = true;\\n _iteratorError4 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\\n _iterator4.return();\\n }\\n } finally {\\n if (_didIteratorError4) {\\n throw _iteratorError4;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError3 = true;\\n _iteratorError3 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\\n _iterator3.return();\\n }\\n } finally {\\n if (_didIteratorError3) {\\n throw _iteratorError3;\\n }\\n }\\n }\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendEnumType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLEnumType({\\n name: name,\\n description: type.description,\\n values: extendValueMap(type),\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendValueMap(type) {\\n var newValueMap = Object.create(null);\\n var _iteratorNormalCompletion5 = true;\\n var _didIteratorError5 = false;\\n var _iteratorError5 = undefined;\\n\\n try {\\n for (var _iterator5 = type.getValues()[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\\n var _value = _step5.value;\\n newValueMap[_value.name] = {\\n description: _value.description,\\n value: _value.value,\\n deprecationReason: _value.deprecationReason,\\n astNode: _value.astNode\\n };\\n } // If there are any extensions to the values, apply those here.\\n\\n } catch (err) {\\n _didIteratorError5 = true;\\n _iteratorError5 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\\n _iterator5.return();\\n }\\n } finally {\\n if (_didIteratorError5) {\\n throw _iteratorError5;\\n }\\n }\\n }\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion6 = true;\\n var _didIteratorError6 = false;\\n var _iteratorError6 = undefined;\\n\\n try {\\n for (var _iterator6 = extensions[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\\n var extension = _step6.value;\\n var _iteratorNormalCompletion7 = true;\\n var _didIteratorError7 = false;\\n var _iteratorError7 = undefined;\\n\\n try {\\n for (var _iterator7 = extension.values[Symbol.iterator](), _step7; !(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done); _iteratorNormalCompletion7 = true) {\\n var value = _step7.value;\\n newValueMap[value.name.value] = astBuilder.buildEnumValue(value);\\n }\\n } catch (err) {\\n _didIteratorError7 = true;\\n _iteratorError7 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion7 && _iterator7.return != null) {\\n _iterator7.return();\\n }\\n } finally {\\n if (_didIteratorError7) {\\n throw _iteratorError7;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError6 = true;\\n _iteratorError6 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\\n _iterator6.return();\\n }\\n } finally {\\n if (_didIteratorError6) {\\n throw _iteratorError6;\\n }\\n }\\n }\\n }\\n\\n return newValueMap;\\n }\\n\\n function extendScalarType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLScalarType({\\n name: name,\\n description: type.description,\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n serialize: type.serialize,\\n parseValue: type.parseValue,\\n parseLiteral: type.parseLiteral\\n });\\n }\\n\\n function extendObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLObjectType({\\n name: name,\\n description: type.description,\\n interfaces: function interfaces() {\\n return extendImplementedInterfaces(type);\\n },\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n isTypeOf: type.isTypeOf\\n });\\n }\\n\\n function extendArgs(args) {\\n return (0, _keyValMap.default)(args, function (arg) {\\n return arg.name;\\n }, function (arg) {\\n return {\\n type: extendType(arg.type),\\n defaultValue: arg.defaultValue,\\n description: arg.description,\\n astNode: arg.astNode\\n };\\n });\\n }\\n\\n function extendInterfaceType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLInterfaceType({\\n name: type.name,\\n description: type.description,\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n resolveType: type.resolveType\\n });\\n }\\n\\n function extendUnionType(type) {\\n var name = type.name;\\n var extensionASTNodes = typeExtensionsMap[name] ? type.extensionASTNodes ? type.extensionASTNodes.concat(typeExtensionsMap[name]) : typeExtensionsMap[name] : type.extensionASTNodes;\\n return new _definition.GraphQLUnionType({\\n name: name,\\n description: type.description,\\n types: function types() {\\n return extendPossibleTypes(type);\\n },\\n astNode: type.astNode,\\n resolveType: type.resolveType,\\n extensionASTNodes: extensionASTNodes\\n });\\n }\\n\\n function extendPossibleTypes(type) {\\n var possibleTypes = type.getTypes().map(extendNamedType); // If there are any extensions to the union, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion8 = true;\\n var _didIteratorError8 = false;\\n var _iteratorError8 = undefined;\\n\\n try {\\n for (var _iterator8 = extensions[Symbol.iterator](), _step8; !(_iteratorNormalCompletion8 = (_step8 = _iterator8.next()).done); _iteratorNormalCompletion8 = true) {\\n var extension = _step8.value;\\n var _iteratorNormalCompletion9 = true;\\n var _didIteratorError9 = false;\\n var _iteratorError9 = undefined;\\n\\n try {\\n for (var _iterator9 = extension.types[Symbol.iterator](), _step9; !(_iteratorNormalCompletion9 = (_step9 = _iterator9.next()).done); _iteratorNormalCompletion9 = true) {\\n var namedType = _step9.value;\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n possibleTypes.push(astBuilder.buildType(namedType));\\n }\\n } catch (err) {\\n _didIteratorError9 = true;\\n _iteratorError9 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion9 && _iterator9.return != null) {\\n _iterator9.return();\\n }\\n } finally {\\n if (_didIteratorError9) {\\n throw _iteratorError9;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError8 = true;\\n _iteratorError8 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion8 && _iterator8.return != null) {\\n _iterator8.return();\\n }\\n } finally {\\n if (_didIteratorError8) {\\n throw _iteratorError8;\\n }\\n }\\n }\\n }\\n\\n return possibleTypes;\\n }\\n\\n function extendImplementedInterfaces(type) {\\n var interfaces = type.getInterfaces().map(extendNamedType); // If there are any extensions to the interfaces, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion10 = true;\\n var _didIteratorError10 = false;\\n var _iteratorError10 = undefined;\\n\\n try {\\n for (var _iterator10 = extensions[Symbol.iterator](), _step10; !(_iteratorNormalCompletion10 = (_step10 = _iterator10.next()).done); _iteratorNormalCompletion10 = true) {\\n var extension = _step10.value;\\n var _iteratorNormalCompletion11 = true;\\n var _didIteratorError11 = false;\\n var _iteratorError11 = undefined;\\n\\n try {\\n for (var _iterator11 = extension.interfaces[Symbol.iterator](), _step11; !(_iteratorNormalCompletion11 = (_step11 = _iterator11.next()).done); _iteratorNormalCompletion11 = true) {\\n var namedType = _step11.value;\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n interfaces.push(astBuilder.buildType(namedType));\\n }\\n } catch (err) {\\n _didIteratorError11 = true;\\n _iteratorError11 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion11 && _iterator11.return != null) {\\n _iterator11.return();\\n }\\n } finally {\\n if (_didIteratorError11) {\\n throw _iteratorError11;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError10 = true;\\n _iteratorError10 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion10 && _iterator10.return != null) {\\n _iterator10.return();\\n }\\n } finally {\\n if (_didIteratorError10) {\\n throw _iteratorError10;\\n }\\n }\\n }\\n }\\n\\n return interfaces;\\n }\\n\\n function extendFieldMap(type) {\\n var newFieldMap = (0, _mapValue.default)(type.getFields(), function (field) {\\n return {\\n description: field.description,\\n deprecationReason: field.deprecationReason,\\n type: extendType(field.type),\\n args: extendArgs(field.args),\\n astNode: field.astNode,\\n resolve: field.resolve\\n };\\n }); // If there are any extensions to the fields, apply those here.\\n\\n var extensions = typeExtensionsMap[type.name];\\n\\n if (extensions) {\\n var _iteratorNormalCompletion12 = true;\\n var _didIteratorError12 = false;\\n var _iteratorError12 = undefined;\\n\\n try {\\n for (var _iterator12 = extensions[Symbol.iterator](), _step12; !(_iteratorNormalCompletion12 = (_step12 = _iterator12.next()).done); _iteratorNormalCompletion12 = true) {\\n var extension = _step12.value;\\n var _iteratorNormalCompletion13 = true;\\n var _didIteratorError13 = false;\\n var _iteratorError13 = undefined;\\n\\n try {\\n for (var _iterator13 = extension.fields[Symbol.iterator](), _step13; !(_iteratorNormalCompletion13 = (_step13 = _iterator13.next()).done); _iteratorNormalCompletion13 = true) {\\n var field = _step13.value;\\n newFieldMap[field.name.value] = astBuilder.buildField(field);\\n }\\n } catch (err) {\\n _didIteratorError13 = true;\\n _iteratorError13 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion13 && _iterator13.return != null) {\\n _iterator13.return();\\n }\\n } finally {\\n if (_didIteratorError13) {\\n throw _iteratorError13;\\n }\\n }\\n }\\n }\\n } catch (err) {\\n _didIteratorError12 = true;\\n _iteratorError12 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion12 && _iterator12.return != null) {\\n _iterator12.return();\\n }\\n } finally {\\n if (_didIteratorError12) {\\n throw _iteratorError12;\\n }\\n }\\n }\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendType(typeDef) {\\n if ((0, _definition.isListType)(typeDef)) {\\n return (0, _definition.GraphQLList)(extendType(typeDef.ofType));\\n }\\n\\n if ((0, _definition.isNonNullType)(typeDef)) {\\n return (0, _definition.GraphQLNonNull)(extendType(typeDef.ofType));\\n }\\n\\n return extendNamedType(typeDef);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d946c9dcdfd9f16cc0f280fcfd359a7b\",\n \"score\": \"0.46540397\",\n \"text\": \"function merge(a, b) {\\n return keys(b).reduce((c, k) => {\\n // no merge\\n if (a[k] === b[k]) {\\n return c;\\n // deep merge\\n } else if ((isPojo(a[k]) && isPojo(b[k])) || (isArray(a[k]) && isArray(b[k]))) {\\n return assign(c, { [k]: merge(a[k], b[k]) });\\n // override merge\\n } else {\\n return assign(c, { [k]: b[k] });\\n }\\n }, isArray(a) ? [...a] : { ...a });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13447710907a7dcce4a1e5018287a271\",\n \"score\": \"0.464966\",\n \"text\": \"function extendSchema(schema, documentAST) {\\n !(schema instanceof _schema.GraphQLSchema) ? (0, _invariant2.default)(0, 'Must provide valid GraphQLSchema') : void 0;\\n\\n !(documentAST && documentAST.kind === Kind.DOCUMENT) ? (0, _invariant2.default)(0, 'Must provide valid Document AST') : void 0;\\n\\n // Collect the type definitions and extensions found in the document.\\n var typeDefinitionMap = Object.create(null);\\n var typeExtensionsMap = Object.create(null);\\n\\n // New directives and types are separate because a directives and types can\\n // have the same name. For example, a type named \\\"skip\\\".\\n var directiveDefinitions = [];\\n\\n for (var i = 0; i < documentAST.definitions.length; i++) {\\n var def = documentAST.definitions[i];\\n switch (def.kind) {\\n case Kind.OBJECT_TYPE_DEFINITION:\\n case Kind.INTERFACE_TYPE_DEFINITION:\\n case Kind.ENUM_TYPE_DEFINITION:\\n case Kind.UNION_TYPE_DEFINITION:\\n case Kind.SCALAR_TYPE_DEFINITION:\\n case Kind.INPUT_OBJECT_TYPE_DEFINITION:\\n // Sanity check that none of the defined types conflict with the\\n // schema's existing types.\\n var typeName = def.name.value;\\n if (schema.getType(typeName)) {\\n throw new _GraphQLError.GraphQLError('Type \\\"' + typeName + '\\\" already exists in the schema. It cannot also ' + 'be defined in this type definition.', [def]);\\n }\\n typeDefinitionMap[typeName] = def;\\n break;\\n case Kind.TYPE_EXTENSION_DEFINITION:\\n // Sanity check that this type extension exists within the\\n // schema's existing types.\\n var extendedTypeName = def.definition.name.value;\\n var existingType = schema.getType(extendedTypeName);\\n if (!existingType) {\\n throw new _GraphQLError.GraphQLError('Cannot extend type \\\"' + extendedTypeName + '\\\" because it does not ' + 'exist in the existing schema.', [def.definition]);\\n }\\n if (!(existingType instanceof _definition.GraphQLObjectType)) {\\n throw new _GraphQLError.GraphQLError('Cannot extend non-object type \\\"' + extendedTypeName + '\\\".', [def.definition]);\\n }\\n var extensions = typeExtensionsMap[extendedTypeName];\\n if (extensions) {\\n extensions.push(def);\\n } else {\\n extensions = [def];\\n }\\n typeExtensionsMap[extendedTypeName] = extensions;\\n break;\\n case Kind.DIRECTIVE_DEFINITION:\\n var directiveName = def.name.value;\\n var existingDirective = schema.getDirective(directiveName);\\n if (existingDirective) {\\n throw new _GraphQLError.GraphQLError('Directive \\\"' + directiveName + '\\\" already exists in the schema. It ' + 'cannot be redefined.', [def]);\\n }\\n directiveDefinitions.push(def);\\n break;\\n }\\n }\\n\\n // If this document contains no new types, extensions, or directives then\\n // return the same unmodified GraphQLSchema instance.\\n if (Object.keys(typeExtensionsMap).length === 0 && Object.keys(typeDefinitionMap).length === 0 && directiveDefinitions.length === 0) {\\n return schema;\\n }\\n\\n // A cache to use to store the actual GraphQLType definition objects by name.\\n // Initialize to the GraphQL built in scalars and introspection types. All\\n // functions below are inline so that this type def cache is within the scope\\n // of the closure.\\n var typeDefCache = {\\n String: _scalars.GraphQLString,\\n Int: _scalars.GraphQLInt,\\n Float: _scalars.GraphQLFloat,\\n Boolean: _scalars.GraphQLBoolean,\\n ID: _scalars.GraphQLID,\\n __Schema: _introspection.__Schema,\\n __Directive: _introspection.__Directive,\\n __DirectiveLocation: _introspection.__DirectiveLocation,\\n __Type: _introspection.__Type,\\n __Field: _introspection.__Field,\\n __InputValue: _introspection.__InputValue,\\n __EnumValue: _introspection.__EnumValue,\\n __TypeKind: _introspection.__TypeKind\\n };\\n\\n // Get the root Query, Mutation, and Subscription object types.\\n var queryType = getTypeFromDef(schema.getQueryType());\\n\\n var existingMutationType = schema.getMutationType();\\n var mutationType = existingMutationType ? getTypeFromDef(existingMutationType) : null;\\n\\n var existingSubscriptionType = schema.getSubscriptionType();\\n var subscriptionType = existingSubscriptionType ? getTypeFromDef(existingSubscriptionType) : null;\\n\\n // Iterate through all types, getting the type definition for each, ensuring\\n // that any type not directly referenced by a field will get created.\\n var typeMap = schema.getTypeMap();\\n var types = Object.keys(typeMap).map(function (typeName) {\\n return getTypeFromDef(typeMap[typeName]);\\n });\\n\\n // Do the same with new types, appending to the list of defined types.\\n Object.keys(typeDefinitionMap).forEach(function (typeName) {\\n types.push(getTypeFromAST(typeDefinitionMap[typeName]));\\n });\\n\\n // Then produce and return a Schema with these types.\\n return new _schema.GraphQLSchema({\\n query: queryType,\\n mutation: mutationType,\\n subscription: subscriptionType,\\n types: types,\\n directives: getMergedDirectives(),\\n astNode: schema.astNode\\n });\\n\\n // Below are functions used for producing this schema that have closed over\\n // this scope and have access to the schema, cache, and newly defined types.\\n\\n function getMergedDirectives() {\\n var existingDirectives = schema.getDirectives();\\n !existingDirectives ? (0, _invariant2.default)(0, 'schema must have default directives') : void 0;\\n\\n var newDirectives = directiveDefinitions.map(function (directiveNode) {\\n return getDirective(directiveNode);\\n });\\n return existingDirectives.concat(newDirectives);\\n }\\n\\n function getTypeFromDef(typeDef) {\\n var type = _getNamedType(typeDef.name);\\n !type ? (0, _invariant2.default)(0, 'Missing type from schema') : void 0;\\n return type;\\n }\\n\\n function getTypeFromAST(node) {\\n var type = _getNamedType(node.name.value);\\n if (!type) {\\n throw new _GraphQLError.GraphQLError('Unknown type: \\\"' + node.name.value + '\\\". Ensure that this type exists ' + 'either in the original schema, or is added in a type definition.', [node]);\\n }\\n return type;\\n }\\n\\n function getObjectTypeFromAST(node) {\\n var type = getTypeFromAST(node);\\n !(type instanceof _definition.GraphQLObjectType) ? (0, _invariant2.default)(0, 'Must be Object type.') : void 0;\\n return type;\\n }\\n\\n function getInterfaceTypeFromAST(node) {\\n var type = getTypeFromAST(node);\\n !(type instanceof _definition.GraphQLInterfaceType) ? (0, _invariant2.default)(0, 'Must be Interface type.') : void 0;\\n return type;\\n }\\n\\n function getInputTypeFromAST(node) {\\n return (0, _definition.assertInputType)(getTypeFromAST(node));\\n }\\n\\n function getOutputTypeFromAST(node) {\\n return (0, _definition.assertOutputType)(getTypeFromAST(node));\\n }\\n\\n // Given a name, returns a type from either the existing schema or an\\n // added type.\\n function _getNamedType(typeName) {\\n var cachedTypeDef = typeDefCache[typeName];\\n if (cachedTypeDef) {\\n return cachedTypeDef;\\n }\\n\\n var existingType = schema.getType(typeName);\\n if (existingType) {\\n var typeDef = extendType(existingType);\\n typeDefCache[typeName] = typeDef;\\n return typeDef;\\n }\\n\\n var typeNode = typeDefinitionMap[typeName];\\n if (typeNode) {\\n var _typeDef = buildType(typeNode);\\n typeDefCache[typeName] = _typeDef;\\n return _typeDef;\\n }\\n }\\n\\n // Given a type's introspection result, construct the correct\\n // GraphQLType instance.\\n function extendType(type) {\\n if (type instanceof _definition.GraphQLObjectType) {\\n return extendObjectType(type);\\n }\\n if (type instanceof _definition.GraphQLInterfaceType) {\\n return extendInterfaceType(type);\\n }\\n if (type instanceof _definition.GraphQLUnionType) {\\n return extendUnionType(type);\\n }\\n return type;\\n }\\n\\n function extendObjectType(type) {\\n var name = type.name;\\n var extensionASTNodes = type.extensionASTNodes;\\n if (typeExtensionsMap[name]) {\\n extensionASTNodes = extensionASTNodes.concat(typeExtensionsMap[name]);\\n }\\n\\n return new _definition.GraphQLObjectType({\\n name: name,\\n description: type.description,\\n interfaces: function interfaces() {\\n return extendImplementedInterfaces(type);\\n },\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n extensionASTNodes: extensionASTNodes,\\n isTypeOf: type.isTypeOf\\n });\\n }\\n\\n function extendInterfaceType(type) {\\n return new _definition.GraphQLInterfaceType({\\n name: type.name,\\n description: type.description,\\n fields: function fields() {\\n return extendFieldMap(type);\\n },\\n astNode: type.astNode,\\n resolveType: type.resolveType\\n });\\n }\\n\\n function extendUnionType(type) {\\n return new _definition.GraphQLUnionType({\\n name: type.name,\\n description: type.description,\\n types: type.getTypes().map(getTypeFromDef),\\n astNode: type.astNode,\\n resolveType: type.resolveType\\n });\\n }\\n\\n function extendImplementedInterfaces(type) {\\n var interfaces = type.getInterfaces().map(getTypeFromDef);\\n\\n // If there are any extensions to the interfaces, apply those here.\\n var extensions = typeExtensionsMap[type.name];\\n if (extensions) {\\n extensions.forEach(function (extension) {\\n extension.definition.interfaces.forEach(function (namedType) {\\n var interfaceName = namedType.name.value;\\n if (interfaces.some(function (def) {\\n return def.name === interfaceName;\\n })) {\\n throw new _GraphQLError.GraphQLError('Type \\\"' + type.name + '\\\" already implements \\\"' + interfaceName + '\\\". ' + 'It cannot also be implemented in this type extension.', [namedType]);\\n }\\n interfaces.push(getInterfaceTypeFromAST(namedType));\\n });\\n });\\n }\\n\\n return interfaces;\\n }\\n\\n function extendFieldMap(type) {\\n var newFieldMap = Object.create(null);\\n var oldFieldMap = type.getFields();\\n Object.keys(oldFieldMap).forEach(function (fieldName) {\\n var field = oldFieldMap[fieldName];\\n newFieldMap[fieldName] = {\\n description: field.description,\\n deprecationReason: field.deprecationReason,\\n type: extendFieldType(field.type),\\n args: (0, _keyMap2.default)(field.args, function (arg) {\\n return arg.name;\\n }),\\n astNode: field.astNode,\\n resolve: field.resolve\\n };\\n });\\n\\n // If there are any extensions to the fields, apply those here.\\n var extensions = typeExtensionsMap[type.name];\\n if (extensions) {\\n extensions.forEach(function (extension) {\\n extension.definition.fields.forEach(function (field) {\\n var fieldName = field.name.value;\\n if (oldFieldMap[fieldName]) {\\n throw new _GraphQLError.GraphQLError('Field \\\"' + type.name + '.' + fieldName + '\\\" already exists in the ' + 'schema. It cannot also be defined in this type extension.', [field]);\\n }\\n newFieldMap[fieldName] = {\\n description: (0, _buildASTSchema.getDescription)(field),\\n type: buildOutputFieldType(field.type),\\n args: buildInputValues(field.arguments),\\n deprecationReason: (0, _buildASTSchema.getDeprecationReason)(field),\\n astNode: field\\n };\\n });\\n });\\n }\\n\\n return newFieldMap;\\n }\\n\\n function extendFieldType(typeDef) {\\n if (typeDef instanceof _definition.GraphQLList) {\\n return new _definition.GraphQLList(extendFieldType(typeDef.ofType));\\n }\\n if (typeDef instanceof _definition.GraphQLNonNull) {\\n return new _definition.GraphQLNonNull(extendFieldType(typeDef.ofType));\\n }\\n return getTypeFromDef(typeDef);\\n }\\n\\n function buildType(typeNode) {\\n switch (typeNode.kind) {\\n case Kind.OBJECT_TYPE_DEFINITION:\\n return buildObjectType(typeNode);\\n case Kind.INTERFACE_TYPE_DEFINITION:\\n return buildInterfaceType(typeNode);\\n case Kind.UNION_TYPE_DEFINITION:\\n return buildUnionType(typeNode);\\n case Kind.SCALAR_TYPE_DEFINITION:\\n return buildScalarType(typeNode);\\n case Kind.ENUM_TYPE_DEFINITION:\\n return buildEnumType(typeNode);\\n case Kind.INPUT_OBJECT_TYPE_DEFINITION:\\n return buildInputObjectType(typeNode);\\n }\\n throw new TypeError('Unknown type kind ' + typeNode.kind);\\n }\\n\\n function buildObjectType(typeNode) {\\n return new _definition.GraphQLObjectType({\\n name: typeNode.name.value,\\n description: (0, _buildASTSchema.getDescription)(typeNode),\\n interfaces: function interfaces() {\\n return buildImplementedInterfaces(typeNode);\\n },\\n fields: function fields() {\\n return buildFieldMap(typeNode);\\n },\\n astNode: typeNode\\n });\\n }\\n\\n function buildInterfaceType(typeNode) {\\n return new _definition.GraphQLInterfaceType({\\n name: typeNode.name.value,\\n description: (0, _buildASTSchema.getDescription)(typeNode),\\n fields: function fields() {\\n return buildFieldMap(typeNode);\\n },\\n astNode: typeNode,\\n resolveType: cannotExecuteExtendedSchema\\n });\\n }\\n\\n function buildUnionType(typeNode) {\\n return new _definition.GraphQLUnionType({\\n name: typeNode.name.value,\\n description: (0, _buildASTSchema.getDescription)(typeNode),\\n types: typeNode.types.map(getObjectTypeFromAST),\\n astNode: typeNode,\\n resolveType: cannotExecuteExtendedSchema\\n });\\n }\\n\\n function buildScalarType(typeNode) {\\n return new _definition.GraphQLScalarType({\\n name: typeNode.name.value,\\n description: (0, _buildASTSchema.getDescription)(typeNode),\\n astNode: typeNode,\\n serialize: function serialize(id) {\\n return id;\\n },\\n // Note: validation calls the parse functions to determine if a\\n // literal value is correct. Returning null would cause use of custom\\n // scalars to always fail validation. Returning false causes them to\\n // always pass validation.\\n parseValue: function parseValue() {\\n return false;\\n },\\n parseLiteral: function parseLiteral() {\\n return false;\\n }\\n });\\n }\\n\\n function buildEnumType(typeNode) {\\n return new _definition.GraphQLEnumType({\\n name: typeNode.name.value,\\n description: (0, _buildASTSchema.getDescription)(typeNode),\\n values: (0, _keyValMap2.default)(typeNode.values, function (enumValue) {\\n return enumValue.name.value;\\n }, function (enumValue) {\\n return {\\n description: (0, _buildASTSchema.getDescription)(enumValue),\\n deprecationReason: (0, _buildASTSchema.getDeprecationReason)(enumValue),\\n astNode: enumValue\\n };\\n }),\\n astNode: typeNode\\n });\\n }\\n\\n function buildInputObjectType(typeNode) {\\n return new _definition.GraphQLInputObjectType({\\n name: typeNode.name.value,\\n description: (0, _buildASTSchema.getDescription)(typeNode),\\n fields: function fields() {\\n return buildInputValues(typeNode.fields);\\n },\\n astNode: typeNode\\n });\\n }\\n\\n function getDirective(directiveNode) {\\n return new _directives.GraphQLDirective({\\n name: directiveNode.name.value,\\n description: (0, _buildASTSchema.getDescription)(directiveNode),\\n locations: directiveNode.locations.map(function (node) {\\n return node.value;\\n }),\\n args: directiveNode.arguments && buildInputValues(directiveNode.arguments),\\n astNode: directiveNode\\n });\\n }\\n\\n function buildImplementedInterfaces(typeNode) {\\n return typeNode.interfaces && typeNode.interfaces.map(getInterfaceTypeFromAST);\\n }\\n\\n function buildFieldMap(typeNode) {\\n return (0, _keyValMap2.default)(typeNode.fields, function (field) {\\n return field.name.value;\\n }, function (field) {\\n return {\\n type: buildOutputFieldType(field.type),\\n description: (0, _buildASTSchema.getDescription)(field),\\n args: buildInputValues(field.arguments),\\n deprecationReason: (0, _buildASTSchema.getDeprecationReason)(field),\\n astNode: field\\n };\\n });\\n }\\n\\n function buildInputValues(values) {\\n return (0, _keyValMap2.default)(values, function (value) {\\n return value.name.value;\\n }, function (value) {\\n var type = buildInputFieldType(value.type);\\n return {\\n type: type,\\n description: (0, _buildASTSchema.getDescription)(value),\\n defaultValue: (0, _valueFromAST.valueFromAST)(value.defaultValue, type),\\n astNode: value\\n };\\n });\\n }\\n\\n function buildInputFieldType(typeNode) {\\n if (typeNode.kind === Kind.LIST_TYPE) {\\n return new _definition.GraphQLList(buildInputFieldType(typeNode.type));\\n }\\n if (typeNode.kind === Kind.NON_NULL_TYPE) {\\n var nullableType = buildInputFieldType(typeNode.type);\\n !!(nullableType instanceof _definition.GraphQLNonNull) ? (0, _invariant2.default)(0, 'Must be nullable') : void 0;\\n return new _definition.GraphQLNonNull(nullableType);\\n }\\n return getInputTypeFromAST(typeNode);\\n }\\n\\n function buildOutputFieldType(typeNode) {\\n if (typeNode.kind === Kind.LIST_TYPE) {\\n return new _definition.GraphQLList(buildOutputFieldType(typeNode.type));\\n }\\n if (typeNode.kind === Kind.NON_NULL_TYPE) {\\n var nullableType = buildOutputFieldType(typeNode.type);\\n !!(nullableType instanceof _definition.GraphQLNonNull) ? (0, _invariant2.default)(0, 'Must be nullable') : void 0;\\n return new _definition.GraphQLNonNull(nullableType);\\n }\\n return getOutputTypeFromAST(typeNode);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa4d2ca9b14e4adefe2392b4afaebf11\",\n \"score\": \"0.46334943\",\n \"text\": \"function deepMergeStyles(dest, src) {\\n\\t Object.keys(src).forEach(function (expr) {\\n\\t dest[expr] = dest[expr] || {};\\n\\t Object.keys(src[expr]).forEach(function (type) {\\n\\t dest[expr][type] = dest[expr][type] || {};\\n\\t Object.assign(dest[expr][type], src[expr][type]);\\n\\t });\\n\\t });\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"436fe8f32b7038d69b8eb777a7260354\",\n \"score\": \"0.46265915\",\n \"text\": \"function getMergedDirectives() {\\n\\t var existingDirectives = schema.getDirectives();\\n\\t (0, _invariant2.default)(existingDirectives, 'schema must have default directives');\\n\\n\\t var newDirectives = directiveDefinitions.map(function (directiveNode) {\\n\\t return getDirective(directiveNode);\\n\\t });\\n\\t return existingDirectives.concat(newDirectives);\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be4e74639a893c59321c18a68447b8c2\",\n \"score\": \"0.4625794\",\n \"text\": \"function getMergedDirectives() {\\n var existingDirectives = schema.getDirectives();\\n !existingDirectives ? (0, _invariant2.default)(0, 'schema must have default directives') : void 0;\\n\\n var newDirectives = directiveDefinitions.map(function (directiveNode) {\\n return getDirective(directiveNode);\\n });\\n return existingDirectives.concat(newDirectives);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d6c33a1ec0a98055b63ee3a883bfcb2\",\n \"score\": \"0.461278\",\n \"text\": \"function merge_databases(db_main, db_sub, server) {\\r\\n let keys = Object.keys(db_sub);\\r\\n let mainKeys = Object.keys(db_main).map((d) => { return +d; }).sort((a,b) => { return a-b; });\\r\\n for (var item of keys) { //iterate through everything in object\\r\\n var id = +item;\\r\\n // if (db_main[item] !== undefined) { //exists, so just add date add time\\r\\n if(_.sortedIndexOf(mainKeys,id) > -1){\\r\\n if (db_main[item].server.indexOf(server) == -1) {\\r\\n db_main[item].server.push(server);\\r\\n }\\r\\n } else { //doesn't exist, so add it\\r\\n db_main[item] = db_sub[item];\\r\\n db_main[item].server = [server];\\r\\n }\\r\\n delete db_sub[item];\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd2ddd1f5e64383656a98d0068cf71af\",\n \"score\": \"0.46059272\",\n \"text\": \"function loadSchemaSync(schemaPointers, options) {\\n const sources = loadTypedefsSync(schemaPointers, {\\n filterKinds: OPERATION_KINDS,\\n ...options,\\n });\\n const { schemas, typeDefs } = collectSchemasAndTypeDefs(sources);\\n const mergeSchemasOptions = {\\n schemas,\\n typeDefs,\\n ...options,\\n };\\n const schema = merge.mergeSchemas(mergeSchemasOptions);\\n if (options === null || options === void 0 ? void 0 : options.includeSources) {\\n includeSources(schema, sources);\\n }\\n return schema;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"771cc6810485d836f7e00caee01e1683\",\n \"score\": \"0.4593318\",\n \"text\": \"function merge(a, b) {\\n\\n if (b) {\\n for (var key in b) {\\n // avoid immediately resolving b's contents\\n a.__defineGetter__(key, function() {\\n return b[key];\\n });\\n }\\n }\\n return a;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72fe443bddc2be49a2daab8633cac8e5\",\n \"score\": \"0.45898345\",\n \"text\": \"function merge(obj1, obj2) {\\n\\t\\tfor (var attrname in obj2) { obj1[attrname] = obj2[attrname]; }\\n\\t\\treturn obj1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d06bcd308678f9b86327602077b11c6\",\n \"score\": \"0.45852926\",\n \"text\": \"function addType (instanceType, schemaType) {\\n if (schemaType === undefined) {\\n // if we are adding a type to an empty schema, its type will be undefined\\n return instanceType;\\n }\\n else if (Array.isArray(schemaType)) {\\n return schemaType.concat(instanceType);\\n }\\n else {\\n return [schemaType, instanceType];\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba08cfe751caa54f62682a5d0500260f\",\n \"score\": \"0.45841995\",\n \"text\": \"function objMerge(a, b) {\\n Object.keys(b).forEach(function (k) {\\n a[k] = b[k];\\n });\\n return a;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2265d0efa67c043dccce751c2269201\",\n \"score\": \"0.45837656\",\n \"text\": \"function merge(obj1, obj2) {\\n var obj3 = {};\\n\\n mergeInto(obj3, obj1);\\n mergeInto(obj3, obj2);\\n\\n return obj3;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ded7c4d7bb96cbb793e8acda35df31a5\",\n \"score\": \"0.4583331\",\n \"text\": \"function combineObjectsAndAddAttribute(obj1,obj2) {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"170f694690bcf059f9deff26af2b6d93\",\n \"score\": \"0.4578722\",\n \"text\": \"function mergeGedcomx(gx1, gx2) {\\n function checkForIdCollisions(listName, list1, list2) {\\n let ids1 = new Set();\\n for (let element of list1) {\\n if (element.id) {\\n if (ids1.has(element.id)) {\\n throw new Error(\\\"Odd. Two \\\" + listName + \\\" with same ID in gedcomx1\\\");\\n }\\n ids1.add(element.id);\\n }\\n }\\n for (let element of list2) {\\n if (element.id && ids1.has(element.id)) {\\n // If you hit this error, then take the time to write the code so that when merging two GedcomX objects,\\n // we make sure all of the ids of all kinds are unique, and that all of the references to them use the\\n // new IDs. (i.e., relationship.person1/2=>new person IDs; source[references] => new sourceDescription ids; place references=>new place description ids;\\n // and attributions => new agent Ids.\\n throw new Error(\\\"Error: Same id '\\\" + element.id + \\\"' in \\\" + listName + \\\" list in Gedcomx1 and Gedcomx2. Fancier code needed...\\\");\\n }\\n }\\n }\\n\\n function mergeArrays(listName) {\\n let list1 = gx1[listName];\\n let list2 = gx2[listName];\\n if (list2 && list2.length > 0) {\\n if (!list1 || list1.length === 0) {\\n gx1[listName] = gx2[listName];\\n }\\n else {\\n checkForIdCollisions(listName, list1, list2);\\n list1.push(...list2);\\n }\\n }\\n }\\n\\n if (!gx2) {\\n return; // nothing to do\\n }\\n for (let listName of [\\\"persons\\\", \\\"relationships\\\", \\\"sourceDescriptions\\\", \\\"agents\\\", \\\"events\\\", \\\"places\\\", \\\"documents\\\", \\\"collections\\\", \\\"fields\\\", \\\"recordDescriptors\\\"]) {\\n mergeArrays(listName);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5104b066a47b72ed352806ab8eeeb31f\",\n \"score\": \"0.45760557\",\n \"text\": \"function getMergedDirectives() {\\n\\t var existingDirectives = schema.getDirectives();\\n\\t !existingDirectives ? invariant(0, 'schema must have default directives') : void 0;\\n\\n\\t var newDirectives = directiveDefinitions.map(function (directiveNode) {\\n\\t return definitionBuilder.buildDirective(directiveNode);\\n\\t });\\n\\t return existingDirectives.concat(newDirectives);\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51d029462183258601b3952cbefd3584\",\n \"score\": \"0.4571091\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeA)) {\\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isSubType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isSubType(typeA, typeB);\\n }\\n\\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isSubType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51d029462183258601b3952cbefd3584\",\n \"score\": \"0.4571091\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeA)) {\\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isSubType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isSubType(typeA, typeB);\\n }\\n\\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isSubType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecb5f59f7d5b9a1e3946ebf8197bdbe6\",\n \"score\": \"0.45661542\",\n \"text\": \"getAdditionalSchemas() {\\n const additionalSchemas = this.schemas.join('\\\\n');\\n return additionalSchemas;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a1d36b5e58a7eccebd34e3ac90a72e5\",\n \"score\": \"0.45627776\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeA)) {\\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isPossibleType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isPossibleType(typeA, typeB);\\n }\\n\\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isPossibleType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a819c40db84ba92cfcae7070a8ce97c5\",\n \"score\": \"0.45545125\",\n \"text\": \"merge(...sources) {\\n for (const source of sources) {\\n for (let k in source) {\\n let vs = source[k],\\n vt = this[k];\\n if (Object(vs) == vs && Object(vt) === vt) {\\n this[k] = this.merge(vt, vs);\\n continue;\\n }\\n this[k] = source[k];\\n }\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af6bd185b786e537d855db577db0fd7f\",\n \"score\": \"0.4545793\",\n \"text\": \"merge(...sources) {\\n for (const source of sources) {\\n for (let k in source) {\\n let vs = source[k],\\n vt = this[k];\\n if (Object(vs) === vs && Object(vt) === vt) {\\n this[k] = this.mergeHelp(vt, vs);\\n continue;\\n }\\n this[k] = source[k];\\n }\\n }\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e1076527bf4f22ead71fba045c22bde\",\n \"score\": \"0.45432764\",\n \"text\": \"function extend(first, second) {\\n const result = {};\\n for (const id in second) {\\n if (hasOwnProperty.call(second, id)) {\\n result[id] = second[id];\\n }\\n }\\n for (const id in first) {\\n if (hasOwnProperty.call(first, id)) {\\n result[id] = first[id];\\n }\\n }\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a4eb66e5e3cd3c827dfffaf124abf77\",\n \"score\": \"0.45281678\",\n \"text\": \"function merge(target, source) {\\n // base props\\n target = Object.assign( {}, target, _.pick(source, ['devtool', 'mode', 'target']) )\\n\\n target.entry = Object.assign({}, target.entry, source.entry)\\n target.output = Object.assign({}, target.output, source.output)\\n target.plugins = target.plugins.concat( source.plugins )\\n\\n\\n return target\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55cbef2e70ad9def21ec7f0d8cf27a73\",\n \"score\": \"0.45250246\",\n \"text\": \"function externalApi(input1orig, input2orig, originalOpts) {\\n if (!arguments.length) {\\n throw new TypeError(\\\"object-merge-advanced/mergeAdvanced(): [THROW_ID_01] Both inputs are missing\\\");\\n }\\n // notice we have first argument tracking the current path, which is not\\n // exposed to the external API.\\n return mergeAdvanced({ key: null, path: \\\"\\\", type: [getType(input1orig), getType(input2orig)] }, input1orig, input2orig, originalOpts);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bce4933ffd4406c5e43e176fa5789c5f\",\n \"score\": \"0.45248154\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeA)) {\\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isSubType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isSubType(typeA, typeB);\\n }\\n\\n if (Object(_type_definition_mjs__WEBPACK_IMPORTED_MODULE_0__[\\\"isAbstractType\\\"])(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isSubType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40b8e1de3f1cb2e21d476f27f8d5aa6a\",\n \"score\": \"0.45201898\",\n \"text\": \"function addSchemaToProduct(ProductQuery, SchemaName, SchemaId){ //Product query should usualyl be the Product Id, SchemaName = Model name, SchemaId = individual schema id from our Helpers dbs\\n let collectionObj = mongoose.model('Product');\\n let schemaObj = mongoose.model(SchemaName);\\n let SchemaKey = Object.keys(SchemaId)[0]\\n let ObjDestination = SchemaName.toLowerCase()+'s'\\n return new Promise(function(resolve, reject) {\\n schemaObj.findOne(SchemaId)\\n .then((Schema)=>{\\n let ProductObj = Schema\\n //console.log('Schema Id added:',Schema._id)\\n collectionObj.findOne(ProductQuery)\\n .then((Product)=>{\\n Product[ObjDestination].push(Schema); return Product\\n })\\n .then((Product)=>{Product.save();console.log('Adding '+SchemaName+' to Product with Id:',Product._id);return Product})\\n .then((Product)=>{resolve(Product)}) //injects into the Product\\n })\\n })}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ec0a63cab33a8f714d2bdc6186f5092\",\n \"score\": \"0.45150247\",\n \"text\": \"function merge(a, b) {\\n var merged;\\n if (a instanceof immutable.Sequence) {\\n // Use merge to create another immutable seq\\n merged = a.merge(b);\\n } else if (Array.isArray(a)) { // Object.create(Array.prototype) doesn't work :'(\\n merged = Array.prototype.slice.call(a);\\n Sequence(b).forEach(function(v, k) { merged[k] = v; });\\n } else {\\n var proto = Object.getPrototypeOf(a);\\n merged = Object.create(proto);\\n Object.keys(a).forEach(function(k) { merged[k] = a[k]; });\\n Sequence(b).forEach(function(v, k) { merged[k] = v; });\\n }\\n return merged;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb0d78eb3d139306b15db0e2d28224c0\",\n \"score\": \"0.4514686\",\n \"text\": \"function doMerge(group1, group2) {\\n let merged = _.clone(group1);\\n Object.keys(group2).forEach(nodeType => {\\n if(merged[nodeType]) {\\n merged[nodeType] = doSetMerge(merged[nodeType],group2[nodeType]);\\n }\\n else {\\n merged[nodeType] = group2[nodeType]\\n }\\n });\\n return merged;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a34d0c23debf015dde749c3fdbfb7048\",\n \"score\": \"0.45079502\",\n \"text\": \"function cloneSchema(schema) {\\n // TODO(ejoebstl): It would be better to have a concrete implementation for\\n // each SDL object and require a clone method on interface level.\\n var copy = __assign({}, schema);\\n cloneComments(copy, schema);\\n copy.types = [];\\n for (var _i = 0, _a = schema.types; _i < _a.length; _i++) {\\n var type = _a[_i];\\n copy.types.push(cloneType(type));\\n }\\n // Re-Assign type pointer for relations\\n for (var _b = 0, _c = copy.types; _b < _c.length; _b++) {\\n var type = _c[_b];\\n var _loop_1 = function (field) {\\n if (typeof field.type !== 'string') {\\n var typeName_1 = field.type.name;\\n var fieldType = copy.types.filter(function (x) { return x.name === typeName_1; })[0];\\n console.assert(fieldType !== undefined); // This case should never happen\\n field.type = fieldType;\\n }\\n };\\n for (var _d = 0, _e = type.fields; _d < _e.length; _d++) {\\n var field = _e[_d];\\n _loop_1(field);\\n }\\n }\\n // Re-Assign field pointer for indices\\n for (var _f = 0, _g = copy.types; _f < _g.length; _f++) {\\n var type = _g[_f];\\n if (type.indices !== undefined) {\\n for (var _h = 0, _j = type.indices; _h < _j.length; _h++) {\\n var index = _j[_h];\\n var _loop_2 = function (i) {\\n var fieldName = index.fields[i].name;\\n var field = type.fields.filter(function (x) { return x.name === fieldName; })[0];\\n console.assert(field !== undefined); // This case should never happen\\n index.fields[i] = field;\\n };\\n // We need an index for setting the element\\n // tslint:disable-next-line:prefer-for-of\\n for (var i = 0; i < index.fields.length; i++) {\\n _loop_2(i);\\n }\\n }\\n }\\n }\\n return copy;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"161b6a2b04bc61cb47cfe0eda932e37c\",\n \"score\": \"0.4506351\",\n \"text\": \"function mergeConfig(c1, c2) {\\n if (!c2) {\\n return c1;\\n }\\n return __assign(__assign(__assign({}, (c1 || {})), (c2 || {})), Object.keys(c1).reduce(function (all, k) {\\n all[k] = __assign(__assign({}, c1[k]), (c2[k] || {}));\\n return all;\\n }, {}));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a1baea2324f3c051870041dc95efc0b\",\n \"score\": \"0.45049804\",\n \"text\": \"function _extend() {\\n // Get arguments\\n var objects = arguments;\\n\\n // Bail if nothing to merge\\n if (!objects.length) {\\n return;\\n }\\n\\n // Return first if specified but nothing to merge\\n if (objects.lenth == 1) {\\n return objects[0];\\n }\\n\\n // First object is the destination\\n var destination = Array.prototype.shift.call(objects),\\n length = objects.length;\\n\\n // Loop through all objects to merge\\n for (var i = 0; i < length; i++) {\\n var source = objects[i];\\n\\n for (var property in source) {\\n if (source[property] && source[property].constructor && source[property].constructor === Object) {\\n destination[property] = destination[property] || {};\\n _extend(destination[property], source[property]);\\n }\\n else {\\n destination[property] = source[property];\\n }\\n }\\n }\\n\\n return destination;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3feec1217c490c0a57a6cfc154b95da\",\n \"score\": \"0.4496471\",\n \"text\": \"function mergeOptions(options1, options2) {\\n options1 = options1 || {}\\n options2 = options2 || {}\\n const result = { ...options1, ...options2 }\\n Object.keys(result).forEach(key => {\\n if (Array.isArray(options1[key]) && Array.isArray(options2[key])) {\\n result[key] = mergeArrays(options1[key], options2[key])\\n }\\n })\\n return result\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c5f4c619e72861425da2a49facd1e17\",\n \"score\": \"0.44958407\",\n \"text\": \"function extendSchema(schema, documentAST, options) {\\n Object(_type_schema__WEBPACK_IMPORTED_MODULE_8__[\\\"assertSchema\\\"])(schema);\\n !(documentAST && documentAST.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[\\\"Kind\\\"].DOCUMENT) ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"])(0, 'Must provide valid Document AST') : void 0;\\n\\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\\n Object(_validation_validate__WEBPACK_IMPORTED_MODULE_7__[\\\"assertValidSDLExtension\\\"])(documentAST, schema);\\n } // Collect the type definitions and extensions found in the document.\\n\\n\\n var typeDefs = [];\\n var typeExtsMap = Object.create(null); // New directives and types are separate because a directives and types can\\n // have the same name. For example, a type named \\\"skip\\\".\\n\\n var directiveDefs = [];\\n var schemaDef; // Schema extensions are collected which may add additional operation types.\\n\\n var schemaExts = [];\\n var _iteratorNormalCompletion = true;\\n var _didIteratorError = false;\\n var _iteratorError = undefined;\\n\\n try {\\n for (var _iterator = documentAST.definitions[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\\n var def = _step.value;\\n\\n if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[\\\"Kind\\\"].SCHEMA_DEFINITION) {\\n schemaDef = def;\\n } else if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[\\\"Kind\\\"].SCHEMA_EXTENSION) {\\n schemaExts.push(def);\\n } else if (Object(_language_predicates__WEBPACK_IMPORTED_MODULE_14__[\\\"isTypeDefinitionNode\\\"])(def)) {\\n typeDefs.push(def);\\n } else if (Object(_language_predicates__WEBPACK_IMPORTED_MODULE_14__[\\\"isTypeExtensionNode\\\"])(def)) {\\n var extendedTypeName = def.name.value;\\n var existingTypeExts = typeExtsMap[extendedTypeName];\\n typeExtsMap[extendedTypeName] = existingTypeExts ? existingTypeExts.concat([def]) : [def];\\n } else if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[\\\"Kind\\\"].DIRECTIVE_DEFINITION) {\\n directiveDefs.push(def);\\n }\\n } // If this document contains no new types, extensions, or directives then\\n // return the same unmodified GraphQLSchema instance.\\n\\n } catch (err) {\\n _didIteratorError = true;\\n _iteratorError = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion && _iterator.return != null) {\\n _iterator.return();\\n }\\n } finally {\\n if (_didIteratorError) {\\n throw _iteratorError;\\n }\\n }\\n }\\n\\n if (Object.keys(typeExtsMap).length === 0 && typeDefs.length === 0 && directiveDefs.length === 0 && schemaExts.length === 0 && !schemaDef) {\\n return schema;\\n }\\n\\n var schemaConfig = schema.toConfig();\\n var astBuilder = new _buildASTSchema__WEBPACK_IMPORTED_MODULE_6__[\\\"ASTDefinitionBuilder\\\"](options, function (typeName) {\\n var type = typeMap[typeName];\\n !type ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"])(0, \\\"Unknown type: \\\\\\\"\\\".concat(typeName, \\\"\\\\\\\".\\\")) : void 0;\\n return type;\\n });\\n var typeMap = Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"])(typeDefs, function (node) {\\n return node.name.value;\\n }, function (node) {\\n return astBuilder.buildType(node);\\n });\\n var _iteratorNormalCompletion2 = true;\\n var _didIteratorError2 = false;\\n var _iteratorError2 = undefined;\\n\\n try {\\n for (var _iterator2 = schemaConfig.types[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\\n var existingType = _step2.value;\\n typeMap[existingType.name] = extendNamedType(existingType);\\n } // Get the extended root operation types.\\n\\n } catch (err) {\\n _didIteratorError2 = true;\\n _iteratorError2 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\\n _iterator2.return();\\n }\\n } finally {\\n if (_didIteratorError2) {\\n throw _iteratorError2;\\n }\\n }\\n }\\n\\n var operationTypes = {\\n query: schemaConfig.query && schemaConfig.query.name,\\n mutation: schemaConfig.mutation && schemaConfig.mutation.name,\\n subscription: schemaConfig.subscription && schemaConfig.subscription.name\\n };\\n\\n if (schemaDef) {\\n var _iteratorNormalCompletion3 = true;\\n var _didIteratorError3 = false;\\n var _iteratorError3 = undefined;\\n\\n try {\\n for (var _iterator3 = schemaDef.operationTypes[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\\n var _ref2 = _step3.value;\\n var operation = _ref2.operation;\\n var type = _ref2.type;\\n operationTypes[operation] = type.name.value;\\n }\\n } catch (err) {\\n _didIteratorError3 = true;\\n _iteratorError3 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\\n _iterator3.return();\\n }\\n } finally {\\n if (_didIteratorError3) {\\n throw _iteratorError3;\\n }\\n }\\n }\\n } // Then, incorporate schema definition and all schema extensions.\\n\\n\\n for (var _i = 0, _schemaExts = schemaExts; _i < _schemaExts.length; _i++) {\\n var schemaExt = _schemaExts[_i];\\n\\n if (schemaExt.operationTypes) {\\n var _iteratorNormalCompletion4 = true;\\n var _didIteratorError4 = false;\\n var _iteratorError4 = undefined;\\n\\n try {\\n for (var _iterator4 = schemaExt.operationTypes[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\\n var _ref4 = _step4.value;\\n var _operation = _ref4.operation;\\n var _type = _ref4.type;\\n operationTypes[_operation] = _type.name.value;\\n }\\n } catch (err) {\\n _didIteratorError4 = true;\\n _iteratorError4 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\\n _iterator4.return();\\n }\\n } finally {\\n if (_didIteratorError4) {\\n throw _iteratorError4;\\n }\\n }\\n }\\n }\\n } // Support both original legacy names and extended legacy names.\\n\\n\\n var allowedLegacyNames = schemaConfig.allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\\n\\n return new _type_schema__WEBPACK_IMPORTED_MODULE_8__[\\\"GraphQLSchema\\\"]({\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n query: getMaybeTypeByName(operationTypes.query),\\n mutation: getMaybeTypeByName(operationTypes.mutation),\\n subscription: getMaybeTypeByName(operationTypes.subscription),\\n types: Object(_polyfills_objectValues__WEBPACK_IMPORTED_MODULE_1__[\\\"default\\\"])(typeMap),\\n directives: getMergedDirectives(),\\n astNode: schemaDef || schemaConfig.astNode,\\n extensionASTNodes: schemaConfig.extensionASTNodes.concat(schemaExts),\\n allowedLegacyNames: allowedLegacyNames\\n }); // Below are functions used for producing this schema that have closed over\\n // this scope and have access to the schema, cache, and newly defined types.\\n\\n function replaceType(type) {\\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"isListType\\\"])(type)) {\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"GraphQLList\\\"](replaceType(type.ofType));\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"isNonNullType\\\"])(type)) {\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"GraphQLNonNull\\\"](replaceType(type.ofType));\\n }\\n\\n return replaceNamedType(type);\\n }\\n\\n function replaceNamedType(type) {\\n return typeMap[type.name];\\n }\\n\\n function getMaybeTypeByName(typeName) {\\n return typeName ? typeMap[typeName] : null;\\n }\\n\\n function getMergedDirectives() {\\n var existingDirectives = schema.getDirectives().map(extendDirective);\\n !existingDirectives ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[\\\"default\\\"])(0, 'schema must have default directives') : void 0;\\n return existingDirectives.concat(directiveDefs.map(function (node) {\\n return astBuilder.buildDirective(node);\\n }));\\n }\\n\\n function extendNamedType(type) {\\n if (Object(_type_introspection__WEBPACK_IMPORTED_MODULE_9__[\\\"isIntrospectionType\\\"])(type) || Object(_type_scalars__WEBPACK_IMPORTED_MODULE_10__[\\\"isSpecifiedScalarType\\\"])(type)) {\\n // Builtin types are not extended.\\n return type;\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"isScalarType\\\"])(type)) {\\n return extendScalarType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"isObjectType\\\"])(type)) {\\n return extendObjectType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"isInterfaceType\\\"])(type)) {\\n return extendInterfaceType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"isUnionType\\\"])(type)) {\\n return extendUnionType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"isEnumType\\\"])(type)) {\\n return extendEnumType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"isInputObjectType\\\"])(type)) {\\n return extendInputObjectType(type);\\n } // Not reachable. All possible types have been considered.\\n\\n /* istanbul ignore next */\\n\\n\\n throw new Error(\\\"Unexpected type: \\\\\\\"\\\".concat(Object(_jsutils_inspect__WEBPACK_IMPORTED_MODULE_2__[\\\"default\\\"])(type), \\\"\\\\\\\".\\\"));\\n }\\n\\n function extendDirective(directive) {\\n var config = directive.toConfig();\\n return new _type_directives__WEBPACK_IMPORTED_MODULE_12__[\\\"GraphQLDirective\\\"](_objectSpread({}, config, {\\n args: Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"])(config.args, extendArg)\\n }));\\n }\\n\\n function extendInputObjectType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])(extensions, function (node) {\\n return node.fields || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"GraphQLInputObjectType\\\"](_objectSpread({}, config, {\\n fields: function fields() {\\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"])(config.fields, function (field) {\\n return _objectSpread({}, field, {\\n type: replaceType(field.type)\\n });\\n }), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"])(fieldNodes, function (field) {\\n return field.name.value;\\n }, function (field) {\\n return astBuilder.buildInputField(field);\\n }));\\n },\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendEnumType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[type.name] || [];\\n var valueNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])(extensions, function (node) {\\n return node.values || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"GraphQLEnumType\\\"](_objectSpread({}, config, {\\n values: _objectSpread({}, config.values, Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"])(valueNodes, function (value) {\\n return value.name.value;\\n }, function (value) {\\n return astBuilder.buildEnumValue(value);\\n })),\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendScalarType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"GraphQLScalarType\\\"](_objectSpread({}, config, {\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendObjectType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n var interfaceNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])(extensions, function (node) {\\n return node.interfaces || [];\\n });\\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])(extensions, function (node) {\\n return node.fields || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"GraphQLObjectType\\\"](_objectSpread({}, config, {\\n interfaces: function interfaces() {\\n return [].concat(type.getInterfaces().map(replaceNamedType), interfaceNodes.map(function (node) {\\n return astBuilder.getNamedType(node);\\n }));\\n },\\n fields: function fields() {\\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"])(config.fields, extendField), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"])(fieldNodes, function (node) {\\n return node.name.value;\\n }, function (node) {\\n return astBuilder.buildField(node);\\n }));\\n },\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendInterfaceType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])(extensions, function (node) {\\n return node.fields || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"GraphQLInterfaceType\\\"](_objectSpread({}, config, {\\n fields: function fields() {\\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"])(config.fields, extendField), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[\\\"default\\\"])(fieldNodes, function (node) {\\n return node.name.value;\\n }, function (node) {\\n return astBuilder.buildField(node);\\n }));\\n },\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendUnionType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n var typeNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[\\\"default\\\"])(extensions, function (node) {\\n return node.types || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[\\\"GraphQLUnionType\\\"](_objectSpread({}, config, {\\n types: function types() {\\n return [].concat(type.getTypes().map(replaceNamedType), typeNodes.map(function (node) {\\n return astBuilder.getNamedType(node);\\n }));\\n },\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendField(field) {\\n return _objectSpread({}, field, {\\n type: replaceType(field.type),\\n args: Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[\\\"default\\\"])(field.args, extendArg)\\n });\\n }\\n\\n function extendArg(arg) {\\n return _objectSpread({}, arg, {\\n type: replaceType(arg.type)\\n });\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74f12cc30c357fc37ca6f49ad891d272\",\n \"score\": \"0.4484635\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if (Object(__WEBPACK_IMPORTED_MODULE_0__type_definition__[\\\"n\\\" /* isAbstractType */])(typeA)) {\\n if (Object(__WEBPACK_IMPORTED_MODULE_0__type_definition__[\\\"n\\\" /* isAbstractType */])(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isPossibleType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isPossibleType(typeA, typeB);\\n }\\n\\n if (Object(__WEBPACK_IMPORTED_MODULE_0__type_definition__[\\\"n\\\" /* isAbstractType */])(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isPossibleType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3243f18cccea52ab99ec741aeebf525d\",\n \"score\": \"0.44803166\",\n \"text\": \"function merge(objA, objB) {\\n return Object.assign(objA, objB);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6743daf49facdbc4b5480ee711bd44f\",\n \"score\": \"0.44745222\",\n \"text\": \"function merge(object1, object2) {\\r\\n return Object.assign({}, object1, object2);\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aee1b4167376a5b8ffdf8f3958179094\",\n \"score\": \"0.44701302\",\n \"text\": \"function importDefinition() {\\n if (isGraphQL) {\\n updateGraphQLSchema();\\n } else if (isSOAP) {\\n updateWSDL();\\n } else {\\n updateOASDefinition();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b6faaf4face81c49d7eb56c598a63bc\",\n \"score\": \"0.4468192\",\n \"text\": \"reset() { Object.assign(this, this.getSchema()) }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dda7d5d3093082623ec81c0a3563a5e2\",\n \"score\": \"0.4468166\",\n \"text\": \"function mergeCompletionObjects(first, second) {\\n return _.mergeWith({}, first, second, function customizer(objValue, srcValue) {\\n if (_.isArray(objValue)) {\\n return objValue.concat(srcValue);\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7583f2fa79bcbab3735370bb2ab1bc1a\",\n \"score\": \"0.44674328\",\n \"text\": \"function merge(objA, objB) {\\n return Object.assign(objA, objB);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81a915e6b6324e57c7d6f5c674b40fff\",\n \"score\": \"0.44662043\",\n \"text\": \"function mergeInto(obj1, obj2) {\\n for (var attrname in obj2) {\\n obj1[attrname] = obj2[attrname];\\n }\\n\\n return obj1;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae7cf8f295363dab85feee5983ffa1df\",\n \"score\": \"0.44647837\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if ((0, _definition.isAbstractType)(typeA)) {\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isSubType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isSubType(typeA, typeB);\\n }\\n\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isSubType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae7cf8f295363dab85feee5983ffa1df\",\n \"score\": \"0.44647837\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if ((0, _definition.isAbstractType)(typeA)) {\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isSubType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isSubType(typeA, typeB);\\n }\\n\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isSubType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae7cf8f295363dab85feee5983ffa1df\",\n \"score\": \"0.44647837\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if ((0, _definition.isAbstractType)(typeA)) {\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isSubType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isSubType(typeA, typeB);\\n }\\n\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isSubType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f3eccb9981cbbe245a733d92cf3d8eb\",\n \"score\": \"0.4464484\",\n \"text\": \"function merge(target, source) {\\n var key;\\n for (key in source) {\\n if (source.hasOwnProperty(key)) {\\n target[key] = source[key];\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f9d5756dbbd8f72a2931f2dce92dcdb\",\n \"score\": \"0.4461791\",\n \"text\": \"function merge(a, b) {\\n return apply(copy(a), b);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57d0af93279ce4ec74a0aad6d5c573cb\",\n \"score\": \"0.4458747\",\n \"text\": \"function copySchemaFiles() {\\n const resolvedSrcSchemaPaths = path.resolve(rootDir, srcSchemaPaths);\\n\\n glob.sync(resolvedSrcSchemaPaths, void 0).forEach(function(filePath) {\\n let destSchemaPath = filePath.replace(/(\\\\bsrc\\\\b)(?!.*\\\\1)/, destDir);\\n destSchemaPath =\\n destSchemaPath.substr(0, destSchemaPath.lastIndexOf(\\\".ts\\\")) + \\\".json\\\";\\n fs.copyFileSync(filePath, destSchemaPath);\\n const fileContents = fs.readFileSync(destSchemaPath).toString();\\n const commonJS = \\\"module.exports = \\\".concat(\\n fileContents.substring(fileContents.indexOf(\\\"{\\\"))\\n );\\n const tempPath = path.resolve(\\n path.dirname(filePath),\\n `.tmp/${path.basename(filePath)}.js`\\n );\\n\\n try {\\n if (!fs.existsSync(path.dirname(tempPath))) {\\n fs.mkdirSync(path.dirname(tempPath));\\n }\\n fs.writeFileSync(tempPath, commonJS);\\n const schemaData = require(tempPath);\\n const json = JSON.stringify(schemaData, null, 2);\\n fs.writeFileSync(destSchemaPath, json);\\n } catch (e) {\\n console.error(e);\\n exit = 1;\\n } finally {\\n if (fs.existsSync(tempPath)) {\\n fs.unlinkSync(tempPath);\\n }\\n }\\n });\\n\\n process.exit(exit);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"547a5efcc910e0c3877c3880aa61286a\",\n \"score\": \"0.44567397\",\n \"text\": \"function mergeInto(obj1, obj2) {\\n var to_ret = $.extend( {}, obj1, obj2 );\\n return to_ret;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e20416381ff828fccbcf0c5670bc2bb8\",\n \"score\": \"0.44480723\",\n \"text\": \"function merge(obj1, obj2) {\\r\\n obj1 = obj1 || {};\\r\\n obj2 = obj2 || {};\\r\\n var obj3 = {};\\r\\n for (var attrname in obj2) obj3[attrname] = obj2[attrname];\\r\\n for (var attrname2 in obj1) obj3[attrname2] = obj1[attrname2];\\r\\n return obj3;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1834e77d4cdba0982bf5bbbbd2a5ed2\",\n \"score\": \"0.44327652\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if ((0, _definition.isAbstractType)(typeA)) {\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isPossibleType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isPossibleType(typeA, typeB);\\n }\\n\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isPossibleType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1834e77d4cdba0982bf5bbbbd2a5ed2\",\n \"score\": \"0.44327652\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if ((0, _definition.isAbstractType)(typeA)) {\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isPossibleType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isPossibleType(typeA, typeB);\\n }\\n\\n if ((0, _definition.isAbstractType)(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isPossibleType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86a0ee9e507be117550221a26419dffd\",\n \"score\": \"0.4430818\",\n \"text\": \"function extendSchema(schema, documentAST, options) {\\n Object(_type_schema__WEBPACK_IMPORTED_MODULE_8__[/* assertSchema */ \\\"b\\\"])(schema);\\n !(documentAST && documentAST.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[/* Kind */ \\\"a\\\"].DOCUMENT) ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[/* default */ \\\"a\\\"])(0, 'Must provide valid Document AST') : void 0;\\n\\n if (!options || !(options.assumeValid || options.assumeValidSDL)) {\\n Object(_validation_validate__WEBPACK_IMPORTED_MODULE_7__[/* assertValidSDLExtension */ \\\"b\\\"])(documentAST, schema);\\n } // Collect the type definitions and extensions found in the document.\\n\\n\\n var typeDefs = [];\\n var typeExtsMap = Object.create(null); // New directives and types are separate because a directives and types can\\n // have the same name. For example, a type named \\\"skip\\\".\\n\\n var directiveDefs = [];\\n var schemaDef; // Schema extensions are collected which may add additional operation types.\\n\\n var schemaExts = [];\\n var _iteratorNormalCompletion = true;\\n var _didIteratorError = false;\\n var _iteratorError = undefined;\\n\\n try {\\n for (var _iterator = documentAST.definitions[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) {\\n var def = _step.value;\\n\\n if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[/* Kind */ \\\"a\\\"].SCHEMA_DEFINITION) {\\n schemaDef = def;\\n } else if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[/* Kind */ \\\"a\\\"].SCHEMA_EXTENSION) {\\n schemaExts.push(def);\\n } else if (Object(_language_predicates__WEBPACK_IMPORTED_MODULE_14__[/* isTypeDefinitionNode */ \\\"d\\\"])(def)) {\\n typeDefs.push(def);\\n } else if (Object(_language_predicates__WEBPACK_IMPORTED_MODULE_14__[/* isTypeExtensionNode */ \\\"e\\\"])(def)) {\\n var extendedTypeName = def.name.value;\\n var existingTypeExts = typeExtsMap[extendedTypeName];\\n typeExtsMap[extendedTypeName] = existingTypeExts ? existingTypeExts.concat([def]) : [def];\\n } else if (def.kind === _language_kinds__WEBPACK_IMPORTED_MODULE_13__[/* Kind */ \\\"a\\\"].DIRECTIVE_DEFINITION) {\\n directiveDefs.push(def);\\n }\\n } // If this document contains no new types, extensions, or directives then\\n // return the same unmodified GraphQLSchema instance.\\n\\n } catch (err) {\\n _didIteratorError = true;\\n _iteratorError = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion && _iterator.return != null) {\\n _iterator.return();\\n }\\n } finally {\\n if (_didIteratorError) {\\n throw _iteratorError;\\n }\\n }\\n }\\n\\n if (Object.keys(typeExtsMap).length === 0 && typeDefs.length === 0 && directiveDefs.length === 0 && schemaExts.length === 0 && !schemaDef) {\\n return schema;\\n }\\n\\n var schemaConfig = schema.toConfig();\\n var astBuilder = new _buildASTSchema__WEBPACK_IMPORTED_MODULE_6__[/* ASTDefinitionBuilder */ \\\"a\\\"](options, function (typeName) {\\n var type = typeMap[typeName];\\n !type ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[/* default */ \\\"a\\\"])(0, \\\"Unknown type: \\\\\\\"\\\".concat(typeName, \\\"\\\\\\\".\\\")) : void 0;\\n return type;\\n });\\n var typeMap = Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \\\"a\\\"])(typeDefs, function (node) {\\n return node.name.value;\\n }, function (node) {\\n return astBuilder.buildType(node);\\n });\\n var _iteratorNormalCompletion2 = true;\\n var _didIteratorError2 = false;\\n var _iteratorError2 = undefined;\\n\\n try {\\n for (var _iterator2 = schemaConfig.types[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) {\\n var existingType = _step2.value;\\n typeMap[existingType.name] = extendNamedType(existingType);\\n } // Get the extended root operation types.\\n\\n } catch (err) {\\n _didIteratorError2 = true;\\n _iteratorError2 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion2 && _iterator2.return != null) {\\n _iterator2.return();\\n }\\n } finally {\\n if (_didIteratorError2) {\\n throw _iteratorError2;\\n }\\n }\\n }\\n\\n var operationTypes = {\\n query: schemaConfig.query && schemaConfig.query.name,\\n mutation: schemaConfig.mutation && schemaConfig.mutation.name,\\n subscription: schemaConfig.subscription && schemaConfig.subscription.name\\n };\\n\\n if (schemaDef) {\\n var _iteratorNormalCompletion3 = true;\\n var _didIteratorError3 = false;\\n var _iteratorError3 = undefined;\\n\\n try {\\n for (var _iterator3 = schemaDef.operationTypes[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) {\\n var _ref2 = _step3.value;\\n var operation = _ref2.operation;\\n var type = _ref2.type;\\n operationTypes[operation] = type.name.value;\\n }\\n } catch (err) {\\n _didIteratorError3 = true;\\n _iteratorError3 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion3 && _iterator3.return != null) {\\n _iterator3.return();\\n }\\n } finally {\\n if (_didIteratorError3) {\\n throw _iteratorError3;\\n }\\n }\\n }\\n } // Then, incorporate schema definition and all schema extensions.\\n\\n\\n for (var _i = 0, _schemaExts = schemaExts; _i < _schemaExts.length; _i++) {\\n var schemaExt = _schemaExts[_i];\\n\\n if (schemaExt.operationTypes) {\\n var _iteratorNormalCompletion4 = true;\\n var _didIteratorError4 = false;\\n var _iteratorError4 = undefined;\\n\\n try {\\n for (var _iterator4 = schemaExt.operationTypes[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) {\\n var _ref4 = _step4.value;\\n var _operation = _ref4.operation;\\n var _type = _ref4.type;\\n operationTypes[_operation] = _type.name.value;\\n }\\n } catch (err) {\\n _didIteratorError4 = true;\\n _iteratorError4 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion4 && _iterator4.return != null) {\\n _iterator4.return();\\n }\\n } finally {\\n if (_didIteratorError4) {\\n throw _iteratorError4;\\n }\\n }\\n }\\n }\\n } // Support both original legacy names and extended legacy names.\\n\\n\\n var allowedLegacyNames = schemaConfig.allowedLegacyNames.concat(options && options.allowedLegacyNames || []); // Then produce and return a Schema with these types.\\n\\n return new _type_schema__WEBPACK_IMPORTED_MODULE_8__[/* GraphQLSchema */ \\\"a\\\"]({\\n // Note: While this could make early assertions to get the correctly\\n // typed values, that would throw immediately while type system\\n // validation with validateSchema() will produce more actionable results.\\n query: getMaybeTypeByName(operationTypes.query),\\n mutation: getMaybeTypeByName(operationTypes.mutation),\\n subscription: getMaybeTypeByName(operationTypes.subscription),\\n types: Object(_polyfills_objectValues__WEBPACK_IMPORTED_MODULE_1__[/* default */ \\\"a\\\"])(typeMap),\\n directives: getMergedDirectives(),\\n astNode: schemaDef || schemaConfig.astNode,\\n extensionASTNodes: schemaConfig.extensionASTNodes.concat(schemaExts),\\n allowedLegacyNames: allowedLegacyNames\\n }); // Below are functions used for producing this schema that have closed over\\n // this scope and have access to the schema, cache, and newly defined types.\\n\\n function replaceType(type) {\\n if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isListType */ \\\"J\\\"])(type)) {\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLList */ \\\"d\\\"](replaceType(type.ofType));\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isNonNullType */ \\\"L\\\"])(type)) {\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLNonNull */ \\\"e\\\"](replaceType(type.ofType));\\n }\\n\\n return replaceNamedType(type);\\n }\\n\\n function replaceNamedType(type) {\\n return typeMap[type.name];\\n }\\n\\n function getMaybeTypeByName(typeName) {\\n return typeName ? typeMap[typeName] : null;\\n }\\n\\n function getMergedDirectives() {\\n var existingDirectives = schema.getDirectives().map(extendDirective);\\n !existingDirectives ? Object(_jsutils_invariant__WEBPACK_IMPORTED_MODULE_3__[/* default */ \\\"a\\\"])(0, 'schema must have default directives') : void 0;\\n return existingDirectives.concat(directiveDefs.map(function (node) {\\n return astBuilder.buildDirective(node);\\n }));\\n }\\n\\n function extendNamedType(type) {\\n if (Object(_type_introspection__WEBPACK_IMPORTED_MODULE_9__[/* isIntrospectionType */ \\\"n\\\"])(type) || Object(_type_scalars__WEBPACK_IMPORTED_MODULE_10__[/* isSpecifiedScalarType */ \\\"f\\\"])(type)) {\\n // Builtin types are not extended.\\n return type;\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isScalarType */ \\\"R\\\"])(type)) {\\n return extendScalarType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isObjectType */ \\\"N\\\"])(type)) {\\n return extendObjectType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isInterfaceType */ \\\"H\\\"])(type)) {\\n return extendInterfaceType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isUnionType */ \\\"T\\\"])(type)) {\\n return extendUnionType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isEnumType */ \\\"E\\\"])(type)) {\\n return extendEnumType(type);\\n } else if (Object(_type_definition__WEBPACK_IMPORTED_MODULE_11__[/* isInputObjectType */ \\\"F\\\"])(type)) {\\n return extendInputObjectType(type);\\n } // Not reachable. All possible types have been considered.\\n\\n /* istanbul ignore next */\\n\\n\\n throw new Error(\\\"Unexpected type: \\\\\\\"\\\".concat(Object(_jsutils_inspect__WEBPACK_IMPORTED_MODULE_2__[/* default */ \\\"a\\\"])(type), \\\"\\\\\\\".\\\"));\\n }\\n\\n function extendDirective(directive) {\\n var config = directive.toConfig();\\n return new _type_directives__WEBPACK_IMPORTED_MODULE_12__[/* GraphQLDirective */ \\\"c\\\"](_objectSpread({}, config, {\\n args: Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \\\"a\\\"])(config.args, extendArg)\\n }));\\n }\\n\\n function extendInputObjectType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \\\"a\\\"])(extensions, function (node) {\\n return node.fields || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLInputObjectType */ \\\"b\\\"](_objectSpread({}, config, {\\n fields: function fields() {\\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \\\"a\\\"])(config.fields, function (field) {\\n return _objectSpread({}, field, {\\n type: replaceType(field.type)\\n });\\n }), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \\\"a\\\"])(fieldNodes, function (field) {\\n return field.name.value;\\n }, function (field) {\\n return astBuilder.buildInputField(field);\\n }));\\n },\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendEnumType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[type.name] || [];\\n var valueNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \\\"a\\\"])(extensions, function (node) {\\n return node.values || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLEnumType */ \\\"a\\\"](_objectSpread({}, config, {\\n values: _objectSpread({}, config.values, Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \\\"a\\\"])(valueNodes, function (value) {\\n return value.name.value;\\n }, function (value) {\\n return astBuilder.buildEnumValue(value);\\n })),\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendScalarType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLScalarType */ \\\"g\\\"](_objectSpread({}, config, {\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendObjectType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n var interfaceNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \\\"a\\\"])(extensions, function (node) {\\n return node.interfaces || [];\\n });\\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \\\"a\\\"])(extensions, function (node) {\\n return node.fields || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLObjectType */ \\\"f\\\"](_objectSpread({}, config, {\\n interfaces: function interfaces() {\\n return [].concat(type.getInterfaces().map(replaceNamedType), interfaceNodes.map(function (node) {\\n return astBuilder.getNamedType(node);\\n }));\\n },\\n fields: function fields() {\\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \\\"a\\\"])(config.fields, extendField), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \\\"a\\\"])(fieldNodes, function (node) {\\n return node.name.value;\\n }, function (node) {\\n return astBuilder.buildField(node);\\n }));\\n },\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendInterfaceType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n var fieldNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \\\"a\\\"])(extensions, function (node) {\\n return node.fields || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLInterfaceType */ \\\"c\\\"](_objectSpread({}, config, {\\n fields: function fields() {\\n return _objectSpread({}, Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \\\"a\\\"])(config.fields, extendField), Object(_jsutils_keyValMap__WEBPACK_IMPORTED_MODULE_5__[/* default */ \\\"a\\\"])(fieldNodes, function (node) {\\n return node.name.value;\\n }, function (node) {\\n return astBuilder.buildField(node);\\n }));\\n },\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendUnionType(type) {\\n var config = type.toConfig();\\n var extensions = typeExtsMap[config.name] || [];\\n var typeNodes = Object(_polyfills_flatMap__WEBPACK_IMPORTED_MODULE_0__[/* default */ \\\"a\\\"])(extensions, function (node) {\\n return node.types || [];\\n });\\n return new _type_definition__WEBPACK_IMPORTED_MODULE_11__[/* GraphQLUnionType */ \\\"h\\\"](_objectSpread({}, config, {\\n types: function types() {\\n return [].concat(type.getTypes().map(replaceNamedType), typeNodes.map(function (node) {\\n return astBuilder.getNamedType(node);\\n }));\\n },\\n extensionASTNodes: config.extensionASTNodes.concat(extensions)\\n }));\\n }\\n\\n function extendField(field) {\\n return _objectSpread({}, field, {\\n type: replaceType(field.type),\\n args: Object(_jsutils_mapValue__WEBPACK_IMPORTED_MODULE_4__[/* default */ \\\"a\\\"])(field.args, extendArg)\\n });\\n }\\n\\n function extendArg(arg) {\\n return _objectSpread({}, arg, {\\n type: replaceType(arg.type)\\n });\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efee0b06863aaab2fd779d6ade5ebd31\",\n \"score\": \"0.44305128\",\n \"text\": \"function addTypes(schema, newTypesOrDirectives) {\\n const queryType = schema.getQueryType();\\n const mutationType = schema.getMutationType();\\n const subscriptionType = schema.getSubscriptionType();\\n const queryTypeName = queryType != null ? queryType.name : undefined;\\n const mutationTypeName = mutationType != null ? mutationType.name : undefined;\\n const subscriptionTypeName = subscriptionType != null ? subscriptionType.name : undefined;\\n const config = schema.toConfig();\\n const originalTypeMap = {};\\n config.types.forEach(type => {\\n originalTypeMap[type.name] = type;\\n });\\n const originalDirectiveMap = {};\\n config.directives.forEach(directive => {\\n originalDirectiveMap[directive.name] = directive;\\n });\\n newTypesOrDirectives.forEach(newTypeOrDirective => {\\n if (graphql.isNamedType(newTypeOrDirective)) {\\n originalTypeMap[newTypeOrDirective.name] = newTypeOrDirective;\\n }\\n else if (graphql.isDirective(newTypeOrDirective)) {\\n originalDirectiveMap[newTypeOrDirective.name] = newTypeOrDirective;\\n }\\n });\\n const { typeMap, directives } = rewireTypes(originalTypeMap, Object.keys(originalDirectiveMap).map(directiveName => originalDirectiveMap[directiveName]));\\n return new graphql.GraphQLSchema({\\n ...config,\\n query: queryTypeName ? typeMap[queryTypeName] : undefined,\\n mutation: mutationTypeName ? typeMap[mutationTypeName] : undefined,\\n subscription: subscriptionTypeName != null ? typeMap[subscriptionTypeName] : undefined,\\n types: Object.keys(typeMap).map(typeName => typeMap[typeName]),\\n directives,\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cb5ec442d553da4113bbf4f2da5beba\",\n \"score\": \"0.44285235\",\n \"text\": \"function doTypesOverlap(schema, typeA, typeB) {\\n // Equivalent types overlap\\n if (typeA === typeB) {\\n return true;\\n }\\n\\n if ((0, _definition$v.isAbstractType)(typeA)) {\\n if ((0, _definition$v.isAbstractType)(typeB)) {\\n // If both types are abstract, then determine if there is any intersection\\n // between possible concrete types of each.\\n return schema.getPossibleTypes(typeA).some(function (type) {\\n return schema.isSubType(typeB, type);\\n });\\n } // Determine if the latter type is a possible concrete type of the former.\\n\\n\\n return schema.isSubType(typeA, typeB);\\n }\\n\\n if ((0, _definition$v.isAbstractType)(typeB)) {\\n // Determine if the former type is a possible concrete type of the latter.\\n return schema.isSubType(typeB, typeA);\\n } // Otherwise the types do not overlap.\\n\\n\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c9d0bdb261e961034568b66013588c4\",\n \"score\": \"0.44262516\",\n \"text\": \"function findTypesAddedToUnions(oldSchema, newSchema) {\\n var oldTypeMap = oldSchema.getTypeMap();\\n var newTypeMap = newSchema.getTypeMap();\\n var typesAddedToUnion = [];\\n\\n for (var _i11 = 0, _Object$keys11 = Object.keys(newTypeMap); _i11 < _Object$keys11.length; _i11++) {\\n var typeName = _Object$keys11[_i11];\\n var oldType = oldTypeMap[typeName];\\n var newType = newTypeMap[typeName];\\n\\n if (!Object(_type_definition__WEBPACK_IMPORTED_MODULE_2__[/* isUnionType */ \\\"T\\\"])(oldType) || !Object(_type_definition__WEBPACK_IMPORTED_MODULE_2__[/* isUnionType */ \\\"T\\\"])(newType)) {\\n continue;\\n }\\n\\n var typeNamesInOldUnion = Object.create(null);\\n var _iteratorNormalCompletion5 = true;\\n var _didIteratorError5 = false;\\n var _iteratorError5 = undefined;\\n\\n try {\\n for (var _iterator5 = oldType.getTypes()[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) {\\n var type = _step5.value;\\n typeNamesInOldUnion[type.name] = true;\\n }\\n } catch (err) {\\n _didIteratorError5 = true;\\n _iteratorError5 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion5 && _iterator5.return != null) {\\n _iterator5.return();\\n }\\n } finally {\\n if (_didIteratorError5) {\\n throw _iteratorError5;\\n }\\n }\\n }\\n\\n var _iteratorNormalCompletion6 = true;\\n var _didIteratorError6 = false;\\n var _iteratorError6 = undefined;\\n\\n try {\\n for (var _iterator6 = newType.getTypes()[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) {\\n var _type2 = _step6.value;\\n\\n if (!typeNamesInOldUnion[_type2.name]) {\\n typesAddedToUnion.push({\\n type: DangerousChangeType.TYPE_ADDED_TO_UNION,\\n description: \\\"\\\".concat(_type2.name, \\\" was added to union type \\\").concat(typeName, \\\".\\\")\\n });\\n }\\n }\\n } catch (err) {\\n _didIteratorError6 = true;\\n _iteratorError6 = err;\\n } finally {\\n try {\\n if (!_iteratorNormalCompletion6 && _iterator6.return != null) {\\n _iterator6.return();\\n }\\n } finally {\\n if (_didIteratorError6) {\\n throw _iteratorError6;\\n }\\n }\\n }\\n }\\n\\n return typesAddedToUnion;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87480c17677c9c9d97fbcd8a39dd448c\",\n \"score\": \"0.4420803\",\n \"text\": \"mergeObjects(obj1, obj2){\\n let newObj = {}\\n\\n Object.keys(obj1).forEach(function(key){ newObj[key] = obj1[key]; });\\n Object.keys(obj2).forEach(function(key){ newObj[key] = obj2[key]; });\\n\\n return newObj;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff5d82592e70734d56cb4f9c14505e04\",\n \"score\": \"0.44176102\",\n \"text\": \"function addSchemaIfNeeded(schemaList, schemaObj) {\\n const name = schemaObj.schema.name;\\n if (schemaList.find((obj) => obj && (obj.name === name || (obj.schema && obj.schema.name === name))) === undefined) {\\n schemaList.push(schemaObj);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a93ca6e9f3a53e06297c2ec4f5293c14\",\n \"score\": \"0.44162917\",\n \"text\": \"function mergeObjects(first, second) {\\n if (first) {\\n if (second) {\\n // Both objects exist. Copy the first.\\n var result = {};\\n for (var property in first) {\\n result[property] = first[property];\\n }\\n // Override with the second.\\n for (var property2 in second) {\\n result[property2] = second[property2];\\n }\\n return result;\\n } else {\\n // First but no second object.\\n return first;\\n }\\n } else if (second) {\\n // Second but no first object.\\n return second;\\n }\\n // No first or second.\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4dad7922b80dc7473ac8ea8a5b1c6ba7\",\n \"score\": \"0.4414967\",\n \"text\": \"function merge(obj1, obj2) { \\n var returnObj = {};\\n var args = [].slice.call(arguments, 0);\\n var argLen = args.length;\\n\\n for(var i = 0; i < argLen; i++) {\\n for (var key in args[i]) {\\n returnObj[key] = args[i][key];\\n }\\n }\\n\\n return returnObj;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"016bda8d9b5222fa8f22415db0e6f375\",\n \"score\": \"0.44120467\",\n \"text\": \"addSchema(_schemas) {\\n this._validator.addSchema(_schemas); // AJV validates upon adding\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c561321d130ae4b5992431411b79721\",\n \"score\": \"0.44114268\",\n \"text\": \"function mergeObjects(to, from, Overwrite) {\\r\\n\\tfor(p in from) {\\r\\n\\t\\tif(overwrite) {\\r\\n\\t\\t\\tto[p] = from[p];\\r\\n\\t\\t}\\r\\n\\t\\telse if(to[p] === undefined) {\\r\\n\\t\\t\\tto[p] = from[p];\\r\\n\\t\\t}\\r\\n\\t}\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"551c4405e70780a06c2ed0cf13472227\",\n \"score\": \"0.43998182\",\n \"text\": \"function union(site1, site2) {\\n const site1Root = root(site1);\\n const site2Root = root(site2);\\n\\n groups[site1Root] = site2Root;\\n if (site1 === site2) {\\n return;\\n }\\n if (size[site1Root] < size[site2Root]) {\\n groups[site1Root] = site2Root;\\n size[site2Root] += size[site1Root];\\n } else {\\n groups[site2Root] = site1Root;\\n size[site1Root] += size[site2Root];\\n }\\n}\",\n \"title\": \"\"\n }\n]"}}},{"rowIdx":2368,"cells":{"query_id":{"kind":"string","value":"abf59623aeda1d70463e51bcfc2c56ac"},"query":{"kind":"string","value":"expected to be called by the connector"},"positive_passages":{"kind":"list like","value":[{"docid":"225612079072354eb9fa41f9365f7c97","score":"0.0","text":"async onDescriptionReceived(description) {\n try {\n const readyForOffer =\n !this.isMakingOffer &&\n (this.pc.signalingState == \"stable\" || this.isSettingRemoteAnswerPending);\n const offerCollision = description.type == \"offer\" && !readyForOffer;\n\n this.isOfferIgnored = !this.isPolite && offerCollision;\n if (this.isOfferIgnored) {\n return;\n }\n this.isSettingRemoteAnswerPending = description.type == \"answer\";\n await this.pc.setRemoteDescription(description);\n this.isSettingRemoteAnswerPending = false;\n if (description.type == \"offer\") {\n await this.pc.setLocalDescription();\n await this.connector.sendDescription(this.endpoint, this.pc.localDescription);\n }\n } catch (err) {\n console.error(err);\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"225612079072354eb9fa41f9365f7c97\",\n \"score\": \"0.0\",\n \"text\": \"async onDescriptionReceived(description) {\\n try {\\n const readyForOffer =\\n !this.isMakingOffer &&\\n (this.pc.signalingState == \\\"stable\\\" || this.isSettingRemoteAnswerPending);\\n const offerCollision = description.type == \\\"offer\\\" && !readyForOffer;\\n\\n this.isOfferIgnored = !this.isPolite && offerCollision;\\n if (this.isOfferIgnored) {\\n return;\\n }\\n this.isSettingRemoteAnswerPending = description.type == \\\"answer\\\";\\n await this.pc.setRemoteDescription(description);\\n this.isSettingRemoteAnswerPending = false;\\n if (description.type == \\\"offer\\\") {\\n await this.pc.setLocalDescription();\\n await this.connector.sendDescription(this.endpoint, this.pc.localDescription);\\n }\\n } catch (err) {\\n console.error(err);\\n }\\n }\",\n \"title\": \"\"\n }\n]"},"negative_passages":{"kind":"list like","value":[{"docid":"771f0f90e572827e5434ec2b4328c36a","score":"0.6248186","text":"setConnector() {\n throw Error(\"function must be overwritten in subclass\");\n }","title":""},{"docid":"d73525bb8568eae7c975ee063e277ea8","score":"0.5937637","text":"connect() {\n\t\t/* istanbul ignore next */\n\t\tthrow new Error(\"This method is not implemented.\");\n\t}","title":""},{"docid":"37c3ce320e8baa0ddb2596d2e80c8171","score":"0.58591694","text":"connector(connection) {\n this.connection = connection;\n }","title":""},{"docid":"dc758d209f8d6fa40ec391814ac85066","score":"0.5845564","text":"connect() {\n\n\t}","title":""},{"docid":"8edbcf284eeefe2e52874c5943b3f48e","score":"0.5619631","text":"function onConnect() {\n \n }","title":""},{"docid":"17147c2e0b5d9c536627c19e177ede01","score":"0.5607817","text":"connectedCallback() {\r\n super.connectedCallback();\r\n }","title":""},{"docid":"ba5934421e3bc3923ca6d12123da5030","score":"0.5606898","text":"connectedCallback() {\n super.connectedCallback();\n }","title":""},{"docid":"ba5934421e3bc3923ca6d12123da5030","score":"0.5606898","text":"connectedCallback() {\n super.connectedCallback();\n }","title":""},{"docid":"ba5934421e3bc3923ca6d12123da5030","score":"0.5606898","text":"connectedCallback() {\n super.connectedCallback();\n }","title":""},{"docid":"ba5934421e3bc3923ca6d12123da5030","score":"0.5606898","text":"connectedCallback() {\n super.connectedCallback();\n }","title":""},{"docid":"ba5934421e3bc3923ca6d12123da5030","score":"0.5606898","text":"connectedCallback() {\n super.connectedCallback();\n }","title":""},{"docid":"ba5934421e3bc3923ca6d12123da5030","score":"0.5606898","text":"connectedCallback() {\n super.connectedCallback();\n }","title":""},{"docid":"24648fb6df28b728f82eb30541f16a2f","score":"0.55857587","text":"async connect(params) {\n // Should not happen.\n throw new Error('method not implemented in the subclass');\n }","title":""},{"docid":"0453b16d4cacfdb0531a0886c9c14ab0","score":"0.5570048","text":"connectedCallback() {\n \n }","title":""},{"docid":"ebf7c6e9e3bee117d775953d0b503969","score":"0.55603623","text":"onConnection() {}","title":""},{"docid":"cc306500b3c803be5185bc4c2d9c0657","score":"0.5541935","text":"connect() {\n }","title":""},{"docid":"93a501ad8a0768dfbe9842e2409b0b8b","score":"0.5518807","text":"connectedCallback() { }","title":""},{"docid":"a8e12d15f4a477709ae6b03330783772","score":"0.54730064","text":"onConnectionReset() {}","title":""},{"docid":"b6a4e992edd52b0b6f44c1aea2d7004a","score":"0.5451283","text":"$beforeConnect() {}","title":""},{"docid":"b33b68d1c4eee96b153b634d990f1650","score":"0.5446829","text":"function initConnector() {\n connector = new ConnectorTest({server: server});\n }","title":""},{"docid":"1af8f26d0989b9b97e4ed94e8daf5ca2","score":"0.5425732","text":"beforeHandling() {\n\t\t//\n\t}","title":""},{"docid":"eaa1c11c4c5edc865ccb40ce7ce687a6","score":"0.5386821","text":"onConnectionHeard() {}","title":""},{"docid":"663b39c5ca929f9b713a528c2fd25824","score":"0.5375817","text":"constructor() {\n\t\tthis.connect()\n\t}","title":""},{"docid":"743fa85e324011051f83af2eea12183d","score":"0.53709406","text":"afterLoadedFromDB()\n {\n }","title":""},{"docid":"a2460a1b099be138853f4d74082ffc98","score":"0.53615266","text":"connectedCallback(){}","title":""},{"docid":"32190acb1de6e827c4a3511b31fc84a2","score":"0.53545827","text":"async connect() {\n return;\n }","title":""},{"docid":"9b1581164b59aa988b40f0afb7046abb","score":"0.5331767","text":"afterHandling() {\n\t\t//\n\t}","title":""},{"docid":"ba235448fb18a5c049a3eaf31c6d3ea1","score":"0.53221786","text":"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\nthis._FBPTriggerWire(\"--qpIn\",{query:{tsk:1}})}","title":""},{"docid":"5bd88faeeed2a02a5ce55664edc4a034","score":"0.53151906","text":"testDataSource() {\n throw new ZabbixNotImplemented('testDataSource()');\n }","title":""},{"docid":"0a1b7e8bf54504a207ef5e666b59ebad","score":"0.53031343","text":"connected() { }","title":""},{"docid":"0a1b7e8bf54504a207ef5e666b59ebad","score":"0.53031343","text":"connected() { }","title":""},{"docid":"707f0a26b891b07b127e2c468c0abef6","score":"0.52962625","text":"before (callback) {\n\t\t// run standard setup for creating a direct stream...\n\t\tsuper.before(error => {\n\t\t\tif (error) { return callback(error); }\n\t\t\t// ...and add a name, this should be ignored\n\t\t\tthis.data.name = this.streamFactory.randomName();\n\t\t\tcallback();\n\t\t});\n\t}","title":""},{"docid":"0efcd59889cf95a4342280c09769d936","score":"0.529306","text":"onConnect() {\n debug(\"::onConnect\");\n }","title":""},{"docid":"73c0955b8cfbd9eaf7349274f954ef5a","score":"0.52826774","text":"async connect() {\n // to be overloaded by subclasses\n }","title":""},{"docid":"6ba4da25419e1a53ce857d3cdee61f4d","score":"0.52809846","text":"connectedCallback() {\n super.connectedCallback();\n this.getData();\n }","title":""},{"docid":"8c94bb6141e7cc71a3a440b0c8ded518","score":"0.52691424","text":"firstUpdated() {\n this.connection = new ChannelStreamConnection();\n this.connection.connectUrl = this.appConfig.connectUrl;\n this.connection.disconnectUrl = this.appConfig.disconnectUrl;\n this.connection.subscribeUrl = this.appConfig.subscribeUrl;\n this.connection.unsubscribeUrl = this.appConfig.unsubscribeUrl;\n this.connection.messageUrl = this.appConfig.messageUrl;\n this.connection.messageEditUrl = this.appConfig.messageEditUrl;\n this.connection.messageDeleteUrl = this.appConfig.messageDeleteUrl;\n this.connection.longPollUrl = this.appConfig.longPollUrl;\n this.connection.websocketUrl = this.appConfig.websocketUrl;\n this.connection.userStateUrl = this.appConfig.userStateUrl;\n this.connection.username = this.user.username;\n this.connection.channels = this.user.subscribedChannels;\n this.connection.listenMessageCallback = (data) => this.receivedMessage(data);\n this.connection.connectCallback = (request, data) => this.handleConnected(data);\n this.connection.subscribeCallback = (request, data) => this.handleSubscribed(data);\n this.connection.unsubscribeCallback = (request, data) => this.handleUnsubscribed(data);\n this.connection.channelsChangedCallback = () => this.handleChannelsChange();\n\n // enable for tests\n // this.connection.noWebsocket = true;\n // add a mutator for demo purposes - modify the request\n // to inject some state vars to connection json\n this.connection.addMutator('connect', function (request) {\n request.body.state = {email: this.user.email, status: 'ready'};\n }.bind(this));\n this.connection.connect();\n this.addEventListener('channelpicker-subscribe', this.subscribeToChannel);\n this.addEventListener('change-status', this.changeStatus);\n this.addEventListener('message-send', this.messageSend);\n this.addEventListener('message-edit', this.messageEdit);\n this.addEventListener('message-delete', this.messageDelete);\n }","title":""},{"docid":"357f5d13af5a6c382a9f6e0a03f4599f","score":"0.52612513","text":"connectedCallback() {\n // Useful for running setup code, such as fetching resources or \n // rendering. Generally, you should try to delay work until this time.\n }","title":""},{"docid":"5a9568d8dddd65ed6e045b8b5e87ce01","score":"0.5230817","text":"async configure() {\n this._throwNotImplementedError('configure');\n }","title":""},{"docid":"34756a39f585fb7f0636bc1a8eabf528","score":"0.5225731","text":"constructor() {\n this._setup(); // DO NOT REMOVE\n }","title":""},{"docid":"8ce8db29abc8dbb144d2a71652409e05","score":"0.52224153","text":"handleResponse() {\n // implement this function in the extended objects\n }","title":""},{"docid":"0b9b64afbc55efee8163443235f43d22","score":"0.52196896","text":"whenReady() {\n //\n }","title":""},{"docid":"5dddfa88009f673c5756e7010696c11f","score":"0.5219398","text":"_initConnRead() {\n this.ctx.transaction = this.app.mysql.get('db_read');\n this.ctx.transaction.mode = 'single';\n }","title":""},{"docid":"d94729eff719166a1a52e823ae781658","score":"0.5202296","text":"reset () { throw new Error('Not Yet Implemented') }","title":""},{"docid":"3c3828217f5578cb1a288fadbde92529","score":"0.5190779","text":"get connector() {\n return this._connector;\n }","title":""},{"docid":"88082f519853d9476a22a7c37bd0cffc","score":"0.51830435","text":"async connect() { }","title":""},{"docid":"13d962699c156a2866a75384833bf18e","score":"0.51758593","text":"function Mechanism() {\n }","title":""},{"docid":"4aa0b97e43092636a5fe38cff5704aad","score":"0.51715106","text":"initialize() {\n return;\n }","title":""},{"docid":"89353dc6a739aee8f461e39005afc5e6","score":"0.5161505","text":"function DummyTransport() {}","title":""},{"docid":"82e677ddbc18485996c29876c21bea16","score":"0.5158608","text":"start() {\n return Promise.reject(\"When inherting StreamDSL, the start method should be overwritten with connector logic.\");\n }","title":""},{"docid":"1767d607a67408cf6687f4f92c012259","score":"0.5151232","text":"$beforeDisconnect() {}","title":""},{"docid":"3afc0ef1affba14a9b55017119e28502","score":"0.5144861","text":"createClientHandle(){\n throw new Error('Unimplemented');\n }","title":""},{"docid":"ec3f60e209992300663276923963fb07","score":"0.51439166","text":"_getWriteStream() {\n throw new Error(`${this.name} storage adapter does not properly override the _getWriteStream method`);\n }","title":""},{"docid":"43a4f6ed4de9d74375f28d1d3353c6d4","score":"0.5138341","text":"before (callback) {\n\t\t// run standard set up for the test but delete the streamId and provide matching file instead\n\t\tsuper.before(() => {\n\t\t\tdelete this.data.streamId;\n\t\t\tthis.data.file = this.repoStreams[0].file;\n\t\t\tcallback();\n\t\t});\n\t}","title":""},{"docid":"8da87611931ef47e2d43898c0be022da","score":"0.51366776","text":"function test_automate_engine_database_connection() {}","title":""},{"docid":"3262c3ccd1471648b6cf4eaceb6799a7","score":"0.51355964","text":"async connect() {\n // not needed\n }","title":""},{"docid":"49a2c96477db7a07d96e10c0133c03cd","score":"0.51351416","text":"disconnectedCallback(){super.disconnectedCallback()}","title":""},{"docid":"9b94fca58ffaf60ce9eadc52c775b51e","score":"0.5125835","text":"configure () {\n\n }","title":""},{"docid":"a09920049285e2ac2a0ad450f3c9341d","score":"0.5120958","text":"update() { /* stub */\n }","title":""},{"docid":"33a18e3ebb3f4aeb36fcc9ebe985a33f","score":"0.5116024","text":"before (callback) {\n\t\t// run the standard test setup for creating a file-type stream...\n\t\tsuper.before(error => {\n\t\t\tif (error) { return callback(error); }\n\t\t\t// ...and give our test stream the same file-related attributes, this should cause the server\n\t\t\t// to find the existing file-type stream, and return that in the response\n\t\t\tthis.data.repoId = this.duplicateStream.repoId;\n\t\t\tthis.data.file = this.duplicateStream.file;\n\t\t\tcallback();\n\t\t});\n\t}","title":""},{"docid":"eea2afd031bc5d8cb6fbcaa76f28de9a","score":"0.5115062","text":"init() {\n\t\tthis.replaceData(\n\t\t\tthis.manager.get(\"noReq\"),\n\t\t\tthis.endpoints.get,\n\t\t\tthis.data.get\n\t\t);\n\t}","title":""},{"docid":"8e1ea72dada847c9fa0de55a6dbe115f","score":"0.51136565","text":"prepare() {\n\n }","title":""},{"docid":"15b1c4adb6bd306774a6b80fdeaedfa8","score":"0.5111388","text":"ready() {\n super.ready();\n }","title":""},{"docid":"15b1c4adb6bd306774a6b80fdeaedfa8","score":"0.5111388","text":"ready() {\n super.ready();\n }","title":""},{"docid":"15b1c4adb6bd306774a6b80fdeaedfa8","score":"0.5111388","text":"ready() {\n super.ready();\n }","title":""},{"docid":"15b1c4adb6bd306774a6b80fdeaedfa8","score":"0.5111388","text":"ready() {\n super.ready();\n }","title":""},{"docid":"15b1c4adb6bd306774a6b80fdeaedfa8","score":"0.5111388","text":"ready() {\n super.ready();\n }","title":""},{"docid":"b3aefb46d4c67240018731ed3431a5d9","score":"0.5110436","text":"function _addFbConnectorSucceed(connector) {\n RightMenu.rightMenuLoading(false);\n DataSources.addConnector(ConnectorsTemplate.ConnectorType.Facebook, connector);\n ////RightMenu.showHideRightMenu(false);\n ////DataSourcesHelper.addConnector(ConnectorsTemplate.ConnectorType.Facebook, connector);\n ////DataSources.showConnector(connector);\n }","title":""},{"docid":"0b099bdf9f21e4bfd3c3ebffebd75e2d","score":"0.51065433","text":"connectedCallback() {\n super.connectedCallback();\n\n console.info('connected.');\n }","title":""},{"docid":"8f9335e87ed046b673803cab4f7107cd","score":"0.5106332","text":"function afterConnection(){\n\t\tcreateArray();\n\t\n}","title":""},{"docid":"322dccb2493031ed428b92d534968455","score":"0.5098004","text":"disconnect() {\n\n\t}","title":""},{"docid":"4c2fcf498a752101ed2ba73c690b4e0b","score":"0.5087029","text":"connectedCallback() {\n super.connectedCallback();\n this.id = this._generateUUID();\n }","title":""},{"docid":"a7915e24d529c9aa1775ec544317f1dc","score":"0.5086494","text":"OnCreateParamsProcessed() { }","title":""},{"docid":"54b67f3d2c641de3bd5d3c5b0b4b0438","score":"0.5081315","text":"onConnectionError() {\n\n }","title":""},{"docid":"4458799ff0103eea0c528dac17b1a7aa","score":"0.5077261","text":"initialize() {\r\n return null;\r\n }","title":""},{"docid":"8be3c3a5aa1dc86b9430adde50f13556","score":"0.50771374","text":"async link()\n {\n AbstractMethodCall();\n }","title":""},{"docid":"368167e370df6b0836bc47c4a1cf7a9c","score":"0.50563955","text":"beforeApply() {}","title":""},{"docid":"3590412cc80b880e0791640e3916fede","score":"0.505599","text":"connectedCallback(){this.__ready=!0;this.HAXWiring=new HAXWiring;this.HAXWiring.setup(UserAction.haxProperties,UserAction.tag,this)}","title":""},{"docid":"3c5b7f7ea4a355a3b318db8a030022d7","score":"0.5052071","text":"init() {\n\t\t// Could be implemented\n\t}","title":""},{"docid":"c9425cd052b9e65ad1ad1843d1dc05e9","score":"0.5049078","text":"init () {\n this.replaceData(this.manager.get(\"hostReq\"), this.endpoints.get, this.data.get);\n }","title":""},{"docid":"fab50dc441e723f92eec4ecc0e7b236d","score":"0.50344175","text":"connectedCallback() {\n this.idField = this.fromObject + '.Id';\n }","title":""},{"docid":"1f52d789b29b805ef2addcc74dce026c","score":"0.5032736","text":"preStepLogic() {\n // console.log('try sync')\n if (this.syncClient != null) {\n if (this.app.state.clock) {\n if (this.app.state.xebraReady) {\n console.log('sync')\n this.app.xebraState.sendMessageToChannel(this.app.state.channel, [\n this.app.state.clockMessage,\n this.getAdjustedSyncTime()\n ])\n }\n }\n }\n /* For some reason, Serializer gives an error only in production. \n Ensuring that inboundMessages is empty prevents it and I don't need this right now. \n If I add actual game objects will need to figure this out. */\n this.inboundMessages = []\n }","title":""},{"docid":"1753f22beaa341453765e0dbf579c493","score":"0.5030207","text":"prepare() {\n }","title":""},{"docid":"a5c485379ee917157bf91dbeb32b198c","score":"0.50293326","text":"onready() {}","title":""},{"docid":"f38f601b36177f810621ca53545ef6af","score":"0.5028287","text":"_FBPReady(){super._FBPReady();// this._FBPTraceWires()\n}","title":""},{"docid":"01962a6c3073bfe8c6363282f7406189","score":"0.5026936","text":"ready() {\n super.ready();\n }","title":""},{"docid":"01962a6c3073bfe8c6363282f7406189","score":"0.5026936","text":"ready() {\n super.ready();\n }","title":""},{"docid":"01962a6c3073bfe8c6363282f7406189","score":"0.5026936","text":"ready() {\n super.ready();\n }","title":""},{"docid":"3c283d98b8eca72fc32eb5ab802664a2","score":"0.50242996","text":"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\n}","title":""},{"docid":"3c283d98b8eca72fc32eb5ab802664a2","score":"0.50242996","text":"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\n}","title":""},{"docid":"3c283d98b8eca72fc32eb5ab802664a2","score":"0.50242996","text":"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\n}","title":""},{"docid":"3c283d98b8eca72fc32eb5ab802664a2","score":"0.50242996","text":"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\n}","title":""},{"docid":"3c283d98b8eca72fc32eb5ab802664a2","score":"0.50242996","text":"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\n}","title":""},{"docid":"3c283d98b8eca72fc32eb5ab802664a2","score":"0.50242996","text":"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\n}","title":""},{"docid":"3c283d98b8eca72fc32eb5ab802664a2","score":"0.50242996","text":"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\n}","title":""},{"docid":"3d357c02a7e880281c849fc335469d39","score":"0.5023872","text":"async onReady() {\n // Initialize your adapter here\n\n // try changing a data state object:\n for (const attr in DATAFIELDS) {\n\n for (const ch in DATAFIELDS[attr].channels) {\n\n // check object for existence and update if needed\n const obj_id = DATAFIELDS[attr].channels[ch].channel + '.' + DATAFIELDS[attr].id;\n const that = this;\n this.verify_datapoint(obj_id, that, DATAFIELDS[attr], DATAFIELDS[attr].channels[ch].name);\n }\n }\n\n // The adapters config (in the instance object everything under the attribute \"native\") is accessible via\n // this.config:\n\n if (this.config.scheduler_active == true) {\n this.log.info('Starting Scheduler');\n this.scheduler = new Scheduler(this.config, this);\n this.scheduler.start();\n }\n\n if (this.config.listener_active == true) {\n this.listener = new Listener(this.config.bind, this.config.port, this.config.path, this.config.listener_protocol, this.config.listener_forward_url, this);\n this.listener.start();\n }\n }","title":""},{"docid":"57ef53366d24a258cd43fddc46b3c4f0","score":"0.50183624","text":"_initConnWrite() {\n this.ctx.transaction = this.app.mysql.get('db_write');\n this.ctx.transaction.mode = 'single';\n }","title":""},{"docid":"0a93691751fd5e4b5153c9eaabf49911","score":"0.50166893","text":"bodyDataBeforeApiFirstResponds() {\n \tthrow new Error('Implementing bodyDataBeforeApiFirstResponds method is mandatory for sub class of ApiComponent');\n }","title":""},{"docid":"d30d47bbe18c18ae3504bfd29f35e15d","score":"0.50165045","text":"_FBPReady(){super._FBPReady();this._FBPTraceWires()}","title":""},{"docid":"d30d47bbe18c18ae3504bfd29f35e15d","score":"0.50165045","text":"_FBPReady(){super._FBPReady();this._FBPTraceWires()}","title":""},{"docid":"d30d47bbe18c18ae3504bfd29f35e15d","score":"0.50165045","text":"_FBPReady(){super._FBPReady();this._FBPTraceWires()}","title":""},{"docid":"d30d47bbe18c18ae3504bfd29f35e15d","score":"0.50165045","text":"_FBPReady(){super._FBPReady();this._FBPTraceWires()}","title":""}],"string":"[\n {\n \"docid\": \"771f0f90e572827e5434ec2b4328c36a\",\n \"score\": \"0.6248186\",\n \"text\": \"setConnector() {\\n throw Error(\\\"function must be overwritten in subclass\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d73525bb8568eae7c975ee063e277ea8\",\n \"score\": \"0.5937637\",\n \"text\": \"connect() {\\n\\t\\t/* istanbul ignore next */\\n\\t\\tthrow new Error(\\\"This method is not implemented.\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37c3ce320e8baa0ddb2596d2e80c8171\",\n \"score\": \"0.58591694\",\n \"text\": \"connector(connection) {\\n this.connection = connection;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc758d209f8d6fa40ec391814ac85066\",\n \"score\": \"0.5845564\",\n \"text\": \"connect() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8edbcf284eeefe2e52874c5943b3f48e\",\n \"score\": \"0.5619631\",\n \"text\": \"function onConnect() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17147c2e0b5d9c536627c19e177ede01\",\n \"score\": \"0.5607817\",\n \"text\": \"connectedCallback() {\\r\\n super.connectedCallback();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba5934421e3bc3923ca6d12123da5030\",\n \"score\": \"0.5606898\",\n \"text\": \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba5934421e3bc3923ca6d12123da5030\",\n \"score\": \"0.5606898\",\n \"text\": \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba5934421e3bc3923ca6d12123da5030\",\n \"score\": \"0.5606898\",\n \"text\": \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba5934421e3bc3923ca6d12123da5030\",\n \"score\": \"0.5606898\",\n \"text\": \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba5934421e3bc3923ca6d12123da5030\",\n \"score\": \"0.5606898\",\n \"text\": \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba5934421e3bc3923ca6d12123da5030\",\n \"score\": \"0.5606898\",\n \"text\": \"connectedCallback() {\\n super.connectedCallback();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24648fb6df28b728f82eb30541f16a2f\",\n \"score\": \"0.55857587\",\n \"text\": \"async connect(params) {\\n // Should not happen.\\n throw new Error('method not implemented in the subclass');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0453b16d4cacfdb0531a0886c9c14ab0\",\n \"score\": \"0.5570048\",\n \"text\": \"connectedCallback() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebf7c6e9e3bee117d775953d0b503969\",\n \"score\": \"0.55603623\",\n \"text\": \"onConnection() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc306500b3c803be5185bc4c2d9c0657\",\n \"score\": \"0.5541935\",\n \"text\": \"connect() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93a501ad8a0768dfbe9842e2409b0b8b\",\n \"score\": \"0.5518807\",\n \"text\": \"connectedCallback() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8e12d15f4a477709ae6b03330783772\",\n \"score\": \"0.54730064\",\n \"text\": \"onConnectionReset() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6a4e992edd52b0b6f44c1aea2d7004a\",\n \"score\": \"0.5451283\",\n \"text\": \"$beforeConnect() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b33b68d1c4eee96b153b634d990f1650\",\n \"score\": \"0.5446829\",\n \"text\": \"function initConnector() {\\n connector = new ConnectorTest({server: server});\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1af8f26d0989b9b97e4ed94e8daf5ca2\",\n \"score\": \"0.5425732\",\n \"text\": \"beforeHandling() {\\n\\t\\t//\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaa1c11c4c5edc865ccb40ce7ce687a6\",\n \"score\": \"0.5386821\",\n \"text\": \"onConnectionHeard() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"663b39c5ca929f9b713a528c2fd25824\",\n \"score\": \"0.5375817\",\n \"text\": \"constructor() {\\n\\t\\tthis.connect()\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"743fa85e324011051f83af2eea12183d\",\n \"score\": \"0.53709406\",\n \"text\": \"afterLoadedFromDB()\\n {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2460a1b099be138853f4d74082ffc98\",\n \"score\": \"0.53615266\",\n \"text\": \"connectedCallback(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32190acb1de6e827c4a3511b31fc84a2\",\n \"score\": \"0.53545827\",\n \"text\": \"async connect() {\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b1581164b59aa988b40f0afb7046abb\",\n \"score\": \"0.5331767\",\n \"text\": \"afterHandling() {\\n\\t\\t//\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba235448fb18a5c049a3eaf31c6d3ea1\",\n \"score\": \"0.53221786\",\n \"text\": \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\nthis._FBPTriggerWire(\\\"--qpIn\\\",{query:{tsk:1}})}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bd88faeeed2a02a5ce55664edc4a034\",\n \"score\": \"0.53151906\",\n \"text\": \"testDataSource() {\\n throw new ZabbixNotImplemented('testDataSource()');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a1b7e8bf54504a207ef5e666b59ebad\",\n \"score\": \"0.53031343\",\n \"text\": \"connected() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a1b7e8bf54504a207ef5e666b59ebad\",\n \"score\": \"0.53031343\",\n \"text\": \"connected() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"707f0a26b891b07b127e2c468c0abef6\",\n \"score\": \"0.52962625\",\n \"text\": \"before (callback) {\\n\\t\\t// run standard setup for creating a direct stream...\\n\\t\\tsuper.before(error => {\\n\\t\\t\\tif (error) { return callback(error); }\\n\\t\\t\\t// ...and add a name, this should be ignored\\n\\t\\t\\tthis.data.name = this.streamFactory.randomName();\\n\\t\\t\\tcallback();\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0efcd59889cf95a4342280c09769d936\",\n \"score\": \"0.529306\",\n \"text\": \"onConnect() {\\n debug(\\\"::onConnect\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73c0955b8cfbd9eaf7349274f954ef5a\",\n \"score\": \"0.52826774\",\n \"text\": \"async connect() {\\n // to be overloaded by subclasses\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ba4da25419e1a53ce857d3cdee61f4d\",\n \"score\": \"0.52809846\",\n \"text\": \"connectedCallback() {\\n super.connectedCallback();\\n this.getData();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c94bb6141e7cc71a3a440b0c8ded518\",\n \"score\": \"0.52691424\",\n \"text\": \"firstUpdated() {\\n this.connection = new ChannelStreamConnection();\\n this.connection.connectUrl = this.appConfig.connectUrl;\\n this.connection.disconnectUrl = this.appConfig.disconnectUrl;\\n this.connection.subscribeUrl = this.appConfig.subscribeUrl;\\n this.connection.unsubscribeUrl = this.appConfig.unsubscribeUrl;\\n this.connection.messageUrl = this.appConfig.messageUrl;\\n this.connection.messageEditUrl = this.appConfig.messageEditUrl;\\n this.connection.messageDeleteUrl = this.appConfig.messageDeleteUrl;\\n this.connection.longPollUrl = this.appConfig.longPollUrl;\\n this.connection.websocketUrl = this.appConfig.websocketUrl;\\n this.connection.userStateUrl = this.appConfig.userStateUrl;\\n this.connection.username = this.user.username;\\n this.connection.channels = this.user.subscribedChannels;\\n this.connection.listenMessageCallback = (data) => this.receivedMessage(data);\\n this.connection.connectCallback = (request, data) => this.handleConnected(data);\\n this.connection.subscribeCallback = (request, data) => this.handleSubscribed(data);\\n this.connection.unsubscribeCallback = (request, data) => this.handleUnsubscribed(data);\\n this.connection.channelsChangedCallback = () => this.handleChannelsChange();\\n\\n // enable for tests\\n // this.connection.noWebsocket = true;\\n // add a mutator for demo purposes - modify the request\\n // to inject some state vars to connection json\\n this.connection.addMutator('connect', function (request) {\\n request.body.state = {email: this.user.email, status: 'ready'};\\n }.bind(this));\\n this.connection.connect();\\n this.addEventListener('channelpicker-subscribe', this.subscribeToChannel);\\n this.addEventListener('change-status', this.changeStatus);\\n this.addEventListener('message-send', this.messageSend);\\n this.addEventListener('message-edit', this.messageEdit);\\n this.addEventListener('message-delete', this.messageDelete);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"357f5d13af5a6c382a9f6e0a03f4599f\",\n \"score\": \"0.52612513\",\n \"text\": \"connectedCallback() {\\n // Useful for running setup code, such as fetching resources or \\n // rendering. Generally, you should try to delay work until this time.\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a9568d8dddd65ed6e045b8b5e87ce01\",\n \"score\": \"0.5230817\",\n \"text\": \"async configure() {\\n this._throwNotImplementedError('configure');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34756a39f585fb7f0636bc1a8eabf528\",\n \"score\": \"0.5225731\",\n \"text\": \"constructor() {\\n this._setup(); // DO NOT REMOVE\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ce8db29abc8dbb144d2a71652409e05\",\n \"score\": \"0.52224153\",\n \"text\": \"handleResponse() {\\n // implement this function in the extended objects\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b9b64afbc55efee8163443235f43d22\",\n \"score\": \"0.52196896\",\n \"text\": \"whenReady() {\\n //\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dddfa88009f673c5756e7010696c11f\",\n \"score\": \"0.5219398\",\n \"text\": \"_initConnRead() {\\n this.ctx.transaction = this.app.mysql.get('db_read');\\n this.ctx.transaction.mode = 'single';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d94729eff719166a1a52e823ae781658\",\n \"score\": \"0.5202296\",\n \"text\": \"reset () { throw new Error('Not Yet Implemented') }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c3828217f5578cb1a288fadbde92529\",\n \"score\": \"0.5190779\",\n \"text\": \"get connector() {\\n return this._connector;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88082f519853d9476a22a7c37bd0cffc\",\n \"score\": \"0.51830435\",\n \"text\": \"async connect() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13d962699c156a2866a75384833bf18e\",\n \"score\": \"0.51758593\",\n \"text\": \"function Mechanism() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4aa0b97e43092636a5fe38cff5704aad\",\n \"score\": \"0.51715106\",\n \"text\": \"initialize() {\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89353dc6a739aee8f461e39005afc5e6\",\n \"score\": \"0.5161505\",\n \"text\": \"function DummyTransport() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82e677ddbc18485996c29876c21bea16\",\n \"score\": \"0.5158608\",\n \"text\": \"start() {\\n return Promise.reject(\\\"When inherting StreamDSL, the start method should be overwritten with connector logic.\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1767d607a67408cf6687f4f92c012259\",\n \"score\": \"0.5151232\",\n \"text\": \"$beforeDisconnect() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3afc0ef1affba14a9b55017119e28502\",\n \"score\": \"0.5144861\",\n \"text\": \"createClientHandle(){\\n throw new Error('Unimplemented');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec3f60e209992300663276923963fb07\",\n \"score\": \"0.51439166\",\n \"text\": \"_getWriteStream() {\\n throw new Error(`${this.name} storage adapter does not properly override the _getWriteStream method`);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43a4f6ed4de9d74375f28d1d3353c6d4\",\n \"score\": \"0.5138341\",\n \"text\": \"before (callback) {\\n\\t\\t// run standard set up for the test but delete the streamId and provide matching file instead\\n\\t\\tsuper.before(() => {\\n\\t\\t\\tdelete this.data.streamId;\\n\\t\\t\\tthis.data.file = this.repoStreams[0].file;\\n\\t\\t\\tcallback();\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8da87611931ef47e2d43898c0be022da\",\n \"score\": \"0.51366776\",\n \"text\": \"function test_automate_engine_database_connection() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3262c3ccd1471648b6cf4eaceb6799a7\",\n \"score\": \"0.51355964\",\n \"text\": \"async connect() {\\n // not needed\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49a2c96477db7a07d96e10c0133c03cd\",\n \"score\": \"0.51351416\",\n \"text\": \"disconnectedCallback(){super.disconnectedCallback()}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b94fca58ffaf60ce9eadc52c775b51e\",\n \"score\": \"0.5125835\",\n \"text\": \"configure () {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a09920049285e2ac2a0ad450f3c9341d\",\n \"score\": \"0.5120958\",\n \"text\": \"update() { /* stub */\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33a18e3ebb3f4aeb36fcc9ebe985a33f\",\n \"score\": \"0.5116024\",\n \"text\": \"before (callback) {\\n\\t\\t// run the standard test setup for creating a file-type stream...\\n\\t\\tsuper.before(error => {\\n\\t\\t\\tif (error) { return callback(error); }\\n\\t\\t\\t// ...and give our test stream the same file-related attributes, this should cause the server\\n\\t\\t\\t// to find the existing file-type stream, and return that in the response\\n\\t\\t\\tthis.data.repoId = this.duplicateStream.repoId;\\n\\t\\t\\tthis.data.file = this.duplicateStream.file;\\n\\t\\t\\tcallback();\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eea2afd031bc5d8cb6fbcaa76f28de9a\",\n \"score\": \"0.5115062\",\n \"text\": \"init() {\\n\\t\\tthis.replaceData(\\n\\t\\t\\tthis.manager.get(\\\"noReq\\\"),\\n\\t\\t\\tthis.endpoints.get,\\n\\t\\t\\tthis.data.get\\n\\t\\t);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e1ea72dada847c9fa0de55a6dbe115f\",\n \"score\": \"0.51136565\",\n \"text\": \"prepare() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15b1c4adb6bd306774a6b80fdeaedfa8\",\n \"score\": \"0.5111388\",\n \"text\": \"ready() {\\n super.ready();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15b1c4adb6bd306774a6b80fdeaedfa8\",\n \"score\": \"0.5111388\",\n \"text\": \"ready() {\\n super.ready();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15b1c4adb6bd306774a6b80fdeaedfa8\",\n \"score\": \"0.5111388\",\n \"text\": \"ready() {\\n super.ready();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15b1c4adb6bd306774a6b80fdeaedfa8\",\n \"score\": \"0.5111388\",\n \"text\": \"ready() {\\n super.ready();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15b1c4adb6bd306774a6b80fdeaedfa8\",\n \"score\": \"0.5111388\",\n \"text\": \"ready() {\\n super.ready();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3aefb46d4c67240018731ed3431a5d9\",\n \"score\": \"0.5110436\",\n \"text\": \"function _addFbConnectorSucceed(connector) {\\n RightMenu.rightMenuLoading(false);\\n DataSources.addConnector(ConnectorsTemplate.ConnectorType.Facebook, connector);\\n ////RightMenu.showHideRightMenu(false);\\n ////DataSourcesHelper.addConnector(ConnectorsTemplate.ConnectorType.Facebook, connector);\\n ////DataSources.showConnector(connector);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b099bdf9f21e4bfd3c3ebffebd75e2d\",\n \"score\": \"0.51065433\",\n \"text\": \"connectedCallback() {\\n super.connectedCallback();\\n\\n console.info('connected.');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f9335e87ed046b673803cab4f7107cd\",\n \"score\": \"0.5106332\",\n \"text\": \"function afterConnection(){\\n\\t\\tcreateArray();\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"322dccb2493031ed428b92d534968455\",\n \"score\": \"0.5098004\",\n \"text\": \"disconnect() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c2fcf498a752101ed2ba73c690b4e0b\",\n \"score\": \"0.5087029\",\n \"text\": \"connectedCallback() {\\n super.connectedCallback();\\n this.id = this._generateUUID();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7915e24d529c9aa1775ec544317f1dc\",\n \"score\": \"0.5086494\",\n \"text\": \"OnCreateParamsProcessed() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54b67f3d2c641de3bd5d3c5b0b4b0438\",\n \"score\": \"0.5081315\",\n \"text\": \"onConnectionError() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4458799ff0103eea0c528dac17b1a7aa\",\n \"score\": \"0.5077261\",\n \"text\": \"initialize() {\\r\\n return null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8be3c3a5aa1dc86b9430adde50f13556\",\n \"score\": \"0.50771374\",\n \"text\": \"async link()\\n {\\n AbstractMethodCall();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"368167e370df6b0836bc47c4a1cf7a9c\",\n \"score\": \"0.50563955\",\n \"text\": \"beforeApply() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3590412cc80b880e0791640e3916fede\",\n \"score\": \"0.505599\",\n \"text\": \"connectedCallback(){this.__ready=!0;this.HAXWiring=new HAXWiring;this.HAXWiring.setup(UserAction.haxProperties,UserAction.tag,this)}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c5b7f7ea4a355a3b318db8a030022d7\",\n \"score\": \"0.5052071\",\n \"text\": \"init() {\\n\\t\\t// Could be implemented\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9425cd052b9e65ad1ad1843d1dc05e9\",\n \"score\": \"0.5049078\",\n \"text\": \"init () {\\n this.replaceData(this.manager.get(\\\"hostReq\\\"), this.endpoints.get, this.data.get);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fab50dc441e723f92eec4ecc0e7b236d\",\n \"score\": \"0.50344175\",\n \"text\": \"connectedCallback() {\\n this.idField = this.fromObject + '.Id';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f52d789b29b805ef2addcc74dce026c\",\n \"score\": \"0.5032736\",\n \"text\": \"preStepLogic() {\\n // console.log('try sync')\\n if (this.syncClient != null) {\\n if (this.app.state.clock) {\\n if (this.app.state.xebraReady) {\\n console.log('sync')\\n this.app.xebraState.sendMessageToChannel(this.app.state.channel, [\\n this.app.state.clockMessage,\\n this.getAdjustedSyncTime()\\n ])\\n }\\n }\\n }\\n /* For some reason, Serializer gives an error only in production. \\n Ensuring that inboundMessages is empty prevents it and I don't need this right now. \\n If I add actual game objects will need to figure this out. */\\n this.inboundMessages = []\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1753f22beaa341453765e0dbf579c493\",\n \"score\": \"0.5030207\",\n \"text\": \"prepare() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5c485379ee917157bf91dbeb32b198c\",\n \"score\": \"0.50293326\",\n \"text\": \"onready() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f38f601b36177f810621ca53545ef6af\",\n \"score\": \"0.5028287\",\n \"text\": \"_FBPReady(){super._FBPReady();// this._FBPTraceWires()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01962a6c3073bfe8c6363282f7406189\",\n \"score\": \"0.5026936\",\n \"text\": \"ready() {\\n super.ready();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01962a6c3073bfe8c6363282f7406189\",\n \"score\": \"0.5026936\",\n \"text\": \"ready() {\\n super.ready();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01962a6c3073bfe8c6363282f7406189\",\n \"score\": \"0.5026936\",\n \"text\": \"ready() {\\n super.ready();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c283d98b8eca72fc32eb5ab802664a2\",\n \"score\": \"0.50242996\",\n \"text\": \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c283d98b8eca72fc32eb5ab802664a2\",\n \"score\": \"0.50242996\",\n \"text\": \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c283d98b8eca72fc32eb5ab802664a2\",\n \"score\": \"0.50242996\",\n \"text\": \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c283d98b8eca72fc32eb5ab802664a2\",\n \"score\": \"0.50242996\",\n \"text\": \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c283d98b8eca72fc32eb5ab802664a2\",\n \"score\": \"0.50242996\",\n \"text\": \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c283d98b8eca72fc32eb5ab802664a2\",\n \"score\": \"0.50242996\",\n \"text\": \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c283d98b8eca72fc32eb5ab802664a2\",\n \"score\": \"0.50242996\",\n \"text\": \"_FBPReady(){super._FBPReady();//this._FBPTraceWires()\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d357c02a7e880281c849fc335469d39\",\n \"score\": \"0.5023872\",\n \"text\": \"async onReady() {\\n // Initialize your adapter here\\n\\n // try changing a data state object:\\n for (const attr in DATAFIELDS) {\\n\\n for (const ch in DATAFIELDS[attr].channels) {\\n\\n // check object for existence and update if needed\\n const obj_id = DATAFIELDS[attr].channels[ch].channel + '.' + DATAFIELDS[attr].id;\\n const that = this;\\n this.verify_datapoint(obj_id, that, DATAFIELDS[attr], DATAFIELDS[attr].channels[ch].name);\\n }\\n }\\n\\n // The adapters config (in the instance object everything under the attribute \\\"native\\\") is accessible via\\n // this.config:\\n\\n if (this.config.scheduler_active == true) {\\n this.log.info('Starting Scheduler');\\n this.scheduler = new Scheduler(this.config, this);\\n this.scheduler.start();\\n }\\n\\n if (this.config.listener_active == true) {\\n this.listener = new Listener(this.config.bind, this.config.port, this.config.path, this.config.listener_protocol, this.config.listener_forward_url, this);\\n this.listener.start();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57ef53366d24a258cd43fddc46b3c4f0\",\n \"score\": \"0.50183624\",\n \"text\": \"_initConnWrite() {\\n this.ctx.transaction = this.app.mysql.get('db_write');\\n this.ctx.transaction.mode = 'single';\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a93691751fd5e4b5153c9eaabf49911\",\n \"score\": \"0.50166893\",\n \"text\": \"bodyDataBeforeApiFirstResponds() {\\n \\tthrow new Error('Implementing bodyDataBeforeApiFirstResponds method is mandatory for sub class of ApiComponent');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d30d47bbe18c18ae3504bfd29f35e15d\",\n \"score\": \"0.50165045\",\n \"text\": \"_FBPReady(){super._FBPReady();this._FBPTraceWires()}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d30d47bbe18c18ae3504bfd29f35e15d\",\n \"score\": \"0.50165045\",\n \"text\": \"_FBPReady(){super._FBPReady();this._FBPTraceWires()}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d30d47bbe18c18ae3504bfd29f35e15d\",\n \"score\": \"0.50165045\",\n \"text\": \"_FBPReady(){super._FBPReady();this._FBPTraceWires()}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d30d47bbe18c18ae3504bfd29f35e15d\",\n \"score\": \"0.50165045\",\n \"text\": \"_FBPReady(){super._FBPReady();this._FBPTraceWires()}\",\n \"title\": \"\"\n }\n]"}}},{"rowIdx":2369,"cells":{"query_id":{"kind":"string","value":"0e3444c39dc3da0df90007f9821ee352"},"query":{"kind":"string","value":"Which part of the Redux global state does our component want to receive as props?"},"positive_passages":{"kind":"list like","value":[{"docid":"f31386f9891bbacfc6f49d61debec6fd","score":"0.0","text":"function mapStateToProps(state) {\n return {\n \tnavState: state.navState,\n searchResults: state.searchResults,\n isFetchingMoreCopysFromParse: state.isFetchingMoreCopysFromParse,\n noMoreCopysFromParse: state.noMoreCopysFromParse\n };\n}","title":""}],"string":"[\n {\n \"docid\": \"f31386f9891bbacfc6f49d61debec6fd\",\n \"score\": \"0.0\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n \\tnavState: state.navState,\\n searchResults: state.searchResults,\\n isFetchingMoreCopysFromParse: state.isFetchingMoreCopysFromParse,\\n noMoreCopysFromParse: state.noMoreCopysFromParse\\n };\\n}\",\n \"title\": \"\"\n }\n]"},"negative_passages":{"kind":"list like","value":[{"docid":"22da71fdabb731fcdeb6015e4ad49f4d","score":"0.7095458","text":"function mapStateToProps(state) {\n // It returns an OBJECT where \n // the keys are the name of the prop your comp wants to use\n // the values are the actual parts of the global state your comp wants\n return {\n playerName: state.playerName,\n questions: state.questions,\n index: state.index,\n correct: state.correct,\n correctCount: state.correctCount,\n incorrect: state.incorrect\n }\n}","title":""},{"docid":"b90c265ef8e0de2199ed3a4dc7002d7b","score":"0.7072656","text":"function mapStateToProps(state){\n // mapStateToProps returns object with:\n // 1. property is the local prop name to this component\n // 2. value will be the property in the root reducer... ie. a piece of the store.\n return {\n frozenData: state.frozen,\n meatData: state.meat,\n produceData: state.produce,\n\n\n }\n}","title":""},{"docid":"93aa0a9cee49090e859008f0933f9820","score":"0.7056903","text":"function mapStateToProps(state){\n return state //the app component gets all of the state\n}","title":""},{"docid":"d4fd6103eb43ae8c65916a5f648b5087","score":"0.700542","text":"function mapStateToProps(state){\r\n return {\r\n database: state.database,\r\n visible: state.application.musiccollectionVisible,\r\n }\r\n}","title":""},{"docid":"078f87aefc80fafb4236c6e58b071aa9","score":"0.6981231","text":"function mapStateToProps(state){\n //this object that we return will have its key: value pairs inside of props for the component at the end\n return {\n titlesInOurStoresState: state.titles\n }\n}","title":""},{"docid":"e519c2b717c86b1629de8a246b28fa34","score":"0.69753593","text":"function mapStateToProps(state){\n return{\n current: state.current\n };\n}","title":""},{"docid":"4f738bcac209813ed2ccf2a55368dbf3","score":"0.69117254","text":"function mapStateToProps(state) {\n return {\n view: state.currentAppView\n }\n}","title":""},{"docid":"e452958e13dc55f6229f4c106d1d5eab","score":"0.6904103","text":"function mapStateToProps (state) {\n //find out from Luke if stuff goes here......\n return state;\n}","title":""},{"docid":"097e3b3de2002ca2f82ab94f323b282a","score":"0.68956274","text":"function mapStateToProps(state) {\n return {\n auth: state.system.auth,\n dataset: state.databind.dataset\n };\n}","title":""},{"docid":"84f00e6a2d8b14fee66ab35f08ada481","score":"0.68648785","text":"function mapStateToProps(state) {\n return {\n something: 'something'\n }\n}","title":""},{"docid":"bc0f57ef77e3dce4e7e8b33ad2934f55","score":"0.6862485","text":"function mapStateToProps(appState){\n //object returned will be merged with props\n return{\n names: appState.names\n };\n}","title":""},{"docid":"d026f399da62bd01d1efdd193c85bf85","score":"0.685982","text":"function mapStateToProps(ownProps) {\n return {\n topics: store.getters.getTopics(),\n isLoading: store.getters.isLoading()\n};\n}","title":""},{"docid":"9cb43f03f234ae77721eab49349a595f","score":"0.683192","text":"function mapStateToProps({foo}) { \n return { foo };\n}","title":""},{"docid":"363a56d6bd476c1d553392aa62e0a28a","score":"0.6828233","text":"function mapStateToProps (state) {\n\treturn {\n\t\tappData: state.appData\n\t}\n}","title":""},{"docid":"6620b7a03f2a10c19e2ab24fa9e7d9ed","score":"0.6797364","text":"function mapStateToProps(state) {\n return {statistics: state.statistics};\n}","title":""},{"docid":"7fefa07a98dccd1557f339cfb9e0b27e","score":"0.6790042","text":"function mapStateToProps(state) {\n return {\n value:state.payload\n }\n}","title":""},{"docid":"3cd7867aefbc01f1c366415a54bf8894","score":"0.6772263","text":"function mapStateToProps(state, ownProps) {\n console.log(state);\n return { text: \"wow\" }\n }","title":""},{"docid":"7d939579bdb67ec82f022e2af808cd8c","score":"0.6760892","text":"function mapStateToProps(state, ownProps) {\n return { categories: state.categories.current }\n}","title":""},{"docid":"955d6a7332cdbee6ea35ef8f08e3b44c","score":"0.6743284","text":"function mapStateToProps(reduxState) {\n console.log(\"redux state?\", reduxState);\n return {\n devs: reduxState.developers\n };\n}","title":""},{"docid":"3e8ecb7bf4fc07cca2961f193fe9944c","score":"0.67425096","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"3e8ecb7bf4fc07cca2961f193fe9944c","score":"0.67425096","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"3e8ecb7bf4fc07cca2961f193fe9944c","score":"0.67425096","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"3e8ecb7bf4fc07cca2961f193fe9944c","score":"0.67425096","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"3e8ecb7bf4fc07cca2961f193fe9944c","score":"0.67425096","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"3e8ecb7bf4fc07cca2961f193fe9944c","score":"0.67425096","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"3e8ecb7bf4fc07cca2961f193fe9944c","score":"0.67425096","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"5c6396e5e18859e47275835cbd04f6ad","score":"0.67394966","text":"function mapStateToProps(state) {\n\treturn {\n\t\tfull_list_urls: state.GlobalReducer.full_list_urls,\n\t\tscraper_settings: state.GlobalReducer.scraper_settings,\n\t}\n}","title":""},{"docid":"f96a01c97b8cc51660c6ca67878772cf","score":"0.67291707","text":"function mapStateToProps(state){\n\tconst health = state.main.currentGame.currentHealth; \n return({\n health\n });\n}","title":""},{"docid":"a86fb04da1a63d12ff1d6b12191783d7","score":"0.6716697","text":"function mapStateToProps(state){\n console.log('Redux state in Clock Component: ', state);\n return {\n //this time becomes a property inside of the props of this component\n time: state.clock.time\n };\n}","title":""},{"docid":"a91b6ad37d0c88f3e0bc7f008bc41946","score":"0.6713369","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"a91b6ad37d0c88f3e0bc7f008bc41946","score":"0.6713369","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"a91b6ad37d0c88f3e0bc7f008bc41946","score":"0.6713369","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"a91b6ad37d0c88f3e0bc7f008bc41946","score":"0.6713369","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"a91b6ad37d0c88f3e0bc7f008bc41946","score":"0.6713369","text":"function mapStateToProps(state) {\n return {};\n}","title":""},{"docid":"dd4417f8f4a47cc160b0333485ac31dc","score":"0.6705527","text":"function mapStateToProps(store, ownProps) {\n return {\n tickets: store.tickets,\n tags: store.tags,\n }\n}","title":""},{"docid":"de485df9a6c4892ae864bc10e63bf51b","score":"0.6703752","text":"function mapStateToProps(state, ownProps) {\n return {\n config: state.app.config,\n workspaceItems: state.app.workspaceItems,\n force: state.app.force\n };\n}","title":""},{"docid":"9453ab4c720686463341f156cdead91b","score":"0.6699444","text":"function mapStateToProps(state) {\n return {\n userContext: state.currentUserItemContext,\n currentItemName: state.currentDesignComponentName,\n view: state.currentAppView,\n mode: state.currentViewMode,\n viewOptions: state.currentUserViewOptions\n }\n}","title":""},{"docid":"716e49fd13a260ecd510c7ffff1f114c","score":"0.6687011","text":"function mapStateToProps(state) {\n return {\n addsDataFromStore : state.Adds_Data_Updater,\n loggedInUserInfo: state.Loged_in_user_info,\n // decCounter : state.decrementCounter.decrementState\n };\n}","title":""},{"docid":"b3f424618ac08f9a69ebdc5e2cf2fd9f","score":"0.6685758","text":"function mapStateToProps(state) {\n // Whatever is returned from here will be props for you component\n return {\n activeBook: state.activeBook\n }\n}","title":""},{"docid":"4d1a7eef4529d3a8faa17e829bb60ad5","score":"0.6683104","text":"function mapStateToProps({ auth }) {\n //drog piece info from state\n return { auth };\n}","title":""},{"docid":"7c2990b0d33f3cbfed8a433231b550fd","score":"0.6671672","text":"function mapStateToProps(state, ownProps) {\n\n}","title":""},{"docid":"31bbd2bc458e899b8e04ff2b51de5cc7","score":"0.667052","text":"function getStateFromRedux(appState) {\n return {\n // Any properties here are put on this.props\n currentValue: appState.currentValue,\n futureValues: appState.futureValues,\n previousValues: appState.previousValues\n }\n}","title":""},{"docid":"2bf7be26022ec2dff4ca2bc85955c2f7","score":"0.6648444","text":"function mapStateToProps(state) {\n return {\n // everything we get from the current user\n \n currentUser: state.currentUser\n };\n}","title":""},{"docid":"6dc04e65c2c16e702928a2ca63a5861f","score":"0.66457266","text":"function mapStateToProps(state) {\n\t return {};\n\t}","title":""},{"docid":"ca06ee10c5e468d282b2889cda1b67b1","score":"0.66402185","text":"function reduxState (state){\n return {\n MyGlobalReducer: state.MyGlobalReducer\n }\n}","title":""},{"docid":"ce9d62e52020d517938031f24b11f29b","score":"0.66379666","text":"function mapStateToProps(reduxState){\n return reduxState\n}","title":""},{"docid":"0a1de7fb589dc6ca57ea08e6b23c9fba","score":"0.66259557","text":"function mapStateToProps(state){\n return state;\n}","title":""},{"docid":"8fd51538debc3d31af3e853a79504cd0","score":"0.66204786","text":"function mapStateToProps(store) {\n return {\n foo: store.foo, // dont use foo\n };\n}","title":""},{"docid":"27e1ca226eb8563735ebdd08b050a5f0","score":"0.6616969","text":"function mapStateToProps(state) {\n\treturn state\n}","title":""},{"docid":"ce92ea023c89981c3100f3f6401db6ba","score":"0.6605074","text":"function mapStateToProps(state) {\n return {\n addsDataFromStore : state.Adds_Data_Updater,\n // decCounter : state.decrementCounter.decrementState\n };\n}","title":""},{"docid":"b2f024831fe93e44d9a2eb8da353621e","score":"0.6601051","text":"function mapStateToProps(state) {\r\n return state;\r\n}","title":""},{"docid":"d94bfa815f9951cf7b71309af4391d70","score":"0.660083","text":"function mapStateToProps(state){\n\treturn {\n\t\tulykker: state.ulykker\n\t}\n}","title":""},{"docid":"9702af089a0db422b2e7726b2d45753d","score":"0.65997463","text":"function mapStateToProps(state) {
\n return {
\n value: state
\n }\n
}","title":""},{"docid":"0bd8bdb2b304a5b4da5aa58525aa5b24","score":"0.65916747","text":"function mapStateToProps(state, ownProps) {\n return {\n config: state.app.config,\n pagination: state.app.pagination,\n force: state.app.force,\n app: state.app,\n selectedView: state.app.selectedView\n };\n}","title":""},{"docid":"96cae373a46a477a7aaf40aa1103c558","score":"0.6585512","text":"function mapStateToProps(state) {\n return {\n loggedInUserInfo: state.Loged_in_user_info,\n tokenInfo: state.Token_info,\n // decCounter : state.decrementCounter.decrementState\n };\n}","title":""},{"docid":"6e5d6085d782693cba7fbd6871e9ed96","score":"0.6584377","text":"function mapStateToProps(state) {\n const { main } = state;\n return { main };\n}","title":""},{"docid":"ee828b3744065b66148087d8350358df","score":"0.65793693","text":"function mapStateToProps(state) {\n //whatever is returned will show up as props inside of BookDetail\n return {\n book : state.activeBook\n };\n}","title":""},{"docid":"b56fab2c929cdddc4fd87016ee4b3a01","score":"0.65752965","text":"function mapStateToProps(state, ownProps) {\n return {\n config: state.app.config,\n selectedView: state.app.selectedView,\n force: state.app.force,\n dataList: state.dataList,\n showLoading: state.app.showLoading,\n preferences: state.app.preferences,\n overridePropsPrefs: state.app.overridePreferences.props\n };\n}","title":""},{"docid":"ea342e0ee8320497c4d7393e083edede","score":"0.6570614","text":"function mapStateToProps(state) {\n //NOTE connecting the \"action\" in InitialState making it a prop here\n return {\n action: state.action,\n name: state.name\n };\n}","title":""},{"docid":"74912e7c8fd65369d6c81a26819ccdd9","score":"0.6569303","text":"function mapStateToProps(state) {\n //Whatever is returned from here will show up as props inside of VideoList\n\n return {\n videos: state.activeVideo\n };\n}","title":""},{"docid":"565ffc21680bb1c624f6498d634aa3d6","score":"0.6568171","text":"function mapStateToProps(state, ownProps) {\n return {\n config: state.app.config,\n views: state.app.views,\n selectedView: state.app.selectedView,\n filters: state.filters\n };\n}","title":""},{"docid":"e70a013ad13ae663604c18323e1ec398","score":"0.65672547","text":"function mapStateToProps(state, props) {\n console.log(state)\nreturn {\n random: state.random.current,\n randomHistory: state.random.history\n}\n}","title":""},{"docid":"f10f1f4026c54f1ddd6b6a67d57d8d7a","score":"0.6567235","text":"function mapStateToProps(state) {\n return {\n value: state\n }\n}","title":""},{"docid":"0e29a7873977668298bab7b0f4b5bac8","score":"0.6566527","text":"function mapStateToProps(store) {\n return {\n app: store.app,\n menu: store.menu,\n object: store.rubix,\n ig: store.instaProxy,\n };\n}","title":""},{"docid":"f785e760eb7cc996eb00a843f965c137","score":"0.65632504","text":"function mapStateToProps(state) {\n return state;\n}","title":""},{"docid":"f785e760eb7cc996eb00a843f965c137","score":"0.65632504","text":"function mapStateToProps(state) {\n return state;\n}","title":""},{"docid":"f785e760eb7cc996eb00a843f965c137","score":"0.65632504","text":"function mapStateToProps(state) {\n return state;\n}","title":""},{"docid":"91c6386889688b7549172dd65545110f","score":"0.656014","text":"function mapStateToProps(state) {\n\treturn {\n\t};\n}","title":""},{"docid":"ab41cd7561bc4dd00a8acb2d6f46c1b1","score":"0.6549138","text":"function mapStateToProps(state) {\n console.log(\"Redux home contaienr mapStateToProps\", state);\n return {\n // returns props\n // propName: property value\n counter: state.counter, \n //login: state.authState.login\n }\n}","title":""},{"docid":"6001276be6faa2e6c9128315e4f1b136","score":"0.6545082","text":"function mapStateToProps(state){ //this is used to make the link of containers between react and redux\n // whatever is returned will show up ad props inside of BookList container\n return{\n books: state.books\n };\n}","title":""},{"docid":"95882cd22125dc824c6ed35cbfb4e156","score":"0.65446234","text":"function mapStateToProps(state, ownProps) {\n return {\n redux: state.auth\n };\n}","title":""},{"docid":"d1bed4015ce40a320af4db4f8f0cd2b9","score":"0.65344846","text":"function mapStateToProps(state, ownProps) {\n return {\n config: state.app.config,\n pagination: state.app.pagination,\n force: state.app.force\n };\n}","title":""},{"docid":"7306abf9a823f572dd97f25d7adc7c70","score":"0.6534365","text":"function mapStateToProps (state) {\n return {\n logData: state.logData,\n quizActive: state.quizActive\n };\n}","title":""},{"docid":"f53f904298a292d38825db2445a02df8","score":"0.6533073","text":"function mapStateToProps(state) {\r\n console.log(state);\r\n return {\r\n\r\n printNames: state.printNames,\r\n vehicalData: state.vehicalData,\r\n financialInfo: state.fincacialInfo,\r\n dealerPackage: state.dealerPackage,\r\n }\r\n}","title":""},{"docid":"0f3abea72f684a2088c9f0e5e6269a83","score":"0.6531918","text":"function mapStateToProps(state) {\n return {\n\n };\n}","title":""},{"docid":"e394eb65e51cc6a3432207856adf4db4","score":"0.6530384","text":"function mapStateToProps(storeData){\n return{\n mydata:storeData\n }\n}","title":""},{"docid":"69034ae6fc276c77f87fcd9d0007f754","score":"0.65240556","text":"function mapStateToProps(state) {\n return state;\n}","title":""},{"docid":"69034ae6fc276c77f87fcd9d0007f754","score":"0.65240556","text":"function mapStateToProps(state) {\n return state;\n}","title":""},{"docid":"69034ae6fc276c77f87fcd9d0007f754","score":"0.65240556","text":"function mapStateToProps(state) {\n return state;\n}","title":""},{"docid":"4a40291569c7cc2ff7ba1980da5076dc","score":"0.65207464","text":"function mapStateToProps(store) {\n return {\n book: store.activeBook\n };\n}","title":""},{"docid":"2801a02255544a71c3276a0509531558","score":"0.65190166","text":"function mapStateToProps (state) {\n return {\n counter: state\n };\n }","title":""},{"docid":"391d7e15fa0a6bab39a1c03429d9125a","score":"0.65183616","text":"function mapStateToProps(state) {\n return {\n userRole: state.currentUserRole,\n viewOptions: state.currentUserViewOptions,\n userContext: state.currentUserItemContext,\n testDataFlag: state.testDataFlag,\n dvDataLoaded: state.designVersionDataLoaded,\n testDataLoaded: state.testIntegrationDataLoaded,\n summaryDataLoaded: state.testSummaryDataLoaded,\n mashDataStale: state.mashDataStale,\n testDataStale: state.testDataStale\n }\n}","title":""},{"docid":"7a64c89c1972ec899a507880f7bbba47","score":"0.65176475","text":"function mapStateToProps(state) {\n return {\n counter: state.counter\n };\n}","title":""},{"docid":"b84976da1fcb52a2bf4f8471ed98a175","score":"0.6516253","text":"getProps(inputState) {\n const state = inputState ? inputState : Store.getState();\n return this.mapStateToProps(state,null);\n }","title":""},{"docid":"28db9bdc455f53d29eef67fa87413336","score":"0.651306","text":"function mapStateToProps(state) {\n return {\n\n }\n}","title":""},{"docid":"28db9bdc455f53d29eef67fa87413336","score":"0.651306","text":"function mapStateToProps(state) {\n return {\n\n }\n}","title":""},{"docid":"ac34e94fb5c177f249c31a733b68356c","score":"0.65116435","text":"function mapStateToProps({ data }) {\n return { data };\n}","title":""},{"docid":"6b1a6ba2a276125dfb00a45b82679d17","score":"0.65082407","text":"function mapStateToProps (state) {\n return {\n value: state.fooCounter.count,\n todos: state.fooCounter.todos\n }\n}","title":""},{"docid":"7bb082a1cbd4ed63b9930719eb242280","score":"0.65075547","text":"function mapStateToProps(store) {\n return {\n\n };\n}","title":""},{"docid":"e88a4bc2a68399befd41c7f018c71972","score":"0.65055245","text":"function mapStateToProps(state) {\n const props = {\n shorts: state.shorts,\n }\n return props\n}","title":""},{"docid":"7b1f707529ea9b4ba395c9d362f743cb","score":"0.6503956","text":"function mapStateToProps(state) {\n return {\n text: state.text,\n isLoading: state.isLoading,\n tags: state.tags,\n countries: state.countries,\n };\n}","title":""},{"docid":"248fa52f57b156a1969f6e03efb13a54","score":"0.6501292","text":"function mapStateToProps(state, ownProps) {\n return {\n courses: state.courses, // connected to label in root reducer\n authors: state.authors,\n };\n}","title":""},{"docid":"8a0f9952bc4c7265474447099212d99a","score":"0.64990133","text":"function mapStateToProps(state) {\n return {}\n}","title":""},{"docid":"58275fc2bafd44ff1867552c2c2b000f","score":"0.6495179","text":"function mapStateToProps(state) {\n return {\n // propName: state value\n counter: state.counter\n }\n}","title":""},{"docid":"1ce6912f93175f785e0aa0b6ffe4c66f","score":"0.6490154","text":"function mapStateToProps(state) {\r\n return;\r\n}","title":""},{"docid":"9299c69a3948cfbe231699b220a8a497","score":"0.6489733","text":"function mapStateToProps(state, props) {\n return {};\n}","title":""},{"docid":"a04a7e2e7922b9b7b326f20bbbd7fd3b","score":"0.6487024","text":"function mapStateToProps(state){\nreturn {\n currentValue: state.currentValue,\n futureValues: state.futureValues,\n previousValues: state.previousValues\n }\n}","title":""},{"docid":"4b7cee0525aca2aca9540cc88d1a5080","score":"0.64868313","text":"function mapStateToProps(state, ownProps) {\n return {\n loc: ownProps.loc\n };\n}","title":""},{"docid":"b7d0479dc56453b47b8b5a5ebe803e65","score":"0.64867496","text":"function mapStateToProps(state) {\n \n return {\n \n };\n}","title":""},{"docid":"37023d37c66f0057b819d10bcbb8df5e","score":"0.64855945","text":"function mapStateToProps(state) {\n return {\n \n }\n}","title":""},{"docid":"4d5d2eaf8e355fe75b3311771ce8ffde","score":"0.64841753","text":"function mapStateToProps (state, ownProps) {\n return {\n id: state.id,\n products: state.count\n }\n}","title":""}],"string":"[\n {\n \"docid\": \"22da71fdabb731fcdeb6015e4ad49f4d\",\n \"score\": \"0.7095458\",\n \"text\": \"function mapStateToProps(state) {\\n // It returns an OBJECT where \\n // the keys are the name of the prop your comp wants to use\\n // the values are the actual parts of the global state your comp wants\\n return {\\n playerName: state.playerName,\\n questions: state.questions,\\n index: state.index,\\n correct: state.correct,\\n correctCount: state.correctCount,\\n incorrect: state.incorrect\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b90c265ef8e0de2199ed3a4dc7002d7b\",\n \"score\": \"0.7072656\",\n \"text\": \"function mapStateToProps(state){\\n // mapStateToProps returns object with:\\n // 1. property is the local prop name to this component\\n // 2. value will be the property in the root reducer... ie. a piece of the store.\\n return {\\n frozenData: state.frozen,\\n meatData: state.meat,\\n produceData: state.produce,\\n\\n\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93aa0a9cee49090e859008f0933f9820\",\n \"score\": \"0.7056903\",\n \"text\": \"function mapStateToProps(state){\\n return state //the app component gets all of the state\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4fd6103eb43ae8c65916a5f648b5087\",\n \"score\": \"0.700542\",\n \"text\": \"function mapStateToProps(state){\\r\\n return {\\r\\n database: state.database,\\r\\n visible: state.application.musiccollectionVisible,\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"078f87aefc80fafb4236c6e58b071aa9\",\n \"score\": \"0.6981231\",\n \"text\": \"function mapStateToProps(state){\\n //this object that we return will have its key: value pairs inside of props for the component at the end\\n return {\\n titlesInOurStoresState: state.titles\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e519c2b717c86b1629de8a246b28fa34\",\n \"score\": \"0.69753593\",\n \"text\": \"function mapStateToProps(state){\\n return{\\n current: state.current\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f738bcac209813ed2ccf2a55368dbf3\",\n \"score\": \"0.69117254\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n view: state.currentAppView\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e452958e13dc55f6229f4c106d1d5eab\",\n \"score\": \"0.6904103\",\n \"text\": \"function mapStateToProps (state) {\\n //find out from Luke if stuff goes here......\\n return state;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"097e3b3de2002ca2f82ab94f323b282a\",\n \"score\": \"0.68956274\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n auth: state.system.auth,\\n dataset: state.databind.dataset\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84f00e6a2d8b14fee66ab35f08ada481\",\n \"score\": \"0.68648785\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n something: 'something'\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc0f57ef77e3dce4e7e8b33ad2934f55\",\n \"score\": \"0.6862485\",\n \"text\": \"function mapStateToProps(appState){\\n //object returned will be merged with props\\n return{\\n names: appState.names\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d026f399da62bd01d1efdd193c85bf85\",\n \"score\": \"0.685982\",\n \"text\": \"function mapStateToProps(ownProps) {\\n return {\\n topics: store.getters.getTopics(),\\n isLoading: store.getters.isLoading()\\n};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9cb43f03f234ae77721eab49349a595f\",\n \"score\": \"0.683192\",\n \"text\": \"function mapStateToProps({foo}) { \\n return { foo };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"363a56d6bd476c1d553392aa62e0a28a\",\n \"score\": \"0.6828233\",\n \"text\": \"function mapStateToProps (state) {\\n\\treturn {\\n\\t\\tappData: state.appData\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6620b7a03f2a10c19e2ab24fa9e7d9ed\",\n \"score\": \"0.6797364\",\n \"text\": \"function mapStateToProps(state) {\\n return {statistics: state.statistics};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fefa07a98dccd1557f339cfb9e0b27e\",\n \"score\": \"0.6790042\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n value:state.payload\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3cd7867aefbc01f1c366415a54bf8894\",\n \"score\": \"0.6772263\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n console.log(state);\\n return { text: \\\"wow\\\" }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d939579bdb67ec82f022e2af808cd8c\",\n \"score\": \"0.6760892\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n return { categories: state.categories.current }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"955d6a7332cdbee6ea35ef8f08e3b44c\",\n \"score\": \"0.6743284\",\n \"text\": \"function mapStateToProps(reduxState) {\\n console.log(\\\"redux state?\\\", reduxState);\\n return {\\n devs: reduxState.developers\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e8ecb7bf4fc07cca2961f193fe9944c\",\n \"score\": \"0.67425096\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e8ecb7bf4fc07cca2961f193fe9944c\",\n \"score\": \"0.67425096\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e8ecb7bf4fc07cca2961f193fe9944c\",\n \"score\": \"0.67425096\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e8ecb7bf4fc07cca2961f193fe9944c\",\n \"score\": \"0.67425096\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e8ecb7bf4fc07cca2961f193fe9944c\",\n \"score\": \"0.67425096\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e8ecb7bf4fc07cca2961f193fe9944c\",\n \"score\": \"0.67425096\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e8ecb7bf4fc07cca2961f193fe9944c\",\n \"score\": \"0.67425096\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c6396e5e18859e47275835cbd04f6ad\",\n \"score\": \"0.67394966\",\n \"text\": \"function mapStateToProps(state) {\\n\\treturn {\\n\\t\\tfull_list_urls: state.GlobalReducer.full_list_urls,\\n\\t\\tscraper_settings: state.GlobalReducer.scraper_settings,\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f96a01c97b8cc51660c6ca67878772cf\",\n \"score\": \"0.67291707\",\n \"text\": \"function mapStateToProps(state){\\n\\tconst health = state.main.currentGame.currentHealth; \\n return({\\n health\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a86fb04da1a63d12ff1d6b12191783d7\",\n \"score\": \"0.6716697\",\n \"text\": \"function mapStateToProps(state){\\n console.log('Redux state in Clock Component: ', state);\\n return {\\n //this time becomes a property inside of the props of this component\\n time: state.clock.time\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a91b6ad37d0c88f3e0bc7f008bc41946\",\n \"score\": \"0.6713369\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a91b6ad37d0c88f3e0bc7f008bc41946\",\n \"score\": \"0.6713369\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a91b6ad37d0c88f3e0bc7f008bc41946\",\n \"score\": \"0.6713369\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a91b6ad37d0c88f3e0bc7f008bc41946\",\n \"score\": \"0.6713369\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a91b6ad37d0c88f3e0bc7f008bc41946\",\n \"score\": \"0.6713369\",\n \"text\": \"function mapStateToProps(state) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd4417f8f4a47cc160b0333485ac31dc\",\n \"score\": \"0.6705527\",\n \"text\": \"function mapStateToProps(store, ownProps) {\\n return {\\n tickets: store.tickets,\\n tags: store.tags,\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de485df9a6c4892ae864bc10e63bf51b\",\n \"score\": \"0.6703752\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n return {\\n config: state.app.config,\\n workspaceItems: state.app.workspaceItems,\\n force: state.app.force\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9453ab4c720686463341f156cdead91b\",\n \"score\": \"0.6699444\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n userContext: state.currentUserItemContext,\\n currentItemName: state.currentDesignComponentName,\\n view: state.currentAppView,\\n mode: state.currentViewMode,\\n viewOptions: state.currentUserViewOptions\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"716e49fd13a260ecd510c7ffff1f114c\",\n \"score\": \"0.6687011\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n addsDataFromStore : state.Adds_Data_Updater,\\n loggedInUserInfo: state.Loged_in_user_info,\\n // decCounter : state.decrementCounter.decrementState\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3f424618ac08f9a69ebdc5e2cf2fd9f\",\n \"score\": \"0.6685758\",\n \"text\": \"function mapStateToProps(state) {\\n // Whatever is returned from here will be props for you component\\n return {\\n activeBook: state.activeBook\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d1a7eef4529d3a8faa17e829bb60ad5\",\n \"score\": \"0.6683104\",\n \"text\": \"function mapStateToProps({ auth }) {\\n //drog piece info from state\\n return { auth };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c2990b0d33f3cbfed8a433231b550fd\",\n \"score\": \"0.6671672\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31bbd2bc458e899b8e04ff2b51de5cc7\",\n \"score\": \"0.667052\",\n \"text\": \"function getStateFromRedux(appState) {\\n return {\\n // Any properties here are put on this.props\\n currentValue: appState.currentValue,\\n futureValues: appState.futureValues,\\n previousValues: appState.previousValues\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bf7be26022ec2dff4ca2bc85955c2f7\",\n \"score\": \"0.6648444\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n // everything we get from the current user\\n \\n currentUser: state.currentUser\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dc04e65c2c16e702928a2ca63a5861f\",\n \"score\": \"0.66457266\",\n \"text\": \"function mapStateToProps(state) {\\n\\t return {};\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca06ee10c5e468d282b2889cda1b67b1\",\n \"score\": \"0.66402185\",\n \"text\": \"function reduxState (state){\\n return {\\n MyGlobalReducer: state.MyGlobalReducer\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce9d62e52020d517938031f24b11f29b\",\n \"score\": \"0.66379666\",\n \"text\": \"function mapStateToProps(reduxState){\\n return reduxState\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a1de7fb589dc6ca57ea08e6b23c9fba\",\n \"score\": \"0.66259557\",\n \"text\": \"function mapStateToProps(state){\\n return state;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fd51538debc3d31af3e853a79504cd0\",\n \"score\": \"0.66204786\",\n \"text\": \"function mapStateToProps(store) {\\n return {\\n foo: store.foo, // dont use foo\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27e1ca226eb8563735ebdd08b050a5f0\",\n \"score\": \"0.6616969\",\n \"text\": \"function mapStateToProps(state) {\\n\\treturn state\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce92ea023c89981c3100f3f6401db6ba\",\n \"score\": \"0.6605074\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n addsDataFromStore : state.Adds_Data_Updater,\\n // decCounter : state.decrementCounter.decrementState\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2f024831fe93e44d9a2eb8da353621e\",\n \"score\": \"0.6601051\",\n \"text\": \"function mapStateToProps(state) {\\r\\n return state;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d94bfa815f9951cf7b71309af4391d70\",\n \"score\": \"0.660083\",\n \"text\": \"function mapStateToProps(state){\\n\\treturn {\\n\\t\\tulykker: state.ulykker\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9702af089a0db422b2e7726b2d45753d\",\n \"score\": \"0.65997463\",\n \"text\": \"function mapStateToProps(state) {
\\n return {
\\n value: state
\\n }\\n
}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bd8bdb2b304a5b4da5aa58525aa5b24\",\n \"score\": \"0.65916747\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n return {\\n config: state.app.config,\\n pagination: state.app.pagination,\\n force: state.app.force,\\n app: state.app,\\n selectedView: state.app.selectedView\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96cae373a46a477a7aaf40aa1103c558\",\n \"score\": \"0.6585512\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n loggedInUserInfo: state.Loged_in_user_info,\\n tokenInfo: state.Token_info,\\n // decCounter : state.decrementCounter.decrementState\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e5d6085d782693cba7fbd6871e9ed96\",\n \"score\": \"0.6584377\",\n \"text\": \"function mapStateToProps(state) {\\n const { main } = state;\\n return { main };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee828b3744065b66148087d8350358df\",\n \"score\": \"0.65793693\",\n \"text\": \"function mapStateToProps(state) {\\n //whatever is returned will show up as props inside of BookDetail\\n return {\\n book : state.activeBook\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b56fab2c929cdddc4fd87016ee4b3a01\",\n \"score\": \"0.65752965\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n return {\\n config: state.app.config,\\n selectedView: state.app.selectedView,\\n force: state.app.force,\\n dataList: state.dataList,\\n showLoading: state.app.showLoading,\\n preferences: state.app.preferences,\\n overridePropsPrefs: state.app.overridePreferences.props\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea342e0ee8320497c4d7393e083edede\",\n \"score\": \"0.6570614\",\n \"text\": \"function mapStateToProps(state) {\\n //NOTE connecting the \\\"action\\\" in InitialState making it a prop here\\n return {\\n action: state.action,\\n name: state.name\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74912e7c8fd65369d6c81a26819ccdd9\",\n \"score\": \"0.6569303\",\n \"text\": \"function mapStateToProps(state) {\\n //Whatever is returned from here will show up as props inside of VideoList\\n\\n return {\\n videos: state.activeVideo\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"565ffc21680bb1c624f6498d634aa3d6\",\n \"score\": \"0.6568171\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n return {\\n config: state.app.config,\\n views: state.app.views,\\n selectedView: state.app.selectedView,\\n filters: state.filters\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e70a013ad13ae663604c18323e1ec398\",\n \"score\": \"0.65672547\",\n \"text\": \"function mapStateToProps(state, props) {\\n console.log(state)\\nreturn {\\n random: state.random.current,\\n randomHistory: state.random.history\\n}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f10f1f4026c54f1ddd6b6a67d57d8d7a\",\n \"score\": \"0.6567235\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n value: state\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e29a7873977668298bab7b0f4b5bac8\",\n \"score\": \"0.6566527\",\n \"text\": \"function mapStateToProps(store) {\\n return {\\n app: store.app,\\n menu: store.menu,\\n object: store.rubix,\\n ig: store.instaProxy,\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f785e760eb7cc996eb00a843f965c137\",\n \"score\": \"0.65632504\",\n \"text\": \"function mapStateToProps(state) {\\n return state;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f785e760eb7cc996eb00a843f965c137\",\n \"score\": \"0.65632504\",\n \"text\": \"function mapStateToProps(state) {\\n return state;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f785e760eb7cc996eb00a843f965c137\",\n \"score\": \"0.65632504\",\n \"text\": \"function mapStateToProps(state) {\\n return state;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91c6386889688b7549172dd65545110f\",\n \"score\": \"0.656014\",\n \"text\": \"function mapStateToProps(state) {\\n\\treturn {\\n\\t};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab41cd7561bc4dd00a8acb2d6f46c1b1\",\n \"score\": \"0.6549138\",\n \"text\": \"function mapStateToProps(state) {\\n console.log(\\\"Redux home contaienr mapStateToProps\\\", state);\\n return {\\n // returns props\\n // propName: property value\\n counter: state.counter, \\n //login: state.authState.login\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6001276be6faa2e6c9128315e4f1b136\",\n \"score\": \"0.6545082\",\n \"text\": \"function mapStateToProps(state){ //this is used to make the link of containers between react and redux\\n // whatever is returned will show up ad props inside of BookList container\\n return{\\n books: state.books\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95882cd22125dc824c6ed35cbfb4e156\",\n \"score\": \"0.65446234\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n return {\\n redux: state.auth\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1bed4015ce40a320af4db4f8f0cd2b9\",\n \"score\": \"0.65344846\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n return {\\n config: state.app.config,\\n pagination: state.app.pagination,\\n force: state.app.force\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7306abf9a823f572dd97f25d7adc7c70\",\n \"score\": \"0.6534365\",\n \"text\": \"function mapStateToProps (state) {\\n return {\\n logData: state.logData,\\n quizActive: state.quizActive\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f53f904298a292d38825db2445a02df8\",\n \"score\": \"0.6533073\",\n \"text\": \"function mapStateToProps(state) {\\r\\n console.log(state);\\r\\n return {\\r\\n\\r\\n printNames: state.printNames,\\r\\n vehicalData: state.vehicalData,\\r\\n financialInfo: state.fincacialInfo,\\r\\n dealerPackage: state.dealerPackage,\\r\\n }\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f3abea72f684a2088c9f0e5e6269a83\",\n \"score\": \"0.6531918\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e394eb65e51cc6a3432207856adf4db4\",\n \"score\": \"0.6530384\",\n \"text\": \"function mapStateToProps(storeData){\\n return{\\n mydata:storeData\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69034ae6fc276c77f87fcd9d0007f754\",\n \"score\": \"0.65240556\",\n \"text\": \"function mapStateToProps(state) {\\n return state;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69034ae6fc276c77f87fcd9d0007f754\",\n \"score\": \"0.65240556\",\n \"text\": \"function mapStateToProps(state) {\\n return state;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69034ae6fc276c77f87fcd9d0007f754\",\n \"score\": \"0.65240556\",\n \"text\": \"function mapStateToProps(state) {\\n return state;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a40291569c7cc2ff7ba1980da5076dc\",\n \"score\": \"0.65207464\",\n \"text\": \"function mapStateToProps(store) {\\n return {\\n book: store.activeBook\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2801a02255544a71c3276a0509531558\",\n \"score\": \"0.65190166\",\n \"text\": \"function mapStateToProps (state) {\\n return {\\n counter: state\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"391d7e15fa0a6bab39a1c03429d9125a\",\n \"score\": \"0.65183616\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n userRole: state.currentUserRole,\\n viewOptions: state.currentUserViewOptions,\\n userContext: state.currentUserItemContext,\\n testDataFlag: state.testDataFlag,\\n dvDataLoaded: state.designVersionDataLoaded,\\n testDataLoaded: state.testIntegrationDataLoaded,\\n summaryDataLoaded: state.testSummaryDataLoaded,\\n mashDataStale: state.mashDataStale,\\n testDataStale: state.testDataStale\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a64c89c1972ec899a507880f7bbba47\",\n \"score\": \"0.65176475\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n counter: state.counter\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b84976da1fcb52a2bf4f8471ed98a175\",\n \"score\": \"0.6516253\",\n \"text\": \"getProps(inputState) {\\n const state = inputState ? inputState : Store.getState();\\n return this.mapStateToProps(state,null);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28db9bdc455f53d29eef67fa87413336\",\n \"score\": \"0.651306\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28db9bdc455f53d29eef67fa87413336\",\n \"score\": \"0.651306\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac34e94fb5c177f249c31a733b68356c\",\n \"score\": \"0.65116435\",\n \"text\": \"function mapStateToProps({ data }) {\\n return { data };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b1a6ba2a276125dfb00a45b82679d17\",\n \"score\": \"0.65082407\",\n \"text\": \"function mapStateToProps (state) {\\n return {\\n value: state.fooCounter.count,\\n todos: state.fooCounter.todos\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bb082a1cbd4ed63b9930719eb242280\",\n \"score\": \"0.65075547\",\n \"text\": \"function mapStateToProps(store) {\\n return {\\n\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e88a4bc2a68399befd41c7f018c71972\",\n \"score\": \"0.65055245\",\n \"text\": \"function mapStateToProps(state) {\\n const props = {\\n shorts: state.shorts,\\n }\\n return props\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b1f707529ea9b4ba395c9d362f743cb\",\n \"score\": \"0.6503956\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n text: state.text,\\n isLoading: state.isLoading,\\n tags: state.tags,\\n countries: state.countries,\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"248fa52f57b156a1969f6e03efb13a54\",\n \"score\": \"0.6501292\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n return {\\n courses: state.courses, // connected to label in root reducer\\n authors: state.authors,\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a0f9952bc4c7265474447099212d99a\",\n \"score\": \"0.64990133\",\n \"text\": \"function mapStateToProps(state) {\\n return {}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58275fc2bafd44ff1867552c2c2b000f\",\n \"score\": \"0.6495179\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n // propName: state value\\n counter: state.counter\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ce6912f93175f785e0aa0b6ffe4c66f\",\n \"score\": \"0.6490154\",\n \"text\": \"function mapStateToProps(state) {\\r\\n return;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9299c69a3948cfbe231699b220a8a497\",\n \"score\": \"0.6489733\",\n \"text\": \"function mapStateToProps(state, props) {\\n return {};\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a04a7e2e7922b9b7b326f20bbbd7fd3b\",\n \"score\": \"0.6487024\",\n \"text\": \"function mapStateToProps(state){\\nreturn {\\n currentValue: state.currentValue,\\n futureValues: state.futureValues,\\n previousValues: state.previousValues\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b7cee0525aca2aca9540cc88d1a5080\",\n \"score\": \"0.64868313\",\n \"text\": \"function mapStateToProps(state, ownProps) {\\n return {\\n loc: ownProps.loc\\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7d0479dc56453b47b8b5a5ebe803e65\",\n \"score\": \"0.64867496\",\n \"text\": \"function mapStateToProps(state) {\\n \\n return {\\n \\n };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37023d37c66f0057b819d10bcbb8df5e\",\n \"score\": \"0.64855945\",\n \"text\": \"function mapStateToProps(state) {\\n return {\\n \\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d5d2eaf8e355fe75b3311771ce8ffde\",\n \"score\": \"0.64841753\",\n \"text\": \"function mapStateToProps (state, ownProps) {\\n return {\\n id: state.id,\\n products: state.count\\n }\\n}\",\n \"title\": \"\"\n }\n]"}}},{"rowIdx":2370,"cells":{"query_id":{"kind":"string","value":"1d7d92184c5c4db521680aa04b7ee89f"},"query":{"kind":"string","value":"TODO: Add capability to derivation to create sources. Recompute positions of stacked items and remove any whitespace that may occur due to dataset removal."},"positive_passages":{"kind":"list like","value":[{"docid":"a7246d8d295525ba81d931ede0222d5c","score":"0.5618482","text":"function addStackedData(g, sources) {\n var dataSources = [{\n id: 'stacks',\n // Compute list of ids denoting * - inactive\n // in terms of the original and not the derived sources.\n // TODO: Remove this in favor of set operation to subtract\n sources: function(resolve) {\n var star = resolve(sources.join(',')),\n inactive = resolve('inactive').map(function(id) {\n return id.substring(0, id.length - 6);\n });\n inactive.forEach(function(id) {\n var position = star.indexOf(id);\n if (position >= 0) {\n star.splice(position, 1);\n }\n });\n return star.join(',');\n },\n derivation: function(sources) {\n if (sources) {\n return sources.stack().all();\n } else {\n return [];\n }\n }\n }];\n g.data().add(dataSources);\n }","title":""}],"string":"[\n {\n \"docid\": \"a7246d8d295525ba81d931ede0222d5c\",\n \"score\": \"0.5618482\",\n \"text\": \"function addStackedData(g, sources) {\\n var dataSources = [{\\n id: 'stacks',\\n // Compute list of ids denoting * - inactive\\n // in terms of the original and not the derived sources.\\n // TODO: Remove this in favor of set operation to subtract\\n sources: function(resolve) {\\n var star = resolve(sources.join(',')),\\n inactive = resolve('inactive').map(function(id) {\\n return id.substring(0, id.length - 6);\\n });\\n inactive.forEach(function(id) {\\n var position = star.indexOf(id);\\n if (position >= 0) {\\n star.splice(position, 1);\\n }\\n });\\n return star.join(',');\\n },\\n derivation: function(sources) {\\n if (sources) {\\n return sources.stack().all();\\n } else {\\n return [];\\n }\\n }\\n }];\\n g.data().add(dataSources);\\n }\",\n \"title\": \"\"\n }\n]"},"negative_passages":{"kind":"list like","value":[{"docid":"bc2b9dcf329134578f2afa72d9c353d3","score":"0.56309956","text":"resetStacks() {\n objectEach(this.stacks, (type) => {\n objectEach(type, (stack, x) => {\n // Clean up memory after point deletion (#1044, #4320)\n if (isNumber(stack.touched) &&\n stack.touched < this.stacksTouched) {\n stack.destroy();\n delete type[x];\n // Reset stacks\n }\n else {\n stack.total = null;\n stack.cumulative = null;\n }\n });\n });\n }","title":""},{"docid":"16c282015c56cdedc7efd442d65ab30d","score":"0.554261","text":"buildStacks() {\n const stacking = this;\n const axis = stacking.axis;\n const axisSeries = axis.series;\n const reversedStacks = axis.options.reversedStacks;\n const len = axisSeries.length;\n let actualSeries, i;\n stacking.usePercentage = false;\n i = len;\n while (i--) {\n actualSeries = axisSeries[reversedStacks ? i : len - i - 1];\n actualSeries.setStackedPoints();\n actualSeries.setGroupedPoints();\n }\n // Loop up again to compute percent and stream stack\n for (i = 0; i < len; i++) {\n axisSeries[i].modifyStacks();\n }\n fireEvent(axis, 'afterBuildStacks');\n }","title":""},{"docid":"a1a803368ccc26f0120b36431102a631","score":"0.54610616","text":"function resetData(){\n\t\tprePosition.clear();\n\t\tnodeData.forEach(function(d){\n\t\t\tprePosition.set(d.id, {\n\t\t\t\tx : d.x,\n\t\t\t\ty : d.y,\n\t\t\t})\n\t\t})\n\t}","title":""},{"docid":"521e06e78775cb1f84c8ae5a93068eba","score":"0.5458053","text":"onDataSet(data) {\n if (!this.hasProps || !(data === null || data === void 0 ? void 0 : data.source) || !data.source.length) {\n return;\n }\n const source = data.source.filter(s => !isGrouping(s));\n const expanded = this.revogrid.grouping || {};\n const { sourceWithGroups, depth, trimmed, oldNewIndexMap, childrenByGroup } = gatherGrouping(source, \n // filter\n item => { var _a; return (_a = this.options) === null || _a === void 0 ? void 0 : _a.props.map(key => item[key]); }, Object.assign({}, (expanded || {})));\n data.source = sourceWithGroups;\n this.providers.dataProvider.setGrouping({ depth });\n this.updateTrimmed(trimmed, childrenByGroup, oldNewIndexMap);\n }","title":""},{"docid":"3a99b6e73fec6d99aae10ff922d4cd4e","score":"0.5412136","text":"ssrHydrationPrep() {\n this.nodesToKeep = [];\n\n this.ssrKeep.forEach(item => {\n while (item.firstChild) {\n this.nodesToKeep.push(item.firstChild); // track the nodes that will be preserved\n this.appendChild(item.firstChild);\n }\n });\n\n // Remove all children not in the \"keep\" array\n Array.from(this.children)\n .filter(item => !this.nodesToKeep.includes(item))\n .forEach(node => {\n node.parentElement.removeChild(node);\n });\n\n this.ssrPrepped = true;\n }","title":""},{"docid":"f0f6c9dd8b2558cffc0981813deec542","score":"0.52900964","text":"function optimizeDataflow(dataComponent) {\n var roots = util_1.vals(dataComponent.sources);\n roots.forEach(removeUnnecessaryNodes);\n // remove source nodes that don't have any children because they also don't have output nodes\n roots = roots.filter(function (r) { return r.numChildren() > 0; });\n getLeaves(roots).forEach(optimizers.iterateFromLeaves(optimizers.removeUnusedSubtrees));\n roots = roots.filter(function (r) { return r.numChildren() > 0; });\n getLeaves(roots).forEach(optimizers.iterateFromLeaves(optimizers.moveParseUp));\n getLeaves(roots).forEach(optimizers.removeDuplicateTimeUnits);\n roots.forEach(moveFacetDown);\n util_1.keys(dataComponent.sources).forEach(function (s) {\n if (dataComponent.sources[s].numChildren() === 0) {\n delete dataComponent.sources[s];\n }\n });\n}","title":""},{"docid":"d14e9b6e26c7a77a51f0529a3a90c521","score":"0.5274012","text":"function resetData() {\n points = [];\n normalizedPoints = [];\n if (pointGroup !== null) {\n pointGroup.removeChildren();\n }\n if (infoGroup !== null) {\n infoGroup.removeChildren();\n }\n }","title":""},{"docid":"d1bdf38456acfb10ef32a3584aa8765c","score":"0.5228955","text":"doSourceUpdate(options) {\n if (!this.hasProps) {\n return;\n }\n /**\n * Get source without grouping\n * @param newOldIndexMap - provides us mapping with new indexes vs old indexes, we would use it for trimmed mapping\n */\n const { source, prevExpanded, oldNewIndexes } = this.getSource(true);\n /**\n * Group again\n * @param oldNewIndexMap - provides us mapping with new indexes vs old indexes\n */\n const { sourceWithGroups, depth, trimmed, oldNewIndexMap, childrenByGroup } = gatherGrouping(source, \n // filter\n item => { var _a; return (_a = this.options) === null || _a === void 0 ? void 0 : _a.props.map(key => item[key]); }, Object.assign({ prevExpanded }, options));\n // setup source\n this.providers.dataProvider.setData(sourceWithGroups, GROUPING_ROW_TYPE, { depth }, true);\n this.updateTrimmed(trimmed, childrenByGroup, oldNewIndexes, oldNewIndexMap);\n }","title":""},{"docid":"7a43aa4044d92e19571fd71357460002","score":"0.51741797","text":"function seriesModifyStacks() {\n const series = this, yAxis = series.yAxis, stackKey = series.stackKey, stacks = yAxis.stacking.stacks, processedXData = series.processedXData, stacking = series.options.stacking, stacker = series[stacking + 'Stacker'];\n let stackIndicator;\n if (stacker) { // Modifier function exists (Series.percentStacker etc.)\n [stackKey, '-' + stackKey].forEach((key) => {\n let i = processedXData.length, x, stack, pointExtremes;\n while (i--) {\n x = processedXData[i];\n stackIndicator = series.getStackIndicator(stackIndicator, x, series.index, key);\n stack = stacks[key] && stacks[key][x];\n pointExtremes =\n stack && stack.points[stackIndicator.key];\n if (pointExtremes) {\n stacker.call(series, pointExtremes, stack, i);\n }\n }\n });\n }\n }","title":""},{"docid":"2460b30f7804802c08987e6395069f6e","score":"0.5138678","text":"SeedForSrcAndTar() {\r\n let groMinLab = [];\r\n let groLab = [];\r\n let labCnt = 0;\r\n\r\n let groMinLabTar = [];\r\n let groLabTar = [];\r\n let labCntTar = 0;\r\n\r\n let paramLabelingBlob = {\r\n width: this.imgWidth,\r\n height: this.imgHeight,\r\n srcdata: this.src,\r\n data: undefined,\r\n label: this.srcLab,\r\n groupMinLab: groMinLab,\r\n groupLab: groLab,\r\n curLabCnt: labCnt\r\n };\r\n\r\n // Labeling Blobs for src\r\n LabelingBlobs(paramLabelingBlob);\r\n\r\n let paramLabelingBlobTar = {\r\n width: this.imgWidth,\r\n height: this.imgHeight,\r\n srcdata: this.tar,\r\n data: undefined,\r\n label: this.tarLab,\r\n groupMinLab: groMinLabTar,\r\n groupLab: groLabTar,\r\n curLabCnt: labCntTar\r\n };\r\n\r\n LabelingBlobs(paramLabelingBlobTar);\r\n\r\n //\r\n let finalGroupSrcCnt = 0;\r\n let finalGroupTarCnt = 0;\r\n\r\n for (let i = 0; i < paramLabelingBlob.groupMinLab.length; i++) {\r\n if ((paramLabelingBlob.groupMinLab[i] + 1) > finalGroupSrcCnt) {\r\n finalGroupSrcCnt = (paramLabelingBlob.groupMinLab[i] + 1);\r\n }\r\n }\r\n // console.log(paramLabelingBlob)\r\n\r\n for (let i = 0; i < paramLabelingBlobTar.groupMinLab.length; i++) {\r\n if ((paramLabelingBlobTar.groupMinLab[i] + 1) > finalGroupTarCnt) {\r\n finalGroupTarCnt = (paramLabelingBlobTar.groupMinLab[i] + 1);\r\n }\r\n }\r\n\r\n // 0: index\r\n // 1: highest density value\r\n // 2: sum density value\r\n // 3: minx\r\n // 4: maxx\r\n // 5: miny\r\n // 6: maxy\r\n let highestPixelInfoSrc = new Array(finalGroupSrcCnt * 8);\r\n let highestPixelInfoTar = new Array(finalGroupTarCnt * 8);\r\n\r\n // First: Index; Second: Value\r\n for (let i = 0; i < finalGroupSrcCnt; i++) {\r\n highestPixelInfoSrc[i * 8] = 0;\r\n highestPixelInfoSrc[i * 8 + 1] = 0;\r\n highestPixelInfoSrc[i * 8 + 2] = 0;\r\n highestPixelInfoSrc[i * 8 + 3] = this.imgWidth;\r\n highestPixelInfoSrc[i * 8 + 4] = 0;\r\n highestPixelInfoSrc[i * 8 + 5] = this.imgHeight;\r\n highestPixelInfoSrc[i * 8 + 6] = 0;\r\n highestPixelInfoSrc[i * 8 + 7] = undefined;\r\n }\r\n\r\n for (let i = 0; i < finalGroupTarCnt; i++) {\r\n highestPixelInfoTar[i * 8] = 0;\r\n highestPixelInfoTar[i * 8 + 1] = 0;\r\n highestPixelInfoTar[i * 8 + 2] = 0;\r\n highestPixelInfoTar[i * 8 + 3] = this.imgWidth;\r\n highestPixelInfoTar[i * 8 + 4] = 0;\r\n highestPixelInfoTar[i * 8 + 5] = this.imgHeight;\r\n highestPixelInfoTar[i * 8 + 6] = 0;\r\n highestPixelInfoTar[i * 8 + 7] = undefined;\r\n\r\n }\r\n\r\n let index = 0;\r\n for (let i = 0; i < this.imgHeight; i++)\r\n for (let j = 0; j < this.imgWidth; j++) {\r\n if (paramLabelingBlob.label[index] >= 0) {\r\n if (j < highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 3])\r\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 3] = j;\r\n if (j > highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 4])\r\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 4] = j;\r\n if (i < highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 5])\r\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 5] = i;\r\n if (i > highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 6])\r\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 6] = i;\r\n\r\n if (highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 1] < src[index]) {\r\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8] = index;\r\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 1] = src[index];\r\n }\r\n\r\n if (src[index] > 0.4)\r\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 2] += 1; //src[index];\r\n }\r\n\r\n if (paramLabelingBlobTar.label[index] >= 0) {\r\n if (j < highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 3])\r\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 3] = j;\r\n if (j > highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 4])\r\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 4] = j;\r\n if (i < highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 5])\r\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 5] = i;\r\n if (i > highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 6])\r\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 6] = i;\r\n\r\n if (highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 1] < this.tar[index]) {\r\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8] = index;\r\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 1] = this.tar[index];\r\n }\r\n\r\n if (tar[index] > 0.4)\r\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 2] += 1; //tar[index];\r\n }\r\n index++;\r\n }\r\n\r\n // Highest pixels from src to tar\r\n for (let i = 0; i < finalGroupSrcCnt; i++) {\r\n this.tar[highestPixelInfoSrc[i * 8]] = highestPixelInfoSrc[i * 8 + 1];\r\n }\r\n // console.log(highestPixelInfoSrc)\r\n // Highest pixels from tar to src\r\n for (let i = 0; i < finalGroupTarCnt; i++) {\r\n this.src[highestPixelInfoTar[i * 8]] = highestPixelInfoTar[i * 8 + 1];\r\n }\r\n }","title":""},{"docid":"12f6e643f787460f11b334c8897c640c","score":"0.51313883","text":"_prepareItems(data) {\n // Initialize containers.\n const talents = [];\n\n // Iterate through items, allocating to containers\n for (let i of data.items) {\n let item = i.data;\n // Append to gear.\n if (i.type === 'talent') {\n talents.push(i);\n }\n }\n\n // Assign and return\n data.talents = talents;\n\n const agendas = [];\n\n // Iterate through items, allocating to containers\n for (let i of data.items) {\n let item = i.data;\n // Append to gear.\n if (i.type === 'agenda') {\n agendas.push(i);\n }\n }\n\n // Assign and return\n data.agendas = agendas;\n\n // Categorize items as inventory, spellbook, features, and classes\n const inventory = {\n weapon: { label: 'Weapons', items: [], dataset: { type: 'weapon' } },\n item: { label: 'Items', items: [], dataset: { type: 'item' } },\n armor: { label: 'Armor', items: [], dataset: { type: 'armor' } },\n };\n // Partition items by category\n let [items, spells, feats, classes, talent] = data.items.reduce(\n (arr, item) => {\n // Item details\n item.img = item.img || DEFAULT_TOKEN;\n item.isStack = item.data.quantity ? item.data.quantity > 1 : false;\n\n // Classify items into types\n // console.log('alienrpgActorSheet -> _prepareItems -> item', item);\n // if (item.type === 'talent') arr[1].push(item);\n // else if (item.type === 'feat') arr[2].push(item);\n // else if (item.type === 'feature') arr[3].push(item);\n if (Object.keys(inventory).includes(item.type)) arr[0].push(item);\n return arr;\n },\n [[], [], [], []]\n );\n\n // Apply active item filters\n items = this._filterItems(items, this._filters.inventory);\n\n // Organize Inventory\n let totalWeight = 0;\n for (let i of items) {\n if (i.type == 'weapon') {\n // console.log('alienrpgActorSheet -> Organize Inventory', i);\n let ammoweight = 0.25;\n if (i.data.attributes.class.value == 'RPG' || i.name.includes(' RPG ') || i.name.startsWith('RPG') || i.name.endsWith('RPG')) {\n ammoweight = 0.5;\n }\n\n i.data.attributes.weight.value = i.data.attributes.weight.value || 0;\n i.totalWeight = i.data.attributes.weight.value + i.data.attributes.rounds.value * ammoweight;\n inventory[i.type].items.push(i);\n\n totalWeight += i.totalWeight;\n } else if (i.type != 'talent') {\n i.data.attributes.weight.value = i.data.attributes.weight.value || 0;\n i.totalWeight = i.data.attributes.weight.value;\n inventory[i.type].items.push(i);\n totalWeight += i.totalWeight;\n }\n }\n\n data.data.general.encumbrance = this._computeEncumbrance(totalWeight, data);\n // this._computeHealth(data);\n // Assign and return\n data.inventory = Object.values(inventory);\n }","title":""},{"docid":"8cf3402decd5186cc1ce3cf1f3c62993","score":"0.5119833","text":"repositionX() {\n // should be implemented by the item\n }","title":""},{"docid":"07152279a5921738808a742469592ca0","score":"0.51073855","text":"function resetFlowchartTooltips() {\n // Clear any existing d3-tip divs\n d3.selectAll(\".d3-tip\").remove();\n // Call the function on the flowchart svg again to add a new (default hidden) d3-tip div\n flowChart.svg.call(flowChart.tip);\n}","title":""},{"docid":"ef0d7c804a0762d5a3c4d1d571d65188","score":"0.5102389","text":"function assembleData(dataCompomponent) {\n var roots = util_1.vals(dataCompomponent.sources);\n var data = [];\n roots.forEach(removeUnnecessaryNodes);\n // remove source nodes that don't have any children because they also don't have output nodes\n roots = roots.filter(function (r) { return r.numChildren() > 0; });\n getLeaves(roots).forEach(optimizers_1.iterateFromLeaves(optimizers.removeUnusedSubtrees));\n roots = roots.filter(function (r) { return r.numChildren() > 0; });\n getLeaves(roots).forEach(optimizers_1.iterateFromLeaves(optimizers.moveParseUp));\n roots.forEach(moveFacetDown);\n // roots.forEach(debug);\n var walkTree = makeWalkTree(data);\n var sourceIndex = 0;\n roots.forEach(function (root) {\n // assign a name if the source does not have a name yet\n if (!root.hasName()) {\n root.dataName = \"source_\" + sourceIndex++;\n }\n var newData = root.assemble();\n walkTree(root, newData);\n });\n // remove empty transform arrays for cleaner output\n data.forEach(function (d) {\n if (d.transform.length === 0) {\n delete d.transform;\n }\n });\n // move sources without transforms (the ones that are potentially used in lookups) to the beginning\n data.sort(function (a, b) { return (a.transform || []).length === 0 ? -1 : ((b.transform || []).length === 0 ? 1 : 0); });\n // now fix the from references in lookup transforms\n for (var _i = 0, data_2 = data; _i < data_2.length; _i++) {\n var d = data_2[_i];\n for (var _a = 0, _b = d.transform || []; _a < _b.length; _a++) {\n var t = _b[_a];\n if (t.type === 'lookup') {\n t.from = dataCompomponent.outputNodes[t.from].source;\n }\n }\n }\n return data;\n}","title":""},{"docid":"3ac5e563aa300aa625850b5d3a45f0d2","score":"0.5046708","text":"resetItems() {\n // Remove refs to current items.\n this._disposeItems(this.items);\n this.isInitialized = false;\n\n // Find new items in the DOM.\n this.items = this._getItems();\n\n // Set initial styles on the new items.\n this._initItems(this.items);\n\n this.once(Shuffle.EventType.LAYOUT, () => {\n // Add transition to each item.\n this.setItemTransitions(this.items);\n this.isInitialized = true;\n });\n\n // Lay out all items.\n this.filter(this.lastFilter);\n }","title":""},{"docid":"fc6e21a8b4fc229b2b983360937a068f","score":"0.5030189","text":"function augment(trace) {\n\tlet ts = ''; let path;\n\tif (trace) {\n\t\tlet p = trees.findpath(g.source); let s = '';\n\t\tfor (let u = trees.first(p); u; u = trees.next(u)) {\n\t\t\tif (s) s += ' ';\n\t\t\ts += g.x2s(u);\n\t\t\tif (trees.next(u)) s += ':' + trees.cost(u);\n\t\t}\n\t\tts += s;\n\t}\n\n\t// effectively saturate source/sink path by adjusting costs\n\tlet [u,rcap] = trees.findcost(g.source);\n\ttrees.addcost(g.source, -rcap);\n\n\t// now, remove tree edges with zero residual capacity\n\t// and saturate corresponding flow graph edges\n\tlet c; [u,c] = trees.findcost(g.source);\n\twhile (c == 0) {\n\t\tsteps++;\n\t\tlet e = upEdge[u]; \n\t\tif (e) { prune(u); nextEdge[u] = g.nextAt(u, e); }\n\t\t[u,c] = trees.findcost(g.source);\n\t}\n\treturn [rcap, ts];\n}","title":""},{"docid":"6cc66f88e06223ce04a85acd9d1978e8","score":"0.50130117","text":"propagate_data() {\n Object.assign(this.data, this.style.data);\n for (let n of this.content) {\n n.data = {};\n Object.assign(n.data, this.data);\n n.propagate_data();\n }\n }","title":""},{"docid":"ef5faddb9ec90d3ecc8bacccac05da95","score":"0.5004317","text":"_moveSeriesToFrontAll() {\n const len = this.groupPaths ? this.groupPaths.length : 0;\n for (let i = 0; i < len; i += 1) {\n this.moveSeriesToFront(this.groupAreas[i], this.groupDots[i]);\n }\n }","title":""},{"docid":"615ad92892a405d3245a4b4fa0d396c3","score":"0.4998873","text":"function cleanDataPointHighlights() {\n verticalMarkerContainer.selectAll('.circle-container').remove();\n }","title":""},{"docid":"64ee121332fa07165c778c4859b8eb4f","score":"0.4994484","text":"removeFront() {\n this._targets.splice(0, 1);\n }","title":""},{"docid":"6ef4f577945f912019bd21fcb033afd4","score":"0.4993363","text":"function drawSdrStack() {\n $stack.html('');\n _.each(sdrStack, function(sdr, i) {\n var sdrId = 'sdr-' + i;\n $stack.prepend(\n '}, not undefined to avoid if...else... statement\n\npoint=!isNaN(x)&&!isNaN(y)&&coordSys.dataToPoint(tmpIn,null,tmpOut);\n}\n\nif(isLargeRender){\npoints[offset++]=point?point[0]:NaN;\npoints[offset++]=point?point[1]:NaN;\n}else {\ndata.setItemLayout(i,point&&point.slice()||[NaN,NaN]);\n}\n}\n\nisLargeRender&&data.setLayout('symbolPoints',points);\n}\n\nreturn dimLen&&{\nprogress:progress};\n\n}};\n\n}","title":""},{"docid":"e1eebfdc767dfaa0c158d49a1857a8de","score":"0.47782004","text":"function spaceU() {\n a.dropEdges();\n a.dropNodes();\n s.refresh({skipIndexation: true});\n }","title":""},{"docid":"9cacea38af284419dc335fc7b4b1d9f4","score":"0.47779045","text":"function startdrop() {\r\n document.getElementById(\"dataset\").ondragover = function (ev) {\r\n ev.preventDefault();\r\n }\r\n\r\n // change datasets/overlays order\r\n document.getElementById(\"dataset\").ondrop = function (ev) {\r\n var name = ev.dataTransfer.getData(\"text\");\r\n\t\t//console.log(name);\r\n var list = document.getElementById(\"dataset\").childNodes;\r\n var place = ev.clientY;\r\n var dragged;\r\n var i;\r\n for (i = 0; i < list.length; i++) {\r\n if (list[i].title == name) {\r\n dragged = list[i];\r\n }\r\n }\r\n\r\n if (place < list[0].getBoundingClientRect().y + 5) {\r\n $(\"#dataset\").prepend(dragged);\r\n }else {\r\n for (i = 0; i < list.length; i++) {\r\n if (place > list[i].getBoundingClientRect().y + 5) {\r\n list[i].after(dragged);\r\n }\r\n }\r\n }\r\n\t\tlist = document.getElementById(\"dataset\").childNodes;\r\n for (i = 0; i < list.length; i++) {\r\n //console.log(list[i].title);\r\n temp = findUse(list[i].title)\r\n\t\t\tmap_buffer[list[i].title].setStyle({\r\n icon: customizePoint(temp),\r\n strokeWeight: 1,\r\n strokeColor: legend_buffer[list[i].title],\r\n fillColor: legend_buffer[list[i].title],\r\n zIndex: list.length - i - 1,\r\n });\r\n }\r\n };\r\n \r\n}","title":""},{"docid":"60bd992c39e8f57c3be5b8e40ee2f6e0","score":"0.47731918","text":"function stackClear() {\n this.__data__ = {\n 'array': [],\n 'map': null\n };\n }","title":""},{"docid":"f7d7eae1c49c7aa3fef2c56c4d62b601","score":"0.47719276","text":"function adjust_children_positioning(nestedData, num_of_timepoints, measure) {\n for (var i = 0; i < nestedData.length; i++) {\n var parent_index = nestedData[i].parent_index_of_this;\n //Added || != 'none' to satisfy fishplot editor (Had to add separate if statement for some reason??)\n //All fishplots that havent been placed down yet have a parent_index of 'none'\n //This is so I can do the collision prevention for the children that are already plotted\n if (parent_index != \"plot\") {\n if (parent_index != \"none\") {\n var parent = nestedData[parent_index];\n var children = parent.children;\n var start_point = parent.start_point;\n //Potentially include an && the children has not already been checked\n //If parent has 2+ children, then the loop below will have taken care of those children already\n if (children.length != 0) {\n for (var j = 0; j < children.length; j++) {\n var child = nestedData[children[j]];\n for (var k = 0; k < child.values.length; k++) {\n var start_point_space = parent.values[k][measure] / children.length;\n var start_point_base = start_point_space / 2;\n child.start_point = start_point_base + (start_point_space * j) + parent.values[k].bottom;\n child.values[k].start_point = child.start_point;\n if ((child.start_point - child.values[k][measure] / 2) < parent.values[k].bottom) {\n child.values[k].bottom = parent.values[k].bottom;\n child.values[k].top = child.values[k].bottom + child.values[k][measure];\n }\n else if (( child.start_point + child.values[k][measure] / 2) > parent.values[k].top) {\n child.values[k].top = parent.values[k].top;\n child.values[k].bottom = child.values[k].top - child.values[k][measure];\n }\n else {\n child.values[k].top = (child.start_point + child.values[k][measure] / 2);\n child.values[k].bottom = (child.start_point - child.values[k][measure] / 2);\n }\n }\n child.start_point = child.values[0].bottom;\n }\n for (var j = 0; j < num_of_timepoints + 1; j++) {\n nestedData = collision_detection(nestedData, children, j, parent.values[j].bottom, parent.values[j].top, measure);\n }\n }\n }\n }\n }\n return nestedData;\n }","title":""},{"docid":"0df1cef4afef8c4fbf5cfc67e7fc6c10","score":"0.47551173","text":"function realignStack() {\n //Iterate through each column\n\n for (var i = 0; i < 840; i+= 60) {\n //Get column\n var col = stack.children.entries.filter(child => child.x == i)\n col.sort(function(a, b){return b.y - a.y});\n //console.log(\"This is the stack of poo\");\n //stack.children.entries.forEach(child => console.log(child.y));\n //Set the current column\n var currcol = 0;\n var end = false;\n //Iterate through gaps\n for(var j = 540; j > 60; j-= 60) {\n if(col.length > 0 && !end) {\n //Check next sprite is not adjacent\n if(!(j == col[currcol].y )) {\n //if(!(j + 20 >= col[currcol].body.y && j - 20 <= col[currcol].body.y)) {\n //Gap detected\n console.log(j);\n console.log(col[currcol].y);\n alert(\"GAP DETECTED\");\n //Move tile down\n stack.create(col[currcol].body.x+30, col[currcol].body.y+90, col[currcol].texture);\n col[currcol].destroy();\n currcol++;\n } else {\n currcol++;\n }\n //Control\n if(currcol == col.length) {\n end = true;\n }\n }\n }\n //Change the collision domain\n brick.children.each(child => child.body.setSize(50,60,29));\n }\n}","title":""},{"docid":"db6c97ecd682694ad083057a99af02c4","score":"0.47515732","text":"function loadStackedBars(error, data, fromMenu, sorting) {\n console.log(\"loadStackedBars\");\n console.log(data);\n existingData = data;\n d3.select(\"#stackedBars\").selectAll(\"g\").remove();\n var sortingData = existingData[stat];\n var minGD = Number.MAX_SAFE_INTEGER;\n for(i=0; i bTotal) {\n return 1;\n }\n } else if(sorting === 2) {\n if (aTotal > bTotal) {\n return -1;\n }\n if (aTotal < bTotal) {\n return 1;\n }\n }\n\n\n return 0;\n }\n\n\n\n if(sorting != 0) {\n sortingData = existingData[stat].slice();\n sortingData = sortingData.sort(compareFunc);\n console.log(\"Sorted data: \");\n console.log(sortingData);\n }\n\n var n = params.length, // The number of series.\n m = data[stat].length; // The number of values per series.\n\n // The xz array has m elements, representing the x-values shared by all series.\n // The yz array has n elements, representing the y-values of each of the n series.\n // Each yz[i] is an array of m non-negative numbers representing a y-value for xz[i].\n // The y01z array has the same structure as yz, but with stacked [y₀, y₁] instead of y.\n var xz = d3.range(m),\n yz = d3.range(n).map(function(i) { return getSelectedData(m, params[i]); }),\n y01z = d3.stack().keys(d3.range(n))(d3.transpose(yz)),\n yMax = d3.max(yz, function(y) { return d3.max(y); }),\n y1Max = d3.max(y01z, function(y) { return d3.max(y, function(d) { return d[1]; }); });\n\n var svg = d3.select(\"#stackedBars\"),\n margin = {top: 40, right: 10, bottom: 20, left: 10},\n width = +svg.attr(\"width\") - margin.left - margin.right,\n height = +svg.attr(\"height\") - margin.top - margin.bottom,\n g = svg.append(\"g\").attr(\"transform\", \"translate(\" + margin.left + \",\" + margin.top + \")\");\n\n var x = d3.scaleBand()\n .domain(xz)\n .rangeRound([0, width])\n .padding(0.08);\n\n var y = d3.scaleLinear()\n .domain([0, y1Max + 100])\n .range([height, 0]);\n\n var color = d3.scaleOrdinal()\n .domain(d3.range(n))\n .range(d3.schemeSet2);\n\n var series = g.selectAll(\".series\")\n .data(y01z)\n .enter().append(\"g\")\n .attr(\"fill\", function(d, i) { return color(i); });\n\n var rect = series.selectAll(\"rect\")\n .data(function(d) { return d; })\n .enter().append(\"rect\")\n .attr(\"x\", function(d, i) { return x(i); })\n .attr(\"y\", height)\n .attr(\"width\", x.bandwidth())\n .attr(\"height\", 0);\n\n rect.transition()\n .delay(function(d, i) { return i * 10; })\n .attr(\"y\", function(d) { return y(d[1]); })\n .attr(\"height\", function(d) { return y(d[0]) - y(d[1]); });\n\n g.append(\"g\")\n .attr(\"class\", \"axis axis--x\")\n .attr(\"transform\", \"translate(0,\" + height + \")\")\n .call(d3.axisBottom(x)\n .tickSize(0)\n .tickFormat(function(d,i){ return sortingData[i].short_name;})\n .tickPadding(6));\n\n\n d3.selectAll(\"input\")\n .on(\"change\", changed);\n svg.call(d3.drag().on(\"start\", dragStart).on(\"end\", dragEnd));\n\n if (fromMenu) {\n var timeout = d3.timeout(function() {\n d3.select(\"input[value=\\\"grouped\\\"]\")\n .property(\"checked\", true)\n .dispatch(\"change\");\n }, 2000);\n } else {\n var timeout = d3.timeout(function() {\n d3.select(\"input[value=\\\"grouped\\\"]\")\n .property(\"checked\", true)\n .dispatch(\"change\");\n }, 200);\n }\n\n\n function changed() {\n if(fromMenu)\n timeout.stop();\n if (this.value === \"grouped\") transitionGrouped();\n else transitionStacked();\n }\n\n function transitionGrouped() {\n y.domain([0, yMax]);\n\n rect.transition()\n .duration(500)\n .delay(function(d, i) { return i * 10; })\n .attr(\"x\", function(d, i) { return x(i) + x.bandwidth() / n * this.parentNode.__data__.key; })\n .attr(\"width\", x.bandwidth() / n)\n .transition()\n .attr(\"y\", function(d) { return y(d[1] - d[0]); })\n .attr(\"height\", function(d) { return y(0) - y(d[1] - d[0]); });\n }\n\n function transitionStacked() {\n y.domain([0, y1Max]);\n\n rect.transition()\n .duration(500)\n .delay(function(d, i) { return i * 10; })\n .attr(\"y\", function(d) { return y(d[1]); })\n .attr(\"height\", function(d) { return y(d[0]) - y(d[1]); })\n .transition()\n .attr(\"x\", function(d, i) { return x(i); })\n .attr(\"width\", x.bandwidth());\n }\n\n\n function getSelectedData(m, param) {\n\n var values = [];\n console.log(\"Param name: \" + param);\n\n\n for (i = 0; i < m; ++i) {\n if(param === \"Pos\")\n values[i] = 21 - sortingData[i][param]; //position 1 should have the biggest bar\n else if(param === \"GD\")\n values[i] = sortingData[i][param] + Math.abs(minGD);\n else\n values[i] = sortingData[i][param];\n }\n console.log(\"Values: \" + values);\n return values;\n }\n\n\n // add legend\nconsole.log(\"add legend\");\nvar legend = svg.append(\"g\")\n .attr(\"class\", \"legend\")\n .attr(\"x\", margin.left)\n .attr(\"y\", margin.top)\n .attr(\"height\", 100)\n .attr(\"width\", 100);\n\nlegend.selectAll('g').data(params)\n .enter()\n .append('g')\n .each(function (d, i) {\n var g = d3.select(this);\n g.append(\"rect\")\n .attr(\"x\", margin.left + i * 100)\n .attr(\"y\", margin.top)\n .attr(\"width\", 10)\n .attr(\"height\", 10)\n // .style(\"fill\", color_hash[String(i)][1]);\n .style(\"fill\", color(i));\n\n g.append(\"text\")\n .attr(\"x\", margin.left + i * 100 + 15)\n .attr(\"y\", margin.top + 8)\n .attr(\"height\", 30)\n .attr(\"width\", 100)\n // .style(\"fill\", color_hash[String(i)][1])\n .style(\"fill\", color(i))\n .text(params[i]);\n\n });\n\n}","title":""},{"docid":"eb2a9be4ce3da96ed1dea68068911fa2","score":"0.4744264","text":"generateItems() {\n const itemFunc = this.state.itemFunc;\n const maxValue = this.state.maxValue;\n const conf = {\n func: itemFunc, maxValue,\n itemsPerLevel: this.state.numEntities\n };\n const level = this.state.level;\n\n // Remove existing items first\n const items = level.getItems();\n items.forEach(item => {\n level.removeItem(item, item.getX(), item.getY());\n });\n\n RG.FACT.addNRandItems(level, this.parser, conf);\n this.setStateWithLevel(level);\n }","title":""},{"docid":"6ed23986a357cee01e2a8cb6dde6f9e9","score":"0.47374883","text":"_cleanChart() {\n select(this.node).selectAll('*').remove();\n select(this.node.parentNode).select('div').remove();\n }","title":""},{"docid":"2cebee8a90519d5f3ae394a75109ca00","score":"0.47296157","text":"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","title":""},{"docid":"2cebee8a90519d5f3ae394a75109ca00","score":"0.47296157","text":"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n }","title":""},{"docid":"e130af3fbcbd21ea024b34046184a795","score":"0.4722191","text":"removeFluid() {\n ArrayScraper.scrape(this.fluidGrid, (asset) => {\n if(asset === null) return;\n asset.fluid = false;\n asset.fluidA = asset.fluidA ? false : null;\n asset.fluidB = asset.fluidB ? false : null;\n asset.fluidC = asset.fluidC ? false : null;\n });\n }","title":""},{"docid":"2a14648cd4d1331903aa283cb938bad7","score":"0.472085","text":"function transitionStacked() {\n updateStack();\n\n bar.selectAll(\"rect\").transition()\n .duration(300)\n .delay(function(d, i) { return i * 10; })\n .attr(\"transform\", function(d) { return \"translate(\" + main_x1(x0Value(d)) + \",0)\"; })\n .attr(\"width\", function(d) { return main_x0.rangeBand(); })\n .attr(\"x\", function(d) { return main_x0(x0Value(d)); })\n .transition()\n .attr(\"y\", function(d) { return main_y(d.y1); })\n .attr(\"height\", function(d) { return main_y(d.y0) - main_y(d.y1); });\n\n mini_bar.selectAll(\"rect\").transition()\n .duration(300)\n .delay(function(d, i) { return i * 10; })\n .attr(\"transform\", function(d) { return \"translate(\" + mini_x1(x0Value(d)) + \",0)\"; })\n .attr(\"width\", function(d) { return mini_x0.rangeBand(); })\n .attr(\"x\", function(d) { return mini_x0(x0Value(d)); })\n .transition()\n .attr(\"y\", function(d) { return mini_y(d.y1); })\n .attr(\"height\", function(d) { return mini_y(d.y0) - mini_y(d.y1); });\n }","title":""},{"docid":"2603b3e059ec794b49a37abc1c0f9c19","score":"0.4715857","text":"function getNodesByImpact() {\n \n //console.log(\"begin compute values for stacked chart\");\n\n var nbTopElts = 5;\n listOfRelativeImportances = [];\n \n netCopy = getListNodesRefsSorted();\n var fiveMostInfluential = [];\n //found the 5 most influential works\n var mostInfluential = netCopy.slice(0,nbTopElts);\n \n //init everything to 0\n for(var i = 0 ; i < nbTopElts+1; i ++){\n listOfRelativeImportances.push([]);\n \n for(var j = 0;j < nbStepsForTools+1; j++){\n listOfRelativeImportances[i].push(0);\n }\n }\n \n var listOfnodesAlreadyDone = [];\n //for each of the top influential node\n for(var el = 0 ; el < mostInfluential.length; el++){\n var nodeStudied = mostInfluential[el];\n for(var fol = 0 ; fol < nodeStudied.refBy.length;fol++){\n var folNode = nodeStudied.refBy[fol];\n var indexToIncrement = Math.round(scaleScalingFromDate(folNode.date));\n \n listOfRelativeImportances[el][indexToIncrement]++;\n listOfnodesAlreadyDone.push(folNode);\n }\n }\n //console.log(\"topNodesValues added\");\n\n for(key in network){\n var thisNode = network[key];\n if (listOfnodesAlreadyDone.indexOf(thisNode)==-1) {\n var indexToIncrement = Math.round(scaleScalingFromDate(thisNode.date));\n listOfRelativeImportances[listOfRelativeImportances.length-1][indexToIncrement]++;\n }\n \n }\n \n // console.log(\"finished to compute values for stack\");\n\n // console.log(listOfRelativeImportances);\n\n return listOfRelativeImportances;\n \n}","title":""},{"docid":"ffc652595d1b74d8ff86a77f0c64c2c6","score":"0.47152665","text":"setFormattedResources() {\n let children = [];\n let items = [];\n this.props.resources.forEach(item => {\n let formattedItem = this.formatItem(item);\n if (item.parentUuid == null) items.push(formattedItem);\n else children.push(formattedItem);\n });\n\n // searches parentItemsArray for a parent. if found, returns new parent array with child added, and removes child from the \"children\" array defined above\n let insertIntoParent = (child, childIndex, parentItemsArray) => {\n //parse nested array structure of items and find parent, insert child where appropriate\n parentItemsArray.forEach((parentItem, parentIndex) => {\n if (parentItem.uuid == child.parentUuid) {\n if (!parentItem.children) parentItemsArray[parentIndex].children = [];\n parentItemsArray[parentIndex].children.push(child);\n children.splice(childIndex, 1);\n } else if (parentItem.children != null) {\n parentItemsArray[parentIndex].children = insertIntoParent(child, childIndex, parentItem.children);\n // console.log(\"going deeper\");\n }\n });\n return parentItemsArray;\n };\n\n // should never go past ~10 or so loops depending on how deeply the items are nested. num is just incase so it doesnt freze the app\n // each loop can only set 1 generation deeper. keep looping until all generations are set.\n let num = 1;\n while (children.length > 0 && num < 500) {\n num = num + 1;\n children.forEach((child, childIndex) => (items = insertIntoParent(child, childIndex, items)));\n }\n\n // use this object if root should be collapsible. otherwise just use items array\n // let data = {\n // name: \"sections\",\n // toggled: true,\n // children: items,\n // };\n this.setState({ data: items });\n }","title":""},{"docid":"0344d052d6f534012a773fc1fea8f0e7","score":"0.4705318","text":"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","title":""},{"docid":"0344d052d6f534012a773fc1fea8f0e7","score":"0.4705318","text":"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","title":""},{"docid":"0344d052d6f534012a773fc1fea8f0e7","score":"0.4705318","text":"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","title":""},{"docid":"0344d052d6f534012a773fc1fea8f0e7","score":"0.4705318","text":"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","title":""},{"docid":"0344d052d6f534012a773fc1fea8f0e7","score":"0.4705318","text":"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","title":""},{"docid":"0344d052d6f534012a773fc1fea8f0e7","score":"0.4705318","text":"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","title":""},{"docid":"0344d052d6f534012a773fc1fea8f0e7","score":"0.4705318","text":"function stackClear() {\n this.__data__ = { 'array': [], 'map': null };\n}","title":""},{"docid":"5e2832612f7a9afdf079975a7c6b993d","score":"0.46994403","text":"_initRemoveVariationButton() {\n this.removeVariationButton.addEventListener('click', event => {\n const variables = this.collectionView.dataSet.variables;\n // This button behaves differently depending on whether it is pressed on a variation or a variable definition\n // For variations, this should just remove the variation\n if (this.indexPath.object.sizeClass) {\n // Update the UI\n this.collectionView.dataSet.beginUpdates();\n variables.splice(this.indexPath.row, 1);\n this.collectionView.dataSet.commitUpdates();\n\n // And unregister the variation from the variable provider\n this.editor.layoutVariableProvider.removeVariationForLayoutVariableNamed(this.indexPath.object.name, {inSizeClass: this.indexPath.object.sizeClass});\n }\n else {\n // For variable definitions, this should unregister all size class variations and also remove the variable itself\n // TODO: Verify that the variable is not used referened and provide a warning if it is\n this.collectionView.dataSet.beginUpdates();\n for (let i = 0; i < variables.length; i++) {\n const variable = variables[i];\n if (variable.name == this.indexPath.object.name) {\n // Remove the variation or variable from the provider\n if (variable.sizeClass) {\n this.editor.layoutVariableProvider.removeVariationForLayoutVariableNamed(variable.name, {inSizeClass: variable.sizeClass});\n }\n else {\n this.editor.layoutVariableProvider.unregisterLayoutVariableNamed(variable.name);\n }\n\n // Update the UI's backing data set\n variables.splice(i, 1);\n i--;\n }\n }\n\n this.collectionView.dataSet.commitUpdates();\n }\n });\n }","title":""},{"docid":"d468464c22981ce7ad34dc928b2d8e71","score":"0.46977377","text":"prepareContent(){\n let vGap = 5;\n let rowHeight = styles.elements.fontSize + vGap;\n const MAX_HEIGHT = 500;\n let values = []; // init empty array\n let inStorage = [];\n let height = 0; // init height counter\n const { state } = this.props; // to get nodeId and state data\n\n //get data from state.stack || state.queue\n let storage = undefined;\n storage = state.stack || state.queue;\n // console.log(storage.values);\n // console.log(storage.inStack);\n if(storage){\n values = storage.values;\n height = values.length * rowHeight;\n if (height) height += vGap;\n inStorage = storage.inStorage;\n }\n return {values,inStorage,height};\n }","title":""},{"docid":"49ba3e191db6447e900626e8d911e58b","score":"0.4691019","text":"prepareTiles() {\n this.grid.eachCell(function (x, y, tile) {\n if (tile) {\n tile.mergedFrom = null;\n tile.savePosition();\n }\n });\n }","title":""},{"docid":"51740e4f2f6ff2a6e01169143a50d884","score":"0.46906242","text":"apply() {\n for (const node of this.nodesToTransform) {\n const id = this.getOrCreateId(node);\n let nodeHasBeenTransformed = false;\n for (const [attribute, transformer] of Object.entries(this.attributeTransformations)) {\n if (hasAttribute(node, attribute)) {\n try {\n nodeHasBeenTransformed = nodeHasBeenTransformed || transformer.transform(node, id);\n } catch (e) {\n this.log.debug(\n `Cannot remove boilerplate. Failed transforming ${attribute}=\"${node.attribs[attribute]}\".`,\n e\n );\n this.nodesToTransform = this.nodesToTransform.filter(\n (nodeToTransform) => nodeToTransform !== node\n );\n this.canRemoveBoilerplate = false;\n }\n }\n }\n if (nodeHasBeenTransformed) {\n node.attribs.id = id;\n this.ids.add(id);\n } else {\n this.transformedNodesCounter--;\n }\n }\n }","title":""},{"docid":"1e27f12642648966a0418bc2bfae2b51","score":"0.46904486","text":"_filterData() {\n // filter per group\n const groups = {};\n this.groups = groups;\n\n // split the items per group\n for (const item of Object.values(this.items)) {\n // put the item in the correct group\n const groupName = item.parent ? item.parent.groupId : '';\n let group = groups[groupName];\n if (!group) {\n group = [];\n groups[groupName] = group;\n }\n group.push(item);\n\n // calculate the center of the item\n if (item.data.start) {\n if (item.data.end) {\n // range\n item.center = (item.data.start.valueOf() + item.data.end.valueOf()) / 2;\n } else {\n // box, dot\n item.center = item.data.start.valueOf();\n }\n }\n }\n\n // sort the items per group\n for (let currentGroupName in groups) {\n if (groups.hasOwnProperty(currentGroupName)) {\n groups[currentGroupName].sort((a, b) => a.center - b.center);\n }\n }\n\n this.dataChanged = false;\n }","title":""},{"docid":"8fdacf6fc3b58830ca9f7381c0268842","score":"0.468871","text":"resetChart() {\n this.loadingQueue.drain();\n\n let props = this.properties;\n //extract all the props that need\n //to be passed on to each chart\n const {\n xScale,\n xAccessor,\n data,\n xExtents\n } = props;\n\n //extract start and end from extents\n let extents;\n if(typeof xExtents == \"function\") {\n extents = d3Extents(data, xExtents);\n }\n else {\n extents = xExtents;\n }\n\n const [start, end] = extents;\n let plotData = plotDataProcessor(data, xAccessor, start, end);\n\n this.xScale = xScale.copy();\n this.xScale.domain([start, end]);\n this.fullData = data;\n this.plotData = plotData; //plotData\n //console.log(this.fullData);\n this.firstItem = undefined;\n\n for(let i = 0; i < this.charts.length; i++) {\n let chart = this.charts[i];\n\n //set the x scales here\n //let { xScale } = chart.properties;;\n //xScale.domain([start, end]);\n\n chart.setProperties({\n xScale: this.xScale,\n //set extents instead of scale\n xExtents: [start, end],\n xAccessor: xAccessor,\n plotData: this.plotData,\n fullData: this.fullData\n });\n\n const { width, height } = this.properties;\n //pass them on if only one chart exists\n if(chart.properties.width == undefined) {\n chart.setProperties({\n width: width\n });\n }\n if(chart.properties.height == undefined) {\n chart.setProperties({\n height: height\n });\n }\n chart.updateScales(xAccessor, this.plotData, this.fullData);\n }\n\n //the ranges are still not set\n }","title":""},{"docid":"0f347476666f2552307198b48eef5d7c","score":"0.468705","text":"function cleanUp() {\n svg.selectAll(\".bar\").remove();\n svg.selectAll(\".x.axis\").remove();\n svg.selectAll(\".y.axis\").remove();\n }","title":""},{"docid":"0c5d479fdf54d60d361b5492b8f660cc","score":"0.46861002","text":"function walkTree(node, dataSource) {\n if (node instanceof formatparse_1.ParseNode) {\n if (node.parent instanceof source_1.SourceNode && dataSource.format) {\n dataSource.format.parse = node.assemble();\n }\n else {\n throw new Error('Can only instantiate parse next to source.');\n }\n }\n if (node instanceof facet_1.FacetNode) {\n if (!dataSource.name) {\n dataSource.name = \"data_\" + datasetIndex++;\n }\n if (!dataSource.source || dataSource.transform.length > 0) {\n data.push(dataSource);\n node.data = dataSource.name;\n }\n else {\n node.data = dataSource.source;\n }\n node.assemble().forEach(function (d) { return data.push(d); });\n // break here because the rest of the tree has to be taken care of by the facet.\n return;\n }\n if (node instanceof transforms_1.FilterNode ||\n node instanceof nullfilter_1.NullFilterNode ||\n node instanceof transforms_1.CalculateNode ||\n node instanceof aggregate_1.AggregateNode ||\n node instanceof pathorder_1.OrderNode) {\n dataSource.transform.push(node.assemble());\n }\n if (node instanceof nonpositivefilter_1.NonPositiveFilterNode ||\n node instanceof bin_1.BinNode ||\n node instanceof timeunit_1.TimeUnitNode ||\n node instanceof stack_1.StackNode) {\n dataSource.transform = dataSource.transform.concat(node.assemble());\n }\n if (node instanceof dataflow_1.OutputNode) {\n if (dataSource.source && dataSource.transform.length === 0) {\n node.source = dataSource.source;\n }\n else if (node.parent instanceof dataflow_1.OutputNode) {\n // Note that an output node may be required but we still do not assemble a\n // separate data source for it.\n node.source = dataSource.name;\n throw new Error('cannot happen');\n }\n else {\n if (!dataSource.name) {\n dataSource.name = \"data_\" + datasetIndex++;\n }\n // Here we set the name of the datasource we generated. From now on\n // other assemblers can use it.\n node.source = dataSource.name;\n // if this node has more than one child, we will add a datasource automatically\n if (node.numChildren() === 1 && dataSource.transform.length > 0) {\n data.push(dataSource);\n var newData = {\n name: null,\n source: dataSource.name,\n transform: []\n };\n dataSource = newData;\n }\n }\n }\n switch (node.numChildren()) {\n case 0:\n // done\n if (!dataSource.source || dataSource.transform.length > 0) {\n // do not push empty datasources that are simply references\n data.push(dataSource);\n }\n break;\n case 1:\n walkTree(node.children[0], dataSource);\n break;\n default:\n var source_2 = dataSource.name;\n if (!dataSource.source || dataSource.transform.length > 0) {\n data.push(dataSource);\n }\n else {\n source_2 = dataSource.source;\n }\n node.children.forEach(function (child) {\n var newData = {\n name: null,\n source: source_2,\n transform: []\n };\n walkTree(child, newData);\n });\n break;\n }\n }","title":""},{"docid":"1255dc2eb4c105293bef1d4fc609f7be","score":"0.46778196","text":"cheat() {\n\n // First we do a lot of work to stop what's happening and do a \"soft\" reset\n this.endAnimation();\n\n this.targets.forEach( target => this.returnTarget( target ) );\n this.endAnimation();\n\n this.shapeGroups.forEach( shapeGroup => this.returnShapeGroup( shapeGroup ) );\n this.numberGroups.forEach( numberGroup => this.returnNumberGroup( numberGroup ) );\n this.endAnimation();\n\n const groupStack = this.hasShapes ? this.shapeGroupStacks[ 0 ] : this.numberGroupStacks[ 0 ];\n\n const numGroups = groupStack.array.length;\n const groups = _.range( 0, numGroups ).map( index => {\n const point = new Vector2( this.hasShapes ? -100 : 0, ( index - ( numGroups - 1 ) / 2 ) * 100 );\n\n return this.pullGroupFromStack( groupStack, point );\n } );\n\n this.endAnimation();\n\n if ( this.hasShapes ) {\n let maxQuantity = 0;\n const availableCollection = UnitCollection.fractionsToCollection( this.shapeStacks.map( shapeStack => {\n maxQuantity = Math.max( maxQuantity, shapeStack.array.length );\n return new Fraction( shapeStack.array.length, shapeStack.fraction.denominator );\n } ) );\n const denominators = availableCollection.nonzeroDenominators;\n const fractions = this.targets.map( target => target.fraction );\n\n // Only search over the given denominators\n const collectionFinder = new CollectionFinder( {\n denominators: denominators.map( PrimeFactorization.factor )\n } );\n\n const solution = FractionChallenge.findShapeSolution( fractions, collectionFinder, maxQuantity, availableCollection );\n\n solution.forEach( ( groupCollections, groupIndex ) => {\n // Add containers where needed\n const group = groups[ groupIndex ];\n while ( group.shapeContainers.length < groupCollections.length ) {\n group.increaseContainerCount();\n }\n\n // Move the pieces to the containers\n groupCollections.forEach( ( collection, containerIndex ) => {\n collection.unitFractions.forEach( fraction => {\n const stack = _.find( this.shapeStacks, stack => stack.fraction.equals( fraction ) );\n const piece = this.pullShapePieceFromStack( stack, Vector2.ZERO );\n this.placeActiveShapePiece( piece, group.shapeContainers.get( containerIndex ), group );\n } );\n } );\n } );\n }\n else {\n const pullNumberPiece = ( number, spot ) => {\n const stack = _.find( this.numberStacks, stack => stack.number === number );\n const piece = this.pullNumberPieceFromStack( stack, Vector2.ZERO );\n this.draggedNumberPieces.remove( piece );\n this.placeNumberPiece( spot, piece );\n };\n\n const availableQuantities = {};\n const numbers = this.numberStacks.map( numberStack => {\n availableQuantities[ numberStack.number ] = numberStack.array.length;\n return numberStack.number;\n } );\n const fractions = [];\n\n // if we have mixed numbers, their \"whole\" parts are exactly computable\n groups.forEach( ( group, index ) => {\n let fraction = this.targets[ index ].fraction;\n if ( group.isMixedNumber ) {\n const whole = Math.floor( fraction.value );\n pullNumberPiece( whole, group.wholeSpot );\n availableQuantities[ whole ]--;\n fraction = fraction.minusInteger( whole );\n }\n fractions.push( fraction.reduced() );\n } );\n\n const solution = FractionChallenge.findNumberSolution( fractions, Math.max( ...numbers ), availableQuantities );\n\n groups.forEach( ( group, index ) => {\n pullNumberPiece( solution[ index ] * fractions[ index ].numerator, group.numeratorSpot );\n pullNumberPiece( solution[ index ] * fractions[ index ].denominator, group.denominatorSpot );\n } );\n }\n\n this.endAnimation();\n }","title":""},{"docid":"cc0ae7df39a50d5c3152a6dfcc17b84f","score":"0.4675346","text":"function relayoutDiagramStack(e) {\r\n\t\tmyDiagram.layout.invalidateLayout(); // but don't invalidate all Layouts that are in Groups\r\n\t\tmyDiagram.layoutDiagram();\r\n\t}","title":""},{"docid":"e59a26d7a041753da002d7d65400a366","score":"0.46719718","text":"function updateStack() {\n nestByDate.forEach(function(d) {\n var y0 = 0;\n var y1 = 0;\n d.values.forEach(function(d) {\n if (d.vis === \"1\") {\n d.y0 = y0 + y1;\n y1 = yValue(d);\n d.y1 = y1;\n }\n });\n }); \n }","title":""},{"docid":"1ee92e615343b37b51dffc32f8cbd768","score":"0.4666193","text":"function cleanplanets() {\n var v = [];\n for (var i = 1; i <= 12; i++) {\n var eo = xxxgenes(i);\n v[i] = getHornSet(xxxgenes(i)).trankey;\n if (v[i].indexOf(\"first_bend\") === -1) {\n eo.tranrule = xxxgenes(2).tranrule;\n eo.first_bend = 0;\n }\n for (let gn in genedefs) {\n var gd = genedefs[gn];\n if (eo[gn] > gd.max)\n gd.max = eo[gn];\n if (eo[gn] < gd.min)\n gd.min = eo[gn];\n }\n }\n forcerefresh = true;\n newframe();\n}","title":""},{"docid":"8839c7fca820a6b3d59b8bdf0b64da68","score":"0.4663106","text":"_reconstructActiveFormattingElements() {\n\t\t\tconst listLength = this.activeFormattingElements.entries.length;\n\t\t\tif (listLength) {\n\t\t\t\tconst endIndex = this.activeFormattingElements.entries.findIndex((entry) => entry.type === EntryType.Marker || this.openElements.contains(entry.element));\n\t\t\t\tconst unopenIdx = endIndex < 0 ? listLength - 1 : endIndex - 1;\n\t\t\t\tfor (let i = unopenIdx; i >= 0; i--) {\n\t\t\t\t\tconst entry = this.activeFormattingElements.entries[i];\n\t\t\t\t\tthis._insertElement(entry.token, this.treeAdapter.getNamespaceURI(entry.element));\n\t\t\t\t\tentry.element = this.openElements.current;\n\t\t\t\t}\n\t\t\t}\n\t\t}","title":""},{"docid":"3a9281eafc495fecc94ab0afadab9c89","score":"0.46564612","text":"static remove_former_svg() {\r\n d3.select(\"#summary\").remove();\r\n }","title":""},{"docid":"9c70b366aabade0ffbe7500cd3b7dd85","score":"0.4656305","text":"function splitItem(pmcData, body, sessionID) { // -> Spliting item / Create new item with splited amount and removing that amount from older one\n item.resetOutput();\n\n let output = item.getOutput();\n let location = body.container.location;\n\n let items = getOwnerInventoryItems(body, sessionID);\n\n if (!(\"location\" in body.container) && body.container.container === \"cartridges\") {\n let tmp_counter = 0;\n\n for (let item_ammo in items.to) {\n if (items.to[item_ammo].parentId === body.container.id) {\n tmp_counter++;\n }\n }\n\n location = tmp_counter;//wrong location for first cartrige\n }\n\n\n // The item being merged is possible from three different sources: pmc, scav, or mail.\n for (let item of items.from) {\n if (item._id && item._id === body.item) {\n item.upd.StackObjectsCount -= body.count;\n\n let newItem = utility.generateNewItemId();\n\n output.data.items.new.push({\n \"_id\": newItem,\n \"_tpl\": item._tpl,\n \"parentId\": body.container.id,\n \"slotId\": body.container.container,\n \"location\": location,\n \"upd\": {\"StackObjectsCount\": body.count}\n });\n\n items.to.push({\n \"_id\": newItem,\n \"_tpl\": item._tpl,\n \"parentId\": body.container.id,\n \"slotId\": body.container.container,\n \"location\": location,\n \"upd\": {\"StackObjectsCount\": body.count}\n });\n\n return output;\n }\n }\n\n return \"\";\n}","title":""},{"docid":"fce2ffb1dffdbe506189e3ece415c9db","score":"0.465316","text":"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","title":""},{"docid":"fce2ffb1dffdbe506189e3ece415c9db","score":"0.465316","text":"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","title":""},{"docid":"fce2ffb1dffdbe506189e3ece415c9db","score":"0.465316","text":"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","title":""},{"docid":"fce2ffb1dffdbe506189e3ece415c9db","score":"0.465316","text":"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","title":""},{"docid":"fce2ffb1dffdbe506189e3ece415c9db","score":"0.465316","text":"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","title":""},{"docid":"fce2ffb1dffdbe506189e3ece415c9db","score":"0.465316","text":"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","title":""},{"docid":"fce2ffb1dffdbe506189e3ece415c9db","score":"0.465316","text":"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","title":""},{"docid":"fce2ffb1dffdbe506189e3ece415c9db","score":"0.465316","text":"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","title":""},{"docid":"fce2ffb1dffdbe506189e3ece415c9db","score":"0.465316","text":"function stackClear() {\n\t this.__data__ = { 'array': [], 'map': null };\n\t}","title":""},{"docid":"dec80a2886b032db1e7388c973ac9160","score":"0.46511334","text":"function update(source) {\n var i = 0;\n\n // Compute the new tree layout\n var root = d3.hierarchy(source.children[0])\n let bounds = d3.selection()._groups[0][0].getBoundingClientRect()\n\n // Set properties of SVG element; should be adjusted for scalability\n let width = bounds.width,\n \t height = bounds.height ;\n\n const num_nodes = root.descendants().length\n\n var tree = d3.tree()\n \t.size([width, height]).separation(function separation(a, b) {\n return a.parent == b.parent ? 1.5 : 1;\n });;\n\n // Initialize SVG element on page\n if (d3.select(\"#treeSVG\")._groups[0][0] != null) {\n\n d3.select(\"#treeSVG\").remove()\n }\n\n var svg = d3.select(\"#svg\").append(\"svg\")\n .attr(\"id\", \"treeSVG\")\n \t.attr(\"viewBox\", `-30 -30 ${1.2 * width - num_nodes} ${width - (8000 / num_nodes)}`)\n .attr(\"preserveAspectRatio\", \"none\")\n .attr(\"position\", \"absolute\")\n .append(\"g\")\n \t//.attr(\"transform\", \"translate(\" + (margin.left + width/2) + \",\" + margin.top + \")\");\n\n var nodes = tree(root).descendants(), links = tree(root).links();\n // Normalize for fixed-depth.\n nodes.forEach(function(d) { d.y = d.depth * 100; });\n\n // Declare the nodes…\n var node = svg.selectAll(\"g.node\")\n .data(nodes, function(d) { return d.id || (d.id = ++i); });\n\n // Enter the nodes.\n var nodeEnter = node.enter().append(\"g\")\n .attr(\"class\", \"node\")\n .attr(\"transform\", function(d) {\n return \"translate(\" + d.x + \",\" + d.y + \")\"; });\n\n nodeEnter.append(\"text\")\n .attr(\"y\", function(d) {\n return d.children || d._children ? -18 : 18; })\n .attr(\"dy\", \".35em\")\n .attr(\"text-anchor\", \"middle\")\n .text(function(d) { return `${d.data.name} ${(d.data.category === undefined ? '' : '(' + d.data.category + ')')}`; })\n .style(\"fill-opacity\", 1);\n\n // Declare the links…\n var link = svg.selectAll(\"path.link\")\n .data(links, function(d) { return d.target.id; });\n\n // Enter the links.\n link.enter().insert(\"line\", \"g\")\n .attr(\"class\", \"link\")\n .attr('x1', function(d) {return d.source.x;})\n .attr('y1', function(d) {return d.source.y;})\n .attr('x2', function(d) {return d.target.x;})\n .attr('y2', function(d) {return d.target.y - 30;});\n}","title":""},{"docid":"de31597a0d6b96f1f271eea81f715d56","score":"0.4650421","text":"function scaleItems() {\n if (rescale) {\n d3.select('#showgrouppaper svg').selectAll('tmp')\n .data(items).enter()\n .append('text')\n .text(function(d){ return d.title; })\n .style(style.text)\n .attr('x', -1000)\n .attr('y', -1000)\n .attr('class', 'tmp');\n \n var z = d3.selectAll('.tmp')[0]\n .map(function(x){ return x.getBBox(); });\n width = d3.max(z.map(function(x){ return x.width; }));\n margin = margin * width;\n width = width + 2 * margin;\n height = d3.max(z.map(function(x){ return x.height+ 15 + margin / 2; }));\n\n // cleanup\n d3.selectAll('.tmp').remove();\n rescale = false;\n }\n }//end scaleItems ","title":""},{"docid":"ffa8926081268054279ac2afbaff0f03","score":"0.46482602","text":"clear() {\n this.stack.clear();\n this.minStack.clear();\n }","title":""},{"docid":"ea19a6584f7549430ac8321966145275","score":"0.46473354","text":"onContainerMouseEnter(e) {\n delete this.chartPosition;\n }","title":""},{"docid":"fb90aa64f9bd2a0d2df355d62e2b8868","score":"0.4645992","text":"function stackClear() {\n this.__data__ = new _lodash_ListCache['default']();\n this.size = 0;\n }","title":""},{"docid":"fb90aa64f9bd2a0d2df355d62e2b8868","score":"0.4645992","text":"function stackClear() {\n this.__data__ = new _lodash_ListCache['default']();\n this.size = 0;\n }","title":""},{"docid":"64ff81c51d4a9365ab0be5784a659a02","score":"0.46431178","text":"handleRemoveSource() {\n if (this.state.sources.length > MINIMUM_NO_OF_SOURCES) {\n this.setState((prevState) => ({\n sources: prevState.sources.splice(0, prevState.sources.length - 1)\n }));\n }\n }","title":""},{"docid":"1d6ab1191143b6bf99ed275907214827","score":"0.4641648","text":"resetDynamicOffset()\n {\n for( let [ groupKey, groupMap ] of this.menuMapMap.entries() )\n for( let [ key, menu ] of groupMap.entries() )\n menu.resetDynamicPos();\n }","title":""}],"string":"[\n {\n \"docid\": \"bc2b9dcf329134578f2afa72d9c353d3\",\n \"score\": \"0.56309956\",\n \"text\": \"resetStacks() {\\n objectEach(this.stacks, (type) => {\\n objectEach(type, (stack, x) => {\\n // Clean up memory after point deletion (#1044, #4320)\\n if (isNumber(stack.touched) &&\\n stack.touched < this.stacksTouched) {\\n stack.destroy();\\n delete type[x];\\n // Reset stacks\\n }\\n else {\\n stack.total = null;\\n stack.cumulative = null;\\n }\\n });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16c282015c56cdedc7efd442d65ab30d\",\n \"score\": \"0.554261\",\n \"text\": \"buildStacks() {\\n const stacking = this;\\n const axis = stacking.axis;\\n const axisSeries = axis.series;\\n const reversedStacks = axis.options.reversedStacks;\\n const len = axisSeries.length;\\n let actualSeries, i;\\n stacking.usePercentage = false;\\n i = len;\\n while (i--) {\\n actualSeries = axisSeries[reversedStacks ? i : len - i - 1];\\n actualSeries.setStackedPoints();\\n actualSeries.setGroupedPoints();\\n }\\n // Loop up again to compute percent and stream stack\\n for (i = 0; i < len; i++) {\\n axisSeries[i].modifyStacks();\\n }\\n fireEvent(axis, 'afterBuildStacks');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1a803368ccc26f0120b36431102a631\",\n \"score\": \"0.54610616\",\n \"text\": \"function resetData(){\\n\\t\\tprePosition.clear();\\n\\t\\tnodeData.forEach(function(d){\\n\\t\\t\\tprePosition.set(d.id, {\\n\\t\\t\\t\\tx : d.x,\\n\\t\\t\\t\\ty : d.y,\\n\\t\\t\\t})\\n\\t\\t})\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"521e06e78775cb1f84c8ae5a93068eba\",\n \"score\": \"0.5458053\",\n \"text\": \"onDataSet(data) {\\n if (!this.hasProps || !(data === null || data === void 0 ? void 0 : data.source) || !data.source.length) {\\n return;\\n }\\n const source = data.source.filter(s => !isGrouping(s));\\n const expanded = this.revogrid.grouping || {};\\n const { sourceWithGroups, depth, trimmed, oldNewIndexMap, childrenByGroup } = gatherGrouping(source, \\n // filter\\n item => { var _a; return (_a = this.options) === null || _a === void 0 ? void 0 : _a.props.map(key => item[key]); }, Object.assign({}, (expanded || {})));\\n data.source = sourceWithGroups;\\n this.providers.dataProvider.setGrouping({ depth });\\n this.updateTrimmed(trimmed, childrenByGroup, oldNewIndexMap);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a99b6e73fec6d99aae10ff922d4cd4e\",\n \"score\": \"0.5412136\",\n \"text\": \"ssrHydrationPrep() {\\n this.nodesToKeep = [];\\n\\n this.ssrKeep.forEach(item => {\\n while (item.firstChild) {\\n this.nodesToKeep.push(item.firstChild); // track the nodes that will be preserved\\n this.appendChild(item.firstChild);\\n }\\n });\\n\\n // Remove all children not in the \\\"keep\\\" array\\n Array.from(this.children)\\n .filter(item => !this.nodesToKeep.includes(item))\\n .forEach(node => {\\n node.parentElement.removeChild(node);\\n });\\n\\n this.ssrPrepped = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0f6c9dd8b2558cffc0981813deec542\",\n \"score\": \"0.52900964\",\n \"text\": \"function optimizeDataflow(dataComponent) {\\n var roots = util_1.vals(dataComponent.sources);\\n roots.forEach(removeUnnecessaryNodes);\\n // remove source nodes that don't have any children because they also don't have output nodes\\n roots = roots.filter(function (r) { return r.numChildren() > 0; });\\n getLeaves(roots).forEach(optimizers.iterateFromLeaves(optimizers.removeUnusedSubtrees));\\n roots = roots.filter(function (r) { return r.numChildren() > 0; });\\n getLeaves(roots).forEach(optimizers.iterateFromLeaves(optimizers.moveParseUp));\\n getLeaves(roots).forEach(optimizers.removeDuplicateTimeUnits);\\n roots.forEach(moveFacetDown);\\n util_1.keys(dataComponent.sources).forEach(function (s) {\\n if (dataComponent.sources[s].numChildren() === 0) {\\n delete dataComponent.sources[s];\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d14e9b6e26c7a77a51f0529a3a90c521\",\n \"score\": \"0.5274012\",\n \"text\": \"function resetData() {\\n points = [];\\n normalizedPoints = [];\\n if (pointGroup !== null) {\\n pointGroup.removeChildren();\\n }\\n if (infoGroup !== null) {\\n infoGroup.removeChildren();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1bdf38456acfb10ef32a3584aa8765c\",\n \"score\": \"0.5228955\",\n \"text\": \"doSourceUpdate(options) {\\n if (!this.hasProps) {\\n return;\\n }\\n /**\\n * Get source without grouping\\n * @param newOldIndexMap - provides us mapping with new indexes vs old indexes, we would use it for trimmed mapping\\n */\\n const { source, prevExpanded, oldNewIndexes } = this.getSource(true);\\n /**\\n * Group again\\n * @param oldNewIndexMap - provides us mapping with new indexes vs old indexes\\n */\\n const { sourceWithGroups, depth, trimmed, oldNewIndexMap, childrenByGroup } = gatherGrouping(source, \\n // filter\\n item => { var _a; return (_a = this.options) === null || _a === void 0 ? void 0 : _a.props.map(key => item[key]); }, Object.assign({ prevExpanded }, options));\\n // setup source\\n this.providers.dataProvider.setData(sourceWithGroups, GROUPING_ROW_TYPE, { depth }, true);\\n this.updateTrimmed(trimmed, childrenByGroup, oldNewIndexes, oldNewIndexMap);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a43aa4044d92e19571fd71357460002\",\n \"score\": \"0.51741797\",\n \"text\": \"function seriesModifyStacks() {\\n const series = this, yAxis = series.yAxis, stackKey = series.stackKey, stacks = yAxis.stacking.stacks, processedXData = series.processedXData, stacking = series.options.stacking, stacker = series[stacking + 'Stacker'];\\n let stackIndicator;\\n if (stacker) { // Modifier function exists (Series.percentStacker etc.)\\n [stackKey, '-' + stackKey].forEach((key) => {\\n let i = processedXData.length, x, stack, pointExtremes;\\n while (i--) {\\n x = processedXData[i];\\n stackIndicator = series.getStackIndicator(stackIndicator, x, series.index, key);\\n stack = stacks[key] && stacks[key][x];\\n pointExtremes =\\n stack && stack.points[stackIndicator.key];\\n if (pointExtremes) {\\n stacker.call(series, pointExtremes, stack, i);\\n }\\n }\\n });\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2460b30f7804802c08987e6395069f6e\",\n \"score\": \"0.5138678\",\n \"text\": \"SeedForSrcAndTar() {\\r\\n let groMinLab = [];\\r\\n let groLab = [];\\r\\n let labCnt = 0;\\r\\n\\r\\n let groMinLabTar = [];\\r\\n let groLabTar = [];\\r\\n let labCntTar = 0;\\r\\n\\r\\n let paramLabelingBlob = {\\r\\n width: this.imgWidth,\\r\\n height: this.imgHeight,\\r\\n srcdata: this.src,\\r\\n data: undefined,\\r\\n label: this.srcLab,\\r\\n groupMinLab: groMinLab,\\r\\n groupLab: groLab,\\r\\n curLabCnt: labCnt\\r\\n };\\r\\n\\r\\n // Labeling Blobs for src\\r\\n LabelingBlobs(paramLabelingBlob);\\r\\n\\r\\n let paramLabelingBlobTar = {\\r\\n width: this.imgWidth,\\r\\n height: this.imgHeight,\\r\\n srcdata: this.tar,\\r\\n data: undefined,\\r\\n label: this.tarLab,\\r\\n groupMinLab: groMinLabTar,\\r\\n groupLab: groLabTar,\\r\\n curLabCnt: labCntTar\\r\\n };\\r\\n\\r\\n LabelingBlobs(paramLabelingBlobTar);\\r\\n\\r\\n //\\r\\n let finalGroupSrcCnt = 0;\\r\\n let finalGroupTarCnt = 0;\\r\\n\\r\\n for (let i = 0; i < paramLabelingBlob.groupMinLab.length; i++) {\\r\\n if ((paramLabelingBlob.groupMinLab[i] + 1) > finalGroupSrcCnt) {\\r\\n finalGroupSrcCnt = (paramLabelingBlob.groupMinLab[i] + 1);\\r\\n }\\r\\n }\\r\\n // console.log(paramLabelingBlob)\\r\\n\\r\\n for (let i = 0; i < paramLabelingBlobTar.groupMinLab.length; i++) {\\r\\n if ((paramLabelingBlobTar.groupMinLab[i] + 1) > finalGroupTarCnt) {\\r\\n finalGroupTarCnt = (paramLabelingBlobTar.groupMinLab[i] + 1);\\r\\n }\\r\\n }\\r\\n\\r\\n // 0: index\\r\\n // 1: highest density value\\r\\n // 2: sum density value\\r\\n // 3: minx\\r\\n // 4: maxx\\r\\n // 5: miny\\r\\n // 6: maxy\\r\\n let highestPixelInfoSrc = new Array(finalGroupSrcCnt * 8);\\r\\n let highestPixelInfoTar = new Array(finalGroupTarCnt * 8);\\r\\n\\r\\n // First: Index; Second: Value\\r\\n for (let i = 0; i < finalGroupSrcCnt; i++) {\\r\\n highestPixelInfoSrc[i * 8] = 0;\\r\\n highestPixelInfoSrc[i * 8 + 1] = 0;\\r\\n highestPixelInfoSrc[i * 8 + 2] = 0;\\r\\n highestPixelInfoSrc[i * 8 + 3] = this.imgWidth;\\r\\n highestPixelInfoSrc[i * 8 + 4] = 0;\\r\\n highestPixelInfoSrc[i * 8 + 5] = this.imgHeight;\\r\\n highestPixelInfoSrc[i * 8 + 6] = 0;\\r\\n highestPixelInfoSrc[i * 8 + 7] = undefined;\\r\\n }\\r\\n\\r\\n for (let i = 0; i < finalGroupTarCnt; i++) {\\r\\n highestPixelInfoTar[i * 8] = 0;\\r\\n highestPixelInfoTar[i * 8 + 1] = 0;\\r\\n highestPixelInfoTar[i * 8 + 2] = 0;\\r\\n highestPixelInfoTar[i * 8 + 3] = this.imgWidth;\\r\\n highestPixelInfoTar[i * 8 + 4] = 0;\\r\\n highestPixelInfoTar[i * 8 + 5] = this.imgHeight;\\r\\n highestPixelInfoTar[i * 8 + 6] = 0;\\r\\n highestPixelInfoTar[i * 8 + 7] = undefined;\\r\\n\\r\\n }\\r\\n\\r\\n let index = 0;\\r\\n for (let i = 0; i < this.imgHeight; i++)\\r\\n for (let j = 0; j < this.imgWidth; j++) {\\r\\n if (paramLabelingBlob.label[index] >= 0) {\\r\\n if (j < highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 3])\\r\\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 3] = j;\\r\\n if (j > highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 4])\\r\\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 4] = j;\\r\\n if (i < highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 5])\\r\\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 5] = i;\\r\\n if (i > highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 6])\\r\\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 6] = i;\\r\\n\\r\\n if (highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 1] < src[index]) {\\r\\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8] = index;\\r\\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 1] = src[index];\\r\\n }\\r\\n\\r\\n if (src[index] > 0.4)\\r\\n highestPixelInfoSrc[paramLabelingBlob.label[index] * 8 + 2] += 1; //src[index];\\r\\n }\\r\\n\\r\\n if (paramLabelingBlobTar.label[index] >= 0) {\\r\\n if (j < highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 3])\\r\\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 3] = j;\\r\\n if (j > highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 4])\\r\\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 4] = j;\\r\\n if (i < highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 5])\\r\\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 5] = i;\\r\\n if (i > highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 6])\\r\\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 6] = i;\\r\\n\\r\\n if (highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 1] < this.tar[index]) {\\r\\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8] = index;\\r\\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 1] = this.tar[index];\\r\\n }\\r\\n\\r\\n if (tar[index] > 0.4)\\r\\n highestPixelInfoTar[paramLabelingBlobTar.label[index] * 8 + 2] += 1; //tar[index];\\r\\n }\\r\\n index++;\\r\\n }\\r\\n\\r\\n // Highest pixels from src to tar\\r\\n for (let i = 0; i < finalGroupSrcCnt; i++) {\\r\\n this.tar[highestPixelInfoSrc[i * 8]] = highestPixelInfoSrc[i * 8 + 1];\\r\\n }\\r\\n // console.log(highestPixelInfoSrc)\\r\\n // Highest pixels from tar to src\\r\\n for (let i = 0; i < finalGroupTarCnt; i++) {\\r\\n this.src[highestPixelInfoTar[i * 8]] = highestPixelInfoTar[i * 8 + 1];\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12f6e643f787460f11b334c8897c640c\",\n \"score\": \"0.51313883\",\n \"text\": \"_prepareItems(data) {\\n // Initialize containers.\\n const talents = [];\\n\\n // Iterate through items, allocating to containers\\n for (let i of data.items) {\\n let item = i.data;\\n // Append to gear.\\n if (i.type === 'talent') {\\n talents.push(i);\\n }\\n }\\n\\n // Assign and return\\n data.talents = talents;\\n\\n const agendas = [];\\n\\n // Iterate through items, allocating to containers\\n for (let i of data.items) {\\n let item = i.data;\\n // Append to gear.\\n if (i.type === 'agenda') {\\n agendas.push(i);\\n }\\n }\\n\\n // Assign and return\\n data.agendas = agendas;\\n\\n // Categorize items as inventory, spellbook, features, and classes\\n const inventory = {\\n weapon: { label: 'Weapons', items: [], dataset: { type: 'weapon' } },\\n item: { label: 'Items', items: [], dataset: { type: 'item' } },\\n armor: { label: 'Armor', items: [], dataset: { type: 'armor' } },\\n };\\n // Partition items by category\\n let [items, spells, feats, classes, talent] = data.items.reduce(\\n (arr, item) => {\\n // Item details\\n item.img = item.img || DEFAULT_TOKEN;\\n item.isStack = item.data.quantity ? item.data.quantity > 1 : false;\\n\\n // Classify items into types\\n // console.log('alienrpgActorSheet -> _prepareItems -> item', item);\\n // if (item.type === 'talent') arr[1].push(item);\\n // else if (item.type === 'feat') arr[2].push(item);\\n // else if (item.type === 'feature') arr[3].push(item);\\n if (Object.keys(inventory).includes(item.type)) arr[0].push(item);\\n return arr;\\n },\\n [[], [], [], []]\\n );\\n\\n // Apply active item filters\\n items = this._filterItems(items, this._filters.inventory);\\n\\n // Organize Inventory\\n let totalWeight = 0;\\n for (let i of items) {\\n if (i.type == 'weapon') {\\n // console.log('alienrpgActorSheet -> Organize Inventory', i);\\n let ammoweight = 0.25;\\n if (i.data.attributes.class.value == 'RPG' || i.name.includes(' RPG ') || i.name.startsWith('RPG') || i.name.endsWith('RPG')) {\\n ammoweight = 0.5;\\n }\\n\\n i.data.attributes.weight.value = i.data.attributes.weight.value || 0;\\n i.totalWeight = i.data.attributes.weight.value + i.data.attributes.rounds.value * ammoweight;\\n inventory[i.type].items.push(i);\\n\\n totalWeight += i.totalWeight;\\n } else if (i.type != 'talent') {\\n i.data.attributes.weight.value = i.data.attributes.weight.value || 0;\\n i.totalWeight = i.data.attributes.weight.value;\\n inventory[i.type].items.push(i);\\n totalWeight += i.totalWeight;\\n }\\n }\\n\\n data.data.general.encumbrance = this._computeEncumbrance(totalWeight, data);\\n // this._computeHealth(data);\\n // Assign and return\\n data.inventory = Object.values(inventory);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8cf3402decd5186cc1ce3cf1f3c62993\",\n \"score\": \"0.5119833\",\n \"text\": \"repositionX() {\\n // should be implemented by the item\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07152279a5921738808a742469592ca0\",\n \"score\": \"0.51073855\",\n \"text\": \"function resetFlowchartTooltips() {\\n // Clear any existing d3-tip divs\\n d3.selectAll(\\\".d3-tip\\\").remove();\\n // Call the function on the flowchart svg again to add a new (default hidden) d3-tip div\\n flowChart.svg.call(flowChart.tip);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef0d7c804a0762d5a3c4d1d571d65188\",\n \"score\": \"0.5102389\",\n \"text\": \"function assembleData(dataCompomponent) {\\n var roots = util_1.vals(dataCompomponent.sources);\\n var data = [];\\n roots.forEach(removeUnnecessaryNodes);\\n // remove source nodes that don't have any children because they also don't have output nodes\\n roots = roots.filter(function (r) { return r.numChildren() > 0; });\\n getLeaves(roots).forEach(optimizers_1.iterateFromLeaves(optimizers.removeUnusedSubtrees));\\n roots = roots.filter(function (r) { return r.numChildren() > 0; });\\n getLeaves(roots).forEach(optimizers_1.iterateFromLeaves(optimizers.moveParseUp));\\n roots.forEach(moveFacetDown);\\n // roots.forEach(debug);\\n var walkTree = makeWalkTree(data);\\n var sourceIndex = 0;\\n roots.forEach(function (root) {\\n // assign a name if the source does not have a name yet\\n if (!root.hasName()) {\\n root.dataName = \\\"source_\\\" + sourceIndex++;\\n }\\n var newData = root.assemble();\\n walkTree(root, newData);\\n });\\n // remove empty transform arrays for cleaner output\\n data.forEach(function (d) {\\n if (d.transform.length === 0) {\\n delete d.transform;\\n }\\n });\\n // move sources without transforms (the ones that are potentially used in lookups) to the beginning\\n data.sort(function (a, b) { return (a.transform || []).length === 0 ? -1 : ((b.transform || []).length === 0 ? 1 : 0); });\\n // now fix the from references in lookup transforms\\n for (var _i = 0, data_2 = data; _i < data_2.length; _i++) {\\n var d = data_2[_i];\\n for (var _a = 0, _b = d.transform || []; _a < _b.length; _a++) {\\n var t = _b[_a];\\n if (t.type === 'lookup') {\\n t.from = dataCompomponent.outputNodes[t.from].source;\\n }\\n }\\n }\\n return data;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ac5e563aa300aa625850b5d3a45f0d2\",\n \"score\": \"0.5046708\",\n \"text\": \"resetItems() {\\n // Remove refs to current items.\\n this._disposeItems(this.items);\\n this.isInitialized = false;\\n\\n // Find new items in the DOM.\\n this.items = this._getItems();\\n\\n // Set initial styles on the new items.\\n this._initItems(this.items);\\n\\n this.once(Shuffle.EventType.LAYOUT, () => {\\n // Add transition to each item.\\n this.setItemTransitions(this.items);\\n this.isInitialized = true;\\n });\\n\\n // Lay out all items.\\n this.filter(this.lastFilter);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc6e21a8b4fc229b2b983360937a068f\",\n \"score\": \"0.5030189\",\n \"text\": \"function augment(trace) {\\n\\tlet ts = ''; let path;\\n\\tif (trace) {\\n\\t\\tlet p = trees.findpath(g.source); let s = '';\\n\\t\\tfor (let u = trees.first(p); u; u = trees.next(u)) {\\n\\t\\t\\tif (s) s += ' ';\\n\\t\\t\\ts += g.x2s(u);\\n\\t\\t\\tif (trees.next(u)) s += ':' + trees.cost(u);\\n\\t\\t}\\n\\t\\tts += s;\\n\\t}\\n\\n\\t// effectively saturate source/sink path by adjusting costs\\n\\tlet [u,rcap] = trees.findcost(g.source);\\n\\ttrees.addcost(g.source, -rcap);\\n\\n\\t// now, remove tree edges with zero residual capacity\\n\\t// and saturate corresponding flow graph edges\\n\\tlet c; [u,c] = trees.findcost(g.source);\\n\\twhile (c == 0) {\\n\\t\\tsteps++;\\n\\t\\tlet e = upEdge[u]; \\n\\t\\tif (e) { prune(u); nextEdge[u] = g.nextAt(u, e); }\\n\\t\\t[u,c] = trees.findcost(g.source);\\n\\t}\\n\\treturn [rcap, ts];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6cc66f88e06223ce04a85acd9d1978e8\",\n \"score\": \"0.50130117\",\n \"text\": \"propagate_data() {\\n Object.assign(this.data, this.style.data);\\n for (let n of this.content) {\\n n.data = {};\\n Object.assign(n.data, this.data);\\n n.propagate_data();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef5faddb9ec90d3ecc8bacccac05da95\",\n \"score\": \"0.5004317\",\n \"text\": \"_moveSeriesToFrontAll() {\\n const len = this.groupPaths ? this.groupPaths.length : 0;\\n for (let i = 0; i < len; i += 1) {\\n this.moveSeriesToFront(this.groupAreas[i], this.groupDots[i]);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"615ad92892a405d3245a4b4fa0d396c3\",\n \"score\": \"0.4998873\",\n \"text\": \"function cleanDataPointHighlights() {\\n verticalMarkerContainer.selectAll('.circle-container').remove();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64ee121332fa07165c778c4859b8eb4f\",\n \"score\": \"0.4994484\",\n \"text\": \"removeFront() {\\n this._targets.splice(0, 1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ef4f577945f912019bd21fcb033afd4\",\n \"score\": \"0.4993363\",\n \"text\": \"function drawSdrStack() {\\n $stack.html('');\\n _.each(sdrStack, function(sdr, i) {\\n var sdrId = 'sdr-' + i;\\n $stack.prepend(\\n '}, not undefined to avoid if...else... statement\\n\\npoint=!isNaN(x)&&!isNaN(y)&&coordSys.dataToPoint(tmpIn,null,tmpOut);\\n}\\n\\nif(isLargeRender){\\npoints[offset++]=point?point[0]:NaN;\\npoints[offset++]=point?point[1]:NaN;\\n}else {\\ndata.setItemLayout(i,point&&point.slice()||[NaN,NaN]);\\n}\\n}\\n\\nisLargeRender&&data.setLayout('symbolPoints',points);\\n}\\n\\nreturn dimLen&&{\\nprogress:progress};\\n\\n}};\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1eebfdc767dfaa0c158d49a1857a8de\",\n \"score\": \"0.47782004\",\n \"text\": \"function spaceU() {\\n a.dropEdges();\\n a.dropNodes();\\n s.refresh({skipIndexation: true});\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9cacea38af284419dc335fc7b4b1d9f4\",\n \"score\": \"0.47779045\",\n \"text\": \"function startdrop() {\\r\\n document.getElementById(\\\"dataset\\\").ondragover = function (ev) {\\r\\n ev.preventDefault();\\r\\n }\\r\\n\\r\\n // change datasets/overlays order\\r\\n document.getElementById(\\\"dataset\\\").ondrop = function (ev) {\\r\\n var name = ev.dataTransfer.getData(\\\"text\\\");\\r\\n\\t\\t//console.log(name);\\r\\n var list = document.getElementById(\\\"dataset\\\").childNodes;\\r\\n var place = ev.clientY;\\r\\n var dragged;\\r\\n var i;\\r\\n for (i = 0; i < list.length; i++) {\\r\\n if (list[i].title == name) {\\r\\n dragged = list[i];\\r\\n }\\r\\n }\\r\\n\\r\\n if (place < list[0].getBoundingClientRect().y + 5) {\\r\\n $(\\\"#dataset\\\").prepend(dragged);\\r\\n }else {\\r\\n for (i = 0; i < list.length; i++) {\\r\\n if (place > list[i].getBoundingClientRect().y + 5) {\\r\\n list[i].after(dragged);\\r\\n }\\r\\n }\\r\\n }\\r\\n\\t\\tlist = document.getElementById(\\\"dataset\\\").childNodes;\\r\\n for (i = 0; i < list.length; i++) {\\r\\n //console.log(list[i].title);\\r\\n temp = findUse(list[i].title)\\r\\n\\t\\t\\tmap_buffer[list[i].title].setStyle({\\r\\n icon: customizePoint(temp),\\r\\n strokeWeight: 1,\\r\\n strokeColor: legend_buffer[list[i].title],\\r\\n fillColor: legend_buffer[list[i].title],\\r\\n zIndex: list.length - i - 1,\\r\\n });\\r\\n }\\r\\n };\\r\\n \\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60bd992c39e8f57c3be5b8e40ee2f6e0\",\n \"score\": \"0.47731918\",\n \"text\": \"function stackClear() {\\n this.__data__ = {\\n 'array': [],\\n 'map': null\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7d7eae1c49c7aa3fef2c56c4d62b601\",\n \"score\": \"0.47719276\",\n \"text\": \"function adjust_children_positioning(nestedData, num_of_timepoints, measure) {\\n for (var i = 0; i < nestedData.length; i++) {\\n var parent_index = nestedData[i].parent_index_of_this;\\n //Added || != 'none' to satisfy fishplot editor (Had to add separate if statement for some reason??)\\n //All fishplots that havent been placed down yet have a parent_index of 'none'\\n //This is so I can do the collision prevention for the children that are already plotted\\n if (parent_index != \\\"plot\\\") {\\n if (parent_index != \\\"none\\\") {\\n var parent = nestedData[parent_index];\\n var children = parent.children;\\n var start_point = parent.start_point;\\n //Potentially include an && the children has not already been checked\\n //If parent has 2+ children, then the loop below will have taken care of those children already\\n if (children.length != 0) {\\n for (var j = 0; j < children.length; j++) {\\n var child = nestedData[children[j]];\\n for (var k = 0; k < child.values.length; k++) {\\n var start_point_space = parent.values[k][measure] / children.length;\\n var start_point_base = start_point_space / 2;\\n child.start_point = start_point_base + (start_point_space * j) + parent.values[k].bottom;\\n child.values[k].start_point = child.start_point;\\n if ((child.start_point - child.values[k][measure] / 2) < parent.values[k].bottom) {\\n child.values[k].bottom = parent.values[k].bottom;\\n child.values[k].top = child.values[k].bottom + child.values[k][measure];\\n }\\n else if (( child.start_point + child.values[k][measure] / 2) > parent.values[k].top) {\\n child.values[k].top = parent.values[k].top;\\n child.values[k].bottom = child.values[k].top - child.values[k][measure];\\n }\\n else {\\n child.values[k].top = (child.start_point + child.values[k][measure] / 2);\\n child.values[k].bottom = (child.start_point - child.values[k][measure] / 2);\\n }\\n }\\n child.start_point = child.values[0].bottom;\\n }\\n for (var j = 0; j < num_of_timepoints + 1; j++) {\\n nestedData = collision_detection(nestedData, children, j, parent.values[j].bottom, parent.values[j].top, measure);\\n }\\n }\\n }\\n }\\n }\\n return nestedData;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0df1cef4afef8c4fbf5cfc67e7fc6c10\",\n \"score\": \"0.47551173\",\n \"text\": \"function realignStack() {\\n //Iterate through each column\\n\\n for (var i = 0; i < 840; i+= 60) {\\n //Get column\\n var col = stack.children.entries.filter(child => child.x == i)\\n col.sort(function(a, b){return b.y - a.y});\\n //console.log(\\\"This is the stack of poo\\\");\\n //stack.children.entries.forEach(child => console.log(child.y));\\n //Set the current column\\n var currcol = 0;\\n var end = false;\\n //Iterate through gaps\\n for(var j = 540; j > 60; j-= 60) {\\n if(col.length > 0 && !end) {\\n //Check next sprite is not adjacent\\n if(!(j == col[currcol].y )) {\\n //if(!(j + 20 >= col[currcol].body.y && j - 20 <= col[currcol].body.y)) {\\n //Gap detected\\n console.log(j);\\n console.log(col[currcol].y);\\n alert(\\\"GAP DETECTED\\\");\\n //Move tile down\\n stack.create(col[currcol].body.x+30, col[currcol].body.y+90, col[currcol].texture);\\n col[currcol].destroy();\\n currcol++;\\n } else {\\n currcol++;\\n }\\n //Control\\n if(currcol == col.length) {\\n end = true;\\n }\\n }\\n }\\n //Change the collision domain\\n brick.children.each(child => child.body.setSize(50,60,29));\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db6c97ecd682694ad083057a99af02c4\",\n \"score\": \"0.47515732\",\n \"text\": \"function loadStackedBars(error, data, fromMenu, sorting) {\\n console.log(\\\"loadStackedBars\\\");\\n console.log(data);\\n existingData = data;\\n d3.select(\\\"#stackedBars\\\").selectAll(\\\"g\\\").remove();\\n var sortingData = existingData[stat];\\n var minGD = Number.MAX_SAFE_INTEGER;\\n for(i=0; i bTotal) {\\n return 1;\\n }\\n } else if(sorting === 2) {\\n if (aTotal > bTotal) {\\n return -1;\\n }\\n if (aTotal < bTotal) {\\n return 1;\\n }\\n }\\n\\n\\n return 0;\\n }\\n\\n\\n\\n if(sorting != 0) {\\n sortingData = existingData[stat].slice();\\n sortingData = sortingData.sort(compareFunc);\\n console.log(\\\"Sorted data: \\\");\\n console.log(sortingData);\\n }\\n\\n var n = params.length, // The number of series.\\n m = data[stat].length; // The number of values per series.\\n\\n // The xz array has m elements, representing the x-values shared by all series.\\n // The yz array has n elements, representing the y-values of each of the n series.\\n // Each yz[i] is an array of m non-negative numbers representing a y-value for xz[i].\\n // The y01z array has the same structure as yz, but with stacked [y₀, y₁] instead of y.\\n var xz = d3.range(m),\\n yz = d3.range(n).map(function(i) { return getSelectedData(m, params[i]); }),\\n y01z = d3.stack().keys(d3.range(n))(d3.transpose(yz)),\\n yMax = d3.max(yz, function(y) { return d3.max(y); }),\\n y1Max = d3.max(y01z, function(y) { return d3.max(y, function(d) { return d[1]; }); });\\n\\n var svg = d3.select(\\\"#stackedBars\\\"),\\n margin = {top: 40, right: 10, bottom: 20, left: 10},\\n width = +svg.attr(\\\"width\\\") - margin.left - margin.right,\\n height = +svg.attr(\\\"height\\\") - margin.top - margin.bottom,\\n g = svg.append(\\\"g\\\").attr(\\\"transform\\\", \\\"translate(\\\" + margin.left + \\\",\\\" + margin.top + \\\")\\\");\\n\\n var x = d3.scaleBand()\\n .domain(xz)\\n .rangeRound([0, width])\\n .padding(0.08);\\n\\n var y = d3.scaleLinear()\\n .domain([0, y1Max + 100])\\n .range([height, 0]);\\n\\n var color = d3.scaleOrdinal()\\n .domain(d3.range(n))\\n .range(d3.schemeSet2);\\n\\n var series = g.selectAll(\\\".series\\\")\\n .data(y01z)\\n .enter().append(\\\"g\\\")\\n .attr(\\\"fill\\\", function(d, i) { return color(i); });\\n\\n var rect = series.selectAll(\\\"rect\\\")\\n .data(function(d) { return d; })\\n .enter().append(\\\"rect\\\")\\n .attr(\\\"x\\\", function(d, i) { return x(i); })\\n .attr(\\\"y\\\", height)\\n .attr(\\\"width\\\", x.bandwidth())\\n .attr(\\\"height\\\", 0);\\n\\n rect.transition()\\n .delay(function(d, i) { return i * 10; })\\n .attr(\\\"y\\\", function(d) { return y(d[1]); })\\n .attr(\\\"height\\\", function(d) { return y(d[0]) - y(d[1]); });\\n\\n g.append(\\\"g\\\")\\n .attr(\\\"class\\\", \\\"axis axis--x\\\")\\n .attr(\\\"transform\\\", \\\"translate(0,\\\" + height + \\\")\\\")\\n .call(d3.axisBottom(x)\\n .tickSize(0)\\n .tickFormat(function(d,i){ return sortingData[i].short_name;})\\n .tickPadding(6));\\n\\n\\n d3.selectAll(\\\"input\\\")\\n .on(\\\"change\\\", changed);\\n svg.call(d3.drag().on(\\\"start\\\", dragStart).on(\\\"end\\\", dragEnd));\\n\\n if (fromMenu) {\\n var timeout = d3.timeout(function() {\\n d3.select(\\\"input[value=\\\\\\\"grouped\\\\\\\"]\\\")\\n .property(\\\"checked\\\", true)\\n .dispatch(\\\"change\\\");\\n }, 2000);\\n } else {\\n var timeout = d3.timeout(function() {\\n d3.select(\\\"input[value=\\\\\\\"grouped\\\\\\\"]\\\")\\n .property(\\\"checked\\\", true)\\n .dispatch(\\\"change\\\");\\n }, 200);\\n }\\n\\n\\n function changed() {\\n if(fromMenu)\\n timeout.stop();\\n if (this.value === \\\"grouped\\\") transitionGrouped();\\n else transitionStacked();\\n }\\n\\n function transitionGrouped() {\\n y.domain([0, yMax]);\\n\\n rect.transition()\\n .duration(500)\\n .delay(function(d, i) { return i * 10; })\\n .attr(\\\"x\\\", function(d, i) { return x(i) + x.bandwidth() / n * this.parentNode.__data__.key; })\\n .attr(\\\"width\\\", x.bandwidth() / n)\\n .transition()\\n .attr(\\\"y\\\", function(d) { return y(d[1] - d[0]); })\\n .attr(\\\"height\\\", function(d) { return y(0) - y(d[1] - d[0]); });\\n }\\n\\n function transitionStacked() {\\n y.domain([0, y1Max]);\\n\\n rect.transition()\\n .duration(500)\\n .delay(function(d, i) { return i * 10; })\\n .attr(\\\"y\\\", function(d) { return y(d[1]); })\\n .attr(\\\"height\\\", function(d) { return y(d[0]) - y(d[1]); })\\n .transition()\\n .attr(\\\"x\\\", function(d, i) { return x(i); })\\n .attr(\\\"width\\\", x.bandwidth());\\n }\\n\\n\\n function getSelectedData(m, param) {\\n\\n var values = [];\\n console.log(\\\"Param name: \\\" + param);\\n\\n\\n for (i = 0; i < m; ++i) {\\n if(param === \\\"Pos\\\")\\n values[i] = 21 - sortingData[i][param]; //position 1 should have the biggest bar\\n else if(param === \\\"GD\\\")\\n values[i] = sortingData[i][param] + Math.abs(minGD);\\n else\\n values[i] = sortingData[i][param];\\n }\\n console.log(\\\"Values: \\\" + values);\\n return values;\\n }\\n\\n\\n // add legend\\nconsole.log(\\\"add legend\\\");\\nvar legend = svg.append(\\\"g\\\")\\n .attr(\\\"class\\\", \\\"legend\\\")\\n .attr(\\\"x\\\", margin.left)\\n .attr(\\\"y\\\", margin.top)\\n .attr(\\\"height\\\", 100)\\n .attr(\\\"width\\\", 100);\\n\\nlegend.selectAll('g').data(params)\\n .enter()\\n .append('g')\\n .each(function (d, i) {\\n var g = d3.select(this);\\n g.append(\\\"rect\\\")\\n .attr(\\\"x\\\", margin.left + i * 100)\\n .attr(\\\"y\\\", margin.top)\\n .attr(\\\"width\\\", 10)\\n .attr(\\\"height\\\", 10)\\n // .style(\\\"fill\\\", color_hash[String(i)][1]);\\n .style(\\\"fill\\\", color(i));\\n\\n g.append(\\\"text\\\")\\n .attr(\\\"x\\\", margin.left + i * 100 + 15)\\n .attr(\\\"y\\\", margin.top + 8)\\n .attr(\\\"height\\\", 30)\\n .attr(\\\"width\\\", 100)\\n // .style(\\\"fill\\\", color_hash[String(i)][1])\\n .style(\\\"fill\\\", color(i))\\n .text(params[i]);\\n\\n });\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb2a9be4ce3da96ed1dea68068911fa2\",\n \"score\": \"0.4744264\",\n \"text\": \"generateItems() {\\n const itemFunc = this.state.itemFunc;\\n const maxValue = this.state.maxValue;\\n const conf = {\\n func: itemFunc, maxValue,\\n itemsPerLevel: this.state.numEntities\\n };\\n const level = this.state.level;\\n\\n // Remove existing items first\\n const items = level.getItems();\\n items.forEach(item => {\\n level.removeItem(item, item.getX(), item.getY());\\n });\\n\\n RG.FACT.addNRandItems(level, this.parser, conf);\\n this.setStateWithLevel(level);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ed23986a357cee01e2a8cb6dde6f9e9\",\n \"score\": \"0.47374883\",\n \"text\": \"_cleanChart() {\\n select(this.node).selectAll('*').remove();\\n select(this.node.parentNode).select('div').remove();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cebee8a90519d5f3ae394a75109ca00\",\n \"score\": \"0.47296157\",\n \"text\": \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cebee8a90519d5f3ae394a75109ca00\",\n \"score\": \"0.47296157\",\n \"text\": \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e130af3fbcbd21ea024b34046184a795\",\n \"score\": \"0.4722191\",\n \"text\": \"removeFluid() {\\n ArrayScraper.scrape(this.fluidGrid, (asset) => {\\n if(asset === null) return;\\n asset.fluid = false;\\n asset.fluidA = asset.fluidA ? false : null;\\n asset.fluidB = asset.fluidB ? false : null;\\n asset.fluidC = asset.fluidC ? false : null;\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a14648cd4d1331903aa283cb938bad7\",\n \"score\": \"0.472085\",\n \"text\": \"function transitionStacked() {\\n updateStack();\\n\\n bar.selectAll(\\\"rect\\\").transition()\\n .duration(300)\\n .delay(function(d, i) { return i * 10; })\\n .attr(\\\"transform\\\", function(d) { return \\\"translate(\\\" + main_x1(x0Value(d)) + \\\",0)\\\"; })\\n .attr(\\\"width\\\", function(d) { return main_x0.rangeBand(); })\\n .attr(\\\"x\\\", function(d) { return main_x0(x0Value(d)); })\\n .transition()\\n .attr(\\\"y\\\", function(d) { return main_y(d.y1); })\\n .attr(\\\"height\\\", function(d) { return main_y(d.y0) - main_y(d.y1); });\\n\\n mini_bar.selectAll(\\\"rect\\\").transition()\\n .duration(300)\\n .delay(function(d, i) { return i * 10; })\\n .attr(\\\"transform\\\", function(d) { return \\\"translate(\\\" + mini_x1(x0Value(d)) + \\\",0)\\\"; })\\n .attr(\\\"width\\\", function(d) { return mini_x0.rangeBand(); })\\n .attr(\\\"x\\\", function(d) { return mini_x0(x0Value(d)); })\\n .transition()\\n .attr(\\\"y\\\", function(d) { return mini_y(d.y1); })\\n .attr(\\\"height\\\", function(d) { return mini_y(d.y0) - mini_y(d.y1); });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2603b3e059ec794b49a37abc1c0f9c19\",\n \"score\": \"0.4715857\",\n \"text\": \"function getNodesByImpact() {\\n \\n //console.log(\\\"begin compute values for stacked chart\\\");\\n\\n var nbTopElts = 5;\\n listOfRelativeImportances = [];\\n \\n netCopy = getListNodesRefsSorted();\\n var fiveMostInfluential = [];\\n //found the 5 most influential works\\n var mostInfluential = netCopy.slice(0,nbTopElts);\\n \\n //init everything to 0\\n for(var i = 0 ; i < nbTopElts+1; i ++){\\n listOfRelativeImportances.push([]);\\n \\n for(var j = 0;j < nbStepsForTools+1; j++){\\n listOfRelativeImportances[i].push(0);\\n }\\n }\\n \\n var listOfnodesAlreadyDone = [];\\n //for each of the top influential node\\n for(var el = 0 ; el < mostInfluential.length; el++){\\n var nodeStudied = mostInfluential[el];\\n for(var fol = 0 ; fol < nodeStudied.refBy.length;fol++){\\n var folNode = nodeStudied.refBy[fol];\\n var indexToIncrement = Math.round(scaleScalingFromDate(folNode.date));\\n \\n listOfRelativeImportances[el][indexToIncrement]++;\\n listOfnodesAlreadyDone.push(folNode);\\n }\\n }\\n //console.log(\\\"topNodesValues added\\\");\\n\\n for(key in network){\\n var thisNode = network[key];\\n if (listOfnodesAlreadyDone.indexOf(thisNode)==-1) {\\n var indexToIncrement = Math.round(scaleScalingFromDate(thisNode.date));\\n listOfRelativeImportances[listOfRelativeImportances.length-1][indexToIncrement]++;\\n }\\n \\n }\\n \\n // console.log(\\\"finished to compute values for stack\\\");\\n\\n // console.log(listOfRelativeImportances);\\n\\n return listOfRelativeImportances;\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffc652595d1b74d8ff86a77f0c64c2c6\",\n \"score\": \"0.47152665\",\n \"text\": \"setFormattedResources() {\\n let children = [];\\n let items = [];\\n this.props.resources.forEach(item => {\\n let formattedItem = this.formatItem(item);\\n if (item.parentUuid == null) items.push(formattedItem);\\n else children.push(formattedItem);\\n });\\n\\n // searches parentItemsArray for a parent. if found, returns new parent array with child added, and removes child from the \\\"children\\\" array defined above\\n let insertIntoParent = (child, childIndex, parentItemsArray) => {\\n //parse nested array structure of items and find parent, insert child where appropriate\\n parentItemsArray.forEach((parentItem, parentIndex) => {\\n if (parentItem.uuid == child.parentUuid) {\\n if (!parentItem.children) parentItemsArray[parentIndex].children = [];\\n parentItemsArray[parentIndex].children.push(child);\\n children.splice(childIndex, 1);\\n } else if (parentItem.children != null) {\\n parentItemsArray[parentIndex].children = insertIntoParent(child, childIndex, parentItem.children);\\n // console.log(\\\"going deeper\\\");\\n }\\n });\\n return parentItemsArray;\\n };\\n\\n // should never go past ~10 or so loops depending on how deeply the items are nested. num is just incase so it doesnt freze the app\\n // each loop can only set 1 generation deeper. keep looping until all generations are set.\\n let num = 1;\\n while (children.length > 0 && num < 500) {\\n num = num + 1;\\n children.forEach((child, childIndex) => (items = insertIntoParent(child, childIndex, items)));\\n }\\n\\n // use this object if root should be collapsible. otherwise just use items array\\n // let data = {\\n // name: \\\"sections\\\",\\n // toggled: true,\\n // children: items,\\n // };\\n this.setState({ data: items });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0344d052d6f534012a773fc1fea8f0e7\",\n \"score\": \"0.4705318\",\n \"text\": \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0344d052d6f534012a773fc1fea8f0e7\",\n \"score\": \"0.4705318\",\n \"text\": \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0344d052d6f534012a773fc1fea8f0e7\",\n \"score\": \"0.4705318\",\n \"text\": \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0344d052d6f534012a773fc1fea8f0e7\",\n \"score\": \"0.4705318\",\n \"text\": \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0344d052d6f534012a773fc1fea8f0e7\",\n \"score\": \"0.4705318\",\n \"text\": \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0344d052d6f534012a773fc1fea8f0e7\",\n \"score\": \"0.4705318\",\n \"text\": \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0344d052d6f534012a773fc1fea8f0e7\",\n \"score\": \"0.4705318\",\n \"text\": \"function stackClear() {\\n this.__data__ = { 'array': [], 'map': null };\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e2832612f7a9afdf079975a7c6b993d\",\n \"score\": \"0.46994403\",\n \"text\": \"_initRemoveVariationButton() {\\n this.removeVariationButton.addEventListener('click', event => {\\n const variables = this.collectionView.dataSet.variables;\\n // This button behaves differently depending on whether it is pressed on a variation or a variable definition\\n // For variations, this should just remove the variation\\n if (this.indexPath.object.sizeClass) {\\n // Update the UI\\n this.collectionView.dataSet.beginUpdates();\\n variables.splice(this.indexPath.row, 1);\\n this.collectionView.dataSet.commitUpdates();\\n\\n // And unregister the variation from the variable provider\\n this.editor.layoutVariableProvider.removeVariationForLayoutVariableNamed(this.indexPath.object.name, {inSizeClass: this.indexPath.object.sizeClass});\\n }\\n else {\\n // For variable definitions, this should unregister all size class variations and also remove the variable itself\\n // TODO: Verify that the variable is not used referened and provide a warning if it is\\n this.collectionView.dataSet.beginUpdates();\\n for (let i = 0; i < variables.length; i++) {\\n const variable = variables[i];\\n if (variable.name == this.indexPath.object.name) {\\n // Remove the variation or variable from the provider\\n if (variable.sizeClass) {\\n this.editor.layoutVariableProvider.removeVariationForLayoutVariableNamed(variable.name, {inSizeClass: variable.sizeClass});\\n }\\n else {\\n this.editor.layoutVariableProvider.unregisterLayoutVariableNamed(variable.name);\\n }\\n\\n // Update the UI's backing data set\\n variables.splice(i, 1);\\n i--;\\n }\\n }\\n\\n this.collectionView.dataSet.commitUpdates();\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d468464c22981ce7ad34dc928b2d8e71\",\n \"score\": \"0.46977377\",\n \"text\": \"prepareContent(){\\n let vGap = 5;\\n let rowHeight = styles.elements.fontSize + vGap;\\n const MAX_HEIGHT = 500;\\n let values = []; // init empty array\\n let inStorage = [];\\n let height = 0; // init height counter\\n const { state } = this.props; // to get nodeId and state data\\n\\n //get data from state.stack || state.queue\\n let storage = undefined;\\n storage = state.stack || state.queue;\\n // console.log(storage.values);\\n // console.log(storage.inStack);\\n if(storage){\\n values = storage.values;\\n height = values.length * rowHeight;\\n if (height) height += vGap;\\n inStorage = storage.inStorage;\\n }\\n return {values,inStorage,height};\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49ba3e191db6447e900626e8d911e58b\",\n \"score\": \"0.4691019\",\n \"text\": \"prepareTiles() {\\n this.grid.eachCell(function (x, y, tile) {\\n if (tile) {\\n tile.mergedFrom = null;\\n tile.savePosition();\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51740e4f2f6ff2a6e01169143a50d884\",\n \"score\": \"0.46906242\",\n \"text\": \"apply() {\\n for (const node of this.nodesToTransform) {\\n const id = this.getOrCreateId(node);\\n let nodeHasBeenTransformed = false;\\n for (const [attribute, transformer] of Object.entries(this.attributeTransformations)) {\\n if (hasAttribute(node, attribute)) {\\n try {\\n nodeHasBeenTransformed = nodeHasBeenTransformed || transformer.transform(node, id);\\n } catch (e) {\\n this.log.debug(\\n `Cannot remove boilerplate. Failed transforming ${attribute}=\\\"${node.attribs[attribute]}\\\".`,\\n e\\n );\\n this.nodesToTransform = this.nodesToTransform.filter(\\n (nodeToTransform) => nodeToTransform !== node\\n );\\n this.canRemoveBoilerplate = false;\\n }\\n }\\n }\\n if (nodeHasBeenTransformed) {\\n node.attribs.id = id;\\n this.ids.add(id);\\n } else {\\n this.transformedNodesCounter--;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e27f12642648966a0418bc2bfae2b51\",\n \"score\": \"0.46904486\",\n \"text\": \"_filterData() {\\n // filter per group\\n const groups = {};\\n this.groups = groups;\\n\\n // split the items per group\\n for (const item of Object.values(this.items)) {\\n // put the item in the correct group\\n const groupName = item.parent ? item.parent.groupId : '';\\n let group = groups[groupName];\\n if (!group) {\\n group = [];\\n groups[groupName] = group;\\n }\\n group.push(item);\\n\\n // calculate the center of the item\\n if (item.data.start) {\\n if (item.data.end) {\\n // range\\n item.center = (item.data.start.valueOf() + item.data.end.valueOf()) / 2;\\n } else {\\n // box, dot\\n item.center = item.data.start.valueOf();\\n }\\n }\\n }\\n\\n // sort the items per group\\n for (let currentGroupName in groups) {\\n if (groups.hasOwnProperty(currentGroupName)) {\\n groups[currentGroupName].sort((a, b) => a.center - b.center);\\n }\\n }\\n\\n this.dataChanged = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fdacf6fc3b58830ca9f7381c0268842\",\n \"score\": \"0.468871\",\n \"text\": \"resetChart() {\\n this.loadingQueue.drain();\\n\\n let props = this.properties;\\n //extract all the props that need\\n //to be passed on to each chart\\n const {\\n xScale,\\n xAccessor,\\n data,\\n xExtents\\n } = props;\\n\\n //extract start and end from extents\\n let extents;\\n if(typeof xExtents == \\\"function\\\") {\\n extents = d3Extents(data, xExtents);\\n }\\n else {\\n extents = xExtents;\\n }\\n\\n const [start, end] = extents;\\n let plotData = plotDataProcessor(data, xAccessor, start, end);\\n\\n this.xScale = xScale.copy();\\n this.xScale.domain([start, end]);\\n this.fullData = data;\\n this.plotData = plotData; //plotData\\n //console.log(this.fullData);\\n this.firstItem = undefined;\\n\\n for(let i = 0; i < this.charts.length; i++) {\\n let chart = this.charts[i];\\n\\n //set the x scales here\\n //let { xScale } = chart.properties;;\\n //xScale.domain([start, end]);\\n\\n chart.setProperties({\\n xScale: this.xScale,\\n //set extents instead of scale\\n xExtents: [start, end],\\n xAccessor: xAccessor,\\n plotData: this.plotData,\\n fullData: this.fullData\\n });\\n\\n const { width, height } = this.properties;\\n //pass them on if only one chart exists\\n if(chart.properties.width == undefined) {\\n chart.setProperties({\\n width: width\\n });\\n }\\n if(chart.properties.height == undefined) {\\n chart.setProperties({\\n height: height\\n });\\n }\\n chart.updateScales(xAccessor, this.plotData, this.fullData);\\n }\\n\\n //the ranges are still not set\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f347476666f2552307198b48eef5d7c\",\n \"score\": \"0.468705\",\n \"text\": \"function cleanUp() {\\n svg.selectAll(\\\".bar\\\").remove();\\n svg.selectAll(\\\".x.axis\\\").remove();\\n svg.selectAll(\\\".y.axis\\\").remove();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c5d479fdf54d60d361b5492b8f660cc\",\n \"score\": \"0.46861002\",\n \"text\": \"function walkTree(node, dataSource) {\\n if (node instanceof formatparse_1.ParseNode) {\\n if (node.parent instanceof source_1.SourceNode && dataSource.format) {\\n dataSource.format.parse = node.assemble();\\n }\\n else {\\n throw new Error('Can only instantiate parse next to source.');\\n }\\n }\\n if (node instanceof facet_1.FacetNode) {\\n if (!dataSource.name) {\\n dataSource.name = \\\"data_\\\" + datasetIndex++;\\n }\\n if (!dataSource.source || dataSource.transform.length > 0) {\\n data.push(dataSource);\\n node.data = dataSource.name;\\n }\\n else {\\n node.data = dataSource.source;\\n }\\n node.assemble().forEach(function (d) { return data.push(d); });\\n // break here because the rest of the tree has to be taken care of by the facet.\\n return;\\n }\\n if (node instanceof transforms_1.FilterNode ||\\n node instanceof nullfilter_1.NullFilterNode ||\\n node instanceof transforms_1.CalculateNode ||\\n node instanceof aggregate_1.AggregateNode ||\\n node instanceof pathorder_1.OrderNode) {\\n dataSource.transform.push(node.assemble());\\n }\\n if (node instanceof nonpositivefilter_1.NonPositiveFilterNode ||\\n node instanceof bin_1.BinNode ||\\n node instanceof timeunit_1.TimeUnitNode ||\\n node instanceof stack_1.StackNode) {\\n dataSource.transform = dataSource.transform.concat(node.assemble());\\n }\\n if (node instanceof dataflow_1.OutputNode) {\\n if (dataSource.source && dataSource.transform.length === 0) {\\n node.source = dataSource.source;\\n }\\n else if (node.parent instanceof dataflow_1.OutputNode) {\\n // Note that an output node may be required but we still do not assemble a\\n // separate data source for it.\\n node.source = dataSource.name;\\n throw new Error('cannot happen');\\n }\\n else {\\n if (!dataSource.name) {\\n dataSource.name = \\\"data_\\\" + datasetIndex++;\\n }\\n // Here we set the name of the datasource we generated. From now on\\n // other assemblers can use it.\\n node.source = dataSource.name;\\n // if this node has more than one child, we will add a datasource automatically\\n if (node.numChildren() === 1 && dataSource.transform.length > 0) {\\n data.push(dataSource);\\n var newData = {\\n name: null,\\n source: dataSource.name,\\n transform: []\\n };\\n dataSource = newData;\\n }\\n }\\n }\\n switch (node.numChildren()) {\\n case 0:\\n // done\\n if (!dataSource.source || dataSource.transform.length > 0) {\\n // do not push empty datasources that are simply references\\n data.push(dataSource);\\n }\\n break;\\n case 1:\\n walkTree(node.children[0], dataSource);\\n break;\\n default:\\n var source_2 = dataSource.name;\\n if (!dataSource.source || dataSource.transform.length > 0) {\\n data.push(dataSource);\\n }\\n else {\\n source_2 = dataSource.source;\\n }\\n node.children.forEach(function (child) {\\n var newData = {\\n name: null,\\n source: source_2,\\n transform: []\\n };\\n walkTree(child, newData);\\n });\\n break;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1255dc2eb4c105293bef1d4fc609f7be\",\n \"score\": \"0.46778196\",\n \"text\": \"cheat() {\\n\\n // First we do a lot of work to stop what's happening and do a \\\"soft\\\" reset\\n this.endAnimation();\\n\\n this.targets.forEach( target => this.returnTarget( target ) );\\n this.endAnimation();\\n\\n this.shapeGroups.forEach( shapeGroup => this.returnShapeGroup( shapeGroup ) );\\n this.numberGroups.forEach( numberGroup => this.returnNumberGroup( numberGroup ) );\\n this.endAnimation();\\n\\n const groupStack = this.hasShapes ? this.shapeGroupStacks[ 0 ] : this.numberGroupStacks[ 0 ];\\n\\n const numGroups = groupStack.array.length;\\n const groups = _.range( 0, numGroups ).map( index => {\\n const point = new Vector2( this.hasShapes ? -100 : 0, ( index - ( numGroups - 1 ) / 2 ) * 100 );\\n\\n return this.pullGroupFromStack( groupStack, point );\\n } );\\n\\n this.endAnimation();\\n\\n if ( this.hasShapes ) {\\n let maxQuantity = 0;\\n const availableCollection = UnitCollection.fractionsToCollection( this.shapeStacks.map( shapeStack => {\\n maxQuantity = Math.max( maxQuantity, shapeStack.array.length );\\n return new Fraction( shapeStack.array.length, shapeStack.fraction.denominator );\\n } ) );\\n const denominators = availableCollection.nonzeroDenominators;\\n const fractions = this.targets.map( target => target.fraction );\\n\\n // Only search over the given denominators\\n const collectionFinder = new CollectionFinder( {\\n denominators: denominators.map( PrimeFactorization.factor )\\n } );\\n\\n const solution = FractionChallenge.findShapeSolution( fractions, collectionFinder, maxQuantity, availableCollection );\\n\\n solution.forEach( ( groupCollections, groupIndex ) => {\\n // Add containers where needed\\n const group = groups[ groupIndex ];\\n while ( group.shapeContainers.length < groupCollections.length ) {\\n group.increaseContainerCount();\\n }\\n\\n // Move the pieces to the containers\\n groupCollections.forEach( ( collection, containerIndex ) => {\\n collection.unitFractions.forEach( fraction => {\\n const stack = _.find( this.shapeStacks, stack => stack.fraction.equals( fraction ) );\\n const piece = this.pullShapePieceFromStack( stack, Vector2.ZERO );\\n this.placeActiveShapePiece( piece, group.shapeContainers.get( containerIndex ), group );\\n } );\\n } );\\n } );\\n }\\n else {\\n const pullNumberPiece = ( number, spot ) => {\\n const stack = _.find( this.numberStacks, stack => stack.number === number );\\n const piece = this.pullNumberPieceFromStack( stack, Vector2.ZERO );\\n this.draggedNumberPieces.remove( piece );\\n this.placeNumberPiece( spot, piece );\\n };\\n\\n const availableQuantities = {};\\n const numbers = this.numberStacks.map( numberStack => {\\n availableQuantities[ numberStack.number ] = numberStack.array.length;\\n return numberStack.number;\\n } );\\n const fractions = [];\\n\\n // if we have mixed numbers, their \\\"whole\\\" parts are exactly computable\\n groups.forEach( ( group, index ) => {\\n let fraction = this.targets[ index ].fraction;\\n if ( group.isMixedNumber ) {\\n const whole = Math.floor( fraction.value );\\n pullNumberPiece( whole, group.wholeSpot );\\n availableQuantities[ whole ]--;\\n fraction = fraction.minusInteger( whole );\\n }\\n fractions.push( fraction.reduced() );\\n } );\\n\\n const solution = FractionChallenge.findNumberSolution( fractions, Math.max( ...numbers ), availableQuantities );\\n\\n groups.forEach( ( group, index ) => {\\n pullNumberPiece( solution[ index ] * fractions[ index ].numerator, group.numeratorSpot );\\n pullNumberPiece( solution[ index ] * fractions[ index ].denominator, group.denominatorSpot );\\n } );\\n }\\n\\n this.endAnimation();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc0ae7df39a50d5c3152a6dfcc17b84f\",\n \"score\": \"0.4675346\",\n \"text\": \"function relayoutDiagramStack(e) {\\r\\n\\t\\tmyDiagram.layout.invalidateLayout(); // but don't invalidate all Layouts that are in Groups\\r\\n\\t\\tmyDiagram.layoutDiagram();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e59a26d7a041753da002d7d65400a366\",\n \"score\": \"0.46719718\",\n \"text\": \"function updateStack() {\\n nestByDate.forEach(function(d) {\\n var y0 = 0;\\n var y1 = 0;\\n d.values.forEach(function(d) {\\n if (d.vis === \\\"1\\\") {\\n d.y0 = y0 + y1;\\n y1 = yValue(d);\\n d.y1 = y1;\\n }\\n });\\n }); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ee92e615343b37b51dffc32f8cbd768\",\n \"score\": \"0.4666193\",\n \"text\": \"function cleanplanets() {\\n var v = [];\\n for (var i = 1; i <= 12; i++) {\\n var eo = xxxgenes(i);\\n v[i] = getHornSet(xxxgenes(i)).trankey;\\n if (v[i].indexOf(\\\"first_bend\\\") === -1) {\\n eo.tranrule = xxxgenes(2).tranrule;\\n eo.first_bend = 0;\\n }\\n for (let gn in genedefs) {\\n var gd = genedefs[gn];\\n if (eo[gn] > gd.max)\\n gd.max = eo[gn];\\n if (eo[gn] < gd.min)\\n gd.min = eo[gn];\\n }\\n }\\n forcerefresh = true;\\n newframe();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8839c7fca820a6b3d59b8bdf0b64da68\",\n \"score\": \"0.4663106\",\n \"text\": \"_reconstructActiveFormattingElements() {\\n\\t\\t\\tconst listLength = this.activeFormattingElements.entries.length;\\n\\t\\t\\tif (listLength) {\\n\\t\\t\\t\\tconst endIndex = this.activeFormattingElements.entries.findIndex((entry) => entry.type === EntryType.Marker || this.openElements.contains(entry.element));\\n\\t\\t\\t\\tconst unopenIdx = endIndex < 0 ? listLength - 1 : endIndex - 1;\\n\\t\\t\\t\\tfor (let i = unopenIdx; i >= 0; i--) {\\n\\t\\t\\t\\t\\tconst entry = this.activeFormattingElements.entries[i];\\n\\t\\t\\t\\t\\tthis._insertElement(entry.token, this.treeAdapter.getNamespaceURI(entry.element));\\n\\t\\t\\t\\t\\tentry.element = this.openElements.current;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a9281eafc495fecc94ab0afadab9c89\",\n \"score\": \"0.46564612\",\n \"text\": \"static remove_former_svg() {\\r\\n d3.select(\\\"#summary\\\").remove();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c70b366aabade0ffbe7500cd3b7dd85\",\n \"score\": \"0.4656305\",\n \"text\": \"function splitItem(pmcData, body, sessionID) { // -> Spliting item / Create new item with splited amount and removing that amount from older one\\n item.resetOutput();\\n\\n let output = item.getOutput();\\n let location = body.container.location;\\n\\n let items = getOwnerInventoryItems(body, sessionID);\\n\\n if (!(\\\"location\\\" in body.container) && body.container.container === \\\"cartridges\\\") {\\n let tmp_counter = 0;\\n\\n for (let item_ammo in items.to) {\\n if (items.to[item_ammo].parentId === body.container.id) {\\n tmp_counter++;\\n }\\n }\\n\\n location = tmp_counter;//wrong location for first cartrige\\n }\\n\\n\\n // The item being merged is possible from three different sources: pmc, scav, or mail.\\n for (let item of items.from) {\\n if (item._id && item._id === body.item) {\\n item.upd.StackObjectsCount -= body.count;\\n\\n let newItem = utility.generateNewItemId();\\n\\n output.data.items.new.push({\\n \\\"_id\\\": newItem,\\n \\\"_tpl\\\": item._tpl,\\n \\\"parentId\\\": body.container.id,\\n \\\"slotId\\\": body.container.container,\\n \\\"location\\\": location,\\n \\\"upd\\\": {\\\"StackObjectsCount\\\": body.count}\\n });\\n\\n items.to.push({\\n \\\"_id\\\": newItem,\\n \\\"_tpl\\\": item._tpl,\\n \\\"parentId\\\": body.container.id,\\n \\\"slotId\\\": body.container.container,\\n \\\"location\\\": location,\\n \\\"upd\\\": {\\\"StackObjectsCount\\\": body.count}\\n });\\n\\n return output;\\n }\\n }\\n\\n return \\\"\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce2ffb1dffdbe506189e3ece415c9db\",\n \"score\": \"0.465316\",\n \"text\": \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce2ffb1dffdbe506189e3ece415c9db\",\n \"score\": \"0.465316\",\n \"text\": \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce2ffb1dffdbe506189e3ece415c9db\",\n \"score\": \"0.465316\",\n \"text\": \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce2ffb1dffdbe506189e3ece415c9db\",\n \"score\": \"0.465316\",\n \"text\": \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce2ffb1dffdbe506189e3ece415c9db\",\n \"score\": \"0.465316\",\n \"text\": \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce2ffb1dffdbe506189e3ece415c9db\",\n \"score\": \"0.465316\",\n \"text\": \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce2ffb1dffdbe506189e3ece415c9db\",\n \"score\": \"0.465316\",\n \"text\": \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce2ffb1dffdbe506189e3ece415c9db\",\n \"score\": \"0.465316\",\n \"text\": \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce2ffb1dffdbe506189e3ece415c9db\",\n \"score\": \"0.465316\",\n \"text\": \"function stackClear() {\\n\\t this.__data__ = { 'array': [], 'map': null };\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dec80a2886b032db1e7388c973ac9160\",\n \"score\": \"0.46511334\",\n \"text\": \"function update(source) {\\n var i = 0;\\n\\n // Compute the new tree layout\\n var root = d3.hierarchy(source.children[0])\\n let bounds = d3.selection()._groups[0][0].getBoundingClientRect()\\n\\n // Set properties of SVG element; should be adjusted for scalability\\n let width = bounds.width,\\n \\t height = bounds.height ;\\n\\n const num_nodes = root.descendants().length\\n\\n var tree = d3.tree()\\n \\t.size([width, height]).separation(function separation(a, b) {\\n return a.parent == b.parent ? 1.5 : 1;\\n });;\\n\\n // Initialize SVG element on page\\n if (d3.select(\\\"#treeSVG\\\")._groups[0][0] != null) {\\n\\n d3.select(\\\"#treeSVG\\\").remove()\\n }\\n\\n var svg = d3.select(\\\"#svg\\\").append(\\\"svg\\\")\\n .attr(\\\"id\\\", \\\"treeSVG\\\")\\n \\t.attr(\\\"viewBox\\\", `-30 -30 ${1.2 * width - num_nodes} ${width - (8000 / num_nodes)}`)\\n .attr(\\\"preserveAspectRatio\\\", \\\"none\\\")\\n .attr(\\\"position\\\", \\\"absolute\\\")\\n .append(\\\"g\\\")\\n \\t//.attr(\\\"transform\\\", \\\"translate(\\\" + (margin.left + width/2) + \\\",\\\" + margin.top + \\\")\\\");\\n\\n var nodes = tree(root).descendants(), links = tree(root).links();\\n // Normalize for fixed-depth.\\n nodes.forEach(function(d) { d.y = d.depth * 100; });\\n\\n // Declare the nodes…\\n var node = svg.selectAll(\\\"g.node\\\")\\n .data(nodes, function(d) { return d.id || (d.id = ++i); });\\n\\n // Enter the nodes.\\n var nodeEnter = node.enter().append(\\\"g\\\")\\n .attr(\\\"class\\\", \\\"node\\\")\\n .attr(\\\"transform\\\", function(d) {\\n return \\\"translate(\\\" + d.x + \\\",\\\" + d.y + \\\")\\\"; });\\n\\n nodeEnter.append(\\\"text\\\")\\n .attr(\\\"y\\\", function(d) {\\n return d.children || d._children ? -18 : 18; })\\n .attr(\\\"dy\\\", \\\".35em\\\")\\n .attr(\\\"text-anchor\\\", \\\"middle\\\")\\n .text(function(d) { return `${d.data.name} ${(d.data.category === undefined ? '' : '(' + d.data.category + ')')}`; })\\n .style(\\\"fill-opacity\\\", 1);\\n\\n // Declare the links…\\n var link = svg.selectAll(\\\"path.link\\\")\\n .data(links, function(d) { return d.target.id; });\\n\\n // Enter the links.\\n link.enter().insert(\\\"line\\\", \\\"g\\\")\\n .attr(\\\"class\\\", \\\"link\\\")\\n .attr('x1', function(d) {return d.source.x;})\\n .attr('y1', function(d) {return d.source.y;})\\n .attr('x2', function(d) {return d.target.x;})\\n .attr('y2', function(d) {return d.target.y - 30;});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de31597a0d6b96f1f271eea81f715d56\",\n \"score\": \"0.4650421\",\n \"text\": \"function scaleItems() {\\n if (rescale) {\\n d3.select('#showgrouppaper svg').selectAll('tmp')\\n .data(items).enter()\\n .append('text')\\n .text(function(d){ return d.title; })\\n .style(style.text)\\n .attr('x', -1000)\\n .attr('y', -1000)\\n .attr('class', 'tmp');\\n \\n var z = d3.selectAll('.tmp')[0]\\n .map(function(x){ return x.getBBox(); });\\n width = d3.max(z.map(function(x){ return x.width; }));\\n margin = margin * width;\\n width = width + 2 * margin;\\n height = d3.max(z.map(function(x){ return x.height+ 15 + margin / 2; }));\\n\\n // cleanup\\n d3.selectAll('.tmp').remove();\\n rescale = false;\\n }\\n }//end scaleItems \",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffa8926081268054279ac2afbaff0f03\",\n \"score\": \"0.46482602\",\n \"text\": \"clear() {\\n this.stack.clear();\\n this.minStack.clear();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea19a6584f7549430ac8321966145275\",\n \"score\": \"0.46473354\",\n \"text\": \"onContainerMouseEnter(e) {\\n delete this.chartPosition;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb90aa64f9bd2a0d2df355d62e2b8868\",\n \"score\": \"0.4645992\",\n \"text\": \"function stackClear() {\\n this.__data__ = new _lodash_ListCache['default']();\\n this.size = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb90aa64f9bd2a0d2df355d62e2b8868\",\n \"score\": \"0.4645992\",\n \"text\": \"function stackClear() {\\n this.__data__ = new _lodash_ListCache['default']();\\n this.size = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64ff81c51d4a9365ab0be5784a659a02\",\n \"score\": \"0.46431178\",\n \"text\": \"handleRemoveSource() {\\n if (this.state.sources.length > MINIMUM_NO_OF_SOURCES) {\\n this.setState((prevState) => ({\\n sources: prevState.sources.splice(0, prevState.sources.length - 1)\\n }));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d6ab1191143b6bf99ed275907214827\",\n \"score\": \"0.4641648\",\n \"text\": \"resetDynamicOffset()\\n {\\n for( let [ groupKey, groupMap ] of this.menuMapMap.entries() )\\n for( let [ key, menu ] of groupMap.entries() )\\n menu.resetDynamicPos();\\n }\",\n \"title\": \"\"\n }\n]"}}},{"rowIdx":2371,"cells":{"query_id":{"kind":"string","value":"b45d824fd9df654e4e99a436b2490f4f"},"query":{"kind":"string","value":"This is a helper function for getting values from parameter/options objects."},"positive_passages":{"kind":"list like","value":[{"docid":"d22db1540664a5972536451271d29bb4","score":"0.0","text":"function getArg(aArgs, aName, aDefaultValue) {\n if (aName in aArgs) {\n return aArgs[aName];\n } else if (arguments.length === 3) {\n return aDefaultValue;\n } else {\n throw new Error('\"' + aName + '\" is a required argument.');\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"d22db1540664a5972536451271d29bb4\",\n \"score\": \"0.0\",\n \"text\": \"function getArg(aArgs, aName, aDefaultValue) {\\n if (aName in aArgs) {\\n return aArgs[aName];\\n } else if (arguments.length === 3) {\\n return aDefaultValue;\\n } else {\\n throw new Error('\\\"' + aName + '\\\" is a required argument.');\\n }\\n }\",\n \"title\": \"\"\n }\n]"},"negative_passages":{"kind":"list like","value":[{"docid":"4394774106cb173cdc8f578392f130a6","score":"0.6616107","text":"getPropertyValues(options) {\n\t\tconst propertyValues = this.propertiesStore.getPropertyValues();\n\t\tlet returnValues = propertyValues;\n\t\tif (options && (options.filterHiddenDisabled || options.filterHidden || options.filterDisabled || options.filterHiddenControls || options.valueFilters)) {\n\t\t\tconst filteredValues = {};\n\t\t\tfor (const propKey in propertyValues) {\n\t\t\t\tif (!has(propertyValues, propKey)) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tconst filteredValue = this.getPropertyValue({ name: propKey }, options);\n\t\t\t\t// only set parameters with values or filter out values specified in config\n\t\t\t\tconst valueFilters = Array.isArray(options.valueFilters) ? options.valueFilters : [];\n\t\t\t\tif (typeof filteredValue !== \"undefined\" && !valueFilters.includes(filteredValue)) {\n\t\t\t\t\tfilteredValues[propKey] = filteredValue;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturnValues = filteredValues;\n\t\t}\n\n\t\t// convert currentParameters of structureType:object to object values\n\t\tif (options && options.applyProperties === true) {\n\t\t\tfor (const controlId in returnValues) {\n\t\t\t\tif (!has(returnValues, controlId)) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tconst propertyId = this.convertPropertyId(controlId);\n\t\t\t\tconst propertyValue = this.propertiesStore.getPropertyValue(propertyId);\n\t\t\t\treturnValues[controlId] = this._convertObjectStructure(propertyId, propertyValue);\n\t\t\t}\n\t\t}\n\n\t\treturn returnValues;\n\t}","title":""},{"docid":"2adde30b3a784abc9cb0402c1abc1566","score":"0.6490959","text":"function getParamValues (paramControls)\n{\n var paramValues = {};\n\n //iterates through the paramControls Arry generated by createParamControls() function\n //\n for(var i = 0; i < paramControls.length; i++)\n {\n var control = paramControls[i];\n\n switch (control.paramType)\n {\n case 'choice':\n\n paramValues[control.paramName] = control.options[control.selectedIndex].value;\n break;\n\n case 'float':\n case 'number':\n\n var value = control.value;\n\n if (!isNaN(parseFloat(value)) && isFinite(value))\n {\n paramValues[control.paramName] = parseFloat(value);\n }\n else\n {\n throw new Error(\"Parameter (\"+control.paramName+\") is not a valid number (\"+value+\")\");\n }\n break;\n\n case 'int':\n\n var value = control.value;\n if (!isNaN(parseFloat(value)) && isFinite(value))\n {\n paramValues[control.paramName] = parseInt(value);\n }\n else\n {\n throw new Error(\"Parameter (\"+control.paramName+\") is not a valid number (\"+value+\")\");\n }\n break;\n\n case 'checkbox':\n case 'radio':\n\n if (control.checked == true && control.value.length > 0)\n {\n paramValues[control.paramName] = control.value;\n }\n else\n {\n paramValues[control.paramName] = control.checked;\n }\n break;\n\n default:\n\n paramValues[control.paramName] = control.value;\n break;\n\n }\n }\n\n // retunrs the paramValues Object allen control Values\n return paramValues;\n}","title":""},{"docid":"b7b829a48b57693d44674caac1f8a3bf","score":"0.64274585","text":"function ewr_GetOptValues(el, form) {\n\tvar $ = jQuery, obj = ($.isString(el)) ? ewr_GetElements(el, form) : el;\n\tif (obj.options) { // Selection list\n\t\treturn $(obj).find(\"option:selected[value!='']\").map(function() {\n\t\t\treturn this.value;\n\t\t}).get();\n\t} else if ($.isNumber(obj.length)) { // Radio/Checkbox list, or element not found\n\t\treturn $(obj).filter(\":checked[value!='{value}']\").map(function() {\n\t\t\treturn this.value;\n\t\t}).get();\n\t} else { // Text/Hidden\n\t\treturn [obj.value];\n\t}\n}","title":""},{"docid":"d05f78c7ceb6644d3dd86b4eef982a9b","score":"0.63283867","text":"static get parameters() {\n }","title":""},{"docid":"e0c08ff8d13983e9a2b111b0ebd5a5a8","score":"0.6195332","text":"function getValues() {\n\t\tvar phpLocation = $dialog.find( 'input[ name=\"php_location\" ]' ).val();\n\t\t\n\t\tvar values = {\n\t\t\tPHPLocation: ParserManager.sanitizePHPLocation( phpLocation ),\n\t\t\tenabledTools: getCheckboxArray( 'enabled' ),\n\t\t\tphpcsStandards: getCheckboxArray( 'phpcs-standards' ),\n\t\t\tphpmdRulesets: getCheckboxArray( 'phpmd-rulesets' )\n\t\t};\n\t\t\n\t\treturn values;\n\t}","title":""},{"docid":"0589eb5a456e87553c6075e1fdda24dc","score":"0.60335475","text":"function getOptions() {\n const o = {};\n input.forEach(i => {\n if(i.slice(0,2) !== '--') return; // we don't deal with unknown params\n const [option,value] = i.slice(2).split('=');\n o[option] = value || true;\n });\n return o;\n}","title":""},{"docid":"32daad4fd8f429e6de4b80be610a340b","score":"0.6001443","text":"_getSelectedOptionValues() {\n return this.options.filter(option => option.selected).map(option => option.value);\n }","title":""},{"docid":"32daad4fd8f429e6de4b80be610a340b","score":"0.6001443","text":"_getSelectedOptionValues() {\n return this.options.filter(option => option.selected).map(option => option.value);\n }","title":""},{"docid":"5f3f54481865d07da28b90d271becb86","score":"0.59724003","text":"function getValues() {\n return {\n city: 'Toronto',\n cuisine: 'Chinese',\n diet: 'vegetarian',\n mealType: 'lunch',\n intolerances: [\"seafood\", \"egg\"]\n }\n }","title":""},{"docid":"d497b0aad03f3a401715f32b4f6ec9ad","score":"0.59136915","text":"function getParameterDefinitions() {\n\treturn [{\n name: 'resolution',\n type: 'choice',\n values: [0, 1, 2, 3, 4],\n captions: ['very low (6,16)', 'low (8,24)', 'normal (12,32)', 'high (24,64)', 'very high (48,128)'],\n initial: 2,\n caption: 'Resolution:'\n }, {\n name: 'part',\n type: 'choice',\n values: ['flat', 'mount', 'camera'],\n captions: ['flat', 'mount', 'camera'],\n initial: 'flat',\n caption: 'Part:'\n }];\n}","title":""},{"docid":"0586190b2eddbc9d85f3d7faaf9ebd5b","score":"0.5896936","text":"function getSelectedValues(obj)\r\n {\r\n \tvar selectedValues = new Array();\r\n\tvar j = 0;\r\n\tfor(i = 0 ; i < obj.options.length ; i++)\r\n\t {\r\n\t\toptionElement = obj.options[i];\r\n\t \tif(optionElement.selected)\r\n\t\t {\r\n\t\t \tselectedValues[j] = optionElement.value;\r\n\t\t\tj++;\r\n\t\t }\r\n\t }\r\n\t return selectedValues;\r\n }","title":""},{"docid":"c916f7a74c75e04df0c0fb676ae7cda5","score":"0.5840894","text":"function getRuleParametersFromOptions(options) {\n var ruleParams = new Object();\n \n // Set the form for further use\n ruleParams.form = $(options.form);\n \n if (options.params.field) {\n // Get full name of field\n var elementName = $(options.element).attr(\"name\");\n var prefix = getModelPrefix(elementName);\n var field = options.params.field;\n var fullFieldName = appendModelPrefix(field, prefix);\n var searchPattern = \":input[name='\" + fullFieldName + \"']\";\n var element = $(options.form).find(\":input[name='\" + fullFieldName + \"']\").first();\n \n // Set values of ruleParams.\n // We set searchPattern as a value instead of element itslef\n // because if we set element as a value and element\n // is renewed somehow using Ajax or other options,\n // we will not be able to get new value.\n ruleParams.type = \"field\";\n ruleParams.value = searchPattern;\n }\n else if (options.params.value) {\n // Set values of ruleParams\n ruleParams.type = \"value\";\n ruleParams.value = options.params.value;\n }\n \n return ruleParams;\n }","title":""},{"docid":"9c13e6491827705e324624f5ae5f7323","score":"0.5831037","text":"function getBundleOptions(options) {\n let data = getData(options.value);\n return { data };\n }","title":""},{"docid":"712e9a2c518f43c34416168e9bfb7321","score":"0.5796174","text":"getModelOptionValues() {\n $(document).ready(() => {\n \n Factory.getStaticInstance(this.attribute.model)\n .all()\n .then((objects) => {\n \n this.optionValues = _.map(objects, (object) => {\n return {\n id: object.id, \n value: object[this.attribute.referenceField]\n }\n });\n });\n });\t\n }","title":""},{"docid":"a7c0e4dd09a05e1c2b04c7727f519728","score":"0.5794112","text":"get options() {\n return this[$options];\n }","title":""},{"docid":"7b61fb25b417b63f26421c95d239e14f","score":"0.57874525","text":"getValues() {}","title":""},{"docid":"64d075896a9084fb52ed0ae26593cf80","score":"0.57804525","text":"function getFormValuesAsGetParameters() {\n const addIfPresent = (params, key, id) => {\n const val = getInputValue(id);\n if (val === null) {\n return;\n }\n params.push(key + '=' + encodeURIComponent(val.trim()));\n };\n const params = [];\n addIfPresent(params, 'host', HOST_FIELD_ID);\n addIfPresent(params, 'token', HEC_TOKEN_FIELD_ID);\n addIfPresent(params, 'port', PORT_FIELD_ID);\n addIfPresent(params, 'index', INDEX_FIELD_ID);\n addIfPresent(params, 'upload_interval', POLL_INTERVAL_FIELD_ID);\n if (document.getElementById(DISABLE_SSL_VERIFY_CHECK_ID).checked) {\n params.push('disable_ssl_verify=true');\n }\n return '?' + params.join('&');\n}","title":""},{"docid":"45754dcf4e0627a28df15364a4c3ca29","score":"0.57712907","text":"get values() {\n return this.queryItemsByPropertyValue('selected', true)\n .map((item) => this.composer.getItemPropertyValue(item, 'value'));\n }","title":""},{"docid":"cc521a8981d5241938340bea28fe9d9f","score":"0.57626486","text":"function getPicklistValues(ples){\n\t\t\tvar res = [];// defaultValue\n\t\t\t// add a blank option.{--None--}\n\t\t\tres = ples;\n\t\t\t// res.splice(0, 0, selectoptionObject(true, '--None--', null, false));\n\t\t\treturn res;\n\t\t}","title":""},{"docid":"e0ceff089b568fcd55000bd6e2287aa5","score":"0.57085353","text":"getValueFromOption(value) {\n\n\t\t\tlet output;\n\t\t\tconst args = Array.prototype.slice.call(arguments, 1);\n\n\t\t\tif (typeof value === \"function\") {\n\t\t\t\toutput = value.apply(this, args);\n\t\t\t} else {\n\t\t\t\toutput = value;\n\t\t\t}\n\n\t\t\treturn output;\n\n\t\t}","title":""},{"docid":"4ce59b0aa4c65d706b74a7c7cb5c9a2d","score":"0.56772727","text":"get options() {\n let options = {};\n\n for (let o of this.tuiOptions) {\n let [optionName, , tuiOption] = o.split(':');\n tuiOption = tuiOption ? tuiOption : optionName;\n let value = this.args[optionName];\n\n if (value !== undefined) {\n options[tuiOption] = value;\n }\n }\n\n return options;\n }","title":""},{"docid":"0b865b685c0edf0df1dee943cf5e5a91","score":"0.56748515","text":"function processOptionsFromArgs() {\n\tlet rawOptions = getOptionsFromArgs();\n\tfor (let key in rawOptions) {\n\t\tif (!options.hasOwnProperty(key)) {\n\t\t\tconsole.warn(`Unknown option: ${key}`);\n\t\t\tcontinue;\n\t\t}\n\n\t\tlet context = exports.getTestMode();\n\t\tlet optionsData = options[key];\n\t\tif (!optionsData.context.includes(context)) {\n\t\t\tconsole.warn(`The option is not allowed in ${context} context: ${key}`);\n\t\t\tcontinue;\n\t\t}\n\n\t\tlet val = rawOptions[key];\n\t\ttry {\n\t\t\tswitch (optionsData.type) {\n\t\t\t\tcase TYPE_BOOLEAN: {\n\t\t\t\t\toptions[key].value = processBooleanOption(val);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase TYPE_ARRAY: {\n\t\t\t\t\toptions[key].value = processArrayOption(val);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (err) {\n\t\t\tconsole.warn(`Unknown value of '${key}' option: ${val}`);\n\t\t}\n\t}\n}","title":""},{"docid":"5ab4fe0dbea84d3f781bd89302f42010","score":"0.5667225","text":"function getBundleOptions(options) {\n let data = getData(options.value);\n let metadata = getMetadata(options.value);\n let trusted = !!options.trusted;\n return { data, metadata, trusted };\n }","title":""},{"docid":"ed8e58e96473676b55812ccdcd209d32","score":"0.56647956","text":"function getOptions() {\n return pluck(program, [\n 'title', 'theme', 'style', 'output', 'controls', 'progress', 'encoding',\n 'template', 'layout', 'debug'\n ]);\n}","title":""},{"docid":"897de0d406068ee36accb9e8351c57da","score":"0.56557137","text":"function getOptions(arg, hasTime){\n\t\tswitch(typeof(arg)){\n\t\t\tcase \"function\":\n\t\t\t\treturn {\n\t\t\t\t\tcallback: arg,\n\t\t\t\t\ttime: undefined\n\t\t\t\t};\n\t\t\tcase \"object\":\n\t\t\t\tvar ret = {\n\t\t\t\t\tmax: arg.max,\n\t\t\t\t\tstart: arg['start-index']\n\t\t\t\t};\n\t\t\t\tif(hasTime) ret.time = arg.time;\n\t\t\t\treturn ret;\n\t\t\tdefault: return {}; break;\n\t\t}\n\t}","title":""},{"docid":"75d0388977d327d5cd0511bd307bfcd5","score":"0.5645267","text":"function GetParametersFromInputFields() {\n\t\n\tvar param_names = document.getElementsByClassName(\"param_name\"),\n\tparam_values = document.getElementsByClassName(\"param_value\"),\n\tparamObj = {},\n\ti;\n\t\n\tfor (i = 0; i < param_names.length; i++) {\n\t\tvar key = param_names[i].value,\n\t\tvalue = param_values[i].value;\n\t\t\n\t\tif (key != '' && value != '') {\n\t\t\tparamObj[key] = value;\n\t\t\t\n\t\t}\n\t}\n\t\n\treturn paramObj;\n}","title":""},{"docid":"33b8741ab5752f14a8a0d17556f850be","score":"0.56189084","text":"function collectOptions(id) {\n var resultOptions = {};\n var options = document.getElementById(id).options;\n for (var i = 0, len = options.length; i < len; i++) {\n resultOptions[convertToURLString(options[i].text)] = options[i].value;\n }\n return resultOptions;\n}","title":""},{"docid":"0b09988a51c855966d2d088a657eb768","score":"0.561485","text":"function getAllValues(){\n prae = prae_slider.value;\n sens = sens_slider.value;\n spec = spec_slider.value;\n test = test_slider.value;\n}","title":""},{"docid":"e541a90a32b715eafd3727beac7c42ce","score":"0.5601151","text":"function retrieveRawOption(option) {\n var ret = {};\n each(['start', 'end', 'startValue', 'endValue', 'throttle'], function (name) {\n option.hasOwnProperty(name) && (ret[name] = option[name]);\n });\n return ret;\n }","title":""},{"docid":"17d74408febe4a38ec8171a47ba88cd8","score":"0.559698","text":"options(options) {\n\t\treturn {\n\t \"requests\": [\n\t {\n\t \"service\": \"OPTION\",\n\t \"requestid\": this.requestId++,\n\t \"command\": \"SUBS\",\n\t \"account\": this.auth.accounts[0].accountId,\n\t \"source\": this.auth.streamerInfo.appId,\n\t \"parameters\": {\n\t \"keys\": options.join(), //callOption(\"TQQQ\", \"06\", \"25\", \"21\", \"109\"),\n\t \"fields\": \"0,2,3\"\n\t }\n\t }\n\t ]\n\t }\n\t}","title":""},{"docid":"5e7a8bf5977a41f72132403d40f80676","score":"0.5584888","text":"selectedOptionObject(obj) {\n if (obj == null) {\n return null;\n } else {\n var result = [];\n for (let i = 0; i < obj.length; i++) {\n result.push(obj[i].value);\n }\n return result;\n }\n }","title":""},{"docid":"d48b4eb65709a390115edf3a239ba7b6","score":"0.55528843","text":"GetParmValue(propsName) {\n try {\n return propsName['paravalue']\n }\n catch (e) {\n OreAlert.alert(e)\n }\n }","title":""},{"docid":"8104ea33282b418c71b1363c0ca32eed","score":"0.55452824","text":"function selectGetValues (Select, bValueAsString){\n var Fn = \"[util.js selectGetValues] \";\n var szValues = \"\";\n var bFirst = true;\n \n if (bValueAsString == undefined){\n \tbValueAsString = false;\n }\n if (!Select){\n return jslog(JSLOG_JSU,Fn + \"Select =0 NOTHING to DO\");\n }\n for (var iOpt=0; iOpt < Select.options.length; iOpt ++){\n var Opt = Select.options[iOpt];\n var szVal = Opt.value;\n \tif (bValueAsString){\n szVal = \"'\" + szVal + \"'\";\n \t} \n\t if (bFirst){\n szValues = szVal;\n bFirst = false;\n } else {\n szValues = szValues + \", \" + szVal;\n }\t \n }\n return szValues;\n}","title":""},{"docid":"3a2339412deea6a4452786ea411286e0","score":"0.55438036","text":"getOptions() {\n // Plugins with no options don't need any of this\n if (!this.constructor.options) {\n return {};\n }\n\n const attributes = this.elem.attributes;\n const defaults = this.constructor.options;\n const options = _.mapValues(defaults, value => value[1]);\n\n for (const i in attributes) {\n const attr = attributes[i];\n\n // Only examine data attributes\n if (attr.name && attr.name.indexOf('data-') === 0) {\n const optionName = _.camelCase(attr.name.replace(/^data-/, ''));\n\n if (optionName in options) {\n const type = defaults[optionName][0];\n const attrValue = attr.value === '' ? true : attr.value;\n let value;\n\n // You can't cast to false with Boolean('false')\n if (type === Boolean) {\n if (attrValue === 'true') {\n value = true;\n } else {\n value = false;\n }\n } else if (Array.isArray(type)) {\n if (type.indexOf(attrValue) > -1) {\n value = attrValue;\n } else {\n value = defaults[optionName][1];\n }\n } else {\n value = type(attrValue);\n }\n\n options[optionName] = value;\n }\n }\n }\n\n return options;\n }","title":""},{"docid":"894da51699c962be9b5e5e7928748d4f","score":"0.5541765","text":"getParameters(opts = {}) {\n const {parameters, keys} = {};\n\n // Get parameter definitions for this Resource\n const PARAMETERS = this.constructor.PARAMETERS || {};\n\n const isWebgl2 = Object(_webgl_utils__WEBPACK_IMPORTED_MODULE_1__[\"isWebGL2\"])(this.gl);\n\n const values = {};\n\n // Query all parameters if no list provided\n const parameterKeys = parameters || Object.keys(PARAMETERS);\n\n // WEBGL limits\n for (const pname of parameterKeys) {\n const parameter = PARAMETERS[pname];\n\n // Check if this parameter is available on this platform\n const parameterAvailable =\n parameter &&\n (!('webgl2' in parameter) || isWebgl2) &&\n (!('extension' in parameter) || this.gl.getExtension(parameter.extension));\n\n if (parameterAvailable) {\n const key = keys ? Object(_webgl_utils__WEBPACK_IMPORTED_MODULE_1__[\"getKey\"])(this.gl, pname) : pname;\n values[key] = this.getParameter(pname, opts);\n if (keys && parameter.type === 'GLenum') {\n values[key] = Object(_webgl_utils__WEBPACK_IMPORTED_MODULE_1__[\"getKey\"])(this.gl, values[key]);\n }\n }\n }\n\n return values;\n }","title":""},{"docid":"2466550e49fca1db505600213ae793fa","score":"0.5541114","text":"function getArgumentValues(args, variables) {\n var values = {};\n args.forEach(function (arg) {\n if (arg.kind === VARIABLE) {\n values[arg.name] = getVariableValue(arg.variableName, variables);\n } else {\n values[arg.name] = arg.value;\n }\n });\n return values;\n}","title":""},{"docid":"eb93e098bd5cf7d082f3cdcdd2d6bf48","score":"0.55119056","text":"function optionsFromUrlParms() { \n // this function will be invoked after specs load\n // as it must be able to overide options in specs\n\n /*-------------------------------------------\n ** get useInfluxDB from URL parameter if any,\n ** replace \"all\" by \"sbweio\"\n **/\n\n if (urlParams.has(\"useInfluxDB\")) {\n if (urlParams.get(\"useInfluxDB\") === \"true\") { options.useInfluxDB = true; }\n else if (urlParams.get(\"useInfluxDB\") === \"false\") { options.useInfluxDB = false; }\n else { alert(\"Invalid parameter useInfluxBD; parameter ignored.\")}\n }\n\n /*-----------------------------------------------\n ** get logTypes string from URL parameter if any,\n ** replace \"all\" by \"sbweio\"\n **/\n\n if (urlParams.has(\"logTypes\")) {\n options.logTypes = urlParams.get(\"logTypes\");\n }\n if (options.logTypes == \"all\") {\n options.logTypes = \"sbweio\";\n }\n\n /*------------------------------------------\n ** get timeTolSec from URL parameter if any\n **/\n if (urlParams.has(\"timeTolSec\")) {\n options.timeTolSec = urlParams.get(\"timeTolSec\");\n }\n options.timeTolSec = parseInt(options.timeTolSec);\n if (!Number.isSafeInteger(options.timeTolSec)) {\n options.timeTolSec = 0;\n alert(\"options.timeTolSec is not a number, \\n replaced by '\" + options.timeTolSec + \"'\");\n }\n\n /*-----------------------------------------\n ** get hotdeckSec from URL parameter if any // deprecated\n **/\n if (urlParams.has(\"hotdeckSec\")) {\n options.hotdeckSec = urlParams.get(\"hotdeckSec\");\n }\n options.hotdeckSec = parseInt(options.hotdeckSec);\n if (!Number.isSafeInteger(options.hotdeckSec)) {\n options.hotdeckSec = 0;\n alert(\"options.hotdeckSec is not a number, \\n replaced by \" + options.hotdeckSec);\n }\n\n /*-------------------------------------------------------------\n ** get policy and related parameters from URL parameter if any;\n ** if policy not provided, other related parameters are ignored\n **/\n if (urlParams.has(\"policy\")) {\n options.subscribePolicy.policy = urlParams.get(\"policy\");\n if (![\"instant\", \"ideal\", \"fixed\"].includes(options.subscribePolicy.policy)) {\n options.subscribePolicy.policy = \"instant\";\n alert(\"invalid options.subscribePolicy.policy, \\n replaced by '\" + options.subscribePolicy.policy +\"'\"); \n }\n if ([\"instant\", \"ideal\"].includes(options.subscribePolicy.policy)) {\n // ==> period ignored\n if (urlParams.has(\"minPeriod\")) {\n options.subscribePolicy.minPeriod = urlParams.get(\"minPeriod\");\n }\n options.subscribePolicy.minPeriod = parseInt(options.subscribePolicy.minPeriod);\n if (!Number.isSafeInteger(options.subscribePolicy.minPeriod)) {\n options.subscribePolicy.minPeriod = 100;\n alert(\"options.subscribePolicy.minPeriod is not a number \\n replaced by \" + options.subscribePolicy.minPeriod); \n }\n else {\n // \"fixed\" ==> minPeriod ignored\n if (urlParams.has(\"period\")) {\n options.subscribePolicy.period = urlParams.get(\"period\");\n }\n options.subscribePolicy.period = parseInt(options.subscribePolicy.period);\n if (!Number.isSafeInteger(options.subscribePolicy.period)) {\n options.subscribePolicy.period = 950;\n alert(\"options.subscribePolicy.period is not a number, \\n replaced by \" + options.subscribePolicy.period);\n } \n }\n }\n }\n}","title":""},{"docid":"0fa058895a8ce56dba6ce35fce0b2077","score":"0.5504275","text":"getParams() {\n return {\n value: this.value, \n name: this.name,\n unit: this.unit\n }\n }","title":""},{"docid":"e6c71f615e1924101372f130a7979dd7","score":"0.54995114","text":"get IncorrectParameters() {}","title":""},{"docid":"adc9ae74d5047ba819d241f21ac1cbaf","score":"0.54986256","text":"filterOptions(val, options, permitValues) {\n if (val === '') return options\n let responseOptions = []//Response options\n //Filter\n for (let opt of options) {\n //Search in options\n if (JSON.stringify(opt).toLowerCase().indexOf(val.toLowerCase()) > -1)\n responseOptions.push(opt)\n //IF exist param permitvalues, compare if option exist\n else if (permitValues) {\n let optValue = opt.value.toString()//Parse value\n if (typeof (permitValues) == 'object') {\n permitValues.forEach(item => {\n if (item.toString() == optValue) responseOptions.push(opt)\n })\n } else if (permitValues.toString() == optValue) responseOptions.push(opt)\n }\n }\n //Response\n return responseOptions\n }","title":""},{"docid":"9ca2621ea8babcdf1ec00f74a60fa0ac","score":"0.54954034","text":"function getOptions(options_list, k) {\n for (var dict of options_list) {\n for (var key in dict) {\n if (key == k) {\n return dict[key];\n }\n }\n }\n return null;\n }","title":""},{"docid":"074bc3faf955990a298ad14436afbaed","score":"0.54809064","text":"values() {\n const values = {};\n\n Object.values(this.config.fields).forEach((field) => {\n const { name, type } = field;\n\n Object.defineProperty(values, name, {\n get: () => {\n this.ensureValueExist();\n\n if (['multi-entity-id-select', 'multi-select'].includes(type)) {\n return this.condition.value[name] || [];\n }\n\n return this.condition.value[name];\n },\n set: (value) => {\n this.ensureValueExist();\n this.condition.value = { ...this.condition.value, [name]: value };\n },\n });\n });\n\n return values;\n }","title":""},{"docid":"aaa0f364ee8e2fd0cbb0c5f504e925e4","score":"0.54794693","text":"function dependent_option( val, data ) {\n options = {}\n for (var field in opttree) {\n if (opttree.hasOwnProperty(field)) {\n $.extend(true, options, opttree[field][data.values[field]]);\n }\n }\n\n return options;\n}","title":""},{"docid":"6994ca25fc820010d849ac5759d24335","score":"0.54783803","text":"function sc_values() {\n if (arguments.length === 1)\n return arguments[0];\n else\n return new sc_Values(arguments);\n}","title":""},{"docid":"03123871cd076b96c54b1890c4c0fbb1","score":"0.5473877","text":"function getArgumentValues(def, node, variableValues) {\n\t var coercedValues = {};\n\t var argDefs = def.args;\n\t var argNodes = node.arguments;\n\t if (!argDefs || !argNodes) {\n\t return coercedValues;\n\t }\n\t var argNodeMap = keyMap(argNodes, function (arg) {\n\t return arg.name.value;\n\t });\n\t for (var i = 0; i < argDefs.length; i++) {\n\t var argDef = argDefs[i];\n\t var name = argDef.name;\n\t var argType = argDef.type;\n\t var argumentNode = argNodeMap[name];\n\t var defaultValue = argDef.defaultValue;\n\t if (!argumentNode) {\n\t if (!isInvalid(defaultValue)) {\n\t coercedValues[name] = defaultValue;\n\t } else if (isNonNullType(argType)) {\n\t throw new GraphQLError('Argument \"' + name + '\" of required type ' + ('\"' + String(argType) + '\" was not provided.'), [node]);\n\t }\n\t } else if (argumentNode.value.kind === Kind.VARIABLE) {\n\t var variableName = argumentNode.value.name.value;\n\t if (variableValues && Object.prototype.hasOwnProperty.call(variableValues, variableName) && !isInvalid(variableValues[variableName])) {\n\t // Note: this does not check that this variable value is correct.\n\t // This assumes that this query has been validated and the variable\n\t // usage here is of the correct type.\n\t coercedValues[name] = variableValues[variableName];\n\t } else if (!isInvalid(defaultValue)) {\n\t coercedValues[name] = defaultValue;\n\t } else if (isNonNullType(argType)) {\n\t throw new GraphQLError('Argument \"' + name + '\" of required type \"' + String(argType) + '\" was ' + ('provided the variable \"$' + variableName + '\" which was not provided ') + 'a runtime value.', [argumentNode.value]);\n\t }\n\t } else {\n\t var valueNode = argumentNode.value;\n\t var coercedValue = valueFromAST(valueNode, argType, variableValues);\n\t if (isInvalid(coercedValue)) {\n\t // Note: ValuesOfCorrectType validation should catch this before\n\t // execution. This is a runtime check to ensure execution does not\n\t // continue with an invalid argument value.\n\t throw new GraphQLError('Argument \"' + name + '\" has invalid value ' + print(valueNode) + '.', [argumentNode.value]);\n\t }\n\t coercedValues[name] = coercedValue;\n\t }\n\t }\n\t return coercedValues;\n\t}","title":""},{"docid":"4d34d2d419314a03575b1ae6fee75e8a","score":"0.5467319","text":"getOptions(){\n return this.toOptionsObject()\n }","title":""},{"docid":"1b4c34f18fab4f8f55ea3670f4516550","score":"0.5454","text":"function getParams(params){\n return _.pick(params, 'name', 'isPublic', 'sportId', 'dateYear', 'dateMonth', 'dateDay', 'dateHour', 'dateMinute');\n}","title":""},{"docid":"133e46ced2a259df138fbfb4c2eb464c","score":"0.5451617","text":"function getSelectedValues(options) {\n return Array.from(options).filter(function (el) {\n return el.selected;\n }).map(function (el) {\n return el.value;\n });\n}","title":""},{"docid":"133e46ced2a259df138fbfb4c2eb464c","score":"0.5451617","text":"function getSelectedValues(options) {\n return Array.from(options).filter(function (el) {\n return el.selected;\n }).map(function (el) {\n return el.value;\n });\n}","title":""},{"docid":"133e46ced2a259df138fbfb4c2eb464c","score":"0.5451617","text":"function getSelectedValues(options) {\n return Array.from(options).filter(function (el) {\n return el.selected;\n }).map(function (el) {\n return el.value;\n });\n}","title":""},{"docid":"4a62f3b5ba79bc5fd81fb4723d270914","score":"0.5442953","text":"function getSelectValues(select){\n\tlet result = [];\n\tlet options = select && select.selectedOptions;\n\n\tfor (var i=0, iLen=options.length; i 0)\\n {\\n paramValues[control.paramName] = control.value;\\n }\\n else\\n {\\n paramValues[control.paramName] = control.checked;\\n }\\n break;\\n\\n default:\\n\\n paramValues[control.paramName] = control.value;\\n break;\\n\\n }\\n }\\n\\n // retunrs the paramValues Object allen control Values\\n return paramValues;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7b829a48b57693d44674caac1f8a3bf\",\n \"score\": \"0.64274585\",\n \"text\": \"function ewr_GetOptValues(el, form) {\\n\\tvar $ = jQuery, obj = ($.isString(el)) ? ewr_GetElements(el, form) : el;\\n\\tif (obj.options) { // Selection list\\n\\t\\treturn $(obj).find(\\\"option:selected[value!='']\\\").map(function() {\\n\\t\\t\\treturn this.value;\\n\\t\\t}).get();\\n\\t} else if ($.isNumber(obj.length)) { // Radio/Checkbox list, or element not found\\n\\t\\treturn $(obj).filter(\\\":checked[value!='{value}']\\\").map(function() {\\n\\t\\t\\treturn this.value;\\n\\t\\t}).get();\\n\\t} else { // Text/Hidden\\n\\t\\treturn [obj.value];\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d05f78c7ceb6644d3dd86b4eef982a9b\",\n \"score\": \"0.63283867\",\n \"text\": \"static get parameters() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0c08ff8d13983e9a2b111b0ebd5a5a8\",\n \"score\": \"0.6195332\",\n \"text\": \"function getValues() {\\n\\t\\tvar phpLocation = $dialog.find( 'input[ name=\\\"php_location\\\" ]' ).val();\\n\\t\\t\\n\\t\\tvar values = {\\n\\t\\t\\tPHPLocation: ParserManager.sanitizePHPLocation( phpLocation ),\\n\\t\\t\\tenabledTools: getCheckboxArray( 'enabled' ),\\n\\t\\t\\tphpcsStandards: getCheckboxArray( 'phpcs-standards' ),\\n\\t\\t\\tphpmdRulesets: getCheckboxArray( 'phpmd-rulesets' )\\n\\t\\t};\\n\\t\\t\\n\\t\\treturn values;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0589eb5a456e87553c6075e1fdda24dc\",\n \"score\": \"0.60335475\",\n \"text\": \"function getOptions() {\\n const o = {};\\n input.forEach(i => {\\n if(i.slice(0,2) !== '--') return; // we don't deal with unknown params\\n const [option,value] = i.slice(2).split('=');\\n o[option] = value || true;\\n });\\n return o;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32daad4fd8f429e6de4b80be610a340b\",\n \"score\": \"0.6001443\",\n \"text\": \"_getSelectedOptionValues() {\\n return this.options.filter(option => option.selected).map(option => option.value);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32daad4fd8f429e6de4b80be610a340b\",\n \"score\": \"0.6001443\",\n \"text\": \"_getSelectedOptionValues() {\\n return this.options.filter(option => option.selected).map(option => option.value);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f3f54481865d07da28b90d271becb86\",\n \"score\": \"0.59724003\",\n \"text\": \"function getValues() {\\n return {\\n city: 'Toronto',\\n cuisine: 'Chinese',\\n diet: 'vegetarian',\\n mealType: 'lunch',\\n intolerances: [\\\"seafood\\\", \\\"egg\\\"]\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d497b0aad03f3a401715f32b4f6ec9ad\",\n \"score\": \"0.59136915\",\n \"text\": \"function getParameterDefinitions() {\\n\\treturn [{\\n name: 'resolution',\\n type: 'choice',\\n values: [0, 1, 2, 3, 4],\\n captions: ['very low (6,16)', 'low (8,24)', 'normal (12,32)', 'high (24,64)', 'very high (48,128)'],\\n initial: 2,\\n caption: 'Resolution:'\\n }, {\\n name: 'part',\\n type: 'choice',\\n values: ['flat', 'mount', 'camera'],\\n captions: ['flat', 'mount', 'camera'],\\n initial: 'flat',\\n caption: 'Part:'\\n }];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0586190b2eddbc9d85f3d7faaf9ebd5b\",\n \"score\": \"0.5896936\",\n \"text\": \"function getSelectedValues(obj)\\r\\n {\\r\\n \\tvar selectedValues = new Array();\\r\\n\\tvar j = 0;\\r\\n\\tfor(i = 0 ; i < obj.options.length ; i++)\\r\\n\\t {\\r\\n\\t\\toptionElement = obj.options[i];\\r\\n\\t \\tif(optionElement.selected)\\r\\n\\t\\t {\\r\\n\\t\\t \\tselectedValues[j] = optionElement.value;\\r\\n\\t\\t\\tj++;\\r\\n\\t\\t }\\r\\n\\t }\\r\\n\\t return selectedValues;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c916f7a74c75e04df0c0fb676ae7cda5\",\n \"score\": \"0.5840894\",\n \"text\": \"function getRuleParametersFromOptions(options) {\\n var ruleParams = new Object();\\n \\n // Set the form for further use\\n ruleParams.form = $(options.form);\\n \\n if (options.params.field) {\\n // Get full name of field\\n var elementName = $(options.element).attr(\\\"name\\\");\\n var prefix = getModelPrefix(elementName);\\n var field = options.params.field;\\n var fullFieldName = appendModelPrefix(field, prefix);\\n var searchPattern = \\\":input[name='\\\" + fullFieldName + \\\"']\\\";\\n var element = $(options.form).find(\\\":input[name='\\\" + fullFieldName + \\\"']\\\").first();\\n \\n // Set values of ruleParams.\\n // We set searchPattern as a value instead of element itslef\\n // because if we set element as a value and element\\n // is renewed somehow using Ajax or other options,\\n // we will not be able to get new value.\\n ruleParams.type = \\\"field\\\";\\n ruleParams.value = searchPattern;\\n }\\n else if (options.params.value) {\\n // Set values of ruleParams\\n ruleParams.type = \\\"value\\\";\\n ruleParams.value = options.params.value;\\n }\\n \\n return ruleParams;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c13e6491827705e324624f5ae5f7323\",\n \"score\": \"0.5831037\",\n \"text\": \"function getBundleOptions(options) {\\n let data = getData(options.value);\\n return { data };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"712e9a2c518f43c34416168e9bfb7321\",\n \"score\": \"0.5796174\",\n \"text\": \"getModelOptionValues() {\\n $(document).ready(() => {\\n \\n Factory.getStaticInstance(this.attribute.model)\\n .all()\\n .then((objects) => {\\n \\n this.optionValues = _.map(objects, (object) => {\\n return {\\n id: object.id, \\n value: object[this.attribute.referenceField]\\n }\\n });\\n });\\n });\\t\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7c0e4dd09a05e1c2b04c7727f519728\",\n \"score\": \"0.5794112\",\n \"text\": \"get options() {\\n return this[$options];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b61fb25b417b63f26421c95d239e14f\",\n \"score\": \"0.57874525\",\n \"text\": \"getValues() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64d075896a9084fb52ed0ae26593cf80\",\n \"score\": \"0.57804525\",\n \"text\": \"function getFormValuesAsGetParameters() {\\n const addIfPresent = (params, key, id) => {\\n const val = getInputValue(id);\\n if (val === null) {\\n return;\\n }\\n params.push(key + '=' + encodeURIComponent(val.trim()));\\n };\\n const params = [];\\n addIfPresent(params, 'host', HOST_FIELD_ID);\\n addIfPresent(params, 'token', HEC_TOKEN_FIELD_ID);\\n addIfPresent(params, 'port', PORT_FIELD_ID);\\n addIfPresent(params, 'index', INDEX_FIELD_ID);\\n addIfPresent(params, 'upload_interval', POLL_INTERVAL_FIELD_ID);\\n if (document.getElementById(DISABLE_SSL_VERIFY_CHECK_ID).checked) {\\n params.push('disable_ssl_verify=true');\\n }\\n return '?' + params.join('&');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45754dcf4e0627a28df15364a4c3ca29\",\n \"score\": \"0.57712907\",\n \"text\": \"get values() {\\n return this.queryItemsByPropertyValue('selected', true)\\n .map((item) => this.composer.getItemPropertyValue(item, 'value'));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc521a8981d5241938340bea28fe9d9f\",\n \"score\": \"0.57626486\",\n \"text\": \"function getPicklistValues(ples){\\n\\t\\t\\tvar res = [];// defaultValue\\n\\t\\t\\t// add a blank option.{--None--}\\n\\t\\t\\tres = ples;\\n\\t\\t\\t// res.splice(0, 0, selectoptionObject(true, '--None--', null, false));\\n\\t\\t\\treturn res;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0ceff089b568fcd55000bd6e2287aa5\",\n \"score\": \"0.57085353\",\n \"text\": \"getValueFromOption(value) {\\n\\n\\t\\t\\tlet output;\\n\\t\\t\\tconst args = Array.prototype.slice.call(arguments, 1);\\n\\n\\t\\t\\tif (typeof value === \\\"function\\\") {\\n\\t\\t\\t\\toutput = value.apply(this, args);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\toutput = value;\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn output;\\n\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ce59b0aa4c65d706b74a7c7cb5c9a2d\",\n \"score\": \"0.56772727\",\n \"text\": \"get options() {\\n let options = {};\\n\\n for (let o of this.tuiOptions) {\\n let [optionName, , tuiOption] = o.split(':');\\n tuiOption = tuiOption ? tuiOption : optionName;\\n let value = this.args[optionName];\\n\\n if (value !== undefined) {\\n options[tuiOption] = value;\\n }\\n }\\n\\n return options;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b865b685c0edf0df1dee943cf5e5a91\",\n \"score\": \"0.56748515\",\n \"text\": \"function processOptionsFromArgs() {\\n\\tlet rawOptions = getOptionsFromArgs();\\n\\tfor (let key in rawOptions) {\\n\\t\\tif (!options.hasOwnProperty(key)) {\\n\\t\\t\\tconsole.warn(`Unknown option: ${key}`);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tlet context = exports.getTestMode();\\n\\t\\tlet optionsData = options[key];\\n\\t\\tif (!optionsData.context.includes(context)) {\\n\\t\\t\\tconsole.warn(`The option is not allowed in ${context} context: ${key}`);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tlet val = rawOptions[key];\\n\\t\\ttry {\\n\\t\\t\\tswitch (optionsData.type) {\\n\\t\\t\\t\\tcase TYPE_BOOLEAN: {\\n\\t\\t\\t\\t\\toptions[key].value = processBooleanOption(val);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcase TYPE_ARRAY: {\\n\\t\\t\\t\\t\\toptions[key].value = processArrayOption(val);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} catch (err) {\\n\\t\\t\\tconsole.warn(`Unknown value of '${key}' option: ${val}`);\\n\\t\\t}\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ab4fe0dbea84d3f781bd89302f42010\",\n \"score\": \"0.5667225\",\n \"text\": \"function getBundleOptions(options) {\\n let data = getData(options.value);\\n let metadata = getMetadata(options.value);\\n let trusted = !!options.trusted;\\n return { data, metadata, trusted };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed8e58e96473676b55812ccdcd209d32\",\n \"score\": \"0.56647956\",\n \"text\": \"function getOptions() {\\n return pluck(program, [\\n 'title', 'theme', 'style', 'output', 'controls', 'progress', 'encoding',\\n 'template', 'layout', 'debug'\\n ]);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"897de0d406068ee36accb9e8351c57da\",\n \"score\": \"0.56557137\",\n \"text\": \"function getOptions(arg, hasTime){\\n\\t\\tswitch(typeof(arg)){\\n\\t\\t\\tcase \\\"function\\\":\\n\\t\\t\\t\\treturn {\\n\\t\\t\\t\\t\\tcallback: arg,\\n\\t\\t\\t\\t\\ttime: undefined\\n\\t\\t\\t\\t};\\n\\t\\t\\tcase \\\"object\\\":\\n\\t\\t\\t\\tvar ret = {\\n\\t\\t\\t\\t\\tmax: arg.max,\\n\\t\\t\\t\\t\\tstart: arg['start-index']\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\tif(hasTime) ret.time = arg.time;\\n\\t\\t\\t\\treturn ret;\\n\\t\\t\\tdefault: return {}; break;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75d0388977d327d5cd0511bd307bfcd5\",\n \"score\": \"0.5645267\",\n \"text\": \"function GetParametersFromInputFields() {\\n\\t\\n\\tvar param_names = document.getElementsByClassName(\\\"param_name\\\"),\\n\\tparam_values = document.getElementsByClassName(\\\"param_value\\\"),\\n\\tparamObj = {},\\n\\ti;\\n\\t\\n\\tfor (i = 0; i < param_names.length; i++) {\\n\\t\\tvar key = param_names[i].value,\\n\\t\\tvalue = param_values[i].value;\\n\\t\\t\\n\\t\\tif (key != '' && value != '') {\\n\\t\\t\\tparamObj[key] = value;\\n\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn paramObj;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33b8741ab5752f14a8a0d17556f850be\",\n \"score\": \"0.56189084\",\n \"text\": \"function collectOptions(id) {\\n var resultOptions = {};\\n var options = document.getElementById(id).options;\\n for (var i = 0, len = options.length; i < len; i++) {\\n resultOptions[convertToURLString(options[i].text)] = options[i].value;\\n }\\n return resultOptions;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b09988a51c855966d2d088a657eb768\",\n \"score\": \"0.561485\",\n \"text\": \"function getAllValues(){\\n prae = prae_slider.value;\\n sens = sens_slider.value;\\n spec = spec_slider.value;\\n test = test_slider.value;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e541a90a32b715eafd3727beac7c42ce\",\n \"score\": \"0.5601151\",\n \"text\": \"function retrieveRawOption(option) {\\n var ret = {};\\n each(['start', 'end', 'startValue', 'endValue', 'throttle'], function (name) {\\n option.hasOwnProperty(name) && (ret[name] = option[name]);\\n });\\n return ret;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17d74408febe4a38ec8171a47ba88cd8\",\n \"score\": \"0.559698\",\n \"text\": \"options(options) {\\n\\t\\treturn {\\n\\t \\\"requests\\\": [\\n\\t {\\n\\t \\\"service\\\": \\\"OPTION\\\",\\n\\t \\\"requestid\\\": this.requestId++,\\n\\t \\\"command\\\": \\\"SUBS\\\",\\n\\t \\\"account\\\": this.auth.accounts[0].accountId,\\n\\t \\\"source\\\": this.auth.streamerInfo.appId,\\n\\t \\\"parameters\\\": {\\n\\t \\\"keys\\\": options.join(), //callOption(\\\"TQQQ\\\", \\\"06\\\", \\\"25\\\", \\\"21\\\", \\\"109\\\"),\\n\\t \\\"fields\\\": \\\"0,2,3\\\"\\n\\t }\\n\\t }\\n\\t ]\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e7a8bf5977a41f72132403d40f80676\",\n \"score\": \"0.5584888\",\n \"text\": \"selectedOptionObject(obj) {\\n if (obj == null) {\\n return null;\\n } else {\\n var result = [];\\n for (let i = 0; i < obj.length; i++) {\\n result.push(obj[i].value);\\n }\\n return result;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d48b4eb65709a390115edf3a239ba7b6\",\n \"score\": \"0.55528843\",\n \"text\": \"GetParmValue(propsName) {\\n try {\\n return propsName['paravalue']\\n }\\n catch (e) {\\n OreAlert.alert(e)\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8104ea33282b418c71b1363c0ca32eed\",\n \"score\": \"0.55452824\",\n \"text\": \"function selectGetValues (Select, bValueAsString){\\n var Fn = \\\"[util.js selectGetValues] \\\";\\n var szValues = \\\"\\\";\\n var bFirst = true;\\n \\n if (bValueAsString == undefined){\\n \\tbValueAsString = false;\\n }\\n if (!Select){\\n return jslog(JSLOG_JSU,Fn + \\\"Select =0 NOTHING to DO\\\");\\n }\\n for (var iOpt=0; iOpt < Select.options.length; iOpt ++){\\n var Opt = Select.options[iOpt];\\n var szVal = Opt.value;\\n \\tif (bValueAsString){\\n szVal = \\\"'\\\" + szVal + \\\"'\\\";\\n \\t} \\n\\t if (bFirst){\\n szValues = szVal;\\n bFirst = false;\\n } else {\\n szValues = szValues + \\\", \\\" + szVal;\\n }\\t \\n }\\n return szValues;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a2339412deea6a4452786ea411286e0\",\n \"score\": \"0.55438036\",\n \"text\": \"getOptions() {\\n // Plugins with no options don't need any of this\\n if (!this.constructor.options) {\\n return {};\\n }\\n\\n const attributes = this.elem.attributes;\\n const defaults = this.constructor.options;\\n const options = _.mapValues(defaults, value => value[1]);\\n\\n for (const i in attributes) {\\n const attr = attributes[i];\\n\\n // Only examine data attributes\\n if (attr.name && attr.name.indexOf('data-') === 0) {\\n const optionName = _.camelCase(attr.name.replace(/^data-/, ''));\\n\\n if (optionName in options) {\\n const type = defaults[optionName][0];\\n const attrValue = attr.value === '' ? true : attr.value;\\n let value;\\n\\n // You can't cast to false with Boolean('false')\\n if (type === Boolean) {\\n if (attrValue === 'true') {\\n value = true;\\n } else {\\n value = false;\\n }\\n } else if (Array.isArray(type)) {\\n if (type.indexOf(attrValue) > -1) {\\n value = attrValue;\\n } else {\\n value = defaults[optionName][1];\\n }\\n } else {\\n value = type(attrValue);\\n }\\n\\n options[optionName] = value;\\n }\\n }\\n }\\n\\n return options;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"894da51699c962be9b5e5e7928748d4f\",\n \"score\": \"0.5541765\",\n \"text\": \"getParameters(opts = {}) {\\n const {parameters, keys} = {};\\n\\n // Get parameter definitions for this Resource\\n const PARAMETERS = this.constructor.PARAMETERS || {};\\n\\n const isWebgl2 = Object(_webgl_utils__WEBPACK_IMPORTED_MODULE_1__[\\\"isWebGL2\\\"])(this.gl);\\n\\n const values = {};\\n\\n // Query all parameters if no list provided\\n const parameterKeys = parameters || Object.keys(PARAMETERS);\\n\\n // WEBGL limits\\n for (const pname of parameterKeys) {\\n const parameter = PARAMETERS[pname];\\n\\n // Check if this parameter is available on this platform\\n const parameterAvailable =\\n parameter &&\\n (!('webgl2' in parameter) || isWebgl2) &&\\n (!('extension' in parameter) || this.gl.getExtension(parameter.extension));\\n\\n if (parameterAvailable) {\\n const key = keys ? Object(_webgl_utils__WEBPACK_IMPORTED_MODULE_1__[\\\"getKey\\\"])(this.gl, pname) : pname;\\n values[key] = this.getParameter(pname, opts);\\n if (keys && parameter.type === 'GLenum') {\\n values[key] = Object(_webgl_utils__WEBPACK_IMPORTED_MODULE_1__[\\\"getKey\\\"])(this.gl, values[key]);\\n }\\n }\\n }\\n\\n return values;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2466550e49fca1db505600213ae793fa\",\n \"score\": \"0.5541114\",\n \"text\": \"function getArgumentValues(args, variables) {\\n var values = {};\\n args.forEach(function (arg) {\\n if (arg.kind === VARIABLE) {\\n values[arg.name] = getVariableValue(arg.variableName, variables);\\n } else {\\n values[arg.name] = arg.value;\\n }\\n });\\n return values;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb93e098bd5cf7d082f3cdcdd2d6bf48\",\n \"score\": \"0.55119056\",\n \"text\": \"function optionsFromUrlParms() { \\n // this function will be invoked after specs load\\n // as it must be able to overide options in specs\\n\\n /*-------------------------------------------\\n ** get useInfluxDB from URL parameter if any,\\n ** replace \\\"all\\\" by \\\"sbweio\\\"\\n **/\\n\\n if (urlParams.has(\\\"useInfluxDB\\\")) {\\n if (urlParams.get(\\\"useInfluxDB\\\") === \\\"true\\\") { options.useInfluxDB = true; }\\n else if (urlParams.get(\\\"useInfluxDB\\\") === \\\"false\\\") { options.useInfluxDB = false; }\\n else { alert(\\\"Invalid parameter useInfluxBD; parameter ignored.\\\")}\\n }\\n\\n /*-----------------------------------------------\\n ** get logTypes string from URL parameter if any,\\n ** replace \\\"all\\\" by \\\"sbweio\\\"\\n **/\\n\\n if (urlParams.has(\\\"logTypes\\\")) {\\n options.logTypes = urlParams.get(\\\"logTypes\\\");\\n }\\n if (options.logTypes == \\\"all\\\") {\\n options.logTypes = \\\"sbweio\\\";\\n }\\n\\n /*------------------------------------------\\n ** get timeTolSec from URL parameter if any\\n **/\\n if (urlParams.has(\\\"timeTolSec\\\")) {\\n options.timeTolSec = urlParams.get(\\\"timeTolSec\\\");\\n }\\n options.timeTolSec = parseInt(options.timeTolSec);\\n if (!Number.isSafeInteger(options.timeTolSec)) {\\n options.timeTolSec = 0;\\n alert(\\\"options.timeTolSec is not a number, \\\\n replaced by '\\\" + options.timeTolSec + \\\"'\\\");\\n }\\n\\n /*-----------------------------------------\\n ** get hotdeckSec from URL parameter if any // deprecated\\n **/\\n if (urlParams.has(\\\"hotdeckSec\\\")) {\\n options.hotdeckSec = urlParams.get(\\\"hotdeckSec\\\");\\n }\\n options.hotdeckSec = parseInt(options.hotdeckSec);\\n if (!Number.isSafeInteger(options.hotdeckSec)) {\\n options.hotdeckSec = 0;\\n alert(\\\"options.hotdeckSec is not a number, \\\\n replaced by \\\" + options.hotdeckSec);\\n }\\n\\n /*-------------------------------------------------------------\\n ** get policy and related parameters from URL parameter if any;\\n ** if policy not provided, other related parameters are ignored\\n **/\\n if (urlParams.has(\\\"policy\\\")) {\\n options.subscribePolicy.policy = urlParams.get(\\\"policy\\\");\\n if (![\\\"instant\\\", \\\"ideal\\\", \\\"fixed\\\"].includes(options.subscribePolicy.policy)) {\\n options.subscribePolicy.policy = \\\"instant\\\";\\n alert(\\\"invalid options.subscribePolicy.policy, \\\\n replaced by '\\\" + options.subscribePolicy.policy +\\\"'\\\"); \\n }\\n if ([\\\"instant\\\", \\\"ideal\\\"].includes(options.subscribePolicy.policy)) {\\n // ==> period ignored\\n if (urlParams.has(\\\"minPeriod\\\")) {\\n options.subscribePolicy.minPeriod = urlParams.get(\\\"minPeriod\\\");\\n }\\n options.subscribePolicy.minPeriod = parseInt(options.subscribePolicy.minPeriod);\\n if (!Number.isSafeInteger(options.subscribePolicy.minPeriod)) {\\n options.subscribePolicy.minPeriod = 100;\\n alert(\\\"options.subscribePolicy.minPeriod is not a number \\\\n replaced by \\\" + options.subscribePolicy.minPeriod); \\n }\\n else {\\n // \\\"fixed\\\" ==> minPeriod ignored\\n if (urlParams.has(\\\"period\\\")) {\\n options.subscribePolicy.period = urlParams.get(\\\"period\\\");\\n }\\n options.subscribePolicy.period = parseInt(options.subscribePolicy.period);\\n if (!Number.isSafeInteger(options.subscribePolicy.period)) {\\n options.subscribePolicy.period = 950;\\n alert(\\\"options.subscribePolicy.period is not a number, \\\\n replaced by \\\" + options.subscribePolicy.period);\\n } \\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fa058895a8ce56dba6ce35fce0b2077\",\n \"score\": \"0.5504275\",\n \"text\": \"getParams() {\\n return {\\n value: this.value, \\n name: this.name,\\n unit: this.unit\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6c71f615e1924101372f130a7979dd7\",\n \"score\": \"0.54995114\",\n \"text\": \"get IncorrectParameters() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adc9ae74d5047ba819d241f21ac1cbaf\",\n \"score\": \"0.54986256\",\n \"text\": \"filterOptions(val, options, permitValues) {\\n if (val === '') return options\\n let responseOptions = []//Response options\\n //Filter\\n for (let opt of options) {\\n //Search in options\\n if (JSON.stringify(opt).toLowerCase().indexOf(val.toLowerCase()) > -1)\\n responseOptions.push(opt)\\n //IF exist param permitvalues, compare if option exist\\n else if (permitValues) {\\n let optValue = opt.value.toString()//Parse value\\n if (typeof (permitValues) == 'object') {\\n permitValues.forEach(item => {\\n if (item.toString() == optValue) responseOptions.push(opt)\\n })\\n } else if (permitValues.toString() == optValue) responseOptions.push(opt)\\n }\\n }\\n //Response\\n return responseOptions\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ca2621ea8babcdf1ec00f74a60fa0ac\",\n \"score\": \"0.54954034\",\n \"text\": \"function getOptions(options_list, k) {\\n for (var dict of options_list) {\\n for (var key in dict) {\\n if (key == k) {\\n return dict[key];\\n }\\n }\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"074bc3faf955990a298ad14436afbaed\",\n \"score\": \"0.54809064\",\n \"text\": \"values() {\\n const values = {};\\n\\n Object.values(this.config.fields).forEach((field) => {\\n const { name, type } = field;\\n\\n Object.defineProperty(values, name, {\\n get: () => {\\n this.ensureValueExist();\\n\\n if (['multi-entity-id-select', 'multi-select'].includes(type)) {\\n return this.condition.value[name] || [];\\n }\\n\\n return this.condition.value[name];\\n },\\n set: (value) => {\\n this.ensureValueExist();\\n this.condition.value = { ...this.condition.value, [name]: value };\\n },\\n });\\n });\\n\\n return values;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aaa0f364ee8e2fd0cbb0c5f504e925e4\",\n \"score\": \"0.54794693\",\n \"text\": \"function dependent_option( val, data ) {\\n options = {}\\n for (var field in opttree) {\\n if (opttree.hasOwnProperty(field)) {\\n $.extend(true, options, opttree[field][data.values[field]]);\\n }\\n }\\n\\n return options;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6994ca25fc820010d849ac5759d24335\",\n \"score\": \"0.54783803\",\n \"text\": \"function sc_values() {\\n if (arguments.length === 1)\\n return arguments[0];\\n else\\n return new sc_Values(arguments);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03123871cd076b96c54b1890c4c0fbb1\",\n \"score\": \"0.5473877\",\n \"text\": \"function getArgumentValues(def, node, variableValues) {\\n\\t var coercedValues = {};\\n\\t var argDefs = def.args;\\n\\t var argNodes = node.arguments;\\n\\t if (!argDefs || !argNodes) {\\n\\t return coercedValues;\\n\\t }\\n\\t var argNodeMap = keyMap(argNodes, function (arg) {\\n\\t return arg.name.value;\\n\\t });\\n\\t for (var i = 0; i < argDefs.length; i++) {\\n\\t var argDef = argDefs[i];\\n\\t var name = argDef.name;\\n\\t var argType = argDef.type;\\n\\t var argumentNode = argNodeMap[name];\\n\\t var defaultValue = argDef.defaultValue;\\n\\t if (!argumentNode) {\\n\\t if (!isInvalid(defaultValue)) {\\n\\t coercedValues[name] = defaultValue;\\n\\t } else if (isNonNullType(argType)) {\\n\\t throw new GraphQLError('Argument \\\"' + name + '\\\" of required type ' + ('\\\"' + String(argType) + '\\\" was not provided.'), [node]);\\n\\t }\\n\\t } else if (argumentNode.value.kind === Kind.VARIABLE) {\\n\\t var variableName = argumentNode.value.name.value;\\n\\t if (variableValues && Object.prototype.hasOwnProperty.call(variableValues, variableName) && !isInvalid(variableValues[variableName])) {\\n\\t // Note: this does not check that this variable value is correct.\\n\\t // This assumes that this query has been validated and the variable\\n\\t // usage here is of the correct type.\\n\\t coercedValues[name] = variableValues[variableName];\\n\\t } else if (!isInvalid(defaultValue)) {\\n\\t coercedValues[name] = defaultValue;\\n\\t } else if (isNonNullType(argType)) {\\n\\t throw new GraphQLError('Argument \\\"' + name + '\\\" of required type \\\"' + String(argType) + '\\\" was ' + ('provided the variable \\\"$' + variableName + '\\\" which was not provided ') + 'a runtime value.', [argumentNode.value]);\\n\\t }\\n\\t } else {\\n\\t var valueNode = argumentNode.value;\\n\\t var coercedValue = valueFromAST(valueNode, argType, variableValues);\\n\\t if (isInvalid(coercedValue)) {\\n\\t // Note: ValuesOfCorrectType validation should catch this before\\n\\t // execution. This is a runtime check to ensure execution does not\\n\\t // continue with an invalid argument value.\\n\\t throw new GraphQLError('Argument \\\"' + name + '\\\" has invalid value ' + print(valueNode) + '.', [argumentNode.value]);\\n\\t }\\n\\t coercedValues[name] = coercedValue;\\n\\t }\\n\\t }\\n\\t return coercedValues;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d34d2d419314a03575b1ae6fee75e8a\",\n \"score\": \"0.5467319\",\n \"text\": \"getOptions(){\\n return this.toOptionsObject()\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b4c34f18fab4f8f55ea3670f4516550\",\n \"score\": \"0.5454\",\n \"text\": \"function getParams(params){\\n return _.pick(params, 'name', 'isPublic', 'sportId', 'dateYear', 'dateMonth', 'dateDay', 'dateHour', 'dateMinute');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"133e46ced2a259df138fbfb4c2eb464c\",\n \"score\": \"0.5451617\",\n \"text\": \"function getSelectedValues(options) {\\n return Array.from(options).filter(function (el) {\\n return el.selected;\\n }).map(function (el) {\\n return el.value;\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"133e46ced2a259df138fbfb4c2eb464c\",\n \"score\": \"0.5451617\",\n \"text\": \"function getSelectedValues(options) {\\n return Array.from(options).filter(function (el) {\\n return el.selected;\\n }).map(function (el) {\\n return el.value;\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"133e46ced2a259df138fbfb4c2eb464c\",\n \"score\": \"0.5451617\",\n \"text\": \"function getSelectedValues(options) {\\n return Array.from(options).filter(function (el) {\\n return el.selected;\\n }).map(function (el) {\\n return el.value;\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a62f3b5ba79bc5fd81fb4723d270914\",\n \"score\": \"0.5442953\",\n \"text\": \"function getSelectValues(select){\\n\\tlet result = [];\\n\\tlet options = select && select.selectedOptions;\\n\\n\\tfor (var i=0, iLen=options.length; i { if (err) throw err; });\n\tconsole.log('Packed!');\n}","title":""},{"docid":"bc2daa60e5c5f04cfeaa00f053868a30","score":"0.5223646","text":"async function pack_source() {\r\n const output = fs.createWriteStream(\r\n path.join(output_path, `source-${package.version}.zip`),\r\n )\r\n const archive = make_archive(output)\r\n\r\n archive.file(path.join(project_root, 'README.md'), { name: 'README.md' })\r\n archive.file(path.join(project_root, 'CHANGELOG.md'), { name: 'CHANGELOG.md' })\r\n archive.file(path.join(project_root, 'package.json'), { name: 'package.json' })\r\n archive.file(path.join(project_root, 'package-lock.json'), { name: 'package-lock.json' })\r\n archive.file(path.join(project_root, 'LICENSE'), { name: 'LICENSE' })\r\n archive.file(path.join(project_root, 'tsconfig.json'), { name: 'tsconfig.json' })\r\n archive.file(path.join(project_root, 'webpack.config.js'), { name: 'webpack.config.js' })\r\n archive.glob('app/**', { ignore: ['app/dist/**'] })\r\n archive.directory(path.join(project_root, 'bin'), 'bin')\r\n\r\n archive.finalize()\r\n}","title":""},{"docid":"7d972b7a80b3ec57c53b8a1374cbf6d7","score":"0.5166242","text":"function contructFileHeader(imageUri, imageSize) {\n var pathArr = imageUri.split('/')\n var imageName = pathArr[pathArr.length - 1]\n var ret = jspack.Pack(FILE_HEAD_FORMAT, [imageName, imageSize])\n alert(\"imageHead: \"+ret)\n return ret\n}","title":""},{"docid":"acfdf3b646f61d445615459abe977092","score":"0.51579356","text":"function entry () {\n if (!fs.pathExistsSync(CONFIG_ENTRY)) {\n console.log(chalk.red(\"Fail: Can't find config-file !\\r\\n\"))\n return\n }\n try {\n const config = fs.readJSONSync(CONFIG_ENTRY)\n singlePack(config)\n } catch (e) {\n console.error(e)\n console.log(chalk.red('failed to pack .'))\n }\n}","title":""},{"docid":"dfba71037b196bebfa0419ab50f7e598","score":"0.5056757","text":"function fileWithPath() {\n return process.argv[1];\n}","title":""},{"docid":"cc4cf32c5575462c9bbe35d9105b049e","score":"0.5001718","text":"function _scriptPath(){}","title":""},{"docid":"754fb1f8501fe839b428adf3ef1b7458","score":"0.49597514","text":"get filepath() {\n const { storeDir, signature } = this;\n return path.join(storeDir, `${signature}.har`);\n }","title":""},{"docid":"639350275532b87f5fead1a0298a86eb","score":"0.49561456","text":"function _GetFilePath(){\r\n var currentFile = document.currentScript.src;\r\n var urlCount = currentFile.lastIndexOf('/') +1;\r\n return currentFile.substring(0,urlCount);\r\n }","title":""},{"docid":"77dd37ee20d4624dd9b7fe33cd100103","score":"0.49426454","text":"findFileInSrc (filename) {\n let path = '';\n\n // scan each source dir to find a package.json\n this.opt.src.forEach(dir => {\n const target = this.path.join(dir, filename);\n if (this.fs.existsSync(target)) {\n this.log.debug('Found file: ' + target);\n path = this.path.resolve(target);\n }\n });\n return path;\n }","title":""},{"docid":"1c0bbc7ca47a8360ffdba1ae4b947f2c","score":"0.49219075","text":"_pushLocalFileHeader (file: Object) {\n file.version = 20\n file.bitflag = 8\n file.method = file.store ? 0 : 8\n file.moddate = convertDate(new Date())\n file.offset = this.fileptr\n\n const buf = Buffer.alloc(consts.LOCHDR + file.name.length)\n\n buf.writeUInt32LE(consts.LOCSIG, 0) // local file header signature\n buf.writeUInt16LE(file.version, consts.LOCVER) // version needed to extract\n buf.writeUInt16LE(file.bitflag, consts.LOCFLG) // general purpose bit flag\n buf.writeUInt16LE(file.method, consts.LOCHOW) // compression method\n buf.writeUInt32LE(file.moddate, consts.LOCTIM) // last mod file date and time\n\n buf.writeInt32LE(0, consts.LOCCRC) // crc32\n buf.writeUInt32LE(0, consts.LOCSIZ) // compressed size\n buf.writeUInt32LE(0, consts.LOCLEN) // uncompressed size\n\n buf.writeUInt16LE(file.name.length, consts.LOCNAM) // file name length\n buf.writeUInt16LE(0, consts.LOCEXT) // extra field length\n buf.write(file.name, consts.LOCHDR) // file name\n\n this.queue.push(buf)\n this.fileptr += buf.length\n }","title":""},{"docid":"dfccb717cb93b937968f65817d25bb5e","score":"0.49207944","text":"#getScriptFile (scriptName) {\n let scriptFile = join(this.packagePath, `src/${ scriptName }.js`)\n if (fse.existsSync(scriptFile)) {\n return scriptFile\n }\n\n scriptFile = join(this.packagePath, `dist/${ scriptName }.js`)\n if (fse.existsSync(scriptFile)) {\n return scriptFile\n }\n\n scriptFile = join(this.packagePath, `src/${ scriptName }.ts`)\n if (fse.existsSync(scriptFile)) {\n return scriptFile\n }\n\n scriptFile = join(this.packagePath, `dist/${ scriptName }.ts`)\n if (fse.existsSync(scriptFile)) {\n return scriptFile\n }\n }","title":""},{"docid":"2e8cd328143d3b9dcaa0c121c8449d15","score":"0.4917829","text":"function loadFile(name) {\r\n var path = \"code/\"+name+\".shdl\";\r\n fetch(path).then(function(response) {\r\n\t if (!response.ok) {\r\n\t\t setLog(\"No file: \"+path);\r\n\t } else {\r\n response.text().then(function(text) {\r\n load(text, name);\r\n });\r\n\t }\r\n});\r\n}","title":""},{"docid":"1dbdf400c0a970568125c52ee9579eab","score":"0.49174508","text":"function BinaryPacker0x0001() {\n}","title":""},{"docid":"130cfc2ab84161bd397df600f1f06581","score":"0.4868568","text":"function packFileIntoDirectory(from, into) {\n\tlet readStream = fs.createReadStream(from, {highWaterMark: 10 * 1024});\n\tlet counter = 1;\n\treadStream\n\t\t.on('data', function (chunk) {\n\t\t\tfs.writeFileSync('./' + into + '/' + counter + '.part', bitStringToBuffer(LW78Encode(chunk)), (err) => { if (err) throw err; });\n\t\t\tcounter++;\n\t\t})\n\t\t.on('end', function () {\n\t\t\tconsole.log('Packed!');\n\t\t});\n}","title":""},{"docid":"4038a3664dc7d0b0ebc9088752c93adb","score":"0.48673785","text":"function initFile()\n{\n fs.writeFileSync(FILE_PATH, STARTING_NUMBER)\n}","title":""},{"docid":"9bd78b24cf84eb9c7a8dcdbe4c2ecd4b","score":"0.48186815","text":"function copyFileDefInProd() {\n const shell = require(\"child_process\").execSync;\n let src = path.join(__dirname, \"/../src/Graphql/types\");\n let build = path.join(__dirname, \"../build/src/Graphql/types\");\n shell(`mkdir -p ${build}`);\n shell(`cp -r ${src}/* ${build}`);\n //console.log(`\\nFrom\\t: ${src}`);\n //console.log(`To\\t: ${build}\\n`);\n src = path.join(__dirname, \"/../sslcert\");\n build = path.join(__dirname, \"../build/sslcert\");\n shell(`mkdir -p ${build}`);\n shell(`cp -r ${src}/* ${build}`);\n //console.log(`From\\t: ${src}`);\n //console.log(`To\\t: ${build}\\n`);\n}","title":""},{"docid":"684cb529f49923ca39e4b5fb6232fd9c","score":"0.48046672","text":"_pushCentralDirectory () {\n const cdoffset = this.fileptr\n let ptr = 0\n let cdsize = 0\n let len = 0\n let buf = null\n\n for (let i = 0; i < this.files.length; i++) {\n const file = this.files[i]\n\n len = consts.CENHDR + file.name.length\n buf = Buffer.alloc(len)\n\n // central directory file header\n buf.writeUInt32LE(consts.CENSIG, 0) // central file header signature\n buf.writeUInt16LE(file.version, consts.CENVEM) // version made by\n buf.writeUInt16LE(file.version, consts.CENVER) // version needed to extract\n buf.writeUInt16LE(file.bitflag, consts.CENFLG) // general purpose bit flag\n buf.writeUInt16LE(file.method, consts.CENHOW) // compression method\n buf.writeUInt32LE(file.moddate, consts.CENTIM) // last mod file time and date\n buf.writeInt32LE(file.crc32, consts.CENCRC) // crc-32\n buf.writeUInt32LE(file.compressed, consts.CENSIZ) // compressed size\n buf.writeUInt32LE(file.uncompressed, consts.CENLEN) // uncompressed size\n buf.writeUInt16LE(file.name.length, consts.CENNAM) // file name length\n buf.writeUInt16LE(0, consts.CENEXT) // extra field length\n buf.writeUInt16LE(0, consts.CENCOM) // file comment length\n buf.writeUInt16LE(0, consts.CENDSK) // disk number where file starts\n buf.writeUInt16LE(0, consts.CENATT) // internal file attributes\n buf.writeUInt32LE(0, consts.CENATX) // external file attributes\n buf.writeUInt32LE(file.offset, consts.CENOFF) // relative offset\n buf.write(file.name, consts.CENHDR) // file name\n\n ptr = ptr + len\n this.queue.push(buf)\n }\n\n cdsize = ptr\n\n // end of central directory record\n len = consts.ENDHDR\n buf = Buffer.alloc(len)\n\n buf.writeUInt32LE(consts.ENDSIG, 0) // end of central dir signature\n buf.writeUInt16LE(0, 4) // number of this disk\n buf.writeUInt16LE(0, 6) // disk where central directory starts\n buf.writeUInt16LE(this.files.length, consts.ENDSUB) // number of central directory records on this disk\n buf.writeUInt16LE(this.files.length, consts.ENDTOT) // total number of central directory records\n buf.writeUInt32LE(cdsize, consts.ENDSIZ) // size of central directory in bytes\n buf.writeUInt32LE(cdoffset, consts.ENDOFF) // offset of start of central directory, relative to start of archive\n buf.writeUInt16LE(0, consts.ENDCOM) // comment length\n\n ptr = ptr + len\n\n this.queue.push(buf)\n this.fileptr += ptr\n }","title":""},{"docid":"6dc83cca7d2c12d6f7bad14906ad6fb9","score":"0.4761744","text":"function write_src_file(fname, path, intpath, arr)\n{\n\tFSO.FolderExists(\"tmp\\\\src\") ? \"\" : FSO.CreateFolder(\"tmp\\\\src\");\n\tvar src = FSO.CreateTextFile(\"tmp\\\\src\\\\\" + fname, true);\n\tvar out = get_define(\"BUILD_DIR\");\n\tvar libpath = \"\";\n\n\tfor (i = 0; i < arr.length; i++) {\n\t\tif (arr[i].length > 1) {\n\t\t\tif (arr[i].match('alloca.c') ||\n\t\t\t\tarr[i].match(/internal_functions_(nw|win32)\\.c/) ||\n\t\t\t\tarr[i].match(/flock\\.(c|h)/) ||\n\t\t\t\tarr[i].match(/zend_static_allocator\\.(c|h)/) ||\n\t\t\t\tarr[i].match(/zend_(ini|language)_scanner_defs\\.h/)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tlibpath = arr[i].substr(2, arr[i].lastIndexOf(\"\\\\\") - 2);\n\t\t\tif (libpath) {\n\t\t\t\tlibpath = \"\\\\\" + libpath;\n\t\t\t}\n\n\t\t\tsrc.WriteLine(\"# Begin Source File\");\n\t\t\tsrc.WriteLine(\"SOURCE=\" + arr[i]);\n\t\t\tsrc.WriteLine('# PROP Intermediate_Dir \"' + intpath + out + '\\\\' + path + libpath + '\"');\n\t\t\tsrc.WriteLine(\"# End Source File\");\n\t\t\tsrc.WriteBlankLines(1);\n\t\t}\n\t}\n\n\tsrc.Close();\n\treturn;\n}","title":""},{"docid":"f64c545258a8ed9cc8dfbff0798cd63c","score":"0.4733939","text":"function getScriptPath() {\n var fpath = null;\n var dbLevel;\n var ex;\n\n try {\n dbLevel = $.level; // save\n $.level = 0;\n undefined_variable; // throw an exception\n } catch(ex) {\n fpath = ex.fileName; // path/file\n } finally {\n $.level = dbLevel; // restore\n }\n fpath = fpath.substring(0, fpath.lastIndexOf(\"/\")+1);\n return(fpath);\n}","title":""},{"docid":"b5379f225a8d753e99ce9c9b3420b8c9","score":"0.47328782","text":"function getOutputFilename() {\n return 'main';\n}","title":""},{"docid":"4325c4c6eb04aad4cc2e706efbbf5708","score":"0.47016785","text":"function Guidewire_FMSourceFileExtract(FullFileName)\n{\n var VarSplitURL= FullFileName.split(\".\");\n return VarSplitURL[0];\n}","title":""},{"docid":"63f445b16960d26a60d89890128ee181","score":"0.47007236","text":"parseSource(src) {\n const file = this.vault.getAbstractFileByPath(src);\n return (file instanceof obsidian.TFile) ? this.vault.adapter.getResourcePath(src) : src;\n }","title":""},{"docid":"899f5ce06c5ee22f14f21adf402d5a24","score":"0.46923476","text":"enterFilePath(ctx) {\n\t}","title":""},{"docid":"5e0d21d55be3b7a5e4a443534d3073da","score":"0.46887237","text":"function _stagePackComponent(context, type, srcPath, destPath, destPathRelease) {\n return new Promise((resolve, reject) => {\n try {\n fs.removeSync(destPath);\n fs.copySync(srcPath, destPath);\n // copy all .js files into min dir for a resource componet.\n const glob = require('glob'); // eslint-disable-line\n if (type === 'resource') {\n // For a resource component, copy all files, except for any under extension/.\n // We assume that files under extension/ are design time\n // and are not needed in the runtime distribution.\n const resourceFiles = glob.sync('**/*', { cwd: srcPath, ignore: ['extension/**/*', 'extension'] });\n resourceFiles.forEach((componentPath) => {\n fs.copySync(path.join(srcPath, componentPath), path.join(destPath, componentPath));\n if (context.opts.buildType === 'release' || context.componentConfig) {\n fs.copySync(path.join(srcPath, componentPath),\n path.join(destPathRelease, componentPath));\n }\n });\n } else if (context.opts.buildType === 'release' || context.componentConfig) {\n // For a 'non-resource component' in release build,\n // copy all top-level css files to the /min dir.\n const cssFiles = glob.sync('*.css', { cwd: srcPath });\n cssFiles.forEach((componentPath) => {\n fs.copySync(path.join(srcPath, componentPath), path.join(destPathRelease, componentPath));\n });\n // Copy the resource directory into min/\n const srcPathResources = path.join(srcPath, 'resources');\n if (util.fsExistsSync(srcPathResources)) {\n fs.copySync(srcPathResources, path.join(destPathRelease, 'resources'));\n }\n }\n resolve(context);\n } catch (error) {\n reject(error);\n }\n });\n}","title":""},{"docid":"2722ef9d5922b65b73da53e067ee6279","score":"0.46884346","text":"function Fileloader()\n{\n\n}","title":""},{"docid":"c7c0793ccfd04348ef6059c3ae52918a","score":"0.4683511","text":"function _buildPath(current) {\n require._path = require.path.slice(0);\n require._path.push(new Folder(current + '/' + id).parent);\n require._path.push(new File($.fileName).parent);\n var split = $.os.toLowerCase().indexOf('win') === -1 ? ':' : ';';\n var fromPath = ($.getenv('PHOTOSHOP_PATH') || '').split(split);\n for (var p = 0; p < fromPath.length; p++) {\n var path = fromPath[p];\n if (path.length === 0) {\n continue;\n }\n require._path.push(path);\n }\n\n require.isPathBuilt = true;\n }","title":""},{"docid":"7492a3fae89ee47daaffc07d0c952d4a","score":"0.46760845","text":"function myGetScriptPath() {\n try{\n return app.activeScript;\n }\n catch(myError){\n return File(myError.fileName);\n }\n}","title":""},{"docid":"ced95169121b8182c7152e485d1eacfe","score":"0.46673065","text":"cargoBinary(func) {\n let [cargoPackage, binary] = func.handler.split(\".\");\n if (binary == undefined) {\n binary = cargoPackage;\n }\n return { cargoPackage, binary };\n }","title":""},{"docid":"5b9edb541fa221699909eef4d9253155","score":"0.46363807","text":"function reportPath() {\n return path.join(__dirname, \"../../ext/install.report\")\n}","title":""},{"docid":"c28c98dad0be96f21a220e4524ebae87","score":"0.46331066","text":"getPath () {\n return this.template.filePath\n }","title":""},{"docid":"1697162ab8e774a37d97978e04e6f053","score":"0.46294752","text":"function getPackageName(installPackage) {\n if (installPackage.match(/^.+\\.(tgz|tar\\.gz)$/)) {\n return getTemporaryDirectory()\n .then(obj => {\n let stream;\n if (/^http/.test(installPackage)) {\n stream = hyperquest(installPackage);\n } else {\n stream = fs.createReadStream(installPackage);\n }\n return extractStream(stream, obj.tmpdir).then(() => obj);\n })\n .then(obj => {\n const packageName = require(path.join(obj.tmpdir, 'package.json')).name;\n obj.cleanup();\n return packageName;\n })\n .catch(err => {\n // O nome do pacote pode ser com ou sem versão semver, por ex. anteros-scripts-0.2.0-alpha.1.tgz\n // No entanto, esta função retorna o nome do pacote somente sem a versão semverver.\n console.log(\n `Não foi possível extrair o nome do pacote do arquivo: ${err.message}`\n );\n const assumedProjectName = installPackage.match(\n /^.+\\/(.+?)(?:-\\d+.+)?\\.(tgz|tar\\.gz)$/\n )[1];\n console.log(\n `Com base no nome do arquivo, supondo que seja \"${chalk.cyan(\n assumedProjectName\n )}\"`\n );\n return Promise.resolve(assumedProjectName);\n });\n } else if (installPackage.indexOf('git+') === 0) {\n // Extrair o nome do pacote das URLs git, por exemplo:\n // git+https://github.com/mycompany/anteros-scripts.git\n // git+ssh://github.com/mycompany/anteros-scripts.git#v1.2.3\n return Promise.resolve(installPackage.match(/([^/]+)\\.git(#.*)?$/)[1]);\n } else if (installPackage.match(/.+@/)) {\n // Não corresponde a @scope/ ao retirar o @version ou o @tag\n return Promise.resolve(\n installPackage.charAt(0) + installPackage.substr(1).split('@')[0]\n );\n } else if (installPackage.match(/^file:/)) {\n const installPackagePath = installPackage.match(/^file:(.*)?$/)[1];\n const installPackageJson = require(path.join(\n installPackagePath,\n 'package.json'\n ));\n return Promise.resolve(installPackageJson.name);\n }\n return Promise.resolve(installPackage);\n}","title":""},{"docid":"dee1b0e460f5eee45a8eb56bc132d0f8","score":"0.46114084","text":"function sendBinaryFromFile(req, res) {\n program(__dirname + '/RFIDBirdFeeder.ino.bin', process.env.SERIAL_PORT, (err) => {\n if (err) {\n console.log(\"ERROR: esptool error.\");\n console.log(err);\n res.status(500).json({'ERROR': err});\n } else {\n res.json({'SUCCESS': 'Program sent to esp8266 successfully'});\n }\n });\n}","title":""},{"docid":"f8730bca9f631c22a9751d16fa02a2ba","score":"0.4608146","text":"function chkFileArrFunc ( file , cData ) {\n\t\t\t\tlet p = new Promise(( resolve , reject ) => {\n\t\t\t\t\tfs.readFile( file.originalPath , 'utf8' , ( err , fileData ) => {\n\t\t\t\t\t\tlet re = new RegExp( '^import.*?\\/' + cData.fileName , 'gm' );\n\t\t\t\t\t\tlet result = re.exec( fileData ) ; \n\t\t\t\t\t\tconsole.log( 'result : ' , result ) ; \n\t\t\t\t\t\tif ( result != null ) {\n\t\t\t\t\t\t\tresolve( file ) ; \n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tresolve( null ) ; \n\t\t\t\t\t\t}\n\t\t\t\t\t}) ; \n\n\t\t\t\t}) ; \n\n\t\t\t\treturn p ; \n\t\t\t}","title":""},{"docid":"1fc00457a494faefd6b65351a0d9a186","score":"0.45816877","text":"function get_script_1(pi, cb) {\n if(pi.script) return cb(pi.script)\n let pkg = path.join(pi.cwd, 'package.json')\n fs.readFile(pkg, (err, data) => {\n if(err) {\n pi.emit('error', err)\n cb()\n } else {\n try {\n let obj = JSON.parse(data)\n cb(obj.main)\n } catch(e) {\n pi.emit('error', err)\n cb()\n }\n }\n })\n }","title":""},{"docid":"15f061e9dd9c9a9d4fbd9f06e1d305f3","score":"0.4564618","text":"function installModule(filePath, fileName) {\n console.log(\"Zip path\", path_1[\"default\"].join(filePath, fileName));\n var fileExist = false;\n return new Promise(function (resolve, reject) {\n yauzl_1[\"default\"].open(path_1[\"default\"].join(filePath, fileName), { lazyEntries: true }, function (err, zipfile) {\n if (err) {\n var error = new Error(err.message);\n reject(boom_1[\"default\"].boomify(error, { statusCode: 400 }).output);\n return;\n }\n //read zip entry\n zipfile.readEntry();\n zipfile.on(\"entry\", function (entry) {\n if (/\\/$/.test(entry.fileName)) {\n console.log(\"Folder\");\n // Directory file names end with '/'.\n // Note that entires for directories themselves are optional.\n // An entry's fileName implicitly requires its parent directories to exist.\n zipfile.readEntry();\n }\n else {\n if (/(appconfig\\.json)/.test(entry.fileName)) {\n console.log(\"File Exist\");\n fileExist = true;\n zipfile.readEntry();\n }\n else {\n zipfile.readEntry();\n }\n console.log(\"File Does not Exist\");\n }\n });\n zipfile.on(\"error\", function (err) {\n reject(err);\n });\n zipfile.on(\"close\", function () {\n //check if appconfig file exist\n if (fileExist) {\n fs_1[\"default\"].createReadStream(path_1[\"default\"].join(filePath, fileName)).pipe(unzipper_1[\"default\"]\n .Extract({\n path: path_1[\"default\"].join(filePath, fileName.replace(\".zip\", \"\"))\n })\n .on(\"close\", function () {\n //finished extracting files\n //verify that the appconfig file is valid\n verifyAppConfig(reject, resolve, filePath, fileName.replace(\".zip\", \"\"));\n //resolve({ message: \"Successfully installed module\" });\n })\n .on(\"error\", function (err) {\n var error = new Error(err.message);\n reject(boom_1[\"default\"].boomify(error, { statusCode: 400 }).output);\n }));\n }\n else {\n //report error if appconfig doesnt exist\n var error = new Error(\"appconfig.json file does not exist at the root folder/zip\");\n reject(boom_1[\"default\"].boomify(error, { statusCode: 400 }).output);\n }\n });\n });\n });\n /* createModule({})\n .then(result => {\n //res.send(result);\n })\n .catch(error => {\n //res.status(500).send(error);\n });*/\n}","title":""},{"docid":"ae5447510db2edc3e5e11a834c0729e3","score":"0.45636025","text":"name (file) {\n return \"[path][name].[ext]\"\n }","title":""},{"docid":"1eb04ba6e4dcdd0d0979e015b105d9ef","score":"0.45633703","text":"function loadCubasePatchFile(vDebug) {\n var vFileSelector = Host.Classes.createInstance(\"CCL:FileSelector\");\n var vCubasePatch = {\n description: (\"Cubase Patch Script\"),\n extension: \"txt\",\n mimetype: \"text\"\n };\n vFileSelector.addFilter(vCubasePatch);\n vFileSelector.runOpen();\n var vPath = vFileSelector.getPath();\n var vOutArray = [];\n var vFile = Host.IO.openTextFile(vPath);\n if (vFile) {\n var idx = 0;\n var vGroupName = \"\";\n while (!vFile.endOfStream) {\n var vTextLine = vFile.readLine().toString();\n if (vTextLine.trim() == \"\" || vTextLine == null) {\n continue\n };\n if (vTextLine.indexOf(\"[script name]\") > -1) {\n vTextLine = vTextLine.replace(\"\\t\", \"\").replace(\"[script name]\", \"\");\n vOutArray[idx] = vTextLine.trim();\n idx++;\n continue\n };\n if (vTextLine.indexOf(\"[g\") > -1) {\n vTextLine = vTextLine.replace(\"\\t\", \"\");\n var _0xDC16 = vTextLine.split(\"]\");\n vGroupName = _0xDC16[1].trim();\n continue\n };\n if (vTextLine.indexOf(\"[p\") > -1 && vTextLine.indexOf(\",\") > -1) {\n vTextLine = vTextLine.replace(\"\\t\", \"\");\n var _0xDC16 = vTextLine.split(\"]\");\n var vProgramName = _0xDC16[1].trim();\n var vProgramNumber = _0xDC16[0].split(\",\");\n var _0xDCE3 = vProgramNumber[2];\n var _0xDCBA = vProgramNumber[3];\n var vBankNumber = (_0xDCE3 * 128) + _0xDCBA;\n vOutArray[idx] = (vProgramName + \",\" + vProgramNumber[1] + \",\" + vBankNumber + \",\" + vGroupName);\n idx++;\n continue\n }\n };\n vFile.close();\n if (vDebug == 1) {\n for (idx = 0; idx < vOutArray.length; idx++) {\n print(vOutArray[idx])\n }\n };\n return vOutArray\n }\n}","title":""},{"docid":"7066c954d6a57ac65737e9b315ddbda5","score":"0.45626456","text":"function get_current_file_path() {\n return current_directory + \"/\" + current_file_name;\n}","title":""},{"docid":"a2a838d37bf1aeca53d9f28f3a94f46c","score":"0.45624575","text":"function emptyPackfile(pack) {\n const pheader = '5041434b';\n const version = '00000002';\n const obCount = '00000000';\n const header = pheader + version + obCount;\n return pack.slice(0, 12).toString('hex') === header\n}","title":""},{"docid":"fd80fb405f7d3a043c3e45d6190154d5","score":"0.45607135","text":"name (file) {\n return '[hash].[ext]'\n }","title":""},{"docid":"7ddeb198e174c8c4c241b82ac232c354","score":"0.456064","text":"bundle() {\n if (this._bundled) {\n const recorded = this._recorded;\n this.reset();\n recorded.forEach(x => this.pipeline.write(x));\n }\n\n vfs.src(this.opts.entries, {\n cwd: this.opts.cwd,\n base: this.opts.base,\n }).pipe(this.pipeline);\n\n const output = readonly(this.pipeline);\n this.emit('bundle', output);\n this._bundled = true;\n\n return output;\n }","title":""},{"docid":"71a15b4759fb4cc1aeacbb3d118b1467","score":"0.45590693","text":"function Start () \n{\n \n FindPath ();\n}","title":""},{"docid":"644047ad00fbb10e66780f419cf84d9d","score":"0.45524058","text":"addFile (rootDir: string, fileName: string, targetDir: ?string): Promise {\n return new Promise((resolve, reject) => {\n const destFileName = targetDir\n ? path.join(targetDir, fileName)\n : fileName\n const checksumList = []\n const file = { name: destFileName }\n this._pushLocalFileHeader(file)\n\n const stream = fs.createReadStream(path.join(rootDir, fileName))\n let compressed = 0\n let uncompressed = 0\n\n const deflate = zlib.createDeflateRaw(this.options)\n\n deflate.on('data', (chunk) => {\n compressed += chunk.length\n this.queue.push(chunk)\n })\n\n deflate.on('end', () => {\n file.crc32 = crc32.signed(Buffer.concat(checksumList))\n file.compressed = compressed\n file.uncompressed = uncompressed\n\n this.fileptr += compressed\n this._pushDataDescriptor(file)\n\n this.files.push(file)\n resolve()\n })\n\n deflate.on('error', error => reject(error))\n\n stream.on('data', (chunk) => {\n uncompressed += chunk.length\n checksumList.push(Buffer.from(chunk))\n deflate.write(chunk)\n })\n\n stream.on('end', () => {\n deflate.end()\n })\n\n stream.on('error', error => reject(error))\n })\n }","title":""},{"docid":"bd547230ebb82e7565131a0e649aa3cc","score":"0.45468962","text":"function tempString(filename){\nreturn fs.readFileSync(__dirname + '/' + filename, 'utf8')\n}","title":""},{"docid":"9402f47d2a6bf5ca7c773df7e539ee22","score":"0.4545659","text":"async function afterPack({ appOutDir, electronPlatformName, packager }) {\n if (electronPlatformName !== 'linux') {\n return;\n }\n\n const appName = packager.appInfo.productFilename;\n const script = `#!/bin/bash\\n\"\\${BASH_SOURCE%/*}\"/${appName}.bin --no-sandbox \"$@\"`;\n const scriptPath = path.join(appOutDir, appName);\n\n await fs.rename(scriptPath, `${scriptPath}.bin`);\n await fs.writeFile(scriptPath, script);\n await fs.chmod(scriptPath, 0o755);\n}","title":""},{"docid":"8dc1f88b7ce615906c9049a129f4e635","score":"0.45436603","text":"path() {\n return path.join(this.dest(), this.use());\n }","title":""},{"docid":"7d9c688b6002d906f86785c40650a66e","score":"0.45367843","text":"static ExtractOggFile() {}","title":""},{"docid":"a392b61e8414d8651432fbb026381136","score":"0.45365083","text":"function getWholeFilePath(name, parentfile, isDirectory) {\n var includePath = path__namespace.resolve(isDirectory ? parentfile : path__namespace.dirname(parentfile), // returns directory the parent file is in\n name // file\n ) + (path__namespace.extname(name) ? '' : '.eta');\n return includePath;\n}","title":""},{"docid":"a392b61e8414d8651432fbb026381136","score":"0.45365083","text":"function getWholeFilePath(name, parentfile, isDirectory) {\n var includePath = path__namespace.resolve(isDirectory ? parentfile : path__namespace.dirname(parentfile), // returns directory the parent file is in\n name // file\n ) + (path__namespace.extname(name) ? '' : '.eta');\n return includePath;\n}","title":""},{"docid":"13ec3d89807cd4ecd8541b05c30e9068","score":"0.45362902","text":"function pack()\n{\n var manifest = jsonfile.readFileSync(manifest_path),\n timestamp = (new Date).toISOString().replace(/z|t/gi, ' ').trim().replace(/\\:/g, '-').replace(/\\s/g, '_'),\n build_file_name = 'build_v' + manifest.version + '_' + timestamp + '.zip';\n return gulp.src(build_dir + '/**/*')\n .pipe(zip(build_file_name))\n .pipe(gulp.dest(builds_dir))\n .on('end', function () {\n fancy('Build saved into archive: ' + chalk.green(builds_dir + '/' + build_file_name));\n });\n}","title":""},{"docid":"9a444b4cd6b22a736d61d9fad672c97c","score":"0.4536236","text":"get path() {\n return getBinaryPath();\n }","title":""},{"docid":"c033ba382a08b919884380ada375a3ad","score":"0.45357376","text":"static packagePath(packageNumber) {\n\t\treturn this.getPackage(packageNumber).pfile.getPath();\n\t}","title":""},{"docid":"2546488b2258cf0800a722ea7d5bb098","score":"0.45323497","text":"enterInsertFile(ctx) {\n\t}","title":""},{"docid":"433e176729e7a27fefdead5eb1459f4b","score":"0.45118296","text":"function createxzip() {\r\n\r\n // create temporary header\r\n var retVal = 0;\r\n var tmp = fso.CreateTextFile(szHeaderFile);\r\n tmp.Write(\"HEX\"+String.fromCharCode(0)+\"HEX\");\r\n tmp.Close();\r\n\r\n // loop through module list\r\n var moduleList = xmlSource.documentElement.selectNodes(\"/xzip/module\");\r\n for ( var i=0; i {\n if (res.status !== 'success') {\n this.file.response = res\n return this.reject('server')\n }\n\n this.sessionId = res.data.session_id\n this.chunkSize = res.data.end_offset\n\n this.createChunks()\n this.startChunking()\n }).catch(res => {\n this.file.response = res\n this.reject('server')\n })\n }","title":""},{"docid":"a078d3bf8d3d3eed2306f0aee4c8a697","score":"0.45048752","text":"static GetMainAssetTypeAtPath() {}","title":""},{"docid":"c229922befc0b8f2d068d2dc06fd9551","score":"0.45022273","text":"getPack() {\n throw new Error('getPack() is not implemented');\n }","title":""},{"docid":"0dbca72b904312aa448cbe13d4e78fb6","score":"0.44994396","text":"function packRelease() {\n shipit.tarballName = path.join(shipit.config.workspace, shipit.releaseDirname + '.tar.gz');\n shipit.log('Creating tarball from %s and putting it %s', shipit.config.workspace, shipit.tarballName);\n return targz().compress(shipit.config.workspace, shipit.tarballName).then(function(){\n shipit.log(chalk.green('Tarball created successfully.'));\n });\n }","title":""},{"docid":"53655111c5e31991bd18184859c98e8e","score":"0.44908425","text":"function generate_dsp_file(ext, ext_dir, files, shared)\n{\n\tvar dsp = FSO.CreateTextFile(\"tmp\\\\\" + ext + \".dsp\", true);\n\tvar tmpl = file_get_contents(\"win32\\\\build\\\\template.dsp\");\n\tvar ts = (PHP_ZTS != \"no\" ? \"ts\" : \"\");\n\tvar debug = (PHP_DEBUG != \"no\" ? \" /debug\" : \"\");\n\tvar ld = (debug ? \"/LDd\" : \"/LD\");\n\tvar status = (PHP_DEBUG == \"no\" ? 'Release' : 'Debug');\n\tvar statusts = status + (ts ? \"_\" + ts.toUpperCase() : \"\");\n\tvar baseflags = \"\";\n\n\t/* store the final path and value of shared in the tmp file */\n\tif (!ext.match(\"php5\")) {\n\t\ttmpl = ext_dir + \"\\\\\" + ext + \".dsp#\" + shared + tmpl;\n\t}\n\n\ttmpl = tmpl.replace(/extname/g, ext);\n\ttmpl = tmpl.replace(/Status_TS/g, statusts);\n\n\tif (debug) {\n\t\ttmpl = tmpl.replace(/Use_Debug_Libraries 0/g, \"Use_Debug_Libraries 1\");\n\t\ttmpl = tmpl.replace(/NDEBUG/g, \"_DEBUG\");\n\t}\n\n\tif (ext == \"cli\" || ext == \"cgi\") {\n\t\ttmpl = tmpl.replace(/Dynamic-Link Library/g, \"Console Application\");\n\t\ttmpl = tmpl.replace(/0x0102/, \"0x0103\");\n\t\tpath = \"..\\\\\";\n\t\ttype = \".exe\";\n\t} else if (ext == \"embed\" || ext == \"TSRM\" || ext == \"Zend\") {\n\t\ttmpl = tmpl.replace(/Dynamic-Link/g, \"Static\");\n\t\ttmpl = tmpl.replace(/0x0102/, \"0x0104\");\n\t\ttmpl = tmpl.replace(/LINK32/g, \"LIB32\");\n\t\ttmpl = tmpl.replace(\"link.exe\", \"link.exe -lib\");\n\t\ttmpl = tmpl.replace(/BASELIBS/g, \"/nologo\");\n\t\ttmpl = tmpl.replace(/\\s(LOCALLIBS|BASELDFLAGS|LOCALLDFLAGS|OUTPATH)/g, \"\");\n\t\tpath = \"..\\\\\";\n\t\tif (ext == \"embed\") {\n\t\t\tpath += \"..\\\\\";\n\t\t}\n\t\ttype = \".lib\";\n\t} else if (ext.match(\"php5\")) {\n\t\tpath = \"..\\\\\";\n\t\ttype = \".dll\";\n\t} else {\n\t\tpath = \"..\\\\..\\\\\";\n\t\ttype = \".dll\";\n\t}\n\n\toutpath = path + get_define(\"BUILD_DIR\");\n\ttmpl = tmpl.replace(/OUTPUTDIR/g, outpath);\n\n\t/* populate the baseline CFLAGS and libs */\n\tcflags = get_define(\"CFLAGS\").replace(/\\s+/g, \" \");\n\tcflags = cflags.replace('/I \"..\\\\bindlib_w32\" ', \"\");\n\tbcflags = (cflags.replace(/\\/([A-Z])\\s/g, \"/$1\")).split(\" \");\n\n\tfor (i= 0; i < bcflags.length; i++) {\n\t\tbaseflags += (bcflags[i].match(/(PHP|ZEND|ZTS|BASE|FD|WINDOWS)/) ? \"\" : bcflags[i]);\n\t}\n\n\tbaseflags = baseflags.replace(/\\//g, \" /\");\n\tbaseflags = baseflags.substr(1).replace(/(\\/D)/g, \"$1 \") + \" /c\";\n\ttmpl = tmpl.replace(/BASECPP/, (type == \".dll\" ? baseflags : baseflags.replace(ld + \" \", \"\")));\n\n\ttmpl = tmpl.replace(/BASELIBS/, \"/nologo \" + get_define(\"LIBS\").replace(/\\sresolv.lib/, \"\"));\n\n\t/* now populate the bases in the 'local' lines */\n\tincs = get_define(\"BASE_INCLUDES\").replace(/\\/I (\\S+)/g, '/I \"' + path + '$1\"');\n\tincs = incs.replace('\"' + path + '.\"', '\"..\"');\n\tlcflags = cflags.replace(/\\$\\(BASE_INCLUDES\\)/, incs + (type == \".exe\" ? '/I \"..\\\\sapi\" ' : \"\") + '/I \"' + path + '..\\\\bindlib_w32\"');\n\ttmpl = tmpl.replace(/BASECPP/, (type == \".dll\" ? lcflags : lcflags.replace(ld + \" \", \"\")));\n\ttmpl = tmpl.replace(/BASELIBS/, \"/nologo \" + get_define(\"LIBS\") + \" \" + (ext.match(\"php5\") ? \"\" : get_define(\"PHPLIB\")));\n\tldflags = get_define(\"LDFLAGS\").replace(/\\s?(\\/nologo|\\/libpath:\\S+)\\s?/g, \"\");\n\ttmpl = tmpl.replace(/BASELDFLAGS/, ldflags + (type == \".dll\" ? \" \" + get_define(\"DLL_LDFLAGS\") : \"\") + (debug ? ' /nodefaultlib:\"msvcrt\"' : \"\"));\n\tout = '/out:\"' + outpath + \"\\\\\" + ext + type + '\"' + ' /libpath:\"' + outpath + '\"' + ' /libpath:\"..\\\\' + path + 'bindlib_w32\\\\' + status + '\"';\n\ttmpl = tmpl.replace(/OUTPATH/, out);\n\n\ttxt = generate_text_filelist(ext, ext_dir);\n\tres = generate_resource_filelist(ext, ext_dir);\n\n\ttmpl = tmpl.replace(/TEXTFILES/, txt);\n\ttmpl = tmpl.replace(/RESOURCEFILES/, res);\n\n\tif (ext.match(\"php5\")) {\n\t\treturn tmpl;\n\t}\n\n\t/* generate source and header blocks for .dsp */\n\tgenerate_dsp_filelist(ext, ext_dir, files, path);\n\n\tdsp.Write(tmpl);\n\tdsp.Close();\n\n\treturn;\n}","title":""},{"docid":"a9cfe807a0ae760d2da5a5b7a0c63bd4","score":"0.447768","text":"devtoolModuleFilenameTemplate(info) {\n return formatWindowsUri(path.relative(srcDir, info.absoluteResourcePath));\n }","title":""},{"docid":"c3606cb81984fc8f87f30b618b0ec4fe","score":"0.44730997","text":"function onLoadClick() {\n const win = remote.getCurrentWindow()\n const opts = {\n title: 'Load',\n defaultPath: remote.app.getPath('desktop'),\n buttonLabel: 'Open',\n filters: [\n {\n name: 'Zip',\n extensions: ['zip']\n },\n { name: 'Png', extensions: ['png'] }\n ],\n properties: ['openFile']\n }\n const callback = async filepath => {\n if (filepath) {\n const ext = path.extname(filepath[0])\n\n if (ext === '.zip') {\n const dirPath = path.join(RECORDINGS_DIRECTORY, 'temp')\n await mkdirAsync(dirPath)\n\n yauzl.open(filepath[0], { lazyEntries: true }, (err, zipFile) => {\n if (err) throw err\n zipFile.readEntry()\n zipFile.on('entry', entry => {\n zipFile.openReadStream(entry, (err, readStream) => {\n if (err) throw err\n readStream.on('end', () => {\n zipFile.readEntry()\n })\n const ws = createWriteStream(path.join(dirPath, entry.fileName))\n readStream.pipe(ws)\n })\n })\n\n zipFile.on('end', async () => {\n const data = await readFileAsync(path.join(dirPath, 'project.json'))\n const project = JSON.parse(data)\n const folder = project.relative\n const newDirPath = path.join(RECORDINGS_DIRECTORY, folder)\n await renameAsync(dirPath, newDirPath)\n dispatch({ type: SET_PROJECT_FOLDER, payload: folder })\n })\n })\n } else if (ext === '.png') {\n const folder = createFolderName()\n const dirPath = path.join(RECORDINGS_DIRECTORY, folder)\n await mkdirAsync(dirPath)\n\n const imagePath = path.join(dirPath, '0.png')\n await copyFileAsync(filepath[0], imagePath)\n\n const [width, height] = await new Promise(resolve => {\n const image = new Image()\n image.onload = () => {\n resolve([image.width, image.height])\n }\n image.src = imagePath\n })\n\n const newProject = {\n relative: folder,\n date: new Date().getTime(),\n width,\n height,\n frames: [\n { time: 100, path: imagePath, clicked: false, cursorX: 0, cursorY: 0, keys: false }\n ]\n }\n\n const projectPath = path.join(dirPath, 'project.json')\n await writeFileAsync(projectPath, JSON.stringify(newProject))\n dispatch({ type: SET_PROJECT_FOLDER, payload: folder })\n }\n }\n }\n\n remote.dialog.showOpenDialog(win, opts, callback)\n }","title":""},{"docid":"31f9425347adf4baf51a687531486995","score":"0.44723433","text":"static find(path) {\n\n\n\n if(path[0] == \"/\")\n path = path.substring(1);\n\n const filePath = appDir[appDir.length - 1] == \"/\" ?\n /*if*/ appDir+path\n /*else*/: `${appDir}/${path}`;\n\n if(!fs.existsSync(filePath)) {\n return null;\n }\n\n const readFile = fs.readFileSync(filePath),\n type = fileType(readFile),\n stats = fs.statSync(filePath),\n fileSizeInBytes = stats.size,\n filePathSplit = filePath.split(\"/\"),\n name = filePathSplit[filePathSplit.length - 1];\n\n\n var returnFile = new File();\n\n returnFile.path = filePath;\n returnFile.type = type == null ? null : type.mime;\n returnFile.name = name;\n returnFile.size = fileSizeInBytes;\n\n return returnFile;\n\n\n }","title":""},{"docid":"25b30273d03aa13e9ec2154f2a07b799","score":"0.44654843","text":"installPhar () {\r\n let pathSrc = path.join(global.__static, 'codechecker.phar')\r\n let md5Src = md5.sync(pathSrc)\r\n let destExist = fs.existsSync(this.checkerPath)\r\n let md5Dest = (destExist) ? md5.sync(this.checkerPath) : ''\r\n\r\n console.log('Check codechecker.phar')\r\n if (!destExist || md5Src !== md5Dest) {\r\n console.log('Create ', this.checkerPath)\r\n fs.copyFileSync(pathSrc, this.checkerPath)\r\n fs.chmodSync(this.checkerPath, '777')\r\n }\r\n }","title":""},{"docid":"47745d6e6f8ef9af601d2a2be0a14cd8","score":"0.44651103","text":"function sr(remain) {\n //hack for path.join remove the first dot\n return path.join(src_folder, remain);\n}","title":""},{"docid":"98bc8103aefa22e31dbe6b3ff9e1b848","score":"0.4463488","text":"static LoadMainAssetAtPath() {}","title":""},{"docid":"c611836dabd0bfc0c0866aae2937a5ce","score":"0.44621065","text":"componentDidMount() {\n // ! use url to load sketch files\n // let url = window.location.href\n // let slash_index = url.lastIndexOf(\"/\");\n // let fileName = url.slice(slash_index + 1);\n // console.log(fileName)\n // import Sketch from (\"components/Sketches/\" + fileName);\n }","title":""},{"docid":"6e784cca2eb251b866128ccde5d8b89b","score":"0.4459624","text":"async function main() {\n await env.run(\"compile\");\n\n var rootPath = path.dirname(path.dirname(require.main.filename));\n\n await fs.copy(\n path.join(rootPath, \"/artifacts\"),\n path.join(rootPath, \"/src/artifacts\")\n );\n\n console.log(\"success\");\n}","title":""},{"docid":"de58aa28ba349e8ac43551c36cfb3199","score":"0.44587988","text":"fileKeyMaker(fileObj) {\n return `${fileObj._id}.tar.gz`;\n }","title":""},{"docid":"31c8700822e36e05c6c46bc34578fc55","score":"0.4455123","text":"function createPartFileEntry(grdpFilePath) {\n const relativeGrdpFilePath = getRelativeGrdpPath(grdpFilePath);\n return ` 12){\n\t\twhile(true){\n\t\t\tvar header=[cf.readInt32LE(x),cf.readInt32LE(x+4),cf.readInt32LE(x+8)];\n\t\t\tvar module=cf.slice(x+12,x+12+header[1]).toString().split('.')[0];\n\t\t\tvar data=cf.slice(x+12+header[1],x+12+header[1]+header[2]);\n\t\t\tif(unpackedSancov[module]){\n\t\t\t\tunpackedSancov[module]=Buffer.concat([unpackedSancov[module],data]);\n\t\t\t}else {\n\t\t\t\tunpackedSancov[module]=data;\n\t\t\t}\n\t\t\tx=x+12+header[1]+header[2];\n\t\t\tconsole.dlog('X after unpacking '+module+': '+x);\n\t\t\tif(x>=cf.length){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\telse{\n\t\tconsole.dlog('Pack length under header length.');\n\t}\n\treturn unpackedSancov;\n}","title":""},{"docid":"078875d1575a72bf698f38437a6ce41a","score":"0.43925405","text":"function main() {\r\n\r\n /*\r\n * check commandline\r\n */\r\n\r\n parseCommandline();\r\n\r\n /*\r\n * create file system object and check path\r\n */\r\n\r\n fso = new ActiveXObject(\"Scripting.FileSystemObject\");\r\n if (!fso.FolderExists(szSourceDir))\r\n error(\"Source directory does not exists!\\n\\n\\tDirectory: \"+szSourceDir+\"\\n\");\r\n\r\n\r\n /*\r\n * create output to definition file\r\n */\r\n\r\n createDefinitionFile();\r\n\r\n\r\n /*\r\n * create xmlDOM object and open definition file\r\n */\r\n\r\n xmlSource = new ActiveXObject(\"Microsoft.XMLDOM\");\r\n xmlSource.async = false;\r\n xmlSource.load( szDefFile );\r\n var state = xmlSource.readyState;\r\n print( \"XML-ReadyState = \" + state );\r\n if (state == 4) {\r\n var err = xmlSource.parseError;\r\n if (err.errorCode != 0) {\r\n print( \"XML-Error: \" + err.Reason );\r\n } else {\r\n print( \"XML-Success: opened xzip definition file\" );\r\n }\r\n }\r\n\r\n\r\n /*\r\n * update sums and offsets\r\n */\r\n\r\n updateDefinitionFile();\r\n xmlSource.save( szDefFile );\r\n\r\n\r\n /*\r\n * create xzip\r\n */\r\n\r\n shell = WScript.CreateObject(\"WScript.Shell\");\r\n\r\n createxzip();\r\n\r\n\r\n /*\r\n * exit\r\n */\r\n\r\n WScript.Quit(0);\r\n\r\n}","title":""},{"docid":"d36af4593a77df856b06c25273448da0","score":"0.43884256","text":"function bootload(path, url, done){\n\n var pageSize = 256;\n var baud = 115200;\n var delay1 = 10; //minimum is 2.5us, so anything over 1 fine?\n var delay2 = 1;\n var signature = new Buffer([0x1e, 0xa8, 0x02]);\n var options = {\n timeout:0xc8,\n stabDelay:0x64,\n cmdexeDelay:0x19,\n synchLoops:0x20,\n byteDelay:0x00,\n pollValue:0x53,\n pollIndex:0x03\n };\n\n var hex;\n\n var serialPort = new SerialPort.SerialPort(path, {\n baudrate: baud\n }, false);\n\n var programmer = new stk500(serialPort);\n\n async.series([\n function(cbStep){\n getHex(url, function(err, data){\n if(err){\n return cbStep(err);\n }\n\n hex = data;\n cbStep();\n });\n },\n function(cbStep){\n programmer.connect(cbStep);\n },\n function(cbStep){\n programmer.sync(3,cbStep);\n },\n function(cbStep){\n programmer.verifySignature(signature, cbStep);\n },\n function(cbStep){\n programmer.enterProgrammingMode(options, cbStep);\n },\n function(cbStep){\n programmer.upload(hex, pageSize,cbStep);\n },\n function(cbStep){\n programmer.exitProgrammingMode(cbStep);\n }\n ], function(err){\n\n serialPort.on('close', function () {\n done(err);\n });\n\n serialPort.close();\n \n });\n\n}","title":""},{"docid":"5336cf01036bfda489f27117102ebc41","score":"0.43755376","text":"get srcDir() {\n return path.resolve(url.fileURLToPath(import.meta.url), '..', '..', '..');\n }","title":""},{"docid":"3ba778bc58538e8e3667609d9d0ee4d9","score":"0.4353738","text":"changeFileLoaded (state) {\n state.fileLoadedFromMain = true\n }","title":""},{"docid":"3b08fa2c4837fb02b4dc8305eb95bd71","score":"0.43518582","text":"static rebaseLockfile(/* pathToPackageRoot, lockfile */) {\n }","title":""},{"docid":"02aa2c85d8cfc0476daad752056f9e7f","score":"0.4346683","text":"function loadFile() {\n\tgetStateVars();\n\tif(exportid != \"\") {\n\t getFileObj(exportid);\n\t}\n\telse if (id != \"\") {\n\t\tgetFileObj(id);\n\t}\n\telse {\n\t\tconsole.log('no file id passed in state');\n\t}\n}","title":""},{"docid":"b762b979101a33694d1f404dec3eb340","score":"0.43465236","text":"async function main() {\n\tconst injectionTarget = '/*#GET_ICON_IMPORTS#*/';\n\tconst targetFilePath = `${__dirname}/target.js`;\n\n\tconst cardsFiles = await asyncGetFilesInDirectory(\n\t\t`${__dirname}/cards`,\n\t\t'utf8'\n\t);\n\n\tconst parseCardsFiles = cardsFiles.map(card => {\n\t\tconst [prefix, suffix] = card.split('.');\n\t\treturn `import ${prefix} from './cards/${card}`;\n\t});\n\tconsole.log('parseCardsFiles', parseCardsFiles);\n\t// const transformedIconFiles = cardsFiles.map(fileName => {\n\t// \t[_, code, type] = lineTemplate.exec(fileName);\n\t// \tconst codeType = `${code}_${type}`;\n\t// \tcodeTypes.push(`Icon${codeType}`);\n\n\t// \treturn `import Icon${codeType} from './files/${codeType}.svg';`;\n\t// });\n\n\t//\tconsole.log(transformedIconFiles);\n\n\t// transformedIconFiles.unshift(`import React, { FC } from 'react';`)\n\n\t// Add export line.\n\t// transformedIconFiles.push('interface IWeatherIcons {[key: string]: FC;};');\n\n\t// transformedIconFiles.push(`const weatherIcons: IWeatherIcons = {${codeTypes.join(', ')}}`);\n\t// transformedIconFiles.push(`export default weatherIcons;`);\n\n\t// const buildFile = await asyncReadFile(targetFilePath, 'utf8');\n\t// const updatedBuild = buildFile.replace(injectionTarget, transformedIconFiles.join('\\n'));\n\t// await asyncWriteFile(targetFilePath, updatedBuild);\n}","title":""},{"docid":"b2c054608f105d0b9d79fba9d1c9c633","score":"0.43415204","text":"function gfxStart() {\n return src(helpers.trim(`${helpers.source()}/${global.config.gfx.src}/**/*`))\n .pipe(imagemin([\n imagemin.gifsicle(gfxConfig.gifConfig),\n imageminMozjpeg(gfxConfig.jpegConfig),\n imageminPngquant(gfxConfig.pngConfig),\n imagemin.svgo(gfxConfig.svgConfig),\n ]))\n .pipe(dest(helpers.trim(`${helpers.dist()}/${global.config.gfx.dist}`)))\n .pipe(gulpif(global.config.sync.run, global.bs.stream()));\n}","title":""},{"docid":"8396d0f69268ced14141b02e26fb0dc5","score":"0.43403423","text":"getMainPath() {\n return path.join(this.getProjectPath(), this.getConfig('paths.main'));\n }","title":""}],"string":"[\n {\n \"docid\": \"e7901d0fcdeb679b764417f258be36c4\",\n \"score\": \"0.55160004\",\n \"text\": \"function notCoolPackFile (from, into) {\\n\\tfs.writeFileSync(into, bitStringToBuffer(LW78Encode(fs.readFileSync(from))), (err) => { if (err) throw err; });\\n\\tconsole.log('Packed!');\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc2daa60e5c5f04cfeaa00f053868a30\",\n \"score\": \"0.5223646\",\n \"text\": \"async function pack_source() {\\r\\n const output = fs.createWriteStream(\\r\\n path.join(output_path, `source-${package.version}.zip`),\\r\\n )\\r\\n const archive = make_archive(output)\\r\\n\\r\\n archive.file(path.join(project_root, 'README.md'), { name: 'README.md' })\\r\\n archive.file(path.join(project_root, 'CHANGELOG.md'), { name: 'CHANGELOG.md' })\\r\\n archive.file(path.join(project_root, 'package.json'), { name: 'package.json' })\\r\\n archive.file(path.join(project_root, 'package-lock.json'), { name: 'package-lock.json' })\\r\\n archive.file(path.join(project_root, 'LICENSE'), { name: 'LICENSE' })\\r\\n archive.file(path.join(project_root, 'tsconfig.json'), { name: 'tsconfig.json' })\\r\\n archive.file(path.join(project_root, 'webpack.config.js'), { name: 'webpack.config.js' })\\r\\n archive.glob('app/**', { ignore: ['app/dist/**'] })\\r\\n archive.directory(path.join(project_root, 'bin'), 'bin')\\r\\n\\r\\n archive.finalize()\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d972b7a80b3ec57c53b8a1374cbf6d7\",\n \"score\": \"0.5166242\",\n \"text\": \"function contructFileHeader(imageUri, imageSize) {\\n var pathArr = imageUri.split('/')\\n var imageName = pathArr[pathArr.length - 1]\\n var ret = jspack.Pack(FILE_HEAD_FORMAT, [imageName, imageSize])\\n alert(\\\"imageHead: \\\"+ret)\\n return ret\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acfdf3b646f61d445615459abe977092\",\n \"score\": \"0.51579356\",\n \"text\": \"function entry () {\\n if (!fs.pathExistsSync(CONFIG_ENTRY)) {\\n console.log(chalk.red(\\\"Fail: Can't find config-file !\\\\r\\\\n\\\"))\\n return\\n }\\n try {\\n const config = fs.readJSONSync(CONFIG_ENTRY)\\n singlePack(config)\\n } catch (e) {\\n console.error(e)\\n console.log(chalk.red('failed to pack .'))\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfba71037b196bebfa0419ab50f7e598\",\n \"score\": \"0.5056757\",\n \"text\": \"function fileWithPath() {\\n return process.argv[1];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc4cf32c5575462c9bbe35d9105b049e\",\n \"score\": \"0.5001718\",\n \"text\": \"function _scriptPath(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"754fb1f8501fe839b428adf3ef1b7458\",\n \"score\": \"0.49597514\",\n \"text\": \"get filepath() {\\n const { storeDir, signature } = this;\\n return path.join(storeDir, `${signature}.har`);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"639350275532b87f5fead1a0298a86eb\",\n \"score\": \"0.49561456\",\n \"text\": \"function _GetFilePath(){\\r\\n var currentFile = document.currentScript.src;\\r\\n var urlCount = currentFile.lastIndexOf('/') +1;\\r\\n return currentFile.substring(0,urlCount);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77dd37ee20d4624dd9b7fe33cd100103\",\n \"score\": \"0.49426454\",\n \"text\": \"findFileInSrc (filename) {\\n let path = '';\\n\\n // scan each source dir to find a package.json\\n this.opt.src.forEach(dir => {\\n const target = this.path.join(dir, filename);\\n if (this.fs.existsSync(target)) {\\n this.log.debug('Found file: ' + target);\\n path = this.path.resolve(target);\\n }\\n });\\n return path;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c0bbc7ca47a8360ffdba1ae4b947f2c\",\n \"score\": \"0.49219075\",\n \"text\": \"_pushLocalFileHeader (file: Object) {\\n file.version = 20\\n file.bitflag = 8\\n file.method = file.store ? 0 : 8\\n file.moddate = convertDate(new Date())\\n file.offset = this.fileptr\\n\\n const buf = Buffer.alloc(consts.LOCHDR + file.name.length)\\n\\n buf.writeUInt32LE(consts.LOCSIG, 0) // local file header signature\\n buf.writeUInt16LE(file.version, consts.LOCVER) // version needed to extract\\n buf.writeUInt16LE(file.bitflag, consts.LOCFLG) // general purpose bit flag\\n buf.writeUInt16LE(file.method, consts.LOCHOW) // compression method\\n buf.writeUInt32LE(file.moddate, consts.LOCTIM) // last mod file date and time\\n\\n buf.writeInt32LE(0, consts.LOCCRC) // crc32\\n buf.writeUInt32LE(0, consts.LOCSIZ) // compressed size\\n buf.writeUInt32LE(0, consts.LOCLEN) // uncompressed size\\n\\n buf.writeUInt16LE(file.name.length, consts.LOCNAM) // file name length\\n buf.writeUInt16LE(0, consts.LOCEXT) // extra field length\\n buf.write(file.name, consts.LOCHDR) // file name\\n\\n this.queue.push(buf)\\n this.fileptr += buf.length\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfccb717cb93b937968f65817d25bb5e\",\n \"score\": \"0.49207944\",\n \"text\": \"#getScriptFile (scriptName) {\\n let scriptFile = join(this.packagePath, `src/${ scriptName }.js`)\\n if (fse.existsSync(scriptFile)) {\\n return scriptFile\\n }\\n\\n scriptFile = join(this.packagePath, `dist/${ scriptName }.js`)\\n if (fse.existsSync(scriptFile)) {\\n return scriptFile\\n }\\n\\n scriptFile = join(this.packagePath, `src/${ scriptName }.ts`)\\n if (fse.existsSync(scriptFile)) {\\n return scriptFile\\n }\\n\\n scriptFile = join(this.packagePath, `dist/${ scriptName }.ts`)\\n if (fse.existsSync(scriptFile)) {\\n return scriptFile\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e8cd328143d3b9dcaa0c121c8449d15\",\n \"score\": \"0.4917829\",\n \"text\": \"function loadFile(name) {\\r\\n var path = \\\"code/\\\"+name+\\\".shdl\\\";\\r\\n fetch(path).then(function(response) {\\r\\n\\t if (!response.ok) {\\r\\n\\t\\t setLog(\\\"No file: \\\"+path);\\r\\n\\t } else {\\r\\n response.text().then(function(text) {\\r\\n load(text, name);\\r\\n });\\r\\n\\t }\\r\\n});\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dbdf400c0a970568125c52ee9579eab\",\n \"score\": \"0.49174508\",\n \"text\": \"function BinaryPacker0x0001() {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"130cfc2ab84161bd397df600f1f06581\",\n \"score\": \"0.4868568\",\n \"text\": \"function packFileIntoDirectory(from, into) {\\n\\tlet readStream = fs.createReadStream(from, {highWaterMark: 10 * 1024});\\n\\tlet counter = 1;\\n\\treadStream\\n\\t\\t.on('data', function (chunk) {\\n\\t\\t\\tfs.writeFileSync('./' + into + '/' + counter + '.part', bitStringToBuffer(LW78Encode(chunk)), (err) => { if (err) throw err; });\\n\\t\\t\\tcounter++;\\n\\t\\t})\\n\\t\\t.on('end', function () {\\n\\t\\t\\tconsole.log('Packed!');\\n\\t\\t});\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4038a3664dc7d0b0ebc9088752c93adb\",\n \"score\": \"0.48673785\",\n \"text\": \"function initFile()\\n{\\n fs.writeFileSync(FILE_PATH, STARTING_NUMBER)\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9bd78b24cf84eb9c7a8dcdbe4c2ecd4b\",\n \"score\": \"0.48186815\",\n \"text\": \"function copyFileDefInProd() {\\n const shell = require(\\\"child_process\\\").execSync;\\n let src = path.join(__dirname, \\\"/../src/Graphql/types\\\");\\n let build = path.join(__dirname, \\\"../build/src/Graphql/types\\\");\\n shell(`mkdir -p ${build}`);\\n shell(`cp -r ${src}/* ${build}`);\\n //console.log(`\\\\nFrom\\\\t: ${src}`);\\n //console.log(`To\\\\t: ${build}\\\\n`);\\n src = path.join(__dirname, \\\"/../sslcert\\\");\\n build = path.join(__dirname, \\\"../build/sslcert\\\");\\n shell(`mkdir -p ${build}`);\\n shell(`cp -r ${src}/* ${build}`);\\n //console.log(`From\\\\t: ${src}`);\\n //console.log(`To\\\\t: ${build}\\\\n`);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"684cb529f49923ca39e4b5fb6232fd9c\",\n \"score\": \"0.48046672\",\n \"text\": \"_pushCentralDirectory () {\\n const cdoffset = this.fileptr\\n let ptr = 0\\n let cdsize = 0\\n let len = 0\\n let buf = null\\n\\n for (let i = 0; i < this.files.length; i++) {\\n const file = this.files[i]\\n\\n len = consts.CENHDR + file.name.length\\n buf = Buffer.alloc(len)\\n\\n // central directory file header\\n buf.writeUInt32LE(consts.CENSIG, 0) // central file header signature\\n buf.writeUInt16LE(file.version, consts.CENVEM) // version made by\\n buf.writeUInt16LE(file.version, consts.CENVER) // version needed to extract\\n buf.writeUInt16LE(file.bitflag, consts.CENFLG) // general purpose bit flag\\n buf.writeUInt16LE(file.method, consts.CENHOW) // compression method\\n buf.writeUInt32LE(file.moddate, consts.CENTIM) // last mod file time and date\\n buf.writeInt32LE(file.crc32, consts.CENCRC) // crc-32\\n buf.writeUInt32LE(file.compressed, consts.CENSIZ) // compressed size\\n buf.writeUInt32LE(file.uncompressed, consts.CENLEN) // uncompressed size\\n buf.writeUInt16LE(file.name.length, consts.CENNAM) // file name length\\n buf.writeUInt16LE(0, consts.CENEXT) // extra field length\\n buf.writeUInt16LE(0, consts.CENCOM) // file comment length\\n buf.writeUInt16LE(0, consts.CENDSK) // disk number where file starts\\n buf.writeUInt16LE(0, consts.CENATT) // internal file attributes\\n buf.writeUInt32LE(0, consts.CENATX) // external file attributes\\n buf.writeUInt32LE(file.offset, consts.CENOFF) // relative offset\\n buf.write(file.name, consts.CENHDR) // file name\\n\\n ptr = ptr + len\\n this.queue.push(buf)\\n }\\n\\n cdsize = ptr\\n\\n // end of central directory record\\n len = consts.ENDHDR\\n buf = Buffer.alloc(len)\\n\\n buf.writeUInt32LE(consts.ENDSIG, 0) // end of central dir signature\\n buf.writeUInt16LE(0, 4) // number of this disk\\n buf.writeUInt16LE(0, 6) // disk where central directory starts\\n buf.writeUInt16LE(this.files.length, consts.ENDSUB) // number of central directory records on this disk\\n buf.writeUInt16LE(this.files.length, consts.ENDTOT) // total number of central directory records\\n buf.writeUInt32LE(cdsize, consts.ENDSIZ) // size of central directory in bytes\\n buf.writeUInt32LE(cdoffset, consts.ENDOFF) // offset of start of central directory, relative to start of archive\\n buf.writeUInt16LE(0, consts.ENDCOM) // comment length\\n\\n ptr = ptr + len\\n\\n this.queue.push(buf)\\n this.fileptr += ptr\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dc83cca7d2c12d6f7bad14906ad6fb9\",\n \"score\": \"0.4761744\",\n \"text\": \"function write_src_file(fname, path, intpath, arr)\\n{\\n\\tFSO.FolderExists(\\\"tmp\\\\\\\\src\\\") ? \\\"\\\" : FSO.CreateFolder(\\\"tmp\\\\\\\\src\\\");\\n\\tvar src = FSO.CreateTextFile(\\\"tmp\\\\\\\\src\\\\\\\\\\\" + fname, true);\\n\\tvar out = get_define(\\\"BUILD_DIR\\\");\\n\\tvar libpath = \\\"\\\";\\n\\n\\tfor (i = 0; i < arr.length; i++) {\\n\\t\\tif (arr[i].length > 1) {\\n\\t\\t\\tif (arr[i].match('alloca.c') ||\\n\\t\\t\\t\\tarr[i].match(/internal_functions_(nw|win32)\\\\.c/) ||\\n\\t\\t\\t\\tarr[i].match(/flock\\\\.(c|h)/) ||\\n\\t\\t\\t\\tarr[i].match(/zend_static_allocator\\\\.(c|h)/) ||\\n\\t\\t\\t\\tarr[i].match(/zend_(ini|language)_scanner_defs\\\\.h/)) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tlibpath = arr[i].substr(2, arr[i].lastIndexOf(\\\"\\\\\\\\\\\") - 2);\\n\\t\\t\\tif (libpath) {\\n\\t\\t\\t\\tlibpath = \\\"\\\\\\\\\\\" + libpath;\\n\\t\\t\\t}\\n\\n\\t\\t\\tsrc.WriteLine(\\\"# Begin Source File\\\");\\n\\t\\t\\tsrc.WriteLine(\\\"SOURCE=\\\" + arr[i]);\\n\\t\\t\\tsrc.WriteLine('# PROP Intermediate_Dir \\\"' + intpath + out + '\\\\\\\\' + path + libpath + '\\\"');\\n\\t\\t\\tsrc.WriteLine(\\\"# End Source File\\\");\\n\\t\\t\\tsrc.WriteBlankLines(1);\\n\\t\\t}\\n\\t}\\n\\n\\tsrc.Close();\\n\\treturn;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f64c545258a8ed9cc8dfbff0798cd63c\",\n \"score\": \"0.4733939\",\n \"text\": \"function getScriptPath() {\\n var fpath = null;\\n var dbLevel;\\n var ex;\\n\\n try {\\n dbLevel = $.level; // save\\n $.level = 0;\\n undefined_variable; // throw an exception\\n } catch(ex) {\\n fpath = ex.fileName; // path/file\\n } finally {\\n $.level = dbLevel; // restore\\n }\\n fpath = fpath.substring(0, fpath.lastIndexOf(\\\"/\\\")+1);\\n return(fpath);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5379f225a8d753e99ce9c9b3420b8c9\",\n \"score\": \"0.47328782\",\n \"text\": \"function getOutputFilename() {\\n return 'main';\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4325c4c6eb04aad4cc2e706efbbf5708\",\n \"score\": \"0.47016785\",\n \"text\": \"function Guidewire_FMSourceFileExtract(FullFileName)\\n{\\n var VarSplitURL= FullFileName.split(\\\".\\\");\\n return VarSplitURL[0];\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63f445b16960d26a60d89890128ee181\",\n \"score\": \"0.47007236\",\n \"text\": \"parseSource(src) {\\n const file = this.vault.getAbstractFileByPath(src);\\n return (file instanceof obsidian.TFile) ? this.vault.adapter.getResourcePath(src) : src;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"899f5ce06c5ee22f14f21adf402d5a24\",\n \"score\": \"0.46923476\",\n \"text\": \"enterFilePath(ctx) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e0d21d55be3b7a5e4a443534d3073da\",\n \"score\": \"0.46887237\",\n \"text\": \"function _stagePackComponent(context, type, srcPath, destPath, destPathRelease) {\\n return new Promise((resolve, reject) => {\\n try {\\n fs.removeSync(destPath);\\n fs.copySync(srcPath, destPath);\\n // copy all .js files into min dir for a resource componet.\\n const glob = require('glob'); // eslint-disable-line\\n if (type === 'resource') {\\n // For a resource component, copy all files, except for any under extension/.\\n // We assume that files under extension/ are design time\\n // and are not needed in the runtime distribution.\\n const resourceFiles = glob.sync('**/*', { cwd: srcPath, ignore: ['extension/**/*', 'extension'] });\\n resourceFiles.forEach((componentPath) => {\\n fs.copySync(path.join(srcPath, componentPath), path.join(destPath, componentPath));\\n if (context.opts.buildType === 'release' || context.componentConfig) {\\n fs.copySync(path.join(srcPath, componentPath),\\n path.join(destPathRelease, componentPath));\\n }\\n });\\n } else if (context.opts.buildType === 'release' || context.componentConfig) {\\n // For a 'non-resource component' in release build,\\n // copy all top-level css files to the /min dir.\\n const cssFiles = glob.sync('*.css', { cwd: srcPath });\\n cssFiles.forEach((componentPath) => {\\n fs.copySync(path.join(srcPath, componentPath), path.join(destPathRelease, componentPath));\\n });\\n // Copy the resource directory into min/\\n const srcPathResources = path.join(srcPath, 'resources');\\n if (util.fsExistsSync(srcPathResources)) {\\n fs.copySync(srcPathResources, path.join(destPathRelease, 'resources'));\\n }\\n }\\n resolve(context);\\n } catch (error) {\\n reject(error);\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2722ef9d5922b65b73da53e067ee6279\",\n \"score\": \"0.46884346\",\n \"text\": \"function Fileloader()\\n{\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7c0793ccfd04348ef6059c3ae52918a\",\n \"score\": \"0.4683511\",\n \"text\": \"function _buildPath(current) {\\n require._path = require.path.slice(0);\\n require._path.push(new Folder(current + '/' + id).parent);\\n require._path.push(new File($.fileName).parent);\\n var split = $.os.toLowerCase().indexOf('win') === -1 ? ':' : ';';\\n var fromPath = ($.getenv('PHOTOSHOP_PATH') || '').split(split);\\n for (var p = 0; p < fromPath.length; p++) {\\n var path = fromPath[p];\\n if (path.length === 0) {\\n continue;\\n }\\n require._path.push(path);\\n }\\n\\n require.isPathBuilt = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7492a3fae89ee47daaffc07d0c952d4a\",\n \"score\": \"0.46760845\",\n \"text\": \"function myGetScriptPath() {\\n try{\\n return app.activeScript;\\n }\\n catch(myError){\\n return File(myError.fileName);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ced95169121b8182c7152e485d1eacfe\",\n \"score\": \"0.46673065\",\n \"text\": \"cargoBinary(func) {\\n let [cargoPackage, binary] = func.handler.split(\\\".\\\");\\n if (binary == undefined) {\\n binary = cargoPackage;\\n }\\n return { cargoPackage, binary };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b9edb541fa221699909eef4d9253155\",\n \"score\": \"0.46363807\",\n \"text\": \"function reportPath() {\\n return path.join(__dirname, \\\"../../ext/install.report\\\")\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c28c98dad0be96f21a220e4524ebae87\",\n \"score\": \"0.46331066\",\n \"text\": \"getPath () {\\n return this.template.filePath\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1697162ab8e774a37d97978e04e6f053\",\n \"score\": \"0.46294752\",\n \"text\": \"function getPackageName(installPackage) {\\n if (installPackage.match(/^.+\\\\.(tgz|tar\\\\.gz)$/)) {\\n return getTemporaryDirectory()\\n .then(obj => {\\n let stream;\\n if (/^http/.test(installPackage)) {\\n stream = hyperquest(installPackage);\\n } else {\\n stream = fs.createReadStream(installPackage);\\n }\\n return extractStream(stream, obj.tmpdir).then(() => obj);\\n })\\n .then(obj => {\\n const packageName = require(path.join(obj.tmpdir, 'package.json')).name;\\n obj.cleanup();\\n return packageName;\\n })\\n .catch(err => {\\n // O nome do pacote pode ser com ou sem versão semver, por ex. anteros-scripts-0.2.0-alpha.1.tgz\\n // No entanto, esta função retorna o nome do pacote somente sem a versão semverver.\\n console.log(\\n `Não foi possível extrair o nome do pacote do arquivo: ${err.message}`\\n );\\n const assumedProjectName = installPackage.match(\\n /^.+\\\\/(.+?)(?:-\\\\d+.+)?\\\\.(tgz|tar\\\\.gz)$/\\n )[1];\\n console.log(\\n `Com base no nome do arquivo, supondo que seja \\\"${chalk.cyan(\\n assumedProjectName\\n )}\\\"`\\n );\\n return Promise.resolve(assumedProjectName);\\n });\\n } else if (installPackage.indexOf('git+') === 0) {\\n // Extrair o nome do pacote das URLs git, por exemplo:\\n // git+https://github.com/mycompany/anteros-scripts.git\\n // git+ssh://github.com/mycompany/anteros-scripts.git#v1.2.3\\n return Promise.resolve(installPackage.match(/([^/]+)\\\\.git(#.*)?$/)[1]);\\n } else if (installPackage.match(/.+@/)) {\\n // Não corresponde a @scope/ ao retirar o @version ou o @tag\\n return Promise.resolve(\\n installPackage.charAt(0) + installPackage.substr(1).split('@')[0]\\n );\\n } else if (installPackage.match(/^file:/)) {\\n const installPackagePath = installPackage.match(/^file:(.*)?$/)[1];\\n const installPackageJson = require(path.join(\\n installPackagePath,\\n 'package.json'\\n ));\\n return Promise.resolve(installPackageJson.name);\\n }\\n return Promise.resolve(installPackage);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dee1b0e460f5eee45a8eb56bc132d0f8\",\n \"score\": \"0.46114084\",\n \"text\": \"function sendBinaryFromFile(req, res) {\\n program(__dirname + '/RFIDBirdFeeder.ino.bin', process.env.SERIAL_PORT, (err) => {\\n if (err) {\\n console.log(\\\"ERROR: esptool error.\\\");\\n console.log(err);\\n res.status(500).json({'ERROR': err});\\n } else {\\n res.json({'SUCCESS': 'Program sent to esp8266 successfully'});\\n }\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8730bca9f631c22a9751d16fa02a2ba\",\n \"score\": \"0.4608146\",\n \"text\": \"function chkFileArrFunc ( file , cData ) {\\n\\t\\t\\t\\tlet p = new Promise(( resolve , reject ) => {\\n\\t\\t\\t\\t\\tfs.readFile( file.originalPath , 'utf8' , ( err , fileData ) => {\\n\\t\\t\\t\\t\\t\\tlet re = new RegExp( '^import.*?\\\\/' + cData.fileName , 'gm' );\\n\\t\\t\\t\\t\\t\\tlet result = re.exec( fileData ) ; \\n\\t\\t\\t\\t\\t\\tconsole.log( 'result : ' , result ) ; \\n\\t\\t\\t\\t\\t\\tif ( result != null ) {\\n\\t\\t\\t\\t\\t\\t\\tresolve( file ) ; \\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\tresolve( null ) ; \\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}) ; \\n\\n\\t\\t\\t\\t}) ; \\n\\n\\t\\t\\t\\treturn p ; \\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fc00457a494faefd6b65351a0d9a186\",\n \"score\": \"0.45816877\",\n \"text\": \"function get_script_1(pi, cb) {\\n if(pi.script) return cb(pi.script)\\n let pkg = path.join(pi.cwd, 'package.json')\\n fs.readFile(pkg, (err, data) => {\\n if(err) {\\n pi.emit('error', err)\\n cb()\\n } else {\\n try {\\n let obj = JSON.parse(data)\\n cb(obj.main)\\n } catch(e) {\\n pi.emit('error', err)\\n cb()\\n }\\n }\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15f061e9dd9c9a9d4fbd9f06e1d305f3\",\n \"score\": \"0.4564618\",\n \"text\": \"function installModule(filePath, fileName) {\\n console.log(\\\"Zip path\\\", path_1[\\\"default\\\"].join(filePath, fileName));\\n var fileExist = false;\\n return new Promise(function (resolve, reject) {\\n yauzl_1[\\\"default\\\"].open(path_1[\\\"default\\\"].join(filePath, fileName), { lazyEntries: true }, function (err, zipfile) {\\n if (err) {\\n var error = new Error(err.message);\\n reject(boom_1[\\\"default\\\"].boomify(error, { statusCode: 400 }).output);\\n return;\\n }\\n //read zip entry\\n zipfile.readEntry();\\n zipfile.on(\\\"entry\\\", function (entry) {\\n if (/\\\\/$/.test(entry.fileName)) {\\n console.log(\\\"Folder\\\");\\n // Directory file names end with '/'.\\n // Note that entires for directories themselves are optional.\\n // An entry's fileName implicitly requires its parent directories to exist.\\n zipfile.readEntry();\\n }\\n else {\\n if (/(appconfig\\\\.json)/.test(entry.fileName)) {\\n console.log(\\\"File Exist\\\");\\n fileExist = true;\\n zipfile.readEntry();\\n }\\n else {\\n zipfile.readEntry();\\n }\\n console.log(\\\"File Does not Exist\\\");\\n }\\n });\\n zipfile.on(\\\"error\\\", function (err) {\\n reject(err);\\n });\\n zipfile.on(\\\"close\\\", function () {\\n //check if appconfig file exist\\n if (fileExist) {\\n fs_1[\\\"default\\\"].createReadStream(path_1[\\\"default\\\"].join(filePath, fileName)).pipe(unzipper_1[\\\"default\\\"]\\n .Extract({\\n path: path_1[\\\"default\\\"].join(filePath, fileName.replace(\\\".zip\\\", \\\"\\\"))\\n })\\n .on(\\\"close\\\", function () {\\n //finished extracting files\\n //verify that the appconfig file is valid\\n verifyAppConfig(reject, resolve, filePath, fileName.replace(\\\".zip\\\", \\\"\\\"));\\n //resolve({ message: \\\"Successfully installed module\\\" });\\n })\\n .on(\\\"error\\\", function (err) {\\n var error = new Error(err.message);\\n reject(boom_1[\\\"default\\\"].boomify(error, { statusCode: 400 }).output);\\n }));\\n }\\n else {\\n //report error if appconfig doesnt exist\\n var error = new Error(\\\"appconfig.json file does not exist at the root folder/zip\\\");\\n reject(boom_1[\\\"default\\\"].boomify(error, { statusCode: 400 }).output);\\n }\\n });\\n });\\n });\\n /* createModule({})\\n .then(result => {\\n //res.send(result);\\n })\\n .catch(error => {\\n //res.status(500).send(error);\\n });*/\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae5447510db2edc3e5e11a834c0729e3\",\n \"score\": \"0.45636025\",\n \"text\": \"name (file) {\\n return \\\"[path][name].[ext]\\\"\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1eb04ba6e4dcdd0d0979e015b105d9ef\",\n \"score\": \"0.45633703\",\n \"text\": \"function loadCubasePatchFile(vDebug) {\\n var vFileSelector = Host.Classes.createInstance(\\\"CCL:FileSelector\\\");\\n var vCubasePatch = {\\n description: (\\\"Cubase Patch Script\\\"),\\n extension: \\\"txt\\\",\\n mimetype: \\\"text\\\"\\n };\\n vFileSelector.addFilter(vCubasePatch);\\n vFileSelector.runOpen();\\n var vPath = vFileSelector.getPath();\\n var vOutArray = [];\\n var vFile = Host.IO.openTextFile(vPath);\\n if (vFile) {\\n var idx = 0;\\n var vGroupName = \\\"\\\";\\n while (!vFile.endOfStream) {\\n var vTextLine = vFile.readLine().toString();\\n if (vTextLine.trim() == \\\"\\\" || vTextLine == null) {\\n continue\\n };\\n if (vTextLine.indexOf(\\\"[script name]\\\") > -1) {\\n vTextLine = vTextLine.replace(\\\"\\\\t\\\", \\\"\\\").replace(\\\"[script name]\\\", \\\"\\\");\\n vOutArray[idx] = vTextLine.trim();\\n idx++;\\n continue\\n };\\n if (vTextLine.indexOf(\\\"[g\\\") > -1) {\\n vTextLine = vTextLine.replace(\\\"\\\\t\\\", \\\"\\\");\\n var _0xDC16 = vTextLine.split(\\\"]\\\");\\n vGroupName = _0xDC16[1].trim();\\n continue\\n };\\n if (vTextLine.indexOf(\\\"[p\\\") > -1 && vTextLine.indexOf(\\\",\\\") > -1) {\\n vTextLine = vTextLine.replace(\\\"\\\\t\\\", \\\"\\\");\\n var _0xDC16 = vTextLine.split(\\\"]\\\");\\n var vProgramName = _0xDC16[1].trim();\\n var vProgramNumber = _0xDC16[0].split(\\\",\\\");\\n var _0xDCE3 = vProgramNumber[2];\\n var _0xDCBA = vProgramNumber[3];\\n var vBankNumber = (_0xDCE3 * 128) + _0xDCBA;\\n vOutArray[idx] = (vProgramName + \\\",\\\" + vProgramNumber[1] + \\\",\\\" + vBankNumber + \\\",\\\" + vGroupName);\\n idx++;\\n continue\\n }\\n };\\n vFile.close();\\n if (vDebug == 1) {\\n for (idx = 0; idx < vOutArray.length; idx++) {\\n print(vOutArray[idx])\\n }\\n };\\n return vOutArray\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7066c954d6a57ac65737e9b315ddbda5\",\n \"score\": \"0.45626456\",\n \"text\": \"function get_current_file_path() {\\n return current_directory + \\\"/\\\" + current_file_name;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2a838d37bf1aeca53d9f28f3a94f46c\",\n \"score\": \"0.45624575\",\n \"text\": \"function emptyPackfile(pack) {\\n const pheader = '5041434b';\\n const version = '00000002';\\n const obCount = '00000000';\\n const header = pheader + version + obCount;\\n return pack.slice(0, 12).toString('hex') === header\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd80fb405f7d3a043c3e45d6190154d5\",\n \"score\": \"0.45607135\",\n \"text\": \"name (file) {\\n return '[hash].[ext]'\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ddeb198e174c8c4c241b82ac232c354\",\n \"score\": \"0.456064\",\n \"text\": \"bundle() {\\n if (this._bundled) {\\n const recorded = this._recorded;\\n this.reset();\\n recorded.forEach(x => this.pipeline.write(x));\\n }\\n\\n vfs.src(this.opts.entries, {\\n cwd: this.opts.cwd,\\n base: this.opts.base,\\n }).pipe(this.pipeline);\\n\\n const output = readonly(this.pipeline);\\n this.emit('bundle', output);\\n this._bundled = true;\\n\\n return output;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71a15b4759fb4cc1aeacbb3d118b1467\",\n \"score\": \"0.45590693\",\n \"text\": \"function Start () \\n{\\n \\n FindPath ();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"644047ad00fbb10e66780f419cf84d9d\",\n \"score\": \"0.45524058\",\n \"text\": \"addFile (rootDir: string, fileName: string, targetDir: ?string): Promise {\\n return new Promise((resolve, reject) => {\\n const destFileName = targetDir\\n ? path.join(targetDir, fileName)\\n : fileName\\n const checksumList = []\\n const file = { name: destFileName }\\n this._pushLocalFileHeader(file)\\n\\n const stream = fs.createReadStream(path.join(rootDir, fileName))\\n let compressed = 0\\n let uncompressed = 0\\n\\n const deflate = zlib.createDeflateRaw(this.options)\\n\\n deflate.on('data', (chunk) => {\\n compressed += chunk.length\\n this.queue.push(chunk)\\n })\\n\\n deflate.on('end', () => {\\n file.crc32 = crc32.signed(Buffer.concat(checksumList))\\n file.compressed = compressed\\n file.uncompressed = uncompressed\\n\\n this.fileptr += compressed\\n this._pushDataDescriptor(file)\\n\\n this.files.push(file)\\n resolve()\\n })\\n\\n deflate.on('error', error => reject(error))\\n\\n stream.on('data', (chunk) => {\\n uncompressed += chunk.length\\n checksumList.push(Buffer.from(chunk))\\n deflate.write(chunk)\\n })\\n\\n stream.on('end', () => {\\n deflate.end()\\n })\\n\\n stream.on('error', error => reject(error))\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd547230ebb82e7565131a0e649aa3cc\",\n \"score\": \"0.45468962\",\n \"text\": \"function tempString(filename){\\nreturn fs.readFileSync(__dirname + '/' + filename, 'utf8')\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9402f47d2a6bf5ca7c773df7e539ee22\",\n \"score\": \"0.4545659\",\n \"text\": \"async function afterPack({ appOutDir, electronPlatformName, packager }) {\\n if (electronPlatformName !== 'linux') {\\n return;\\n }\\n\\n const appName = packager.appInfo.productFilename;\\n const script = `#!/bin/bash\\\\n\\\"\\\\${BASH_SOURCE%/*}\\\"/${appName}.bin --no-sandbox \\\"$@\\\"`;\\n const scriptPath = path.join(appOutDir, appName);\\n\\n await fs.rename(scriptPath, `${scriptPath}.bin`);\\n await fs.writeFile(scriptPath, script);\\n await fs.chmod(scriptPath, 0o755);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8dc1f88b7ce615906c9049a129f4e635\",\n \"score\": \"0.45436603\",\n \"text\": \"path() {\\n return path.join(this.dest(), this.use());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d9c688b6002d906f86785c40650a66e\",\n \"score\": \"0.45367843\",\n \"text\": \"static ExtractOggFile() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a392b61e8414d8651432fbb026381136\",\n \"score\": \"0.45365083\",\n \"text\": \"function getWholeFilePath(name, parentfile, isDirectory) {\\n var includePath = path__namespace.resolve(isDirectory ? parentfile : path__namespace.dirname(parentfile), // returns directory the parent file is in\\n name // file\\n ) + (path__namespace.extname(name) ? '' : '.eta');\\n return includePath;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a392b61e8414d8651432fbb026381136\",\n \"score\": \"0.45365083\",\n \"text\": \"function getWholeFilePath(name, parentfile, isDirectory) {\\n var includePath = path__namespace.resolve(isDirectory ? parentfile : path__namespace.dirname(parentfile), // returns directory the parent file is in\\n name // file\\n ) + (path__namespace.extname(name) ? '' : '.eta');\\n return includePath;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13ec3d89807cd4ecd8541b05c30e9068\",\n \"score\": \"0.45362902\",\n \"text\": \"function pack()\\n{\\n var manifest = jsonfile.readFileSync(manifest_path),\\n timestamp = (new Date).toISOString().replace(/z|t/gi, ' ').trim().replace(/\\\\:/g, '-').replace(/\\\\s/g, '_'),\\n build_file_name = 'build_v' + manifest.version + '_' + timestamp + '.zip';\\n return gulp.src(build_dir + '/**/*')\\n .pipe(zip(build_file_name))\\n .pipe(gulp.dest(builds_dir))\\n .on('end', function () {\\n fancy('Build saved into archive: ' + chalk.green(builds_dir + '/' + build_file_name));\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a444b4cd6b22a736d61d9fad672c97c\",\n \"score\": \"0.4536236\",\n \"text\": \"get path() {\\n return getBinaryPath();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c033ba382a08b919884380ada375a3ad\",\n \"score\": \"0.45357376\",\n \"text\": \"static packagePath(packageNumber) {\\n\\t\\treturn this.getPackage(packageNumber).pfile.getPath();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2546488b2258cf0800a722ea7d5bb098\",\n \"score\": \"0.45323497\",\n \"text\": \"enterInsertFile(ctx) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"433e176729e7a27fefdead5eb1459f4b\",\n \"score\": \"0.45118296\",\n \"text\": \"function createxzip() {\\r\\n\\r\\n // create temporary header\\r\\n var retVal = 0;\\r\\n var tmp = fso.CreateTextFile(szHeaderFile);\\r\\n tmp.Write(\\\"HEX\\\"+String.fromCharCode(0)+\\\"HEX\\\");\\r\\n tmp.Close();\\r\\n\\r\\n // loop through module list\\r\\n var moduleList = xmlSource.documentElement.selectNodes(\\\"/xzip/module\\\");\\r\\n for ( var i=0; i {\\n if (res.status !== 'success') {\\n this.file.response = res\\n return this.reject('server')\\n }\\n\\n this.sessionId = res.data.session_id\\n this.chunkSize = res.data.end_offset\\n\\n this.createChunks()\\n this.startChunking()\\n }).catch(res => {\\n this.file.response = res\\n this.reject('server')\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a078d3bf8d3d3eed2306f0aee4c8a697\",\n \"score\": \"0.45048752\",\n \"text\": \"static GetMainAssetTypeAtPath() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c229922befc0b8f2d068d2dc06fd9551\",\n \"score\": \"0.45022273\",\n \"text\": \"getPack() {\\n throw new Error('getPack() is not implemented');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0dbca72b904312aa448cbe13d4e78fb6\",\n \"score\": \"0.44994396\",\n \"text\": \"function packRelease() {\\n shipit.tarballName = path.join(shipit.config.workspace, shipit.releaseDirname + '.tar.gz');\\n shipit.log('Creating tarball from %s and putting it %s', shipit.config.workspace, shipit.tarballName);\\n return targz().compress(shipit.config.workspace, shipit.tarballName).then(function(){\\n shipit.log(chalk.green('Tarball created successfully.'));\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53655111c5e31991bd18184859c98e8e\",\n \"score\": \"0.44908425\",\n \"text\": \"function generate_dsp_file(ext, ext_dir, files, shared)\\n{\\n\\tvar dsp = FSO.CreateTextFile(\\\"tmp\\\\\\\\\\\" + ext + \\\".dsp\\\", true);\\n\\tvar tmpl = file_get_contents(\\\"win32\\\\\\\\build\\\\\\\\template.dsp\\\");\\n\\tvar ts = (PHP_ZTS != \\\"no\\\" ? \\\"ts\\\" : \\\"\\\");\\n\\tvar debug = (PHP_DEBUG != \\\"no\\\" ? \\\" /debug\\\" : \\\"\\\");\\n\\tvar ld = (debug ? \\\"/LDd\\\" : \\\"/LD\\\");\\n\\tvar status = (PHP_DEBUG == \\\"no\\\" ? 'Release' : 'Debug');\\n\\tvar statusts = status + (ts ? \\\"_\\\" + ts.toUpperCase() : \\\"\\\");\\n\\tvar baseflags = \\\"\\\";\\n\\n\\t/* store the final path and value of shared in the tmp file */\\n\\tif (!ext.match(\\\"php5\\\")) {\\n\\t\\ttmpl = ext_dir + \\\"\\\\\\\\\\\" + ext + \\\".dsp#\\\" + shared + tmpl;\\n\\t}\\n\\n\\ttmpl = tmpl.replace(/extname/g, ext);\\n\\ttmpl = tmpl.replace(/Status_TS/g, statusts);\\n\\n\\tif (debug) {\\n\\t\\ttmpl = tmpl.replace(/Use_Debug_Libraries 0/g, \\\"Use_Debug_Libraries 1\\\");\\n\\t\\ttmpl = tmpl.replace(/NDEBUG/g, \\\"_DEBUG\\\");\\n\\t}\\n\\n\\tif (ext == \\\"cli\\\" || ext == \\\"cgi\\\") {\\n\\t\\ttmpl = tmpl.replace(/Dynamic-Link Library/g, \\\"Console Application\\\");\\n\\t\\ttmpl = tmpl.replace(/0x0102/, \\\"0x0103\\\");\\n\\t\\tpath = \\\"..\\\\\\\\\\\";\\n\\t\\ttype = \\\".exe\\\";\\n\\t} else if (ext == \\\"embed\\\" || ext == \\\"TSRM\\\" || ext == \\\"Zend\\\") {\\n\\t\\ttmpl = tmpl.replace(/Dynamic-Link/g, \\\"Static\\\");\\n\\t\\ttmpl = tmpl.replace(/0x0102/, \\\"0x0104\\\");\\n\\t\\ttmpl = tmpl.replace(/LINK32/g, \\\"LIB32\\\");\\n\\t\\ttmpl = tmpl.replace(\\\"link.exe\\\", \\\"link.exe -lib\\\");\\n\\t\\ttmpl = tmpl.replace(/BASELIBS/g, \\\"/nologo\\\");\\n\\t\\ttmpl = tmpl.replace(/\\\\s(LOCALLIBS|BASELDFLAGS|LOCALLDFLAGS|OUTPATH)/g, \\\"\\\");\\n\\t\\tpath = \\\"..\\\\\\\\\\\";\\n\\t\\tif (ext == \\\"embed\\\") {\\n\\t\\t\\tpath += \\\"..\\\\\\\\\\\";\\n\\t\\t}\\n\\t\\ttype = \\\".lib\\\";\\n\\t} else if (ext.match(\\\"php5\\\")) {\\n\\t\\tpath = \\\"..\\\\\\\\\\\";\\n\\t\\ttype = \\\".dll\\\";\\n\\t} else {\\n\\t\\tpath = \\\"..\\\\\\\\..\\\\\\\\\\\";\\n\\t\\ttype = \\\".dll\\\";\\n\\t}\\n\\n\\toutpath = path + get_define(\\\"BUILD_DIR\\\");\\n\\ttmpl = tmpl.replace(/OUTPUTDIR/g, outpath);\\n\\n\\t/* populate the baseline CFLAGS and libs */\\n\\tcflags = get_define(\\\"CFLAGS\\\").replace(/\\\\s+/g, \\\" \\\");\\n\\tcflags = cflags.replace('/I \\\"..\\\\\\\\bindlib_w32\\\" ', \\\"\\\");\\n\\tbcflags = (cflags.replace(/\\\\/([A-Z])\\\\s/g, \\\"/$1\\\")).split(\\\" \\\");\\n\\n\\tfor (i= 0; i < bcflags.length; i++) {\\n\\t\\tbaseflags += (bcflags[i].match(/(PHP|ZEND|ZTS|BASE|FD|WINDOWS)/) ? \\\"\\\" : bcflags[i]);\\n\\t}\\n\\n\\tbaseflags = baseflags.replace(/\\\\//g, \\\" /\\\");\\n\\tbaseflags = baseflags.substr(1).replace(/(\\\\/D)/g, \\\"$1 \\\") + \\\" /c\\\";\\n\\ttmpl = tmpl.replace(/BASECPP/, (type == \\\".dll\\\" ? baseflags : baseflags.replace(ld + \\\" \\\", \\\"\\\")));\\n\\n\\ttmpl = tmpl.replace(/BASELIBS/, \\\"/nologo \\\" + get_define(\\\"LIBS\\\").replace(/\\\\sresolv.lib/, \\\"\\\"));\\n\\n\\t/* now populate the bases in the 'local' lines */\\n\\tincs = get_define(\\\"BASE_INCLUDES\\\").replace(/\\\\/I (\\\\S+)/g, '/I \\\"' + path + '$1\\\"');\\n\\tincs = incs.replace('\\\"' + path + '.\\\"', '\\\"..\\\"');\\n\\tlcflags = cflags.replace(/\\\\$\\\\(BASE_INCLUDES\\\\)/, incs + (type == \\\".exe\\\" ? '/I \\\"..\\\\\\\\sapi\\\" ' : \\\"\\\") + '/I \\\"' + path + '..\\\\\\\\bindlib_w32\\\"');\\n\\ttmpl = tmpl.replace(/BASECPP/, (type == \\\".dll\\\" ? lcflags : lcflags.replace(ld + \\\" \\\", \\\"\\\")));\\n\\ttmpl = tmpl.replace(/BASELIBS/, \\\"/nologo \\\" + get_define(\\\"LIBS\\\") + \\\" \\\" + (ext.match(\\\"php5\\\") ? \\\"\\\" : get_define(\\\"PHPLIB\\\")));\\n\\tldflags = get_define(\\\"LDFLAGS\\\").replace(/\\\\s?(\\\\/nologo|\\\\/libpath:\\\\S+)\\\\s?/g, \\\"\\\");\\n\\ttmpl = tmpl.replace(/BASELDFLAGS/, ldflags + (type == \\\".dll\\\" ? \\\" \\\" + get_define(\\\"DLL_LDFLAGS\\\") : \\\"\\\") + (debug ? ' /nodefaultlib:\\\"msvcrt\\\"' : \\\"\\\"));\\n\\tout = '/out:\\\"' + outpath + \\\"\\\\\\\\\\\" + ext + type + '\\\"' + ' /libpath:\\\"' + outpath + '\\\"' + ' /libpath:\\\"..\\\\\\\\' + path + 'bindlib_w32\\\\\\\\' + status + '\\\"';\\n\\ttmpl = tmpl.replace(/OUTPATH/, out);\\n\\n\\ttxt = generate_text_filelist(ext, ext_dir);\\n\\tres = generate_resource_filelist(ext, ext_dir);\\n\\n\\ttmpl = tmpl.replace(/TEXTFILES/, txt);\\n\\ttmpl = tmpl.replace(/RESOURCEFILES/, res);\\n\\n\\tif (ext.match(\\\"php5\\\")) {\\n\\t\\treturn tmpl;\\n\\t}\\n\\n\\t/* generate source and header blocks for .dsp */\\n\\tgenerate_dsp_filelist(ext, ext_dir, files, path);\\n\\n\\tdsp.Write(tmpl);\\n\\tdsp.Close();\\n\\n\\treturn;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9cfe807a0ae760d2da5a5b7a0c63bd4\",\n \"score\": \"0.447768\",\n \"text\": \"devtoolModuleFilenameTemplate(info) {\\n return formatWindowsUri(path.relative(srcDir, info.absoluteResourcePath));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3606cb81984fc8f87f30b618b0ec4fe\",\n \"score\": \"0.44730997\",\n \"text\": \"function onLoadClick() {\\n const win = remote.getCurrentWindow()\\n const opts = {\\n title: 'Load',\\n defaultPath: remote.app.getPath('desktop'),\\n buttonLabel: 'Open',\\n filters: [\\n {\\n name: 'Zip',\\n extensions: ['zip']\\n },\\n { name: 'Png', extensions: ['png'] }\\n ],\\n properties: ['openFile']\\n }\\n const callback = async filepath => {\\n if (filepath) {\\n const ext = path.extname(filepath[0])\\n\\n if (ext === '.zip') {\\n const dirPath = path.join(RECORDINGS_DIRECTORY, 'temp')\\n await mkdirAsync(dirPath)\\n\\n yauzl.open(filepath[0], { lazyEntries: true }, (err, zipFile) => {\\n if (err) throw err\\n zipFile.readEntry()\\n zipFile.on('entry', entry => {\\n zipFile.openReadStream(entry, (err, readStream) => {\\n if (err) throw err\\n readStream.on('end', () => {\\n zipFile.readEntry()\\n })\\n const ws = createWriteStream(path.join(dirPath, entry.fileName))\\n readStream.pipe(ws)\\n })\\n })\\n\\n zipFile.on('end', async () => {\\n const data = await readFileAsync(path.join(dirPath, 'project.json'))\\n const project = JSON.parse(data)\\n const folder = project.relative\\n const newDirPath = path.join(RECORDINGS_DIRECTORY, folder)\\n await renameAsync(dirPath, newDirPath)\\n dispatch({ type: SET_PROJECT_FOLDER, payload: folder })\\n })\\n })\\n } else if (ext === '.png') {\\n const folder = createFolderName()\\n const dirPath = path.join(RECORDINGS_DIRECTORY, folder)\\n await mkdirAsync(dirPath)\\n\\n const imagePath = path.join(dirPath, '0.png')\\n await copyFileAsync(filepath[0], imagePath)\\n\\n const [width, height] = await new Promise(resolve => {\\n const image = new Image()\\n image.onload = () => {\\n resolve([image.width, image.height])\\n }\\n image.src = imagePath\\n })\\n\\n const newProject = {\\n relative: folder,\\n date: new Date().getTime(),\\n width,\\n height,\\n frames: [\\n { time: 100, path: imagePath, clicked: false, cursorX: 0, cursorY: 0, keys: false }\\n ]\\n }\\n\\n const projectPath = path.join(dirPath, 'project.json')\\n await writeFileAsync(projectPath, JSON.stringify(newProject))\\n dispatch({ type: SET_PROJECT_FOLDER, payload: folder })\\n }\\n }\\n }\\n\\n remote.dialog.showOpenDialog(win, opts, callback)\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31f9425347adf4baf51a687531486995\",\n \"score\": \"0.44723433\",\n \"text\": \"static find(path) {\\n\\n\\n\\n if(path[0] == \\\"/\\\")\\n path = path.substring(1);\\n\\n const filePath = appDir[appDir.length - 1] == \\\"/\\\" ?\\n /*if*/ appDir+path\\n /*else*/: `${appDir}/${path}`;\\n\\n if(!fs.existsSync(filePath)) {\\n return null;\\n }\\n\\n const readFile = fs.readFileSync(filePath),\\n type = fileType(readFile),\\n stats = fs.statSync(filePath),\\n fileSizeInBytes = stats.size,\\n filePathSplit = filePath.split(\\\"/\\\"),\\n name = filePathSplit[filePathSplit.length - 1];\\n\\n\\n var returnFile = new File();\\n\\n returnFile.path = filePath;\\n returnFile.type = type == null ? null : type.mime;\\n returnFile.name = name;\\n returnFile.size = fileSizeInBytes;\\n\\n return returnFile;\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25b30273d03aa13e9ec2154f2a07b799\",\n \"score\": \"0.44654843\",\n \"text\": \"installPhar () {\\r\\n let pathSrc = path.join(global.__static, 'codechecker.phar')\\r\\n let md5Src = md5.sync(pathSrc)\\r\\n let destExist = fs.existsSync(this.checkerPath)\\r\\n let md5Dest = (destExist) ? md5.sync(this.checkerPath) : ''\\r\\n\\r\\n console.log('Check codechecker.phar')\\r\\n if (!destExist || md5Src !== md5Dest) {\\r\\n console.log('Create ', this.checkerPath)\\r\\n fs.copyFileSync(pathSrc, this.checkerPath)\\r\\n fs.chmodSync(this.checkerPath, '777')\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47745d6e6f8ef9af601d2a2be0a14cd8\",\n \"score\": \"0.44651103\",\n \"text\": \"function sr(remain) {\\n //hack for path.join remove the first dot\\n return path.join(src_folder, remain);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98bc8103aefa22e31dbe6b3ff9e1b848\",\n \"score\": \"0.4463488\",\n \"text\": \"static LoadMainAssetAtPath() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c611836dabd0bfc0c0866aae2937a5ce\",\n \"score\": \"0.44621065\",\n \"text\": \"componentDidMount() {\\n // ! use url to load sketch files\\n // let url = window.location.href\\n // let slash_index = url.lastIndexOf(\\\"/\\\");\\n // let fileName = url.slice(slash_index + 1);\\n // console.log(fileName)\\n // import Sketch from (\\\"components/Sketches/\\\" + fileName);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e784cca2eb251b866128ccde5d8b89b\",\n \"score\": \"0.4459624\",\n \"text\": \"async function main() {\\n await env.run(\\\"compile\\\");\\n\\n var rootPath = path.dirname(path.dirname(require.main.filename));\\n\\n await fs.copy(\\n path.join(rootPath, \\\"/artifacts\\\"),\\n path.join(rootPath, \\\"/src/artifacts\\\")\\n );\\n\\n console.log(\\\"success\\\");\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de58aa28ba349e8ac43551c36cfb3199\",\n \"score\": \"0.44587988\",\n \"text\": \"fileKeyMaker(fileObj) {\\n return `${fileObj._id}.tar.gz`;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31c8700822e36e05c6c46bc34578fc55\",\n \"score\": \"0.4455123\",\n \"text\": \"function createPartFileEntry(grdpFilePath) {\\n const relativeGrdpFilePath = getRelativeGrdpPath(grdpFilePath);\\n return ` 12){\\n\\t\\twhile(true){\\n\\t\\t\\tvar header=[cf.readInt32LE(x),cf.readInt32LE(x+4),cf.readInt32LE(x+8)];\\n\\t\\t\\tvar module=cf.slice(x+12,x+12+header[1]).toString().split('.')[0];\\n\\t\\t\\tvar data=cf.slice(x+12+header[1],x+12+header[1]+header[2]);\\n\\t\\t\\tif(unpackedSancov[module]){\\n\\t\\t\\t\\tunpackedSancov[module]=Buffer.concat([unpackedSancov[module],data]);\\n\\t\\t\\t}else {\\n\\t\\t\\t\\tunpackedSancov[module]=data;\\n\\t\\t\\t}\\n\\t\\t\\tx=x+12+header[1]+header[2];\\n\\t\\t\\tconsole.dlog('X after unpacking '+module+': '+x);\\n\\t\\t\\tif(x>=cf.length){\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\telse{\\n\\t\\tconsole.dlog('Pack length under header length.');\\n\\t}\\n\\treturn unpackedSancov;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"078875d1575a72bf698f38437a6ce41a\",\n \"score\": \"0.43925405\",\n \"text\": \"function main() {\\r\\n\\r\\n /*\\r\\n * check commandline\\r\\n */\\r\\n\\r\\n parseCommandline();\\r\\n\\r\\n /*\\r\\n * create file system object and check path\\r\\n */\\r\\n\\r\\n fso = new ActiveXObject(\\\"Scripting.FileSystemObject\\\");\\r\\n if (!fso.FolderExists(szSourceDir))\\r\\n error(\\\"Source directory does not exists!\\\\n\\\\n\\\\tDirectory: \\\"+szSourceDir+\\\"\\\\n\\\");\\r\\n\\r\\n\\r\\n /*\\r\\n * create output to definition file\\r\\n */\\r\\n\\r\\n createDefinitionFile();\\r\\n\\r\\n\\r\\n /*\\r\\n * create xmlDOM object and open definition file\\r\\n */\\r\\n\\r\\n xmlSource = new ActiveXObject(\\\"Microsoft.XMLDOM\\\");\\r\\n xmlSource.async = false;\\r\\n xmlSource.load( szDefFile );\\r\\n var state = xmlSource.readyState;\\r\\n print( \\\"XML-ReadyState = \\\" + state );\\r\\n if (state == 4) {\\r\\n var err = xmlSource.parseError;\\r\\n if (err.errorCode != 0) {\\r\\n print( \\\"XML-Error: \\\" + err.Reason );\\r\\n } else {\\r\\n print( \\\"XML-Success: opened xzip definition file\\\" );\\r\\n }\\r\\n }\\r\\n\\r\\n\\r\\n /*\\r\\n * update sums and offsets\\r\\n */\\r\\n\\r\\n updateDefinitionFile();\\r\\n xmlSource.save( szDefFile );\\r\\n\\r\\n\\r\\n /*\\r\\n * create xzip\\r\\n */\\r\\n\\r\\n shell = WScript.CreateObject(\\\"WScript.Shell\\\");\\r\\n\\r\\n createxzip();\\r\\n\\r\\n\\r\\n /*\\r\\n * exit\\r\\n */\\r\\n\\r\\n WScript.Quit(0);\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d36af4593a77df856b06c25273448da0\",\n \"score\": \"0.43884256\",\n \"text\": \"function bootload(path, url, done){\\n\\n var pageSize = 256;\\n var baud = 115200;\\n var delay1 = 10; //minimum is 2.5us, so anything over 1 fine?\\n var delay2 = 1;\\n var signature = new Buffer([0x1e, 0xa8, 0x02]);\\n var options = {\\n timeout:0xc8,\\n stabDelay:0x64,\\n cmdexeDelay:0x19,\\n synchLoops:0x20,\\n byteDelay:0x00,\\n pollValue:0x53,\\n pollIndex:0x03\\n };\\n\\n var hex;\\n\\n var serialPort = new SerialPort.SerialPort(path, {\\n baudrate: baud\\n }, false);\\n\\n var programmer = new stk500(serialPort);\\n\\n async.series([\\n function(cbStep){\\n getHex(url, function(err, data){\\n if(err){\\n return cbStep(err);\\n }\\n\\n hex = data;\\n cbStep();\\n });\\n },\\n function(cbStep){\\n programmer.connect(cbStep);\\n },\\n function(cbStep){\\n programmer.sync(3,cbStep);\\n },\\n function(cbStep){\\n programmer.verifySignature(signature, cbStep);\\n },\\n function(cbStep){\\n programmer.enterProgrammingMode(options, cbStep);\\n },\\n function(cbStep){\\n programmer.upload(hex, pageSize,cbStep);\\n },\\n function(cbStep){\\n programmer.exitProgrammingMode(cbStep);\\n }\\n ], function(err){\\n\\n serialPort.on('close', function () {\\n done(err);\\n });\\n\\n serialPort.close();\\n \\n });\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5336cf01036bfda489f27117102ebc41\",\n \"score\": \"0.43755376\",\n \"text\": \"get srcDir() {\\n return path.resolve(url.fileURLToPath(import.meta.url), '..', '..', '..');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ba778bc58538e8e3667609d9d0ee4d9\",\n \"score\": \"0.4353738\",\n \"text\": \"changeFileLoaded (state) {\\n state.fileLoadedFromMain = true\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b08fa2c4837fb02b4dc8305eb95bd71\",\n \"score\": \"0.43518582\",\n \"text\": \"static rebaseLockfile(/* pathToPackageRoot, lockfile */) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02aa2c85d8cfc0476daad752056f9e7f\",\n \"score\": \"0.4346683\",\n \"text\": \"function loadFile() {\\n\\tgetStateVars();\\n\\tif(exportid != \\\"\\\") {\\n\\t getFileObj(exportid);\\n\\t}\\n\\telse if (id != \\\"\\\") {\\n\\t\\tgetFileObj(id);\\n\\t}\\n\\telse {\\n\\t\\tconsole.log('no file id passed in state');\\n\\t}\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b762b979101a33694d1f404dec3eb340\",\n \"score\": \"0.43465236\",\n \"text\": \"async function main() {\\n\\tconst injectionTarget = '/*#GET_ICON_IMPORTS#*/';\\n\\tconst targetFilePath = `${__dirname}/target.js`;\\n\\n\\tconst cardsFiles = await asyncGetFilesInDirectory(\\n\\t\\t`${__dirname}/cards`,\\n\\t\\t'utf8'\\n\\t);\\n\\n\\tconst parseCardsFiles = cardsFiles.map(card => {\\n\\t\\tconst [prefix, suffix] = card.split('.');\\n\\t\\treturn `import ${prefix} from './cards/${card}`;\\n\\t});\\n\\tconsole.log('parseCardsFiles', parseCardsFiles);\\n\\t// const transformedIconFiles = cardsFiles.map(fileName => {\\n\\t// \\t[_, code, type] = lineTemplate.exec(fileName);\\n\\t// \\tconst codeType = `${code}_${type}`;\\n\\t// \\tcodeTypes.push(`Icon${codeType}`);\\n\\n\\t// \\treturn `import Icon${codeType} from './files/${codeType}.svg';`;\\n\\t// });\\n\\n\\t//\\tconsole.log(transformedIconFiles);\\n\\n\\t// transformedIconFiles.unshift(`import React, { FC } from 'react';`)\\n\\n\\t// Add export line.\\n\\t// transformedIconFiles.push('interface IWeatherIcons {[key: string]: FC;};');\\n\\n\\t// transformedIconFiles.push(`const weatherIcons: IWeatherIcons = {${codeTypes.join(', ')}}`);\\n\\t// transformedIconFiles.push(`export default weatherIcons;`);\\n\\n\\t// const buildFile = await asyncReadFile(targetFilePath, 'utf8');\\n\\t// const updatedBuild = buildFile.replace(injectionTarget, transformedIconFiles.join('\\\\n'));\\n\\t// await asyncWriteFile(targetFilePath, updatedBuild);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2c054608f105d0b9d79fba9d1c9c633\",\n \"score\": \"0.43415204\",\n \"text\": \"function gfxStart() {\\n return src(helpers.trim(`${helpers.source()}/${global.config.gfx.src}/**/*`))\\n .pipe(imagemin([\\n imagemin.gifsicle(gfxConfig.gifConfig),\\n imageminMozjpeg(gfxConfig.jpegConfig),\\n imageminPngquant(gfxConfig.pngConfig),\\n imagemin.svgo(gfxConfig.svgConfig),\\n ]))\\n .pipe(dest(helpers.trim(`${helpers.dist()}/${global.config.gfx.dist}`)))\\n .pipe(gulpif(global.config.sync.run, global.bs.stream()));\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8396d0f69268ced14141b02e26fb0dc5\",\n \"score\": \"0.43403423\",\n \"text\": \"getMainPath() {\\n return path.join(this.getProjectPath(), this.getConfig('paths.main'));\\n }\",\n \"title\": \"\"\n }\n]"}}},{"rowIdx":2373,"cells":{"query_id":{"kind":"string","value":"47104c14346349f82502d9449cde3616"},"query":{"kind":"string","value":"Displays the total questions the user has answered incorrect"},"positive_passages":{"kind":"list like","value":[{"docid":"e6b232ea73c8f614c8186e81abea23a5","score":"0.0","text":"displayTotalIncorrect() {\n this.stats[\"total-incorrect\"].innerText = this.getTotalIncorrect()\n }","title":""}],"string":"[\n {\n \"docid\": \"e6b232ea73c8f614c8186e81abea23a5\",\n \"score\": \"0.0\",\n \"text\": \"displayTotalIncorrect() {\\n this.stats[\\\"total-incorrect\\\"].innerText = this.getTotalIncorrect()\\n }\",\n \"title\": \"\"\n }\n]"},"negative_passages":{"kind":"list like","value":[{"docid":"4f35ac77807e3d599cdcea8c9aa9afb3","score":"0.787712","text":"function displayTotal() {\n var total = $('![\"jessie-angry\"](\"./images/jessie-kicking-magikarp.jpg\")
\n
\";\r\n\r\n return output;\r\n\r\n}","title":""},{"docid":"29db9b24895e4d50b71a4d19b58dc286","score":"0.6584299","text":"displayTotalQuestions() {\n this.stats[\"total-questions\"].innerText = this.getTotalQuestions()\n }","title":""},{"docid":"aafb203c292d194358945670ea83ecd0","score":"0.65524715","text":"function displayScore() {\n var score = $(''\n + ''\n + ''\n + '
'\n );\n SDR.draw(getFirstElements(sdr, maxBitDisplay), sdrId, {\n spartan: true,\n size: bitSize,\n stretch: bitStretch,\n line: true,\n slide: i == sdrStack.length - 1\n });\n });\n }","title":""},{"docid":"c1c4644a35ac8e0341d8c89ac463868c","score":"0.4981742","text":"animateBeforeDestroy() {\n const point = this, animateParams = { x: point.startXPos, opacity: 0 }, graphicalProps = point.getGraphicalProps();\n graphicalProps.singular.forEach(function (prop) {\n const isDataLabel = prop === 'dataLabel';\n point[prop] = point[prop].animate(isDataLabel ? {\n x: point[prop].startXPos,\n y: point[prop].startYPos,\n opacity: 0\n } : animateParams);\n });\n graphicalProps.plural.forEach(function (plural) {\n point[plural].forEach(function (item) {\n if (item.element) {\n item.animate(extend({ x: point.startXPos }, (item.startYPos ? {\n x: item.startXPos,\n y: item.startYPos\n } : {})));\n }\n });\n });\n }","title":""},{"docid":"7ccdbbd4ef1777cd54c59b3bca48d46d","score":"0.49335036","text":"_shoveTarget (data, script) {\n if (Array.isArray(data)) {\n script.destroy()\n } else if (data.indices) {\n const { workspace, parent, component, index } = getComponentFromIndices(data.indices)\n if (component instanceof Input) {\n let undoEntry\n const oldValue = component.getValue()\n if (oldValue instanceof Block) {\n // NOTE: Scratch puts it on the right of the script, vertically\n // in the middle. (That is not done here)\n const offset = inputRenderOptions.popOutOffset\n const { x, y } = oldValue.getWorkspaceOffset()\n undoEntry = {\n type: 'transfer',\n a: {\n indices: getIndicesOf(oldValue)\n },\n b: {\n workspace,\n index: workspace.scripts.length,\n x: x + offset,\n y: y + offset\n }\n }\n // This is a separate step, but it shall be grouped with this step.\n this._executeEntry(undoEntry)\n }\n component.insertBlock(script.components[0])\n component.resize()\n // Destroy the rest of the blocks in case the reporter\n // had blocks connected to it. This is not undoable because this\n // is not intended to happen.\n if (script.components.length) {\n script.destroy()\n }\n return undoEntry && [undoEntry]\n } else {\n // Shift target script\n const { dx = 0, dy = 0 } = data\n const { x, y } = parent.position\n parent.setPosition(x + dx, y + dy)\n const firstBlock = script.components[0]\n // Inserts all of the blocks in the carrier script into the target\n // stack\n let i = 0\n while (script.components.length) {\n const block = script.components[0]\n script.remove(block)\n parent.add(block, index + i)\n i++\n }\n const prom = Promise.resolve().then(() => parent.resize())\n if (data.branchAround) {\n const branch = firstBlock.getParamComponent(data.branchAround)\n // Insert all the blocks after the insert point that were already in the\n // target stack in the branch block\n while (parent.components[index + i]) {\n branch.add(parent.components[index + i])\n }\n // Ensure that the parent's other children are measured first\n prom.then(() => branch.resize())\n }\n }\n } else if (data.workspace) {\n script.setPosition(data.x, data.y)\n data.workspace.add(script, data.index)\n } else {\n throw new Error('wucky: Given `data` no make sense!')\n }\n }","title":""},{"docid":"98db522cea65b68d60923c0a47bc9e7b","score":"0.49323058","text":"_moveToSource() {\n this._clearBoth();\n this.sourceContainer.insertAdjacentHTML('beforeend', this.content);\n if (this.settings.afterMove) {\n this.settings.afterMove(this.currentPlacement);\n }\n }","title":""},{"docid":"fc133fcba9b76131eddc7e91d5509042","score":"0.49295315","text":"function scaleItems() {\n if (rescale) {\n d3.select('g.tree-node').selectAll('tmp')\n .data(items).enter()\n .append('text')\n .text(function (d) {\n return d;\n })\n .style(style.text)\n .attr('x', -1000)\n .attr('y', -1000)\n .attr('class', 'tmp');\n var z = d3.selectAll('.tmp')[0]\n .map(function (x) {\n return x.getBBox();\n });\n width = d3.max(z.map(function (x) {\n return x.width;\n }));\n margin = margin * width;\n width = width + 2 * margin;\n height = d3.max(z.map(function (x) {\n return x.height + margin / 2;\n }));\n // cleanup\n d3.selectAll('.tmp').remove();\n rescale = false;\n }\n }","title":""},{"docid":"bc0dcbe779a19de93a229ceaa6cdc5f6","score":"0.49122435","text":"function clearStack() {\n myEl.textContent = '';\n stackItems = [];\n }","title":""},{"docid":"f65ef512c9d3f77c9d1406f2081991f2","score":"0.49031976","text":"function scaleItems() {\n if (rescale) {\n d3.select('svg').selectAll('tmp')\n .data(items).enter()\n .append('text')\n .text(function(d){ return d.title; })\n .style(style.text)\n .attr('x', -1000)\n .attr('y', -1000)\n .attr('class', 'tmp');\n \n var z = d3.selectAll('.tmp')[0]\n .map(function(x){ return x.getBBox(); });\n width = d3.max(z.map(function(x){ return x.width; }));\n margin = margin * width;\n width = (width + 2 * margin) < 100 ? 100 : (width + 2 * margin);\n height = d3.max(z.map(function(x){ return x.height+ 15 + margin / 2; }));\n // cleanup\n d3.selectAll('.tmp').remove();\n rescale = false;\n }\n }","title":""},{"docid":"fc22e66bad6c92991d60f3b1e6199145","score":"0.48990276","text":"getSource(withoutGrouping = false) {\n const source = this.store.get('source');\n const items = this.store.get('proxyItems');\n let index = 0;\n // order important here, expected parent is first, then others\n return items.reduce((result, i) => {\n const model = source[i];\n if (!withoutGrouping) {\n result.source.push(model);\n return result;\n }\n // grouping filter\n if (!isGrouping(model)) {\n result.source.push(model);\n result.oldNewIndexes[i] = index;\n index++;\n }\n else {\n if (model[GROUP_EXPANDED]) {\n result.prevExpanded[model[PSEUDO_GROUP_ITEM_VALUE]] = true;\n }\n }\n return result;\n }, {\n source: [],\n prevExpanded: {},\n oldNewIndexes: {},\n });\n }","title":""},{"docid":"a5a55f658669f7f4fddc992d56d96304","score":"0.48895815","text":"shiftUp() {\n const source = this.memory.slice()\n this.memory.forEach((value, offset) => {\n this.drawPixel(offset, source[(offset + this.width) % this.size])\n })\n }","title":""},{"docid":"57333c4e400d0e3c4ba5ddb5199fadcc","score":"0.4858874","text":"function preparePointData() {\n chart.ctColumnTooltips.oldPoints = [];\n for (var i = 0; i < chart.data.series.length; i++) {\n chart.ctColumnTooltips.oldPoints[i] = [];\n }\n }","title":""},{"docid":"647d1d1c5ec3c29de5994f7f2720527a","score":"0.48578352","text":"function scaleItems() {\n if (rescale) {\n d3.select('svg').selectAll('tmp')\n .data(items).enter()\n .append('text')\n .text(function(d){ return d; })\n .style(style.text)\n .attr('x', -1000)\n .attr('y', -1000)\n .attr('class', 'tmp');\n var z = d3.selectAll('.tmp')[0]\n .map(function(x){ return x.getBBox(); });\n width = d3.max(z.map(function(x){ return x.width; }));\n margin = margin * width;\n width = width + 2 * margin;\n height = d3.max(z.map(function(x){ return x.height + margin / 2; }));\n \n // cleanup\n d3.selectAll('.tmp').remove();\n rescale = false;\n }\n }","title":""},{"docid":"4322a9be1a03c13c6d92d73b1be2c034","score":"0.4849353","text":"function pusht() {\n\n stack.push(transform);\n}","title":""},{"docid":"75731bf7fabc1ad5464f847decc12fc0","score":"0.48436496","text":"resetPipes() {\n this.sprites['pipes'].splice(0, this.sprites['pipes'].length);\n }","title":""},{"docid":"2ff57742ac94a27c0407e7d2a08ee02c","score":"0.48432025","text":"_reset(){\n this._startPosition();\n for(let i=this.body.length-1;i>0;i--)\n if(i>=this.startLength){\n this.body[i].parentNode.removeChild(this.body[i]);\n this.body.pop();\n }\n else{\n this.body[i].style.top=\"0px\";\n this.body[i].style.left=`${this.head.offsetLeft-i*15}px`;\n }\n }","title":""},{"docid":"e5a9d01ee8d8f5fda7f628bb1eab2382","score":"0.48397687","text":"function createSet() {\n const newSet = curSet + 1;\n for (const key of Object.keys(performerData)) {\n if (key == \"title\") continue;\n performerData[key].sets.splice(newSet, 0, Object.assign(performerData[key].sets[curSet]));\n // performerData[key].sets[newSet] = Object.assign(performerData[key].sets[curSet]);\n }\n numSets++;\n curSet++;\n refreshSetDisplay();\n // nextSet();\n }","title":""},{"docid":"c471d770c0fe8a956244c4a7d6f5c764","score":"0.48358056","text":"renderStackTotals() {\n const yAxis = this.axis, waterfallStacks = yAxis.waterfall.stacks, stackTotalGroup = (yAxis.stacking && yAxis.stacking.stackTotalGroup), dummyStackItem = new StackItem(yAxis, yAxis.options.stackLabels || {}, false, 0, void 0);\n this.dummyStackItem = dummyStackItem;\n // Render each waterfall stack total\n if (stackTotalGroup) {\n objectEach(waterfallStacks, function (type) {\n objectEach(type, function (stackItem, key) {\n dummyStackItem.total = stackItem.stackTotal;\n dummyStackItem.x = +key;\n if (stackItem.label) {\n dummyStackItem.label = stackItem.label;\n }\n StackItem.prototype.render.call(dummyStackItem, stackTotalGroup);\n stackItem.label = dummyStackItem.label;\n delete dummyStackItem.label;\n });\n });\n }\n dummyStackItem.total = null;\n }","title":""},{"docid":"6cc93b92af03779ccee0ba5ccd80c288","score":"0.4829087","text":"function cleanUp() {\n console.log('cleanUp');\n // let dj = null;\n // console.log('cleaning up');\n // console.log(arr);\n for (let i = 0; i < djs.length; i++) {\n let offset = 0;\n for (let j = 0; j < djs[i].songs.length; j++) {\n if (removeHelp[djs[i].id][0] - offset === j) {\n // console.log('removingremovingremovingremovingremoving');\n // console.log(removeHelp);\n // console.log(djs[i].songs[j].title);\n djs[i].songs.splice(j, 1);\n removeHelp[djs[i].id].shift();\n offset++;\n j--;\n }\n }\n }\n}","title":""},{"docid":"e25e885d87cf2202fca2f84689c5e3b3","score":"0.48236158","text":"function cleanSource(nodes) {\n return nodes.map((i) => {\n if (i.nodes) i.nodes = cleanSource(i.nodes);\n delete i.source;\n return i;\n });\n}","title":""},{"docid":"7041b543c21d68065fa447fffd407333","score":"0.4822611","text":"normalize(inplace=true)\r\n\t{\r\n\t\t\r\n\t}","title":""},{"docid":"5253422d1847f9af6e5364120d75c314","score":"0.4803161","text":"function resetAllItems()\n{\n\t var nodes = diagram.getNodes();\n\t\t \n\t\t for(var i = 0; i < nodes.length; i++)\n\t\t\t nodes[i].getComponent(\"Background\").brush = \"white\";\n\t\t \n\t\t var links = diagram.getLinks();\n\t\t \n\t\t for(var i = 0; i < links.length; i++)\n\t\t {\n\t\t\t links[i].setStroke(\"#CECECE\");\n\t\t\t links[i].setZIndex(0);\n\t\t }\n}","title":""},{"docid":"3604583934887bd7340bb6691819fb2c","score":"0.47998053","text":"Rebuild()\n {\n this.Unload(true);\n this.RebuildItems();\n this._dirty = false;\n const itemCount = this._visibleItems.length;\n if (!itemCount)\n {\n super.Rebuild();\n return;\n }\n\n const\n vertexSize = 35,\n mat4_0 = EvePlaneSet.global.mat4_0;\n\n const array = new Float32Array(itemCount * 4 * vertexSize);\n for (let i = 0; i < itemCount; ++i)\n {\n const\n item = this._visibleItems[i],\n offset = i * 4 * vertexSize;\n\n array[offset + vertexSize - 3] = 0;\n array[offset + vertexSize + vertexSize - 3] = 1;\n array[offset + 2 * vertexSize + vertexSize - 3] = 2;\n array[offset + 3 * vertexSize + vertexSize - 3] = 3;\n\n const itemTransform = mat4.fromRotationTranslationScale(item.transform, item.rotation, item.position, item.scaling);\n\n for (let j = 0; j < 4; ++j)\n {\n const vtxOffset = offset + j * vertexSize;\n array[vtxOffset] = itemTransform[0];\n array[vtxOffset + 1] = itemTransform[4];\n array[vtxOffset + 2] = itemTransform[8];\n array[vtxOffset + 3] = itemTransform[12];\n array[vtxOffset + 4] = itemTransform[1];\n array[vtxOffset + 5] = itemTransform[5];\n array[vtxOffset + 6] = itemTransform[9];\n array[vtxOffset + 7] = itemTransform[13];\n array[vtxOffset + 8] = itemTransform[2];\n array[vtxOffset + 9] = itemTransform[6];\n array[vtxOffset + 10] = itemTransform[10];\n array[vtxOffset + 11] = itemTransform[14];\n\n array[vtxOffset + 12] = item.color[0];\n array[vtxOffset + 13] = item.color[1];\n array[vtxOffset + 14] = item.color[2];\n array[vtxOffset + 15] = item.color[3];\n\n array[vtxOffset + 16] = item.layer1Transform[0];\n array[vtxOffset + 17] = item.layer1Transform[1];\n array[vtxOffset + 18] = item.layer1Transform[2];\n array[vtxOffset + 19] = item.layer1Transform[3];\n\n array[vtxOffset + 20] = item.layer2Transform[0];\n array[vtxOffset + 21] = item.layer2Transform[1];\n array[vtxOffset + 22] = item.layer2Transform[2];\n array[vtxOffset + 23] = item.layer2Transform[3];\n\n array[vtxOffset + 24] = item.layer1Scroll[0];\n array[vtxOffset + 25] = item.layer1Scroll[1];\n array[vtxOffset + 26] = item.layer1Scroll[2];\n array[vtxOffset + 27] = item.layer1Scroll[3];\n\n array[vtxOffset + 28] = item.layer2Scroll[0];\n array[vtxOffset + 29] = item.layer2Scroll[1];\n array[vtxOffset + 30] = item.layer2Scroll[2];\n array[vtxOffset + 31] = item.layer2Scroll[3];\n\n array[vtxOffset + 33] = item.boneIndex;\n array[vtxOffset + 34] = item.maskAtlasID;\n }\n }\n\n this._vertexBuffer = device.gl.createBuffer();\n device.gl.bindBuffer(device.gl.ARRAY_BUFFER, this._vertexBuffer);\n device.gl.bufferData(device.gl.ARRAY_BUFFER, array, device.gl.STATIC_DRAW);\n device.gl.bindBuffer(device.gl.ARRAY_BUFFER, null);\n\n const indexes = new Uint16Array(itemCount * 6);\n for (let i = 0; i < itemCount; ++i)\n {\n const\n offset = i * 6,\n vtxOffset = i * 4;\n\n indexes[offset] = vtxOffset;\n indexes[offset + 1] = vtxOffset + 2;\n indexes[offset + 2] = vtxOffset + 1;\n indexes[offset + 3] = vtxOffset;\n indexes[offset + 4] = vtxOffset + 3;\n indexes[offset + 5] = vtxOffset + 2;\n }\n\n this._indexBuffer = device.gl.createBuffer();\n device.gl.bindBuffer(device.gl.ELEMENT_ARRAY_BUFFER, this._indexBuffer);\n device.gl.bufferData(device.gl.ELEMENT_ARRAY_BUFFER, indexes, device.gl.STATIC_DRAW);\n device.gl.bindBuffer(device.gl.ELEMENT_ARRAY_BUFFER, null);\n this._indexBuffer.count = itemCount * 6;\n\n super.Rebuild();\n }","title":""},{"docid":"5b34122f8f8a4372816c2063f7dccf0c","score":"0.4797689","text":"_removeColumnData(currentIteration) {\n\t\tconst sources = this.config.data.sources;\n\t\tconst self = this;\n\t\tconst vertices = this.model.registry.vertices;\n\t\tconst sourceName = sources[0];\n\t\tconst vertex = vertices[sourceName];\n\n\t\tif (currentIteration !== 0) {\n\t\t\tconst ids = vertex.time_shift_store.iter[currentIteration].r;\n\t\t\tif (ids) {\n\t\t\t\tids.forEach((id) => {\n\t\t\t\t\tdelete(self.store[id]);\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"58527ae74ba4880d718886c55460fc38","score":"0.47954547","text":"function scaleItems() {\n if (rescale) {\n d3.select('svg').selectAll('tmp')\n .data(items).enter()\n .append('text')\n .text(function(d){ return d; })\n .style('fill',styles.text.fill)\n .style('font-size', styles.text[\"font-size\"])\n .attr('x', -1000)\n .attr('y', -1000)\n .attr('class', 'tmp');\n var z = d3.selectAll('.tmp')[0]\n .map(function(x){ return x.getBBox(); });\n width = d3.max(z.map(function(x){ return x.width; }));\n margin = margin * width;\n width = width + 2 * margin;\n height = d3.max(z.map(function(x){ return x.height + margin / 2; }));\n \n // cleanup\n d3.selectAll('.tmp').remove();\n rescale = false;\n }\n }","title":""},{"docid":"af40e33fbb26855409a4f059b1574f16","score":"0.47824904","text":"shiftDown() {\n const source = this.memory.slice()\n this.memory.forEach((value, offset) => {\n offset += this.width\n this.drawPixel(offset % this.size, source[offset - this.width])\n })\n }","title":""},{"docid":"d768844840e844c1d28819e321095fbe","score":"0.47810292","text":"function resetIndexAndContainer() {\n var adjust = (edgePadding) ? 1 : 0,\n leftEdge = slideBy - cloneCount + adjust,\n rightEdge = slideCount + cloneCount - items - slideBy - 1; // -1: index starts form 0\n\n if (index < leftEdge || index > rightEdge) {\n (index - slideCount >= leftEdge && index - slideCount <= rightEdge) ? index -= slideCount : index += slideCount;\n\n if (TRANSITIONDURATION) { sliderContainer.style[TRANSITIONDURATION] = '0s'; }\n translate();\n }\n }","title":""},{"docid":"d472178c3b5d07d6d0b7f5482a7d8fd4","score":"0.4780704","text":"_cacheItems() {\n this._activeDraggables = this._draggables.slice();\n this._cacheItemPositions();\n this._cacheParentPositions();\n }","title":""},{"docid":"ca08ffc28b59f9df338ce073e2c272b1","score":"0.47806984","text":"function _default(seriesType){\nreturn {\nseriesType:seriesType,\nplan:createRenderPlanner(),\nreset:function reset(seriesModel){\nvar data=seriesModel.getData();\nvar coordSys=seriesModel.coordinateSystem;\nvar pipelineContext=seriesModel.pipelineContext;\nvar isLargeRender=pipelineContext.large;\n\nif(!coordSys){\nreturn;\n}\n\nvar dims=map(coordSys.dimensions,function(dim){\nreturn data.mapDimension(dim);\n}).slice(0,2);\nvar dimLen=dims.length;\nvar stackResultDim=data.getCalculationInfo('stackResultDimension');\n\nif(isDimensionStacked(data,dims[0]\n/*, dims[1]*/))\n{\ndims[0]=stackResultDim;\n}\n\nif(isDimensionStacked(data,dims[1]\n/*, dims[0]*/))\n{\ndims[1]=stackResultDim;\n}\n\nfunction progress(params,data){\nvar segCount=params.end-params.start;\nvar points=isLargeRender&&new Float32Array(segCount*dimLen);\n\nfor(var i=params.start,offset=0,tmpIn=[],tmpOut=[];i'\\n + ''\\n + ''\\n + '
'\\n );\\n SDR.draw(getFirstElements(sdr, maxBitDisplay), sdrId, {\\n spartan: true,\\n size: bitSize,\\n stretch: bitStretch,\\n line: true,\\n slide: i == sdrStack.length - 1\\n });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1c4644a35ac8e0341d8c89ac463868c\",\n \"score\": \"0.4981742\",\n \"text\": \"animateBeforeDestroy() {\\n const point = this, animateParams = { x: point.startXPos, opacity: 0 }, graphicalProps = point.getGraphicalProps();\\n graphicalProps.singular.forEach(function (prop) {\\n const isDataLabel = prop === 'dataLabel';\\n point[prop] = point[prop].animate(isDataLabel ? {\\n x: point[prop].startXPos,\\n y: point[prop].startYPos,\\n opacity: 0\\n } : animateParams);\\n });\\n graphicalProps.plural.forEach(function (plural) {\\n point[plural].forEach(function (item) {\\n if (item.element) {\\n item.animate(extend({ x: point.startXPos }, (item.startYPos ? {\\n x: item.startXPos,\\n y: item.startYPos\\n } : {})));\\n }\\n });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ccdbbd4ef1777cd54c59b3bca48d46d\",\n \"score\": \"0.49335036\",\n \"text\": \"_shoveTarget (data, script) {\\n if (Array.isArray(data)) {\\n script.destroy()\\n } else if (data.indices) {\\n const { workspace, parent, component, index } = getComponentFromIndices(data.indices)\\n if (component instanceof Input) {\\n let undoEntry\\n const oldValue = component.getValue()\\n if (oldValue instanceof Block) {\\n // NOTE: Scratch puts it on the right of the script, vertically\\n // in the middle. (That is not done here)\\n const offset = inputRenderOptions.popOutOffset\\n const { x, y } = oldValue.getWorkspaceOffset()\\n undoEntry = {\\n type: 'transfer',\\n a: {\\n indices: getIndicesOf(oldValue)\\n },\\n b: {\\n workspace,\\n index: workspace.scripts.length,\\n x: x + offset,\\n y: y + offset\\n }\\n }\\n // This is a separate step, but it shall be grouped with this step.\\n this._executeEntry(undoEntry)\\n }\\n component.insertBlock(script.components[0])\\n component.resize()\\n // Destroy the rest of the blocks in case the reporter\\n // had blocks connected to it. This is not undoable because this\\n // is not intended to happen.\\n if (script.components.length) {\\n script.destroy()\\n }\\n return undoEntry && [undoEntry]\\n } else {\\n // Shift target script\\n const { dx = 0, dy = 0 } = data\\n const { x, y } = parent.position\\n parent.setPosition(x + dx, y + dy)\\n const firstBlock = script.components[0]\\n // Inserts all of the blocks in the carrier script into the target\\n // stack\\n let i = 0\\n while (script.components.length) {\\n const block = script.components[0]\\n script.remove(block)\\n parent.add(block, index + i)\\n i++\\n }\\n const prom = Promise.resolve().then(() => parent.resize())\\n if (data.branchAround) {\\n const branch = firstBlock.getParamComponent(data.branchAround)\\n // Insert all the blocks after the insert point that were already in the\\n // target stack in the branch block\\n while (parent.components[index + i]) {\\n branch.add(parent.components[index + i])\\n }\\n // Ensure that the parent's other children are measured first\\n prom.then(() => branch.resize())\\n }\\n }\\n } else if (data.workspace) {\\n script.setPosition(data.x, data.y)\\n data.workspace.add(script, data.index)\\n } else {\\n throw new Error('wucky: Given `data` no make sense!')\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98db522cea65b68d60923c0a47bc9e7b\",\n \"score\": \"0.49323058\",\n \"text\": \"_moveToSource() {\\n this._clearBoth();\\n this.sourceContainer.insertAdjacentHTML('beforeend', this.content);\\n if (this.settings.afterMove) {\\n this.settings.afterMove(this.currentPlacement);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc133fcba9b76131eddc7e91d5509042\",\n \"score\": \"0.49295315\",\n \"text\": \"function scaleItems() {\\n if (rescale) {\\n d3.select('g.tree-node').selectAll('tmp')\\n .data(items).enter()\\n .append('text')\\n .text(function (d) {\\n return d;\\n })\\n .style(style.text)\\n .attr('x', -1000)\\n .attr('y', -1000)\\n .attr('class', 'tmp');\\n var z = d3.selectAll('.tmp')[0]\\n .map(function (x) {\\n return x.getBBox();\\n });\\n width = d3.max(z.map(function (x) {\\n return x.width;\\n }));\\n margin = margin * width;\\n width = width + 2 * margin;\\n height = d3.max(z.map(function (x) {\\n return x.height + margin / 2;\\n }));\\n // cleanup\\n d3.selectAll('.tmp').remove();\\n rescale = false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc0dcbe779a19de93a229ceaa6cdc5f6\",\n \"score\": \"0.49122435\",\n \"text\": \"function clearStack() {\\n myEl.textContent = '';\\n stackItems = [];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f65ef512c9d3f77c9d1406f2081991f2\",\n \"score\": \"0.49031976\",\n \"text\": \"function scaleItems() {\\n if (rescale) {\\n d3.select('svg').selectAll('tmp')\\n .data(items).enter()\\n .append('text')\\n .text(function(d){ return d.title; })\\n .style(style.text)\\n .attr('x', -1000)\\n .attr('y', -1000)\\n .attr('class', 'tmp');\\n \\n var z = d3.selectAll('.tmp')[0]\\n .map(function(x){ return x.getBBox(); });\\n width = d3.max(z.map(function(x){ return x.width; }));\\n margin = margin * width;\\n width = (width + 2 * margin) < 100 ? 100 : (width + 2 * margin);\\n height = d3.max(z.map(function(x){ return x.height+ 15 + margin / 2; }));\\n // cleanup\\n d3.selectAll('.tmp').remove();\\n rescale = false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc22e66bad6c92991d60f3b1e6199145\",\n \"score\": \"0.48990276\",\n \"text\": \"getSource(withoutGrouping = false) {\\n const source = this.store.get('source');\\n const items = this.store.get('proxyItems');\\n let index = 0;\\n // order important here, expected parent is first, then others\\n return items.reduce((result, i) => {\\n const model = source[i];\\n if (!withoutGrouping) {\\n result.source.push(model);\\n return result;\\n }\\n // grouping filter\\n if (!isGrouping(model)) {\\n result.source.push(model);\\n result.oldNewIndexes[i] = index;\\n index++;\\n }\\n else {\\n if (model[GROUP_EXPANDED]) {\\n result.prevExpanded[model[PSEUDO_GROUP_ITEM_VALUE]] = true;\\n }\\n }\\n return result;\\n }, {\\n source: [],\\n prevExpanded: {},\\n oldNewIndexes: {},\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5a55f658669f7f4fddc992d56d96304\",\n \"score\": \"0.48895815\",\n \"text\": \"shiftUp() {\\n const source = this.memory.slice()\\n this.memory.forEach((value, offset) => {\\n this.drawPixel(offset, source[(offset + this.width) % this.size])\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57333c4e400d0e3c4ba5ddb5199fadcc\",\n \"score\": \"0.4858874\",\n \"text\": \"function preparePointData() {\\n chart.ctColumnTooltips.oldPoints = [];\\n for (var i = 0; i < chart.data.series.length; i++) {\\n chart.ctColumnTooltips.oldPoints[i] = [];\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"647d1d1c5ec3c29de5994f7f2720527a\",\n \"score\": \"0.48578352\",\n \"text\": \"function scaleItems() {\\n if (rescale) {\\n d3.select('svg').selectAll('tmp')\\n .data(items).enter()\\n .append('text')\\n .text(function(d){ return d; })\\n .style(style.text)\\n .attr('x', -1000)\\n .attr('y', -1000)\\n .attr('class', 'tmp');\\n var z = d3.selectAll('.tmp')[0]\\n .map(function(x){ return x.getBBox(); });\\n width = d3.max(z.map(function(x){ return x.width; }));\\n margin = margin * width;\\n width = width + 2 * margin;\\n height = d3.max(z.map(function(x){ return x.height + margin / 2; }));\\n \\n // cleanup\\n d3.selectAll('.tmp').remove();\\n rescale = false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4322a9be1a03c13c6d92d73b1be2c034\",\n \"score\": \"0.4849353\",\n \"text\": \"function pusht() {\\n\\n stack.push(transform);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75731bf7fabc1ad5464f847decc12fc0\",\n \"score\": \"0.48436496\",\n \"text\": \"resetPipes() {\\n this.sprites['pipes'].splice(0, this.sprites['pipes'].length);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ff57742ac94a27c0407e7d2a08ee02c\",\n \"score\": \"0.48432025\",\n \"text\": \"_reset(){\\n this._startPosition();\\n for(let i=this.body.length-1;i>0;i--)\\n if(i>=this.startLength){\\n this.body[i].parentNode.removeChild(this.body[i]);\\n this.body.pop();\\n }\\n else{\\n this.body[i].style.top=\\\"0px\\\";\\n this.body[i].style.left=`${this.head.offsetLeft-i*15}px`;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5a9d01ee8d8f5fda7f628bb1eab2382\",\n \"score\": \"0.48397687\",\n \"text\": \"function createSet() {\\n const newSet = curSet + 1;\\n for (const key of Object.keys(performerData)) {\\n if (key == \\\"title\\\") continue;\\n performerData[key].sets.splice(newSet, 0, Object.assign(performerData[key].sets[curSet]));\\n // performerData[key].sets[newSet] = Object.assign(performerData[key].sets[curSet]);\\n }\\n numSets++;\\n curSet++;\\n refreshSetDisplay();\\n // nextSet();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c471d770c0fe8a956244c4a7d6f5c764\",\n \"score\": \"0.48358056\",\n \"text\": \"renderStackTotals() {\\n const yAxis = this.axis, waterfallStacks = yAxis.waterfall.stacks, stackTotalGroup = (yAxis.stacking && yAxis.stacking.stackTotalGroup), dummyStackItem = new StackItem(yAxis, yAxis.options.stackLabels || {}, false, 0, void 0);\\n this.dummyStackItem = dummyStackItem;\\n // Render each waterfall stack total\\n if (stackTotalGroup) {\\n objectEach(waterfallStacks, function (type) {\\n objectEach(type, function (stackItem, key) {\\n dummyStackItem.total = stackItem.stackTotal;\\n dummyStackItem.x = +key;\\n if (stackItem.label) {\\n dummyStackItem.label = stackItem.label;\\n }\\n StackItem.prototype.render.call(dummyStackItem, stackTotalGroup);\\n stackItem.label = dummyStackItem.label;\\n delete dummyStackItem.label;\\n });\\n });\\n }\\n dummyStackItem.total = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6cc93b92af03779ccee0ba5ccd80c288\",\n \"score\": \"0.4829087\",\n \"text\": \"function cleanUp() {\\n console.log('cleanUp');\\n // let dj = null;\\n // console.log('cleaning up');\\n // console.log(arr);\\n for (let i = 0; i < djs.length; i++) {\\n let offset = 0;\\n for (let j = 0; j < djs[i].songs.length; j++) {\\n if (removeHelp[djs[i].id][0] - offset === j) {\\n // console.log('removingremovingremovingremovingremoving');\\n // console.log(removeHelp);\\n // console.log(djs[i].songs[j].title);\\n djs[i].songs.splice(j, 1);\\n removeHelp[djs[i].id].shift();\\n offset++;\\n j--;\\n }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e25e885d87cf2202fca2f84689c5e3b3\",\n \"score\": \"0.48236158\",\n \"text\": \"function cleanSource(nodes) {\\n return nodes.map((i) => {\\n if (i.nodes) i.nodes = cleanSource(i.nodes);\\n delete i.source;\\n return i;\\n });\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7041b543c21d68065fa447fffd407333\",\n \"score\": \"0.4822611\",\n \"text\": \"normalize(inplace=true)\\r\\n\\t{\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5253422d1847f9af6e5364120d75c314\",\n \"score\": \"0.4803161\",\n \"text\": \"function resetAllItems()\\n{\\n\\t var nodes = diagram.getNodes();\\n\\t\\t \\n\\t\\t for(var i = 0; i < nodes.length; i++)\\n\\t\\t\\t nodes[i].getComponent(\\\"Background\\\").brush = \\\"white\\\";\\n\\t\\t \\n\\t\\t var links = diagram.getLinks();\\n\\t\\t \\n\\t\\t for(var i = 0; i < links.length; i++)\\n\\t\\t {\\n\\t\\t\\t links[i].setStroke(\\\"#CECECE\\\");\\n\\t\\t\\t links[i].setZIndex(0);\\n\\t\\t }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3604583934887bd7340bb6691819fb2c\",\n \"score\": \"0.47998053\",\n \"text\": \"Rebuild()\\n {\\n this.Unload(true);\\n this.RebuildItems();\\n this._dirty = false;\\n const itemCount = this._visibleItems.length;\\n if (!itemCount)\\n {\\n super.Rebuild();\\n return;\\n }\\n\\n const\\n vertexSize = 35,\\n mat4_0 = EvePlaneSet.global.mat4_0;\\n\\n const array = new Float32Array(itemCount * 4 * vertexSize);\\n for (let i = 0; i < itemCount; ++i)\\n {\\n const\\n item = this._visibleItems[i],\\n offset = i * 4 * vertexSize;\\n\\n array[offset + vertexSize - 3] = 0;\\n array[offset + vertexSize + vertexSize - 3] = 1;\\n array[offset + 2 * vertexSize + vertexSize - 3] = 2;\\n array[offset + 3 * vertexSize + vertexSize - 3] = 3;\\n\\n const itemTransform = mat4.fromRotationTranslationScale(item.transform, item.rotation, item.position, item.scaling);\\n\\n for (let j = 0; j < 4; ++j)\\n {\\n const vtxOffset = offset + j * vertexSize;\\n array[vtxOffset] = itemTransform[0];\\n array[vtxOffset + 1] = itemTransform[4];\\n array[vtxOffset + 2] = itemTransform[8];\\n array[vtxOffset + 3] = itemTransform[12];\\n array[vtxOffset + 4] = itemTransform[1];\\n array[vtxOffset + 5] = itemTransform[5];\\n array[vtxOffset + 6] = itemTransform[9];\\n array[vtxOffset + 7] = itemTransform[13];\\n array[vtxOffset + 8] = itemTransform[2];\\n array[vtxOffset + 9] = itemTransform[6];\\n array[vtxOffset + 10] = itemTransform[10];\\n array[vtxOffset + 11] = itemTransform[14];\\n\\n array[vtxOffset + 12] = item.color[0];\\n array[vtxOffset + 13] = item.color[1];\\n array[vtxOffset + 14] = item.color[2];\\n array[vtxOffset + 15] = item.color[3];\\n\\n array[vtxOffset + 16] = item.layer1Transform[0];\\n array[vtxOffset + 17] = item.layer1Transform[1];\\n array[vtxOffset + 18] = item.layer1Transform[2];\\n array[vtxOffset + 19] = item.layer1Transform[3];\\n\\n array[vtxOffset + 20] = item.layer2Transform[0];\\n array[vtxOffset + 21] = item.layer2Transform[1];\\n array[vtxOffset + 22] = item.layer2Transform[2];\\n array[vtxOffset + 23] = item.layer2Transform[3];\\n\\n array[vtxOffset + 24] = item.layer1Scroll[0];\\n array[vtxOffset + 25] = item.layer1Scroll[1];\\n array[vtxOffset + 26] = item.layer1Scroll[2];\\n array[vtxOffset + 27] = item.layer1Scroll[3];\\n\\n array[vtxOffset + 28] = item.layer2Scroll[0];\\n array[vtxOffset + 29] = item.layer2Scroll[1];\\n array[vtxOffset + 30] = item.layer2Scroll[2];\\n array[vtxOffset + 31] = item.layer2Scroll[3];\\n\\n array[vtxOffset + 33] = item.boneIndex;\\n array[vtxOffset + 34] = item.maskAtlasID;\\n }\\n }\\n\\n this._vertexBuffer = device.gl.createBuffer();\\n device.gl.bindBuffer(device.gl.ARRAY_BUFFER, this._vertexBuffer);\\n device.gl.bufferData(device.gl.ARRAY_BUFFER, array, device.gl.STATIC_DRAW);\\n device.gl.bindBuffer(device.gl.ARRAY_BUFFER, null);\\n\\n const indexes = new Uint16Array(itemCount * 6);\\n for (let i = 0; i < itemCount; ++i)\\n {\\n const\\n offset = i * 6,\\n vtxOffset = i * 4;\\n\\n indexes[offset] = vtxOffset;\\n indexes[offset + 1] = vtxOffset + 2;\\n indexes[offset + 2] = vtxOffset + 1;\\n indexes[offset + 3] = vtxOffset;\\n indexes[offset + 4] = vtxOffset + 3;\\n indexes[offset + 5] = vtxOffset + 2;\\n }\\n\\n this._indexBuffer = device.gl.createBuffer();\\n device.gl.bindBuffer(device.gl.ELEMENT_ARRAY_BUFFER, this._indexBuffer);\\n device.gl.bufferData(device.gl.ELEMENT_ARRAY_BUFFER, indexes, device.gl.STATIC_DRAW);\\n device.gl.bindBuffer(device.gl.ELEMENT_ARRAY_BUFFER, null);\\n this._indexBuffer.count = itemCount * 6;\\n\\n super.Rebuild();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b34122f8f8a4372816c2063f7dccf0c\",\n \"score\": \"0.4797689\",\n \"text\": \"_removeColumnData(currentIteration) {\\n\\t\\tconst sources = this.config.data.sources;\\n\\t\\tconst self = this;\\n\\t\\tconst vertices = this.model.registry.vertices;\\n\\t\\tconst sourceName = sources[0];\\n\\t\\tconst vertex = vertices[sourceName];\\n\\n\\t\\tif (currentIteration !== 0) {\\n\\t\\t\\tconst ids = vertex.time_shift_store.iter[currentIteration].r;\\n\\t\\t\\tif (ids) {\\n\\t\\t\\t\\tids.forEach((id) => {\\n\\t\\t\\t\\t\\tdelete(self.store[id]);\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58527ae74ba4880d718886c55460fc38\",\n \"score\": \"0.47954547\",\n \"text\": \"function scaleItems() {\\n if (rescale) {\\n d3.select('svg').selectAll('tmp')\\n .data(items).enter()\\n .append('text')\\n .text(function(d){ return d; })\\n .style('fill',styles.text.fill)\\n .style('font-size', styles.text[\\\"font-size\\\"])\\n .attr('x', -1000)\\n .attr('y', -1000)\\n .attr('class', 'tmp');\\n var z = d3.selectAll('.tmp')[0]\\n .map(function(x){ return x.getBBox(); });\\n width = d3.max(z.map(function(x){ return x.width; }));\\n margin = margin * width;\\n width = width + 2 * margin;\\n height = d3.max(z.map(function(x){ return x.height + margin / 2; }));\\n \\n // cleanup\\n d3.selectAll('.tmp').remove();\\n rescale = false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af40e33fbb26855409a4f059b1574f16\",\n \"score\": \"0.47824904\",\n \"text\": \"shiftDown() {\\n const source = this.memory.slice()\\n this.memory.forEach((value, offset) => {\\n offset += this.width\\n this.drawPixel(offset % this.size, source[offset - this.width])\\n })\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d768844840e844c1d28819e321095fbe\",\n \"score\": \"0.47810292\",\n \"text\": \"function resetIndexAndContainer() {\\n var adjust = (edgePadding) ? 1 : 0,\\n leftEdge = slideBy - cloneCount + adjust,\\n rightEdge = slideCount + cloneCount - items - slideBy - 1; // -1: index starts form 0\\n\\n if (index < leftEdge || index > rightEdge) {\\n (index - slideCount >= leftEdge && index - slideCount <= rightEdge) ? index -= slideCount : index += slideCount;\\n\\n if (TRANSITIONDURATION) { sliderContainer.style[TRANSITIONDURATION] = '0s'; }\\n translate();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d472178c3b5d07d6d0b7f5482a7d8fd4\",\n \"score\": \"0.4780704\",\n \"text\": \"_cacheItems() {\\n this._activeDraggables = this._draggables.slice();\\n this._cacheItemPositions();\\n this._cacheParentPositions();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca08ffc28b59f9df338ce073e2c272b1\",\n \"score\": \"0.47806984\",\n \"text\": \"function _default(seriesType){\\nreturn {\\nseriesType:seriesType,\\nplan:createRenderPlanner(),\\nreset:function reset(seriesModel){\\nvar data=seriesModel.getData();\\nvar coordSys=seriesModel.coordinateSystem;\\nvar pipelineContext=seriesModel.pipelineContext;\\nvar isLargeRender=pipelineContext.large;\\n\\nif(!coordSys){\\nreturn;\\n}\\n\\nvar dims=map(coordSys.dimensions,function(dim){\\nreturn data.mapDimension(dim);\\n}).slice(0,2);\\nvar dimLen=dims.length;\\nvar stackResultDim=data.getCalculationInfo('stackResultDimension');\\n\\nif(isDimensionStacked(data,dims[0]\\n/*, dims[1]*/))\\n{\\ndims[0]=stackResultDim;\\n}\\n\\nif(isDimensionStacked(data,dims[1]\\n/*, dims[0]*/))\\n{\\ndims[1]=stackResultDim;\\n}\\n\\nfunction progress(params,data){\\nvar segCount=params.end-params.start;\\nvar points=isLargeRender&&new Float32Array(segCount*dimLen);\\n\\nfor(var i=params.start,offset=0,tmpIn=[],tmpOut=[];i',{id: 'question'});\n \n var numCorrect = 0;\n var incorrect = 0;\n\n total.append('Incorrect: Question ');\n for (var i = 0; i < selections.length; i++) {\n if (selections[i] === questions[i].correctAnswer) {\n numCorrect++;\n incorrect++;\n }\n else {\n incorrect++;\n total.append(incorrect + ' ');\n }\n }\n \n total.append('
You got ' + numCorrect + ' questions out of ' +\n questions.length + ' correct!');\n return total;\n }","title":""},{"docid":"4f35ac77807e3d599cdcea8c9aa9afb3","score":"0.787712","text":"function displayTotal() {\n var total = $('
',{id: 'question'});\n \n var numCorrect = 0;\n var incorrect = 0;\n\n total.append('Incorrect: Question ');\n for (var i = 0; i < selections.length; i++) {\n if (selections[i] === questions[i].correctAnswer) {\n numCorrect++;\n incorrect++;\n }\n else {\n incorrect++;\n total.append(incorrect + ' ');\n }\n }\n \n total.append('
You got ' + numCorrect + ' questions out of ' +\n questions.length + ' correct!');\n return total;\n }","title":""},{"docid":"29b81d859a8f30363763d9040a6e453e","score":"0.7114713","text":"function tallyAnswers() {\n \n for (var i = 0; i < triviaVault.length; i++) {\n\n\n correctAnswer = triviaVault[i].correct;\n\n if (userAnswer === correctAnswer) {\n correct++;\n } else if (userAnswer !== correctAnswer) {\n incorrect++;\n } else {\n unanswered++;\n }\n }\n\n // Shows the Final Message with Score\n //\n $(\"#endMessage\").show()\n $(\"#correct\").text(\"Correct: \" + correct)\n $(\"#incorrect\").text(\"Incorrect: \" + incorrect)\n $(\"#unanswered\").text(\"unanswered: \" + correct)\n}","title":""},{"docid":"020c522a4b09dde770a3938ef3f4ba25","score":"0.689229","text":"function incorrect() {\n alert('Sorry! incorrect answer, the correct ans is ' + eachQuestion.answer);\n }","title":""},{"docid":"6e15da6f793e6de145bbde18c1495f63","score":"0.6883424","text":"function incorrectAnswer() {\n incorrectAnswers++;\n $('.timeRemaining').text(\"Are you drunk? You're gonna have to do better than that!\")\n resetRound();\n \n }","title":""},{"docid":"a45609a81a62d4ea6e44c1bac4a0a1d0","score":"0.6860314","text":"function displayScore() {\r\n var score = $('
', {\r\n id: 'question'\r\n });\r\n var numCorrect = 0;\r\n for (var i = 0; i < selections.length; i++) {\r\n if (selections[i] === questions[i].correctAnswer) {\r\n numCorrect++;\r\n }\r\n }\r\n score.append('You got ' + numCorrect + ' out of ' +\r\n questions.length + '.');\r\n return score;\r\n }","title":""},{"docid":"d57f2cd359dc3ab52fb32f44ec9d4366","score":"0.683382","text":"function incorrectAnswer() {\n // function is called when question timer has tripped...therefore bump up total incorrect answers\n totalIncorrect++;\n\n // clear all answers\n // make sure previous answers are removed\n $(\"#userChoices\").text(\"\");\n\n // message the player that their answer is incorrect. \n $(\"#userMessage\").text(\"The correct answer is \" + triviaObj.questions[questionIndex].correctAnswer + \". You have answered \" + totalCorrect + \" questions correctly, and \" + totalIncorrect + \" incorrectly!\" );\n\n // start the transition timer. Used to make sure the player has adequate time to view incorrect error message\n startQuestionTransition();\n }","title":""},{"docid":"665fc8354552ca5bda37ca1ae7756b90","score":"0.68032557","text":"function wrongAnswer() {\n \n setUpResp();\n emptyQuestionDiv();\n $('#score').text('Wrong!');\n incorrect++;\n responseInterval();\n\n }","title":""},{"docid":"6093f0537f7175033d8a8a4e288d8095","score":"0.679975","text":"function displayScore() {\n var score = $('
',{id: 'question'});\n\n var numCorrect = 0;\n for (var i = 0; i < selections.length; i++) {\n if (selections[i] === questions[i].correctAnswer) {\n numCorrect++;\n }\n }\n\n score.append('You got ' + numCorrect + ' questions out of ' +\n questions.length + ' right!!!');\n return score;\n }","title":""},{"docid":"a99b3b27e7d9ede2a1138976fe0ef805","score":"0.67403483","text":"function checkAnswers() {\n var correctAnswer;\n var userAnswer;\n var numCorrect = 0;\n var numIncorrect = 0;\n var numUnanswered = 0;\n\n for (var i = 0; i < questionVault.length; i++) {\n correctAnswer = questionVault[i].correct;\n userAnswer = $('input[id=radio' + i + ']:checked + label').text();\n if (userAnswer === correctAnswer) {\n numCorrect++;\n } else if (userAnswer === \"\") {\n numUnanswered++;\n } else if (userAnswer !== correctAnswer) {\n {\n numIncorrect++;\n }\n }\n }\n $(\"#end-page\").show();\n $(\"#questions-box\").empty();\n $(\"#timer\").empty();\n $(\"#timer\").hide();\n $(\"#correct-answers\").text(\"Correct: \" + numCorrect);\n $(\"#incorrect-answers\").text(\"Incorrect: \" + numIncorrect);\n $(\"#unanswered\").text(\"Not Answered: \" + numUnanswered);\n}","title":""},{"docid":"c2482aab8b9f9d13951a02df3734e57e","score":"0.6736493","text":"function displayScore() {\n var score = $('
',{id: 'question'});\n var numCorrect = 0;\n for (var i = 0; i < selections.length; i++) {\n if (selections[i] === questions[i].correctAnswer) {\n numCorrect++;\n }\n }\n\n score.append('Вы ответили на ' + numCorrect + ' вопроса из ' +\n questions.length + ' правильно!!!');\n return score;\n }","title":""},{"docid":"da9a665cc7c0001f4d7602a524447d82","score":"0.67264396","text":"function displayScore() {\n var score = $(\"
\", { id: \"question\" });\n\n var numCorrect = 0;\n for (var i = 0; i < selections.length; i++) {\n if (selections[i] === questions[i].correctAnswer) {\n numCorrect++;\n }\n }\n\n score.append(\n \"Vous avez \" +\n numCorrect +\n \" bonnes réponses sur \" +\n questions.length +\n \" !\"\n );\n return score;\n }","title":""},{"docid":"e5940250b3ab6177653cc5b5d4d86cd7","score":"0.67108023","text":"function displayScore() {\n\t var score = $('
',{id: 'question'});\n\t \n\t var numCorrect = 0;\n\t for (var i = 0; i < selections.length; i++) {\n\t if (selections[i] === questions[i].correct) {\n\t numCorrect++;\n\t }\n\t }\n\t \n\t score.append('You got ' + numCorrect + ' questions out of ' +\n\t questions.length + ' right!!!');\n\t return score;\n\t }","title":""},{"docid":"249f7a4224d03906d6b7a0b689cd8cbe","score":"0.6697708","text":"function countCorrectAnswers() {\n\n var questions = [\"yearSunk\", \"captain\", \"yearFound\", \"whoFound\", \"howSunk\", \"howDeep\", \"soulsLost\", \"funnel\"];\n\n for (var i = 0; i < questions.length; i++) {\n\n //checks if result of checkAnswer() is a negative number and increments incorrectAnswer\n\n if (checkAnswer(questions[i]) < 0) {\n\n incorrectAnswer++\n\n //checks if result of checkAnswer() is a positive number and increments correctAnswer\n\n } else if (checkAnswer(questions[i]) > 0) {\n\n correctAnswer++\n\n //otherwise increments notAnswered\n\n } else {\n\n notAnswered++\n\n }\n }\n\n }","title":""},{"docid":"14765b2778a8015829072b1d3ea79963","score":"0.66921204","text":"function incorrectAnswer() {\n clearInterval(timerSet);\n k.html(\" \");\n j.html(\" \")\n incorrect++;\n i.html(\"# Answered Incorrectly: \" + incorrect);\n questions.splice(f, 1);\n if (questions.length === 0) {\n stop();\n } else {\n z.html(\" \");\n randomizer();\n\n }\n }","title":""},{"docid":"9391f348ba17e35b3b93bdc15c811e73","score":"0.66845703","text":"function validateForm() {\n\n var q1 = document.forms[\"quizForm\"][\"qFl\"].value;\n var q2 = document.forms[\"quizForm\"][\"qCal\"].value;\n var q3 = document.forms[\"quizForm\"][\"qIl\"].value;\n var q4 = document.forms[\"quizForm\"][\"qTx\"].value;\n var q5 = document.forms[\"quizForm\"][\"qNy\"].value;\n var q6 = document.forms[\"quizForm\"][\"qCol\"].value;\n var q7 = document.forms[\"quizForm\"][\"qNv\"].value;\n var q8 = document.forms[\"quizForm\"][\"qMt\"].value;\n var q9 = document.forms[\"quizForm\"][\"qHw\"].value;\n var q10 = document.forms[\"quizForm\"][\"qAl\"].value;\n //if statements to add to your score can be done in for loop later\n if (q1 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n if (q2 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n if (q3 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n\n if (q4 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n\n if (q5 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n\n if (q6 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n\n if (q7 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n\n if (q8 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n\n if (q9 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n\n if (q10 === grading[0]) {\n correctAnswers++;\n console.log(correctAnswers)\n }\n\n\n\nvar resultString = \"Great Job you got \" + correctAnswers+ \" right out of 10.\";\n$(\".testBody\").hide();\n$(\"#count\").hide();\n$(\"#results\").text(resultString);\n$(\"#startClock\").hide();\n\n\n\n\n\n\n }","title":""},{"docid":"da3a364b9bf7d6e914108afc59eb14f2","score":"0.6664632","text":"function incorrectAnswer() {\n \n // hide the questionAsked Board and display the answer board\n $(\"#questionAsked\").hide();\n $(\"#answer\").show();\n \n //Add 1 to answeredIncorrectly\n gameVariables.answeredIncorrectly++;\n $(\"#answer\").html(\"
Incorrect!
Correct answer was: \" + questionsArray[gameVariables.currentQuestion].answers[questionsArray[gameVariables.currentQuestion].correctAnswer]);\n \n //Wait 3 seconds then display next question\n gameVariables.currentQuestion++;\n setTimeout (function() {\n displayQuestion();\n }, 3000);\n }","title":""},{"docid":"6c801b731659760c20f4f5f850c139fd","score":"0.6663081","text":"function numberOfQuestions() {\n return questions.length;\n }","title":""},{"docid":"9f9c120f1632adabff1c948aa8ac34ea","score":"0.66620785","text":"function loadRemainingQuestion() {\n const remainingQuestion = testQuestion.length - (currentQuestion + 1);\n const totalQuestion = testQuestion.length;\n return `Remaining Question: ${remainingQuestion} / ${totalQuestion}`;\n}","title":""},{"docid":"ab70ee8ff33a26c38f659a40689c150c","score":"0.6648834","text":"function displayScore() {\r\n var score = $('
',{id: 'question'});\r\n \r\n var numCorrect = 0;\r\n for (var i = 0; i < selections.length; i++) {\r\n if (selections[i] === questions[i].correctAnswer) {\r\n numCorrect++;\r\n }\r\n }\r\n \r\n score.append('You got ' + numCorrect + ' questions out of ' +\r\n questions.length + ' right!!!');\r\n return score;\r\n }","title":""},{"docid":"490514040d8990a39004a6f06c5b4dda","score":"0.6634831","text":"function showResults() {\n $(\"#game-results\").show();\n $(\"#message-to-user\").html(\"
All Done!
\");\n $(\"#correct-ans\").html(\"Correct Answers: \" + score);\n //below is how the unanswered questions category is calculated, using the length of the arrays\n $(\"#un-ans\").html(\"Unanswered Questions: \" + (val = (correctAnswers.length - userAnswers.length)));\n $(\"#incorrect-ans\").html(\"Incorrect Answers: \" + incorrectAnswers);\n }","title":""},{"docid":"b113837c5b81e27ef0204e51a629b396","score":"0.6630906","text":"function displayScore() {\n var score = $('',{id: 'question'});\n \n var numCorrect = 0;\n for (var i = 0; i < selections.length; i++) {\n if (selections[i] === questions[i].correctAnswer) {\n numCorrect++;\n }\n }\n \n score.append('
You got ' + numCorrect + ' questions out of ' +\n questions.length + ' right!!!'+\"
\");\n return score;\n }","title":""},{"docid":"2e0eba45577ce87a886b606dcc3fdc53","score":"0.6626186","text":"function checkAnswers(){\n\tif(questionOneAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionOneAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\tif(questionTwoAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionTwoAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\tif(questionThreeAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionThreeAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\tif(questionFourAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionFourAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\tif(questionFiveAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionFiveAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\tif(questionSixAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionSixAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\tif(questionSevenAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionSevenAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\tif(questionEightAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionEightAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\tif(questionNineAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionNineAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\tif(questionTenAns === \"correct\"){\n\t\tcorrect++;\n\t} else if (questionTenAns === \"incorrect\"){\n\t\tincorrect++;\n\t}\n\n\t//Game over screen to show results and hide quiz\n\tanswersIn = true;\n\t$(\"#my-quiz\").hide();\n\t$(\"#time-display\").hide();\n\t$(\"#submit\").hide();\n\t$(\"#game-over\").show();\n\t$(\"#game-over\").append(\"
You got \" + correct + \" right
\");\n\t$(\"#game-over\").append(\"You got \" + incorrect + \" wrong
\");\n\t$(\"#game-over\").append(\"You did not answer \" + (totalQuestions - (correct + incorrect)) + \" questions
\" )\n}","title":""},{"docid":"9c9152ccfa631166106c1089fcde1b6a","score":"0.6622836","text":"function displayIncorrectAnswer(){\n //hide the view answer button\n hide('.view_answer_button');\n //add text that they answered incorrectly\n $('.show_correct_response').append(`No. I'm afraid it wasn't ${answer}
`);\n //display div to show response\n show('.show_correct_response');\n}","title":""},{"docid":"b553427e0bf53e10f86cab1fbcc2d80a","score":"0.6600634","text":"function generateInCorrectView() {\n const correctAnswer = STORE.questions[STORE.questionNumber].answers[STORE.questions[STORE.questionNumber].correctAnswer];\n\n return `\nIncorrect!
\nYou got ${STORE.score} of ${STORE.questions.length}
\n\n The correct answer is: ${correctAnswer}
\n \n `;\n}","title":""},{"docid":"0188bbc205d6fbac2ce1bccd82ff095e","score":"0.6594036","text":"function generateIncorrectSummary(incorrectQuestions) {\r\n var output = \"The following questions were incorrect:
- \";\r\n // list the numbers of the incorrect questions\r\n for (var y = 0; y < incorrectQuestions.length; y++) {\r\n output += \"
- \" + incorrectQuestions[y].question.number + \" \";\r\n\r\n }\r\n output += \"
',{id: 'question'});\n \n var numCorrect = 0;\n for (var i = 0; i < selections.length; i++) {\n if (selections[i] === questions1[i].correctAnswer) {\n numCorrect++;\n }\n }\n \n score.append('
You got ' + numCorrect + ' questions out of ' +\n questions1.length + ' right!!!'+\"
\");\n return score;\n }","title":""},{"docid":"314e9ab37d0bede4e4961216782b82ba","score":"0.65362227","text":"function loadRemainingQuestions(){\n \n var remainingQuestion = quizQuestions.length - (currentQuestion + 1);\n var totalQuestion = quizQuestions.length;\n\n return `Remaining Question: ${remainingQuestion}/${totalQuestion}`;\n}","title":""},{"docid":"38d1e92bd04b99379f1a4a808fe3d64a","score":"0.65344155","text":"function displayNextQuestion() {\n\n if (totalCorrect + totalIncorrect === 1) {\n document.getElementById(\"question1\").style.display = \"none\";\n document.getElementById(\"question2\").style.display = \"block\";\n } else if (totalCorrect + totalIncorrect === 4) {\n document.getElementById(\"question2\").style.display = \"none\";\n document.getElementById(\"question3\").style.display = \"block\";\n } else if (totalCorrect + totalIncorrect === 5) {\n document.getElementById(\"question3\").style.display = \"none\";\n document.getElementById(\"question4\").style.display = \"block\";\n } else if (totalCorrect + totalIncorrect === 9) {\n document.getElementById(\"question4\").style.display = \"none\";\n document.getElementById(\"question5\").style.display = \"block\";\n } else if (totalCorrect + totalIncorrect === 12) {\n document.getElementById(\"question5\").style.display = \"none\";\n document.getElementById(\"question6\").style.display = \"block\";\n } else if (totalCorrect + totalIncorrect === 16) {\n document.getElementById(\"question6\").style.display = \"none\";\n document.getElementById(\"question7\").style.display = \"block\";\n } else if (totalCorrect + totalIncorrect === 17) {\n document.getElementById(\"question7\").style.display = \"none\";\n document.getElementById(\"question8\").style.display = \"block\"\n } else if (totalCorrect + totalIncorrect === 18) {\n document.getElementById(\"question8\").style.display = \"none\";\n document.getElementById(\"question9\").style.display = \"block\"\n } else if (totalCorrect + totalIncorrect === 19) {\n document.getElementById(\"question9\").style.display = \"none\";\n document.getElementById(\"question10\").style.display = \"block\"\n } else if (totalCorrect + totalIncorrect === 20) {\n document.getElementById(\"question10\").style.display = \"none\";\n document.getElementById(\"finishScreen\").style.display = \"block\"\n //submitResults();\n \n }\n else{\n console.log(\"Not time for next Question\");\n }\n\n }","title":""},{"docid":"2c7f34a57fb4a28c79d88d37572d5aa3","score":"0.64864737","text":"function showResult() {\n const totalCount = counterRight + counterWrong;\n\n result.textContent = (totalCount === questionNumber) \n ? `Wynik: ${counterRight} z ${questionNumber}.`\n : `Proszę odpowiedzieć na wszystkie pytania.`;\n }","title":""},{"docid":"073a95b39b07bba96b2e867bdfc52cde","score":"0.6481364","text":"function displayQuestions()\r\n{\r\n // Do question html (use randomOrderGenerator for MCQ options)\r\n let output = \"\";\r\n let textResponseCount = -1;\r\n\r\n output += `
${assignment.name}
`;\r\n let questionArr = assignment.questions;\r\n\r\n for (let i = 1; i < questionArr.length + 1; i++)\r\n {\r\n let q = questionArr[i - 1];\r\n let response = attempt.responses[i - 1]\r\n output += `Question ${i} (${mark}/${q.marks} marks)
\r\n${q.text}
`;\r\n\r\n // Find valid number of options non-\"\"\r\n let count = 0;\r\n for (let t = 0; t < q.options.length; t++)\r\n {\r\n if (q.options[t] != \"\")\r\n {\r\n count += 1;\r\n }\r\n }\r\n\r\n let order = randomOrderGenerator(count);\r\n for (let j = 0; j < order.length; j++)\r\n {\r\n let idx = order[j]\r\n let option = q.options[idx]\r\n let checked = \"\";\r\n if (option == response)\r\n {\r\n checked = \"checked\";\r\n }\r\n output += `\r\n`\r\n }\r\n }\r\n else if (q.type == \"Text Response\")\r\n {\r\n textResponseCount += 1;\r\n output += `
Question ${i} (${attempt.textResponseFeedback[textResponseCount][0]}/${q.marks} marks)
\r\n${q.text}
\r\n \r\n`;\r\n }\r\n \r\n output += `
`;\r\n\r\n // Feedback\r\n if (q.type == \"Multiple Choice\")\r\n {\r\n if (response == q.options[0])\r\n {\r\n output += `
\r\n
`;\r\n }\r\n else\r\n {\r\n output += `Correct!
\r\n${q.posFeedback}
\r\n\r\n
`;\r\n }\r\n }\r\n else if (q.type == \"Text Response\")\r\n {\r\n if (Number(attempt.textResponseFeedback[textResponseCount][0]) > 0)\r\n {\r\n output += `Incorrect.
\r\n${q.negFeedback}
\r\nThe answer was ${q.options[0]}.
\r\n\r\n
`;\r\n }\r\n else\r\n {\r\n output += `Correct.
\r\n${attempt.textResponseFeedback[textResponseCount][1]}
\r\n\r\n
`;\r\n }\r\n }\r\n }\r\n document.getElementById(\"questionContent\").innerHTML = output;\r\n}","title":""},{"docid":"2293bed7772125698af3cae283d31c4c","score":"0.6479559","text":"function displayScore() {\n var score = $('Incorrect.
\r\n${attempt.textResponseFeedback[textResponseCount][1]}
\r\n',{id: 'question'});\n \n var numCorrect = 0;\n for (var i = 0; i < selections.length; i++) {\n if (selections[i] === questions[i].correctAnswer) {\n numCorrect++;\n }\n }\n saveScore(numCorrect,selections,questions.length);\n return score;\n }","title":""},{"docid":"1f1548fe6b030c42effa244d651df37e","score":"0.64671826","text":"function wrongResponse() {\r\n if (questionNum === (lastQuestion - 1)) {\r\n quizArea.html(\r\n `
Woops! The right Answer is: \r\n
`);\r\n }\r\n else if (questionNum === lastQuestion) {\r\n quizArea.html(\r\n `${quizQuestions[questionNum].correctAns}!
\r\n Let's see how we do on the last one:\r\n \r\nWoops! The right Answer is: \r\n
`);\r\n }\r\n else {\r\n quizArea.html(\r\n `${quizQuestions[questionNum].correctAns}!
\r\n \r\nWoops! The right Answer is: \r\n
`\r\n );\r\n}\r\n}","title":""},{"docid":"3583db009dca4b574fc85ebe2c7a74c7","score":"0.64459354","text":"function displayResults() {\r\n $('#correct').html(numCorrAnsw);\r\n $('#incorrect').html(numIncorrAnsw);\r\n $('#unanswered').html(correctAnswers.length - numCorrAnsw - numIncorrAnsw);\r\n}","title":""},{"docid":"4d86b407ca81344e203875f103a6f491","score":"0.64445394","text":"function updateWrong(){\n\n\t\t$(\"#title\").hide();\n\t\t$(\".question\").hide();\n\t\t$(\".timer\").hide();\n\t\t$(\".wrongScreen\").show();\n\t\t$(\".correctAnswer\").text(Questions.answer[Questions.count]);\n\n\t\tsetTimeout(function(){displayQuestionScreen()}, 2000);\n\n\t\tQuestions.wrong += 1;\n\n\t}","title":""},{"docid":"264fe0e13622bd549de0d7ad4d132bd3","score":"0.6440734","text":"function submitAnswers() {\n boolChecked = false;;\n var qArray;\n var wrongTally = 0;\n for (a = 0; a < 4; a++) {\n qArray = document.getElementsByName(\"q\" + a)\n boolChecked = false;\n for (b = 0; b < 4; b++) {\n if (qArray[b].checked) {\n if (qArray[b].value != mathItems[a]) {\n wrongTally++;\n }\n boolChecked = true;\n }\n }\n if (boolChecked == false) {\n alert(\"All questions must be clicked before submitting.\");\n boolChecked = false;\n a = 4;\n }\n }\n if (boolChecked == true) {\n document.getElementById(\"quizResults\").innerHTML = \"You got \" + (4 - wrongTally) + \" out of 4 correct.\";\n }\n}","title":""},{"docid":"3498b0080877ff3c8cbfca9165bd1037","score":"0.6431382","text":"function wrong() {\n $(\"#question-message\").html(\"Nope...Correct answer is\");\n showAnswer();\n scoreIncorrect++;\n i++;\n}","title":""},{"docid":"8bd76b8663bb126b82c294b9c9435d10","score":"0.6421018","text":"function checkAnswer() {\n // check the inputs values against the store\n const userSelectedAnswer = $(\"form input[type='radio']:checked\").val();\n // turned user input value into an integer.\n const userAnswerInt = parseInt(userSelectedAnswer);\n // if correct call correct view \n // otherwise call incorrect view\n if (userAnswerInt === STORE.questions[STORE.questionNumber].correctAnswer) {\n STORE.score++;\n const correct = generateCorrectView();\n $(\".container\").html(correct);\n } else {\n const incorrect = generateInCorrectView();\n $(\".container\").html(incorrect);\n }\n \n STORE.questionNumber++;\n}","title":""},{"docid":"eba67dade1dbc836b3e118b6e4f43e83","score":"0.63931847","text":"function results() {\n $(\".quizElement\").css(\"display\", \"none\");\n $(\".resultScreen\").css(\"display\", \"inline-block\");\n $(\".quizQuestion\").each(function() {\n var questionCorrect = false;\n var questionUnanswered = true;\n $(this)\n .children(\"input[type=radio]\")\n .each(function() {\n if (this.checked) {\n if (this.value === \"right\") {\n questionCorrect = true;\n }\n questionUnanswered = false;\n }\n });\n if (questionUnanswered) {\n unanswered++;\n } else if (questionCorrect) {\n correct++;\n } else {\n incorrect++;\n }\n });\n $(\"#correct\").text(\"Correct: \" + correct);\n $(\"#incorrect\").text(\"Incorrect: \" + incorrect);\n $(\"#unanswered\").text(\"Unanswered: \" + unanswered);\n clearInterval(timer);\n}","title":""},{"docid":"2ffa8ab4d4b77cbd01df7d0a69a0526a","score":"0.63922477","text":"function renderQuestion() {\n\n\t// $(\"#qna\").add().addClass(\"widget\").appendTo(document.body);\n\t\n\t// for (triviaIndex = 0; triviaIndex < triviaArray.length; triviaIndex++) {\n\n\t// for (triviaIndex = 0; triviaIndex < trivia.length; triviaIndex++) {\n\n\t\t// Think what I built above might be better than this....\n \tif (triviaIndex <= (triviaArray.length - 1)) {\n // Display question and answers\n \tconsole.log(triviaArray[triviaIndex][0]);\n \t// console.log(\"Next question\");\n \t\t\n \t\t} else {\n // If no more questions, render game end screen with scores\n \tconsole.log(\"Game over\");\n \t// Show score totals\n \t}\n\n\t}","title":""},{"docid":"255c75dc38afcc49d0121b9f2e6a3e47","score":"0.63906187","text":"function correctAnswer() {\n // function is called when question timer has tripped...therefore bump up total incorrect answers\n totalCorrect++;\n\n // clear all answers\n // make sure previous answers are removed\n $(\"#userChoices\").text(\"\");\n\n // message the player correct and incorrect counts, as well as current question status\n $(\"#userMessage\").text(\"The answer is CORRECT. You have answered \" + totalCorrect + \" questions correctly, and \" + totalIncorrect + \" incorrectly!\");\n\n // start the question transition timer\n startQuestionTransition();\n }","title":""},{"docid":"934131db524488227730d73e4d1f6c20","score":"0.63837284","text":"showIncorrect(userAns, answer, comment) {\n if (userAns) {\n $(\".content\").html('${quizQuestions[questionNum].correctAns}!
\r\n Let's see how we do on the next one:\r\n \r\nSorry. Your answer \"' + userAns + '\" is not correct.
');\n }\n else {\n $(\".content\").html('');\n }\n $(\".content\").append('The correct answer is ' + answer + \".
\")\n .append('' + comment + '
');\n }","title":""},{"docid":"1673aefb8b9c5d153cbaa383de93a99e","score":"0.63814956","text":"function answeredCorrectly() {\n score ++;\n $('#js-score').text(score);\n $('.js-quiz-section').html(`\n\n ![\"fireworks-celebration-icon\"](\"./photos-icons/firework-celebration.svg\")
\n
`\n );\n }","title":""},{"docid":"69cc53efd46dc41b224c5aa9bfa6e51d","score":"0.6377774","text":"function rightWrongDecide(){\n\n if(this.innerHTML === answer[count]){\n $(\"#questionSpace\").html(\"Correct\");\n correct++;\n displayAnswer();\n }else{\n $(\"#questionSpace\").html(\"Incorrect\");\n wrong++;\n displayAnswer();\n };\n\n }","title":""},{"docid":"30135ff0b0e68b62f84bea58ed65aca3","score":"0.6365128","text":"function tallyScore(){\n\tfor (var t = 0; t < userAnswers.length; t++) {\n\t\tfor (var w = 0; w \n Correct!
\n${STORE[questionNumber].correctAnswerMsg}
\n \n`);\n $('.resultSection').append(`