| 1 |
- {"ast":null,"code":"import { Quaternion, Matrix, Vector3, Vector2 } from \"../Maths/math.vector.js\";\nimport { VertexBuffer } from \"../Buffers/buffer.js\";\nimport { SubMesh } from \"../Meshes/subMesh.js\";\nimport { Mesh } from \"../Meshes/mesh.js\";\nimport { Color4 } from \"../Maths/math.color.js\";\nimport { VertexData } from \"./mesh.vertexData.js\";\n/**\n * Unique ID when we import meshes from Babylon to CSG\n */\nlet currentCSGMeshId = 0;\n/**\n * Represents a vertex of a polygon. Use your own vertex class instead of this\n * one to provide additional features like texture coordinates and vertex\n * colors. Custom vertex classes need to provide a `pos` property and `clone()`,\n * `flip()`, and `interpolate()` methods that behave analogous to the ones\n * defined by `BABYLON.CSG.Vertex`. This class provides `normal` so convenience\n * functions like `BABYLON.CSG.sphere()` can return a smooth vertex normal, but `normal`\n * is not used anywhere else.\n * Same goes for uv, it allows to keep the original vertex uv coordinates of the 2 meshes\n */\nclass Vertex {\n /**\n * Initializes the vertex\n * @param pos The position of the vertex\n * @param normal The normal of the vertex\n * @param uv The texture coordinate of the vertex\n * @param vertColor The RGBA color of the vertex\n */\n constructor(\n /**\n * The position of the vertex\n */\n pos,\n /**\n * The normal of the vertex\n */\n normal,\n /**\n * The texture coordinate of the vertex\n */\n uv,\n /**\n * The texture coordinate of the vertex\n */\n vertColor) {\n this.pos = pos;\n this.normal = normal;\n this.uv = uv;\n this.vertColor = vertColor;\n }\n /**\n * Make a clone, or deep copy, of the vertex\n * @returns A new Vertex\n */\n clone() {\n var _this$uv, _this$vertColor;\n return new Vertex(this.pos.clone(), this.normal.clone(), (_this$uv = this.uv) === null || _this$uv === void 0 ? void 0 : _this$uv.clone(), (_this$vertColor = this.vertColor) === null || _this$vertColor === void 0 ? void 0 : _this$vertColor.clone());\n }\n /**\n * Invert all orientation-specific data (e.g. vertex normal). Called when the\n * orientation of a polygon is flipped.\n */\n flip() {\n this.normal = this.normal.scale(-1);\n }\n /**\n * Create a new vertex between this vertex and `other` by linearly\n * interpolating all properties using a parameter of `t`. Subclasses should\n * override this to interpolate additional properties.\n * @param other the vertex to interpolate against\n * @param t The factor used to linearly interpolate between the vertices\n * @returns The new interpolated vertex\n */\n interpolate(other, t) {\n return new Vertex(Vector3.Lerp(this.pos, other.pos, t), Vector3.Lerp(this.normal, other.normal, t), this.uv && other.uv ? Vector2.Lerp(this.uv, other.uv, t) : undefined, this.vertColor && other.vertColor ? Color4.Lerp(this.vertColor, other.vertColor, t) : undefined);\n }\n}\n/**\n * Represents a plane in 3D space.\n */\nclass CSGPlane {\n /**\n * Initializes the plane\n * @param normal The normal for the plane\n * @param w\n */\n constructor(normal, w) {\n this.normal = normal;\n this.w = w;\n }\n /**\n * Construct a plane from three points\n * @param a Point a\n * @param b Point b\n * @param c Point c\n * @returns A new plane\n */\n static FromPoints(a, b, c) {\n const v0 = c.subtract(a);\n const v1 = b.subtract(a);\n if (v0.lengthSquared() === 0 || v1.lengthSquared() === 0) {\n return null;\n }\n const n = Vector3.Normalize(Vector3.Cross(v0, v1));\n return new CSGPlane(n, Vector3.Dot(n, a));\n }\n /**\n * Clone, or make a deep copy of the plane\n * @returns a new Plane\n */\n clone() {\n return new CSGPlane(this.normal.clone(), this.w);\n }\n /**\n * Flip the face of the plane\n */\n flip() {\n this.normal.scaleInPlace(-1);\n this.w = -this.w;\n }\n /**\n * Split `polygon` by this plane if needed, then put the polygon or polygon\n * fragments in the appropriate lists. Coplanar polygons go into either\n `* coplanarFront` or `coplanarBack` depending on their orientation with\n * respect to this plane. Polygons in front or in back of this plane go into\n * either `front` or `back`\n * @param polygon The polygon to be split\n * @param coplanarFront Will contain polygons coplanar with the plane that are oriented to the front of the plane\n * @param coplanarBack Will contain polygons coplanar with the plane that are oriented to the back of the plane\n * @param front Will contain the polygons in front of the plane\n * @param back Will contain the polygons begind the plane\n */\n splitPolygon(polygon, coplanarFront, coplanarBack, front, back) {\n const COPLANAR = 0;\n const FRONT = 1;\n const BACK = 2;\n const SPANNING = 3;\n // Classify each point as well as the entire polygon into one of the above\n // four classes.\n let polygonType = 0;\n const types = [];\n let i;\n let t;\n for (i = 0; i < polygon.vertices.length; i++) {\n t = Vector3.Dot(this.normal, polygon.vertices[i].pos) - this.w;\n const type = t < -CSGPlane.EPSILON ? BACK : t > CSGPlane.EPSILON ? FRONT : COPLANAR;\n polygonType |= type;\n types.push(type);\n }\n // Put the polygon in the correct list, splitting it when necessary\n switch (polygonType) {\n case COPLANAR:\n (Vector3.Dot(this.normal, polygon.plane.normal) > 0 ? coplanarFront : coplanarBack).push(polygon);\n break;\n case FRONT:\n front.push(polygon);\n break;\n case BACK:\n back.push(polygon);\n break;\n case SPANNING:\n {\n const f = [],\n b = [];\n for (i = 0; i < polygon.vertices.length; i++) {\n const j = (i + 1) % polygon.vertices.length;\n const ti = types[i],\n tj = types[j];\n const vi = polygon.vertices[i],\n vj = polygon.vertices[j];\n if (ti !== BACK) {\n f.push(vi);\n }\n if (ti !== FRONT) {\n b.push(ti !== BACK ? vi.clone() : vi);\n }\n if ((ti | tj) === SPANNING) {\n t = (this.w - Vector3.Dot(this.normal, vi.pos)) / Vector3.Dot(this.normal, vj.pos.subtract(vi.pos));\n const v = vi.interpolate(vj, t);\n f.push(v);\n b.push(v.clone());\n }\n }\n let poly;\n if (f.length >= 3) {\n poly = new CSGPolygon(f, polygon.shared);\n if (poly.plane) {\n front.push(poly);\n }\n }\n if (b.length >= 3) {\n poly = new CSGPolygon(b, polygon.shared);\n if (poly.plane) {\n back.push(poly);\n }\n }\n break;\n }\n }\n }\n}\n/**\n * `CSG.Plane.EPSILON` is the tolerance used by `splitPolygon()` to decide if a\n * point is on the plane\n */\nCSGPlane.EPSILON = 1e-5;\n/**\n * Represents a convex polygon. The vertices used to initialize a polygon must\n * be coplanar and form a convex loop.\n *\n * Each convex polygon has a `shared` property, which is shared between all\n * polygons that are clones of each other or were split from the same polygon.\n * This can be used to define per-polygon properties (such as surface color)\n */\nclass CSGPolygon {\n /**\n * Initializes the polygon\n * @param vertices The vertices of the polygon\n * @param shared The properties shared across all polygons\n */\n constructor(vertices, shared) {\n this.vertices = vertices;\n this.shared = shared;\n this.plane = CSGPlane.FromPoints(vertices[0].pos, vertices[1].pos, vertices[2].pos);\n }\n /**\n * Clones, or makes a deep copy, or the polygon\n * @returns A new CSGPolygon\n */\n clone() {\n const vertices = this.vertices.map(v => v.clone());\n return new CSGPolygon(vertices, this.shared);\n }\n /**\n * Flips the faces of the polygon\n */\n flip() {\n this.vertices.reverse().map(v => {\n v.flip();\n });\n this.plane.flip();\n }\n}\n/**\n * Holds a node in a BSP tree. A BSP tree is built from a collection of polygons\n * by picking a polygon to split along. That polygon (and all other coplanar\n * polygons) are added directly to that node and the other polygons are added to\n * the front and/or back subtrees. This is not a leafy BSP tree since there is\n * no distinction between internal and leaf nodes\n */\nclass Node {\n /**\n * Initializes the node\n * @param polygons A collection of polygons held in the node\n */\n constructor(polygons) {\n this._plane = null;\n this._front = null;\n this._back = null;\n this._polygons = new Array();\n if (polygons) {\n this.build(polygons);\n }\n }\n /**\n * Clones, or makes a deep copy, of the node\n * @returns The cloned node\n */\n clone() {\n const node = new Node();\n node._plane = this._plane && this._plane.clone();\n node._front = this._front && this._front.clone();\n node._back = this._back && this._back.clone();\n node._polygons = this._polygons.map(p => p.clone());\n return node;\n }\n /**\n * Convert solid space to empty space and empty space to solid space\n */\n invert() {\n for (let i = 0; i < this._polygons.length; i++) {\n this._polygons[i].flip();\n }\n if (this._plane) {\n this._plane.flip();\n }\n if (this._front) {\n this._front.invert();\n }\n if (this._back) {\n this._back.invert();\n }\n const temp = this._front;\n this._front = this._back;\n this._back = temp;\n }\n /**\n * Recursively remove all polygons in `polygons` that are inside this BSP\n * tree.\n * @param polygons Polygons to remove from the BSP\n * @returns Polygons clipped from the BSP\n */\n clipPolygons(polygons) {\n if (!this._plane) {\n return polygons.slice();\n }\n let front = [],\n back = [];\n for (let i = 0; i < polygons.length; i++) {\n this._plane.splitPolygon(polygons[i], front, back, front, back);\n }\n if (this._front) {\n front = this._front.clipPolygons(front);\n }\n if (this._back) {\n back = this._back.clipPolygons(back);\n } else {\n back = [];\n }\n return front.concat(back);\n }\n /**\n * Remove all polygons in this BSP tree that are inside the other BSP tree\n * `bsp`.\n * @param bsp BSP containing polygons to remove from this BSP\n */\n clipTo(bsp) {\n this._polygons = bsp.clipPolygons(this._polygons);\n if (this._front) {\n this._front.clipTo(bsp);\n }\n if (this._back) {\n this._back.clipTo(bsp);\n }\n }\n /**\n * Return a list of all polygons in this BSP tree\n * @returns List of all polygons in this BSP tree\n */\n allPolygons() {\n let polygons = this._polygons.slice();\n if (this._front) {\n polygons = polygons.concat(this._front.allPolygons());\n }\n if (this._back) {\n polygons = polygons.concat(this._back.allPolygons());\n }\n return polygons;\n }\n /**\n * Build a BSP tree out of `polygons`. When called on an existing tree, the\n * new polygons are filtered down to the bottom of the tree and become new\n * nodes there. Each set of polygons is partitioned using the first polygon\n * (no heuristic is used to pick a good split)\n * @param polygons Polygons used to construct the BSP tree\n */\n build(polygons) {\n if (!polygons.length) {\n return;\n }\n if (!this._plane) {\n this._plane = polygons[0].plane.clone();\n }\n const front = [],\n back = [];\n for (let i = 0; i < polygons.length; i++) {\n this._plane.splitPolygon(polygons[i], this._polygons, this._polygons, front, back);\n }\n if (front.length) {\n if (!this._front) {\n this._front = new Node();\n }\n this._front.build(front);\n }\n if (back.length) {\n if (!this._back) {\n this._back = new Node();\n }\n this._back.build(back);\n }\n }\n}\n/**\n * Class for building Constructive Solid Geometry\n * @deprecated Please use CSG2 instead\n */\nexport class CSG {\n constructor() {\n this._polygons = new Array();\n }\n /**\n * Convert a VertexData to CSG\n * @param data defines the VertexData to convert to CSG\n * @returns the new CSG\n */\n static FromVertexData(data) {\n let vertex, polygon, vertices;\n const polygons = [];\n const indices = data.indices;\n const positions = data.positions;\n const normals = data.normals;\n const uvs = data.uvs;\n const vertColors = data.colors;\n if (!indices || !positions) {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: VertexData must at least contain positions and indices\";\n }\n for (let i = 0; i < indices.length; i += 3) {\n vertices = [];\n for (let j = 0; j < 3; j++) {\n const indexIndices = i + j;\n const offset = indices[indexIndices];\n const normal = normals ? Vector3.FromArray(normals, offset * 3) : Vector3.Zero();\n const uv = uvs ? Vector2.FromArray(uvs, offset * 2) : undefined;\n const vertColor = vertColors ? Color4.FromArray(vertColors, offset * 4) : undefined;\n const position = Vector3.FromArray(positions, offset * 3);\n vertex = new Vertex(position, normal, uv, vertColor);\n vertices.push(vertex);\n }\n polygon = new CSGPolygon(vertices, {\n subMeshId: 0,\n meshId: currentCSGMeshId,\n materialIndex: 0\n });\n // To handle the case of degenerated triangle\n // polygon.plane == null <=> the polygon does not represent 1 single plane <=> the triangle is degenerated\n if (polygon.plane) {\n polygons.push(polygon);\n }\n }\n const csg = CSG._FromPolygons(polygons);\n csg.matrix = Matrix.Identity();\n csg.position = Vector3.Zero();\n csg.rotation = Vector3.Zero();\n csg.scaling = Vector3.One();\n csg.rotationQuaternion = Quaternion.Identity();\n currentCSGMeshId++;\n return csg;\n }\n /**\n * Convert the Mesh to CSG\n * @param mesh The Mesh to convert to CSG\n * @param absolute If true, the final (local) matrix transformation is set to the identity and not to that of `mesh`. It can help when dealing with right-handed meshes (default: false)\n * @returns A new CSG from the Mesh\n */\n static FromMesh(mesh, absolute = false) {\n let vertex,\n normal,\n uv = undefined,\n position,\n vertColor = undefined,\n polygon,\n vertices;\n const polygons = [];\n let matrix,\n meshPosition,\n meshRotation,\n meshRotationQuaternion = null,\n meshScaling;\n let invertWinding = false;\n if (mesh instanceof Mesh) {\n mesh.computeWorldMatrix(true);\n matrix = mesh.getWorldMatrix();\n meshPosition = mesh.position.clone();\n meshRotation = mesh.rotation.clone();\n if (mesh.rotationQuaternion) {\n meshRotationQuaternion = mesh.rotationQuaternion.clone();\n }\n meshScaling = mesh.scaling.clone();\n if (mesh.material && absolute) {\n invertWinding = mesh.material.sideOrientation === 0;\n }\n } else {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: Wrong Mesh type, must be BABYLON.Mesh\";\n }\n const indices = mesh.getIndices(),\n positions = mesh.getVerticesData(VertexBuffer.PositionKind),\n normals = mesh.getVerticesData(VertexBuffer.NormalKind),\n uvs = mesh.getVerticesData(VertexBuffer.UVKind),\n vertColors = mesh.getVerticesData(VertexBuffer.ColorKind);\n if (indices === null) {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: Mesh has no indices\";\n }\n if (positions === null) {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: Mesh has no positions\";\n }\n if (normals === null) {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: Mesh has no normals\";\n }\n const subMeshes = mesh.subMeshes;\n for (let sm = 0, sml = subMeshes.length; sm < sml; sm++) {\n for (let i = subMeshes[sm].indexStart, il = subMeshes[sm].indexCount + subMeshes[sm].indexStart; i < il; i += 3) {\n vertices = [];\n for (let j = 0; j < 3; j++) {\n const indexIndices = j === 0 ? i + j : invertWinding ? i + 3 - j : i + j;\n const sourceNormal = new Vector3(normals[indices[indexIndices] * 3], normals[indices[indexIndices] * 3 + 1], normals[indices[indexIndices] * 3 + 2]);\n if (uvs) {\n uv = new Vector2(uvs[indices[indexIndices] * 2], uvs[indices[indexIndices] * 2 + 1]);\n }\n if (vertColors) {\n vertColor = new Color4(vertColors[indices[indexIndices] * 4], vertColors[indices[indexIndices] * 4 + 1], vertColors[indices[indexIndices] * 4 + 2], vertColors[indices[indexIndices] * 4 + 3]);\n }\n const sourcePosition = new Vector3(positions[indices[indexIndices] * 3], positions[indices[indexIndices] * 3 + 1], positions[indices[indexIndices] * 3 + 2]);\n position = Vector3.TransformCoordinates(sourcePosition, matrix);\n normal = Vector3.TransformNormal(sourceNormal, matrix);\n vertex = new Vertex(position, normal, uv, vertColor);\n vertices.push(vertex);\n }\n polygon = new CSGPolygon(vertices, {\n subMeshId: sm,\n meshId: currentCSGMeshId,\n materialIndex: subMeshes[sm].materialIndex\n });\n // To handle the case of degenerated triangle\n // polygon.plane == null <=> the polygon does not represent 1 single plane <=> the triangle is degenerated\n if (polygon.plane) {\n polygons.push(polygon);\n }\n }\n }\n const csg = CSG._FromPolygons(polygons);\n csg.matrix = absolute ? Matrix.Identity() : matrix;\n csg.position = absolute ? Vector3.Zero() : meshPosition;\n csg.rotation = absolute ? Vector3.Zero() : meshRotation;\n csg.scaling = absolute ? Vector3.One() : meshScaling;\n csg.rotationQuaternion = absolute && meshRotationQuaternion ? Quaternion.Identity() : meshRotationQuaternion;\n currentCSGMeshId++;\n return csg;\n }\n /**\n * Construct a CSG solid from a list of `CSG.Polygon` instances.\n * @param polygons Polygons used to construct a CSG solid\n * @returns A new CSG solid\n */\n static _FromPolygons(polygons) {\n const csg = new CSG();\n csg._polygons = polygons;\n return csg;\n }\n /**\n * Clones, or makes a deep copy, of the CSG\n * @returns A new CSG\n */\n clone() {\n const csg = new CSG();\n csg._polygons = this._polygons.map(p => p.clone());\n csg.copyTransformAttributes(this);\n return csg;\n }\n /**\n * Unions this CSG with another CSG\n * @param csg The CSG to union against this CSG\n * @returns The unioned CSG\n */\n union(csg) {\n const a = new Node(this.clone()._polygons);\n const b = new Node(csg.clone()._polygons);\n a.clipTo(b);\n b.clipTo(a);\n b.invert();\n b.clipTo(a);\n b.invert();\n a.build(b.allPolygons());\n return CSG._FromPolygons(a.allPolygons()).copyTransformAttributes(this);\n }\n /**\n * Unions this CSG with another CSG in place\n * @param csg The CSG to union against this CSG\n */\n unionInPlace(csg) {\n const a = new Node(this._polygons);\n const b = new Node(csg._polygons);\n a.clipTo(b);\n b.clipTo(a);\n b.invert();\n b.clipTo(a);\n b.invert();\n a.build(b.allPolygons());\n this._polygons = a.allPolygons();\n }\n /**\n * Subtracts this CSG with another CSG\n * @param csg The CSG to subtract against this CSG\n * @returns A new CSG\n */\n subtract(csg) {\n const a = new Node(this.clone()._polygons);\n const b = new Node(csg.clone()._polygons);\n a.invert();\n a.clipTo(b);\n b.clipTo(a);\n b.invert();\n b.clipTo(a);\n b.invert();\n a.build(b.allPolygons());\n a.invert();\n return CSG._FromPolygons(a.allPolygons()).copyTransformAttributes(this);\n }\n /**\n * Subtracts this CSG with another CSG in place\n * @param csg The CSG to subtract against this CSG\n */\n subtractInPlace(csg) {\n const a = new Node(this._polygons);\n const b = new Node(csg._polygons);\n a.invert();\n a.clipTo(b);\n b.clipTo(a);\n b.invert();\n b.clipTo(a);\n b.invert();\n a.build(b.allPolygons());\n a.invert();\n this._polygons = a.allPolygons();\n }\n /**\n * Intersect this CSG with another CSG\n * @param csg The CSG to intersect against this CSG\n * @returns A new CSG\n */\n intersect(csg) {\n const a = new Node(this.clone()._polygons);\n const b = new Node(csg.clone()._polygons);\n a.invert();\n b.clipTo(a);\n b.invert();\n a.clipTo(b);\n b.clipTo(a);\n a.build(b.allPolygons());\n a.invert();\n return CSG._FromPolygons(a.allPolygons()).copyTransformAttributes(this);\n }\n /**\n * Intersects this CSG with another CSG in place\n * @param csg The CSG to intersect against this CSG\n */\n intersectInPlace(csg) {\n const a = new Node(this._polygons);\n const b = new Node(csg._polygons);\n a.invert();\n b.clipTo(a);\n b.invert();\n a.clipTo(b);\n b.clipTo(a);\n a.build(b.allPolygons());\n a.invert();\n this._polygons = a.allPolygons();\n }\n /**\n * Return a new CSG solid with solid and empty space switched. This solid is\n * not modified.\n * @returns A new CSG solid with solid and empty space switched\n */\n inverse() {\n const csg = this.clone();\n csg.inverseInPlace();\n return csg;\n }\n /**\n * Inverses the CSG in place\n */\n inverseInPlace() {\n this._polygons.map(p => {\n p.flip();\n });\n }\n /**\n * This is used to keep meshes transformations so they can be restored\n * when we build back a Babylon Mesh\n * NB : All CSG operations are performed in world coordinates\n * @param csg The CSG to copy the transform attributes from\n * @returns This CSG\n */\n copyTransformAttributes(csg) {\n this.matrix = csg.matrix;\n this.position = csg.position;\n this.rotation = csg.rotation;\n this.scaling = csg.scaling;\n this.rotationQuaternion = csg.rotationQuaternion;\n return this;\n }\n /**\n * Build vertex data from CSG\n * Coordinates here are in world space\n * @param onBeforePolygonProcessing called before each polygon is being processed\n * @param onAfterPolygonProcessing called after each polygon has been processed\n * @returns the final vertex data\n */\n toVertexData(onBeforePolygonProcessing = null, onAfterPolygonProcessing = null) {\n const matrix = this.matrix.clone();\n matrix.invert();\n const polygons = this._polygons;\n const vertices = [];\n const indices = [];\n const normals = [];\n let uvs = null;\n let vertColors = null;\n const vertex = Vector3.Zero();\n const normal = Vector3.Zero();\n const uv = Vector2.Zero();\n const vertColor = new Color4(0, 0, 0, 0);\n const polygonIndices = [0, 0, 0];\n const vertice_dict = {};\n let vertex_idx;\n for (let i = 0, il = polygons.length; i < il; i++) {\n const polygon = polygons[i];\n if (onBeforePolygonProcessing) {\n onBeforePolygonProcessing(polygon);\n }\n for (let j = 2, jl = polygon.vertices.length; j < jl; j++) {\n polygonIndices[0] = 0;\n polygonIndices[1] = j - 1;\n polygonIndices[2] = j;\n for (let k = 0; k < 3; k++) {\n vertex.copyFrom(polygon.vertices[polygonIndices[k]].pos);\n normal.copyFrom(polygon.vertices[polygonIndices[k]].normal);\n if (polygon.vertices[polygonIndices[k]].uv) {\n if (!uvs) {\n uvs = [];\n }\n uv.copyFrom(polygon.vertices[polygonIndices[k]].uv);\n }\n if (polygon.vertices[polygonIndices[k]].vertColor) {\n if (!vertColors) {\n vertColors = [];\n }\n vertColor.copyFrom(polygon.vertices[polygonIndices[k]].vertColor);\n }\n const localVertex = Vector3.TransformCoordinates(vertex, matrix);\n const localNormal = Vector3.TransformNormal(normal, matrix);\n vertex_idx = vertice_dict[localVertex.x + \",\" + localVertex.y + \",\" + localVertex.z];\n let areUvsDifferent = false;\n if (uvs && !(uvs[vertex_idx * 2] === uv.x || uvs[vertex_idx * 2 + 1] === uv.y)) {\n areUvsDifferent = true;\n }\n let areColorsDifferent = false;\n if (vertColors && !(vertColors[vertex_idx * 4] === vertColor.r || vertColors[vertex_idx * 4 + 1] === vertColor.g || vertColors[vertex_idx * 4 + 2] === vertColor.b || vertColors[vertex_idx * 4 + 3] === vertColor.a)) {\n areColorsDifferent = true;\n }\n // Check if 2 points can be merged\n if (!(typeof vertex_idx !== \"undefined\" && normals[vertex_idx * 3] === localNormal.x && normals[vertex_idx * 3 + 1] === localNormal.y && normals[vertex_idx * 3 + 2] === localNormal.z) || areUvsDifferent || areColorsDifferent) {\n vertices.push(localVertex.x, localVertex.y, localVertex.z);\n if (uvs) {\n uvs.push(uv.x, uv.y);\n }\n normals.push(normal.x, normal.y, normal.z);\n if (vertColors) {\n vertColors.push(vertColor.r, vertColor.g, vertColor.b, vertColor.a);\n }\n vertex_idx = vertice_dict[localVertex.x + \",\" + localVertex.y + \",\" + localVertex.z] = vertices.length / 3 - 1;\n }\n indices.push(vertex_idx);\n if (onAfterPolygonProcessing) {\n onAfterPolygonProcessing();\n }\n }\n }\n }\n const result = new VertexData();\n result.positions = vertices;\n result.normals = normals;\n if (uvs) {\n result.uvs = uvs;\n }\n if (vertColors) {\n result.colors = vertColors;\n }\n result.indices = indices;\n return result;\n }\n /**\n * Build Raw mesh from CSG\n * Coordinates here are in world space\n * @param name The name of the mesh geometry\n * @param scene The Scene\n * @param keepSubMeshes Specifies if the submeshes should be kept\n * @returns A new Mesh\n */\n buildMeshGeometry(name, scene, keepSubMeshes) {\n const mesh = new Mesh(name, scene);\n const polygons = this._polygons;\n let currentIndex = 0;\n const subMeshDict = {};\n let subMeshObj;\n if (keepSubMeshes) {\n // Sort Polygons, since subMeshes are indices range\n polygons.sort((a, b) => {\n if (a.shared.meshId === b.shared.meshId) {\n return a.shared.subMeshId - b.shared.subMeshId;\n } else {\n return a.shared.meshId - b.shared.meshId;\n }\n });\n }\n const vertexData = this.toVertexData(polygon => {\n // Building SubMeshes\n if (!subMeshDict[polygon.shared.meshId]) {\n subMeshDict[polygon.shared.meshId] = {};\n }\n if (!subMeshDict[polygon.shared.meshId][polygon.shared.subMeshId]) {\n subMeshDict[polygon.shared.meshId][polygon.shared.subMeshId] = {\n indexStart: +Infinity,\n indexEnd: -Infinity,\n materialIndex: polygon.shared.materialIndex\n };\n }\n subMeshObj = subMeshDict[polygon.shared.meshId][polygon.shared.subMeshId];\n }, () => {\n subMeshObj.indexStart = Math.min(currentIndex, subMeshObj.indexStart);\n subMeshObj.indexEnd = Math.max(currentIndex, subMeshObj.indexEnd);\n currentIndex++;\n });\n vertexData.applyToMesh(mesh);\n if (keepSubMeshes) {\n // We offset the materialIndex by the previous number of materials in the CSG mixed meshes\n let materialIndexOffset = 0,\n materialMaxIndex;\n mesh.subMeshes = [];\n for (const m in subMeshDict) {\n materialMaxIndex = -1;\n for (const sm in subMeshDict[m]) {\n subMeshObj = subMeshDict[m][sm];\n SubMesh.CreateFromIndices(subMeshObj.materialIndex + materialIndexOffset, subMeshObj.indexStart, subMeshObj.indexEnd - subMeshObj.indexStart + 1, mesh);\n materialMaxIndex = Math.max(subMeshObj.materialIndex, materialMaxIndex);\n }\n materialIndexOffset += ++materialMaxIndex;\n }\n }\n return mesh;\n }\n /**\n * Build Mesh from CSG taking material and transforms into account\n * @param name The name of the Mesh\n * @param material The material of the Mesh\n * @param scene The Scene\n * @param keepSubMeshes Specifies if submeshes should be kept\n * @returns The new Mesh\n */\n toMesh(name, material = null, scene, keepSubMeshes) {\n const mesh = this.buildMeshGeometry(name, scene, keepSubMeshes);\n mesh.material = material;\n mesh.position.copyFrom(this.position);\n mesh.rotation.copyFrom(this.rotation);\n if (this.rotationQuaternion) {\n mesh.rotationQuaternion = this.rotationQuaternion.clone();\n }\n mesh.scaling.copyFrom(this.scaling);\n mesh.computeWorldMatrix(true);\n return mesh;\n }\n}","map":{"version":3,"names":["Quaternion","Matrix","Vector3","Vector2","VertexBuffer","SubMesh","Mesh","Color4","VertexData","currentCSGMeshId","Vertex","constructor","pos","normal","uv","vertColor","clone","_this$uv","_this$vertColor","flip","scale","interpolate","other","t","Lerp","undefined","CSGPlane","w","FromPoints","a","b","c","v0","subtract","v1","lengthSquared","n","Normalize","Cross","Dot","scaleInPlace","splitPolygon","polygon","coplanarFront","coplanarBack","front","back","COPLANAR","FRONT","BACK","SPANNING","polygonType","types","i","vertices","length","type","EPSILON","push","plane","f","j","ti","tj","vi","vj","v","poly","CSGPolygon","shared","map","reverse","Node","polygons","_plane","_front","_back","_polygons","Array","build","node","p","invert","temp","clipPolygons","slice","concat","clipTo","bsp","allPolygons","CSG","FromVertexData","data","vertex","indices","positions","normals","uvs","vertColors","colors","indexIndices","offset","FromArray","Zero","position","subMeshId","meshId","materialIndex","csg","_FromPolygons","matrix","Identity","rotation","scaling","One","rotationQuaternion","FromMesh","mesh","absolute","meshPosition","meshRotation","meshRotationQuaternion","meshScaling","invertWinding","computeWorldMatrix","getWorldMatrix","material","sideOrientation","getIndices","getVerticesData","PositionKind","NormalKind","UVKind","ColorKind","subMeshes","sm","sml","indexStart","il","indexCount","sourceNormal","sourcePosition","TransformCoordinates","TransformNormal","copyTransformAttributes","union","unionInPlace","subtractInPlace","intersect","intersectInPlace","inverse","inverseInPlace","toVertexData","onBeforePolygonProcessing","onAfterPolygonProcessing","polygonIndices","vertice_dict","vertex_idx","jl","k","copyFrom","localVertex","localNormal","x","y","z","areUvsDifferent","areColorsDifferent","r","g","result","buildMeshGeometry","name","scene","keepSubMeshes","currentIndex","subMeshDict","subMeshObj","sort","vertexData","Infinity","indexEnd","Math","min","max","applyToMesh","materialIndexOffset","materialMaxIndex","m","CreateFromIndices","toMesh"],"sources":["F:/workspace/202226701027/huinongbao-app/node_modules/@babylonjs/core/Meshes/csg.js"],"sourcesContent":["import { Quaternion, Matrix, Vector3, Vector2 } from \"../Maths/math.vector.js\";\nimport { VertexBuffer } from \"../Buffers/buffer.js\";\nimport { SubMesh } from \"../Meshes/subMesh.js\";\nimport { Mesh } from \"../Meshes/mesh.js\";\nimport { Color4 } from \"../Maths/math.color.js\";\n\nimport { VertexData } from \"./mesh.vertexData.js\";\n/**\n * Unique ID when we import meshes from Babylon to CSG\n */\nlet currentCSGMeshId = 0;\n/**\n * Represents a vertex of a polygon. Use your own vertex class instead of this\n * one to provide additional features like texture coordinates and vertex\n * colors. Custom vertex classes need to provide a `pos` property and `clone()`,\n * `flip()`, and `interpolate()` methods that behave analogous to the ones\n * defined by `BABYLON.CSG.Vertex`. This class provides `normal` so convenience\n * functions like `BABYLON.CSG.sphere()` can return a smooth vertex normal, but `normal`\n * is not used anywhere else.\n * Same goes for uv, it allows to keep the original vertex uv coordinates of the 2 meshes\n */\nclass Vertex {\n /**\n * Initializes the vertex\n * @param pos The position of the vertex\n * @param normal The normal of the vertex\n * @param uv The texture coordinate of the vertex\n * @param vertColor The RGBA color of the vertex\n */\n constructor(\n /**\n * The position of the vertex\n */\n pos, \n /**\n * The normal of the vertex\n */\n normal, \n /**\n * The texture coordinate of the vertex\n */\n uv, \n /**\n * The texture coordinate of the vertex\n */\n vertColor) {\n this.pos = pos;\n this.normal = normal;\n this.uv = uv;\n this.vertColor = vertColor;\n }\n /**\n * Make a clone, or deep copy, of the vertex\n * @returns A new Vertex\n */\n clone() {\n return new Vertex(this.pos.clone(), this.normal.clone(), this.uv?.clone(), this.vertColor?.clone());\n }\n /**\n * Invert all orientation-specific data (e.g. vertex normal). Called when the\n * orientation of a polygon is flipped.\n */\n flip() {\n this.normal = this.normal.scale(-1);\n }\n /**\n * Create a new vertex between this vertex and `other` by linearly\n * interpolating all properties using a parameter of `t`. Subclasses should\n * override this to interpolate additional properties.\n * @param other the vertex to interpolate against\n * @param t The factor used to linearly interpolate between the vertices\n * @returns The new interpolated vertex\n */\n interpolate(other, t) {\n return new Vertex(Vector3.Lerp(this.pos, other.pos, t), Vector3.Lerp(this.normal, other.normal, t), this.uv && other.uv ? Vector2.Lerp(this.uv, other.uv, t) : undefined, this.vertColor && other.vertColor ? Color4.Lerp(this.vertColor, other.vertColor, t) : undefined);\n }\n}\n/**\n * Represents a plane in 3D space.\n */\nclass CSGPlane {\n /**\n * Initializes the plane\n * @param normal The normal for the plane\n * @param w\n */\n constructor(normal, w) {\n this.normal = normal;\n this.w = w;\n }\n /**\n * Construct a plane from three points\n * @param a Point a\n * @param b Point b\n * @param c Point c\n * @returns A new plane\n */\n static FromPoints(a, b, c) {\n const v0 = c.subtract(a);\n const v1 = b.subtract(a);\n if (v0.lengthSquared() === 0 || v1.lengthSquared() === 0) {\n return null;\n }\n const n = Vector3.Normalize(Vector3.Cross(v0, v1));\n return new CSGPlane(n, Vector3.Dot(n, a));\n }\n /**\n * Clone, or make a deep copy of the plane\n * @returns a new Plane\n */\n clone() {\n return new CSGPlane(this.normal.clone(), this.w);\n }\n /**\n * Flip the face of the plane\n */\n flip() {\n this.normal.scaleInPlace(-1);\n this.w = -this.w;\n }\n /**\n * Split `polygon` by this plane if needed, then put the polygon or polygon\n * fragments in the appropriate lists. Coplanar polygons go into either\n `* coplanarFront` or `coplanarBack` depending on their orientation with\n * respect to this plane. Polygons in front or in back of this plane go into\n * either `front` or `back`\n * @param polygon The polygon to be split\n * @param coplanarFront Will contain polygons coplanar with the plane that are oriented to the front of the plane\n * @param coplanarBack Will contain polygons coplanar with the plane that are oriented to the back of the plane\n * @param front Will contain the polygons in front of the plane\n * @param back Will contain the polygons begind the plane\n */\n splitPolygon(polygon, coplanarFront, coplanarBack, front, back) {\n const COPLANAR = 0;\n const FRONT = 1;\n const BACK = 2;\n const SPANNING = 3;\n // Classify each point as well as the entire polygon into one of the above\n // four classes.\n let polygonType = 0;\n const types = [];\n let i;\n let t;\n for (i = 0; i < polygon.vertices.length; i++) {\n t = Vector3.Dot(this.normal, polygon.vertices[i].pos) - this.w;\n const type = t < -CSGPlane.EPSILON ? BACK : t > CSGPlane.EPSILON ? FRONT : COPLANAR;\n polygonType |= type;\n types.push(type);\n }\n // Put the polygon in the correct list, splitting it when necessary\n switch (polygonType) {\n case COPLANAR:\n (Vector3.Dot(this.normal, polygon.plane.normal) > 0 ? coplanarFront : coplanarBack).push(polygon);\n break;\n case FRONT:\n front.push(polygon);\n break;\n case BACK:\n back.push(polygon);\n break;\n case SPANNING: {\n const f = [], b = [];\n for (i = 0; i < polygon.vertices.length; i++) {\n const j = (i + 1) % polygon.vertices.length;\n const ti = types[i], tj = types[j];\n const vi = polygon.vertices[i], vj = polygon.vertices[j];\n if (ti !== BACK) {\n f.push(vi);\n }\n if (ti !== FRONT) {\n b.push(ti !== BACK ? vi.clone() : vi);\n }\n if ((ti | tj) === SPANNING) {\n t = (this.w - Vector3.Dot(this.normal, vi.pos)) / Vector3.Dot(this.normal, vj.pos.subtract(vi.pos));\n const v = vi.interpolate(vj, t);\n f.push(v);\n b.push(v.clone());\n }\n }\n let poly;\n if (f.length >= 3) {\n poly = new CSGPolygon(f, polygon.shared);\n if (poly.plane) {\n front.push(poly);\n }\n }\n if (b.length >= 3) {\n poly = new CSGPolygon(b, polygon.shared);\n if (poly.plane) {\n back.push(poly);\n }\n }\n break;\n }\n }\n }\n}\n/**\n * `CSG.Plane.EPSILON` is the tolerance used by `splitPolygon()` to decide if a\n * point is on the plane\n */\nCSGPlane.EPSILON = 1e-5;\n/**\n * Represents a convex polygon. The vertices used to initialize a polygon must\n * be coplanar and form a convex loop.\n *\n * Each convex polygon has a `shared` property, which is shared between all\n * polygons that are clones of each other or were split from the same polygon.\n * This can be used to define per-polygon properties (such as surface color)\n */\nclass CSGPolygon {\n /**\n * Initializes the polygon\n * @param vertices The vertices of the polygon\n * @param shared The properties shared across all polygons\n */\n constructor(vertices, shared) {\n this.vertices = vertices;\n this.shared = shared;\n this.plane = CSGPlane.FromPoints(vertices[0].pos, vertices[1].pos, vertices[2].pos);\n }\n /**\n * Clones, or makes a deep copy, or the polygon\n * @returns A new CSGPolygon\n */\n clone() {\n const vertices = this.vertices.map((v) => v.clone());\n return new CSGPolygon(vertices, this.shared);\n }\n /**\n * Flips the faces of the polygon\n */\n flip() {\n this.vertices.reverse().map((v) => {\n v.flip();\n });\n this.plane.flip();\n }\n}\n/**\n * Holds a node in a BSP tree. A BSP tree is built from a collection of polygons\n * by picking a polygon to split along. That polygon (and all other coplanar\n * polygons) are added directly to that node and the other polygons are added to\n * the front and/or back subtrees. This is not a leafy BSP tree since there is\n * no distinction between internal and leaf nodes\n */\nclass Node {\n /**\n * Initializes the node\n * @param polygons A collection of polygons held in the node\n */\n constructor(polygons) {\n this._plane = null;\n this._front = null;\n this._back = null;\n this._polygons = new Array();\n if (polygons) {\n this.build(polygons);\n }\n }\n /**\n * Clones, or makes a deep copy, of the node\n * @returns The cloned node\n */\n clone() {\n const node = new Node();\n node._plane = this._plane && this._plane.clone();\n node._front = this._front && this._front.clone();\n node._back = this._back && this._back.clone();\n node._polygons = this._polygons.map((p) => p.clone());\n return node;\n }\n /**\n * Convert solid space to empty space and empty space to solid space\n */\n invert() {\n for (let i = 0; i < this._polygons.length; i++) {\n this._polygons[i].flip();\n }\n if (this._plane) {\n this._plane.flip();\n }\n if (this._front) {\n this._front.invert();\n }\n if (this._back) {\n this._back.invert();\n }\n const temp = this._front;\n this._front = this._back;\n this._back = temp;\n }\n /**\n * Recursively remove all polygons in `polygons` that are inside this BSP\n * tree.\n * @param polygons Polygons to remove from the BSP\n * @returns Polygons clipped from the BSP\n */\n clipPolygons(polygons) {\n if (!this._plane) {\n return polygons.slice();\n }\n let front = [], back = [];\n for (let i = 0; i < polygons.length; i++) {\n this._plane.splitPolygon(polygons[i], front, back, front, back);\n }\n if (this._front) {\n front = this._front.clipPolygons(front);\n }\n if (this._back) {\n back = this._back.clipPolygons(back);\n }\n else {\n back = [];\n }\n return front.concat(back);\n }\n /**\n * Remove all polygons in this BSP tree that are inside the other BSP tree\n * `bsp`.\n * @param bsp BSP containing polygons to remove from this BSP\n */\n clipTo(bsp) {\n this._polygons = bsp.clipPolygons(this._polygons);\n if (this._front) {\n this._front.clipTo(bsp);\n }\n if (this._back) {\n this._back.clipTo(bsp);\n }\n }\n /**\n * Return a list of all polygons in this BSP tree\n * @returns List of all polygons in this BSP tree\n */\n allPolygons() {\n let polygons = this._polygons.slice();\n if (this._front) {\n polygons = polygons.concat(this._front.allPolygons());\n }\n if (this._back) {\n polygons = polygons.concat(this._back.allPolygons());\n }\n return polygons;\n }\n /**\n * Build a BSP tree out of `polygons`. When called on an existing tree, the\n * new polygons are filtered down to the bottom of the tree and become new\n * nodes there. Each set of polygons is partitioned using the first polygon\n * (no heuristic is used to pick a good split)\n * @param polygons Polygons used to construct the BSP tree\n */\n build(polygons) {\n if (!polygons.length) {\n return;\n }\n if (!this._plane) {\n this._plane = polygons[0].plane.clone();\n }\n const front = [], back = [];\n for (let i = 0; i < polygons.length; i++) {\n this._plane.splitPolygon(polygons[i], this._polygons, this._polygons, front, back);\n }\n if (front.length) {\n if (!this._front) {\n this._front = new Node();\n }\n this._front.build(front);\n }\n if (back.length) {\n if (!this._back) {\n this._back = new Node();\n }\n this._back.build(back);\n }\n }\n}\n/**\n * Class for building Constructive Solid Geometry\n * @deprecated Please use CSG2 instead\n */\nexport class CSG {\n constructor() {\n this._polygons = new Array();\n }\n /**\n * Convert a VertexData to CSG\n * @param data defines the VertexData to convert to CSG\n * @returns the new CSG\n */\n static FromVertexData(data) {\n let vertex, polygon, vertices;\n const polygons = [];\n const indices = data.indices;\n const positions = data.positions;\n const normals = data.normals;\n const uvs = data.uvs;\n const vertColors = data.colors;\n if (!indices || !positions) {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: VertexData must at least contain positions and indices\";\n }\n for (let i = 0; i < indices.length; i += 3) {\n vertices = [];\n for (let j = 0; j < 3; j++) {\n const indexIndices = i + j;\n const offset = indices[indexIndices];\n const normal = normals ? Vector3.FromArray(normals, offset * 3) : Vector3.Zero();\n const uv = uvs ? Vector2.FromArray(uvs, offset * 2) : undefined;\n const vertColor = vertColors ? Color4.FromArray(vertColors, offset * 4) : undefined;\n const position = Vector3.FromArray(positions, offset * 3);\n vertex = new Vertex(position, normal, uv, vertColor);\n vertices.push(vertex);\n }\n polygon = new CSGPolygon(vertices, { subMeshId: 0, meshId: currentCSGMeshId, materialIndex: 0 });\n // To handle the case of degenerated triangle\n // polygon.plane == null <=> the polygon does not represent 1 single plane <=> the triangle is degenerated\n if (polygon.plane) {\n polygons.push(polygon);\n }\n }\n const csg = CSG._FromPolygons(polygons);\n csg.matrix = Matrix.Identity();\n csg.position = Vector3.Zero();\n csg.rotation = Vector3.Zero();\n csg.scaling = Vector3.One();\n csg.rotationQuaternion = Quaternion.Identity();\n currentCSGMeshId++;\n return csg;\n }\n /**\n * Convert the Mesh to CSG\n * @param mesh The Mesh to convert to CSG\n * @param absolute If true, the final (local) matrix transformation is set to the identity and not to that of `mesh`. It can help when dealing with right-handed meshes (default: false)\n * @returns A new CSG from the Mesh\n */\n static FromMesh(mesh, absolute = false) {\n let vertex, normal, uv = undefined, position, vertColor = undefined, polygon, vertices;\n const polygons = [];\n let matrix, meshPosition, meshRotation, meshRotationQuaternion = null, meshScaling;\n let invertWinding = false;\n if (mesh instanceof Mesh) {\n mesh.computeWorldMatrix(true);\n matrix = mesh.getWorldMatrix();\n meshPosition = mesh.position.clone();\n meshRotation = mesh.rotation.clone();\n if (mesh.rotationQuaternion) {\n meshRotationQuaternion = mesh.rotationQuaternion.clone();\n }\n meshScaling = mesh.scaling.clone();\n if (mesh.material && absolute) {\n invertWinding = mesh.material.sideOrientation === 0;\n }\n }\n else {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: Wrong Mesh type, must be BABYLON.Mesh\";\n }\n const indices = mesh.getIndices(), positions = mesh.getVerticesData(VertexBuffer.PositionKind), normals = mesh.getVerticesData(VertexBuffer.NormalKind), uvs = mesh.getVerticesData(VertexBuffer.UVKind), vertColors = mesh.getVerticesData(VertexBuffer.ColorKind);\n if (indices === null) {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: Mesh has no indices\";\n }\n if (positions === null) {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: Mesh has no positions\";\n }\n if (normals === null) {\n // eslint-disable-next-line no-throw-literal\n throw \"BABYLON.CSG: Mesh has no normals\";\n }\n const subMeshes = mesh.subMeshes;\n for (let sm = 0, sml = subMeshes.length; sm < sml; sm++) {\n for (let i = subMeshes[sm].indexStart, il = subMeshes[sm].indexCount + subMeshes[sm].indexStart; i < il; i += 3) {\n vertices = [];\n for (let j = 0; j < 3; j++) {\n const indexIndices = j === 0 ? i + j : invertWinding ? i + 3 - j : i + j;\n const sourceNormal = new Vector3(normals[indices[indexIndices] * 3], normals[indices[indexIndices] * 3 + 1], normals[indices[indexIndices] * 3 + 2]);\n if (uvs) {\n uv = new Vector2(uvs[indices[indexIndices] * 2], uvs[indices[indexIndices] * 2 + 1]);\n }\n if (vertColors) {\n vertColor = new Color4(vertColors[indices[indexIndices] * 4], vertColors[indices[indexIndices] * 4 + 1], vertColors[indices[indexIndices] * 4 + 2], vertColors[indices[indexIndices] * 4 + 3]);\n }\n const sourcePosition = new Vector3(positions[indices[indexIndices] * 3], positions[indices[indexIndices] * 3 + 1], positions[indices[indexIndices] * 3 + 2]);\n position = Vector3.TransformCoordinates(sourcePosition, matrix);\n normal = Vector3.TransformNormal(sourceNormal, matrix);\n vertex = new Vertex(position, normal, uv, vertColor);\n vertices.push(vertex);\n }\n polygon = new CSGPolygon(vertices, { subMeshId: sm, meshId: currentCSGMeshId, materialIndex: subMeshes[sm].materialIndex });\n // To handle the case of degenerated triangle\n // polygon.plane == null <=> the polygon does not represent 1 single plane <=> the triangle is degenerated\n if (polygon.plane) {\n polygons.push(polygon);\n }\n }\n }\n const csg = CSG._FromPolygons(polygons);\n csg.matrix = absolute ? Matrix.Identity() : matrix;\n csg.position = absolute ? Vector3.Zero() : meshPosition;\n csg.rotation = absolute ? Vector3.Zero() : meshRotation;\n csg.scaling = absolute ? Vector3.One() : meshScaling;\n csg.rotationQuaternion = absolute && meshRotationQuaternion ? Quaternion.Identity() : meshRotationQuaternion;\n currentCSGMeshId++;\n return csg;\n }\n /**\n * Construct a CSG solid from a list of `CSG.Polygon` instances.\n * @param polygons Polygons used to construct a CSG solid\n * @returns A new CSG solid\n */\n static _FromPolygons(polygons) {\n const csg = new CSG();\n csg._polygons = polygons;\n return csg;\n }\n /**\n * Clones, or makes a deep copy, of the CSG\n * @returns A new CSG\n */\n clone() {\n const csg = new CSG();\n csg._polygons = this._polygons.map((p) => p.clone());\n csg.copyTransformAttributes(this);\n return csg;\n }\n /**\n * Unions this CSG with another CSG\n * @param csg The CSG to union against this CSG\n * @returns The unioned CSG\n */\n union(csg) {\n const a = new Node(this.clone()._polygons);\n const b = new Node(csg.clone()._polygons);\n a.clipTo(b);\n b.clipTo(a);\n b.invert();\n b.clipTo(a);\n b.invert();\n a.build(b.allPolygons());\n return CSG._FromPolygons(a.allPolygons()).copyTransformAttributes(this);\n }\n /**\n * Unions this CSG with another CSG in place\n * @param csg The CSG to union against this CSG\n */\n unionInPlace(csg) {\n const a = new Node(this._polygons);\n const b = new Node(csg._polygons);\n a.clipTo(b);\n b.clipTo(a);\n b.invert();\n b.clipTo(a);\n b.invert();\n a.build(b.allPolygons());\n this._polygons = a.allPolygons();\n }\n /**\n * Subtracts this CSG with another CSG\n * @param csg The CSG to subtract against this CSG\n * @returns A new CSG\n */\n subtract(csg) {\n const a = new Node(this.clone()._polygons);\n const b = new Node(csg.clone()._polygons);\n a.invert();\n a.clipTo(b);\n b.clipTo(a);\n b.invert();\n b.clipTo(a);\n b.invert();\n a.build(b.allPolygons());\n a.invert();\n return CSG._FromPolygons(a.allPolygons()).copyTransformAttributes(this);\n }\n /**\n * Subtracts this CSG with another CSG in place\n * @param csg The CSG to subtract against this CSG\n */\n subtractInPlace(csg) {\n const a = new Node(this._polygons);\n const b = new Node(csg._polygons);\n a.invert();\n a.clipTo(b);\n b.clipTo(a);\n b.invert();\n b.clipTo(a);\n b.invert();\n a.build(b.allPolygons());\n a.invert();\n this._polygons = a.allPolygons();\n }\n /**\n * Intersect this CSG with another CSG\n * @param csg The CSG to intersect against this CSG\n * @returns A new CSG\n */\n intersect(csg) {\n const a = new Node(this.clone()._polygons);\n const b = new Node(csg.clone()._polygons);\n a.invert();\n b.clipTo(a);\n b.invert();\n a.clipTo(b);\n b.clipTo(a);\n a.build(b.allPolygons());\n a.invert();\n return CSG._FromPolygons(a.allPolygons()).copyTransformAttributes(this);\n }\n /**\n * Intersects this CSG with another CSG in place\n * @param csg The CSG to intersect against this CSG\n */\n intersectInPlace(csg) {\n const a = new Node(this._polygons);\n const b = new Node(csg._polygons);\n a.invert();\n b.clipTo(a);\n b.invert();\n a.clipTo(b);\n b.clipTo(a);\n a.build(b.allPolygons());\n a.invert();\n this._polygons = a.allPolygons();\n }\n /**\n * Return a new CSG solid with solid and empty space switched. This solid is\n * not modified.\n * @returns A new CSG solid with solid and empty space switched\n */\n inverse() {\n const csg = this.clone();\n csg.inverseInPlace();\n return csg;\n }\n /**\n * Inverses the CSG in place\n */\n inverseInPlace() {\n this._polygons.map((p) => {\n p.flip();\n });\n }\n /**\n * This is used to keep meshes transformations so they can be restored\n * when we build back a Babylon Mesh\n * NB : All CSG operations are performed in world coordinates\n * @param csg The CSG to copy the transform attributes from\n * @returns This CSG\n */\n copyTransformAttributes(csg) {\n this.matrix = csg.matrix;\n this.position = csg.position;\n this.rotation = csg.rotation;\n this.scaling = csg.scaling;\n this.rotationQuaternion = csg.rotationQuaternion;\n return this;\n }\n /**\n * Build vertex data from CSG\n * Coordinates here are in world space\n * @param onBeforePolygonProcessing called before each polygon is being processed\n * @param onAfterPolygonProcessing called after each polygon has been processed\n * @returns the final vertex data\n */\n toVertexData(onBeforePolygonProcessing = null, onAfterPolygonProcessing = null) {\n const matrix = this.matrix.clone();\n matrix.invert();\n const polygons = this._polygons;\n const vertices = [];\n const indices = [];\n const normals = [];\n let uvs = null;\n let vertColors = null;\n const vertex = Vector3.Zero();\n const normal = Vector3.Zero();\n const uv = Vector2.Zero();\n const vertColor = new Color4(0, 0, 0, 0);\n const polygonIndices = [0, 0, 0];\n const vertice_dict = {};\n let vertex_idx;\n for (let i = 0, il = polygons.length; i < il; i++) {\n const polygon = polygons[i];\n if (onBeforePolygonProcessing) {\n onBeforePolygonProcessing(polygon);\n }\n for (let j = 2, jl = polygon.vertices.length; j < jl; j++) {\n polygonIndices[0] = 0;\n polygonIndices[1] = j - 1;\n polygonIndices[2] = j;\n for (let k = 0; k < 3; k++) {\n vertex.copyFrom(polygon.vertices[polygonIndices[k]].pos);\n normal.copyFrom(polygon.vertices[polygonIndices[k]].normal);\n if (polygon.vertices[polygonIndices[k]].uv) {\n if (!uvs) {\n uvs = [];\n }\n uv.copyFrom(polygon.vertices[polygonIndices[k]].uv);\n }\n if (polygon.vertices[polygonIndices[k]].vertColor) {\n if (!vertColors) {\n vertColors = [];\n }\n vertColor.copyFrom(polygon.vertices[polygonIndices[k]].vertColor);\n }\n const localVertex = Vector3.TransformCoordinates(vertex, matrix);\n const localNormal = Vector3.TransformNormal(normal, matrix);\n vertex_idx = vertice_dict[localVertex.x + \",\" + localVertex.y + \",\" + localVertex.z];\n let areUvsDifferent = false;\n if (uvs && !(uvs[vertex_idx * 2] === uv.x || uvs[vertex_idx * 2 + 1] === uv.y)) {\n areUvsDifferent = true;\n }\n let areColorsDifferent = false;\n if (vertColors &&\n !(vertColors[vertex_idx * 4] === vertColor.r ||\n vertColors[vertex_idx * 4 + 1] === vertColor.g ||\n vertColors[vertex_idx * 4 + 2] === vertColor.b ||\n vertColors[vertex_idx * 4 + 3] === vertColor.a)) {\n areColorsDifferent = true;\n }\n // Check if 2 points can be merged\n if (!(typeof vertex_idx !== \"undefined\" &&\n normals[vertex_idx * 3] === localNormal.x &&\n normals[vertex_idx * 3 + 1] === localNormal.y &&\n normals[vertex_idx * 3 + 2] === localNormal.z) ||\n areUvsDifferent ||\n areColorsDifferent) {\n vertices.push(localVertex.x, localVertex.y, localVertex.z);\n if (uvs) {\n uvs.push(uv.x, uv.y);\n }\n normals.push(normal.x, normal.y, normal.z);\n if (vertColors) {\n vertColors.push(vertColor.r, vertColor.g, vertColor.b, vertColor.a);\n }\n vertex_idx = vertice_dict[localVertex.x + \",\" + localVertex.y + \",\" + localVertex.z] = vertices.length / 3 - 1;\n }\n indices.push(vertex_idx);\n if (onAfterPolygonProcessing) {\n onAfterPolygonProcessing();\n }\n }\n }\n }\n const result = new VertexData();\n result.positions = vertices;\n result.normals = normals;\n if (uvs) {\n result.uvs = uvs;\n }\n if (vertColors) {\n result.colors = vertColors;\n }\n result.indices = indices;\n return result;\n }\n /**\n * Build Raw mesh from CSG\n * Coordinates here are in world space\n * @param name The name of the mesh geometry\n * @param scene The Scene\n * @param keepSubMeshes Specifies if the submeshes should be kept\n * @returns A new Mesh\n */\n buildMeshGeometry(name, scene, keepSubMeshes) {\n const mesh = new Mesh(name, scene);\n const polygons = this._polygons;\n let currentIndex = 0;\n const subMeshDict = {};\n let subMeshObj;\n if (keepSubMeshes) {\n // Sort Polygons, since subMeshes are indices range\n polygons.sort((a, b) => {\n if (a.shared.meshId === b.shared.meshId) {\n return a.shared.subMeshId - b.shared.subMeshId;\n }\n else {\n return a.shared.meshId - b.shared.meshId;\n }\n });\n }\n const vertexData = this.toVertexData((polygon) => {\n // Building SubMeshes\n if (!subMeshDict[polygon.shared.meshId]) {\n subMeshDict[polygon.shared.meshId] = {};\n }\n if (!subMeshDict[polygon.shared.meshId][polygon.shared.subMeshId]) {\n subMeshDict[polygon.shared.meshId][polygon.shared.subMeshId] = {\n indexStart: +Infinity,\n indexEnd: -Infinity,\n materialIndex: polygon.shared.materialIndex,\n };\n }\n subMeshObj = subMeshDict[polygon.shared.meshId][polygon.shared.subMeshId];\n }, () => {\n subMeshObj.indexStart = Math.min(currentIndex, subMeshObj.indexStart);\n subMeshObj.indexEnd = Math.max(currentIndex, subMeshObj.indexEnd);\n currentIndex++;\n });\n vertexData.applyToMesh(mesh);\n if (keepSubMeshes) {\n // We offset the materialIndex by the previous number of materials in the CSG mixed meshes\n let materialIndexOffset = 0, materialMaxIndex;\n mesh.subMeshes = [];\n for (const m in subMeshDict) {\n materialMaxIndex = -1;\n for (const sm in subMeshDict[m]) {\n subMeshObj = subMeshDict[m][sm];\n SubMesh.CreateFromIndices(subMeshObj.materialIndex + materialIndexOffset, subMeshObj.indexStart, subMeshObj.indexEnd - subMeshObj.indexStart + 1, mesh);\n materialMaxIndex = Math.max(subMeshObj.materialIndex, materialMaxIndex);\n }\n materialIndexOffset += ++materialMaxIndex;\n }\n }\n return mesh;\n }\n /**\n * Build Mesh from CSG taking material and transforms into account\n * @param name The name of the Mesh\n * @param material The material of the Mesh\n * @param scene The Scene\n * @param keepSubMeshes Specifies if submeshes should be kept\n * @returns The new Mesh\n */\n toMesh(name, material = null, scene, keepSubMeshes) {\n const mesh = this.buildMeshGeometry(name, scene, keepSubMeshes);\n mesh.material = material;\n mesh.position.copyFrom(this.position);\n mesh.rotation.copyFrom(this.rotation);\n if (this.rotationQuaternion) {\n mesh.rotationQuaternion = this.rotationQuaternion.clone();\n }\n mesh.scaling.copyFrom(this.scaling);\n mesh.computeWorldMatrix(true);\n return mesh;\n }\n}\n"],"mappings":"AAAA,SAASA,UAAU,EAAEC,MAAM,EAAEC,OAAO,EAAEC,OAAO,QAAQ,yBAAyB;AAC9E,SAASC,YAAY,QAAQ,sBAAsB;AACnD,SAASC,OAAO,QAAQ,sBAAsB;AAC9C,SAASC,IAAI,QAAQ,mBAAmB;AACxC,SAASC,MAAM,QAAQ,wBAAwB;AAE/C,SAASC,UAAU,QAAQ,sBAAsB;AACjD;AACA;AACA;AACA,IAAIC,gBAAgB,GAAG,CAAC;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,MAAM,CAAC;EACT;AACJ;AACA;AACA;AACA;AACA;AACA;EACIC,WAAWA;EACX;AACJ;AACA;EACIC,GAAG;EACH;AACJ;AACA;EACIC,MAAM;EACN;AACJ;AACA;EACIC,EAAE;EACF;AACJ;AACA;EACIC,SAAS,EAAE;IACP,IAAI,CAACH,GAAG,GAAGA,GAAG;IACd,IAAI,CAACC,MAAM,GAAGA,MAAM;IACpB,IAAI,CAACC,EAAE,GAAGA,EAAE;IACZ,IAAI,CAACC,SAAS,GAAGA,SAAS;EAC9B;EACA;AACJ;AACA;AACA;EACIC,KAAKA,CAAA,EAAG;IAAA,IAAAC,QAAA,EAAAC,eAAA;IACJ,OAAO,IAAIR,MAAM,CAAC,IAAI,CAACE,GAAG,CAACI,KAAK,CAAC,CAAC,EAAE,IAAI,CAACH,MAAM,CAACG,KAAK,CAAC,CAAC,GAAAC,QAAA,GAAE,IAAI,CAACH,EAAE,cAAAG,QAAA,uBAAPA,QAAA,CAASD,KAAK,CAAC,CAAC,GAAAE,eAAA,GAAE,IAAI,CAACH,SAAS,cAAAG,eAAA,uBAAdA,eAAA,CAAgBF,KAAK,CAAC,CAAC,CAAC;EACvG;EACA;AACJ;AACA;AACA;EACIG,IAAIA,CAAA,EAAG;IACH,IAAI,CAACN,MAAM,GAAG,IAAI,CAACA,MAAM,CAACO,KAAK,CAAC,CAAC,CAAC,CAAC;EACvC;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACIC,WAAWA,CAACC,KAAK,EAAEC,CAAC,EAAE;IAClB,OAAO,IAAIb,MAAM,CAACR,OAAO,CAACsB,IAAI,CAAC,IAAI,CAACZ,GAAG,EAAEU,KAAK,CAACV,GAAG,EAAEW,CAAC,CAAC,EAAErB,OAAO,CAACsB,IAAI,CAAC,IAAI,CAACX,MAAM,EAAES,KAAK,CAACT,MAAM,EAAEU,CAAC,CAAC,EAAE,IAAI,CAACT,EAAE,IAAIQ,KAAK,CAACR,EAAE,GAAGX,OAAO,CAACqB,IAAI,CAAC,IAAI,CAACV,EAAE,EAAEQ,KAAK,CAACR,EAAE,EAAES,CAAC,CAAC,GAAGE,SAAS,EAAE,IAAI,CAACV,SAAS,IAAIO,KAAK,CAACP,SAAS,GAAGR,MAAM,CAACiB,IAAI,CAAC,IAAI,CAACT,SAAS,EAAEO,KAAK,CAACP,SAAS,EAAEQ,CAAC,CAAC,GAAGE,SAAS,CAAC;EAC9Q;AACJ;AACA;AACA;AACA;AACA,MAAMC,QAAQ,CAAC;EACX;AACJ;AACA;AACA;AACA;EACIf,WAAWA,CAACE,MAAM,EAAEc,CAAC,EAAE;IACnB,IAAI,CAACd,MAAM,GAAGA,MAAM;IACpB,IAAI,CAACc,CAAC,GAAGA,CAAC;EACd;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;EACI,OAAOC,UAAUA,CAACC,CAAC,EAAEC,CAAC,EAAEC,CAAC,EAAE;IACvB,MAAMC,EAAE,GAAGD,CAAC,CAACE,QAAQ,CAACJ,CAAC,CAAC;IACxB,MAAMK,EAAE,GAAGJ,CAAC,CAACG,QAAQ,CAACJ,CAAC,CAAC;IACxB,IAAIG,EAAE,CAACG,aAAa,CAAC,CAAC,KAAK,CAAC,IAAID,EAAE,CAACC,aAAa,CAAC,CAAC,KAAK,CAAC,EAAE;MACtD,OAAO,IAAI;IACf;IACA,MAAMC,CAAC,GAAGlC,OAAO,CAACmC,SAAS,CAACnC,OAAO,CAACoC,KAAK,CAACN,EAAE,EAAEE,EAAE,CAAC,CAAC;IAClD,OAAO,IAAIR,QAAQ,CAACU,CAAC,EAAElC,OAAO,CAACqC,GAAG,CAACH,CAAC,EAAEP,CAAC,CAAC,CAAC;EAC7C;EACA;AACJ;AACA;AACA;EACIb,KAAKA,CAAA,EAAG;IACJ,OAAO,IAAIU,QAAQ,CAAC,IAAI,CAACb,MAAM,CAACG,KAAK,CAAC,CAAC,EAAE,IAAI,CAACW,CAAC,CAAC;EACpD;EACA;AACJ;AACA;EACIR,IAAIA,CAAA,EAAG;IACH,IAAI,CAACN,MAAM,CAAC2B,YAAY,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,CAACb,CAAC,GAAG,CAAC,IAAI,CAACA,CAAC;EACpB;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACIc,YAAYA,CAACC,OAAO,EAAEC,aAAa,EAAEC,YAAY,EAAEC,KAAK,EAAEC,IAAI,EAAE;IAC5D,MAAMC,QAAQ,GAAG,CAAC;IAClB,MAAMC,KAAK,GAAG,CAAC;IACf,MAAMC,IAAI,GAAG,CAAC;IACd,MAAMC,QAAQ,GAAG,CAAC;IAClB;IACA;IACA,IAAIC,WAAW,GAAG,CAAC;IACnB,MAAMC,KAAK,GAAG,EAAE;IAChB,IAAIC,CAAC;IACL,IAAI9B,CAAC;IACL,KAAK8B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGX,OAAO,CAACY,QAAQ,CAACC,MAAM,EAAEF,CAAC,EAAE,EAAE;MAC1C9B,CAAC,GAAGrB,OAAO,CAACqC,GAAG,CAAC,IAAI,CAAC1B,MAAM,EAAE6B,OAAO,CAACY,QAAQ,CAACD,CAAC,CAAC,CAACzC,GAAG,CAAC,GAAG,IAAI,CAACe,CAAC;MAC9D,MAAM6B,IAAI,GAAGjC,CAAC,GAAG,CAACG,QAAQ,CAAC+B,OAAO,GAAGR,IAAI,GAAG1B,CAAC,GAAGG,QAAQ,CAAC+B,OAAO,GAAGT,KAAK,GAAGD,QAAQ;MACnFI,WAAW,IAAIK,IAAI;MACnBJ,KAAK,CAACM,IAAI,CAACF,IAAI,CAAC;IACpB;IACA;IACA,QAAQL,WAAW;MACf,KAAKJ,QAAQ;QACT,CAAC7C,OAAO,CAACqC,GAAG,CAAC,IAAI,CAAC1B,MAAM,EAAE6B,OAAO,CAACiB,KAAK,CAAC9C,MAAM,CAAC,GAAG,CAAC,GAAG8B,aAAa,GAAGC,YAAY,EAAEc,IAAI,CAAChB,OAAO,CAAC;QACjG;MACJ,KAAKM,KAAK;QACNH,KAAK,CAACa,IAAI,CAAChB,OAAO,CAAC;QACnB;MACJ,KAAKO,IAAI;QACLH,IAAI,CAACY,IAAI,CAAChB,OAAO,CAAC;QAClB;MACJ,KAAKQ,QAAQ;QAAE;UACX,MAAMU,CAAC,GAAG,EAAE;YAAE9B,CAAC,GAAG,EAAE;UACpB,KAAKuB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGX,OAAO,CAACY,QAAQ,CAACC,MAAM,EAAEF,CAAC,EAAE,EAAE;YAC1C,MAAMQ,CAAC,GAAG,CAACR,CAAC,GAAG,CAAC,IAAIX,OAAO,CAACY,QAAQ,CAACC,MAAM;YAC3C,MAAMO,EAAE,GAAGV,KAAK,CAACC,CAAC,CAAC;cAAEU,EAAE,GAAGX,KAAK,CAACS,CAAC,CAAC;YAClC,MAAMG,EAAE,GAAGtB,OAAO,CAACY,QAAQ,CAACD,CAAC,CAAC;cAAEY,EAAE,GAAGvB,OAAO,CAACY,QAAQ,CAACO,CAAC,CAAC;YACxD,IAAIC,EAAE,KAAKb,IAAI,EAAE;cACbW,CAAC,CAACF,IAAI,CAACM,EAAE,CAAC;YACd;YACA,IAAIF,EAAE,KAAKd,KAAK,EAAE;cACdlB,CAAC,CAAC4B,IAAI,CAACI,EAAE,KAAKb,IAAI,GAAGe,EAAE,CAAChD,KAAK,CAAC,CAAC,GAAGgD,EAAE,CAAC;YACzC;YACA,IAAI,CAACF,EAAE,GAAGC,EAAE,MAAMb,QAAQ,EAAE;cACxB3B,CAAC,GAAG,CAAC,IAAI,CAACI,CAAC,GAAGzB,OAAO,CAACqC,GAAG,CAAC,IAAI,CAAC1B,MAAM,EAAEmD,EAAE,CAACpD,GAAG,CAAC,IAAIV,OAAO,CAACqC,GAAG,CAAC,IAAI,CAAC1B,MAAM,EAAEoD,EAAE,CAACrD,GAAG,CAACqB,QAAQ,CAAC+B,EAAE,CAACpD,GAAG,CAAC,CAAC;cACnG,MAAMsD,CAAC,GAAGF,EAAE,CAAC3C,WAAW,CAAC4C,EAAE,EAAE1C,CAAC,CAAC;cAC/BqC,CAAC,CAACF,IAAI,CAACQ,CAAC,CAAC;cACTpC,CAAC,CAAC4B,IAAI,CAACQ,CAAC,CAAClD,KAAK,CAAC,CAAC,CAAC;YACrB;UACJ;UACA,IAAImD,IAAI;UACR,IAAIP,CAAC,CAACL,MAAM,IAAI,CAAC,EAAE;YACfY,IAAI,GAAG,IAAIC,UAAU,CAACR,CAAC,EAAElB,OAAO,CAAC2B,MAAM,CAAC;YACxC,IAAIF,IAAI,CAACR,KAAK,EAAE;cACZd,KAAK,CAACa,IAAI,CAACS,IAAI,CAAC;YACpB;UACJ;UACA,IAAIrC,CAAC,CAACyB,MAAM,IAAI,CAAC,EAAE;YACfY,IAAI,GAAG,IAAIC,UAAU,CAACtC,CAAC,EAAEY,OAAO,CAAC2B,MAAM,CAAC;YACxC,IAAIF,IAAI,CAACR,KAAK,EAAE;cACZb,IAAI,CAACY,IAAI,CAACS,IAAI,CAAC;YACnB;UACJ;UACA;QACJ;IACJ;EACJ;AACJ;AACA;AACA;AACA;AACA;AACAzC,QAAQ,CAAC+B,OAAO,GAAG,IAAI;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMW,UAAU,CAAC;EACb;AACJ;AACA;AACA;AACA;EACIzD,WAAWA,CAAC2C,QAAQ,EAAEe,MAAM,EAAE;IAC1B,IAAI,CAACf,QAAQ,GAAGA,QAAQ;IACxB,IAAI,CAACe,MAAM,GAAGA,MAAM;IACpB,IAAI,CAACV,KAAK,GAAGjC,QAAQ,CAACE,UAAU,CAAC0B,QAAQ,CAAC,CAAC,CAAC,CAAC1C,GAAG,EAAE0C,QAAQ,CAAC,CAAC,CAAC,CAAC1C,GAAG,EAAE0C,QAAQ,CAAC,CAAC,CAAC,CAAC1C,GAAG,CAAC;EACvF;EACA;AACJ;AACA;AACA;EACII,KAAKA,CAAA,EAAG;IACJ,MAAMsC,QAAQ,GAAG,IAAI,CAACA,QAAQ,CAACgB,GAAG,CAAEJ,CAAC,IAAKA,CAAC,CAAClD,KAAK,CAAC,CAAC,CAAC;IACpD,OAAO,IAAIoD,UAAU,CAACd,QAAQ,EAAE,IAAI,CAACe,MAAM,CAAC;EAChD;EACA;AACJ;AACA;EACIlD,IAAIA,CAAA,EAAG;IACH,IAAI,CAACmC,QAAQ,CAACiB,OAAO,CAAC,CAAC,CAACD,GAAG,CAAEJ,CAAC,IAAK;MAC/BA,CAAC,CAAC/C,IAAI,CAAC,CAAC;IACZ,CAAC,CAAC;IACF,IAAI,CAACwC,KAAK,CAACxC,IAAI,CAAC,CAAC;EACrB;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMqD,IAAI,CAAC;EACP;AACJ;AACA;AACA;EACI7D,WAAWA,CAAC8D,QAAQ,EAAE;IAClB,IAAI,CAACC,MAAM,GAAG,IAAI;IAClB,IAAI,CAACC,MAAM,GAAG,IAAI;IAClB,IAAI,CAACC,KAAK,GAAG,IAAI;IACjB,IAAI,CAACC,SAAS,GAAG,IAAIC,KAAK,CAAC,CAAC;IAC5B,IAAIL,QAAQ,EAAE;MACV,IAAI,CAACM,KAAK,CAACN,QAAQ,CAAC;IACxB;EACJ;EACA;AACJ;AACA;AACA;EACIzD,KAAKA,CAAA,EAAG;IACJ,MAAMgE,IAAI,GAAG,IAAIR,IAAI,CAAC,CAAC;IACvBQ,IAAI,CAACN,MAAM,GAAG,IAAI,CAACA,MAAM,IAAI,IAAI,CAACA,MAAM,CAAC1D,KAAK,CAAC,CAAC;IAChDgE,IAAI,CAACL,MAAM,GAAG,IAAI,CAACA,MAAM,IAAI,IAAI,CAACA,MAAM,CAAC3D,KAAK,CAAC,CAAC;IAChDgE,IAAI,CAACJ,KAAK,GAAG,IAAI,CAACA,KAAK,IAAI,IAAI,CAACA,KAAK,CAAC5D,KAAK,CAAC,CAAC;IAC7CgE,IAAI,CAACH,SAAS,GAAG,IAAI,CAACA,SAAS,CAACP,GAAG,CAAEW,CAAC,IAAKA,CAAC,CAACjE,KAAK,CAAC,CAAC,CAAC;IACrD,OAAOgE,IAAI;EACf;EACA;AACJ;AACA;EACIE,MAAMA,CAAA,EAAG;IACL,KAAK,IAAI7B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,IAAI,CAACwB,SAAS,CAACtB,MAAM,EAAEF,CAAC,EAAE,EAAE;MAC5C,IAAI,CAACwB,SAAS,CAACxB,CAAC,CAAC,CAAClC,IAAI,CAAC,CAAC;IAC5B;IACA,IAAI,IAAI,CAACuD,MAAM,EAAE;MACb,IAAI,CAACA,MAAM,CAACvD,IAAI,CAAC,CAAC;IACtB;IACA,IAAI,IAAI,CAACwD,MAAM,EAAE;MACb,IAAI,CAACA,MAAM,CAACO,MAAM,CAAC,CAAC;IACxB;IACA,IAAI,IAAI,CAACN,KAAK,EAAE;MACZ,IAAI,CAACA,KAAK,CAACM,MAAM,CAAC,CAAC;IACvB;IACA,MAAMC,IAAI,GAAG,IAAI,CAACR,MAAM;IACxB,IAAI,CAACA,MAAM,GAAG,IAAI,CAACC,KAAK;IACxB,IAAI,CAACA,KAAK,GAAGO,IAAI;EACrB;EACA;AACJ;AACA;AACA;AACA;AACA;EACIC,YAAYA,CAACX,QAAQ,EAAE;IACnB,IAAI,CAAC,IAAI,CAACC,MAAM,EAAE;MACd,OAAOD,QAAQ,CAACY,KAAK,CAAC,CAAC;IAC3B;IACA,IAAIxC,KAAK,GAAG,EAAE;MAAEC,IAAI,GAAG,EAAE;IACzB,KAAK,IAAIO,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoB,QAAQ,CAAClB,MAAM,EAAEF,CAAC,EAAE,EAAE;MACtC,IAAI,CAACqB,MAAM,CAACjC,YAAY,CAACgC,QAAQ,CAACpB,CAAC,CAAC,EAAER,KAAK,EAAEC,IAAI,EAAED,KAAK,EAAEC,IAAI,CAAC;IACnE;IACA,IAAI,IAAI,CAAC6B,MAAM,EAAE;MACb9B,KAAK,GAAG,IAAI,CAAC8B,MAAM,CAACS,YAAY,CAACvC,KAAK,CAAC;IAC3C;IACA,IAAI,IAAI,CAAC+B,KAAK,EAAE;MACZ9B,IAAI,GAAG,IAAI,CAAC8B,KAAK,CAACQ,YAAY,CAACtC,IAAI,CAAC;IACxC,CAAC,MACI;MACDA,IAAI,GAAG,EAAE;IACb;IACA,OAAOD,KAAK,CAACyC,MAAM,CAACxC,IAAI,CAAC;EAC7B;EACA;AACJ;AACA;AACA;AACA;EACIyC,MAAMA,CAACC,GAAG,EAAE;IACR,IAAI,CAACX,SAAS,GAAGW,GAAG,CAACJ,YAAY,CAAC,IAAI,CAACP,SAAS,CAAC;IACjD,IAAI,IAAI,CAACF,MAAM,EAAE;MACb,IAAI,CAACA,MAAM,CAACY,MAAM,CAACC,GAAG,CAAC;IAC3B;IACA,IAAI,IAAI,CAACZ,KAAK,EAAE;MACZ,IAAI,CAACA,KAAK,CAACW,MAAM,CAACC,GAAG,CAAC;IAC1B;EACJ;EACA;AACJ;AACA;AACA;EACIC,WAAWA,CAAA,EAAG;IACV,IAAIhB,QAAQ,GAAG,IAAI,CAACI,SAAS,CAACQ,KAAK,CAAC,CAAC;IACrC,IAAI,IAAI,CAACV,MAAM,EAAE;MACbF,QAAQ,GAAGA,QAAQ,CAACa,MAAM,CAAC,IAAI,CAACX,MAAM,CAACc,WAAW,CAAC,CAAC,CAAC;IACzD;IACA,IAAI,IAAI,CAACb,KAAK,EAAE;MACZH,QAAQ,GAAGA,QAAQ,CAACa,MAAM,CAAC,IAAI,CAACV,KAAK,CAACa,WAAW,CAAC,CAAC,CAAC;IACxD;IACA,OAAOhB,QAAQ;EACnB;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;EACIM,KAAKA,CAACN,QAAQ,EAAE;IACZ,IAAI,CAACA,QAAQ,CAAClB,MAAM,EAAE;MAClB;IACJ;IACA,IAAI,CAAC,IAAI,CAACmB,MAAM,EAAE;MACd,IAAI,CAACA,MAAM,GAAGD,QAAQ,CAAC,CAAC,CAAC,CAACd,KAAK,CAAC3C,KAAK,CAAC,CAAC;IAC3C;IACA,MAAM6B,KAAK,GAAG,EAAE;MAAEC,IAAI,GAAG,EAAE;IAC3B,KAAK,IAAIO,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoB,QAAQ,CAAClB,MAAM,EAAEF,CAAC,EAAE,EAAE;MACtC,IAAI,CAACqB,MAAM,CAACjC,YAAY,CAACgC,QAAQ,CAACpB,CAAC,CAAC,EAAE,IAAI,CAACwB,SAAS,EAAE,IAAI,CAACA,SAAS,EAAEhC,KAAK,EAAEC,IAAI,CAAC;IACtF;IACA,IAAID,KAAK,CAACU,MAAM,EAAE;MACd,IAAI,CAAC,IAAI,CAACoB,MAAM,EAAE;QACd,IAAI,CAACA,MAAM,GAAG,IAAIH,IAAI,CAAC,CAAC;MAC5B;MACA,IAAI,CAACG,MAAM,CAACI,KAAK,CAAClC,KAAK,CAAC;IAC5B;IACA,IAAIC,IAAI,CAACS,MAAM,EAAE;MACb,IAAI,CAAC,IAAI,CAACqB,KAAK,EAAE;QACb,IAAI,CAACA,KAAK,GAAG,IAAIJ,IAAI,CAAC,CAAC;MAC3B;MACA,IAAI,CAACI,KAAK,CAACG,KAAK,CAACjC,IAAI,CAAC;IAC1B;EACJ;AACJ;AACA;AACA;AACA;AACA;AACA,OAAO,MAAM4C,GAAG,CAAC;EACb/E,WAAWA,CAAA,EAAG;IACV,IAAI,CAACkE,SAAS,GAAG,IAAIC,KAAK,CAAC,CAAC;EAChC;EACA;AACJ;AACA;AACA;AACA;EACI,OAAOa,cAAcA,CAACC,IAAI,EAAE;IACxB,IAAIC,MAAM,EAAEnD,OAAO,EAAEY,QAAQ;IAC7B,MAAMmB,QAAQ,GAAG,EAAE;IACnB,MAAMqB,OAAO,GAAGF,IAAI,CAACE,OAAO;IAC5B,MAAMC,SAAS,GAAGH,IAAI,CAACG,SAAS;IAChC,MAAMC,OAAO,GAAGJ,IAAI,CAACI,OAAO;IAC5B,MAAMC,GAAG,GAAGL,IAAI,CAACK,GAAG;IACpB,MAAMC,UAAU,GAAGN,IAAI,CAACO,MAAM;IAC9B,IAAI,CAACL,OAAO,IAAI,CAACC,SAAS,EAAE;MACxB;MACA,MAAM,qEAAqE;IAC/E;IACA,KAAK,IAAI1C,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGyC,OAAO,CAACvC,MAAM,EAAEF,CAAC,IAAI,CAAC,EAAE;MACxCC,QAAQ,GAAG,EAAE;MACb,KAAK,IAAIO,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAAE;QACxB,MAAMuC,YAAY,GAAG/C,CAAC,GAAGQ,CAAC;QAC1B,MAAMwC,MAAM,GAAGP,OAAO,CAACM,YAAY,CAAC;QACpC,MAAMvF,MAAM,GAAGmF,OAAO,GAAG9F,OAAO,CAACoG,SAAS,CAACN,OAAO,EAAEK,MAAM,GAAG,CAAC,CAAC,GAAGnG,OAAO,CAACqG,IAAI,CAAC,CAAC;QAChF,MAAMzF,EAAE,GAAGmF,GAAG,GAAG9F,OAAO,CAACmG,SAAS,CAACL,GAAG,EAAEI,MAAM,GAAG,CAAC,CAAC,GAAG5E,SAAS;QAC/D,MAAMV,SAAS,GAAGmF,UAAU,GAAG3F,MAAM,CAAC+F,SAAS,CAACJ,UAAU,EAAEG,MAAM,GAAG,CAAC,CAAC,GAAG5E,SAAS;QACnF,MAAM+E,QAAQ,GAAGtG,OAAO,CAACoG,SAAS,CAACP,SAAS,EAAEM,MAAM,GAAG,CAAC,CAAC;QACzDR,MAAM,GAAG,IAAInF,MAAM,CAAC8F,QAAQ,EAAE3F,MAAM,EAAEC,EAAE,EAAEC,SAAS,CAAC;QACpDuC,QAAQ,CAACI,IAAI,CAACmC,MAAM,CAAC;MACzB;MACAnD,OAAO,GAAG,IAAI0B,UAAU,CAACd,QAAQ,EAAE;QAAEmD,SAAS,EAAE,CAAC;QAAEC,MAAM,EAAEjG,gBAAgB;QAAEkG,aAAa,EAAE;MAAE,CAAC,CAAC;MAChG;MACA;MACA,IAAIjE,OAAO,CAACiB,KAAK,EAAE;QACfc,QAAQ,CAACf,IAAI,CAAChB,OAAO,CAAC;MAC1B;IACJ;IACA,MAAMkE,GAAG,GAAGlB,GAAG,CAACmB,aAAa,CAACpC,QAAQ,CAAC;IACvCmC,GAAG,CAACE,MAAM,GAAG7G,MAAM,CAAC8G,QAAQ,CAAC,CAAC;IAC9BH,GAAG,CAACJ,QAAQ,GAAGtG,OAAO,CAACqG,IAAI,CAAC,CAAC;IAC7BK,GAAG,CAACI,QAAQ,GAAG9G,OAAO,CAACqG,IAAI,CAAC,CAAC;IAC7BK,GAAG,CAACK,OAAO,GAAG/G,OAAO,CAACgH,GAAG,CAAC,CAAC;IAC3BN,GAAG,CAACO,kBAAkB,GAAGnH,UAAU,CAAC+G,QAAQ,CAAC,CAAC;IAC9CtG,gBAAgB,EAAE;IAClB,OAAOmG,GAAG;EACd;EACA;AACJ;AACA;AACA;AACA;AACA;EACI,OAAOQ,QAAQA,CAACC,IAAI,EAAEC,QAAQ,GAAG,KAAK,EAAE;IACpC,IAAIzB,MAAM;MAAEhF,MAAM;MAAEC,EAAE,GAAGW,SAAS;MAAE+E,QAAQ;MAAEzF,SAAS,GAAGU,SAAS;MAAEiB,OAAO;MAAEY,QAAQ;IACtF,MAAMmB,QAAQ,GAAG,EAAE;IACnB,IAAIqC,MAAM;MAAES,YAAY;MAAEC,YAAY;MAAEC,sBAAsB,GAAG,IAAI;MAAEC,WAAW;IAClF,IAAIC,aAAa,GAAG,KAAK;IACzB,IAAIN,IAAI,YAAY/G,IAAI,EAAE;MACtB+G,IAAI,CAACO,kBAAkB,CAAC,IAAI,CAAC;MAC7Bd,MAAM,GAAGO,IAAI,CAACQ,cAAc,CAAC,CAAC;MAC9BN,YAAY,GAAGF,IAAI,CAACb,QAAQ,CAACxF,KAAK,CAAC,CAAC;MACpCwG,YAAY,GAAGH,IAAI,CAACL,QAAQ,CAAChG,KAAK,CAAC,CAAC;MACpC,IAAIqG,IAAI,CAACF,kBAAkB,EAAE;QACzBM,sBAAsB,GAAGJ,IAAI,CAACF,kBAAkB,CAACnG,KAAK,CAAC,CAAC;MAC5D;MACA0G,WAAW,GAAGL,IAAI,CAACJ,OAAO,CAACjG,KAAK,CAAC,CAAC;MAClC,IAAIqG,IAAI,CAACS,QAAQ,IAAIR,QAAQ,EAAE;QAC3BK,aAAa,GAAGN,IAAI,CAACS,QAAQ,CAACC,eAAe,KAAK,CAAC;MACvD;IACJ,CAAC,MACI;MACD;MACA,MAAM,oDAAoD;IAC9D;IACA,MAAMjC,OAAO,GAAGuB,IAAI,CAACW,UAAU,CAAC,CAAC;MAAEjC,SAAS,GAAGsB,IAAI,CAACY,eAAe,CAAC7H,YAAY,CAAC8H,YAAY,CAAC;MAAElC,OAAO,GAAGqB,IAAI,CAACY,eAAe,CAAC7H,YAAY,CAAC+H,UAAU,CAAC;MAAElC,GAAG,GAAGoB,IAAI,CAACY,eAAe,CAAC7H,YAAY,CAACgI,MAAM,CAAC;MAAElC,UAAU,GAAGmB,IAAI,CAACY,eAAe,CAAC7H,YAAY,CAACiI,SAAS,CAAC;IACnQ,IAAIvC,OAAO,KAAK,IAAI,EAAE;MAClB;MACA,MAAM,kCAAkC;IAC5C;IACA,IAAIC,SAAS,KAAK,IAAI,EAAE;MACpB;MACA,MAAM,oCAAoC;IAC9C;IACA,IAAIC,OAAO,KAAK,IAAI,EAAE;MAClB;MACA,MAAM,kCAAkC;IAC5C;IACA,MAAMsC,SAAS,GAAGjB,IAAI,CAACiB,SAAS;IAChC,KAAK,IAAIC,EAAE,GAAG,CAAC,EAAEC,GAAG,GAAGF,SAAS,CAAC/E,MAAM,EAAEgF,EAAE,GAAGC,GAAG,EAAED,EAAE,EAAE,EAAE;MACrD,KAAK,IAAIlF,CAAC,GAAGiF,SAAS,CAACC,EAAE,CAAC,CAACE,UAAU,EAAEC,EAAE,GAAGJ,SAAS,CAACC,EAAE,CAAC,CAACI,UAAU,GAAGL,SAAS,CAACC,EAAE,CAAC,CAACE,UAAU,EAAEpF,CAAC,GAAGqF,EAAE,EAAErF,CAAC,IAAI,CAAC,EAAE;QAC7GC,QAAQ,GAAG,EAAE;QACb,KAAK,IAAIO,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAAE;UACxB,MAAMuC,YAAY,GAAGvC,CAAC,KAAK,CAAC,GAAGR,CAAC,GAAGQ,CAAC,GAAG8D,aAAa,GAAGtE,CAAC,GAAG,CAAC,GAAGQ,CAAC,GAAGR,CAAC,GAAGQ,CAAC;UACxE,MAAM+E,YAAY,GAAG,IAAI1I,OAAO,CAAC8F,OAAO,CAACF,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,CAAC,EAAEJ,OAAO,CAACF,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAEJ,OAAO,CAACF,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;UACpJ,IAAIH,GAAG,EAAE;YACLnF,EAAE,GAAG,IAAIX,OAAO,CAAC8F,GAAG,CAACH,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,CAAC,EAAEH,GAAG,CAACH,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;UACxF;UACA,IAAIF,UAAU,EAAE;YACZnF,SAAS,GAAG,IAAIR,MAAM,CAAC2F,UAAU,CAACJ,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,CAAC,EAAEF,UAAU,CAACJ,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAEF,UAAU,CAACJ,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAEF,UAAU,CAACJ,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;UAClM;UACA,MAAMyC,cAAc,GAAG,IAAI3I,OAAO,CAAC6F,SAAS,CAACD,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,CAAC,EAAEL,SAAS,CAACD,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAEL,SAAS,CAACD,OAAO,CAACM,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;UAC5JI,QAAQ,GAAGtG,OAAO,CAAC4I,oBAAoB,CAACD,cAAc,EAAE/B,MAAM,CAAC;UAC/DjG,MAAM,GAAGX,OAAO,CAAC6I,eAAe,CAACH,YAAY,EAAE9B,MAAM,CAAC;UACtDjB,MAAM,GAAG,IAAInF,MAAM,CAAC8F,QAAQ,EAAE3F,MAAM,EAAEC,EAAE,EAAEC,SAAS,CAAC;UACpDuC,QAAQ,CAACI,IAAI,CAACmC,MAAM,CAAC;QACzB;QACAnD,OAAO,GAAG,IAAI0B,UAAU,CAACd,QAAQ,EAAE;UAAEmD,SAAS,EAAE8B,EAAE;UAAE7B,MAAM,EAAEjG,gBAAgB;UAAEkG,aAAa,EAAE2B,SAAS,CAACC,EAAE,CAAC,CAAC5B;QAAc,CAAC,CAAC;QAC3H;QACA;QACA,IAAIjE,OAAO,CAACiB,KAAK,EAAE;UACfc,QAAQ,CAACf,IAAI,CAAChB,OAAO,CAAC;QAC1B;MACJ;IACJ;IACA,MAAMkE,GAAG,GAAGlB,GAAG,CAACmB,aAAa,CAACpC,QAAQ,CAAC;IACvCmC,GAAG,CAACE,MAAM,GAAGQ,QAAQ,GAAGrH,MAAM,CAAC8G,QAAQ,CAAC,CAAC,GAAGD,MAAM;IAClDF,GAAG,CAACJ,QAAQ,GAAGc,QAAQ,GAAGpH,OAAO,CAACqG,IAAI,CAAC,CAAC,GAAGgB,YAAY;IACvDX,GAAG,CAACI,QAAQ,GAAGM,QAAQ,GAAGpH,OAAO,CAACqG,IAAI,CAAC,CAAC,GAAGiB,YAAY;IACvDZ,GAAG,CAACK,OAAO,GAAGK,QAAQ,GAAGpH,OAAO,CAACgH,GAAG,CAAC,CAAC,GAAGQ,WAAW;IACpDd,GAAG,CAACO,kBAAkB,GAAGG,QAAQ,IAAIG,sBAAsB,GAAGzH,UAAU,CAAC+G,QAAQ,CAAC,CAAC,GAAGU,sBAAsB;IAC5GhH,gBAAgB,EAAE;IAClB,OAAOmG,GAAG;EACd;EACA;AACJ;AACA;AACA;AACA;EACI,OAAOC,aAAaA,CAACpC,QAAQ,EAAE;IAC3B,MAAMmC,GAAG,GAAG,IAAIlB,GAAG,CAAC,CAAC;IACrBkB,GAAG,CAAC/B,SAAS,GAAGJ,QAAQ;IACxB,OAAOmC,GAAG;EACd;EACA;AACJ;AACA;AACA;EACI5F,KAAKA,CAAA,EAAG;IACJ,MAAM4F,GAAG,GAAG,IAAIlB,GAAG,CAAC,CAAC;IACrBkB,GAAG,CAAC/B,SAAS,GAAG,IAAI,CAACA,SAAS,CAACP,GAAG,CAAEW,CAAC,IAAKA,CAAC,CAACjE,KAAK,CAAC,CAAC,CAAC;IACpD4F,GAAG,CAACoC,uBAAuB,CAAC,IAAI,CAAC;IACjC,OAAOpC,GAAG;EACd;EACA;AACJ;AACA;AACA;AACA;EACIqC,KAAKA,CAACrC,GAAG,EAAE;IACP,MAAM/E,CAAC,GAAG,IAAI2C,IAAI,CAAC,IAAI,CAACxD,KAAK,CAAC,CAAC,CAAC6D,SAAS,CAAC;IAC1C,MAAM/C,CAAC,GAAG,IAAI0C,IAAI,CAACoC,GAAG,CAAC5F,KAAK,CAAC,CAAC,CAAC6D,SAAS,CAAC;IACzChD,CAAC,CAAC0D,MAAM,CAACzD,CAAC,CAAC;IACXA,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVpD,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVrD,CAAC,CAACkD,KAAK,CAACjD,CAAC,CAAC2D,WAAW,CAAC,CAAC,CAAC;IACxB,OAAOC,GAAG,CAACmB,aAAa,CAAChF,CAAC,CAAC4D,WAAW,CAAC,CAAC,CAAC,CAACuD,uBAAuB,CAAC,IAAI,CAAC;EAC3E;EACA;AACJ;AACA;AACA;EACIE,YAAYA,CAACtC,GAAG,EAAE;IACd,MAAM/E,CAAC,GAAG,IAAI2C,IAAI,CAAC,IAAI,CAACK,SAAS,CAAC;IAClC,MAAM/C,CAAC,GAAG,IAAI0C,IAAI,CAACoC,GAAG,CAAC/B,SAAS,CAAC;IACjChD,CAAC,CAAC0D,MAAM,CAACzD,CAAC,CAAC;IACXA,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVpD,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVrD,CAAC,CAACkD,KAAK,CAACjD,CAAC,CAAC2D,WAAW,CAAC,CAAC,CAAC;IACxB,IAAI,CAACZ,SAAS,GAAGhD,CAAC,CAAC4D,WAAW,CAAC,CAAC;EACpC;EACA;AACJ;AACA;AACA;AACA;EACIxD,QAAQA,CAAC2E,GAAG,EAAE;IACV,MAAM/E,CAAC,GAAG,IAAI2C,IAAI,CAAC,IAAI,CAACxD,KAAK,CAAC,CAAC,CAAC6D,SAAS,CAAC;IAC1C,MAAM/C,CAAC,GAAG,IAAI0C,IAAI,CAACoC,GAAG,CAAC5F,KAAK,CAAC,CAAC,CAAC6D,SAAS,CAAC;IACzChD,CAAC,CAACqD,MAAM,CAAC,CAAC;IACVrD,CAAC,CAAC0D,MAAM,CAACzD,CAAC,CAAC;IACXA,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVpD,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVrD,CAAC,CAACkD,KAAK,CAACjD,CAAC,CAAC2D,WAAW,CAAC,CAAC,CAAC;IACxB5D,CAAC,CAACqD,MAAM,CAAC,CAAC;IACV,OAAOQ,GAAG,CAACmB,aAAa,CAAChF,CAAC,CAAC4D,WAAW,CAAC,CAAC,CAAC,CAACuD,uBAAuB,CAAC,IAAI,CAAC;EAC3E;EACA;AACJ;AACA;AACA;EACIG,eAAeA,CAACvC,GAAG,EAAE;IACjB,MAAM/E,CAAC,GAAG,IAAI2C,IAAI,CAAC,IAAI,CAACK,SAAS,CAAC;IAClC,MAAM/C,CAAC,GAAG,IAAI0C,IAAI,CAACoC,GAAG,CAAC/B,SAAS,CAAC;IACjChD,CAAC,CAACqD,MAAM,CAAC,CAAC;IACVrD,CAAC,CAAC0D,MAAM,CAACzD,CAAC,CAAC;IACXA,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVpD,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVrD,CAAC,CAACkD,KAAK,CAACjD,CAAC,CAAC2D,WAAW,CAAC,CAAC,CAAC;IACxB5D,CAAC,CAACqD,MAAM,CAAC,CAAC;IACV,IAAI,CAACL,SAAS,GAAGhD,CAAC,CAAC4D,WAAW,CAAC,CAAC;EACpC;EACA;AACJ;AACA;AACA;AACA;EACI2D,SAASA,CAACxC,GAAG,EAAE;IACX,MAAM/E,CAAC,GAAG,IAAI2C,IAAI,CAAC,IAAI,CAACxD,KAAK,CAAC,CAAC,CAAC6D,SAAS,CAAC;IAC1C,MAAM/C,CAAC,GAAG,IAAI0C,IAAI,CAACoC,GAAG,CAAC5F,KAAK,CAAC,CAAC,CAAC6D,SAAS,CAAC;IACzChD,CAAC,CAACqD,MAAM,CAAC,CAAC;IACVpD,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVrD,CAAC,CAAC0D,MAAM,CAACzD,CAAC,CAAC;IACXA,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXA,CAAC,CAACkD,KAAK,CAACjD,CAAC,CAAC2D,WAAW,CAAC,CAAC,CAAC;IACxB5D,CAAC,CAACqD,MAAM,CAAC,CAAC;IACV,OAAOQ,GAAG,CAACmB,aAAa,CAAChF,CAAC,CAAC4D,WAAW,CAAC,CAAC,CAAC,CAACuD,uBAAuB,CAAC,IAAI,CAAC;EAC3E;EACA;AACJ;AACA;AACA;EACIK,gBAAgBA,CAACzC,GAAG,EAAE;IAClB,MAAM/E,CAAC,GAAG,IAAI2C,IAAI,CAAC,IAAI,CAACK,SAAS,CAAC;IAClC,MAAM/C,CAAC,GAAG,IAAI0C,IAAI,CAACoC,GAAG,CAAC/B,SAAS,CAAC;IACjChD,CAAC,CAACqD,MAAM,CAAC,CAAC;IACVpD,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXC,CAAC,CAACoD,MAAM,CAAC,CAAC;IACVrD,CAAC,CAAC0D,MAAM,CAACzD,CAAC,CAAC;IACXA,CAAC,CAACyD,MAAM,CAAC1D,CAAC,CAAC;IACXA,CAAC,CAACkD,KAAK,CAACjD,CAAC,CAAC2D,WAAW,CAAC,CAAC,CAAC;IACxB5D,CAAC,CAACqD,MAAM,CAAC,CAAC;IACV,IAAI,CAACL,SAAS,GAAGhD,CAAC,CAAC4D,WAAW,CAAC,CAAC;EACpC;EACA;AACJ;AACA;AACA;AACA;EACI6D,OAAOA,CAAA,EAAG;IACN,MAAM1C,GAAG,GAAG,IAAI,CAAC5F,KAAK,CAAC,CAAC;IACxB4F,GAAG,CAAC2C,cAAc,CAAC,CAAC;IACpB,OAAO3C,GAAG;EACd;EACA;AACJ;AACA;EACI2C,cAAcA,CAAA,EAAG;IACb,IAAI,CAAC1E,SAAS,CAACP,GAAG,CAAEW,CAAC,IAAK;MACtBA,CAAC,CAAC9D,IAAI,CAAC,CAAC;IACZ,CAAC,CAAC;EACN;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;EACI6H,uBAAuBA,CAACpC,GAAG,EAAE;IACzB,IAAI,CAACE,MAAM,GAAGF,GAAG,CAACE,MAAM;IACxB,IAAI,CAACN,QAAQ,GAAGI,GAAG,CAACJ,QAAQ;IAC5B,IAAI,CAACQ,QAAQ,GAAGJ,GAAG,CAACI,QAAQ;IAC5B,IAAI,CAACC,OAAO,GAAGL,GAAG,CAACK,OAAO;IAC1B,IAAI,CAACE,kBAAkB,GAAGP,GAAG,CAACO,kBAAkB;IAChD,OAAO,IAAI;EACf;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;EACIqC,YAAYA,CAACC,yBAAyB,GAAG,IAAI,EAAEC,wBAAwB,GAAG,IAAI,EAAE;IAC5E,MAAM5C,MAAM,GAAG,IAAI,CAACA,MAAM,CAAC9F,KAAK,CAAC,CAAC;IAClC8F,MAAM,CAAC5B,MAAM,CAAC,CAAC;IACf,MAAMT,QAAQ,GAAG,IAAI,CAACI,SAAS;IAC/B,MAAMvB,QAAQ,GAAG,EAAE;IACnB,MAAMwC,OAAO,GAAG,EAAE;IAClB,MAAME,OAAO,GAAG,EAAE;IAClB,IAAIC,GAAG,GAAG,IAAI;IACd,IAAIC,UAAU,GAAG,IAAI;IACrB,MAAML,MAAM,GAAG3F,OAAO,CAACqG,IAAI,CAAC,CAAC;IAC7B,MAAM1F,MAAM,GAAGX,OAAO,CAACqG,IAAI,CAAC,CAAC;IAC7B,MAAMzF,EAAE,GAAGX,OAAO,CAACoG,IAAI,CAAC,CAAC;IACzB,MAAMxF,SAAS,GAAG,IAAIR,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACxC,MAAMoJ,cAAc,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAChC,MAAMC,YAAY,GAAG,CAAC,CAAC;IACvB,IAAIC,UAAU;IACd,KAAK,IAAIxG,CAAC,GAAG,CAAC,EAAEqF,EAAE,GAAGjE,QAAQ,CAAClB,MAAM,EAAEF,CAAC,GAAGqF,EAAE,EAAErF,CAAC,EAAE,EAAE;MAC/C,MAAMX,OAAO,GAAG+B,QAAQ,CAACpB,CAAC,CAAC;MAC3B,IAAIoG,yBAAyB,EAAE;QAC3BA,yBAAyB,CAAC/G,OAAO,CAAC;MACtC;MACA,KAAK,IAAImB,CAAC,GAAG,CAAC,EAAEiG,EAAE,GAAGpH,OAAO,CAACY,QAAQ,CAACC,MAAM,EAAEM,CAAC,GAAGiG,EAAE,EAAEjG,CAAC,EAAE,EAAE;QACvD8F,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC;QACrBA,cAAc,CAAC,CAAC,CAAC,GAAG9F,CAAC,GAAG,CAAC;QACzB8F,cAAc,CAAC,CAAC,CAAC,GAAG9F,CAAC;QACrB,KAAK,IAAIkG,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAAE;UACxBlE,MAAM,CAACmE,QAAQ,CAACtH,OAAO,CAACY,QAAQ,CAACqG,cAAc,CAACI,CAAC,CAAC,CAAC,CAACnJ,GAAG,CAAC;UACxDC,MAAM,CAACmJ,QAAQ,CAACtH,OAAO,CAACY,QAAQ,CAACqG,cAAc,CAACI,CAAC,CAAC,CAAC,CAAClJ,MAAM,CAAC;UAC3D,IAAI6B,OAAO,CAACY,QAAQ,CAACqG,cAAc,CAACI,CAAC,CAAC,CAAC,CAACjJ,EAAE,EAAE;YACxC,IAAI,CAACmF,GAAG,EAAE;cACNA,GAAG,GAAG,EAAE;YACZ;YACAnF,EAAE,CAACkJ,QAAQ,CAACtH,OAAO,CAACY,QAAQ,CAACqG,cAAc,CAACI,CAAC,CAAC,CAAC,CAACjJ,EAAE,CAAC;UACvD;UACA,IAAI4B,OAAO,CAACY,QAAQ,CAACqG,cAAc,CAACI,CAAC,CAAC,CAAC,CAAChJ,SAAS,EAAE;YAC/C,IAAI,CAACmF,UAAU,EAAE;cACbA,UAAU,GAAG,EAAE;YACnB;YACAnF,SAAS,CAACiJ,QAAQ,CAACtH,OAAO,CAACY,QAAQ,CAACqG,cAAc,CAACI,CAAC,CAAC,CAAC,CAAChJ,SAAS,CAAC;UACrE;UACA,MAAMkJ,WAAW,GAAG/J,OAAO,CAAC4I,oBAAoB,CAACjD,MAAM,EAAEiB,MAAM,CAAC;UAChE,MAAMoD,WAAW,GAAGhK,OAAO,CAAC6I,eAAe,CAAClI,MAAM,EAAEiG,MAAM,CAAC;UAC3D+C,UAAU,GAAGD,YAAY,CAACK,WAAW,CAACE,CAAC,GAAG,GAAG,GAAGF,WAAW,CAACG,CAAC,GAAG,GAAG,GAAGH,WAAW,CAACI,CAAC,CAAC;UACpF,IAAIC,eAAe,GAAG,KAAK;UAC3B,IAAIrE,GAAG,IAAI,EAAEA,GAAG,CAAC4D,UAAU,GAAG,CAAC,CAAC,KAAK/I,EAAE,CAACqJ,CAAC,IAAIlE,GAAG,CAAC4D,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK/I,EAAE,CAACsJ,CAAC,CAAC,EAAE;YAC5EE,eAAe,GAAG,IAAI;UAC1B;UACA,IAAIC,kBAAkB,GAAG,KAAK;UAC9B,IAAIrE,UAAU,IACV,EAAEA,UAAU,CAAC2D,UAAU,GAAG,CAAC,CAAC,KAAK9I,SAAS,CAACyJ,CAAC,IACxCtE,UAAU,CAAC2D,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK9I,SAAS,CAAC0J,CAAC,IAC9CvE,UAAU,CAAC2D,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK9I,SAAS,CAACe,CAAC,IAC9CoE,UAAU,CAAC2D,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK9I,SAAS,CAACc,CAAC,CAAC,EAAE;YACrD0I,kBAAkB,GAAG,IAAI;UAC7B;UACA;UACA,IAAI,EAAE,OAAOV,UAAU,KAAK,WAAW,IACnC7D,OAAO,CAAC6D,UAAU,GAAG,CAAC,CAAC,KAAKK,WAAW,CAACC,CAAC,IACzCnE,OAAO,CAAC6D,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,KAAKK,WAAW,CAACE,CAAC,IAC7CpE,OAAO,CAAC6D,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,KAAKK,WAAW,CAACG,CAAC,CAAC,IAC9CC,eAAe,IACfC,kBAAkB,EAAE;YACpBjH,QAAQ,CAACI,IAAI,CAACuG,WAAW,CAACE,CAAC,EAAEF,WAAW,CAACG,CAAC,EAAEH,WAAW,CAACI,CAAC,CAAC;YAC1D,IAAIpE,GAAG,EAAE;cACLA,GAAG,CAACvC,IAAI,CAAC5C,EAAE,CAACqJ,CAAC,EAAErJ,EAAE,CAACsJ,CAAC,CAAC;YACxB;YACApE,OAAO,CAACtC,IAAI,CAAC7C,MAAM,CAACsJ,CAAC,EAAEtJ,MAAM,CAACuJ,CAAC,EAAEvJ,MAAM,CAACwJ,CAAC,CAAC;YAC1C,IAAInE,UAAU,EAAE;cACZA,UAAU,CAACxC,IAAI,CAAC3C,SAAS,CAACyJ,CAAC,EAAEzJ,SAAS,CAAC0J,CAAC,EAAE1J,SAAS,CAACe,CAAC,EAAEf,SAAS,CAACc,CAAC,CAAC;YACvE;YACAgI,UAAU,GAAGD,YAAY,CAACK,WAAW,CAACE,CAAC,GAAG,GAAG,GAAGF,WAAW,CAACG,CAAC,GAAG,GAAG,GAAGH,WAAW,CAACI,CAAC,CAAC,GAAG/G,QAAQ,CAACC,MAAM,GAAG,CAAC,GAAG,CAAC;UAClH;UACAuC,OAAO,CAACpC,IAAI,CAACmG,UAAU,CAAC;UACxB,IAAIH,wBAAwB,EAAE;YAC1BA,wBAAwB,CAAC,CAAC;UAC9B;QACJ;MACJ;IACJ;IACA,MAAMgB,MAAM,GAAG,IAAIlK,UAAU,CAAC,CAAC;IAC/BkK,MAAM,CAAC3E,SAAS,GAAGzC,QAAQ;IAC3BoH,MAAM,CAAC1E,OAAO,GAAGA,OAAO;IACxB,IAAIC,GAAG,EAAE;MACLyE,MAAM,CAACzE,GAAG,GAAGA,GAAG;IACpB;IACA,IAAIC,UAAU,EAAE;MACZwE,MAAM,CAACvE,MAAM,GAAGD,UAAU;IAC9B;IACAwE,MAAM,CAAC5E,OAAO,GAAGA,OAAO;IACxB,OAAO4E,MAAM;EACjB;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACIC,iBAAiBA,CAACC,IAAI,EAAEC,KAAK,EAAEC,aAAa,EAAE;IAC1C,MAAMzD,IAAI,GAAG,IAAI/G,IAAI,CAACsK,IAAI,EAAEC,KAAK,CAAC;IAClC,MAAMpG,QAAQ,GAAG,IAAI,CAACI,SAAS;IAC/B,IAAIkG,YAAY,GAAG,CAAC;IACpB,MAAMC,WAAW,GAAG,CAAC,CAAC;IACtB,IAAIC,UAAU;IACd,IAAIH,aAAa,EAAE;MACf;MACArG,QAAQ,CAACyG,IAAI,CAAC,CAACrJ,CAAC,EAAEC,CAAC,KAAK;QACpB,IAAID,CAAC,CAACwC,MAAM,CAACqC,MAAM,KAAK5E,CAAC,CAACuC,MAAM,CAACqC,MAAM,EAAE;UACrC,OAAO7E,CAAC,CAACwC,MAAM,CAACoC,SAAS,GAAG3E,CAAC,CAACuC,MAAM,CAACoC,SAAS;QAClD,CAAC,MACI;UACD,OAAO5E,CAAC,CAACwC,MAAM,CAACqC,MAAM,GAAG5E,CAAC,CAACuC,MAAM,CAACqC,MAAM;QAC5C;MACJ,CAAC,CAAC;IACN;IACA,MAAMyE,UAAU,GAAG,IAAI,CAAC3B,YAAY,CAAE9G,OAAO,IAAK;MAC9C;MACA,IAAI,CAACsI,WAAW,CAACtI,OAAO,CAAC2B,MAAM,CAACqC,MAAM,CAAC,EAAE;QACrCsE,WAAW,CAACtI,OAAO,CAAC2B,MAAM,CAACqC,MAAM,CAAC,GAAG,CAAC,CAAC;MAC3C;MACA,IAAI,CAACsE,WAAW,CAACtI,OAAO,CAAC2B,MAAM,CAACqC,MAAM,CAAC,CAAChE,OAAO,CAAC2B,MAAM,CAACoC,SAAS,CAAC,EAAE;QAC/DuE,WAAW,CAACtI,OAAO,CAAC2B,MAAM,CAACqC,MAAM,CAAC,CAAChE,OAAO,CAAC2B,MAAM,CAACoC,SAAS,CAAC,GAAG;UAC3DgC,UAAU,EAAE,CAAC2C,QAAQ;UACrBC,QAAQ,EAAE,CAACD,QAAQ;UACnBzE,aAAa,EAAEjE,OAAO,CAAC2B,MAAM,CAACsC;QAClC,CAAC;MACL;MACAsE,UAAU,GAAGD,WAAW,CAACtI,OAAO,CAAC2B,MAAM,CAACqC,MAAM,CAAC,CAAChE,OAAO,CAAC2B,MAAM,CAACoC,SAAS,CAAC;IAC7E,CAAC,EAAE,MAAM;MACLwE,UAAU,CAACxC,UAAU,GAAG6C,IAAI,CAACC,GAAG,CAACR,YAAY,EAAEE,UAAU,CAACxC,UAAU,CAAC;MACrEwC,UAAU,CAACI,QAAQ,GAAGC,IAAI,CAACE,GAAG,CAACT,YAAY,EAAEE,UAAU,CAACI,QAAQ,CAAC;MACjEN,YAAY,EAAE;IAClB,CAAC,CAAC;IACFI,UAAU,CAACM,WAAW,CAACpE,IAAI,CAAC;IAC5B,IAAIyD,aAAa,EAAE;MACf;MACA,IAAIY,mBAAmB,GAAG,CAAC;QAAEC,gBAAgB;MAC7CtE,IAAI,CAACiB,SAAS,GAAG,EAAE;MACnB,KAAK,MAAMsD,CAAC,IAAIZ,WAAW,EAAE;QACzBW,gBAAgB,GAAG,CAAC,CAAC;QACrB,KAAK,MAAMpD,EAAE,IAAIyC,WAAW,CAACY,CAAC,CAAC,EAAE;UAC7BX,UAAU,GAAGD,WAAW,CAACY,CAAC,CAAC,CAACrD,EAAE,CAAC;UAC/BlI,OAAO,CAACwL,iBAAiB,CAACZ,UAAU,CAACtE,aAAa,GAAG+E,mBAAmB,EAAET,UAAU,CAACxC,UAAU,EAAEwC,UAAU,CAACI,QAAQ,GAAGJ,UAAU,CAACxC,UAAU,GAAG,CAAC,EAAEpB,IAAI,CAAC;UACvJsE,gBAAgB,GAAGL,IAAI,CAACE,GAAG,CAACP,UAAU,CAACtE,aAAa,EAAEgF,gBAAgB,CAAC;QAC3E;QACAD,mBAAmB,IAAI,EAAEC,gBAAgB;MAC7C;IACJ;IACA,OAAOtE,IAAI;EACf;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACIyE,MAAMA,CAAClB,IAAI,EAAE9C,QAAQ,GAAG,IAAI,EAAE+C,KAAK,EAAEC,aAAa,EAAE;IAChD,MAAMzD,IAAI,GAAG,IAAI,CAACsD,iBAAiB,CAACC,IAAI,EAAEC,KAAK,EAAEC,aAAa,CAAC;IAC/DzD,IAAI,CAACS,QAAQ,GAAGA,QAAQ;IACxBT,IAAI,CAACb,QAAQ,CAACwD,QAAQ,CAAC,IAAI,CAACxD,QAAQ,CAAC;IACrCa,IAAI,CAACL,QAAQ,CAACgD,QAAQ,CAAC,IAAI,CAAChD,QAAQ,CAAC;IACrC,IAAI,IAAI,CAACG,kBAAkB,EAAE;MACzBE,IAAI,CAACF,kBAAkB,GAAG,IAAI,CAACA,kBAAkB,CAACnG,KAAK,CAAC,CAAC;IAC7D;IACAqG,IAAI,CAACJ,OAAO,CAAC+C,QAAQ,CAAC,IAAI,CAAC/C,OAAO,CAAC;IACnCI,IAAI,CAACO,kBAAkB,CAAC,IAAI,CAAC;IAC7B,OAAOP,IAAI;EACf;AACJ","ignoreList":[]},"metadata":{},"sourceType":"module","externalDependencies":[]}
|
