| 1 |
- {"ast":null,"code":"import { BuildArray } from \"../Misc/arrayTools.js\";\nimport { Matrix, Vector3 } from \"../Maths/math.vector.js\";\nimport { Epsilon } from \"../Maths/math.constants.js\";\n/**\n * Class used to store bounding box information\n */\nexport class BoundingBox {\n /**\n * Creates a new bounding box\n * @param min defines the minimum vector (in local space)\n * @param max defines the maximum vector (in local space)\n * @param worldMatrix defines the new world matrix\n */\n constructor(min, max, worldMatrix) {\n /**\n * Gets the 8 vectors representing the bounding box in local space\n */\n this.vectors = BuildArray(8, Vector3.Zero);\n /**\n * Gets the center of the bounding box in local space\n */\n this.center = Vector3.Zero();\n /**\n * Gets the center of the bounding box in world space\n */\n this.centerWorld = Vector3.Zero();\n /**\n * Gets half the size of the extent in local space. Multiply by 2 to obtain the full size of the box!\n */\n this.extendSize = Vector3.Zero();\n /**\n * Gets half the size of the extent in world space. Multiply by 2 to obtain the full size of the box!\n */\n this.extendSizeWorld = Vector3.Zero();\n /**\n * Gets the OBB (object bounding box) directions\n */\n this.directions = BuildArray(3, Vector3.Zero);\n /**\n * Gets the 8 vectors representing the bounding box in world space\n */\n this.vectorsWorld = BuildArray(8, Vector3.Zero);\n /**\n * Gets the minimum vector in world space\n */\n this.minimumWorld = Vector3.Zero();\n /**\n * Gets the maximum vector in world space\n */\n this.maximumWorld = Vector3.Zero();\n /**\n * Gets the minimum vector in local space\n */\n this.minimum = Vector3.Zero();\n /**\n * Gets the maximum vector in local space\n */\n this.maximum = Vector3.Zero();\n /** @internal */\n this._drawWrapperFront = null;\n /** @internal */\n this._drawWrapperBack = null;\n this.reConstruct(min, max, worldMatrix);\n }\n // Methods\n /**\n * Recreates the entire bounding box from scratch as if we call the constructor in place\n * @param min defines the new minimum vector (in local space)\n * @param max defines the new maximum vector (in local space)\n * @param worldMatrix defines the new world matrix\n */\n reConstruct(min, max, worldMatrix) {\n const minX = min.x,\n minY = min.y,\n minZ = min.z,\n maxX = max.x,\n maxY = max.y,\n maxZ = max.z;\n const vectors = this.vectors;\n this.minimum.copyFromFloats(minX, minY, minZ);\n this.maximum.copyFromFloats(maxX, maxY, maxZ);\n vectors[0].copyFromFloats(minX, minY, minZ);\n vectors[1].copyFromFloats(maxX, maxY, maxZ);\n vectors[2].copyFromFloats(maxX, minY, minZ);\n vectors[3].copyFromFloats(minX, maxY, minZ);\n vectors[4].copyFromFloats(minX, minY, maxZ);\n vectors[5].copyFromFloats(maxX, maxY, minZ);\n vectors[6].copyFromFloats(minX, maxY, maxZ);\n vectors[7].copyFromFloats(maxX, minY, maxZ);\n // OBB\n max.addToRef(min, this.center).scaleInPlace(0.5);\n max.subtractToRef(min, this.extendSize).scaleInPlace(0.5);\n this._worldMatrix = worldMatrix || Matrix.IdentityReadOnly;\n this._update(this._worldMatrix);\n }\n /**\n * Scale the current bounding box by applying a scale factor\n * @param factor defines the scale factor to apply\n * @returns the current bounding box\n */\n scale(factor) {\n const tmpVectors = BoundingBox._TmpVector3;\n const diff = this.maximum.subtractToRef(this.minimum, tmpVectors[0]);\n const len = diff.length();\n diff.normalizeFromLength(len);\n const distance = len * factor;\n const newRadius = diff.scaleInPlace(distance * 0.5);\n const min = this.center.subtractToRef(newRadius, tmpVectors[1]);\n const max = this.center.addToRef(newRadius, tmpVectors[2]);\n this.reConstruct(min, max, this._worldMatrix);\n return this;\n }\n /**\n * Gets the world matrix of the bounding box\n * @returns a matrix\n */\n getWorldMatrix() {\n return this._worldMatrix;\n }\n /**\n * @internal\n */\n _update(world) {\n const minWorld = this.minimumWorld;\n const maxWorld = this.maximumWorld;\n const directions = this.directions;\n const vectorsWorld = this.vectorsWorld;\n const vectors = this.vectors;\n if (!world.isIdentity()) {\n minWorld.setAll(Number.MAX_VALUE);\n maxWorld.setAll(-Number.MAX_VALUE);\n for (let index = 0; index < 8; ++index) {\n const v = vectorsWorld[index];\n Vector3.TransformCoordinatesToRef(vectors[index], world, v);\n minWorld.minimizeInPlace(v);\n maxWorld.maximizeInPlace(v);\n }\n // Extend\n maxWorld.subtractToRef(minWorld, this.extendSizeWorld).scaleInPlace(0.5);\n maxWorld.addToRef(minWorld, this.centerWorld).scaleInPlace(0.5);\n } else {\n minWorld.copyFrom(this.minimum);\n maxWorld.copyFrom(this.maximum);\n for (let index = 0; index < 8; ++index) {\n vectorsWorld[index].copyFrom(vectors[index]);\n }\n // Extend\n this.extendSizeWorld.copyFrom(this.extendSize);\n this.centerWorld.copyFrom(this.center);\n }\n Vector3.FromArrayToRef(world.m, 0, directions[0]);\n Vector3.FromArrayToRef(world.m, 4, directions[1]);\n Vector3.FromArrayToRef(world.m, 8, directions[2]);\n this._worldMatrix = world;\n }\n /**\n * Tests if the bounding box is intersecting the frustum planes\n * @param frustumPlanes defines the frustum planes to test\n * @returns true if there is an intersection\n */\n isInFrustum(frustumPlanes) {\n return BoundingBox.IsInFrustum(this.vectorsWorld, frustumPlanes);\n }\n /**\n * Tests if the bounding box is entirely inside the frustum planes\n * @param frustumPlanes defines the frustum planes to test\n * @returns true if there is an inclusion\n */\n isCompletelyInFrustum(frustumPlanes) {\n return BoundingBox.IsCompletelyInFrustum(this.vectorsWorld, frustumPlanes);\n }\n /**\n * Tests if a point is inside the bounding box\n * @param point defines the point to test\n * @returns true if the point is inside the bounding box\n */\n intersectsPoint(point) {\n const min = this.minimumWorld;\n const max = this.maximumWorld;\n const minX = min.x,\n minY = min.y,\n minZ = min.z,\n maxX = max.x,\n maxY = max.y,\n maxZ = max.z;\n const pointX = point.x,\n pointY = point.y,\n pointZ = point.z;\n const delta = -Epsilon;\n if (maxX - pointX < delta || delta > pointX - minX) {\n return false;\n }\n if (maxY - pointY < delta || delta > pointY - minY) {\n return false;\n }\n if (maxZ - pointZ < delta || delta > pointZ - minZ) {\n return false;\n }\n return true;\n }\n /**\n * Tests if the bounding box intersects with a bounding sphere\n * @param sphere defines the sphere to test\n * @returns true if there is an intersection\n */\n intersectsSphere(sphere) {\n return BoundingBox.IntersectsSphere(this.minimumWorld, this.maximumWorld, sphere.centerWorld, sphere.radiusWorld);\n }\n /**\n * Tests if the bounding box intersects with a box defined by a min and max vectors\n * @param min defines the min vector to use\n * @param max defines the max vector to use\n * @returns true if there is an intersection\n */\n intersectsMinMax(min, max) {\n const myMin = this.minimumWorld;\n const myMax = this.maximumWorld;\n const myMinX = myMin.x,\n myMinY = myMin.y,\n myMinZ = myMin.z,\n myMaxX = myMax.x,\n myMaxY = myMax.y,\n myMaxZ = myMax.z;\n const minX = min.x,\n minY = min.y,\n minZ = min.z,\n maxX = max.x,\n maxY = max.y,\n maxZ = max.z;\n if (myMaxX < minX || myMinX > maxX) {\n return false;\n }\n if (myMaxY < minY || myMinY > maxY) {\n return false;\n }\n if (myMaxZ < minZ || myMinZ > maxZ) {\n return false;\n }\n return true;\n }\n /**\n * Disposes the resources of the class\n */\n dispose() {\n var _this$_drawWrapperFro, _this$_drawWrapperBac;\n (_this$_drawWrapperFro = this._drawWrapperFront) === null || _this$_drawWrapperFro === void 0 || _this$_drawWrapperFro.dispose();\n (_this$_drawWrapperBac = this._drawWrapperBack) === null || _this$_drawWrapperBac === void 0 || _this$_drawWrapperBac.dispose();\n }\n // Statics\n /**\n * Tests if two bounding boxes are intersections\n * @param box0 defines the first box to test\n * @param box1 defines the second box to test\n * @returns true if there is an intersection\n */\n static Intersects(box0, box1) {\n return box0.intersectsMinMax(box1.minimumWorld, box1.maximumWorld);\n }\n /**\n * Tests if a bounding box defines by a min/max vectors intersects a sphere\n * @param minPoint defines the minimum vector of the bounding box\n * @param maxPoint defines the maximum vector of the bounding box\n * @param sphereCenter defines the sphere center\n * @param sphereRadius defines the sphere radius\n * @returns true if there is an intersection\n */\n static IntersectsSphere(minPoint, maxPoint, sphereCenter, sphereRadius) {\n const vector = BoundingBox._TmpVector3[0];\n Vector3.ClampToRef(sphereCenter, minPoint, maxPoint, vector);\n const num = Vector3.DistanceSquared(sphereCenter, vector);\n return num <= sphereRadius * sphereRadius;\n }\n /**\n * Tests if a bounding box defined with 8 vectors is entirely inside frustum planes\n * @param boundingVectors defines an array of 8 vectors representing a bounding box\n * @param frustumPlanes defines the frustum planes to test\n * @returns true if there is an inclusion\n */\n static IsCompletelyInFrustum(boundingVectors, frustumPlanes) {\n for (let p = 0; p < 6; ++p) {\n const frustumPlane = frustumPlanes[p];\n for (let i = 0; i < 8; ++i) {\n if (frustumPlane.dotCoordinate(boundingVectors[i]) < 0) {\n return false;\n }\n }\n }\n return true;\n }\n /**\n * Tests if a bounding box defined with 8 vectors intersects frustum planes\n * @param boundingVectors defines an array of 8 vectors representing a bounding box\n * @param frustumPlanes defines the frustum planes to test\n * @returns true if there is an intersection\n */\n static IsInFrustum(boundingVectors, frustumPlanes) {\n for (let p = 0; p < 6; ++p) {\n let canReturnFalse = true;\n const frustumPlane = frustumPlanes[p];\n for (let i = 0; i < 8; ++i) {\n if (frustumPlane.dotCoordinate(boundingVectors[i]) >= 0) {\n canReturnFalse = false;\n break;\n }\n }\n if (canReturnFalse) {\n return false;\n }\n }\n return true;\n }\n}\nBoundingBox._TmpVector3 = BuildArray(3, Vector3.Zero);","map":{"version":3,"names":["BuildArray","Matrix","Vector3","Epsilon","BoundingBox","constructor","min","max","worldMatrix","vectors","Zero","center","centerWorld","extendSize","extendSizeWorld","directions","vectorsWorld","minimumWorld","maximumWorld","minimum","maximum","_drawWrapperFront","_drawWrapperBack","reConstruct","minX","x","minY","y","minZ","z","maxX","maxY","maxZ","copyFromFloats","addToRef","scaleInPlace","subtractToRef","_worldMatrix","IdentityReadOnly","_update","scale","factor","tmpVectors","_TmpVector3","diff","len","length","normalizeFromLength","distance","newRadius","getWorldMatrix","world","minWorld","maxWorld","isIdentity","setAll","Number","MAX_VALUE","index","v","TransformCoordinatesToRef","minimizeInPlace","maximizeInPlace","copyFrom","FromArrayToRef","m","isInFrustum","frustumPlanes","IsInFrustum","isCompletelyInFrustum","IsCompletelyInFrustum","intersectsPoint","point","pointX","pointY","pointZ","delta","intersectsSphere","sphere","IntersectsSphere","radiusWorld","intersectsMinMax","myMin","myMax","myMinX","myMinY","myMinZ","myMaxX","myMaxY","myMaxZ","dispose","_this$_drawWrapperFro","_this$_drawWrapperBac","Intersects","box0","box1","minPoint","maxPoint","sphereCenter","sphereRadius","vector","ClampToRef","num","DistanceSquared","boundingVectors","p","frustumPlane","i","dotCoordinate","canReturnFalse"],"sources":["F:/workspace/202226701027/huinongbao-app/node_modules/@babylonjs/core/Culling/boundingBox.js"],"sourcesContent":["import { BuildArray } from \"../Misc/arrayTools.js\";\nimport { Matrix, Vector3 } from \"../Maths/math.vector.js\";\nimport { Epsilon } from \"../Maths/math.constants.js\";\n/**\n * Class used to store bounding box information\n */\nexport class BoundingBox {\n /**\n * Creates a new bounding box\n * @param min defines the minimum vector (in local space)\n * @param max defines the maximum vector (in local space)\n * @param worldMatrix defines the new world matrix\n */\n constructor(min, max, worldMatrix) {\n /**\n * Gets the 8 vectors representing the bounding box in local space\n */\n this.vectors = BuildArray(8, Vector3.Zero);\n /**\n * Gets the center of the bounding box in local space\n */\n this.center = Vector3.Zero();\n /**\n * Gets the center of the bounding box in world space\n */\n this.centerWorld = Vector3.Zero();\n /**\n * Gets half the size of the extent in local space. Multiply by 2 to obtain the full size of the box!\n */\n this.extendSize = Vector3.Zero();\n /**\n * Gets half the size of the extent in world space. Multiply by 2 to obtain the full size of the box!\n */\n this.extendSizeWorld = Vector3.Zero();\n /**\n * Gets the OBB (object bounding box) directions\n */\n this.directions = BuildArray(3, Vector3.Zero);\n /**\n * Gets the 8 vectors representing the bounding box in world space\n */\n this.vectorsWorld = BuildArray(8, Vector3.Zero);\n /**\n * Gets the minimum vector in world space\n */\n this.minimumWorld = Vector3.Zero();\n /**\n * Gets the maximum vector in world space\n */\n this.maximumWorld = Vector3.Zero();\n /**\n * Gets the minimum vector in local space\n */\n this.minimum = Vector3.Zero();\n /**\n * Gets the maximum vector in local space\n */\n this.maximum = Vector3.Zero();\n /** @internal */\n this._drawWrapperFront = null;\n /** @internal */\n this._drawWrapperBack = null;\n this.reConstruct(min, max, worldMatrix);\n }\n // Methods\n /**\n * Recreates the entire bounding box from scratch as if we call the constructor in place\n * @param min defines the new minimum vector (in local space)\n * @param max defines the new maximum vector (in local space)\n * @param worldMatrix defines the new world matrix\n */\n reConstruct(min, max, worldMatrix) {\n const minX = min.x, minY = min.y, minZ = min.z, maxX = max.x, maxY = max.y, maxZ = max.z;\n const vectors = this.vectors;\n this.minimum.copyFromFloats(minX, minY, minZ);\n this.maximum.copyFromFloats(maxX, maxY, maxZ);\n vectors[0].copyFromFloats(minX, minY, minZ);\n vectors[1].copyFromFloats(maxX, maxY, maxZ);\n vectors[2].copyFromFloats(maxX, minY, minZ);\n vectors[3].copyFromFloats(minX, maxY, minZ);\n vectors[4].copyFromFloats(minX, minY, maxZ);\n vectors[5].copyFromFloats(maxX, maxY, minZ);\n vectors[6].copyFromFloats(minX, maxY, maxZ);\n vectors[7].copyFromFloats(maxX, minY, maxZ);\n // OBB\n max.addToRef(min, this.center).scaleInPlace(0.5);\n max.subtractToRef(min, this.extendSize).scaleInPlace(0.5);\n this._worldMatrix = worldMatrix || Matrix.IdentityReadOnly;\n this._update(this._worldMatrix);\n }\n /**\n * Scale the current bounding box by applying a scale factor\n * @param factor defines the scale factor to apply\n * @returns the current bounding box\n */\n scale(factor) {\n const tmpVectors = BoundingBox._TmpVector3;\n const diff = this.maximum.subtractToRef(this.minimum, tmpVectors[0]);\n const len = diff.length();\n diff.normalizeFromLength(len);\n const distance = len * factor;\n const newRadius = diff.scaleInPlace(distance * 0.5);\n const min = this.center.subtractToRef(newRadius, tmpVectors[1]);\n const max = this.center.addToRef(newRadius, tmpVectors[2]);\n this.reConstruct(min, max, this._worldMatrix);\n return this;\n }\n /**\n * Gets the world matrix of the bounding box\n * @returns a matrix\n */\n getWorldMatrix() {\n return this._worldMatrix;\n }\n /**\n * @internal\n */\n _update(world) {\n const minWorld = this.minimumWorld;\n const maxWorld = this.maximumWorld;\n const directions = this.directions;\n const vectorsWorld = this.vectorsWorld;\n const vectors = this.vectors;\n if (!world.isIdentity()) {\n minWorld.setAll(Number.MAX_VALUE);\n maxWorld.setAll(-Number.MAX_VALUE);\n for (let index = 0; index < 8; ++index) {\n const v = vectorsWorld[index];\n Vector3.TransformCoordinatesToRef(vectors[index], world, v);\n minWorld.minimizeInPlace(v);\n maxWorld.maximizeInPlace(v);\n }\n // Extend\n maxWorld.subtractToRef(minWorld, this.extendSizeWorld).scaleInPlace(0.5);\n maxWorld.addToRef(minWorld, this.centerWorld).scaleInPlace(0.5);\n }\n else {\n minWorld.copyFrom(this.minimum);\n maxWorld.copyFrom(this.maximum);\n for (let index = 0; index < 8; ++index) {\n vectorsWorld[index].copyFrom(vectors[index]);\n }\n // Extend\n this.extendSizeWorld.copyFrom(this.extendSize);\n this.centerWorld.copyFrom(this.center);\n }\n Vector3.FromArrayToRef(world.m, 0, directions[0]);\n Vector3.FromArrayToRef(world.m, 4, directions[1]);\n Vector3.FromArrayToRef(world.m, 8, directions[2]);\n this._worldMatrix = world;\n }\n /**\n * Tests if the bounding box is intersecting the frustum planes\n * @param frustumPlanes defines the frustum planes to test\n * @returns true if there is an intersection\n */\n isInFrustum(frustumPlanes) {\n return BoundingBox.IsInFrustum(this.vectorsWorld, frustumPlanes);\n }\n /**\n * Tests if the bounding box is entirely inside the frustum planes\n * @param frustumPlanes defines the frustum planes to test\n * @returns true if there is an inclusion\n */\n isCompletelyInFrustum(frustumPlanes) {\n return BoundingBox.IsCompletelyInFrustum(this.vectorsWorld, frustumPlanes);\n }\n /**\n * Tests if a point is inside the bounding box\n * @param point defines the point to test\n * @returns true if the point is inside the bounding box\n */\n intersectsPoint(point) {\n const min = this.minimumWorld;\n const max = this.maximumWorld;\n const minX = min.x, minY = min.y, minZ = min.z, maxX = max.x, maxY = max.y, maxZ = max.z;\n const pointX = point.x, pointY = point.y, pointZ = point.z;\n const delta = -Epsilon;\n if (maxX - pointX < delta || delta > pointX - minX) {\n return false;\n }\n if (maxY - pointY < delta || delta > pointY - minY) {\n return false;\n }\n if (maxZ - pointZ < delta || delta > pointZ - minZ) {\n return false;\n }\n return true;\n }\n /**\n * Tests if the bounding box intersects with a bounding sphere\n * @param sphere defines the sphere to test\n * @returns true if there is an intersection\n */\n intersectsSphere(sphere) {\n return BoundingBox.IntersectsSphere(this.minimumWorld, this.maximumWorld, sphere.centerWorld, sphere.radiusWorld);\n }\n /**\n * Tests if the bounding box intersects with a box defined by a min and max vectors\n * @param min defines the min vector to use\n * @param max defines the max vector to use\n * @returns true if there is an intersection\n */\n intersectsMinMax(min, max) {\n const myMin = this.minimumWorld;\n const myMax = this.maximumWorld;\n const myMinX = myMin.x, myMinY = myMin.y, myMinZ = myMin.z, myMaxX = myMax.x, myMaxY = myMax.y, myMaxZ = myMax.z;\n const minX = min.x, minY = min.y, minZ = min.z, maxX = max.x, maxY = max.y, maxZ = max.z;\n if (myMaxX < minX || myMinX > maxX) {\n return false;\n }\n if (myMaxY < minY || myMinY > maxY) {\n return false;\n }\n if (myMaxZ < minZ || myMinZ > maxZ) {\n return false;\n }\n return true;\n }\n /**\n * Disposes the resources of the class\n */\n dispose() {\n this._drawWrapperFront?.dispose();\n this._drawWrapperBack?.dispose();\n }\n // Statics\n /**\n * Tests if two bounding boxes are intersections\n * @param box0 defines the first box to test\n * @param box1 defines the second box to test\n * @returns true if there is an intersection\n */\n static Intersects(box0, box1) {\n return box0.intersectsMinMax(box1.minimumWorld, box1.maximumWorld);\n }\n /**\n * Tests if a bounding box defines by a min/max vectors intersects a sphere\n * @param minPoint defines the minimum vector of the bounding box\n * @param maxPoint defines the maximum vector of the bounding box\n * @param sphereCenter defines the sphere center\n * @param sphereRadius defines the sphere radius\n * @returns true if there is an intersection\n */\n static IntersectsSphere(minPoint, maxPoint, sphereCenter, sphereRadius) {\n const vector = BoundingBox._TmpVector3[0];\n Vector3.ClampToRef(sphereCenter, minPoint, maxPoint, vector);\n const num = Vector3.DistanceSquared(sphereCenter, vector);\n return num <= sphereRadius * sphereRadius;\n }\n /**\n * Tests if a bounding box defined with 8 vectors is entirely inside frustum planes\n * @param boundingVectors defines an array of 8 vectors representing a bounding box\n * @param frustumPlanes defines the frustum planes to test\n * @returns true if there is an inclusion\n */\n static IsCompletelyInFrustum(boundingVectors, frustumPlanes) {\n for (let p = 0; p < 6; ++p) {\n const frustumPlane = frustumPlanes[p];\n for (let i = 0; i < 8; ++i) {\n if (frustumPlane.dotCoordinate(boundingVectors[i]) < 0) {\n return false;\n }\n }\n }\n return true;\n }\n /**\n * Tests if a bounding box defined with 8 vectors intersects frustum planes\n * @param boundingVectors defines an array of 8 vectors representing a bounding box\n * @param frustumPlanes defines the frustum planes to test\n * @returns true if there is an intersection\n */\n static IsInFrustum(boundingVectors, frustumPlanes) {\n for (let p = 0; p < 6; ++p) {\n let canReturnFalse = true;\n const frustumPlane = frustumPlanes[p];\n for (let i = 0; i < 8; ++i) {\n if (frustumPlane.dotCoordinate(boundingVectors[i]) >= 0) {\n canReturnFalse = false;\n break;\n }\n }\n if (canReturnFalse) {\n return false;\n }\n }\n return true;\n }\n}\nBoundingBox._TmpVector3 = BuildArray(3, Vector3.Zero);\n"],"mappings":"AAAA,SAASA,UAAU,QAAQ,uBAAuB;AAClD,SAASC,MAAM,EAAEC,OAAO,QAAQ,yBAAyB;AACzD,SAASC,OAAO,QAAQ,4BAA4B;AACpD;AACA;AACA;AACA,OAAO,MAAMC,WAAW,CAAC;EACrB;AACJ;AACA;AACA;AACA;AACA;EACIC,WAAWA,CAACC,GAAG,EAAEC,GAAG,EAAEC,WAAW,EAAE;IAC/B;AACR;AACA;IACQ,IAAI,CAACC,OAAO,GAAGT,UAAU,CAAC,CAAC,EAAEE,OAAO,CAACQ,IAAI,CAAC;IAC1C;AACR;AACA;IACQ,IAAI,CAACC,MAAM,GAAGT,OAAO,CAACQ,IAAI,CAAC,CAAC;IAC5B;AACR;AACA;IACQ,IAAI,CAACE,WAAW,GAAGV,OAAO,CAACQ,IAAI,CAAC,CAAC;IACjC;AACR;AACA;IACQ,IAAI,CAACG,UAAU,GAAGX,OAAO,CAACQ,IAAI,CAAC,CAAC;IAChC;AACR;AACA;IACQ,IAAI,CAACI,eAAe,GAAGZ,OAAO,CAACQ,IAAI,CAAC,CAAC;IACrC;AACR;AACA;IACQ,IAAI,CAACK,UAAU,GAAGf,UAAU,CAAC,CAAC,EAAEE,OAAO,CAACQ,IAAI,CAAC;IAC7C;AACR;AACA;IACQ,IAAI,CAACM,YAAY,GAAGhB,UAAU,CAAC,CAAC,EAAEE,OAAO,CAACQ,IAAI,CAAC;IAC/C;AACR;AACA;IACQ,IAAI,CAACO,YAAY,GAAGf,OAAO,CAACQ,IAAI,CAAC,CAAC;IAClC;AACR;AACA;IACQ,IAAI,CAACQ,YAAY,GAAGhB,OAAO,CAACQ,IAAI,CAAC,CAAC;IAClC;AACR;AACA;IACQ,IAAI,CAACS,OAAO,GAAGjB,OAAO,CAACQ,IAAI,CAAC,CAAC;IAC7B;AACR;AACA;IACQ,IAAI,CAACU,OAAO,GAAGlB,OAAO,CAACQ,IAAI,CAAC,CAAC;IAC7B;IACA,IAAI,CAACW,iBAAiB,GAAG,IAAI;IAC7B;IACA,IAAI,CAACC,gBAAgB,GAAG,IAAI;IAC5B,IAAI,CAACC,WAAW,CAACjB,GAAG,EAAEC,GAAG,EAAEC,WAAW,CAAC;EAC3C;EACA;EACA;AACJ;AACA;AACA;AACA;AACA;EACIe,WAAWA,CAACjB,GAAG,EAAEC,GAAG,EAAEC,WAAW,EAAE;IAC/B,MAAMgB,IAAI,GAAGlB,GAAG,CAACmB,CAAC;MAAEC,IAAI,GAAGpB,GAAG,CAACqB,CAAC;MAAEC,IAAI,GAAGtB,GAAG,CAACuB,CAAC;MAAEC,IAAI,GAAGvB,GAAG,CAACkB,CAAC;MAAEM,IAAI,GAAGxB,GAAG,CAACoB,CAAC;MAAEK,IAAI,GAAGzB,GAAG,CAACsB,CAAC;IACxF,MAAMpB,OAAO,GAAG,IAAI,CAACA,OAAO;IAC5B,IAAI,CAACU,OAAO,CAACc,cAAc,CAACT,IAAI,EAAEE,IAAI,EAAEE,IAAI,CAAC;IAC7C,IAAI,CAACR,OAAO,CAACa,cAAc,CAACH,IAAI,EAAEC,IAAI,EAAEC,IAAI,CAAC;IAC7CvB,OAAO,CAAC,CAAC,CAAC,CAACwB,cAAc,CAACT,IAAI,EAAEE,IAAI,EAAEE,IAAI,CAAC;IAC3CnB,OAAO,CAAC,CAAC,CAAC,CAACwB,cAAc,CAACH,IAAI,EAAEC,IAAI,EAAEC,IAAI,CAAC;IAC3CvB,OAAO,CAAC,CAAC,CAAC,CAACwB,cAAc,CAACH,IAAI,EAAEJ,IAAI,EAAEE,IAAI,CAAC;IAC3CnB,OAAO,CAAC,CAAC,CAAC,CAACwB,cAAc,CAACT,IAAI,EAAEO,IAAI,EAAEH,IAAI,CAAC;IAC3CnB,OAAO,CAAC,CAAC,CAAC,CAACwB,cAAc,CAACT,IAAI,EAAEE,IAAI,EAAEM,IAAI,CAAC;IAC3CvB,OAAO,CAAC,CAAC,CAAC,CAACwB,cAAc,CAACH,IAAI,EAAEC,IAAI,EAAEH,IAAI,CAAC;IAC3CnB,OAAO,CAAC,CAAC,CAAC,CAACwB,cAAc,CAACT,IAAI,EAAEO,IAAI,EAAEC,IAAI,CAAC;IAC3CvB,OAAO,CAAC,CAAC,CAAC,CAACwB,cAAc,CAACH,IAAI,EAAEJ,IAAI,EAAEM,IAAI,CAAC;IAC3C;IACAzB,GAAG,CAAC2B,QAAQ,CAAC5B,GAAG,EAAE,IAAI,CAACK,MAAM,CAAC,CAACwB,YAAY,CAAC,GAAG,CAAC;IAChD5B,GAAG,CAAC6B,aAAa,CAAC9B,GAAG,EAAE,IAAI,CAACO,UAAU,CAAC,CAACsB,YAAY,CAAC,GAAG,CAAC;IACzD,IAAI,CAACE,YAAY,GAAG7B,WAAW,IAAIP,MAAM,CAACqC,gBAAgB;IAC1D,IAAI,CAACC,OAAO,CAAC,IAAI,CAACF,YAAY,CAAC;EACnC;EACA;AACJ;AACA;AACA;AACA;EACIG,KAAKA,CAACC,MAAM,EAAE;IACV,MAAMC,UAAU,GAAGtC,WAAW,CAACuC,WAAW;IAC1C,MAAMC,IAAI,GAAG,IAAI,CAACxB,OAAO,CAACgB,aAAa,CAAC,IAAI,CAACjB,OAAO,EAAEuB,UAAU,CAAC,CAAC,CAAC,CAAC;IACpE,MAAMG,GAAG,GAAGD,IAAI,CAACE,MAAM,CAAC,CAAC;IACzBF,IAAI,CAACG,mBAAmB,CAACF,GAAG,CAAC;IAC7B,MAAMG,QAAQ,GAAGH,GAAG,GAAGJ,MAAM;IAC7B,MAAMQ,SAAS,GAAGL,IAAI,CAACT,YAAY,CAACa,QAAQ,GAAG,GAAG,CAAC;IACnD,MAAM1C,GAAG,GAAG,IAAI,CAACK,MAAM,CAACyB,aAAa,CAACa,SAAS,EAAEP,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAMnC,GAAG,GAAG,IAAI,CAACI,MAAM,CAACuB,QAAQ,CAACe,SAAS,EAAEP,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1D,IAAI,CAACnB,WAAW,CAACjB,GAAG,EAAEC,GAAG,EAAE,IAAI,CAAC8B,YAAY,CAAC;IAC7C,OAAO,IAAI;EACf;EACA;AACJ;AACA;AACA;EACIa,cAAcA,CAAA,EAAG;IACb,OAAO,IAAI,CAACb,YAAY;EAC5B;EACA;AACJ;AACA;EACIE,OAAOA,CAACY,KAAK,EAAE;IACX,MAAMC,QAAQ,GAAG,IAAI,CAACnC,YAAY;IAClC,MAAMoC,QAAQ,GAAG,IAAI,CAACnC,YAAY;IAClC,MAAMH,UAAU,GAAG,IAAI,CAACA,UAAU;IAClC,MAAMC,YAAY,GAAG,IAAI,CAACA,YAAY;IACtC,MAAMP,OAAO,GAAG,IAAI,CAACA,OAAO;IAC5B,IAAI,CAAC0C,KAAK,CAACG,UAAU,CAAC,CAAC,EAAE;MACrBF,QAAQ,CAACG,MAAM,CAACC,MAAM,CAACC,SAAS,CAAC;MACjCJ,QAAQ,CAACE,MAAM,CAAC,CAACC,MAAM,CAACC,SAAS,CAAC;MAClC,KAAK,IAAIC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAG,CAAC,EAAE,EAAEA,KAAK,EAAE;QACpC,MAAMC,CAAC,GAAG3C,YAAY,CAAC0C,KAAK,CAAC;QAC7BxD,OAAO,CAAC0D,yBAAyB,CAACnD,OAAO,CAACiD,KAAK,CAAC,EAAEP,KAAK,EAAEQ,CAAC,CAAC;QAC3DP,QAAQ,CAACS,eAAe,CAACF,CAAC,CAAC;QAC3BN,QAAQ,CAACS,eAAe,CAACH,CAAC,CAAC;MAC/B;MACA;MACAN,QAAQ,CAACjB,aAAa,CAACgB,QAAQ,EAAE,IAAI,CAACtC,eAAe,CAAC,CAACqB,YAAY,CAAC,GAAG,CAAC;MACxEkB,QAAQ,CAACnB,QAAQ,CAACkB,QAAQ,EAAE,IAAI,CAACxC,WAAW,CAAC,CAACuB,YAAY,CAAC,GAAG,CAAC;IACnE,CAAC,MACI;MACDiB,QAAQ,CAACW,QAAQ,CAAC,IAAI,CAAC5C,OAAO,CAAC;MAC/BkC,QAAQ,CAACU,QAAQ,CAAC,IAAI,CAAC3C,OAAO,CAAC;MAC/B,KAAK,IAAIsC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAG,CAAC,EAAE,EAAEA,KAAK,EAAE;QACpC1C,YAAY,CAAC0C,KAAK,CAAC,CAACK,QAAQ,CAACtD,OAAO,CAACiD,KAAK,CAAC,CAAC;MAChD;MACA;MACA,IAAI,CAAC5C,eAAe,CAACiD,QAAQ,CAAC,IAAI,CAAClD,UAAU,CAAC;MAC9C,IAAI,CAACD,WAAW,CAACmD,QAAQ,CAAC,IAAI,CAACpD,MAAM,CAAC;IAC1C;IACAT,OAAO,CAAC8D,cAAc,CAACb,KAAK,CAACc,CAAC,EAAE,CAAC,EAAElD,UAAU,CAAC,CAAC,CAAC,CAAC;IACjDb,OAAO,CAAC8D,cAAc,CAACb,KAAK,CAACc,CAAC,EAAE,CAAC,EAAElD,UAAU,CAAC,CAAC,CAAC,CAAC;IACjDb,OAAO,CAAC8D,cAAc,CAACb,KAAK,CAACc,CAAC,EAAE,CAAC,EAAElD,UAAU,CAAC,CAAC,CAAC,CAAC;IACjD,IAAI,CAACsB,YAAY,GAAGc,KAAK;EAC7B;EACA;AACJ;AACA;AACA;AACA;EACIe,WAAWA,CAACC,aAAa,EAAE;IACvB,OAAO/D,WAAW,CAACgE,WAAW,CAAC,IAAI,CAACpD,YAAY,EAAEmD,aAAa,CAAC;EACpE;EACA;AACJ;AACA;AACA;AACA;EACIE,qBAAqBA,CAACF,aAAa,EAAE;IACjC,OAAO/D,WAAW,CAACkE,qBAAqB,CAAC,IAAI,CAACtD,YAAY,EAAEmD,aAAa,CAAC;EAC9E;EACA;AACJ;AACA;AACA;AACA;EACII,eAAeA,CAACC,KAAK,EAAE;IACnB,MAAMlE,GAAG,GAAG,IAAI,CAACW,YAAY;IAC7B,MAAMV,GAAG,GAAG,IAAI,CAACW,YAAY;IAC7B,MAAMM,IAAI,GAAGlB,GAAG,CAACmB,CAAC;MAAEC,IAAI,GAAGpB,GAAG,CAACqB,CAAC;MAAEC,IAAI,GAAGtB,GAAG,CAACuB,CAAC;MAAEC,IAAI,GAAGvB,GAAG,CAACkB,CAAC;MAAEM,IAAI,GAAGxB,GAAG,CAACoB,CAAC;MAAEK,IAAI,GAAGzB,GAAG,CAACsB,CAAC;IACxF,MAAM4C,MAAM,GAAGD,KAAK,CAAC/C,CAAC;MAAEiD,MAAM,GAAGF,KAAK,CAAC7C,CAAC;MAAEgD,MAAM,GAAGH,KAAK,CAAC3C,CAAC;IAC1D,MAAM+C,KAAK,GAAG,CAACzE,OAAO;IACtB,IAAI2B,IAAI,GAAG2C,MAAM,GAAGG,KAAK,IAAIA,KAAK,GAAGH,MAAM,GAAGjD,IAAI,EAAE;MAChD,OAAO,KAAK;IAChB;IACA,IAAIO,IAAI,GAAG2C,MAAM,GAAGE,KAAK,IAAIA,KAAK,GAAGF,MAAM,GAAGhD,IAAI,EAAE;MAChD,OAAO,KAAK;IAChB;IACA,IAAIM,IAAI,GAAG2C,MAAM,GAAGC,KAAK,IAAIA,KAAK,GAAGD,MAAM,GAAG/C,IAAI,EAAE;MAChD,OAAO,KAAK;IAChB;IACA,OAAO,IAAI;EACf;EACA;AACJ;AACA;AACA;AACA;EACIiD,gBAAgBA,CAACC,MAAM,EAAE;IACrB,OAAO1E,WAAW,CAAC2E,gBAAgB,CAAC,IAAI,CAAC9D,YAAY,EAAE,IAAI,CAACC,YAAY,EAAE4D,MAAM,CAAClE,WAAW,EAAEkE,MAAM,CAACE,WAAW,CAAC;EACrH;EACA;AACJ;AACA;AACA;AACA;AACA;EACIC,gBAAgBA,CAAC3E,GAAG,EAAEC,GAAG,EAAE;IACvB,MAAM2E,KAAK,GAAG,IAAI,CAACjE,YAAY;IAC/B,MAAMkE,KAAK,GAAG,IAAI,CAACjE,YAAY;IAC/B,MAAMkE,MAAM,GAAGF,KAAK,CAACzD,CAAC;MAAE4D,MAAM,GAAGH,KAAK,CAACvD,CAAC;MAAE2D,MAAM,GAAGJ,KAAK,CAACrD,CAAC;MAAE0D,MAAM,GAAGJ,KAAK,CAAC1D,CAAC;MAAE+D,MAAM,GAAGL,KAAK,CAACxD,CAAC;MAAE8D,MAAM,GAAGN,KAAK,CAACtD,CAAC;IAChH,MAAML,IAAI,GAAGlB,GAAG,CAACmB,CAAC;MAAEC,IAAI,GAAGpB,GAAG,CAACqB,CAAC;MAAEC,IAAI,GAAGtB,GAAG,CAACuB,CAAC;MAAEC,IAAI,GAAGvB,GAAG,CAACkB,CAAC;MAAEM,IAAI,GAAGxB,GAAG,CAACoB,CAAC;MAAEK,IAAI,GAAGzB,GAAG,CAACsB,CAAC;IACxF,IAAI0D,MAAM,GAAG/D,IAAI,IAAI4D,MAAM,GAAGtD,IAAI,EAAE;MAChC,OAAO,KAAK;IAChB;IACA,IAAI0D,MAAM,GAAG9D,IAAI,IAAI2D,MAAM,GAAGtD,IAAI,EAAE;MAChC,OAAO,KAAK;IAChB;IACA,IAAI0D,MAAM,GAAG7D,IAAI,IAAI0D,MAAM,GAAGtD,IAAI,EAAE;MAChC,OAAO,KAAK;IAChB;IACA,OAAO,IAAI;EACf;EACA;AACJ;AACA;EACI0D,OAAOA,CAAA,EAAG;IAAA,IAAAC,qBAAA,EAAAC,qBAAA;IACN,CAAAD,qBAAA,OAAI,CAACtE,iBAAiB,cAAAsE,qBAAA,eAAtBA,qBAAA,CAAwBD,OAAO,CAAC,CAAC;IACjC,CAAAE,qBAAA,OAAI,CAACtE,gBAAgB,cAAAsE,qBAAA,eAArBA,qBAAA,CAAuBF,OAAO,CAAC,CAAC;EACpC;EACA;EACA;AACJ;AACA;AACA;AACA;AACA;EACI,OAAOG,UAAUA,CAACC,IAAI,EAAEC,IAAI,EAAE;IAC1B,OAAOD,IAAI,CAACb,gBAAgB,CAACc,IAAI,CAAC9E,YAAY,EAAE8E,IAAI,CAAC7E,YAAY,CAAC;EACtE;EACA;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;EACI,OAAO6D,gBAAgBA,CAACiB,QAAQ,EAAEC,QAAQ,EAAEC,YAAY,EAAEC,YAAY,EAAE;IACpE,MAAMC,MAAM,GAAGhG,WAAW,CAACuC,WAAW,CAAC,CAAC,CAAC;IACzCzC,OAAO,CAACmG,UAAU,CAACH,YAAY,EAAEF,QAAQ,EAAEC,QAAQ,EAAEG,MAAM,CAAC;IAC5D,MAAME,GAAG,GAAGpG,OAAO,CAACqG,eAAe,CAACL,YAAY,EAAEE,MAAM,CAAC;IACzD,OAAOE,GAAG,IAAIH,YAAY,GAAGA,YAAY;EAC7C;EACA;AACJ;AACA;AACA;AACA;AACA;EACI,OAAO7B,qBAAqBA,CAACkC,eAAe,EAAErC,aAAa,EAAE;IACzD,KAAK,IAAIsC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAE,EAAEA,CAAC,EAAE;MACxB,MAAMC,YAAY,GAAGvC,aAAa,CAACsC,CAAC,CAAC;MACrC,KAAK,IAAIE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAE,EAAEA,CAAC,EAAE;QACxB,IAAID,YAAY,CAACE,aAAa,CAACJ,eAAe,CAACG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;UACpD,OAAO,KAAK;QAChB;MACJ;IACJ;IACA,OAAO,IAAI;EACf;EACA;AACJ;AACA;AACA;AACA;AACA;EACI,OAAOvC,WAAWA,CAACoC,eAAe,EAAErC,aAAa,EAAE;IAC/C,KAAK,IAAIsC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAE,EAAEA,CAAC,EAAE;MACxB,IAAII,cAAc,GAAG,IAAI;MACzB,MAAMH,YAAY,GAAGvC,aAAa,CAACsC,CAAC,CAAC;MACrC,KAAK,IAAIE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAE,EAAEA,CAAC,EAAE;QACxB,IAAID,YAAY,CAACE,aAAa,CAACJ,eAAe,CAACG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;UACrDE,cAAc,GAAG,KAAK;UACtB;QACJ;MACJ;MACA,IAAIA,cAAc,EAAE;QAChB,OAAO,KAAK;MAChB;IACJ;IACA,OAAO,IAAI;EACf;AACJ;AACAzG,WAAW,CAACuC,WAAW,GAAG3C,UAAU,CAAC,CAAC,EAAEE,OAAO,CAACQ,IAAI,CAAC","ignoreList":[]},"metadata":{},"sourceType":"module","externalDependencies":[]}
|
