npm - @roomle/web-sdk - Versions diffs - 5.1.0-alpha.3 → 5.1.0-alpha.5 - Mend

@roomle/web-sdk 5.1.0-alpha.3 → 5.1.0-alpha.5

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (137) hide show

package/lib/{src-HhklrVDg.mjs.map → src-Dg0wYIom.mjs.map} RENAMED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"src-HhklrVDg.mjs","names":["shapecastFunc","temp1","IS_GT_REVISION_169","IS_LT_REVISION_161","_uvA","_uvB","_uvC","_normalA","_normalB","_normalC","iterateOverTriangles","_raycast","_xyzFields","_raycastFirst","boundingBox","triangle","triangle2","invertedMat","obb","obb2","_intersectsGeometry","tempMatrix","obb","obb2","temp1","temp2","temp3","temp4","obb","obb2","_ray","_inverseMatrix","iterateOverTriangles","_inverseMatrix","_vec","_ray","BVHShaderGLSL.bvh_struct_definitions","BVHShaderGLSL.bvh_distance_functions","BVHShaderGLSL.common_functions","BVHShaderGLSL.bvh_ray_functions"],"sources":["../../../../node_modules/three-mesh-bvh/src/core/Constants.js","../../../../node_modules/three-mesh-bvh/src/utils/ArrayBoxUtilities.js","../../../../node_modules/three-mesh-bvh/src/core/utils/nodeBufferUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/computeBoundsUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/splitUtils.js","../../../../node_modules/three-mesh-bvh/src/core/BVHNode.js","../../../../node_modules/three-mesh-bvh/src/core/build/sortUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/buildUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/buildTree.js","../../../../node_modules/three-mesh-bvh/src/utils/PrimitivePool.js","../../../../node_modules/three-mesh-bvh/src/core/utils/BufferStack.js","../../../../node_modules/three-mesh-bvh/src/core/cast/shapecast.js","../../../../node_modules/three-mesh-bvh/src/core/cast/bvhcast.js","../../../../node_modules/three-mesh-bvh/src/core/BVHTraversalHelper.js","../../../../node_modules/three-mesh-bvh/src/core/BVH.js","../../../../node_modules/three-mesh-bvh/src/utils/BufferUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/geometryUtils.js","../../../../node_modules/three-mesh-bvh/src/core/GeometryBVH.js","../../../../node_modules/three-mesh-bvh/src/math/SeparatingAxisBounds.js","../../../../node_modules/three-mesh-bvh/src/math/MathUtilities.js","../../../../node_modules/three-mesh-bvh/src/math/ExtendedTriangle.js","../../../../node_modules/three-mesh-bvh/src/math/OrientedBox.js","../../../../node_modules/three-mesh-bvh/src/utils/ExtendedTrianglePool.js","../../../../node_modules/three-mesh-bvh/src/core/cast/closestPointToPoint.js","../../../../node_modules/three-mesh-bvh/src/utils/ThreeRayIntersectUtilities.js","../../../../node_modules/three-mesh-bvh/src/utils/TriangleUtilities.js","../../../../node_modules/three-mesh-bvh/src/core/utils/iterationUtils.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/refit.generated.js","../../../../node_modules/three-mesh-bvh/src/core/utils/intersectUtils.js","../../../../node_modules/three-mesh-bvh/src/core/utils/iterationUtils_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/raycast.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/raycastFirst.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/refit_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/raycast_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/raycastFirst_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/utils/GeometryRayIntersectUtilities.js","../../../../node_modules/three-mesh-bvh/src/core/MeshBVH.js","../../../../node_modules/three-mesh-bvh/src/core/ObjectBVH.js","../../../../node_modules/three-mesh-bvh/src/core/SkinnedMeshBVH.js","../../../../node_modules/three-mesh-bvh/src/webgl/glsl/common_functions.glsl.js","../../../../node_modules/three-mesh-bvh/src/webgl/glsl/bvh_distance_functions.glsl.js","../../../../node_modules/three-mesh-bvh/src/webgl/glsl/bvh_ray_functions.glsl.js","../../../../node_modules/three-mesh-bvh/src/webgl/glsl/bvh_struct_definitions.glsl.js","../../../../node_modules/three-mesh-bvh/src/index.js"],"sourcesContent":["// Split strategy constants\n\n/*\n Option for splitting each BVH node down the center of the longest axis of the bounds.\n \n This is the fastest construction option and will yield a good, performant bounds.\n * @type {number}\n /\nexport const CENTER = 0;\n\n/\n Option for splitting each BVH node at the average point along the longest axis for\n * all triangle centroids in the bounds.\n \n This strategy may be better than `CENTER` with some geometry.\n * @type {number}\n /\nexport const AVERAGE = 1;\n\n/\n Option to use a Surface Area Heuristic to split the bounds more optimally. This SAH\n * implementation tests 32 discrete splits in each node along each axis to determine\n * which split is the lowest cost.\n \n This is the slowest construction option but will yield the best bounds of the three\n * options and use the least memory.\n * @type {number}\n /\nexport const SAH = 2;\n\n// Traversal constants\n\n/\n Indicates the shape did not intersect the given bounding box.\n * @type {number}\n /\nexport const NOT_INTERSECTED = 0;\n\n/\n Indicates the shape did intersect the given bounding box.\n * @type {number}\n /\nexport const INTERSECTED = 1;\n\n/\n Indicate the shape entirely contains the given bounding box.\n * @type {number}\n /\nexport const CONTAINED = 2;\n\n// SAH cost constants\n// TODO: hone these costs more. The relative difference between them should be the\n// difference in measured time to perform a primitive intersection vs traversing\n// bounds.\n// TODO: could be tuned per primitive type (triangles vs lines vs points)\nexport const PRIMITIVE_INTERSECT_COST = 1.25;\nexport const TRAVERSAL_COST = 1;\n\n\n// Build constants\nexport const BYTES_PER_NODE = 6 4 + 4 + 4;\nexport const UINT32_PER_NODE = BYTES_PER_NODE / 4;\nexport const IS_LEAFNODE_FLAG = 0xFFFF;\n\n// Bit masks for 32 bit node data\nexport const LEAFNODE_MASK_32 = IS_LEAFNODE_FLAG << 16;\n\n// EPSILON for computing floating point error during build\n// https://en.wikipedia.org/wiki/Machine_epsilon#Values_for_standard_hardware_floating_point_arithmetics\nexport const FLOAT32_EPSILON = Math.pow( 2, - 24 );\n\nexport const SKIP_GENERATION = Symbol( 'SKIP_GENERATION' );\n\nexport const DEFAULT_OPTIONS = {\n\tstrategy: CENTER,\n\tmaxDepth: 40,\n\ttargetLeafSize: 10,\n\tuseSharedArrayBuffer: false,\n\tsetBoundingBox: true,\n\tonProgress: null,\n\tindirect: false,\n\tverbose: true,\n\trange: null,\n\t[ SKIP_GENERATION ]: false,\n};\n\n","export function arrayToBox( nodeIndex32, array, target ) {\n\n\ttarget.min.x = array[ nodeIndex32 ];\n\ttarget.min.y = array[ nodeIndex32 + 1 ];\n\ttarget.min.z = array[ nodeIndex32 + 2 ];\n\n\ttarget.max.x = array[ nodeIndex32 + 3 ];\n\ttarget.max.y = array[ nodeIndex32 + 4 ];\n\ttarget.max.z = array[ nodeIndex32 + 5 ];\n\n\treturn target;\n\n}\n\nexport function makeEmptyBounds( target ) {\n\n\ttarget[ 0 ] = target[ 1 ] = target[ 2 ] = Infinity;\n\ttarget[ 3 ] = target[ 4 ] = target[ 5 ] = - Infinity;\n\n}\n\nexport function getLongestEdgeIndex( bounds ) {\n\n\tlet splitDimIdx = - 1;\n\tlet splitDist = - Infinity;\n\n\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\tconst dist = bounds[ i + 3 ] - bounds[ i ];\n\t\tif ( dist > splitDist ) {\n\n\t\t\tsplitDist = dist;\n\t\t\tsplitDimIdx = i;\n\n\t\t}\n\n\t}\n\n\treturn splitDimIdx;\n\n}\n\n// copies bounds a into bounds b\nexport function copyBounds( source, target ) {\n\n\ttarget.set( source );\n\n}\n\n// sets bounds target to the union of bounds a and b\nexport function unionBounds( a, b, target ) {\n\n\tlet aVal, bVal;\n\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\tconst d3 = d + 3;\n\n\t\t// set the minimum values\n\t\taVal = a[ d ];\n\t\tbVal = b[ d ];\n\t\ttarget[ d ] = aVal < bVal ? aVal : bVal;\n\n\t\t// set the max values\n\t\taVal = a[ d3 ];\n\t\tbVal = b[ d3 ];\n\t\ttarget[ d3 ] = aVal > bVal ? aVal : bVal;\n\n\t}\n\n}\n\n// expands the given bounds by the provided primitive bounds\nexport function expandByPrimitiveBounds( startIndex, primitiveBounds, bounds ) {\n\n\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\tconst tCenter = primitiveBounds[ startIndex + 2 * d ];\n\t\tconst tHalf = primitiveBounds[ startIndex + 2 * d + 1 ];\n\n\t\tconst tMin = tCenter - tHalf;\n\t\tconst tMax = tCenter + tHalf;\n\n\t\tif ( tMin < bounds[ d ] ) {\n\n\t\t\tbounds[ d ] = tMin;\n\n\t\t}\n\n\t\tif ( tMax > bounds[ d + 3 ] ) {\n\n\t\t\tbounds[ d + 3 ] = tMax;\n\n\t\t}\n\n\t}\n\n}\n\n// compute bounds surface area\nexport function computeSurfaceArea( bounds ) {\n\n\tconst d0 = bounds[ 3 ] - bounds[ 0 ];\n\tconst d1 = bounds[ 4 ] - bounds[ 1 ];\n\tconst d2 = bounds[ 5 ] - bounds[ 2 ];\n\n\treturn 2 * ( d0 * d1 + d1 * d2 + d2 * d0 );\n\n}\n","import { IS_LEAFNODE_FLAG, UINT32_PER_NODE } from '../Constants.js';\n\nexport function IS_LEAF( n16, uint16Array ) {\n\n\treturn uint16Array[ n16 + 15 ] === IS_LEAFNODE_FLAG;\n\n}\n\nexport function OFFSET( n32, uint32Array ) {\n\n\treturn uint32Array[ n32 + 6 ];\n\n}\n\nexport function COUNT( n16, uint16Array ) {\n\n\treturn uint16Array[ n16 + 14 ];\n\n}\n\n// Returns the uint32-aligned offset of the left child node for performance\nexport function LEFT_NODE( n32 ) {\n\n\treturn n32 + UINT32_PER_NODE;\n\n}\n\n// Returns the uint32-aligned offset of the right child node for performance\nexport function RIGHT_NODE( n32, uint32Array ) {\n\n\t// stored value is relative offset from parent, convert to absolute uint32 index\n\tconst relativeOffset = uint32Array[ n32 + 6 ];\n\treturn n32 + relativeOffset * UINT32_PER_NODE;\n\n}\n\nexport function SPLIT_AXIS( n32, uint32Array ) {\n\n\treturn uint32Array[ n32 + 7 ];\n\n}\n\nexport function BOUNDING_DATA_INDEX( n32 ) {\n\n\treturn n32;\n\n}\n","// computes the union of the bounds of all of the given primitives and puts the resulting box in \"target\".\n// A bounding box is computed for the centroids of the primitives, as well, and placed in \"centroidTarget\".\n// These are computed together to avoid redundant accesses to bounds array.\nexport function getBounds( primitiveBounds, offset, count, target, centroidTarget ) {\n\n\tlet minx = Infinity;\n\tlet miny = Infinity;\n\tlet minz = Infinity;\n\tlet maxx = - Infinity;\n\tlet maxy = - Infinity;\n\tlet maxz = - Infinity;\n\n\tlet cminx = Infinity;\n\tlet cminy = Infinity;\n\tlet cminz = Infinity;\n\tlet cmaxx = - Infinity;\n\tlet cmaxy = - Infinity;\n\tlet cmaxz = - Infinity;\n\n\tconst boundsOffset = primitiveBounds.offset \|\| 0;\n\tfor ( let i = ( offset - boundsOffset ) * 6, end = ( offset + count - boundsOffset ) * 6; i < end; i += 6 ) {\n\n\t\tconst cx = primitiveBounds[ i + 0 ];\n\t\tconst hx = primitiveBounds[ i + 1 ];\n\t\tconst lx = cx - hx;\n\t\tconst rx = cx + hx;\n\t\tif ( lx < minx ) minx = lx;\n\t\tif ( rx > maxx ) maxx = rx;\n\t\tif ( cx < cminx ) cminx = cx;\n\t\tif ( cx > cmaxx ) cmaxx = cx;\n\n\t\tconst cy = primitiveBounds[ i + 2 ];\n\t\tconst hy = primitiveBounds[ i + 3 ];\n\t\tconst ly = cy - hy;\n\t\tconst ry = cy + hy;\n\t\tif ( ly < miny ) miny = ly;\n\t\tif ( ry > maxy ) maxy = ry;\n\t\tif ( cy < cminy ) cminy = cy;\n\t\tif ( cy > cmaxy ) cmaxy = cy;\n\n\t\tconst cz = primitiveBounds[ i + 4 ];\n\t\tconst hz = primitiveBounds[ i + 5 ];\n\t\tconst lz = cz - hz;\n\t\tconst rz = cz + hz;\n\t\tif ( lz < minz ) minz = lz;\n\t\tif ( rz > maxz ) maxz = rz;\n\t\tif ( cz < cminz ) cminz = cz;\n\t\tif ( cz > cmaxz ) cmaxz = cz;\n\n\t}\n\n\ttarget[ 0 ] = minx;\n\ttarget[ 1 ] = miny;\n\ttarget[ 2 ] = minz;\n\n\ttarget[ 3 ] = maxx;\n\ttarget[ 4 ] = maxy;\n\ttarget[ 5 ] = maxz;\n\n\tcentroidTarget[ 0 ] = cminx;\n\tcentroidTarget[ 1 ] = cminy;\n\tcentroidTarget[ 2 ] = cminz;\n\n\tcentroidTarget[ 3 ] = cmaxx;\n\tcentroidTarget[ 4 ] = cmaxy;\n\tcentroidTarget[ 5 ] = cmaxz;\n\n}\n","import { getLongestEdgeIndex, computeSurfaceArea, copyBounds, unionBounds, expandByPrimitiveBounds } from '../../utils/ArrayBoxUtilities.js';\nimport { CENTER, AVERAGE, SAH, PRIMITIVE_INTERSECT_COST, TRAVERSAL_COST } from '../Constants.js';\n\nconst BIN_COUNT = 32;\nconst binsSort = ( a, b ) => a.candidate - b.candidate;\nconst sahBins = /* @__PURE__ / new Array( BIN_COUNT ).fill().map( () => {\n\n\treturn {\n\n\t\tcount: 0,\n\t\tbounds: new Float32Array( 6 ),\n\t\trightCacheBounds: new Float32Array( 6 ),\n\t\tleftCacheBounds: new Float32Array( 6 ),\n\t\tcandidate: 0,\n\n\t};\n\n} );\nconst leftBounds = / @__PURE__ / new Float32Array( 6 );\n\nexport function getOptimalSplit( nodeBoundingData, centroidBoundingData, primitiveBounds, offset, count, strategy ) {\n\n\tlet axis = - 1;\n\tlet pos = 0;\n\n\t// Center\n\tif ( strategy === CENTER ) {\n\n\t\taxis = getLongestEdgeIndex( centroidBoundingData );\n\t\tif ( axis !== - 1 ) {\n\n\t\t\tpos = ( centroidBoundingData[ axis ] + centroidBoundingData[ axis + 3 ] ) / 2;\n\n\t\t}\n\n\t} else if ( strategy === AVERAGE ) {\n\n\t\taxis = getLongestEdgeIndex( nodeBoundingData );\n\t\tif ( axis !== - 1 ) {\n\n\t\t\tpos = getAverage( primitiveBounds, offset, count, axis );\n\n\t\t}\n\n\t} else if ( strategy === SAH ) {\n\n\t\tconst rootSurfaceArea = computeSurfaceArea( nodeBoundingData );\n\t\tlet bestCost = PRIMITIVE_INTERSECT_COST count;\n\n\t\t// iterate over all axes\n\t\tconst boundsOffset = primitiveBounds.offset \|\| 0;\n\t\tconst cStart = ( offset - boundsOffset ) * 6;\n\t\tconst cEnd = ( offset + count - boundsOffset ) * 6;\n\t\tfor ( let a = 0; a < 3; a ++ ) {\n\n\t\t\tconst axisLeft = centroidBoundingData[ a ];\n\t\t\tconst axisRight = centroidBoundingData[ a + 3 ];\n\t\t\tconst axisLength = axisRight - axisLeft;\n\t\t\tconst binWidth = axisLength / BIN_COUNT;\n\n\t\t\t// If we have fewer primitives than we're planning to split then just check all\n\t\t\t// the primitive positions because it will be faster.\n\t\t\tif ( count < BIN_COUNT / 4 ) {\n\n\t\t\t\t// initialize the bin candidates\n\t\t\t\tconst truncatedBins = [ ...sahBins ];\n\t\t\t\ttruncatedBins.length = count;\n\n\t\t\t\t// set the candidates\n\t\t\t\tlet b = 0;\n\t\t\t\tfor ( let c = cStart; c < cEnd; c += 6, b ++ ) {\n\n\t\t\t\t\tconst bin = truncatedBins[ b ];\n\t\t\t\t\tbin.candidate = primitiveBounds[ c + 2 * a ];\n\t\t\t\t\tbin.count = 0;\n\n\t\t\t\t\tconst {\n\t\t\t\t\t\tbounds,\n\t\t\t\t\t\tleftCacheBounds,\n\t\t\t\t\t\trightCacheBounds,\n\t\t\t\t\t} = bin;\n\t\t\t\t\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\t\t\t\t\trightCacheBounds[ d ] = Infinity;\n\t\t\t\t\t\trightCacheBounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t\tleftCacheBounds[ d ] = Infinity;\n\t\t\t\t\t\tleftCacheBounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t\tbounds[ d ] = Infinity;\n\t\t\t\t\t\tbounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t}\n\n\t\t\t\t\texpandByPrimitiveBounds( c, primitiveBounds, bounds );\n\n\t\t\t\t}\n\n\t\t\t\ttruncatedBins.sort( binsSort );\n\n\t\t\t\t// remove redundant splits\n\t\t\t\tlet splitCount = count;\n\t\t\t\tfor ( let bi = 0; bi < splitCount; bi ++ ) {\n\n\t\t\t\t\tconst bin = truncatedBins[ bi ];\n\t\t\t\t\twhile ( bi + 1 < splitCount && truncatedBins[ bi + 1 ].candidate === bin.candidate ) {\n\n\t\t\t\t\t\ttruncatedBins.splice( bi + 1, 1 );\n\t\t\t\t\t\tsplitCount --;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// find the appropriate bin for each primitive and expand the bounds.\n\t\t\t\tfor ( let c = cStart; c < cEnd; c += 6 ) {\n\n\t\t\t\t\tconst center = primitiveBounds[ c + 2 * a ];\n\t\t\t\t\tfor ( let bi = 0; bi < splitCount; bi ++ ) {\n\n\t\t\t\t\t\tconst bin = truncatedBins[ bi ];\n\t\t\t\t\t\tif ( center >= bin.candidate ) {\n\n\t\t\t\t\t\t\texpandByPrimitiveBounds( c, primitiveBounds, bin.rightCacheBounds );\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\texpandByPrimitiveBounds( c, primitiveBounds, bin.leftCacheBounds );\n\t\t\t\t\t\t\tbin.count ++;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// expand all the bounds\n\t\t\t\tfor ( let bi = 0; bi < splitCount; bi ++ ) {\n\n\t\t\t\t\tconst bin = truncatedBins[ bi ];\n\t\t\t\t\tconst leftCount = bin.count;\n\t\t\t\t\tconst rightCount = count - bin.count;\n\n\t\t\t\t\t// check the cost of this split\n\t\t\t\t\tconst leftBounds = bin.leftCacheBounds;\n\t\t\t\t\tconst rightBounds = bin.rightCacheBounds;\n\n\t\t\t\t\tlet leftProb = 0;\n\t\t\t\t\tif ( leftCount !== 0 ) {\n\n\t\t\t\t\t\tleftProb = computeSurfaceArea( leftBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tlet rightProb = 0;\n\t\t\t\t\tif ( rightCount !== 0 ) {\n\n\t\t\t\t\t\trightProb = computeSurfaceArea( rightBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tconst cost = TRAVERSAL_COST + PRIMITIVE_INTERSECT_COST * (\n\t\t\t\t\t\tleftProb * leftCount + rightProb * rightCount\n\t\t\t\t\t);\n\n\t\t\t\t\tif ( cost < bestCost ) {\n\n\t\t\t\t\t\taxis = a;\n\t\t\t\t\t\tbestCost = cost;\n\t\t\t\t\t\tpos = bin.candidate;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// reset the bins\n\t\t\t\tfor ( let i = 0; i < BIN_COUNT; i ++ ) {\n\n\t\t\t\t\tconst bin = sahBins[ i ];\n\t\t\t\t\tbin.count = 0;\n\t\t\t\t\tbin.candidate = axisLeft + binWidth + i * binWidth;\n\n\t\t\t\t\tconst bounds = bin.bounds;\n\t\t\t\t\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\t\t\t\t\tbounds[ d ] = Infinity;\n\t\t\t\t\t\tbounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// iterate over all center positions\n\t\t\t\tfor ( let c = cStart; c < cEnd; c += 6 ) {\n\n\t\t\t\t\tconst triCenter = primitiveBounds[ c + 2 * a ];\n\t\t\t\t\tconst relativeCenter = triCenter - axisLeft;\n\n\t\t\t\t\t// in the partition function if the centroid lies on the split plane then it is\n\t\t\t\t\t// considered to be on the right side of the split\n\t\t\t\t\tlet binIndex = ~ ~ ( relativeCenter / binWidth );\n\t\t\t\t\tif ( binIndex >= BIN_COUNT ) binIndex = BIN_COUNT - 1;\n\n\t\t\t\t\tconst bin = sahBins[ binIndex ];\n\t\t\t\t\tbin.count ++;\n\n\t\t\t\t\texpandByPrimitiveBounds( c, primitiveBounds, bin.bounds );\n\n\t\t\t\t}\n\n\t\t\t\t// cache the unioned bounds from right to left so we don't have to regenerate them each time\n\t\t\t\tconst lastBin = sahBins[ BIN_COUNT - 1 ];\n\t\t\t\tcopyBounds( lastBin.bounds, lastBin.rightCacheBounds );\n\t\t\t\tfor ( let i = BIN_COUNT - 2; i >= 0; i -- ) {\n\n\t\t\t\t\tconst bin = sahBins[ i ];\n\t\t\t\t\tconst nextBin = sahBins[ i + 1 ];\n\t\t\t\t\tunionBounds( bin.bounds, nextBin.rightCacheBounds, bin.rightCacheBounds );\n\n\t\t\t\t}\n\n\t\t\t\tlet leftCount = 0;\n\t\t\t\tfor ( let i = 0; i < BIN_COUNT - 1; i ++ ) {\n\n\t\t\t\t\tconst bin = sahBins[ i ];\n\t\t\t\t\tconst binCount = bin.count;\n\t\t\t\t\tconst bounds = bin.bounds;\n\n\t\t\t\t\tconst nextBin = sahBins[ i + 1 ];\n\t\t\t\t\tconst rightBounds = nextBin.rightCacheBounds;\n\n\t\t\t\t\t// don't do anything with the bounds if the new bounds have no primitives\n\t\t\t\t\tif ( binCount !== 0 ) {\n\n\t\t\t\t\t\tif ( leftCount === 0 ) {\n\n\t\t\t\t\t\t\tcopyBounds( bounds, leftBounds );\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\tunionBounds( bounds, leftBounds, leftBounds );\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t\tleftCount += binCount;\n\n\t\t\t\t\t// check the cost of this split\n\t\t\t\t\tlet leftProb = 0;\n\t\t\t\t\tlet rightProb = 0;\n\n\t\t\t\t\tif ( leftCount !== 0 ) {\n\n\t\t\t\t\t\tleftProb = computeSurfaceArea( leftBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tconst rightCount = count - leftCount;\n\t\t\t\t\tif ( rightCount !== 0 ) {\n\n\t\t\t\t\t\trightProb = computeSurfaceArea( rightBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tconst cost = TRAVERSAL_COST + PRIMITIVE_INTERSECT_COST * (\n\t\t\t\t\t\tleftProb * leftCount + rightProb * rightCount\n\t\t\t\t\t);\n\n\t\t\t\t\tif ( cost < bestCost ) {\n\n\t\t\t\t\t\taxis = a;\n\t\t\t\t\t\tbestCost = cost;\n\t\t\t\t\t\tpos = bin.candidate;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t} else {\n\n\t\tconsole.warn( `BVH: Invalid build strategy value ${ strategy } used.` );\n\n\t}\n\n\treturn { axis, pos };\n\n}\n\n// returns the average coordinate on the specified axis of all the provided primitives\nfunction getAverage( primitiveBounds, offset, count, axis ) {\n\n\tlet avg = 0;\n\tconst boundsOffset = primitiveBounds.offset;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\tavg += primitiveBounds[ ( i - boundsOffset ) * 6 + axis * 2 ];\n\n\t}\n\n\treturn avg / count;\n\n}\n","export class BVHNode {\n\n\tconstructor() {\n\n\t\t// internal nodes have boundingData, left, right, and splitAxis\n\t\t// leaf nodes have offset and count (referring to primitives in the mesh geometry)\n\n\t\tthis.boundingData = new Float32Array( 6 );\n\n\t}\n\n}\n","// reorders the partition buffer such that for `count` elements after `offset`, elements on the left side of the split\n// will be on the left and elements on the right side of the split will be on the right. returns the index\n// of the first element on the right side, or offset + count if there are no elements on the right side.\nexport function partition( buffer, stride, primitiveBounds, offset, count, split ) {\n\n\tlet left = offset;\n\tlet right = offset + count - 1;\n\tconst pos = split.pos;\n\tconst axisOffset = split.axis * 2;\n\tconst boundsOffset = primitiveBounds.offset \|\| 0;\n\n\t// hoare partitioning, see e.g. https://en.wikipedia.org/wiki/Quicksort#Hoare_partition_scheme\n\twhile ( true ) {\n\n\t\twhile ( left <= right && primitiveBounds[ ( left - boundsOffset ) * 6 + axisOffset ] < pos ) {\n\n\t\t\tleft ++;\n\n\t\t}\n\n\t\t// if a primitive center lies on the partition plane it is considered to be on the right side\n\t\twhile ( left <= right && primitiveBounds[ ( right - boundsOffset ) * 6 + axisOffset ] >= pos ) {\n\n\t\t\tright --;\n\n\t\t}\n\n\t\tif ( left < right ) {\n\n\t\t\t// we need to swap all of the information associated with the primitives at index\n\t\t\t// left and right; that's the elements in the partition buffer and the bounds\n\t\t\tfor ( let i = 0; i < stride; i ++ ) {\n\n\t\t\t\tlet t0 = buffer[ left * stride + i ];\n\t\t\t\tbuffer[ left * stride + i ] = buffer[ right * stride + i ];\n\t\t\t\tbuffer[ right * stride + i ] = t0;\n\n\t\t\t}\n\n\t\t\t// swap bounds\n\t\t\tfor ( let i = 0; i < 6; i ++ ) {\n\n\t\t\t\tconst l = left - boundsOffset;\n\t\t\t\tconst r = right - boundsOffset;\n\t\t\t\tconst tb = primitiveBounds[ l * 6 + i ];\n\t\t\t\tprimitiveBounds[ l * 6 + i ] = primitiveBounds[ r * 6 + i ];\n\t\t\t\tprimitiveBounds[ r * 6 + i ] = tb;\n\n\t\t\t}\n\n\t\t\tleft ++;\n\t\t\tright --;\n\n\t\t} else {\n\n\t\t\treturn left;\n\n\t\t}\n\n\t}\n\n}\n","import { BYTES_PER_NODE, IS_LEAFNODE_FLAG } from '../Constants.js';\n\nlet float32Array, uint32Array, uint16Array, uint8Array;\nconst MAX_POINTER = Math.pow( 2, 32 );\n\nexport function countNodes( node ) {\n\n\tif ( 'count' in node ) {\n\n\t\treturn 1;\n\n\t} else {\n\n\t\treturn 1 + countNodes( node.left ) + countNodes( node.right );\n\n\t}\n\n}\n\nexport function populateBuffer( byteOffset, node, buffer ) {\n\n\tfloat32Array = new Float32Array( buffer );\n\tuint32Array = new Uint32Array( buffer );\n\tuint16Array = new Uint16Array( buffer );\n\tuint8Array = new Uint8Array( buffer );\n\n\treturn _populateBuffer( byteOffset, node );\n\n}\n\n// pack structure\n// boundingData \t\t\t\t: 6 float32\n// right / offset \t\t\t\t: 1 uint32\n// splitAxis / isLeaf + count \t: 1 uint32 / 2 uint16\nfunction _populateBuffer( byteOffset, node ) {\n\n\tconst node32Index = byteOffset / 4;\n\tconst node16Index = byteOffset / 2;\n\tconst isLeaf = 'count' in node;\n\tconst boundingData = node.boundingData;\n\tfor ( let i = 0; i < 6; i ++ ) {\n\n\t\tfloat32Array[ node32Index + i ] = boundingData[ i ];\n\n\t}\n\n\tif ( isLeaf ) {\n\n\t\tif ( node.buffer ) {\n\n\t\t\tuint8Array.set( new Uint8Array( node.buffer ), byteOffset );\n\t\t\treturn byteOffset + node.buffer.byteLength;\n\n\t\t} else {\n\n\t\t\tuint32Array[ node32Index + 6 ] = node.offset;\n\t\t\tuint16Array[ node16Index + 14 ] = node.count;\n\t\t\tuint16Array[ node16Index + 15 ] = IS_LEAFNODE_FLAG;\n\t\t\treturn byteOffset + BYTES_PER_NODE;\n\n\t\t}\n\n\t} else {\n\n\t\tconst { left, right, splitAxis } = node;\n\n\t\t// fill in the left node contents\n\t\tconst leftByteOffset = byteOffset + BYTES_PER_NODE;\n\t\tlet rightByteOffset = _populateBuffer( leftByteOffset, left );\n\n\t\t// calculate relative offset from parent to right child\n\t\tconst currentNodeIndex = byteOffset / BYTES_PER_NODE;\n\t\tconst rightNodeIndex = rightByteOffset / BYTES_PER_NODE;\n\t\tconst relativeRightIndex = rightNodeIndex - currentNodeIndex;\n\n\t\t// check if the relative offset is too high\n\t\tif ( relativeRightIndex > MAX_POINTER ) {\n\n\t\t\tthrow new Error( 'MeshBVH: Cannot store relative child node offset greater than 32 bits.' );\n\n\t\t}\n\n\t\t// fill in the right node contents (store as relative offset)\n\t\tuint32Array[ node32Index + 6 ] = relativeRightIndex;\n\t\tuint32Array[ node32Index + 7 ] = splitAxis;\n\n\t\t// return the next available buffer pointer\n\t\treturn _populateBuffer( rightByteOffset, right );\n\n\t}\n\n}\n","import { getBounds } from './computeBoundsUtils.js';\nimport { getOptimalSplit } from './splitUtils.js';\nimport { getLongestEdgeIndex } from '../../utils/ArrayBoxUtilities.js';\nimport { BVHNode } from '../BVHNode.js';\nimport { BYTES_PER_NODE } from '../Constants.js';\n\nimport { partition } from './sortUtils.js';\nimport { countNodes, populateBuffer } from './buildUtils.js';\n\nexport function buildTree( bvh, primitiveBounds, offset, count, options, loadRange ) {\n\n\t// expand variables\n\tconst {\n\t\tmaxDepth,\n\t\tverbose,\n\t\ttargetLeafSize,\n\t\t_strictLeafSize = Infinity,\n\t\tstrategy,\n\t\tonProgress,\n\t} = options;\n\n\tconst partitionBuffer = bvh.primitiveBuffer;\n\tconst partitionStride = bvh.primitiveBufferStride;\n\n\t// generate intermediate variables\n\tconst cacheCentroidBoundingData = new Float32Array( 6 );\n\tlet reachedMaxDepth = false;\n\n\tconst root = new BVHNode();\n\tgetBounds( primitiveBounds, offset, count, root.boundingData, cacheCentroidBoundingData );\n\tsplitNode( root, offset, count, cacheCentroidBoundingData );\n\treturn root;\n\n\tfunction triggerProgress( primitivesProcessed ) {\n\n\t\tif ( onProgress ) {\n\n\t\t\tonProgress( ( primitivesProcessed - loadRange.offset ) / loadRange.count );\n\n\t\t}\n\n\t}\n\n\t// either recursively splits the given node, creating left and right subtrees for it, or makes it a leaf node,\n\t// recording the offset and count of its primitives and writing them into the reordered geometry index.\n\tfunction splitNode( node, offset, count, centroidBoundingData = null, depth = 0 ) {\n\n\t\tif ( ! reachedMaxDepth && depth >= maxDepth ) {\n\n\t\t\treachedMaxDepth = true;\n\t\t\tif ( verbose ) {\n\n\t\t\t\tconsole.warn( `BVH: Max depth of ${ maxDepth } reached when generating BVH. Consider increasing maxDepth.` );\n\n\t\t\t}\n\n\t\t}\n\n\t\t// A hard guarantee that no leaf exceeds \"_strictLeafSize\" primitives. When this node is over\n\t\t// that limit it must keep splitting regardless of the heuristic.\n\t\tconst mustSplit = count > _strictLeafSize;\n\n\t\t// early out if we've met our capacity - unless the strict guarantee still requires a split\n\t\tif ( ( count <= targetLeafSize && ! mustSplit ) \|\| depth >= maxDepth ) {\n\n\t\t\ttriggerProgress( offset + count );\n\t\t\tnode.offset = offset;\n\t\t\tnode.count = count;\n\t\t\treturn node;\n\n\t\t}\n\n\t\t// Find where to split the volume\n\t\tconst split = getOptimalSplit( node.boundingData, centroidBoundingData, primitiveBounds, offset, count, strategy );\n\t\tlet splitOffset = split.axis === - 1 ? - 1 : partition( partitionBuffer, partitionStride, primitiveBounds, offset, count, split );\n\n\t\t// If the heuristic can't produce a usable split then make a leaf unless the strict guarantee requires the split -\n\t\t// in which case force an arbitrary median split. The axis comes from the node bounds so parallel and serial\n\t\t// builds produce identical trees.\n\t\tif ( split.axis === - 1 \|\| splitOffset === offset \|\| splitOffset === offset + count ) {\n\n\t\t\tif ( ! mustSplit ) {\n\n\t\t\t\ttriggerProgress( offset + count );\n\t\t\t\tnode.offset = offset;\n\t\t\t\tnode.count = count;\n\t\t\t\treturn node;\n\n\t\t\t}\n\n\t\t\tsplit.axis = Math.max( 0, getLongestEdgeIndex( node.boundingData ) );\n\t\t\tsplitOffset = offset + Math.max( 1, Math.floor( count / 2 ) );\n\n\t\t}\n\n\t\t// create the two new child nodes\n\t\tnode.splitAxis = split.axis;\n\n\t\t// create the left child and compute its bounding box\n\t\tconst left = new BVHNode();\n\t\tconst lstart = offset;\n\t\tconst lcount = splitOffset - offset;\n\t\tnode.left = left;\n\n\t\tgetBounds( primitiveBounds, lstart, lcount, left.boundingData, cacheCentroidBoundingData );\n\t\tsplitNode( left, lstart, lcount, cacheCentroidBoundingData, depth + 1 );\n\n\t\t// repeat for right\n\t\tconst right = new BVHNode();\n\t\tconst rstart = splitOffset;\n\t\tconst rcount = count - lcount;\n\t\tnode.right = right;\n\n\t\tgetBounds( primitiveBounds, rstart, rcount, right.boundingData, cacheCentroidBoundingData );\n\t\tsplitNode( right, rstart, rcount, cacheCentroidBoundingData, depth + 1 );\n\n\t\treturn node;\n\n\t}\n\n}\n\nexport function buildPackedTree( bvh, options ) {\n\n\tconst BufferConstructor = options.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer;\n\n\t// get the range of buffer data to construct / arrange\n\tconst rootRanges = bvh.getRootRanges( options.range );\n\tconst firstRange = rootRanges[ 0 ];\n\tconst lastRange = rootRanges[ rootRanges.length - 1 ];\n\tconst fullRange = {\n\t\toffset: firstRange.offset,\n\t\tcount: lastRange.offset + lastRange.count - firstRange.offset,\n\t};\n\n\t// construct the primitive bounds for sorting\n\tconst primitiveBounds = new Float32Array( 6 * fullRange.count );\n\tprimitiveBounds.offset = fullRange.offset;\n\tbvh.computePrimitiveBounds( fullRange.offset, fullRange.count, primitiveBounds );\n\n\t// Build BVH roots\n\tbvh._roots = rootRanges.map( range => {\n\n\t\tconst root = buildTree( bvh, primitiveBounds, range.offset, range.count, options, fullRange );\n\t\tconst nodeCount = countNodes( root );\n\t\tconst buffer = new BufferConstructor( BYTES_PER_NODE * nodeCount );\n\t\tpopulateBuffer( 0, root, buffer );\n\t\treturn buffer;\n\n\t} );\n\n}\n","export class PrimitivePool {\n\n\tconstructor( getNewPrimitive ) {\n\n\t\tthis._getNewPrimitive = getNewPrimitive;\n\t\tthis._primitives = [];\n\n\t}\n\n\tgetPrimitive() {\n\n\t\tconst primitives = this._primitives;\n\t\tif ( primitives.length === 0 ) {\n\n\t\t\treturn this._getNewPrimitive();\n\n\t\t} else {\n\n\t\t\treturn primitives.pop();\n\n\t\t}\n\n\t}\n\n\treleasePrimitive( primitive ) {\n\n\t\tthis._primitives.push( primitive );\n\n\t}\n\n}\n","class _BufferStack {\n\n\tconstructor() {\n\n\t\tthis.float32Array = null;\n\t\tthis.uint16Array = null;\n\t\tthis.uint32Array = null;\n\n\t\tconst stack = [];\n\t\tlet prevBuffer = null;\n\t\tthis.setBuffer = buffer => {\n\n\t\t\tif ( prevBuffer ) {\n\n\t\t\t\tstack.push( prevBuffer );\n\n\t\t\t}\n\n\t\t\tprevBuffer = buffer;\n\t\t\tthis.float32Array = new Float32Array( buffer );\n\t\t\tthis.uint16Array = new Uint16Array( buffer );\n\t\t\tthis.uint32Array = new Uint32Array( buffer );\n\n\t\t};\n\n\t\tthis.clearBuffer = () => {\n\n\t\t\tprevBuffer = null;\n\t\t\tthis.float32Array = null;\n\t\t\tthis.uint16Array = null;\n\t\t\tthis.uint32Array = null;\n\n\t\t\tif ( stack.length !== 0 ) {\n\n\t\t\t\tthis.setBuffer( stack.pop() );\n\n\t\t\t}\n\n\t\t};\n\n\t}\n\n}\n\nexport const BufferStack = /* @__PURE__ / new _BufferStack();\n","import { Box3 } from 'three';\nimport { CONTAINED, UINT32_PER_NODE } from '../Constants.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { PrimitivePool } from '../../utils/PrimitivePool.js';\nimport { COUNT, OFFSET, LEFT_NODE, RIGHT_NODE, IS_LEAF, BOUNDING_DATA_INDEX } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\n\nlet _box1, _box2;\nconst boxStack = [];\nconst boxPool = / @__PURE__ / new PrimitivePool( () => new Box3() );\n\nexport function shapecast( bvh, root, intersectsBounds, intersectsRange, boundsTraverseOrder, nodeOffset ) {\n\n\t// setup\n\t_box1 = boxPool.getPrimitive();\n\t_box2 = boxPool.getPrimitive();\n\tboxStack.push( _box1, _box2 );\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\n\tconst result = shapecastTraverse( 0, bvh.geometry, intersectsBounds, intersectsRange, boundsTraverseOrder, nodeOffset );\n\n\t// cleanup\n\tBufferStack.clearBuffer();\n\tboxPool.releasePrimitive( _box1 );\n\tboxPool.releasePrimitive( _box2 );\n\tboxStack.pop();\n\tboxStack.pop();\n\n\tconst length = boxStack.length;\n\tif ( length > 0 ) {\n\n\t\t_box2 = boxStack[ length - 1 ];\n\t\t_box1 = boxStack[ length - 2 ];\n\n\t}\n\n\treturn result;\n\n}\n\nfunction shapecastTraverse(\n\tnodeIndex32,\n\tgeometry,\n\tintersectsBoundsFunc,\n\tintersectsRangeFunc,\n\tnodeScoreFunc = null,\n\tnodeIndexOffset = 0, // offset for unique node identifier\n\tdepth = 0\n) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( nodeIndex32 ), float32Array, _box1 );\n\t\treturn intersectsRangeFunc( offset, count, false, depth, nodeIndexOffset + nodeIndex32 / UINT32_PER_NODE, _box1 );\n\n\t} else {\n\n\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\tlet c1 = left;\n\t\tlet c2 = right;\n\n\t\tlet score1, score2;\n\t\tlet box1, box2;\n\t\tif ( nodeScoreFunc ) {\n\n\t\t\tbox1 = _box1;\n\t\t\tbox2 = _box2;\n\n\t\t\t// bounding data is not offset\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( c1 ), float32Array, box1 );\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( c2 ), float32Array, box2 );\n\n\t\t\tscore1 = nodeScoreFunc( box1 );\n\t\t\tscore2 = nodeScoreFunc( box2 );\n\n\t\t\tif ( score2 < score1 ) {\n\n\t\t\t\tc1 = right;\n\t\t\t\tc2 = left;\n\n\t\t\t\tconst temp = score1;\n\t\t\t\tscore1 = score2;\n\t\t\t\tscore2 = temp;\n\n\t\t\t\tbox1 = box2;\n\t\t\t\t// box2 is always set before use below\n\n\t\t\t}\n\n\t\t}\n\n\t\t// Check box 1 intersection\n\t\tif ( ! box1 ) {\n\n\t\t\tbox1 = _box1;\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( c1 ), float32Array, box1 );\n\n\t\t}\n\n\t\tconst isC1Leaf = IS_LEAF( c1 * 2, uint16Array );\n\t\tconst c1Intersection = intersectsBoundsFunc( box1, isC1Leaf, score1, depth + 1, nodeIndexOffset + c1 / UINT32_PER_NODE );\n\n\t\tlet c1StopTraversal;\n\t\tif ( c1Intersection === CONTAINED ) {\n\n\t\t\tconst offset = getLeftOffset( c1 );\n\t\t\tconst end = getRightEndOffset( c1 );\n\t\t\tconst count = end - offset;\n\n\t\t\tc1StopTraversal = intersectsRangeFunc( offset, count, true, depth + 1, nodeIndexOffset + c1 / UINT32_PER_NODE, box1 );\n\n\t\t} else {\n\n\t\t\tc1StopTraversal =\n\t\t\t\tc1Intersection &&\n\t\t\t\tshapecastTraverse(\n\t\t\t\t\tc1,\n\t\t\t\t\tgeometry,\n\t\t\t\t\tintersectsBoundsFunc,\n\t\t\t\t\tintersectsRangeFunc,\n\t\t\t\t\tnodeScoreFunc,\n\t\t\t\t\tnodeIndexOffset,\n\t\t\t\t\tdepth + 1\n\t\t\t\t);\n\n\t\t}\n\n\t\tif ( c1StopTraversal ) return true;\n\n\t\t// Check box 2 intersection\n\t\t// cached box2 will have been overwritten by previous traversal\n\t\tbox2 = _box2;\n\t\tarrayToBox( BOUNDING_DATA_INDEX( c2 ), float32Array, box2 );\n\n\t\tconst isC2Leaf = IS_LEAF( c2 * 2, uint16Array );\n\t\tconst c2Intersection = intersectsBoundsFunc( box2, isC2Leaf, score2, depth + 1, nodeIndexOffset + c2 / UINT32_PER_NODE );\n\n\t\tlet c2StopTraversal;\n\t\tif ( c2Intersection === CONTAINED ) {\n\n\t\t\tconst offset = getLeftOffset( c2 );\n\t\t\tconst end = getRightEndOffset( c2 );\n\t\t\tconst count = end - offset;\n\n\t\t\tc2StopTraversal = intersectsRangeFunc( offset, count, true, depth + 1, nodeIndexOffset + c2 / UINT32_PER_NODE, box2 );\n\n\t\t} else {\n\n\t\t\tc2StopTraversal =\n\t\t\t\tc2Intersection &&\n\t\t\t\tshapecastTraverse(\n\t\t\t\t\tc2,\n\t\t\t\t\tgeometry,\n\t\t\t\t\tintersectsBoundsFunc,\n\t\t\t\t\tintersectsRangeFunc,\n\t\t\t\t\tnodeScoreFunc,\n\t\t\t\t\tnodeIndexOffset,\n\t\t\t\t\tdepth + 1\n\t\t\t\t);\n\n\t\t}\n\n\t\tif ( c2StopTraversal ) return true;\n\n\t\treturn false;\n\n\t\t// Define these inside the function so it has access to the local variables needed\n\t\t// when converting to the buffer equivalents\n\t\tfunction getLeftOffset( nodeIndex32 ) {\n\n\t\t\tconst { uint16Array, uint32Array } = BufferStack;\n\t\t\tlet nodeIndex16 = nodeIndex32 * 2;\n\n\t\t\t// traverse until we find a leaf\n\t\t\twhile ( ! IS_LEAF( nodeIndex16, uint16Array ) ) {\n\n\t\t\t\tnodeIndex32 = LEFT_NODE( nodeIndex32 );\n\t\t\t\tnodeIndex16 = nodeIndex32 * 2;\n\n\t\t\t}\n\n\t\t\treturn OFFSET( nodeIndex32, uint32Array );\n\n\t\t}\n\n\t\tfunction getRightEndOffset( nodeIndex32 ) {\n\n\t\t\tconst { uint16Array, uint32Array } = BufferStack;\n\t\t\tlet nodeIndex16 = nodeIndex32 * 2;\n\n\t\t\t// traverse until we find a leaf\n\t\t\twhile ( ! IS_LEAF( nodeIndex16, uint16Array ) ) {\n\n\t\t\t\t// adjust offset to point to the right node\n\t\t\t\tnodeIndex32 = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\t\t\tnodeIndex16 = nodeIndex32 * 2;\n\n\t\t\t}\n\n\t\t\t// return the end offset of the triangle range\n\t\t\treturn OFFSET( nodeIndex32, uint32Array ) + COUNT( nodeIndex16, uint16Array );\n\n\t\t}\n\n\t}\n\n}\n","import { Box3, Matrix4 } from 'three';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { BOUNDING_DATA_INDEX, COUNT, IS_LEAF, LEFT_NODE, OFFSET, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { PrimitivePool } from '../../utils/PrimitivePool.js';\nimport { BYTES_PER_NODE, UINT32_PER_NODE } from '../Constants.js';\n\nconst _bufferStack1 = /* @__PURE__ / new BufferStack.constructor();\nconst _bufferStack2 = / @__PURE__ / new BufferStack.constructor();\nconst _boxPool = / @__PURE__ / new PrimitivePool( () => new Box3() );\nconst _leftBox1 = / @__PURE__ / new Box3();\nconst _rightBox1 = / @__PURE__ / new Box3();\n\nconst _leftBox2 = / @__PURE__ / new Box3();\nconst _rightBox2 = / @__PURE__ / new Box3();\n\nlet _active = false;\n\nexport function bvhcast( bvh, otherBvh, matrixToLocal, intersectsRanges ) {\n\n\tif ( _active ) {\n\n\t\tthrow new Error( 'MeshBVH: Recursive calls to bvhcast not supported.' );\n\n\t}\n\n\t_active = true;\n\n\tconst roots = bvh._roots;\n\tconst otherRoots = otherBvh._roots;\n\tlet result;\n\tlet nodeOffset1 = 0;\n\tlet nodeOffset2 = 0;\n\tconst invMat = new Matrix4().copy( matrixToLocal ).invert();\n\n\t// iterate over the first set of roots\n\tfor ( let i = 0, il = roots.length; i < il; i ++ ) {\n\n\t\t_bufferStack1.setBuffer( roots[ i ] );\n\t\tnodeOffset2 = 0;\n\n\t\t// prep the initial root box\n\t\tconst localBox = _boxPool.getPrimitive();\n\t\tarrayToBox( BOUNDING_DATA_INDEX( 0 ), _bufferStack1.float32Array, localBox );\n\t\tlocalBox.applyMatrix4( invMat );\n\n\t\t// iterate over the second set of roots\n\t\tfor ( let j = 0, jl = otherRoots.length; j < jl; j ++ ) {\n\n\t\t\t_bufferStack2.setBuffer( otherRoots[ j ] );\n\n\t\t\tresult = _traverse(\n\t\t\t\t0, 0, matrixToLocal, invMat, intersectsRanges,\n\t\t\t\tnodeOffset1, nodeOffset2, 0, 0,\n\t\t\t\tlocalBox,\n\t\t\t);\n\n\t\t\t_bufferStack2.clearBuffer();\n\t\t\tnodeOffset2 += otherRoots[ j ].byteLength / BYTES_PER_NODE;\n\n\t\t\tif ( result ) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\t// release stack info\n\t\t_boxPool.releasePrimitive( localBox );\n\t\t_bufferStack1.clearBuffer();\n\t\tnodeOffset1 += roots[ i ].byteLength / BYTES_PER_NODE;\n\n\t\tif ( result ) {\n\n\t\t\tbreak;\n\n\t\t}\n\n\t}\n\n\t_active = false;\n\treturn result;\n\n}\n\nfunction _traverse(\n\tnode1Index32,\n\tnode2Index32,\n\tmatrix2to1,\n\tmatrix1to2,\n\tintersectsRangesFunc,\n\n\t// offsets for ids\n\tnode1IndexOffset = 0,\n\tnode2IndexOffset = 0,\n\n\t// tree depth\n\tdepth1 = 0,\n\tdepth2 = 0,\n\n\tcurrBox = null,\n\treversed = false,\n\n) {\n\n\t// get the buffer stacks associated with the current indices\n\tlet bufferStack1, bufferStack2;\n\tif ( reversed ) {\n\n\t\tbufferStack1 = _bufferStack2;\n\t\tbufferStack2 = _bufferStack1;\n\n\t} else {\n\n\t\tbufferStack1 = _bufferStack1;\n\t\tbufferStack2 = _bufferStack2;\n\n\t}\n\n\t// get the local instances of the typed buffers\n\tconst\n\t\tfloat32Array1 = bufferStack1.float32Array,\n\t\tuint32Array1 = bufferStack1.uint32Array,\n\t\tuint16Array1 = bufferStack1.uint16Array,\n\t\tfloat32Array2 = bufferStack2.float32Array,\n\t\tuint32Array2 = bufferStack2.uint32Array,\n\t\tuint16Array2 = bufferStack2.uint16Array;\n\n\tconst node1Index16 = node1Index32 2;\n\tconst node2Index16 = node2Index32 * 2;\n\tconst isLeaf1 = IS_LEAF( node1Index16, uint16Array1 );\n\tconst isLeaf2 = IS_LEAF( node2Index16, uint16Array2 );\n\tlet result = false;\n\tif ( isLeaf2 && isLeaf1 ) {\n\n\t\t// if both bounds are leaf nodes then fire the callback if the boxes intersect\n\t\t// Note the \"nodeIndex\" values are just intended to be used as unique identifiers in the tree and\n\t\t// not used for accessing data\n\t\tif ( reversed ) {\n\n\t\t\tresult = intersectsRangesFunc(\n\t\t\t\tOFFSET( node2Index32, uint32Array2 ), COUNT( node2Index32 * 2, uint16Array2 ),\n\t\t\t\tOFFSET( node1Index32, uint32Array1 ), COUNT( node1Index32 * 2, uint16Array1 ),\n\t\t\t\tdepth2, node2IndexOffset + node2Index32 / UINT32_PER_NODE,\n\t\t\t\tdepth1, node1IndexOffset + node1Index32 / UINT32_PER_NODE,\n\t\t\t);\n\n\t\t} else {\n\n\t\t\tresult = intersectsRangesFunc(\n\t\t\t\tOFFSET( node1Index32, uint32Array1 ), COUNT( node1Index32 * 2, uint16Array1 ),\n\t\t\t\tOFFSET( node2Index32, uint32Array2 ), COUNT( node2Index32 * 2, uint16Array2 ),\n\t\t\t\tdepth1, node1IndexOffset + node1Index32 / UINT32_PER_NODE,\n\t\t\t\tdepth2, node2IndexOffset + node2Index32 / UINT32_PER_NODE,\n\t\t\t);\n\n\t\t}\n\n\t} else if ( isLeaf2 ) {\n\n\t\t// SWAP\n\t\t// If we've traversed to the leaf node on the other bvh then we need to swap over\n\t\t// to traverse down the first one\n\n\t\t// get the new box to use\n\t\tconst newBox = _boxPool.getPrimitive();\n\t\tarrayToBox( BOUNDING_DATA_INDEX( node2Index32 ), float32Array2, newBox );\n\t\tnewBox.applyMatrix4( matrix2to1 );\n\n\t\t// get the child bounds to check before traversal\n\t\tconst cl1 = LEFT_NODE( node1Index32 );\n\t\tconst cr1 = RIGHT_NODE( node1Index32, uint32Array1 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cl1 ), float32Array1, _leftBox1 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cr1 ), float32Array1, _rightBox1 );\n\n\t\t// precompute the intersections otherwise the global boxes will be modified during traversal\n\t\tconst intersectCl1 = newBox.intersectsBox( _leftBox1 );\n\t\tconst intersectCr1 = newBox.intersectsBox( _rightBox1 );\n\t\tresult = (\n\t\t\tintersectCl1 && _traverse(\n\t\t\t\tnode2Index32, cl1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\tnewBox, ! reversed,\n\t\t\t)\n\t\t) \|\| (\n\t\t\tintersectCr1 && _traverse(\n\t\t\t\tnode2Index32, cr1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\tnewBox, ! reversed,\n\t\t\t)\n\t\t);\n\n\t\t_boxPool.releasePrimitive( newBox );\n\n\t} else {\n\n\t\t// if neither are leaves then we should swap if one of the children does not\n\t\t// intersect with the current bounds\n\n\t\t// get the child bounds to check\n\t\tconst cl2 = LEFT_NODE( node2Index32 );\n\t\tconst cr2 = RIGHT_NODE( node2Index32, uint32Array2 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cl2 ), float32Array2, _leftBox2 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cr2 ), float32Array2, _rightBox2 );\n\n\t\tconst leftIntersects = currBox.intersectsBox( _leftBox2 );\n\t\tconst rightIntersects = currBox.intersectsBox( _rightBox2 );\n\t\tif ( leftIntersects && rightIntersects ) {\n\n\t\t\t// continue to traverse both children if they both intersect\n\t\t\tresult = _traverse(\n\t\t\t\tnode1Index32, cl2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\tcurrBox, reversed,\n\t\t\t) \|\| _traverse(\n\t\t\t\tnode1Index32, cr2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\tcurrBox, reversed,\n\t\t\t);\n\n\t\t} else if ( leftIntersects ) {\n\n\t\t\tif ( isLeaf1 ) {\n\n\t\t\t\t// if the current box is a leaf then just continue\n\t\t\t\tresult = _traverse(\n\t\t\t\t\tnode1Index32, cl2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\t\tcurrBox, reversed,\n\t\t\t\t);\n\n\t\t\t} else {\n\n\t\t\t\t// SWAP\n\t\t\t\t// if only one box intersects then we have to swap to the other bvh to continue\n\t\t\t\tconst newBox = _boxPool.getPrimitive();\n\t\t\t\tnewBox.copy( _leftBox2 ).applyMatrix4( matrix2to1 );\n\n\t\t\t\tconst cl1 = LEFT_NODE( node1Index32 );\n\t\t\t\tconst cr1 = RIGHT_NODE( node1Index32, uint32Array1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cl1 ), float32Array1, _leftBox1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cr1 ), float32Array1, _rightBox1 );\n\n\t\t\t\t// precompute the intersections otherwise the global boxes will be modified during traversal\n\t\t\t\tconst intersectCl1 = newBox.intersectsBox( _leftBox1 );\n\t\t\t\tconst intersectCr1 = newBox.intersectsBox( _rightBox1 );\n\t\t\t\tresult = (\n\t\t\t\t\tintersectCl1 && _traverse(\n\t\t\t\t\t\tcl2, cl1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t) \|\| (\n\t\t\t\t\tintersectCr1 && _traverse(\n\t\t\t\t\t\tcl2, cr1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\t_boxPool.releasePrimitive( newBox );\n\n\t\t\t}\n\n\t\t} else if ( rightIntersects ) {\n\n\t\t\tif ( isLeaf1 ) {\n\n\t\t\t\t// if the current box is a leaf then just continue\n\t\t\t\tresult = _traverse(\n\t\t\t\t\tnode1Index32, cr2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\t\tcurrBox, reversed,\n\t\t\t\t);\n\n\t\t\t} else {\n\n\t\t\t\t// SWAP\n\t\t\t\t// if only one box intersects then we have to swap to the other bvh to continue\n\t\t\t\tconst newBox = _boxPool.getPrimitive();\n\t\t\t\tnewBox.copy( _rightBox2 ).applyMatrix4( matrix2to1 );\n\n\t\t\t\tconst cl1 = LEFT_NODE( node1Index32 );\n\t\t\t\tconst cr1 = RIGHT_NODE( node1Index32, uint32Array1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cl1 ), float32Array1, _leftBox1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cr1 ), float32Array1, _rightBox1 );\n\n\t\t\t\t// precompute the intersections otherwise the global boxes will be modified during traversal\n\t\t\t\tconst intersectCl1 = newBox.intersectsBox( _leftBox1 );\n\t\t\t\tconst intersectCr1 = newBox.intersectsBox( _rightBox1 );\n\t\t\t\tresult = (\n\t\t\t\t\tintersectCl1 && _traverse(\n\t\t\t\t\t\tcr2, cl1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t) \|\| (\n\t\t\t\t\tintersectCr1 && _traverse(\n\t\t\t\t\t\tcr2, cr1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\t_boxPool.releasePrimitive( newBox );\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn result;\n\n}\n\n","import { COUNT, IS_LEAF, LEFT_NODE, OFFSET, RIGHT_NODE, SPLIT_AXIS } from './utils/nodeBufferUtils.js';\n\nexport const BVHTraversalHelper = new ( class {\n\n\tconstructor() {\n\n\t\tlet buffer = null;\n\t\tlet uint32Array = null;\n\t\tlet uint16Array = null;\n\t\tlet traversing = false;\n\n\t\tthis.root = null;\n\t\tthis.buffer = null;\n\t\tthis.uint32Array = null;\n\t\tthis.uint16Array = null;\n\n\t\tthis.setBVH = ( bvh, root ) => {\n\n\t\t\tif ( traversing ) {\n\n\t\t\t\tthrow new Error( 'BVHTraversalHelper: cannot call setBVH during an active traversal.' );\n\n\t\t\t}\n\n\t\t\tthis.root = root;\n\t\t\tthis.buffer = buffer = bvh._roots[ root ];\n\t\t\tthis.uint16Array = uint16Array = new Uint16Array( buffer );\n\t\t\tthis.uint32Array = uint32Array = new Uint32Array( buffer );\n\n\t\t};\n\n\t\tthis.reset = () => {\n\n\t\t\tthis.root = null;\n\t\t\tthis.buffer = buffer = null;\n\t\t\tthis.uint16Array = uint16Array = null;\n\t\t\tthis.uint32Array = uint32Array = null;\n\n\t\t};\n\n\t\tthis.getRangeStart = node32Index => {\n\n\t\t\tlet node16Index = node32Index * 2;\n\t\t\twhile ( ! IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\tnode32Index = LEFT_NODE( node32Index );\n\t\t\t\tnode16Index = node32Index * 2;\n\n\t\t\t}\n\n\t\t\treturn OFFSET( node32Index, uint32Array );\n\n\t\t};\n\n\t\tthis.getRangeEnd = node32Index => {\n\n\t\t\tlet node16Index = node32Index * 2;\n\t\t\twhile ( ! IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\tnode32Index = RIGHT_NODE( node32Index, uint32Array );\n\t\t\t\tnode16Index = node32Index * 2;\n\n\t\t\t}\n\n\t\t\treturn OFFSET( node32Index, uint32Array ) + COUNT( node16Index, uint16Array );\n\n\t\t};\n\n\t\t// internal recursive walk - the public \"traverseBuffer\" wraps this with the re-entrancy guard\n\t\tconst walk = ( callback, node32Index, depth ) => {\n\n\t\t\tconst node16Index = node32Index * 2;\n\t\t\tconst isLeaf = IS_LEAF( node16Index, uint16Array );\n\t\t\tconst stopTraversal = callback( depth, isLeaf, node32Index );\n\t\t\tif ( ! stopTraversal && ! isLeaf ) {\n\n\t\t\t\tconst left = LEFT_NODE( node32Index );\n\t\t\t\tconst right = RIGHT_NODE( node32Index, uint32Array );\n\t\t\t\twalk( callback, left, depth + 1 );\n\t\t\t\twalk( callback, right, depth + 1 );\n\n\t\t\t}\n\n\t\t};\n\n\t\tthis.traverseBuffer = callback => {\n\n\t\t\tif ( traversing ) {\n\n\t\t\t\tthrow new Error( 'BVHTraversalHelper: cannot start a traversal during an active traversal.' );\n\n\t\t\t}\n\n\t\t\ttraversing = true;\n\t\t\ttry {\n\n\t\t\t\twalk( callback, 0, 0 );\n\n\t\t\t} finally {\n\n\t\t\t\ttraversing = false;\n\n\t\t\t}\n\n\t\t};\n\n\t\tthis.traverse = callback => {\n\n\t\t\tthis.traverseBuffer( ( depth, isLeaf, node32Index ) => {\n\n\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\tconst node16Index = node32Index * 2;\n\t\t\t\t\tconst offset = uint32Array[ node32Index + 6 ];\n\t\t\t\t\tconst count = uint16Array[ node16Index + 14 ];\n\t\t\t\t\treturn callback( depth, isLeaf, new Float32Array( buffer, node32Index * 4, 6 ), offset, count );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tconst splitAxis = SPLIT_AXIS( node32Index, uint32Array );\n\t\t\t\t\treturn callback( depth, isLeaf, new Float32Array( buffer, node32Index * 4, 6 ), splitAxis );\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t};\n\n\t}\n\n} )();\n","/** @import { Matrix4 } from 'three' /\nimport { Box3 } from 'three';\nimport { BYTES_PER_NODE, UINT32_PER_NODE, DEFAULT_OPTIONS, FLOAT32_EPSILON } from './Constants.js';\nimport { arrayToBox } from '../utils/ArrayBoxUtilities.js';\nimport { IS_LEAF, LEFT_NODE, RIGHT_NODE, COUNT, OFFSET } from './utils/nodeBufferUtils.js';\nimport { buildPackedTree } from './build/buildTree.js';\nimport { shapecast as shapecastFunc } from './cast/shapecast.js';\nimport { bvhcast } from './cast/bvhcast.js';\nimport { BVHTraversalHelper } from './BVHTraversalHelper.js';\n\nconst _tempBox = / @__PURE__ / new Box3();\nconst _tempBuffer = / @__PURE__ / new Float32Array( 6 );\n\n/\n @callback BoundsTraverseOrderCallback\n * @param {Box3} box\n * @returns {number}\n /\n\n/\n @callback IntersectsBoundsCallback\n * @param {Box3} box\n * @param {boolean} isLeaf\n * @param {number\|undefined} score\n * @param {number} depth\n * @param {number} nodeIndex\n * @returns {number}\n /\n\n/\n @callback IntersectsRangeCallback\n * @param {number} offset\n * @param {number} count\n * @param {boolean} contained\n * @param {number} depth\n * @param {number} nodeIndex\n * @param {Box3} box\n * @returns {boolean}\n /\n\n/\n @callback IntersectsRangesCallback\n * @param {number} offset1\n * @param {number} count1\n * @param {number} offset2\n * @param {number} count2\n * @param {number} depth1\n * @param {number} nodeIndex1\n * @param {number} depth2\n * @param {number} nodeIndex2\n * @returns {boolean}\n /\n\n/\n Abstract base class for BVH implementations. Provides core tree traversal and spatial query\n * methods. Subclasses implement primitive-specific logic by overriding `writePrimitiveBounds`\n * and related internal methods.\n /\nexport class BVH {\n\n\tconstructor() {\n\n\t\tthis._roots = null;\n\t\tthis.primitiveBuffer = null;\n\t\tthis.primitiveBufferStride = null;\n\n\t}\n\n\tinit( options ) {\n\n\t\toptions = {\n\t\t\t...DEFAULT_OPTIONS,\n\t\t\t...options,\n\t\t};\n\n\t\tif ( 'maxLeafSize' in options ) {\n\n\t\t\tconsole.warn( 'BVH: \"maxLeafSize\" option has been deprecated. Use \"targetLeafSize\", instead.' );\n\t\t\toptions = {\n\t\t\t\t...options,\n\t\t\t\ttargetLeafSize: options.maxLeafSize,\n\t\t\t};\n\n\t\t}\n\n\t\tbuildPackedTree( this, options );\n\n\t}\n\n\tgetRootRanges( / range / ) {\n\n\t\t// TODO: can we avoid passing range in here?\n\t\tthrow new Error( 'BVH: getRootRanges() not implemented' );\n\n\t}\n\n\t// write the i-th primitive bounds in a 6-value min / max format to the buffer\n\t// starting at the given \"writeOffset\"\n\twritePrimitiveBounds( / i, buffer, writeOffset / ) {\n\n\t\tthrow new Error( 'BVH: writePrimitiveBounds() not implemented' );\n\n\t}\n\n\t// writes the union bounds of all primitives in the given range in a min / max format\n\t// to the buffer\n\twritePrimitiveRangeBounds( offset, count, targetBuffer, baseIndex ) {\n\n\t\t// Initialize bounds\n\t\tlet minX = Infinity;\n\t\tlet minY = Infinity;\n\t\tlet minZ = Infinity;\n\t\tlet maxX = - Infinity;\n\t\tlet maxY = - Infinity;\n\t\tlet maxZ = - Infinity;\n\n\t\t// compute union of all bounds\n\t\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\t\tthis.writePrimitiveBounds( i, _tempBuffer, 0 );\n\n\t\t\t// compute union\n\t\t\tconst [ lx, ly, lz, rx, ry, rz ] = _tempBuffer;\n\t\t\tif ( lx < minX ) minX = lx;\n\t\t\tif ( rx > maxX ) maxX = rx;\n\t\t\tif ( ly < minY ) minY = ly;\n\t\t\tif ( ry > maxY ) maxY = ry;\n\t\t\tif ( lz < minZ ) minZ = lz;\n\t\t\tif ( rz > maxZ ) maxZ = rz;\n\n\t\t}\n\n\t\t// write bounds\n\t\ttargetBuffer[ baseIndex + 0 ] = minX;\n\t\ttargetBuffer[ baseIndex + 1 ] = minY;\n\t\ttargetBuffer[ baseIndex + 2 ] = minZ;\n\t\ttargetBuffer[ baseIndex + 3 ] = maxX;\n\t\ttargetBuffer[ baseIndex + 4 ] = maxY;\n\t\ttargetBuffer[ baseIndex + 5 ] = maxZ;\n\n\t\treturn targetBuffer;\n\n\t}\n\n\tcomputePrimitiveBounds( offset, count, targetBuffer ) {\n\n\t\tconst boundsOffset = targetBuffer.offset \|\| 0;\n\t\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\t\tthis.writePrimitiveBounds( i, _tempBuffer, 0 );\n\n\t\t\t// construction primitive bounds requires a center + half extents format\n\t\t\tconst [ lx, ly, lz, rx, ry, rz ] = _tempBuffer;\n\n\t\t\tconst cx = ( lx + rx ) / 2;\n\t\t\tconst cy = ( ly + ry ) / 2;\n\t\t\tconst cz = ( lz + rz ) / 2;\n\n\t\t\tconst hx = ( rx - lx ) / 2;\n\t\t\tconst hy = ( ry - ly ) / 2;\n\t\t\tconst hz = ( rz - lz ) / 2;\n\n\t\t\tconst baseIndex = ( i - boundsOffset ) 6;\n\t\t\ttargetBuffer[ baseIndex + 0 ] = cx;\n\t\t\ttargetBuffer[ baseIndex + 1 ] = hx + ( Math.abs( cx ) + hx ) * FLOAT32_EPSILON;\n\t\t\ttargetBuffer[ baseIndex + 2 ] = cy;\n\t\t\ttargetBuffer[ baseIndex + 3 ] = hy + ( Math.abs( cy ) + hy ) * FLOAT32_EPSILON;\n\t\t\ttargetBuffer[ baseIndex + 4 ] = cz;\n\t\t\ttargetBuffer[ baseIndex + 5 ] = hz + ( Math.abs( cz ) + hz ) * FLOAT32_EPSILON;\n\n\t\t}\n\n\t\treturn targetBuffer;\n\n\t}\n\n\t/*\n\t Adjusts all primitive offsets stored in the BVH leaf nodes by the given value. Useful when\n\t * geometry buffers have been shifted or compacted (e.g. when merging geometries).\n\t * @param {number} offset\n\t /\n\tshiftPrimitiveOffsets( offset ) {\n\n\t\tconst indirectBuffer = this._indirectBuffer;\n\t\tif ( indirectBuffer ) {\n\n\t\t\t// the offsets are embedded in the indirect buffer\n\t\t\tfor ( let i = 0, l = indirectBuffer.length; i < l; i ++ ) {\n\n\t\t\t\tindirectBuffer[ i ] += offset;\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// offsets are embedded in the leaf nodes\n\t\t\tconst roots = this._roots;\n\t\t\tfor ( let rootIndex = 0; rootIndex < roots.length; rootIndex ++ ) {\n\n\t\t\t\tconst root = roots[ rootIndex ];\n\t\t\t\tconst uint32Array = new Uint32Array( root );\n\t\t\t\tconst uint16Array = new Uint16Array( root );\n\t\t\t\tconst totalNodes = root.byteLength / BYTES_PER_NODE;\n\t\t\t\tfor ( let node = 0; node < totalNodes; node ++ ) {\n\n\t\t\t\t\tconst node32Index = UINT32_PER_NODE node;\n\t\t\t\t\tconst node16Index = 2 * node32Index;\n\t\t\t\t\tif ( IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\t\t\t// offset value\n\t\t\t\t\t\tuint32Array[ node32Index + 6 ] += offset;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\t/*\n\t Traverses all nodes of the BVH, invoking a callback for each node.\n\t \n\t For leaf nodes the callback receives `( depth, isLeaf, boundingData, offset, count )`.\n\t * For internal nodes it receives `( depth, isLeaf, boundingData, splitAxis )` and may\n\t * return `true` to stop descending into that node's children.\n\t \n\t @param {Function} callback\n\t * @param {number} [rootIndex=0]\n\t /\n\ttraverse( callback, rootIndex = 0 ) {\n\n\t\tBVHTraversalHelper.setBVH( this, rootIndex );\n\t\tBVHTraversalHelper.traverse( callback );\n\t\tBVHTraversalHelper.reset();\n\n\t}\n\n\t/\n\t Refits all BVH node bounds to reflect the current primitive positions. Faster than\n\t * rebuilding the BVH but produces a less optimal tree after large vertex deformations.\n\t /\n\trefit( / nodeIndices = null / ) {\n\n\t\t// TODO: add support for \"nodeIndices\"\n\t\t// if ( nodeIndices && Array.isArray( nodeIndices ) ) {\n\n\t\t// \tnodeIndices = new Set( nodeIndices );\n\n\t\t// }\n\n\t\tconst roots = this._roots;\n\t\tfor ( let rootIndex = 0, rootCount = roots.length; rootIndex < rootCount; rootIndex ++ ) {\n\n\t\t\tconst buffer = roots[ rootIndex ];\n\t\t\tconst uint32Array = new Uint32Array( buffer );\n\t\t\tconst uint16Array = new Uint16Array( buffer );\n\t\t\tconst float32Array = new Float32Array( buffer );\n\t\t\tconst totalNodes = buffer.byteLength / BYTES_PER_NODE;\n\n\t\t\t// Traverse nodes from right to left so children are updated before parents\n\t\t\tfor ( let nodeIndex = totalNodes - 1; nodeIndex >= 0; nodeIndex -- ) {\n\n\t\t\t\tconst nodeIndex32 = nodeIndex UINT32_PER_NODE;\n\t\t\t\tconst nodeIndex16 = nodeIndex32 * 2;\n\t\t\t\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\n\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\t// get the bounds\n\t\t\t\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\t\t\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\t\t\t\t\tthis.writePrimitiveRangeBounds( offset, count, _tempBuffer, 0 );\n\n\t\t\t\t\t// write directly to node bounds (already in min/max format)\n\t\t\t\t\tfloat32Array.set( _tempBuffer, nodeIndex32 );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\t\t\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t\t\t\t// Union the bounds of left and right children\n\t\t\t\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\t\t\t\tconst leftMin = float32Array[ left + i ];\n\t\t\t\t\t\tconst leftMax = float32Array[ left + i + 3 ];\n\t\t\t\t\t\tconst rightMin = float32Array[ right + i ];\n\t\t\t\t\t\tconst rightMax = float32Array[ right + i + 3 ];\n\n\t\t\t\t\t\tfloat32Array[ nodeIndex32 + i ] = leftMin < rightMin ? leftMin : rightMin;\n\t\t\t\t\t\tfloat32Array[ nodeIndex32 + i + 3 ] = leftMax > rightMax ? leftMax : rightMax;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\t/*\n\t Computes the axis-aligned bounding box of all primitives in the BVH.\n\t * @param {Box3} target - Target box to write the result into.\n\t * @returns {Box3}\n\t /\n\tgetBoundingBox( target ) {\n\n\t\ttarget.makeEmpty();\n\n\t\tconst roots = this._roots;\n\t\troots.forEach( buffer => {\n\n\t\t\tarrayToBox( 0, new Float32Array( buffer ), _tempBox );\n\t\t\ttarget.union( _tempBox );\n\n\t\t} );\n\n\t\treturn target;\n\n\t}\n\n\t/\n\t A generalized traversal function for performing spatial queries against the BVH. Returns\n\t * `true` as soon as a primitive has been reported as intersected. The tree is traversed\n\t * depth-first; `boundsTraverseOrder` controls which child is visited first. Returning\n\t * `CONTAINED` from `intersectsBounds` skips further child traversal and intersects all\n\t * primitives in that subtree immediately.\n\t \n\t @param {Object} callbacks\n\t * @param {IntersectsBoundsCallback} callbacks.intersectsBounds\n\t * @param {IntersectsRangeCallback} [callbacks.intersectsRange]\n\t * @param {BoundsTraverseOrderCallback} [callbacks.boundsTraverseOrder]\n\t * @returns {boolean}\n\t /\n\t// TODO: see if we can get rid of \"iterateFunc\" here as well as the primitive so the function\n\t// API aligns with the \"shapecast\" implementation\n\tshapecast( callbacks ) {\n\n\t\t// TODO: can we get rid of \"scratchPrimitive\" and / or \"iterate\"? Or merge them somehow\n\t\tlet {\n\t\t\tboundsTraverseOrder,\n\t\t\tintersectsBounds,\n\t\t\tintersectsRange,\n\t\t\tintersectsPrimitive,\n\t\t\tscratchPrimitive,\n\t\t\titerate,\n\t\t} = callbacks;\n\n\t\t// wrap the intersectsRange function\n\t\tif ( intersectsRange && intersectsPrimitive ) {\n\n\t\t\tconst originalIntersectsRange = intersectsRange;\n\t\t\tintersectsRange = ( offset, count, contained, depth, nodeIndex ) => {\n\n\t\t\t\tif ( ! originalIntersectsRange( offset, count, contained, depth, nodeIndex ) ) {\n\n\t\t\t\t\treturn iterate( offset, count, this, intersectsPrimitive, contained, depth, scratchPrimitive );\n\n\t\t\t\t}\n\n\t\t\t\treturn true;\n\n\t\t\t};\n\n\t\t} else if ( ! intersectsRange ) {\n\n\t\t\tif ( intersectsPrimitive ) {\n\n\t\t\t\tintersectsRange = ( offset, count, contained, depth ) => {\n\n\t\t\t\t\treturn iterate( offset, count, this, intersectsPrimitive, contained, depth, scratchPrimitive );\n\n\t\t\t\t};\n\n\t\t\t} else {\n\n\t\t\t\tintersectsRange = ( offset, count, contained ) => {\n\n\t\t\t\t\treturn contained;\n\n\t\t\t\t};\n\n\t\t\t}\n\n\t\t}\n\n\t\t// run shapecast\n\t\tlet result = false;\n\t\tlet nodeOffset = 0;\n\t\tconst roots = this._roots;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\tconst root = roots[ i ];\n\t\t\tresult = shapecastFunc( this, i, intersectsBounds, intersectsRange, boundsTraverseOrder, nodeOffset );\n\n\t\t\tif ( result ) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t\tnodeOffset += root.byteLength / BYTES_PER_NODE;\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n\t/\n\t Simultaneously traverses two BVH structures to find intersecting primitive pairs. Returns\n\t * `true` as soon as any intersection is reported. Both trees are traversed depth-first with\n\t * alternating descent. `matrixToLocal` transforms `otherBvh` into the local space of this BVH.\n\t \n\t @param {BVH} otherBvh\n\t * @param {Matrix4} matrixToLocal\n\t * @param {Object} callbacks\n\t * @param {IntersectsRangesCallback} callbacks.intersectsRanges\n\t * @returns {boolean}\n\t /\n\tbvhcast( otherBvh, matrixToLocal, callbacks ) {\n\n\t\tlet { intersectsRanges } = callbacks;\n\t\treturn bvhcast( this, otherBvh, matrixToLocal, intersectsRanges );\n\n\n\t}\n\n}\n","export function isSharedArrayBufferSupported() {\n\n\treturn typeof SharedArrayBuffer !== 'undefined';\n\n}\n\nexport function convertToBufferType( array, BufferConstructor ) {\n\n\tif ( array === null ) {\n\n\t\treturn array;\n\n\t} else if ( array.buffer ) {\n\n\t\tconst buffer = array.buffer;\n\t\tif ( buffer.constructor === BufferConstructor ) {\n\n\t\t\treturn array;\n\n\t\t}\n\n\t\tconst ArrayConstructor = array.constructor;\n\t\tconst result = new ArrayConstructor( new BufferConstructor( buffer.byteLength ) );\n\t\tresult.set( array );\n\t\treturn result;\n\n\t} else {\n\n\t\tif ( array.constructor === BufferConstructor ) {\n\n\t\t\treturn array;\n\n\t\t}\n\n\t\tconst result = new BufferConstructor( array.byteLength );\n\t\tnew Uint8Array( result ).set( new Uint8Array( array ) );\n\t\treturn result;\n\n\t}\n\n}\n","import { BufferAttribute } from 'three';\n\nexport function getVertexCount( geo ) {\n\n\treturn geo.index ? geo.index.count : geo.attributes.position.count;\n\n}\n\nexport function getTriCount( geo ) {\n\n\treturn getVertexCount( geo ) / 3;\n\n}\n\nexport function getIndexArray( vertexCount, BufferConstructor = ArrayBuffer ) {\n\n\tif ( vertexCount > 65535 ) {\n\n\t\treturn new Uint32Array( new BufferConstructor( 4 vertexCount ) );\n\n\t} else {\n\n\t\treturn new Uint16Array( new BufferConstructor( 2 * vertexCount ) );\n\n\t}\n\n}\n\n// ensures that an index is present on the geometry\nexport function ensureIndex( geo, options ) {\n\n\tif ( ! geo.index ) {\n\n\t\tconst vertexCount = geo.attributes.position.count;\n\t\tconst BufferConstructor = options.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer;\n\t\tconst index = getIndexArray( vertexCount, BufferConstructor );\n\t\tgeo.setIndex( new BufferAttribute( index, 1 ) );\n\n\t\tfor ( let i = 0; i < vertexCount; i ++ ) {\n\n\t\t\tindex[ i ] = i;\n\n\t\t}\n\n\t}\n\n}\n\n// Computes the set of { offset, count } ranges which need independent BVH roots. Each\n// region in the geometry index that belongs to a different set of material groups requires\n// a separate BVH root, so that triangles indices belonging to one group never get swapped\n// with triangle indices belongs to another group. For example, if the groups were like this:\n//\n// [-------------------------------------------------------------]\n// \|__________________\|\n// g0 = [0, 20] \|______________________\|\|_____________________\|\n// g1 = [16, 40] g2 = [41, 60]\n//\n// we would need four BVH roots: [0, 15], [16, 20], [21, 40], [41, 60].\nfunction getFullPrimitiveRange( geo, range, stride ) {\n\n\tconst primitiveCount = getVertexCount( geo ) / stride;\n\tconst drawRange = range ? range : geo.drawRange;\n\tconst start = drawRange.start / stride;\n\tconst end = ( drawRange.start + drawRange.count ) / stride;\n\n\tconst offset = Math.max( 0, start );\n\tconst count = Math.min( primitiveCount, end ) - offset;\n\treturn {\n\t\toffset: Math.floor( offset ),\n\t\tcount: Math.floor( count ),\n\t};\n\n}\n\nfunction getPrimitiveGroupRanges( geo, stride ) {\n\n\treturn geo.groups.map( group => ( {\n\t\toffset: group.start / stride,\n\t\tcount: group.count / stride,\n\t} ));\n\n}\n\n// Function that extracts a set of mutually exclusive ranges representing the primitives being\n// drawn as determined by the geometry groups, draw range, and user specified range\nexport function getRootPrimitiveRanges( geo, range, stride ) {\n\n\tconst drawRange = getFullPrimitiveRange( geo, range, stride );\n\tconst primitiveRanges = getPrimitiveGroupRanges( geo, stride );\n\tif ( ! primitiveRanges.length ) {\n\n\t\treturn [ drawRange ];\n\n\t}\n\n\tconst ranges = [];\n\tconst drawRangeStart = drawRange.offset;\n\tconst drawRangeEnd = drawRange.offset + drawRange.count;\n\n\t// Create events for group boundaries\n\tconst primitiveCount = getVertexCount( geo ) / stride;\n\tconst events = [];\n\tfor ( const group of primitiveRanges ) {\n\n\t\t// Account for cases where group size is set to Infinity\n\t\tconst { offset, count } = group;\n\t\tconst groupStart = offset;\n\t\tconst groupCount = isFinite( count ) ? count : ( primitiveCount - offset );\n\t\tconst groupEnd = ( offset + groupCount );\n\n\t\t// Only add events if the group intersects with the draw range\n\t\tif ( groupStart < drawRangeEnd && groupEnd > drawRangeStart ) {\n\n\t\t\tevents.push( { pos: Math.max( drawRangeStart, groupStart ), isStart: true } );\n\t\t\tevents.push( { pos: Math.min( drawRangeEnd, groupEnd ), isStart: false } );\n\n\t\t}\n\n\t}\n\n\t// Sort events by position, with 'end' events before 'start' events at the same position\n\tevents.sort( ( a, b ) => {\n\n\t\tif ( a.pos !== b.pos ) {\n\n\t\t\treturn a.pos - b.pos;\n\n\t\t} else {\n\n\t\t\treturn a.type === 'end' ? - 1 : 1;\n\n\t\t}\n\n\t} );\n\n\t// sweep through events and create ranges where activeGroups > 0\n\tlet activeGroups = 0;\n\tlet lastPos = null;\n\tfor ( const event of events ) {\n\n\t\tconst newPos = event.pos;\n\t\tif ( activeGroups !== 0 && newPos !== lastPos ) {\n\n\t\t\tranges.push( {\n\t\t\t\toffset: lastPos,\n\t\t\t\tcount: newPos - lastPos,\n\t\t\t} );\n\n\t\t}\n\n\t\tactiveGroups += event.isStart ? 1 : - 1;\n\t\tlastPos = newPos;\n\n\t}\n\n\treturn ranges;\n\n}\n","/** @import { BufferGeometry } from 'three' /\nimport { Box3 } from 'three';\nimport { SKIP_GENERATION, DEFAULT_OPTIONS } from './Constants.js';\nimport { isSharedArrayBufferSupported } from '../utils/BufferUtils.js';\nimport { ensureIndex, getRootPrimitiveRanges } from './build/geometryUtils.js';\nimport { BVH } from './BVH.js';\n\n// construct a new buffer that points to the set of triangles represented by the given ranges\nexport function generateIndirectBuffer( ranges, useSharedArrayBuffer ) {\n\n\tconst lastRange = ranges[ ranges.length - 1 ];\n\tconst useUint32 = lastRange.offset + lastRange.count > 2 * 16;\n\n\t// use getRootIndexRanges which excludes gaps\n\tconst length = ranges.reduce( ( acc, val ) => acc + val.count, 0 );\n\tconst byteCount = useUint32 ? 4 : 2;\n\tconst buffer = useSharedArrayBuffer ? new SharedArrayBuffer( length * byteCount ) : new ArrayBuffer( length * byteCount );\n\tconst indirectBuffer = useUint32 ? new Uint32Array( buffer ) : new Uint16Array( buffer );\n\n\t// construct a compact form of the triangles in these ranges\n\tlet index = 0;\n\tfor ( let r = 0; r < ranges.length; r ++ ) {\n\n\t\tconst { offset, count } = ranges[ r ];\n\t\tfor ( let i = 0; i < count; i ++ ) {\n\n\t\t\tindirectBuffer[ index + i ] = offset + i;\n\n\t\t}\n\n\t\tindex += count;\n\n\t}\n\n\treturn indirectBuffer;\n\n}\n\n/*\n Abstract base class for geometry-backed BVH implementations. Handles geometry\n * indexing, indirect mode, and bounding box initialization. Subclasses implement\n * primitive-specific bounds computation and raycasting via `writePrimitiveBounds`\n * and `raycastObject3D`.\n \n @param {BufferGeometry} geometry\n * @param {Object} [options]\n * @param {number} [options.strategy=CENTER] - Split strategy: `CENTER`, `AVERAGE`, or `SAH`.\n * @param {number} [options.maxDepth=40] - Maximum tree depth. Note that this can cause the target leaf size to not\n * be met if the tree is truncated.\n * @param {number} [options.targetLeafSize=10] - The target number of primitives per leaf node. Note that this is\n * a soft limit and generation strategies like SAH will terminate early if the heuristic determines.\n * @param {boolean} [options.setBoundingBox=true] - Set `geometry.boundingBox` if not already present.\n * @param {boolean} [options.useSharedArrayBuffer=false] - Use `SharedArrayBuffer` for BVH root buffers.\n * @param {boolean} [options.indirect=false] - Build using an indirect buffer, leaving the original index unmodified.\n * @param {boolean} [options.verbose=true] - Log build progress to the console.\n * @param {Function\|null} [options.onProgress=null] - Called with a progress value in [0, 1] during build.\n * @param {Object\|null} [options.range=null] - Restrict the BVH to a specific geometry group range.\n * @extends BVH\n /\nexport class GeometryBVH extends BVH {\n\n\t/\n\t Whether the BVH was built in indirect mode.\n\t * @type {boolean}\n\t * @readonly\n\t /\n\tget indirect() {\n\n\t\treturn ! ! this._indirectBuffer;\n\n\t}\n\n\tget primitiveStride() {\n\n\t\treturn null;\n\n\t}\n\n\tget primitiveBufferStride() {\n\n\t\treturn this.indirect ? 1 : this.primitiveStride;\n\n\t}\n\tset primitiveBufferStride( v ) {}\n\n\tget primitiveBuffer() {\n\n\t\treturn this.indirect ? this._indirectBuffer : this.geometry.index.array;\n\n\t}\n\tset primitiveBuffer( v ) {}\n\n\tconstructor( geometry, options = {} ) {\n\n\t\tif ( ! geometry.isBufferGeometry ) {\n\n\t\t\tthrow new Error( 'BVH: Only BufferGeometries are supported.' );\n\n\t\t} else if ( geometry.index && geometry.index.isInterleavedBufferAttribute ) {\n\n\t\t\tthrow new Error( 'BVH: InterleavedBufferAttribute is not supported for the index attribute.' );\n\n\t\t}\n\n\t\tif ( options.useSharedArrayBuffer && ! isSharedArrayBufferSupported() ) {\n\n\t\t\tthrow new Error( 'BVH: SharedArrayBuffer is not available.' );\n\n\t\t}\n\n\t\tsuper();\n\n\t\t// retain references to the geometry so we can use them it without having to\n\t\t// take a geometry reference in every function.\n\n\t\t/\n\t\t The geometry this BVH was built from.\n\t\t * @type {BufferGeometry}\n\t\t * @readonly\n\t\t /\n\t\tthis.geometry = geometry;\n\t\tthis.resolvePrimitiveIndex = options.indirect ? i => this._indirectBuffer[ i ] : i => i;\n\t\tthis.primitiveBuffer = null;\n\t\tthis.primitiveBufferStride = null;\n\t\tthis._indirectBuffer = null;\n\n\t\toptions = {\n\t\t\t...DEFAULT_OPTIONS,\n\t\t\t...options,\n\t\t};\n\n\t\t// build the BVH unless we're deserializing\n\t\tif ( ! options[ SKIP_GENERATION ] ) {\n\n\t\t\tthis.init( options );\n\n\t\t}\n\n\t}\n\n\tinit( options ) {\n\n\t\tconst { geometry, primitiveStride } = this;\n\n\t\tif ( options.indirect ) {\n\n\t\t\t// construct an buffer that is indirectly sorts the triangles used for the BVH\n\t\t\tconst ranges = getRootPrimitiveRanges( geometry, options.range, primitiveStride );\n\t\t\tconst indirectBuffer = generateIndirectBuffer( ranges, options.useSharedArrayBuffer );\n\t\t\tthis._indirectBuffer = indirectBuffer;\n\n\t\t} else {\n\n\t\t\tensureIndex( geometry, options );\n\n\t\t}\n\n\t\tsuper.init( options );\n\n\t\tif ( ! geometry.boundingBox && options.setBoundingBox ) {\n\n\t\t\tgeometry.boundingBox = this.getBoundingBox( new Box3() );\n\n\t\t}\n\n\t}\n\n\t// Abstract methods to be implemented by subclasses\n\tgetRootRanges( range ) {\n\n\t\t// TODO: can we avoid passing options in here\n\t\tif ( this.indirect ) {\n\n\t\t\treturn [ { offset: 0, count: this._indirectBuffer.length } ];\n\n\n\t\t} else {\n\n\t\t\treturn getRootPrimitiveRanges( this.geometry, range, this.primitiveStride );\n\n\t\t}\n\n\t}\n\n\traycastObject3D( / object, raycaster, intersects = [] / ) {\n\n\t\tthrow new Error( 'BVH: raycastObject3D() not implemented' );\n\n\t}\n\n}\n","import { Vector3 } from 'three';\n\nexport class SeparatingAxisBounds {\n\n\tconstructor() {\n\n\t\tthis.min = Infinity;\n\t\tthis.max = - Infinity;\n\n\t}\n\n\tsetFromPointsField( points, field ) {\n\n\t\tlet min = Infinity;\n\t\tlet max = - Infinity;\n\t\tfor ( let i = 0, l = points.length; i < l; i ++ ) {\n\n\t\t\tconst p = points[ i ];\n\t\t\tconst val = p[ field ];\n\t\t\tmin = val < min ? val : min;\n\t\t\tmax = val > max ? val : max;\n\n\t\t}\n\n\t\tthis.min = min;\n\t\tthis.max = max;\n\n\t}\n\n\tsetFromPoints( axis, points ) {\n\n\t\tlet min = Infinity;\n\t\tlet max = - Infinity;\n\t\tfor ( let i = 0, l = points.length; i < l; i ++ ) {\n\n\t\t\tconst p = points[ i ];\n\t\t\tconst val = axis.dot( p );\n\t\t\tmin = val < min ? val : min;\n\t\t\tmax = val > max ? val : max;\n\n\t\t}\n\n\t\tthis.min = min;\n\t\tthis.max = max;\n\n\t}\n\n\tisSeparated( other ) {\n\n\t\treturn this.min > other.max \|\| other.min > this.max;\n\n\t}\n\n}\n\nSeparatingAxisBounds.prototype.setFromBox = ( function () {\n\n\tconst p = / @__PURE__ / new Vector3();\n\treturn function setFromBox( axis, box ) {\n\n\t\tconst boxMin = box.min;\n\t\tconst boxMax = box.max;\n\t\tlet min = Infinity;\n\t\tlet max = - Infinity;\n\t\tfor ( let x = 0; x <= 1; x ++ ) {\n\n\t\t\tfor ( let y = 0; y <= 1; y ++ ) {\n\n\t\t\t\tfor ( let z = 0; z <= 1; z ++ ) {\n\n\t\t\t\t\tp.x = boxMin.x x + boxMax.x * ( 1 - x );\n\t\t\t\t\tp.y = boxMin.y * y + boxMax.y * ( 1 - y );\n\t\t\t\t\tp.z = boxMin.z * z + boxMax.z * ( 1 - z );\n\n\t\t\t\t\tconst val = axis.dot( p );\n\t\t\t\t\tmin = Math.min( val, min );\n\t\t\t\t\tmax = Math.max( val, max );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tthis.min = min;\n\t\tthis.max = max;\n\n\t};\n\n} )();\n\nexport const areIntersecting = ( function () {\n\n\tconst cacheSatBounds = /* @__PURE__ / new SeparatingAxisBounds();\n\treturn function areIntersecting( shape1, shape2 ) {\n\n\t\tconst points1 = shape1.points;\n\t\tconst satAxes1 = shape1.satAxes;\n\t\tconst satBounds1 = shape1.satBounds;\n\n\t\tconst points2 = shape2.points;\n\t\tconst satAxes2 = shape2.satAxes;\n\t\tconst satBounds2 = shape2.satBounds;\n\n\t\t// check axes of the first shape\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sb = satBounds1[ i ];\n\t\t\tconst sa = satAxes1[ i ];\n\t\t\tcacheSatBounds.setFromPoints( sa, points2 );\n\t\t\tif ( sb.isSeparated( cacheSatBounds ) ) return false;\n\n\t\t}\n\n\t\t// check axes of the second shape\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sb = satBounds2[ i ];\n\t\t\tconst sa = satAxes2[ i ];\n\t\t\tcacheSatBounds.setFromPoints( sa, points1 );\n\t\t\tif ( sb.isSeparated( cacheSatBounds ) ) return false;\n\n\t\t}\n\n\t};\n\n} )();\n","import { Vector3, Vector2, Plane, Line3 } from 'three';\n\nexport const closestPointLineToLine = ( function () {\n\n\t// https://github.com/juj/MathGeoLib/blob/master/src/Geometry/Line.cpp#L56\n\tconst dir1 = / @__PURE__ / new Vector3();\n\tconst dir2 = / @__PURE__ / new Vector3();\n\tconst v02 = / @__PURE__ / new Vector3();\n\treturn function closestPointLineToLine( l1, l2, result ) {\n\n\t\tconst v0 = l1.start;\n\t\tconst v10 = dir1;\n\t\tconst v2 = l2.start;\n\t\tconst v32 = dir2;\n\n\t\tv02.subVectors( v0, v2 );\n\t\tdir1.subVectors( l1.end, l1.start );\n\t\tdir2.subVectors( l2.end, l2.start );\n\n\t\t// float d0232 = v02.Dot(v32);\n\t\tconst d0232 = v02.dot( v32 );\n\n\t\t// float d3210 = v32.Dot(v10);\n\t\tconst d3210 = v32.dot( v10 );\n\n\t\t// float d3232 = v32.Dot(v32);\n\t\tconst d3232 = v32.dot( v32 );\n\n\t\t// float d0210 = v02.Dot(v10);\n\t\tconst d0210 = v02.dot( v10 );\n\n\t\t// float d1010 = v10.Dot(v10);\n\t\tconst d1010 = v10.dot( v10 );\n\n\t\t// float denom = d1010d3232 - d3210d3210;\n\t\tconst denom = d1010 d3232 - d3210 * d3210;\n\n\t\tlet d, d2;\n\t\tif ( denom !== 0 ) {\n\n\t\t\td = ( d0232 * d3210 - d0210 * d3232 ) / denom;\n\n\t\t} else {\n\n\t\t\td = 0;\n\n\t\t}\n\n\t\td2 = ( d0232 + d * d3210 ) / d3232;\n\n\t\tresult.x = d;\n\t\tresult.y = d2;\n\n\t};\n\n} )();\n\nexport const closestPointsSegmentToSegment = ( function () {\n\n\t// https://github.com/juj/MathGeoLib/blob/master/src/Geometry/LineSegment.cpp#L187\n\tconst paramResult = /* @__PURE__ / new Vector2();\n\tconst temp1 = / @__PURE__ / new Vector3();\n\tconst temp2 = / @__PURE__ / new Vector3();\n\treturn function closestPointsSegmentToSegment( l1, l2, target1, target2 ) {\n\n\t\tclosestPointLineToLine( l1, l2, paramResult );\n\n\t\tlet d = paramResult.x;\n\t\tlet d2 = paramResult.y;\n\t\tif ( d >= 0 && d <= 1 && d2 >= 0 && d2 <= 1 ) {\n\n\t\t\tl1.at( d, target1 );\n\t\t\tl2.at( d2, target2 );\n\n\t\t\treturn;\n\n\t\t} else if ( d >= 0 && d <= 1 ) {\n\n\t\t\t// Only d2 is out of bounds.\n\t\t\tif ( d2 < 0 ) {\n\n\t\t\t\tl2.at( 0, target2 );\n\n\t\t\t} else {\n\n\t\t\t\tl2.at( 1, target2 );\n\n\t\t\t}\n\n\t\t\tl1.closestPointToPoint( target2, true, target1 );\n\t\t\treturn;\n\n\t\t} else if ( d2 >= 0 && d2 <= 1 ) {\n\n\t\t\t// Only d is out of bounds.\n\t\t\tif ( d < 0 ) {\n\n\t\t\t\tl1.at( 0, target1 );\n\n\t\t\t} else {\n\n\t\t\t\tl1.at( 1, target1 );\n\n\t\t\t}\n\n\t\t\tl2.closestPointToPoint( target1, true, target2 );\n\t\t\treturn;\n\n\t\t} else {\n\n\t\t\t// Both u and u2 are out of bounds.\n\t\t\tlet p;\n\t\t\tif ( d < 0 ) {\n\n\t\t\t\tp = l1.start;\n\n\t\t\t} else {\n\n\t\t\t\tp = l1.end;\n\n\t\t\t}\n\n\t\t\tlet p2;\n\t\t\tif ( d2 < 0 ) {\n\n\t\t\t\tp2 = l2.start;\n\n\t\t\t} else {\n\n\t\t\t\tp2 = l2.end;\n\n\t\t\t}\n\n\t\t\tconst closestPoint = temp1;\n\t\t\tconst closestPoint2 = temp2;\n\t\t\tl1.closestPointToPoint( p2, true, temp1 );\n\t\t\tl2.closestPointToPoint( p, true, temp2 );\n\n\t\t\tif ( closestPoint.distanceToSquared( p2 ) <= closestPoint2.distanceToSquared( p ) ) {\n\n\t\t\t\ttarget1.copy( closestPoint );\n\t\t\t\ttarget2.copy( p2 );\n\t\t\t\treturn;\n\n\t\t\t} else {\n\n\t\t\t\ttarget1.copy( p );\n\t\t\t\ttarget2.copy( closestPoint2 );\n\t\t\t\treturn;\n\n\t\t\t}\n\n\t\t}\n\n\t};\n\n} )();\n\n\nexport const sphereIntersectTriangle = ( function () {\n\n\t// https://stackoverflow.com/questions/34043955/detect-collision-between-sphere-and-triangle-in-three-js\n\tconst closestPointTemp = / @__PURE__ / new Vector3();\n\tconst projectedPointTemp = / @__PURE__ / new Vector3();\n\tconst planeTemp = / @__PURE__ / new Plane();\n\tconst lineTemp = / @__PURE__ / new Line3();\n\treturn function sphereIntersectTriangle( sphere, triangle ) {\n\n\t\tconst { radius, center } = sphere;\n\t\tconst { a, b, c } = triangle;\n\n\t\t// phase 1\n\t\tlineTemp.start = a;\n\t\tlineTemp.end = b;\n\t\tconst closestPoint1 = lineTemp.closestPointToPoint( center, true, closestPointTemp );\n\t\tif ( closestPoint1.distanceTo( center ) <= radius ) return true;\n\n\t\tlineTemp.start = a;\n\t\tlineTemp.end = c;\n\t\tconst closestPoint2 = lineTemp.closestPointToPoint( center, true, closestPointTemp );\n\t\tif ( closestPoint2.distanceTo( center ) <= radius ) return true;\n\n\t\tlineTemp.start = b;\n\t\tlineTemp.end = c;\n\t\tconst closestPoint3 = lineTemp.closestPointToPoint( center, true, closestPointTemp );\n\t\tif ( closestPoint3.distanceTo( center ) <= radius ) return true;\n\n\t\t// phase 2\n\t\tconst plane = triangle.getPlane( planeTemp );\n\t\tconst dp = Math.abs( plane.distanceToPoint( center ) );\n\t\tif ( dp <= radius ) {\n\n\t\t\tconst pp = plane.projectPoint( center, projectedPointTemp );\n\t\t\tconst cp = triangle.containsPoint( pp );\n\t\t\tif ( cp ) return true;\n\n\t\t}\n\n\t\treturn false;\n\n\t};\n\n} )();\n","/* @import { Sphere } from 'three' /\nimport { Triangle, Vector3, Vector2, Line3, Plane } from 'three';\nimport { SeparatingAxisBounds } from './SeparatingAxisBounds.js';\nimport { closestPointsSegmentToSegment, sphereIntersectTriangle } from './MathUtilities.js';\n\nconst componentKeys = [ 'x', 'y', 'z' ];\nconst ZERO_EPSILON = 1e-15;\nconst ZERO_EPSILON_SQR = ZERO_EPSILON ZERO_EPSILON;\nfunction isNearZero( value ) {\n\n\treturn Math.abs( value ) < ZERO_EPSILON;\n\n}\n\n/*\n An extended version of three.js' Triangle class. A variety of derivative values are cached on\n * the object to accelerate the intersection functions. `.needsUpdate` must be set to true when\n * modifying the triangle parameters.\n * @extends Triangle\n /\nexport class ExtendedTriangle extends Triangle {\n\n\tconstructor( ...args ) {\n\n\t\tsuper( ...args );\n\n\t\tthis.isExtendedTriangle = true;\n\t\tthis.satAxes = new Array( 4 ).fill().map( () => new Vector3() );\n\t\tthis.satBounds = new Array( 4 ).fill().map( () => new SeparatingAxisBounds() );\n\t\tthis.points = [ this.a, this.b, this.c ];\n\t\tthis.plane = new Plane();\n\t\tthis.isDegenerateIntoSegment = false;\n\t\tthis.isDegenerateIntoPoint = false;\n\t\tthis.degenerateSegment = new Line3();\n\n\t\t/\n\t\t Indicates that the triangle fields have changed so cached variables to accelerate other\n\t\t * function execution can be updated. Must be set to true after modifying the triangle\n\t\t * `a`, `b`, `c` fields.\n\t\t * @type {boolean}\n\t\t /\n\t\tthis.needsUpdate = true;\n\n\t}\n\n\t/\n\t Returns whether the triangle intersects the given sphere.\n\t * @param {Sphere} sphere\n\t * @returns {boolean}\n\t /\n\tintersectsSphere( sphere ) {\n\n\t\treturn sphereIntersectTriangle( sphere, this );\n\n\t}\n\n\tupdate() {\n\n\t\tconst a = this.a;\n\t\tconst b = this.b;\n\t\tconst c = this.c;\n\t\tconst points = this.points;\n\n\t\tconst satAxes = this.satAxes;\n\t\tconst satBounds = this.satBounds;\n\n\t\tconst axis0 = satAxes[ 0 ];\n\t\tconst sab0 = satBounds[ 0 ];\n\t\tthis.getNormal( axis0 );\n\t\tsab0.setFromPoints( axis0, points );\n\n\t\tconst axis1 = satAxes[ 1 ];\n\t\tconst sab1 = satBounds[ 1 ];\n\t\taxis1.subVectors( a, b );\n\t\tsab1.setFromPoints( axis1, points );\n\n\t\tconst axis2 = satAxes[ 2 ];\n\t\tconst sab2 = satBounds[ 2 ];\n\t\taxis2.subVectors( b, c );\n\t\tsab2.setFromPoints( axis2, points );\n\n\t\tconst axis3 = satAxes[ 3 ];\n\t\tconst sab3 = satBounds[ 3 ];\n\t\taxis3.subVectors( c, a );\n\t\tsab3.setFromPoints( axis3, points );\n\n\t\tconst lengthAB = axis1.length();\n\t\tconst lengthBC = axis2.length();\n\t\tconst lengthCA = axis3.length();\n\n\t\tthis.isDegenerateIntoPoint = false;\n\t\tthis.isDegenerateIntoSegment = false;\n\n\t\tif ( lengthAB < ZERO_EPSILON ) {\n\n\t\t\tif ( lengthBC < ZERO_EPSILON \|\| lengthCA < ZERO_EPSILON ) {\n\n\t\t\t\tthis.isDegenerateIntoPoint = true;\n\n\t\t\t} else {\n\n\t\t\t\tthis.isDegenerateIntoSegment = true;\n\t\t\t\tthis.degenerateSegment.start.copy( a );\n\t\t\t\tthis.degenerateSegment.end.copy( c );\n\n\t\t\t}\n\n\t\t} else if ( lengthBC < ZERO_EPSILON ) {\n\n\t\t\tif ( lengthCA < ZERO_EPSILON ) {\n\n\t\t\t\tthis.isDegenerateIntoPoint = true;\n\n\t\t\t} else {\n\n\t\t\t\tthis.isDegenerateIntoSegment = true;\n\t\t\t\tthis.degenerateSegment.start.copy( b );\n\t\t\t\tthis.degenerateSegment.end.copy( a );\n\n\t\t\t}\n\n\t\t} else if ( lengthCA < ZERO_EPSILON ) {\n\n\t\t\tthis.isDegenerateIntoSegment = true;\n\t\t\tthis.degenerateSegment.start.copy( c );\n\t\t\tthis.degenerateSegment.end.copy( b );\n\n\t\t}\n\n\t\tthis.plane.setFromNormalAndCoplanarPoint( axis0, a );\n\n\t\tthis.needsUpdate = false;\n\n\t}\n\n}\n\n/\n Returns the distance to the provided line segment. `target1` and `target2` are set to the\n * closest points on the triangle and segment respectively.\n * @function\n * @param {Line3} segment\n * @param {Vector3} [target1]\n * @param {Vector3} [target2]\n * @returns {number}\n /\nExtendedTriangle.prototype.closestPointToSegment = ( function () {\n\n\tconst point1 = / @__PURE__ / new Vector3();\n\tconst point2 = / @__PURE__ / new Vector3();\n\tconst edge = / @__PURE__ / new Line3();\n\n\treturn function distanceToSegment( segment, target1 = null, target2 = null ) {\n\n\t\tconst { start, end } = segment;\n\t\tconst points = this.points;\n\t\tlet distSq;\n\t\tlet closestDistanceSq = Infinity;\n\n\t\t// check the triangle edges\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst nexti = ( i + 1 ) % 3;\n\t\t\tedge.start.copy( points[ i ] );\n\t\t\tedge.end.copy( points[ nexti ] );\n\n\t\t\tclosestPointsSegmentToSegment( edge, segment, point1, point2 );\n\n\t\t\tdistSq = point1.distanceToSquared( point2 );\n\t\t\tif ( distSq < closestDistanceSq ) {\n\n\t\t\t\tclosestDistanceSq = distSq;\n\t\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t}\n\n\t\t}\n\n\t\t// check end points\n\t\tthis.closestPointToPoint( start, point1 );\n\t\tdistSq = start.distanceToSquared( point1 );\n\t\tif ( distSq < closestDistanceSq ) {\n\n\t\t\tclosestDistanceSq = distSq;\n\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\tif ( target2 ) target2.copy( start );\n\n\t\t}\n\n\t\tthis.closestPointToPoint( end, point1 );\n\t\tdistSq = end.distanceToSquared( point1 );\n\t\tif ( distSq < closestDistanceSq ) {\n\n\t\t\tclosestDistanceSq = distSq;\n\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\tif ( target2 ) target2.copy( end );\n\n\t\t}\n\n\t\treturn Math.sqrt( closestDistanceSq );\n\n\t};\n\n} )();\n\n/\n Returns whether the triangles intersect. `target` is set to the line segment representing\n * the intersection.\n * @function\n * @param {Triangle} other\n * @param {Line3} [target]\n * @param {boolean} [suppressLog=false]\n * @returns {boolean}\n /\nExtendedTriangle.prototype.intersectsTriangle = ( function () {\n\n\tconst saTri2 = / @__PURE__ / new ExtendedTriangle();\n\tconst cachedSatBounds = / @__PURE__ / new SeparatingAxisBounds();\n\tconst cachedSatBounds2 = / @__PURE__ / new SeparatingAxisBounds();\n\tconst tmpVec = / @__PURE__ / new Vector3();\n\tconst dir1 = / @__PURE__ / new Vector3();\n\tconst dir2 = / @__PURE__ / new Vector3();\n\tconst tempDir = / @__PURE__ / new Vector3();\n\tconst edge1 = / @__PURE__ / new Line3();\n\tconst edge2 = / @__PURE__ / new Line3();\n\tconst tempPoint = / @__PURE__ / new Vector3();\n\tconst bounds1 = / @__PURE__ / new Vector2();\n\tconst bounds2 = / @__PURE__ / new Vector2();\n\n\tfunction coplanarIntersectsTriangle( self, other, target, suppressLog ) {\n\n\t\t// Perform separating axis intersection test only for coplanar triangles\n\t\t// There should be at least one non-degenerate triangle when calling this\n\t\t// Otherwise we won't know the plane normal\n\t\tconst planeNormal = tmpVec;\n\t\tif ( ! self.isDegenerateIntoPoint && ! self.isDegenerateIntoSegment ) {\n\n\t\t\tplaneNormal.copy( self.plane.normal );\n\n\t\t} else {\n\n\t\t\tplaneNormal.copy( other.plane.normal );\n\n\t\t}\n\n\t\tconst satBounds1 = self.satBounds;\n\t\tconst satAxes1 = self.satAxes;\n\t\tfor ( let i = 1; i < 4; i ++ ) {\n\n\t\t\tconst sb = satBounds1[ i ];\n\t\t\tconst sa = satAxes1[ i ];\n\t\t\tcachedSatBounds.setFromPoints( sa, other.points );\n\t\t\tif ( sb.isSeparated( cachedSatBounds ) ) return false;\n\n\t\t\ttempDir.copy( planeNormal ).cross( sa );\n\t\t\tcachedSatBounds.setFromPoints( tempDir, self.points );\n\t\t\tcachedSatBounds2.setFromPoints( tempDir, other.points );\n\t\t\tif ( cachedSatBounds.isSeparated( cachedSatBounds2 ) ) return false;\n\n\t\t}\n\n\t\tconst satBounds2 = other.satBounds;\n\t\tconst satAxes2 = other.satAxes;\n\t\tfor ( let i = 1; i < 4; i ++ ) {\n\n\t\t\tconst sb = satBounds2[ i ];\n\t\t\tconst sa = satAxes2[ i ];\n\t\t\tcachedSatBounds.setFromPoints( sa, self.points );\n\t\t\tif ( sb.isSeparated( cachedSatBounds ) ) return false;\n\n\t\t\ttempDir.crossVectors( planeNormal, sa );\n\t\t\tcachedSatBounds.setFromPoints( tempDir, self.points );\n\t\t\tcachedSatBounds2.setFromPoints( tempDir, other.points );\n\t\t\tif ( cachedSatBounds.isSeparated( cachedSatBounds2 ) ) return false;\n\n\t\t}\n\n\t\tif ( target ) {\n\n\t\t\t// TODO find two points that intersect on the edges and make that the result\n\t\t\tif ( ! suppressLog ) {\n\n\t\t\t\tconsole.warn( 'ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0.' );\n\n\t\t\t}\n\n\t\t\ttarget.start.set( 0, 0, 0 );\n\t\t\ttarget.end.set( 0, 0, 0 );\n\n\t\t}\n\n\t\treturn true;\n\n\t}\n\n\tfunction findSingleBounds( a, b, c, aProj, bProj, cProj, aDist, bDist, cDist, bounds, edge ) {\n\n\t\tlet t = aDist / ( aDist - bDist );\n\t\tbounds.x = aProj + ( bProj - aProj ) t;\n\t\tedge.start.subVectors( b, a ).multiplyScalar( t ).add( a );\n\n\t\tt = aDist / ( aDist - cDist );\n\t\tbounds.y = aProj + ( cProj - aProj ) * t;\n\t\tedge.end.subVectors( c, a ).multiplyScalar( t ).add( a );\n\n\t}\n\n\t/*\n\t Calculates intersection segment of a triangle with intersection line.\n\t * Intersection line is snapped to its biggest component.\n\t * And triangle points are passed as a projection on that component.\n\t * @returns {boolean} whether this is a coplanar case or not\n\t /\n\tfunction findIntersectionLineBounds( self, aProj, bProj, cProj, abDist, acDist, aDist, bDist, cDist, bounds, edge ) {\n\n\t\tif ( abDist > 0 ) {\n\n\t\t\t// then bcDist < 0\n\t\t\tfindSingleBounds( self.c, self.a, self.b, cProj, aProj, bProj, cDist, aDist, bDist, bounds, edge );\n\n\t\t} else if ( acDist > 0 ) {\n\n\t\t\tfindSingleBounds( self.b, self.a, self.c, bProj, aProj, cProj, bDist, aDist, cDist, bounds, edge );\n\n\t\t} else if ( bDist cDist > 0 \|\| aDist != 0 ) {\n\n\t\t\tfindSingleBounds( self.a, self.b, self.c, aProj, bProj, cProj, aDist, bDist, cDist, bounds, edge );\n\n\t\t} else if ( bDist != 0 ) {\n\n\t\t\tfindSingleBounds( self.b, self.a, self.c, bProj, aProj, cProj, bDist, aDist, cDist, bounds, edge );\n\n\t\t} else if ( cDist != 0 ) {\n\n\t\t\tfindSingleBounds( self.c, self.a, self.b, cProj, aProj, bProj, cDist, aDist, bDist, bounds, edge );\n\n\t\t} else {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t\treturn false;\n\n\t}\n\n\tfunction intersectTriangleSegment( triangle, degenerateTriangle, target, suppressLog ) {\n\n\t\tconst segment = degenerateTriangle.degenerateSegment;\n\t\tconst startDist = triangle.plane.distanceToPoint( segment.start );\n\t\tconst endDist = triangle.plane.distanceToPoint( segment.end );\n\t\tif ( isNearZero( startDist ) ) {\n\n\t\t\tif ( isNearZero( endDist ) ) {\n\n\t\t\t\treturn coplanarIntersectsTriangle( triangle, degenerateTriangle, target, suppressLog );\n\n\t\t\t} else {\n\n\t\t\t\t// Is this fine to modify target even if there might be no intersection?\n\t\t\t\tif ( target ) {\n\n\t\t\t\t\ttarget.start.copy( segment.start );\n\t\t\t\t\ttarget.end.copy( segment.start );\n\n\t\t\t\t}\n\n\t\t\t\treturn triangle.containsPoint( segment.start );\n\n\t\t\t}\n\n\t\t} else if ( isNearZero( endDist ) ) {\n\n\t\t\tif ( target ) {\n\n\t\t\t\ttarget.start.copy( segment.end );\n\t\t\t\ttarget.end.copy( segment.end );\n\n\t\t\t}\n\n\t\t\treturn triangle.containsPoint( segment.end );\n\n\t\t} else {\n\n\t\t\tif ( triangle.plane.intersectLine( segment, tmpVec ) != null ) {\n\n\t\t\t\tif ( target ) {\n\n\t\t\t\t\ttarget.start.copy( tmpVec );\n\t\t\t\t\ttarget.end.copy( tmpVec );\n\n\t\t\t\t}\n\n\t\t\t\treturn triangle.containsPoint( tmpVec );\n\n\t\t\t} else {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tfunction intersectTrianglePoint( triangle, degenerateTriangle, target ) {\n\n\t\tconst point = degenerateTriangle.a;\n\n\t\tif ( isNearZero( triangle.plane.distanceToPoint( point ) ) && triangle.containsPoint( point ) ) {\n\n\t\t\tif ( target ) {\n\n\t\t\t\ttarget.start.copy( point );\n\t\t\t\ttarget.end.copy( point );\n\n\t\t\t}\n\n\t\t\treturn true;\n\n\t\t} else {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t}\n\n\tfunction intersectSegmentPoint( segmentTri, pointTri, target ) {\n\n\t\tconst segment = segmentTri.degenerateSegment;\n\t\tconst point = pointTri.a;\n\n\t\tsegment.closestPointToPoint( point, true, tmpVec );\n\n\t\tif ( point.distanceToSquared( tmpVec ) < ZERO_EPSILON_SQR ) {\n\n\t\t\tif ( target ) {\n\n\t\t\t\ttarget.start.copy( point );\n\t\t\t\ttarget.end.copy( point );\n\n\t\t\t}\n\n\t\t\treturn true;\n\n\t\t} else {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t}\n\n\tfunction handleDegenerateCases( self, other, target, suppressLog ) {\n\n\t\tif ( self.isDegenerateIntoSegment ) {\n\n\t\t\tif ( other.isDegenerateIntoSegment ) {\n\n\t\t\t\t// TODO: replace with Line.distanceSqToLine3 after r179\n\t\t\t\tconst segment1 = self.degenerateSegment;\n\t\t\t\tconst segment2 = other.degenerateSegment;\n\t\t\t\tconst delta1 = dir1;\n\t\t\t\tconst delta2 = dir2;\n\t\t\t\tsegment1.delta( delta1 );\n\t\t\t\tsegment2.delta( delta2 );\n\t\t\t\tconst startDelta = tmpVec.subVectors( segment2.start, segment1.start );\n\n\t\t\t\tconst denom = delta1.x * delta2.y - delta1.y * delta2.x;\n\t\t\t\tif ( isNearZero( denom ) ) {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t\tconst t = ( startDelta.x * delta2.y - startDelta.y * delta2.x ) / denom;\n\t\t\t\tconst u = - ( delta1.x * startDelta.y - delta1.y * startDelta.x ) / denom;\n\n\t\t\t\tif ( t < 0 \|\| t > 1 \|\| u < 0 \|\| u > 1 ) {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t\tconst z1 = segment1.start.z + delta1.z * t;\n\t\t\t\tconst z2 = segment2.start.z + delta2.z * u;\n\n\t\t\t\tif ( isNearZero( z1 - z2 ) ) {\n\n\t\t\t\t\tif ( target ) {\n\n\t\t\t\t\t\ttarget.start.copy( segment1.start ).addScaledVector( delta1, t );\n\t\t\t\t\t\ttarget.end.copy( segment1.start ).addScaledVector( delta1, t );\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} else if ( other.isDegenerateIntoPoint ) {\n\n\t\t\t\treturn intersectSegmentPoint( self, other, target );\n\n\t\t\t} else {\n\n\t\t\t\treturn intersectTriangleSegment( other, self, target, suppressLog );\n\n\t\t\t}\n\n\t\t} else if ( self.isDegenerateIntoPoint ) {\n\n\t\t\tif ( other.isDegenerateIntoPoint ) {\n\n\t\t\t\tif ( other.a.distanceToSquared( self.a ) < ZERO_EPSILON_SQR ) {\n\n\t\t\t\t\tif ( target ) {\n\n\t\t\t\t\t\ttarget.start.copy( self.a );\n\t\t\t\t\t\ttarget.end.copy( self.a );\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} else if ( other.isDegenerateIntoSegment ) {\n\n\t\t\t\treturn intersectSegmentPoint( other, self, target );\n\n\t\t\t} else {\n\n\t\t\t\treturn intersectTrianglePoint( other, self, target );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tif ( other.isDegenerateIntoPoint ) {\n\n\t\t\t\treturn intersectTrianglePoint( self, other, target );\n\n\t\t\t} else if ( other.isDegenerateIntoSegment ) {\n\n\t\t\t\treturn intersectTriangleSegment( self, other, target, suppressLog );\n\n\t\t\t} /* else this is a general triangle-traingle case, so return undefined /\n\n\t\t}\n\n\t}\n\n\t/ TODO: If the triangles are coplanar and intersecting the target is nonsensical. It should at least\n\t * be a line contained by both triangles if not a different special case somehow represented in the return result.\n\t \n\t General triangle intersection code is based on Moller's algorithm from here: https://web.stanford.edu/class/cs277/resources/papers/Moller1997b.pdf\n\t * Reference implementation from here: https://github.com/erich666/jgt-code/blob/master/Volume_08/Number_1/Shen2003/tri_tri_test/include/Moller97.c#L570\n\t * All degeneracies are handled before the general algorithm.\n\t * Coplanar check is different from Moller's and based on SAT tests.\n\t /\n\treturn function intersectsTriangle( other, target = null, suppressLog = false ) {\n\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\tif ( ! other.isExtendedTriangle ) {\n\n\t\t\tsaTri2.copy( other );\n\t\t\tsaTri2.update();\n\t\t\tother = saTri2;\n\n\t\t} else if ( other.needsUpdate ) {\n\n\t\t\tother.update();\n\n\t\t}\n\n\t\tconst res = handleDegenerateCases( this, other, target, suppressLog );\n\t\tif ( res !== undefined ) {\n\n\t\t\treturn res;\n\n\t\t}\n\n\t\tconst plane1 = this.plane;\n\t\tconst plane2 = other.plane;\n\n\t\tlet a1Dist = plane2.distanceToPoint( this.a );\n\t\tlet b1Dist = plane2.distanceToPoint( this.b );\n\t\tlet c1Dist = plane2.distanceToPoint( this.c );\n\n\t\tif ( isNearZero( a1Dist ) )\n\t\t\ta1Dist = 0;\n\n\t\tif ( isNearZero( b1Dist ) )\n\t\t\tb1Dist = 0;\n\n\t\tif ( isNearZero( c1Dist ) )\n\t\t\tc1Dist = 0;\n\n\t\tconst a1b1Dist = a1Dist b1Dist;\n\t\tconst a1c1Dist = a1Dist * c1Dist;\n\t\tif ( a1b1Dist > 0 && a1c1Dist > 0 ) {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t\tlet a2Dist = plane1.distanceToPoint( other.a );\n\t\tlet b2Dist = plane1.distanceToPoint( other.b );\n\t\tlet c2Dist = plane1.distanceToPoint( other.c );\n\n\t\tif ( isNearZero( a2Dist ) )\n\t\t\ta2Dist = 0;\n\n\t\tif ( isNearZero( b2Dist ) )\n\t\t\tb2Dist = 0;\n\n\t\tif ( isNearZero( c2Dist ) )\n\t\t\tc2Dist = 0;\n\n\t\tconst a2b2Dist = a2Dist * b2Dist;\n\t\tconst a2c2Dist = a2Dist * c2Dist;\n\t\tif ( a2b2Dist > 0 && a2c2Dist > 0 ) {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t\tdir1.copy( plane1.normal );\n\t\tdir2.copy( plane2.normal );\n\t\tconst intersectionLine = dir1.cross( dir2 );\n\n\t\tlet componentIndex = 0;\n\t\tlet maxComponent = Math.abs( intersectionLine.x );\n\t\tconst comp1 = Math.abs( intersectionLine.y );\n\t\tif ( comp1 > maxComponent ) {\n\n\t\t\tmaxComponent = comp1;\n\t\t\tcomponentIndex = 1;\n\n\t\t}\n\n\t\tconst comp2 = Math.abs( intersectionLine.z );\n\t\tif ( comp2 > maxComponent ) {\n\n\t\t\tcomponentIndex = 2;\n\n\t\t}\n\n\t\tconst key = componentKeys[ componentIndex ];\n\t\tconst a1Proj = this.a[ key ];\n\t\tconst b1Proj = this.b[ key ];\n\t\tconst c1Proj = this.c[ key ];\n\n\t\tconst a2Proj = other.a[ key ];\n\t\tconst b2Proj = other.b[ key ];\n\t\tconst c2Proj = other.c[ key ];\n\n\t\tif ( findIntersectionLineBounds( this, a1Proj, b1Proj, c1Proj, a1b1Dist, a1c1Dist, a1Dist, b1Dist, c1Dist, bounds1, edge1 ) ) {\n\n\t\t\treturn coplanarIntersectsTriangle( this, other, target, suppressLog );\n\n\t\t}\n\n\t\tif ( findIntersectionLineBounds( other, a2Proj, b2Proj, c2Proj, a2b2Dist, a2c2Dist, a2Dist, b2Dist, c2Dist, bounds2, edge2 ) ) {\n\n\t\t\treturn coplanarIntersectsTriangle( this, other, target, suppressLog );\n\n\t\t}\n\n\t\tif ( bounds1.y < bounds1.x ) {\n\n\t\t\tconst tmp = bounds1.y;\n\t\t\tbounds1.y = bounds1.x;\n\t\t\tbounds1.x = tmp;\n\n\t\t\ttempPoint.copy( edge1.start );\n\t\t\tedge1.start.copy( edge1.end );\n\t\t\tedge1.end.copy( tempPoint );\n\n\t\t}\n\n\t\tif ( bounds2.y < bounds2.x ) {\n\n\t\t\tconst tmp = bounds2.y;\n\t\t\tbounds2.y = bounds2.x;\n\t\t\tbounds2.x = tmp;\n\n\t\t\ttempPoint.copy( edge2.start );\n\t\t\tedge2.start.copy( edge2.end );\n\t\t\tedge2.end.copy( tempPoint );\n\n\t\t}\n\n\t\tif ( bounds1.y < bounds2.x \|\| bounds2.y < bounds1.x ) {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t\tif ( target ) {\n\n\t\t\tif ( bounds2.x > bounds1.x ) {\n\n\t\t\t\ttarget.start.copy( edge2.start );\n\n\t\t\t} else {\n\n\t\t\t\ttarget.start.copy( edge1.start );\n\n\t\t\t}\n\n\t\t\tif ( bounds2.y < bounds1.y ) {\n\n\t\t\t\ttarget.end.copy( edge2.end );\n\n\t\t\t} else {\n\n\t\t\t\ttarget.end.copy( edge1.end );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn true;\n\n\t};\n\n} )();\n\n\n/*\n Returns the distance to the provided point.\n * @function\n * @param {Vector3} point\n * @returns {number}\n /\nExtendedTriangle.prototype.distanceToPoint = ( function () {\n\n\tconst target = / @__PURE__ / new Vector3();\n\treturn function distanceToPoint( point ) {\n\n\t\tthis.closestPointToPoint( point, target );\n\t\treturn point.distanceTo( target );\n\n\t};\n\n} )();\n\n\n/\n Returns the distance to the provided triangle.\n * @function\n * @param {Triangle} other\n * @param {Vector3} [target1]\n * @param {Vector3} [target2]\n * @returns {number}\n /\nExtendedTriangle.prototype.distanceToTriangle = ( function () {\n\n\tconst point = / @__PURE__ / new Vector3();\n\tconst point2 = / @__PURE__ / new Vector3();\n\tconst cornerFields = [ 'a', 'b', 'c' ];\n\tconst line1 = / @__PURE__ / new Line3();\n\tconst line2 = / @__PURE__ / new Line3();\n\n\treturn function distanceToTriangle( other, target1 = null, target2 = null ) {\n\n\t\tconst lineTarget = target1 \|\| target2 ? line1 : null;\n\t\t// `intersectsTriangle` returns a zero-length segment for coplanar\n\t\t// intersecting triangles, which is fine for our purposes here. We\n\t\t// don't need the segment itself in this function. So we can suppress\n\t\t// the warning about coplanar triangles.\n\t\tif ( this.intersectsTriangle( other, lineTarget, true ) ) {\n\n\t\t\tif ( target1 \|\| target2 ) {\n\n\t\t\t\tif ( target1 ) lineTarget.getCenter( target1 );\n\t\t\t\tif ( target2 ) lineTarget.getCenter( target2 );\n\n\t\t\t}\n\n\t\t\treturn 0;\n\n\t\t}\n\n\t\tlet closestDistanceSq = Infinity;\n\n\t\t// check all point distances\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tlet dist;\n\t\t\tconst field = cornerFields[ i ];\n\t\t\tconst otherVec = other[ field ];\n\t\t\tthis.closestPointToPoint( otherVec, point );\n\n\t\t\tdist = otherVec.distanceToSquared( point );\n\n\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\tif ( target1 ) target1.copy( point );\n\t\t\t\tif ( target2 ) target2.copy( otherVec );\n\n\t\t\t}\n\n\n\t\t\tconst thisVec = this[ field ];\n\t\t\tother.closestPointToPoint( thisVec, point );\n\n\t\t\tdist = thisVec.distanceToSquared( point );\n\n\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\tif ( target1 ) target1.copy( thisVec );\n\t\t\t\tif ( target2 ) target2.copy( point );\n\n\t\t\t}\n\n\t\t}\n\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst f11 = cornerFields[ i ];\n\t\t\tconst f12 = cornerFields[ ( i + 1 ) % 3 ];\n\t\t\tline1.set( this[ f11 ], this[ f12 ] );\n\t\t\tfor ( let i2 = 0; i2 < 3; i2 ++ ) {\n\n\t\t\t\tconst f21 = cornerFields[ i2 ];\n\t\t\t\tconst f22 = cornerFields[ ( i2 + 1 ) % 3 ];\n\t\t\t\tline2.set( other[ f21 ], other[ f22 ] );\n\n\t\t\t\tclosestPointsSegmentToSegment( line1, line2, point, point2 );\n\n\t\t\t\tconst dist = point.distanceToSquared( point2 );\n\t\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\t\tif ( target1 ) target1.copy( point );\n\t\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn Math.sqrt( closestDistanceSq );\n\n\t};\n\n} )();\n","/* @import { Box3, Triangle } from 'three' /\nimport { Vector3, Matrix4, Line3 } from 'three';\nimport { SeparatingAxisBounds } from './SeparatingAxisBounds.js';\nimport { ExtendedTriangle } from './ExtendedTriangle.js';\nimport { closestPointsSegmentToSegment } from './MathUtilities.js';\n\n/\n An oriented version of three.js' Box3 class. A variety of derivative values are cached on the\n * object to accelerate the intersection functions. `.needsUpdate` must be set to true when\n * modifying the box parameters.\n \n @param {Vector3} [min]\n * @param {Vector3} [max]\n * @param {Matrix4} [matrix]\n /\nexport class OrientedBox {\n\n\tconstructor( min, max, matrix ) {\n\n\t\tthis.isOrientedBox = true;\n\n\t\t/* @type {Vector3} /\n\t\tthis.min = new Vector3();\n\n\t\t/* @type {Vector3} /\n\t\tthis.max = new Vector3();\n\n\t\t/\n\t\t Matrix transformation applied to the box.\n\t\t * @type {Matrix4}\n\t\t /\n\t\tthis.matrix = new Matrix4();\n\t\tthis.invMatrix = new Matrix4();\n\t\tthis.points = new Array( 8 ).fill().map( () => new Vector3() );\n\t\tthis.satAxes = new Array( 3 ).fill().map( () => new Vector3() );\n\t\tthis.satBounds = new Array( 3 ).fill().map( () => new SeparatingAxisBounds() );\n\t\tthis.alignedSatBounds = new Array( 3 ).fill().map( () => new SeparatingAxisBounds() );\n\t\t/\n\t\t Indicates that the bounding box fields have changed so cached variables to accelerate\n\t\t * other function execution can be updated. Must be set to true after modifying the\n\t\t * oriented box `min`, `max`, `matrix` fields.\n\t\t * @type {boolean}\n\t\t /\n\t\tthis.needsUpdate = false;\n\n\t\tif ( min ) this.min.copy( min );\n\t\tif ( max ) this.max.copy( max );\n\t\tif ( matrix ) this.matrix.copy( matrix );\n\n\t}\n\n\t/\n\t Sets the oriented box parameters.\n\t * @param {Vector3} min\n\t * @param {Vector3} max\n\t * @param {Matrix4} matrix\n\t /\n\tset( min, max, matrix ) {\n\n\t\tthis.min.copy( min );\n\t\tthis.max.copy( max );\n\t\tthis.matrix.copy( matrix );\n\t\tthis.needsUpdate = true;\n\n\t}\n\n\tcopy( other ) {\n\n\t\tthis.min.copy( other.min );\n\t\tthis.max.copy( other.max );\n\t\tthis.matrix.copy( other.matrix );\n\t\tthis.needsUpdate = true;\n\n\t}\n\n}\n\nOrientedBox.prototype.update = ( function () {\n\n\treturn function update() {\n\n\t\tconst matrix = this.matrix;\n\t\tconst min = this.min;\n\t\tconst max = this.max;\n\n\t\tconst points = this.points;\n\t\tfor ( let x = 0; x <= 1; x ++ ) {\n\n\t\t\tfor ( let y = 0; y <= 1; y ++ ) {\n\n\t\t\t\tfor ( let z = 0; z <= 1; z ++ ) {\n\n\t\t\t\t\tconst i = ( ( 1 << 0 ) x ) \| ( ( 1 << 1 ) * y ) \| ( ( 1 << 2 ) * z );\n\t\t\t\t\tconst v = points[ i ];\n\t\t\t\t\tv.x = x ? max.x : min.x;\n\t\t\t\t\tv.y = y ? max.y : min.y;\n\t\t\t\t\tv.z = z ? max.z : min.z;\n\n\t\t\t\t\tv.applyMatrix4( matrix );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tconst satBounds = this.satBounds;\n\t\tconst satAxes = this.satAxes;\n\t\tconst minVec = points[ 0 ];\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst axis = satAxes[ i ];\n\t\t\tconst sb = satBounds[ i ];\n\t\t\tconst index = 1 << i;\n\t\t\tconst pi = points[ index ];\n\n\t\t\taxis.subVectors( minVec, pi );\n\t\t\tsb.setFromPoints( axis, points );\n\n\t\t}\n\n\t\tconst alignedSatBounds = this.alignedSatBounds;\n\t\talignedSatBounds[ 0 ].setFromPointsField( points, 'x' );\n\t\talignedSatBounds[ 1 ].setFromPointsField( points, 'y' );\n\t\talignedSatBounds[ 2 ].setFromPointsField( points, 'z' );\n\n\t\tthis.invMatrix.copy( this.matrix ).invert();\n\t\tthis.needsUpdate = false;\n\n\t};\n\n} )();\n\n/*\n Returns true if intersecting with the provided box.\n * @function\n * @param {Box3} box\n * @returns {boolean}\n /\nOrientedBox.prototype.intersectsBox = ( function () {\n\n\tconst aabbBounds = / @__PURE__ / new SeparatingAxisBounds();\n\treturn function intersectsBox( box ) {\n\n\t\t// TODO: should this be doing SAT against the AABB?\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\tconst min = box.min;\n\t\tconst max = box.max;\n\t\tconst satBounds = this.satBounds;\n\t\tconst satAxes = this.satAxes;\n\t\tconst alignedSatBounds = this.alignedSatBounds;\n\n\t\taabbBounds.min = min.x;\n\t\taabbBounds.max = max.x;\n\t\tif ( alignedSatBounds[ 0 ].isSeparated( aabbBounds ) ) return false;\n\n\t\taabbBounds.min = min.y;\n\t\taabbBounds.max = max.y;\n\t\tif ( alignedSatBounds[ 1 ].isSeparated( aabbBounds ) ) return false;\n\n\t\taabbBounds.min = min.z;\n\t\taabbBounds.max = max.z;\n\t\tif ( alignedSatBounds[ 2 ].isSeparated( aabbBounds ) ) return false;\n\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst axis = satAxes[ i ];\n\t\t\tconst sb = satBounds[ i ];\n\t\t\taabbBounds.setFromBox( axis, box );\n\t\t\tif ( sb.isSeparated( aabbBounds ) ) return false;\n\n\t\t}\n\n\t\treturn true;\n\n\t};\n\n} )();\n\n/\n Returns true if intersecting with the provided triangle.\n * @function\n * @param {Triangle} triangle\n * @returns {boolean}\n /\nOrientedBox.prototype.intersectsTriangle = ( function () {\n\n\tconst saTri = / @__PURE__ / new ExtendedTriangle();\n\tconst pointsArr = / @__PURE__ / new Array( 3 );\n\tconst cachedSatBounds = / @__PURE__ / new SeparatingAxisBounds();\n\tconst cachedSatBounds2 = / @__PURE__ / new SeparatingAxisBounds();\n\tconst cachedAxis = / @__PURE__ / new Vector3();\n\treturn function intersectsTriangle( triangle ) {\n\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\tif ( ! triangle.isExtendedTriangle ) {\n\n\t\t\tsaTri.copy( triangle );\n\t\t\tsaTri.update();\n\t\t\ttriangle = saTri;\n\n\t\t} else if ( triangle.needsUpdate ) {\n\n\t\t\ttriangle.update();\n\n\t\t}\n\n\t\tconst satBounds = this.satBounds;\n\t\tconst satAxes = this.satAxes;\n\n\t\tpointsArr[ 0 ] = triangle.a;\n\t\tpointsArr[ 1 ] = triangle.b;\n\t\tpointsArr[ 2 ] = triangle.c;\n\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sb = satBounds[ i ];\n\t\t\tconst sa = satAxes[ i ];\n\t\t\tcachedSatBounds.setFromPoints( sa, pointsArr );\n\t\t\tif ( sb.isSeparated( cachedSatBounds ) ) return false;\n\n\t\t}\n\n\t\tconst triSatBounds = triangle.satBounds;\n\t\tconst triSatAxes = triangle.satAxes;\n\t\tconst points = this.points;\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sb = triSatBounds[ i ];\n\t\t\tconst sa = triSatAxes[ i ];\n\t\t\tcachedSatBounds.setFromPoints( sa, points );\n\t\t\tif ( sb.isSeparated( cachedSatBounds ) ) return false;\n\n\t\t}\n\n\t\t// check crossed axes\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sa1 = satAxes[ i ];\n\t\t\tfor ( let i2 = 0; i2 < 4; i2 ++ ) {\n\n\t\t\t\tconst sa2 = triSatAxes[ i2 ];\n\t\t\t\tcachedAxis.crossVectors( sa1, sa2 );\n\t\t\t\tcachedSatBounds.setFromPoints( cachedAxis, pointsArr );\n\t\t\t\tcachedSatBounds2.setFromPoints( cachedAxis, points );\n\t\t\t\tif ( cachedSatBounds.isSeparated( cachedSatBounds2 ) ) return false;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn true;\n\n\t};\n\n} )();\n\n/\n Returns the distance to the provided point. Sets `target` to the closest point on the surface\n * of the box if provided.\n * @function\n * @param {Vector3} point\n * @param {Vector3} target\n * @returns {number}\n /\nOrientedBox.prototype.closestPointToPoint = ( function () {\n\n\treturn function closestPointToPoint( point, target1 ) {\n\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\ttarget1\n\t\t\t.copy( point )\n\t\t\t.applyMatrix4( this.invMatrix )\n\t\t\t.clamp( this.min, this.max )\n\t\t\t.applyMatrix4( this.matrix );\n\n\t\treturn target1;\n\n\t};\n\n} )();\n\n/\n Returns the distance to the provided point.\n * @function\n * @param {Vector3} point\n * @returns {number}\n /\nOrientedBox.prototype.distanceToPoint = ( function () {\n\n\tconst target = new Vector3();\n\treturn function distanceToPoint( point ) {\n\n\t\tthis.closestPointToPoint( point, target );\n\t\treturn point.distanceTo( target );\n\n\t};\n\n} )();\n\n/\n Returns the distance to the provided box. `threshold` is an optional distance to return early\n * if the distance is found to be within it. `target1` and `target2` are set to the points on the\n * surface of this box and the `box` argument respectively.\n * @function\n * @param {Box3} box\n * @param {number} [threshold=0]\n * @param {Vector3} [target1]\n * @param {Vector3} [target2]\n * @returns {number}\n /\nOrientedBox.prototype.distanceToBox = ( function () {\n\n\tconst xyzFields = [ 'x', 'y', 'z' ];\n\tconst segments1 = / @__PURE__ / new Array( 12 ).fill().map( () => new Line3() );\n\tconst segments2 = / @__PURE__ / new Array( 12 ).fill().map( () => new Line3() );\n\n\tconst point1 = / @__PURE__ / new Vector3();\n\tconst point2 = / @__PURE__ / new Vector3();\n\n\t// early out if we find a value below threshold\n\treturn function distanceToBox( box, threshold = 0, target1 = null, target2 = null ) {\n\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\tif ( this.intersectsBox( box ) ) {\n\n\t\t\tif ( target1 \|\| target2 ) {\n\n\t\t\t\tbox.getCenter( point2 );\n\t\t\t\tthis.closestPointToPoint( point2, point1 );\n\t\t\t\tbox.closestPointToPoint( point1, point2 );\n\n\t\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t}\n\n\t\t\treturn 0;\n\n\t\t}\n\n\t\tconst threshold2 = threshold threshold;\n\t\tconst min = box.min;\n\t\tconst max = box.max;\n\t\tconst points = this.points;\n\n\n\t\t// iterate over every edge and compare distances\n\t\tlet closestDistanceSq = Infinity;\n\n\t\t// check over all these points\n\t\tfor ( let i = 0; i < 8; i ++ ) {\n\n\t\t\tconst p = points[ i ];\n\t\t\tpoint2.copy( p ).clamp( min, max );\n\n\t\t\tconst dist = p.distanceToSquared( point2 );\n\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\tif ( target1 ) target1.copy( p );\n\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t\tif ( dist < threshold2 ) return Math.sqrt( dist );\n\n\t\t\t}\n\n\t\t}\n\n\t\t// generate and check all line segment distances\n\t\tlet count = 0;\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tfor ( let i1 = 0; i1 <= 1; i1 ++ ) {\n\n\t\t\t\tfor ( let i2 = 0; i2 <= 1; i2 ++ ) {\n\n\t\t\t\t\tconst nextIndex = ( i + 1 ) % 3;\n\t\t\t\t\tconst nextIndex2 = ( i + 2 ) % 3;\n\n\t\t\t\t\t// get obb line segments\n\t\t\t\t\tconst index = i1 << nextIndex \| i2 << nextIndex2;\n\t\t\t\t\tconst index2 = 1 << i \| i1 << nextIndex \| i2 << nextIndex2;\n\t\t\t\t\tconst p1 = points[ index ];\n\t\t\t\t\tconst p2 = points[ index2 ];\n\t\t\t\t\tconst line1 = segments1[ count ];\n\t\t\t\t\tline1.set( p1, p2 );\n\n\n\t\t\t\t\t// get aabb line segments\n\t\t\t\t\tconst f1 = xyzFields[ i ];\n\t\t\t\t\tconst f2 = xyzFields[ nextIndex ];\n\t\t\t\t\tconst f3 = xyzFields[ nextIndex2 ];\n\t\t\t\t\tconst line2 = segments2[ count ];\n\t\t\t\t\tconst start = line2.start;\n\t\t\t\t\tconst end = line2.end;\n\n\t\t\t\t\tstart[ f1 ] = min[ f1 ];\n\t\t\t\t\tstart[ f2 ] = i1 ? min[ f2 ] : max[ f2 ];\n\t\t\t\t\tstart[ f3 ] = i2 ? min[ f3 ] : max[ f2 ];\n\n\t\t\t\t\tend[ f1 ] = max[ f1 ];\n\t\t\t\t\tend[ f2 ] = i1 ? min[ f2 ] : max[ f2 ];\n\t\t\t\t\tend[ f3 ] = i2 ? min[ f3 ] : max[ f2 ];\n\n\t\t\t\t\tcount ++;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\t// check all the other boxes point\n\t\tfor ( let x = 0; x <= 1; x ++ ) {\n\n\t\t\tfor ( let y = 0; y <= 1; y ++ ) {\n\n\t\t\t\tfor ( let z = 0; z <= 1; z ++ ) {\n\n\t\t\t\t\tpoint2.x = x ? max.x : min.x;\n\t\t\t\t\tpoint2.y = y ? max.y : min.y;\n\t\t\t\t\tpoint2.z = z ? max.z : min.z;\n\n\t\t\t\t\tthis.closestPointToPoint( point2, point1 );\n\t\t\t\t\tconst dist = point2.distanceToSquared( point1 );\n\t\t\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t\t\t\tif ( dist < threshold2 ) return Math.sqrt( dist );\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tfor ( let i = 0; i < 12; i ++ ) {\n\n\t\t\tconst l1 = segments1[ i ];\n\t\t\tfor ( let i2 = 0; i2 < 12; i2 ++ ) {\n\n\t\t\t\tconst l2 = segments2[ i2 ];\n\t\t\t\tclosestPointsSegmentToSegment( l1, l2, point1, point2 );\n\t\t\t\tconst dist = point1.distanceToSquared( point2 );\n\t\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t\t\tif ( dist < threshold2 ) return Math.sqrt( dist );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn Math.sqrt( closestDistanceSq );\n\n\t};\n\n} )();\n","import { ExtendedTriangle } from '../math/ExtendedTriangle.js';\nimport { PrimitivePool } from './PrimitivePool.js';\n\nclass ExtendedTrianglePoolBase extends PrimitivePool {\n\n\tconstructor() {\n\n\t\tsuper( () => new ExtendedTriangle() );\n\n\t}\n\n}\n\nexport const ExtendedTrianglePool = /* @__PURE__ / new ExtendedTrianglePoolBase();\n","import { Vector3 } from 'three';\n\nconst temp = / @__PURE__ / new Vector3();\nconst temp1 = / @__PURE__ / new Vector3();\n\nexport function closestPointToPoint(\n\tbvh,\n\tpoint,\n\ttarget = { },\n\tminThreshold = 0,\n\tmaxThreshold = Infinity,\n) {\n\n\t// early out if under minThreshold\n\t// skip checking if over maxThreshold\n\t// set minThreshold = maxThreshold to quickly check if a point is within a threshold\n\t// returns Infinity if no value found\n\tconst minThresholdSq = minThreshold minThreshold;\n\tconst maxThresholdSq = maxThreshold * maxThreshold;\n\tlet closestDistanceSq = Infinity;\n\tlet closestDistanceTriIndex = null;\n\tbvh.shapecast(\n\n\t\t{\n\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\ttemp.copy( point ).clamp( box.min, box.max );\n\t\t\t\treturn temp.distanceToSquared( point );\n\n\t\t\t},\n\n\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\treturn score < closestDistanceSq && score < maxThresholdSq;\n\n\t\t\t},\n\n\t\t\tintersectsTriangle: ( tri, triIndex ) => {\n\n\t\t\t\ttri.closestPointToPoint( point, temp );\n\t\t\t\tconst distSq = point.distanceToSquared( temp );\n\t\t\t\tif ( distSq < closestDistanceSq ) {\n\n\t\t\t\t\ttemp1.copy( temp );\n\t\t\t\t\tclosestDistanceSq = distSq;\n\t\t\t\t\tclosestDistanceTriIndex = triIndex;\n\n\t\t\t\t}\n\n\t\t\t\tif ( distSq < minThresholdSq ) {\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t},\n\n\t\t}\n\n\t);\n\n\tif ( closestDistanceSq === Infinity ) return null;\n\n\tconst closestDistance = Math.sqrt( closestDistanceSq );\n\n\tif ( ! target.point ) target.point = temp1.clone();\n\telse target.point.copy( temp1 );\n\ttarget.distance = closestDistance,\n\ttarget.faceIndex = closestDistanceTriIndex;\n\n\treturn target;\n\n}\n","import { Vector3, Vector2, Triangle, DoubleSide, BackSide, REVISION } from 'three';\n\nconst IS_GT_REVISION_169 = parseInt( REVISION ) >= 169;\nconst IS_LT_REVISION_161 = parseInt( REVISION ) <= 161;\n\n// Ripped and modified From THREE.js Mesh raycast\n// https://github.com/mrdoob/three.js/blob/0aa87c999fe61e216c1133fba7a95772b503eddf/src/objects/Mesh.js#L115\nconst _vA = /* @__PURE__ / new Vector3();\nconst _vB = / @__PURE__ / new Vector3();\nconst _vC = / @__PURE__ / new Vector3();\n\nconst _uvA = / @__PURE__ / new Vector2();\nconst _uvB = / @__PURE__ / new Vector2();\nconst _uvC = / @__PURE__ / new Vector2();\n\nconst _normalA = / @__PURE__ / new Vector3();\nconst _normalB = / @__PURE__ / new Vector3();\nconst _normalC = / @__PURE__ / new Vector3();\n\nconst _intersectionPoint = / @__PURE__ / new Vector3();\nfunction checkIntersection( ray, pA, pB, pC, point, side, near, far ) {\n\n\tlet intersect;\n\tif ( side === BackSide ) {\n\n\t\tintersect = ray.intersectTriangle( pC, pB, pA, true, point );\n\n\t} else {\n\n\t\tintersect = ray.intersectTriangle( pA, pB, pC, side !== DoubleSide, point );\n\n\t}\n\n\tif ( intersect === null ) return null;\n\n\tconst distance = ray.origin.distanceTo( point );\n\n\tif ( distance < near \|\| distance > far ) return null;\n\n\treturn {\n\n\t\tdistance: distance,\n\t\tpoint: point.clone(),\n\n\t};\n\n}\n\nfunction checkBufferGeometryIntersection( ray, position, normal, uv, uv1, a, b, c, side, near, far ) {\n\n\t_vA.fromBufferAttribute( position, a );\n\t_vB.fromBufferAttribute( position, b );\n\t_vC.fromBufferAttribute( position, c );\n\n\tconst intersection = checkIntersection( ray, _vA, _vB, _vC, _intersectionPoint, side, near, far );\n\n\tif ( intersection ) {\n\n\t\tif ( uv ) {\n\n\t\t\t_uvA.fromBufferAttribute( uv, a );\n\t\t\t_uvB.fromBufferAttribute( uv, b );\n\t\t\t_uvC.fromBufferAttribute( uv, c );\n\n\t\t\tintersection.uv = new Vector2();\n\t\t\tconst res = Triangle.getInterpolation( _intersectionPoint, _vA, _vB, _vC, _uvA, _uvB, _uvC, intersection.uv );\n\t\t\tif ( ! IS_GT_REVISION_169 ) {\n\n\t\t\t\tintersection.uv = res;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( uv1 ) {\n\n\t\t\t_uvA.fromBufferAttribute( uv1, a );\n\t\t\t_uvB.fromBufferAttribute( uv1, b );\n\t\t\t_uvC.fromBufferAttribute( uv1, c );\n\n\t\t\tintersection.uv1 = new Vector2();\n\t\t\tconst res = Triangle.getInterpolation( _intersectionPoint, _vA, _vB, _vC, _uvA, _uvB, _uvC, intersection.uv1 );\n\t\t\tif ( ! IS_GT_REVISION_169 ) {\n\n\t\t\t\tintersection.uv1 = res;\n\n\t\t\t}\n\n\t\t\tif ( IS_LT_REVISION_161 ) {\n\n\t\t\t\tintersection.uv2 = intersection.uv1;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( normal ) {\n\n\t\t\t_normalA.fromBufferAttribute( normal, a );\n\t\t\t_normalB.fromBufferAttribute( normal, b );\n\t\t\t_normalC.fromBufferAttribute( normal, c );\n\n\t\t\tintersection.normal = new Vector3();\n\t\t\tconst res = Triangle.getInterpolation( _intersectionPoint, _vA, _vB, _vC, _normalA, _normalB, _normalC, intersection.normal );\n\t\t\tif ( intersection.normal.dot( ray.direction ) > 0 ) {\n\n\t\t\t\tintersection.normal.multiplyScalar( - 1 );\n\n\t\t\t}\n\n\t\t\tif ( ! IS_GT_REVISION_169 ) {\n\n\t\t\t\tintersection.normal = res;\n\n\t\t\t}\n\n\t\t}\n\n\t\tconst face = {\n\t\t\ta: a,\n\t\t\tb: b,\n\t\t\tc: c,\n\t\t\tnormal: new Vector3(),\n\t\t\tmaterialIndex: 0\n\t\t};\n\n\t\tTriangle.getNormal( _vA, _vB, _vC, face.normal );\n\n\t\tintersection.face = face;\n\t\tintersection.faceIndex = a;\n\n\t\tif ( IS_GT_REVISION_169 ) {\n\n\t\t\tconst barycoord = new Vector3();\n\t\t\tTriangle.getBarycoord( _intersectionPoint, _vA, _vB, _vC, barycoord );\n\n\t\t\tintersection.barycoord = barycoord;\n\n\t\t}\n\n\t}\n\n\treturn intersection;\n\n}\n\nfunction getSide( materialOrSide ) {\n\n\treturn materialOrSide && materialOrSide.isMaterial ? materialOrSide.side : materialOrSide;\n\n}\n\n// https://github.com/mrdoob/three.js/blob/0aa87c999fe61e216c1133fba7a95772b503eddf/src/objects/Mesh.js#L258\nexport function intersectTri( geometry, materialOrSide, ray, tri, intersections, near, far ) {\n\n\tconst triOffset = tri 3;\n\tlet a = triOffset + 0;\n\tlet b = triOffset + 1;\n\tlet c = triOffset + 2;\n\n\tconst { index, groups } = geometry;\n\tif ( geometry.index ) {\n\n\t\ta = index.getX( a );\n\t\tb = index.getX( b );\n\t\tc = index.getX( c );\n\n\t}\n\n\tconst { position, normal, uv, uv1 } = geometry.attributes;\n\tif ( Array.isArray( materialOrSide ) ) {\n\n\t\t// check which groups a triangle is present in and run the intersections\n\t\t// TODO: we shouldn't need to run and intersection test multiple times\n\t\tconst firstIndex = tri * 3;\n\t\tfor ( let i = 0, l = groups.length; i < l; i ++ ) {\n\n\t\t\tconst { start, count, materialIndex } = groups[ i ];\n\t\t\tif ( firstIndex >= start && firstIndex < start + count ) {\n\n\t\t\t\tconst side = getSide( materialOrSide[ materialIndex ] );\n\t\t\t\tconst intersection = checkBufferGeometryIntersection( ray, position, normal, uv, uv1, a, b, c, side, near, far );\n\t\t\t\tif ( intersection ) {\n\n\t\t\t\t\tintersection.faceIndex = tri;\n\t\t\t\t\tintersection.face.materialIndex = materialIndex;\n\n\t\t\t\t\tif ( intersections ) {\n\n\t\t\t\t\t\tintersections.push( intersection );\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\treturn intersection;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t} else {\n\n\t\t// run the intersection for the single material\n\t\tconst side = getSide( materialOrSide );\n\t\tconst intersection = checkBufferGeometryIntersection( ray, position, normal, uv, uv1, a, b, c, side, near, far );\n\t\tif ( intersection ) {\n\n\t\t\tintersection.faceIndex = tri;\n\t\t\tintersection.face.materialIndex = 0;\n\n\t\t\tif ( intersections ) {\n\n\t\t\t\tintersections.push( intersection );\n\n\t\t\t} else {\n\n\t\t\t\treturn intersection;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn null;\n\n}\n","/** @import { BufferGeometry } from 'three' /\nimport { Vector2, Vector3, Triangle } from 'three';\n\n// sets the vertices of triangle `tri` with the 3 vertices after i\nexport function setTriangle( tri, i, index, pos ) {\n\n\tconst ta = tri.a;\n\tconst tb = tri.b;\n\tconst tc = tri.c;\n\n\tlet i0 = i;\n\tlet i1 = i + 1;\n\tlet i2 = i + 2;\n\tif ( index ) {\n\n\t\ti0 = index.getX( i0 );\n\t\ti1 = index.getX( i1 );\n\t\ti2 = index.getX( i2 );\n\n\t}\n\n\tta.x = pos.getX( i0 );\n\tta.y = pos.getY( i0 );\n\tta.z = pos.getZ( i0 );\n\n\ttb.x = pos.getX( i1 );\n\ttb.y = pos.getY( i1 );\n\ttb.z = pos.getZ( i1 );\n\n\ttc.x = pos.getX( i2 );\n\ttc.y = pos.getY( i2 );\n\ttc.z = pos.getZ( i2 );\n\n}\n\nconst tempV1 = / @__PURE__ / new Vector3();\nconst tempV2 = / @__PURE__ / new Vector3();\nconst tempV3 = / @__PURE__ / new Vector3();\nconst tempUV1 = / @__PURE__ / new Vector2();\nconst tempUV2 = / @__PURE__ / new Vector2();\nconst tempUV3 = / @__PURE__ / new Vector2();\n\n/\n @typedef {Object} HitTriangleInfo\n * @property {{ a: number, b: number, c: number, materialIndex: number, normal: Vector3 }} face\n * Triangle vertex indices, material index, and face normal.\n * @property {Vector2\|null} uv - UV coordinates at the hit point, or `null` if no UV attribute is present.\n * @property {Vector3} barycoord - Barycentric coordinates of the hit point within the triangle.\n /\n\n/\n Computes hit-point information for a point on a triangle within a `BufferGeometry`. Returns\n * the face vertex indices, face normal, material index, UV coordinates, and barycentric coordinates.\n * Useful for retrieving detailed hit data after a call to `MeshBVH.closestPointToPoint` or\n * `MeshBVH.closestPointToGeometry`.\n \n @section Functions\n * @param {Vector3} point - The point on the triangle surface (in the geometry's local space).\n * @param {BufferGeometry} geometry - The geometry containing the triangle.\n * @param {number} triangleIndex - The index of the triangle within the geometry.\n * @param {HitTriangleInfo} [target] - Optional object to write results into. Reuses existing\n * `face`, `uv`, and `barycoord` sub-objects if present.\n * @returns {HitTriangleInfo}\n /\nexport function getTriangleHitPointInfo( point, geometry, triangleIndex, target ) {\n\n\tconst indices = geometry.getIndex().array;\n\tconst positions = geometry.getAttribute( 'position' );\n\tconst uvs = geometry.getAttribute( 'uv' );\n\n\tconst a = indices[ triangleIndex 3 ];\n\tconst b = indices[ triangleIndex * 3 + 1 ];\n\tconst c = indices[ triangleIndex * 3 + 2 ];\n\n\ttempV1.fromBufferAttribute( positions, a );\n\ttempV2.fromBufferAttribute( positions, b );\n\ttempV3.fromBufferAttribute( positions, c );\n\n\t// find the associated material index\n\tlet materialIndex = 0;\n\tconst groups = geometry.groups;\n\tconst firstVertexIndex = triangleIndex * 3;\n\tfor ( let i = 0, l = groups.length; i < l; i ++ ) {\n\n\t\tconst group = groups[ i ];\n\t\tconst { start, count } = group;\n\t\tif ( firstVertexIndex >= start && firstVertexIndex < start + count ) {\n\n\t\t\tmaterialIndex = group.materialIndex;\n\t\t\tbreak;\n\n\t\t}\n\n\t}\n\n\t// extract barycoord\n\tconst barycoord = target && target.barycoord ? target.barycoord : new Vector3();\n\tTriangle.getBarycoord( point, tempV1, tempV2, tempV3, barycoord );\n\n\t// extract uvs\n\tlet uv = null;\n\tif ( uvs ) {\n\n\t\ttempUV1.fromBufferAttribute( uvs, a );\n\t\ttempUV2.fromBufferAttribute( uvs, b );\n\t\ttempUV3.fromBufferAttribute( uvs, c );\n\n\t\tif ( target && target.uv ) uv = target.uv;\n\t\telse uv = new Vector2();\n\n\t\tTriangle.getInterpolation( point, tempV1, tempV2, tempV3, tempUV1, tempUV2, tempUV3, uv );\n\n\t}\n\n\t// adjust the provided target or create a new one\n\tif ( target ) {\n\n\t\tif ( ! target.face ) target.face = { };\n\t\ttarget.face.a = a;\n\t\ttarget.face.b = b;\n\t\ttarget.face.c = c;\n\t\ttarget.face.materialIndex = materialIndex;\n\t\tif ( ! target.face.normal ) target.face.normal = new Vector3();\n\t\tTriangle.getNormal( tempV1, tempV2, tempV3, target.face.normal );\n\n\t\tif ( uv ) target.uv = uv;\n\t\ttarget.barycoord = barycoord;\n\n\t\treturn target;\n\n\t} else {\n\n\t\treturn {\n\t\t\tface: {\n\t\t\t\ta: a,\n\t\t\t\tb: b,\n\t\t\t\tc: c,\n\t\t\t\tmaterialIndex: materialIndex,\n\t\t\t\tnormal: Triangle.getNormal( tempV1, tempV2, tempV3, new Vector3() )\n\t\t\t},\n\t\t\tuv: uv,\n\t\t\tbarycoord: barycoord,\n\t\t};\n\n\t}\n\n}\n","import { intersectTri } from '../../utils/ThreeRayIntersectUtilities.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\n\n/************************************************************/\n/ This file is generated from \"iterationUtils.template.js\". /\n/***********************************************************/\n\nfunction intersectTris( bvh, materialOrSide, ray, offset, count, intersections, near, far ) {\n\n\tconst { geometry, _indirectBuffer } = bvh;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\n\t\tintersectTri( geometry, materialOrSide, ray, i, intersections, near, far );\n\n\n\t}\n\n}\n\nfunction intersectClosestTri( bvh, materialOrSide, ray, offset, count, near, far ) {\n\n\tconst { geometry, _indirectBuffer } = bvh;\n\tlet dist = Infinity;\n\tlet res = null;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\tlet intersection;\n\n\t\tintersection = intersectTri( geometry, materialOrSide, ray, i, null, near, far );\n\n\n\t\tif ( intersection && intersection.distance < dist ) {\n\n\t\t\tres = intersection;\n\t\t\tdist = intersection.distance;\n\n\t\t}\n\n\t}\n\n\treturn res;\n\n}\n\nfunction iterateOverTriangles(\n\toffset,\n\tcount,\n\tbvh,\n\tintersectsTriangleFunc,\n\tcontained,\n\tdepth,\n\ttriangle\n) {\n\n\tconst { geometry } = bvh;\n\tconst { index } = geometry;\n\tconst pos = geometry.attributes.position;\n\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\tlet tri;\n\n\t\ttri = i;\n\n\t\tsetTriangle( triangle, tri 3, index, pos );\n\t\ttriangle.needsUpdate = true;\n\n\t\tif ( intersectsTriangleFunc( triangle, tri, contained, depth ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n\nexport { intersectClosestTri, intersectTris, iterateOverTriangles };\n","import { UINT32_PER_NODE, BYTES_PER_NODE } from '../Constants.js';\nimport { IS_LEAF, OFFSET, COUNT, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\n\n/***************************************************/\n/ This file is generated from \"refit.template.js\". /\n/**************************************************/\n\nfunction refit( bvh, nodeIndices = null ) {\n\n\tif ( nodeIndices && Array.isArray( nodeIndices ) ) {\n\n\t\tnodeIndices = new Set( nodeIndices );\n\n\t}\n\n\tconst geometry = bvh.geometry;\n\tconst indexArr = geometry.index ? geometry.index.array : null;\n\tconst posAttr = geometry.attributes.position;\n\n\tlet buffer, uint32Array, uint16Array, float32Array;\n\tlet byteOffset = 0;\n\tconst roots = bvh._roots;\n\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\tbuffer = roots[ i ];\n\t\tuint32Array = new Uint32Array( buffer );\n\t\tuint16Array = new Uint16Array( buffer );\n\t\tfloat32Array = new Float32Array( buffer );\n\n\t\t_traverse( 0, byteOffset );\n\t\tbyteOffset += buffer.byteLength;\n\n\t}\n\n\tfunction _traverse( nodeIndex32, byteOffset, force = false ) {\n\n\t\tconst nodeIndex16 = nodeIndex32 2;\n\t\tif ( IS_LEAF( nodeIndex16, uint16Array ) ) {\n\n\t\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t\tlet minx = Infinity;\n\t\t\tlet miny = Infinity;\n\t\t\tlet minz = Infinity;\n\t\t\tlet maxx = - Infinity;\n\t\t\tlet maxy = - Infinity;\n\t\t\tlet maxz = - Infinity;\n\n\n\t\t\tfor ( let i = 3 * offset, l = 3 * ( offset + count ); i < l; i ++ ) {\n\n\t\t\t\tlet index = indexArr[ i ];\n\t\t\t\tconst x = posAttr.getX( index );\n\t\t\t\tconst y = posAttr.getY( index );\n\t\t\t\tconst z = posAttr.getZ( index );\n\n\t\t\t\tif ( x < minx ) minx = x;\n\t\t\t\tif ( x > maxx ) maxx = x;\n\n\t\t\t\tif ( y < miny ) miny = y;\n\t\t\t\tif ( y > maxy ) maxy = y;\n\n\t\t\t\tif ( z < minz ) minz = z;\n\t\t\t\tif ( z > maxz ) maxz = z;\n\n\t\t\t}\n\n\n\t\t\tif (\n\t\t\t\tfloat32Array[ nodeIndex32 + 0 ] !== minx \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 1 ] !== miny \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 2 ] !== minz \|\|\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 3 ] !== maxx \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 4 ] !== maxy \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 5 ] !== maxz\n\t\t\t) {\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 0 ] = minx;\n\t\t\t\tfloat32Array[ nodeIndex32 + 1 ] = miny;\n\t\t\t\tfloat32Array[ nodeIndex32 + 2 ] = minz;\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 3 ] = maxx;\n\t\t\t\tfloat32Array[ nodeIndex32 + 4 ] = maxy;\n\t\t\t\tfloat32Array[ nodeIndex32 + 5 ] = maxz;\n\n\t\t\t\treturn true;\n\n\t\t\t} else {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t\t// the identifying node indices provided by the shapecast function include offsets of all\n\t\t\t// root buffers to guarantee they're unique between roots so offset left and right indices here.\n\t\t\tlet forceChildren = force;\n\t\t\tlet includesLeft = false;\n\t\t\tlet includesRight = false;\n\n\t\t\tif ( nodeIndices ) {\n\n\t\t\t\t// if we see that neither the left or right child are included in the set that need to be updated\n\t\t\t\t// then we assume that all children need to be updated.\n\t\t\t\tif ( ! forceChildren ) {\n\n\t\t\t\t\tconst leftNodeId = left / UINT32_PER_NODE + byteOffset / BYTES_PER_NODE;\n\t\t\t\t\tconst rightNodeId = right / UINT32_PER_NODE + byteOffset / BYTES_PER_NODE;\n\t\t\t\t\tincludesLeft = nodeIndices.has( leftNodeId );\n\t\t\t\t\tincludesRight = nodeIndices.has( rightNodeId );\n\t\t\t\t\tforceChildren = ! includesLeft && ! includesRight;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tincludesLeft = true;\n\t\t\t\tincludesRight = true;\n\n\t\t\t}\n\n\t\t\tconst traverseLeft = forceChildren \|\| includesLeft;\n\t\t\tconst traverseRight = forceChildren \|\| includesRight;\n\n\t\t\tlet leftChange = false;\n\t\t\tif ( traverseLeft ) {\n\n\t\t\t\tleftChange = _traverse( left, byteOffset, forceChildren );\n\n\t\t\t}\n\n\t\t\tlet rightChange = false;\n\t\t\tif ( traverseRight ) {\n\n\t\t\t\trightChange = _traverse( right, byteOffset, forceChildren );\n\n\t\t\t}\n\n\t\t\tconst didChange = leftChange \|\| rightChange;\n\t\t\tif ( didChange ) {\n\n\t\t\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\t\t\tconst left_i = left + i;\n\t\t\t\t\tconst right_i = right + i;\n\t\t\t\t\tconst minLeftValue = float32Array[ left_i ];\n\t\t\t\t\tconst maxLeftValue = float32Array[ left_i + 3 ];\n\t\t\t\t\tconst minRightValue = float32Array[ right_i ];\n\t\t\t\t\tconst maxRightValue = float32Array[ right_i + 3 ];\n\n\t\t\t\t\tfloat32Array[ nodeIndex32 + i ] = minLeftValue < minRightValue ? minLeftValue : minRightValue;\n\t\t\t\t\tfloat32Array[ nodeIndex32 + i + 3 ] = maxLeftValue > maxRightValue ? maxLeftValue : maxRightValue;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn didChange;\n\n\t\t}\n\n\t}\n\n}\n\nexport { refit };\n","\nexport function intersectsNodeBounds( nodeIndex32, array, ray, near, far ) {\n\n\t// This function performs intersection tests similar to Ray.intersectBox in three.js,\n\t// with the difference that the box values are read from an array to improve performance.\n\n\tlet tmin, tmax, tymin, tymax, tzmin, tzmax;\n\n\tconst invdirx = 1 / ray.direction.x,\n\t\tinvdiry = 1 / ray.direction.y,\n\t\tinvdirz = 1 / ray.direction.z;\n\n\tconst ox = ray.origin.x;\n\tconst oy = ray.origin.y;\n\tconst oz = ray.origin.z;\n\n\tlet minx = array[ nodeIndex32 ];\n\tlet maxx = array[ nodeIndex32 + 3 ];\n\n\tlet miny = array[ nodeIndex32 + 1 ];\n\tlet maxy = array[ nodeIndex32 + 3 + 1 ];\n\n\tlet minz = array[ nodeIndex32 + 2 ];\n\tlet maxz = array[ nodeIndex32 + 3 + 2 ];\n\n\tif ( invdirx >= 0 ) {\n\n\t\ttmin = ( minx - ox ) * invdirx;\n\t\ttmax = ( maxx - ox ) * invdirx;\n\n\t} else {\n\n\t\ttmin = ( maxx - ox ) * invdirx;\n\t\ttmax = ( minx - ox ) * invdirx;\n\n\t}\n\n\tif ( invdiry >= 0 ) {\n\n\t\ttymin = ( miny - oy ) * invdiry;\n\t\ttymax = ( maxy - oy ) * invdiry;\n\n\t} else {\n\n\t\ttymin = ( maxy - oy ) * invdiry;\n\t\ttymax = ( miny - oy ) * invdiry;\n\n\t}\n\n\tif ( ( tmin > tymax ) \|\| ( tymin > tmax ) ) return false;\n\n\tif ( tymin > tmin \|\| isNaN( tmin ) ) tmin = tymin;\n\n\tif ( tymax < tmax \|\| isNaN( tmax ) ) tmax = tymax;\n\n\tif ( invdirz >= 0 ) {\n\n\t\ttzmin = ( minz - oz ) * invdirz;\n\t\ttzmax = ( maxz - oz ) * invdirz;\n\n\t} else {\n\n\t\ttzmin = ( maxz - oz ) * invdirz;\n\t\ttzmax = ( minz - oz ) * invdirz;\n\n\t}\n\n\tif ( ( tmin > tzmax ) \|\| ( tzmin > tmax ) ) return false;\n\n\tif ( tzmin > tmin \|\| tmin !== tmin ) tmin = tzmin;\n\n\tif ( tzmax < tmax \|\| tmax !== tmax ) tmax = tzmax;\n\n\t//return point closest to the ray (positive side)\n\n\treturn tmin <= far && tmax >= near;\n\n}\n","import { intersectTri } from '../../utils/ThreeRayIntersectUtilities.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\n\n/************************************************************/\n/ This file is generated from \"iterationUtils.template.js\". /\n/***********************************************************/\n\nfunction intersectTris_indirect( bvh, materialOrSide, ray, offset, count, intersections, near, far ) {\n\n\tconst { geometry, _indirectBuffer } = bvh;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\tlet vi = _indirectBuffer ? _indirectBuffer[ i ] : i;\n\t\tintersectTri( geometry, materialOrSide, ray, vi, intersections, near, far );\n\n\n\t}\n\n}\n\nfunction intersectClosestTri_indirect( bvh, materialOrSide, ray, offset, count, near, far ) {\n\n\tconst { geometry, _indirectBuffer } = bvh;\n\tlet dist = Infinity;\n\tlet res = null;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\tlet intersection;\n\t\tintersection = intersectTri( geometry, materialOrSide, ray, _indirectBuffer ? _indirectBuffer[ i ] : i, null, near, far );\n\n\n\t\tif ( intersection && intersection.distance < dist ) {\n\n\t\t\tres = intersection;\n\t\t\tdist = intersection.distance;\n\n\t\t}\n\n\t}\n\n\treturn res;\n\n}\n\nfunction iterateOverTriangles_indirect(\n\toffset,\n\tcount,\n\tbvh,\n\tintersectsTriangleFunc,\n\tcontained,\n\tdepth,\n\ttriangle\n) {\n\n\tconst { geometry } = bvh;\n\tconst { index } = geometry;\n\tconst pos = geometry.attributes.position;\n\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\tlet tri;\n\t\ttri = bvh.resolveTriangleIndex( i );\n\n\t\tsetTriangle( triangle, tri 3, index, pos );\n\t\ttriangle.needsUpdate = true;\n\n\t\tif ( intersectsTriangleFunc( triangle, tri, contained, depth ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n\nexport { intersectClosestTri_indirect, intersectTris_indirect, iterateOverTriangles_indirect };\n","import { intersectsNodeBounds } from '../utils/intersectUtils.js';\nimport { IS_LEAF, OFFSET, COUNT, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { intersectTris } from '../utils/iterationUtils.generated.js';\nimport '../utils/iterationUtils_indirect.generated.js';\n\n/*****************************************************/\n/ This file is generated from \"raycast.template.js\". /\n/****************************************************/\n\nfunction raycast( bvh, root, materialOrSide, ray, intersects, near, far ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\t_raycast( 0, bvh, materialOrSide, ray, intersects, near, far );\n\tBufferStack.clearBuffer();\n\n}\n\nfunction _raycast( nodeIndex32, bvh, materialOrSide, ray, intersects, near, far ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tconst nodeIndex16 = nodeIndex32 2;\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\n\t\tintersectTris( bvh, materialOrSide, ray, offset, count, intersects, near, far );\n\n\n\t} else {\n\n\t\tconst leftIndex = LEFT_NODE( nodeIndex32 );\n\t\tif ( intersectsNodeBounds( leftIndex, float32Array, ray, near, far ) ) {\n\n\t\t\t_raycast( leftIndex, bvh, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t\tconst rightIndex = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\tif ( intersectsNodeBounds( rightIndex, float32Array, ray, near, far ) ) {\n\n\t\t\t_raycast( rightIndex, bvh, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t}\n\n}\n\nexport { raycast };\n","import { IS_LEAF, OFFSET, COUNT, SPLIT_AXIS, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { intersectsNodeBounds } from '../utils/intersectUtils.js';\nimport { intersectClosestTri } from '../utils/iterationUtils.generated.js';\nimport '../utils/iterationUtils_indirect.generated.js';\n\n/**********************************************************/\n/ This file is generated from \"raycastFirst.template.js\". /\n/*********************************************************/\n\nconst _xyzFields = [ 'x', 'y', 'z' ];\n\nfunction raycastFirst( bvh, root, materialOrSide, ray, near, far ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _raycastFirst( 0, bvh, materialOrSide, ray, near, far );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _raycastFirst( nodeIndex32, bvh, materialOrSide, ray, near, far ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\n\t\t// eslint-disable-next-line no-unreachable\n\t\treturn intersectClosestTri( bvh, materialOrSide, ray, offset, count, near, far );\n\n\n\t} else {\n\n\t\t// consider the position of the split plane with respect to the oncoming ray; whichever direction\n\t\t// the ray is coming from, look for an intersection among that side of the tree first\n\t\tconst splitAxis = SPLIT_AXIS( nodeIndex32, uint32Array );\n\t\tconst xyzAxis = _xyzFields[ splitAxis ];\n\t\tconst rayDir = ray.direction[ xyzAxis ];\n\t\tconst leftToRight = rayDir >= 0;\n\n\t\t// c1 is the child to check first\n\t\tlet c1, c2;\n\t\tif ( leftToRight ) {\n\n\t\t\tc1 = LEFT_NODE( nodeIndex32 );\n\t\t\tc2 = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t} else {\n\n\t\t\tc1 = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\t\tc2 = LEFT_NODE( nodeIndex32 );\n\n\t\t}\n\n\t\tconst c1Intersection = intersectsNodeBounds( c1, float32Array, ray, near, far );\n\t\tconst c1Result = c1Intersection ? _raycastFirst( c1, bvh, materialOrSide, ray, near, far ) : null;\n\n\t\t// if we got an intersection in the first node and it's closer than the second node's bounding\n\t\t// box, we don't need to consider the second node because it couldn't possibly be a better result\n\t\tif ( c1Result ) {\n\n\t\t\t// check if the point is within the second bounds\n\t\t\t// \"point\" is in the local frame of the bvh\n\t\t\tconst point = c1Result.point[ xyzAxis ];\n\t\t\tconst isOutside = leftToRight ?\n\t\t\t\tpoint <= float32Array[ c2 + splitAxis ] : // min bounding data\n\t\t\t\tpoint >= float32Array[ c2 + splitAxis + 3 ]; // max bounding data\n\n\t\t\tif ( isOutside ) {\n\n\t\t\t\treturn c1Result;\n\n\t\t\t}\n\n\t\t}\n\n\t\t// either there was no intersection in the first node, or there could still be a closer\n\t\t// intersection in the second, so check the second node and then take the better of the two\n\t\tconst c2Intersection = intersectsNodeBounds( c2, float32Array, ray, near, far );\n\t\tconst c2Result = c2Intersection ? _raycastFirst( c2, bvh, materialOrSide, ray, near, far ) : null;\n\n\t\tif ( c1Result && c2Result ) {\n\n\t\t\treturn c1Result.distance <= c2Result.distance ? c1Result : c2Result;\n\n\t\t} else {\n\n\t\t\treturn c1Result \|\| c2Result \|\| null;\n\n\t\t}\n\n\t}\n\n}\n\nexport { raycastFirst };\n","import { Box3, Matrix4 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { ExtendedTriangle } from '../../math/ExtendedTriangle.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { IS_LEAF, OFFSET, COUNT, BOUNDING_DATA_INDEX, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { getTriCount } from '../build/geometryUtils.js';\n\n/****************************************************************/\n/ This file is generated from \"intersectsGeometry.template.js\". /\n/***************************************************************/\n/ eslint-disable indent /\n\nconst boundingBox = / @__PURE__ / new Box3();\nconst triangle = / @__PURE__ / new ExtendedTriangle();\nconst triangle2 = / @__PURE__ / new ExtendedTriangle();\nconst invertedMat = / @__PURE__ / new Matrix4();\n\nconst obb = / @__PURE__ / new OrientedBox();\nconst obb2 = / @__PURE__ / new OrientedBox();\n\nfunction intersectsGeometry( bvh, root, otherGeometry, geometryToBvh ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _intersectsGeometry( 0, bvh, otherGeometry, geometryToBvh );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _intersectsGeometry( nodeIndex32, bvh, otherGeometry, geometryToBvh, cachedObb = null ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tif ( cachedObb === null ) {\n\n\t\tif ( ! otherGeometry.boundingBox ) {\n\n\t\t\totherGeometry.computeBoundingBox();\n\n\t\t}\n\n\t\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\t\tcachedObb = obb;\n\n\t}\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst thisGeometry = bvh.geometry;\n\t\tconst thisIndex = thisGeometry.index;\n\t\tconst thisPos = thisGeometry.attributes.position;\n\n\t\tconst otherIndex = otherGeometry.index;\n\t\tconst otherPos = otherGeometry.attributes.position;\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t// get the inverse of the geometry matrix so we can transform our triangles into the\n\t\t// geometry space we're trying to test. We assume there are fewer triangles being checked\n\t\t// here.\n\t\tinvertedMat.copy( geometryToBvh ).invert();\n\n\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t// if there's a bounds tree\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( nodeIndex32 ), float32Array, obb2 );\n\t\t\tobb2.matrix.copy( invertedMat );\n\t\t\tobb2.needsUpdate = true;\n\n\t\t\t// TODO: use a triangle iteration function here\n\t\t\tconst res = otherGeometry.boundsTree.shapecast( {\n\n\t\t\t\tintersectsBounds: box => obb2.intersectsBox( box ),\n\n\t\t\t\tintersectsTriangle: tri => {\n\n\t\t\t\t\ttri.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.needsUpdate = true;\n\n\n\t\t\t\t\tfor ( let i = offset * 3, l = ( count + offset ) * 3; i < l; i += 3 ) {\n\n\t\t\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\t\t\tsetTriangle( triangle2, i, thisIndex, thisPos );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\t\t\t\t\t\tif ( tri.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t\treturn res;\n\n\t\t} else {\n\n\t\t\t// if we're just dealing with raw geometry\n\t\t\tconst otherTriangleCount = getTriCount( otherGeometry );\n\n\n\t\t\tfor ( let i = offset * 3, l = ( count + offset ) * 3; i < l; i += 3 ) {\n\n\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\tsetTriangle( triangle, i, thisIndex, thisPos );\n\n\n\t\t\t\ttriangle.a.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.b.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.c.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\tfor ( let i2 = 0, l2 = otherTriangleCount * 3; i2 < l2; i2 += 3 ) {\n\n\t\t\t\t\tsetTriangle( triangle2, i2, otherIndex, otherPos );\n\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\tif ( triangle.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\n\t\t\t}\n\n\n\t\t}\n\n\t} else {\n\n\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( left ), float32Array, boundingBox );\n\t\tconst leftIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( left, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( leftIntersection ) return true;\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( right ), float32Array, boundingBox );\n\t\tconst rightIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( right, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( rightIntersection ) return true;\n\n\t\treturn false;\n\n\t}\n\n}\n\nexport { intersectsGeometry };\n","import { Matrix4, Vector3 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { getTriCount } from '../build/geometryUtils.js';\nimport { ExtendedTrianglePool } from '../../utils/ExtendedTrianglePool.js';\n\n/********************************************************************/\n/ This file is generated from \"closestPointToGeometry.template.js\". /\n/*******************************************************************/\n\nconst tempMatrix = / @__PURE__ / new Matrix4();\nconst obb = / @__PURE__ / new OrientedBox();\nconst obb2 = / @__PURE__ / new OrientedBox();\nconst temp1 = / @__PURE__ / new Vector3();\nconst temp2 = / @__PURE__ / new Vector3();\nconst temp3 = / @__PURE__ / new Vector3();\nconst temp4 = / @__PURE__ / new Vector3();\n\nfunction closestPointToGeometry(\n\tbvh,\n\totherGeometry,\n\tgeometryToBvh,\n\ttarget1 = { },\n\ttarget2 = { },\n\tminThreshold = 0,\n\tmaxThreshold = Infinity,\n) {\n\n\tif ( ! otherGeometry.boundingBox ) {\n\n\t\totherGeometry.computeBoundingBox();\n\n\t}\n\n\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\tobb.needsUpdate = true;\n\n\tconst geometry = bvh.geometry;\n\tconst pos = geometry.attributes.position;\n\tconst index = geometry.index;\n\tconst otherPos = otherGeometry.attributes.position;\n\tconst otherIndex = otherGeometry.index;\n\tconst triangle = ExtendedTrianglePool.getPrimitive();\n\tconst triangle2 = ExtendedTrianglePool.getPrimitive();\n\n\tlet tempTarget1 = temp1;\n\tlet tempTargetDest1 = temp2;\n\tlet tempTarget2 = null;\n\tlet tempTargetDest2 = null;\n\n\tif ( target2 ) {\n\n\t\ttempTarget2 = temp3;\n\t\ttempTargetDest2 = temp4;\n\n\t}\n\n\tlet closestDistance = Infinity;\n\tlet closestDistanceTriIndex = null;\n\tlet closestDistanceOtherTriIndex = null;\n\ttempMatrix.copy( geometryToBvh ).invert();\n\tobb2.matrix.copy( tempMatrix );\n\tbvh.shapecast(\n\t\t{\n\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn obb.distanceToBox( box );\n\n\t\t\t},\n\n\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\tif ( score < closestDistance && score < maxThreshold ) {\n\n\t\t\t\t\t// if we know the triangles of this bounds will be intersected next then\n\t\t\t\t\t// save the bounds to use during triangle checks.\n\t\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\t\tobb2.min.copy( box.min );\n\t\t\t\t\t\tobb2.max.copy( box.max );\n\t\t\t\t\t\tobb2.needsUpdate = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\t},\n\n\t\t\tintersectsRange: ( offset, count ) => {\n\n\t\t\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t\t\t// if the other geometry has a bvh then use the accelerated path where we use shapecast to find\n\t\t\t\t\t// the closest bounds in the other geometry to check.\n\t\t\t\t\tconst otherBvh = otherGeometry.boundsTree;\n\t\t\t\t\treturn otherBvh.shapecast( {\n\t\t\t\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\t\t\t\treturn obb2.distanceToBox( box );\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\t\t\t\treturn score < closestDistance && score < maxThreshold;\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsRange: ( otherOffset, otherCount ) => {\n\n\t\t\t\t\t\t\tfor ( let i2 = otherOffset, l2 = otherOffset + otherCount; i2 < l2; i2 ++ ) {\n\n\n\t\t\t\t\t\t\t\tsetTriangle( triangle2, 3 i2, otherIndex, otherPos );\n\n\t\t\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\n\t\t\t\t\t\t\t\t\tsetTriangle( triangle, 3 * i, index, pos );\n\n\t\t\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t},\n\t\t\t\t\t} );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// If no bounds tree then we'll just check every triangle.\n\t\t\t\t\tconst triCount = getTriCount( otherGeometry );\n\t\t\t\t\tfor ( let i2 = 0, l2 = triCount; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\t\tsetTriangle( triangle2, 3 * i2, otherIndex, otherPos );\n\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\n\t\t\t\t\t\t\tsetTriangle( triangle, 3 * i, index, pos );\n\n\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t},\n\n\t\t}\n\n\t);\n\n\tExtendedTrianglePool.releasePrimitive( triangle );\n\tExtendedTrianglePool.releasePrimitive( triangle2 );\n\n\tif ( closestDistance === Infinity ) {\n\n\t\treturn null;\n\n\t}\n\n\tif ( ! target1.point ) {\n\n\t\ttarget1.point = tempTargetDest1.clone();\n\n\t} else {\n\n\t\ttarget1.point.copy( tempTargetDest1 );\n\n\t}\n\n\ttarget1.distance = closestDistance,\n\ttarget1.faceIndex = closestDistanceTriIndex;\n\n\tif ( target2 ) {\n\n\t\tif ( ! target2.point ) target2.point = tempTargetDest2.clone();\n\t\telse target2.point.copy( tempTargetDest2 );\n\t\ttarget2.point.applyMatrix4( tempMatrix );\n\t\ttempTargetDest1.applyMatrix4( tempMatrix );\n\t\ttarget2.distance = tempTargetDest1.sub( target2.point ).length();\n\t\ttarget2.faceIndex = closestDistanceOtherTriIndex;\n\n\t}\n\n\treturn target1;\n\n}\n\nexport { closestPointToGeometry };\n","import { UINT32_PER_NODE, BYTES_PER_NODE } from '../Constants.js';\nimport { IS_LEAF, OFFSET, COUNT, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\n\n/***************************************************/\n/ This file is generated from \"refit.template.js\". /\n/**************************************************/\n\nfunction refit_indirect( bvh, nodeIndices = null ) {\n\n\tif ( nodeIndices && Array.isArray( nodeIndices ) ) {\n\n\t\tnodeIndices = new Set( nodeIndices );\n\n\t}\n\n\tconst geometry = bvh.geometry;\n\tconst indexArr = geometry.index ? geometry.index.array : null;\n\tconst posAttr = geometry.attributes.position;\n\n\tlet buffer, uint32Array, uint16Array, float32Array;\n\tlet byteOffset = 0;\n\tconst roots = bvh._roots;\n\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\tbuffer = roots[ i ];\n\t\tuint32Array = new Uint32Array( buffer );\n\t\tuint16Array = new Uint16Array( buffer );\n\t\tfloat32Array = new Float32Array( buffer );\n\n\t\t_traverse( 0, byteOffset );\n\t\tbyteOffset += buffer.byteLength;\n\n\t}\n\n\tfunction _traverse( nodeIndex32, byteOffset, force = false ) {\n\n\t\tconst nodeIndex16 = nodeIndex32 2;\n\t\tif ( IS_LEAF( nodeIndex16, uint16Array ) ) {\n\n\t\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t\tlet minx = Infinity;\n\t\t\tlet miny = Infinity;\n\t\t\tlet minz = Infinity;\n\t\t\tlet maxx = - Infinity;\n\t\t\tlet maxy = - Infinity;\n\t\t\tlet maxz = - Infinity;\n\n\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\t\tconst t = 3 * bvh.resolveTriangleIndex( i );\n\t\t\t\tfor ( let j = 0; j < 3; j ++ ) {\n\n\t\t\t\t\tlet index = t + j;\n\t\t\t\t\tindex = indexArr ? indexArr[ index ] : index;\n\n\t\t\t\t\tconst x = posAttr.getX( index );\n\t\t\t\t\tconst y = posAttr.getY( index );\n\t\t\t\t\tconst z = posAttr.getZ( index );\n\n\t\t\t\t\tif ( x < minx ) minx = x;\n\t\t\t\t\tif ( x > maxx ) maxx = x;\n\n\t\t\t\t\tif ( y < miny ) miny = y;\n\t\t\t\t\tif ( y > maxy ) maxy = y;\n\n\t\t\t\t\tif ( z < minz ) minz = z;\n\t\t\t\t\tif ( z > maxz ) maxz = z;\n\n\n\t\t\t\t}\n\n\t\t\t}\n\n\n\t\t\tif (\n\t\t\t\tfloat32Array[ nodeIndex32 + 0 ] !== minx \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 1 ] !== miny \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 2 ] !== minz \|\|\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 3 ] !== maxx \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 4 ] !== maxy \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 5 ] !== maxz\n\t\t\t) {\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 0 ] = minx;\n\t\t\t\tfloat32Array[ nodeIndex32 + 1 ] = miny;\n\t\t\t\tfloat32Array[ nodeIndex32 + 2 ] = minz;\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 3 ] = maxx;\n\t\t\t\tfloat32Array[ nodeIndex32 + 4 ] = maxy;\n\t\t\t\tfloat32Array[ nodeIndex32 + 5 ] = maxz;\n\n\t\t\t\treturn true;\n\n\t\t\t} else {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t\t// the identifying node indices provided by the shapecast function include offsets of all\n\t\t\t// root buffers to guarantee they're unique between roots so offset left and right indices here.\n\t\t\tlet forceChildren = force;\n\t\t\tlet includesLeft = false;\n\t\t\tlet includesRight = false;\n\n\t\t\tif ( nodeIndices ) {\n\n\t\t\t\t// if we see that neither the left or right child are included in the set that need to be updated\n\t\t\t\t// then we assume that all children need to be updated.\n\t\t\t\tif ( ! forceChildren ) {\n\n\t\t\t\t\tconst leftNodeId = left / UINT32_PER_NODE + byteOffset / BYTES_PER_NODE;\n\t\t\t\t\tconst rightNodeId = right / UINT32_PER_NODE + byteOffset / BYTES_PER_NODE;\n\t\t\t\t\tincludesLeft = nodeIndices.has( leftNodeId );\n\t\t\t\t\tincludesRight = nodeIndices.has( rightNodeId );\n\t\t\t\t\tforceChildren = ! includesLeft && ! includesRight;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tincludesLeft = true;\n\t\t\t\tincludesRight = true;\n\n\t\t\t}\n\n\t\t\tconst traverseLeft = forceChildren \|\| includesLeft;\n\t\t\tconst traverseRight = forceChildren \|\| includesRight;\n\n\t\t\tlet leftChange = false;\n\t\t\tif ( traverseLeft ) {\n\n\t\t\t\tleftChange = _traverse( left, byteOffset, forceChildren );\n\n\t\t\t}\n\n\t\t\tlet rightChange = false;\n\t\t\tif ( traverseRight ) {\n\n\t\t\t\trightChange = _traverse( right, byteOffset, forceChildren );\n\n\t\t\t}\n\n\t\t\tconst didChange = leftChange \|\| rightChange;\n\t\t\tif ( didChange ) {\n\n\t\t\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\t\t\tconst left_i = left + i;\n\t\t\t\t\tconst right_i = right + i;\n\t\t\t\t\tconst minLeftValue = float32Array[ left_i ];\n\t\t\t\t\tconst maxLeftValue = float32Array[ left_i + 3 ];\n\t\t\t\t\tconst minRightValue = float32Array[ right_i ];\n\t\t\t\t\tconst maxRightValue = float32Array[ right_i + 3 ];\n\n\t\t\t\t\tfloat32Array[ nodeIndex32 + i ] = minLeftValue < minRightValue ? minLeftValue : minRightValue;\n\t\t\t\t\tfloat32Array[ nodeIndex32 + i + 3 ] = maxLeftValue > maxRightValue ? maxLeftValue : maxRightValue;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn didChange;\n\n\t\t}\n\n\t}\n\n}\n\nexport { refit_indirect };\n","import { intersectsNodeBounds } from '../utils/intersectUtils.js';\nimport { IS_LEAF, OFFSET, COUNT, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport '../utils/iterationUtils.generated.js';\nimport { intersectTris_indirect } from '../utils/iterationUtils_indirect.generated.js';\n\n/*****************************************************/\n/ This file is generated from \"raycast.template.js\". /\n/****************************************************/\n\nfunction raycast_indirect( bvh, root, materialOrSide, ray, intersects, near, far ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\t_raycast( 0, bvh, materialOrSide, ray, intersects, near, far );\n\tBufferStack.clearBuffer();\n\n}\n\nfunction _raycast( nodeIndex32, bvh, materialOrSide, ray, intersects, near, far ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tconst nodeIndex16 = nodeIndex32 2;\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\tintersectTris_indirect( bvh, materialOrSide, ray, offset, count, intersects, near, far );\n\n\n\t} else {\n\n\t\tconst leftIndex = LEFT_NODE( nodeIndex32 );\n\t\tif ( intersectsNodeBounds( leftIndex, float32Array, ray, near, far ) ) {\n\n\t\t\t_raycast( leftIndex, bvh, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t\tconst rightIndex = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\tif ( intersectsNodeBounds( rightIndex, float32Array, ray, near, far ) ) {\n\n\t\t\t_raycast( rightIndex, bvh, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t}\n\n}\n\nexport { raycast_indirect };\n","import { IS_LEAF, OFFSET, COUNT, SPLIT_AXIS, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { intersectsNodeBounds } from '../utils/intersectUtils.js';\nimport '../utils/iterationUtils.generated.js';\nimport { intersectClosestTri_indirect } from '../utils/iterationUtils_indirect.generated.js';\n\n/**********************************************************/\n/ This file is generated from \"raycastFirst.template.js\". /\n/*********************************************************/\n\nconst _xyzFields = [ 'x', 'y', 'z' ];\n\nfunction raycastFirst_indirect( bvh, root, materialOrSide, ray, near, far ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _raycastFirst( 0, bvh, materialOrSide, ray, near, far );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _raycastFirst( nodeIndex32, bvh, materialOrSide, ray, near, far ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\treturn intersectClosestTri_indirect( bvh, materialOrSide, ray, offset, count, near, far );\n\n\n\t} else {\n\n\t\t// consider the position of the split plane with respect to the oncoming ray; whichever direction\n\t\t// the ray is coming from, look for an intersection among that side of the tree first\n\t\tconst splitAxis = SPLIT_AXIS( nodeIndex32, uint32Array );\n\t\tconst xyzAxis = _xyzFields[ splitAxis ];\n\t\tconst rayDir = ray.direction[ xyzAxis ];\n\t\tconst leftToRight = rayDir >= 0;\n\n\t\t// c1 is the child to check first\n\t\tlet c1, c2;\n\t\tif ( leftToRight ) {\n\n\t\t\tc1 = LEFT_NODE( nodeIndex32 );\n\t\t\tc2 = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t} else {\n\n\t\t\tc1 = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\t\tc2 = LEFT_NODE( nodeIndex32 );\n\n\t\t}\n\n\t\tconst c1Intersection = intersectsNodeBounds( c1, float32Array, ray, near, far );\n\t\tconst c1Result = c1Intersection ? _raycastFirst( c1, bvh, materialOrSide, ray, near, far ) : null;\n\n\t\t// if we got an intersection in the first node and it's closer than the second node's bounding\n\t\t// box, we don't need to consider the second node because it couldn't possibly be a better result\n\t\tif ( c1Result ) {\n\n\t\t\t// check if the point is within the second bounds\n\t\t\t// \"point\" is in the local frame of the bvh\n\t\t\tconst point = c1Result.point[ xyzAxis ];\n\t\t\tconst isOutside = leftToRight ?\n\t\t\t\tpoint <= float32Array[ c2 + splitAxis ] : // min bounding data\n\t\t\t\tpoint >= float32Array[ c2 + splitAxis + 3 ]; // max bounding data\n\n\t\t\tif ( isOutside ) {\n\n\t\t\t\treturn c1Result;\n\n\t\t\t}\n\n\t\t}\n\n\t\t// either there was no intersection in the first node, or there could still be a closer\n\t\t// intersection in the second, so check the second node and then take the better of the two\n\t\tconst c2Intersection = intersectsNodeBounds( c2, float32Array, ray, near, far );\n\t\tconst c2Result = c2Intersection ? _raycastFirst( c2, bvh, materialOrSide, ray, near, far ) : null;\n\n\t\tif ( c1Result && c2Result ) {\n\n\t\t\treturn c1Result.distance <= c2Result.distance ? c1Result : c2Result;\n\n\t\t} else {\n\n\t\t\treturn c1Result \|\| c2Result \|\| null;\n\n\t\t}\n\n\t}\n\n}\n\nexport { raycastFirst_indirect };\n","import { Box3, Matrix4 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { ExtendedTriangle } from '../../math/ExtendedTriangle.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { IS_LEAF, OFFSET, COUNT, BOUNDING_DATA_INDEX, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { getTriCount } from '../build/geometryUtils.js';\n\n/****************************************************************/\n/ This file is generated from \"intersectsGeometry.template.js\". /\n/***************************************************************/\n/ eslint-disable indent /\n\nconst boundingBox = / @__PURE__ / new Box3();\nconst triangle = / @__PURE__ / new ExtendedTriangle();\nconst triangle2 = / @__PURE__ / new ExtendedTriangle();\nconst invertedMat = / @__PURE__ / new Matrix4();\n\nconst obb = / @__PURE__ / new OrientedBox();\nconst obb2 = / @__PURE__ / new OrientedBox();\n\nfunction intersectsGeometry_indirect( bvh, root, otherGeometry, geometryToBvh ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _intersectsGeometry( 0, bvh, otherGeometry, geometryToBvh );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _intersectsGeometry( nodeIndex32, bvh, otherGeometry, geometryToBvh, cachedObb = null ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tif ( cachedObb === null ) {\n\n\t\tif ( ! otherGeometry.boundingBox ) {\n\n\t\t\totherGeometry.computeBoundingBox();\n\n\t\t}\n\n\t\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\t\tcachedObb = obb;\n\n\t}\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst thisGeometry = bvh.geometry;\n\t\tconst thisIndex = thisGeometry.index;\n\t\tconst thisPos = thisGeometry.attributes.position;\n\n\t\tconst otherIndex = otherGeometry.index;\n\t\tconst otherPos = otherGeometry.attributes.position;\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t// get the inverse of the geometry matrix so we can transform our triangles into the\n\t\t// geometry space we're trying to test. We assume there are fewer triangles being checked\n\t\t// here.\n\t\tinvertedMat.copy( geometryToBvh ).invert();\n\n\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t// if there's a bounds tree\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( nodeIndex32 ), float32Array, obb2 );\n\t\t\tobb2.matrix.copy( invertedMat );\n\t\t\tobb2.needsUpdate = true;\n\n\t\t\t// TODO: use a triangle iteration function here\n\t\t\tconst res = otherGeometry.boundsTree.shapecast( {\n\n\t\t\t\tintersectsBounds: box => obb2.intersectsBox( box ),\n\n\t\t\t\tintersectsTriangle: tri => {\n\n\t\t\t\t\ttri.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.needsUpdate = true;\n\n\t\t\t\t\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\t\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\t\t\tsetTriangle( triangle2, 3 * bvh.resolveTriangleIndex( i ), thisIndex, thisPos );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\t\t\t\t\t\tif ( tri.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t\treturn res;\n\n\t\t} else {\n\n\t\t\t// if we're just dealing with raw geometry\n\t\t\tconst otherTriangleCount = getTriCount( otherGeometry );\n\n\t\t\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\tconst ti = bvh.resolveTriangleIndex( i );\n\t\t\t\tsetTriangle( triangle, 3 * ti, thisIndex, thisPos );\n\n\n\t\t\t\ttriangle.a.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.b.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.c.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\tfor ( let i2 = 0, l2 = otherTriangleCount * 3; i2 < l2; i2 += 3 ) {\n\n\t\t\t\t\tsetTriangle( triangle2, i2, otherIndex, otherPos );\n\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\tif ( triangle.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\n\t\t}\n\n\t} else {\n\n\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( left ), float32Array, boundingBox );\n\t\tconst leftIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( left, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( leftIntersection ) return true;\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( right ), float32Array, boundingBox );\n\t\tconst rightIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( right, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( rightIntersection ) return true;\n\n\t\treturn false;\n\n\t}\n\n}\n\nexport { intersectsGeometry_indirect };\n","import { Matrix4, Vector3 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { getTriCount } from '../build/geometryUtils.js';\nimport { ExtendedTrianglePool } from '../../utils/ExtendedTrianglePool.js';\n\n/********************************************************************/\n/ This file is generated from \"closestPointToGeometry.template.js\". /\n/*******************************************************************/\n\nconst tempMatrix = / @__PURE__ / new Matrix4();\nconst obb = / @__PURE__ / new OrientedBox();\nconst obb2 = / @__PURE__ / new OrientedBox();\nconst temp1 = / @__PURE__ / new Vector3();\nconst temp2 = / @__PURE__ / new Vector3();\nconst temp3 = / @__PURE__ / new Vector3();\nconst temp4 = / @__PURE__ / new Vector3();\n\nfunction closestPointToGeometry_indirect(\n\tbvh,\n\totherGeometry,\n\tgeometryToBvh,\n\ttarget1 = { },\n\ttarget2 = { },\n\tminThreshold = 0,\n\tmaxThreshold = Infinity,\n) {\n\n\tif ( ! otherGeometry.boundingBox ) {\n\n\t\totherGeometry.computeBoundingBox();\n\n\t}\n\n\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\tobb.needsUpdate = true;\n\n\tconst geometry = bvh.geometry;\n\tconst pos = geometry.attributes.position;\n\tconst index = geometry.index;\n\tconst otherPos = otherGeometry.attributes.position;\n\tconst otherIndex = otherGeometry.index;\n\tconst triangle = ExtendedTrianglePool.getPrimitive();\n\tconst triangle2 = ExtendedTrianglePool.getPrimitive();\n\n\tlet tempTarget1 = temp1;\n\tlet tempTargetDest1 = temp2;\n\tlet tempTarget2 = null;\n\tlet tempTargetDest2 = null;\n\n\tif ( target2 ) {\n\n\t\ttempTarget2 = temp3;\n\t\ttempTargetDest2 = temp4;\n\n\t}\n\n\tlet closestDistance = Infinity;\n\tlet closestDistanceTriIndex = null;\n\tlet closestDistanceOtherTriIndex = null;\n\ttempMatrix.copy( geometryToBvh ).invert();\n\tobb2.matrix.copy( tempMatrix );\n\tbvh.shapecast(\n\t\t{\n\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn obb.distanceToBox( box );\n\n\t\t\t},\n\n\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\tif ( score < closestDistance && score < maxThreshold ) {\n\n\t\t\t\t\t// if we know the triangles of this bounds will be intersected next then\n\t\t\t\t\t// save the bounds to use during triangle checks.\n\t\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\t\tobb2.min.copy( box.min );\n\t\t\t\t\t\tobb2.max.copy( box.max );\n\t\t\t\t\t\tobb2.needsUpdate = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\t},\n\n\t\t\tintersectsRange: ( offset, count ) => {\n\n\t\t\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t\t\t// if the other geometry has a bvh then use the accelerated path where we use shapecast to find\n\t\t\t\t\t// the closest bounds in the other geometry to check.\n\t\t\t\t\tconst otherBvh = otherGeometry.boundsTree;\n\t\t\t\t\treturn otherBvh.shapecast( {\n\t\t\t\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\t\t\t\treturn obb2.distanceToBox( box );\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\t\t\t\treturn score < closestDistance && score < maxThreshold;\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsRange: ( otherOffset, otherCount ) => {\n\n\t\t\t\t\t\t\tfor ( let i2 = otherOffset, l2 = otherOffset + otherCount; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\t\t\t\tconst ti2 = otherBvh.resolveTriangleIndex( i2 );\n\t\t\t\t\t\t\t\tsetTriangle( triangle2, 3 ti2, otherIndex, otherPos );\n\n\t\t\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\t\t\t\t\t\t\tconst ti = bvh.resolveTriangleIndex( i );\n\t\t\t\t\t\t\t\t\tsetTriangle( triangle, 3 * ti, index, pos );\n\n\t\t\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t},\n\t\t\t\t\t} );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// If no bounds tree then we'll just check every triangle.\n\t\t\t\t\tconst triCount = getTriCount( otherGeometry );\n\t\t\t\t\tfor ( let i2 = 0, l2 = triCount; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\t\tsetTriangle( triangle2, 3 * i2, otherIndex, otherPos );\n\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\t\t\t\t\tconst ti = bvh.resolveTriangleIndex( i );\n\t\t\t\t\t\t\tsetTriangle( triangle, 3 * ti, index, pos );\n\n\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t},\n\n\t\t}\n\n\t);\n\n\tExtendedTrianglePool.releasePrimitive( triangle );\n\tExtendedTrianglePool.releasePrimitive( triangle2 );\n\n\tif ( closestDistance === Infinity ) {\n\n\t\treturn null;\n\n\t}\n\n\tif ( ! target1.point ) {\n\n\t\ttarget1.point = tempTargetDest1.clone();\n\n\t} else {\n\n\t\ttarget1.point.copy( tempTargetDest1 );\n\n\t}\n\n\ttarget1.distance = closestDistance,\n\ttarget1.faceIndex = closestDistanceTriIndex;\n\n\tif ( target2 ) {\n\n\t\tif ( ! target2.point ) target2.point = tempTargetDest2.clone();\n\t\telse target2.point.copy( tempTargetDest2 );\n\t\ttarget2.point.applyMatrix4( tempMatrix );\n\t\ttempTargetDest1.applyMatrix4( tempMatrix );\n\t\ttarget2.distance = tempTargetDest1.sub( target2.point ).length();\n\t\ttarget2.faceIndex = closestDistanceOtherTriIndex;\n\n\t}\n\n\treturn target1;\n\n}\n\nexport { closestPointToGeometry_indirect };\n","// converts the given BVH raycast intersection to align with the three.js raycast\n// structure (include object, world space distance and point).\nexport function convertRaycastIntersect( hit, object, raycaster ) {\n\n\tif ( hit === null ) {\n\n\t\treturn null;\n\n\t}\n\n\thit.point.applyMatrix4( object.matrixWorld );\n\thit.distance = hit.point.distanceTo( raycaster.ray.origin );\n\thit.object = object;\n\n\treturn hit;\n\n}\n","/** @import { BufferGeometry, Sphere, Box3, Intersection, Material, Object3D, Raycaster } from 'three' /\n/* @import { ExtendedTriangle } from '../math/ExtendedTriangle.js' /\n/* @import { IntersectsBoundsCallback, IntersectsRangeCallback, BoundsTraverseOrderCallback, IntersectsRangesCallback } from './BVH.js' /\nimport { BufferAttribute, FrontSide, Ray, Vector3, Matrix4 } from 'three';\nimport { SKIP_GENERATION, BYTES_PER_NODE, UINT32_PER_NODE, FLOAT32_EPSILON } from './Constants.js';\nimport { OrientedBox } from '../math/OrientedBox.js';\nimport { ExtendedTrianglePool } from '../utils/ExtendedTrianglePool.js';\nimport { closestPointToPoint } from './cast/closestPointToPoint.js';\nimport { IS_LEAF } from './utils/nodeBufferUtils.js';\n\nimport { iterateOverTriangles } from './utils/iterationUtils.generated.js';\nimport { refit } from './cast/refit.generated.js';\nimport { raycast } from './cast/raycast.generated.js';\nimport { raycastFirst } from './cast/raycastFirst.generated.js';\nimport { intersectsGeometry } from './cast/intersectsGeometry.generated.js';\nimport { closestPointToGeometry } from './cast/closestPointToGeometry.generated.js';\n\nimport { iterateOverTriangles_indirect } from './utils/iterationUtils_indirect.generated.js';\nimport { refit_indirect } from './cast/refit_indirect.generated.js';\nimport { raycast_indirect } from './cast/raycast_indirect.generated.js';\nimport { raycastFirst_indirect } from './cast/raycastFirst_indirect.generated.js';\nimport { intersectsGeometry_indirect } from './cast/intersectsGeometry_indirect.generated.js';\nimport { closestPointToGeometry_indirect } from './cast/closestPointToGeometry_indirect.generated.js';\nimport { setTriangle } from '../utils/TriangleUtilities.js';\nimport { convertRaycastIntersect } from '../utils/GeometryRayIntersectUtilities.js';\nimport { GeometryBVH } from './GeometryBVH.js';\n\nconst _obb = / @__PURE__ / new OrientedBox();\nconst _ray = / @__PURE__ / new Ray();\nconst _direction = / @__PURE__ / new Vector3();\nconst _inverseMatrix = / @__PURE__ / new Matrix4();\nconst _worldScale = / @__PURE__ / new Vector3();\nconst _getters = [ 'getX', 'getY', 'getZ' ];\n\n/\n @callback IntersectsTriangleCallback\n * @param {ExtendedTriangle} triangle - The triangle primitive in local space.\n * @param {number} triangleIndex - The index of the triangle in the geometry.\n * @param {boolean} contained - Whether the node bounds are fully contained by the query shape.\n * @param {number} depth - The depth of the node in the tree.\n * @returns {boolean} Return `true` to stop traversal.\n /\n\n/\n @callback IntersectsTrianglesCallback\n * @param {ExtendedTriangle} triangle1 - Triangle from this BVH in local space.\n * @param {ExtendedTriangle} triangle2 - Triangle from `otherBvh`, transformed into local space.\n * @param {number} triangleIndex1 - Triangle index in the first geometry.\n * @param {number} triangleIndex2 - Triangle index in the second geometry.\n * @param {number} depth1 - Depth of the node in the first BVH.\n * @param {number} nodeIndex1 - Node index in the first BVH.\n * @param {number} depth2 - Depth of the node in the second BVH.\n * @param {number} nodeIndex2 - Node index in the second BVH.\n * @returns {boolean} Return `true` to stop traversal.\n /\n\n/\n Plain-object representation of a `MeshBVH` produced by `MeshBVH.serialize` and\n * consumed by `MeshBVH.deserialize`. Suitable for transfer across WebWorker boundaries\n * or storage, with optional buffer sharing via `SharedArrayBuffer`.\n \n @typedef {Object} SerializedBVH\n * @property {Array<ArrayBuffer>} roots - BVH root node buffers.\n * @property {Int32Array\|Uint32Array\|Uint16Array\|null} index - Serialized geometry index buffer.\n * @property {Uint32Array\|Uint16Array\|null} indirectBuffer - Indirect primitive index buffer, or `null`\n * if the BVH was not built in indirect mode.\n /\n\n/\n @typedef {Object} HitPointInfo\n * @property {Vector3} point - The closest point on the mesh surface.\n * @property {number} distance - Distance from the query point to the closest point.\n * @property {number} faceIndex - Index of the triangle containing the closest point. Can be\n * passed to `getTriangleHitPointInfo` to retrieve UV, normal, and material index.\n /\n\n/\n The MeshBVH generation process modifies the geometry's index bufferAttribute in place to save\n * memory. The BVH construction will use the geometry's boundingBox if it exists or set it if it\n * does not. The BVH will no longer work correctly if the index buffer is modified.\n \n Only triangles within the geometry's draw range (or provided `range` option) are included in the\n * BVH. When a geometry has multiple groups, only triangles within the defined group ranges are\n * included. Triangles in gaps between groups are excluded.\n \n Note that all query functions expect arguments in local space of the BVH and return results in\n * local space, as well. If world space results are needed they must be transformed into world space\n * using `object.matrixWorld`.\n \n @param {BufferGeometry} geometry\n * @param {Object} [options] - Same options as {@link GeometryBVH}.\n * @extends GeometryBVH\n /\nexport class MeshBVH extends GeometryBVH {\n\n\t/\n\t Generates a representation of the complete bounds tree and the geometry index buffer which\n\t * can be used to recreate a bounds tree using the `deserialize` function. The `serialize` and\n\t * `deserialize` functions can be used to generate a MeshBVH asynchronously in a background web\n\t * worker to prevent the main thread from stuttering. The BVH roots buffer stored in the\n\t * serialized representation are the same as the ones used by the original BVH so they should\n\t * not be modified. If `SharedArrayBuffers` are used then the same BVH memory can be used for\n\t * multiple BVH in multiple WebWorkers.\n\t \n\t @static\n\t * @param {MeshBVH} bvh - The BVH to serialize.\n\t * @param {Object} [options]\n\t * @param {boolean} [options.cloneBuffers=true] - If `true`, the index and BVH root buffers\n\t * are cloned so the serialized data is independent of the live BVH.\n\t * @returns {SerializedBVH}\n\t /\n\tstatic serialize( bvh, options = {} ) {\n\n\t\toptions = {\n\t\t\tcloneBuffers: true,\n\t\t\t...options,\n\t\t};\n\n\t\tconst geometry = bvh.geometry;\n\t\tconst rootData = bvh._roots;\n\t\tconst indirectBuffer = bvh._indirectBuffer;\n\t\tconst indexAttribute = geometry.getIndex();\n\t\tconst result = {\n\t\t\tversion: 1,\n\t\t\troots: null,\n\t\t\tindex: null,\n\t\t\tindirectBuffer: null,\n\t\t};\n\t\tif ( options.cloneBuffers ) {\n\n\t\t\tresult.roots = rootData.map( root => root.slice() );\n\t\t\tresult.index = indexAttribute ? indexAttribute.array.slice() : null;\n\t\t\tresult.indirectBuffer = indirectBuffer ? indirectBuffer.slice() : null;\n\n\t\t} else {\n\n\t\t\tresult.roots = rootData;\n\t\t\tresult.index = indexAttribute ? indexAttribute.array : null;\n\t\t\tresult.indirectBuffer = indirectBuffer;\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n\t/\n\t Returns a new MeshBVH instance from the serialized data. `geometry` is the geometry used\n\t * to generate the original BVH `data` was derived from. The root buffers stored in `data`\n\t * are set directly on the new BVH so the memory is shared.\n\t \n\t @static\n\t * @param {SerializedBVH} data - Serialized BVH data.\n\t * @param {BufferGeometry} geometry - The geometry the BVH was originally built from.\n\t * @param {Object} [options]\n\t * @param {boolean} [options.setIndex=true] - If `true`, sets `geometry.index` from the\n\t * serialized index buffer (creating one if none exists).\n\t * @returns {MeshBVH}\n\t /\n\tstatic deserialize( data, geometry, options = {} ) {\n\n\t\toptions = {\n\t\t\tsetIndex: true,\n\t\t\tindirect: Boolean( data.indirectBuffer ),\n\t\t\t...options,\n\t\t};\n\n\t\tconst { index, roots, indirectBuffer } = data;\n\n\t\t// handle backwards compatibility by fixing up the buffer roots\n\t\t// see issue gkjohnson/three-mesh-bvh#759\n\t\tif ( ! data.version ) {\n\n\t\t\tconsole.warn(\n\t\t\t\t'MeshBVH.deserialize: Serialization format has been changed and will be fixed up. ' +\n\t\t\t\t'It is recommended to regenerate any stored serialized data.'\n\t\t\t);\n\t\t\tfixupVersion0( roots );\n\n\t\t}\n\n\t\tconst bvh = new MeshBVH( geometry, { ...options, [ SKIP_GENERATION ]: true } );\n\t\tbvh._roots = roots;\n\t\tbvh._indirectBuffer = indirectBuffer \|\| null;\n\n\t\tif ( options.setIndex ) {\n\n\t\t\tconst indexAttribute = geometry.getIndex();\n\t\t\tif ( indexAttribute === null ) {\n\n\t\t\t\tconst newIndex = new BufferAttribute( data.index, 1, false );\n\t\t\t\tgeometry.setIndex( newIndex );\n\n\t\t\t} else if ( indexAttribute.array !== index ) {\n\n\t\t\t\tindexAttribute.array.set( index );\n\t\t\t\tindexAttribute.needsUpdate = true;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn bvh;\n\n\t\t// convert version 0 serialized data (uint32 indices) to version 1 (node indices)\n\t\tfunction fixupVersion0( roots ) {\n\n\t\t\tfor ( let rootIndex = 0; rootIndex < roots.length; rootIndex ++ ) {\n\n\t\t\t\tconst root = roots[ rootIndex ];\n\t\t\t\tconst uint32Array = new Uint32Array( root );\n\t\t\t\tconst uint16Array = new Uint16Array( root );\n\n\t\t\t\t// iterate over nodes and convert right child offsets\n\t\t\t\tfor ( let node = 0, l = root.byteLength / BYTES_PER_NODE; node < l; node ++ ) {\n\n\t\t\t\t\tconst node32Index = UINT32_PER_NODE node;\n\t\t\t\t\tconst node16Index = 2 * node32Index;\n\t\t\t\t\tif ( ! IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\t\t\t// convert absolute right child offset to relative offset\n\t\t\t\t\t\tuint32Array[ node32Index + 6 ] = uint32Array[ node32Index + 6 ] / UINT32_PER_NODE - node;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tget primitiveStride() {\n\n\t\treturn 3;\n\n\t}\n\n\t/*\n\t Helper function for use when `indirect` is set to true. This function takes a triangle\n\t * index in the BVH layout and returns the associated triangle index in the geometry index\n\t * buffer or position attribute.\n\t * @type {function(number): number}\n\t * @readonly\n\t /\n\tget resolveTriangleIndex() {\n\n\t\treturn this.resolvePrimitiveIndex;\n\n\t}\n\n\tconstructor( geometry, options = {} ) {\n\n\t\tif ( options.maxLeafTris ) {\n\n\t\t\tconsole.warn( 'MeshBVH: \"maxLeafTris\" option has been deprecated. Use \"targetLeafSize\", instead.' );\n\t\t\toptions = {\n\t\t\t\t...options,\n\t\t\t\ttargetLeafSize: options.maxLeafTris,\n\t\t\t};\n\n\t\t}\n\n\t\tsuper( geometry, options );\n\n\t}\n\n\t/\n\t Adjusts all triangle offsets stored in the BVH by the given offset. This is useful when the\n\t * triangle data has been compacted or shifted in the geometry buffers (e.g. in `BatchedMesh`\n\t * when geometries are compacted using the 'optimize' function or constructing a 'merged' BVH).\n\t * This function only adjusts the BVH to point to different triangles in the geometry. The\n\t * geometry's index buffer and/or position attributes must be updated separately to match.\n\t \n\t @param {number} offset\n\t * @returns {void}\n\t /\n\t// implement abstract methods from BVH base class\n\tshiftTriangleOffsets( offset ) {\n\n\t\treturn super.shiftPrimitiveOffsets( offset );\n\n\t}\n\n\t// write primitive bounds to the buffer - used only for validateBounds at the moment\n\twritePrimitiveBounds( i, targetBuffer, baseIndex ) {\n\n\t\tconst geometry = this.geometry;\n\t\tconst indirectBuffer = this._indirectBuffer;\n\t\tconst posAttr = geometry.attributes.position;\n\t\tconst index = geometry.index ? geometry.index.array : null;\n\n\t\tconst tri = indirectBuffer ? indirectBuffer[ i ] : i;\n\t\tconst tri3 = tri 3;\n\n\t\tlet ai = tri3 + 0;\n\t\tlet bi = tri3 + 1;\n\t\tlet ci = tri3 + 2;\n\n\t\tif ( index ) {\n\n\t\t\tai = index[ ai ];\n\t\t\tbi = index[ bi ];\n\t\t\tci = index[ ci ];\n\n\t\t}\n\n\t\tfor ( let el = 0; el < 3; el ++ ) {\n\n\t\t\tconst a = posAttr[ _getters[ el ] ]( ai );\n\t\t\tconst b = posAttr[ _getters[ el ] ]( bi );\n\t\t\tconst c = posAttr[ _getters[ el ] ]( ci );\n\n\t\t\tlet min = a;\n\t\t\tif ( b < min ) min = b;\n\t\t\tif ( c < min ) min = c;\n\n\t\t\tlet max = a;\n\t\t\tif ( b > max ) max = b;\n\t\t\tif ( c > max ) max = c;\n\n\t\t\t// Write in min/max format [minx, miny, minz, maxx, maxy, maxz]\n\t\t\ttargetBuffer[ baseIndex + el ] = min;\n\t\t\ttargetBuffer[ baseIndex + el + 3 ] = max;\n\n\t\t}\n\n\t\treturn targetBuffer;\n\n\t}\n\n\t// precomputes the bounding box for each triangle; required for quickly calculating tree splits.\n\t// result is an array of size count * 6 where triangle i maps to a\n\t// [x_center, x_delta, y_center, y_delta, z_center, z_delta] tuple starting at index (i - offset) * 6,\n\t// representing the center and half-extent in each dimension of triangle i\n\tcomputePrimitiveBounds( offset, count, targetBuffer ) {\n\n\t\tconst geometry = this.geometry;\n\t\tconst indirectBuffer = this._indirectBuffer;\n\t\tconst posAttr = geometry.attributes.position;\n\t\tconst index = geometry.index ? geometry.index.array : null;\n\t\tconst normalized = posAttr.normalized;\n\n\t\tif ( offset < 0 \|\| count + offset - targetBuffer.offset > targetBuffer.length / 6 ) {\n\n\t\t\tthrow new Error( 'MeshBVH: compute triangle bounds range is invalid.' );\n\n\t\t}\n\n\t\t// used for non-normalized positions\n\t\tconst posArr = posAttr.array;\n\n\t\t// support for an interleaved position buffer\n\t\tconst bufferOffset = posAttr.offset \|\| 0;\n\t\tlet stride = 3;\n\t\tif ( posAttr.isInterleavedBufferAttribute ) {\n\n\t\t\tstride = posAttr.data.stride;\n\n\t\t}\n\n\t\t// used for normalized positions\n\t\tconst getters = [ 'getX', 'getY', 'getZ' ];\n\t\tconst writeOffset = targetBuffer.offset;\n\n\t\t// iterate over the triangle range\n\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\tconst tri = indirectBuffer ? indirectBuffer[ i ] : i;\n\t\t\tconst tri3 = tri * 3;\n\t\t\tconst boundsIndexOffset = ( i - writeOffset ) * 6;\n\n\t\t\tlet ai = tri3 + 0;\n\t\t\tlet bi = tri3 + 1;\n\t\t\tlet ci = tri3 + 2;\n\n\t\t\tif ( index ) {\n\n\t\t\t\tai = index[ ai ];\n\t\t\t\tbi = index[ bi ];\n\t\t\t\tci = index[ ci ];\n\n\t\t\t}\n\n\t\t\t// we add the stride and offset here since we access the array directly\n\t\t\t// below for the sake of performance\n\t\t\tif ( ! normalized ) {\n\n\t\t\t\tai = ai * stride + bufferOffset;\n\t\t\t\tbi = bi * stride + bufferOffset;\n\t\t\t\tci = ci * stride + bufferOffset;\n\n\t\t\t}\n\n\t\t\tfor ( let el = 0; el < 3; el ++ ) {\n\n\t\t\t\tlet a, b, c;\n\n\t\t\t\tif ( normalized ) {\n\n\t\t\t\t\ta = posAttr[ getters[ el ] ]( ai );\n\t\t\t\t\tb = posAttr[ getters[ el ] ]( bi );\n\t\t\t\t\tc = posAttr[ getters[ el ] ]( ci );\n\n\t\t\t\t} else {\n\n\t\t\t\t\ta = posArr[ ai + el ];\n\t\t\t\t\tb = posArr[ bi + el ];\n\t\t\t\t\tc = posArr[ ci + el ];\n\n\t\t\t\t}\n\n\t\t\t\tlet min = a;\n\t\t\t\tif ( b < min ) min = b;\n\t\t\t\tif ( c < min ) min = c;\n\n\t\t\t\tlet max = a;\n\t\t\t\tif ( b > max ) max = b;\n\t\t\t\tif ( c > max ) max = c;\n\n\t\t\t\t// Increase the bounds size by float32 epsilon to avoid precision errors when\n\t\t\t\t// converting to 32 bit float. Scale the epsilon by the size of the numbers being\n\t\t\t\t// worked with.\n\t\t\t\tconst halfExtents = ( max - min ) / 2;\n\t\t\t\tconst el2 = el * 2;\n\t\t\t\ttargetBuffer[ boundsIndexOffset + el2 + 0 ] = min + halfExtents;\n\t\t\t\ttargetBuffer[ boundsIndexOffset + el2 + 1 ] = halfExtents + ( Math.abs( min ) + halfExtents ) * FLOAT32_EPSILON;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn targetBuffer;\n\n\t}\n\n\t/*\n\t A convenience function for performing a raycast based on a mesh. Results are formed like\n\t * three.js raycast results in world frame.\n\t \n\t @param {Object3D} object\n\t * @param {Raycaster} raycaster\n\t * @param {Array<Intersection>} [intersects=[]]\n\t * @returns {Array<Intersection>}\n\t /\n\traycastObject3D( object, raycaster, intersects = [] ) {\n\n\t\tconst { material } = object;\n\t\tif ( material === undefined ) {\n\n\t\t\treturn;\n\n\t\t}\n\n\t\t_inverseMatrix.copy( object.matrixWorld ).invert();\n\t\t_ray.copy( raycaster.ray ).applyMatrix4( _inverseMatrix );\n\n\t\t_worldScale.setFromMatrixScale( object.matrixWorld );\n\t\t_direction.copy( _ray.direction ).multiply( _worldScale );\n\n\t\tconst scaleFactor = _direction.length();\n\t\tconst near = raycaster.near / scaleFactor;\n\t\tconst far = raycaster.far / scaleFactor;\n\n\t\tif ( raycaster.firstHitOnly === true ) {\n\n\t\t\tlet hit = this.raycastFirst( _ray, material, near, far );\n\t\t\thit = convertRaycastIntersect( hit, object, raycaster );\n\t\t\tif ( hit ) {\n\n\t\t\t\tintersects.push( hit );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tconst hits = this.raycast( _ray, material, near, far );\n\t\t\tfor ( let i = 0, l = hits.length; i < l; i ++ ) {\n\n\t\t\t\tconst hit = convertRaycastIntersect( hits[ i ], object, raycaster );\n\t\t\t\tif ( hit ) {\n\n\t\t\t\t\tintersects.push( hit );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn intersects;\n\n\t}\n\n\t/\n\t Refit the node bounds to the current triangle positions. This is quicker than regenerating\n\t * a new BVH but will not be optimal after significant changes to the vertices. `nodeIndices`\n\t * is a set of node indices (provided by the `shapecast` function) that need to be refit\n\t * including all internal nodes.\n\t \n\t @param {Set<number>\|Array<number>\|null} [nodeIndices=null]\n\t /\n\trefit( nodeIndices = null ) {\n\n\t\tconst refitFunc = this.indirect ? refit_indirect : refit;\n\t\treturn refitFunc( this, nodeIndices );\n\n\t}\n\n\t/ Core Cast Functions /\n\n\t/\n\t Returns all raycast triangle hits in unsorted order. It is expected that `ray` is in the\n\t * frame of the BVH already. Likewise the returned results are also provided in the local\n\t * frame of the BVH. The `side` identifier is used to determine the side to check when\n\t * raycasting or a material with the given side field can be passed. If an array of materials\n\t * is provided then it is expected that the geometry has groups and the appropriate material\n\t * side is used per group.\n\t \n\t Note that unlike three.js' Raycaster results the points and distances in the intersections\n\t * returned from this function are relative to the local frame of the MeshBVH. When using the\n\t * `acceleratedRaycast` function as an override for `Mesh.raycast` they are transformed into\n\t * world space to be consistent with three's results.\n\t \n\t @param {Ray} ray\n\t * @param {number\|Material\|Array<Material>} [materialOrSide=FrontSide]\n\t * @param {number} [near=0]\n\t * @param {number} [far=Infinity]\n\t * @returns {Array<Intersection>}\n\t /\n\traycast( ray, materialOrSide = FrontSide, near = 0, far = Infinity ) {\n\n\t\tconst roots = this._roots;\n\t\tconst intersects = [];\n\t\tconst raycastFunc = this.indirect ? raycast_indirect : raycast;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\traycastFunc( this, i, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t\treturn intersects;\n\n\t}\n\n\t/\n\t Returns the first raycast hit in the model. This is typically much faster than returning\n\t * all hits. See `raycast` for information on the side and material options as well as the\n\t * frame of the returned intersections.\n\t \n\t @param {Ray} ray\n\t * @param {number\|Material\|Array<Material>} [materialOrSide=FrontSide]\n\t * @param {number} [near=0]\n\t * @param {number} [far=Infinity]\n\t * @returns {Intersection\|null}\n\t /\n\traycastFirst( ray, materialOrSide = FrontSide, near = 0, far = Infinity ) {\n\n\t\tconst roots = this._roots;\n\t\tlet closestResult = null;\n\n\t\tconst raycastFirstFunc = this.indirect ? raycastFirst_indirect : raycastFirst;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\tconst result = raycastFirstFunc( this, i, materialOrSide, ray, near, far );\n\t\t\tif ( result != null && ( closestResult == null \|\| result.distance < closestResult.distance ) ) {\n\n\t\t\t\tclosestResult = result;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn closestResult;\n\n\t}\n\n\t/\n\t Returns whether or not the mesh intersects the given geometry.\n\t \n\t The `geometryToBvh` parameter is the transform of the geometry in the BVH's local frame.\n\t \n\t Performance improves considerably if the provided geometry also has a `boundsTree`.\n\t \n\t @param {BufferGeometry} otherGeometry\n\t * @param {Matrix4} geometryToBvh - Transform of `otherGeometry` into the local space of\n\t * this BVH.\n\t * @returns {boolean}\n\t /\n\tintersectsGeometry( otherGeometry, geomToMesh ) {\n\n\t\tlet result = false;\n\t\tconst roots = this._roots;\n\t\tconst intersectsGeometryFunc = this.indirect ? intersectsGeometry_indirect : intersectsGeometry;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\tresult = intersectsGeometryFunc( this, i, otherGeometry, geomToMesh );\n\n\t\t\tif ( result ) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n\t/\n\t A generalized cast function that can be used to implement intersection logic for custom\n\t * shapes. This is used internally for `intersectsBox`, `intersectsSphere`, and more. The\n\t * function returns as soon as a triangle has been reported as intersected and returns `true`\n\t * if a triangle has been intersected.\n\t \n\t @param {Object} callbacks\n\t * @param {IntersectsBoundsCallback} callbacks.intersectsBounds\n\t * @param {IntersectsTriangleCallback} [callbacks.intersectsTriangle]\n\t * @param {IntersectsRangeCallback} [callbacks.intersectsRange]\n\t * @param {BoundsTraverseOrderCallback} [callbacks.boundsTraverseOrder]\n\t * @returns {boolean}\n\t /\n\tshapecast( callbacks ) {\n\n\t\tconst triangle = ExtendedTrianglePool.getPrimitive();\n\t\tconst result = super.shapecast(\n\t\t\t{\n\t\t\t\t...callbacks,\n\t\t\t\tintersectsPrimitive: callbacks.intersectsTriangle,\n\t\t\t\tscratchPrimitive: triangle,\n\n\t\t\t\t// TODO: is the performance significant enough for the added complexity here?\n\t\t\t\t// can we just use one function?\n\t\t\t\titerate: this.indirect ? iterateOverTriangles_indirect : iterateOverTriangles,\n\t\t\t}\n\t\t);\n\t\tExtendedTrianglePool.releasePrimitive( triangle );\n\n\t\treturn result;\n\n\t}\n\n\t/\n\t A generalized cast function that traverses two BVH structures simultaneously to perform\n\t * intersection tests between them. This is used internally by `intersectsGeometry`. The\n\t * function returns `true` as soon as a triangle pair has been reported as intersected by\n\t * the callbacks.\n\t \n\t `matrixToLocal` is a Matrix4 that transforms `otherBvh` into the local space of this BVH.\n\t * The other BVH's triangles are transformed by this matrix before intersection tests.\n\t \n\t @param {MeshBVH} otherBvh\n\t * @param {Matrix4} matrixToLocal - Transforms `otherBvh` into the local space of this BVH.\n\t * @param {Object} callbacks\n\t * @param {IntersectsRangesCallback} [callbacks.intersectsRanges]\n\t * @param {IntersectsTrianglesCallback} [callbacks.intersectsTriangles]\n\t * @returns {boolean}\n\t /\n\tbvhcast( otherBvh, matrixToLocal, callbacks ) {\n\n\t\tlet {\n\t\t\tintersectsRanges,\n\t\t\tintersectsTriangles,\n\t\t} = callbacks;\n\n\t\tconst triangle1 = ExtendedTrianglePool.getPrimitive();\n\t\tconst indexAttr1 = this.geometry.index;\n\t\tconst positionAttr1 = this.geometry.attributes.position;\n\t\tconst assignTriangle1 = this.indirect ?\n\t\t\ti1 => {\n\n\n\t\t\t\tconst ti = this.resolveTriangleIndex( i1 );\n\t\t\t\tsetTriangle( triangle1, ti 3, indexAttr1, positionAttr1 );\n\n\t\t\t} :\n\t\t\ti1 => {\n\n\t\t\t\tsetTriangle( triangle1, i1 * 3, indexAttr1, positionAttr1 );\n\n\t\t\t};\n\n\t\tconst triangle2 = ExtendedTrianglePool.getPrimitive();\n\t\tconst indexAttr2 = otherBvh.geometry.index;\n\t\tconst positionAttr2 = otherBvh.geometry.attributes.position;\n\t\tconst assignTriangle2 = otherBvh.indirect ?\n\t\t\ti2 => {\n\n\t\t\t\tconst ti2 = otherBvh.resolveTriangleIndex( i2 );\n\t\t\t\tsetTriangle( triangle2, ti2 * 3, indexAttr2, positionAttr2 );\n\n\t\t\t} :\n\t\t\ti2 => {\n\n\t\t\t\tsetTriangle( triangle2, i2 * 3, indexAttr2, positionAttr2 );\n\n\t\t\t};\n\n\t\t// generate triangle callback if needed\n\t\tif ( intersectsTriangles ) {\n\n\t\t\tif ( ! ( otherBvh instanceof MeshBVH ) ) {\n\n\t\t\t\tthrow new Error( 'MeshBVH: \"intersectsTriangles\" callback can only be used with another MeshBVH.' );\n\n\t\t\t}\n\n\t\t\tconst iterateOverDoubleTriangles = ( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 ) => {\n\n\t\t\t\tfor ( let i2 = offset2, l2 = offset2 + count2; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\tassignTriangle2( i2 );\n\n\t\t\t\t\ttriangle2.a.applyMatrix4( matrixToLocal );\n\t\t\t\t\ttriangle2.b.applyMatrix4( matrixToLocal );\n\t\t\t\t\ttriangle2.c.applyMatrix4( matrixToLocal );\n\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\tfor ( let i1 = offset1, l1 = offset1 + count1; i1 < l1; i1 ++ ) {\n\n\t\t\t\t\t\tassignTriangle1( i1 );\n\n\t\t\t\t\t\ttriangle1.needsUpdate = true;\n\n\t\t\t\t\t\tif ( intersectsTriangles( triangle1, triangle2, i1, i2, depth1, nodeIndex1, depth2, nodeIndex2 ) ) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\t};\n\n\t\t\tif ( intersectsRanges ) {\n\n\t\t\t\tconst originalIntersectsRanges = intersectsRanges;\n\t\t\t\tintersectsRanges = function ( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 ) {\n\n\t\t\t\t\tif ( ! originalIntersectsRanges( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 ) ) {\n\n\t\t\t\t\t\treturn iterateOverDoubleTriangles( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 );\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t};\n\n\t\t\t} else {\n\n\t\t\t\tintersectsRanges = iterateOverDoubleTriangles;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn super.bvhcast( otherBvh, matrixToLocal, { intersectsRanges } );\n\n\t}\n\n\n\t/* Derived Cast Functions /\n\n\t/\n\t Returns whether or not the mesh intersects the given box.\n\t \n\t The `boxToBvh` parameter is the transform of the box in the meshes frame.\n\t \n\t @param {Box3} box\n\t * @param {Matrix4} boxToBvh - Transform of the box in the local space of this BVH.\n\t * @returns {boolean}\n\t /\n\tintersectsBox( box, boxToMesh ) {\n\n\t\t_obb.set( box.min, box.max, boxToMesh );\n\t\t_obb.needsUpdate = true;\n\n\t\treturn this.shapecast(\n\t\t\t{\n\t\t\t\tintersectsBounds: box => _obb.intersectsBox( box ),\n\t\t\t\tintersectsTriangle: tri => _obb.intersectsTriangle( tri )\n\t\t\t}\n\t\t);\n\n\t}\n\n\t/\n\t Returns whether or not the mesh intersects the given sphere.\n\t \n\t @param {Sphere} sphere\n\t * @returns {boolean}\n\t /\n\tintersectsSphere( sphere ) {\n\n\t\treturn this.shapecast(\n\t\t\t{\n\t\t\t\tintersectsBounds: box => sphere.intersectsBox( box ),\n\t\t\t\tintersectsTriangle: tri => tri.intersectsSphere( sphere )\n\t\t\t}\n\t\t);\n\n\t}\n\n\t/\n\t Computes the closest distance from the geometry to the mesh and puts the closest point on\n\t * the mesh in `target1` (in the frame of the BVH) and the closest point on the other\n\t * geometry in `target2` (in the geometry frame). If `target1` is not provided a new Object\n\t * is created and returned from the function.\n\t \n\t The `geometryToBvh` parameter is the transform of the geometry in the BVH's local frame.\n\t \n\t If a point is found that is closer than `minThreshold` then the function will return that\n\t * result early. Any triangles or points outside of `maxThreshold` are ignored. If no point\n\t * is found within the min / max thresholds then `null` is returned and the target objects\n\t * are not modified.\n\t \n\t The returned faceIndex in `target1` and `target2` can be used with the standalone function\n\t * `getTriangleHitPointInfo` to obtain more information like UV coordinates, triangle normal\n\t * and materialIndex.\n\t \n\t _Note that this function can be very slow if `geometry` does not have a\n\t * `geometry.boundsTree` computed._\n\t \n\t @param {BufferGeometry} otherGeometry\n\t * @param {Matrix4} geometryToBvh - Transform of `otherGeometry` into the local space of\n\t * this BVH.\n\t * @param {HitPointInfo} [target1={}]\n\t * @param {HitPointInfo} [target2={}]\n\t * @param {number} [minThreshold=0]\n\t * @param {number} [maxThreshold=Infinity]\n\t * @returns {HitPointInfo\|null}\n\t /\n\tclosestPointToGeometry( otherGeometry, geometryToBvh, target1 = { }, target2 = { }, minThreshold = 0, maxThreshold = Infinity ) {\n\n\t\tconst closestPointToGeometryFunc = this.indirect ? closestPointToGeometry_indirect : closestPointToGeometry;\n\t\treturn closestPointToGeometryFunc(\n\t\t\tthis,\n\t\t\totherGeometry,\n\t\t\tgeometryToBvh,\n\t\t\ttarget1,\n\t\t\ttarget2,\n\t\t\tminThreshold,\n\t\t\tmaxThreshold,\n\t\t);\n\n\t}\n\n\t/\n\t Computes the closest distance from the point to the mesh and gives additional information\n\t * in `target`. The target can be left undefined to default to a new object which is\n\t * ultimately returned by the function.\n\t \n\t If a point is found that is closer than `minThreshold` then the function will return that\n\t * result early. Any triangles or points outside of `maxThreshold` are ignored. If no point\n\t * is found within the min / max thresholds then `null` is returned and the `target` object\n\t * is not modified.\n\t \n\t The returned faceIndex can be used with the standalone function `getTriangleHitPointInfo`\n\t * to obtain more information like UV coordinates, triangle normal and materialIndex.\n\t \n\t @param {Vector3} point\n\t * @param {HitPointInfo} [target={}]\n\t * @param {number} [minThreshold=0]\n\t * @param {number} [maxThreshold=Infinity]\n\t * @returns {HitPointInfo\|null}\n\t /\n\tclosestPointToPoint( point, target = { }, minThreshold = 0, maxThreshold = Infinity ) {\n\n\t\treturn closestPointToPoint(\n\t\t\tthis,\n\t\t\tpoint,\n\t\t\ttarget,\n\t\t\tminThreshold,\n\t\t\tmaxThreshold,\n\t\t);\n\n\t}\n\n}\n","/* @import { Object3D } from 'three' /\n/* @import { IntersectsBoundsCallback, IntersectsRangeCallback, BoundsTraverseOrderCallback } from './BVH.js' /\nimport { Box3, BufferGeometry, Matrix4, Mesh, Vector3, Ray, Sphere } from 'three';\nimport { BVH } from './BVH.js';\nimport { INTERSECTED, NOT_INTERSECTED } from './Constants.js';\n\nconst _geometry = / @__PURE__ / new BufferGeometry();\nconst _matrix = / @__PURE__ / new Matrix4();\nconst _inverseMatrix = / @__PURE__ / new Matrix4();\nconst _box = / @__PURE__ / new Box3();\nconst _sphere = / @__PURE__ / new Sphere();\nconst _vec = / @__PURE__ / new Vector3();\nconst _ray = / @__PURE__ / new Ray();\nconst _mesh = / @__PURE__ / new Mesh();\nconst _geometryRange = {};\n\n/\n @callback IntersectsObjectCallback\n * @param {Object3D} object - The scene object whose bounds were intersected.\n * @param {number} instanceId - Instance index for InstancedMesh/BatchedMesh, or 0 for regular objects.\n * @param {boolean} contained - Whether the node bounds are fully contained by the query shape.\n * @param {number} depth - The depth of the node in the tree.\n * @returns {boolean} Return `true` to stop traversal.\n /\n\n/\n BVH built from a scene hierarchy rather than a single geometry. Each leaf holds\n * one Object3D (or one instance of an InstancedMesh/BatchedMesh), enabling\n * accelerated raycasting and spatial queries across many objects at once.\n \n @param {Object3D \| Array<Object3D>} root - Root object or array of objects.\n * @param {Object} [options] - Accepts all standard BVH options plus:\n * @param {boolean} [options.precise=false] - Use vertex-level bounds instead of cached bounding boxes.\n * @param {boolean} [options.includeInstances=true] - Treat each instance of InstancedMesh/BatchedMesh as a separate primitive.\n * @extends BVH\n /\nexport class ObjectBVH extends BVH {\n\n\tconstructor( root, options = {} ) {\n\n\t\toptions = {\n\t\t\tprecise: false,\n\t\t\tincludeInstances: true,\n\t\t\tmatrixWorld: Array.isArray( root ) ? new Matrix4() : root.matrixWorld,\n\t\t\ttargetLeafSize: 1,\n\t\t\t...options,\n\t\t};\n\n\t\tsuper();\n\n\t\t// collect all the leaf node objects in the geometries\n\t\tconst objectSet = new Set();\n\t\tcollectObjects( root, objectSet );\n\n\t\t// calculate the number of bits required for the primary id, leaving the remainder\n\t\t// for the instanceId count\n\t\tconst objects = Array.from( objectSet );\n\t\tconst idBits = Math.ceil( Math.log2( objects.length ) );\n\t\tconst idMask = ( 1 << idBits ) - 1;\n\n\t\tthis.objects = objects;\n\t\tthis.idBits = idBits;\n\t\tthis.idMask = idMask;\n\t\tthis.primitiveBuffer = null;\n\t\tthis.primitiveBufferStride = 1;\n\n\t\t// settings\n\t\tthis.precise = options.precise;\n\t\tthis.includeInstances = options.includeInstances;\n\t\tthis.matrixWorld = options.matrixWorld;\n\n\t\tthis.init( options );\n\n\t}\n\n\t/\n\t Returns the `Object3D` associated with a composite id as provided to `intersectsObject`.\n\t * @param {number} compositeId\n\t * @returns {Object3D}\n\t /\n\tgetObjectFromId( compositeId ) {\n\n\t\tconst { idMask, objects } = this;\n\t\tconst id = getObjectId( compositeId, idMask );\n\t\treturn objects[ id ];\n\n\t}\n\n\t/\n\t Returns the instance index associated with a composite id as provided to `intersectsObject`.\n\t * @param {number} compositeId\n\t * @returns {number}\n\t /\n\tgetInstanceFromId( compositeId ) {\n\n\t\tconst { idMask, idBits } = this;\n\t\treturn getInstanceId( compositeId, idBits, idMask );\n\n\t}\n\n\tinit( options ) {\n\n\t\tconst { objects, idBits, matrixWorld } = this;\n\n\t\t// pre-cache the inverse matrix for use in the \"getPrimitiveBoundingBox\" function\n\t\t_inverseMatrix.copy( matrixWorld ).invert();\n\n\t\tthis.primitiveBuffer = new Uint32Array( this._countPrimitives( objects ) );\n\t\tthis._fillPrimitiveBuffer( objects, idBits, this.primitiveBuffer );\n\n\t\tsuper.init( options );\n\n\t}\n\n\trefit( ...args ) {\n\n\t\t// pre-cache the inverse matrix for use in the \"getPrimitiveBoundingBox\" function\n\t\t_inverseMatrix.copy( this.matrixWorld ).invert();\n\n\t\tsuper.refit( ...args );\n\n\t}\n\n\twritePrimitiveBounds( i, targetBuffer, writeOffset ) {\n\n\t\tconst { primitiveBuffer } = this;\n\t\tthis._getPrimitiveBoundingBox( primitiveBuffer[ i ], _inverseMatrix, _box );\n\n\t\tconst { min, max } = _box;\n\t\ttargetBuffer[ writeOffset + 0 ] = min.x;\n\t\ttargetBuffer[ writeOffset + 1 ] = min.y;\n\t\ttargetBuffer[ writeOffset + 2 ] = min.z;\n\t\ttargetBuffer[ writeOffset + 3 ] = max.x;\n\t\ttargetBuffer[ writeOffset + 4 ] = max.y;\n\t\ttargetBuffer[ writeOffset + 5 ] = max.z;\n\n\t}\n\n\tgetRootRanges() {\n\n\t\treturn [ { offset: 0, count: this.primitiveBuffer.length } ];\n\n\t}\n\n\t/\n\t Performs a spatial query against the BVH. Extends the base `shapecast` with an\n\t * `intersectsObject` callback that is called once per object primitive in leaf nodes.\n\t \n\t @param {Object} callbacks\n\t * @param {IntersectsBoundsCallback} callbacks.intersectsBounds\n\t * @param {IntersectsObjectCallback} [callbacks.intersectsObject]\n\t * @param {IntersectsRangeCallback} [callbacks.intersectsRange]\n\t * @param {BoundsTraverseOrderCallback} [callbacks.boundsTraverseOrder]\n\t * @returns {boolean}\n\t /\n\tshapecast( callbacks ) {\n\n\t\treturn super.shapecast( {\n\t\t\t...callbacks,\n\n\t\t\tintersectsPrimitive: callbacks.intersectsObject,\n\t\t\tscratchPrimitive: null,\n\t\t\titerate: iterateOverObjects,\n\t\t} );\n\n\t}\n\n\t// TODO: this is out of sync with the MeshBVH raycast signature.\n\t// Change this to \"raycastObject3D\"? Or add an equivalent?\n\traycast( raycaster, intersects = [] ) {\n\n\t\tconst { matrixWorld, includeInstances } = this;\n\t\tconst { firstHitOnly } = raycaster;\n\t\tconst localIntersects = [];\n\n\t\t// transform the ray into the local bvh frame\n\t\t_inverseMatrix.copy( matrixWorld ).invert();\n\t\t_ray.copy( raycaster.ray ).applyMatrix4( _inverseMatrix );\n\n\t\tlet closestDistance = Infinity;\n\t\tlet closestHit = null;\n\n\t\tthis.shapecast( {\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn box.distanceToPoint( _ray.origin );\n\n\t\t\t},\n\t\t\tintersectsBounds: box => {\n\n\t\t\t\tif ( firstHitOnly ) {\n\n\t\t\t\t\tif ( ! _ray.intersectBox( box, _vec ) ) {\n\n\t\t\t\t\t\treturn NOT_INTERSECTED;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tlet dist;\n\t\t\t\t\tif ( box.containsPoint( _ray.origin ) ) {\n\n\t\t\t\t\t\tdist = 0;\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\t_vec.applyMatrix4( matrixWorld );\n\t\t\t\t\t\tdist = raycaster.ray.origin.distanceTo( _vec );\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// early out if the box is further than the closest raycast\n\t\t\t\t\treturn dist < closestDistance ? INTERSECTED : NOT_INTERSECTED;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn _ray.intersectsBox( box ) ? INTERSECTED : NOT_INTERSECTED;\n\n\t\t\t\t}\n\n\t\t\t},\n\t\t\tintersectsObject( object, instanceId ) {\n\n\t\t\t\t// skip non visible objects\n\t\t\t\tif ( ! object.visible ) {\n\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\n\t\t\t\tlocalIntersects.length = 0;\n\n\t\t\t\tif ( object.isInstancedMesh && includeInstances ) {\n\n\t\t\t\t\t// raycast the instance\n\t\t\t\t\t_mesh.geometry = object.geometry;\n\t\t\t\t\t_mesh.material = object.material;\n\n\t\t\t\t\tobject.getMatrixAt( instanceId, _mesh.matrixWorld );\n\t\t\t\t\t_mesh.matrixWorld.premultiply( object.matrixWorld );\n\t\t\t\t\t_mesh.raycast( raycaster, localIntersects );\n\n\t\t\t\t\tlocalIntersects.forEach( hit => {\n\n\t\t\t\t\t\thit.object = object;\n\t\t\t\t\t\thit.instanceId = instanceId;\n\n\t\t\t\t\t} );\n\n\t\t\t\t\t_mesh.material = null;\n\n\t\t\t\t} else if ( object.isBatchedMesh && includeInstances ) {\n\n\t\t\t\t\tif ( ! object.getVisibleAt( instanceId ) ) {\n\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// extract the geometry & material\n\t\t\t\t\tconst geometryId = object.getGeometryIdAt( instanceId );\n\t\t\t\t\tconst geometryRange = object.getGeometryRangeAt( geometryId, _geometryRange );\n\n\t\t\t\t\t_geometry.index = object.geometry.index;\n\t\t\t\t\t_geometry.attributes = object.geometry.attributes;\n\t\t\t\t\t_geometry.setDrawRange( geometryRange.start, geometryRange.count );\n\n\t\t\t\t\t_mesh.geometry = _geometry;\n\t\t\t\t\t_mesh.material = object.material;\n\n\t\t\t\t\t// perform a raycast against the proxy mesh\n\t\t\t\t\tobject.getMatrixAt( instanceId, _mesh.matrixWorld );\n\t\t\t\t\t_mesh.matrixWorld.premultiply( object.matrixWorld );\n\t\t\t\t\t_mesh.raycast( raycaster, localIntersects );\n\n\t\t\t\t\t// fix up the fields\n\t\t\t\t\tlocalIntersects.forEach( hit => {\n\n\t\t\t\t\t\thit.object = object;\n\t\t\t\t\t\thit.batchId = instanceId;\n\n\t\t\t\t\t} );\n\n\t\t\t\t\t_mesh.material = null;\n\t\t\t\t\t_geometry.index = null;\n\t\t\t\t\t_geometry.attributes = null;\n\t\t\t\t\t_geometry.setDrawRange( 0, Infinity );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tobject.raycast( raycaster, localIntersects );\n\n\t\t\t\t}\n\n\t\t\t\t// find the closest hit to track\n\t\t\t\tif ( firstHitOnly ) {\n\n\t\t\t\t\tlocalIntersects.forEach( hit => {\n\n\t\t\t\t\t\tif ( hit.distance < closestDistance ) {\n\n\t\t\t\t\t\t\tclosestDistance = hit.distance;\n\t\t\t\t\t\t\tclosestHit = hit;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tintersects.push( ...localIntersects );\n\n\t\t\t\t}\n\n\t\t\t},\n\t\t} );\n\n\t\t// save the closest hit only if firstHitOnly = true\n\t\tif ( firstHitOnly && closestHit ) {\n\n\t\t\tintersects.push( closestHit );\n\n\t\t}\n\n\t\treturn intersects;\n\n\t}\n\n\t// get the bounding box of a primitive node accounting for the bvh options\n\t_getPrimitiveBoundingBox( compositeId, inverseMatrixWorld, target ) {\n\n\t\tconst { objects, idMask, idBits, precise, includeInstances } = this;\n\t\tconst id = getObjectId( compositeId, idMask );\n\t\tconst instanceId = getInstanceId( compositeId, idBits, idMask );\n\t\tconst object = objects[ id ];\n\n\t\tif ( ! includeInstances && ( object.isInstancedMesh \|\| object.isBatchedMesh ) ) {\n\n\t\t\t// if we're not using instances then just account for the overall bounds of the BatchedMesh and InstancedMesh\n\t\t\tif ( ! object.boundingBox ) {\n\n\t\t\t\tobject.computeBoundingBox();\n\n\t\t\t}\n\n\t\t\tif ( ! object.boundingSphere ) {\n\n\t\t\t\tobject.computeBoundingSphere();\n\n\t\t\t}\n\n\t\t\t_matrix\n\t\t\t\t.copy( object.matrixWorld )\n\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t_sphere\n\t\t\t\t.copy( object.boundingSphere )\n\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\ttarget\n\t\t\t\t.copy( object.boundingBox )\n\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\tshrinkToSphere( target, _sphere );\n\n\t\t} else if ( precise ) {\n\n\t\t\t// calculate precise bounds if necessary by calculating the bounds of all vertices\n\t\t\t// in the bvh frame\n\t\t\tif ( object.isInstancedMesh ) {\n\n\t\t\t\tobject\n\t\t\t\t\t.getMatrixAt( instanceId, _matrix );\n\n\t\t\t\t_matrix\n\t\t\t\t\t.premultiply( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\tgetPreciseBounds( object.geometry, _matrix, target );\n\n\t\t\t} else if ( object.isBatchedMesh ) {\n\n\t\t\t\tconst geometryId = object.getGeometryIdAt( instanceId );\n\t\t\t\tconst geometryRange = object.getGeometryRangeAt( geometryId, _geometryRange );\n\n\t\t\t\t_geometry.index = object.geometry.index;\n\t\t\t\t_geometry.attributes = object.geometry.attributes;\n\t\t\t\t_geometry.setDrawRange( geometryRange.start, geometryRange.count );\n\n\t\t\t\tobject\n\t\t\t\t\t.getMatrixAt( instanceId, _matrix );\n\n\t\t\t\t_matrix\n\t\t\t\t\t.premultiply( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\tgetPreciseBounds( _geometry, _matrix, target );\n\n\t\t\t\t_geometry.attributes = null;\n\n\t\t\t} else {\n\n\t\t\t\t_matrix\n\t\t\t\t\t.copy( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\ttarget.setFromObject( object, true ).applyMatrix4( inverseMatrixWorld );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// otherwise use the fast path of extracting the cached, AABB bounds and transforming them\n\t\t\t// into the local BVH frame\n\t\t\tif ( object.isInstancedMesh ) {\n\n\t\t\t\tif ( ! object.geometry.boundingBox ) {\n\n\t\t\t\t\tobject.geometry.computeBoundingBox();\n\n\t\t\t\t}\n\n\t\t\t\tif ( ! object.geometry.boundingSphere ) {\n\n\t\t\t\t\tobject.geometry.computeBoundingSphere();\n\n\t\t\t\t}\n\n\t\t\t\tobject\n\t\t\t\t\t.getMatrixAt( instanceId, _matrix );\n\n\t\t\t\t_matrix\n\t\t\t\t\t.premultiply( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\t_sphere\n\t\t\t\t\t.copy( object.geometry.boundingSphere )\n\t\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\t\ttarget\n\t\t\t\t\t.copy( object.geometry.boundingBox )\n\t\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\t\tshrinkToSphere( target, _sphere );\n\n\t\t\t} else if ( object.isBatchedMesh ) {\n\n\t\t\t\tconst geometryId = object.getGeometryIdAt( instanceId );\n\n\t\t\t\tobject\n\t\t\t\t\t.getMatrixAt( instanceId, _matrix );\n\n\t\t\t\t_matrix\n\t\t\t\t\t.premultiply( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\tobject\n\t\t\t\t\t.getBoundingSphereAt( geometryId, _sphere )\n\t\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\t\tobject\n\t\t\t\t\t.getBoundingBoxAt( geometryId, target )\n\t\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\t\tshrinkToSphere( target, _sphere );\n\n\t\t\t} else {\n\n\t\t\t\ttarget\n\t\t\t\t\t.setFromObject( object, false )\n\t\t\t\t\t.applyMatrix4( inverseMatrixWorld );\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\t// counts the total number of primitives required by the objects in given array of objects\n\t_countPrimitives( objects ) {\n\n\t\tconst { includeInstances } = this;\n\t\tlet total = 0;\n\t\tobjects.forEach( object => {\n\n\t\t\tif ( object.isInstancedMesh && includeInstances ) {\n\n\t\t\t\ttotal += object.count;\n\n\t\t\t} else if ( object.isBatchedMesh && includeInstances ) {\n\n\t\t\t\tif ( ! ( 'instanceCount' in object ) ) {\n\n\t\t\t\t\tthrow new Error( 'ObjectBVH: Three.js revision >= r169 is required to use BatchedMesh.' );\n\n\t\t\t\t}\n\n\t\t\t\ttotal += object.instanceCount;\n\n\t\t\t} else {\n\n\t\t\t\ttotal ++;\n\n\t\t\t}\n\n\t\t} );\n\n\t\treturn total;\n\n\t}\n\n\t_fillPrimitiveBuffer( objects, idBits, target ) {\n\n\t\tconst { includeInstances } = this;\n\t\tlet index = 0;\n\t\tobjects.forEach( ( object, i ) => {\n\n\t\t\tif ( object.isInstancedMesh && includeInstances ) {\n\n\t\t\t\tconst count = object.count;\n\t\t\t\tfor ( let c = 0; c < count; c ++ ) {\n\n\t\t\t\t\ttarget[ index ] = ( c << idBits ) \| i;\n\t\t\t\t\tindex ++;\n\n\t\t\t\t}\n\n\t\t\t} else if ( object.isBatchedMesh && includeInstances ) {\n\n\t\t\t\tconst { instanceCount, maxInstanceCount } = object;\n\t\t\t\tlet foundInstances = 0;\n\t\t\t\tlet iter = 0;\n\n\t\t\t\twhile ( foundInstances < instanceCount && iter < maxInstanceCount ) {\n\n\t\t\t\t\t// TODO: it would be better to have a consistent way of querying whether an\n\t\t\t\t\t// instance were active\n\t\t\t\t\ttry {\n\n\t\t\t\t\t\tobject.getVisibleAt( iter );\n\n\t\t\t\t\t\ttarget[ index ] = ( iter << idBits ) \| i;\n\t\t\t\t\t\tfoundInstances ++;\n\t\t\t\t\t\tindex ++;\n\n\t\t\t\t\t} catch {\n\n\t\t\t\t\t\t//\n\n\t\t\t\t\t}\n\n\t\t\t\t\titer ++;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\ttarget[ index ] = i;\n\t\t\t\tindex ++;\n\n\t\t\t}\n\n\t\t} );\n\n\t}\n\n}\n\n// id functions\n// extract the primary object id given the provided mask\nfunction getObjectId( id, idMask ) {\n\n\treturn id & idMask;\n\n}\n\n// extract the instance id given the mask and number of bits to shift\nfunction getInstanceId( id, idBits, idMask ) {\n\n\treturn ( id & ( ~ idMask ) ) >>> idBits;\n\n}\n\n// traverse the full scene and collect all leaves\nfunction collectObjects( root, objectSet = new Set() ) {\n\n\tif ( Array.isArray( root ) ) {\n\n\t\troot.forEach( object => collectObjects( object, objectSet ) );\n\n\t} else {\n\n\t\troot.traverse( child => {\n\n\t\t\tif ( child.isMesh \|\| child.isLine \|\| child.isPoints ) {\n\n\t\t\t\tobjectSet.add( child );\n\n\t\t\t}\n\n\t\t} );\n\n\t}\n\n}\n\n// calculate precise box bounds of the given geometry in the given frame\nfunction getPreciseBounds( geometry, matrix, target ) {\n\n\ttarget.makeEmpty();\n\n\tconst drawRange = geometry.drawRange;\n\tconst indexAttr = geometry.index;\n\tconst posAttr = geometry.attributes.position;\n\tconst start = drawRange.start;\n\tconst vertCount = indexAttr ? indexAttr.count : posAttr.count;\n\tconst count = Math.min( vertCount - start, drawRange.count );\n\tfor ( let i = start, l = start + count; i < l; i ++ ) {\n\n\t\tlet vi = i;\n\t\tif ( indexAttr ) {\n\n\t\t\tvi = indexAttr.getX( vi );\n\n\t\t}\n\n\t\t_vec.fromBufferAttribute( posAttr, vi ).applyMatrix4( matrix );\n\t\ttarget.expandByPoint( _vec );\n\n\t}\n\n\treturn target;\n\n}\n\n// iterator helper for raycasting\nfunction iterateOverObjects( offset, count, bvh, callback, contained, depth, / scratch / ) {\n\n\tconst { primitiveBuffer, objects, idMask, idBits } = bvh;\n\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\tconst compositeId = primitiveBuffer[ i ];\n\t\tconst id = getObjectId( compositeId, idMask );\n\t\tconst instanceId = getInstanceId( compositeId, idBits, idMask );\n\t\tconst object = objects[ id ];\n\t\tif ( callback( object, instanceId, contained, depth ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n\nfunction shrinkToSphere( box, sphere ) {\n\n\t_vec.copy( sphere.center ).addScalar( - sphere.radius );\n\tbox.min.max( _vec );\n\n\t_vec.copy( sphere.center ).addScalar( sphere.radius );\n\tbox.max.min( _vec );\n\n}\n","/* @import { SkinnedMesh } from 'three' /\n/* @import { IntersectsBoundsCallback, IntersectsRangeCallback, BoundsTraverseOrderCallback } from './BVH.js' /\nimport { Vector3, Vector2, Ray, Matrix4, FrontSide, BackSide, Triangle, REVISION } from 'three';\nimport { GeometryBVH } from './GeometryBVH.js';\nimport { ExtendedTriangle } from '../math/ExtendedTriangle.js';\nimport { INTERSECTED, NOT_INTERSECTED, SKIP_GENERATION } from './Constants.js';\n\nconst _v0 = / @__PURE__ / new Vector3();\nconst _v1 = / @__PURE__ / new Vector3();\nconst _v2 = / @__PURE__ / new Vector3();\nconst _ray = / @__PURE__ / new Ray();\nconst _inverseMatrix = / @__PURE__ / new Matrix4();\nconst _localPoint = / @__PURE__ / new Vector3();\nconst _vec = / @__PURE__ / new Vector3();\nconst _axes = [ 'x', 'y', 'z' ];\n\nconst IS_GT_REVISION_169 = parseInt( REVISION ) >= 169;\nconst IS_LT_REVISION_161 = parseInt( REVISION ) <= 161;\n\nconst _uvA = / @__PURE__ / new Vector2();\nconst _uvB = / @__PURE__ / new Vector2();\nconst _uvC = / @__PURE__ / new Vector2();\nconst _normalA = / @__PURE__ / new Vector3();\nconst _normalB = / @__PURE__ / new Vector3();\nconst _normalC = / @__PURE__ / new Vector3();\n\n/\n @callback IntersectsTriangleCallback\n * @param {ExtendedTriangle} triangle - The triangle primitive in local space.\n * @param {number} index - The primitive index within the BVH buffer.\n * @param {boolean} contained - Whether the node bounds are fully contained by the query shape.\n * @param {number} depth - The depth of the node in the tree.\n * @returns {boolean} Return `true` to stop traversal.\n /\n\n/\n BVH for `SkinnedMesh` objects. Computes primitive bounds using\n * `SkinnedMesh.getVertexPosition` so the tree reflects the current posed state\n * of the mesh. Call `refit()` after updating the skeleton to keep bounds accurate.\n \n @param {SkinnedMesh} mesh\n * @param {Object} [options] - Same options as {@link GeometryBVH}.\n * @extends GeometryBVH\n /\nexport class SkinnedMeshBVH extends GeometryBVH {\n\n\tget primitiveStride() {\n\n\t\treturn 3;\n\n\t}\n\n\tconstructor( mesh, options = {} ) {\n\n\t\tif ( ! mesh.isMesh ) {\n\n\t\t\tthrow new Error( 'SkinnedMeshBVH: First argument must be a Mesh.' );\n\n\t\t}\n\n\t\t// skip generation initially so we can add our local fields\n\t\t// TODO: is there a more clean way to handle this? Update all subclasses to be\n\t\t// responsible for calling \"init\" themselves?\n\t\tsuper( mesh.geometry, {\n\t\t\t...options,\n\t\t\t[ SKIP_GENERATION ]: true,\n\t\t} );\n\t\tthis.mesh = mesh;\n\n\t\tif ( ! options[ SKIP_GENERATION ] ) {\n\n\t\t\tthis.init( options );\n\n\t\t}\n\n\t}\n\n\twritePrimitiveBounds( i, targetBuffer, baseIndex ) {\n\n\t\tconst { mesh, geometry } = this;\n\t\tconst indirectBuffer = this._indirectBuffer;\n\t\tconst index = geometry.index ? geometry.index.array : null;\n\n\t\tconst tri = indirectBuffer ? indirectBuffer[ i ] : i;\n\t\tconst tri3 = tri 3;\n\n\t\tlet ai = tri3 + 0;\n\t\tlet bi = tri3 + 1;\n\t\tlet ci = tri3 + 2;\n\n\t\tif ( index ) {\n\n\t\t\tai = index[ ai ];\n\t\t\tbi = index[ bi ];\n\t\t\tci = index[ ci ];\n\n\t\t}\n\n\t\t// Get skinned vertex positions\n\t\tmesh.getVertexPosition( ai, _v0 );\n\t\tmesh.getVertexPosition( bi, _v1 );\n\t\tmesh.getVertexPosition( ci, _v2 );\n\n\t\t// Compute bounds for each axis\n\t\tfor ( let el = 0; el < 3; el ++ ) {\n\n\t\t\tconst axis = _axes[ el ];\n\t\t\tconst a = _v0[ axis ];\n\t\t\tconst b = _v1[ axis ];\n\t\t\tconst c = _v2[ axis ];\n\n\t\t\tlet min = a;\n\t\t\tif ( b < min ) min = b;\n\t\t\tif ( c < min ) min = c;\n\n\t\t\tlet max = a;\n\t\t\tif ( b > max ) max = b;\n\t\t\tif ( c > max ) max = c;\n\n\t\t\t// Write in min/max format [minx, miny, minz, maxx, maxy, maxz]\n\t\t\ttargetBuffer[ baseIndex + el ] = min;\n\t\t\ttargetBuffer[ baseIndex + el + 3 ] = max;\n\n\t\t}\n\n\t\treturn targetBuffer;\n\n\t}\n\n\t/*\n\t Performs a spatial query against the BVH. Extends the base `shapecast` with an\n\t * `intersectsTriangle` callback that is called once per triangle primitive in leaf nodes.\n\t \n\t @param {Object} callbacks\n\t * @param {IntersectsBoundsCallback} callbacks.intersectsBounds\n\t * @param {IntersectsTriangleCallback} [callbacks.intersectsTriangle]\n\t * @param {IntersectsRangeCallback} [callbacks.intersectsRange]\n\t * @param {BoundsTraverseOrderCallback} [callbacks.boundsTraverseOrder]\n\t * @returns {boolean}\n\t /\n\tshapecast( callbacks ) {\n\n\t\tconst triangle = new ExtendedTriangle();\n\t\treturn super.shapecast(\n\t\t\t{\n\t\t\t\t...callbacks,\n\t\t\t\tintersectsPrimitive: callbacks.intersectsTriangle,\n\t\t\t\tscratchPrimitive: triangle,\n\t\t\t\titerate: iterateOverTriangles,\n\t\t\t},\n\t\t);\n\n\t}\n\n\traycastObject3D( object, raycaster, intersects = [] ) {\n\n\t\tconst { material } = object;\n\t\tif ( material === undefined ) {\n\n\t\t\treturn;\n\n\t\t}\n\n\t\tconst { matrixWorld } = object;\n\t\tconst { firstHitOnly } = raycaster;\n\n\t\t_inverseMatrix.copy( matrixWorld ).invert();\n\t\t_ray.copy( raycaster.ray ).applyMatrix4( _inverseMatrix );\n\n\t\tlet closestHit = null;\n\t\tlet closestDistance = Infinity;\n\n\t\tthis.shapecast( {\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn box.distanceToPoint( _ray.origin );\n\n\t\t\t},\n\t\t\tintersectsBounds: box => {\n\n\t\t\t\tif ( firstHitOnly ) {\n\n\t\t\t\t\tif ( ! _ray.intersectBox( box, _vec ) ) {\n\n\t\t\t\t\t\treturn NOT_INTERSECTED;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tlet dist;\n\t\t\t\t\tif ( box.containsPoint( _ray.origin ) ) {\n\n\t\t\t\t\t\tdist = 0;\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\t_vec.applyMatrix4( matrixWorld );\n\t\t\t\t\t\tdist = raycaster.ray.origin.distanceTo( _vec );\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// early out if the box is further than the closest raycast\n\t\t\t\t\treturn dist < closestDistance ? INTERSECTED : NOT_INTERSECTED;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn _ray.intersectsBox( box ) ? INTERSECTED : NOT_INTERSECTED;\n\n\t\t\t\t}\n\n\t\t\t},\n\t\t\tintersectsTriangle: ( tri, triIndex ) => {\n\n\t\t\t\t// get the intersection\n\t\t\t\tlet point = null;\n\t\t\t\tif ( material.side === FrontSide ) {\n\n\t\t\t\t\tpoint = _ray.intersectTriangle( tri.a, tri.b, tri.c, true, _localPoint );\n\n\t\t\t\t} else if ( material.side === BackSide ) {\n\n\t\t\t\t\tpoint = _ray.intersectTriangle( tri.c, tri.b, tri.a, true, _localPoint );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tpoint = _ray.intersectTriangle( tri.a, tri.b, tri.c, false, _localPoint );\n\n\t\t\t\t}\n\n\t\t\t\tif ( ! point ) {\n\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\n\t\t\t\t// transform it into world space\n\t\t\t\tpoint = point.clone().applyMatrix4( matrixWorld );\n\n\t\t\t\t// check distance to ray\n\t\t\t\tconst dist = raycaster.ray.origin.distanceTo( point );\n\t\t\t\tif ( dist >= raycaster.near && dist <= raycaster.far ) {\n\n\t\t\t\t\tif ( firstHitOnly && dist >= closestDistance ) {\n\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// get the vertex indices\n\t\t\t\t\tconst { geometry } = this;\n\t\t\t\t\tconst { index } = geometry;\n\t\t\t\t\tconst actualTri = this.resolvePrimitiveIndex( triIndex );\n\t\t\t\t\tconst triOffset = actualTri 3;\n\n\t\t\t\t\tlet ai = triOffset + 0;\n\t\t\t\t\tlet bi = triOffset + 1;\n\t\t\t\t\tlet ci = triOffset + 2;\n\n\t\t\t\t\tif ( index ) {\n\n\t\t\t\t\t\tai = index.array[ ai ];\n\t\t\t\t\t\tbi = index.array[ bi ];\n\t\t\t\t\t\tci = index.array[ ci ];\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// build the intersection result\n\t\t\t\t\tconst hit = {\n\t\t\t\t\t\tdistance: dist,\n\t\t\t\t\t\tpoint: point.clone(),\n\t\t\t\t\t\tobject,\n\t\t\t\t\t\tuv: null,\n\t\t\t\t\t\tuv1: null,\n\t\t\t\t\t\tnormal: null,\n\t\t\t\t\t\tface: {\n\t\t\t\t\t\t\ta: ai,\n\t\t\t\t\t\t\tb: bi,\n\t\t\t\t\t\t\tc: ci,\n\t\t\t\t\t\t\tnormal: Triangle.getNormal( tri.a, tri.b, tri.c, new Vector3() ),\n\t\t\t\t\t\t\tmaterialIndex: 0\n\t\t\t\t\t\t},\n\t\t\t\t\t\tfaceIndex: actualTri,\n\t\t\t\t\t};\n\n\t\t\t\t\tif ( IS_GT_REVISION_169 ) {\n\n\t\t\t\t\t\tconst barycoord = new Vector3();\n\t\t\t\t\t\tTriangle.getBarycoord( _localPoint, tri.a, tri.b, tri.c, barycoord );\n\t\t\t\t\t\thit.barycoord = barycoord;\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// add attribute fields if available\n\t\t\t\t\tconst uv = geometry.attributes.uv;\n\t\t\t\t\tconst uv1 = geometry.attributes.uv1;\n\t\t\t\t\tconst normal = geometry.attributes.normal;\n\n\t\t\t\t\tif ( uv ) {\n\n\t\t\t\t\t\t_uvA.fromBufferAttribute( uv, ai );\n\t\t\t\t\t\t_uvB.fromBufferAttribute( uv, bi );\n\t\t\t\t\t\t_uvC.fromBufferAttribute( uv, ci );\n\n\t\t\t\t\t\thit.uv = new Vector2();\n\t\t\t\t\t\tconst resUv = Triangle.getInterpolation( _localPoint, tri.a, tri.b, tri.c, _uvA, _uvB, _uvC, hit.uv );\n\t\t\t\t\t\tif ( ! IS_GT_REVISION_169 ) hit.uv = resUv;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( uv1 ) {\n\n\t\t\t\t\t\t_uvA.fromBufferAttribute( uv1, ai );\n\t\t\t\t\t\t_uvB.fromBufferAttribute( uv1, bi );\n\t\t\t\t\t\t_uvC.fromBufferAttribute( uv1, ci );\n\n\t\t\t\t\t\thit.uv1 = new Vector2();\n\t\t\t\t\t\tconst resUv1 = Triangle.getInterpolation( _localPoint, tri.a, tri.b, tri.c, _uvA, _uvB, _uvC, hit.uv1 );\n\t\t\t\t\t\tif ( ! IS_GT_REVISION_169 ) hit.uv1 = resUv1;\n\t\t\t\t\t\tif ( IS_LT_REVISION_161 ) hit.uv2 = hit.uv1;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( normal ) {\n\n\t\t\t\t\t\t_normalA.fromBufferAttribute( normal, ai );\n\t\t\t\t\t\t_normalB.fromBufferAttribute( normal, bi );\n\t\t\t\t\t\t_normalC.fromBufferAttribute( normal, ci );\n\n\t\t\t\t\t\thit.normal = new Vector3();\n\t\t\t\t\t\tconst resNormal = Triangle.getInterpolation( _localPoint, tri.a, tri.b, tri.c, _normalA, _normalB, _normalC, hit.normal );\n\t\t\t\t\t\tif ( hit.normal.dot( _ray.direction ) > 0 ) {\n\n\t\t\t\t\t\t\thit.normal.multiplyScalar( - 1 );\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif ( ! IS_GT_REVISION_169 ) hit.normal = resNormal;\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// first hit only settings\n\t\t\t\t\tclosestDistance = hit.distance;\n\t\t\t\t\tclosestHit = hit;\n\n\t\t\t\t\tif ( ! firstHitOnly ) {\n\n\t\t\t\t\t\tintersects.push( hit );\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t} );\n\n\t\tif ( firstHitOnly && closestHit ) {\n\n\t\t\tintersects.push( closestHit );\n\n\t\t}\n\n\t\treturn intersects;\n\n\t}\n\n}\n\nfunction iterateOverTriangles(\n\toffset,\n\tcount,\n\tbvh,\n\tintersectsTriangleFunc,\n\tcontained,\n\tdepth,\n\ttriangle\n) {\n\n\tconst { mesh, geometry } = bvh;\n\tconst index = geometry.index ? geometry.index.array : null;\n\n\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\tconst tri = bvh.resolvePrimitiveIndex( i );\n\n\t\tlet i0 = 3 * tri + 0;\n\t\tlet i1 = 3 * tri + 1;\n\t\tlet i2 = 3 * tri + 2;\n\n\t\tif ( index ) {\n\n\t\t\ti0 = index[ i0 ];\n\t\t\ti1 = index[ i1 ];\n\t\t\ti2 = index[ i2 ];\n\n\t\t}\n\n\t\tmesh.getVertexPosition( i0, triangle.a );\n\t\tmesh.getVertexPosition( i1, triangle.b );\n\t\tmesh.getVertexPosition( i2, triangle.c );\n\t\ttriangle.needsUpdate = true;\n\n\t\tif ( intersectsTriangleFunc( triangle, i, contained, depth ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n","/*\n Set of shader functions used for interacting with the packed BVH in a shader and sampling\n * VertexAttributeTextures. Provides common utility functions including `texelFetch1D`. See\n * [src/webgl/glsl](https://github.com/gkjohnson/three-mesh-bvh/tree/master/src/webgl/glsl)\n * for full implementations and declarations.\n \n Accessed as `BVHShaderGLSL.common_functions`.\n \n @section Shader and Texture Packing API\n * @type {string}\n /\nexport const common_functions = / glsl /`\n\n// A stack of uint32 indices can can store the indices for\n// a perfectly balanced tree with a depth up to 31. Lower stack\n// depth gets higher performance.\n//\n// However not all trees are balanced. Best value to set this to\n// is the trees max depth.\n#ifndef BVH_STACK_DEPTH\n#define BVH_STACK_DEPTH 60\n#endif\n\n#ifndef INFINITY\n#define INFINITY 1e20\n#endif\n\n// Utilities\nuvec4 uTexelFetch1D( usampler2D tex, uint index ) {\n\n\tuint width = uint( textureSize( tex, 0 ).x );\n\tuvec2 uv;\n\tuv.x = index % width;\n\tuv.y = index / width;\n\n\treturn texelFetch( tex, ivec2( uv ), 0 );\n\n}\n\nivec4 iTexelFetch1D( isampler2D tex, uint index ) {\n\n\tuint width = uint( textureSize( tex, 0 ).x );\n\tuvec2 uv;\n\tuv.x = index % width;\n\tuv.y = index / width;\n\n\treturn texelFetch( tex, ivec2( uv ), 0 );\n\n}\n\nvec4 texelFetch1D( sampler2D tex, uint index ) {\n\n\tuint width = uint( textureSize( tex, 0 ).x );\n\tuvec2 uv;\n\tuv.x = index % width;\n\tuv.y = index / width;\n\n\treturn texelFetch( tex, ivec2( uv ), 0 );\n\n}\n\nvec4 textureSampleBarycoord( sampler2D tex, vec3 barycoord, uvec3 faceIndices ) {\n\n\treturn\n\t\tbarycoord.x texelFetch1D( tex, faceIndices.x ) +\n\t\tbarycoord.y * texelFetch1D( tex, faceIndices.y ) +\n\t\tbarycoord.z * texelFetch1D( tex, faceIndices.z );\n\n}\n\nvoid ndcToCameraRay(\n\tvec2 coord, mat4 cameraWorld, mat4 invProjectionMatrix,\n\tout vec3 rayOrigin, out vec3 rayDirection\n) {\n\n\t// get camera look direction and near plane for camera clipping\n\tvec4 lookDirection = cameraWorld * vec4( 0.0, 0.0, - 1.0, 0.0 );\n\tvec4 nearVector = invProjectionMatrix * vec4( 0.0, 0.0, - 1.0, 1.0 );\n\tfloat near = abs( nearVector.z / nearVector.w );\n\n\t// get the camera direction and position from camera matrices\n\tvec4 origin = cameraWorld * vec4( 0.0, 0.0, 0.0, 1.0 );\n\tvec4 direction = invProjectionMatrix * vec4( coord, 0.5, 1.0 );\n\tdirection /= direction.w;\n\tdirection = cameraWorld * direction - origin;\n\n\t// slide the origin along the ray until it sits at the near clip plane position\n\torigin.xyz += direction.xyz * near / dot( direction, lookDirection );\n\n\trayOrigin = origin.xyz;\n\trayDirection = direction.xyz;\n\n}\n`;\n","// Distance to Point\n\n/*\n Set of shader functions used for interacting with the packed BVH in a shader and sampling\n * VertexAttributeTextures. Provides distance query functions. See\n * [src/webgl/glsl](https://github.com/gkjohnson/three-mesh-bvh/tree/master/src/webgl/glsl)\n * for full implementations and declarations.\n \n Accessed as `BVHShaderGLSL.bvh_distance_functions`.\n \n @section Shader and Texture Packing API\n * @type {string}\n /\nexport const bvh_distance_functions = / glsl /`\n\nfloat dot2( vec3 v ) {\n\n\treturn dot( v, v );\n\n}\n\n// https://www.shadertoy.com/view/ttfGWl\nvec3 closestPointToTriangle( vec3 p, vec3 v0, vec3 v1, vec3 v2, out vec3 barycoord ) {\n\n vec3 v10 = v1 - v0;\n vec3 v21 = v2 - v1;\n vec3 v02 = v0 - v2;\n\n\tvec3 p0 = p - v0;\n\tvec3 p1 = p - v1;\n\tvec3 p2 = p - v2;\n\n vec3 nor = cross( v10, v02 );\n\n // method 2, in barycentric space\n vec3 q = cross( nor, p0 );\n float d = 1.0 / dot2( nor );\n float u = d dot( q, v02 );\n float v = d * dot( q, v10 );\n float w = 1.0 - u - v;\n\n\tif( u < 0.0 ) {\n\n\t\tw = clamp( dot( p2, v02 ) / dot2( v02 ), 0.0, 1.0 );\n\t\tu = 0.0;\n\t\tv = 1.0 - w;\n\n\t} else if( v < 0.0 ) {\n\n\t\tu = clamp( dot( p0, v10 ) / dot2( v10 ), 0.0, 1.0 );\n\t\tv = 0.0;\n\t\tw = 1.0 - u;\n\n\t} else if( w < 0.0 ) {\n\n\t\tv = clamp( dot( p1, v21 ) / dot2( v21 ), 0.0, 1.0 );\n\t\tw = 0.0;\n\t\tu = 1.0 - v;\n\n\t}\n\n\tbarycoord = vec3( u, v, w );\n return u * v1 + v * v2 + w * v0;\n\n}\n\nfloat distanceToTriangles(\n\t// geometry info and triangle range\n\tsampler2D positionAttr, usampler2D indexAttr, uint offset, uint count,\n\n\t// point and cut off range\n\tvec3 point, float closestDistanceSquared,\n\n\t// outputs\n\tinout uvec4 faceIndices, inout vec3 faceNormal, inout vec3 barycoord, inout float side, inout vec3 outPoint\n) {\n\n\tbool found = false;\n\tvec3 localBarycoord;\n\tfor ( uint i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\tuvec3 indices = uTexelFetch1D( indexAttr, i ).xyz;\n\t\tvec3 a = texelFetch1D( positionAttr, indices.x ).rgb;\n\t\tvec3 b = texelFetch1D( positionAttr, indices.y ).rgb;\n\t\tvec3 c = texelFetch1D( positionAttr, indices.z ).rgb;\n\n\t\t// get the closest point and barycoord\n\t\tvec3 closestPoint = closestPointToTriangle( point, a, b, c, localBarycoord );\n\t\tvec3 delta = point - closestPoint;\n\t\tfloat sqDist = dot2( delta );\n\t\tif ( sqDist < closestDistanceSquared ) {\n\n\t\t\t// set the output results\n\t\t\tclosestDistanceSquared = sqDist;\n\t\t\tfaceIndices = uvec4( indices.xyz, i );\n\t\t\tfaceNormal = normalize( cross( a - b, b - c ) );\n\t\t\tbarycoord = localBarycoord;\n\t\t\toutPoint = closestPoint;\n\t\t\tside = sign( dot( faceNormal, delta ) );\n\n\t\t}\n\n\t}\n\n\treturn closestDistanceSquared;\n\n}\n\nfloat distanceSqToBounds( vec3 point, vec3 boundsMin, vec3 boundsMax ) {\n\n\tvec3 clampedPoint = clamp( point, boundsMin, boundsMax );\n\tvec3 delta = point - clampedPoint;\n\treturn dot( delta, delta );\n\n}\n\nfloat distanceSqToBVHNodeBoundsPoint( vec3 point, sampler2D bvhBounds, uint currNodeIndex ) {\n\n\tuint cni2 = currNodeIndex * 2u;\n\tvec3 boundsMin = texelFetch1D( bvhBounds, cni2 ).xyz;\n\tvec3 boundsMax = texelFetch1D( bvhBounds, cni2 + 1u ).xyz;\n\treturn distanceSqToBounds( point, boundsMin, boundsMax );\n\n}\n\n// use a macro to hide the fact that we need to expand the struct into separate fields\n#define\\\n\tbvhClosestPointToPoint(\\\n\t\tbvh,\\\n\t\tpoint, maxDistance, faceIndices, faceNormal, barycoord, side, outPoint\\\n\t)\\\n\t_bvhClosestPointToPoint(\\\n\t\tbvh.position, bvh.index, bvh.bvhBounds, bvh.bvhContents,\\\n\t\tpoint, maxDistance, faceIndices, faceNormal, barycoord, side, outPoint\\\n\t)\n\nfloat _bvhClosestPointToPoint(\n\t// bvh info\n\tsampler2D bvh_position, usampler2D bvh_index, sampler2D bvh_bvhBounds, usampler2D bvh_bvhContents,\n\n\t// point to check\n\tvec3 point, float maxDistance,\n\n\t// output variables\n\tinout uvec4 faceIndices, inout vec3 faceNormal, inout vec3 barycoord,\n\tinout float side, inout vec3 outPoint\n ) {\n\n\t// stack needs to be twice as long as the deepest tree we expect because\n\t// we push both the left and right child onto the stack every traversal\n\tint pointer = 0;\n\tuint stack[ BVH_STACK_DEPTH ];\n\tstack[ 0 ] = 0u;\n\n\tfloat closestDistanceSquared = maxDistance * maxDistance;\n\tbool found = false;\n\twhile ( pointer > - 1 && pointer < BVH_STACK_DEPTH ) {\n\n\t\tuint currNodeIndex = stack[ pointer ];\n\t\tpointer --;\n\n\t\t// check if we intersect the current bounds\n\t\tfloat boundsHitDistance = distanceSqToBVHNodeBoundsPoint( point, bvh_bvhBounds, currNodeIndex );\n\t\tif ( boundsHitDistance > closestDistanceSquared ) {\n\n\t\t\tcontinue;\n\n\t\t}\n\n\t\tuvec2 boundsInfo = uTexelFetch1D( bvh_bvhContents, currNodeIndex ).xy;\n\t\tbool isLeaf = bool( boundsInfo.x & 0xffff0000u );\n\t\tif ( isLeaf ) {\n\n\t\t\tuint count = boundsInfo.x & 0x0000ffffu;\n\t\t\tuint offset = boundsInfo.y;\n\t\t\tclosestDistanceSquared = distanceToTriangles(\n\t\t\t\tbvh_position, bvh_index, offset, count, point, closestDistanceSquared,\n\n\t\t\t\t// outputs\n\t\t\t\tfaceIndices, faceNormal, barycoord, side, outPoint\n\t\t\t);\n\n\t\t} else {\n\n\t\t\tuint leftIndex = currNodeIndex + 1u;\n\t\t\tuint splitAxis = boundsInfo.x & 0x0000ffffu;\n\t\t\tuint rightIndex = currNodeIndex + boundsInfo.y;\n\t\t\tbool leftToRight = distanceSqToBVHNodeBoundsPoint( point, bvh_bvhBounds, leftIndex ) < distanceSqToBVHNodeBoundsPoint( point, bvh_bvhBounds, rightIndex );//rayDirection[ splitAxis ] >= 0.0;\n\t\t\tuint c1 = leftToRight ? leftIndex : rightIndex;\n\t\t\tuint c2 = leftToRight ? rightIndex : leftIndex;\n\n\t\t\t// set c2 in the stack so we traverse it later. We need to keep track of a pointer in\n\t\t\t// the stack while we traverse. The second pointer added is the one that will be\n\t\t\t// traversed first\n\t\t\tpointer ++;\n\t\t\tstack[ pointer ] = c2;\n\t\t\tpointer ++;\n\t\t\tstack[ pointer ] = c1;\n\n\t\t}\n\n\t}\n\n\treturn sqrt( closestDistanceSquared );\n\n}\n`;\n","/*\n Set of shader functions used for interacting with the packed BVH in a shader and sampling\n * VertexAttributeTextures. Provides ray intersection functions. See\n * [src/webgl/glsl](https://github.com/gkjohnson/three-mesh-bvh/tree/master/src/webgl/glsl)\n * for full implementations and declarations.\n \n Accessed as `BVHShaderGLSL.bvh_ray_functions`.\n \n @section Shader and Texture Packing API\n * @type {string}\n /\nexport const bvh_ray_functions = / glsl /`\n\n#ifndef TRI_INTERSECT_EPSILON\n#define TRI_INTERSECT_EPSILON 1e-5\n#endif\n\n// Raycasting\nbool intersectsBounds( vec3 rayOrigin, vec3 rayDirection, vec3 boundsMin, vec3 boundsMax, out float dist ) {\n\n\t// https://www.reddit.com/r/opengl/comments/8ntzz5/fast_glsl_ray_box_intersection/\n\t// https://tavianator.com/2011/ray_box.html\n\tvec3 invDir = 1.0 / rayDirection;\n\n\t// find intersection distances for each plane\n\tvec3 tMinPlane = invDir ( boundsMin - rayOrigin );\n\tvec3 tMaxPlane = invDir * ( boundsMax - rayOrigin );\n\n\t// get the min and max distances from each intersection\n\tvec3 tMinHit = min( tMaxPlane, tMinPlane );\n\tvec3 tMaxHit = max( tMaxPlane, tMinPlane );\n\n\t// get the furthest hit distance\n\tvec2 t = max( tMinHit.xx, tMinHit.yz );\n\tfloat t0 = max( t.x, t.y );\n\n\t// get the minimum hit distance\n\tt = min( tMaxHit.xx, tMaxHit.yz );\n\tfloat t1 = min( t.x, t.y );\n\n\t// set distance to 0.0 if the ray starts inside the box\n\tdist = max( t0, 0.0 );\n\n\treturn t1 >= dist;\n\n}\n\nbool intersectsTriangle(\n\tvec3 rayOrigin, vec3 rayDirection, vec3 a, vec3 b, vec3 c,\n\tout vec3 barycoord, out vec3 norm, out float dist, out float side\n) {\n\n\t// https://stackoverflow.com/questions/42740765/intersection-between-line-and-triangle-in-3d\n\tvec3 edge1 = b - a;\n\tvec3 edge2 = c - a;\n\tnorm = cross( edge1, edge2 );\n\n\tfloat det = - dot( rayDirection, norm );\n\tfloat invdet = 1.0 / det;\n\n\tvec3 AO = rayOrigin - a;\n\tvec3 DAO = cross( AO, rayDirection );\n\n\tvec4 uvt;\n\tuvt.x = dot( edge2, DAO ) * invdet;\n\tuvt.y = - dot( edge1, DAO ) * invdet;\n\tuvt.z = dot( AO, norm ) * invdet;\n\tuvt.w = 1.0 - uvt.x - uvt.y;\n\n\t// set the hit information\n\tbarycoord = uvt.wxy; // arranged in A, B, C order\n\tdist = uvt.z;\n\tside = sign( det );\n\tnorm = side * normalize( norm );\n\n\t// add an epsilon to avoid misses between triangles\n\tuvt += vec4( TRI_INTERSECT_EPSILON );\n\n\treturn all( greaterThanEqual( uvt, vec4( 0.0 ) ) );\n\n}\n\nbool intersectTriangles(\n\t// geometry info and triangle range\n\tsampler2D positionAttr, usampler2D indexAttr, uint offset, uint count,\n\n\t// ray\n\tvec3 rayOrigin, vec3 rayDirection,\n\n\t// outputs\n\tinout float minDistance, inout uvec4 faceIndices, inout vec3 faceNormal, inout vec3 barycoord,\n\tinout float side, inout float dist\n) {\n\n\tbool found = false;\n\tvec3 localBarycoord, localNormal;\n\tfloat localDist, localSide;\n\tfor ( uint i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\tuvec3 indices = uTexelFetch1D( indexAttr, i ).xyz;\n\t\tvec3 a = texelFetch1D( positionAttr, indices.x ).rgb;\n\t\tvec3 b = texelFetch1D( positionAttr, indices.y ).rgb;\n\t\tvec3 c = texelFetch1D( positionAttr, indices.z ).rgb;\n\n\t\tif (\n\t\t\tintersectsTriangle( rayOrigin, rayDirection, a, b, c, localBarycoord, localNormal, localDist, localSide )\n\t\t\t&& localDist < minDistance\n\t\t) {\n\n\t\t\tfound = true;\n\t\t\tminDistance = localDist;\n\n\t\t\tfaceIndices = uvec4( indices.xyz, i );\n\t\t\tfaceNormal = localNormal;\n\n\t\t\tside = localSide;\n\t\t\tbarycoord = localBarycoord;\n\t\t\tdist = localDist;\n\n\t\t}\n\n\t}\n\n\treturn found;\n\n}\n\nbool intersectsBVHNodeBounds( vec3 rayOrigin, vec3 rayDirection, sampler2D bvhBounds, uint currNodeIndex, out float dist ) {\n\n\tuint cni2 = currNodeIndex * 2u;\n\tvec3 boundsMin = texelFetch1D( bvhBounds, cni2 ).xyz;\n\tvec3 boundsMax = texelFetch1D( bvhBounds, cni2 + 1u ).xyz;\n\treturn intersectsBounds( rayOrigin, rayDirection, boundsMin, boundsMax, dist );\n\n}\n\n// use a macro to hide the fact that we need to expand the struct into separate fields\n#define\\\n\tbvhIntersectFirstHit(\\\n\t\tbvh,\\\n\t\trayOrigin, rayDirection, faceIndices, faceNormal, barycoord, side, dist\\\n\t)\\\n\t_bvhIntersectFirstHit(\\\n\t\tbvh.position, bvh.index, bvh.bvhBounds, bvh.bvhContents,\\\n\t\trayOrigin, rayDirection, faceIndices, faceNormal, barycoord, side, dist\\\n\t)\n\nbool _bvhIntersectFirstHit(\n\t// bvh info\n\tsampler2D bvh_position, usampler2D bvh_index, sampler2D bvh_bvhBounds, usampler2D bvh_bvhContents,\n\n\t// ray\n\tvec3 rayOrigin, vec3 rayDirection,\n\n\t// output variables split into separate variables due to output precision\n\tinout uvec4 faceIndices, inout vec3 faceNormal, inout vec3 barycoord,\n\tinout float side, inout float dist\n) {\n\n\t// stack needs to be twice as long as the deepest tree we expect because\n\t// we push both the left and right child onto the stack every traversal\n\tint pointer = 0;\n\tuint stack[ BVH_STACK_DEPTH ];\n\tstack[ 0 ] = 0u;\n\n\tfloat triangleDistance = INFINITY;\n\tbool found = false;\n\twhile ( pointer > - 1 && pointer < BVH_STACK_DEPTH ) {\n\n\t\tuint currNodeIndex = stack[ pointer ];\n\t\tpointer --;\n\n\t\t// check if we intersect the current bounds\n\t\tfloat boundsHitDistance;\n\t\tif (\n\t\t\t! intersectsBVHNodeBounds( rayOrigin, rayDirection, bvh_bvhBounds, currNodeIndex, boundsHitDistance )\n\t\t\t\|\| boundsHitDistance > triangleDistance\n\t\t) {\n\n\t\t\tcontinue;\n\n\t\t}\n\n\t\tuvec2 boundsInfo = uTexelFetch1D( bvh_bvhContents, currNodeIndex ).xy;\n\t\tbool isLeaf = bool( boundsInfo.x & 0xffff0000u );\n\n\t\tif ( isLeaf ) {\n\n\t\t\tuint count = boundsInfo.x & 0x0000ffffu;\n\t\t\tuint offset = boundsInfo.y;\n\n\t\t\tfound = intersectTriangles(\n\t\t\t\tbvh_position, bvh_index, offset, count,\n\t\t\t\trayOrigin, rayDirection, triangleDistance,\n\t\t\t\tfaceIndices, faceNormal, barycoord, side, dist\n\t\t\t) \|\| found;\n\n\t\t} else {\n\n\t\t\tuint leftIndex = currNodeIndex + 1u;\n\t\t\tuint splitAxis = boundsInfo.x & 0x0000ffffu;\n\t\t\tuint rightIndex = currNodeIndex + boundsInfo.y;\n\n\t\t\tbool leftToRight = rayDirection[ splitAxis ] >= 0.0;\n\t\t\tuint c1 = leftToRight ? leftIndex : rightIndex;\n\t\t\tuint c2 = leftToRight ? rightIndex : leftIndex;\n\n\t\t\t// set c2 in the stack so we traverse it later. We need to keep track of a pointer in\n\t\t\t// the stack while we traverse. The second pointer added is the one that will be\n\t\t\t// traversed first\n\t\t\tpointer ++;\n\t\t\tstack[ pointer ] = c2;\n\n\t\t\tpointer ++;\n\t\t\tstack[ pointer ] = c1;\n\n\t\t}\n\n\t}\n\n\treturn found;\n\n}\n`;\n","// Note that a struct cannot be used for the hit record including faceIndices, faceNormal, barycoord,\n// side, and dist because on some mobile GPUS (such as Adreno) numbers are afforded less precision specifically\n// when in a struct leading to inaccurate hit results. See KhronosGroup/WebGL#3351 for more details.\n\n/*\n Set of shader structs and defined constants used for interacting with the packed BVH in a\n * shader. See [src/webgl/glsl/bvh_struct_definitions.glsl.js](https://github.com/gkjohnson/three-mesh-bvh/blob/master/src/webgl/glsl/bvh_struct_definitions.glsl.js)\n * for full implementations and declarations.\n \n Accessed as `BVHShaderGLSL.bvh_struct_definitions`.\n \n @section Shader and Texture Packing API\n * @type {string}\n /\nexport const bvh_struct_definitions = / glsl /`\nstruct BVH {\n\n\tusampler2D index;\n\tsampler2D position;\n\n\tsampler2D bvhBounds;\n\tusampler2D bvhContents;\n\n};\n`;\n","export from './core/BVH.js';\nexport * from './core/GeometryBVH.js';\nexport * from './core/MeshBVH.js';\nexport * from './core/LineBVH.js';\nexport * from './core/PointsBVH.js';\nexport * from './core/ObjectBVH.js';\nexport * from './core/SkinnedMeshBVH.js';\nexport * from './objects/BVHHelper.js';\nexport { CENTER, AVERAGE, SAH, NOT_INTERSECTED, INTERSECTED, CONTAINED, SKIP_GENERATION } from './core/Constants.js';\nexport { getBVHExtremes, estimateMemoryInBytes, getJSONStructure, validateBounds } from './debug/Debug.js';\nexport * from './utils/ExtensionUtilities.js';\nexport { getTriangleHitPointInfo } from './utils/TriangleUtilities.js';\nexport * from './math/ExtendedTriangle.js';\nexport * from './math/OrientedBox.js';\nexport * from './webgl/MeshBVHUniformStruct.js';\nexport * from './webgl/VertexAttributeTexture.js';\nexport * from './utils/StaticGeometryGenerator.js';\nexport * as BVHShaderGLSL from './webgl/BVHShaderGLSL.js';\n\n// backwards compatibility\nimport * as BVHShaderGLSL from './webgl/BVHShaderGLSL.js';\nexport const shaderStructs = BVHShaderGLSL.bvh_struct_definitions;\nexport const shaderDistanceFunction = BVHShaderGLSL.bvh_distance_functions;\nexport const shaderIntersectFunction = `\n\t${ BVHShaderGLSL.common_functions }\n\t${ BVHShaderGLSL.bvh_ray_functions }\n`;\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47],"mappings":";AAuDA,IAAa,IAA2B,MAO3B,IAAmB;AAGA,KAAoB;AAIpD,IAAa,IAA4B,KAAG,KAE/B,IAAkB,OAAQ,kBAAmB,EAE7C,IAAkB;CAC9B,UAAA;CACA,UAAU;CACV,gBAAgB;CAChB,sBAAsB;CACtB,gBAAgB;CAChB,YAAY;CACZ,UAAU;CACV,SAAS;CACT,OAAO;EACL,IAAmB;CACrB;;;ACpFD,SAAgB,EAAY,GAAa,GAAO,GAAS;AAUxD,QARA,EAAO,IAAI,IAAI,EAAO,IACtB,EAAO,IAAI,IAAI,EAAO,IAAc,IACpC,EAAO,IAAI,IAAI,EAAO,IAAc,IAEpC,EAAO,IAAI,IAAI,EAAO,IAAc,IACpC,EAAO,IAAI,IAAI,EAAO,IAAc,IACpC,EAAO,IAAI,IAAI,EAAO,IAAc,IAE7B;;AAWR,SAAgB,EAAqB,GAAS;CAE7C,IAAI,IAAc,IACd,IAAY;AAEhB,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;EAE9B,IAAM,IAAO,EAAQ,IAAI,KAAM,EAAQ;AACvC,EAAK,IAAO,MAEX,IAAY,GACZ,IAAc;;AAMhB,QAAO;;AAKR,SAAgB,EAAY,GAAQ,GAAS;AAE5C,GAAO,IAAK,EAAQ;;AAKrB,SAAgB,EAAa,GAAG,GAAG,GAAS;CAE3C,IAAI,GAAM;AACV,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;EAE9B,IAAM,IAAK,IAAI;AAUf,EAPA,IAAO,EAAG,IACV,IAAO,EAAG,IACV,EAAQ,KAAM,IAAO,IAAO,IAAO,GAGnC,IAAO,EAAG,IACV,IAAO,EAAG,IACV,EAAQ,KAAO,IAAO,IAAO,IAAO;;;AAOtC,SAAgB,EAAyB,GAAY,GAAiB,GAAS;AAE9E,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;EAE9B,IAAM,IAAU,EAAiB,IAAa,IAAI,IAC5C,IAAQ,EAAiB,IAAa,IAAI,IAAI,IAE9C,IAAO,IAAU,GACjB,IAAO,IAAU;AAQvB,EANK,IAAO,EAAQ,OAEnB,EAAQ,KAAM,IAIV,IAAO,EAAQ,IAAI,OAEvB,EAAQ,IAAI,KAAM;;;AASrB,SAAgB,EAAoB,GAAS;CAE5C,IAAM,IAAK,EAAQ,KAAM,EAAQ,IAC3B,IAAK,EAAQ,KAAM,EAAQ,IAC3B,IAAK,EAAQ,KAAM,EAAQ;AAEjC,QAAO,KAAM,IAAK,IAAK,IAAK,IAAK,IAAK;;;;ACvGvC,SAAgB,EAAS,GAAK,GAAc;AAE3C,QAAO,EAAa,IAAM,QAAS;;AAIpC,SAAgB,EAAQ,GAAK,GAAc;AAE1C,QAAO,EAAa,IAAM;;AAI3B,SAAgB,EAAO,GAAK,GAAc;AAEzC,QAAO,EAAa,IAAM;;AAK3B,SAAgB,EAAW,GAAM;AAEhC,QAAO,IAAA;;AAKR,SAAgB,EAAY,GAAK,GAAc;AAI9C,QAAO,IADgB,EAAa,IAAM,KAAA;;AAK3C,SAAgB,EAAY,GAAK,GAAc;AAE9C,QAAO,EAAa,IAAM;;AAI3B,SAAgB,EAAqB,GAAM;AAE1C,QAAO;;;;ACzCR,SAAgB,EAAW,GAAiB,GAAQ,GAAO,GAAQ,GAAiB;CAEnF,IAAI,IAAO,UACP,IAAO,UACP,IAAO,UACP,IAAO,WACP,IAAO,WACP,IAAO,WAEP,IAAQ,UACR,IAAQ,UACR,IAAQ,UACR,IAAQ,WACR,IAAQ,WACR,IAAQ,WAEN,IAAe,EAAgB,UAAU;AAC/C,MAAM,IAAI,KAAM,IAAS,KAAiB,GAAG,KAAQ,IAAS,IAAQ,KAAiB,GAAG,IAAI,GAAK,KAAK,GAAI;EAE3G,IAAM,IAAK,EAAiB,IAAI,IAC1B,IAAK,EAAiB,IAAI,IAC1B,IAAK,IAAK,GACV,IAAK,IAAK;AAIhB,EAHK,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAQ,IAAQ,IACrB,IAAK,MAAQ,IAAQ;EAE1B,IAAM,IAAK,EAAiB,IAAI,IAC1B,IAAK,EAAiB,IAAI,IAC1B,IAAK,IAAK,GACV,IAAK,IAAK;AAIhB,EAHK,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAQ,IAAQ,IACrB,IAAK,MAAQ,IAAQ;EAE1B,IAAM,IAAK,EAAiB,IAAI,IAC1B,IAAK,EAAiB,IAAI,IAC1B,IAAK,IAAK,GACV,IAAK,IAAK;AAIhB,EAHK,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAQ,IAAQ,IACrB,IAAK,MAAQ,IAAQ;;AAkB3B,CAdA,EAAQ,KAAM,GACd,EAAQ,KAAM,GACd,EAAQ,KAAM,GAEd,EAAQ,KAAM,GACd,EAAQ,KAAM,GACd,EAAQ,KAAM,GAEd,EAAgB,KAAM,GACtB,EAAgB,KAAM,GACtB,EAAgB,KAAM,GAEtB,EAAgB,KAAM,GACtB,EAAgB,KAAM,GACtB,EAAgB,KAAM;;;;AC9DvB,IAAM,IAAY,IACZ,MAAa,GAAG,MAAO,EAAE,YAAY,EAAE,WACvC,IAA0B,gBAAI,MAAO,EAAW,CAAC,MAAM,CAAC,WAEtD;CAEN,OAAO;CACP,QAAQ,IAAI,aAAc,EAAG;CAC7B,kBAAkB,IAAI,aAAc,EAAG;CACvC,iBAAiB,IAAI,aAAc,EAAG;CACtC,WAAW;CAEX,EAEC,EACG,qBAA6B,IAAI,aAAc,EAAG;AAExD,SAAgB,GAAiB,GAAkB,GAAsB,GAAiB,GAAQ,GAAO,GAAW;CAEnH,IAAI,IAAO,IACP,IAAM;AAGV,KAAK,MAAA,EAGJ,CADA,IAAO,EAAqB,EAAsB,EAC7C,MAAS,OAEb,KAAQ,EAAsB,KAAS,EAAsB,IAAO,MAAQ;UAIlE,MAAA,EAGX,CADA,IAAO,EAAqB,EAAkB,EACzC,MAAS,OAEb,IAAM,GAAY,GAAiB,GAAQ,GAAO,EAAM;UAI9C,MAAA,GAAmB;EAE9B,IAAM,IAAkB,EAAoB,EAAkB,EAC1D,IAAW,IAA2B,GAGpC,IAAe,EAAgB,UAAU,GACzC,KAAW,IAAS,KAAiB,GACrC,KAAS,IAAS,IAAQ,KAAiB;AACjD,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAW,EAAsB,IAGjC,KAFY,EAAsB,IAAI,KACb,KACD;AAI9B,OAAK,IAAQ,IAAY,GAAI;IAG5B,IAAM,IAAgB,CAAE,GAAG,EAAS;AACpC,MAAc,SAAS;IAGvB,IAAI,IAAI;AACR,SAAM,IAAI,IAAI,GAAQ,IAAI,GAAM,KAAK,GAAG,KAAO;KAE9C,IAAM,IAAM,EAAe;AAE3B,KADA,EAAI,YAAY,EAAiB,IAAI,IAAI,IACzC,EAAI,QAAQ;KAEZ,IAAM,EACL,WACA,oBACA,wBACG;AACJ,UAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IASvB,CAPA,EAAkB,KAAM,UACxB,EAAkB,IAAI,KAAM,WAE5B,EAAiB,KAAM,UACvB,EAAiB,IAAI,KAAM,WAE3B,EAAQ,KAAM,UACd,EAAQ,IAAI,KAAM;AAInB,OAAyB,GAAG,GAAiB,EAAQ;;AAItD,MAAc,KAAM,GAAU;IAG9B,IAAI,IAAa;AACjB,SAAM,IAAI,IAAK,GAAG,IAAK,GAAY,KAAQ;KAE1C,IAAM,IAAM,EAAe;AAC3B,YAAQ,IAAK,IAAI,KAAc,EAAe,IAAK,GAAI,cAAc,EAAI,WAGxE,CADA,EAAc,OAAQ,IAAK,GAAG,EAAG,EACjC;;AAOF,SAAM,IAAI,IAAI,GAAQ,IAAI,GAAM,KAAK,GAAI;KAExC,IAAM,IAAS,EAAiB,IAAI,IAAI;AACxC,UAAM,IAAI,IAAK,GAAG,IAAK,GAAY,KAAQ;MAE1C,IAAM,IAAM,EAAe;AAC3B,MAAK,KAAU,EAAI,YAElB,EAAyB,GAAG,GAAiB,EAAI,iBAAkB,IAInE,EAAyB,GAAG,GAAiB,EAAI,gBAAiB,EAClE,EAAI;;;AASP,SAAM,IAAI,IAAK,GAAG,IAAK,GAAY,KAAQ;KAE1C,IAAM,IAAM,EAAe,IACrB,IAAY,EAAI,OAChB,IAAa,IAAQ,EAAI,OAGzB,IAAa,EAAI,iBACjB,IAAc,EAAI,kBAEpB,IAAW;AACf,KAAK,MAAc,MAElB,IAAW,EAAoB,EAAY,GAAG;KAI/C,IAAI,IAAY;AAChB,KAAK,MAAe,MAEnB,IAAY,EAAoB,EAAa,GAAG;KAIjD,IAAM,IAAA,IAAwB,KAC7B,IAAW,IAAY,IAAY;AAGpC,KAAK,IAAO,MAEX,IAAO,GACP,IAAW,GACX,IAAM,EAAI;;UAMN;AAGN,SAAM,IAAI,IAAI,GAAG,IAAI,GAAW,KAAO;KAEtC,IAAM,IAAM,EAAS;AAErB,KADA,EAAI,QAAQ,GACZ,EAAI,YAAY,IAAW,IAAW,IAAI;KAE1C,IAAM,IAAS,EAAI;AACnB,UAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IAGvB,CADA,EAAQ,KAAM,UACd,EAAQ,IAAI,KAAM;;AAOpB,SAAM,IAAI,IAAI,GAAQ,IAAI,GAAM,KAAK,GAAI;KAOxC,IAAI,IAAW,CAAE,GALC,EAAiB,IAAI,IAAI,KACR,KAIG;AACtC,KAAK,KAAY,MAAY,IAAW,IAAY;KAEpD,IAAM,IAAM,EAAS;AAGrB,KAFA,EAAI,SAEJ,EAAyB,GAAG,GAAiB,EAAI,OAAQ;;IAK1D,IAAM,IAAU,EAAS,IAAY;AACrC,MAAY,EAAQ,QAAQ,EAAQ,iBAAkB;AACtD,SAAM,IAAI,IAAI,IAAY,GAAG,KAAK,GAAG,KAAO;KAE3C,IAAM,IAAM,EAAS,IACf,IAAU,EAAS,IAAI;AAC7B,OAAa,EAAI,QAAQ,EAAQ,kBAAkB,EAAI,iBAAkB;;IAI1E,IAAI,IAAY;AAChB,SAAM,IAAI,IAAI,GAAG,IAAI,IAAY,GAAG,KAAO;KAE1C,IAAM,IAAM,EAAS,IACf,IAAW,EAAI,OACf,IAAS,EAAI,QAGb,IADU,EAAS,IAAI,GACD;AAiB5B,KAdK,MAAa,MAEZ,MAAc,IAElB,EAAY,GAAQ,GAAY,GAIhC,EAAa,GAAQ,IAAY,GAAY,GAM/C,KAAa;KAGb,IAAI,IAAW,GACX,IAAY;AAEhB,KAAK,MAAc,MAElB,IAAW,EAAoB,GAAY,GAAG;KAI/C,IAAM,IAAa,IAAQ;AAC3B,KAAK,MAAe,MAEnB,IAAY,EAAoB,EAAa,GAAG;KAIjD,IAAM,IAAA,IAAwB,KAC7B,IAAW,IAAY,IAAY;AAGpC,KAAK,IAAO,MAEX,IAAO,GACP,IAAW,GACX,IAAM,EAAI;;;;OAYd,SAAQ,KAAM,qCAAsC,EAAU,QAAS;AAIxE,QAAO;EAAE;EAAM;EAAK;;AAKrB,SAAS,GAAY,GAAiB,GAAQ,GAAO,GAAO;CAE3D,IAAI,IAAM,GACJ,IAAe,EAAgB;AACrC,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,IAEpD,MAAO,GAAmB,IAAI,KAAiB,IAAI,IAAO;AAI3D,QAAO,IAAM;;;;AClTd,IAAa,KAAb,MAAqB;CAEpB,cAAc;AAKb,OAAK,eAAe,IAAI,aAAc,EAAG;;;;;ACJ3C,SAAgB,GAAW,GAAQ,GAAQ,GAAiB,GAAQ,GAAO,GAAQ;CAElF,IAAI,IAAO,GACP,IAAQ,IAAS,IAAQ,GACvB,IAAM,EAAM,KACZ,IAAa,EAAM,OAAO,GAC1B,IAAe,EAAgB,UAAU;AAG/C,UAAe;AAEd,SAAQ,KAAQ,KAAS,GAAmB,IAAO,KAAiB,IAAI,KAAe,GAEtF;AAKD,SAAQ,KAAQ,KAAS,GAAmB,IAAQ,KAAiB,IAAI,MAAgB,GAExF;AAID,MAAK,IAAO,GAAQ;AAInB,QAAM,IAAI,IAAI,GAAG,IAAI,GAAQ,KAAO;IAEnC,IAAI,IAAK,EAAQ,IAAO,IAAS;AAEjC,IADA,EAAQ,IAAO,IAAS,KAAM,EAAQ,IAAQ,IAAS,IACvD,EAAQ,IAAQ,IAAS,KAAM;;AAKhC,QAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;IAE9B,IAAM,IAAI,IAAO,GACX,IAAI,IAAQ,GACZ,IAAK,EAAiB,IAAI,IAAI;AAEpC,IADA,EAAiB,IAAI,IAAI,KAAM,EAAiB,IAAI,IAAI,IACxD,EAAiB,IAAI,IAAI,KAAM;;AAKhC,GADA,KACA;QAIA,QAAO;;;;;ACrDV,IAAI,IAAc,IAAa,IAAa,IACtC,KAAwB,KAAG;AAEjC,SAAgB,GAAY,GAAO;AAQjC,QANI,WAAW,IAER,IAIA,IAAI,GAAY,EAAK,KAAM,GAAG,GAAY,EAAK,MAAO;;AAM/D,SAAgB,GAAgB,GAAY,GAAM,GAAS;AAO1D,QALA,KAAe,IAAI,aAAc,EAAQ,EACzC,KAAc,IAAI,YAAa,EAAQ,EACvC,KAAc,IAAI,YAAa,EAAQ,EACvC,KAAa,IAAI,WAAY,EAAQ,EAE9B,GAAiB,GAAY,EAAM;;AAQ3C,SAAS,GAAiB,GAAY,GAAO;CAE5C,IAAM,IAAc,IAAa,GAC3B,IAAc,IAAa,GAC3B,IAAS,WAAW,GACpB,IAAe,EAAK;AAC1B,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IAEvB,IAAc,IAAc,KAAM,EAAc;AAIjD,KAAK,EAYH,QAVI,EAAK,UAET,GAAW,IAAK,IAAI,WAAY,EAAK,OAAQ,EAAE,EAAY,EACpD,IAAa,EAAK,OAAO,eAIhC,GAAa,IAAc,KAAM,EAAK,QACtC,GAAa,IAAc,MAAO,EAAK,OACvC,GAAa,IAAc,MAAO,GAC3B,IAAA;CAIF;EAEN,IAAM,EAAE,SAAM,UAAO,iBAAc,GAI/B,IAAkB,GADC,IAAA,IACgC,EAAM,EAGvD,IAAmB,IAAA,IAEnB,IADiB,IAAA,KACqB;AAG5C,MAAK,IAAqB,GAEzB,OAAU,MAAO,yEAA0E;AAS5F,SAJA,GAAa,IAAc,KAAM,GACjC,GAAa,IAAc,KAAM,GAG1B,GAAiB,GAAiB,EAAO;;;;;AC9ElD,SAAgB,GAAW,GAAK,GAAiB,GAAQ,GAAO,GAAS,GAAY;CAGpF,IAAM,EACL,aACA,YACA,mBACA,qBAAkB,UAClB,aACA,kBACG,GAEE,IAAkB,EAAI,iBACtB,IAAkB,EAAI,uBAGtB,IAA4B,IAAI,aAAc,EAAG,EACnD,IAAkB,IAEhB,IAAO,IAAI,IAAS;AAG1B,QAFA,EAAW,GAAiB,GAAQ,GAAO,EAAK,cAAc,EAA2B,EACzF,EAAW,GAAM,GAAQ,GAAO,EAA2B,EACpD;CAEP,SAAS,EAAiB,GAAsB;AAE/C,EAAK,KAEJ,GAAc,IAAsB,EAAU,UAAW,EAAU,MAAO;;CAQ5E,SAAS,EAAW,GAAM,GAAQ,GAAO,IAAuB,MAAM,IAAQ,GAAI;AAEjF,EAAK,CAAE,KAAmB,KAAS,MAElC,IAAkB,IACb,KAEJ,QAAQ,KAAM,qBAAsB,EAAU,6DAA8D;EAQ9G,IAAM,IAAY,IAAQ;AAG1B,MAAO,KAAS,KAAkB,CAAE,KAAe,KAAS,EAK3D,QAHA,EAAiB,IAAS,EAAO,EACjC,EAAK,SAAS,GACd,EAAK,QAAQ,GACN;EAKR,IAAM,IAAQ,GAAiB,EAAK,cAAc,GAAsB,GAAiB,GAAQ,GAAO,EAAU,EAC9G,IAAc,EAAM,SAAS,KAAM,KAAM,GAAW,GAAiB,GAAiB,GAAiB,GAAQ,GAAO,EAAO;AAKjI,MAAK,EAAM,SAAS,MAAO,MAAgB,KAAU,MAAgB,IAAS,GAAQ;AAErF,OAAK,CAAE,EAKN,QAHA,EAAiB,IAAS,EAAO,EACjC,EAAK,SAAS,GACd,EAAK,QAAQ,GACN;AAKR,GADA,EAAM,OAAO,KAAK,IAAK,GAAG,EAAqB,EAAK,aAAc,CAAE,EACpE,IAAc,IAAS,KAAK,IAAK,GAAG,KAAK,MAAO,IAAQ,EAAG,CAAE;;AAK9D,IAAK,YAAY,EAAM;EAGvB,IAAM,IAAO,IAAI,IAAS,EACpB,IAAS,GACT,IAAS,IAAc;AAI7B,EAHA,EAAK,OAAO,GAEZ,EAAW,GAAiB,GAAQ,GAAQ,EAAK,cAAc,EAA2B,EAC1F,EAAW,GAAM,GAAQ,GAAQ,GAA2B,IAAQ,EAAG;EAGvE,IAAM,IAAQ,IAAI,IAAS,EACrB,IAAS,GACT,IAAS,IAAQ;AAMvB,SALA,EAAK,QAAQ,GAEb,EAAW,GAAiB,GAAQ,GAAQ,EAAM,cAAc,EAA2B,EAC3F,EAAW,GAAO,GAAQ,GAAQ,GAA2B,IAAQ,EAAG,EAEjE;;;AAMT,SAAgB,GAAiB,GAAK,GAAU;CAE/C,IAAM,IAAoB,EAAQ,uBAAuB,oBAAoB,aAGvE,IAAa,EAAI,cAAe,EAAQ,MAAO,EAC/C,IAAa,EAAY,IACzB,IAAY,EAAY,EAAW,SAAS,IAC5C,IAAY;EACjB,QAAQ,EAAW;EACnB,OAAO,EAAU,SAAS,EAAU,QAAQ,EAAW;EACvD,EAGK,IAAkB,IAAI,aAAc,IAAI,EAAU,MAAO;AAK/D,CAJA,EAAgB,SAAS,EAAU,QACnC,EAAI,uBAAwB,EAAU,QAAQ,EAAU,OAAO,EAAiB,EAGhF,EAAI,SAAS,EAAW,KAAK,MAAS;EAErC,IAAM,IAAO,GAAW,GAAK,GAAiB,EAAM,QAAQ,EAAM,OAAO,GAAS,EAAW,EAEvF,IAAS,IAAI,EAAA,KADD,GAAY,EAAM,CAC8B;AAElE,SADA,GAAgB,GAAG,GAAM,EAAQ,EAC1B;GAEL;;;;ACrJJ,IAAa,KAAb,MAA2B;CAE1B,YAAa,GAAkB;AAG9B,EADA,KAAK,mBAAmB,GACxB,KAAK,cAAc,EAAE;;CAItB,eAAe;EAEd,IAAM,IAAa,KAAK;AAOvB,SANI,EAAW,WAAW,IAEnB,KAAK,kBAAkB,GAIvB,EAAW,KAAK;;CAMzB,iBAAkB,GAAY;AAE7B,OAAK,YAAY,KAAM,EAAW;;GCkBvB,oBAA8B,IA5C3C,MAAmB;CAElB,cAAc;AAIb,EAFA,KAAK,eAAe,MACpB,KAAK,cAAc,MACnB,KAAK,cAAc;EAEnB,IAAM,IAAQ,EAAE,EACZ,IAAa;AAgBjB,EAfA,KAAK,aAAY,MAAU;AAW1B,GATK,KAEJ,EAAM,KAAM,EAAY,EAIzB,IAAa,GACb,KAAK,eAAe,IAAI,aAAc,EAAQ,EAC9C,KAAK,cAAc,IAAI,YAAa,EAAQ,EAC5C,KAAK,cAAc,IAAI,YAAa,EAAQ;KAI7C,KAAK,oBAAoB;AAOxB,GALA,IAAa,MACb,KAAK,eAAe,MACpB,KAAK,cAAc,MACnB,KAAK,cAAc,MAEd,EAAM,WAAW,KAErB,KAAK,UAAW,EAAM,KAAK,CAAE;;;GAU4B,ECrCzD,GAAO,IACL,KAAW,EAAE,EACb,qBAA0B,IAAI,SAAqB,IAAI,GAAM,CAAE;AAErE,SAAgB,GAAW,GAAK,GAAM,GAAkB,GAAiB,GAAqB,GAAa;AAM1G,CAHA,IAAQ,GAAQ,cAAc,EAC9B,KAAQ,GAAQ,cAAc,EAC9B,GAAS,KAAM,GAAO,GAAO,EAC7B,EAAY,UAAW,EAAI,OAAQ,GAAQ;CAE3C,IAAM,IAAS,GAAmB,GAAG,EAAI,UAAU,GAAkB,GAAiB,GAAqB,EAAY;AAOvH,CAJA,EAAY,aAAa,EACzB,GAAQ,iBAAkB,EAAO,EACjC,GAAQ,iBAAkB,GAAO,EACjC,GAAS,KAAK,EACd,GAAS,KAAK;CAEd,IAAM,IAAS,GAAS;AAQxB,QAPK,IAAS,MAEb,KAAQ,GAAU,IAAS,IAC3B,IAAQ,GAAU,IAAS,KAIrB;;AAIR,SAAS,GACR,GACA,GACA,GACA,GACA,IAAgB,MAChB,IAAkB,GAClB,IAAQ,GACP;CAED,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAGhC,KADe,EAAS,GAAa,EAAa,EACpC;EAEb,IAAM,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa;AAE/C,SADA,EAAY,EAAqB,EAAa,EAAE,GAAc,EAAO,EAC9D,EAAqB,GAAQ,GAAO,IAAO,GAAO,IAAkB,IAAA,GAA+B,EAAO;QAE3G;EAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa,EAChD,IAAK,GACL,IAAK,GAEL,GAAQ,GACR,GAAM;AACV,MAAK,MAEJ,IAAO,GACP,IAAO,IAGP,EAAY,EAAqB,EAAI,EAAE,GAAc,EAAM,EAC3D,EAAY,EAAqB,EAAI,EAAE,GAAc,EAAM,EAE3D,IAAS,EAAe,EAAM,EAC9B,IAAS,EAAe,EAAM,EAEzB,IAAS,IAAS;AAGtB,GADA,IAAK,GACL,IAAK;GAEL,IAAM,IAAO;AAIb,GAHA,IAAS,GACT,IAAS,GAET,IAAO;;AAQT,EAAO,MAEN,IAAO,GACP,EAAY,EAAqB,EAAI,EAAE,GAAc,EAAM;EAI5D,IAAM,IAAW,EAAS,IAAK,GAAG,EAAa,EACzC,IAAiB,EAAsB,GAAM,GAAU,GAAQ,IAAQ,GAAG,IAAkB,IAAA,EAAsB,EAEpH;AACJ,MAAK,MAAA,GAA+B;GAEnC,IAAM,IAAS,EAAe,EAAI;AAIlC,OAAkB,EAAqB,GAH3B,GAAmB,EAAI,GACf,GAEkC,IAAM,IAAQ,GAAG,IAAkB,IAAA,GAAsB,EAAM;QAIrH,KACC,KACA,GACC,GACA,GACA,GACA,GACA,GACA,GACA,IAAQ,EACR;AAIH,MAAK,EAAkB,QAAO;AAK9B,EADA,IAAO,IACP,EAAY,EAAqB,EAAI,EAAE,GAAc,EAAM;EAE3D,IAAM,IAAW,EAAS,IAAK,GAAG,EAAa,EACzC,IAAiB,EAAsB,GAAM,GAAU,GAAQ,IAAQ,GAAG,IAAkB,IAAA,EAAsB,EAEpH;AACJ,MAAK,MAAA,GAA+B;GAEnC,IAAM,IAAS,EAAe,EAAI;AAIlC,OAAkB,EAAqB,GAH3B,GAAmB,EAAI,GACf,GAEkC,IAAM,IAAQ,GAAG,IAAkB,IAAA,GAAsB,EAAM;QAIrH,KACC,KACA,GACC,GACA,GACA,GACA,GACA,GACA,GACA,IAAQ,EACR;AAIH,MAAK,EAAkB,QAAO;AAE9B,SAAO;EAIP,SAAS,EAAe,GAAc;GAErC,IAAM,EAAE,gBAAa,mBAAgB,GACjC,IAAc,IAAc;AAGhC,UAAQ,CAAE,EAAS,GAAa,EAAa,EAG5C,CADA,IAAc,EAAW,EAAa,EACtC,IAAc,IAAc;AAI7B,UAAO,EAAQ,GAAa,EAAa;;EAI1C,SAAS,GAAmB,GAAc;GAEzC,IAAM,EAAE,gBAAa,mBAAgB,GACjC,IAAc,IAAc;AAGhC,UAAQ,CAAE,EAAS,GAAa,EAAa,EAI5C,CADA,IAAc,EAAY,GAAa,EAAa,EACpD,IAAc,IAAc;AAK7B,UAAO,EAAQ,GAAa,EAAa,GAAG,EAAO,GAAa,EAAa;;;;;;ACxMhF,IAAM,qBAAgC,IAAI,EAAY,aAAa,EAC7D,qBAAgC,IAAI,EAAY,aAAa,EAC7D,oBAA2B,IAAI,SAAqB,IAAI,GAAM,CAAE,EAChE,qBAA4B,IAAI,GAAM,EACtC,qBAA6B,IAAI,GAAM,EAEvC,qBAA4B,IAAI,GAAM,EACtC,qBAA6B,IAAI,GAAM,EAEzC,KAAU;AAEd,SAAgB,GAAS,GAAK,GAAU,GAAe,GAAmB;AAEzE,KAAK,GAEJ,OAAU,MAAO,qDAAsD;AAIxE,MAAU;CAEV,IAAM,IAAQ,EAAI,QACZ,IAAa,EAAS,QACxB,GACA,IAAc,GACd,IAAc,GACZ,IAAS,IAAI,GAAS,CAAC,KAAM,EAAe,CAAC,QAAQ;AAG3D,MAAM,IAAI,IAAI,GAAG,IAAK,EAAM,QAAQ,IAAI,GAAI,KAAO;AAGlD,EADA,GAAc,UAAW,EAAO,GAAK,EACrC,IAAc;EAGd,IAAM,IAAW,EAAS,cAAc;AAExC,EADA,EAAY,EAAqB,EAAG,EAAE,GAAc,cAAc,EAAU,EAC5E,EAAS,aAAc,EAAQ;AAG/B,OAAM,IAAI,IAAI,GAAG,IAAK,EAAW,QAAQ,IAAI,MAE5C,GAAc,UAAW,EAAY,GAAK,EAE1C,IAAS,EACR,GAAG,GAAG,GAAe,GAAQ,GAC7B,GAAa,GAAa,GAAG,GAC7B,EACA,EAED,GAAc,aAAa,EAC3B,KAAe,EAAY,GAAI,aAAA,IAE1B,KAb2C;AA0BjD,MAJA,EAAS,iBAAkB,EAAU,EACrC,GAAc,aAAa,EAC3B,KAAe,EAAO,GAAI,aAAA,IAErB,EAEJ;;AAOF,QADA,KAAU,IACH;;AAIR,SAAS,EACR,GACA,GACA,GACA,GACA,GAGA,IAAmB,GACnB,IAAmB,GAGnB,IAAS,GACT,IAAS,GAET,IAAU,MACV,IAAW,IAEV;CAGD,IAAI,GAAc;AAClB,CAAK,KAEJ,IAAe,IACf,IAAe,OAIf,IAAe,IACf,IAAe;CAKhB,IACC,IAAgB,EAAa,cAC7B,IAAe,EAAa,aAC5B,IAAe,EAAa,aAC5B,IAAgB,EAAa,cAC7B,IAAe,EAAa,aAC5B,IAAe,EAAa,aAEvB,IAAe,IAAe,GAC9B,IAAe,IAAe,GAC9B,IAAU,EAAS,GAAc,EAAc,EAC/C,IAAU,EAAS,GAAc,EAAc,EACjD,IAAS;AACb,KAAK,KAAW,EAKf,CAWC,IAXI,IAEK,EACR,EAAQ,GAAc,EAAc,EAAE,EAAO,IAAe,GAAG,EAAc,EAC7E,EAAQ,GAAc,EAAc,EAAE,EAAO,IAAe,GAAG,EAAc,EAC7E,GAAQ,IAAmB,IAAA,GAC3B,GAAQ,IAAmB,IAAA,EAC3B,GAIQ,EACR,EAAQ,GAAc,EAAc,EAAE,EAAO,IAAe,GAAG,EAAc,EAC7E,EAAQ,GAAc,EAAc,EAAE,EAAO,IAAe,GAAG,EAAc,EAC7E,GAAQ,IAAmB,IAAA,GAC3B,GAAQ,IAAmB,IAAA,EAC3B;UAIS,GAAU;EAOrB,IAAM,IAAS,EAAS,cAAc;AAEtC,EADA,EAAY,EAAqB,EAAc,EAAE,GAAe,EAAQ,EACxE,EAAO,aAAc,EAAY;EAGjC,IAAM,IAAM,EAAW,EAAc,EAC/B,IAAM,EAAY,GAAc,EAAc;AAEpD,EADA,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAW,EAClE,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAY;EAGnE,IAAM,IAAe,EAAO,cAAe,GAAW,EAChD,IAAe,EAAO,cAAe,GAAY;AAevD,EAdA,IACC,KAAgB,EACf,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,IAED,KAAgB,EACf,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,EAGF,EAAS,iBAAkB,EAAQ;QAE7B;EAMN,IAAM,IAAM,EAAW,EAAc,EAC/B,IAAM,EAAY,GAAc,EAAc;AAEpD,EADA,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAW,EAClE,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAY;EAEnE,IAAM,IAAiB,EAAQ,cAAe,GAAW,EACnD,IAAkB,EAAQ,cAAe,GAAY;AAC3D,MAAK,KAAkB,EAGtB,KAAS,EACR,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAS,EACT,IAAI,EACJ,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAS,EACT;WAEU,EAEX,KAAK,EAGJ,KAAS,EACR,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAS,EACT;OAEK;GAIN,IAAM,IAAS,EAAS,cAAc;AACtC,KAAO,KAAM,GAAW,CAAC,aAAc,EAAY;GAEnD,IAAM,IAAM,EAAW,EAAc,EAC/B,IAAM,EAAY,GAAc,EAAc;AAEpD,GADA,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAW,EAClE,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAY;GAGnE,IAAM,IAAe,EAAO,cAAe,GAAW,EAChD,IAAe,EAAO,cAAe,GAAY;AAevD,GAdA,IACC,KAAgB,EACf,GAAK,GAAK,GAAY,GAAY,GAClC,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,IAED,KAAgB,EACf,GAAK,GAAK,GAAY,GAAY,GAClC,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,EAGF,EAAS,iBAAkB,EAAQ;;WAIzB,EAEX,KAAK,EAGJ,KAAS,EACR,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAS,EACT;OAEK;GAIN,IAAM,IAAS,EAAS,cAAc;AACtC,KAAO,KAAM,GAAY,CAAC,aAAc,EAAY;GAEpD,IAAM,IAAM,EAAW,EAAc,EAC/B,IAAM,EAAY,GAAc,EAAc;AAEpD,GADA,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAW,EAClE,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAY;GAGnE,IAAM,IAAe,EAAO,cAAe,GAAW,EAChD,IAAe,EAAO,cAAe,GAAY;AAevD,GAdA,IACC,KAAgB,EACf,GAAK,GAAK,GAAY,GAAY,GAClC,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,IAED,KAAgB,EACf,GAAK,GAAK,GAAY,GAAY,GAClC,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,EAGF,EAAS,iBAAkB,EAAQ;;;AAQtC,QAAO;;;;ACvTR,IAAa,KAAqB,IAAM,MAAM;CAE7C,cAAc;EAEb,IAAI,IAAS,MACT,IAAc,MACd,IAAc,MACd,IAAa;AA6CjB,EA3CA,KAAK,OAAO,MACZ,KAAK,SAAS,MACd,KAAK,cAAc,MACnB,KAAK,cAAc,MAEnB,KAAK,UAAW,GAAK,MAAU;AAE9B,OAAK,EAEJ,OAAU,MAAO,qEAAsE;AAOxF,GAHA,KAAK,OAAO,GACZ,KAAK,SAAS,IAAS,EAAI,OAAQ,IACnC,KAAK,cAAc,IAAc,IAAI,YAAa,EAAQ,EAC1D,KAAK,cAAc,IAAc,IAAI,YAAa,EAAQ;KAI3D,KAAK,cAAc;AAKlB,GAHA,KAAK,OAAO,MACZ,KAAK,SAAS,IAAS,MACvB,KAAK,cAAc,IAAc,MACjC,KAAK,cAAc,IAAc;KAIlC,KAAK,iBAAgB,MAAe;GAEnC,IAAI,IAAc,IAAc;AAChC,UAAQ,CAAE,EAAS,GAAa,EAAa,EAG5C,CADA,IAAc,EAAW,EAAa,EACtC,IAAc,IAAc;AAI7B,UAAO,EAAQ,GAAa,EAAa;KAI1C,KAAK,eAAc,MAAe;GAEjC,IAAI,IAAc,IAAc;AAChC,UAAQ,CAAE,EAAS,GAAa,EAAa,EAG5C,CADA,IAAc,EAAY,GAAa,EAAa,EACpD,IAAc,IAAc;AAI7B,UAAO,EAAQ,GAAa,EAAa,GAAG,EAAO,GAAa,EAAa;;EAK9E,IAAM,KAAS,GAAU,GAAa,MAAW;GAGhD,IAAM,IAAS,EADK,IAAc,GACG,EAAa;AAElD,OAAK,CADiB,EAAU,GAAO,GAAQ,EAAa,IACpC,CAAE,GAAS;IAElC,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa;AAEpD,IADA,EAAM,GAAU,GAAM,IAAQ,EAAG,EACjC,EAAM,GAAU,GAAO,IAAQ,EAAG;;;AA2BpC,EArBA,KAAK,kBAAiB,MAAY;AAEjC,OAAK,EAEJ,OAAU,MAAO,2EAA4E;AAI9F,OAAa;AACb,OAAI;AAEH,MAAM,GAAU,GAAG,EAAG;aAEb;AAET,QAAa;;KAMf,KAAK,YAAW,MAAY;AAE3B,QAAK,gBAAkB,GAAO,GAAQ,MAAiB;AAEtD,QAAK,GAAS;KAEb,IAAM,IAAc,IAAc,GAC5B,IAAS,EAAa,IAAc,IACpC,IAAQ,EAAa,IAAc;AACzC,YAAO,EAAU,GAAO,GAAQ,IAAI,aAAc,GAAQ,IAAc,GAAG,EAAG,EAAE,GAAQ,EAAO;WAEzF;KAEN,IAAM,IAAY,EAAY,GAAa,EAAa;AACxD,YAAO,EAAU,GAAO,GAAQ,IAAI,aAAc,GAAQ,IAAc,GAAG,EAAG,EAAE,EAAW;;KAI1F;;;GAMD,ECxHC,qBAA2B,IAAI,GAAM,EACrC,qBAA8B,IAAI,aAAc,EAAG,EA+C5C,KAAb,MAAiB;CAEhB,cAAc;AAIb,EAFA,KAAK,SAAS,MACd,KAAK,kBAAkB,MACvB,KAAK,wBAAwB;;CAI9B,KAAM,GAAU;AAiBf,EAfA,IAAU;GACT,GAAG;GACH,GAAG;GACH,EAEI,iBAAiB,MAErB,QAAQ,KAAM,oFAAiF,EAC/F,IAAU;GACT,GAAG;GACH,gBAAgB,EAAQ;GACxB,GAIF,GAAiB,MAAM,EAAS;;CAIjC,gBAA6B;AAG5B,QAAU,MAAO,uCAAwC;;CAM1D,uBAAqD;AAEpD,QAAU,MAAO,8CAA+C;;CAMjE,0BAA2B,GAAQ,GAAO,GAAc,GAAY;EAGnE,IAAI,IAAO,UACP,IAAO,UACP,IAAO,UACP,IAAO,WACP,IAAO,WACP,IAAO;AAGX,OAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,KAAO;AAE3D,QAAK,qBAAsB,GAAG,IAAa,EAAG;GAG9C,IAAM,CAAE,GAAI,GAAI,GAAI,GAAI,GAAI,KAAO;AAMnC,GALK,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO;;AAYzB,SAPA,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAEzB;;CAIR,uBAAwB,GAAQ,GAAO,GAAe;EAErD,IAAM,IAAe,EAAa,UAAU;AAC5C,OAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,KAAO;AAE3D,QAAK,qBAAsB,GAAG,IAAa,EAAG;GAG9C,IAAM,CAAE,GAAI,GAAI,GAAI,GAAI,GAAI,KAAO,IAE7B,KAAO,IAAK,KAAO,GACnB,KAAO,IAAK,KAAO,GACnB,KAAO,IAAK,KAAO,GAEnB,KAAO,IAAK,KAAO,GACnB,KAAO,IAAK,KAAO,GACnB,KAAO,IAAK,KAAO,GAEnB,KAAc,IAAI,KAAiB;AAMzC,GALA,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,KAAO,KAAK,IAAK,EAAI,GAAG,KAAO,GAC/D,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,KAAO,KAAK,IAAK,EAAI,GAAG,KAAO,GAC/D,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,KAAO,KAAK,IAAK,EAAI,GAAG,KAAO;;AAIhE,SAAO;;CASR,sBAAuB,GAAS;EAE/B,IAAM,IAAiB,KAAK;AAC5B,MAAK,EAGJ,MAAM,IAAI,IAAI,GAAG,IAAI,EAAe,QAAQ,IAAI,GAAG,IAElD,GAAgB,MAAO;OAIlB;GAGN,IAAM,IAAQ,KAAK;AACnB,QAAM,IAAI,IAAY,GAAG,IAAY,EAAM,QAAQ,KAAe;IAEjE,IAAM,IAAO,EAAO,IACd,IAAc,IAAI,YAAa,EAAM,EACrC,IAAc,IAAI,YAAa,EAAM,EACrC,IAAa,EAAK,aAAA;AACxB,SAAM,IAAI,IAAO,GAAG,IAAO,GAAY,KAAU;KAEhD,IAAM,IAAA,IAAgC;AAEtC,KAAK,EADe,IAAI,GACG,EAAa,KAGvC,EAAa,IAAc,MAAO;;;;;CAsBvC,SAAU,GAAU,IAAY,GAAI;AAInC,EAFA,GAAmB,OAAQ,MAAM,EAAW,EAC5C,GAAmB,SAAU,EAAU,EACvC,GAAmB,OAAO;;CAQ3B,QAAkC;EASjC,IAAM,IAAQ,KAAK;AACnB,OAAM,IAAI,IAAY,GAAG,IAAY,EAAM,QAAQ,IAAY,GAAW,KAAe;GAExF,IAAM,IAAS,EAAO,IAChB,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAe,IAAI,aAAc,EAAQ,EACzC,IAAa,EAAO,aAAA;AAG1B,QAAM,IAAI,IAAY,IAAa,GAAG,KAAa,GAAG,KAAe;IAEpE,IAAM,IAAc,IAAA,GACd,IAAc,IAAc;AAGlC,QAFe,EAAS,GAAa,EAAa,EAEpC;KAGb,IAAM,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa;AAI/C,KAHA,KAAK,0BAA2B,GAAQ,GAAO,IAAa,EAAG,EAG/D,EAAa,IAAK,IAAa,EAAa;WAEtC;KAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa;AAGpD,UAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;MAE9B,IAAM,IAAU,EAAc,IAAO,IAC/B,IAAU,EAAc,IAAO,IAAI,IACnC,IAAW,EAAc,IAAQ,IACjC,IAAW,EAAc,IAAQ,IAAI;AAG3C,MADA,EAAc,IAAc,KAAM,IAAU,IAAW,IAAU,GACjE,EAAc,IAAc,IAAI,KAAM,IAAU,IAAW,IAAU;;;;;;CAiB1E,eAAgB,GAAS;AAYxB,SAVA,EAAO,WAAW,EAEJ,KAAK,OACb,SAAS,MAAU;AAGxB,GADA,EAAY,GAAG,IAAI,aAAc,EAAQ,EAAE,GAAU,EACrD,EAAO,MAAO,GAAU;IAEtB,EAEI;;CAmBR,UAAW,GAAY;EAGtB,IAAI,EACH,wBACA,qBACA,oBACA,wBACA,qBACA,eACG;AAGJ,MAAK,KAAmB,GAAsB;GAE7C,IAAM,IAA0B;AAChC,QAAoB,GAAQ,GAAO,GAAW,GAAO,MAE7C,EAAyB,GAAQ,GAAO,GAAW,GAAO,EAAW,GAMrE,KAJC,EAAS,GAAQ,GAAO,MAAM,GAAqB,GAAW,GAAO,EAAkB;SAoB/F,MAVI,KAEgB,GAAQ,GAAO,GAAW,MAEtC,EAAS,GAAQ,GAAO,MAAM,GAAqB,GAAW,GAAO,EAAkB,IAM3E,GAAQ,GAAO,MAE3B;EASV,IAAI,IAAS,IACT,IAAa,GACX,IAAQ,KAAK;AACnB,OAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,KAAO;GAEhD,IAAM,IAAO,EAAO;AAGpB,OAFA,IAASA,GAAe,MAAM,GAAG,GAAkB,GAAiB,GAAqB,EAAY,EAEhG,EAEJ;AAID,QAAc,EAAK,aAAA;;AAIpB,SAAO;;CAeR,QAAS,GAAU,GAAe,GAAY;EAE7C,IAAI,EAAE,wBAAqB;AAC3B,SAAO,GAAS,MAAM,GAAU,GAAe,EAAkB;;;;;AC5anE,SAAgB,KAA+B;AAE9C,QAAO,OAAO,oBAAsB;;;;ACArC,SAAgB,GAAgB,GAAM;AAErC,QAAO,EAAI,QAAQ,EAAI,MAAM,QAAQ,EAAI,WAAW,SAAS;;AAI9D,SAAgB,GAAa,GAAM;AAElC,QAAO,GAAgB,EAAK,GAAG;;AAIhC,SAAgB,GAAe,GAAa,IAAoB,aAAc;AAQ5E,QANI,IAAc,QAEX,IAAI,YAAa,IAAI,EAAmB,IAAI,EAAa,CAAE,GAI3D,IAAI,YAAa,IAAI,EAAmB,IAAI,EAAa,CAAE;;AAOpE,SAAgB,GAAa,GAAK,GAAU;AAE3C,KAAK,CAAE,EAAI,OAAQ;EAElB,IAAM,IAAc,EAAI,WAAW,SAAS,OAEtC,IAAQ,GAAe,GADH,EAAQ,uBAAuB,oBAAoB,YAChB;AAC7D,IAAI,SAAU,IAAI,EAAiB,GAAO,EAAG,CAAE;AAE/C,OAAM,IAAI,IAAI,GAAG,IAAI,GAAa,IAEjC,GAAO,KAAM;;;AAmBhB,SAAS,GAAuB,GAAK,GAAO,GAAS;CAEpD,IAAM,IAAiB,GAAgB,EAAK,GAAG,GACzC,IAAY,KAAgB,EAAI,WAChC,IAAQ,EAAU,QAAQ,GAC1B,KAAQ,EAAU,QAAQ,EAAU,SAAU,GAE9C,IAAS,KAAK,IAAK,GAAG,EAAO,EAC7B,IAAQ,KAAK,IAAK,GAAgB,EAAK,GAAG;AAChD,QAAO;EACN,QAAQ,KAAK,MAAO,EAAQ;EAC5B,OAAO,KAAK,MAAO,EAAO;EAC1B;;AAIF,SAAS,GAAyB,GAAK,GAAS;AAE/C,QAAO,EAAI,OAAO,KAAK,OAAW;EACjC,QAAQ,EAAM,QAAQ;EACtB,OAAO,EAAM,QAAQ;EACrB,EAAG;;AAML,SAAgB,GAAwB,GAAK,GAAO,GAAS;CAE5D,IAAM,IAAY,GAAuB,GAAK,GAAO,EAAQ,EACvD,IAAkB,GAAyB,GAAK,EAAQ;AAC9D,KAAK,CAAE,EAAgB,OAEtB,QAAO,CAAE,EAAW;CAIrB,IAAM,IAAS,EAAE,EACX,IAAiB,EAAU,QAC3B,IAAe,EAAU,SAAS,EAAU,OAG5C,IAAiB,GAAgB,EAAK,GAAG,GACzC,IAAS,EAAE;AACjB,MAAM,IAAM,KAAS,GAAkB;EAGtC,IAAM,EAAE,WAAQ,aAAU,GACpB,IAAa,GAEb,IAAa,KADA,SAAU,EAAO,GAAG,IAAU,IAAiB;AAIlE,EAAK,IAAa,KAAgB,IAAW,MAE5C,EAAO,KAAM;GAAE,KAAK,KAAK,IAAK,GAAgB,EAAY;GAAE,SAAS;GAAM,CAAE,EAC7E,EAAO,KAAM;GAAE,KAAK,KAAK,IAAK,GAAc,EAAU;GAAE,SAAS;GAAO,CAAE;;AAO5E,GAAO,MAAQ,GAAG,MAEZ,EAAE,QAAQ,EAAE,MAMT,EAAE,SAAS,QAAQ,KAAM,IAJzB,EAAE,MAAM,EAAE,IAQhB;CAGH,IAAI,IAAe,GACf,IAAU;AACd,MAAM,IAAM,KAAS,GAAS;EAE7B,IAAM,IAAS,EAAM;AAWrB,EAVK,MAAiB,KAAK,MAAW,KAErC,EAAO,KAAM;GACZ,QAAQ;GACR,OAAO,IAAS;GAChB,CAAE,EAIJ,KAAgB,EAAM,UAAU,IAAI,IACpC,IAAU;;AAIX,QAAO;;;;ACpJR,SAAgB,GAAwB,GAAQ,GAAuB;CAEtE,IAAM,IAAY,EAAQ,EAAO,SAAS,IACpC,IAAY,EAAU,SAAS,EAAU,QAAQ,KAAK,IAGtD,IAAS,EAAO,QAAU,GAAK,MAAS,IAAM,EAAI,OAAO,EAAG,EAC5D,IAAY,IAAY,IAAI,GAC5B,IAAS,IAAuB,IAAI,kBAAmB,IAAS,EAAW,GAAG,IAAI,YAAa,IAAS,EAAW,EACnH,IAAiB,IAAY,IAAI,YAAa,EAAQ,GAAG,IAAI,YAAa,EAAQ,EAGpF,IAAQ;AACZ,MAAM,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,KAAO;EAE1C,IAAM,EAAE,WAAQ,aAAU,EAAQ;AAClC,OAAM,IAAI,IAAI,GAAG,IAAI,GAAO,IAE3B,GAAgB,IAAQ,KAAM,IAAS;AAIxC,OAAS;;AAIV,QAAO;;AAyBR,IAAa,KAAb,cAAiC,GAAI;CAOpC,IAAI,WAAW;AAEd,SAAO,CAAE,CAAE,KAAK;;CAIjB,IAAI,kBAAkB;AAErB,SAAO;;CAIR,IAAI,wBAAwB;AAE3B,SAAO,KAAK,WAAW,IAAI,KAAK;;CAGjC,IAAI,sBAAuB,GAAI;CAE/B,IAAI,kBAAkB;AAErB,SAAO,KAAK,WAAW,KAAK,kBAAkB,KAAK,SAAS,MAAM;;CAGnE,IAAI,gBAAiB,GAAI;CAEzB,YAAa,GAAU,IAAU,EAAE,EAAG;AAErC,MAAK,CAAE,EAAS,iBAEf,OAAU,MAAO,4CAA6C;MAEnD,EAAS,SAAS,EAAS,MAAM,6BAE5C,OAAU,MAAO,4EAA6E;AAI/F,MAAK,EAAQ,wBAAwB,CAAE,IAA8B,CAEpE,OAAU,MAAO,2CAA4C;AA0B9D,EAtBA,OAAO,EAUP,KAAK,WAAW,GAChB,KAAK,wBAAwB,EAAQ,YAAW,MAAK,KAAK,gBAAiB,MAAM,MAAK,GACtF,KAAK,kBAAkB,MACvB,KAAK,wBAAwB,MAC7B,KAAK,kBAAkB,MAEvB,IAAU;GACT,GAAG;GACH,GAAG;GACH,EAGM,EAAS,MAEf,KAAK,KAAM,EAAS;;CAMtB,KAAM,GAAU;EAEf,IAAM,EAAE,aAAU,uBAAoB;AAiBtC,EAfK,EAAQ,WAKZ,KAAK,kBADkB,GADR,GAAwB,GAAU,EAAQ,OAAO,EAAiB,EAC1B,EAAQ,qBAAsB,GAKrF,GAAa,GAAU,EAAS,EAIjC,MAAM,KAAM,EAAS,EAEhB,CAAE,EAAS,eAAe,EAAQ,mBAEtC,EAAS,cAAc,KAAK,eAAgB,IAAI,GAAM,CAAE;;CAO1D,cAAe,GAAQ;AAUrB,SAPI,KAAK,WAEF,CAAE;GAAE,QAAQ;GAAG,OAAO,KAAK,gBAAgB;GAAQ,CAAE,GAKrD,GAAwB,KAAK,UAAU,GAAO,KAAK,gBAAiB;;CAM7E,kBAA4D;AAE3D,QAAU,MAAO,yCAA0C;;GCxLhD,IAAb,MAAkC;CAEjC,cAAc;AAGb,EADA,KAAK,MAAM,UACX,KAAK,MAAM;;CAIZ,mBAAoB,GAAQ,GAAQ;EAEnC,IAAI,IAAM,UACN,IAAM;AACV,OAAM,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,IAAI,GAAG,KAAO;GAGjD,IAAM,IADI,EAAQ,GACH;AAEf,GADA,IAAM,IAAM,IAAM,IAAM,GACxB,IAAM,IAAM,IAAM,IAAM;;AAKzB,EADA,KAAK,MAAM,GACX,KAAK,MAAM;;CAIZ,cAAe,GAAM,GAAS;EAE7B,IAAI,IAAM,UACN,IAAM;AACV,OAAM,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,IAAI,GAAG,KAAO;GAEjD,IAAM,IAAI,EAAQ,IACZ,IAAM,EAAK,IAAK,EAAG;AAEzB,GADA,IAAM,IAAM,IAAM,IAAM,GACxB,IAAM,IAAM,IAAM,IAAM;;AAKzB,EADA,KAAK,MAAM,GACX,KAAK,MAAM;;CAIZ,YAAa,GAAQ;AAEpB,SAAO,KAAK,MAAM,EAAM,OAAO,EAAM,MAAM,KAAK;;;AAMlD,EAAqB,UAAU,cAAe,WAAY;CAEzD,IAAM,oBAAoB,IAAI,GAAS;AACvC,QAAO,SAAqB,GAAM,GAAM;EAEvC,IAAM,IAAS,EAAI,KACb,IAAS,EAAI,KACf,IAAM,UACN,IAAM;AACV,OAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,KAAO;AAI/B,GAFA,EAAE,IAAI,EAAO,IAAI,IAAI,EAAO,KAAM,IAAI,IACtC,EAAE,IAAI,EAAO,IAAI,IAAI,EAAO,KAAM,IAAI,IACtC,EAAE,IAAI,EAAO,IAAI,IAAI,EAAO,KAAM,IAAI;GAEtC,IAAM,IAAM,EAAK,IAAK,EAAG;AAEzB,GADA,IAAM,KAAK,IAAK,GAAK,EAAK,EAC1B,IAAM,KAAK,IAAK,GAAK,EAAK;;AAS7B,EADA,KAAK,MAAM,GACX,KAAK,MAAM;;IAIR,GAE4B,WAAY;CAE5C,IAAM,oBAAiC,IAAI,GAAsB;AACjE,QAAO,SAA0B,GAAQ,GAAS;EAEjD,IAAM,IAAU,EAAO,QACjB,IAAW,EAAO,SAClB,IAAa,EAAO,WAEpB,IAAU,EAAO,QACjB,IAAW,EAAO,SAClB,IAAa,EAAO;AAG1B,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAY,IACjB,IAAK,EAAU;AAErB,OADA,EAAe,cAAe,GAAI,EAAS,EACtC,EAAG,YAAa,EAAgB,CAAG,QAAO;;AAKhD,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAY,IACjB,IAAK,EAAU;AAErB,OADA,EAAe,cAAe,GAAI,EAAS,EACtC,EAAG,YAAa,EAAgB,CAAG,QAAO;;;IAM7C;;;AC5HL,IAAa,MAA2B,WAAY;CAGnD,IAAM,oBAAuB,IAAI,GAAS,EACpC,oBAAuB,IAAI,GAAS,EACpC,oBAAsB,IAAI,GAAS;AACzC,QAAO,SAAiC,GAAI,GAAI,GAAS;EAExD,IAAM,IAAK,EAAG,OACR,IAAM,GACN,IAAK,EAAG,OACR,IAAM;AAIZ,EAFA,EAAI,WAAY,GAAI,EAAI,EACxB,EAAK,WAAY,EAAG,KAAK,EAAG,MAAO,EACnC,EAAK,WAAY,EAAG,KAAK,EAAG,MAAO;EAGnC,IAAM,IAAQ,EAAI,IAAK,EAAK,EAGtB,IAAQ,EAAI,IAAK,EAAK,EAGtB,IAAQ,EAAI,IAAK,EAAK,EAGtB,IAAQ,EAAI,IAAK,EAAK,EAMtB,IAHQ,EAAI,IAAK,EAAK,GAGN,IAAQ,IAAQ,GAElC,GAAG;AAcP,EAbA,AAEC,IAFI,MAAU,IAMV,KAJE,IAAQ,IAAQ,IAAQ,KAAU,GAQzC,KAAO,IAAQ,IAAI,KAAU,GAE7B,EAAO,IAAI,GACX,EAAO,IAAI;;IAIR,EAEQ,MAAkC,WAAY;CAG1D,IAAM,oBAA8B,IAAI,GAAS,EAC3C,oBAAwB,IAAI,GAAS,EACrC,oBAAwB,IAAI,GAAS;AAC3C,QAAO,SAAwC,GAAI,GAAI,GAAS,GAAU;AAEzE,KAAwB,GAAI,GAAI,EAAa;EAE7C,IAAI,IAAI,EAAY,GAChB,IAAK,EAAY;AACrB,MAAK,KAAK,KAAK,KAAK,KAAK,KAAM,KAAK,KAAM,GAAI;AAG7C,GADA,EAAG,GAAI,GAAG,EAAS,EACnB,EAAG,GAAI,GAAI,EAAS;AAEpB;aAEW,KAAK,KAAK,KAAK,GAAI;AAa9B,GAVK,IAAK,IAET,EAAG,GAAI,GAAG,EAAS,GAInB,EAAG,GAAI,GAAG,EAAS,EAIpB,EAAG,oBAAqB,GAAS,IAAM,EAAS;AAChD;aAEW,KAAM,KAAK,KAAM,GAAI;AAahC,GAVK,IAAI,IAER,EAAG,GAAI,GAAG,EAAS,GAInB,EAAG,GAAI,GAAG,EAAS,EAIpB,EAAG,oBAAqB,GAAS,IAAM,EAAS;AAChD;SAEM;GAGN,IAAI;AACJ,GAMC,IANI,IAAI,IAEJ,EAAG,QAIH,EAAG;GAIR,IAAI;AACJ,GAMC,IANI,IAAK,IAEJ,EAAG,QAIH,EAAG;GAIT,IAAM,IAAe,GACf,IAAgB;AAItB,OAHA,EAAG,oBAAqB,GAAI,IAAM,EAAO,EACzC,EAAG,oBAAqB,GAAG,IAAM,EAAO,EAEnC,EAAa,kBAAmB,EAAI,IAAI,EAAc,kBAAmB,EAAG,EAAG;AAGnF,IADA,EAAQ,KAAM,EAAc,EAC5B,EAAQ,KAAM,EAAI;AAClB;UAEM;AAGN,IADA,EAAQ,KAAM,EAAG,EACjB,EAAQ,KAAM,EAAe;AAC7B;;;;IAQC,EAGQ,MAA4B,WAAY;CAGpD,IAAM,oBAAmC,IAAI,GAAS,EAChD,oBAAqC,IAAI,GAAS,EAClD,oBAA4B,IAAI,GAAO,EACvC,oBAA2B,IAAI,GAAO;AAC5C,QAAO,SAAkC,GAAQ,GAAW;EAE3D,IAAM,EAAE,WAAQ,cAAW,GACrB,EAAE,MAAG,MAAG,SAAM;AAgBpB,MAbA,EAAS,QAAQ,GACjB,EAAS,MAAM,GACO,EAAS,oBAAqB,GAAQ,IAAM,EAAkB,CACjE,WAAY,EAAQ,IAAI,MAE3C,EAAS,QAAQ,GACjB,EAAS,MAAM,GACO,EAAS,oBAAqB,GAAQ,IAAM,EAAkB,CACjE,WAAY,EAAQ,IAAI,OAE3C,EAAS,QAAQ,GACjB,EAAS,MAAM,GACO,EAAS,oBAAqB,GAAQ,IAAM,EAAkB,CACjE,WAAY,EAAQ,IAAI,GAAS,QAAO;EAG3D,IAAM,IAAQ,EAAS,SAAU,EAAW;AAE5C,MADW,KAAK,IAAK,EAAM,gBAAiB,EAAQ,CAAE,IAC3C,GAAS;GAEnB,IAAM,IAAK,EAAM,aAAc,GAAQ,EAAoB;AAE3D,OADW,EAAS,cAAe,EAAI,CAC7B,QAAO;;AAIlB,SAAO;;IAIJ,ECrMC,KAAgB;CAAE;CAAK;CAAK;CAAK,EACjC,IAAe,OACf,KAAmB,IAAe;AACxC,SAAS,EAAY,GAAQ;AAE5B,QAAO,KAAK,IAAK,EAAO,GAAG;;AAU5B,IAAa,IAAb,cAAsC,EAAS;CAE9C,YAAa,GAAG,GAAO;AAmBtB,EAjBA,MAAO,GAAG,EAAM,EAEhB,KAAK,qBAAqB,IAC1B,KAAK,UAAU;;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAS,CAAE,EAC/D,KAAK,YAAY;;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAsB,CAAE,EAC9E,KAAK,SAAS;GAAE,KAAK;GAAG,KAAK;GAAG,KAAK;GAAG,EACxC,KAAK,QAAQ,IAAI,GAAO,EACxB,KAAK,0BAA0B,IAC/B,KAAK,wBAAwB,IAC7B,KAAK,oBAAoB,IAAI,GAAO,EAQpC,KAAK,cAAc;;CASpB,iBAAkB,GAAS;AAE1B,SAAO,GAAyB,GAAQ,KAAM;;CAI/C,SAAS;EAER,IAAM,IAAI,KAAK,GACT,IAAI,KAAK,GACT,IAAI,KAAK,GACT,IAAS,KAAK,QAEd,IAAU,KAAK,SACf,IAAY,KAAK,WAEjB,IAAQ,EAAS,IACjB,IAAO,EAAW;AAExB,EADA,KAAK,UAAW,EAAO,EACvB,EAAK,cAAe,GAAO,EAAQ;EAEnC,IAAM,IAAQ,EAAS,IACjB,IAAO,EAAW;AAExB,EADA,EAAM,WAAY,GAAG,EAAG,EACxB,EAAK,cAAe,GAAO,EAAQ;EAEnC,IAAM,IAAQ,EAAS,IACjB,IAAO,EAAW;AAExB,EADA,EAAM,WAAY,GAAG,EAAG,EACxB,EAAK,cAAe,GAAO,EAAQ;EAEnC,IAAM,IAAQ,EAAS,IACjB,IAAO,EAAW;AAExB,EADA,EAAM,WAAY,GAAG,EAAG,EACxB,EAAK,cAAe,GAAO,EAAQ;EAEnC,IAAM,IAAW,EAAM,QAAQ,EACzB,IAAW,EAAM,QAAQ,EACzB,IAAW,EAAM,QAAQ;AA2C/B,EAzCA,KAAK,wBAAwB,IAC7B,KAAK,0BAA0B,IAE1B,IAAW,IAEV,IAAW,KAAgB,IAAW,IAE1C,KAAK,wBAAwB,MAI7B,KAAK,0BAA0B,IAC/B,KAAK,kBAAkB,MAAM,KAAM,EAAG,EACtC,KAAK,kBAAkB,IAAI,KAAM,EAAG,IAI1B,IAAW,IAEjB,IAAW,IAEf,KAAK,wBAAwB,MAI7B,KAAK,0BAA0B,IAC/B,KAAK,kBAAkB,MAAM,KAAM,EAAG,EACtC,KAAK,kBAAkB,IAAI,KAAM,EAAG,IAI1B,IAAW,MAEtB,KAAK,0BAA0B,IAC/B,KAAK,kBAAkB,MAAM,KAAM,EAAG,EACtC,KAAK,kBAAkB,IAAI,KAAM,EAAG,GAIrC,KAAK,MAAM,8BAA+B,GAAO,EAAG,EAEpD,KAAK,cAAc;;;AAerB,EAAiB,UAAU,yBAA0B,WAAY;CAEhE,IAAM,oBAAyB,IAAI,GAAS,EACtC,oBAAyB,IAAI,GAAS,EACtC,oBAAuB,IAAI,GAAO;AAExC,QAAO,SAA4B,GAAS,IAAU,MAAM,IAAU,MAAO;EAE5E,IAAM,EAAE,UAAO,WAAQ,GACjB,IAAS,KAAK,QAChB,GACA,IAAoB;AAGxB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,KAAU,IAAI,KAAM;AAO1B,GANA,EAAK,MAAM,KAAM,EAAQ,GAAK,EAC9B,EAAK,IAAI,KAAM,EAAQ,GAAS,EAEhC,GAA+B,GAAM,GAAS,GAAQ,EAAQ,EAE9D,IAAS,EAAO,kBAAmB,EAAQ,EACtC,IAAS,MAEb,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAQ;;AA2BvC,SApBA,KAAK,oBAAqB,GAAO,EAAQ,EACzC,IAAS,EAAM,kBAAmB,EAAQ,EACrC,IAAS,MAEb,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAO,GAIrC,KAAK,oBAAqB,GAAK,EAAQ,EACvC,IAAS,EAAI,kBAAmB,EAAQ,EACnC,IAAS,MAEb,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAK,GAI5B,KAAK,KAAM,EAAmB;;IAIlC,EAWL,EAAiB,UAAU,sBAAuB,WAAY;CAE7D,IAAM,oBAAyB,IAAI,GAAkB,EAC/C,oBAAkC,IAAI,GAAsB,EAC5D,oBAAmC,IAAI,GAAsB,EAC7D,oBAAyB,IAAI,GAAS,EACtC,oBAAuB,IAAI,GAAS,EACpC,oBAAuB,IAAI,GAAS,EACpC,oBAA0B,IAAI,GAAS,EACvC,oBAAwB,IAAI,GAAO,EACnC,oBAAwB,IAAI,GAAO,EACnC,oBAA4B,IAAI,GAAS,EACzC,oBAA0B,IAAI,GAAS,EACvC,oBAA0B,IAAI,GAAS;CAE7C,SAAS,EAA4B,GAAM,GAAO,GAAQ,GAAc;EAKvE,IAAM,IAAc;AACpB,EAAK,CAAE,EAAK,yBAAyB,CAAE,EAAK,0BAE3C,EAAY,KAAM,EAAK,MAAM,OAAQ,GAIrC,EAAY,KAAM,EAAM,MAAM,OAAQ;EAIvC,IAAM,IAAa,EAAK,WAClB,IAAW,EAAK;AACtB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAY,IACjB,IAAK,EAAU;AAOrB,OANA,EAAgB,cAAe,GAAI,EAAM,OAAQ,EAC5C,EAAG,YAAa,EAAiB,KAEtC,EAAQ,KAAM,EAAa,CAAC,MAAO,EAAI,EACvC,EAAgB,cAAe,GAAS,EAAK,OAAQ,EACrD,EAAiB,cAAe,GAAS,EAAM,OAAQ,EAClD,EAAgB,YAAa,EAAkB,EAAG,QAAO;;EAI/D,IAAM,IAAa,EAAM,WACnB,IAAW,EAAM;AACvB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAY,IACjB,IAAK,EAAU;AAOrB,OANA,EAAgB,cAAe,GAAI,EAAK,OAAQ,EAC3C,EAAG,YAAa,EAAiB,KAEtC,EAAQ,aAAc,GAAa,EAAI,EACvC,EAAgB,cAAe,GAAS,EAAK,OAAQ,EACrD,EAAiB,cAAe,GAAS,EAAM,OAAQ,EAClD,EAAgB,YAAa,EAAkB,EAAG,QAAO;;AAkB/D,SAdK,MAGG,KAEN,QAAQ,KAAM,8HAA+H,EAI9I,EAAO,MAAM,IAAK,GAAG,GAAG,EAAG,EAC3B,EAAO,IAAI,IAAK,GAAG,GAAG,EAAG,GAInB;;CAIR,SAAS,EAAkB,GAAG,GAAG,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,GAAO;EAE5F,IAAI,IAAI,KAAU,IAAQ;AAM1B,EALA,EAAO,IAAI,KAAU,IAAQ,KAAU,GACvC,EAAK,MAAM,WAAY,GAAG,EAAG,CAAC,eAAgB,EAAG,CAAC,IAAK,EAAG,EAE1D,IAAI,KAAU,IAAQ,IACtB,EAAO,IAAI,KAAU,IAAQ,KAAU,GACvC,EAAK,IAAI,WAAY,GAAG,EAAG,CAAC,eAAgB,EAAG,CAAC,IAAK,EAAG;;CAUzD,SAAS,EAA4B,GAAM,GAAO,GAAO,GAAO,GAAQ,GAAQ,GAAO,GAAO,GAAO,GAAQ,GAAO;AAEnH,MAAK,IAAS,EAGb,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;WAEvF,IAAS,EAEpB,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;WAEvF,IAAQ,IAAQ,KAAK,KAAS,EAEzC,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;WAEvF,KAAS,EAEpB,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;WAEvF,KAAS,EAEpB,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;MAIlG,QAAO;AAIR,SAAO;;CAIR,SAAS,EAA0B,GAAU,GAAoB,GAAQ,GAAc;EAEtF,IAAM,IAAU,EAAmB,mBAC7B,IAAY,EAAS,MAAM,gBAAiB,EAAQ,MAAO,EAC3D,IAAU,EAAS,MAAM,gBAAiB,EAAQ,IAAK;AA+C3D,SA9CG,EAAY,EAAW,GAEtB,EAAY,EAAS,GAElB,EAA4B,GAAU,GAAoB,GAAQ,EAAa,IAKjF,MAEJ,EAAO,MAAM,KAAM,EAAQ,MAAO,EAClC,EAAO,IAAI,KAAM,EAAQ,MAAO,GAI1B,EAAS,cAAe,EAAQ,MAAO,IAIpC,EAAY,EAAS,IAE3B,MAEJ,EAAO,MAAM,KAAM,EAAQ,IAAK,EAChC,EAAO,IAAI,KAAM,EAAQ,IAAK,GAIxB,EAAS,cAAe,EAAQ,IAAK,IAIvC,EAAS,MAAM,cAAe,GAAS,EAAQ,IAAI,OAahD,MAXF,MAEJ,EAAO,MAAM,KAAM,EAAQ,EAC3B,EAAO,IAAI,KAAM,EAAQ,GAInB,EAAS,cAAe,EAAQ;;CAY1C,SAAS,EAAwB,GAAU,GAAoB,GAAS;EAEvE,IAAM,IAAQ,EAAmB;AAehC,SAbI,EAAY,EAAS,MAAM,gBAAiB,EAAO,CAAE,IAAI,EAAS,cAAe,EAAO,IAEvF,MAEJ,EAAO,MAAM,KAAM,EAAO,EAC1B,EAAO,IAAI,KAAM,EAAO,GAIlB,MAIA;;CAMT,SAAS,EAAuB,GAAY,GAAU,GAAS;EAE9D,IAAM,IAAU,EAAW,mBACrB,IAAQ,EAAS;AAiBtB,SAfD,EAAQ,oBAAqB,GAAO,IAAM,EAAQ,EAE7C,EAAM,kBAAmB,EAAQ,GAAG,MAEnC,MAEJ,EAAO,MAAM,KAAM,EAAO,EAC1B,EAAO,IAAI,KAAM,EAAO,GAIlB,MAIA;;CAMT,SAAS,EAAuB,GAAM,GAAO,GAAQ,GAAc;AAElE,MAAK,EAAK,wBAET,KAAK,EAAM,yBAA0B;GAGpC,IAAM,IAAW,EAAK,mBAChB,IAAW,EAAM,mBACjB,IAAS,GACT,IAAS;AAEf,GADA,EAAS,MAAO,EAAQ,EACxB,EAAS,MAAO,EAAQ;GACxB,IAAM,IAAa,EAAO,WAAY,EAAS,OAAO,EAAS,MAAO,EAEhE,IAAQ,EAAO,IAAI,EAAO,IAAI,EAAO,IAAI,EAAO;AACtD,OAAK,EAAY,EAAO,CAEvB,QAAO;GAIR,IAAM,KAAM,EAAW,IAAI,EAAO,IAAI,EAAW,IAAI,EAAO,KAAM,GAC5D,IAAI,EAAI,EAAO,IAAI,EAAW,IAAI,EAAO,IAAI,EAAW,KAAM;AAwBnE,UAtBI,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,IAE5B,KAOH,EAHM,EAAS,MAAM,IAAI,EAAO,IAAI,KAC9B,EAAS,MAAM,IAAI,EAAO,IAAI,GAEf,IAEpB,MAEJ,EAAO,MAAM,KAAM,EAAS,MAAO,CAAC,gBAAiB,GAAQ,EAAG,EAChE,EAAO,IAAI,KAAM,EAAS,MAAO,CAAC,gBAAiB,GAAQ,EAAG,GAIxD,MAIA;aAIG,EAAM,sBAEjB,QAAO,EAAuB,GAAM,GAAO,EAAQ;MAInD,QAAO,EAA0B,GAAO,GAAM,GAAQ,EAAa;WAIzD,EAAK,sBA2Bf,QAzBI,EAAM,wBAEL,EAAM,EAAE,kBAAmB,EAAK,EAAG,GAAG,MAErC,MAEJ,EAAO,MAAM,KAAM,EAAK,EAAG,EAC3B,EAAO,IAAI,KAAM,EAAK,EAAG,GAInB,MAIA,KAIG,EAAM,0BAEV,EAAuB,GAAO,GAAM,EAAQ,GAI5C,EAAwB,GAAO,GAAM,EAAQ;WAMhD,EAAM,sBAEV,QAAO,EAAwB,GAAM,GAAO,EAAQ;WAEzC,EAAM,wBAEjB,QAAO,EAA0B,GAAM,GAAO,GAAQ,EAAa;;AAgBtE,QAAO,SAA6B,GAAO,IAAS,MAAM,IAAc,IAAQ;AAQ/E,EANK,KAAK,eAET,KAAK,QAAQ,EAIP,EAAM,qBAMD,EAAM,eAEjB,EAAM,QAAQ,IANd,EAAO,KAAM,EAAO,EACpB,EAAO,QAAQ,EACf,IAAQ;EAQT,IAAM,IAAM,EAAuB,MAAM,GAAO,GAAQ,EAAa;AACrE,MAAK,MAAQ,KAAA,EAEZ,QAAO;EAIR,IAAM,IAAS,KAAK,OACd,IAAS,EAAM,OAEjB,IAAS,EAAO,gBAAiB,KAAK,EAAG,EACzC,IAAS,EAAO,gBAAiB,KAAK,EAAG,EACzC,IAAS,EAAO,gBAAiB,KAAK,EAAG;AAQ7C,EANK,EAAY,EAAQ,KACxB,IAAS,IAEL,EAAY,EAAQ,KACxB,IAAS,IAEL,EAAY,EAAQ,KACxB,IAAS;EAEV,IAAM,IAAW,IAAS,GACpB,IAAW,IAAS;AAC1B,MAAK,IAAW,KAAK,IAAW,EAE/B,QAAO;EAIR,IAAI,IAAS,EAAO,gBAAiB,EAAM,EAAG,EAC1C,IAAS,EAAO,gBAAiB,EAAM,EAAG,EAC1C,IAAS,EAAO,gBAAiB,EAAM,EAAG;AAQ9C,EANK,EAAY,EAAQ,KACxB,IAAS,IAEL,EAAY,EAAQ,KACxB,IAAS,IAEL,EAAY,EAAQ,KACxB,IAAS;EAEV,IAAM,IAAW,IAAS,GACpB,IAAW,IAAS;AAC1B,MAAK,IAAW,KAAK,IAAW,EAE/B,QAAO;AAKR,EADA,EAAK,KAAM,EAAO,OAAQ,EAC1B,EAAK,KAAM,EAAO,OAAQ;EAC1B,IAAM,IAAmB,EAAK,MAAO,EAAM,EAEvC,IAAiB,GACjB,IAAe,KAAK,IAAK,EAAiB,EAAG,EAC3C,IAAQ,KAAK,IAAK,EAAiB,EAAG;AAS5C,EARK,IAAQ,MAEZ,IAAe,GACf,IAAiB,IAIJ,KAAK,IAAK,EAAiB,EAAG,GAC/B,MAEZ,IAAiB;EAIlB,IAAM,IAAM,GAAe,IACrB,KAAS,KAAK,EAAG,IACjB,IAAS,KAAK,EAAG,IACjB,KAAS,KAAK,EAAG,IAEjB,KAAS,EAAM,EAAG,IAClB,KAAS,EAAM,EAAG,IAClB,KAAS,EAAM,EAAG;AAQxB,MANK,EAA4B,MAAM,IAAQ,GAAQ,IAAQ,GAAU,GAAU,GAAQ,GAAQ,GAAQ,GAAS,EAAO,IAMtH,EAA4B,GAAO,IAAQ,IAAQ,IAAQ,GAAU,GAAU,GAAQ,GAAQ,GAAQ,GAAS,EAAO,CAE3H,QAAO,EAA4B,MAAM,GAAO,GAAQ,EAAa;AAItE,MAAK,EAAQ,IAAI,EAAQ,GAAI;GAE5B,IAAM,IAAM,EAAQ;AAMpB,GALA,EAAQ,IAAI,EAAQ,GACpB,EAAQ,IAAI,GAEZ,EAAU,KAAM,EAAM,MAAO,EAC7B,EAAM,MAAM,KAAM,EAAM,IAAK,EAC7B,EAAM,IAAI,KAAM,EAAW;;AAI5B,MAAK,EAAQ,IAAI,EAAQ,GAAI;GAE5B,IAAM,IAAM,EAAQ;AAMpB,GALA,EAAQ,IAAI,EAAQ,GACpB,EAAQ,IAAI,GAEZ,EAAU,KAAM,EAAM,MAAO,EAC7B,EAAM,MAAM,KAAM,EAAM,IAAK,EAC7B,EAAM,IAAI,KAAM,EAAW;;AAkC5B,SA9BK,EAAQ,IAAI,EAAQ,KAAK,EAAQ,IAAI,EAAQ,IAE1C,MAIH,MAEC,EAAQ,IAAI,EAAQ,IAExB,EAAO,MAAM,KAAM,EAAM,MAAO,GAIhC,EAAO,MAAM,KAAM,EAAM,MAAO,EAI5B,EAAQ,IAAI,EAAQ,IAExB,EAAO,IAAI,KAAM,EAAM,IAAK,GAI5B,EAAO,IAAI,KAAM,EAAM,IAAK,GAMvB;;IAIJ,EASL,EAAiB,UAAU,mBAAoB,WAAY;CAE1D,IAAM,oBAAyB,IAAI,GAAS;AAC5C,QAAO,SAA0B,GAAQ;AAGxC,SADA,KAAK,oBAAqB,GAAO,EAAQ,EAClC,EAAM,WAAY,EAAQ;;IAI9B,EAWL,EAAiB,UAAU,sBAAuB,WAAY;CAE7D,IAAM,oBAAwB,IAAI,GAAS,EACrC,oBAAyB,IAAI,GAAS,EACtC,IAAe;EAAE;EAAK;EAAK;EAAK,EAChC,oBAAwB,IAAI,GAAO,EACnC,oBAAwB,IAAI,GAAO;AAEzC,QAAO,SAA6B,GAAO,IAAU,MAAM,IAAU,MAAO;EAE3E,IAAM,IAAa,KAAW,IAAU,IAAQ;AAKhD,MAAK,KAAK,mBAAoB,GAAO,GAAY,GAAM,CAStD,SAPK,KAAW,OAEV,KAAU,EAAW,UAAW,EAAS,EACzC,KAAU,EAAW,UAAW,EAAS,GAIxC;EAIR,IAAI,IAAoB;AAGxB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAI,GACE,IAAQ,EAAc,IACtB,IAAW,EAAO;AAKxB,GAJA,KAAK,oBAAqB,GAAU,EAAO,EAE3C,IAAO,EAAS,kBAAmB,EAAO,EAErC,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAO,EAC/B,KAAU,EAAQ,KAAM,EAAU;GAKxC,IAAM,IAAU,KAAM;AAKtB,GAJA,EAAM,oBAAqB,GAAS,EAAO,EAE3C,IAAO,EAAQ,kBAAmB,EAAO,EAEpC,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAS,EACjC,KAAU,EAAQ,KAAM,EAAO;;AAMtC,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAM,EAAc,IACpB,IAAM,GAAgB,IAAI,KAAM;AACtC,KAAM,IAAK,KAAM,IAAO,KAAM,GAAO;AACrC,QAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;IAEjC,IAAM,IAAM,EAAc,IACpB,IAAM,GAAgB,IAAK,KAAM;AAGvC,IAFA,EAAM,IAAK,EAAO,IAAO,EAAO,GAAO,EAEvC,GAA+B,GAAO,GAAO,GAAO,EAAQ;IAE5D,IAAM,IAAO,EAAM,kBAAmB,EAAQ;AAC9C,IAAK,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAO,EAC/B,KAAU,EAAQ,KAAM,EAAQ;;;AAQxC,SAAO,KAAK,KAAM,EAAmB;;IAIlC;;;ACp1BL,IAAa,IAAb,MAAyB;CAExB,YAAa,GAAK,GAAK,GAAS;AA8B/B,EA5BA,KAAK,gBAAgB,IAGrB,KAAK,MAAM,IAAI,GAAS,EAGxB,KAAK,MAAM,IAAI,GAAS,EAMxB,KAAK,SAAS,IAAI,GAAS,EAC3B,KAAK,YAAY,IAAI,GAAS,EAC9B,KAAK,SAAa,MAAO,EAAG,CAAC,MAAM,CAAC,UAAW,IAAI,GAAS,CAAE,EAC9D,KAAK,UAAU;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAS,CAAE,EAC/D,KAAK,YAAY;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAsB,CAAE,EAC9E,KAAK,mBAAmB;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAsB,CAAE,EAOrF,KAAK,cAAc,IAEd,KAAM,KAAK,IAAI,KAAM,EAAK,EAC1B,KAAM,KAAK,IAAI,KAAM,EAAK,EAC1B,KAAS,KAAK,OAAO,KAAM,EAAQ;;CAUzC,IAAK,GAAK,GAAK,GAAS;AAKvB,EAHA,KAAK,IAAI,KAAM,EAAK,EACpB,KAAK,IAAI,KAAM,EAAK,EACpB,KAAK,OAAO,KAAM,EAAQ,EAC1B,KAAK,cAAc;;CAIpB,KAAM,GAAQ;AAKb,EAHA,KAAK,IAAI,KAAM,EAAM,IAAK,EAC1B,KAAK,IAAI,KAAM,EAAM,IAAK,EAC1B,KAAK,OAAO,KAAM,EAAM,OAAQ,EAChC,KAAK,cAAc;;;AAMrB,EAAY,UAAU,UAAW,WAAY;AAE5C,QAAO,WAAkB;EAExB,IAAM,IAAS,KAAK,QACd,IAAM,KAAK,KACX,IAAM,KAAK,KAEX,IAAS,KAAK;AACpB,OAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,KAAO;GAG/B,IAAM,IAAI,EADI,IAAW,IAAU,IAAW,IAAU,IAAW;AAMnE,GAJA,EAAE,IAAI,IAAI,EAAI,IAAI,EAAI,GACtB,EAAE,IAAI,IAAI,EAAI,IAAI,EAAI,GACtB,EAAE,IAAI,IAAI,EAAI,IAAI,EAAI,GAEtB,EAAE,aAAc,EAAQ;;EAQ3B,IAAM,IAAY,KAAK,WACjB,IAAU,KAAK,SACf,IAAS,EAAQ;AACvB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAO,EAAS,IAChB,IAAK,EAAW,IAEhB,IAAK,EADG,KAAK;AAInB,GADA,EAAK,WAAY,GAAQ,EAAI,EAC7B,EAAG,cAAe,GAAM,EAAQ;;EAIjC,IAAM,IAAmB,KAAK;AAM9B,EALA,EAAkB,GAAI,mBAAoB,GAAQ,IAAK,EACvD,EAAkB,GAAI,mBAAoB,GAAQ,IAAK,EACvD,EAAkB,GAAI,mBAAoB,GAAQ,IAAK,EAEvD,KAAK,UAAU,KAAM,KAAK,OAAQ,CAAC,QAAQ,EAC3C,KAAK,cAAc;;IAIhB,EAQL,EAAY,UAAU,iBAAkB,WAAY;CAEnD,IAAM,oBAA6B,IAAI,GAAsB;AAC7D,QAAO,SAAwB,GAAM;AAGpC,EAAK,KAAK,eAET,KAAK,QAAQ;EAId,IAAM,IAAM,EAAI,KACV,IAAM,EAAI,KACV,IAAY,KAAK,WACjB,IAAU,KAAK,SACf,IAAmB,KAAK;AAY9B,MAVA,EAAW,MAAM,EAAI,GACrB,EAAW,MAAM,EAAI,GAChB,EAAkB,GAAI,YAAa,EAAY,KAEpD,EAAW,MAAM,EAAI,GACrB,EAAW,MAAM,EAAI,GAChB,EAAkB,GAAI,YAAa,EAAY,MAEpD,EAAW,MAAM,EAAI,GACrB,EAAW,MAAM,EAAI,GAChB,EAAkB,GAAI,YAAa,EAAY,EAAG,QAAO;AAE9D,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAO,EAAS,IAChB,IAAK,EAAW;AAEtB,OADA,EAAW,WAAY,GAAM,EAAK,EAC7B,EAAG,YAAa,EAAY,CAAG,QAAO;;AAI5C,SAAO;;IAIJ,EAQL,EAAY,UAAU,sBAAuB,WAAY;CAExD,IAAM,oBAAwB,IAAI,GAAkB,EAC9C,IAA4B;;;;EAAc,EAC1C,oBAAkC,IAAI,GAAsB,EAC5D,oBAAmC,IAAI,GAAsB,EAC7D,oBAA6B,IAAI,GAAS;AAChD,QAAO,SAA6B,GAAW;AAQ9C,EANK,KAAK,eAET,KAAK,QAAQ,EAIP,EAAS,qBAMJ,EAAS,eAEpB,EAAS,QAAQ,IANjB,EAAM,KAAM,EAAU,EACtB,EAAM,QAAQ,EACd,IAAW;EAQZ,IAAM,IAAY,KAAK,WACjB,IAAU,KAAK;AAIrB,EAFA,EAAW,KAAM,EAAS,GAC1B,EAAW,KAAM,EAAS,GAC1B,EAAW,KAAM,EAAS;AAE1B,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAW,IAChB,IAAK,EAAS;AAEpB,OADA,EAAgB,cAAe,GAAI,EAAW,EACzC,EAAG,YAAa,EAAiB,CAAG,QAAO;;EAIjD,IAAM,IAAe,EAAS,WACxB,IAAa,EAAS,SACtB,IAAS,KAAK;AACpB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAc,IACnB,IAAK,EAAY;AAEvB,OADA,EAAgB,cAAe,GAAI,EAAQ,EACtC,EAAG,YAAa,EAAiB,CAAG,QAAO;;AAKjD,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAM,EAAS;AACrB,QAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;IAEjC,IAAM,IAAM,EAAY;AAIxB,QAHA,EAAW,aAAc,GAAK,EAAK,EACnC,EAAgB,cAAe,GAAY,EAAW,EACtD,EAAiB,cAAe,GAAY,EAAQ,EAC/C,EAAgB,YAAa,EAAkB,CAAG,QAAO;;;AAMhE,SAAO;;IAIJ,EAUL,EAAY,UAAU,uBAAwB,WAAY;AAEzD,QAAO,SAA8B,GAAO,GAAU;AAcrD,SAZK,KAAK,eAET,KAAK,QAAQ,EAId,EACE,KAAM,EAAO,CACb,aAAc,KAAK,UAAW,CAC9B,MAAO,KAAK,KAAK,KAAK,IAAK,CAC3B,aAAc,KAAK,OAAQ,EAEtB;;IAIJ,EAQL,EAAY,UAAU,mBAAoB,WAAY;CAErD,IAAM,IAAS,IAAI,GAAS;AAC5B,QAAO,SAA0B,GAAQ;AAGxC,SADA,KAAK,oBAAqB,GAAO,EAAQ,EAClC,EAAM,WAAY,EAAQ;;IAI9B,EAaL,EAAY,UAAU,iBAAkB,WAAY;CAEnD,IAAM,IAAY;EAAE;EAAK;EAAK;EAAK,EAC7B,IAA4B,gBAAI,MAAO,GAAI,CAAC,MAAM,CAAC,UAAW,IAAI,GAAO,CAAE,EAC3E,IAA4B,gBAAI,MAAO,GAAI,CAAC,MAAM,CAAC,UAAW,IAAI,GAAO,CAAE,EAE3E,oBAAyB,IAAI,GAAS,EACtC,oBAAyB,IAAI,GAAS;AAG5C,QAAO,SAAwB,GAAK,IAAY,GAAG,IAAU,MAAM,IAAU,MAAO;AAQnF,MANK,KAAK,eAET,KAAK,QAAQ,EAIT,KAAK,cAAe,EAAK,CAa7B,SAXK,KAAW,OAEf,EAAI,UAAW,EAAQ,EACvB,KAAK,oBAAqB,GAAQ,EAAQ,EAC1C,EAAI,oBAAqB,GAAQ,EAAQ,EAEpC,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAQ,GAI/B;EAIR,IAAM,IAAa,IAAY,GACzB,IAAM,EAAI,KACV,IAAM,EAAI,KACV,IAAS,KAAK,QAIhB,IAAoB;AAGxB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAI,EAAQ;AAClB,KAAO,KAAM,EAAG,CAAC,MAAO,GAAK,EAAK;GAElC,IAAM,IAAO,EAAE,kBAAmB,EAAQ;AAC1C,OAAK,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAG,EAC3B,KAAU,EAAQ,KAAM,EAAQ,EAEhC,IAAO,GAAa,QAAO,KAAK,KAAM,EAAM;;EAOnD,IAAI,IAAQ;AACZ,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IAEvB,MAAM,IAAI,IAAK,GAAG,KAAM,GAAG,IAE1B,MAAM,IAAI,IAAK,GAAG,KAAM,GAAG,KAAQ;GAElC,IAAM,KAAc,IAAI,KAAM,GACxB,KAAe,IAAI,KAAM,GAGzB,IAAQ,KAAM,IAAY,KAAM,GAChC,IAAS,KAAK,IAAI,KAAM,IAAY,KAAM,GAC1C,IAAK,EAAQ,IACb,IAAK,EAAQ;AACL,KAAW,GACnB,IAAK,GAAI,EAAI;GAInB,IAAM,IAAK,EAAW,IAChB,IAAK,EAAW,IAChB,IAAK,EAAW,IAChB,IAAQ,EAAW,IACnB,IAAQ,EAAM,OACd,IAAM,EAAM;AAUlB,GARA,EAAO,KAAO,EAAK,IACnB,EAAO,KAAO,IAAK,EAAK,KAAO,EAAK,IACpC,EAAO,KAAO,IAAK,EAAK,KAAO,EAAK,IAEpC,EAAK,KAAO,EAAK,IACjB,EAAK,KAAO,IAAK,EAAK,KAAO,EAAK,IAClC,EAAK,KAAO,IAAK,EAAK,KAAO,EAAK,IAElC;;AASH,OAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,KAAO;AAM/B,GAJA,EAAO,IAAI,IAAI,EAAI,IAAI,EAAI,GAC3B,EAAO,IAAI,IAAI,EAAI,IAAI,EAAI,GAC3B,EAAO,IAAI,IAAI,EAAI,IAAI,EAAI,GAE3B,KAAK,oBAAqB,GAAQ,EAAQ;GAC1C,IAAM,IAAO,EAAO,kBAAmB,EAAQ;AAC/C,OAAK,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAQ,EAEhC,IAAO,GAAa,QAAO,KAAK,KAAM,EAAM;;AAUrD,OAAM,IAAI,IAAI,GAAG,IAAI,IAAI,KAAO;GAE/B,IAAM,IAAK,EAAW;AACtB,QAAM,IAAI,IAAK,GAAG,IAAK,IAAI,KAAQ;IAElC,IAAM,IAAK,EAAW;AACtB,OAA+B,GAAI,GAAI,GAAQ,EAAQ;IACvD,IAAM,IAAO,EAAO,kBAAmB,EAAQ;AAC/C,QAAK,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAQ,EAEhC,IAAO,GAAa,QAAO,KAAK,KAAM,EAAM;;;AAQpD,SAAO,KAAK,KAAM,EAAmB;;IAIlC;AC3dL,IAAa,oBAAuC,IAVpD,cAAuC,GAAc;CAEpD,cAAc;AAEb,cAAa,IAAI,GAAkB,CAAE;;GAM2C,ECX5E,qBAAuB,IAAI,GAAS,EACpCC,qBAAwB,IAAI,GAAS;AAE3C,SAAgB,GACf,GACA,GACA,IAAS,EAAG,EACZ,IAAe,GACf,IAAe,UACd;CAMD,IAAM,IAAiB,IAAe,GAChC,IAAiB,IAAe,GAClC,IAAoB,UACpB,IAA0B;AA8C9B,KA7CA,EAAI,UAEH;EAEC,sBAAqB,OAEpB,GAAK,KAAM,EAAO,CAAC,MAAO,EAAI,KAAK,EAAI,IAAK,EACrC,GAAK,kBAAmB,EAAO;EAIvC,mBAAoB,GAAK,GAAQ,MAEzB,IAAQ,KAAqB,IAAQ;EAI7C,qBAAsB,GAAK,MAAc;AAExC,KAAI,oBAAqB,GAAO,GAAM;GACtC,IAAM,IAAS,EAAM,kBAAmB,GAAM;AAe7C,UAdI,IAAS,MAEb,GAAM,KAAM,GAAM,EAClB,IAAoB,GACpB,IAA0B,IAItB,IAAS;;EAYf,CAED,EAEI,MAAsB,SAAW,QAAO;CAE7C,IAAM,IAAkB,KAAK,KAAM,EAAmB;AAOtD,QALO,EAAO,QACT,EAAO,MAAM,KAAMA,GAAO,GADT,EAAO,QAAQA,GAAM,OAAO,EAElD,EAAO,WAAW,GAClB,EAAO,YAAY,GAEZ;;;;ACzER,IAAMC,KAAqB,IACrBC,KAAqB,IAIrB,oBAAsB,IAAI,GAAS,EACnC,oBAAsB,IAAI,GAAS,EACnC,oBAAsB,IAAI,GAAS,EAEnCC,qBAAuB,IAAI,GAAS,EACpCC,qBAAuB,IAAI,GAAS,EACpCC,qBAAuB,IAAI,GAAS,EAEpCC,qBAA2B,IAAI,GAAS,EACxCC,qBAA2B,IAAI,GAAS,EACxCC,qBAA2B,IAAI,GAAS,EAExC,qBAAqC,IAAI,GAAS;AACxD,SAAS,GAAmB,GAAK,GAAI,GAAI,GAAI,GAAO,GAAM,GAAM,GAAM;CAErE,IAAI;AAWJ,KAVA,AAMC,IANI,MAAA,IAEQ,EAAI,kBAAmB,GAAI,GAAI,GAAI,IAAM,EAAO,GAIhD,EAAI,kBAAmB,GAAI,GAAI,GAAI,MAAA,GAAqB,EAAO,EAIvE,MAAc,KAAO,QAAO;CAEjC,IAAM,IAAW,EAAI,OAAO,WAAY,EAAO;AAI/C,QAFK,IAAW,KAAQ,IAAW,IAAa,OAEzC;EAEI;EACV,OAAO,EAAM,OAAO;EAEpB;;AAIF,SAAS,GAAiC,GAAK,GAAU,GAAQ,GAAI,GAAK,GAAG,GAAG,GAAG,GAAM,GAAM,GAAM;AAIpG,CAFA,EAAI,oBAAqB,GAAU,EAAG,EACtC,EAAI,oBAAqB,GAAU,EAAG,EACtC,EAAI,oBAAqB,GAAU,EAAG;CAEtC,IAAM,IAAe,GAAmB,GAAK,GAAK,GAAK,GAAK,IAAoB,GAAM,GAAM,EAAK;AAEjG,KAAK,GAAe;AAEnB,MAAK,GAAK;AAMT,GAJA,GAAK,oBAAqB,GAAI,EAAG,EACjC,GAAK,oBAAqB,GAAI,EAAG,EACjC,GAAK,oBAAqB,GAAI,EAAG,EAEjC,EAAa,KAAK,IAAI,GAAS;GAC/B,IAAM,IAAM,EAAS,iBAAkB,IAAoB,GAAK,GAAK,GAAKL,IAAMC,IAAMC,IAAM,EAAa,GAAI;AAC7G,GAAOJ,OAEN,EAAa,KAAK;;AAMpB,MAAK,GAAM;AAMV,GAJA,GAAK,oBAAqB,GAAK,EAAG,EAClC,GAAK,oBAAqB,GAAK,EAAG,EAClC,GAAK,oBAAqB,GAAK,EAAG,EAElC,EAAa,MAAM,IAAI,GAAS;GAChC,IAAM,IAAM,EAAS,iBAAkB,IAAoB,GAAK,GAAK,GAAKE,IAAMC,IAAMC,IAAM,EAAa,IAAK;AAO9G,GANOJ,OAEN,EAAa,MAAM,IAIfC,OAEJ,EAAa,MAAM,EAAa;;AAMlC,MAAK,GAAS;AAMb,GAJA,GAAS,oBAAqB,GAAQ,EAAG,EACzC,GAAS,oBAAqB,GAAQ,EAAG,EACzC,GAAS,oBAAqB,GAAQ,EAAG,EAEzC,EAAa,SAAS,IAAI,GAAS;GACnC,IAAM,IAAM,EAAS,iBAAkB,IAAoB,GAAK,GAAK,GAAKI,IAAUC,IAAUC,IAAU,EAAa,OAAQ;AAO7H,GANK,EAAa,OAAO,IAAK,EAAI,UAAW,GAAG,KAE/C,EAAa,OAAO,eAAgB,GAAK,EAInCP,OAEN,EAAa,SAAS;;EAMxB,IAAM,IAAO;GACT;GACA;GACA;GACH,QAAQ,IAAI,GAAS;GACrB,eAAe;GACf;AAOD,MALA,EAAS,UAAW,GAAK,GAAK,GAAK,EAAK,OAAQ,EAEhD,EAAa,OAAO,GACpB,EAAa,YAAY,GAEpBA,IAAqB;GAEzB,IAAM,IAAY,IAAI,GAAS;AAG/B,GAFA,EAAS,aAAc,IAAoB,GAAK,GAAK,GAAK,EAAW,EAErE,EAAa,YAAY;;;AAM3B,QAAO;;AAIR,SAAS,GAAS,GAAiB;AAElC,QAAO,KAAkB,EAAe,aAAa,EAAe,OAAO;;AAK5E,SAAgB,GAAc,GAAU,GAAgB,GAAK,GAAK,GAAe,GAAM,GAAM;CAE5F,IAAM,IAAY,IAAM,GACpB,IAAI,IAAY,GAChB,IAAI,IAAY,GAChB,IAAI,IAAY,GAEd,EAAE,UAAO,cAAW;AAC1B,CAAK,EAAS,UAEb,IAAI,EAAM,KAAM,EAAG,EACnB,IAAI,EAAM,KAAM,EAAG,EACnB,IAAI,EAAM,KAAM,EAAG;CAIpB,IAAM,EAAE,aAAU,WAAQ,OAAI,WAAQ,EAAS;AAC/C,KAAK,MAAM,QAAS,EAAgB,EAAG;EAItC,IAAM,IAAa,IAAM;AACzB,OAAM,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,IAAI,GAAG,KAAO;GAEjD,IAAM,EAAE,UAAO,UAAO,qBAAkB,EAAQ;AAChD,OAAK,KAAc,KAAS,IAAa,IAAQ,GAAQ;IAExD,IAAM,IAAO,GAAS,EAAgB,GAAiB,EACjD,IAAe,GAAiC,GAAK,GAAU,GAAQ,GAAI,GAAK,GAAG,GAAG,GAAG,GAAM,GAAM,EAAK;AAChH,QAAK,EAKJ,KAHA,EAAa,YAAY,GACzB,EAAa,KAAK,gBAAgB,GAE7B,EAEJ,GAAc,KAAM,EAAc;QAIlC,QAAO;;;QAUL;EAGN,IAAM,IAAO,GAAS,EAAgB,EAChC,IAAe,GAAiC,GAAK,GAAU,GAAQ,GAAI,GAAK,GAAG,GAAG,GAAG,GAAM,GAAM,EAAK;AAChH,MAAK,EAKJ,KAHA,EAAa,YAAY,GACzB,EAAa,KAAK,gBAAgB,GAE7B,EAEJ,GAAc,KAAM,EAAc;MAIlC,QAAO;;AAQV,QAAO;;;;AC/NR,SAAgB,EAAa,GAAK,GAAG,GAAO,GAAM;CAEjD,IAAM,IAAK,EAAI,GACT,IAAK,EAAI,GACT,IAAK,EAAI,GAEX,IAAK,GACL,IAAK,IAAI,GACT,IAAK,IAAI;AAmBb,CAlBK,MAEJ,IAAK,EAAM,KAAM,EAAI,EACrB,IAAK,EAAM,KAAM,EAAI,EACrB,IAAK,EAAM,KAAM,EAAI,GAItB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EAErB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EAErB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI;;;;ACxBtB,SAAS,GAAe,GAAK,GAAgB,GAAK,GAAQ,GAAO,GAAe,GAAM,GAAM;CAE3F,IAAM,EAAE,aAAU,uBAAoB;AACtC,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,IAGpD,IAAc,GAAU,GAAgB,GAAK,GAAG,GAAe,GAAM,EAAK;;AAO5E,SAAS,GAAqB,GAAK,GAAgB,GAAK,GAAQ,GAAO,GAAM,GAAM;CAElF,IAAM,EAAE,aAAU,uBAAoB,GAClC,IAAO,UACP,IAAM;AACV,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,KAAO;EAE3D,IAAI;AAKJ,EAHA,IAAe,GAAc,GAAU,GAAgB,GAAK,GAAG,MAAM,GAAM,EAAK,EAG3E,KAAgB,EAAa,WAAW,MAE5C,IAAM,GACN,IAAO,EAAa;;AAMtB,QAAO;;AAIR,SAASQ,GACR,GACA,GACA,GACA,GACA,GACA,GACA,GACC;CAED,IAAM,EAAE,gBAAa,GACf,EAAE,aAAU,GACZ,IAAM,EAAS,WAAW;AAChC,MAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;EAEvD,IAAI;AAOJ,MALA,IAAM,GAEN,EAAa,GAAU,IAAM,GAAG,GAAO,EAAK,EAC5C,EAAS,cAAc,IAElB,EAAwB,GAAU,GAAK,GAAW,EAAO,CAE7D,QAAO;;AAMT,QAAO;;;;ACpER,SAAS,GAAO,GAAK,IAAc,MAAO;AAEzC,CAAK,KAAe,MAAM,QAAS,EAAa,KAE/C,IAAc,IAAI,IAAK,EAAa;CAIrC,IAAM,IAAW,EAAI,UACf,IAAW,EAAS,QAAQ,EAAS,MAAM,QAAQ,MACnD,IAAU,EAAS,WAAW,UAEhC,GAAQ,GAAa,GAAa,GAClC,IAAa,GACX,IAAQ,EAAI;AAClB,MAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,IAQzC,CANA,IAAS,EAAO,IAChB,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAe,IAAI,aAAc,EAAQ,EAEzC,EAAW,GAAG,EAAY,EAC1B,KAAc,EAAO;CAItB,SAAS,EAAW,GAAa,GAAY,IAAQ,IAAQ;EAE5D,IAAM,IAAc,IAAc;AAClC,MAAK,EAAS,GAAa,EAAa,EAAG;GAE1C,IAAM,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa,EAE3C,IAAO,UACP,IAAO,UACP,IAAO,UACP,IAAO,WACP,IAAO,WACP,IAAO;AAGX,QAAM,IAAI,IAAI,IAAI,GAAQ,IAAI,KAAM,IAAS,IAAS,IAAI,GAAG,KAAO;IAEnE,IAAI,IAAQ,EAAU,IAChB,IAAI,EAAQ,KAAM,EAAO,EACzB,IAAI,EAAQ,KAAM,EAAO,EACzB,IAAI,EAAQ,KAAM,EAAO;AAS/B,IAPK,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO,IAElB,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO,IAElB,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO;;AA2BvB,UArBA,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KAEpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KAGpC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAElC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAE3B,MAIA;SAIF;GAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa,EAIhD,IAAgB,GAChB,IAAe,IACf,IAAgB;AAEpB,OAAK;QAIC,CAAE,GAAgB;KAEtB,IAAM,IAAa,IAAA,IAAyB,IAAA,IACtC,IAAc,IAAA,IAA0B,IAAA;AAG9C,KAFA,IAAe,EAAY,IAAK,EAAY,EAC5C,IAAgB,EAAY,IAAK,EAAa,EAC9C,IAAgB,CAAE,KAAgB,CAAE;;SAOrC,CADA,IAAe,IACf,IAAgB;GAIjB,IAAM,IAAe,KAAiB,GAChC,IAAgB,KAAiB,GAEnC,IAAa;AACjB,GAAK,MAEJ,IAAa,EAAW,GAAM,GAAY,EAAe;GAI1D,IAAI,IAAc;AAClB,GAAK,MAEJ,IAAc,EAAW,GAAO,GAAY,EAAe;GAI5D,IAAM,IAAY,KAAc;AAChC,OAAK,EAEJ,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;IAE9B,IAAM,IAAS,IAAO,GAChB,IAAU,IAAQ,GAClB,IAAe,EAAc,IAC7B,IAAe,EAAc,IAAS,IACtC,IAAgB,EAAc,IAC9B,IAAgB,EAAc,IAAU;AAG9C,IADA,EAAc,IAAc,KAAM,IAAe,IAAgB,IAAe,GAChF,EAAc,IAAc,IAAI,KAAM,IAAe,IAAgB,IAAe;;AAMtF,UAAO;;;;;;AClKV,SAAgB,EAAsB,GAAa,GAAO,GAAK,GAAM,GAAM;CAK1E,IAAI,GAAM,GAAM,GAAO,GAAO,GAAO,GAE/B,IAAU,IAAI,EAAI,UAAU,GACjC,IAAU,IAAI,EAAI,UAAU,GAC5B,IAAU,IAAI,EAAI,UAAU,GAEvB,IAAK,EAAI,OAAO,GAChB,IAAK,EAAI,OAAO,GAChB,IAAK,EAAI,OAAO,GAElB,IAAO,EAAO,IACd,IAAO,EAAO,IAAc,IAE5B,IAAO,EAAO,IAAc,IAC5B,IAAO,EAAO,IAAc,IAAI,IAEhC,IAAO,EAAO,IAAc,IAC5B,IAAO,EAAO,IAAc,IAAI;AAoDpC,QAlDK,KAAW,KAEf,KAAS,IAAO,KAAO,GACvB,KAAS,IAAO,KAAO,MAIvB,KAAS,IAAO,KAAO,GACvB,KAAS,IAAO,KAAO,IAInB,KAAW,KAEf,KAAU,IAAO,KAAO,GACxB,KAAU,IAAO,KAAO,MAIxB,KAAU,IAAO,KAAO,GACxB,KAAU,IAAO,KAAO,IAIlB,IAAO,KAAa,IAAQ,OAE9B,IAAQ,KAAQ,MAAO,EAAM,MAAG,IAAO,KAEvC,IAAQ,KAAQ,MAAO,EAAM,MAAG,IAAO,IAEvC,KAAW,KAEf,KAAU,IAAO,KAAO,GACxB,KAAU,IAAO,KAAO,MAIxB,KAAU,IAAO,KAAO,GACxB,KAAU,IAAO,KAAO,IAIlB,IAAO,KAAa,IAAQ,KAAgB,OAE9C,IAAQ,KAAQ,MAAS,OAAO,IAAO,KAEvC,IAAQ,KAAQ,MAAS,OAAO,IAAO,IAIrC,KAAQ,KAAO,KAAQ;;;;ACpE/B,SAAS,GAAwB,GAAK,GAAgB,GAAK,GAAQ,GAAO,GAAe,GAAM,GAAM;CAEpG,IAAM,EAAE,aAAU,uBAAoB;AACtC,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,IAGpD,IAAc,GAAU,GAAgB,GAD/B,IAAkB,EAAiB,KAAM,GACD,GAAe,GAAM,EAAK;;AAO7E,SAAS,GAA8B,GAAK,GAAgB,GAAK,GAAQ,GAAO,GAAM,GAAM;CAE3F,IAAM,EAAE,aAAU,uBAAoB,GAClC,IAAO,UACP,IAAM;AACV,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,KAAO;EAE3D,IAAI;AAIJ,EAHA,IAAe,GAAc,GAAU,GAAgB,GAAK,IAAkB,EAAiB,KAAM,GAAG,MAAM,GAAM,EAAK,EAGpH,KAAgB,EAAa,WAAW,MAE5C,IAAM,GACN,IAAO,EAAa;;AAMtB,QAAO;;AAIR,SAAS,GACR,GACA,GACA,GACA,GACA,GACA,GACA,GACC;CAED,IAAM,EAAE,gBAAa,GACf,EAAE,aAAU,GACZ,IAAM,EAAS,WAAW;AAChC,MAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;EAEvD,IAAI;AAMJ,MALA,IAAM,EAAI,qBAAsB,EAAG,EAEnC,EAAa,GAAU,IAAM,GAAG,GAAO,EAAK,EAC5C,EAAS,cAAc,IAElB,EAAwB,GAAU,GAAK,GAAW,EAAO,CAE7D,QAAO;;AAMT,QAAO;;;;AC/DR,SAAS,GAAS,GAAK,GAAM,GAAgB,GAAK,GAAY,GAAM,GAAM;AAIzE,CAFA,EAAY,UAAW,EAAI,OAAQ,GAAQ,EAC3C,GAAU,GAAG,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK,EAC9D,EAAY,aAAa;;AAI1B,SAASC,GAAU,GAAa,GAAK,GAAgB,GAAK,GAAY,GAAM,GAAM;CAEjF,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC7C,IAAc,IAAc;AAElC,KADe,EAAS,GAAa,EAAa,CAOjD,IAAe,GAAK,GAAgB,GAJrB,EAAQ,GAAa,EAAa,EACnC,EAAO,GAAa,EAAa,EAGS,GAAY,GAAM,EAAK;MAGzE;EAEN,IAAM,IAAY,EAAW,EAAa;AAC1C,EAAK,EAAsB,GAAW,GAAc,GAAK,GAAM,EAAK,IAEnE,GAAU,GAAW,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK;EAIvE,IAAM,IAAa,EAAY,GAAa,EAAa;AACzD,EAAK,EAAsB,GAAY,GAAc,GAAK,GAAM,EAAK,IAEpE,GAAU,GAAY,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK;;;;;AClC1E,IAAMC,KAAa;CAAE;CAAK;CAAK;CAAK;AAEpC,SAAS,GAAc,GAAK,GAAM,GAAgB,GAAK,GAAM,GAAM;AAElE,GAAY,UAAW,EAAI,OAAQ,GAAQ;CAC3C,IAAM,IAASC,GAAe,GAAG,GAAK,GAAgB,GAAK,GAAM,EAAK;AAGtE,QAFA,EAAY,aAAa,EAElB;;AAIR,SAASA,GAAe,GAAa,GAAK,GAAgB,GAAK,GAAM,GAAM;CAE1E,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAGhC,KADe,EAAS,GAAa,EAAa,CAQjD,QAAO,GAAqB,GAAK,GAAgB,GALlC,EAAQ,GAAa,EAAa,EACnC,EAAO,GAAa,EAAa,EAIsB,GAAM,EAAK;CAG1E;EAIN,IAAM,IAAY,EAAY,GAAa,EAAa,EAClD,IAAUD,GAAY,IAEtB,IADS,EAAI,UAAW,MACA,GAG1B,GAAI;AACR,EAAK,KAEJ,IAAK,EAAW,EAAa,EAC7B,IAAK,EAAY,GAAa,EAAa,KAI3C,IAAK,EAAY,GAAa,EAAa,EAC3C,IAAK,EAAW,EAAa;EAK9B,IAAM,IADiB,EAAsB,GAAI,GAAc,GAAK,GAAM,EAAK,GAC7CC,GAAe,GAAI,GAAK,GAAgB,GAAK,GAAM,EAAK,GAAG;AAI7F,MAAK,GAAW;GAIf,IAAM,IAAQ,EAAS,MAAO;AAK9B,OAJkB,IACjB,KAAS,EAAc,IAAK,KAC5B,KAAS,EAAc,IAAK,IAAY,GAIxC,QAAO;;EAST,IAAM,IADiB,EAAsB,GAAI,GAAc,GAAK,GAAM,EAAK,GAC7CA,GAAe,GAAI,GAAK,GAAgB,GAAK,GAAM,EAAK,GAAG;AAQ5F,SANI,KAAY,IAET,EAAS,YAAY,EAAS,WAAW,IAAW,IAIpD,KAAY,KAAY;;;;;AChFlC,IAAMC,qBAA8B,IAAI,GAAM,EACxCC,qBAA2B,IAAI,GAAkB,EACjDC,qBAA4B,IAAI,GAAkB,EAClDC,qBAA8B,IAAI,GAAS,EAE3CC,qBAAsB,IAAI,GAAa,EACvCC,qBAAuB,IAAI,GAAa;AAE9C,SAAS,GAAoB,GAAK,GAAM,GAAe,GAAgB;AAEtE,GAAY,UAAW,EAAI,OAAQ,GAAQ;CAC3C,IAAM,IAASC,GAAqB,GAAG,GAAK,GAAe,EAAe;AAG1E,QAFA,EAAY,aAAa,EAElB;;AAIR,SAASA,GAAqB,GAAa,GAAK,GAAe,GAAe,IAAY,MAAO;CAEhG,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAgBhC,KAdK,MAAc,SAEX,EAAc,eAEpB,EAAc,oBAAoB,EAInC,GAAI,IAAK,EAAc,YAAY,KAAK,EAAc,YAAY,KAAK,EAAe,EACtF,IAAYF,KAIE,EAAS,GAAa,EAAa,EACpC;EAEb,IAAM,IAAe,EAAI,UACnB,IAAY,EAAa,OACzB,IAAU,EAAa,WAAW,UAElC,IAAa,EAAc,OAC3B,IAAW,EAAc,WAAW,UAEpC,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa;AAO/C,MAFA,GAAY,KAAM,EAAe,CAAC,QAAQ,EAErC,EAAc,WAwClB,QArCA,EAAY,EAAqB,EAAa,EAAE,GAAcC,GAAM,EACpE,GAAK,OAAO,KAAMF,GAAa,EAC/B,GAAK,cAAc,IAGP,EAAc,WAAW,UAAW;GAE/C,mBAAkB,MAAOE,GAAK,cAAe,EAAK;GAElD,qBAAoB,MAAO;AAK1B,IAHA,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,cAAc;AAGlB,SAAM,IAAI,IAAI,IAAS,GAAG,KAAM,IAAQ,KAAW,GAAG,IAAI,GAAG,KAAK,EAKjE,KAFA,EAAaH,IAAW,GAAG,GAAW,EAAS,EAC/C,GAAU,cAAc,IACnB,EAAI,mBAAoBA,GAAW,CAEvC,QAAO;AAOT,WAAO;;GAIR,CAAE;EAIG;GAGN,IAAM,IAAqB,GAAa,EAAe;AAGvD,QAAM,IAAI,IAAI,IAAS,GAAG,KAAM,IAAQ,KAAW,GAAG,IAAI,GAAG,KAAK,GAAI;AASrE,IANA,EAAaD,IAAU,GAAG,GAAW,EAAS,EAG9C,GAAS,EAAE,aAAcE,GAAa,EACtC,GAAS,EAAE,aAAcA,GAAa,EACtC,GAAS,EAAE,aAAcA,GAAa,EACtC,GAAS,cAAc;AAEvB,SAAM,IAAI,IAAK,GAAG,IAAK,IAAqB,GAAG,IAAK,GAAI,KAAM,EAK7D,KAHA,EAAaD,IAAW,GAAI,GAAY,EAAU,EAClD,GAAU,cAAc,IAEnBD,GAAS,mBAAoBC,GAAW,CAE5C,QAAO;;;QAYL;EAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa;AAgBpD,SAdA,EAAY,EAAqB,EAAM,EAAE,GAAcF,GAAa,EAYpE,GAVC,EAAU,cAAeA,GAAa,IACtCM,GAAqB,GAAM,GAAK,GAAe,GAAe,EAAW,KAI1E,EAAY,EAAqB,EAAO,EAAE,GAAcN,GAAa,EAEpE,EAAU,cAAeA,GAAa,IACtCM,GAAqB,GAAO,GAAK,GAAe,GAAe,EAAW;;;;;ACvJ7E,IAAMC,qBAA6B,IAAI,GAAS,EAC1CC,qBAAsB,IAAI,GAAa,EACvCC,qBAAuB,IAAI,GAAa,EACxCC,qBAAwB,IAAI,GAAS,EACrCC,qBAAwB,IAAI,GAAS,EACrCC,qBAAwB,IAAI,GAAS,EACrCC,qBAAwB,IAAI,GAAS;AAE3C,SAAS,GACR,GACA,GACA,GACA,IAAU,EAAG,EACb,IAAU,EAAG,EACb,IAAe,GACf,IAAe,UACd;AASD,CAPO,EAAc,eAEpB,EAAc,oBAAoB,EAInC,GAAI,IAAK,EAAc,YAAY,KAAK,EAAc,YAAY,KAAK,EAAe,EACtF,GAAI,cAAc;CAElB,IAAM,IAAW,EAAI,UACf,IAAM,EAAS,WAAW,UAC1B,IAAQ,EAAS,OACjB,IAAW,EAAc,WAAW,UACpC,IAAa,EAAc,OAC3B,IAAW,EAAqB,cAAc,EAC9C,IAAY,EAAqB,cAAc,EAEjD,IAAcH,IACd,IAAkBC,IAClB,IAAc,MACd,IAAkB;AAEtB,CAAK,MAEJ,IAAcC,IACd,IAAkBC;CAInB,IAAI,IAAkB,UAClB,IAA0B,MAC1B,IAA+B;AAgMnC,QA/LA,GAAW,KAAM,EAAe,CAAC,QAAQ,EACzC,GAAK,OAAO,KAAMN,GAAY,EAC9B,EAAI,UACH;EAEC,sBAAqB,MAEbC,GAAI,cAAe,EAAK;EAIhC,mBAAoB,GAAK,GAAQ,MAE3B,IAAQ,KAAmB,IAAQ,KAIlC,MAEJ,GAAK,IAAI,KAAM,EAAI,IAAK,EACxB,GAAK,IAAI,KAAM,EAAI,IAAK,EACxB,GAAK,cAAc,KAIb,MAID;EAIR,kBAAmB,GAAQ,MAAW;AAErC,OAAK,EAAc,WAKlB,QADiB,EAAc,WACf,UAAW;IAC1B,sBAAqB,MAEbC,GAAK,cAAe,EAAK;IAIjC,mBAAoB,GAAK,GAAQ,MAEzB,IAAQ,KAAmB,IAAQ;IAI3C,kBAAmB,GAAa,MAAgB;AAE/C,UAAM,IAAI,IAAK,GAAa,IAAK,IAAc,GAAY,IAAK,GAAI,KAAQ;AAQ3E,MALA,EAAa,GAAW,IAAI,GAAI,GAAY,EAAU,EAEtD,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,WAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;AAKvD,OAFA,EAAa,GAAU,IAAI,GAAG,GAAO,EAAK,EAE1C,EAAS,cAAc;OAEvB,IAAM,IAAO,EAAS,mBAAoB,GAAW,GAAa,EAAa;AAkB/E,WAjBK,IAAO,MAEX,EAAgB,KAAM,EAAa,EAE9B,KAEJ,EAAgB,KAAM,EAAa,EAIpC,IAAkB,GAClB,IAA0B,GAC1B,IAA+B,IAK3B,IAAO,EAEX,QAAO;;;;IASX,CAAE;GAEG;IAGN,IAAM,IAAW,GAAa,EAAe;AAC7C,SAAM,IAAI,IAAK,GAAG,IAAK,GAAU,IAAK,GAAI,KAAQ;AAMjD,KAJA,EAAa,GAAW,IAAI,GAAI,GAAY,EAAU,EACtD,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,UAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;AAKvD,MAFA,EAAa,GAAU,IAAI,GAAG,GAAO,EAAK,EAE1C,EAAS,cAAc;MAEvB,IAAM,IAAO,EAAS,mBAAoB,GAAW,GAAa,EAAa;AAkB/E,UAjBK,IAAO,MAEX,EAAgB,KAAM,EAAa,EAE9B,KAEJ,EAAgB,KAAM,EAAa,EAIpC,IAAkB,GAClB,IAA0B,GAC1B,IAA+B,IAK3B,IAAO,EAEX,QAAO;;;;;EAYZ,CAED,EAED,EAAqB,iBAAkB,EAAU,EACjD,EAAqB,iBAAkB,EAAW,EAE7C,MAAoB,WAEjB,QAID,EAAQ,QAMd,EAAQ,MAAM,KAAM,EAAiB,GAJrC,EAAQ,QAAQ,EAAgB,OAAO,EAQxC,EAAQ,WAAW,GACnB,EAAQ,YAAY,GAEf,MAEG,EAAQ,QACV,EAAQ,MAAM,KAAM,EAAiB,GADnB,EAAQ,QAAQ,EAAgB,OAAO,EAE9D,EAAQ,MAAM,aAAcF,GAAY,EACxC,EAAgB,aAAcA,GAAY,EAC1C,EAAQ,WAAW,EAAgB,IAAK,EAAQ,MAAO,CAAC,QAAQ,EAChE,EAAQ,YAAY,IAId;;;;ACpPR,SAAS,GAAgB,GAAK,IAAc,MAAO;AAElD,CAAK,KAAe,MAAM,QAAS,EAAa,KAE/C,IAAc,IAAI,IAAK,EAAa;CAIrC,IAAM,IAAW,EAAI,UACf,IAAW,EAAS,QAAQ,EAAS,MAAM,QAAQ,MACnD,IAAU,EAAS,WAAW,UAEhC,GAAQ,GAAa,GAAa,GAClC,IAAa,GACX,IAAQ,EAAI;AAClB,MAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,IAQzC,CANA,IAAS,EAAO,IAChB,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAe,IAAI,aAAc,EAAQ,EAEzC,EAAW,GAAG,EAAY,EAC1B,KAAc,EAAO;CAItB,SAAS,EAAW,GAAa,GAAY,IAAQ,IAAQ;EAE5D,IAAM,IAAc,IAAc;AAClC,MAAK,EAAS,GAAa,EAAa,EAAG;GAE1C,IAAM,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa,EAE3C,IAAO,UACP,IAAO,UACP,IAAO,UACP,IAAO,WACP,IAAO,WACP,IAAO;AAEX,QAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;IAEvD,IAAM,IAAI,IAAI,EAAI,qBAAsB,EAAG;AAC3C,SAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;KAE9B,IAAI,IAAQ,IAAI;AAChB,SAAQ,IAAW,EAAU,KAAU;KAEvC,IAAM,IAAI,EAAQ,KAAM,EAAO,EACzB,IAAI,EAAQ,KAAM,EAAO,EACzB,IAAI,EAAQ,KAAM,EAAO;AAS/B,KAPK,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO,IAElB,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO,IAElB,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO;;;AA8BxB,UArBA,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KAEpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KAGpC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAElC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAE3B,MAIA;SAIF;GAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa,EAIhD,IAAgB,GAChB,IAAe,IACf,IAAgB;AAEpB,OAAK;QAIC,CAAE,GAAgB;KAEtB,IAAM,IAAa,IAAA,IAAyB,IAAA,IACtC,IAAc,IAAA,IAA0B,IAAA;AAG9C,KAFA,IAAe,EAAY,IAAK,EAAY,EAC5C,IAAgB,EAAY,IAAK,EAAa,EAC9C,IAAgB,CAAE,KAAgB,CAAE;;SAOrC,CADA,IAAe,IACf,IAAgB;GAIjB,IAAM,IAAe,KAAiB,GAChC,IAAgB,KAAiB,GAEnC,IAAa;AACjB,GAAK,MAEJ,IAAa,EAAW,GAAM,GAAY,EAAe;GAI1D,IAAI,IAAc;AAClB,GAAK,MAEJ,IAAc,EAAW,GAAO,GAAY,EAAe;GAI5D,IAAM,IAAY,KAAc;AAChC,OAAK,EAEJ,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;IAE9B,IAAM,IAAS,IAAO,GAChB,IAAU,IAAQ,GAClB,IAAe,EAAc,IAC7B,IAAe,EAAc,IAAS,IACtC,IAAgB,EAAc,IAC9B,IAAgB,EAAc,IAAU;AAG9C,IADA,EAAc,IAAc,KAAM,IAAe,IAAgB,IAAe,GAChF,EAAc,IAAc,IAAI,KAAM,IAAe,IAAgB,IAAe;;AAMtF,UAAO;;;;;;AChKV,SAAS,GAAkB,GAAK,GAAM,GAAgB,GAAK,GAAY,GAAM,GAAM;AAIlF,CAFA,EAAY,UAAW,EAAI,OAAQ,GAAQ,EAC3C,GAAU,GAAG,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK,EAC9D,EAAY,aAAa;;AAI1B,SAAS,GAAU,GAAa,GAAK,GAAgB,GAAK,GAAY,GAAM,GAAM;CAEjF,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC7C,IAAc,IAAc;AAElC,KADe,EAAS,GAAa,EAAa,CAMjD,IAAwB,GAAK,GAAgB,GAH9B,EAAQ,GAAa,EAAa,EACnC,EAAO,GAAa,EAAa,EAEkB,GAAY,GAAM,EAAK;MAGlF;EAEN,IAAM,IAAY,EAAW,EAAa;AAC1C,EAAK,EAAsB,GAAW,GAAc,GAAK,GAAM,EAAK,IAEnE,GAAU,GAAW,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK;EAIvE,IAAM,IAAa,EAAY,GAAa,EAAa;AACzD,EAAK,EAAsB,GAAY,GAAc,GAAK,GAAM,EAAK,IAEpE,GAAU,GAAY,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK;;;;;ACjC1E,IAAM,KAAa;CAAE;CAAK;CAAK;CAAK;AAEpC,SAAS,GAAuB,GAAK,GAAM,GAAgB,GAAK,GAAM,GAAM;AAE3E,GAAY,UAAW,EAAI,OAAQ,GAAQ;CAC3C,IAAM,IAAS,GAAe,GAAG,GAAK,GAAgB,GAAK,GAAM,EAAK;AAGtE,QAFA,EAAY,aAAa,EAElB;;AAIR,SAAS,GAAe,GAAa,GAAK,GAAgB,GAAK,GAAM,GAAM;CAE1E,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAGhC,KADe,EAAS,GAAa,EAAa,CAMjD,QAAO,GAA8B,GAAK,GAAgB,GAH3C,EAAQ,GAAa,EAAa,EACnC,EAAO,GAAa,EAAa,EAE+B,GAAM,EAAK;CAGnF;EAIN,IAAM,IAAY,EAAY,GAAa,EAAa,EAClD,IAAU,GAAY,IAEtB,IADS,EAAI,UAAW,MACA,GAG1B,GAAI;AACR,EAAK,KAEJ,IAAK,EAAW,EAAa,EAC7B,IAAK,EAAY,GAAa,EAAa,KAI3C,IAAK,EAAY,GAAa,EAAa,EAC3C,IAAK,EAAW,EAAa;EAK9B,IAAM,IADiB,EAAsB,GAAI,GAAc,GAAK,GAAM,EAAK,GAC7C,GAAe,GAAI,GAAK,GAAgB,GAAK,GAAM,EAAK,GAAG;AAI7F,MAAK,GAAW;GAIf,IAAM,IAAQ,EAAS,MAAO;AAK9B,OAJkB,IACjB,KAAS,EAAc,IAAK,KAC5B,KAAS,EAAc,IAAK,IAAY,GAIxC,QAAO;;EAST,IAAM,IADiB,EAAsB,GAAI,GAAc,GAAK,GAAM,EAAK,GAC7C,GAAe,GAAI,GAAK,GAAgB,GAAK,GAAM,EAAK,GAAG;AAQ5F,SANI,KAAY,IAET,EAAS,YAAY,EAAS,WAAW,IAAW,IAIpD,KAAY,KAAY;;;;;AC9ElC,IAAM,qBAA8B,IAAI,GAAM,EACxC,qBAA2B,IAAI,GAAkB,EACjD,qBAA4B,IAAI,GAAkB,EAClD,qBAA8B,IAAI,GAAS,EAE3CO,qBAAsB,IAAI,GAAa,EACvCC,qBAAuB,IAAI,GAAa;AAE9C,SAAS,GAA6B,GAAK,GAAM,GAAe,GAAgB;AAE/E,GAAY,UAAW,EAAI,OAAQ,GAAQ;CAC3C,IAAM,IAAS,GAAqB,GAAG,GAAK,GAAe,EAAe;AAG1E,QAFA,EAAY,aAAa,EAElB;;AAIR,SAAS,GAAqB,GAAa,GAAK,GAAe,GAAe,IAAY,MAAO;CAEhG,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAgBhC,KAdK,MAAc,SAEX,EAAc,eAEpB,EAAc,oBAAoB,EAInC,GAAI,IAAK,EAAc,YAAY,KAAK,EAAc,YAAY,KAAK,EAAe,EACtF,IAAYD,KAIE,EAAS,GAAa,EAAa,EACpC;EAEb,IAAM,IAAe,EAAI,UACnB,IAAY,EAAa,OACzB,IAAU,EAAa,WAAW,UAElC,IAAa,EAAc,OAC3B,IAAW,EAAc,WAAW,UAEpC,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa;AAO/C,MAFA,GAAY,KAAM,EAAe,CAAC,QAAQ,EAErC,EAAc,WAuClB,QApCA,EAAY,EAAqB,EAAa,EAAE,GAAcC,GAAM,EACpE,GAAK,OAAO,KAAM,GAAa,EAC/B,GAAK,cAAc,IAGP,EAAc,WAAW,UAAW;GAE/C,mBAAkB,MAAOA,GAAK,cAAe,EAAK;GAElD,qBAAoB,MAAO;AAK1B,IAHA,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,cAAc;AAElB,SAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,IAKhD,KAFA,EAAa,IAAW,IAAI,EAAI,qBAAsB,EAAG,EAAE,GAAW,EAAS,EAC/E,GAAU,cAAc,IACnB,EAAI,mBAAoB,GAAW,CAEvC,QAAO;AAOT,WAAO;;GAIR,CAAE;EAIG;GAGN,IAAM,IAAqB,GAAa,EAAe;AAEvD,QAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;AAUvD,IANA,EAAa,IAAU,IADZ,EAAI,qBAAsB,EAAG,EACT,GAAW,EAAS,EAGnD,GAAS,EAAE,aAAc,GAAa,EACtC,GAAS,EAAE,aAAc,GAAa,EACtC,GAAS,EAAE,aAAc,GAAa,EACtC,GAAS,cAAc;AAEvB,SAAM,IAAI,IAAK,GAAG,IAAK,IAAqB,GAAG,IAAK,GAAI,KAAM,EAK7D,KAHA,EAAa,IAAW,GAAI,GAAY,EAAU,EAClD,GAAU,cAAc,IAEnB,GAAS,mBAAoB,GAAW,CAE5C,QAAO;;;QAWL;EAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa;AAgBpD,SAdA,EAAY,EAAqB,EAAM,EAAE,GAAc,GAAa,EAYpE,GAVC,EAAU,cAAe,GAAa,IACtC,GAAqB,GAAM,GAAK,GAAe,GAAe,EAAW,KAI1E,EAAY,EAAqB,EAAO,EAAE,GAAc,GAAa,EAEpE,EAAU,cAAe,GAAa,IACtC,GAAqB,GAAO,GAAK,GAAe,GAAe,EAAW;;;;;ACrJ7E,IAAM,qBAA6B,IAAI,GAAS,EAC1C,qBAAsB,IAAI,GAAa,EACvC,qBAAuB,IAAI,GAAa,EACxC,qBAAwB,IAAI,GAAS,EACrC,qBAAwB,IAAI,GAAS,EACrC,qBAAwB,IAAI,GAAS,EACrC,qBAAwB,IAAI,GAAS;AAE3C,SAAS,GACR,GACA,GACA,GACA,IAAU,EAAG,EACb,IAAU,EAAG,EACb,IAAe,GACf,IAAe,UACd;AASD,CAPO,EAAc,eAEpB,EAAc,oBAAoB,EAInC,GAAI,IAAK,EAAc,YAAY,KAAK,EAAc,YAAY,KAAK,EAAe,EACtF,GAAI,cAAc;CAElB,IAAM,IAAW,EAAI,UACf,IAAM,EAAS,WAAW,UAC1B,IAAQ,EAAS,OACjB,IAAW,EAAc,WAAW,UACpC,IAAa,EAAc,OAC3B,IAAW,EAAqB,cAAc,EAC9C,IAAY,EAAqB,cAAc,EAEjD,IAAc,IACd,IAAkB,IAClB,IAAc,MACd,IAAkB;AAEtB,CAAK,MAEJ,IAAc,IACd,IAAkB;CAInB,IAAI,IAAkB,UAClB,IAA0B,MAC1B,IAA+B;AAgMnC,QA/LA,GAAW,KAAM,EAAe,CAAC,QAAQ,EACzC,GAAK,OAAO,KAAM,GAAY,EAC9B,EAAI,UACH;EAEC,sBAAqB,MAEb,GAAI,cAAe,EAAK;EAIhC,mBAAoB,GAAK,GAAQ,MAE3B,IAAQ,KAAmB,IAAQ,KAIlC,MAEJ,GAAK,IAAI,KAAM,EAAI,IAAK,EACxB,GAAK,IAAI,KAAM,EAAI,IAAK,EACxB,GAAK,cAAc,KAIb,MAID;EAIR,kBAAmB,GAAQ,MAAW;AAErC,OAAK,EAAc,YAAa;IAI/B,IAAM,IAAW,EAAc;AAC/B,WAAO,EAAS,UAAW;KAC1B,sBAAqB,MAEb,GAAK,cAAe,EAAK;KAIjC,mBAAoB,GAAK,GAAQ,MAEzB,IAAQ,KAAmB,IAAQ;KAI3C,kBAAmB,GAAa,MAAgB;AAE/C,WAAM,IAAI,IAAK,GAAa,IAAK,IAAc,GAAY,IAAK,GAAI,KAAQ;AAQ3E,OALA,EAAa,GAAW,IADZ,EAAS,qBAAsB,EAAI,EACd,GAAY,EAAU,EAEvD,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,YAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;AAKvD,QAFA,EAAa,GAAU,IADZ,EAAI,qBAAsB,EAAG,EACT,GAAO,EAAK,EAE3C,EAAS,cAAc;QAEvB,IAAM,IAAO,EAAS,mBAAoB,GAAW,GAAa,EAAa;AAkB/E,YAjBK,IAAO,MAEX,EAAgB,KAAM,EAAa,EAE9B,KAEJ,EAAgB,KAAM,EAAa,EAIpC,IAAkB,GAClB,IAA0B,GAC1B,IAA+B,IAK3B,IAAO,EAEX,QAAO;;;;KASX,CAAE;UAEG;IAGN,IAAM,IAAW,GAAa,EAAe;AAC7C,SAAM,IAAI,IAAK,GAAG,IAAK,GAAU,IAAK,GAAI,KAAQ;AAMjD,KAJA,EAAa,GAAW,IAAI,GAAI,GAAY,EAAU,EACtD,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,UAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;AAKvD,MAFA,EAAa,GAAU,IADZ,EAAI,qBAAsB,EAAG,EACT,GAAO,EAAK,EAE3C,EAAS,cAAc;MAEvB,IAAM,IAAO,EAAS,mBAAoB,GAAW,GAAa,EAAa;AAkB/E,UAjBK,IAAO,MAEX,EAAgB,KAAM,EAAa,EAE9B,KAEJ,EAAgB,KAAM,EAAa,EAIpC,IAAkB,GAClB,IAA0B,GAC1B,IAA+B,IAK3B,IAAO,EAEX,QAAO;;;;;EAYZ,CAED,EAED,EAAqB,iBAAkB,EAAU,EACjD,EAAqB,iBAAkB,EAAW,EAE7C,MAAoB,WAEjB,QAID,EAAQ,QAMd,EAAQ,MAAM,KAAM,EAAiB,GAJrC,EAAQ,QAAQ,EAAgB,OAAO,EAQxC,EAAQ,WAAW,GACnB,EAAQ,YAAY,GAEf,MAEG,EAAQ,QACV,EAAQ,MAAM,KAAM,EAAiB,GADnB,EAAQ,QAAQ,EAAgB,OAAO,EAE9D,EAAQ,MAAM,aAAc,GAAY,EACxC,EAAgB,aAAc,GAAY,EAC1C,EAAQ,WAAW,EAAgB,IAAK,EAAQ,MAAO,CAAC,QAAQ,EAChE,EAAQ,YAAY,IAId;;;;ACzPR,SAAgB,GAAyB,GAAK,GAAQ,GAAY;AAYjE,QAVK,MAAQ,OAEL,QAIR,EAAI,MAAM,aAAc,EAAO,YAAa,EAC5C,EAAI,WAAW,EAAI,MAAM,WAAY,EAAU,IAAI,OAAQ,EAC3D,EAAI,SAAS,GAEN;;;;ACaR,IAAM,qBAAuB,IAAI,GAAa,EACxCC,qBAAuB,IAAI,GAAK,EAChC,qBAA6B,IAAI,GAAS,EAC1CC,qBAAiC,IAAI,GAAS,EAC9C,qBAA8B,IAAI,GAAS,EAC3C,KAAW;CAAE;CAAQ;CAAQ;CAAQ,EA6D9B,KAAb,MAAa,UAAgB,GAAY;CAkBxC,OAAO,UAAW,GAAK,IAAU,EAAE,EAAG;AAErC,MAAU;GACT,cAAc;GACd,GAAG;GACH;EAED,IAAM,IAAW,EAAI,UACf,IAAW,EAAI,QACf,IAAiB,EAAI,iBACrB,IAAiB,EAAS,UAAU,EACpC,IAAS;GACd,SAAS;GACT,OAAO;GACP,OAAO;GACP,gBAAgB;GAChB;AAeD,SAdK,EAAQ,gBAEZ,EAAO,QAAQ,EAAS,KAAK,MAAQ,EAAK,OAAO,CAAE,EACnD,EAAO,QAAQ,IAAiB,EAAe,MAAM,OAAO,GAAG,MAC/D,EAAO,iBAAiB,IAAiB,EAAe,OAAO,GAAG,SAIlE,EAAO,QAAQ,GACf,EAAO,QAAQ,IAAiB,EAAe,QAAQ,MACvD,EAAO,iBAAiB,IAIlB;;CAiBR,OAAO,YAAa,GAAM,GAAU,IAAU,EAAE,EAAG;AAElD,MAAU;GACT,UAAU;GACV,UAAU,EAAS,EAAK;GACxB,GAAG;GACH;EAED,IAAM,EAAE,UAAO,UAAO,sBAAmB;AAIzC,EAAO,EAAK,YAEX,QAAQ,KACP,+IAEA,EACD,EAAe,EAAO;EAIvB,IAAM,IAAM,IAAI,EAAS,GAAU;GAAE,GAAG;IAAW,IAAmB;GAAM,CAAE;AAI9E,MAHA,EAAI,SAAS,GACb,EAAI,kBAAkB,KAAkB,MAEnC,EAAQ,UAAW;GAEvB,IAAM,IAAiB,EAAS,UAAU;AAC1C,OAAK,MAAmB,MAAO;IAE9B,IAAM,IAAW,IAAI,EAAiB,EAAK,OAAO,GAAG,GAAO;AAC5D,MAAS,SAAU,EAAU;UAElB,EAAe,UAAU,MAEpC,EAAe,MAAM,IAAK,EAAO,EACjC,EAAe,cAAc;;AAM/B,SAAO;EAGP,SAAS,EAAe,GAAQ;AAE/B,QAAM,IAAI,IAAY,GAAG,IAAY,EAAM,QAAQ,KAAe;IAEjE,IAAM,IAAO,EAAO,IACd,IAAc,IAAI,YAAa,EAAM,EACrC,IAAc,IAAI,YAAa,EAAM;AAG3C,SAAM,IAAI,IAAO,GAAG,IAAI,EAAK,aAAA,IAA6B,IAAO,GAAG,KAAU;KAE7E,IAAM,IAAA,IAAgC;AAEtC,KAAO,EADa,IAAI,GACK,EAAa,KAGzC,EAAa,IAAc,KAAM,EAAa,IAAc,KAAA,IAAwB;;;;;CAYzF,IAAI,kBAAkB;AAErB,SAAO;;CAWR,IAAI,uBAAuB;AAE1B,SAAO,KAAK;;CAIb,YAAa,GAAU,IAAU,EAAE,EAAG;AAYrC,EAVK,EAAQ,gBAEZ,QAAQ,KAAM,wFAAqF,EACnG,IAAU;GACT,GAAG;GACH,gBAAgB,EAAQ;GACxB,GAIF,MAAO,GAAU,EAAS;;CAe3B,qBAAsB,GAAS;AAE9B,SAAO,MAAM,sBAAuB,EAAQ;;CAK7C,qBAAsB,GAAG,GAAc,GAAY;EAElD,IAAM,IAAW,KAAK,UAChB,IAAiB,KAAK,iBACtB,IAAU,EAAS,WAAW,UAC9B,IAAQ,EAAS,QAAQ,EAAS,MAAM,QAAQ,MAGhD,KADM,IAAiB,EAAgB,KAAM,KAChC,GAEf,IAAK,IAAO,GACZ,IAAK,IAAO,GACZ,IAAK,IAAO;AAEhB,EAAK,MAEJ,IAAK,EAAO,IACZ,IAAK,EAAO,IACZ,IAAK,EAAO;AAIb,OAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;GAEjC,IAAM,IAAI,EAAS,GAAU,IAAQ,EAAI,EACnC,IAAI,EAAS,GAAU,IAAQ,EAAI,EACnC,IAAI,EAAS,GAAU,IAAQ,EAAI,EAErC,IAAM;AAEV,GADK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM;GAErB,IAAI,IAAM;AAMV,GALK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM,IAGrB,EAAc,IAAY,KAAO,GACjC,EAAc,IAAY,IAAK,KAAM;;AAItC,SAAO;;CAQR,uBAAwB,GAAQ,GAAO,GAAe;EAErD,IAAM,IAAW,KAAK,UAChB,IAAiB,KAAK,iBACtB,IAAU,EAAS,WAAW,UAC9B,IAAQ,EAAS,QAAQ,EAAS,MAAM,QAAQ,MAChD,IAAa,EAAQ;AAE3B,MAAK,IAAS,KAAK,IAAQ,IAAS,EAAa,SAAS,EAAa,SAAS,EAE/E,OAAU,MAAO,qDAAsD;EAKxE,IAAM,IAAS,EAAQ,OAGjB,IAAe,EAAQ,UAAU,GACnC,IAAS;AACb,EAAK,EAAQ,iCAEZ,IAAS,EAAQ,KAAK;EAKvB,IAAM,IAAU;GAAE;GAAQ;GAAQ;GAAQ,EACpC,IAAc,EAAa;AAGjC,OAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;GAGvD,IAAM,KADM,IAAiB,EAAgB,KAAM,KAChC,GACb,KAAsB,IAAI,KAAgB,GAE5C,IAAK,IAAO,GACZ,IAAK,IAAO,GACZ,IAAK,IAAO;AAYhB,GAVK,MAEJ,IAAK,EAAO,IACZ,IAAK,EAAO,IACZ,IAAK,EAAO,KAMN,MAEN,IAAK,IAAK,IAAS,GACnB,IAAK,IAAK,IAAS,GACnB,IAAK,IAAK,IAAS;AAIpB,QAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;IAEjC,IAAI,GAAG,GAAG;AAEV,IAAK,KAEJ,IAAI,EAAS,EAAS,IAAQ,EAAI,EAClC,IAAI,EAAS,EAAS,IAAQ,EAAI,EAClC,IAAI,EAAS,EAAS,IAAQ,EAAI,KAIlC,IAAI,EAAQ,IAAK,IACjB,IAAI,EAAQ,IAAK,IACjB,IAAI,EAAQ,IAAK;IAIlB,IAAI,IAAM;AAEV,IADK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM;IAErB,IAAI,IAAM;AAEV,IADK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM;IAKrB,IAAM,KAAgB,IAAM,KAAQ,GAC9B,IAAM,IAAK;AAEjB,IADA,EAAc,IAAoB,IAAM,KAAM,IAAM,GACpD,EAAc,IAAoB,IAAM,KAAM,KAAgB,KAAK,IAAK,EAAK,GAAG,KAAgB;;;AAMlG,SAAO;;CAaR,gBAAiB,GAAQ,GAAW,IAAa,EAAE,EAAG;EAErD,IAAM,EAAE,gBAAa;AACrB,MAAK,MAAa,KAAA,EAEjB;AAQD,EAJA,GAAe,KAAM,EAAO,YAAa,CAAC,QAAQ,EAClD,GAAK,KAAM,EAAU,IAAK,CAAC,aAAcA,GAAgB,EAEzD,GAAY,mBAAoB,EAAO,YAAa,EACpD,GAAW,KAAMD,GAAK,UAAW,CAAC,SAAU,GAAa;EAEzD,IAAM,IAAc,GAAW,QAAQ,EACjC,IAAO,EAAU,OAAO,GACxB,IAAM,EAAU,MAAM;AAE5B,MAAK,EAAU,iBAAiB,IAAO;GAEtC,IAAI,IAAM,KAAK,aAAcA,IAAM,GAAU,GAAM,EAAK;AAExD,GADA,IAAM,GAAyB,GAAK,GAAQ,EAAW,EAClD,KAEJ,EAAW,KAAM,EAAK;SAIjB;GAEN,IAAM,IAAO,KAAK,QAASA,IAAM,GAAU,GAAM,EAAK;AACtD,QAAM,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,IAAI,GAAG,KAAO;IAE/C,IAAM,IAAM,GAAyB,EAAM,IAAK,GAAQ,EAAW;AACnE,IAAK,KAEJ,EAAW,KAAM,EAAK;;;AAQzB,SAAO;;CAYR,MAAO,IAAc,MAAO;AAG3B,UADkB,KAAK,WAAW,KAAiB,IACjC,MAAM,EAAa;;CAyBtC,QAAS,GAAK,IAAA,GAA4B,IAAO,GAAG,IAAM,UAAW;EAEpE,IAAM,IAAQ,KAAK,QACb,IAAa,EAAE,EACf,IAAc,KAAK,WAAW,KAAmB;AACvD,OAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,IAEzC,GAAa,MAAM,GAAG,GAAgB,GAAK,GAAY,GAAM,EAAK;AAInE,SAAO;;CAeR,aAAc,GAAK,IAAA,GAA4B,IAAO,GAAG,IAAM,UAAW;EAEzE,IAAM,IAAQ,KAAK,QACf,IAAgB,MAEd,IAAmB,KAAK,WAAW,KAAwB;AACjE,OAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,KAAO;GAEhD,IAAM,IAAS,EAAkB,MAAM,GAAG,GAAgB,GAAK,GAAM,EAAK;AAC1E,GAAK,KAAU,SAAU,KAAiB,QAAQ,EAAO,WAAW,EAAc,cAEjF,IAAgB;;AAMlB,SAAO;;CAgBR,mBAAoB,GAAe,GAAa;EAE/C,IAAI,IAAS,IACP,IAAQ,KAAK,QACb,IAAyB,KAAK,WAAW,KAA8B;AAC7E,OAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,MAEtC,IAAS,EAAwB,MAAM,GAAG,GAAe,EAAY,EAEhE,KAJoC;AAY1C,SAAO;;CAiBR,UAAW,GAAY;EAEtB,IAAM,IAAW,EAAqB,cAAc,EAC9C,IAAS,MAAM,UACpB;GACC,GAAG;GACH,qBAAqB,EAAU;GAC/B,kBAAkB;GAIlB,SAAS,KAAK,WAAW,KAAgCE;GACzD,CACD;AAGD,SAFA,EAAqB,iBAAkB,EAAU,EAE1C;;CAoBR,QAAS,GAAU,GAAe,GAAY;EAE7C,IAAI,EACH,qBACA,2BACG,GAEE,IAAY,EAAqB,cAAc,EAC/C,IAAa,KAAK,SAAS,OAC3B,IAAgB,KAAK,SAAS,WAAW,UACzC,IAAkB,KAAK,YAC5B,MAAM;AAIL,KAAa,GADF,KAAK,qBAAsB,EAAI,GACb,GAAG,GAAY,EAAe;OAG5D,MAAM;AAEL,KAAa,GAAW,IAAK,GAAG,GAAY,EAAe;KAIvD,IAAY,EAAqB,cAAc,EAC/C,IAAa,EAAS,SAAS,OAC/B,IAAgB,EAAS,SAAS,WAAW,UAC7C,IAAkB,EAAS,YAChC,MAAM;AAGL,KAAa,GADD,EAAS,qBAAsB,EAAI,GACjB,GAAG,GAAY,EAAe;OAG7D,MAAM;AAEL,KAAa,GAAW,IAAK,GAAG,GAAY,EAAe;;AAK7D,MAAK,GAAsB;AAE1B,OAAK,EAAI,aAAoB,GAE5B,OAAU,MAAO,mFAAkF;GAIpG,IAAM,KAA+B,GAAS,GAAQ,GAAS,GAAQ,GAAQ,GAAY,GAAQ,MAAgB;AAElH,SAAM,IAAI,IAAK,GAAS,IAAK,IAAU,GAAQ,IAAK,GAAI,KAAQ;AAO/D,KALA,EAAiB,EAAI,EAErB,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,UAAM,IAAI,IAAK,GAAS,IAAK,IAAU,GAAQ,IAAK,GAAI,IAMvD,KAJA,EAAiB,EAAI,EAErB,EAAU,cAAc,IAEnB,EAAqB,GAAW,GAAW,GAAI,GAAI,GAAQ,GAAY,GAAQ,EAAY,CAE/F,QAAO;;AAQV,WAAO;;AAIR,OAAK,GAAmB;IAEvB,IAAM,IAA2B;AACjC,QAAmB,SAAW,GAAS,GAAQ,GAAS,GAAQ,GAAQ,GAAY,GAAQ,GAAa;AAQxG,YANO,EAA0B,GAAS,GAAQ,GAAS,GAAQ,GAAQ,GAAY,GAAQ,EAAY,GAMpG,KAJC,EAA4B,GAAS,GAAQ,GAAS,GAAQ,GAAQ,GAAY,GAAQ,EAAY;;SAU/G,KAAmB;;AAMrB,SAAO,MAAM,QAAS,GAAU,GAAe,EAAE,qBAAkB,CAAE;;CAgBtE,cAAe,GAAK,GAAY;AAK/B,SAHA,GAAK,IAAK,EAAI,KAAK,EAAI,KAAK,EAAW,EACvC,GAAK,cAAc,IAEZ,KAAK,UACX;GACC,mBAAkB,MAAO,GAAK,cAAe,EAAK;GAClD,qBAAoB,MAAO,GAAK,mBAAoB,EAAK;GACzD,CACD;;CAUF,iBAAkB,GAAS;AAE1B,SAAO,KAAK,UACX;GACC,mBAAkB,MAAO,EAAO,cAAe,EAAK;GACpD,qBAAoB,MAAO,EAAI,iBAAkB,EAAQ;GACzD,CACD;;CAiCF,uBAAwB,GAAe,GAAe,IAAU,EAAG,EAAE,IAAU,EAAG,EAAE,IAAe,GAAG,IAAe,UAAW;AAG/H,UADmC,KAAK,WAAW,KAAkC,IAEpF,MACA,GACA,GACA,GACA,GACA,GACA,EACA;;CAuBF,oBAAqB,GAAO,IAAS,EAAG,EAAE,IAAe,GAAG,IAAe,UAAW;AAErF,SAAO,GACN,MACA,GACA,GACA,GACA,EACA;;GC32BG,oBAA4B,IAAI,GAAgB,EAChD,oBAA0B,IAAI,GAAS,EACvCC,qBAAiC,IAAI,GAAS,EAC9C,qBAAuB,IAAI,GAAM,EACjC,qBAA0B,IAAI,GAAQ,EACtCC,oBAAuB,IAAI,GAAS,EACpCC,qBAAuB,IAAI,GAAK,EAChC,oBAAwB,IAAI,GAAM,EAClC,KAAiB,EAAE,EAsBZ,KAAb,cAA+B,GAAI;CAElC,YAAa,GAAM,IAAU,EAAE,EAAG;AAUjC,EARA,IAAU;GACT,SAAS;GACT,kBAAkB;GAClB,aAAa,MAAM,QAAS,EAAM,GAAG,IAAI,GAAS,GAAG,EAAK;GAC1D,gBAAgB;GAChB,GAAG;GACH,EAED,OAAO;EAGP,IAAM,oBAAY,IAAI,KAAK;AAC3B,KAAgB,GAAM,EAAW;EAIjC,IAAM,IAAU,MAAM,KAAM,EAAW,EACjC,IAAS,KAAK,KAAM,KAAK,KAAM,EAAQ,OAAQ,CAAE,EACjD,KAAW,KAAK,KAAW;AAajC,EAXA,KAAK,UAAU,GACf,KAAK,SAAS,GACd,KAAK,SAAS,GACd,KAAK,kBAAkB,MACvB,KAAK,wBAAwB,GAG7B,KAAK,UAAU,EAAQ,SACvB,KAAK,mBAAmB,EAAQ,kBAChC,KAAK,cAAc,EAAQ,aAE3B,KAAK,KAAM,EAAS;;CASrB,gBAAiB,GAAc;EAE9B,IAAM,EAAE,WAAQ,eAAY;AAE5B,SAAO,EADI,GAAa,GAAa,EAAQ;;CAU9C,kBAAmB,GAAc;EAEhC,IAAM,EAAE,WAAQ,cAAW;AAC3B,SAAO,GAAe,GAAa,GAAQ,EAAQ;;CAIpD,KAAM,GAAU;EAEf,IAAM,EAAE,YAAS,WAAQ,mBAAgB;AAQzC,EALA,GAAe,KAAM,EAAa,CAAC,QAAQ,EAE3C,KAAK,kBAAkB,IAAI,YAAa,KAAK,iBAAkB,EAAS,CAAE,EAC1E,KAAK,qBAAsB,GAAS,GAAQ,KAAK,gBAAiB,EAElE,MAAM,KAAM,EAAS;;CAItB,MAAO,GAAG,GAAO;AAKhB,EAFA,GAAe,KAAM,KAAK,YAAa,CAAC,QAAQ,EAEhD,MAAM,MAAO,GAAG,EAAM;;CAIvB,qBAAsB,GAAG,GAAc,GAAc;EAEpD,IAAM,EAAE,uBAAoB;AAC5B,OAAK,yBAA0B,EAAiB,IAAKF,IAAgB,GAAM;EAE3E,IAAM,EAAE,QAAK,WAAQ;AAMrB,EALA,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI;;CAIvC,gBAAgB;AAEf,SAAO,CAAE;GAAE,QAAQ;GAAG,OAAO,KAAK,gBAAgB;GAAQ,CAAE;;CAe7D,UAAW,GAAY;AAEtB,SAAO,MAAM,UAAW;GACvB,GAAG;GAEH,qBAAqB,EAAU;GAC/B,kBAAkB;GAClB,SAAS;GACT,CAAE;;CAMJ,QAAS,GAAW,IAAa,EAAE,EAAG;EAErC,IAAM,EAAE,gBAAa,wBAAqB,MACpC,EAAE,oBAAiB,GACnB,IAAkB,EAAE;AAI1B,EADA,GAAe,KAAM,EAAa,CAAC,QAAQ,EAC3C,GAAK,KAAM,EAAU,IAAK,CAAC,aAAcA,GAAgB;EAEzD,IAAI,IAAkB,UAClB,IAAa;AA+IjB,SA7IA,KAAK,UAAW;GACf,sBAAqB,MAEb,EAAI,gBAAiBE,GAAK,OAAQ;GAG1C,mBAAkB,MAAO;AAExB,QAAK,GAAe;AAEnB,SAAK,CAAEA,GAAK,aAAc,GAAKD,EAAM,CAEpC,QAAA;KAID,IAAI;AAaJ,YAZK,EAAI,cAAeC,GAAK,OAAQ,GAEpC,IAAO,KAIP,EAAK,aAAc,EAAa,EAChC,IAAO,EAAU,IAAI,OAAO,WAAYD,EAAM,GAKxC,IAAO,IAAA,IAAA;UAId,QAAOC,GAAK,cAAe,EAAK,GAAA,IAAA;;GAKlC,iBAAkB,GAAQ,GAAa;AAG/B,UAAO,SAQd;SAFA,EAAgB,SAAS,GAEpB,EAAO,mBAAmB,EAiB9B,CAdA,EAAM,WAAW,EAAO,UACxB,EAAM,WAAW,EAAO,UAExB,EAAO,YAAa,GAAY,EAAM,YAAa,EACnD,EAAM,YAAY,YAAa,EAAO,YAAa,EACnD,EAAM,QAAS,GAAW,EAAiB,EAE3C,EAAgB,SAAS,MAAO;AAG/B,MADA,EAAI,SAAS,GACb,EAAI,aAAa;OAEf,EAEH,EAAM,WAAW;cAEN,EAAO,iBAAiB,GAAmB;AAEtD,UAAK,CAAE,EAAO,aAAc,EAAY,CAEvC;MAKD,IAAM,IAAa,EAAO,gBAAiB,EAAY,EACjD,IAAgB,EAAO,mBAAoB,GAAY,GAAgB;AAyB7E,MAvBA,EAAU,QAAQ,EAAO,SAAS,OAClC,EAAU,aAAa,EAAO,SAAS,YACvC,EAAU,aAAc,EAAc,OAAO,EAAc,MAAO,EAElE,EAAM,WAAW,GACjB,EAAM,WAAW,EAAO,UAGxB,EAAO,YAAa,GAAY,EAAM,YAAa,EACnD,EAAM,YAAY,YAAa,EAAO,YAAa,EACnD,EAAM,QAAS,GAAW,EAAiB,EAG3C,EAAgB,SAAS,MAAO;AAG/B,OADA,EAAI,SAAS,GACb,EAAI,UAAU;QAEZ,EAEH,EAAM,WAAW,MACjB,EAAU,QAAQ,MAClB,EAAU,aAAa,MACvB,EAAU,aAAc,GAAG,SAAU;WAIrC,GAAO,QAAS,GAAW,EAAiB;AAK7C,KAAK,IAEJ,EAAgB,SAAS,MAAO;AAE/B,MAAK,EAAI,WAAW,MAEnB,IAAkB,EAAI,UACtB,IAAa;OAIZ,GAIH,EAAW,KAAM,GAAG,EAAiB;;;GAKvC,CAAE,EAGE,KAAgB,KAEpB,EAAW,KAAM,EAAY,EAIvB;;CAKR,yBAA0B,GAAa,GAAoB,GAAS;EAEnE,IAAM,EAAE,YAAS,WAAQ,WAAQ,YAAS,wBAAqB,MACzD,IAAK,GAAa,GAAa,EAAQ,EACvC,IAAa,GAAe,GAAa,GAAQ,EAAQ,EACzD,IAAS,EAAS;AAExB,MAAK,CAAE,MAAsB,EAAO,mBAAmB,EAAO,eA2B7D,CAxBO,EAAO,eAEb,EAAO,oBAAoB,EAIrB,EAAO,kBAEb,EAAO,uBAAuB,EAI/B,EACE,KAAM,EAAO,YAAa,CAC1B,YAAa,EAAoB,EAEnC,GACE,KAAM,EAAO,eAAgB,CAC7B,aAAc,EAAS,EAEzB,EACE,KAAM,EAAO,YAAa,CAC1B,aAAc,EAAS,EAEzB,GAAgB,GAAQ,GAAS;WAEtB,EAIX,KAAK,EAAO,gBASX,CAPA,EACE,YAAa,GAAY,EAAS,EAEpC,EACE,YAAa,EAAO,YAAa,CACjC,YAAa,EAAoB,EAEnC,GAAkB,EAAO,UAAU,GAAS,EAAQ;WAEzC,EAAO,eAAgB;GAElC,IAAM,IAAa,EAAO,gBAAiB,EAAY,EACjD,IAAgB,EAAO,mBAAoB,GAAY,GAAgB;AAe7E,GAbA,EAAU,QAAQ,EAAO,SAAS,OAClC,EAAU,aAAa,EAAO,SAAS,YACvC,EAAU,aAAc,EAAc,OAAO,EAAc,MAAO,EAElE,EACE,YAAa,GAAY,EAAS,EAEpC,EACE,YAAa,EAAO,YAAa,CACjC,YAAa,EAAoB,EAEnC,GAAkB,GAAW,GAAS,EAAQ,EAE9C,EAAU,aAAa;QAQvB,CAJA,EACE,KAAM,EAAO,YAAa,CAC1B,YAAa,EAAoB,EAEnC,EAAO,cAAe,GAAQ,GAAM,CAAC,aAAc,EAAoB;WAQnE,EAAO,gBA6BX,CA3BO,EAAO,SAAS,eAEtB,EAAO,SAAS,oBAAoB,EAI9B,EAAO,SAAS,kBAEtB,EAAO,SAAS,uBAAuB,EAIxC,EACE,YAAa,GAAY,EAAS,EAEpC,EACE,YAAa,EAAO,YAAa,CACjC,YAAa,EAAoB,EAEnC,GACE,KAAM,EAAO,SAAS,eAAgB,CACtC,aAAc,EAAS,EAEzB,EACE,KAAM,EAAO,SAAS,YAAa,CACnC,aAAc,EAAS,EAEzB,GAAgB,GAAQ,GAAS;WAEtB,EAAO,eAAgB;GAElC,IAAM,IAAa,EAAO,gBAAiB,EAAY;AAiBvD,GAfA,EACE,YAAa,GAAY,EAAS,EAEpC,EACE,YAAa,EAAO,YAAa,CACjC,YAAa,EAAoB,EAEnC,EACE,oBAAqB,GAAY,GAAS,CAC1C,aAAc,EAAS,EAEzB,EACE,iBAAkB,GAAY,EAAQ,CACtC,aAAc,EAAS,EAEzB,GAAgB,GAAQ,GAAS;QAIjC,GACE,cAAe,GAAQ,GAAO,CAC9B,aAAc,EAAoB;;CASvC,iBAAkB,GAAU;EAE3B,IAAM,EAAE,wBAAqB,MACzB,IAAQ;AAyBZ,SAxBA,EAAQ,SAAS,MAAU;AAE1B,OAAK,EAAO,mBAAmB,EAE9B,MAAS,EAAO;YAEL,EAAO,iBAAiB,GAAmB;AAEtD,QAAK,EAAI,mBAAmB,GAE3B,OAAU,MAAO,uEAAwE;AAI1F,SAAS,EAAO;SAIhB;IAIC,EAEI;;CAIR,qBAAsB,GAAS,GAAQ,GAAS;EAE/C,IAAM,EAAE,wBAAqB,MACzB,IAAQ;AACZ,IAAQ,SAAW,GAAQ,MAAO;AAEjC,OAAK,EAAO,mBAAmB,GAAmB;IAEjD,IAAM,IAAQ,EAAO;AACrB,SAAM,IAAI,IAAI,GAAG,IAAI,GAAO,IAG3B,CADA,EAAQ,KAAY,KAAK,IAAW,GACpC;cAIU,EAAO,iBAAiB,GAAmB;IAEtD,IAAM,EAAE,kBAAe,wBAAqB,GACxC,IAAiB,GACjB,IAAO;AAEX,WAAQ,IAAiB,KAAiB,IAAO,IAAmB;AAInE,SAAI;AAMH,MAJA,EAAO,aAAc,EAAM,EAE3B,EAAQ,KAAY,KAAQ,IAAW,GACvC,KACA;aAEO;AAMR;;SAOD,CADA,EAAQ,KAAU,GAClB;IAIC;;;AAQL,SAAS,GAAa,GAAI,GAAS;AAElC,QAAO,IAAK;;AAKb,SAAS,GAAe,GAAI,GAAQ,GAAS;AAE5C,SAAS,IAAO,CAAE,OAAe;;AAKlC,SAAS,GAAgB,GAAM,oBAAY,IAAI,KAAK,EAAG;AAEtD,CAAK,MAAM,QAAS,EAAM,GAEzB,EAAK,SAAS,MAAU,GAAgB,GAAQ,EAAW,CAAE,GAI7D,EAAK,UAAU,MAAS;AAEvB,GAAK,EAAM,UAAU,EAAM,UAAU,EAAM,aAE1C,EAAU,IAAK,EAAO;GAIrB;;AAOL,SAAS,GAAkB,GAAU,GAAQ,GAAS;AAErD,GAAO,WAAW;CAElB,IAAM,IAAY,EAAS,WACrB,IAAY,EAAS,OACrB,IAAU,EAAS,WAAW,UAC9B,IAAQ,EAAU,OAClB,IAAY,IAAY,EAAU,QAAQ,EAAQ,OAClD,IAAQ,KAAK,IAAK,IAAY,GAAO,EAAU,MAAO;AAC5D,MAAM,IAAI,IAAI,GAAO,IAAI,IAAQ,GAAO,IAAI,GAAG,KAAO;EAErD,IAAI,IAAK;AAQT,EAPK,MAEJ,IAAK,EAAU,KAAM,EAAI,GAI1B,EAAK,oBAAqB,GAAS,EAAI,CAAC,aAAc,EAAQ,EAC9D,EAAO,cAAeD,EAAM;;AAI7B,QAAO;;AAKR,SAAS,GAAoB,GAAQ,GAAO,GAAK,GAAU,GAAW,GAAuB;CAE5F,IAAM,EAAE,oBAAiB,YAAS,WAAQ,cAAW;AACrD,MAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;EAEvD,IAAM,IAAc,EAAiB,IAC/B,IAAK,GAAa,GAAa,EAAQ,EACvC,IAAa,GAAe,GAAa,GAAQ,EAAQ,EACzD,IAAS,EAAS;AACxB,MAAK,EAAU,GAAQ,GAAY,GAAW,EAAO,CAEpD,QAAO;;AAMT,QAAO;;AAIR,SAAS,GAAgB,GAAK,GAAS;AAMtC,CAJA,EAAK,KAAM,EAAO,OAAQ,CAAC,UAAW,CAAE,EAAO,OAAQ,EACvD,EAAI,IAAI,IAAKA,EAAM,EAEnB,EAAK,KAAM,EAAO,OAAQ,CAAC,UAAW,EAAO,OAAQ,EACrD,EAAI,IAAI,IAAKA,EAAM;;;;AC/oBpB,IAAM,qBAAsB,IAAI,GAAS,EACnC,qBAAsB,IAAI,GAAS,EACnC,qBAAsB,IAAI,GAAS,EACnC,oBAAuB,IAAI,GAAK,EAChC,qBAAiC,IAAI,GAAS,EAC9C,oBAA8B,IAAI,GAAS,EAC3C,qBAAuB,IAAI,GAAS,EACpC,KAAQ;CAAE;CAAK;CAAK;CAAK,EAEzB,KAAqB,IACrB,KAAqB,IAErB,qBAAuB,IAAI,GAAS,EACpC,qBAAuB,IAAI,GAAS,EACpC,qBAAuB,IAAI,GAAS,EACpC,qBAA2B,IAAI,GAAS,EACxC,qBAA2B,IAAI,GAAS,EACxC,qBAA2B,IAAI,GAAS,EAoBjC,KAAb,cAAoC,GAAY;CAE/C,IAAI,kBAAkB;AAErB,SAAO;;CAIR,YAAa,GAAM,IAAU,EAAE,EAAG;AAEjC,MAAK,CAAE,EAAK,OAEX,OAAU,MAAO,iDAAkD;AAapE,EANA,MAAO,EAAK,UAAU;GACrB,GAAG;IACD,IAAmB;GACrB,CAAE,EACH,KAAK,OAAO,GAEL,EAAS,MAEf,KAAK,KAAM,EAAS;;CAMtB,qBAAsB,GAAG,GAAc,GAAY;EAElD,IAAM,EAAE,SAAM,gBAAa,MACrB,IAAiB,KAAK,iBACtB,IAAQ,EAAS,QAAQ,EAAS,MAAM,QAAQ,MAGhD,KADM,IAAiB,EAAgB,KAAM,KAChC,GAEf,IAAK,IAAO,GACZ,IAAK,IAAO,GACZ,IAAK,IAAO;AAahB,EAXK,MAEJ,IAAK,EAAO,IACZ,IAAK,EAAO,IACZ,IAAK,EAAO,KAKb,EAAK,kBAAmB,GAAI,GAAK,EACjC,EAAK,kBAAmB,GAAI,GAAK,EACjC,EAAK,kBAAmB,GAAI,GAAK;AAGjC,OAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;GAEjC,IAAM,IAAO,GAAO,IACd,IAAI,GAAK,IACT,IAAI,GAAK,IACT,IAAI,GAAK,IAEX,IAAM;AAEV,GADK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM;GAErB,IAAI,IAAM;AAMV,GALK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM,IAGrB,EAAc,IAAY,KAAO,GACjC,EAAc,IAAY,IAAK,KAAM;;AAItC,SAAO;;CAeR,UAAW,GAAY;EAEtB,IAAM,IAAW,IAAI,GAAkB;AACvC,SAAO,MAAM,UACZ;GACC,GAAG;GACH,qBAAqB,EAAU;GAC/B,kBAAkB;GAClB,SAAS;GACT,CACD;;CAIF,gBAAiB,GAAQ,GAAW,IAAa,EAAE,EAAG;EAErD,IAAM,EAAE,gBAAa;AACrB,MAAK,MAAa,KAAA,EAEjB;EAID,IAAM,EAAE,mBAAgB,GAClB,EAAE,oBAAiB;AAGzB,EADA,GAAe,KAAM,EAAa,CAAC,QAAQ,EAC3C,EAAK,KAAM,EAAU,IAAK,CAAC,aAAc,GAAgB;EAEzD,IAAI,IAAa,MACb,IAAkB;AA8LtB,SA5LA,KAAK,UAAW;GACf,sBAAqB,MAEb,EAAI,gBAAiB,EAAK,OAAQ;GAG1C,mBAAkB,MAAO;AAExB,QAAK,GAAe;AAEnB,SAAK,CAAE,EAAK,aAAc,GAAK,GAAM,CAEpC,QAAA;KAID,IAAI;AAaJ,YAZK,EAAI,cAAe,EAAK,OAAQ,GAEpC,IAAO,KAIP,GAAK,aAAc,EAAa,EAChC,IAAO,EAAU,IAAI,OAAO,WAAY,GAAM,GAKxC,IAAO,IAAA,IAAA;UAId,QAAO,EAAK,cAAe,EAAK,GAAA,IAAA;;GAKlC,qBAAsB,GAAK,MAAc;IAGxC,IAAI,IAAQ;AAeZ,QAdA,AAUC,IAVI,EAAS,SAAA,IAEL,EAAK,kBAAmB,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAM,EAAa,GAE7D,EAAS,SAAA,IAEZ,EAAK,kBAAmB,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAM,EAAa,GAIhE,EAAK,kBAAmB,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAO,EAAa,EAIrE,CAAE,EAEN;AAKD,QAAQ,EAAM,OAAO,CAAC,aAAc,EAAa;IAGjD,IAAM,IAAO,EAAU,IAAI,OAAO,WAAY,EAAO;AACrD,QAAK,KAAQ,EAAU,QAAQ,KAAQ,EAAU,KAAM;AAEtD,SAAK,KAAgB,KAAQ,EAE5B;KAKD,IAAM,EAAE,gBAAa,MACf,EAAE,aAAU,GACZ,IAAY,KAAK,sBAAuB,EAAU,EAClD,IAAY,IAAY,GAE1B,IAAK,IAAY,GACjB,IAAK,IAAY,GACjB,IAAK,IAAY;AAErB,KAAK,MAEJ,IAAK,EAAM,MAAO,IAClB,IAAK,EAAM,MAAO,IAClB,IAAK,EAAM,MAAO;KAKnB,IAAM,IAAM;MACX,UAAU;MACV,OAAO,EAAM,OAAO;MACpB;MACA,IAAI;MACJ,KAAK;MACL,QAAQ;MACR,MAAM;OACL,GAAG;OACH,GAAG;OACH,GAAG;OACH,QAAQ,EAAS,UAAW,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAI,GAAS,CAAE;OAChE,eAAe;OACf;MACD,WAAW;MACX;AAED,SAAK,IAAqB;MAEzB,IAAM,IAAY,IAAI,GAAS;AAE/B,MADA,EAAS,aAAc,GAAa,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAW,EACpE,EAAI,YAAY;;KAKjB,IAAM,IAAK,EAAS,WAAW,IACzB,IAAM,EAAS,WAAW,KAC1B,IAAS,EAAS,WAAW;AAEnC,SAAK,GAAK;AAMT,MAJA,GAAK,oBAAqB,GAAI,EAAI,EAClC,GAAK,oBAAqB,GAAI,EAAI,EAClC,GAAK,oBAAqB,GAAI,EAAI,EAElC,EAAI,KAAK,IAAI,GAAS;MACtB,IAAM,IAAQ,EAAS,iBAAkB,GAAa,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAM,IAAM,IAAM,EAAI,GAAI;AACrG,MAAO,OAAqB,EAAI,KAAK;;AAItC,SAAK,GAAM;AAMV,MAJA,GAAK,oBAAqB,GAAK,EAAI,EACnC,GAAK,oBAAqB,GAAK,EAAI,EACnC,GAAK,oBAAqB,GAAK,EAAI,EAEnC,EAAI,MAAM,IAAI,GAAS;MACvB,IAAM,IAAS,EAAS,iBAAkB,GAAa,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAM,IAAM,IAAM,EAAI,IAAK;AAEvG,MADO,OAAqB,EAAI,MAAM,IACjC,OAAqB,EAAI,MAAM,EAAI;;AAIzC,SAAK,GAAS;AAMb,MAJA,GAAS,oBAAqB,GAAQ,EAAI,EAC1C,GAAS,oBAAqB,GAAQ,EAAI,EAC1C,GAAS,oBAAqB,GAAQ,EAAI,EAE1C,EAAI,SAAS,IAAI,GAAS;MAC1B,IAAM,IAAY,EAAS,iBAAkB,GAAa,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAU,IAAU,IAAU,EAAI,OAAQ;AAOzH,MANK,EAAI,OAAO,IAAK,EAAK,UAAW,GAAG,KAEvC,EAAI,OAAO,eAAgB,GAAK,EAI1B,OAAqB,EAAI,SAAS;;AAQ1C,KAHA,IAAkB,EAAI,UACtB,IAAa,GAEN,KAEN,EAAW,KAAM,EAAK;;;GAOzB,CAAE,EAEE,KAAgB,KAEpB,EAAW,KAAM,EAAY,EAIvB;;;AAMT,SAAS,GACR,GACA,GACA,GACA,GACA,GACA,GACA,GACC;CAED,IAAM,EAAE,SAAM,gBAAa,GACrB,IAAQ,EAAS,QAAQ,EAAS,MAAM,QAAQ;AAEtD,MAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;EAEvD,IAAM,IAAM,EAAI,sBAAuB,EAAG,EAEtC,IAAK,IAAI,IAAM,GACf,IAAK,IAAI,IAAM,GACf,IAAK,IAAI,IAAM;AAenB,MAbK,MAEJ,IAAK,EAAO,IACZ,IAAK,EAAO,IACZ,IAAK,EAAO,KAIb,EAAK,kBAAmB,GAAI,EAAS,EAAG,EACxC,EAAK,kBAAmB,GAAI,EAAS,EAAG,EACxC,EAAK,kBAAmB,GAAI,EAAS,EAAG,EACxC,EAAS,cAAc,IAElB,EAAwB,GAAU,GAAG,GAAW,EAAO,CAE3D,QAAO;;AAMT,QAAO"}
1	+ {"version":3,"file":"src-Dg0wYIom.mjs","names":["shapecastFunc","temp1","IS_GT_REVISION_169","IS_LT_REVISION_161","_uvA","_uvB","_uvC","_normalA","_normalB","_normalC","iterateOverTriangles","_raycast","_xyzFields","_raycastFirst","boundingBox","triangle","triangle2","invertedMat","obb","obb2","_intersectsGeometry","tempMatrix","obb","obb2","temp1","temp2","temp3","temp4","obb","obb2","_ray","_inverseMatrix","iterateOverTriangles","_inverseMatrix","_vec","_ray","BVHShaderGLSL.bvh_struct_definitions","BVHShaderGLSL.bvh_distance_functions","BVHShaderGLSL.common_functions","BVHShaderGLSL.bvh_ray_functions"],"sources":["../../../../node_modules/three-mesh-bvh/src/core/Constants.js","../../../../node_modules/three-mesh-bvh/src/utils/ArrayBoxUtilities.js","../../../../node_modules/three-mesh-bvh/src/core/utils/nodeBufferUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/computeBoundsUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/splitUtils.js","../../../../node_modules/three-mesh-bvh/src/core/BVHNode.js","../../../../node_modules/three-mesh-bvh/src/core/build/sortUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/buildUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/buildTree.js","../../../../node_modules/three-mesh-bvh/src/utils/PrimitivePool.js","../../../../node_modules/three-mesh-bvh/src/core/utils/BufferStack.js","../../../../node_modules/three-mesh-bvh/src/core/cast/shapecast.js","../../../../node_modules/three-mesh-bvh/src/core/cast/bvhcast.js","../../../../node_modules/three-mesh-bvh/src/core/BVHTraversalHelper.js","../../../../node_modules/three-mesh-bvh/src/core/BVH.js","../../../../node_modules/three-mesh-bvh/src/utils/BufferUtils.js","../../../../node_modules/three-mesh-bvh/src/core/build/geometryUtils.js","../../../../node_modules/three-mesh-bvh/src/core/GeometryBVH.js","../../../../node_modules/three-mesh-bvh/src/math/SeparatingAxisBounds.js","../../../../node_modules/three-mesh-bvh/src/math/MathUtilities.js","../../../../node_modules/three-mesh-bvh/src/math/ExtendedTriangle.js","../../../../node_modules/three-mesh-bvh/src/math/OrientedBox.js","../../../../node_modules/three-mesh-bvh/src/utils/ExtendedTrianglePool.js","../../../../node_modules/three-mesh-bvh/src/core/cast/closestPointToPoint.js","../../../../node_modules/three-mesh-bvh/src/utils/ThreeRayIntersectUtilities.js","../../../../node_modules/three-mesh-bvh/src/utils/TriangleUtilities.js","../../../../node_modules/three-mesh-bvh/src/core/utils/iterationUtils.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/refit.generated.js","../../../../node_modules/three-mesh-bvh/src/core/utils/intersectUtils.js","../../../../node_modules/three-mesh-bvh/src/core/utils/iterationUtils_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/raycast.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/raycastFirst.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/refit_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/raycast_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/raycastFirst_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry_indirect.generated.js","../../../../node_modules/three-mesh-bvh/src/utils/GeometryRayIntersectUtilities.js","../../../../node_modules/three-mesh-bvh/src/core/MeshBVH.js","../../../../node_modules/three-mesh-bvh/src/core/ObjectBVH.js","../../../../node_modules/three-mesh-bvh/src/core/SkinnedMeshBVH.js","../../../../node_modules/three-mesh-bvh/src/webgl/glsl/common_functions.glsl.js","../../../../node_modules/three-mesh-bvh/src/webgl/glsl/bvh_distance_functions.glsl.js","../../../../node_modules/three-mesh-bvh/src/webgl/glsl/bvh_ray_functions.glsl.js","../../../../node_modules/three-mesh-bvh/src/webgl/glsl/bvh_struct_definitions.glsl.js","../../../../node_modules/three-mesh-bvh/src/index.js"],"sourcesContent":["// Split strategy constants\n\n/*\n Option for splitting each BVH node down the center of the longest axis of the bounds.\n \n This is the fastest construction option and will yield a good, performant bounds.\n * @type {number}\n /\nexport const CENTER = 0;\n\n/\n Option for splitting each BVH node at the average point along the longest axis for\n * all triangle centroids in the bounds.\n \n This strategy may be better than `CENTER` with some geometry.\n * @type {number}\n /\nexport const AVERAGE = 1;\n\n/\n Option to use a Surface Area Heuristic to split the bounds more optimally. This SAH\n * implementation tests 32 discrete splits in each node along each axis to determine\n * which split is the lowest cost.\n \n This is the slowest construction option but will yield the best bounds of the three\n * options and use the least memory.\n * @type {number}\n /\nexport const SAH = 2;\n\n// Traversal constants\n\n/\n Indicates the shape did not intersect the given bounding box.\n * @type {number}\n /\nexport const NOT_INTERSECTED = 0;\n\n/\n Indicates the shape did intersect the given bounding box.\n * @type {number}\n /\nexport const INTERSECTED = 1;\n\n/\n Indicate the shape entirely contains the given bounding box.\n * @type {number}\n /\nexport const CONTAINED = 2;\n\n// SAH cost constants\n// TODO: hone these costs more. The relative difference between them should be the\n// difference in measured time to perform a primitive intersection vs traversing\n// bounds.\n// TODO: could be tuned per primitive type (triangles vs lines vs points)\nexport const PRIMITIVE_INTERSECT_COST = 1.25;\nexport const TRAVERSAL_COST = 1;\n\n\n// Build constants\nexport const BYTES_PER_NODE = 6 4 + 4 + 4;\nexport const UINT32_PER_NODE = BYTES_PER_NODE / 4;\nexport const IS_LEAFNODE_FLAG = 0xFFFF;\n\n// Bit masks for 32 bit node data\nexport const LEAFNODE_MASK_32 = IS_LEAFNODE_FLAG << 16;\n\n// EPSILON for computing floating point error during build\n// https://en.wikipedia.org/wiki/Machine_epsilon#Values_for_standard_hardware_floating_point_arithmetics\nexport const FLOAT32_EPSILON = Math.pow( 2, - 24 );\n\nexport const SKIP_GENERATION = Symbol( 'SKIP_GENERATION' );\n\nexport const DEFAULT_OPTIONS = {\n\tstrategy: CENTER,\n\tmaxDepth: 40,\n\ttargetLeafSize: 10,\n\tuseSharedArrayBuffer: false,\n\tsetBoundingBox: true,\n\tonProgress: null,\n\tindirect: false,\n\tverbose: true,\n\trange: null,\n\t[ SKIP_GENERATION ]: false,\n};\n\n","export function arrayToBox( nodeIndex32, array, target ) {\n\n\ttarget.min.x = array[ nodeIndex32 ];\n\ttarget.min.y = array[ nodeIndex32 + 1 ];\n\ttarget.min.z = array[ nodeIndex32 + 2 ];\n\n\ttarget.max.x = array[ nodeIndex32 + 3 ];\n\ttarget.max.y = array[ nodeIndex32 + 4 ];\n\ttarget.max.z = array[ nodeIndex32 + 5 ];\n\n\treturn target;\n\n}\n\nexport function makeEmptyBounds( target ) {\n\n\ttarget[ 0 ] = target[ 1 ] = target[ 2 ] = Infinity;\n\ttarget[ 3 ] = target[ 4 ] = target[ 5 ] = - Infinity;\n\n}\n\nexport function getLongestEdgeIndex( bounds ) {\n\n\tlet splitDimIdx = - 1;\n\tlet splitDist = - Infinity;\n\n\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\tconst dist = bounds[ i + 3 ] - bounds[ i ];\n\t\tif ( dist > splitDist ) {\n\n\t\t\tsplitDist = dist;\n\t\t\tsplitDimIdx = i;\n\n\t\t}\n\n\t}\n\n\treturn splitDimIdx;\n\n}\n\n// copies bounds a into bounds b\nexport function copyBounds( source, target ) {\n\n\ttarget.set( source );\n\n}\n\n// sets bounds target to the union of bounds a and b\nexport function unionBounds( a, b, target ) {\n\n\tlet aVal, bVal;\n\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\tconst d3 = d + 3;\n\n\t\t// set the minimum values\n\t\taVal = a[ d ];\n\t\tbVal = b[ d ];\n\t\ttarget[ d ] = aVal < bVal ? aVal : bVal;\n\n\t\t// set the max values\n\t\taVal = a[ d3 ];\n\t\tbVal = b[ d3 ];\n\t\ttarget[ d3 ] = aVal > bVal ? aVal : bVal;\n\n\t}\n\n}\n\n// expands the given bounds by the provided primitive bounds\nexport function expandByPrimitiveBounds( startIndex, primitiveBounds, bounds ) {\n\n\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\tconst tCenter = primitiveBounds[ startIndex + 2 * d ];\n\t\tconst tHalf = primitiveBounds[ startIndex + 2 * d + 1 ];\n\n\t\tconst tMin = tCenter - tHalf;\n\t\tconst tMax = tCenter + tHalf;\n\n\t\tif ( tMin < bounds[ d ] ) {\n\n\t\t\tbounds[ d ] = tMin;\n\n\t\t}\n\n\t\tif ( tMax > bounds[ d + 3 ] ) {\n\n\t\t\tbounds[ d + 3 ] = tMax;\n\n\t\t}\n\n\t}\n\n}\n\n// compute bounds surface area\nexport function computeSurfaceArea( bounds ) {\n\n\tconst d0 = bounds[ 3 ] - bounds[ 0 ];\n\tconst d1 = bounds[ 4 ] - bounds[ 1 ];\n\tconst d2 = bounds[ 5 ] - bounds[ 2 ];\n\n\treturn 2 * ( d0 * d1 + d1 * d2 + d2 * d0 );\n\n}\n","import { IS_LEAFNODE_FLAG, UINT32_PER_NODE } from '../Constants.js';\n\nexport function IS_LEAF( n16, uint16Array ) {\n\n\treturn uint16Array[ n16 + 15 ] === IS_LEAFNODE_FLAG;\n\n}\n\nexport function OFFSET( n32, uint32Array ) {\n\n\treturn uint32Array[ n32 + 6 ];\n\n}\n\nexport function COUNT( n16, uint16Array ) {\n\n\treturn uint16Array[ n16 + 14 ];\n\n}\n\n// Returns the uint32-aligned offset of the left child node for performance\nexport function LEFT_NODE( n32 ) {\n\n\treturn n32 + UINT32_PER_NODE;\n\n}\n\n// Returns the uint32-aligned offset of the right child node for performance\nexport function RIGHT_NODE( n32, uint32Array ) {\n\n\t// stored value is relative offset from parent, convert to absolute uint32 index\n\tconst relativeOffset = uint32Array[ n32 + 6 ];\n\treturn n32 + relativeOffset * UINT32_PER_NODE;\n\n}\n\nexport function SPLIT_AXIS( n32, uint32Array ) {\n\n\treturn uint32Array[ n32 + 7 ];\n\n}\n\nexport function BOUNDING_DATA_INDEX( n32 ) {\n\n\treturn n32;\n\n}\n","// computes the union of the bounds of all of the given primitives and puts the resulting box in \"target\".\n// A bounding box is computed for the centroids of the primitives, as well, and placed in \"centroidTarget\".\n// These are computed together to avoid redundant accesses to bounds array.\nexport function getBounds( primitiveBounds, offset, count, target, centroidTarget ) {\n\n\tlet minx = Infinity;\n\tlet miny = Infinity;\n\tlet minz = Infinity;\n\tlet maxx = - Infinity;\n\tlet maxy = - Infinity;\n\tlet maxz = - Infinity;\n\n\tlet cminx = Infinity;\n\tlet cminy = Infinity;\n\tlet cminz = Infinity;\n\tlet cmaxx = - Infinity;\n\tlet cmaxy = - Infinity;\n\tlet cmaxz = - Infinity;\n\n\tconst boundsOffset = primitiveBounds.offset \|\| 0;\n\tfor ( let i = ( offset - boundsOffset ) * 6, end = ( offset + count - boundsOffset ) * 6; i < end; i += 6 ) {\n\n\t\tconst cx = primitiveBounds[ i + 0 ];\n\t\tconst hx = primitiveBounds[ i + 1 ];\n\t\tconst lx = cx - hx;\n\t\tconst rx = cx + hx;\n\t\tif ( lx < minx ) minx = lx;\n\t\tif ( rx > maxx ) maxx = rx;\n\t\tif ( cx < cminx ) cminx = cx;\n\t\tif ( cx > cmaxx ) cmaxx = cx;\n\n\t\tconst cy = primitiveBounds[ i + 2 ];\n\t\tconst hy = primitiveBounds[ i + 3 ];\n\t\tconst ly = cy - hy;\n\t\tconst ry = cy + hy;\n\t\tif ( ly < miny ) miny = ly;\n\t\tif ( ry > maxy ) maxy = ry;\n\t\tif ( cy < cminy ) cminy = cy;\n\t\tif ( cy > cmaxy ) cmaxy = cy;\n\n\t\tconst cz = primitiveBounds[ i + 4 ];\n\t\tconst hz = primitiveBounds[ i + 5 ];\n\t\tconst lz = cz - hz;\n\t\tconst rz = cz + hz;\n\t\tif ( lz < minz ) minz = lz;\n\t\tif ( rz > maxz ) maxz = rz;\n\t\tif ( cz < cminz ) cminz = cz;\n\t\tif ( cz > cmaxz ) cmaxz = cz;\n\n\t}\n\n\ttarget[ 0 ] = minx;\n\ttarget[ 1 ] = miny;\n\ttarget[ 2 ] = minz;\n\n\ttarget[ 3 ] = maxx;\n\ttarget[ 4 ] = maxy;\n\ttarget[ 5 ] = maxz;\n\n\tcentroidTarget[ 0 ] = cminx;\n\tcentroidTarget[ 1 ] = cminy;\n\tcentroidTarget[ 2 ] = cminz;\n\n\tcentroidTarget[ 3 ] = cmaxx;\n\tcentroidTarget[ 4 ] = cmaxy;\n\tcentroidTarget[ 5 ] = cmaxz;\n\n}\n","import { getLongestEdgeIndex, computeSurfaceArea, copyBounds, unionBounds, expandByPrimitiveBounds } from '../../utils/ArrayBoxUtilities.js';\nimport { CENTER, AVERAGE, SAH, PRIMITIVE_INTERSECT_COST, TRAVERSAL_COST } from '../Constants.js';\n\nconst BIN_COUNT = 32;\nconst binsSort = ( a, b ) => a.candidate - b.candidate;\nconst sahBins = /* @__PURE__ / new Array( BIN_COUNT ).fill().map( () => {\n\n\treturn {\n\n\t\tcount: 0,\n\t\tbounds: new Float32Array( 6 ),\n\t\trightCacheBounds: new Float32Array( 6 ),\n\t\tleftCacheBounds: new Float32Array( 6 ),\n\t\tcandidate: 0,\n\n\t};\n\n} );\nconst leftBounds = / @__PURE__ / new Float32Array( 6 );\n\nexport function getOptimalSplit( nodeBoundingData, centroidBoundingData, primitiveBounds, offset, count, strategy ) {\n\n\tlet axis = - 1;\n\tlet pos = 0;\n\n\t// Center\n\tif ( strategy === CENTER ) {\n\n\t\taxis = getLongestEdgeIndex( centroidBoundingData );\n\t\tif ( axis !== - 1 ) {\n\n\t\t\tpos = ( centroidBoundingData[ axis ] + centroidBoundingData[ axis + 3 ] ) / 2;\n\n\t\t}\n\n\t} else if ( strategy === AVERAGE ) {\n\n\t\taxis = getLongestEdgeIndex( nodeBoundingData );\n\t\tif ( axis !== - 1 ) {\n\n\t\t\tpos = getAverage( primitiveBounds, offset, count, axis );\n\n\t\t}\n\n\t} else if ( strategy === SAH ) {\n\n\t\tconst rootSurfaceArea = computeSurfaceArea( nodeBoundingData );\n\t\tlet bestCost = PRIMITIVE_INTERSECT_COST count;\n\n\t\t// iterate over all axes\n\t\tconst boundsOffset = primitiveBounds.offset \|\| 0;\n\t\tconst cStart = ( offset - boundsOffset ) * 6;\n\t\tconst cEnd = ( offset + count - boundsOffset ) * 6;\n\t\tfor ( let a = 0; a < 3; a ++ ) {\n\n\t\t\tconst axisLeft = centroidBoundingData[ a ];\n\t\t\tconst axisRight = centroidBoundingData[ a + 3 ];\n\t\t\tconst axisLength = axisRight - axisLeft;\n\t\t\tconst binWidth = axisLength / BIN_COUNT;\n\n\t\t\t// If we have fewer primitives than we're planning to split then just check all\n\t\t\t// the primitive positions because it will be faster.\n\t\t\tif ( count < BIN_COUNT / 4 ) {\n\n\t\t\t\t// initialize the bin candidates\n\t\t\t\tconst truncatedBins = [ ...sahBins ];\n\t\t\t\ttruncatedBins.length = count;\n\n\t\t\t\t// set the candidates\n\t\t\t\tlet b = 0;\n\t\t\t\tfor ( let c = cStart; c < cEnd; c += 6, b ++ ) {\n\n\t\t\t\t\tconst bin = truncatedBins[ b ];\n\t\t\t\t\tbin.candidate = primitiveBounds[ c + 2 * a ];\n\t\t\t\t\tbin.count = 0;\n\n\t\t\t\t\tconst {\n\t\t\t\t\t\tbounds,\n\t\t\t\t\t\tleftCacheBounds,\n\t\t\t\t\t\trightCacheBounds,\n\t\t\t\t\t} = bin;\n\t\t\t\t\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\t\t\t\t\trightCacheBounds[ d ] = Infinity;\n\t\t\t\t\t\trightCacheBounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t\tleftCacheBounds[ d ] = Infinity;\n\t\t\t\t\t\tleftCacheBounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t\tbounds[ d ] = Infinity;\n\t\t\t\t\t\tbounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t}\n\n\t\t\t\t\texpandByPrimitiveBounds( c, primitiveBounds, bounds );\n\n\t\t\t\t}\n\n\t\t\t\ttruncatedBins.sort( binsSort );\n\n\t\t\t\t// remove redundant splits\n\t\t\t\tlet splitCount = count;\n\t\t\t\tfor ( let bi = 0; bi < splitCount; bi ++ ) {\n\n\t\t\t\t\tconst bin = truncatedBins[ bi ];\n\t\t\t\t\twhile ( bi + 1 < splitCount && truncatedBins[ bi + 1 ].candidate === bin.candidate ) {\n\n\t\t\t\t\t\ttruncatedBins.splice( bi + 1, 1 );\n\t\t\t\t\t\tsplitCount --;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// find the appropriate bin for each primitive and expand the bounds.\n\t\t\t\tfor ( let c = cStart; c < cEnd; c += 6 ) {\n\n\t\t\t\t\tconst center = primitiveBounds[ c + 2 * a ];\n\t\t\t\t\tfor ( let bi = 0; bi < splitCount; bi ++ ) {\n\n\t\t\t\t\t\tconst bin = truncatedBins[ bi ];\n\t\t\t\t\t\tif ( center >= bin.candidate ) {\n\n\t\t\t\t\t\t\texpandByPrimitiveBounds( c, primitiveBounds, bin.rightCacheBounds );\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\texpandByPrimitiveBounds( c, primitiveBounds, bin.leftCacheBounds );\n\t\t\t\t\t\t\tbin.count ++;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// expand all the bounds\n\t\t\t\tfor ( let bi = 0; bi < splitCount; bi ++ ) {\n\n\t\t\t\t\tconst bin = truncatedBins[ bi ];\n\t\t\t\t\tconst leftCount = bin.count;\n\t\t\t\t\tconst rightCount = count - bin.count;\n\n\t\t\t\t\t// check the cost of this split\n\t\t\t\t\tconst leftBounds = bin.leftCacheBounds;\n\t\t\t\t\tconst rightBounds = bin.rightCacheBounds;\n\n\t\t\t\t\tlet leftProb = 0;\n\t\t\t\t\tif ( leftCount !== 0 ) {\n\n\t\t\t\t\t\tleftProb = computeSurfaceArea( leftBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tlet rightProb = 0;\n\t\t\t\t\tif ( rightCount !== 0 ) {\n\n\t\t\t\t\t\trightProb = computeSurfaceArea( rightBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tconst cost = TRAVERSAL_COST + PRIMITIVE_INTERSECT_COST * (\n\t\t\t\t\t\tleftProb * leftCount + rightProb * rightCount\n\t\t\t\t\t);\n\n\t\t\t\t\tif ( cost < bestCost ) {\n\n\t\t\t\t\t\taxis = a;\n\t\t\t\t\t\tbestCost = cost;\n\t\t\t\t\t\tpos = bin.candidate;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// reset the bins\n\t\t\t\tfor ( let i = 0; i < BIN_COUNT; i ++ ) {\n\n\t\t\t\t\tconst bin = sahBins[ i ];\n\t\t\t\t\tbin.count = 0;\n\t\t\t\t\tbin.candidate = axisLeft + binWidth + i * binWidth;\n\n\t\t\t\t\tconst bounds = bin.bounds;\n\t\t\t\t\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\t\t\t\t\tbounds[ d ] = Infinity;\n\t\t\t\t\t\tbounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// iterate over all center positions\n\t\t\t\tfor ( let c = cStart; c < cEnd; c += 6 ) {\n\n\t\t\t\t\tconst triCenter = primitiveBounds[ c + 2 * a ];\n\t\t\t\t\tconst relativeCenter = triCenter - axisLeft;\n\n\t\t\t\t\t// in the partition function if the centroid lies on the split plane then it is\n\t\t\t\t\t// considered to be on the right side of the split\n\t\t\t\t\tlet binIndex = ~ ~ ( relativeCenter / binWidth );\n\t\t\t\t\tif ( binIndex >= BIN_COUNT ) binIndex = BIN_COUNT - 1;\n\n\t\t\t\t\tconst bin = sahBins[ binIndex ];\n\t\t\t\t\tbin.count ++;\n\n\t\t\t\t\texpandByPrimitiveBounds( c, primitiveBounds, bin.bounds );\n\n\t\t\t\t}\n\n\t\t\t\t// cache the unioned bounds from right to left so we don't have to regenerate them each time\n\t\t\t\tconst lastBin = sahBins[ BIN_COUNT - 1 ];\n\t\t\t\tcopyBounds( lastBin.bounds, lastBin.rightCacheBounds );\n\t\t\t\tfor ( let i = BIN_COUNT - 2; i >= 0; i -- ) {\n\n\t\t\t\t\tconst bin = sahBins[ i ];\n\t\t\t\t\tconst nextBin = sahBins[ i + 1 ];\n\t\t\t\t\tunionBounds( bin.bounds, nextBin.rightCacheBounds, bin.rightCacheBounds );\n\n\t\t\t\t}\n\n\t\t\t\tlet leftCount = 0;\n\t\t\t\tfor ( let i = 0; i < BIN_COUNT - 1; i ++ ) {\n\n\t\t\t\t\tconst bin = sahBins[ i ];\n\t\t\t\t\tconst binCount = bin.count;\n\t\t\t\t\tconst bounds = bin.bounds;\n\n\t\t\t\t\tconst nextBin = sahBins[ i + 1 ];\n\t\t\t\t\tconst rightBounds = nextBin.rightCacheBounds;\n\n\t\t\t\t\t// don't do anything with the bounds if the new bounds have no primitives\n\t\t\t\t\tif ( binCount !== 0 ) {\n\n\t\t\t\t\t\tif ( leftCount === 0 ) {\n\n\t\t\t\t\t\t\tcopyBounds( bounds, leftBounds );\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\tunionBounds( bounds, leftBounds, leftBounds );\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t\tleftCount += binCount;\n\n\t\t\t\t\t// check the cost of this split\n\t\t\t\t\tlet leftProb = 0;\n\t\t\t\t\tlet rightProb = 0;\n\n\t\t\t\t\tif ( leftCount !== 0 ) {\n\n\t\t\t\t\t\tleftProb = computeSurfaceArea( leftBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tconst rightCount = count - leftCount;\n\t\t\t\t\tif ( rightCount !== 0 ) {\n\n\t\t\t\t\t\trightProb = computeSurfaceArea( rightBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tconst cost = TRAVERSAL_COST + PRIMITIVE_INTERSECT_COST * (\n\t\t\t\t\t\tleftProb * leftCount + rightProb * rightCount\n\t\t\t\t\t);\n\n\t\t\t\t\tif ( cost < bestCost ) {\n\n\t\t\t\t\t\taxis = a;\n\t\t\t\t\t\tbestCost = cost;\n\t\t\t\t\t\tpos = bin.candidate;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t} else {\n\n\t\tconsole.warn( `BVH: Invalid build strategy value ${ strategy } used.` );\n\n\t}\n\n\treturn { axis, pos };\n\n}\n\n// returns the average coordinate on the specified axis of all the provided primitives\nfunction getAverage( primitiveBounds, offset, count, axis ) {\n\n\tlet avg = 0;\n\tconst boundsOffset = primitiveBounds.offset;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\tavg += primitiveBounds[ ( i - boundsOffset ) * 6 + axis * 2 ];\n\n\t}\n\n\treturn avg / count;\n\n}\n","export class BVHNode {\n\n\tconstructor() {\n\n\t\t// internal nodes have boundingData, left, right, and splitAxis\n\t\t// leaf nodes have offset and count (referring to primitives in the mesh geometry)\n\n\t\tthis.boundingData = new Float32Array( 6 );\n\n\t}\n\n}\n","// reorders the partition buffer such that for `count` elements after `offset`, elements on the left side of the split\n// will be on the left and elements on the right side of the split will be on the right. returns the index\n// of the first element on the right side, or offset + count if there are no elements on the right side.\nexport function partition( buffer, stride, primitiveBounds, offset, count, split ) {\n\n\tlet left = offset;\n\tlet right = offset + count - 1;\n\tconst pos = split.pos;\n\tconst axisOffset = split.axis * 2;\n\tconst boundsOffset = primitiveBounds.offset \|\| 0;\n\n\t// hoare partitioning, see e.g. https://en.wikipedia.org/wiki/Quicksort#Hoare_partition_scheme\n\twhile ( true ) {\n\n\t\twhile ( left <= right && primitiveBounds[ ( left - boundsOffset ) * 6 + axisOffset ] < pos ) {\n\n\t\t\tleft ++;\n\n\t\t}\n\n\t\t// if a primitive center lies on the partition plane it is considered to be on the right side\n\t\twhile ( left <= right && primitiveBounds[ ( right - boundsOffset ) * 6 + axisOffset ] >= pos ) {\n\n\t\t\tright --;\n\n\t\t}\n\n\t\tif ( left < right ) {\n\n\t\t\t// we need to swap all of the information associated with the primitives at index\n\t\t\t// left and right; that's the elements in the partition buffer and the bounds\n\t\t\tfor ( let i = 0; i < stride; i ++ ) {\n\n\t\t\t\tlet t0 = buffer[ left * stride + i ];\n\t\t\t\tbuffer[ left * stride + i ] = buffer[ right * stride + i ];\n\t\t\t\tbuffer[ right * stride + i ] = t0;\n\n\t\t\t}\n\n\t\t\t// swap bounds\n\t\t\tfor ( let i = 0; i < 6; i ++ ) {\n\n\t\t\t\tconst l = left - boundsOffset;\n\t\t\t\tconst r = right - boundsOffset;\n\t\t\t\tconst tb = primitiveBounds[ l * 6 + i ];\n\t\t\t\tprimitiveBounds[ l * 6 + i ] = primitiveBounds[ r * 6 + i ];\n\t\t\t\tprimitiveBounds[ r * 6 + i ] = tb;\n\n\t\t\t}\n\n\t\t\tleft ++;\n\t\t\tright --;\n\n\t\t} else {\n\n\t\t\treturn left;\n\n\t\t}\n\n\t}\n\n}\n","import { BYTES_PER_NODE, IS_LEAFNODE_FLAG } from '../Constants.js';\n\nlet float32Array, uint32Array, uint16Array, uint8Array;\nconst MAX_POINTER = Math.pow( 2, 32 );\n\nexport function countNodes( node ) {\n\n\tif ( 'count' in node ) {\n\n\t\treturn 1;\n\n\t} else {\n\n\t\treturn 1 + countNodes( node.left ) + countNodes( node.right );\n\n\t}\n\n}\n\nexport function populateBuffer( byteOffset, node, buffer ) {\n\n\tfloat32Array = new Float32Array( buffer );\n\tuint32Array = new Uint32Array( buffer );\n\tuint16Array = new Uint16Array( buffer );\n\tuint8Array = new Uint8Array( buffer );\n\n\treturn _populateBuffer( byteOffset, node );\n\n}\n\n// pack structure\n// boundingData \t\t\t\t: 6 float32\n// right / offset \t\t\t\t: 1 uint32\n// splitAxis / isLeaf + count \t: 1 uint32 / 2 uint16\nfunction _populateBuffer( byteOffset, node ) {\n\n\tconst node32Index = byteOffset / 4;\n\tconst node16Index = byteOffset / 2;\n\tconst isLeaf = 'count' in node;\n\tconst boundingData = node.boundingData;\n\tfor ( let i = 0; i < 6; i ++ ) {\n\n\t\tfloat32Array[ node32Index + i ] = boundingData[ i ];\n\n\t}\n\n\tif ( isLeaf ) {\n\n\t\tif ( node.buffer ) {\n\n\t\t\tuint8Array.set( new Uint8Array( node.buffer ), byteOffset );\n\t\t\treturn byteOffset + node.buffer.byteLength;\n\n\t\t} else {\n\n\t\t\tuint32Array[ node32Index + 6 ] = node.offset;\n\t\t\tuint16Array[ node16Index + 14 ] = node.count;\n\t\t\tuint16Array[ node16Index + 15 ] = IS_LEAFNODE_FLAG;\n\t\t\treturn byteOffset + BYTES_PER_NODE;\n\n\t\t}\n\n\t} else {\n\n\t\tconst { left, right, splitAxis } = node;\n\n\t\t// fill in the left node contents\n\t\tconst leftByteOffset = byteOffset + BYTES_PER_NODE;\n\t\tlet rightByteOffset = _populateBuffer( leftByteOffset, left );\n\n\t\t// calculate relative offset from parent to right child\n\t\tconst currentNodeIndex = byteOffset / BYTES_PER_NODE;\n\t\tconst rightNodeIndex = rightByteOffset / BYTES_PER_NODE;\n\t\tconst relativeRightIndex = rightNodeIndex - currentNodeIndex;\n\n\t\t// check if the relative offset is too high\n\t\tif ( relativeRightIndex > MAX_POINTER ) {\n\n\t\t\tthrow new Error( 'MeshBVH: Cannot store relative child node offset greater than 32 bits.' );\n\n\t\t}\n\n\t\t// fill in the right node contents (store as relative offset)\n\t\tuint32Array[ node32Index + 6 ] = relativeRightIndex;\n\t\tuint32Array[ node32Index + 7 ] = splitAxis;\n\n\t\t// return the next available buffer pointer\n\t\treturn _populateBuffer( rightByteOffset, right );\n\n\t}\n\n}\n","import { getBounds } from './computeBoundsUtils.js';\nimport { getOptimalSplit } from './splitUtils.js';\nimport { getLongestEdgeIndex } from '../../utils/ArrayBoxUtilities.js';\nimport { BVHNode } from '../BVHNode.js';\nimport { BYTES_PER_NODE } from '../Constants.js';\n\nimport { partition } from './sortUtils.js';\nimport { countNodes, populateBuffer } from './buildUtils.js';\n\nexport function buildTree( bvh, primitiveBounds, offset, count, options, loadRange ) {\n\n\t// expand variables\n\tconst {\n\t\tmaxDepth,\n\t\tverbose,\n\t\ttargetLeafSize,\n\t\t_strictLeafSize = Infinity,\n\t\tstrategy,\n\t\tonProgress,\n\t} = options;\n\n\tconst partitionBuffer = bvh.primitiveBuffer;\n\tconst partitionStride = bvh.primitiveBufferStride;\n\n\t// generate intermediate variables\n\tconst cacheCentroidBoundingData = new Float32Array( 6 );\n\tlet reachedMaxDepth = false;\n\n\tconst root = new BVHNode();\n\tgetBounds( primitiveBounds, offset, count, root.boundingData, cacheCentroidBoundingData );\n\tsplitNode( root, offset, count, cacheCentroidBoundingData );\n\treturn root;\n\n\tfunction triggerProgress( primitivesProcessed ) {\n\n\t\tif ( onProgress ) {\n\n\t\t\tonProgress( ( primitivesProcessed - loadRange.offset ) / loadRange.count );\n\n\t\t}\n\n\t}\n\n\t// either recursively splits the given node, creating left and right subtrees for it, or makes it a leaf node,\n\t// recording the offset and count of its primitives and writing them into the reordered geometry index.\n\tfunction splitNode( node, offset, count, centroidBoundingData = null, depth = 0 ) {\n\n\t\tif ( ! reachedMaxDepth && depth >= maxDepth ) {\n\n\t\t\treachedMaxDepth = true;\n\t\t\tif ( verbose ) {\n\n\t\t\t\tconsole.warn( `BVH: Max depth of ${ maxDepth } reached when generating BVH. Consider increasing maxDepth.` );\n\n\t\t\t}\n\n\t\t}\n\n\t\t// A hard guarantee that no leaf exceeds \"_strictLeafSize\" primitives. When this node is over\n\t\t// that limit it must keep splitting regardless of the heuristic.\n\t\tconst mustSplit = count > _strictLeafSize;\n\n\t\t// early out if we've met our capacity - unless the strict guarantee still requires a split\n\t\tif ( ( count <= targetLeafSize && ! mustSplit ) \|\| depth >= maxDepth ) {\n\n\t\t\ttriggerProgress( offset + count );\n\t\t\tnode.offset = offset;\n\t\t\tnode.count = count;\n\t\t\treturn node;\n\n\t\t}\n\n\t\t// Find where to split the volume\n\t\tconst split = getOptimalSplit( node.boundingData, centroidBoundingData, primitiveBounds, offset, count, strategy );\n\t\tlet splitOffset = split.axis === - 1 ? - 1 : partition( partitionBuffer, partitionStride, primitiveBounds, offset, count, split );\n\n\t\t// If the heuristic can't produce a usable split then make a leaf unless the strict guarantee requires the split -\n\t\t// in which case force an arbitrary median split. The axis comes from the node bounds so parallel and serial\n\t\t// builds produce identical trees.\n\t\tif ( split.axis === - 1 \|\| splitOffset === offset \|\| splitOffset === offset + count ) {\n\n\t\t\tif ( ! mustSplit ) {\n\n\t\t\t\ttriggerProgress( offset + count );\n\t\t\t\tnode.offset = offset;\n\t\t\t\tnode.count = count;\n\t\t\t\treturn node;\n\n\t\t\t}\n\n\t\t\tsplit.axis = Math.max( 0, getLongestEdgeIndex( node.boundingData ) );\n\t\t\tsplitOffset = offset + Math.max( 1, Math.floor( count / 2 ) );\n\n\t\t}\n\n\t\t// create the two new child nodes\n\t\tnode.splitAxis = split.axis;\n\n\t\t// create the left child and compute its bounding box\n\t\tconst left = new BVHNode();\n\t\tconst lstart = offset;\n\t\tconst lcount = splitOffset - offset;\n\t\tnode.left = left;\n\n\t\tgetBounds( primitiveBounds, lstart, lcount, left.boundingData, cacheCentroidBoundingData );\n\t\tsplitNode( left, lstart, lcount, cacheCentroidBoundingData, depth + 1 );\n\n\t\t// repeat for right\n\t\tconst right = new BVHNode();\n\t\tconst rstart = splitOffset;\n\t\tconst rcount = count - lcount;\n\t\tnode.right = right;\n\n\t\tgetBounds( primitiveBounds, rstart, rcount, right.boundingData, cacheCentroidBoundingData );\n\t\tsplitNode( right, rstart, rcount, cacheCentroidBoundingData, depth + 1 );\n\n\t\treturn node;\n\n\t}\n\n}\n\nexport function buildPackedTree( bvh, options ) {\n\n\tconst BufferConstructor = options.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer;\n\n\t// get the range of buffer data to construct / arrange\n\tconst rootRanges = bvh.getRootRanges( options.range );\n\tconst firstRange = rootRanges[ 0 ];\n\tconst lastRange = rootRanges[ rootRanges.length - 1 ];\n\tconst fullRange = {\n\t\toffset: firstRange.offset,\n\t\tcount: lastRange.offset + lastRange.count - firstRange.offset,\n\t};\n\n\t// construct the primitive bounds for sorting\n\tconst primitiveBounds = new Float32Array( 6 * fullRange.count );\n\tprimitiveBounds.offset = fullRange.offset;\n\tbvh.computePrimitiveBounds( fullRange.offset, fullRange.count, primitiveBounds );\n\n\t// Build BVH roots\n\tbvh._roots = rootRanges.map( range => {\n\n\t\tconst root = buildTree( bvh, primitiveBounds, range.offset, range.count, options, fullRange );\n\t\tconst nodeCount = countNodes( root );\n\t\tconst buffer = new BufferConstructor( BYTES_PER_NODE * nodeCount );\n\t\tpopulateBuffer( 0, root, buffer );\n\t\treturn buffer;\n\n\t} );\n\n}\n","export class PrimitivePool {\n\n\tconstructor( getNewPrimitive ) {\n\n\t\tthis._getNewPrimitive = getNewPrimitive;\n\t\tthis._primitives = [];\n\n\t}\n\n\tgetPrimitive() {\n\n\t\tconst primitives = this._primitives;\n\t\tif ( primitives.length === 0 ) {\n\n\t\t\treturn this._getNewPrimitive();\n\n\t\t} else {\n\n\t\t\treturn primitives.pop();\n\n\t\t}\n\n\t}\n\n\treleasePrimitive( primitive ) {\n\n\t\tthis._primitives.push( primitive );\n\n\t}\n\n}\n","class _BufferStack {\n\n\tconstructor() {\n\n\t\tthis.float32Array = null;\n\t\tthis.uint16Array = null;\n\t\tthis.uint32Array = null;\n\n\t\tconst stack = [];\n\t\tlet prevBuffer = null;\n\t\tthis.setBuffer = buffer => {\n\n\t\t\tif ( prevBuffer ) {\n\n\t\t\t\tstack.push( prevBuffer );\n\n\t\t\t}\n\n\t\t\tprevBuffer = buffer;\n\t\t\tthis.float32Array = new Float32Array( buffer );\n\t\t\tthis.uint16Array = new Uint16Array( buffer );\n\t\t\tthis.uint32Array = new Uint32Array( buffer );\n\n\t\t};\n\n\t\tthis.clearBuffer = () => {\n\n\t\t\tprevBuffer = null;\n\t\t\tthis.float32Array = null;\n\t\t\tthis.uint16Array = null;\n\t\t\tthis.uint32Array = null;\n\n\t\t\tif ( stack.length !== 0 ) {\n\n\t\t\t\tthis.setBuffer( stack.pop() );\n\n\t\t\t}\n\n\t\t};\n\n\t}\n\n}\n\nexport const BufferStack = /* @__PURE__ / new _BufferStack();\n","import { Box3 } from 'three';\nimport { CONTAINED, UINT32_PER_NODE } from '../Constants.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { PrimitivePool } from '../../utils/PrimitivePool.js';\nimport { COUNT, OFFSET, LEFT_NODE, RIGHT_NODE, IS_LEAF, BOUNDING_DATA_INDEX } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\n\nlet _box1, _box2;\nconst boxStack = [];\nconst boxPool = / @__PURE__ / new PrimitivePool( () => new Box3() );\n\nexport function shapecast( bvh, root, intersectsBounds, intersectsRange, boundsTraverseOrder, nodeOffset ) {\n\n\t// setup\n\t_box1 = boxPool.getPrimitive();\n\t_box2 = boxPool.getPrimitive();\n\tboxStack.push( _box1, _box2 );\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\n\tconst result = shapecastTraverse( 0, bvh.geometry, intersectsBounds, intersectsRange, boundsTraverseOrder, nodeOffset );\n\n\t// cleanup\n\tBufferStack.clearBuffer();\n\tboxPool.releasePrimitive( _box1 );\n\tboxPool.releasePrimitive( _box2 );\n\tboxStack.pop();\n\tboxStack.pop();\n\n\tconst length = boxStack.length;\n\tif ( length > 0 ) {\n\n\t\t_box2 = boxStack[ length - 1 ];\n\t\t_box1 = boxStack[ length - 2 ];\n\n\t}\n\n\treturn result;\n\n}\n\nfunction shapecastTraverse(\n\tnodeIndex32,\n\tgeometry,\n\tintersectsBoundsFunc,\n\tintersectsRangeFunc,\n\tnodeScoreFunc = null,\n\tnodeIndexOffset = 0, // offset for unique node identifier\n\tdepth = 0\n) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( nodeIndex32 ), float32Array, _box1 );\n\t\treturn intersectsRangeFunc( offset, count, false, depth, nodeIndexOffset + nodeIndex32 / UINT32_PER_NODE, _box1 );\n\n\t} else {\n\n\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\tlet c1 = left;\n\t\tlet c2 = right;\n\n\t\tlet score1, score2;\n\t\tlet box1, box2;\n\t\tif ( nodeScoreFunc ) {\n\n\t\t\tbox1 = _box1;\n\t\t\tbox2 = _box2;\n\n\t\t\t// bounding data is not offset\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( c1 ), float32Array, box1 );\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( c2 ), float32Array, box2 );\n\n\t\t\tscore1 = nodeScoreFunc( box1 );\n\t\t\tscore2 = nodeScoreFunc( box2 );\n\n\t\t\tif ( score2 < score1 ) {\n\n\t\t\t\tc1 = right;\n\t\t\t\tc2 = left;\n\n\t\t\t\tconst temp = score1;\n\t\t\t\tscore1 = score2;\n\t\t\t\tscore2 = temp;\n\n\t\t\t\tbox1 = box2;\n\t\t\t\t// box2 is always set before use below\n\n\t\t\t}\n\n\t\t}\n\n\t\t// Check box 1 intersection\n\t\tif ( ! box1 ) {\n\n\t\t\tbox1 = _box1;\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( c1 ), float32Array, box1 );\n\n\t\t}\n\n\t\tconst isC1Leaf = IS_LEAF( c1 * 2, uint16Array );\n\t\tconst c1Intersection = intersectsBoundsFunc( box1, isC1Leaf, score1, depth + 1, nodeIndexOffset + c1 / UINT32_PER_NODE );\n\n\t\tlet c1StopTraversal;\n\t\tif ( c1Intersection === CONTAINED ) {\n\n\t\t\tconst offset = getLeftOffset( c1 );\n\t\t\tconst end = getRightEndOffset( c1 );\n\t\t\tconst count = end - offset;\n\n\t\t\tc1StopTraversal = intersectsRangeFunc( offset, count, true, depth + 1, nodeIndexOffset + c1 / UINT32_PER_NODE, box1 );\n\n\t\t} else {\n\n\t\t\tc1StopTraversal =\n\t\t\t\tc1Intersection &&\n\t\t\t\tshapecastTraverse(\n\t\t\t\t\tc1,\n\t\t\t\t\tgeometry,\n\t\t\t\t\tintersectsBoundsFunc,\n\t\t\t\t\tintersectsRangeFunc,\n\t\t\t\t\tnodeScoreFunc,\n\t\t\t\t\tnodeIndexOffset,\n\t\t\t\t\tdepth + 1\n\t\t\t\t);\n\n\t\t}\n\n\t\tif ( c1StopTraversal ) return true;\n\n\t\t// Check box 2 intersection\n\t\t// cached box2 will have been overwritten by previous traversal\n\t\tbox2 = _box2;\n\t\tarrayToBox( BOUNDING_DATA_INDEX( c2 ), float32Array, box2 );\n\n\t\tconst isC2Leaf = IS_LEAF( c2 * 2, uint16Array );\n\t\tconst c2Intersection = intersectsBoundsFunc( box2, isC2Leaf, score2, depth + 1, nodeIndexOffset + c2 / UINT32_PER_NODE );\n\n\t\tlet c2StopTraversal;\n\t\tif ( c2Intersection === CONTAINED ) {\n\n\t\t\tconst offset = getLeftOffset( c2 );\n\t\t\tconst end = getRightEndOffset( c2 );\n\t\t\tconst count = end - offset;\n\n\t\t\tc2StopTraversal = intersectsRangeFunc( offset, count, true, depth + 1, nodeIndexOffset + c2 / UINT32_PER_NODE, box2 );\n\n\t\t} else {\n\n\t\t\tc2StopTraversal =\n\t\t\t\tc2Intersection &&\n\t\t\t\tshapecastTraverse(\n\t\t\t\t\tc2,\n\t\t\t\t\tgeometry,\n\t\t\t\t\tintersectsBoundsFunc,\n\t\t\t\t\tintersectsRangeFunc,\n\t\t\t\t\tnodeScoreFunc,\n\t\t\t\t\tnodeIndexOffset,\n\t\t\t\t\tdepth + 1\n\t\t\t\t);\n\n\t\t}\n\n\t\tif ( c2StopTraversal ) return true;\n\n\t\treturn false;\n\n\t\t// Define these inside the function so it has access to the local variables needed\n\t\t// when converting to the buffer equivalents\n\t\tfunction getLeftOffset( nodeIndex32 ) {\n\n\t\t\tconst { uint16Array, uint32Array } = BufferStack;\n\t\t\tlet nodeIndex16 = nodeIndex32 * 2;\n\n\t\t\t// traverse until we find a leaf\n\t\t\twhile ( ! IS_LEAF( nodeIndex16, uint16Array ) ) {\n\n\t\t\t\tnodeIndex32 = LEFT_NODE( nodeIndex32 );\n\t\t\t\tnodeIndex16 = nodeIndex32 * 2;\n\n\t\t\t}\n\n\t\t\treturn OFFSET( nodeIndex32, uint32Array );\n\n\t\t}\n\n\t\tfunction getRightEndOffset( nodeIndex32 ) {\n\n\t\t\tconst { uint16Array, uint32Array } = BufferStack;\n\t\t\tlet nodeIndex16 = nodeIndex32 * 2;\n\n\t\t\t// traverse until we find a leaf\n\t\t\twhile ( ! IS_LEAF( nodeIndex16, uint16Array ) ) {\n\n\t\t\t\t// adjust offset to point to the right node\n\t\t\t\tnodeIndex32 = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\t\t\tnodeIndex16 = nodeIndex32 * 2;\n\n\t\t\t}\n\n\t\t\t// return the end offset of the triangle range\n\t\t\treturn OFFSET( nodeIndex32, uint32Array ) + COUNT( nodeIndex16, uint16Array );\n\n\t\t}\n\n\t}\n\n}\n","import { Box3, Matrix4 } from 'three';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { BOUNDING_DATA_INDEX, COUNT, IS_LEAF, LEFT_NODE, OFFSET, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { PrimitivePool } from '../../utils/PrimitivePool.js';\nimport { BYTES_PER_NODE, UINT32_PER_NODE } from '../Constants.js';\n\nconst _bufferStack1 = /* @__PURE__ / new BufferStack.constructor();\nconst _bufferStack2 = / @__PURE__ / new BufferStack.constructor();\nconst _boxPool = / @__PURE__ / new PrimitivePool( () => new Box3() );\nconst _leftBox1 = / @__PURE__ / new Box3();\nconst _rightBox1 = / @__PURE__ / new Box3();\n\nconst _leftBox2 = / @__PURE__ / new Box3();\nconst _rightBox2 = / @__PURE__ / new Box3();\n\nlet _active = false;\n\nexport function bvhcast( bvh, otherBvh, matrixToLocal, intersectsRanges ) {\n\n\tif ( _active ) {\n\n\t\tthrow new Error( 'MeshBVH: Recursive calls to bvhcast not supported.' );\n\n\t}\n\n\t_active = true;\n\n\tconst roots = bvh._roots;\n\tconst otherRoots = otherBvh._roots;\n\tlet result;\n\tlet nodeOffset1 = 0;\n\tlet nodeOffset2 = 0;\n\tconst invMat = new Matrix4().copy( matrixToLocal ).invert();\n\n\t// iterate over the first set of roots\n\tfor ( let i = 0, il = roots.length; i < il; i ++ ) {\n\n\t\t_bufferStack1.setBuffer( roots[ i ] );\n\t\tnodeOffset2 = 0;\n\n\t\t// prep the initial root box\n\t\tconst localBox = _boxPool.getPrimitive();\n\t\tarrayToBox( BOUNDING_DATA_INDEX( 0 ), _bufferStack1.float32Array, localBox );\n\t\tlocalBox.applyMatrix4( invMat );\n\n\t\t// iterate over the second set of roots\n\t\tfor ( let j = 0, jl = otherRoots.length; j < jl; j ++ ) {\n\n\t\t\t_bufferStack2.setBuffer( otherRoots[ j ] );\n\n\t\t\tresult = _traverse(\n\t\t\t\t0, 0, matrixToLocal, invMat, intersectsRanges,\n\t\t\t\tnodeOffset1, nodeOffset2, 0, 0,\n\t\t\t\tlocalBox,\n\t\t\t);\n\n\t\t\t_bufferStack2.clearBuffer();\n\t\t\tnodeOffset2 += otherRoots[ j ].byteLength / BYTES_PER_NODE;\n\n\t\t\tif ( result ) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\t// release stack info\n\t\t_boxPool.releasePrimitive( localBox );\n\t\t_bufferStack1.clearBuffer();\n\t\tnodeOffset1 += roots[ i ].byteLength / BYTES_PER_NODE;\n\n\t\tif ( result ) {\n\n\t\t\tbreak;\n\n\t\t}\n\n\t}\n\n\t_active = false;\n\treturn result;\n\n}\n\nfunction _traverse(\n\tnode1Index32,\n\tnode2Index32,\n\tmatrix2to1,\n\tmatrix1to2,\n\tintersectsRangesFunc,\n\n\t// offsets for ids\n\tnode1IndexOffset = 0,\n\tnode2IndexOffset = 0,\n\n\t// tree depth\n\tdepth1 = 0,\n\tdepth2 = 0,\n\n\tcurrBox = null,\n\treversed = false,\n\n) {\n\n\t// get the buffer stacks associated with the current indices\n\tlet bufferStack1, bufferStack2;\n\tif ( reversed ) {\n\n\t\tbufferStack1 = _bufferStack2;\n\t\tbufferStack2 = _bufferStack1;\n\n\t} else {\n\n\t\tbufferStack1 = _bufferStack1;\n\t\tbufferStack2 = _bufferStack2;\n\n\t}\n\n\t// get the local instances of the typed buffers\n\tconst\n\t\tfloat32Array1 = bufferStack1.float32Array,\n\t\tuint32Array1 = bufferStack1.uint32Array,\n\t\tuint16Array1 = bufferStack1.uint16Array,\n\t\tfloat32Array2 = bufferStack2.float32Array,\n\t\tuint32Array2 = bufferStack2.uint32Array,\n\t\tuint16Array2 = bufferStack2.uint16Array;\n\n\tconst node1Index16 = node1Index32 2;\n\tconst node2Index16 = node2Index32 * 2;\n\tconst isLeaf1 = IS_LEAF( node1Index16, uint16Array1 );\n\tconst isLeaf2 = IS_LEAF( node2Index16, uint16Array2 );\n\tlet result = false;\n\tif ( isLeaf2 && isLeaf1 ) {\n\n\t\t// if both bounds are leaf nodes then fire the callback if the boxes intersect\n\t\t// Note the \"nodeIndex\" values are just intended to be used as unique identifiers in the tree and\n\t\t// not used for accessing data\n\t\tif ( reversed ) {\n\n\t\t\tresult = intersectsRangesFunc(\n\t\t\t\tOFFSET( node2Index32, uint32Array2 ), COUNT( node2Index32 * 2, uint16Array2 ),\n\t\t\t\tOFFSET( node1Index32, uint32Array1 ), COUNT( node1Index32 * 2, uint16Array1 ),\n\t\t\t\tdepth2, node2IndexOffset + node2Index32 / UINT32_PER_NODE,\n\t\t\t\tdepth1, node1IndexOffset + node1Index32 / UINT32_PER_NODE,\n\t\t\t);\n\n\t\t} else {\n\n\t\t\tresult = intersectsRangesFunc(\n\t\t\t\tOFFSET( node1Index32, uint32Array1 ), COUNT( node1Index32 * 2, uint16Array1 ),\n\t\t\t\tOFFSET( node2Index32, uint32Array2 ), COUNT( node2Index32 * 2, uint16Array2 ),\n\t\t\t\tdepth1, node1IndexOffset + node1Index32 / UINT32_PER_NODE,\n\t\t\t\tdepth2, node2IndexOffset + node2Index32 / UINT32_PER_NODE,\n\t\t\t);\n\n\t\t}\n\n\t} else if ( isLeaf2 ) {\n\n\t\t// SWAP\n\t\t// If we've traversed to the leaf node on the other bvh then we need to swap over\n\t\t// to traverse down the first one\n\n\t\t// get the new box to use\n\t\tconst newBox = _boxPool.getPrimitive();\n\t\tarrayToBox( BOUNDING_DATA_INDEX( node2Index32 ), float32Array2, newBox );\n\t\tnewBox.applyMatrix4( matrix2to1 );\n\n\t\t// get the child bounds to check before traversal\n\t\tconst cl1 = LEFT_NODE( node1Index32 );\n\t\tconst cr1 = RIGHT_NODE( node1Index32, uint32Array1 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cl1 ), float32Array1, _leftBox1 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cr1 ), float32Array1, _rightBox1 );\n\n\t\t// precompute the intersections otherwise the global boxes will be modified during traversal\n\t\tconst intersectCl1 = newBox.intersectsBox( _leftBox1 );\n\t\tconst intersectCr1 = newBox.intersectsBox( _rightBox1 );\n\t\tresult = (\n\t\t\tintersectCl1 && _traverse(\n\t\t\t\tnode2Index32, cl1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\tnewBox, ! reversed,\n\t\t\t)\n\t\t) \|\| (\n\t\t\tintersectCr1 && _traverse(\n\t\t\t\tnode2Index32, cr1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\tnewBox, ! reversed,\n\t\t\t)\n\t\t);\n\n\t\t_boxPool.releasePrimitive( newBox );\n\n\t} else {\n\n\t\t// if neither are leaves then we should swap if one of the children does not\n\t\t// intersect with the current bounds\n\n\t\t// get the child bounds to check\n\t\tconst cl2 = LEFT_NODE( node2Index32 );\n\t\tconst cr2 = RIGHT_NODE( node2Index32, uint32Array2 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cl2 ), float32Array2, _leftBox2 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cr2 ), float32Array2, _rightBox2 );\n\n\t\tconst leftIntersects = currBox.intersectsBox( _leftBox2 );\n\t\tconst rightIntersects = currBox.intersectsBox( _rightBox2 );\n\t\tif ( leftIntersects && rightIntersects ) {\n\n\t\t\t// continue to traverse both children if they both intersect\n\t\t\tresult = _traverse(\n\t\t\t\tnode1Index32, cl2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\tcurrBox, reversed,\n\t\t\t) \|\| _traverse(\n\t\t\t\tnode1Index32, cr2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\tcurrBox, reversed,\n\t\t\t);\n\n\t\t} else if ( leftIntersects ) {\n\n\t\t\tif ( isLeaf1 ) {\n\n\t\t\t\t// if the current box is a leaf then just continue\n\t\t\t\tresult = _traverse(\n\t\t\t\t\tnode1Index32, cl2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\t\tcurrBox, reversed,\n\t\t\t\t);\n\n\t\t\t} else {\n\n\t\t\t\t// SWAP\n\t\t\t\t// if only one box intersects then we have to swap to the other bvh to continue\n\t\t\t\tconst newBox = _boxPool.getPrimitive();\n\t\t\t\tnewBox.copy( _leftBox2 ).applyMatrix4( matrix2to1 );\n\n\t\t\t\tconst cl1 = LEFT_NODE( node1Index32 );\n\t\t\t\tconst cr1 = RIGHT_NODE( node1Index32, uint32Array1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cl1 ), float32Array1, _leftBox1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cr1 ), float32Array1, _rightBox1 );\n\n\t\t\t\t// precompute the intersections otherwise the global boxes will be modified during traversal\n\t\t\t\tconst intersectCl1 = newBox.intersectsBox( _leftBox1 );\n\t\t\t\tconst intersectCr1 = newBox.intersectsBox( _rightBox1 );\n\t\t\t\tresult = (\n\t\t\t\t\tintersectCl1 && _traverse(\n\t\t\t\t\t\tcl2, cl1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t) \|\| (\n\t\t\t\t\tintersectCr1 && _traverse(\n\t\t\t\t\t\tcl2, cr1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\t_boxPool.releasePrimitive( newBox );\n\n\t\t\t}\n\n\t\t} else if ( rightIntersects ) {\n\n\t\t\tif ( isLeaf1 ) {\n\n\t\t\t\t// if the current box is a leaf then just continue\n\t\t\t\tresult = _traverse(\n\t\t\t\t\tnode1Index32, cr2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\t\tcurrBox, reversed,\n\t\t\t\t);\n\n\t\t\t} else {\n\n\t\t\t\t// SWAP\n\t\t\t\t// if only one box intersects then we have to swap to the other bvh to continue\n\t\t\t\tconst newBox = _boxPool.getPrimitive();\n\t\t\t\tnewBox.copy( _rightBox2 ).applyMatrix4( matrix2to1 );\n\n\t\t\t\tconst cl1 = LEFT_NODE( node1Index32 );\n\t\t\t\tconst cr1 = RIGHT_NODE( node1Index32, uint32Array1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cl1 ), float32Array1, _leftBox1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cr1 ), float32Array1, _rightBox1 );\n\n\t\t\t\t// precompute the intersections otherwise the global boxes will be modified during traversal\n\t\t\t\tconst intersectCl1 = newBox.intersectsBox( _leftBox1 );\n\t\t\t\tconst intersectCr1 = newBox.intersectsBox( _rightBox1 );\n\t\t\t\tresult = (\n\t\t\t\t\tintersectCl1 && _traverse(\n\t\t\t\t\t\tcr2, cl1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t) \|\| (\n\t\t\t\t\tintersectCr1 && _traverse(\n\t\t\t\t\t\tcr2, cr1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\t_boxPool.releasePrimitive( newBox );\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn result;\n\n}\n\n","import { COUNT, IS_LEAF, LEFT_NODE, OFFSET, RIGHT_NODE, SPLIT_AXIS } from './utils/nodeBufferUtils.js';\n\nexport const BVHTraversalHelper = new ( class {\n\n\tconstructor() {\n\n\t\tlet buffer = null;\n\t\tlet uint32Array = null;\n\t\tlet uint16Array = null;\n\t\tlet traversing = false;\n\n\t\tthis.root = null;\n\t\tthis.buffer = null;\n\t\tthis.uint32Array = null;\n\t\tthis.uint16Array = null;\n\n\t\tthis.setBVH = ( bvh, root ) => {\n\n\t\t\tif ( traversing ) {\n\n\t\t\t\tthrow new Error( 'BVHTraversalHelper: cannot call setBVH during an active traversal.' );\n\n\t\t\t}\n\n\t\t\tthis.root = root;\n\t\t\tthis.buffer = buffer = bvh._roots[ root ];\n\t\t\tthis.uint16Array = uint16Array = new Uint16Array( buffer );\n\t\t\tthis.uint32Array = uint32Array = new Uint32Array( buffer );\n\n\t\t};\n\n\t\tthis.reset = () => {\n\n\t\t\tthis.root = null;\n\t\t\tthis.buffer = buffer = null;\n\t\t\tthis.uint16Array = uint16Array = null;\n\t\t\tthis.uint32Array = uint32Array = null;\n\n\t\t};\n\n\t\tthis.getRangeStart = node32Index => {\n\n\t\t\tlet node16Index = node32Index * 2;\n\t\t\twhile ( ! IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\tnode32Index = LEFT_NODE( node32Index );\n\t\t\t\tnode16Index = node32Index * 2;\n\n\t\t\t}\n\n\t\t\treturn OFFSET( node32Index, uint32Array );\n\n\t\t};\n\n\t\tthis.getRangeEnd = node32Index => {\n\n\t\t\tlet node16Index = node32Index * 2;\n\t\t\twhile ( ! IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\tnode32Index = RIGHT_NODE( node32Index, uint32Array );\n\t\t\t\tnode16Index = node32Index * 2;\n\n\t\t\t}\n\n\t\t\treturn OFFSET( node32Index, uint32Array ) + COUNT( node16Index, uint16Array );\n\n\t\t};\n\n\t\t// internal recursive walk - the public \"traverseBuffer\" wraps this with the re-entrancy guard\n\t\tconst walk = ( callback, node32Index, depth ) => {\n\n\t\t\tconst node16Index = node32Index * 2;\n\t\t\tconst isLeaf = IS_LEAF( node16Index, uint16Array );\n\t\t\tconst stopTraversal = callback( depth, isLeaf, node32Index );\n\t\t\tif ( ! stopTraversal && ! isLeaf ) {\n\n\t\t\t\tconst left = LEFT_NODE( node32Index );\n\t\t\t\tconst right = RIGHT_NODE( node32Index, uint32Array );\n\t\t\t\twalk( callback, left, depth + 1 );\n\t\t\t\twalk( callback, right, depth + 1 );\n\n\t\t\t}\n\n\t\t};\n\n\t\tthis.traverseBuffer = callback => {\n\n\t\t\tif ( traversing ) {\n\n\t\t\t\tthrow new Error( 'BVHTraversalHelper: cannot start a traversal during an active traversal.' );\n\n\t\t\t}\n\n\t\t\ttraversing = true;\n\t\t\ttry {\n\n\t\t\t\twalk( callback, 0, 0 );\n\n\t\t\t} finally {\n\n\t\t\t\ttraversing = false;\n\n\t\t\t}\n\n\t\t};\n\n\t\tthis.traverse = callback => {\n\n\t\t\tthis.traverseBuffer( ( depth, isLeaf, node32Index ) => {\n\n\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\tconst node16Index = node32Index * 2;\n\t\t\t\t\tconst offset = uint32Array[ node32Index + 6 ];\n\t\t\t\t\tconst count = uint16Array[ node16Index + 14 ];\n\t\t\t\t\treturn callback( depth, isLeaf, new Float32Array( buffer, node32Index * 4, 6 ), offset, count );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tconst splitAxis = SPLIT_AXIS( node32Index, uint32Array );\n\t\t\t\t\treturn callback( depth, isLeaf, new Float32Array( buffer, node32Index * 4, 6 ), splitAxis );\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t};\n\n\t}\n\n} )();\n","/** @import { Matrix4 } from 'three' /\nimport { Box3 } from 'three';\nimport { BYTES_PER_NODE, UINT32_PER_NODE, DEFAULT_OPTIONS, FLOAT32_EPSILON } from './Constants.js';\nimport { arrayToBox } from '../utils/ArrayBoxUtilities.js';\nimport { IS_LEAF, LEFT_NODE, RIGHT_NODE, COUNT, OFFSET } from './utils/nodeBufferUtils.js';\nimport { buildPackedTree } from './build/buildTree.js';\nimport { shapecast as shapecastFunc } from './cast/shapecast.js';\nimport { bvhcast } from './cast/bvhcast.js';\nimport { BVHTraversalHelper } from './BVHTraversalHelper.js';\n\nconst _tempBox = / @__PURE__ / new Box3();\nconst _tempBuffer = / @__PURE__ / new Float32Array( 6 );\n\n/\n @callback BoundsTraverseOrderCallback\n * @param {Box3} box\n * @returns {number}\n /\n\n/\n @callback IntersectsBoundsCallback\n * @param {Box3} box\n * @param {boolean} isLeaf\n * @param {number\|undefined} score\n * @param {number} depth\n * @param {number} nodeIndex\n * @returns {number}\n /\n\n/\n @callback IntersectsRangeCallback\n * @param {number} offset\n * @param {number} count\n * @param {boolean} contained\n * @param {number} depth\n * @param {number} nodeIndex\n * @param {Box3} box\n * @returns {boolean}\n /\n\n/\n @callback IntersectsRangesCallback\n * @param {number} offset1\n * @param {number} count1\n * @param {number} offset2\n * @param {number} count2\n * @param {number} depth1\n * @param {number} nodeIndex1\n * @param {number} depth2\n * @param {number} nodeIndex2\n * @returns {boolean}\n /\n\n/\n Abstract base class for BVH implementations. Provides core tree traversal and spatial query\n * methods. Subclasses implement primitive-specific logic by overriding `writePrimitiveBounds`\n * and related internal methods.\n /\nexport class BVH {\n\n\tconstructor() {\n\n\t\tthis._roots = null;\n\t\tthis.primitiveBuffer = null;\n\t\tthis.primitiveBufferStride = null;\n\n\t}\n\n\tinit( options ) {\n\n\t\toptions = {\n\t\t\t...DEFAULT_OPTIONS,\n\t\t\t...options,\n\t\t};\n\n\t\tif ( 'maxLeafSize' in options ) {\n\n\t\t\tconsole.warn( 'BVH: \"maxLeafSize\" option has been deprecated. Use \"targetLeafSize\", instead.' );\n\t\t\toptions = {\n\t\t\t\t...options,\n\t\t\t\ttargetLeafSize: options.maxLeafSize,\n\t\t\t};\n\n\t\t}\n\n\t\tbuildPackedTree( this, options );\n\n\t}\n\n\tgetRootRanges( / range / ) {\n\n\t\t// TODO: can we avoid passing range in here?\n\t\tthrow new Error( 'BVH: getRootRanges() not implemented' );\n\n\t}\n\n\t// write the i-th primitive bounds in a 6-value min / max format to the buffer\n\t// starting at the given \"writeOffset\"\n\twritePrimitiveBounds( / i, buffer, writeOffset / ) {\n\n\t\tthrow new Error( 'BVH: writePrimitiveBounds() not implemented' );\n\n\t}\n\n\t// writes the union bounds of all primitives in the given range in a min / max format\n\t// to the buffer\n\twritePrimitiveRangeBounds( offset, count, targetBuffer, baseIndex ) {\n\n\t\t// Initialize bounds\n\t\tlet minX = Infinity;\n\t\tlet minY = Infinity;\n\t\tlet minZ = Infinity;\n\t\tlet maxX = - Infinity;\n\t\tlet maxY = - Infinity;\n\t\tlet maxZ = - Infinity;\n\n\t\t// compute union of all bounds\n\t\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\t\tthis.writePrimitiveBounds( i, _tempBuffer, 0 );\n\n\t\t\t// compute union\n\t\t\tconst [ lx, ly, lz, rx, ry, rz ] = _tempBuffer;\n\t\t\tif ( lx < minX ) minX = lx;\n\t\t\tif ( rx > maxX ) maxX = rx;\n\t\t\tif ( ly < minY ) minY = ly;\n\t\t\tif ( ry > maxY ) maxY = ry;\n\t\t\tif ( lz < minZ ) minZ = lz;\n\t\t\tif ( rz > maxZ ) maxZ = rz;\n\n\t\t}\n\n\t\t// write bounds\n\t\ttargetBuffer[ baseIndex + 0 ] = minX;\n\t\ttargetBuffer[ baseIndex + 1 ] = minY;\n\t\ttargetBuffer[ baseIndex + 2 ] = minZ;\n\t\ttargetBuffer[ baseIndex + 3 ] = maxX;\n\t\ttargetBuffer[ baseIndex + 4 ] = maxY;\n\t\ttargetBuffer[ baseIndex + 5 ] = maxZ;\n\n\t\treturn targetBuffer;\n\n\t}\n\n\tcomputePrimitiveBounds( offset, count, targetBuffer ) {\n\n\t\tconst boundsOffset = targetBuffer.offset \|\| 0;\n\t\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\t\tthis.writePrimitiveBounds( i, _tempBuffer, 0 );\n\n\t\t\t// construction primitive bounds requires a center + half extents format\n\t\t\tconst [ lx, ly, lz, rx, ry, rz ] = _tempBuffer;\n\n\t\t\tconst cx = ( lx + rx ) / 2;\n\t\t\tconst cy = ( ly + ry ) / 2;\n\t\t\tconst cz = ( lz + rz ) / 2;\n\n\t\t\tconst hx = ( rx - lx ) / 2;\n\t\t\tconst hy = ( ry - ly ) / 2;\n\t\t\tconst hz = ( rz - lz ) / 2;\n\n\t\t\tconst baseIndex = ( i - boundsOffset ) 6;\n\t\t\ttargetBuffer[ baseIndex + 0 ] = cx;\n\t\t\ttargetBuffer[ baseIndex + 1 ] = hx + ( Math.abs( cx ) + hx ) * FLOAT32_EPSILON;\n\t\t\ttargetBuffer[ baseIndex + 2 ] = cy;\n\t\t\ttargetBuffer[ baseIndex + 3 ] = hy + ( Math.abs( cy ) + hy ) * FLOAT32_EPSILON;\n\t\t\ttargetBuffer[ baseIndex + 4 ] = cz;\n\t\t\ttargetBuffer[ baseIndex + 5 ] = hz + ( Math.abs( cz ) + hz ) * FLOAT32_EPSILON;\n\n\t\t}\n\n\t\treturn targetBuffer;\n\n\t}\n\n\t/*\n\t Adjusts all primitive offsets stored in the BVH leaf nodes by the given value. Useful when\n\t * geometry buffers have been shifted or compacted (e.g. when merging geometries).\n\t * @param {number} offset\n\t /\n\tshiftPrimitiveOffsets( offset ) {\n\n\t\tconst indirectBuffer = this._indirectBuffer;\n\t\tif ( indirectBuffer ) {\n\n\t\t\t// the offsets are embedded in the indirect buffer\n\t\t\tfor ( let i = 0, l = indirectBuffer.length; i < l; i ++ ) {\n\n\t\t\t\tindirectBuffer[ i ] += offset;\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// offsets are embedded in the leaf nodes\n\t\t\tconst roots = this._roots;\n\t\t\tfor ( let rootIndex = 0; rootIndex < roots.length; rootIndex ++ ) {\n\n\t\t\t\tconst root = roots[ rootIndex ];\n\t\t\t\tconst uint32Array = new Uint32Array( root );\n\t\t\t\tconst uint16Array = new Uint16Array( root );\n\t\t\t\tconst totalNodes = root.byteLength / BYTES_PER_NODE;\n\t\t\t\tfor ( let node = 0; node < totalNodes; node ++ ) {\n\n\t\t\t\t\tconst node32Index = UINT32_PER_NODE node;\n\t\t\t\t\tconst node16Index = 2 * node32Index;\n\t\t\t\t\tif ( IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\t\t\t// offset value\n\t\t\t\t\t\tuint32Array[ node32Index + 6 ] += offset;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\t/*\n\t Traverses all nodes of the BVH, invoking a callback for each node.\n\t \n\t For leaf nodes the callback receives `( depth, isLeaf, boundingData, offset, count )`.\n\t * For internal nodes it receives `( depth, isLeaf, boundingData, splitAxis )` and may\n\t * return `true` to stop descending into that node's children.\n\t \n\t @param {Function} callback\n\t * @param {number} [rootIndex=0]\n\t /\n\ttraverse( callback, rootIndex = 0 ) {\n\n\t\tBVHTraversalHelper.setBVH( this, rootIndex );\n\t\tBVHTraversalHelper.traverse( callback );\n\t\tBVHTraversalHelper.reset();\n\n\t}\n\n\t/\n\t Refits all BVH node bounds to reflect the current primitive positions. Faster than\n\t * rebuilding the BVH but produces a less optimal tree after large vertex deformations.\n\t /\n\trefit( / nodeIndices = null / ) {\n\n\t\t// TODO: add support for \"nodeIndices\"\n\t\t// if ( nodeIndices && Array.isArray( nodeIndices ) ) {\n\n\t\t// \tnodeIndices = new Set( nodeIndices );\n\n\t\t// }\n\n\t\tconst roots = this._roots;\n\t\tfor ( let rootIndex = 0, rootCount = roots.length; rootIndex < rootCount; rootIndex ++ ) {\n\n\t\t\tconst buffer = roots[ rootIndex ];\n\t\t\tconst uint32Array = new Uint32Array( buffer );\n\t\t\tconst uint16Array = new Uint16Array( buffer );\n\t\t\tconst float32Array = new Float32Array( buffer );\n\t\t\tconst totalNodes = buffer.byteLength / BYTES_PER_NODE;\n\n\t\t\t// Traverse nodes from right to left so children are updated before parents\n\t\t\tfor ( let nodeIndex = totalNodes - 1; nodeIndex >= 0; nodeIndex -- ) {\n\n\t\t\t\tconst nodeIndex32 = nodeIndex UINT32_PER_NODE;\n\t\t\t\tconst nodeIndex16 = nodeIndex32 * 2;\n\t\t\t\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\n\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\t// get the bounds\n\t\t\t\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\t\t\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\t\t\t\t\tthis.writePrimitiveRangeBounds( offset, count, _tempBuffer, 0 );\n\n\t\t\t\t\t// write directly to node bounds (already in min/max format)\n\t\t\t\t\tfloat32Array.set( _tempBuffer, nodeIndex32 );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\t\t\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t\t\t\t// Union the bounds of left and right children\n\t\t\t\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\t\t\t\tconst leftMin = float32Array[ left + i ];\n\t\t\t\t\t\tconst leftMax = float32Array[ left + i + 3 ];\n\t\t\t\t\t\tconst rightMin = float32Array[ right + i ];\n\t\t\t\t\t\tconst rightMax = float32Array[ right + i + 3 ];\n\n\t\t\t\t\t\tfloat32Array[ nodeIndex32 + i ] = leftMin < rightMin ? leftMin : rightMin;\n\t\t\t\t\t\tfloat32Array[ nodeIndex32 + i + 3 ] = leftMax > rightMax ? leftMax : rightMax;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\t/*\n\t Computes the axis-aligned bounding box of all primitives in the BVH.\n\t * @param {Box3} target - Target box to write the result into.\n\t * @returns {Box3}\n\t /\n\tgetBoundingBox( target ) {\n\n\t\ttarget.makeEmpty();\n\n\t\tconst roots = this._roots;\n\t\troots.forEach( buffer => {\n\n\t\t\tarrayToBox( 0, new Float32Array( buffer ), _tempBox );\n\t\t\ttarget.union( _tempBox );\n\n\t\t} );\n\n\t\treturn target;\n\n\t}\n\n\t/\n\t A generalized traversal function for performing spatial queries against the BVH. Returns\n\t * `true` as soon as a primitive has been reported as intersected. The tree is traversed\n\t * depth-first; `boundsTraverseOrder` controls which child is visited first. Returning\n\t * `CONTAINED` from `intersectsBounds` skips further child traversal and intersects all\n\t * primitives in that subtree immediately.\n\t \n\t @param {Object} callbacks\n\t * @param {IntersectsBoundsCallback} callbacks.intersectsBounds\n\t * @param {IntersectsRangeCallback} [callbacks.intersectsRange]\n\t * @param {BoundsTraverseOrderCallback} [callbacks.boundsTraverseOrder]\n\t * @returns {boolean}\n\t /\n\t// TODO: see if we can get rid of \"iterateFunc\" here as well as the primitive so the function\n\t// API aligns with the \"shapecast\" implementation\n\tshapecast( callbacks ) {\n\n\t\t// TODO: can we get rid of \"scratchPrimitive\" and / or \"iterate\"? Or merge them somehow\n\t\tlet {\n\t\t\tboundsTraverseOrder,\n\t\t\tintersectsBounds,\n\t\t\tintersectsRange,\n\t\t\tintersectsPrimitive,\n\t\t\tscratchPrimitive,\n\t\t\titerate,\n\t\t} = callbacks;\n\n\t\t// wrap the intersectsRange function\n\t\tif ( intersectsRange && intersectsPrimitive ) {\n\n\t\t\tconst originalIntersectsRange = intersectsRange;\n\t\t\tintersectsRange = ( offset, count, contained, depth, nodeIndex ) => {\n\n\t\t\t\tif ( ! originalIntersectsRange( offset, count, contained, depth, nodeIndex ) ) {\n\n\t\t\t\t\treturn iterate( offset, count, this, intersectsPrimitive, contained, depth, scratchPrimitive );\n\n\t\t\t\t}\n\n\t\t\t\treturn true;\n\n\t\t\t};\n\n\t\t} else if ( ! intersectsRange ) {\n\n\t\t\tif ( intersectsPrimitive ) {\n\n\t\t\t\tintersectsRange = ( offset, count, contained, depth ) => {\n\n\t\t\t\t\treturn iterate( offset, count, this, intersectsPrimitive, contained, depth, scratchPrimitive );\n\n\t\t\t\t};\n\n\t\t\t} else {\n\n\t\t\t\tintersectsRange = ( offset, count, contained ) => {\n\n\t\t\t\t\treturn contained;\n\n\t\t\t\t};\n\n\t\t\t}\n\n\t\t}\n\n\t\t// run shapecast\n\t\tlet result = false;\n\t\tlet nodeOffset = 0;\n\t\tconst roots = this._roots;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\tconst root = roots[ i ];\n\t\t\tresult = shapecastFunc( this, i, intersectsBounds, intersectsRange, boundsTraverseOrder, nodeOffset );\n\n\t\t\tif ( result ) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t\tnodeOffset += root.byteLength / BYTES_PER_NODE;\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n\t/\n\t Simultaneously traverses two BVH structures to find intersecting primitive pairs. Returns\n\t * `true` as soon as any intersection is reported. Both trees are traversed depth-first with\n\t * alternating descent. `matrixToLocal` transforms `otherBvh` into the local space of this BVH.\n\t \n\t @param {BVH} otherBvh\n\t * @param {Matrix4} matrixToLocal\n\t * @param {Object} callbacks\n\t * @param {IntersectsRangesCallback} callbacks.intersectsRanges\n\t * @returns {boolean}\n\t /\n\tbvhcast( otherBvh, matrixToLocal, callbacks ) {\n\n\t\tlet { intersectsRanges } = callbacks;\n\t\treturn bvhcast( this, otherBvh, matrixToLocal, intersectsRanges );\n\n\n\t}\n\n}\n","export function isSharedArrayBufferSupported() {\n\n\treturn typeof SharedArrayBuffer !== 'undefined';\n\n}\n\nexport function convertToBufferType( array, BufferConstructor ) {\n\n\tif ( array === null ) {\n\n\t\treturn array;\n\n\t} else if ( array.buffer ) {\n\n\t\tconst buffer = array.buffer;\n\t\tif ( buffer.constructor === BufferConstructor ) {\n\n\t\t\treturn array;\n\n\t\t}\n\n\t\tconst ArrayConstructor = array.constructor;\n\t\tconst result = new ArrayConstructor( new BufferConstructor( buffer.byteLength ) );\n\t\tresult.set( array );\n\t\treturn result;\n\n\t} else {\n\n\t\tif ( array.constructor === BufferConstructor ) {\n\n\t\t\treturn array;\n\n\t\t}\n\n\t\tconst result = new BufferConstructor( array.byteLength );\n\t\tnew Uint8Array( result ).set( new Uint8Array( array ) );\n\t\treturn result;\n\n\t}\n\n}\n","import { BufferAttribute } from 'three';\n\nexport function getVertexCount( geo ) {\n\n\treturn geo.index ? geo.index.count : geo.attributes.position.count;\n\n}\n\nexport function getTriCount( geo ) {\n\n\treturn getVertexCount( geo ) / 3;\n\n}\n\nexport function getIndexArray( vertexCount, BufferConstructor = ArrayBuffer ) {\n\n\tif ( vertexCount > 65535 ) {\n\n\t\treturn new Uint32Array( new BufferConstructor( 4 vertexCount ) );\n\n\t} else {\n\n\t\treturn new Uint16Array( new BufferConstructor( 2 * vertexCount ) );\n\n\t}\n\n}\n\n// ensures that an index is present on the geometry\nexport function ensureIndex( geo, options ) {\n\n\tif ( ! geo.index ) {\n\n\t\tconst vertexCount = geo.attributes.position.count;\n\t\tconst BufferConstructor = options.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer;\n\t\tconst index = getIndexArray( vertexCount, BufferConstructor );\n\t\tgeo.setIndex( new BufferAttribute( index, 1 ) );\n\n\t\tfor ( let i = 0; i < vertexCount; i ++ ) {\n\n\t\t\tindex[ i ] = i;\n\n\t\t}\n\n\t}\n\n}\n\n// Computes the set of { offset, count } ranges which need independent BVH roots. Each\n// region in the geometry index that belongs to a different set of material groups requires\n// a separate BVH root, so that triangles indices belonging to one group never get swapped\n// with triangle indices belongs to another group. For example, if the groups were like this:\n//\n// [-------------------------------------------------------------]\n// \|__________________\|\n// g0 = [0, 20] \|______________________\|\|_____________________\|\n// g1 = [16, 40] g2 = [41, 60]\n//\n// we would need four BVH roots: [0, 15], [16, 20], [21, 40], [41, 60].\nfunction getFullPrimitiveRange( geo, range, stride ) {\n\n\tconst primitiveCount = getVertexCount( geo ) / stride;\n\tconst drawRange = range ? range : geo.drawRange;\n\tconst start = drawRange.start / stride;\n\tconst end = ( drawRange.start + drawRange.count ) / stride;\n\n\tconst offset = Math.max( 0, start );\n\tconst count = Math.min( primitiveCount, end ) - offset;\n\treturn {\n\t\toffset: Math.floor( offset ),\n\t\tcount: Math.floor( count ),\n\t};\n\n}\n\nfunction getPrimitiveGroupRanges( geo, stride ) {\n\n\treturn geo.groups.map( group => ( {\n\t\toffset: group.start / stride,\n\t\tcount: group.count / stride,\n\t} ));\n\n}\n\n// Function that extracts a set of mutually exclusive ranges representing the primitives being\n// drawn as determined by the geometry groups, draw range, and user specified range\nexport function getRootPrimitiveRanges( geo, range, stride ) {\n\n\tconst drawRange = getFullPrimitiveRange( geo, range, stride );\n\tconst primitiveRanges = getPrimitiveGroupRanges( geo, stride );\n\tif ( ! primitiveRanges.length ) {\n\n\t\treturn [ drawRange ];\n\n\t}\n\n\tconst ranges = [];\n\tconst drawRangeStart = drawRange.offset;\n\tconst drawRangeEnd = drawRange.offset + drawRange.count;\n\n\t// Create events for group boundaries\n\tconst primitiveCount = getVertexCount( geo ) / stride;\n\tconst events = [];\n\tfor ( const group of primitiveRanges ) {\n\n\t\t// Account for cases where group size is set to Infinity\n\t\tconst { offset, count } = group;\n\t\tconst groupStart = offset;\n\t\tconst groupCount = isFinite( count ) ? count : ( primitiveCount - offset );\n\t\tconst groupEnd = ( offset + groupCount );\n\n\t\t// Only add events if the group intersects with the draw range\n\t\tif ( groupStart < drawRangeEnd && groupEnd > drawRangeStart ) {\n\n\t\t\tevents.push( { pos: Math.max( drawRangeStart, groupStart ), isStart: true } );\n\t\t\tevents.push( { pos: Math.min( drawRangeEnd, groupEnd ), isStart: false } );\n\n\t\t}\n\n\t}\n\n\t// Sort events by position, with 'end' events before 'start' events at the same position\n\tevents.sort( ( a, b ) => {\n\n\t\tif ( a.pos !== b.pos ) {\n\n\t\t\treturn a.pos - b.pos;\n\n\t\t} else {\n\n\t\t\treturn a.type === 'end' ? - 1 : 1;\n\n\t\t}\n\n\t} );\n\n\t// sweep through events and create ranges where activeGroups > 0\n\tlet activeGroups = 0;\n\tlet lastPos = null;\n\tfor ( const event of events ) {\n\n\t\tconst newPos = event.pos;\n\t\tif ( activeGroups !== 0 && newPos !== lastPos ) {\n\n\t\t\tranges.push( {\n\t\t\t\toffset: lastPos,\n\t\t\t\tcount: newPos - lastPos,\n\t\t\t} );\n\n\t\t}\n\n\t\tactiveGroups += event.isStart ? 1 : - 1;\n\t\tlastPos = newPos;\n\n\t}\n\n\treturn ranges;\n\n}\n","/** @import { BufferGeometry } from 'three' /\nimport { Box3 } from 'three';\nimport { SKIP_GENERATION, DEFAULT_OPTIONS } from './Constants.js';\nimport { isSharedArrayBufferSupported } from '../utils/BufferUtils.js';\nimport { ensureIndex, getRootPrimitiveRanges } from './build/geometryUtils.js';\nimport { BVH } from './BVH.js';\n\n// construct a new buffer that points to the set of triangles represented by the given ranges\nexport function generateIndirectBuffer( ranges, useSharedArrayBuffer ) {\n\n\tconst lastRange = ranges[ ranges.length - 1 ];\n\tconst useUint32 = lastRange.offset + lastRange.count > 2 * 16;\n\n\t// use getRootIndexRanges which excludes gaps\n\tconst length = ranges.reduce( ( acc, val ) => acc + val.count, 0 );\n\tconst byteCount = useUint32 ? 4 : 2;\n\tconst buffer = useSharedArrayBuffer ? new SharedArrayBuffer( length * byteCount ) : new ArrayBuffer( length * byteCount );\n\tconst indirectBuffer = useUint32 ? new Uint32Array( buffer ) : new Uint16Array( buffer );\n\n\t// construct a compact form of the triangles in these ranges\n\tlet index = 0;\n\tfor ( let r = 0; r < ranges.length; r ++ ) {\n\n\t\tconst { offset, count } = ranges[ r ];\n\t\tfor ( let i = 0; i < count; i ++ ) {\n\n\t\t\tindirectBuffer[ index + i ] = offset + i;\n\n\t\t}\n\n\t\tindex += count;\n\n\t}\n\n\treturn indirectBuffer;\n\n}\n\n/*\n Abstract base class for geometry-backed BVH implementations. Handles geometry\n * indexing, indirect mode, and bounding box initialization. Subclasses implement\n * primitive-specific bounds computation and raycasting via `writePrimitiveBounds`\n * and `raycastObject3D`.\n \n @param {BufferGeometry} geometry\n * @param {Object} [options]\n * @param {number} [options.strategy=CENTER] - Split strategy: `CENTER`, `AVERAGE`, or `SAH`.\n * @param {number} [options.maxDepth=40] - Maximum tree depth. Note that this can cause the target leaf size to not\n * be met if the tree is truncated.\n * @param {number} [options.targetLeafSize=10] - The target number of primitives per leaf node. Note that this is\n * a soft limit and generation strategies like SAH will terminate early if the heuristic determines.\n * @param {boolean} [options.setBoundingBox=true] - Set `geometry.boundingBox` if not already present.\n * @param {boolean} [options.useSharedArrayBuffer=false] - Use `SharedArrayBuffer` for BVH root buffers.\n * @param {boolean} [options.indirect=false] - Build using an indirect buffer, leaving the original index unmodified.\n * @param {boolean} [options.verbose=true] - Log build progress to the console.\n * @param {Function\|null} [options.onProgress=null] - Called with a progress value in [0, 1] during build.\n * @param {Object\|null} [options.range=null] - Restrict the BVH to a specific geometry group range.\n * @extends BVH\n /\nexport class GeometryBVH extends BVH {\n\n\t/\n\t Whether the BVH was built in indirect mode.\n\t * @type {boolean}\n\t * @readonly\n\t /\n\tget indirect() {\n\n\t\treturn ! ! this._indirectBuffer;\n\n\t}\n\n\tget primitiveStride() {\n\n\t\treturn null;\n\n\t}\n\n\tget primitiveBufferStride() {\n\n\t\treturn this.indirect ? 1 : this.primitiveStride;\n\n\t}\n\tset primitiveBufferStride( v ) {}\n\n\tget primitiveBuffer() {\n\n\t\treturn this.indirect ? this._indirectBuffer : this.geometry.index.array;\n\n\t}\n\tset primitiveBuffer( v ) {}\n\n\tconstructor( geometry, options = {} ) {\n\n\t\tif ( ! geometry.isBufferGeometry ) {\n\n\t\t\tthrow new Error( 'BVH: Only BufferGeometries are supported.' );\n\n\t\t} else if ( geometry.index && geometry.index.isInterleavedBufferAttribute ) {\n\n\t\t\tthrow new Error( 'BVH: InterleavedBufferAttribute is not supported for the index attribute.' );\n\n\t\t}\n\n\t\tif ( options.useSharedArrayBuffer && ! isSharedArrayBufferSupported() ) {\n\n\t\t\tthrow new Error( 'BVH: SharedArrayBuffer is not available.' );\n\n\t\t}\n\n\t\tsuper();\n\n\t\t// retain references to the geometry so we can use them it without having to\n\t\t// take a geometry reference in every function.\n\n\t\t/\n\t\t The geometry this BVH was built from.\n\t\t * @type {BufferGeometry}\n\t\t * @readonly\n\t\t /\n\t\tthis.geometry = geometry;\n\t\tthis.resolvePrimitiveIndex = options.indirect ? i => this._indirectBuffer[ i ] : i => i;\n\t\tthis.primitiveBuffer = null;\n\t\tthis.primitiveBufferStride = null;\n\t\tthis._indirectBuffer = null;\n\n\t\toptions = {\n\t\t\t...DEFAULT_OPTIONS,\n\t\t\t...options,\n\t\t};\n\n\t\t// build the BVH unless we're deserializing\n\t\tif ( ! options[ SKIP_GENERATION ] ) {\n\n\t\t\tthis.init( options );\n\n\t\t}\n\n\t}\n\n\tinit( options ) {\n\n\t\tconst { geometry, primitiveStride } = this;\n\n\t\tif ( options.indirect ) {\n\n\t\t\t// construct an buffer that is indirectly sorts the triangles used for the BVH\n\t\t\tconst ranges = getRootPrimitiveRanges( geometry, options.range, primitiveStride );\n\t\t\tconst indirectBuffer = generateIndirectBuffer( ranges, options.useSharedArrayBuffer );\n\t\t\tthis._indirectBuffer = indirectBuffer;\n\n\t\t} else {\n\n\t\t\tensureIndex( geometry, options );\n\n\t\t}\n\n\t\tsuper.init( options );\n\n\t\tif ( ! geometry.boundingBox && options.setBoundingBox ) {\n\n\t\t\tgeometry.boundingBox = this.getBoundingBox( new Box3() );\n\n\t\t}\n\n\t}\n\n\t// Abstract methods to be implemented by subclasses\n\tgetRootRanges( range ) {\n\n\t\t// TODO: can we avoid passing options in here\n\t\tif ( this.indirect ) {\n\n\t\t\treturn [ { offset: 0, count: this._indirectBuffer.length } ];\n\n\n\t\t} else {\n\n\t\t\treturn getRootPrimitiveRanges( this.geometry, range, this.primitiveStride );\n\n\t\t}\n\n\t}\n\n\traycastObject3D( / object, raycaster, intersects = [] / ) {\n\n\t\tthrow new Error( 'BVH: raycastObject3D() not implemented' );\n\n\t}\n\n}\n","import { Vector3 } from 'three';\n\nexport class SeparatingAxisBounds {\n\n\tconstructor() {\n\n\t\tthis.min = Infinity;\n\t\tthis.max = - Infinity;\n\n\t}\n\n\tsetFromPointsField( points, field ) {\n\n\t\tlet min = Infinity;\n\t\tlet max = - Infinity;\n\t\tfor ( let i = 0, l = points.length; i < l; i ++ ) {\n\n\t\t\tconst p = points[ i ];\n\t\t\tconst val = p[ field ];\n\t\t\tmin = val < min ? val : min;\n\t\t\tmax = val > max ? val : max;\n\n\t\t}\n\n\t\tthis.min = min;\n\t\tthis.max = max;\n\n\t}\n\n\tsetFromPoints( axis, points ) {\n\n\t\tlet min = Infinity;\n\t\tlet max = - Infinity;\n\t\tfor ( let i = 0, l = points.length; i < l; i ++ ) {\n\n\t\t\tconst p = points[ i ];\n\t\t\tconst val = axis.dot( p );\n\t\t\tmin = val < min ? val : min;\n\t\t\tmax = val > max ? val : max;\n\n\t\t}\n\n\t\tthis.min = min;\n\t\tthis.max = max;\n\n\t}\n\n\tisSeparated( other ) {\n\n\t\treturn this.min > other.max \|\| other.min > this.max;\n\n\t}\n\n}\n\nSeparatingAxisBounds.prototype.setFromBox = ( function () {\n\n\tconst p = / @__PURE__ / new Vector3();\n\treturn function setFromBox( axis, box ) {\n\n\t\tconst boxMin = box.min;\n\t\tconst boxMax = box.max;\n\t\tlet min = Infinity;\n\t\tlet max = - Infinity;\n\t\tfor ( let x = 0; x <= 1; x ++ ) {\n\n\t\t\tfor ( let y = 0; y <= 1; y ++ ) {\n\n\t\t\t\tfor ( let z = 0; z <= 1; z ++ ) {\n\n\t\t\t\t\tp.x = boxMin.x x + boxMax.x * ( 1 - x );\n\t\t\t\t\tp.y = boxMin.y * y + boxMax.y * ( 1 - y );\n\t\t\t\t\tp.z = boxMin.z * z + boxMax.z * ( 1 - z );\n\n\t\t\t\t\tconst val = axis.dot( p );\n\t\t\t\t\tmin = Math.min( val, min );\n\t\t\t\t\tmax = Math.max( val, max );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tthis.min = min;\n\t\tthis.max = max;\n\n\t};\n\n} )();\n\nexport const areIntersecting = ( function () {\n\n\tconst cacheSatBounds = /* @__PURE__ / new SeparatingAxisBounds();\n\treturn function areIntersecting( shape1, shape2 ) {\n\n\t\tconst points1 = shape1.points;\n\t\tconst satAxes1 = shape1.satAxes;\n\t\tconst satBounds1 = shape1.satBounds;\n\n\t\tconst points2 = shape2.points;\n\t\tconst satAxes2 = shape2.satAxes;\n\t\tconst satBounds2 = shape2.satBounds;\n\n\t\t// check axes of the first shape\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sb = satBounds1[ i ];\n\t\t\tconst sa = satAxes1[ i ];\n\t\t\tcacheSatBounds.setFromPoints( sa, points2 );\n\t\t\tif ( sb.isSeparated( cacheSatBounds ) ) return false;\n\n\t\t}\n\n\t\t// check axes of the second shape\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sb = satBounds2[ i ];\n\t\t\tconst sa = satAxes2[ i ];\n\t\t\tcacheSatBounds.setFromPoints( sa, points1 );\n\t\t\tif ( sb.isSeparated( cacheSatBounds ) ) return false;\n\n\t\t}\n\n\t};\n\n} )();\n","import { Vector3, Vector2, Plane, Line3 } from 'three';\n\nexport const closestPointLineToLine = ( function () {\n\n\t// https://github.com/juj/MathGeoLib/blob/master/src/Geometry/Line.cpp#L56\n\tconst dir1 = / @__PURE__ / new Vector3();\n\tconst dir2 = / @__PURE__ / new Vector3();\n\tconst v02 = / @__PURE__ / new Vector3();\n\treturn function closestPointLineToLine( l1, l2, result ) {\n\n\t\tconst v0 = l1.start;\n\t\tconst v10 = dir1;\n\t\tconst v2 = l2.start;\n\t\tconst v32 = dir2;\n\n\t\tv02.subVectors( v0, v2 );\n\t\tdir1.subVectors( l1.end, l1.start );\n\t\tdir2.subVectors( l2.end, l2.start );\n\n\t\t// float d0232 = v02.Dot(v32);\n\t\tconst d0232 = v02.dot( v32 );\n\n\t\t// float d3210 = v32.Dot(v10);\n\t\tconst d3210 = v32.dot( v10 );\n\n\t\t// float d3232 = v32.Dot(v32);\n\t\tconst d3232 = v32.dot( v32 );\n\n\t\t// float d0210 = v02.Dot(v10);\n\t\tconst d0210 = v02.dot( v10 );\n\n\t\t// float d1010 = v10.Dot(v10);\n\t\tconst d1010 = v10.dot( v10 );\n\n\t\t// float denom = d1010d3232 - d3210d3210;\n\t\tconst denom = d1010 d3232 - d3210 * d3210;\n\n\t\tlet d, d2;\n\t\tif ( denom !== 0 ) {\n\n\t\t\td = ( d0232 * d3210 - d0210 * d3232 ) / denom;\n\n\t\t} else {\n\n\t\t\td = 0;\n\n\t\t}\n\n\t\td2 = ( d0232 + d * d3210 ) / d3232;\n\n\t\tresult.x = d;\n\t\tresult.y = d2;\n\n\t};\n\n} )();\n\nexport const closestPointsSegmentToSegment = ( function () {\n\n\t// https://github.com/juj/MathGeoLib/blob/master/src/Geometry/LineSegment.cpp#L187\n\tconst paramResult = /* @__PURE__ / new Vector2();\n\tconst temp1 = / @__PURE__ / new Vector3();\n\tconst temp2 = / @__PURE__ / new Vector3();\n\treturn function closestPointsSegmentToSegment( l1, l2, target1, target2 ) {\n\n\t\tclosestPointLineToLine( l1, l2, paramResult );\n\n\t\tlet d = paramResult.x;\n\t\tlet d2 = paramResult.y;\n\t\tif ( d >= 0 && d <= 1 && d2 >= 0 && d2 <= 1 ) {\n\n\t\t\tl1.at( d, target1 );\n\t\t\tl2.at( d2, target2 );\n\n\t\t\treturn;\n\n\t\t} else if ( d >= 0 && d <= 1 ) {\n\n\t\t\t// Only d2 is out of bounds.\n\t\t\tif ( d2 < 0 ) {\n\n\t\t\t\tl2.at( 0, target2 );\n\n\t\t\t} else {\n\n\t\t\t\tl2.at( 1, target2 );\n\n\t\t\t}\n\n\t\t\tl1.closestPointToPoint( target2, true, target1 );\n\t\t\treturn;\n\n\t\t} else if ( d2 >= 0 && d2 <= 1 ) {\n\n\t\t\t// Only d is out of bounds.\n\t\t\tif ( d < 0 ) {\n\n\t\t\t\tl1.at( 0, target1 );\n\n\t\t\t} else {\n\n\t\t\t\tl1.at( 1, target1 );\n\n\t\t\t}\n\n\t\t\tl2.closestPointToPoint( target1, true, target2 );\n\t\t\treturn;\n\n\t\t} else {\n\n\t\t\t// Both u and u2 are out of bounds.\n\t\t\tlet p;\n\t\t\tif ( d < 0 ) {\n\n\t\t\t\tp = l1.start;\n\n\t\t\t} else {\n\n\t\t\t\tp = l1.end;\n\n\t\t\t}\n\n\t\t\tlet p2;\n\t\t\tif ( d2 < 0 ) {\n\n\t\t\t\tp2 = l2.start;\n\n\t\t\t} else {\n\n\t\t\t\tp2 = l2.end;\n\n\t\t\t}\n\n\t\t\tconst closestPoint = temp1;\n\t\t\tconst closestPoint2 = temp2;\n\t\t\tl1.closestPointToPoint( p2, true, temp1 );\n\t\t\tl2.closestPointToPoint( p, true, temp2 );\n\n\t\t\tif ( closestPoint.distanceToSquared( p2 ) <= closestPoint2.distanceToSquared( p ) ) {\n\n\t\t\t\ttarget1.copy( closestPoint );\n\t\t\t\ttarget2.copy( p2 );\n\t\t\t\treturn;\n\n\t\t\t} else {\n\n\t\t\t\ttarget1.copy( p );\n\t\t\t\ttarget2.copy( closestPoint2 );\n\t\t\t\treturn;\n\n\t\t\t}\n\n\t\t}\n\n\t};\n\n} )();\n\n\nexport const sphereIntersectTriangle = ( function () {\n\n\t// https://stackoverflow.com/questions/34043955/detect-collision-between-sphere-and-triangle-in-three-js\n\tconst closestPointTemp = / @__PURE__ / new Vector3();\n\tconst projectedPointTemp = / @__PURE__ / new Vector3();\n\tconst planeTemp = / @__PURE__ / new Plane();\n\tconst lineTemp = / @__PURE__ / new Line3();\n\treturn function sphereIntersectTriangle( sphere, triangle ) {\n\n\t\tconst { radius, center } = sphere;\n\t\tconst { a, b, c } = triangle;\n\n\t\t// phase 1\n\t\tlineTemp.start = a;\n\t\tlineTemp.end = b;\n\t\tconst closestPoint1 = lineTemp.closestPointToPoint( center, true, closestPointTemp );\n\t\tif ( closestPoint1.distanceTo( center ) <= radius ) return true;\n\n\t\tlineTemp.start = a;\n\t\tlineTemp.end = c;\n\t\tconst closestPoint2 = lineTemp.closestPointToPoint( center, true, closestPointTemp );\n\t\tif ( closestPoint2.distanceTo( center ) <= radius ) return true;\n\n\t\tlineTemp.start = b;\n\t\tlineTemp.end = c;\n\t\tconst closestPoint3 = lineTemp.closestPointToPoint( center, true, closestPointTemp );\n\t\tif ( closestPoint3.distanceTo( center ) <= radius ) return true;\n\n\t\t// phase 2\n\t\tconst plane = triangle.getPlane( planeTemp );\n\t\tconst dp = Math.abs( plane.distanceToPoint( center ) );\n\t\tif ( dp <= radius ) {\n\n\t\t\tconst pp = plane.projectPoint( center, projectedPointTemp );\n\t\t\tconst cp = triangle.containsPoint( pp );\n\t\t\tif ( cp ) return true;\n\n\t\t}\n\n\t\treturn false;\n\n\t};\n\n} )();\n","/* @import { Sphere } from 'three' /\nimport { Triangle, Vector3, Vector2, Line3, Plane } from 'three';\nimport { SeparatingAxisBounds } from './SeparatingAxisBounds.js';\nimport { closestPointsSegmentToSegment, sphereIntersectTriangle } from './MathUtilities.js';\n\nconst componentKeys = [ 'x', 'y', 'z' ];\nconst ZERO_EPSILON = 1e-15;\nconst ZERO_EPSILON_SQR = ZERO_EPSILON ZERO_EPSILON;\nfunction isNearZero( value ) {\n\n\treturn Math.abs( value ) < ZERO_EPSILON;\n\n}\n\n/*\n An extended version of three.js' Triangle class. A variety of derivative values are cached on\n * the object to accelerate the intersection functions. `.needsUpdate` must be set to true when\n * modifying the triangle parameters.\n * @extends Triangle\n /\nexport class ExtendedTriangle extends Triangle {\n\n\tconstructor( ...args ) {\n\n\t\tsuper( ...args );\n\n\t\tthis.isExtendedTriangle = true;\n\t\tthis.satAxes = new Array( 4 ).fill().map( () => new Vector3() );\n\t\tthis.satBounds = new Array( 4 ).fill().map( () => new SeparatingAxisBounds() );\n\t\tthis.points = [ this.a, this.b, this.c ];\n\t\tthis.plane = new Plane();\n\t\tthis.isDegenerateIntoSegment = false;\n\t\tthis.isDegenerateIntoPoint = false;\n\t\tthis.degenerateSegment = new Line3();\n\n\t\t/\n\t\t Indicates that the triangle fields have changed so cached variables to accelerate other\n\t\t * function execution can be updated. Must be set to true after modifying the triangle\n\t\t * `a`, `b`, `c` fields.\n\t\t * @type {boolean}\n\t\t /\n\t\tthis.needsUpdate = true;\n\n\t}\n\n\t/\n\t Returns whether the triangle intersects the given sphere.\n\t * @param {Sphere} sphere\n\t * @returns {boolean}\n\t /\n\tintersectsSphere( sphere ) {\n\n\t\treturn sphereIntersectTriangle( sphere, this );\n\n\t}\n\n\tupdate() {\n\n\t\tconst a = this.a;\n\t\tconst b = this.b;\n\t\tconst c = this.c;\n\t\tconst points = this.points;\n\n\t\tconst satAxes = this.satAxes;\n\t\tconst satBounds = this.satBounds;\n\n\t\tconst axis0 = satAxes[ 0 ];\n\t\tconst sab0 = satBounds[ 0 ];\n\t\tthis.getNormal( axis0 );\n\t\tsab0.setFromPoints( axis0, points );\n\n\t\tconst axis1 = satAxes[ 1 ];\n\t\tconst sab1 = satBounds[ 1 ];\n\t\taxis1.subVectors( a, b );\n\t\tsab1.setFromPoints( axis1, points );\n\n\t\tconst axis2 = satAxes[ 2 ];\n\t\tconst sab2 = satBounds[ 2 ];\n\t\taxis2.subVectors( b, c );\n\t\tsab2.setFromPoints( axis2, points );\n\n\t\tconst axis3 = satAxes[ 3 ];\n\t\tconst sab3 = satBounds[ 3 ];\n\t\taxis3.subVectors( c, a );\n\t\tsab3.setFromPoints( axis3, points );\n\n\t\tconst lengthAB = axis1.length();\n\t\tconst lengthBC = axis2.length();\n\t\tconst lengthCA = axis3.length();\n\n\t\tthis.isDegenerateIntoPoint = false;\n\t\tthis.isDegenerateIntoSegment = false;\n\n\t\tif ( lengthAB < ZERO_EPSILON ) {\n\n\t\t\tif ( lengthBC < ZERO_EPSILON \|\| lengthCA < ZERO_EPSILON ) {\n\n\t\t\t\tthis.isDegenerateIntoPoint = true;\n\n\t\t\t} else {\n\n\t\t\t\tthis.isDegenerateIntoSegment = true;\n\t\t\t\tthis.degenerateSegment.start.copy( a );\n\t\t\t\tthis.degenerateSegment.end.copy( c );\n\n\t\t\t}\n\n\t\t} else if ( lengthBC < ZERO_EPSILON ) {\n\n\t\t\tif ( lengthCA < ZERO_EPSILON ) {\n\n\t\t\t\tthis.isDegenerateIntoPoint = true;\n\n\t\t\t} else {\n\n\t\t\t\tthis.isDegenerateIntoSegment = true;\n\t\t\t\tthis.degenerateSegment.start.copy( b );\n\t\t\t\tthis.degenerateSegment.end.copy( a );\n\n\t\t\t}\n\n\t\t} else if ( lengthCA < ZERO_EPSILON ) {\n\n\t\t\tthis.isDegenerateIntoSegment = true;\n\t\t\tthis.degenerateSegment.start.copy( c );\n\t\t\tthis.degenerateSegment.end.copy( b );\n\n\t\t}\n\n\t\tthis.plane.setFromNormalAndCoplanarPoint( axis0, a );\n\n\t\tthis.needsUpdate = false;\n\n\t}\n\n}\n\n/\n Returns the distance to the provided line segment. `target1` and `target2` are set to the\n * closest points on the triangle and segment respectively.\n * @function\n * @param {Line3} segment\n * @param {Vector3} [target1]\n * @param {Vector3} [target2]\n * @returns {number}\n /\nExtendedTriangle.prototype.closestPointToSegment = ( function () {\n\n\tconst point1 = / @__PURE__ / new Vector3();\n\tconst point2 = / @__PURE__ / new Vector3();\n\tconst edge = / @__PURE__ / new Line3();\n\n\treturn function distanceToSegment( segment, target1 = null, target2 = null ) {\n\n\t\tconst { start, end } = segment;\n\t\tconst points = this.points;\n\t\tlet distSq;\n\t\tlet closestDistanceSq = Infinity;\n\n\t\t// check the triangle edges\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst nexti = ( i + 1 ) % 3;\n\t\t\tedge.start.copy( points[ i ] );\n\t\t\tedge.end.copy( points[ nexti ] );\n\n\t\t\tclosestPointsSegmentToSegment( edge, segment, point1, point2 );\n\n\t\t\tdistSq = point1.distanceToSquared( point2 );\n\t\t\tif ( distSq < closestDistanceSq ) {\n\n\t\t\t\tclosestDistanceSq = distSq;\n\t\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t}\n\n\t\t}\n\n\t\t// check end points\n\t\tthis.closestPointToPoint( start, point1 );\n\t\tdistSq = start.distanceToSquared( point1 );\n\t\tif ( distSq < closestDistanceSq ) {\n\n\t\t\tclosestDistanceSq = distSq;\n\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\tif ( target2 ) target2.copy( start );\n\n\t\t}\n\n\t\tthis.closestPointToPoint( end, point1 );\n\t\tdistSq = end.distanceToSquared( point1 );\n\t\tif ( distSq < closestDistanceSq ) {\n\n\t\t\tclosestDistanceSq = distSq;\n\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\tif ( target2 ) target2.copy( end );\n\n\t\t}\n\n\t\treturn Math.sqrt( closestDistanceSq );\n\n\t};\n\n} )();\n\n/\n Returns whether the triangles intersect. `target` is set to the line segment representing\n * the intersection.\n * @function\n * @param {Triangle} other\n * @param {Line3} [target]\n * @param {boolean} [suppressLog=false]\n * @returns {boolean}\n /\nExtendedTriangle.prototype.intersectsTriangle = ( function () {\n\n\tconst saTri2 = / @__PURE__ / new ExtendedTriangle();\n\tconst cachedSatBounds = / @__PURE__ / new SeparatingAxisBounds();\n\tconst cachedSatBounds2 = / @__PURE__ / new SeparatingAxisBounds();\n\tconst tmpVec = / @__PURE__ / new Vector3();\n\tconst dir1 = / @__PURE__ / new Vector3();\n\tconst dir2 = / @__PURE__ / new Vector3();\n\tconst tempDir = / @__PURE__ / new Vector3();\n\tconst edge1 = / @__PURE__ / new Line3();\n\tconst edge2 = / @__PURE__ / new Line3();\n\tconst tempPoint = / @__PURE__ / new Vector3();\n\tconst bounds1 = / @__PURE__ / new Vector2();\n\tconst bounds2 = / @__PURE__ / new Vector2();\n\n\tfunction coplanarIntersectsTriangle( self, other, target, suppressLog ) {\n\n\t\t// Perform separating axis intersection test only for coplanar triangles\n\t\t// There should be at least one non-degenerate triangle when calling this\n\t\t// Otherwise we won't know the plane normal\n\t\tconst planeNormal = tmpVec;\n\t\tif ( ! self.isDegenerateIntoPoint && ! self.isDegenerateIntoSegment ) {\n\n\t\t\tplaneNormal.copy( self.plane.normal );\n\n\t\t} else {\n\n\t\t\tplaneNormal.copy( other.plane.normal );\n\n\t\t}\n\n\t\tconst satBounds1 = self.satBounds;\n\t\tconst satAxes1 = self.satAxes;\n\t\tfor ( let i = 1; i < 4; i ++ ) {\n\n\t\t\tconst sb = satBounds1[ i ];\n\t\t\tconst sa = satAxes1[ i ];\n\t\t\tcachedSatBounds.setFromPoints( sa, other.points );\n\t\t\tif ( sb.isSeparated( cachedSatBounds ) ) return false;\n\n\t\t\ttempDir.copy( planeNormal ).cross( sa );\n\t\t\tcachedSatBounds.setFromPoints( tempDir, self.points );\n\t\t\tcachedSatBounds2.setFromPoints( tempDir, other.points );\n\t\t\tif ( cachedSatBounds.isSeparated( cachedSatBounds2 ) ) return false;\n\n\t\t}\n\n\t\tconst satBounds2 = other.satBounds;\n\t\tconst satAxes2 = other.satAxes;\n\t\tfor ( let i = 1; i < 4; i ++ ) {\n\n\t\t\tconst sb = satBounds2[ i ];\n\t\t\tconst sa = satAxes2[ i ];\n\t\t\tcachedSatBounds.setFromPoints( sa, self.points );\n\t\t\tif ( sb.isSeparated( cachedSatBounds ) ) return false;\n\n\t\t\ttempDir.crossVectors( planeNormal, sa );\n\t\t\tcachedSatBounds.setFromPoints( tempDir, self.points );\n\t\t\tcachedSatBounds2.setFromPoints( tempDir, other.points );\n\t\t\tif ( cachedSatBounds.isSeparated( cachedSatBounds2 ) ) return false;\n\n\t\t}\n\n\t\tif ( target ) {\n\n\t\t\t// TODO find two points that intersect on the edges and make that the result\n\t\t\tif ( ! suppressLog ) {\n\n\t\t\t\tconsole.warn( 'ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0.' );\n\n\t\t\t}\n\n\t\t\ttarget.start.set( 0, 0, 0 );\n\t\t\ttarget.end.set( 0, 0, 0 );\n\n\t\t}\n\n\t\treturn true;\n\n\t}\n\n\tfunction findSingleBounds( a, b, c, aProj, bProj, cProj, aDist, bDist, cDist, bounds, edge ) {\n\n\t\tlet t = aDist / ( aDist - bDist );\n\t\tbounds.x = aProj + ( bProj - aProj ) t;\n\t\tedge.start.subVectors( b, a ).multiplyScalar( t ).add( a );\n\n\t\tt = aDist / ( aDist - cDist );\n\t\tbounds.y = aProj + ( cProj - aProj ) * t;\n\t\tedge.end.subVectors( c, a ).multiplyScalar( t ).add( a );\n\n\t}\n\n\t/*\n\t Calculates intersection segment of a triangle with intersection line.\n\t * Intersection line is snapped to its biggest component.\n\t * And triangle points are passed as a projection on that component.\n\t * @returns {boolean} whether this is a coplanar case or not\n\t /\n\tfunction findIntersectionLineBounds( self, aProj, bProj, cProj, abDist, acDist, aDist, bDist, cDist, bounds, edge ) {\n\n\t\tif ( abDist > 0 ) {\n\n\t\t\t// then bcDist < 0\n\t\t\tfindSingleBounds( self.c, self.a, self.b, cProj, aProj, bProj, cDist, aDist, bDist, bounds, edge );\n\n\t\t} else if ( acDist > 0 ) {\n\n\t\t\tfindSingleBounds( self.b, self.a, self.c, bProj, aProj, cProj, bDist, aDist, cDist, bounds, edge );\n\n\t\t} else if ( bDist cDist > 0 \|\| aDist != 0 ) {\n\n\t\t\tfindSingleBounds( self.a, self.b, self.c, aProj, bProj, cProj, aDist, bDist, cDist, bounds, edge );\n\n\t\t} else if ( bDist != 0 ) {\n\n\t\t\tfindSingleBounds( self.b, self.a, self.c, bProj, aProj, cProj, bDist, aDist, cDist, bounds, edge );\n\n\t\t} else if ( cDist != 0 ) {\n\n\t\t\tfindSingleBounds( self.c, self.a, self.b, cProj, aProj, bProj, cDist, aDist, bDist, bounds, edge );\n\n\t\t} else {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t\treturn false;\n\n\t}\n\n\tfunction intersectTriangleSegment( triangle, degenerateTriangle, target, suppressLog ) {\n\n\t\tconst segment = degenerateTriangle.degenerateSegment;\n\t\tconst startDist = triangle.plane.distanceToPoint( segment.start );\n\t\tconst endDist = triangle.plane.distanceToPoint( segment.end );\n\t\tif ( isNearZero( startDist ) ) {\n\n\t\t\tif ( isNearZero( endDist ) ) {\n\n\t\t\t\treturn coplanarIntersectsTriangle( triangle, degenerateTriangle, target, suppressLog );\n\n\t\t\t} else {\n\n\t\t\t\t// Is this fine to modify target even if there might be no intersection?\n\t\t\t\tif ( target ) {\n\n\t\t\t\t\ttarget.start.copy( segment.start );\n\t\t\t\t\ttarget.end.copy( segment.start );\n\n\t\t\t\t}\n\n\t\t\t\treturn triangle.containsPoint( segment.start );\n\n\t\t\t}\n\n\t\t} else if ( isNearZero( endDist ) ) {\n\n\t\t\tif ( target ) {\n\n\t\t\t\ttarget.start.copy( segment.end );\n\t\t\t\ttarget.end.copy( segment.end );\n\n\t\t\t}\n\n\t\t\treturn triangle.containsPoint( segment.end );\n\n\t\t} else {\n\n\t\t\tif ( triangle.plane.intersectLine( segment, tmpVec ) != null ) {\n\n\t\t\t\tif ( target ) {\n\n\t\t\t\t\ttarget.start.copy( tmpVec );\n\t\t\t\t\ttarget.end.copy( tmpVec );\n\n\t\t\t\t}\n\n\t\t\t\treturn triangle.containsPoint( tmpVec );\n\n\t\t\t} else {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tfunction intersectTrianglePoint( triangle, degenerateTriangle, target ) {\n\n\t\tconst point = degenerateTriangle.a;\n\n\t\tif ( isNearZero( triangle.plane.distanceToPoint( point ) ) && triangle.containsPoint( point ) ) {\n\n\t\t\tif ( target ) {\n\n\t\t\t\ttarget.start.copy( point );\n\t\t\t\ttarget.end.copy( point );\n\n\t\t\t}\n\n\t\t\treturn true;\n\n\t\t} else {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t}\n\n\tfunction intersectSegmentPoint( segmentTri, pointTri, target ) {\n\n\t\tconst segment = segmentTri.degenerateSegment;\n\t\tconst point = pointTri.a;\n\n\t\tsegment.closestPointToPoint( point, true, tmpVec );\n\n\t\tif ( point.distanceToSquared( tmpVec ) < ZERO_EPSILON_SQR ) {\n\n\t\t\tif ( target ) {\n\n\t\t\t\ttarget.start.copy( point );\n\t\t\t\ttarget.end.copy( point );\n\n\t\t\t}\n\n\t\t\treturn true;\n\n\t\t} else {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t}\n\n\tfunction handleDegenerateCases( self, other, target, suppressLog ) {\n\n\t\tif ( self.isDegenerateIntoSegment ) {\n\n\t\t\tif ( other.isDegenerateIntoSegment ) {\n\n\t\t\t\t// TODO: replace with Line.distanceSqToLine3 after r179\n\t\t\t\tconst segment1 = self.degenerateSegment;\n\t\t\t\tconst segment2 = other.degenerateSegment;\n\t\t\t\tconst delta1 = dir1;\n\t\t\t\tconst delta2 = dir2;\n\t\t\t\tsegment1.delta( delta1 );\n\t\t\t\tsegment2.delta( delta2 );\n\t\t\t\tconst startDelta = tmpVec.subVectors( segment2.start, segment1.start );\n\n\t\t\t\tconst denom = delta1.x * delta2.y - delta1.y * delta2.x;\n\t\t\t\tif ( isNearZero( denom ) ) {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t\tconst t = ( startDelta.x * delta2.y - startDelta.y * delta2.x ) / denom;\n\t\t\t\tconst u = - ( delta1.x * startDelta.y - delta1.y * startDelta.x ) / denom;\n\n\t\t\t\tif ( t < 0 \|\| t > 1 \|\| u < 0 \|\| u > 1 ) {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t\tconst z1 = segment1.start.z + delta1.z * t;\n\t\t\t\tconst z2 = segment2.start.z + delta2.z * u;\n\n\t\t\t\tif ( isNearZero( z1 - z2 ) ) {\n\n\t\t\t\t\tif ( target ) {\n\n\t\t\t\t\t\ttarget.start.copy( segment1.start ).addScaledVector( delta1, t );\n\t\t\t\t\t\ttarget.end.copy( segment1.start ).addScaledVector( delta1, t );\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} else if ( other.isDegenerateIntoPoint ) {\n\n\t\t\t\treturn intersectSegmentPoint( self, other, target );\n\n\t\t\t} else {\n\n\t\t\t\treturn intersectTriangleSegment( other, self, target, suppressLog );\n\n\t\t\t}\n\n\t\t} else if ( self.isDegenerateIntoPoint ) {\n\n\t\t\tif ( other.isDegenerateIntoPoint ) {\n\n\t\t\t\tif ( other.a.distanceToSquared( self.a ) < ZERO_EPSILON_SQR ) {\n\n\t\t\t\t\tif ( target ) {\n\n\t\t\t\t\t\ttarget.start.copy( self.a );\n\t\t\t\t\t\ttarget.end.copy( self.a );\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} else if ( other.isDegenerateIntoSegment ) {\n\n\t\t\t\treturn intersectSegmentPoint( other, self, target );\n\n\t\t\t} else {\n\n\t\t\t\treturn intersectTrianglePoint( other, self, target );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tif ( other.isDegenerateIntoPoint ) {\n\n\t\t\t\treturn intersectTrianglePoint( self, other, target );\n\n\t\t\t} else if ( other.isDegenerateIntoSegment ) {\n\n\t\t\t\treturn intersectTriangleSegment( self, other, target, suppressLog );\n\n\t\t\t} /* else this is a general triangle-traingle case, so return undefined /\n\n\t\t}\n\n\t}\n\n\t/ TODO: If the triangles are coplanar and intersecting the target is nonsensical. It should at least\n\t * be a line contained by both triangles if not a different special case somehow represented in the return result.\n\t \n\t General triangle intersection code is based on Moller's algorithm from here: https://web.stanford.edu/class/cs277/resources/papers/Moller1997b.pdf\n\t * Reference implementation from here: https://github.com/erich666/jgt-code/blob/master/Volume_08/Number_1/Shen2003/tri_tri_test/include/Moller97.c#L570\n\t * All degeneracies are handled before the general algorithm.\n\t * Coplanar check is different from Moller's and based on SAT tests.\n\t /\n\treturn function intersectsTriangle( other, target = null, suppressLog = false ) {\n\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\tif ( ! other.isExtendedTriangle ) {\n\n\t\t\tsaTri2.copy( other );\n\t\t\tsaTri2.update();\n\t\t\tother = saTri2;\n\n\t\t} else if ( other.needsUpdate ) {\n\n\t\t\tother.update();\n\n\t\t}\n\n\t\tconst res = handleDegenerateCases( this, other, target, suppressLog );\n\t\tif ( res !== undefined ) {\n\n\t\t\treturn res;\n\n\t\t}\n\n\t\tconst plane1 = this.plane;\n\t\tconst plane2 = other.plane;\n\n\t\tlet a1Dist = plane2.distanceToPoint( this.a );\n\t\tlet b1Dist = plane2.distanceToPoint( this.b );\n\t\tlet c1Dist = plane2.distanceToPoint( this.c );\n\n\t\tif ( isNearZero( a1Dist ) )\n\t\t\ta1Dist = 0;\n\n\t\tif ( isNearZero( b1Dist ) )\n\t\t\tb1Dist = 0;\n\n\t\tif ( isNearZero( c1Dist ) )\n\t\t\tc1Dist = 0;\n\n\t\tconst a1b1Dist = a1Dist b1Dist;\n\t\tconst a1c1Dist = a1Dist * c1Dist;\n\t\tif ( a1b1Dist > 0 && a1c1Dist > 0 ) {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t\tlet a2Dist = plane1.distanceToPoint( other.a );\n\t\tlet b2Dist = plane1.distanceToPoint( other.b );\n\t\tlet c2Dist = plane1.distanceToPoint( other.c );\n\n\t\tif ( isNearZero( a2Dist ) )\n\t\t\ta2Dist = 0;\n\n\t\tif ( isNearZero( b2Dist ) )\n\t\t\tb2Dist = 0;\n\n\t\tif ( isNearZero( c2Dist ) )\n\t\t\tc2Dist = 0;\n\n\t\tconst a2b2Dist = a2Dist * b2Dist;\n\t\tconst a2c2Dist = a2Dist * c2Dist;\n\t\tif ( a2b2Dist > 0 && a2c2Dist > 0 ) {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t\tdir1.copy( plane1.normal );\n\t\tdir2.copy( plane2.normal );\n\t\tconst intersectionLine = dir1.cross( dir2 );\n\n\t\tlet componentIndex = 0;\n\t\tlet maxComponent = Math.abs( intersectionLine.x );\n\t\tconst comp1 = Math.abs( intersectionLine.y );\n\t\tif ( comp1 > maxComponent ) {\n\n\t\t\tmaxComponent = comp1;\n\t\t\tcomponentIndex = 1;\n\n\t\t}\n\n\t\tconst comp2 = Math.abs( intersectionLine.z );\n\t\tif ( comp2 > maxComponent ) {\n\n\t\t\tcomponentIndex = 2;\n\n\t\t}\n\n\t\tconst key = componentKeys[ componentIndex ];\n\t\tconst a1Proj = this.a[ key ];\n\t\tconst b1Proj = this.b[ key ];\n\t\tconst c1Proj = this.c[ key ];\n\n\t\tconst a2Proj = other.a[ key ];\n\t\tconst b2Proj = other.b[ key ];\n\t\tconst c2Proj = other.c[ key ];\n\n\t\tif ( findIntersectionLineBounds( this, a1Proj, b1Proj, c1Proj, a1b1Dist, a1c1Dist, a1Dist, b1Dist, c1Dist, bounds1, edge1 ) ) {\n\n\t\t\treturn coplanarIntersectsTriangle( this, other, target, suppressLog );\n\n\t\t}\n\n\t\tif ( findIntersectionLineBounds( other, a2Proj, b2Proj, c2Proj, a2b2Dist, a2c2Dist, a2Dist, b2Dist, c2Dist, bounds2, edge2 ) ) {\n\n\t\t\treturn coplanarIntersectsTriangle( this, other, target, suppressLog );\n\n\t\t}\n\n\t\tif ( bounds1.y < bounds1.x ) {\n\n\t\t\tconst tmp = bounds1.y;\n\t\t\tbounds1.y = bounds1.x;\n\t\t\tbounds1.x = tmp;\n\n\t\t\ttempPoint.copy( edge1.start );\n\t\t\tedge1.start.copy( edge1.end );\n\t\t\tedge1.end.copy( tempPoint );\n\n\t\t}\n\n\t\tif ( bounds2.y < bounds2.x ) {\n\n\t\t\tconst tmp = bounds2.y;\n\t\t\tbounds2.y = bounds2.x;\n\t\t\tbounds2.x = tmp;\n\n\t\t\ttempPoint.copy( edge2.start );\n\t\t\tedge2.start.copy( edge2.end );\n\t\t\tedge2.end.copy( tempPoint );\n\n\t\t}\n\n\t\tif ( bounds1.y < bounds2.x \|\| bounds2.y < bounds1.x ) {\n\n\t\t\treturn false;\n\n\t\t}\n\n\t\tif ( target ) {\n\n\t\t\tif ( bounds2.x > bounds1.x ) {\n\n\t\t\t\ttarget.start.copy( edge2.start );\n\n\t\t\t} else {\n\n\t\t\t\ttarget.start.copy( edge1.start );\n\n\t\t\t}\n\n\t\t\tif ( bounds2.y < bounds1.y ) {\n\n\t\t\t\ttarget.end.copy( edge2.end );\n\n\t\t\t} else {\n\n\t\t\t\ttarget.end.copy( edge1.end );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn true;\n\n\t};\n\n} )();\n\n\n/*\n Returns the distance to the provided point.\n * @function\n * @param {Vector3} point\n * @returns {number}\n /\nExtendedTriangle.prototype.distanceToPoint = ( function () {\n\n\tconst target = / @__PURE__ / new Vector3();\n\treturn function distanceToPoint( point ) {\n\n\t\tthis.closestPointToPoint( point, target );\n\t\treturn point.distanceTo( target );\n\n\t};\n\n} )();\n\n\n/\n Returns the distance to the provided triangle.\n * @function\n * @param {Triangle} other\n * @param {Vector3} [target1]\n * @param {Vector3} [target2]\n * @returns {number}\n /\nExtendedTriangle.prototype.distanceToTriangle = ( function () {\n\n\tconst point = / @__PURE__ / new Vector3();\n\tconst point2 = / @__PURE__ / new Vector3();\n\tconst cornerFields = [ 'a', 'b', 'c' ];\n\tconst line1 = / @__PURE__ / new Line3();\n\tconst line2 = / @__PURE__ / new Line3();\n\n\treturn function distanceToTriangle( other, target1 = null, target2 = null ) {\n\n\t\tconst lineTarget = target1 \|\| target2 ? line1 : null;\n\t\t// `intersectsTriangle` returns a zero-length segment for coplanar\n\t\t// intersecting triangles, which is fine for our purposes here. We\n\t\t// don't need the segment itself in this function. So we can suppress\n\t\t// the warning about coplanar triangles.\n\t\tif ( this.intersectsTriangle( other, lineTarget, true ) ) {\n\n\t\t\tif ( target1 \|\| target2 ) {\n\n\t\t\t\tif ( target1 ) lineTarget.getCenter( target1 );\n\t\t\t\tif ( target2 ) lineTarget.getCenter( target2 );\n\n\t\t\t}\n\n\t\t\treturn 0;\n\n\t\t}\n\n\t\tlet closestDistanceSq = Infinity;\n\n\t\t// check all point distances\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tlet dist;\n\t\t\tconst field = cornerFields[ i ];\n\t\t\tconst otherVec = other[ field ];\n\t\t\tthis.closestPointToPoint( otherVec, point );\n\n\t\t\tdist = otherVec.distanceToSquared( point );\n\n\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\tif ( target1 ) target1.copy( point );\n\t\t\t\tif ( target2 ) target2.copy( otherVec );\n\n\t\t\t}\n\n\n\t\t\tconst thisVec = this[ field ];\n\t\t\tother.closestPointToPoint( thisVec, point );\n\n\t\t\tdist = thisVec.distanceToSquared( point );\n\n\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\tif ( target1 ) target1.copy( thisVec );\n\t\t\t\tif ( target2 ) target2.copy( point );\n\n\t\t\t}\n\n\t\t}\n\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst f11 = cornerFields[ i ];\n\t\t\tconst f12 = cornerFields[ ( i + 1 ) % 3 ];\n\t\t\tline1.set( this[ f11 ], this[ f12 ] );\n\t\t\tfor ( let i2 = 0; i2 < 3; i2 ++ ) {\n\n\t\t\t\tconst f21 = cornerFields[ i2 ];\n\t\t\t\tconst f22 = cornerFields[ ( i2 + 1 ) % 3 ];\n\t\t\t\tline2.set( other[ f21 ], other[ f22 ] );\n\n\t\t\t\tclosestPointsSegmentToSegment( line1, line2, point, point2 );\n\n\t\t\t\tconst dist = point.distanceToSquared( point2 );\n\t\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\t\tif ( target1 ) target1.copy( point );\n\t\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn Math.sqrt( closestDistanceSq );\n\n\t};\n\n} )();\n","/* @import { Box3, Triangle } from 'three' /\nimport { Vector3, Matrix4, Line3 } from 'three';\nimport { SeparatingAxisBounds } from './SeparatingAxisBounds.js';\nimport { ExtendedTriangle } from './ExtendedTriangle.js';\nimport { closestPointsSegmentToSegment } from './MathUtilities.js';\n\n/\n An oriented version of three.js' Box3 class. A variety of derivative values are cached on the\n * object to accelerate the intersection functions. `.needsUpdate` must be set to true when\n * modifying the box parameters.\n \n @param {Vector3} [min]\n * @param {Vector3} [max]\n * @param {Matrix4} [matrix]\n /\nexport class OrientedBox {\n\n\tconstructor( min, max, matrix ) {\n\n\t\tthis.isOrientedBox = true;\n\n\t\t/* @type {Vector3} /\n\t\tthis.min = new Vector3();\n\n\t\t/* @type {Vector3} /\n\t\tthis.max = new Vector3();\n\n\t\t/\n\t\t Matrix transformation applied to the box.\n\t\t * @type {Matrix4}\n\t\t /\n\t\tthis.matrix = new Matrix4();\n\t\tthis.invMatrix = new Matrix4();\n\t\tthis.points = new Array( 8 ).fill().map( () => new Vector3() );\n\t\tthis.satAxes = new Array( 3 ).fill().map( () => new Vector3() );\n\t\tthis.satBounds = new Array( 3 ).fill().map( () => new SeparatingAxisBounds() );\n\t\tthis.alignedSatBounds = new Array( 3 ).fill().map( () => new SeparatingAxisBounds() );\n\t\t/\n\t\t Indicates that the bounding box fields have changed so cached variables to accelerate\n\t\t * other function execution can be updated. Must be set to true after modifying the\n\t\t * oriented box `min`, `max`, `matrix` fields.\n\t\t * @type {boolean}\n\t\t /\n\t\tthis.needsUpdate = false;\n\n\t\tif ( min ) this.min.copy( min );\n\t\tif ( max ) this.max.copy( max );\n\t\tif ( matrix ) this.matrix.copy( matrix );\n\n\t}\n\n\t/\n\t Sets the oriented box parameters.\n\t * @param {Vector3} min\n\t * @param {Vector3} max\n\t * @param {Matrix4} matrix\n\t /\n\tset( min, max, matrix ) {\n\n\t\tthis.min.copy( min );\n\t\tthis.max.copy( max );\n\t\tthis.matrix.copy( matrix );\n\t\tthis.needsUpdate = true;\n\n\t}\n\n\tcopy( other ) {\n\n\t\tthis.min.copy( other.min );\n\t\tthis.max.copy( other.max );\n\t\tthis.matrix.copy( other.matrix );\n\t\tthis.needsUpdate = true;\n\n\t}\n\n}\n\nOrientedBox.prototype.update = ( function () {\n\n\treturn function update() {\n\n\t\tconst matrix = this.matrix;\n\t\tconst min = this.min;\n\t\tconst max = this.max;\n\n\t\tconst points = this.points;\n\t\tfor ( let x = 0; x <= 1; x ++ ) {\n\n\t\t\tfor ( let y = 0; y <= 1; y ++ ) {\n\n\t\t\t\tfor ( let z = 0; z <= 1; z ++ ) {\n\n\t\t\t\t\tconst i = ( ( 1 << 0 ) x ) \| ( ( 1 << 1 ) * y ) \| ( ( 1 << 2 ) * z );\n\t\t\t\t\tconst v = points[ i ];\n\t\t\t\t\tv.x = x ? max.x : min.x;\n\t\t\t\t\tv.y = y ? max.y : min.y;\n\t\t\t\t\tv.z = z ? max.z : min.z;\n\n\t\t\t\t\tv.applyMatrix4( matrix );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tconst satBounds = this.satBounds;\n\t\tconst satAxes = this.satAxes;\n\t\tconst minVec = points[ 0 ];\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst axis = satAxes[ i ];\n\t\t\tconst sb = satBounds[ i ];\n\t\t\tconst index = 1 << i;\n\t\t\tconst pi = points[ index ];\n\n\t\t\taxis.subVectors( minVec, pi );\n\t\t\tsb.setFromPoints( axis, points );\n\n\t\t}\n\n\t\tconst alignedSatBounds = this.alignedSatBounds;\n\t\talignedSatBounds[ 0 ].setFromPointsField( points, 'x' );\n\t\talignedSatBounds[ 1 ].setFromPointsField( points, 'y' );\n\t\talignedSatBounds[ 2 ].setFromPointsField( points, 'z' );\n\n\t\tthis.invMatrix.copy( this.matrix ).invert();\n\t\tthis.needsUpdate = false;\n\n\t};\n\n} )();\n\n/*\n Returns true if intersecting with the provided box.\n * @function\n * @param {Box3} box\n * @returns {boolean}\n /\nOrientedBox.prototype.intersectsBox = ( function () {\n\n\tconst aabbBounds = / @__PURE__ / new SeparatingAxisBounds();\n\treturn function intersectsBox( box ) {\n\n\t\t// TODO: should this be doing SAT against the AABB?\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\tconst min = box.min;\n\t\tconst max = box.max;\n\t\tconst satBounds = this.satBounds;\n\t\tconst satAxes = this.satAxes;\n\t\tconst alignedSatBounds = this.alignedSatBounds;\n\n\t\taabbBounds.min = min.x;\n\t\taabbBounds.max = max.x;\n\t\tif ( alignedSatBounds[ 0 ].isSeparated( aabbBounds ) ) return false;\n\n\t\taabbBounds.min = min.y;\n\t\taabbBounds.max = max.y;\n\t\tif ( alignedSatBounds[ 1 ].isSeparated( aabbBounds ) ) return false;\n\n\t\taabbBounds.min = min.z;\n\t\taabbBounds.max = max.z;\n\t\tif ( alignedSatBounds[ 2 ].isSeparated( aabbBounds ) ) return false;\n\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst axis = satAxes[ i ];\n\t\t\tconst sb = satBounds[ i ];\n\t\t\taabbBounds.setFromBox( axis, box );\n\t\t\tif ( sb.isSeparated( aabbBounds ) ) return false;\n\n\t\t}\n\n\t\treturn true;\n\n\t};\n\n} )();\n\n/\n Returns true if intersecting with the provided triangle.\n * @function\n * @param {Triangle} triangle\n * @returns {boolean}\n /\nOrientedBox.prototype.intersectsTriangle = ( function () {\n\n\tconst saTri = / @__PURE__ / new ExtendedTriangle();\n\tconst pointsArr = / @__PURE__ / new Array( 3 );\n\tconst cachedSatBounds = / @__PURE__ / new SeparatingAxisBounds();\n\tconst cachedSatBounds2 = / @__PURE__ / new SeparatingAxisBounds();\n\tconst cachedAxis = / @__PURE__ / new Vector3();\n\treturn function intersectsTriangle( triangle ) {\n\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\tif ( ! triangle.isExtendedTriangle ) {\n\n\t\t\tsaTri.copy( triangle );\n\t\t\tsaTri.update();\n\t\t\ttriangle = saTri;\n\n\t\t} else if ( triangle.needsUpdate ) {\n\n\t\t\ttriangle.update();\n\n\t\t}\n\n\t\tconst satBounds = this.satBounds;\n\t\tconst satAxes = this.satAxes;\n\n\t\tpointsArr[ 0 ] = triangle.a;\n\t\tpointsArr[ 1 ] = triangle.b;\n\t\tpointsArr[ 2 ] = triangle.c;\n\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sb = satBounds[ i ];\n\t\t\tconst sa = satAxes[ i ];\n\t\t\tcachedSatBounds.setFromPoints( sa, pointsArr );\n\t\t\tif ( sb.isSeparated( cachedSatBounds ) ) return false;\n\n\t\t}\n\n\t\tconst triSatBounds = triangle.satBounds;\n\t\tconst triSatAxes = triangle.satAxes;\n\t\tconst points = this.points;\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sb = triSatBounds[ i ];\n\t\t\tconst sa = triSatAxes[ i ];\n\t\t\tcachedSatBounds.setFromPoints( sa, points );\n\t\t\tif ( sb.isSeparated( cachedSatBounds ) ) return false;\n\n\t\t}\n\n\t\t// check crossed axes\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tconst sa1 = satAxes[ i ];\n\t\t\tfor ( let i2 = 0; i2 < 4; i2 ++ ) {\n\n\t\t\t\tconst sa2 = triSatAxes[ i2 ];\n\t\t\t\tcachedAxis.crossVectors( sa1, sa2 );\n\t\t\t\tcachedSatBounds.setFromPoints( cachedAxis, pointsArr );\n\t\t\t\tcachedSatBounds2.setFromPoints( cachedAxis, points );\n\t\t\t\tif ( cachedSatBounds.isSeparated( cachedSatBounds2 ) ) return false;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn true;\n\n\t};\n\n} )();\n\n/\n Returns the distance to the provided point. Sets `target` to the closest point on the surface\n * of the box if provided.\n * @function\n * @param {Vector3} point\n * @param {Vector3} target\n * @returns {number}\n /\nOrientedBox.prototype.closestPointToPoint = ( function () {\n\n\treturn function closestPointToPoint( point, target1 ) {\n\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\ttarget1\n\t\t\t.copy( point )\n\t\t\t.applyMatrix4( this.invMatrix )\n\t\t\t.clamp( this.min, this.max )\n\t\t\t.applyMatrix4( this.matrix );\n\n\t\treturn target1;\n\n\t};\n\n} )();\n\n/\n Returns the distance to the provided point.\n * @function\n * @param {Vector3} point\n * @returns {number}\n /\nOrientedBox.prototype.distanceToPoint = ( function () {\n\n\tconst target = new Vector3();\n\treturn function distanceToPoint( point ) {\n\n\t\tthis.closestPointToPoint( point, target );\n\t\treturn point.distanceTo( target );\n\n\t};\n\n} )();\n\n/\n Returns the distance to the provided box. `threshold` is an optional distance to return early\n * if the distance is found to be within it. `target1` and `target2` are set to the points on the\n * surface of this box and the `box` argument respectively.\n * @function\n * @param {Box3} box\n * @param {number} [threshold=0]\n * @param {Vector3} [target1]\n * @param {Vector3} [target2]\n * @returns {number}\n /\nOrientedBox.prototype.distanceToBox = ( function () {\n\n\tconst xyzFields = [ 'x', 'y', 'z' ];\n\tconst segments1 = / @__PURE__ / new Array( 12 ).fill().map( () => new Line3() );\n\tconst segments2 = / @__PURE__ / new Array( 12 ).fill().map( () => new Line3() );\n\n\tconst point1 = / @__PURE__ / new Vector3();\n\tconst point2 = / @__PURE__ / new Vector3();\n\n\t// early out if we find a value below threshold\n\treturn function distanceToBox( box, threshold = 0, target1 = null, target2 = null ) {\n\n\t\tif ( this.needsUpdate ) {\n\n\t\t\tthis.update();\n\n\t\t}\n\n\t\tif ( this.intersectsBox( box ) ) {\n\n\t\t\tif ( target1 \|\| target2 ) {\n\n\t\t\t\tbox.getCenter( point2 );\n\t\t\t\tthis.closestPointToPoint( point2, point1 );\n\t\t\t\tbox.closestPointToPoint( point1, point2 );\n\n\t\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t}\n\n\t\t\treturn 0;\n\n\t\t}\n\n\t\tconst threshold2 = threshold threshold;\n\t\tconst min = box.min;\n\t\tconst max = box.max;\n\t\tconst points = this.points;\n\n\n\t\t// iterate over every edge and compare distances\n\t\tlet closestDistanceSq = Infinity;\n\n\t\t// check over all these points\n\t\tfor ( let i = 0; i < 8; i ++ ) {\n\n\t\t\tconst p = points[ i ];\n\t\t\tpoint2.copy( p ).clamp( min, max );\n\n\t\t\tconst dist = p.distanceToSquared( point2 );\n\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\tif ( target1 ) target1.copy( p );\n\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t\tif ( dist < threshold2 ) return Math.sqrt( dist );\n\n\t\t\t}\n\n\t\t}\n\n\t\t// generate and check all line segment distances\n\t\tlet count = 0;\n\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\tfor ( let i1 = 0; i1 <= 1; i1 ++ ) {\n\n\t\t\t\tfor ( let i2 = 0; i2 <= 1; i2 ++ ) {\n\n\t\t\t\t\tconst nextIndex = ( i + 1 ) % 3;\n\t\t\t\t\tconst nextIndex2 = ( i + 2 ) % 3;\n\n\t\t\t\t\t// get obb line segments\n\t\t\t\t\tconst index = i1 << nextIndex \| i2 << nextIndex2;\n\t\t\t\t\tconst index2 = 1 << i \| i1 << nextIndex \| i2 << nextIndex2;\n\t\t\t\t\tconst p1 = points[ index ];\n\t\t\t\t\tconst p2 = points[ index2 ];\n\t\t\t\t\tconst line1 = segments1[ count ];\n\t\t\t\t\tline1.set( p1, p2 );\n\n\n\t\t\t\t\t// get aabb line segments\n\t\t\t\t\tconst f1 = xyzFields[ i ];\n\t\t\t\t\tconst f2 = xyzFields[ nextIndex ];\n\t\t\t\t\tconst f3 = xyzFields[ nextIndex2 ];\n\t\t\t\t\tconst line2 = segments2[ count ];\n\t\t\t\t\tconst start = line2.start;\n\t\t\t\t\tconst end = line2.end;\n\n\t\t\t\t\tstart[ f1 ] = min[ f1 ];\n\t\t\t\t\tstart[ f2 ] = i1 ? min[ f2 ] : max[ f2 ];\n\t\t\t\t\tstart[ f3 ] = i2 ? min[ f3 ] : max[ f2 ];\n\n\t\t\t\t\tend[ f1 ] = max[ f1 ];\n\t\t\t\t\tend[ f2 ] = i1 ? min[ f2 ] : max[ f2 ];\n\t\t\t\t\tend[ f3 ] = i2 ? min[ f3 ] : max[ f2 ];\n\n\t\t\t\t\tcount ++;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\t// check all the other boxes point\n\t\tfor ( let x = 0; x <= 1; x ++ ) {\n\n\t\t\tfor ( let y = 0; y <= 1; y ++ ) {\n\n\t\t\t\tfor ( let z = 0; z <= 1; z ++ ) {\n\n\t\t\t\t\tpoint2.x = x ? max.x : min.x;\n\t\t\t\t\tpoint2.y = y ? max.y : min.y;\n\t\t\t\t\tpoint2.z = z ? max.z : min.z;\n\n\t\t\t\t\tthis.closestPointToPoint( point2, point1 );\n\t\t\t\t\tconst dist = point2.distanceToSquared( point1 );\n\t\t\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t\t\t\tif ( dist < threshold2 ) return Math.sqrt( dist );\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tfor ( let i = 0; i < 12; i ++ ) {\n\n\t\t\tconst l1 = segments1[ i ];\n\t\t\tfor ( let i2 = 0; i2 < 12; i2 ++ ) {\n\n\t\t\t\tconst l2 = segments2[ i2 ];\n\t\t\t\tclosestPointsSegmentToSegment( l1, l2, point1, point2 );\n\t\t\t\tconst dist = point1.distanceToSquared( point2 );\n\t\t\t\tif ( dist < closestDistanceSq ) {\n\n\t\t\t\t\tclosestDistanceSq = dist;\n\t\t\t\t\tif ( target1 ) target1.copy( point1 );\n\t\t\t\t\tif ( target2 ) target2.copy( point2 );\n\n\t\t\t\t\tif ( dist < threshold2 ) return Math.sqrt( dist );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn Math.sqrt( closestDistanceSq );\n\n\t};\n\n} )();\n","import { ExtendedTriangle } from '../math/ExtendedTriangle.js';\nimport { PrimitivePool } from './PrimitivePool.js';\n\nclass ExtendedTrianglePoolBase extends PrimitivePool {\n\n\tconstructor() {\n\n\t\tsuper( () => new ExtendedTriangle() );\n\n\t}\n\n}\n\nexport const ExtendedTrianglePool = /* @__PURE__ / new ExtendedTrianglePoolBase();\n","import { Vector3 } from 'three';\n\nconst temp = / @__PURE__ / new Vector3();\nconst temp1 = / @__PURE__ / new Vector3();\n\nexport function closestPointToPoint(\n\tbvh,\n\tpoint,\n\ttarget = { },\n\tminThreshold = 0,\n\tmaxThreshold = Infinity,\n) {\n\n\t// early out if under minThreshold\n\t// skip checking if over maxThreshold\n\t// set minThreshold = maxThreshold to quickly check if a point is within a threshold\n\t// returns Infinity if no value found\n\tconst minThresholdSq = minThreshold minThreshold;\n\tconst maxThresholdSq = maxThreshold * maxThreshold;\n\tlet closestDistanceSq = Infinity;\n\tlet closestDistanceTriIndex = null;\n\tbvh.shapecast(\n\n\t\t{\n\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\ttemp.copy( point ).clamp( box.min, box.max );\n\t\t\t\treturn temp.distanceToSquared( point );\n\n\t\t\t},\n\n\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\treturn score < closestDistanceSq && score < maxThresholdSq;\n\n\t\t\t},\n\n\t\t\tintersectsTriangle: ( tri, triIndex ) => {\n\n\t\t\t\ttri.closestPointToPoint( point, temp );\n\t\t\t\tconst distSq = point.distanceToSquared( temp );\n\t\t\t\tif ( distSq < closestDistanceSq ) {\n\n\t\t\t\t\ttemp1.copy( temp );\n\t\t\t\t\tclosestDistanceSq = distSq;\n\t\t\t\t\tclosestDistanceTriIndex = triIndex;\n\n\t\t\t\t}\n\n\t\t\t\tif ( distSq < minThresholdSq ) {\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t},\n\n\t\t}\n\n\t);\n\n\tif ( closestDistanceSq === Infinity ) return null;\n\n\tconst closestDistance = Math.sqrt( closestDistanceSq );\n\n\tif ( ! target.point ) target.point = temp1.clone();\n\telse target.point.copy( temp1 );\n\ttarget.distance = closestDistance,\n\ttarget.faceIndex = closestDistanceTriIndex;\n\n\treturn target;\n\n}\n","import { Vector3, Vector2, Triangle, DoubleSide, BackSide, REVISION } from 'three';\n\nconst IS_GT_REVISION_169 = parseInt( REVISION ) >= 169;\nconst IS_LT_REVISION_161 = parseInt( REVISION ) <= 161;\n\n// Ripped and modified From THREE.js Mesh raycast\n// https://github.com/mrdoob/three.js/blob/0aa87c999fe61e216c1133fba7a95772b503eddf/src/objects/Mesh.js#L115\nconst _vA = /* @__PURE__ / new Vector3();\nconst _vB = / @__PURE__ / new Vector3();\nconst _vC = / @__PURE__ / new Vector3();\n\nconst _uvA = / @__PURE__ / new Vector2();\nconst _uvB = / @__PURE__ / new Vector2();\nconst _uvC = / @__PURE__ / new Vector2();\n\nconst _normalA = / @__PURE__ / new Vector3();\nconst _normalB = / @__PURE__ / new Vector3();\nconst _normalC = / @__PURE__ / new Vector3();\n\nconst _intersectionPoint = / @__PURE__ / new Vector3();\nfunction checkIntersection( ray, pA, pB, pC, point, side, near, far ) {\n\n\tlet intersect;\n\tif ( side === BackSide ) {\n\n\t\tintersect = ray.intersectTriangle( pC, pB, pA, true, point );\n\n\t} else {\n\n\t\tintersect = ray.intersectTriangle( pA, pB, pC, side !== DoubleSide, point );\n\n\t}\n\n\tif ( intersect === null ) return null;\n\n\tconst distance = ray.origin.distanceTo( point );\n\n\tif ( distance < near \|\| distance > far ) return null;\n\n\treturn {\n\n\t\tdistance: distance,\n\t\tpoint: point.clone(),\n\n\t};\n\n}\n\nfunction checkBufferGeometryIntersection( ray, position, normal, uv, uv1, a, b, c, side, near, far ) {\n\n\t_vA.fromBufferAttribute( position, a );\n\t_vB.fromBufferAttribute( position, b );\n\t_vC.fromBufferAttribute( position, c );\n\n\tconst intersection = checkIntersection( ray, _vA, _vB, _vC, _intersectionPoint, side, near, far );\n\n\tif ( intersection ) {\n\n\t\tif ( uv ) {\n\n\t\t\t_uvA.fromBufferAttribute( uv, a );\n\t\t\t_uvB.fromBufferAttribute( uv, b );\n\t\t\t_uvC.fromBufferAttribute( uv, c );\n\n\t\t\tintersection.uv = new Vector2();\n\t\t\tconst res = Triangle.getInterpolation( _intersectionPoint, _vA, _vB, _vC, _uvA, _uvB, _uvC, intersection.uv );\n\t\t\tif ( ! IS_GT_REVISION_169 ) {\n\n\t\t\t\tintersection.uv = res;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( uv1 ) {\n\n\t\t\t_uvA.fromBufferAttribute( uv1, a );\n\t\t\t_uvB.fromBufferAttribute( uv1, b );\n\t\t\t_uvC.fromBufferAttribute( uv1, c );\n\n\t\t\tintersection.uv1 = new Vector2();\n\t\t\tconst res = Triangle.getInterpolation( _intersectionPoint, _vA, _vB, _vC, _uvA, _uvB, _uvC, intersection.uv1 );\n\t\t\tif ( ! IS_GT_REVISION_169 ) {\n\n\t\t\t\tintersection.uv1 = res;\n\n\t\t\t}\n\n\t\t\tif ( IS_LT_REVISION_161 ) {\n\n\t\t\t\tintersection.uv2 = intersection.uv1;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( normal ) {\n\n\t\t\t_normalA.fromBufferAttribute( normal, a );\n\t\t\t_normalB.fromBufferAttribute( normal, b );\n\t\t\t_normalC.fromBufferAttribute( normal, c );\n\n\t\t\tintersection.normal = new Vector3();\n\t\t\tconst res = Triangle.getInterpolation( _intersectionPoint, _vA, _vB, _vC, _normalA, _normalB, _normalC, intersection.normal );\n\t\t\tif ( intersection.normal.dot( ray.direction ) > 0 ) {\n\n\t\t\t\tintersection.normal.multiplyScalar( - 1 );\n\n\t\t\t}\n\n\t\t\tif ( ! IS_GT_REVISION_169 ) {\n\n\t\t\t\tintersection.normal = res;\n\n\t\t\t}\n\n\t\t}\n\n\t\tconst face = {\n\t\t\ta: a,\n\t\t\tb: b,\n\t\t\tc: c,\n\t\t\tnormal: new Vector3(),\n\t\t\tmaterialIndex: 0\n\t\t};\n\n\t\tTriangle.getNormal( _vA, _vB, _vC, face.normal );\n\n\t\tintersection.face = face;\n\t\tintersection.faceIndex = a;\n\n\t\tif ( IS_GT_REVISION_169 ) {\n\n\t\t\tconst barycoord = new Vector3();\n\t\t\tTriangle.getBarycoord( _intersectionPoint, _vA, _vB, _vC, barycoord );\n\n\t\t\tintersection.barycoord = barycoord;\n\n\t\t}\n\n\t}\n\n\treturn intersection;\n\n}\n\nfunction getSide( materialOrSide ) {\n\n\treturn materialOrSide && materialOrSide.isMaterial ? materialOrSide.side : materialOrSide;\n\n}\n\n// https://github.com/mrdoob/three.js/blob/0aa87c999fe61e216c1133fba7a95772b503eddf/src/objects/Mesh.js#L258\nexport function intersectTri( geometry, materialOrSide, ray, tri, intersections, near, far ) {\n\n\tconst triOffset = tri 3;\n\tlet a = triOffset + 0;\n\tlet b = triOffset + 1;\n\tlet c = triOffset + 2;\n\n\tconst { index, groups } = geometry;\n\tif ( geometry.index ) {\n\n\t\ta = index.getX( a );\n\t\tb = index.getX( b );\n\t\tc = index.getX( c );\n\n\t}\n\n\tconst { position, normal, uv, uv1 } = geometry.attributes;\n\tif ( Array.isArray( materialOrSide ) ) {\n\n\t\t// check which groups a triangle is present in and run the intersections\n\t\t// TODO: we shouldn't need to run and intersection test multiple times\n\t\tconst firstIndex = tri * 3;\n\t\tfor ( let i = 0, l = groups.length; i < l; i ++ ) {\n\n\t\t\tconst { start, count, materialIndex } = groups[ i ];\n\t\t\tif ( firstIndex >= start && firstIndex < start + count ) {\n\n\t\t\t\tconst side = getSide( materialOrSide[ materialIndex ] );\n\t\t\t\tconst intersection = checkBufferGeometryIntersection( ray, position, normal, uv, uv1, a, b, c, side, near, far );\n\t\t\t\tif ( intersection ) {\n\n\t\t\t\t\tintersection.faceIndex = tri;\n\t\t\t\t\tintersection.face.materialIndex = materialIndex;\n\n\t\t\t\t\tif ( intersections ) {\n\n\t\t\t\t\t\tintersections.push( intersection );\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\treturn intersection;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t} else {\n\n\t\t// run the intersection for the single material\n\t\tconst side = getSide( materialOrSide );\n\t\tconst intersection = checkBufferGeometryIntersection( ray, position, normal, uv, uv1, a, b, c, side, near, far );\n\t\tif ( intersection ) {\n\n\t\t\tintersection.faceIndex = tri;\n\t\t\tintersection.face.materialIndex = 0;\n\n\t\t\tif ( intersections ) {\n\n\t\t\t\tintersections.push( intersection );\n\n\t\t\t} else {\n\n\t\t\t\treturn intersection;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn null;\n\n}\n","/** @import { BufferGeometry } from 'three' /\nimport { Vector2, Vector3, Triangle } from 'three';\n\n// sets the vertices of triangle `tri` with the 3 vertices after i\nexport function setTriangle( tri, i, index, pos ) {\n\n\tconst ta = tri.a;\n\tconst tb = tri.b;\n\tconst tc = tri.c;\n\n\tlet i0 = i;\n\tlet i1 = i + 1;\n\tlet i2 = i + 2;\n\tif ( index ) {\n\n\t\ti0 = index.getX( i0 );\n\t\ti1 = index.getX( i1 );\n\t\ti2 = index.getX( i2 );\n\n\t}\n\n\tta.x = pos.getX( i0 );\n\tta.y = pos.getY( i0 );\n\tta.z = pos.getZ( i0 );\n\n\ttb.x = pos.getX( i1 );\n\ttb.y = pos.getY( i1 );\n\ttb.z = pos.getZ( i1 );\n\n\ttc.x = pos.getX( i2 );\n\ttc.y = pos.getY( i2 );\n\ttc.z = pos.getZ( i2 );\n\n}\n\nconst tempV1 = / @__PURE__ / new Vector3();\nconst tempV2 = / @__PURE__ / new Vector3();\nconst tempV3 = / @__PURE__ / new Vector3();\nconst tempUV1 = / @__PURE__ / new Vector2();\nconst tempUV2 = / @__PURE__ / new Vector2();\nconst tempUV3 = / @__PURE__ / new Vector2();\n\n/\n @typedef {Object} HitTriangleInfo\n * @property {{ a: number, b: number, c: number, materialIndex: number, normal: Vector3 }} face\n * Triangle vertex indices, material index, and face normal.\n * @property {Vector2\|null} uv - UV coordinates at the hit point, or `null` if no UV attribute is present.\n * @property {Vector3} barycoord - Barycentric coordinates of the hit point within the triangle.\n /\n\n/\n Computes hit-point information for a point on a triangle within a `BufferGeometry`. Returns\n * the face vertex indices, face normal, material index, UV coordinates, and barycentric coordinates.\n * Useful for retrieving detailed hit data after a call to `MeshBVH.closestPointToPoint` or\n * `MeshBVH.closestPointToGeometry`.\n \n @section Functions\n * @param {Vector3} point - The point on the triangle surface (in the geometry's local space).\n * @param {BufferGeometry} geometry - The geometry containing the triangle.\n * @param {number} triangleIndex - The index of the triangle within the geometry.\n * @param {HitTriangleInfo} [target] - Optional object to write results into. Reuses existing\n * `face`, `uv`, and `barycoord` sub-objects if present.\n * @returns {HitTriangleInfo}\n /\nexport function getTriangleHitPointInfo( point, geometry, triangleIndex, target ) {\n\n\tconst indices = geometry.getIndex().array;\n\tconst positions = geometry.getAttribute( 'position' );\n\tconst uvs = geometry.getAttribute( 'uv' );\n\n\tconst a = indices[ triangleIndex 3 ];\n\tconst b = indices[ triangleIndex * 3 + 1 ];\n\tconst c = indices[ triangleIndex * 3 + 2 ];\n\n\ttempV1.fromBufferAttribute( positions, a );\n\ttempV2.fromBufferAttribute( positions, b );\n\ttempV3.fromBufferAttribute( positions, c );\n\n\t// find the associated material index\n\tlet materialIndex = 0;\n\tconst groups = geometry.groups;\n\tconst firstVertexIndex = triangleIndex * 3;\n\tfor ( let i = 0, l = groups.length; i < l; i ++ ) {\n\n\t\tconst group = groups[ i ];\n\t\tconst { start, count } = group;\n\t\tif ( firstVertexIndex >= start && firstVertexIndex < start + count ) {\n\n\t\t\tmaterialIndex = group.materialIndex;\n\t\t\tbreak;\n\n\t\t}\n\n\t}\n\n\t// extract barycoord\n\tconst barycoord = target && target.barycoord ? target.barycoord : new Vector3();\n\tTriangle.getBarycoord( point, tempV1, tempV2, tempV3, barycoord );\n\n\t// extract uvs\n\tlet uv = null;\n\tif ( uvs ) {\n\n\t\ttempUV1.fromBufferAttribute( uvs, a );\n\t\ttempUV2.fromBufferAttribute( uvs, b );\n\t\ttempUV3.fromBufferAttribute( uvs, c );\n\n\t\tif ( target && target.uv ) uv = target.uv;\n\t\telse uv = new Vector2();\n\n\t\tTriangle.getInterpolation( point, tempV1, tempV2, tempV3, tempUV1, tempUV2, tempUV3, uv );\n\n\t}\n\n\t// adjust the provided target or create a new one\n\tif ( target ) {\n\n\t\tif ( ! target.face ) target.face = { };\n\t\ttarget.face.a = a;\n\t\ttarget.face.b = b;\n\t\ttarget.face.c = c;\n\t\ttarget.face.materialIndex = materialIndex;\n\t\tif ( ! target.face.normal ) target.face.normal = new Vector3();\n\t\tTriangle.getNormal( tempV1, tempV2, tempV3, target.face.normal );\n\n\t\tif ( uv ) target.uv = uv;\n\t\ttarget.barycoord = barycoord;\n\n\t\treturn target;\n\n\t} else {\n\n\t\treturn {\n\t\t\tface: {\n\t\t\t\ta: a,\n\t\t\t\tb: b,\n\t\t\t\tc: c,\n\t\t\t\tmaterialIndex: materialIndex,\n\t\t\t\tnormal: Triangle.getNormal( tempV1, tempV2, tempV3, new Vector3() )\n\t\t\t},\n\t\t\tuv: uv,\n\t\t\tbarycoord: barycoord,\n\t\t};\n\n\t}\n\n}\n","import { intersectTri } from '../../utils/ThreeRayIntersectUtilities.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\n\n/************************************************************/\n/ This file is generated from \"iterationUtils.template.js\". /\n/***********************************************************/\n\nfunction intersectTris( bvh, materialOrSide, ray, offset, count, intersections, near, far ) {\n\n\tconst { geometry, _indirectBuffer } = bvh;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\n\t\tintersectTri( geometry, materialOrSide, ray, i, intersections, near, far );\n\n\n\t}\n\n}\n\nfunction intersectClosestTri( bvh, materialOrSide, ray, offset, count, near, far ) {\n\n\tconst { geometry, _indirectBuffer } = bvh;\n\tlet dist = Infinity;\n\tlet res = null;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\tlet intersection;\n\n\t\tintersection = intersectTri( geometry, materialOrSide, ray, i, null, near, far );\n\n\n\t\tif ( intersection && intersection.distance < dist ) {\n\n\t\t\tres = intersection;\n\t\t\tdist = intersection.distance;\n\n\t\t}\n\n\t}\n\n\treturn res;\n\n}\n\nfunction iterateOverTriangles(\n\toffset,\n\tcount,\n\tbvh,\n\tintersectsTriangleFunc,\n\tcontained,\n\tdepth,\n\ttriangle\n) {\n\n\tconst { geometry } = bvh;\n\tconst { index } = geometry;\n\tconst pos = geometry.attributes.position;\n\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\tlet tri;\n\n\t\ttri = i;\n\n\t\tsetTriangle( triangle, tri 3, index, pos );\n\t\ttriangle.needsUpdate = true;\n\n\t\tif ( intersectsTriangleFunc( triangle, tri, contained, depth ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n\nexport { intersectClosestTri, intersectTris, iterateOverTriangles };\n","import { UINT32_PER_NODE, BYTES_PER_NODE } from '../Constants.js';\nimport { IS_LEAF, OFFSET, COUNT, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\n\n/***************************************************/\n/ This file is generated from \"refit.template.js\". /\n/**************************************************/\n\nfunction refit( bvh, nodeIndices = null ) {\n\n\tif ( nodeIndices && Array.isArray( nodeIndices ) ) {\n\n\t\tnodeIndices = new Set( nodeIndices );\n\n\t}\n\n\tconst geometry = bvh.geometry;\n\tconst indexArr = geometry.index ? geometry.index.array : null;\n\tconst posAttr = geometry.attributes.position;\n\n\tlet buffer, uint32Array, uint16Array, float32Array;\n\tlet byteOffset = 0;\n\tconst roots = bvh._roots;\n\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\tbuffer = roots[ i ];\n\t\tuint32Array = new Uint32Array( buffer );\n\t\tuint16Array = new Uint16Array( buffer );\n\t\tfloat32Array = new Float32Array( buffer );\n\n\t\t_traverse( 0, byteOffset );\n\t\tbyteOffset += buffer.byteLength;\n\n\t}\n\n\tfunction _traverse( nodeIndex32, byteOffset, force = false ) {\n\n\t\tconst nodeIndex16 = nodeIndex32 2;\n\t\tif ( IS_LEAF( nodeIndex16, uint16Array ) ) {\n\n\t\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t\tlet minx = Infinity;\n\t\t\tlet miny = Infinity;\n\t\t\tlet minz = Infinity;\n\t\t\tlet maxx = - Infinity;\n\t\t\tlet maxy = - Infinity;\n\t\t\tlet maxz = - Infinity;\n\n\n\t\t\tfor ( let i = 3 * offset, l = 3 * ( offset + count ); i < l; i ++ ) {\n\n\t\t\t\tlet index = indexArr[ i ];\n\t\t\t\tconst x = posAttr.getX( index );\n\t\t\t\tconst y = posAttr.getY( index );\n\t\t\t\tconst z = posAttr.getZ( index );\n\n\t\t\t\tif ( x < minx ) minx = x;\n\t\t\t\tif ( x > maxx ) maxx = x;\n\n\t\t\t\tif ( y < miny ) miny = y;\n\t\t\t\tif ( y > maxy ) maxy = y;\n\n\t\t\t\tif ( z < minz ) minz = z;\n\t\t\t\tif ( z > maxz ) maxz = z;\n\n\t\t\t}\n\n\n\t\t\tif (\n\t\t\t\tfloat32Array[ nodeIndex32 + 0 ] !== minx \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 1 ] !== miny \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 2 ] !== minz \|\|\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 3 ] !== maxx \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 4 ] !== maxy \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 5 ] !== maxz\n\t\t\t) {\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 0 ] = minx;\n\t\t\t\tfloat32Array[ nodeIndex32 + 1 ] = miny;\n\t\t\t\tfloat32Array[ nodeIndex32 + 2 ] = minz;\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 3 ] = maxx;\n\t\t\t\tfloat32Array[ nodeIndex32 + 4 ] = maxy;\n\t\t\t\tfloat32Array[ nodeIndex32 + 5 ] = maxz;\n\n\t\t\t\treturn true;\n\n\t\t\t} else {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t\t// the identifying node indices provided by the shapecast function include offsets of all\n\t\t\t// root buffers to guarantee they're unique between roots so offset left and right indices here.\n\t\t\tlet forceChildren = force;\n\t\t\tlet includesLeft = false;\n\t\t\tlet includesRight = false;\n\n\t\t\tif ( nodeIndices ) {\n\n\t\t\t\t// if we see that neither the left or right child are included in the set that need to be updated\n\t\t\t\t// then we assume that all children need to be updated.\n\t\t\t\tif ( ! forceChildren ) {\n\n\t\t\t\t\tconst leftNodeId = left / UINT32_PER_NODE + byteOffset / BYTES_PER_NODE;\n\t\t\t\t\tconst rightNodeId = right / UINT32_PER_NODE + byteOffset / BYTES_PER_NODE;\n\t\t\t\t\tincludesLeft = nodeIndices.has( leftNodeId );\n\t\t\t\t\tincludesRight = nodeIndices.has( rightNodeId );\n\t\t\t\t\tforceChildren = ! includesLeft && ! includesRight;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tincludesLeft = true;\n\t\t\t\tincludesRight = true;\n\n\t\t\t}\n\n\t\t\tconst traverseLeft = forceChildren \|\| includesLeft;\n\t\t\tconst traverseRight = forceChildren \|\| includesRight;\n\n\t\t\tlet leftChange = false;\n\t\t\tif ( traverseLeft ) {\n\n\t\t\t\tleftChange = _traverse( left, byteOffset, forceChildren );\n\n\t\t\t}\n\n\t\t\tlet rightChange = false;\n\t\t\tif ( traverseRight ) {\n\n\t\t\t\trightChange = _traverse( right, byteOffset, forceChildren );\n\n\t\t\t}\n\n\t\t\tconst didChange = leftChange \|\| rightChange;\n\t\t\tif ( didChange ) {\n\n\t\t\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\t\t\tconst left_i = left + i;\n\t\t\t\t\tconst right_i = right + i;\n\t\t\t\t\tconst minLeftValue = float32Array[ left_i ];\n\t\t\t\t\tconst maxLeftValue = float32Array[ left_i + 3 ];\n\t\t\t\t\tconst minRightValue = float32Array[ right_i ];\n\t\t\t\t\tconst maxRightValue = float32Array[ right_i + 3 ];\n\n\t\t\t\t\tfloat32Array[ nodeIndex32 + i ] = minLeftValue < minRightValue ? minLeftValue : minRightValue;\n\t\t\t\t\tfloat32Array[ nodeIndex32 + i + 3 ] = maxLeftValue > maxRightValue ? maxLeftValue : maxRightValue;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn didChange;\n\n\t\t}\n\n\t}\n\n}\n\nexport { refit };\n","\nexport function intersectsNodeBounds( nodeIndex32, array, ray, near, far ) {\n\n\t// This function performs intersection tests similar to Ray.intersectBox in three.js,\n\t// with the difference that the box values are read from an array to improve performance.\n\n\tlet tmin, tmax, tymin, tymax, tzmin, tzmax;\n\n\tconst invdirx = 1 / ray.direction.x,\n\t\tinvdiry = 1 / ray.direction.y,\n\t\tinvdirz = 1 / ray.direction.z;\n\n\tconst ox = ray.origin.x;\n\tconst oy = ray.origin.y;\n\tconst oz = ray.origin.z;\n\n\tlet minx = array[ nodeIndex32 ];\n\tlet maxx = array[ nodeIndex32 + 3 ];\n\n\tlet miny = array[ nodeIndex32 + 1 ];\n\tlet maxy = array[ nodeIndex32 + 3 + 1 ];\n\n\tlet minz = array[ nodeIndex32 + 2 ];\n\tlet maxz = array[ nodeIndex32 + 3 + 2 ];\n\n\tif ( invdirx >= 0 ) {\n\n\t\ttmin = ( minx - ox ) * invdirx;\n\t\ttmax = ( maxx - ox ) * invdirx;\n\n\t} else {\n\n\t\ttmin = ( maxx - ox ) * invdirx;\n\t\ttmax = ( minx - ox ) * invdirx;\n\n\t}\n\n\tif ( invdiry >= 0 ) {\n\n\t\ttymin = ( miny - oy ) * invdiry;\n\t\ttymax = ( maxy - oy ) * invdiry;\n\n\t} else {\n\n\t\ttymin = ( maxy - oy ) * invdiry;\n\t\ttymax = ( miny - oy ) * invdiry;\n\n\t}\n\n\tif ( ( tmin > tymax ) \|\| ( tymin > tmax ) ) return false;\n\n\tif ( tymin > tmin \|\| isNaN( tmin ) ) tmin = tymin;\n\n\tif ( tymax < tmax \|\| isNaN( tmax ) ) tmax = tymax;\n\n\tif ( invdirz >= 0 ) {\n\n\t\ttzmin = ( minz - oz ) * invdirz;\n\t\ttzmax = ( maxz - oz ) * invdirz;\n\n\t} else {\n\n\t\ttzmin = ( maxz - oz ) * invdirz;\n\t\ttzmax = ( minz - oz ) * invdirz;\n\n\t}\n\n\tif ( ( tmin > tzmax ) \|\| ( tzmin > tmax ) ) return false;\n\n\tif ( tzmin > tmin \|\| tmin !== tmin ) tmin = tzmin;\n\n\tif ( tzmax < tmax \|\| tmax !== tmax ) tmax = tzmax;\n\n\t//return point closest to the ray (positive side)\n\n\treturn tmin <= far && tmax >= near;\n\n}\n","import { intersectTri } from '../../utils/ThreeRayIntersectUtilities.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\n\n/************************************************************/\n/ This file is generated from \"iterationUtils.template.js\". /\n/***********************************************************/\n\nfunction intersectTris_indirect( bvh, materialOrSide, ray, offset, count, intersections, near, far ) {\n\n\tconst { geometry, _indirectBuffer } = bvh;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\tlet vi = _indirectBuffer ? _indirectBuffer[ i ] : i;\n\t\tintersectTri( geometry, materialOrSide, ray, vi, intersections, near, far );\n\n\n\t}\n\n}\n\nfunction intersectClosestTri_indirect( bvh, materialOrSide, ray, offset, count, near, far ) {\n\n\tconst { geometry, _indirectBuffer } = bvh;\n\tlet dist = Infinity;\n\tlet res = null;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\tlet intersection;\n\t\tintersection = intersectTri( geometry, materialOrSide, ray, _indirectBuffer ? _indirectBuffer[ i ] : i, null, near, far );\n\n\n\t\tif ( intersection && intersection.distance < dist ) {\n\n\t\t\tres = intersection;\n\t\t\tdist = intersection.distance;\n\n\t\t}\n\n\t}\n\n\treturn res;\n\n}\n\nfunction iterateOverTriangles_indirect(\n\toffset,\n\tcount,\n\tbvh,\n\tintersectsTriangleFunc,\n\tcontained,\n\tdepth,\n\ttriangle\n) {\n\n\tconst { geometry } = bvh;\n\tconst { index } = geometry;\n\tconst pos = geometry.attributes.position;\n\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\tlet tri;\n\t\ttri = bvh.resolveTriangleIndex( i );\n\n\t\tsetTriangle( triangle, tri 3, index, pos );\n\t\ttriangle.needsUpdate = true;\n\n\t\tif ( intersectsTriangleFunc( triangle, tri, contained, depth ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n\nexport { intersectClosestTri_indirect, intersectTris_indirect, iterateOverTriangles_indirect };\n","import { intersectsNodeBounds } from '../utils/intersectUtils.js';\nimport { IS_LEAF, OFFSET, COUNT, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { intersectTris } from '../utils/iterationUtils.generated.js';\nimport '../utils/iterationUtils_indirect.generated.js';\n\n/*****************************************************/\n/ This file is generated from \"raycast.template.js\". /\n/****************************************************/\n\nfunction raycast( bvh, root, materialOrSide, ray, intersects, near, far ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\t_raycast( 0, bvh, materialOrSide, ray, intersects, near, far );\n\tBufferStack.clearBuffer();\n\n}\n\nfunction _raycast( nodeIndex32, bvh, materialOrSide, ray, intersects, near, far ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tconst nodeIndex16 = nodeIndex32 2;\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\n\t\tintersectTris( bvh, materialOrSide, ray, offset, count, intersects, near, far );\n\n\n\t} else {\n\n\t\tconst leftIndex = LEFT_NODE( nodeIndex32 );\n\t\tif ( intersectsNodeBounds( leftIndex, float32Array, ray, near, far ) ) {\n\n\t\t\t_raycast( leftIndex, bvh, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t\tconst rightIndex = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\tif ( intersectsNodeBounds( rightIndex, float32Array, ray, near, far ) ) {\n\n\t\t\t_raycast( rightIndex, bvh, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t}\n\n}\n\nexport { raycast };\n","import { IS_LEAF, OFFSET, COUNT, SPLIT_AXIS, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { intersectsNodeBounds } from '../utils/intersectUtils.js';\nimport { intersectClosestTri } from '../utils/iterationUtils.generated.js';\nimport '../utils/iterationUtils_indirect.generated.js';\n\n/**********************************************************/\n/ This file is generated from \"raycastFirst.template.js\". /\n/*********************************************************/\n\nconst _xyzFields = [ 'x', 'y', 'z' ];\n\nfunction raycastFirst( bvh, root, materialOrSide, ray, near, far ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _raycastFirst( 0, bvh, materialOrSide, ray, near, far );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _raycastFirst( nodeIndex32, bvh, materialOrSide, ray, near, far ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\n\t\t// eslint-disable-next-line no-unreachable\n\t\treturn intersectClosestTri( bvh, materialOrSide, ray, offset, count, near, far );\n\n\n\t} else {\n\n\t\t// consider the position of the split plane with respect to the oncoming ray; whichever direction\n\t\t// the ray is coming from, look for an intersection among that side of the tree first\n\t\tconst splitAxis = SPLIT_AXIS( nodeIndex32, uint32Array );\n\t\tconst xyzAxis = _xyzFields[ splitAxis ];\n\t\tconst rayDir = ray.direction[ xyzAxis ];\n\t\tconst leftToRight = rayDir >= 0;\n\n\t\t// c1 is the child to check first\n\t\tlet c1, c2;\n\t\tif ( leftToRight ) {\n\n\t\t\tc1 = LEFT_NODE( nodeIndex32 );\n\t\t\tc2 = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t} else {\n\n\t\t\tc1 = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\t\tc2 = LEFT_NODE( nodeIndex32 );\n\n\t\t}\n\n\t\tconst c1Intersection = intersectsNodeBounds( c1, float32Array, ray, near, far );\n\t\tconst c1Result = c1Intersection ? _raycastFirst( c1, bvh, materialOrSide, ray, near, far ) : null;\n\n\t\t// if we got an intersection in the first node and it's closer than the second node's bounding\n\t\t// box, we don't need to consider the second node because it couldn't possibly be a better result\n\t\tif ( c1Result ) {\n\n\t\t\t// check if the point is within the second bounds\n\t\t\t// \"point\" is in the local frame of the bvh\n\t\t\tconst point = c1Result.point[ xyzAxis ];\n\t\t\tconst isOutside = leftToRight ?\n\t\t\t\tpoint <= float32Array[ c2 + splitAxis ] : // min bounding data\n\t\t\t\tpoint >= float32Array[ c2 + splitAxis + 3 ]; // max bounding data\n\n\t\t\tif ( isOutside ) {\n\n\t\t\t\treturn c1Result;\n\n\t\t\t}\n\n\t\t}\n\n\t\t// either there was no intersection in the first node, or there could still be a closer\n\t\t// intersection in the second, so check the second node and then take the better of the two\n\t\tconst c2Intersection = intersectsNodeBounds( c2, float32Array, ray, near, far );\n\t\tconst c2Result = c2Intersection ? _raycastFirst( c2, bvh, materialOrSide, ray, near, far ) : null;\n\n\t\tif ( c1Result && c2Result ) {\n\n\t\t\treturn c1Result.distance <= c2Result.distance ? c1Result : c2Result;\n\n\t\t} else {\n\n\t\t\treturn c1Result \|\| c2Result \|\| null;\n\n\t\t}\n\n\t}\n\n}\n\nexport { raycastFirst };\n","import { Box3, Matrix4 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { ExtendedTriangle } from '../../math/ExtendedTriangle.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { IS_LEAF, OFFSET, COUNT, BOUNDING_DATA_INDEX, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { getTriCount } from '../build/geometryUtils.js';\n\n/****************************************************************/\n/ This file is generated from \"intersectsGeometry.template.js\". /\n/***************************************************************/\n/ eslint-disable indent /\n\nconst boundingBox = / @__PURE__ / new Box3();\nconst triangle = / @__PURE__ / new ExtendedTriangle();\nconst triangle2 = / @__PURE__ / new ExtendedTriangle();\nconst invertedMat = / @__PURE__ / new Matrix4();\n\nconst obb = / @__PURE__ / new OrientedBox();\nconst obb2 = / @__PURE__ / new OrientedBox();\n\nfunction intersectsGeometry( bvh, root, otherGeometry, geometryToBvh ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _intersectsGeometry( 0, bvh, otherGeometry, geometryToBvh );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _intersectsGeometry( nodeIndex32, bvh, otherGeometry, geometryToBvh, cachedObb = null ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tif ( cachedObb === null ) {\n\n\t\tif ( ! otherGeometry.boundingBox ) {\n\n\t\t\totherGeometry.computeBoundingBox();\n\n\t\t}\n\n\t\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\t\tcachedObb = obb;\n\n\t}\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst thisGeometry = bvh.geometry;\n\t\tconst thisIndex = thisGeometry.index;\n\t\tconst thisPos = thisGeometry.attributes.position;\n\n\t\tconst otherIndex = otherGeometry.index;\n\t\tconst otherPos = otherGeometry.attributes.position;\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t// get the inverse of the geometry matrix so we can transform our triangles into the\n\t\t// geometry space we're trying to test. We assume there are fewer triangles being checked\n\t\t// here.\n\t\tinvertedMat.copy( geometryToBvh ).invert();\n\n\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t// if there's a bounds tree\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( nodeIndex32 ), float32Array, obb2 );\n\t\t\tobb2.matrix.copy( invertedMat );\n\t\t\tobb2.needsUpdate = true;\n\n\t\t\t// TODO: use a triangle iteration function here\n\t\t\tconst res = otherGeometry.boundsTree.shapecast( {\n\n\t\t\t\tintersectsBounds: box => obb2.intersectsBox( box ),\n\n\t\t\t\tintersectsTriangle: tri => {\n\n\t\t\t\t\ttri.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.needsUpdate = true;\n\n\n\t\t\t\t\tfor ( let i = offset * 3, l = ( count + offset ) * 3; i < l; i += 3 ) {\n\n\t\t\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\t\t\tsetTriangle( triangle2, i, thisIndex, thisPos );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\t\t\t\t\t\tif ( tri.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t\treturn res;\n\n\t\t} else {\n\n\t\t\t// if we're just dealing with raw geometry\n\t\t\tconst otherTriangleCount = getTriCount( otherGeometry );\n\n\n\t\t\tfor ( let i = offset * 3, l = ( count + offset ) * 3; i < l; i += 3 ) {\n\n\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\tsetTriangle( triangle, i, thisIndex, thisPos );\n\n\n\t\t\t\ttriangle.a.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.b.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.c.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\tfor ( let i2 = 0, l2 = otherTriangleCount * 3; i2 < l2; i2 += 3 ) {\n\n\t\t\t\t\tsetTriangle( triangle2, i2, otherIndex, otherPos );\n\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\tif ( triangle.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\n\t\t\t}\n\n\n\t\t}\n\n\t} else {\n\n\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( left ), float32Array, boundingBox );\n\t\tconst leftIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( left, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( leftIntersection ) return true;\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( right ), float32Array, boundingBox );\n\t\tconst rightIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( right, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( rightIntersection ) return true;\n\n\t\treturn false;\n\n\t}\n\n}\n\nexport { intersectsGeometry };\n","import { Matrix4, Vector3 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { getTriCount } from '../build/geometryUtils.js';\nimport { ExtendedTrianglePool } from '../../utils/ExtendedTrianglePool.js';\n\n/********************************************************************/\n/ This file is generated from \"closestPointToGeometry.template.js\". /\n/*******************************************************************/\n\nconst tempMatrix = / @__PURE__ / new Matrix4();\nconst obb = / @__PURE__ / new OrientedBox();\nconst obb2 = / @__PURE__ / new OrientedBox();\nconst temp1 = / @__PURE__ / new Vector3();\nconst temp2 = / @__PURE__ / new Vector3();\nconst temp3 = / @__PURE__ / new Vector3();\nconst temp4 = / @__PURE__ / new Vector3();\n\nfunction closestPointToGeometry(\n\tbvh,\n\totherGeometry,\n\tgeometryToBvh,\n\ttarget1 = { },\n\ttarget2 = { },\n\tminThreshold = 0,\n\tmaxThreshold = Infinity,\n) {\n\n\tif ( ! otherGeometry.boundingBox ) {\n\n\t\totherGeometry.computeBoundingBox();\n\n\t}\n\n\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\tobb.needsUpdate = true;\n\n\tconst geometry = bvh.geometry;\n\tconst pos = geometry.attributes.position;\n\tconst index = geometry.index;\n\tconst otherPos = otherGeometry.attributes.position;\n\tconst otherIndex = otherGeometry.index;\n\tconst triangle = ExtendedTrianglePool.getPrimitive();\n\tconst triangle2 = ExtendedTrianglePool.getPrimitive();\n\n\tlet tempTarget1 = temp1;\n\tlet tempTargetDest1 = temp2;\n\tlet tempTarget2 = null;\n\tlet tempTargetDest2 = null;\n\n\tif ( target2 ) {\n\n\t\ttempTarget2 = temp3;\n\t\ttempTargetDest2 = temp4;\n\n\t}\n\n\tlet closestDistance = Infinity;\n\tlet closestDistanceTriIndex = null;\n\tlet closestDistanceOtherTriIndex = null;\n\ttempMatrix.copy( geometryToBvh ).invert();\n\tobb2.matrix.copy( tempMatrix );\n\tbvh.shapecast(\n\t\t{\n\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn obb.distanceToBox( box );\n\n\t\t\t},\n\n\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\tif ( score < closestDistance && score < maxThreshold ) {\n\n\t\t\t\t\t// if we know the triangles of this bounds will be intersected next then\n\t\t\t\t\t// save the bounds to use during triangle checks.\n\t\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\t\tobb2.min.copy( box.min );\n\t\t\t\t\t\tobb2.max.copy( box.max );\n\t\t\t\t\t\tobb2.needsUpdate = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\t},\n\n\t\t\tintersectsRange: ( offset, count ) => {\n\n\t\t\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t\t\t// if the other geometry has a bvh then use the accelerated path where we use shapecast to find\n\t\t\t\t\t// the closest bounds in the other geometry to check.\n\t\t\t\t\tconst otherBvh = otherGeometry.boundsTree;\n\t\t\t\t\treturn otherBvh.shapecast( {\n\t\t\t\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\t\t\t\treturn obb2.distanceToBox( box );\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\t\t\t\treturn score < closestDistance && score < maxThreshold;\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsRange: ( otherOffset, otherCount ) => {\n\n\t\t\t\t\t\t\tfor ( let i2 = otherOffset, l2 = otherOffset + otherCount; i2 < l2; i2 ++ ) {\n\n\n\t\t\t\t\t\t\t\tsetTriangle( triangle2, 3 i2, otherIndex, otherPos );\n\n\t\t\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\n\t\t\t\t\t\t\t\t\tsetTriangle( triangle, 3 * i, index, pos );\n\n\t\t\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t},\n\t\t\t\t\t} );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// If no bounds tree then we'll just check every triangle.\n\t\t\t\t\tconst triCount = getTriCount( otherGeometry );\n\t\t\t\t\tfor ( let i2 = 0, l2 = triCount; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\t\tsetTriangle( triangle2, 3 * i2, otherIndex, otherPos );\n\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\n\t\t\t\t\t\t\tsetTriangle( triangle, 3 * i, index, pos );\n\n\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t},\n\n\t\t}\n\n\t);\n\n\tExtendedTrianglePool.releasePrimitive( triangle );\n\tExtendedTrianglePool.releasePrimitive( triangle2 );\n\n\tif ( closestDistance === Infinity ) {\n\n\t\treturn null;\n\n\t}\n\n\tif ( ! target1.point ) {\n\n\t\ttarget1.point = tempTargetDest1.clone();\n\n\t} else {\n\n\t\ttarget1.point.copy( tempTargetDest1 );\n\n\t}\n\n\ttarget1.distance = closestDistance,\n\ttarget1.faceIndex = closestDistanceTriIndex;\n\n\tif ( target2 ) {\n\n\t\tif ( ! target2.point ) target2.point = tempTargetDest2.clone();\n\t\telse target2.point.copy( tempTargetDest2 );\n\t\ttarget2.point.applyMatrix4( tempMatrix );\n\t\ttempTargetDest1.applyMatrix4( tempMatrix );\n\t\ttarget2.distance = tempTargetDest1.sub( target2.point ).length();\n\t\ttarget2.faceIndex = closestDistanceOtherTriIndex;\n\n\t}\n\n\treturn target1;\n\n}\n\nexport { closestPointToGeometry };\n","import { UINT32_PER_NODE, BYTES_PER_NODE } from '../Constants.js';\nimport { IS_LEAF, OFFSET, COUNT, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\n\n/***************************************************/\n/ This file is generated from \"refit.template.js\". /\n/**************************************************/\n\nfunction refit_indirect( bvh, nodeIndices = null ) {\n\n\tif ( nodeIndices && Array.isArray( nodeIndices ) ) {\n\n\t\tnodeIndices = new Set( nodeIndices );\n\n\t}\n\n\tconst geometry = bvh.geometry;\n\tconst indexArr = geometry.index ? geometry.index.array : null;\n\tconst posAttr = geometry.attributes.position;\n\n\tlet buffer, uint32Array, uint16Array, float32Array;\n\tlet byteOffset = 0;\n\tconst roots = bvh._roots;\n\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\tbuffer = roots[ i ];\n\t\tuint32Array = new Uint32Array( buffer );\n\t\tuint16Array = new Uint16Array( buffer );\n\t\tfloat32Array = new Float32Array( buffer );\n\n\t\t_traverse( 0, byteOffset );\n\t\tbyteOffset += buffer.byteLength;\n\n\t}\n\n\tfunction _traverse( nodeIndex32, byteOffset, force = false ) {\n\n\t\tconst nodeIndex16 = nodeIndex32 2;\n\t\tif ( IS_LEAF( nodeIndex16, uint16Array ) ) {\n\n\t\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t\tlet minx = Infinity;\n\t\t\tlet miny = Infinity;\n\t\t\tlet minz = Infinity;\n\t\t\tlet maxx = - Infinity;\n\t\t\tlet maxy = - Infinity;\n\t\t\tlet maxz = - Infinity;\n\n\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\t\tconst t = 3 * bvh.resolveTriangleIndex( i );\n\t\t\t\tfor ( let j = 0; j < 3; j ++ ) {\n\n\t\t\t\t\tlet index = t + j;\n\t\t\t\t\tindex = indexArr ? indexArr[ index ] : index;\n\n\t\t\t\t\tconst x = posAttr.getX( index );\n\t\t\t\t\tconst y = posAttr.getY( index );\n\t\t\t\t\tconst z = posAttr.getZ( index );\n\n\t\t\t\t\tif ( x < minx ) minx = x;\n\t\t\t\t\tif ( x > maxx ) maxx = x;\n\n\t\t\t\t\tif ( y < miny ) miny = y;\n\t\t\t\t\tif ( y > maxy ) maxy = y;\n\n\t\t\t\t\tif ( z < minz ) minz = z;\n\t\t\t\t\tif ( z > maxz ) maxz = z;\n\n\n\t\t\t\t}\n\n\t\t\t}\n\n\n\t\t\tif (\n\t\t\t\tfloat32Array[ nodeIndex32 + 0 ] !== minx \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 1 ] !== miny \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 2 ] !== minz \|\|\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 3 ] !== maxx \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 4 ] !== maxy \|\|\n\t\t\t\tfloat32Array[ nodeIndex32 + 5 ] !== maxz\n\t\t\t) {\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 0 ] = minx;\n\t\t\t\tfloat32Array[ nodeIndex32 + 1 ] = miny;\n\t\t\t\tfloat32Array[ nodeIndex32 + 2 ] = minz;\n\n\t\t\t\tfloat32Array[ nodeIndex32 + 3 ] = maxx;\n\t\t\t\tfloat32Array[ nodeIndex32 + 4 ] = maxy;\n\t\t\t\tfloat32Array[ nodeIndex32 + 5 ] = maxz;\n\n\t\t\t\treturn true;\n\n\t\t\t} else {\n\n\t\t\t\treturn false;\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t\t// the identifying node indices provided by the shapecast function include offsets of all\n\t\t\t// root buffers to guarantee they're unique between roots so offset left and right indices here.\n\t\t\tlet forceChildren = force;\n\t\t\tlet includesLeft = false;\n\t\t\tlet includesRight = false;\n\n\t\t\tif ( nodeIndices ) {\n\n\t\t\t\t// if we see that neither the left or right child are included in the set that need to be updated\n\t\t\t\t// then we assume that all children need to be updated.\n\t\t\t\tif ( ! forceChildren ) {\n\n\t\t\t\t\tconst leftNodeId = left / UINT32_PER_NODE + byteOffset / BYTES_PER_NODE;\n\t\t\t\t\tconst rightNodeId = right / UINT32_PER_NODE + byteOffset / BYTES_PER_NODE;\n\t\t\t\t\tincludesLeft = nodeIndices.has( leftNodeId );\n\t\t\t\t\tincludesRight = nodeIndices.has( rightNodeId );\n\t\t\t\t\tforceChildren = ! includesLeft && ! includesRight;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\tincludesLeft = true;\n\t\t\t\tincludesRight = true;\n\n\t\t\t}\n\n\t\t\tconst traverseLeft = forceChildren \|\| includesLeft;\n\t\t\tconst traverseRight = forceChildren \|\| includesRight;\n\n\t\t\tlet leftChange = false;\n\t\t\tif ( traverseLeft ) {\n\n\t\t\t\tleftChange = _traverse( left, byteOffset, forceChildren );\n\n\t\t\t}\n\n\t\t\tlet rightChange = false;\n\t\t\tif ( traverseRight ) {\n\n\t\t\t\trightChange = _traverse( right, byteOffset, forceChildren );\n\n\t\t\t}\n\n\t\t\tconst didChange = leftChange \|\| rightChange;\n\t\t\tif ( didChange ) {\n\n\t\t\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\t\t\tconst left_i = left + i;\n\t\t\t\t\tconst right_i = right + i;\n\t\t\t\t\tconst minLeftValue = float32Array[ left_i ];\n\t\t\t\t\tconst maxLeftValue = float32Array[ left_i + 3 ];\n\t\t\t\t\tconst minRightValue = float32Array[ right_i ];\n\t\t\t\t\tconst maxRightValue = float32Array[ right_i + 3 ];\n\n\t\t\t\t\tfloat32Array[ nodeIndex32 + i ] = minLeftValue < minRightValue ? minLeftValue : minRightValue;\n\t\t\t\t\tfloat32Array[ nodeIndex32 + i + 3 ] = maxLeftValue > maxRightValue ? maxLeftValue : maxRightValue;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn didChange;\n\n\t\t}\n\n\t}\n\n}\n\nexport { refit_indirect };\n","import { intersectsNodeBounds } from '../utils/intersectUtils.js';\nimport { IS_LEAF, OFFSET, COUNT, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport '../utils/iterationUtils.generated.js';\nimport { intersectTris_indirect } from '../utils/iterationUtils_indirect.generated.js';\n\n/*****************************************************/\n/ This file is generated from \"raycast.template.js\". /\n/****************************************************/\n\nfunction raycast_indirect( bvh, root, materialOrSide, ray, intersects, near, far ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\t_raycast( 0, bvh, materialOrSide, ray, intersects, near, far );\n\tBufferStack.clearBuffer();\n\n}\n\nfunction _raycast( nodeIndex32, bvh, materialOrSide, ray, intersects, near, far ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tconst nodeIndex16 = nodeIndex32 2;\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\tintersectTris_indirect( bvh, materialOrSide, ray, offset, count, intersects, near, far );\n\n\n\t} else {\n\n\t\tconst leftIndex = LEFT_NODE( nodeIndex32 );\n\t\tif ( intersectsNodeBounds( leftIndex, float32Array, ray, near, far ) ) {\n\n\t\t\t_raycast( leftIndex, bvh, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t\tconst rightIndex = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\tif ( intersectsNodeBounds( rightIndex, float32Array, ray, near, far ) ) {\n\n\t\t\t_raycast( rightIndex, bvh, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t}\n\n}\n\nexport { raycast_indirect };\n","import { IS_LEAF, OFFSET, COUNT, SPLIT_AXIS, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { intersectsNodeBounds } from '../utils/intersectUtils.js';\nimport '../utils/iterationUtils.generated.js';\nimport { intersectClosestTri_indirect } from '../utils/iterationUtils_indirect.generated.js';\n\n/**********************************************************/\n/ This file is generated from \"raycastFirst.template.js\". /\n/*********************************************************/\n\nconst _xyzFields = [ 'x', 'y', 'z' ];\n\nfunction raycastFirst_indirect( bvh, root, materialOrSide, ray, near, far ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _raycastFirst( 0, bvh, materialOrSide, ray, near, far );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _raycastFirst( nodeIndex32, bvh, materialOrSide, ray, near, far ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\treturn intersectClosestTri_indirect( bvh, materialOrSide, ray, offset, count, near, far );\n\n\n\t} else {\n\n\t\t// consider the position of the split plane with respect to the oncoming ray; whichever direction\n\t\t// the ray is coming from, look for an intersection among that side of the tree first\n\t\tconst splitAxis = SPLIT_AXIS( nodeIndex32, uint32Array );\n\t\tconst xyzAxis = _xyzFields[ splitAxis ];\n\t\tconst rayDir = ray.direction[ xyzAxis ];\n\t\tconst leftToRight = rayDir >= 0;\n\n\t\t// c1 is the child to check first\n\t\tlet c1, c2;\n\t\tif ( leftToRight ) {\n\n\t\t\tc1 = LEFT_NODE( nodeIndex32 );\n\t\t\tc2 = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\t} else {\n\n\t\t\tc1 = RIGHT_NODE( nodeIndex32, uint32Array );\n\t\t\tc2 = LEFT_NODE( nodeIndex32 );\n\n\t\t}\n\n\t\tconst c1Intersection = intersectsNodeBounds( c1, float32Array, ray, near, far );\n\t\tconst c1Result = c1Intersection ? _raycastFirst( c1, bvh, materialOrSide, ray, near, far ) : null;\n\n\t\t// if we got an intersection in the first node and it's closer than the second node's bounding\n\t\t// box, we don't need to consider the second node because it couldn't possibly be a better result\n\t\tif ( c1Result ) {\n\n\t\t\t// check if the point is within the second bounds\n\t\t\t// \"point\" is in the local frame of the bvh\n\t\t\tconst point = c1Result.point[ xyzAxis ];\n\t\t\tconst isOutside = leftToRight ?\n\t\t\t\tpoint <= float32Array[ c2 + splitAxis ] : // min bounding data\n\t\t\t\tpoint >= float32Array[ c2 + splitAxis + 3 ]; // max bounding data\n\n\t\t\tif ( isOutside ) {\n\n\t\t\t\treturn c1Result;\n\n\t\t\t}\n\n\t\t}\n\n\t\t// either there was no intersection in the first node, or there could still be a closer\n\t\t// intersection in the second, so check the second node and then take the better of the two\n\t\tconst c2Intersection = intersectsNodeBounds( c2, float32Array, ray, near, far );\n\t\tconst c2Result = c2Intersection ? _raycastFirst( c2, bvh, materialOrSide, ray, near, far ) : null;\n\n\t\tif ( c1Result && c2Result ) {\n\n\t\t\treturn c1Result.distance <= c2Result.distance ? c1Result : c2Result;\n\n\t\t} else {\n\n\t\t\treturn c1Result \|\| c2Result \|\| null;\n\n\t\t}\n\n\t}\n\n}\n\nexport { raycastFirst_indirect };\n","import { Box3, Matrix4 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { ExtendedTriangle } from '../../math/ExtendedTriangle.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { IS_LEAF, OFFSET, COUNT, BOUNDING_DATA_INDEX, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { getTriCount } from '../build/geometryUtils.js';\n\n/****************************************************************/\n/ This file is generated from \"intersectsGeometry.template.js\". /\n/***************************************************************/\n/ eslint-disable indent /\n\nconst boundingBox = / @__PURE__ / new Box3();\nconst triangle = / @__PURE__ / new ExtendedTriangle();\nconst triangle2 = / @__PURE__ / new ExtendedTriangle();\nconst invertedMat = / @__PURE__ / new Matrix4();\n\nconst obb = / @__PURE__ / new OrientedBox();\nconst obb2 = / @__PURE__ / new OrientedBox();\n\nfunction intersectsGeometry_indirect( bvh, root, otherGeometry, geometryToBvh ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _intersectsGeometry( 0, bvh, otherGeometry, geometryToBvh );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _intersectsGeometry( nodeIndex32, bvh, otherGeometry, geometryToBvh, cachedObb = null ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 2;\n\n\tif ( cachedObb === null ) {\n\n\t\tif ( ! otherGeometry.boundingBox ) {\n\n\t\t\totherGeometry.computeBoundingBox();\n\n\t\t}\n\n\t\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\t\tcachedObb = obb;\n\n\t}\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst thisGeometry = bvh.geometry;\n\t\tconst thisIndex = thisGeometry.index;\n\t\tconst thisPos = thisGeometry.attributes.position;\n\n\t\tconst otherIndex = otherGeometry.index;\n\t\tconst otherPos = otherGeometry.attributes.position;\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t// get the inverse of the geometry matrix so we can transform our triangles into the\n\t\t// geometry space we're trying to test. We assume there are fewer triangles being checked\n\t\t// here.\n\t\tinvertedMat.copy( geometryToBvh ).invert();\n\n\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t// if there's a bounds tree\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( nodeIndex32 ), float32Array, obb2 );\n\t\t\tobb2.matrix.copy( invertedMat );\n\t\t\tobb2.needsUpdate = true;\n\n\t\t\t// TODO: use a triangle iteration function here\n\t\t\tconst res = otherGeometry.boundsTree.shapecast( {\n\n\t\t\t\tintersectsBounds: box => obb2.intersectsBox( box ),\n\n\t\t\t\tintersectsTriangle: tri => {\n\n\t\t\t\t\ttri.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.needsUpdate = true;\n\n\t\t\t\t\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\t\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\t\t\tsetTriangle( triangle2, 3 * bvh.resolveTriangleIndex( i ), thisIndex, thisPos );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\t\t\t\t\t\tif ( tri.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t\treturn res;\n\n\t\t} else {\n\n\t\t\t// if we're just dealing with raw geometry\n\t\t\tconst otherTriangleCount = getTriCount( otherGeometry );\n\n\t\t\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\tconst ti = bvh.resolveTriangleIndex( i );\n\t\t\t\tsetTriangle( triangle, 3 * ti, thisIndex, thisPos );\n\n\n\t\t\t\ttriangle.a.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.b.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.c.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\tfor ( let i2 = 0, l2 = otherTriangleCount * 3; i2 < l2; i2 += 3 ) {\n\n\t\t\t\t\tsetTriangle( triangle2, i2, otherIndex, otherPos );\n\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\tif ( triangle.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\n\t\t}\n\n\t} else {\n\n\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( left ), float32Array, boundingBox );\n\t\tconst leftIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( left, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( leftIntersection ) return true;\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( right ), float32Array, boundingBox );\n\t\tconst rightIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( right, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( rightIntersection ) return true;\n\n\t\treturn false;\n\n\t}\n\n}\n\nexport { intersectsGeometry_indirect };\n","import { Matrix4, Vector3 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { getTriCount } from '../build/geometryUtils.js';\nimport { ExtendedTrianglePool } from '../../utils/ExtendedTrianglePool.js';\n\n/********************************************************************/\n/ This file is generated from \"closestPointToGeometry.template.js\". /\n/*******************************************************************/\n\nconst tempMatrix = / @__PURE__ / new Matrix4();\nconst obb = / @__PURE__ / new OrientedBox();\nconst obb2 = / @__PURE__ / new OrientedBox();\nconst temp1 = / @__PURE__ / new Vector3();\nconst temp2 = / @__PURE__ / new Vector3();\nconst temp3 = / @__PURE__ / new Vector3();\nconst temp4 = / @__PURE__ / new Vector3();\n\nfunction closestPointToGeometry_indirect(\n\tbvh,\n\totherGeometry,\n\tgeometryToBvh,\n\ttarget1 = { },\n\ttarget2 = { },\n\tminThreshold = 0,\n\tmaxThreshold = Infinity,\n) {\n\n\tif ( ! otherGeometry.boundingBox ) {\n\n\t\totherGeometry.computeBoundingBox();\n\n\t}\n\n\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\tobb.needsUpdate = true;\n\n\tconst geometry = bvh.geometry;\n\tconst pos = geometry.attributes.position;\n\tconst index = geometry.index;\n\tconst otherPos = otherGeometry.attributes.position;\n\tconst otherIndex = otherGeometry.index;\n\tconst triangle = ExtendedTrianglePool.getPrimitive();\n\tconst triangle2 = ExtendedTrianglePool.getPrimitive();\n\n\tlet tempTarget1 = temp1;\n\tlet tempTargetDest1 = temp2;\n\tlet tempTarget2 = null;\n\tlet tempTargetDest2 = null;\n\n\tif ( target2 ) {\n\n\t\ttempTarget2 = temp3;\n\t\ttempTargetDest2 = temp4;\n\n\t}\n\n\tlet closestDistance = Infinity;\n\tlet closestDistanceTriIndex = null;\n\tlet closestDistanceOtherTriIndex = null;\n\ttempMatrix.copy( geometryToBvh ).invert();\n\tobb2.matrix.copy( tempMatrix );\n\tbvh.shapecast(\n\t\t{\n\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn obb.distanceToBox( box );\n\n\t\t\t},\n\n\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\tif ( score < closestDistance && score < maxThreshold ) {\n\n\t\t\t\t\t// if we know the triangles of this bounds will be intersected next then\n\t\t\t\t\t// save the bounds to use during triangle checks.\n\t\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\t\tobb2.min.copy( box.min );\n\t\t\t\t\t\tobb2.max.copy( box.max );\n\t\t\t\t\t\tobb2.needsUpdate = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\t},\n\n\t\t\tintersectsRange: ( offset, count ) => {\n\n\t\t\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t\t\t// if the other geometry has a bvh then use the accelerated path where we use shapecast to find\n\t\t\t\t\t// the closest bounds in the other geometry to check.\n\t\t\t\t\tconst otherBvh = otherGeometry.boundsTree;\n\t\t\t\t\treturn otherBvh.shapecast( {\n\t\t\t\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\t\t\t\treturn obb2.distanceToBox( box );\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\t\t\t\treturn score < closestDistance && score < maxThreshold;\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsRange: ( otherOffset, otherCount ) => {\n\n\t\t\t\t\t\t\tfor ( let i2 = otherOffset, l2 = otherOffset + otherCount; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\t\t\t\tconst ti2 = otherBvh.resolveTriangleIndex( i2 );\n\t\t\t\t\t\t\t\tsetTriangle( triangle2, 3 ti2, otherIndex, otherPos );\n\n\t\t\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\t\t\t\t\t\t\tconst ti = bvh.resolveTriangleIndex( i );\n\t\t\t\t\t\t\t\t\tsetTriangle( triangle, 3 * ti, index, pos );\n\n\t\t\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t},\n\t\t\t\t\t} );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// If no bounds tree then we'll just check every triangle.\n\t\t\t\t\tconst triCount = getTriCount( otherGeometry );\n\t\t\t\t\tfor ( let i2 = 0, l2 = triCount; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\t\tsetTriangle( triangle2, 3 * i2, otherIndex, otherPos );\n\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\t\t\t\t\tconst ti = bvh.resolveTriangleIndex( i );\n\t\t\t\t\t\t\tsetTriangle( triangle, 3 * ti, index, pos );\n\n\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t},\n\n\t\t}\n\n\t);\n\n\tExtendedTrianglePool.releasePrimitive( triangle );\n\tExtendedTrianglePool.releasePrimitive( triangle2 );\n\n\tif ( closestDistance === Infinity ) {\n\n\t\treturn null;\n\n\t}\n\n\tif ( ! target1.point ) {\n\n\t\ttarget1.point = tempTargetDest1.clone();\n\n\t} else {\n\n\t\ttarget1.point.copy( tempTargetDest1 );\n\n\t}\n\n\ttarget1.distance = closestDistance,\n\ttarget1.faceIndex = closestDistanceTriIndex;\n\n\tif ( target2 ) {\n\n\t\tif ( ! target2.point ) target2.point = tempTargetDest2.clone();\n\t\telse target2.point.copy( tempTargetDest2 );\n\t\ttarget2.point.applyMatrix4( tempMatrix );\n\t\ttempTargetDest1.applyMatrix4( tempMatrix );\n\t\ttarget2.distance = tempTargetDest1.sub( target2.point ).length();\n\t\ttarget2.faceIndex = closestDistanceOtherTriIndex;\n\n\t}\n\n\treturn target1;\n\n}\n\nexport { closestPointToGeometry_indirect };\n","// converts the given BVH raycast intersection to align with the three.js raycast\n// structure (include object, world space distance and point).\nexport function convertRaycastIntersect( hit, object, raycaster ) {\n\n\tif ( hit === null ) {\n\n\t\treturn null;\n\n\t}\n\n\thit.point.applyMatrix4( object.matrixWorld );\n\thit.distance = hit.point.distanceTo( raycaster.ray.origin );\n\thit.object = object;\n\n\treturn hit;\n\n}\n","/** @import { BufferGeometry, Sphere, Box3, Intersection, Material, Object3D, Raycaster } from 'three' /\n/* @import { ExtendedTriangle } from '../math/ExtendedTriangle.js' /\n/* @import { IntersectsBoundsCallback, IntersectsRangeCallback, BoundsTraverseOrderCallback, IntersectsRangesCallback } from './BVH.js' /\nimport { BufferAttribute, FrontSide, Ray, Vector3, Matrix4 } from 'three';\nimport { SKIP_GENERATION, BYTES_PER_NODE, UINT32_PER_NODE, FLOAT32_EPSILON } from './Constants.js';\nimport { OrientedBox } from '../math/OrientedBox.js';\nimport { ExtendedTrianglePool } from '../utils/ExtendedTrianglePool.js';\nimport { closestPointToPoint } from './cast/closestPointToPoint.js';\nimport { IS_LEAF } from './utils/nodeBufferUtils.js';\n\nimport { iterateOverTriangles } from './utils/iterationUtils.generated.js';\nimport { refit } from './cast/refit.generated.js';\nimport { raycast } from './cast/raycast.generated.js';\nimport { raycastFirst } from './cast/raycastFirst.generated.js';\nimport { intersectsGeometry } from './cast/intersectsGeometry.generated.js';\nimport { closestPointToGeometry } from './cast/closestPointToGeometry.generated.js';\n\nimport { iterateOverTriangles_indirect } from './utils/iterationUtils_indirect.generated.js';\nimport { refit_indirect } from './cast/refit_indirect.generated.js';\nimport { raycast_indirect } from './cast/raycast_indirect.generated.js';\nimport { raycastFirst_indirect } from './cast/raycastFirst_indirect.generated.js';\nimport { intersectsGeometry_indirect } from './cast/intersectsGeometry_indirect.generated.js';\nimport { closestPointToGeometry_indirect } from './cast/closestPointToGeometry_indirect.generated.js';\nimport { setTriangle } from '../utils/TriangleUtilities.js';\nimport { convertRaycastIntersect } from '../utils/GeometryRayIntersectUtilities.js';\nimport { GeometryBVH } from './GeometryBVH.js';\n\nconst _obb = / @__PURE__ / new OrientedBox();\nconst _ray = / @__PURE__ / new Ray();\nconst _direction = / @__PURE__ / new Vector3();\nconst _inverseMatrix = / @__PURE__ / new Matrix4();\nconst _worldScale = / @__PURE__ / new Vector3();\nconst _getters = [ 'getX', 'getY', 'getZ' ];\n\n/\n @callback IntersectsTriangleCallback\n * @param {ExtendedTriangle} triangle - The triangle primitive in local space.\n * @param {number} triangleIndex - The index of the triangle in the geometry.\n * @param {boolean} contained - Whether the node bounds are fully contained by the query shape.\n * @param {number} depth - The depth of the node in the tree.\n * @returns {boolean} Return `true` to stop traversal.\n /\n\n/\n @callback IntersectsTrianglesCallback\n * @param {ExtendedTriangle} triangle1 - Triangle from this BVH in local space.\n * @param {ExtendedTriangle} triangle2 - Triangle from `otherBvh`, transformed into local space.\n * @param {number} triangleIndex1 - Triangle index in the first geometry.\n * @param {number} triangleIndex2 - Triangle index in the second geometry.\n * @param {number} depth1 - Depth of the node in the first BVH.\n * @param {number} nodeIndex1 - Node index in the first BVH.\n * @param {number} depth2 - Depth of the node in the second BVH.\n * @param {number} nodeIndex2 - Node index in the second BVH.\n * @returns {boolean} Return `true` to stop traversal.\n /\n\n/\n Plain-object representation of a `MeshBVH` produced by `MeshBVH.serialize` and\n * consumed by `MeshBVH.deserialize`. Suitable for transfer across WebWorker boundaries\n * or storage, with optional buffer sharing via `SharedArrayBuffer`.\n \n @typedef {Object} SerializedBVH\n * @property {Array<ArrayBuffer>} roots - BVH root node buffers.\n * @property {Int32Array\|Uint32Array\|Uint16Array\|null} index - Serialized geometry index buffer.\n * @property {Uint32Array\|Uint16Array\|null} indirectBuffer - Indirect primitive index buffer, or `null`\n * if the BVH was not built in indirect mode.\n /\n\n/\n @typedef {Object} HitPointInfo\n * @property {Vector3} point - The closest point on the mesh surface.\n * @property {number} distance - Distance from the query point to the closest point.\n * @property {number} faceIndex - Index of the triangle containing the closest point. Can be\n * passed to `getTriangleHitPointInfo` to retrieve UV, normal, and material index.\n /\n\n/\n The MeshBVH generation process modifies the geometry's index bufferAttribute in place to save\n * memory. The BVH construction will use the geometry's boundingBox if it exists or set it if it\n * does not. The BVH will no longer work correctly if the index buffer is modified.\n \n Only triangles within the geometry's draw range (or provided `range` option) are included in the\n * BVH. When a geometry has multiple groups, only triangles within the defined group ranges are\n * included. Triangles in gaps between groups are excluded.\n \n Note that all query functions expect arguments in local space of the BVH and return results in\n * local space, as well. If world space results are needed they must be transformed into world space\n * using `object.matrixWorld`.\n \n @param {BufferGeometry} geometry\n * @param {Object} [options] - Same options as {@link GeometryBVH}.\n * @extends GeometryBVH\n /\nexport class MeshBVH extends GeometryBVH {\n\n\t/\n\t Generates a representation of the complete bounds tree and the geometry index buffer which\n\t * can be used to recreate a bounds tree using the `deserialize` function. The `serialize` and\n\t * `deserialize` functions can be used to generate a MeshBVH asynchronously in a background web\n\t * worker to prevent the main thread from stuttering. The BVH roots buffer stored in the\n\t * serialized representation are the same as the ones used by the original BVH so they should\n\t * not be modified. If `SharedArrayBuffers` are used then the same BVH memory can be used for\n\t * multiple BVH in multiple WebWorkers.\n\t \n\t @static\n\t * @param {MeshBVH} bvh - The BVH to serialize.\n\t * @param {Object} [options]\n\t * @param {boolean} [options.cloneBuffers=true] - If `true`, the index and BVH root buffers\n\t * are cloned so the serialized data is independent of the live BVH.\n\t * @returns {SerializedBVH}\n\t /\n\tstatic serialize( bvh, options = {} ) {\n\n\t\toptions = {\n\t\t\tcloneBuffers: true,\n\t\t\t...options,\n\t\t};\n\n\t\tconst geometry = bvh.geometry;\n\t\tconst rootData = bvh._roots;\n\t\tconst indirectBuffer = bvh._indirectBuffer;\n\t\tconst indexAttribute = geometry.getIndex();\n\t\tconst result = {\n\t\t\tversion: 1,\n\t\t\troots: null,\n\t\t\tindex: null,\n\t\t\tindirectBuffer: null,\n\t\t};\n\t\tif ( options.cloneBuffers ) {\n\n\t\t\tresult.roots = rootData.map( root => root.slice() );\n\t\t\tresult.index = indexAttribute ? indexAttribute.array.slice() : null;\n\t\t\tresult.indirectBuffer = indirectBuffer ? indirectBuffer.slice() : null;\n\n\t\t} else {\n\n\t\t\tresult.roots = rootData;\n\t\t\tresult.index = indexAttribute ? indexAttribute.array : null;\n\t\t\tresult.indirectBuffer = indirectBuffer;\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n\t/\n\t Returns a new MeshBVH instance from the serialized data. `geometry` is the geometry used\n\t * to generate the original BVH `data` was derived from. The root buffers stored in `data`\n\t * are set directly on the new BVH so the memory is shared.\n\t \n\t @static\n\t * @param {SerializedBVH} data - Serialized BVH data.\n\t * @param {BufferGeometry} geometry - The geometry the BVH was originally built from.\n\t * @param {Object} [options]\n\t * @param {boolean} [options.setIndex=true] - If `true`, sets `geometry.index` from the\n\t * serialized index buffer (creating one if none exists).\n\t * @returns {MeshBVH}\n\t /\n\tstatic deserialize( data, geometry, options = {} ) {\n\n\t\toptions = {\n\t\t\tsetIndex: true,\n\t\t\tindirect: Boolean( data.indirectBuffer ),\n\t\t\t...options,\n\t\t};\n\n\t\tconst { index, roots, indirectBuffer } = data;\n\n\t\t// handle backwards compatibility by fixing up the buffer roots\n\t\t// see issue gkjohnson/three-mesh-bvh#759\n\t\tif ( ! data.version ) {\n\n\t\t\tconsole.warn(\n\t\t\t\t'MeshBVH.deserialize: Serialization format has been changed and will be fixed up. ' +\n\t\t\t\t'It is recommended to regenerate any stored serialized data.'\n\t\t\t);\n\t\t\tfixupVersion0( roots );\n\n\t\t}\n\n\t\tconst bvh = new MeshBVH( geometry, { ...options, [ SKIP_GENERATION ]: true } );\n\t\tbvh._roots = roots;\n\t\tbvh._indirectBuffer = indirectBuffer \|\| null;\n\n\t\tif ( options.setIndex ) {\n\n\t\t\tconst indexAttribute = geometry.getIndex();\n\t\t\tif ( indexAttribute === null ) {\n\n\t\t\t\tconst newIndex = new BufferAttribute( data.index, 1, false );\n\t\t\t\tgeometry.setIndex( newIndex );\n\n\t\t\t} else if ( indexAttribute.array !== index ) {\n\n\t\t\t\tindexAttribute.array.set( index );\n\t\t\t\tindexAttribute.needsUpdate = true;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn bvh;\n\n\t\t// convert version 0 serialized data (uint32 indices) to version 1 (node indices)\n\t\tfunction fixupVersion0( roots ) {\n\n\t\t\tfor ( let rootIndex = 0; rootIndex < roots.length; rootIndex ++ ) {\n\n\t\t\t\tconst root = roots[ rootIndex ];\n\t\t\t\tconst uint32Array = new Uint32Array( root );\n\t\t\t\tconst uint16Array = new Uint16Array( root );\n\n\t\t\t\t// iterate over nodes and convert right child offsets\n\t\t\t\tfor ( let node = 0, l = root.byteLength / BYTES_PER_NODE; node < l; node ++ ) {\n\n\t\t\t\t\tconst node32Index = UINT32_PER_NODE node;\n\t\t\t\t\tconst node16Index = 2 * node32Index;\n\t\t\t\t\tif ( ! IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\t\t\t// convert absolute right child offset to relative offset\n\t\t\t\t\t\tuint32Array[ node32Index + 6 ] = uint32Array[ node32Index + 6 ] / UINT32_PER_NODE - node;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tget primitiveStride() {\n\n\t\treturn 3;\n\n\t}\n\n\t/*\n\t Helper function for use when `indirect` is set to true. This function takes a triangle\n\t * index in the BVH layout and returns the associated triangle index in the geometry index\n\t * buffer or position attribute.\n\t * @type {function(number): number}\n\t * @readonly\n\t /\n\tget resolveTriangleIndex() {\n\n\t\treturn this.resolvePrimitiveIndex;\n\n\t}\n\n\tconstructor( geometry, options = {} ) {\n\n\t\tif ( options.maxLeafTris ) {\n\n\t\t\tconsole.warn( 'MeshBVH: \"maxLeafTris\" option has been deprecated. Use \"targetLeafSize\", instead.' );\n\t\t\toptions = {\n\t\t\t\t...options,\n\t\t\t\ttargetLeafSize: options.maxLeafTris,\n\t\t\t};\n\n\t\t}\n\n\t\tsuper( geometry, options );\n\n\t}\n\n\t/\n\t Adjusts all triangle offsets stored in the BVH by the given offset. This is useful when the\n\t * triangle data has been compacted or shifted in the geometry buffers (e.g. in `BatchedMesh`\n\t * when geometries are compacted using the 'optimize' function or constructing a 'merged' BVH).\n\t * This function only adjusts the BVH to point to different triangles in the geometry. The\n\t * geometry's index buffer and/or position attributes must be updated separately to match.\n\t \n\t @param {number} offset\n\t * @returns {void}\n\t /\n\t// implement abstract methods from BVH base class\n\tshiftTriangleOffsets( offset ) {\n\n\t\treturn super.shiftPrimitiveOffsets( offset );\n\n\t}\n\n\t// write primitive bounds to the buffer - used only for validateBounds at the moment\n\twritePrimitiveBounds( i, targetBuffer, baseIndex ) {\n\n\t\tconst geometry = this.geometry;\n\t\tconst indirectBuffer = this._indirectBuffer;\n\t\tconst posAttr = geometry.attributes.position;\n\t\tconst index = geometry.index ? geometry.index.array : null;\n\n\t\tconst tri = indirectBuffer ? indirectBuffer[ i ] : i;\n\t\tconst tri3 = tri 3;\n\n\t\tlet ai = tri3 + 0;\n\t\tlet bi = tri3 + 1;\n\t\tlet ci = tri3 + 2;\n\n\t\tif ( index ) {\n\n\t\t\tai = index[ ai ];\n\t\t\tbi = index[ bi ];\n\t\t\tci = index[ ci ];\n\n\t\t}\n\n\t\tfor ( let el = 0; el < 3; el ++ ) {\n\n\t\t\tconst a = posAttr[ _getters[ el ] ]( ai );\n\t\t\tconst b = posAttr[ _getters[ el ] ]( bi );\n\t\t\tconst c = posAttr[ _getters[ el ] ]( ci );\n\n\t\t\tlet min = a;\n\t\t\tif ( b < min ) min = b;\n\t\t\tif ( c < min ) min = c;\n\n\t\t\tlet max = a;\n\t\t\tif ( b > max ) max = b;\n\t\t\tif ( c > max ) max = c;\n\n\t\t\t// Write in min/max format [minx, miny, minz, maxx, maxy, maxz]\n\t\t\ttargetBuffer[ baseIndex + el ] = min;\n\t\t\ttargetBuffer[ baseIndex + el + 3 ] = max;\n\n\t\t}\n\n\t\treturn targetBuffer;\n\n\t}\n\n\t// precomputes the bounding box for each triangle; required for quickly calculating tree splits.\n\t// result is an array of size count * 6 where triangle i maps to a\n\t// [x_center, x_delta, y_center, y_delta, z_center, z_delta] tuple starting at index (i - offset) * 6,\n\t// representing the center and half-extent in each dimension of triangle i\n\tcomputePrimitiveBounds( offset, count, targetBuffer ) {\n\n\t\tconst geometry = this.geometry;\n\t\tconst indirectBuffer = this._indirectBuffer;\n\t\tconst posAttr = geometry.attributes.position;\n\t\tconst index = geometry.index ? geometry.index.array : null;\n\t\tconst normalized = posAttr.normalized;\n\n\t\tif ( offset < 0 \|\| count + offset - targetBuffer.offset > targetBuffer.length / 6 ) {\n\n\t\t\tthrow new Error( 'MeshBVH: compute triangle bounds range is invalid.' );\n\n\t\t}\n\n\t\t// used for non-normalized positions\n\t\tconst posArr = posAttr.array;\n\n\t\t// support for an interleaved position buffer\n\t\tconst bufferOffset = posAttr.offset \|\| 0;\n\t\tlet stride = 3;\n\t\tif ( posAttr.isInterleavedBufferAttribute ) {\n\n\t\t\tstride = posAttr.data.stride;\n\n\t\t}\n\n\t\t// used for normalized positions\n\t\tconst getters = [ 'getX', 'getY', 'getZ' ];\n\t\tconst writeOffset = targetBuffer.offset;\n\n\t\t// iterate over the triangle range\n\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\tconst tri = indirectBuffer ? indirectBuffer[ i ] : i;\n\t\t\tconst tri3 = tri * 3;\n\t\t\tconst boundsIndexOffset = ( i - writeOffset ) * 6;\n\n\t\t\tlet ai = tri3 + 0;\n\t\t\tlet bi = tri3 + 1;\n\t\t\tlet ci = tri3 + 2;\n\n\t\t\tif ( index ) {\n\n\t\t\t\tai = index[ ai ];\n\t\t\t\tbi = index[ bi ];\n\t\t\t\tci = index[ ci ];\n\n\t\t\t}\n\n\t\t\t// we add the stride and offset here since we access the array directly\n\t\t\t// below for the sake of performance\n\t\t\tif ( ! normalized ) {\n\n\t\t\t\tai = ai * stride + bufferOffset;\n\t\t\t\tbi = bi * stride + bufferOffset;\n\t\t\t\tci = ci * stride + bufferOffset;\n\n\t\t\t}\n\n\t\t\tfor ( let el = 0; el < 3; el ++ ) {\n\n\t\t\t\tlet a, b, c;\n\n\t\t\t\tif ( normalized ) {\n\n\t\t\t\t\ta = posAttr[ getters[ el ] ]( ai );\n\t\t\t\t\tb = posAttr[ getters[ el ] ]( bi );\n\t\t\t\t\tc = posAttr[ getters[ el ] ]( ci );\n\n\t\t\t\t} else {\n\n\t\t\t\t\ta = posArr[ ai + el ];\n\t\t\t\t\tb = posArr[ bi + el ];\n\t\t\t\t\tc = posArr[ ci + el ];\n\n\t\t\t\t}\n\n\t\t\t\tlet min = a;\n\t\t\t\tif ( b < min ) min = b;\n\t\t\t\tif ( c < min ) min = c;\n\n\t\t\t\tlet max = a;\n\t\t\t\tif ( b > max ) max = b;\n\t\t\t\tif ( c > max ) max = c;\n\n\t\t\t\t// Increase the bounds size by float32 epsilon to avoid precision errors when\n\t\t\t\t// converting to 32 bit float. Scale the epsilon by the size of the numbers being\n\t\t\t\t// worked with.\n\t\t\t\tconst halfExtents = ( max - min ) / 2;\n\t\t\t\tconst el2 = el * 2;\n\t\t\t\ttargetBuffer[ boundsIndexOffset + el2 + 0 ] = min + halfExtents;\n\t\t\t\ttargetBuffer[ boundsIndexOffset + el2 + 1 ] = halfExtents + ( Math.abs( min ) + halfExtents ) * FLOAT32_EPSILON;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn targetBuffer;\n\n\t}\n\n\t/*\n\t A convenience function for performing a raycast based on a mesh. Results are formed like\n\t * three.js raycast results in world frame.\n\t \n\t @param {Object3D} object\n\t * @param {Raycaster} raycaster\n\t * @param {Array<Intersection>} [intersects=[]]\n\t * @returns {Array<Intersection>}\n\t /\n\traycastObject3D( object, raycaster, intersects = [] ) {\n\n\t\tconst { material } = object;\n\t\tif ( material === undefined ) {\n\n\t\t\treturn;\n\n\t\t}\n\n\t\t_inverseMatrix.copy( object.matrixWorld ).invert();\n\t\t_ray.copy( raycaster.ray ).applyMatrix4( _inverseMatrix );\n\n\t\t_worldScale.setFromMatrixScale( object.matrixWorld );\n\t\t_direction.copy( _ray.direction ).multiply( _worldScale );\n\n\t\tconst scaleFactor = _direction.length();\n\t\tconst near = raycaster.near / scaleFactor;\n\t\tconst far = raycaster.far / scaleFactor;\n\n\t\tif ( raycaster.firstHitOnly === true ) {\n\n\t\t\tlet hit = this.raycastFirst( _ray, material, near, far );\n\t\t\thit = convertRaycastIntersect( hit, object, raycaster );\n\t\t\tif ( hit ) {\n\n\t\t\t\tintersects.push( hit );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tconst hits = this.raycast( _ray, material, near, far );\n\t\t\tfor ( let i = 0, l = hits.length; i < l; i ++ ) {\n\n\t\t\t\tconst hit = convertRaycastIntersect( hits[ i ], object, raycaster );\n\t\t\t\tif ( hit ) {\n\n\t\t\t\t\tintersects.push( hit );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn intersects;\n\n\t}\n\n\t/\n\t Refit the node bounds to the current triangle positions. This is quicker than regenerating\n\t * a new BVH but will not be optimal after significant changes to the vertices. `nodeIndices`\n\t * is a set of node indices (provided by the `shapecast` function) that need to be refit\n\t * including all internal nodes.\n\t \n\t @param {Set<number>\|Array<number>\|null} [nodeIndices=null]\n\t /\n\trefit( nodeIndices = null ) {\n\n\t\tconst refitFunc = this.indirect ? refit_indirect : refit;\n\t\treturn refitFunc( this, nodeIndices );\n\n\t}\n\n\t/ Core Cast Functions /\n\n\t/\n\t Returns all raycast triangle hits in unsorted order. It is expected that `ray` is in the\n\t * frame of the BVH already. Likewise the returned results are also provided in the local\n\t * frame of the BVH. The `side` identifier is used to determine the side to check when\n\t * raycasting or a material with the given side field can be passed. If an array of materials\n\t * is provided then it is expected that the geometry has groups and the appropriate material\n\t * side is used per group.\n\t \n\t Note that unlike three.js' Raycaster results the points and distances in the intersections\n\t * returned from this function are relative to the local frame of the MeshBVH. When using the\n\t * `acceleratedRaycast` function as an override for `Mesh.raycast` they are transformed into\n\t * world space to be consistent with three's results.\n\t \n\t @param {Ray} ray\n\t * @param {number\|Material\|Array<Material>} [materialOrSide=FrontSide]\n\t * @param {number} [near=0]\n\t * @param {number} [far=Infinity]\n\t * @returns {Array<Intersection>}\n\t /\n\traycast( ray, materialOrSide = FrontSide, near = 0, far = Infinity ) {\n\n\t\tconst roots = this._roots;\n\t\tconst intersects = [];\n\t\tconst raycastFunc = this.indirect ? raycast_indirect : raycast;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\traycastFunc( this, i, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t\treturn intersects;\n\n\t}\n\n\t/\n\t Returns the first raycast hit in the model. This is typically much faster than returning\n\t * all hits. See `raycast` for information on the side and material options as well as the\n\t * frame of the returned intersections.\n\t \n\t @param {Ray} ray\n\t * @param {number\|Material\|Array<Material>} [materialOrSide=FrontSide]\n\t * @param {number} [near=0]\n\t * @param {number} [far=Infinity]\n\t * @returns {Intersection\|null}\n\t /\n\traycastFirst( ray, materialOrSide = FrontSide, near = 0, far = Infinity ) {\n\n\t\tconst roots = this._roots;\n\t\tlet closestResult = null;\n\n\t\tconst raycastFirstFunc = this.indirect ? raycastFirst_indirect : raycastFirst;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\tconst result = raycastFirstFunc( this, i, materialOrSide, ray, near, far );\n\t\t\tif ( result != null && ( closestResult == null \|\| result.distance < closestResult.distance ) ) {\n\n\t\t\t\tclosestResult = result;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn closestResult;\n\n\t}\n\n\t/\n\t Returns whether or not the mesh intersects the given geometry.\n\t \n\t The `geometryToBvh` parameter is the transform of the geometry in the BVH's local frame.\n\t \n\t Performance improves considerably if the provided geometry also has a `boundsTree`.\n\t \n\t @param {BufferGeometry} otherGeometry\n\t * @param {Matrix4} geometryToBvh - Transform of `otherGeometry` into the local space of\n\t * this BVH.\n\t * @returns {boolean}\n\t /\n\tintersectsGeometry( otherGeometry, geomToMesh ) {\n\n\t\tlet result = false;\n\t\tconst roots = this._roots;\n\t\tconst intersectsGeometryFunc = this.indirect ? intersectsGeometry_indirect : intersectsGeometry;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\tresult = intersectsGeometryFunc( this, i, otherGeometry, geomToMesh );\n\n\t\t\tif ( result ) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n\t/\n\t A generalized cast function that can be used to implement intersection logic for custom\n\t * shapes. This is used internally for `intersectsBox`, `intersectsSphere`, and more. The\n\t * function returns as soon as a triangle has been reported as intersected and returns `true`\n\t * if a triangle has been intersected.\n\t \n\t @param {Object} callbacks\n\t * @param {IntersectsBoundsCallback} callbacks.intersectsBounds\n\t * @param {IntersectsTriangleCallback} [callbacks.intersectsTriangle]\n\t * @param {IntersectsRangeCallback} [callbacks.intersectsRange]\n\t * @param {BoundsTraverseOrderCallback} [callbacks.boundsTraverseOrder]\n\t * @returns {boolean}\n\t /\n\tshapecast( callbacks ) {\n\n\t\tconst triangle = ExtendedTrianglePool.getPrimitive();\n\t\tconst result = super.shapecast(\n\t\t\t{\n\t\t\t\t...callbacks,\n\t\t\t\tintersectsPrimitive: callbacks.intersectsTriangle,\n\t\t\t\tscratchPrimitive: triangle,\n\n\t\t\t\t// TODO: is the performance significant enough for the added complexity here?\n\t\t\t\t// can we just use one function?\n\t\t\t\titerate: this.indirect ? iterateOverTriangles_indirect : iterateOverTriangles,\n\t\t\t}\n\t\t);\n\t\tExtendedTrianglePool.releasePrimitive( triangle );\n\n\t\treturn result;\n\n\t}\n\n\t/\n\t A generalized cast function that traverses two BVH structures simultaneously to perform\n\t * intersection tests between them. This is used internally by `intersectsGeometry`. The\n\t * function returns `true` as soon as a triangle pair has been reported as intersected by\n\t * the callbacks.\n\t \n\t `matrixToLocal` is a Matrix4 that transforms `otherBvh` into the local space of this BVH.\n\t * The other BVH's triangles are transformed by this matrix before intersection tests.\n\t \n\t @param {MeshBVH} otherBvh\n\t * @param {Matrix4} matrixToLocal - Transforms `otherBvh` into the local space of this BVH.\n\t * @param {Object} callbacks\n\t * @param {IntersectsRangesCallback} [callbacks.intersectsRanges]\n\t * @param {IntersectsTrianglesCallback} [callbacks.intersectsTriangles]\n\t * @returns {boolean}\n\t /\n\tbvhcast( otherBvh, matrixToLocal, callbacks ) {\n\n\t\tlet {\n\t\t\tintersectsRanges,\n\t\t\tintersectsTriangles,\n\t\t} = callbacks;\n\n\t\tconst triangle1 = ExtendedTrianglePool.getPrimitive();\n\t\tconst indexAttr1 = this.geometry.index;\n\t\tconst positionAttr1 = this.geometry.attributes.position;\n\t\tconst assignTriangle1 = this.indirect ?\n\t\t\ti1 => {\n\n\n\t\t\t\tconst ti = this.resolveTriangleIndex( i1 );\n\t\t\t\tsetTriangle( triangle1, ti 3, indexAttr1, positionAttr1 );\n\n\t\t\t} :\n\t\t\ti1 => {\n\n\t\t\t\tsetTriangle( triangle1, i1 * 3, indexAttr1, positionAttr1 );\n\n\t\t\t};\n\n\t\tconst triangle2 = ExtendedTrianglePool.getPrimitive();\n\t\tconst indexAttr2 = otherBvh.geometry.index;\n\t\tconst positionAttr2 = otherBvh.geometry.attributes.position;\n\t\tconst assignTriangle2 = otherBvh.indirect ?\n\t\t\ti2 => {\n\n\t\t\t\tconst ti2 = otherBvh.resolveTriangleIndex( i2 );\n\t\t\t\tsetTriangle( triangle2, ti2 * 3, indexAttr2, positionAttr2 );\n\n\t\t\t} :\n\t\t\ti2 => {\n\n\t\t\t\tsetTriangle( triangle2, i2 * 3, indexAttr2, positionAttr2 );\n\n\t\t\t};\n\n\t\t// generate triangle callback if needed\n\t\tif ( intersectsTriangles ) {\n\n\t\t\tif ( ! ( otherBvh instanceof MeshBVH ) ) {\n\n\t\t\t\tthrow new Error( 'MeshBVH: \"intersectsTriangles\" callback can only be used with another MeshBVH.' );\n\n\t\t\t}\n\n\t\t\tconst iterateOverDoubleTriangles = ( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 ) => {\n\n\t\t\t\tfor ( let i2 = offset2, l2 = offset2 + count2; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\tassignTriangle2( i2 );\n\n\t\t\t\t\ttriangle2.a.applyMatrix4( matrixToLocal );\n\t\t\t\t\ttriangle2.b.applyMatrix4( matrixToLocal );\n\t\t\t\t\ttriangle2.c.applyMatrix4( matrixToLocal );\n\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\tfor ( let i1 = offset1, l1 = offset1 + count1; i1 < l1; i1 ++ ) {\n\n\t\t\t\t\t\tassignTriangle1( i1 );\n\n\t\t\t\t\t\ttriangle1.needsUpdate = true;\n\n\t\t\t\t\t\tif ( intersectsTriangles( triangle1, triangle2, i1, i2, depth1, nodeIndex1, depth2, nodeIndex2 ) ) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\t};\n\n\t\t\tif ( intersectsRanges ) {\n\n\t\t\t\tconst originalIntersectsRanges = intersectsRanges;\n\t\t\t\tintersectsRanges = function ( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 ) {\n\n\t\t\t\t\tif ( ! originalIntersectsRanges( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 ) ) {\n\n\t\t\t\t\t\treturn iterateOverDoubleTriangles( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 );\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t};\n\n\t\t\t} else {\n\n\t\t\t\tintersectsRanges = iterateOverDoubleTriangles;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn super.bvhcast( otherBvh, matrixToLocal, { intersectsRanges } );\n\n\t}\n\n\n\t/* Derived Cast Functions /\n\n\t/\n\t Returns whether or not the mesh intersects the given box.\n\t \n\t The `boxToBvh` parameter is the transform of the box in the meshes frame.\n\t \n\t @param {Box3} box\n\t * @param {Matrix4} boxToBvh - Transform of the box in the local space of this BVH.\n\t * @returns {boolean}\n\t /\n\tintersectsBox( box, boxToMesh ) {\n\n\t\t_obb.set( box.min, box.max, boxToMesh );\n\t\t_obb.needsUpdate = true;\n\n\t\treturn this.shapecast(\n\t\t\t{\n\t\t\t\tintersectsBounds: box => _obb.intersectsBox( box ),\n\t\t\t\tintersectsTriangle: tri => _obb.intersectsTriangle( tri )\n\t\t\t}\n\t\t);\n\n\t}\n\n\t/\n\t Returns whether or not the mesh intersects the given sphere.\n\t \n\t @param {Sphere} sphere\n\t * @returns {boolean}\n\t /\n\tintersectsSphere( sphere ) {\n\n\t\treturn this.shapecast(\n\t\t\t{\n\t\t\t\tintersectsBounds: box => sphere.intersectsBox( box ),\n\t\t\t\tintersectsTriangle: tri => tri.intersectsSphere( sphere )\n\t\t\t}\n\t\t);\n\n\t}\n\n\t/\n\t Computes the closest distance from the geometry to the mesh and puts the closest point on\n\t * the mesh in `target1` (in the frame of the BVH) and the closest point on the other\n\t * geometry in `target2` (in the geometry frame). If `target1` is not provided a new Object\n\t * is created and returned from the function.\n\t \n\t The `geometryToBvh` parameter is the transform of the geometry in the BVH's local frame.\n\t \n\t If a point is found that is closer than `minThreshold` then the function will return that\n\t * result early. Any triangles or points outside of `maxThreshold` are ignored. If no point\n\t * is found within the min / max thresholds then `null` is returned and the target objects\n\t * are not modified.\n\t \n\t The returned faceIndex in `target1` and `target2` can be used with the standalone function\n\t * `getTriangleHitPointInfo` to obtain more information like UV coordinates, triangle normal\n\t * and materialIndex.\n\t \n\t _Note that this function can be very slow if `geometry` does not have a\n\t * `geometry.boundsTree` computed._\n\t \n\t @param {BufferGeometry} otherGeometry\n\t * @param {Matrix4} geometryToBvh - Transform of `otherGeometry` into the local space of\n\t * this BVH.\n\t * @param {HitPointInfo} [target1={}]\n\t * @param {HitPointInfo} [target2={}]\n\t * @param {number} [minThreshold=0]\n\t * @param {number} [maxThreshold=Infinity]\n\t * @returns {HitPointInfo\|null}\n\t /\n\tclosestPointToGeometry( otherGeometry, geometryToBvh, target1 = { }, target2 = { }, minThreshold = 0, maxThreshold = Infinity ) {\n\n\t\tconst closestPointToGeometryFunc = this.indirect ? closestPointToGeometry_indirect : closestPointToGeometry;\n\t\treturn closestPointToGeometryFunc(\n\t\t\tthis,\n\t\t\totherGeometry,\n\t\t\tgeometryToBvh,\n\t\t\ttarget1,\n\t\t\ttarget2,\n\t\t\tminThreshold,\n\t\t\tmaxThreshold,\n\t\t);\n\n\t}\n\n\t/\n\t Computes the closest distance from the point to the mesh and gives additional information\n\t * in `target`. The target can be left undefined to default to a new object which is\n\t * ultimately returned by the function.\n\t \n\t If a point is found that is closer than `minThreshold` then the function will return that\n\t * result early. Any triangles or points outside of `maxThreshold` are ignored. If no point\n\t * is found within the min / max thresholds then `null` is returned and the `target` object\n\t * is not modified.\n\t \n\t The returned faceIndex can be used with the standalone function `getTriangleHitPointInfo`\n\t * to obtain more information like UV coordinates, triangle normal and materialIndex.\n\t \n\t @param {Vector3} point\n\t * @param {HitPointInfo} [target={}]\n\t * @param {number} [minThreshold=0]\n\t * @param {number} [maxThreshold=Infinity]\n\t * @returns {HitPointInfo\|null}\n\t /\n\tclosestPointToPoint( point, target = { }, minThreshold = 0, maxThreshold = Infinity ) {\n\n\t\treturn closestPointToPoint(\n\t\t\tthis,\n\t\t\tpoint,\n\t\t\ttarget,\n\t\t\tminThreshold,\n\t\t\tmaxThreshold,\n\t\t);\n\n\t}\n\n}\n","/* @import { Object3D } from 'three' /\n/* @import { IntersectsBoundsCallback, IntersectsRangeCallback, BoundsTraverseOrderCallback } from './BVH.js' /\nimport { Box3, BufferGeometry, Matrix4, Mesh, Vector3, Ray, Sphere } from 'three';\nimport { BVH } from './BVH.js';\nimport { INTERSECTED, NOT_INTERSECTED } from './Constants.js';\n\nconst _geometry = / @__PURE__ / new BufferGeometry();\nconst _matrix = / @__PURE__ / new Matrix4();\nconst _inverseMatrix = / @__PURE__ / new Matrix4();\nconst _box = / @__PURE__ / new Box3();\nconst _sphere = / @__PURE__ / new Sphere();\nconst _vec = / @__PURE__ / new Vector3();\nconst _ray = / @__PURE__ / new Ray();\nconst _mesh = / @__PURE__ / new Mesh();\nconst _geometryRange = {};\n\n/\n @callback IntersectsObjectCallback\n * @param {Object3D} object - The scene object whose bounds were intersected.\n * @param {number} instanceId - Instance index for InstancedMesh/BatchedMesh, or 0 for regular objects.\n * @param {boolean} contained - Whether the node bounds are fully contained by the query shape.\n * @param {number} depth - The depth of the node in the tree.\n * @returns {boolean} Return `true` to stop traversal.\n /\n\n/\n BVH built from a scene hierarchy rather than a single geometry. Each leaf holds\n * one Object3D (or one instance of an InstancedMesh/BatchedMesh), enabling\n * accelerated raycasting and spatial queries across many objects at once.\n \n @param {Object3D \| Array<Object3D>} root - Root object or array of objects.\n * @param {Object} [options] - Accepts all standard BVH options plus:\n * @param {boolean} [options.precise=false] - Use vertex-level bounds instead of cached bounding boxes.\n * @param {boolean} [options.includeInstances=true] - Treat each instance of InstancedMesh/BatchedMesh as a separate primitive.\n * @extends BVH\n /\nexport class ObjectBVH extends BVH {\n\n\tconstructor( root, options = {} ) {\n\n\t\toptions = {\n\t\t\tprecise: false,\n\t\t\tincludeInstances: true,\n\t\t\tmatrixWorld: Array.isArray( root ) ? new Matrix4() : root.matrixWorld,\n\t\t\ttargetLeafSize: 1,\n\t\t\t...options,\n\t\t};\n\n\t\tsuper();\n\n\t\t// collect all the leaf node objects in the geometries\n\t\tconst objectSet = new Set();\n\t\tcollectObjects( root, objectSet );\n\n\t\t// calculate the number of bits required for the primary id, leaving the remainder\n\t\t// for the instanceId count\n\t\tconst objects = Array.from( objectSet );\n\t\tconst idBits = Math.ceil( Math.log2( objects.length ) );\n\t\tconst idMask = ( 1 << idBits ) - 1;\n\n\t\tthis.objects = objects;\n\t\tthis.idBits = idBits;\n\t\tthis.idMask = idMask;\n\t\tthis.primitiveBuffer = null;\n\t\tthis.primitiveBufferStride = 1;\n\n\t\t// settings\n\t\tthis.precise = options.precise;\n\t\tthis.includeInstances = options.includeInstances;\n\t\tthis.matrixWorld = options.matrixWorld;\n\n\t\tthis.init( options );\n\n\t}\n\n\t/\n\t Returns the `Object3D` associated with a composite id as provided to `intersectsObject`.\n\t * @param {number} compositeId\n\t * @returns {Object3D}\n\t /\n\tgetObjectFromId( compositeId ) {\n\n\t\tconst { idMask, objects } = this;\n\t\tconst id = getObjectId( compositeId, idMask );\n\t\treturn objects[ id ];\n\n\t}\n\n\t/\n\t Returns the instance index associated with a composite id as provided to `intersectsObject`.\n\t * @param {number} compositeId\n\t * @returns {number}\n\t /\n\tgetInstanceFromId( compositeId ) {\n\n\t\tconst { idMask, idBits } = this;\n\t\treturn getInstanceId( compositeId, idBits, idMask );\n\n\t}\n\n\tinit( options ) {\n\n\t\tconst { objects, idBits, matrixWorld } = this;\n\n\t\t// pre-cache the inverse matrix for use in the \"getPrimitiveBoundingBox\" function\n\t\t_inverseMatrix.copy( matrixWorld ).invert();\n\n\t\tthis.primitiveBuffer = new Uint32Array( this._countPrimitives( objects ) );\n\t\tthis._fillPrimitiveBuffer( objects, idBits, this.primitiveBuffer );\n\n\t\tsuper.init( options );\n\n\t}\n\n\trefit( ...args ) {\n\n\t\t// pre-cache the inverse matrix for use in the \"getPrimitiveBoundingBox\" function\n\t\t_inverseMatrix.copy( this.matrixWorld ).invert();\n\n\t\tsuper.refit( ...args );\n\n\t}\n\n\twritePrimitiveBounds( i, targetBuffer, writeOffset ) {\n\n\t\tconst { primitiveBuffer } = this;\n\t\tthis._getPrimitiveBoundingBox( primitiveBuffer[ i ], _inverseMatrix, _box );\n\n\t\tconst { min, max } = _box;\n\t\ttargetBuffer[ writeOffset + 0 ] = min.x;\n\t\ttargetBuffer[ writeOffset + 1 ] = min.y;\n\t\ttargetBuffer[ writeOffset + 2 ] = min.z;\n\t\ttargetBuffer[ writeOffset + 3 ] = max.x;\n\t\ttargetBuffer[ writeOffset + 4 ] = max.y;\n\t\ttargetBuffer[ writeOffset + 5 ] = max.z;\n\n\t}\n\n\tgetRootRanges() {\n\n\t\treturn [ { offset: 0, count: this.primitiveBuffer.length } ];\n\n\t}\n\n\t/\n\t Performs a spatial query against the BVH. Extends the base `shapecast` with an\n\t * `intersectsObject` callback that is called once per object primitive in leaf nodes.\n\t \n\t @param {Object} callbacks\n\t * @param {IntersectsBoundsCallback} callbacks.intersectsBounds\n\t * @param {IntersectsObjectCallback} [callbacks.intersectsObject]\n\t * @param {IntersectsRangeCallback} [callbacks.intersectsRange]\n\t * @param {BoundsTraverseOrderCallback} [callbacks.boundsTraverseOrder]\n\t * @returns {boolean}\n\t /\n\tshapecast( callbacks ) {\n\n\t\treturn super.shapecast( {\n\t\t\t...callbacks,\n\n\t\t\tintersectsPrimitive: callbacks.intersectsObject,\n\t\t\tscratchPrimitive: null,\n\t\t\titerate: iterateOverObjects,\n\t\t} );\n\n\t}\n\n\t// TODO: this is out of sync with the MeshBVH raycast signature.\n\t// Change this to \"raycastObject3D\"? Or add an equivalent?\n\traycast( raycaster, intersects = [] ) {\n\n\t\tconst { matrixWorld, includeInstances } = this;\n\t\tconst { firstHitOnly } = raycaster;\n\t\tconst localIntersects = [];\n\n\t\t// transform the ray into the local bvh frame\n\t\t_inverseMatrix.copy( matrixWorld ).invert();\n\t\t_ray.copy( raycaster.ray ).applyMatrix4( _inverseMatrix );\n\n\t\tlet closestDistance = Infinity;\n\t\tlet closestHit = null;\n\n\t\tthis.shapecast( {\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn box.distanceToPoint( _ray.origin );\n\n\t\t\t},\n\t\t\tintersectsBounds: box => {\n\n\t\t\t\tif ( firstHitOnly ) {\n\n\t\t\t\t\tif ( ! _ray.intersectBox( box, _vec ) ) {\n\n\t\t\t\t\t\treturn NOT_INTERSECTED;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tlet dist;\n\t\t\t\t\tif ( box.containsPoint( _ray.origin ) ) {\n\n\t\t\t\t\t\tdist = 0;\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\t_vec.applyMatrix4( matrixWorld );\n\t\t\t\t\t\tdist = raycaster.ray.origin.distanceTo( _vec );\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// early out if the box is further than the closest raycast\n\t\t\t\t\treturn dist < closestDistance ? INTERSECTED : NOT_INTERSECTED;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn _ray.intersectsBox( box ) ? INTERSECTED : NOT_INTERSECTED;\n\n\t\t\t\t}\n\n\t\t\t},\n\t\t\tintersectsObject( object, instanceId ) {\n\n\t\t\t\t// skip non visible objects\n\t\t\t\tif ( ! object.visible ) {\n\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\n\t\t\t\tlocalIntersects.length = 0;\n\n\t\t\t\tif ( object.isInstancedMesh && includeInstances ) {\n\n\t\t\t\t\t// raycast the instance\n\t\t\t\t\t_mesh.geometry = object.geometry;\n\t\t\t\t\t_mesh.material = object.material;\n\n\t\t\t\t\tobject.getMatrixAt( instanceId, _mesh.matrixWorld );\n\t\t\t\t\t_mesh.matrixWorld.premultiply( object.matrixWorld );\n\t\t\t\t\t_mesh.raycast( raycaster, localIntersects );\n\n\t\t\t\t\tlocalIntersects.forEach( hit => {\n\n\t\t\t\t\t\thit.object = object;\n\t\t\t\t\t\thit.instanceId = instanceId;\n\n\t\t\t\t\t} );\n\n\t\t\t\t\t_mesh.material = null;\n\n\t\t\t\t} else if ( object.isBatchedMesh && includeInstances ) {\n\n\t\t\t\t\tif ( ! object.getVisibleAt( instanceId ) ) {\n\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// extract the geometry & material\n\t\t\t\t\tconst geometryId = object.getGeometryIdAt( instanceId );\n\t\t\t\t\tconst geometryRange = object.getGeometryRangeAt( geometryId, _geometryRange );\n\n\t\t\t\t\t_geometry.index = object.geometry.index;\n\t\t\t\t\t_geometry.attributes = object.geometry.attributes;\n\t\t\t\t\t_geometry.setDrawRange( geometryRange.start, geometryRange.count );\n\n\t\t\t\t\t_mesh.geometry = _geometry;\n\t\t\t\t\t_mesh.material = object.material;\n\n\t\t\t\t\t// perform a raycast against the proxy mesh\n\t\t\t\t\tobject.getMatrixAt( instanceId, _mesh.matrixWorld );\n\t\t\t\t\t_mesh.matrixWorld.premultiply( object.matrixWorld );\n\t\t\t\t\t_mesh.raycast( raycaster, localIntersects );\n\n\t\t\t\t\t// fix up the fields\n\t\t\t\t\tlocalIntersects.forEach( hit => {\n\n\t\t\t\t\t\thit.object = object;\n\t\t\t\t\t\thit.batchId = instanceId;\n\n\t\t\t\t\t} );\n\n\t\t\t\t\t_mesh.material = null;\n\t\t\t\t\t_geometry.index = null;\n\t\t\t\t\t_geometry.attributes = null;\n\t\t\t\t\t_geometry.setDrawRange( 0, Infinity );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tobject.raycast( raycaster, localIntersects );\n\n\t\t\t\t}\n\n\t\t\t\t// find the closest hit to track\n\t\t\t\tif ( firstHitOnly ) {\n\n\t\t\t\t\tlocalIntersects.forEach( hit => {\n\n\t\t\t\t\t\tif ( hit.distance < closestDistance ) {\n\n\t\t\t\t\t\t\tclosestDistance = hit.distance;\n\t\t\t\t\t\t\tclosestHit = hit;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tintersects.push( ...localIntersects );\n\n\t\t\t\t}\n\n\t\t\t},\n\t\t} );\n\n\t\t// save the closest hit only if firstHitOnly = true\n\t\tif ( firstHitOnly && closestHit ) {\n\n\t\t\tintersects.push( closestHit );\n\n\t\t}\n\n\t\treturn intersects;\n\n\t}\n\n\t// get the bounding box of a primitive node accounting for the bvh options\n\t_getPrimitiveBoundingBox( compositeId, inverseMatrixWorld, target ) {\n\n\t\tconst { objects, idMask, idBits, precise, includeInstances } = this;\n\t\tconst id = getObjectId( compositeId, idMask );\n\t\tconst instanceId = getInstanceId( compositeId, idBits, idMask );\n\t\tconst object = objects[ id ];\n\n\t\tif ( ! includeInstances && ( object.isInstancedMesh \|\| object.isBatchedMesh ) ) {\n\n\t\t\t// if we're not using instances then just account for the overall bounds of the BatchedMesh and InstancedMesh\n\t\t\tif ( ! object.boundingBox ) {\n\n\t\t\t\tobject.computeBoundingBox();\n\n\t\t\t}\n\n\t\t\tif ( ! object.boundingSphere ) {\n\n\t\t\t\tobject.computeBoundingSphere();\n\n\t\t\t}\n\n\t\t\t_matrix\n\t\t\t\t.copy( object.matrixWorld )\n\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t_sphere\n\t\t\t\t.copy( object.boundingSphere )\n\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\ttarget\n\t\t\t\t.copy( object.boundingBox )\n\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\tshrinkToSphere( target, _sphere );\n\n\t\t} else if ( precise ) {\n\n\t\t\t// calculate precise bounds if necessary by calculating the bounds of all vertices\n\t\t\t// in the bvh frame\n\t\t\tif ( object.isInstancedMesh ) {\n\n\t\t\t\tobject\n\t\t\t\t\t.getMatrixAt( instanceId, _matrix );\n\n\t\t\t\t_matrix\n\t\t\t\t\t.premultiply( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\tgetPreciseBounds( object.geometry, _matrix, target );\n\n\t\t\t} else if ( object.isBatchedMesh ) {\n\n\t\t\t\tconst geometryId = object.getGeometryIdAt( instanceId );\n\t\t\t\tconst geometryRange = object.getGeometryRangeAt( geometryId, _geometryRange );\n\n\t\t\t\t_geometry.index = object.geometry.index;\n\t\t\t\t_geometry.attributes = object.geometry.attributes;\n\t\t\t\t_geometry.setDrawRange( geometryRange.start, geometryRange.count );\n\n\t\t\t\tobject\n\t\t\t\t\t.getMatrixAt( instanceId, _matrix );\n\n\t\t\t\t_matrix\n\t\t\t\t\t.premultiply( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\tgetPreciseBounds( _geometry, _matrix, target );\n\n\t\t\t\t_geometry.attributes = null;\n\n\t\t\t} else {\n\n\t\t\t\t_matrix\n\t\t\t\t\t.copy( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\ttarget.setFromObject( object, true ).applyMatrix4( inverseMatrixWorld );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// otherwise use the fast path of extracting the cached, AABB bounds and transforming them\n\t\t\t// into the local BVH frame\n\t\t\tif ( object.isInstancedMesh ) {\n\n\t\t\t\tif ( ! object.geometry.boundingBox ) {\n\n\t\t\t\t\tobject.geometry.computeBoundingBox();\n\n\t\t\t\t}\n\n\t\t\t\tif ( ! object.geometry.boundingSphere ) {\n\n\t\t\t\t\tobject.geometry.computeBoundingSphere();\n\n\t\t\t\t}\n\n\t\t\t\tobject\n\t\t\t\t\t.getMatrixAt( instanceId, _matrix );\n\n\t\t\t\t_matrix\n\t\t\t\t\t.premultiply( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\t_sphere\n\t\t\t\t\t.copy( object.geometry.boundingSphere )\n\t\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\t\ttarget\n\t\t\t\t\t.copy( object.geometry.boundingBox )\n\t\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\t\tshrinkToSphere( target, _sphere );\n\n\t\t\t} else if ( object.isBatchedMesh ) {\n\n\t\t\t\tconst geometryId = object.getGeometryIdAt( instanceId );\n\n\t\t\t\tobject\n\t\t\t\t\t.getMatrixAt( instanceId, _matrix );\n\n\t\t\t\t_matrix\n\t\t\t\t\t.premultiply( object.matrixWorld )\n\t\t\t\t\t.premultiply( inverseMatrixWorld );\n\n\t\t\t\tobject\n\t\t\t\t\t.getBoundingSphereAt( geometryId, _sphere )\n\t\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\t\tobject\n\t\t\t\t\t.getBoundingBoxAt( geometryId, target )\n\t\t\t\t\t.applyMatrix4( _matrix );\n\n\t\t\t\tshrinkToSphere( target, _sphere );\n\n\t\t\t} else {\n\n\t\t\t\ttarget\n\t\t\t\t\t.setFromObject( object, false )\n\t\t\t\t\t.applyMatrix4( inverseMatrixWorld );\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\t// counts the total number of primitives required by the objects in given array of objects\n\t_countPrimitives( objects ) {\n\n\t\tconst { includeInstances } = this;\n\t\tlet total = 0;\n\t\tobjects.forEach( object => {\n\n\t\t\tif ( object.isInstancedMesh && includeInstances ) {\n\n\t\t\t\ttotal += object.count;\n\n\t\t\t} else if ( object.isBatchedMesh && includeInstances ) {\n\n\t\t\t\tif ( ! ( 'instanceCount' in object ) ) {\n\n\t\t\t\t\tthrow new Error( 'ObjectBVH: Three.js revision >= r169 is required to use BatchedMesh.' );\n\n\t\t\t\t}\n\n\t\t\t\ttotal += object.instanceCount;\n\n\t\t\t} else {\n\n\t\t\t\ttotal ++;\n\n\t\t\t}\n\n\t\t} );\n\n\t\treturn total;\n\n\t}\n\n\t_fillPrimitiveBuffer( objects, idBits, target ) {\n\n\t\tconst { includeInstances } = this;\n\t\tlet index = 0;\n\t\tobjects.forEach( ( object, i ) => {\n\n\t\t\tif ( object.isInstancedMesh && includeInstances ) {\n\n\t\t\t\tconst count = object.count;\n\t\t\t\tfor ( let c = 0; c < count; c ++ ) {\n\n\t\t\t\t\ttarget[ index ] = ( c << idBits ) \| i;\n\t\t\t\t\tindex ++;\n\n\t\t\t\t}\n\n\t\t\t} else if ( object.isBatchedMesh && includeInstances ) {\n\n\t\t\t\tconst { instanceCount, maxInstanceCount } = object;\n\t\t\t\tlet foundInstances = 0;\n\t\t\t\tlet iter = 0;\n\n\t\t\t\twhile ( foundInstances < instanceCount && iter < maxInstanceCount ) {\n\n\t\t\t\t\t// TODO: it would be better to have a consistent way of querying whether an\n\t\t\t\t\t// instance were active\n\t\t\t\t\ttry {\n\n\t\t\t\t\t\tobject.getVisibleAt( iter );\n\n\t\t\t\t\t\ttarget[ index ] = ( iter << idBits ) \| i;\n\t\t\t\t\t\tfoundInstances ++;\n\t\t\t\t\t\tindex ++;\n\n\t\t\t\t\t} catch {\n\n\t\t\t\t\t\t//\n\n\t\t\t\t\t}\n\n\t\t\t\t\titer ++;\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\ttarget[ index ] = i;\n\t\t\t\tindex ++;\n\n\t\t\t}\n\n\t\t} );\n\n\t}\n\n}\n\n// id functions\n// extract the primary object id given the provided mask\nfunction getObjectId( id, idMask ) {\n\n\treturn id & idMask;\n\n}\n\n// extract the instance id given the mask and number of bits to shift\nfunction getInstanceId( id, idBits, idMask ) {\n\n\treturn ( id & ( ~ idMask ) ) >>> idBits;\n\n}\n\n// traverse the full scene and collect all leaves\nfunction collectObjects( root, objectSet = new Set() ) {\n\n\tif ( Array.isArray( root ) ) {\n\n\t\troot.forEach( object => collectObjects( object, objectSet ) );\n\n\t} else {\n\n\t\troot.traverse( child => {\n\n\t\t\tif ( child.isMesh \|\| child.isLine \|\| child.isPoints ) {\n\n\t\t\t\tobjectSet.add( child );\n\n\t\t\t}\n\n\t\t} );\n\n\t}\n\n}\n\n// calculate precise box bounds of the given geometry in the given frame\nfunction getPreciseBounds( geometry, matrix, target ) {\n\n\ttarget.makeEmpty();\n\n\tconst drawRange = geometry.drawRange;\n\tconst indexAttr = geometry.index;\n\tconst posAttr = geometry.attributes.position;\n\tconst start = drawRange.start;\n\tconst vertCount = indexAttr ? indexAttr.count : posAttr.count;\n\tconst count = Math.min( vertCount - start, drawRange.count );\n\tfor ( let i = start, l = start + count; i < l; i ++ ) {\n\n\t\tlet vi = i;\n\t\tif ( indexAttr ) {\n\n\t\t\tvi = indexAttr.getX( vi );\n\n\t\t}\n\n\t\t_vec.fromBufferAttribute( posAttr, vi ).applyMatrix4( matrix );\n\t\ttarget.expandByPoint( _vec );\n\n\t}\n\n\treturn target;\n\n}\n\n// iterator helper for raycasting\nfunction iterateOverObjects( offset, count, bvh, callback, contained, depth, / scratch / ) {\n\n\tconst { primitiveBuffer, objects, idMask, idBits } = bvh;\n\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\tconst compositeId = primitiveBuffer[ i ];\n\t\tconst id = getObjectId( compositeId, idMask );\n\t\tconst instanceId = getInstanceId( compositeId, idBits, idMask );\n\t\tconst object = objects[ id ];\n\t\tif ( callback( object, instanceId, contained, depth ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n\nfunction shrinkToSphere( box, sphere ) {\n\n\t_vec.copy( sphere.center ).addScalar( - sphere.radius );\n\tbox.min.max( _vec );\n\n\t_vec.copy( sphere.center ).addScalar( sphere.radius );\n\tbox.max.min( _vec );\n\n}\n","/* @import { SkinnedMesh } from 'three' /\n/* @import { IntersectsBoundsCallback, IntersectsRangeCallback, BoundsTraverseOrderCallback } from './BVH.js' /\nimport { Vector3, Vector2, Ray, Matrix4, FrontSide, BackSide, Triangle, REVISION } from 'three';\nimport { GeometryBVH } from './GeometryBVH.js';\nimport { ExtendedTriangle } from '../math/ExtendedTriangle.js';\nimport { INTERSECTED, NOT_INTERSECTED, SKIP_GENERATION } from './Constants.js';\n\nconst _v0 = / @__PURE__ / new Vector3();\nconst _v1 = / @__PURE__ / new Vector3();\nconst _v2 = / @__PURE__ / new Vector3();\nconst _ray = / @__PURE__ / new Ray();\nconst _inverseMatrix = / @__PURE__ / new Matrix4();\nconst _localPoint = / @__PURE__ / new Vector3();\nconst _vec = / @__PURE__ / new Vector3();\nconst _axes = [ 'x', 'y', 'z' ];\n\nconst IS_GT_REVISION_169 = parseInt( REVISION ) >= 169;\nconst IS_LT_REVISION_161 = parseInt( REVISION ) <= 161;\n\nconst _uvA = / @__PURE__ / new Vector2();\nconst _uvB = / @__PURE__ / new Vector2();\nconst _uvC = / @__PURE__ / new Vector2();\nconst _normalA = / @__PURE__ / new Vector3();\nconst _normalB = / @__PURE__ / new Vector3();\nconst _normalC = / @__PURE__ / new Vector3();\n\n/\n @callback IntersectsTriangleCallback\n * @param {ExtendedTriangle} triangle - The triangle primitive in local space.\n * @param {number} index - The primitive index within the BVH buffer.\n * @param {boolean} contained - Whether the node bounds are fully contained by the query shape.\n * @param {number} depth - The depth of the node in the tree.\n * @returns {boolean} Return `true` to stop traversal.\n /\n\n/\n BVH for `SkinnedMesh` objects. Computes primitive bounds using\n * `SkinnedMesh.getVertexPosition` so the tree reflects the current posed state\n * of the mesh. Call `refit()` after updating the skeleton to keep bounds accurate.\n \n @param {SkinnedMesh} mesh\n * @param {Object} [options] - Same options as {@link GeometryBVH}.\n * @extends GeometryBVH\n /\nexport class SkinnedMeshBVH extends GeometryBVH {\n\n\tget primitiveStride() {\n\n\t\treturn 3;\n\n\t}\n\n\tconstructor( mesh, options = {} ) {\n\n\t\tif ( ! mesh.isMesh ) {\n\n\t\t\tthrow new Error( 'SkinnedMeshBVH: First argument must be a Mesh.' );\n\n\t\t}\n\n\t\t// skip generation initially so we can add our local fields\n\t\t// TODO: is there a more clean way to handle this? Update all subclasses to be\n\t\t// responsible for calling \"init\" themselves?\n\t\tsuper( mesh.geometry, {\n\t\t\t...options,\n\t\t\t[ SKIP_GENERATION ]: true,\n\t\t} );\n\t\tthis.mesh = mesh;\n\n\t\tif ( ! options[ SKIP_GENERATION ] ) {\n\n\t\t\tthis.init( options );\n\n\t\t}\n\n\t}\n\n\twritePrimitiveBounds( i, targetBuffer, baseIndex ) {\n\n\t\tconst { mesh, geometry } = this;\n\t\tconst indirectBuffer = this._indirectBuffer;\n\t\tconst index = geometry.index ? geometry.index.array : null;\n\n\t\tconst tri = indirectBuffer ? indirectBuffer[ i ] : i;\n\t\tconst tri3 = tri 3;\n\n\t\tlet ai = tri3 + 0;\n\t\tlet bi = tri3 + 1;\n\t\tlet ci = tri3 + 2;\n\n\t\tif ( index ) {\n\n\t\t\tai = index[ ai ];\n\t\t\tbi = index[ bi ];\n\t\t\tci = index[ ci ];\n\n\t\t}\n\n\t\t// Get skinned vertex positions\n\t\tmesh.getVertexPosition( ai, _v0 );\n\t\tmesh.getVertexPosition( bi, _v1 );\n\t\tmesh.getVertexPosition( ci, _v2 );\n\n\t\t// Compute bounds for each axis\n\t\tfor ( let el = 0; el < 3; el ++ ) {\n\n\t\t\tconst axis = _axes[ el ];\n\t\t\tconst a = _v0[ axis ];\n\t\t\tconst b = _v1[ axis ];\n\t\t\tconst c = _v2[ axis ];\n\n\t\t\tlet min = a;\n\t\t\tif ( b < min ) min = b;\n\t\t\tif ( c < min ) min = c;\n\n\t\t\tlet max = a;\n\t\t\tif ( b > max ) max = b;\n\t\t\tif ( c > max ) max = c;\n\n\t\t\t// Write in min/max format [minx, miny, minz, maxx, maxy, maxz]\n\t\t\ttargetBuffer[ baseIndex + el ] = min;\n\t\t\ttargetBuffer[ baseIndex + el + 3 ] = max;\n\n\t\t}\n\n\t\treturn targetBuffer;\n\n\t}\n\n\t/*\n\t Performs a spatial query against the BVH. Extends the base `shapecast` with an\n\t * `intersectsTriangle` callback that is called once per triangle primitive in leaf nodes.\n\t \n\t @param {Object} callbacks\n\t * @param {IntersectsBoundsCallback} callbacks.intersectsBounds\n\t * @param {IntersectsTriangleCallback} [callbacks.intersectsTriangle]\n\t * @param {IntersectsRangeCallback} [callbacks.intersectsRange]\n\t * @param {BoundsTraverseOrderCallback} [callbacks.boundsTraverseOrder]\n\t * @returns {boolean}\n\t /\n\tshapecast( callbacks ) {\n\n\t\tconst triangle = new ExtendedTriangle();\n\t\treturn super.shapecast(\n\t\t\t{\n\t\t\t\t...callbacks,\n\t\t\t\tintersectsPrimitive: callbacks.intersectsTriangle,\n\t\t\t\tscratchPrimitive: triangle,\n\t\t\t\titerate: iterateOverTriangles,\n\t\t\t},\n\t\t);\n\n\t}\n\n\traycastObject3D( object, raycaster, intersects = [] ) {\n\n\t\tconst { material } = object;\n\t\tif ( material === undefined ) {\n\n\t\t\treturn;\n\n\t\t}\n\n\t\tconst { matrixWorld } = object;\n\t\tconst { firstHitOnly } = raycaster;\n\n\t\t_inverseMatrix.copy( matrixWorld ).invert();\n\t\t_ray.copy( raycaster.ray ).applyMatrix4( _inverseMatrix );\n\n\t\tlet closestHit = null;\n\t\tlet closestDistance = Infinity;\n\n\t\tthis.shapecast( {\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn box.distanceToPoint( _ray.origin );\n\n\t\t\t},\n\t\t\tintersectsBounds: box => {\n\n\t\t\t\tif ( firstHitOnly ) {\n\n\t\t\t\t\tif ( ! _ray.intersectBox( box, _vec ) ) {\n\n\t\t\t\t\t\treturn NOT_INTERSECTED;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tlet dist;\n\t\t\t\t\tif ( box.containsPoint( _ray.origin ) ) {\n\n\t\t\t\t\t\tdist = 0;\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\t_vec.applyMatrix4( matrixWorld );\n\t\t\t\t\t\tdist = raycaster.ray.origin.distanceTo( _vec );\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// early out if the box is further than the closest raycast\n\t\t\t\t\treturn dist < closestDistance ? INTERSECTED : NOT_INTERSECTED;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn _ray.intersectsBox( box ) ? INTERSECTED : NOT_INTERSECTED;\n\n\t\t\t\t}\n\n\t\t\t},\n\t\t\tintersectsTriangle: ( tri, triIndex ) => {\n\n\t\t\t\t// get the intersection\n\t\t\t\tlet point = null;\n\t\t\t\tif ( material.side === FrontSide ) {\n\n\t\t\t\t\tpoint = _ray.intersectTriangle( tri.a, tri.b, tri.c, true, _localPoint );\n\n\t\t\t\t} else if ( material.side === BackSide ) {\n\n\t\t\t\t\tpoint = _ray.intersectTriangle( tri.c, tri.b, tri.a, true, _localPoint );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tpoint = _ray.intersectTriangle( tri.a, tri.b, tri.c, false, _localPoint );\n\n\t\t\t\t}\n\n\t\t\t\tif ( ! point ) {\n\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\n\t\t\t\t// transform it into world space\n\t\t\t\tpoint = point.clone().applyMatrix4( matrixWorld );\n\n\t\t\t\t// check distance to ray\n\t\t\t\tconst dist = raycaster.ray.origin.distanceTo( point );\n\t\t\t\tif ( dist >= raycaster.near && dist <= raycaster.far ) {\n\n\t\t\t\t\tif ( firstHitOnly && dist >= closestDistance ) {\n\n\t\t\t\t\t\treturn;\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// get the vertex indices\n\t\t\t\t\tconst { geometry } = this;\n\t\t\t\t\tconst { index } = geometry;\n\t\t\t\t\tconst actualTri = this.resolvePrimitiveIndex( triIndex );\n\t\t\t\t\tconst triOffset = actualTri 3;\n\n\t\t\t\t\tlet ai = triOffset + 0;\n\t\t\t\t\tlet bi = triOffset + 1;\n\t\t\t\t\tlet ci = triOffset + 2;\n\n\t\t\t\t\tif ( index ) {\n\n\t\t\t\t\t\tai = index.array[ ai ];\n\t\t\t\t\t\tbi = index.array[ bi ];\n\t\t\t\t\t\tci = index.array[ ci ];\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// build the intersection result\n\t\t\t\t\tconst hit = {\n\t\t\t\t\t\tdistance: dist,\n\t\t\t\t\t\tpoint: point.clone(),\n\t\t\t\t\t\tobject,\n\t\t\t\t\t\tuv: null,\n\t\t\t\t\t\tuv1: null,\n\t\t\t\t\t\tnormal: null,\n\t\t\t\t\t\tface: {\n\t\t\t\t\t\t\ta: ai,\n\t\t\t\t\t\t\tb: bi,\n\t\t\t\t\t\t\tc: ci,\n\t\t\t\t\t\t\tnormal: Triangle.getNormal( tri.a, tri.b, tri.c, new Vector3() ),\n\t\t\t\t\t\t\tmaterialIndex: 0\n\t\t\t\t\t\t},\n\t\t\t\t\t\tfaceIndex: actualTri,\n\t\t\t\t\t};\n\n\t\t\t\t\tif ( IS_GT_REVISION_169 ) {\n\n\t\t\t\t\t\tconst barycoord = new Vector3();\n\t\t\t\t\t\tTriangle.getBarycoord( _localPoint, tri.a, tri.b, tri.c, barycoord );\n\t\t\t\t\t\thit.barycoord = barycoord;\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// add attribute fields if available\n\t\t\t\t\tconst uv = geometry.attributes.uv;\n\t\t\t\t\tconst uv1 = geometry.attributes.uv1;\n\t\t\t\t\tconst normal = geometry.attributes.normal;\n\n\t\t\t\t\tif ( uv ) {\n\n\t\t\t\t\t\t_uvA.fromBufferAttribute( uv, ai );\n\t\t\t\t\t\t_uvB.fromBufferAttribute( uv, bi );\n\t\t\t\t\t\t_uvC.fromBufferAttribute( uv, ci );\n\n\t\t\t\t\t\thit.uv = new Vector2();\n\t\t\t\t\t\tconst resUv = Triangle.getInterpolation( _localPoint, tri.a, tri.b, tri.c, _uvA, _uvB, _uvC, hit.uv );\n\t\t\t\t\t\tif ( ! IS_GT_REVISION_169 ) hit.uv = resUv;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( uv1 ) {\n\n\t\t\t\t\t\t_uvA.fromBufferAttribute( uv1, ai );\n\t\t\t\t\t\t_uvB.fromBufferAttribute( uv1, bi );\n\t\t\t\t\t\t_uvC.fromBufferAttribute( uv1, ci );\n\n\t\t\t\t\t\thit.uv1 = new Vector2();\n\t\t\t\t\t\tconst resUv1 = Triangle.getInterpolation( _localPoint, tri.a, tri.b, tri.c, _uvA, _uvB, _uvC, hit.uv1 );\n\t\t\t\t\t\tif ( ! IS_GT_REVISION_169 ) hit.uv1 = resUv1;\n\t\t\t\t\t\tif ( IS_LT_REVISION_161 ) hit.uv2 = hit.uv1;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( normal ) {\n\n\t\t\t\t\t\t_normalA.fromBufferAttribute( normal, ai );\n\t\t\t\t\t\t_normalB.fromBufferAttribute( normal, bi );\n\t\t\t\t\t\t_normalC.fromBufferAttribute( normal, ci );\n\n\t\t\t\t\t\thit.normal = new Vector3();\n\t\t\t\t\t\tconst resNormal = Triangle.getInterpolation( _localPoint, tri.a, tri.b, tri.c, _normalA, _normalB, _normalC, hit.normal );\n\t\t\t\t\t\tif ( hit.normal.dot( _ray.direction ) > 0 ) {\n\n\t\t\t\t\t\t\thit.normal.multiplyScalar( - 1 );\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif ( ! IS_GT_REVISION_169 ) hit.normal = resNormal;\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// first hit only settings\n\t\t\t\t\tclosestDistance = hit.distance;\n\t\t\t\t\tclosestHit = hit;\n\n\t\t\t\t\tif ( ! firstHitOnly ) {\n\n\t\t\t\t\t\tintersects.push( hit );\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t} );\n\n\t\tif ( firstHitOnly && closestHit ) {\n\n\t\t\tintersects.push( closestHit );\n\n\t\t}\n\n\t\treturn intersects;\n\n\t}\n\n}\n\nfunction iterateOverTriangles(\n\toffset,\n\tcount,\n\tbvh,\n\tintersectsTriangleFunc,\n\tcontained,\n\tdepth,\n\ttriangle\n) {\n\n\tconst { mesh, geometry } = bvh;\n\tconst index = geometry.index ? geometry.index.array : null;\n\n\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\tconst tri = bvh.resolvePrimitiveIndex( i );\n\n\t\tlet i0 = 3 * tri + 0;\n\t\tlet i1 = 3 * tri + 1;\n\t\tlet i2 = 3 * tri + 2;\n\n\t\tif ( index ) {\n\n\t\t\ti0 = index[ i0 ];\n\t\t\ti1 = index[ i1 ];\n\t\t\ti2 = index[ i2 ];\n\n\t\t}\n\n\t\tmesh.getVertexPosition( i0, triangle.a );\n\t\tmesh.getVertexPosition( i1, triangle.b );\n\t\tmesh.getVertexPosition( i2, triangle.c );\n\t\ttriangle.needsUpdate = true;\n\n\t\tif ( intersectsTriangleFunc( triangle, i, contained, depth ) ) {\n\n\t\t\treturn true;\n\n\t\t}\n\n\t}\n\n\treturn false;\n\n}\n","/*\n Set of shader functions used for interacting with the packed BVH in a shader and sampling\n * VertexAttributeTextures. Provides common utility functions including `texelFetch1D`. See\n * [src/webgl/glsl](https://github.com/gkjohnson/three-mesh-bvh/tree/master/src/webgl/glsl)\n * for full implementations and declarations.\n \n Accessed as `BVHShaderGLSL.common_functions`.\n \n @section Shader and Texture Packing API\n * @type {string}\n /\nexport const common_functions = / glsl /`\n\n// A stack of uint32 indices can can store the indices for\n// a perfectly balanced tree with a depth up to 31. Lower stack\n// depth gets higher performance.\n//\n// However not all trees are balanced. Best value to set this to\n// is the trees max depth.\n#ifndef BVH_STACK_DEPTH\n#define BVH_STACK_DEPTH 60\n#endif\n\n#ifndef INFINITY\n#define INFINITY 1e20\n#endif\n\n// Utilities\nuvec4 uTexelFetch1D( usampler2D tex, uint index ) {\n\n\tuint width = uint( textureSize( tex, 0 ).x );\n\tuvec2 uv;\n\tuv.x = index % width;\n\tuv.y = index / width;\n\n\treturn texelFetch( tex, ivec2( uv ), 0 );\n\n}\n\nivec4 iTexelFetch1D( isampler2D tex, uint index ) {\n\n\tuint width = uint( textureSize( tex, 0 ).x );\n\tuvec2 uv;\n\tuv.x = index % width;\n\tuv.y = index / width;\n\n\treturn texelFetch( tex, ivec2( uv ), 0 );\n\n}\n\nvec4 texelFetch1D( sampler2D tex, uint index ) {\n\n\tuint width = uint( textureSize( tex, 0 ).x );\n\tuvec2 uv;\n\tuv.x = index % width;\n\tuv.y = index / width;\n\n\treturn texelFetch( tex, ivec2( uv ), 0 );\n\n}\n\nvec4 textureSampleBarycoord( sampler2D tex, vec3 barycoord, uvec3 faceIndices ) {\n\n\treturn\n\t\tbarycoord.x texelFetch1D( tex, faceIndices.x ) +\n\t\tbarycoord.y * texelFetch1D( tex, faceIndices.y ) +\n\t\tbarycoord.z * texelFetch1D( tex, faceIndices.z );\n\n}\n\nvoid ndcToCameraRay(\n\tvec2 coord, mat4 cameraWorld, mat4 invProjectionMatrix,\n\tout vec3 rayOrigin, out vec3 rayDirection\n) {\n\n\t// get camera look direction and near plane for camera clipping\n\tvec4 lookDirection = cameraWorld * vec4( 0.0, 0.0, - 1.0, 0.0 );\n\tvec4 nearVector = invProjectionMatrix * vec4( 0.0, 0.0, - 1.0, 1.0 );\n\tfloat near = abs( nearVector.z / nearVector.w );\n\n\t// get the camera direction and position from camera matrices\n\tvec4 origin = cameraWorld * vec4( 0.0, 0.0, 0.0, 1.0 );\n\tvec4 direction = invProjectionMatrix * vec4( coord, 0.5, 1.0 );\n\tdirection /= direction.w;\n\tdirection = cameraWorld * direction - origin;\n\n\t// slide the origin along the ray until it sits at the near clip plane position\n\torigin.xyz += direction.xyz * near / dot( direction, lookDirection );\n\n\trayOrigin = origin.xyz;\n\trayDirection = direction.xyz;\n\n}\n`;\n","// Distance to Point\n\n/*\n Set of shader functions used for interacting with the packed BVH in a shader and sampling\n * VertexAttributeTextures. Provides distance query functions. See\n * [src/webgl/glsl](https://github.com/gkjohnson/three-mesh-bvh/tree/master/src/webgl/glsl)\n * for full implementations and declarations.\n \n Accessed as `BVHShaderGLSL.bvh_distance_functions`.\n \n @section Shader and Texture Packing API\n * @type {string}\n /\nexport const bvh_distance_functions = / glsl /`\n\nfloat dot2( vec3 v ) {\n\n\treturn dot( v, v );\n\n}\n\n// https://www.shadertoy.com/view/ttfGWl\nvec3 closestPointToTriangle( vec3 p, vec3 v0, vec3 v1, vec3 v2, out vec3 barycoord ) {\n\n vec3 v10 = v1 - v0;\n vec3 v21 = v2 - v1;\n vec3 v02 = v0 - v2;\n\n\tvec3 p0 = p - v0;\n\tvec3 p1 = p - v1;\n\tvec3 p2 = p - v2;\n\n vec3 nor = cross( v10, v02 );\n\n // method 2, in barycentric space\n vec3 q = cross( nor, p0 );\n float d = 1.0 / dot2( nor );\n float u = d dot( q, v02 );\n float v = d * dot( q, v10 );\n float w = 1.0 - u - v;\n\n\tif( u < 0.0 ) {\n\n\t\tw = clamp( dot( p2, v02 ) / dot2( v02 ), 0.0, 1.0 );\n\t\tu = 0.0;\n\t\tv = 1.0 - w;\n\n\t} else if( v < 0.0 ) {\n\n\t\tu = clamp( dot( p0, v10 ) / dot2( v10 ), 0.0, 1.0 );\n\t\tv = 0.0;\n\t\tw = 1.0 - u;\n\n\t} else if( w < 0.0 ) {\n\n\t\tv = clamp( dot( p1, v21 ) / dot2( v21 ), 0.0, 1.0 );\n\t\tw = 0.0;\n\t\tu = 1.0 - v;\n\n\t}\n\n\tbarycoord = vec3( u, v, w );\n return u * v1 + v * v2 + w * v0;\n\n}\n\nfloat distanceToTriangles(\n\t// geometry info and triangle range\n\tsampler2D positionAttr, usampler2D indexAttr, uint offset, uint count,\n\n\t// point and cut off range\n\tvec3 point, float closestDistanceSquared,\n\n\t// outputs\n\tinout uvec4 faceIndices, inout vec3 faceNormal, inout vec3 barycoord, inout float side, inout vec3 outPoint\n) {\n\n\tbool found = false;\n\tvec3 localBarycoord;\n\tfor ( uint i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\tuvec3 indices = uTexelFetch1D( indexAttr, i ).xyz;\n\t\tvec3 a = texelFetch1D( positionAttr, indices.x ).rgb;\n\t\tvec3 b = texelFetch1D( positionAttr, indices.y ).rgb;\n\t\tvec3 c = texelFetch1D( positionAttr, indices.z ).rgb;\n\n\t\t// get the closest point and barycoord\n\t\tvec3 closestPoint = closestPointToTriangle( point, a, b, c, localBarycoord );\n\t\tvec3 delta = point - closestPoint;\n\t\tfloat sqDist = dot2( delta );\n\t\tif ( sqDist < closestDistanceSquared ) {\n\n\t\t\t// set the output results\n\t\t\tclosestDistanceSquared = sqDist;\n\t\t\tfaceIndices = uvec4( indices.xyz, i );\n\t\t\tfaceNormal = normalize( cross( a - b, b - c ) );\n\t\t\tbarycoord = localBarycoord;\n\t\t\toutPoint = closestPoint;\n\t\t\tside = sign( dot( faceNormal, delta ) );\n\n\t\t}\n\n\t}\n\n\treturn closestDistanceSquared;\n\n}\n\nfloat distanceSqToBounds( vec3 point, vec3 boundsMin, vec3 boundsMax ) {\n\n\tvec3 clampedPoint = clamp( point, boundsMin, boundsMax );\n\tvec3 delta = point - clampedPoint;\n\treturn dot( delta, delta );\n\n}\n\nfloat distanceSqToBVHNodeBoundsPoint( vec3 point, sampler2D bvhBounds, uint currNodeIndex ) {\n\n\tuint cni2 = currNodeIndex * 2u;\n\tvec3 boundsMin = texelFetch1D( bvhBounds, cni2 ).xyz;\n\tvec3 boundsMax = texelFetch1D( bvhBounds, cni2 + 1u ).xyz;\n\treturn distanceSqToBounds( point, boundsMin, boundsMax );\n\n}\n\n// use a macro to hide the fact that we need to expand the struct into separate fields\n#define\\\n\tbvhClosestPointToPoint(\\\n\t\tbvh,\\\n\t\tpoint, maxDistance, faceIndices, faceNormal, barycoord, side, outPoint\\\n\t)\\\n\t_bvhClosestPointToPoint(\\\n\t\tbvh.position, bvh.index, bvh.bvhBounds, bvh.bvhContents,\\\n\t\tpoint, maxDistance, faceIndices, faceNormal, barycoord, side, outPoint\\\n\t)\n\nfloat _bvhClosestPointToPoint(\n\t// bvh info\n\tsampler2D bvh_position, usampler2D bvh_index, sampler2D bvh_bvhBounds, usampler2D bvh_bvhContents,\n\n\t// point to check\n\tvec3 point, float maxDistance,\n\n\t// output variables\n\tinout uvec4 faceIndices, inout vec3 faceNormal, inout vec3 barycoord,\n\tinout float side, inout vec3 outPoint\n ) {\n\n\t// stack needs to be twice as long as the deepest tree we expect because\n\t// we push both the left and right child onto the stack every traversal\n\tint pointer = 0;\n\tuint stack[ BVH_STACK_DEPTH ];\n\tstack[ 0 ] = 0u;\n\n\tfloat closestDistanceSquared = maxDistance * maxDistance;\n\tbool found = false;\n\twhile ( pointer > - 1 && pointer < BVH_STACK_DEPTH ) {\n\n\t\tuint currNodeIndex = stack[ pointer ];\n\t\tpointer --;\n\n\t\t// check if we intersect the current bounds\n\t\tfloat boundsHitDistance = distanceSqToBVHNodeBoundsPoint( point, bvh_bvhBounds, currNodeIndex );\n\t\tif ( boundsHitDistance > closestDistanceSquared ) {\n\n\t\t\tcontinue;\n\n\t\t}\n\n\t\tuvec2 boundsInfo = uTexelFetch1D( bvh_bvhContents, currNodeIndex ).xy;\n\t\tbool isLeaf = bool( boundsInfo.x & 0xffff0000u );\n\t\tif ( isLeaf ) {\n\n\t\t\tuint count = boundsInfo.x & 0x0000ffffu;\n\t\t\tuint offset = boundsInfo.y;\n\t\t\tclosestDistanceSquared = distanceToTriangles(\n\t\t\t\tbvh_position, bvh_index, offset, count, point, closestDistanceSquared,\n\n\t\t\t\t// outputs\n\t\t\t\tfaceIndices, faceNormal, barycoord, side, outPoint\n\t\t\t);\n\n\t\t} else {\n\n\t\t\tuint leftIndex = currNodeIndex + 1u;\n\t\t\tuint splitAxis = boundsInfo.x & 0x0000ffffu;\n\t\t\tuint rightIndex = currNodeIndex + boundsInfo.y;\n\t\t\tbool leftToRight = distanceSqToBVHNodeBoundsPoint( point, bvh_bvhBounds, leftIndex ) < distanceSqToBVHNodeBoundsPoint( point, bvh_bvhBounds, rightIndex );//rayDirection[ splitAxis ] >= 0.0;\n\t\t\tuint c1 = leftToRight ? leftIndex : rightIndex;\n\t\t\tuint c2 = leftToRight ? rightIndex : leftIndex;\n\n\t\t\t// set c2 in the stack so we traverse it later. We need to keep track of a pointer in\n\t\t\t// the stack while we traverse. The second pointer added is the one that will be\n\t\t\t// traversed first\n\t\t\tpointer ++;\n\t\t\tstack[ pointer ] = c2;\n\t\t\tpointer ++;\n\t\t\tstack[ pointer ] = c1;\n\n\t\t}\n\n\t}\n\n\treturn sqrt( closestDistanceSquared );\n\n}\n`;\n","/*\n Set of shader functions used for interacting with the packed BVH in a shader and sampling\n * VertexAttributeTextures. Provides ray intersection functions. See\n * [src/webgl/glsl](https://github.com/gkjohnson/three-mesh-bvh/tree/master/src/webgl/glsl)\n * for full implementations and declarations.\n \n Accessed as `BVHShaderGLSL.bvh_ray_functions`.\n \n @section Shader and Texture Packing API\n * @type {string}\n /\nexport const bvh_ray_functions = / glsl /`\n\n#ifndef TRI_INTERSECT_EPSILON\n#define TRI_INTERSECT_EPSILON 1e-5\n#endif\n\n// Raycasting\nbool intersectsBounds( vec3 rayOrigin, vec3 rayDirection, vec3 boundsMin, vec3 boundsMax, out float dist ) {\n\n\t// https://www.reddit.com/r/opengl/comments/8ntzz5/fast_glsl_ray_box_intersection/\n\t// https://tavianator.com/2011/ray_box.html\n\tvec3 invDir = 1.0 / rayDirection;\n\n\t// find intersection distances for each plane\n\tvec3 tMinPlane = invDir ( boundsMin - rayOrigin );\n\tvec3 tMaxPlane = invDir * ( boundsMax - rayOrigin );\n\n\t// get the min and max distances from each intersection\n\tvec3 tMinHit = min( tMaxPlane, tMinPlane );\n\tvec3 tMaxHit = max( tMaxPlane, tMinPlane );\n\n\t// get the furthest hit distance\n\tvec2 t = max( tMinHit.xx, tMinHit.yz );\n\tfloat t0 = max( t.x, t.y );\n\n\t// get the minimum hit distance\n\tt = min( tMaxHit.xx, tMaxHit.yz );\n\tfloat t1 = min( t.x, t.y );\n\n\t// set distance to 0.0 if the ray starts inside the box\n\tdist = max( t0, 0.0 );\n\n\treturn t1 >= dist;\n\n}\n\nbool intersectsTriangle(\n\tvec3 rayOrigin, vec3 rayDirection, vec3 a, vec3 b, vec3 c,\n\tout vec3 barycoord, out vec3 norm, out float dist, out float side\n) {\n\n\t// https://stackoverflow.com/questions/42740765/intersection-between-line-and-triangle-in-3d\n\tvec3 edge1 = b - a;\n\tvec3 edge2 = c - a;\n\tnorm = cross( edge1, edge2 );\n\n\tfloat det = - dot( rayDirection, norm );\n\tfloat invdet = 1.0 / det;\n\n\tvec3 AO = rayOrigin - a;\n\tvec3 DAO = cross( AO, rayDirection );\n\n\tvec4 uvt;\n\tuvt.x = dot( edge2, DAO ) * invdet;\n\tuvt.y = - dot( edge1, DAO ) * invdet;\n\tuvt.z = dot( AO, norm ) * invdet;\n\tuvt.w = 1.0 - uvt.x - uvt.y;\n\n\t// set the hit information\n\tbarycoord = uvt.wxy; // arranged in A, B, C order\n\tdist = uvt.z;\n\tside = sign( det );\n\tnorm = side * normalize( norm );\n\n\t// add an epsilon to avoid misses between triangles\n\tuvt += vec4( TRI_INTERSECT_EPSILON );\n\n\treturn all( greaterThanEqual( uvt, vec4( 0.0 ) ) );\n\n}\n\nbool intersectTriangles(\n\t// geometry info and triangle range\n\tsampler2D positionAttr, usampler2D indexAttr, uint offset, uint count,\n\n\t// ray\n\tvec3 rayOrigin, vec3 rayDirection,\n\n\t// outputs\n\tinout float minDistance, inout uvec4 faceIndices, inout vec3 faceNormal, inout vec3 barycoord,\n\tinout float side, inout float dist\n) {\n\n\tbool found = false;\n\tvec3 localBarycoord, localNormal;\n\tfloat localDist, localSide;\n\tfor ( uint i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\tuvec3 indices = uTexelFetch1D( indexAttr, i ).xyz;\n\t\tvec3 a = texelFetch1D( positionAttr, indices.x ).rgb;\n\t\tvec3 b = texelFetch1D( positionAttr, indices.y ).rgb;\n\t\tvec3 c = texelFetch1D( positionAttr, indices.z ).rgb;\n\n\t\tif (\n\t\t\tintersectsTriangle( rayOrigin, rayDirection, a, b, c, localBarycoord, localNormal, localDist, localSide )\n\t\t\t&& localDist < minDistance\n\t\t) {\n\n\t\t\tfound = true;\n\t\t\tminDistance = localDist;\n\n\t\t\tfaceIndices = uvec4( indices.xyz, i );\n\t\t\tfaceNormal = localNormal;\n\n\t\t\tside = localSide;\n\t\t\tbarycoord = localBarycoord;\n\t\t\tdist = localDist;\n\n\t\t}\n\n\t}\n\n\treturn found;\n\n}\n\nbool intersectsBVHNodeBounds( vec3 rayOrigin, vec3 rayDirection, sampler2D bvhBounds, uint currNodeIndex, out float dist ) {\n\n\tuint cni2 = currNodeIndex * 2u;\n\tvec3 boundsMin = texelFetch1D( bvhBounds, cni2 ).xyz;\n\tvec3 boundsMax = texelFetch1D( bvhBounds, cni2 + 1u ).xyz;\n\treturn intersectsBounds( rayOrigin, rayDirection, boundsMin, boundsMax, dist );\n\n}\n\n// use a macro to hide the fact that we need to expand the struct into separate fields\n#define\\\n\tbvhIntersectFirstHit(\\\n\t\tbvh,\\\n\t\trayOrigin, rayDirection, faceIndices, faceNormal, barycoord, side, dist\\\n\t)\\\n\t_bvhIntersectFirstHit(\\\n\t\tbvh.position, bvh.index, bvh.bvhBounds, bvh.bvhContents,\\\n\t\trayOrigin, rayDirection, faceIndices, faceNormal, barycoord, side, dist\\\n\t)\n\nbool _bvhIntersectFirstHit(\n\t// bvh info\n\tsampler2D bvh_position, usampler2D bvh_index, sampler2D bvh_bvhBounds, usampler2D bvh_bvhContents,\n\n\t// ray\n\tvec3 rayOrigin, vec3 rayDirection,\n\n\t// output variables split into separate variables due to output precision\n\tinout uvec4 faceIndices, inout vec3 faceNormal, inout vec3 barycoord,\n\tinout float side, inout float dist\n) {\n\n\t// stack needs to be twice as long as the deepest tree we expect because\n\t// we push both the left and right child onto the stack every traversal\n\tint pointer = 0;\n\tuint stack[ BVH_STACK_DEPTH ];\n\tstack[ 0 ] = 0u;\n\n\tfloat triangleDistance = INFINITY;\n\tbool found = false;\n\twhile ( pointer > - 1 && pointer < BVH_STACK_DEPTH ) {\n\n\t\tuint currNodeIndex = stack[ pointer ];\n\t\tpointer --;\n\n\t\t// check if we intersect the current bounds\n\t\tfloat boundsHitDistance;\n\t\tif (\n\t\t\t! intersectsBVHNodeBounds( rayOrigin, rayDirection, bvh_bvhBounds, currNodeIndex, boundsHitDistance )\n\t\t\t\|\| boundsHitDistance > triangleDistance\n\t\t) {\n\n\t\t\tcontinue;\n\n\t\t}\n\n\t\tuvec2 boundsInfo = uTexelFetch1D( bvh_bvhContents, currNodeIndex ).xy;\n\t\tbool isLeaf = bool( boundsInfo.x & 0xffff0000u );\n\n\t\tif ( isLeaf ) {\n\n\t\t\tuint count = boundsInfo.x & 0x0000ffffu;\n\t\t\tuint offset = boundsInfo.y;\n\n\t\t\tfound = intersectTriangles(\n\t\t\t\tbvh_position, bvh_index, offset, count,\n\t\t\t\trayOrigin, rayDirection, triangleDistance,\n\t\t\t\tfaceIndices, faceNormal, barycoord, side, dist\n\t\t\t) \|\| found;\n\n\t\t} else {\n\n\t\t\tuint leftIndex = currNodeIndex + 1u;\n\t\t\tuint splitAxis = boundsInfo.x & 0x0000ffffu;\n\t\t\tuint rightIndex = currNodeIndex + boundsInfo.y;\n\n\t\t\tbool leftToRight = rayDirection[ splitAxis ] >= 0.0;\n\t\t\tuint c1 = leftToRight ? leftIndex : rightIndex;\n\t\t\tuint c2 = leftToRight ? rightIndex : leftIndex;\n\n\t\t\t// set c2 in the stack so we traverse it later. We need to keep track of a pointer in\n\t\t\t// the stack while we traverse. The second pointer added is the one that will be\n\t\t\t// traversed first\n\t\t\tpointer ++;\n\t\t\tstack[ pointer ] = c2;\n\n\t\t\tpointer ++;\n\t\t\tstack[ pointer ] = c1;\n\n\t\t}\n\n\t}\n\n\treturn found;\n\n}\n`;\n","// Note that a struct cannot be used for the hit record including faceIndices, faceNormal, barycoord,\n// side, and dist because on some mobile GPUS (such as Adreno) numbers are afforded less precision specifically\n// when in a struct leading to inaccurate hit results. See KhronosGroup/WebGL#3351 for more details.\n\n/*\n Set of shader structs and defined constants used for interacting with the packed BVH in a\n * shader. See [src/webgl/glsl/bvh_struct_definitions.glsl.js](https://github.com/gkjohnson/three-mesh-bvh/blob/master/src/webgl/glsl/bvh_struct_definitions.glsl.js)\n * for full implementations and declarations.\n \n Accessed as `BVHShaderGLSL.bvh_struct_definitions`.\n \n @section Shader and Texture Packing API\n * @type {string}\n /\nexport const bvh_struct_definitions = / glsl /`\nstruct BVH {\n\n\tusampler2D index;\n\tsampler2D position;\n\n\tsampler2D bvhBounds;\n\tusampler2D bvhContents;\n\n};\n`;\n","export from './core/BVH.js';\nexport * from './core/GeometryBVH.js';\nexport * from './core/MeshBVH.js';\nexport * from './core/LineBVH.js';\nexport * from './core/PointsBVH.js';\nexport * from './core/ObjectBVH.js';\nexport * from './core/SkinnedMeshBVH.js';\nexport * from './objects/BVHHelper.js';\nexport { CENTER, AVERAGE, SAH, NOT_INTERSECTED, INTERSECTED, CONTAINED, SKIP_GENERATION } from './core/Constants.js';\nexport { getBVHExtremes, estimateMemoryInBytes, getJSONStructure, validateBounds } from './debug/Debug.js';\nexport * from './utils/ExtensionUtilities.js';\nexport { getTriangleHitPointInfo } from './utils/TriangleUtilities.js';\nexport * from './math/ExtendedTriangle.js';\nexport * from './math/OrientedBox.js';\nexport * from './webgl/MeshBVHUniformStruct.js';\nexport * from './webgl/VertexAttributeTexture.js';\nexport * from './utils/StaticGeometryGenerator.js';\nexport * as BVHShaderGLSL from './webgl/BVHShaderGLSL.js';\n\n// backwards compatibility\nimport * as BVHShaderGLSL from './webgl/BVHShaderGLSL.js';\nexport const shaderStructs = BVHShaderGLSL.bvh_struct_definitions;\nexport const shaderDistanceFunction = BVHShaderGLSL.bvh_distance_functions;\nexport const shaderIntersectFunction = `\n\t${ BVHShaderGLSL.common_functions }\n\t${ BVHShaderGLSL.bvh_ray_functions }\n`;\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47],"mappings":";AAuDA,IAAa,IAA2B,MAO3B,IAAmB;AAGA,KAAoB;AAIpD,IAAa,IAA4B,KAAG,KAE/B,IAAkB,OAAQ,kBAAmB,EAE7C,IAAkB;CAC9B,UAAA;CACA,UAAU;CACV,gBAAgB;CAChB,sBAAsB;CACtB,gBAAgB;CAChB,YAAY;CACZ,UAAU;CACV,SAAS;CACT,OAAO;EACL,IAAmB;CACrB;;;ACpFD,SAAgB,EAAY,GAAa,GAAO,GAAS;AAUxD,QARA,EAAO,IAAI,IAAI,EAAO,IACtB,EAAO,IAAI,IAAI,EAAO,IAAc,IACpC,EAAO,IAAI,IAAI,EAAO,IAAc,IAEpC,EAAO,IAAI,IAAI,EAAO,IAAc,IACpC,EAAO,IAAI,IAAI,EAAO,IAAc,IACpC,EAAO,IAAI,IAAI,EAAO,IAAc,IAE7B;;AAWR,SAAgB,EAAqB,GAAS;CAE7C,IAAI,IAAc,IACd,IAAY;AAEhB,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;EAE9B,IAAM,IAAO,EAAQ,IAAI,KAAM,EAAQ;AACvC,EAAK,IAAO,MAEX,IAAY,GACZ,IAAc;;AAMhB,QAAO;;AAKR,SAAgB,EAAY,GAAQ,GAAS;AAE5C,GAAO,IAAK,EAAQ;;AAKrB,SAAgB,EAAa,GAAG,GAAG,GAAS;CAE3C,IAAI,GAAM;AACV,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;EAE9B,IAAM,IAAK,IAAI;AAUf,EAPA,IAAO,EAAG,IACV,IAAO,EAAG,IACV,EAAQ,KAAM,IAAO,IAAO,IAAO,GAGnC,IAAO,EAAG,IACV,IAAO,EAAG,IACV,EAAQ,KAAO,IAAO,IAAO,IAAO;;;AAOtC,SAAgB,EAAyB,GAAY,GAAiB,GAAS;AAE9E,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;EAE9B,IAAM,IAAU,EAAiB,IAAa,IAAI,IAC5C,IAAQ,EAAiB,IAAa,IAAI,IAAI,IAE9C,IAAO,IAAU,GACjB,IAAO,IAAU;AAQvB,EANK,IAAO,EAAQ,OAEnB,EAAQ,KAAM,IAIV,IAAO,EAAQ,IAAI,OAEvB,EAAQ,IAAI,KAAM;;;AASrB,SAAgB,EAAoB,GAAS;CAE5C,IAAM,IAAK,EAAQ,KAAM,EAAQ,IAC3B,IAAK,EAAQ,KAAM,EAAQ,IAC3B,IAAK,EAAQ,KAAM,EAAQ;AAEjC,QAAO,KAAM,IAAK,IAAK,IAAK,IAAK,IAAK;;;;ACvGvC,SAAgB,EAAS,GAAK,GAAc;AAE3C,QAAO,EAAa,IAAM,QAAS;;AAIpC,SAAgB,EAAQ,GAAK,GAAc;AAE1C,QAAO,EAAa,IAAM;;AAI3B,SAAgB,EAAO,GAAK,GAAc;AAEzC,QAAO,EAAa,IAAM;;AAK3B,SAAgB,EAAW,GAAM;AAEhC,QAAO,IAAA;;AAKR,SAAgB,EAAY,GAAK,GAAc;AAI9C,QAAO,IADgB,EAAa,IAAM,KAAA;;AAK3C,SAAgB,EAAY,GAAK,GAAc;AAE9C,QAAO,EAAa,IAAM;;AAI3B,SAAgB,EAAqB,GAAM;AAE1C,QAAO;;;;ACzCR,SAAgB,EAAW,GAAiB,GAAQ,GAAO,GAAQ,GAAiB;CAEnF,IAAI,IAAO,UACP,IAAO,UACP,IAAO,UACP,IAAO,WACP,IAAO,WACP,IAAO,WAEP,IAAQ,UACR,IAAQ,UACR,IAAQ,UACR,IAAQ,WACR,IAAQ,WACR,IAAQ,WAEN,IAAe,EAAgB,UAAU;AAC/C,MAAM,IAAI,KAAM,IAAS,KAAiB,GAAG,KAAQ,IAAS,IAAQ,KAAiB,GAAG,IAAI,GAAK,KAAK,GAAI;EAE3G,IAAM,IAAK,EAAiB,IAAI,IAC1B,IAAK,EAAiB,IAAI,IAC1B,IAAK,IAAK,GACV,IAAK,IAAK;AAIhB,EAHK,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAQ,IAAQ,IACrB,IAAK,MAAQ,IAAQ;EAE1B,IAAM,IAAK,EAAiB,IAAI,IAC1B,IAAK,EAAiB,IAAI,IAC1B,IAAK,IAAK,GACV,IAAK,IAAK;AAIhB,EAHK,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAQ,IAAQ,IACrB,IAAK,MAAQ,IAAQ;EAE1B,IAAM,IAAK,EAAiB,IAAI,IAC1B,IAAK,EAAiB,IAAI,IAC1B,IAAK,IAAK,GACV,IAAK,IAAK;AAIhB,EAHK,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAQ,IAAQ,IACrB,IAAK,MAAQ,IAAQ;;AAkB3B,CAdA,EAAQ,KAAM,GACd,EAAQ,KAAM,GACd,EAAQ,KAAM,GAEd,EAAQ,KAAM,GACd,EAAQ,KAAM,GACd,EAAQ,KAAM,GAEd,EAAgB,KAAM,GACtB,EAAgB,KAAM,GACtB,EAAgB,KAAM,GAEtB,EAAgB,KAAM,GACtB,EAAgB,KAAM,GACtB,EAAgB,KAAM;;;;AC9DvB,IAAM,IAAY,IACZ,MAAa,GAAG,MAAO,EAAE,YAAY,EAAE,WACvC,IAA0B,gBAAI,MAAO,EAAW,CAAC,MAAM,CAAC,WAEtD;CAEN,OAAO;CACP,QAAQ,IAAI,aAAc,EAAG;CAC7B,kBAAkB,IAAI,aAAc,EAAG;CACvC,iBAAiB,IAAI,aAAc,EAAG;CACtC,WAAW;CAEX,EAEC,EACG,qBAA6B,IAAI,aAAc,EAAG;AAExD,SAAgB,GAAiB,GAAkB,GAAsB,GAAiB,GAAQ,GAAO,GAAW;CAEnH,IAAI,IAAO,IACP,IAAM;AAGV,KAAK,MAAA,EAGJ,CADA,IAAO,EAAqB,EAAsB,EAC7C,MAAS,OAEb,KAAQ,EAAsB,KAAS,EAAsB,IAAO,MAAQ;UAIlE,MAAA,EAGX,CADA,IAAO,EAAqB,EAAkB,EACzC,MAAS,OAEb,IAAM,GAAY,GAAiB,GAAQ,GAAO,EAAM;UAI9C,MAAA,GAAmB;EAE9B,IAAM,IAAkB,EAAoB,EAAkB,EAC1D,IAAW,IAA2B,GAGpC,IAAe,EAAgB,UAAU,GACzC,KAAW,IAAS,KAAiB,GACrC,KAAS,IAAS,IAAQ,KAAiB;AACjD,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAW,EAAsB,IAGjC,KAFY,EAAsB,IAAI,KACb,KACD;AAI9B,OAAK,IAAQ,IAAY,GAAI;IAG5B,IAAM,IAAgB,CAAE,GAAG,EAAS;AACpC,MAAc,SAAS;IAGvB,IAAI,IAAI;AACR,SAAM,IAAI,IAAI,GAAQ,IAAI,GAAM,KAAK,GAAG,KAAO;KAE9C,IAAM,IAAM,EAAe;AAE3B,KADA,EAAI,YAAY,EAAiB,IAAI,IAAI,IACzC,EAAI,QAAQ;KAEZ,IAAM,EACL,WACA,oBACA,wBACG;AACJ,UAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IASvB,CAPA,EAAkB,KAAM,UACxB,EAAkB,IAAI,KAAM,WAE5B,EAAiB,KAAM,UACvB,EAAiB,IAAI,KAAM,WAE3B,EAAQ,KAAM,UACd,EAAQ,IAAI,KAAM;AAInB,OAAyB,GAAG,GAAiB,EAAQ;;AAItD,MAAc,KAAM,GAAU;IAG9B,IAAI,IAAa;AACjB,SAAM,IAAI,IAAK,GAAG,IAAK,GAAY,KAAQ;KAE1C,IAAM,IAAM,EAAe;AAC3B,YAAQ,IAAK,IAAI,KAAc,EAAe,IAAK,GAAI,cAAc,EAAI,WAGxE,CADA,EAAc,OAAQ,IAAK,GAAG,EAAG,EACjC;;AAOF,SAAM,IAAI,IAAI,GAAQ,IAAI,GAAM,KAAK,GAAI;KAExC,IAAM,IAAS,EAAiB,IAAI,IAAI;AACxC,UAAM,IAAI,IAAK,GAAG,IAAK,GAAY,KAAQ;MAE1C,IAAM,IAAM,EAAe;AAC3B,MAAK,KAAU,EAAI,YAElB,EAAyB,GAAG,GAAiB,EAAI,iBAAkB,IAInE,EAAyB,GAAG,GAAiB,EAAI,gBAAiB,EAClE,EAAI;;;AASP,SAAM,IAAI,IAAK,GAAG,IAAK,GAAY,KAAQ;KAE1C,IAAM,IAAM,EAAe,IACrB,IAAY,EAAI,OAChB,IAAa,IAAQ,EAAI,OAGzB,IAAa,EAAI,iBACjB,IAAc,EAAI,kBAEpB,IAAW;AACf,KAAK,MAAc,MAElB,IAAW,EAAoB,EAAY,GAAG;KAI/C,IAAI,IAAY;AAChB,KAAK,MAAe,MAEnB,IAAY,EAAoB,EAAa,GAAG;KAIjD,IAAM,IAAA,IAAwB,KAC7B,IAAW,IAAY,IAAY;AAGpC,KAAK,IAAO,MAEX,IAAO,GACP,IAAW,GACX,IAAM,EAAI;;UAMN;AAGN,SAAM,IAAI,IAAI,GAAG,IAAI,GAAW,KAAO;KAEtC,IAAM,IAAM,EAAS;AAErB,KADA,EAAI,QAAQ,GACZ,EAAI,YAAY,IAAW,IAAW,IAAI;KAE1C,IAAM,IAAS,EAAI;AACnB,UAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IAGvB,CADA,EAAQ,KAAM,UACd,EAAQ,IAAI,KAAM;;AAOpB,SAAM,IAAI,IAAI,GAAQ,IAAI,GAAM,KAAK,GAAI;KAOxC,IAAI,IAAW,CAAE,GALC,EAAiB,IAAI,IAAI,KACR,KAIG;AACtC,KAAK,KAAY,MAAY,IAAW,IAAY;KAEpD,IAAM,IAAM,EAAS;AAGrB,KAFA,EAAI,SAEJ,EAAyB,GAAG,GAAiB,EAAI,OAAQ;;IAK1D,IAAM,IAAU,EAAS,IAAY;AACrC,MAAY,EAAQ,QAAQ,EAAQ,iBAAkB;AACtD,SAAM,IAAI,IAAI,IAAY,GAAG,KAAK,GAAG,KAAO;KAE3C,IAAM,IAAM,EAAS,IACf,IAAU,EAAS,IAAI;AAC7B,OAAa,EAAI,QAAQ,EAAQ,kBAAkB,EAAI,iBAAkB;;IAI1E,IAAI,IAAY;AAChB,SAAM,IAAI,IAAI,GAAG,IAAI,IAAY,GAAG,KAAO;KAE1C,IAAM,IAAM,EAAS,IACf,IAAW,EAAI,OACf,IAAS,EAAI,QAGb,IADU,EAAS,IAAI,GACD;AAiB5B,KAdK,MAAa,MAEZ,MAAc,IAElB,EAAY,GAAQ,GAAY,GAIhC,EAAa,GAAQ,IAAY,GAAY,GAM/C,KAAa;KAGb,IAAI,IAAW,GACX,IAAY;AAEhB,KAAK,MAAc,MAElB,IAAW,EAAoB,GAAY,GAAG;KAI/C,IAAM,IAAa,IAAQ;AAC3B,KAAK,MAAe,MAEnB,IAAY,EAAoB,EAAa,GAAG;KAIjD,IAAM,IAAA,IAAwB,KAC7B,IAAW,IAAY,IAAY;AAGpC,KAAK,IAAO,MAEX,IAAO,GACP,IAAW,GACX,IAAM,EAAI;;;;OAYd,SAAQ,KAAM,qCAAsC,EAAU,QAAS;AAIxE,QAAO;EAAE;EAAM;EAAK;;AAKrB,SAAS,GAAY,GAAiB,GAAQ,GAAO,GAAO;CAE3D,IAAI,IAAM,GACJ,IAAe,EAAgB;AACrC,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,IAEpD,MAAO,GAAmB,IAAI,KAAiB,IAAI,IAAO;AAI3D,QAAO,IAAM;;;;AClTd,IAAa,KAAb,MAAqB;CAEpB,cAAc;AAKb,OAAK,eAAe,IAAI,aAAc,EAAG;;;;;ACJ3C,SAAgB,GAAW,GAAQ,GAAQ,GAAiB,GAAQ,GAAO,GAAQ;CAElF,IAAI,IAAO,GACP,IAAQ,IAAS,IAAQ,GACvB,IAAM,EAAM,KACZ,IAAa,EAAM,OAAO,GAC1B,IAAe,EAAgB,UAAU;AAG/C,UAAe;AAEd,SAAQ,KAAQ,KAAS,GAAmB,IAAO,KAAiB,IAAI,KAAe,GAEtF;AAKD,SAAQ,KAAQ,KAAS,GAAmB,IAAQ,KAAiB,IAAI,MAAgB,GAExF;AAID,MAAK,IAAO,GAAQ;AAInB,QAAM,IAAI,IAAI,GAAG,IAAI,GAAQ,KAAO;IAEnC,IAAI,IAAK,EAAQ,IAAO,IAAS;AAEjC,IADA,EAAQ,IAAO,IAAS,KAAM,EAAQ,IAAQ,IAAS,IACvD,EAAQ,IAAQ,IAAS,KAAM;;AAKhC,QAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;IAE9B,IAAM,IAAI,IAAO,GACX,IAAI,IAAQ,GACZ,IAAK,EAAiB,IAAI,IAAI;AAEpC,IADA,EAAiB,IAAI,IAAI,KAAM,EAAiB,IAAI,IAAI,IACxD,EAAiB,IAAI,IAAI,KAAM;;AAKhC,GADA,KACA;QAIA,QAAO;;;;;ACrDV,IAAI,IAAc,IAAa,IAAa,IACtC,KAAwB,KAAG;AAEjC,SAAgB,GAAY,GAAO;AAQjC,QANI,WAAW,IAER,IAIA,IAAI,GAAY,EAAK,KAAM,GAAG,GAAY,EAAK,MAAO;;AAM/D,SAAgB,GAAgB,GAAY,GAAM,GAAS;AAO1D,QALA,KAAe,IAAI,aAAc,EAAQ,EACzC,KAAc,IAAI,YAAa,EAAQ,EACvC,KAAc,IAAI,YAAa,EAAQ,EACvC,KAAa,IAAI,WAAY,EAAQ,EAE9B,GAAiB,GAAY,EAAM;;AAQ3C,SAAS,GAAiB,GAAY,GAAO;CAE5C,IAAM,IAAc,IAAa,GAC3B,IAAc,IAAa,GAC3B,IAAS,WAAW,GACpB,IAAe,EAAK;AAC1B,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IAEvB,IAAc,IAAc,KAAM,EAAc;AAIjD,KAAK,EAYH,QAVI,EAAK,UAET,GAAW,IAAK,IAAI,WAAY,EAAK,OAAQ,EAAE,EAAY,EACpD,IAAa,EAAK,OAAO,eAIhC,GAAa,IAAc,KAAM,EAAK,QACtC,GAAa,IAAc,MAAO,EAAK,OACvC,GAAa,IAAc,MAAO,GAC3B,IAAA;CAIF;EAEN,IAAM,EAAE,SAAM,UAAO,iBAAc,GAI/B,IAAkB,GADC,IAAA,IACgC,EAAM,EAGvD,IAAmB,IAAA,IAEnB,IADiB,IAAA,KACqB;AAG5C,MAAK,IAAqB,GAEzB,OAAU,MAAO,yEAA0E;AAS5F,SAJA,GAAa,IAAc,KAAM,GACjC,GAAa,IAAc,KAAM,GAG1B,GAAiB,GAAiB,EAAO;;;;;AC9ElD,SAAgB,GAAW,GAAK,GAAiB,GAAQ,GAAO,GAAS,GAAY;CAGpF,IAAM,EACL,aACA,YACA,mBACA,qBAAkB,UAClB,aACA,kBACG,GAEE,IAAkB,EAAI,iBACtB,IAAkB,EAAI,uBAGtB,IAA4B,IAAI,aAAc,EAAG,EACnD,IAAkB,IAEhB,IAAO,IAAI,IAAS;AAG1B,QAFA,EAAW,GAAiB,GAAQ,GAAO,EAAK,cAAc,EAA2B,EACzF,EAAW,GAAM,GAAQ,GAAO,EAA2B,EACpD;CAEP,SAAS,EAAiB,GAAsB;AAE/C,EAAK,KAEJ,GAAc,IAAsB,EAAU,UAAW,EAAU,MAAO;;CAQ5E,SAAS,EAAW,GAAM,GAAQ,GAAO,IAAuB,MAAM,IAAQ,GAAI;AAEjF,EAAK,CAAE,KAAmB,KAAS,MAElC,IAAkB,IACb,KAEJ,QAAQ,KAAM,qBAAsB,EAAU,6DAA8D;EAQ9G,IAAM,IAAY,IAAQ;AAG1B,MAAO,KAAS,KAAkB,CAAE,KAAe,KAAS,EAK3D,QAHA,EAAiB,IAAS,EAAO,EACjC,EAAK,SAAS,GACd,EAAK,QAAQ,GACN;EAKR,IAAM,IAAQ,GAAiB,EAAK,cAAc,GAAsB,GAAiB,GAAQ,GAAO,EAAU,EAC9G,IAAc,EAAM,SAAS,KAAM,KAAM,GAAW,GAAiB,GAAiB,GAAiB,GAAQ,GAAO,EAAO;AAKjI,MAAK,EAAM,SAAS,MAAO,MAAgB,KAAU,MAAgB,IAAS,GAAQ;AAErF,OAAK,CAAE,EAKN,QAHA,EAAiB,IAAS,EAAO,EACjC,EAAK,SAAS,GACd,EAAK,QAAQ,GACN;AAKR,GADA,EAAM,OAAO,KAAK,IAAK,GAAG,EAAqB,EAAK,aAAc,CAAE,EACpE,IAAc,IAAS,KAAK,IAAK,GAAG,KAAK,MAAO,IAAQ,EAAG,CAAE;;AAK9D,IAAK,YAAY,EAAM;EAGvB,IAAM,IAAO,IAAI,IAAS,EACpB,IAAS,GACT,IAAS,IAAc;AAI7B,EAHA,EAAK,OAAO,GAEZ,EAAW,GAAiB,GAAQ,GAAQ,EAAK,cAAc,EAA2B,EAC1F,EAAW,GAAM,GAAQ,GAAQ,GAA2B,IAAQ,EAAG;EAGvE,IAAM,IAAQ,IAAI,IAAS,EACrB,IAAS,GACT,IAAS,IAAQ;AAMvB,SALA,EAAK,QAAQ,GAEb,EAAW,GAAiB,GAAQ,GAAQ,EAAM,cAAc,EAA2B,EAC3F,EAAW,GAAO,GAAQ,GAAQ,GAA2B,IAAQ,EAAG,EAEjE;;;AAMT,SAAgB,GAAiB,GAAK,GAAU;CAE/C,IAAM,IAAoB,EAAQ,uBAAuB,oBAAoB,aAGvE,IAAa,EAAI,cAAe,EAAQ,MAAO,EAC/C,IAAa,EAAY,IACzB,IAAY,EAAY,EAAW,SAAS,IAC5C,IAAY;EACjB,QAAQ,EAAW;EACnB,OAAO,EAAU,SAAS,EAAU,QAAQ,EAAW;EACvD,EAGK,IAAkB,IAAI,aAAc,IAAI,EAAU,MAAO;AAK/D,CAJA,EAAgB,SAAS,EAAU,QACnC,EAAI,uBAAwB,EAAU,QAAQ,EAAU,OAAO,EAAiB,EAGhF,EAAI,SAAS,EAAW,KAAK,MAAS;EAErC,IAAM,IAAO,GAAW,GAAK,GAAiB,EAAM,QAAQ,EAAM,OAAO,GAAS,EAAW,EAEvF,IAAS,IAAI,EAAA,KADD,GAAY,EAAM,CAC8B;AAElE,SADA,GAAgB,GAAG,GAAM,EAAQ,EAC1B;GAEL;;;;ACrJJ,IAAa,KAAb,MAA2B;CAE1B,YAAa,GAAkB;AAG9B,EADA,KAAK,mBAAmB,GACxB,KAAK,cAAc,EAAE;;CAItB,eAAe;EAEd,IAAM,IAAa,KAAK;AAOvB,SANI,EAAW,WAAW,IAEnB,KAAK,kBAAkB,GAIvB,EAAW,KAAK;;CAMzB,iBAAkB,GAAY;AAE7B,OAAK,YAAY,KAAM,EAAW;;GCkBvB,oBAA8B,IA5C3C,MAAmB;CAElB,cAAc;AAIb,EAFA,KAAK,eAAe,MACpB,KAAK,cAAc,MACnB,KAAK,cAAc;EAEnB,IAAM,IAAQ,EAAE,EACZ,IAAa;AAgBjB,EAfA,KAAK,aAAY,MAAU;AAW1B,GATK,KAEJ,EAAM,KAAM,EAAY,EAIzB,IAAa,GACb,KAAK,eAAe,IAAI,aAAc,EAAQ,EAC9C,KAAK,cAAc,IAAI,YAAa,EAAQ,EAC5C,KAAK,cAAc,IAAI,YAAa,EAAQ;KAI7C,KAAK,oBAAoB;AAOxB,GALA,IAAa,MACb,KAAK,eAAe,MACpB,KAAK,cAAc,MACnB,KAAK,cAAc,MAEd,EAAM,WAAW,KAErB,KAAK,UAAW,EAAM,KAAK,CAAE;;;GAU4B,ECrCzD,GAAO,IACL,KAAW,EAAE,EACb,qBAA0B,IAAI,SAAqB,IAAI,GAAM,CAAE;AAErE,SAAgB,GAAW,GAAK,GAAM,GAAkB,GAAiB,GAAqB,GAAa;AAM1G,CAHA,IAAQ,GAAQ,cAAc,EAC9B,KAAQ,GAAQ,cAAc,EAC9B,GAAS,KAAM,GAAO,GAAO,EAC7B,EAAY,UAAW,EAAI,OAAQ,GAAQ;CAE3C,IAAM,IAAS,GAAmB,GAAG,EAAI,UAAU,GAAkB,GAAiB,GAAqB,EAAY;AAOvH,CAJA,EAAY,aAAa,EACzB,GAAQ,iBAAkB,EAAO,EACjC,GAAQ,iBAAkB,GAAO,EACjC,GAAS,KAAK,EACd,GAAS,KAAK;CAEd,IAAM,IAAS,GAAS;AAQxB,QAPK,IAAS,MAEb,KAAQ,GAAU,IAAS,IAC3B,IAAQ,GAAU,IAAS,KAIrB;;AAIR,SAAS,GACR,GACA,GACA,GACA,GACA,IAAgB,MAChB,IAAkB,GAClB,IAAQ,GACP;CAED,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAGhC,KADe,EAAS,GAAa,EAAa,EACpC;EAEb,IAAM,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa;AAE/C,SADA,EAAY,EAAqB,EAAa,EAAE,GAAc,EAAO,EAC9D,EAAqB,GAAQ,GAAO,IAAO,GAAO,IAAkB,IAAA,GAA+B,EAAO;QAE3G;EAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa,EAChD,IAAK,GACL,IAAK,GAEL,GAAQ,GACR,GAAM;AACV,MAAK,MAEJ,IAAO,GACP,IAAO,IAGP,EAAY,EAAqB,EAAI,EAAE,GAAc,EAAM,EAC3D,EAAY,EAAqB,EAAI,EAAE,GAAc,EAAM,EAE3D,IAAS,EAAe,EAAM,EAC9B,IAAS,EAAe,EAAM,EAEzB,IAAS,IAAS;AAGtB,GADA,IAAK,GACL,IAAK;GAEL,IAAM,IAAO;AAIb,GAHA,IAAS,GACT,IAAS,GAET,IAAO;;AAQT,EAAO,MAEN,IAAO,GACP,EAAY,EAAqB,EAAI,EAAE,GAAc,EAAM;EAI5D,IAAM,IAAW,EAAS,IAAK,GAAG,EAAa,EACzC,IAAiB,EAAsB,GAAM,GAAU,GAAQ,IAAQ,GAAG,IAAkB,IAAA,EAAsB,EAEpH;AACJ,MAAK,MAAA,GAA+B;GAEnC,IAAM,IAAS,EAAe,EAAI;AAIlC,OAAkB,EAAqB,GAH3B,GAAmB,EAAI,GACf,GAEkC,IAAM,IAAQ,GAAG,IAAkB,IAAA,GAAsB,EAAM;QAIrH,KACC,KACA,GACC,GACA,GACA,GACA,GACA,GACA,GACA,IAAQ,EACR;AAIH,MAAK,EAAkB,QAAO;AAK9B,EADA,IAAO,IACP,EAAY,EAAqB,EAAI,EAAE,GAAc,EAAM;EAE3D,IAAM,IAAW,EAAS,IAAK,GAAG,EAAa,EACzC,IAAiB,EAAsB,GAAM,GAAU,GAAQ,IAAQ,GAAG,IAAkB,IAAA,EAAsB,EAEpH;AACJ,MAAK,MAAA,GAA+B;GAEnC,IAAM,IAAS,EAAe,EAAI;AAIlC,OAAkB,EAAqB,GAH3B,GAAmB,EAAI,GACf,GAEkC,IAAM,IAAQ,GAAG,IAAkB,IAAA,GAAsB,EAAM;QAIrH,KACC,KACA,GACC,GACA,GACA,GACA,GACA,GACA,GACA,IAAQ,EACR;AAIH,MAAK,EAAkB,QAAO;AAE9B,SAAO;EAIP,SAAS,EAAe,GAAc;GAErC,IAAM,EAAE,gBAAa,mBAAgB,GACjC,IAAc,IAAc;AAGhC,UAAQ,CAAE,EAAS,GAAa,EAAa,EAG5C,CADA,IAAc,EAAW,EAAa,EACtC,IAAc,IAAc;AAI7B,UAAO,EAAQ,GAAa,EAAa;;EAI1C,SAAS,GAAmB,GAAc;GAEzC,IAAM,EAAE,gBAAa,mBAAgB,GACjC,IAAc,IAAc;AAGhC,UAAQ,CAAE,EAAS,GAAa,EAAa,EAI5C,CADA,IAAc,EAAY,GAAa,EAAa,EACpD,IAAc,IAAc;AAK7B,UAAO,EAAQ,GAAa,EAAa,GAAG,EAAO,GAAa,EAAa;;;;;;ACxMhF,IAAM,qBAAgC,IAAI,EAAY,aAAa,EAC7D,qBAAgC,IAAI,EAAY,aAAa,EAC7D,oBAA2B,IAAI,SAAqB,IAAI,GAAM,CAAE,EAChE,qBAA4B,IAAI,GAAM,EACtC,qBAA6B,IAAI,GAAM,EAEvC,qBAA4B,IAAI,GAAM,EACtC,qBAA6B,IAAI,GAAM,EAEzC,KAAU;AAEd,SAAgB,GAAS,GAAK,GAAU,GAAe,GAAmB;AAEzE,KAAK,GAEJ,OAAU,MAAO,qDAAsD;AAIxE,MAAU;CAEV,IAAM,IAAQ,EAAI,QACZ,IAAa,EAAS,QACxB,GACA,IAAc,GACd,IAAc,GACZ,IAAS,IAAI,GAAS,CAAC,KAAM,EAAe,CAAC,QAAQ;AAG3D,MAAM,IAAI,IAAI,GAAG,IAAK,EAAM,QAAQ,IAAI,GAAI,KAAO;AAGlD,EADA,GAAc,UAAW,EAAO,GAAK,EACrC,IAAc;EAGd,IAAM,IAAW,EAAS,cAAc;AAExC,EADA,EAAY,EAAqB,EAAG,EAAE,GAAc,cAAc,EAAU,EAC5E,EAAS,aAAc,EAAQ;AAG/B,OAAM,IAAI,IAAI,GAAG,IAAK,EAAW,QAAQ,IAAI,MAE5C,GAAc,UAAW,EAAY,GAAK,EAE1C,IAAS,EACR,GAAG,GAAG,GAAe,GAAQ,GAC7B,GAAa,GAAa,GAAG,GAC7B,EACA,EAED,GAAc,aAAa,EAC3B,KAAe,EAAY,GAAI,aAAA,IAE1B,KAb2C;AA0BjD,MAJA,EAAS,iBAAkB,EAAU,EACrC,GAAc,aAAa,EAC3B,KAAe,EAAO,GAAI,aAAA,IAErB,EAEJ;;AAOF,QADA,KAAU,IACH;;AAIR,SAAS,EACR,GACA,GACA,GACA,GACA,GAGA,IAAmB,GACnB,IAAmB,GAGnB,IAAS,GACT,IAAS,GAET,IAAU,MACV,IAAW,IAEV;CAGD,IAAI,GAAc;AAClB,CAAK,KAEJ,IAAe,IACf,IAAe,OAIf,IAAe,IACf,IAAe;CAKhB,IACC,IAAgB,EAAa,cAC7B,IAAe,EAAa,aAC5B,IAAe,EAAa,aAC5B,IAAgB,EAAa,cAC7B,IAAe,EAAa,aAC5B,IAAe,EAAa,aAEvB,IAAe,IAAe,GAC9B,IAAe,IAAe,GAC9B,IAAU,EAAS,GAAc,EAAc,EAC/C,IAAU,EAAS,GAAc,EAAc,EACjD,IAAS;AACb,KAAK,KAAW,EAKf,CAWC,IAXI,IAEK,EACR,EAAQ,GAAc,EAAc,EAAE,EAAO,IAAe,GAAG,EAAc,EAC7E,EAAQ,GAAc,EAAc,EAAE,EAAO,IAAe,GAAG,EAAc,EAC7E,GAAQ,IAAmB,IAAA,GAC3B,GAAQ,IAAmB,IAAA,EAC3B,GAIQ,EACR,EAAQ,GAAc,EAAc,EAAE,EAAO,IAAe,GAAG,EAAc,EAC7E,EAAQ,GAAc,EAAc,EAAE,EAAO,IAAe,GAAG,EAAc,EAC7E,GAAQ,IAAmB,IAAA,GAC3B,GAAQ,IAAmB,IAAA,EAC3B;UAIS,GAAU;EAOrB,IAAM,IAAS,EAAS,cAAc;AAEtC,EADA,EAAY,EAAqB,EAAc,EAAE,GAAe,EAAQ,EACxE,EAAO,aAAc,EAAY;EAGjC,IAAM,IAAM,EAAW,EAAc,EAC/B,IAAM,EAAY,GAAc,EAAc;AAEpD,EADA,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAW,EAClE,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAY;EAGnE,IAAM,IAAe,EAAO,cAAe,GAAW,EAChD,IAAe,EAAO,cAAe,GAAY;AAevD,EAdA,IACC,KAAgB,EACf,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,IAED,KAAgB,EACf,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,EAGF,EAAS,iBAAkB,EAAQ;QAE7B;EAMN,IAAM,IAAM,EAAW,EAAc,EAC/B,IAAM,EAAY,GAAc,EAAc;AAEpD,EADA,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAW,EAClE,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAY;EAEnE,IAAM,IAAiB,EAAQ,cAAe,GAAW,EACnD,IAAkB,EAAQ,cAAe,GAAY;AAC3D,MAAK,KAAkB,EAGtB,KAAS,EACR,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAS,EACT,IAAI,EACJ,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAS,EACT;WAEU,EAEX,KAAK,EAGJ,KAAS,EACR,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAS,EACT;OAEK;GAIN,IAAM,IAAS,EAAS,cAAc;AACtC,KAAO,KAAM,GAAW,CAAC,aAAc,EAAY;GAEnD,IAAM,IAAM,EAAW,EAAc,EAC/B,IAAM,EAAY,GAAc,EAAc;AAEpD,GADA,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAW,EAClE,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAY;GAGnE,IAAM,IAAe,EAAO,cAAe,GAAW,EAChD,IAAe,EAAO,cAAe,GAAY;AAevD,GAdA,IACC,KAAgB,EACf,GAAK,GAAK,GAAY,GAAY,GAClC,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,IAED,KAAgB,EACf,GAAK,GAAK,GAAY,GAAY,GAClC,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,EAGF,EAAS,iBAAkB,EAAQ;;WAIzB,EAEX,KAAK,EAGJ,KAAS,EACR,GAAc,GAAK,GAAY,GAAY,GAC3C,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAS,EACT;OAEK;GAIN,IAAM,IAAS,EAAS,cAAc;AACtC,KAAO,KAAM,GAAY,CAAC,aAAc,EAAY;GAEpD,IAAM,IAAM,EAAW,EAAc,EAC/B,IAAM,EAAY,GAAc,EAAc;AAEpD,GADA,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAW,EAClE,EAAY,EAAqB,EAAK,EAAE,GAAe,GAAY;GAGnE,IAAM,IAAe,EAAO,cAAe,GAAW,EAChD,IAAe,EAAO,cAAe,GAAY;AAevD,GAdA,IACC,KAAgB,EACf,GAAK,GAAK,GAAY,GAAY,GAClC,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,IAED,KAAgB,EACf,GAAK,GAAK,GAAY,GAAY,GAClC,GAAkB,GAAkB,GAAQ,IAAS,GACrD,GAAQ,CAAE,EACV,EAGF,EAAS,iBAAkB,EAAQ;;;AAQtC,QAAO;;;;ACvTR,IAAa,KAAqB,IAAM,MAAM;CAE7C,cAAc;EAEb,IAAI,IAAS,MACT,IAAc,MACd,IAAc,MACd,IAAa;AA6CjB,EA3CA,KAAK,OAAO,MACZ,KAAK,SAAS,MACd,KAAK,cAAc,MACnB,KAAK,cAAc,MAEnB,KAAK,UAAW,GAAK,MAAU;AAE9B,OAAK,EAEJ,OAAU,MAAO,qEAAsE;AAOxF,GAHA,KAAK,OAAO,GACZ,KAAK,SAAS,IAAS,EAAI,OAAQ,IACnC,KAAK,cAAc,IAAc,IAAI,YAAa,EAAQ,EAC1D,KAAK,cAAc,IAAc,IAAI,YAAa,EAAQ;KAI3D,KAAK,cAAc;AAKlB,GAHA,KAAK,OAAO,MACZ,KAAK,SAAS,IAAS,MACvB,KAAK,cAAc,IAAc,MACjC,KAAK,cAAc,IAAc;KAIlC,KAAK,iBAAgB,MAAe;GAEnC,IAAI,IAAc,IAAc;AAChC,UAAQ,CAAE,EAAS,GAAa,EAAa,EAG5C,CADA,IAAc,EAAW,EAAa,EACtC,IAAc,IAAc;AAI7B,UAAO,EAAQ,GAAa,EAAa;KAI1C,KAAK,eAAc,MAAe;GAEjC,IAAI,IAAc,IAAc;AAChC,UAAQ,CAAE,EAAS,GAAa,EAAa,EAG5C,CADA,IAAc,EAAY,GAAa,EAAa,EACpD,IAAc,IAAc;AAI7B,UAAO,EAAQ,GAAa,EAAa,GAAG,EAAO,GAAa,EAAa;;EAK9E,IAAM,KAAS,GAAU,GAAa,MAAW;GAGhD,IAAM,IAAS,EADK,IAAc,GACG,EAAa;AAElD,OAAK,CADiB,EAAU,GAAO,GAAQ,EAAa,IACpC,CAAE,GAAS;IAElC,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa;AAEpD,IADA,EAAM,GAAU,GAAM,IAAQ,EAAG,EACjC,EAAM,GAAU,GAAO,IAAQ,EAAG;;;AA2BpC,EArBA,KAAK,kBAAiB,MAAY;AAEjC,OAAK,EAEJ,OAAU,MAAO,2EAA4E;AAI9F,OAAa;AACb,OAAI;AAEH,MAAM,GAAU,GAAG,EAAG;aAEb;AAET,QAAa;;KAMf,KAAK,YAAW,MAAY;AAE3B,QAAK,gBAAkB,GAAO,GAAQ,MAAiB;AAEtD,QAAK,GAAS;KAEb,IAAM,IAAc,IAAc,GAC5B,IAAS,EAAa,IAAc,IACpC,IAAQ,EAAa,IAAc;AACzC,YAAO,EAAU,GAAO,GAAQ,IAAI,aAAc,GAAQ,IAAc,GAAG,EAAG,EAAE,GAAQ,EAAO;WAEzF;KAEN,IAAM,IAAY,EAAY,GAAa,EAAa;AACxD,YAAO,EAAU,GAAO,GAAQ,IAAI,aAAc,GAAQ,IAAc,GAAG,EAAG,EAAE,EAAW;;KAI1F;;;GAMD,ECxHC,qBAA2B,IAAI,GAAM,EACrC,qBAA8B,IAAI,aAAc,EAAG,EA+C5C,KAAb,MAAiB;CAEhB,cAAc;AAIb,EAFA,KAAK,SAAS,MACd,KAAK,kBAAkB,MACvB,KAAK,wBAAwB;;CAI9B,KAAM,GAAU;AAiBf,EAfA,IAAU;GACT,GAAG;GACH,GAAG;GACH,EAEI,iBAAiB,MAErB,QAAQ,KAAM,oFAAiF,EAC/F,IAAU;GACT,GAAG;GACH,gBAAgB,EAAQ;GACxB,GAIF,GAAiB,MAAM,EAAS;;CAIjC,gBAA6B;AAG5B,QAAU,MAAO,uCAAwC;;CAM1D,uBAAqD;AAEpD,QAAU,MAAO,8CAA+C;;CAMjE,0BAA2B,GAAQ,GAAO,GAAc,GAAY;EAGnE,IAAI,IAAO,UACP,IAAO,UACP,IAAO,UACP,IAAO,WACP,IAAO,WACP,IAAO;AAGX,OAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,KAAO;AAE3D,QAAK,qBAAsB,GAAG,IAAa,EAAG;GAG9C,IAAM,CAAE,GAAI,GAAI,GAAI,GAAI,GAAI,KAAO;AAMnC,GALK,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO,IACnB,IAAK,MAAO,IAAO;;AAYzB,SAPA,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,GAEzB;;CAIR,uBAAwB,GAAQ,GAAO,GAAe;EAErD,IAAM,IAAe,EAAa,UAAU;AAC5C,OAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,KAAO;AAE3D,QAAK,qBAAsB,GAAG,IAAa,EAAG;GAG9C,IAAM,CAAE,GAAI,GAAI,GAAI,GAAI,GAAI,KAAO,IAE7B,KAAO,IAAK,KAAO,GACnB,KAAO,IAAK,KAAO,GACnB,KAAO,IAAK,KAAO,GAEnB,KAAO,IAAK,KAAO,GACnB,KAAO,IAAK,KAAO,GACnB,KAAO,IAAK,KAAO,GAEnB,KAAc,IAAI,KAAiB;AAMzC,GALA,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,KAAO,KAAK,IAAK,EAAI,GAAG,KAAO,GAC/D,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,KAAO,KAAK,IAAK,EAAI,GAAG,KAAO,GAC/D,EAAc,IAAY,KAAM,GAChC,EAAc,IAAY,KAAM,KAAO,KAAK,IAAK,EAAI,GAAG,KAAO;;AAIhE,SAAO;;CASR,sBAAuB,GAAS;EAE/B,IAAM,IAAiB,KAAK;AAC5B,MAAK,EAGJ,MAAM,IAAI,IAAI,GAAG,IAAI,EAAe,QAAQ,IAAI,GAAG,IAElD,GAAgB,MAAO;OAIlB;GAGN,IAAM,IAAQ,KAAK;AACnB,QAAM,IAAI,IAAY,GAAG,IAAY,EAAM,QAAQ,KAAe;IAEjE,IAAM,IAAO,EAAO,IACd,IAAc,IAAI,YAAa,EAAM,EACrC,IAAc,IAAI,YAAa,EAAM,EACrC,IAAa,EAAK,aAAA;AACxB,SAAM,IAAI,IAAO,GAAG,IAAO,GAAY,KAAU;KAEhD,IAAM,IAAA,IAAgC;AAEtC,KAAK,EADe,IAAI,GACG,EAAa,KAGvC,EAAa,IAAc,MAAO;;;;;CAsBvC,SAAU,GAAU,IAAY,GAAI;AAInC,EAFA,GAAmB,OAAQ,MAAM,EAAW,EAC5C,GAAmB,SAAU,EAAU,EACvC,GAAmB,OAAO;;CAQ3B,QAAkC;EASjC,IAAM,IAAQ,KAAK;AACnB,OAAM,IAAI,IAAY,GAAG,IAAY,EAAM,QAAQ,IAAY,GAAW,KAAe;GAExF,IAAM,IAAS,EAAO,IAChB,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAe,IAAI,aAAc,EAAQ,EACzC,IAAa,EAAO,aAAA;AAG1B,QAAM,IAAI,IAAY,IAAa,GAAG,KAAa,GAAG,KAAe;IAEpE,IAAM,IAAc,IAAA,GACd,IAAc,IAAc;AAGlC,QAFe,EAAS,GAAa,EAAa,EAEpC;KAGb,IAAM,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa;AAI/C,KAHA,KAAK,0BAA2B,GAAQ,GAAO,IAAa,EAAG,EAG/D,EAAa,IAAK,IAAa,EAAa;WAEtC;KAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa;AAGpD,UAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;MAE9B,IAAM,IAAU,EAAc,IAAO,IAC/B,IAAU,EAAc,IAAO,IAAI,IACnC,IAAW,EAAc,IAAQ,IACjC,IAAW,EAAc,IAAQ,IAAI;AAG3C,MADA,EAAc,IAAc,KAAM,IAAU,IAAW,IAAU,GACjE,EAAc,IAAc,IAAI,KAAM,IAAU,IAAW,IAAU;;;;;;CAiB1E,eAAgB,GAAS;AAYxB,SAVA,EAAO,WAAW,EAEJ,KAAK,OACb,SAAS,MAAU;AAGxB,GADA,EAAY,GAAG,IAAI,aAAc,EAAQ,EAAE,GAAU,EACrD,EAAO,MAAO,GAAU;IAEtB,EAEI;;CAmBR,UAAW,GAAY;EAGtB,IAAI,EACH,wBACA,qBACA,oBACA,wBACA,qBACA,eACG;AAGJ,MAAK,KAAmB,GAAsB;GAE7C,IAAM,IAA0B;AAChC,QAAoB,GAAQ,GAAO,GAAW,GAAO,MAE7C,EAAyB,GAAQ,GAAO,GAAW,GAAO,EAAW,GAMrE,KAJC,EAAS,GAAQ,GAAO,MAAM,GAAqB,GAAW,GAAO,EAAkB;SAoB/F,MAVI,KAEgB,GAAQ,GAAO,GAAW,MAEtC,EAAS,GAAQ,GAAO,MAAM,GAAqB,GAAW,GAAO,EAAkB,IAM3E,GAAQ,GAAO,MAE3B;EASV,IAAI,IAAS,IACT,IAAa,GACX,IAAQ,KAAK;AACnB,OAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,KAAO;GAEhD,IAAM,IAAO,EAAO;AAGpB,OAFA,IAASA,GAAe,MAAM,GAAG,GAAkB,GAAiB,GAAqB,EAAY,EAEhG,EAEJ;AAID,QAAc,EAAK,aAAA;;AAIpB,SAAO;;CAeR,QAAS,GAAU,GAAe,GAAY;EAE7C,IAAI,EAAE,wBAAqB;AAC3B,SAAO,GAAS,MAAM,GAAU,GAAe,EAAkB;;;;;AC5anE,SAAgB,KAA+B;AAE9C,QAAO,OAAO,oBAAsB;;;;ACArC,SAAgB,GAAgB,GAAM;AAErC,QAAO,EAAI,QAAQ,EAAI,MAAM,QAAQ,EAAI,WAAW,SAAS;;AAI9D,SAAgB,GAAa,GAAM;AAElC,QAAO,GAAgB,EAAK,GAAG;;AAIhC,SAAgB,GAAe,GAAa,IAAoB,aAAc;AAQ5E,QANI,IAAc,QAEX,IAAI,YAAa,IAAI,EAAmB,IAAI,EAAa,CAAE,GAI3D,IAAI,YAAa,IAAI,EAAmB,IAAI,EAAa,CAAE;;AAOpE,SAAgB,GAAa,GAAK,GAAU;AAE3C,KAAK,CAAE,EAAI,OAAQ;EAElB,IAAM,IAAc,EAAI,WAAW,SAAS,OAEtC,IAAQ,GAAe,GADH,EAAQ,uBAAuB,oBAAoB,YAChB;AAC7D,IAAI,SAAU,IAAI,EAAiB,GAAO,EAAG,CAAE;AAE/C,OAAM,IAAI,IAAI,GAAG,IAAI,GAAa,IAEjC,GAAO,KAAM;;;AAmBhB,SAAS,GAAuB,GAAK,GAAO,GAAS;CAEpD,IAAM,IAAiB,GAAgB,EAAK,GAAG,GACzC,IAAY,KAAgB,EAAI,WAChC,IAAQ,EAAU,QAAQ,GAC1B,KAAQ,EAAU,QAAQ,EAAU,SAAU,GAE9C,IAAS,KAAK,IAAK,GAAG,EAAO,EAC7B,IAAQ,KAAK,IAAK,GAAgB,EAAK,GAAG;AAChD,QAAO;EACN,QAAQ,KAAK,MAAO,EAAQ;EAC5B,OAAO,KAAK,MAAO,EAAO;EAC1B;;AAIF,SAAS,GAAyB,GAAK,GAAS;AAE/C,QAAO,EAAI,OAAO,KAAK,OAAW;EACjC,QAAQ,EAAM,QAAQ;EACtB,OAAO,EAAM,QAAQ;EACrB,EAAG;;AAML,SAAgB,GAAwB,GAAK,GAAO,GAAS;CAE5D,IAAM,IAAY,GAAuB,GAAK,GAAO,EAAQ,EACvD,IAAkB,GAAyB,GAAK,EAAQ;AAC9D,KAAK,CAAE,EAAgB,OAEtB,QAAO,CAAE,EAAW;CAIrB,IAAM,IAAS,EAAE,EACX,IAAiB,EAAU,QAC3B,IAAe,EAAU,SAAS,EAAU,OAG5C,IAAiB,GAAgB,EAAK,GAAG,GACzC,IAAS,EAAE;AACjB,MAAM,IAAM,KAAS,GAAkB;EAGtC,IAAM,EAAE,WAAQ,aAAU,GACpB,IAAa,GAEb,IAAa,KADA,SAAU,EAAO,GAAG,IAAU,IAAiB;AAIlE,EAAK,IAAa,KAAgB,IAAW,MAE5C,EAAO,KAAM;GAAE,KAAK,KAAK,IAAK,GAAgB,EAAY;GAAE,SAAS;GAAM,CAAE,EAC7E,EAAO,KAAM;GAAE,KAAK,KAAK,IAAK,GAAc,EAAU;GAAE,SAAS;GAAO,CAAE;;AAO5E,GAAO,MAAQ,GAAG,MAEZ,EAAE,QAAQ,EAAE,MAMT,EAAE,SAAS,QAAQ,KAAM,IAJzB,EAAE,MAAM,EAAE,IAQhB;CAGH,IAAI,IAAe,GACf,IAAU;AACd,MAAM,IAAM,KAAS,GAAS;EAE7B,IAAM,IAAS,EAAM;AAWrB,EAVK,MAAiB,KAAK,MAAW,KAErC,EAAO,KAAM;GACZ,QAAQ;GACR,OAAO,IAAS;GAChB,CAAE,EAIJ,KAAgB,EAAM,UAAU,IAAI,IACpC,IAAU;;AAIX,QAAO;;;;ACpJR,SAAgB,GAAwB,GAAQ,GAAuB;CAEtE,IAAM,IAAY,EAAQ,EAAO,SAAS,IACpC,IAAY,EAAU,SAAS,EAAU,QAAQ,KAAK,IAGtD,IAAS,EAAO,QAAU,GAAK,MAAS,IAAM,EAAI,OAAO,EAAG,EAC5D,IAAY,IAAY,IAAI,GAC5B,IAAS,IAAuB,IAAI,kBAAmB,IAAS,EAAW,GAAG,IAAI,YAAa,IAAS,EAAW,EACnH,IAAiB,IAAY,IAAI,YAAa,EAAQ,GAAG,IAAI,YAAa,EAAQ,EAGpF,IAAQ;AACZ,MAAM,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,KAAO;EAE1C,IAAM,EAAE,WAAQ,aAAU,EAAQ;AAClC,OAAM,IAAI,IAAI,GAAG,IAAI,GAAO,IAE3B,GAAgB,IAAQ,KAAM,IAAS;AAIxC,OAAS;;AAIV,QAAO;;AAyBR,IAAa,KAAb,cAAiC,GAAI;CAOpC,IAAI,WAAW;AAEd,SAAO,CAAE,CAAE,KAAK;;CAIjB,IAAI,kBAAkB;AAErB,SAAO;;CAIR,IAAI,wBAAwB;AAE3B,SAAO,KAAK,WAAW,IAAI,KAAK;;CAGjC,IAAI,sBAAuB,GAAI;CAE/B,IAAI,kBAAkB;AAErB,SAAO,KAAK,WAAW,KAAK,kBAAkB,KAAK,SAAS,MAAM;;CAGnE,IAAI,gBAAiB,GAAI;CAEzB,YAAa,GAAU,IAAU,EAAE,EAAG;AAErC,MAAK,CAAE,EAAS,iBAEf,OAAU,MAAO,4CAA6C;MAEnD,EAAS,SAAS,EAAS,MAAM,6BAE5C,OAAU,MAAO,4EAA6E;AAI/F,MAAK,EAAQ,wBAAwB,CAAE,IAA8B,CAEpE,OAAU,MAAO,2CAA4C;AA0B9D,EAtBA,OAAO,EAUP,KAAK,WAAW,GAChB,KAAK,wBAAwB,EAAQ,YAAW,MAAK,KAAK,gBAAiB,MAAM,MAAK,GACtF,KAAK,kBAAkB,MACvB,KAAK,wBAAwB,MAC7B,KAAK,kBAAkB,MAEvB,IAAU;GACT,GAAG;GACH,GAAG;GACH,EAGM,EAAS,MAEf,KAAK,KAAM,EAAS;;CAMtB,KAAM,GAAU;EAEf,IAAM,EAAE,aAAU,uBAAoB;AAiBtC,EAfK,EAAQ,WAKZ,KAAK,kBADkB,GADR,GAAwB,GAAU,EAAQ,OAAO,EAAiB,EAC1B,EAAQ,qBAAsB,GAKrF,GAAa,GAAU,EAAS,EAIjC,MAAM,KAAM,EAAS,EAEhB,CAAE,EAAS,eAAe,EAAQ,mBAEtC,EAAS,cAAc,KAAK,eAAgB,IAAI,GAAM,CAAE;;CAO1D,cAAe,GAAQ;AAUrB,SAPI,KAAK,WAEF,CAAE;GAAE,QAAQ;GAAG,OAAO,KAAK,gBAAgB;GAAQ,CAAE,GAKrD,GAAwB,KAAK,UAAU,GAAO,KAAK,gBAAiB;;CAM7E,kBAA4D;AAE3D,QAAU,MAAO,yCAA0C;;GCxLhD,IAAb,MAAkC;CAEjC,cAAc;AAGb,EADA,KAAK,MAAM,UACX,KAAK,MAAM;;CAIZ,mBAAoB,GAAQ,GAAQ;EAEnC,IAAI,IAAM,UACN,IAAM;AACV,OAAM,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,IAAI,GAAG,KAAO;GAGjD,IAAM,IADI,EAAQ,GACH;AAEf,GADA,IAAM,IAAM,IAAM,IAAM,GACxB,IAAM,IAAM,IAAM,IAAM;;AAKzB,EADA,KAAK,MAAM,GACX,KAAK,MAAM;;CAIZ,cAAe,GAAM,GAAS;EAE7B,IAAI,IAAM,UACN,IAAM;AACV,OAAM,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,IAAI,GAAG,KAAO;GAEjD,IAAM,IAAI,EAAQ,IACZ,IAAM,EAAK,IAAK,EAAG;AAEzB,GADA,IAAM,IAAM,IAAM,IAAM,GACxB,IAAM,IAAM,IAAM,IAAM;;AAKzB,EADA,KAAK,MAAM,GACX,KAAK,MAAM;;CAIZ,YAAa,GAAQ;AAEpB,SAAO,KAAK,MAAM,EAAM,OAAO,EAAM,MAAM,KAAK;;;AAMlD,EAAqB,UAAU,cAAe,WAAY;CAEzD,IAAM,oBAAoB,IAAI,GAAS;AACvC,QAAO,SAAqB,GAAM,GAAM;EAEvC,IAAM,IAAS,EAAI,KACb,IAAS,EAAI,KACf,IAAM,UACN,IAAM;AACV,OAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,KAAO;AAI/B,GAFA,EAAE,IAAI,EAAO,IAAI,IAAI,EAAO,KAAM,IAAI,IACtC,EAAE,IAAI,EAAO,IAAI,IAAI,EAAO,KAAM,IAAI,IACtC,EAAE,IAAI,EAAO,IAAI,IAAI,EAAO,KAAM,IAAI;GAEtC,IAAM,IAAM,EAAK,IAAK,EAAG;AAEzB,GADA,IAAM,KAAK,IAAK,GAAK,EAAK,EAC1B,IAAM,KAAK,IAAK,GAAK,EAAK;;AAS7B,EADA,KAAK,MAAM,GACX,KAAK,MAAM;;IAIR,GAE4B,WAAY;CAE5C,IAAM,oBAAiC,IAAI,GAAsB;AACjE,QAAO,SAA0B,GAAQ,GAAS;EAEjD,IAAM,IAAU,EAAO,QACjB,IAAW,EAAO,SAClB,IAAa,EAAO,WAEpB,IAAU,EAAO,QACjB,IAAW,EAAO,SAClB,IAAa,EAAO;AAG1B,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAY,IACjB,IAAK,EAAU;AAErB,OADA,EAAe,cAAe,GAAI,EAAS,EACtC,EAAG,YAAa,EAAgB,CAAG,QAAO;;AAKhD,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAY,IACjB,IAAK,EAAU;AAErB,OADA,EAAe,cAAe,GAAI,EAAS,EACtC,EAAG,YAAa,EAAgB,CAAG,QAAO;;;IAM7C;;;AC5HL,IAAa,MAA2B,WAAY;CAGnD,IAAM,oBAAuB,IAAI,GAAS,EACpC,oBAAuB,IAAI,GAAS,EACpC,oBAAsB,IAAI,GAAS;AACzC,QAAO,SAAiC,GAAI,GAAI,GAAS;EAExD,IAAM,IAAK,EAAG,OACR,IAAM,GACN,IAAK,EAAG,OACR,IAAM;AAIZ,EAFA,EAAI,WAAY,GAAI,EAAI,EACxB,EAAK,WAAY,EAAG,KAAK,EAAG,MAAO,EACnC,EAAK,WAAY,EAAG,KAAK,EAAG,MAAO;EAGnC,IAAM,IAAQ,EAAI,IAAK,EAAK,EAGtB,IAAQ,EAAI,IAAK,EAAK,EAGtB,IAAQ,EAAI,IAAK,EAAK,EAGtB,IAAQ,EAAI,IAAK,EAAK,EAMtB,IAHQ,EAAI,IAAK,EAAK,GAGN,IAAQ,IAAQ,GAElC,GAAG;AAcP,EAbA,AAEC,IAFI,MAAU,IAMV,KAJE,IAAQ,IAAQ,IAAQ,KAAU,GAQzC,KAAO,IAAQ,IAAI,KAAU,GAE7B,EAAO,IAAI,GACX,EAAO,IAAI;;IAIR,EAEQ,MAAkC,WAAY;CAG1D,IAAM,oBAA8B,IAAI,GAAS,EAC3C,oBAAwB,IAAI,GAAS,EACrC,oBAAwB,IAAI,GAAS;AAC3C,QAAO,SAAwC,GAAI,GAAI,GAAS,GAAU;AAEzE,KAAwB,GAAI,GAAI,EAAa;EAE7C,IAAI,IAAI,EAAY,GAChB,IAAK,EAAY;AACrB,MAAK,KAAK,KAAK,KAAK,KAAK,KAAM,KAAK,KAAM,GAAI;AAG7C,GADA,EAAG,GAAI,GAAG,EAAS,EACnB,EAAG,GAAI,GAAI,EAAS;AAEpB;aAEW,KAAK,KAAK,KAAK,GAAI;AAa9B,GAVK,IAAK,IAET,EAAG,GAAI,GAAG,EAAS,GAInB,EAAG,GAAI,GAAG,EAAS,EAIpB,EAAG,oBAAqB,GAAS,IAAM,EAAS;AAChD;aAEW,KAAM,KAAK,KAAM,GAAI;AAahC,GAVK,IAAI,IAER,EAAG,GAAI,GAAG,EAAS,GAInB,EAAG,GAAI,GAAG,EAAS,EAIpB,EAAG,oBAAqB,GAAS,IAAM,EAAS;AAChD;SAEM;GAGN,IAAI;AACJ,GAMC,IANI,IAAI,IAEJ,EAAG,QAIH,EAAG;GAIR,IAAI;AACJ,GAMC,IANI,IAAK,IAEJ,EAAG,QAIH,EAAG;GAIT,IAAM,IAAe,GACf,IAAgB;AAItB,OAHA,EAAG,oBAAqB,GAAI,IAAM,EAAO,EACzC,EAAG,oBAAqB,GAAG,IAAM,EAAO,EAEnC,EAAa,kBAAmB,EAAI,IAAI,EAAc,kBAAmB,EAAG,EAAG;AAGnF,IADA,EAAQ,KAAM,EAAc,EAC5B,EAAQ,KAAM,EAAI;AAClB;UAEM;AAGN,IADA,EAAQ,KAAM,EAAG,EACjB,EAAQ,KAAM,EAAe;AAC7B;;;;IAQC,EAGQ,MAA4B,WAAY;CAGpD,IAAM,oBAAmC,IAAI,GAAS,EAChD,oBAAqC,IAAI,GAAS,EAClD,oBAA4B,IAAI,GAAO,EACvC,oBAA2B,IAAI,GAAO;AAC5C,QAAO,SAAkC,GAAQ,GAAW;EAE3D,IAAM,EAAE,WAAQ,cAAW,GACrB,EAAE,MAAG,MAAG,SAAM;AAgBpB,MAbA,EAAS,QAAQ,GACjB,EAAS,MAAM,GACO,EAAS,oBAAqB,GAAQ,IAAM,EAAkB,CACjE,WAAY,EAAQ,IAAI,MAE3C,EAAS,QAAQ,GACjB,EAAS,MAAM,GACO,EAAS,oBAAqB,GAAQ,IAAM,EAAkB,CACjE,WAAY,EAAQ,IAAI,OAE3C,EAAS,QAAQ,GACjB,EAAS,MAAM,GACO,EAAS,oBAAqB,GAAQ,IAAM,EAAkB,CACjE,WAAY,EAAQ,IAAI,GAAS,QAAO;EAG3D,IAAM,IAAQ,EAAS,SAAU,EAAW;AAE5C,MADW,KAAK,IAAK,EAAM,gBAAiB,EAAQ,CAAE,IAC3C,GAAS;GAEnB,IAAM,IAAK,EAAM,aAAc,GAAQ,EAAoB;AAE3D,OADW,EAAS,cAAe,EAAI,CAC7B,QAAO;;AAIlB,SAAO;;IAIJ,ECrMC,KAAgB;CAAE;CAAK;CAAK;CAAK,EACjC,IAAe,OACf,KAAmB,IAAe;AACxC,SAAS,EAAY,GAAQ;AAE5B,QAAO,KAAK,IAAK,EAAO,GAAG;;AAU5B,IAAa,IAAb,cAAsC,EAAS;CAE9C,YAAa,GAAG,GAAO;AAmBtB,EAjBA,MAAO,GAAG,EAAM,EAEhB,KAAK,qBAAqB,IAC1B,KAAK,UAAU;;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAS,CAAE,EAC/D,KAAK,YAAY;;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAsB,CAAE,EAC9E,KAAK,SAAS;GAAE,KAAK;GAAG,KAAK;GAAG,KAAK;GAAG,EACxC,KAAK,QAAQ,IAAI,GAAO,EACxB,KAAK,0BAA0B,IAC/B,KAAK,wBAAwB,IAC7B,KAAK,oBAAoB,IAAI,GAAO,EAQpC,KAAK,cAAc;;CASpB,iBAAkB,GAAS;AAE1B,SAAO,GAAyB,GAAQ,KAAM;;CAI/C,SAAS;EAER,IAAM,IAAI,KAAK,GACT,IAAI,KAAK,GACT,IAAI,KAAK,GACT,IAAS,KAAK,QAEd,IAAU,KAAK,SACf,IAAY,KAAK,WAEjB,IAAQ,EAAS,IACjB,IAAO,EAAW;AAExB,EADA,KAAK,UAAW,EAAO,EACvB,EAAK,cAAe,GAAO,EAAQ;EAEnC,IAAM,IAAQ,EAAS,IACjB,IAAO,EAAW;AAExB,EADA,EAAM,WAAY,GAAG,EAAG,EACxB,EAAK,cAAe,GAAO,EAAQ;EAEnC,IAAM,IAAQ,EAAS,IACjB,IAAO,EAAW;AAExB,EADA,EAAM,WAAY,GAAG,EAAG,EACxB,EAAK,cAAe,GAAO,EAAQ;EAEnC,IAAM,IAAQ,EAAS,IACjB,IAAO,EAAW;AAExB,EADA,EAAM,WAAY,GAAG,EAAG,EACxB,EAAK,cAAe,GAAO,EAAQ;EAEnC,IAAM,IAAW,EAAM,QAAQ,EACzB,IAAW,EAAM,QAAQ,EACzB,IAAW,EAAM,QAAQ;AA2C/B,EAzCA,KAAK,wBAAwB,IAC7B,KAAK,0BAA0B,IAE1B,IAAW,IAEV,IAAW,KAAgB,IAAW,IAE1C,KAAK,wBAAwB,MAI7B,KAAK,0BAA0B,IAC/B,KAAK,kBAAkB,MAAM,KAAM,EAAG,EACtC,KAAK,kBAAkB,IAAI,KAAM,EAAG,IAI1B,IAAW,IAEjB,IAAW,IAEf,KAAK,wBAAwB,MAI7B,KAAK,0BAA0B,IAC/B,KAAK,kBAAkB,MAAM,KAAM,EAAG,EACtC,KAAK,kBAAkB,IAAI,KAAM,EAAG,IAI1B,IAAW,MAEtB,KAAK,0BAA0B,IAC/B,KAAK,kBAAkB,MAAM,KAAM,EAAG,EACtC,KAAK,kBAAkB,IAAI,KAAM,EAAG,GAIrC,KAAK,MAAM,8BAA+B,GAAO,EAAG,EAEpD,KAAK,cAAc;;;AAerB,EAAiB,UAAU,yBAA0B,WAAY;CAEhE,IAAM,oBAAyB,IAAI,GAAS,EACtC,oBAAyB,IAAI,GAAS,EACtC,oBAAuB,IAAI,GAAO;AAExC,QAAO,SAA4B,GAAS,IAAU,MAAM,IAAU,MAAO;EAE5E,IAAM,EAAE,UAAO,WAAQ,GACjB,IAAS,KAAK,QAChB,GACA,IAAoB;AAGxB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,KAAU,IAAI,KAAM;AAO1B,GANA,EAAK,MAAM,KAAM,EAAQ,GAAK,EAC9B,EAAK,IAAI,KAAM,EAAQ,GAAS,EAEhC,GAA+B,GAAM,GAAS,GAAQ,EAAQ,EAE9D,IAAS,EAAO,kBAAmB,EAAQ,EACtC,IAAS,MAEb,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAQ;;AA2BvC,SApBA,KAAK,oBAAqB,GAAO,EAAQ,EACzC,IAAS,EAAM,kBAAmB,EAAQ,EACrC,IAAS,MAEb,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAO,GAIrC,KAAK,oBAAqB,GAAK,EAAQ,EACvC,IAAS,EAAI,kBAAmB,EAAQ,EACnC,IAAS,MAEb,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAK,GAI5B,KAAK,KAAM,EAAmB;;IAIlC,EAWL,EAAiB,UAAU,sBAAuB,WAAY;CAE7D,IAAM,oBAAyB,IAAI,GAAkB,EAC/C,oBAAkC,IAAI,GAAsB,EAC5D,oBAAmC,IAAI,GAAsB,EAC7D,oBAAyB,IAAI,GAAS,EACtC,oBAAuB,IAAI,GAAS,EACpC,oBAAuB,IAAI,GAAS,EACpC,oBAA0B,IAAI,GAAS,EACvC,oBAAwB,IAAI,GAAO,EACnC,oBAAwB,IAAI,GAAO,EACnC,oBAA4B,IAAI,GAAS,EACzC,oBAA0B,IAAI,GAAS,EACvC,oBAA0B,IAAI,GAAS;CAE7C,SAAS,EAA4B,GAAM,GAAO,GAAQ,GAAc;EAKvE,IAAM,IAAc;AACpB,EAAK,CAAE,EAAK,yBAAyB,CAAE,EAAK,0BAE3C,EAAY,KAAM,EAAK,MAAM,OAAQ,GAIrC,EAAY,KAAM,EAAM,MAAM,OAAQ;EAIvC,IAAM,IAAa,EAAK,WAClB,IAAW,EAAK;AACtB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAY,IACjB,IAAK,EAAU;AAOrB,OANA,EAAgB,cAAe,GAAI,EAAM,OAAQ,EAC5C,EAAG,YAAa,EAAiB,KAEtC,EAAQ,KAAM,EAAa,CAAC,MAAO,EAAI,EACvC,EAAgB,cAAe,GAAS,EAAK,OAAQ,EACrD,EAAiB,cAAe,GAAS,EAAM,OAAQ,EAClD,EAAgB,YAAa,EAAkB,EAAG,QAAO;;EAI/D,IAAM,IAAa,EAAM,WACnB,IAAW,EAAM;AACvB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAY,IACjB,IAAK,EAAU;AAOrB,OANA,EAAgB,cAAe,GAAI,EAAK,OAAQ,EAC3C,EAAG,YAAa,EAAiB,KAEtC,EAAQ,aAAc,GAAa,EAAI,EACvC,EAAgB,cAAe,GAAS,EAAK,OAAQ,EACrD,EAAiB,cAAe,GAAS,EAAM,OAAQ,EAClD,EAAgB,YAAa,EAAkB,EAAG,QAAO;;AAkB/D,SAdK,MAGG,KAEN,QAAQ,KAAM,8HAA+H,EAI9I,EAAO,MAAM,IAAK,GAAG,GAAG,EAAG,EAC3B,EAAO,IAAI,IAAK,GAAG,GAAG,EAAG,GAInB;;CAIR,SAAS,EAAkB,GAAG,GAAG,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,GAAO;EAE5F,IAAI,IAAI,KAAU,IAAQ;AAM1B,EALA,EAAO,IAAI,KAAU,IAAQ,KAAU,GACvC,EAAK,MAAM,WAAY,GAAG,EAAG,CAAC,eAAgB,EAAG,CAAC,IAAK,EAAG,EAE1D,IAAI,KAAU,IAAQ,IACtB,EAAO,IAAI,KAAU,IAAQ,KAAU,GACvC,EAAK,IAAI,WAAY,GAAG,EAAG,CAAC,eAAgB,EAAG,CAAC,IAAK,EAAG;;CAUzD,SAAS,EAA4B,GAAM,GAAO,GAAO,GAAO,GAAQ,GAAQ,GAAO,GAAO,GAAO,GAAQ,GAAO;AAEnH,MAAK,IAAS,EAGb,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;WAEvF,IAAS,EAEpB,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;WAEvF,IAAQ,IAAQ,KAAK,KAAS,EAEzC,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;WAEvF,KAAS,EAEpB,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;WAEvF,KAAS,EAEpB,GAAkB,EAAK,GAAG,EAAK,GAAG,EAAK,GAAG,GAAO,GAAO,GAAO,GAAO,GAAO,GAAO,GAAQ,EAAM;MAIlG,QAAO;AAIR,SAAO;;CAIR,SAAS,EAA0B,GAAU,GAAoB,GAAQ,GAAc;EAEtF,IAAM,IAAU,EAAmB,mBAC7B,IAAY,EAAS,MAAM,gBAAiB,EAAQ,MAAO,EAC3D,IAAU,EAAS,MAAM,gBAAiB,EAAQ,IAAK;AA+C3D,SA9CG,EAAY,EAAW,GAEtB,EAAY,EAAS,GAElB,EAA4B,GAAU,GAAoB,GAAQ,EAAa,IAKjF,MAEJ,EAAO,MAAM,KAAM,EAAQ,MAAO,EAClC,EAAO,IAAI,KAAM,EAAQ,MAAO,GAI1B,EAAS,cAAe,EAAQ,MAAO,IAIpC,EAAY,EAAS,IAE3B,MAEJ,EAAO,MAAM,KAAM,EAAQ,IAAK,EAChC,EAAO,IAAI,KAAM,EAAQ,IAAK,GAIxB,EAAS,cAAe,EAAQ,IAAK,IAIvC,EAAS,MAAM,cAAe,GAAS,EAAQ,IAAI,OAahD,MAXF,MAEJ,EAAO,MAAM,KAAM,EAAQ,EAC3B,EAAO,IAAI,KAAM,EAAQ,GAInB,EAAS,cAAe,EAAQ;;CAY1C,SAAS,EAAwB,GAAU,GAAoB,GAAS;EAEvE,IAAM,IAAQ,EAAmB;AAehC,SAbI,EAAY,EAAS,MAAM,gBAAiB,EAAO,CAAE,IAAI,EAAS,cAAe,EAAO,IAEvF,MAEJ,EAAO,MAAM,KAAM,EAAO,EAC1B,EAAO,IAAI,KAAM,EAAO,GAIlB,MAIA;;CAMT,SAAS,EAAuB,GAAY,GAAU,GAAS;EAE9D,IAAM,IAAU,EAAW,mBACrB,IAAQ,EAAS;AAiBtB,SAfD,EAAQ,oBAAqB,GAAO,IAAM,EAAQ,EAE7C,EAAM,kBAAmB,EAAQ,GAAG,MAEnC,MAEJ,EAAO,MAAM,KAAM,EAAO,EAC1B,EAAO,IAAI,KAAM,EAAO,GAIlB,MAIA;;CAMT,SAAS,EAAuB,GAAM,GAAO,GAAQ,GAAc;AAElE,MAAK,EAAK,wBAET,KAAK,EAAM,yBAA0B;GAGpC,IAAM,IAAW,EAAK,mBAChB,IAAW,EAAM,mBACjB,IAAS,GACT,IAAS;AAEf,GADA,EAAS,MAAO,EAAQ,EACxB,EAAS,MAAO,EAAQ;GACxB,IAAM,IAAa,EAAO,WAAY,EAAS,OAAO,EAAS,MAAO,EAEhE,IAAQ,EAAO,IAAI,EAAO,IAAI,EAAO,IAAI,EAAO;AACtD,OAAK,EAAY,EAAO,CAEvB,QAAO;GAIR,IAAM,KAAM,EAAW,IAAI,EAAO,IAAI,EAAW,IAAI,EAAO,KAAM,GAC5D,IAAI,EAAI,EAAO,IAAI,EAAW,IAAI,EAAO,IAAI,EAAW,KAAM;AAwBnE,UAtBI,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,IAE5B,KAOH,EAHM,EAAS,MAAM,IAAI,EAAO,IAAI,KAC9B,EAAS,MAAM,IAAI,EAAO,IAAI,GAEf,IAEpB,MAEJ,EAAO,MAAM,KAAM,EAAS,MAAO,CAAC,gBAAiB,GAAQ,EAAG,EAChE,EAAO,IAAI,KAAM,EAAS,MAAO,CAAC,gBAAiB,GAAQ,EAAG,GAIxD,MAIA;aAIG,EAAM,sBAEjB,QAAO,EAAuB,GAAM,GAAO,EAAQ;MAInD,QAAO,EAA0B,GAAO,GAAM,GAAQ,EAAa;WAIzD,EAAK,sBA2Bf,QAzBI,EAAM,wBAEL,EAAM,EAAE,kBAAmB,EAAK,EAAG,GAAG,MAErC,MAEJ,EAAO,MAAM,KAAM,EAAK,EAAG,EAC3B,EAAO,IAAI,KAAM,EAAK,EAAG,GAInB,MAIA,KAIG,EAAM,0BAEV,EAAuB,GAAO,GAAM,EAAQ,GAI5C,EAAwB,GAAO,GAAM,EAAQ;WAMhD,EAAM,sBAEV,QAAO,EAAwB,GAAM,GAAO,EAAQ;WAEzC,EAAM,wBAEjB,QAAO,EAA0B,GAAM,GAAO,GAAQ,EAAa;;AAgBtE,QAAO,SAA6B,GAAO,IAAS,MAAM,IAAc,IAAQ;AAQ/E,EANK,KAAK,eAET,KAAK,QAAQ,EAIP,EAAM,qBAMD,EAAM,eAEjB,EAAM,QAAQ,IANd,EAAO,KAAM,EAAO,EACpB,EAAO,QAAQ,EACf,IAAQ;EAQT,IAAM,IAAM,EAAuB,MAAM,GAAO,GAAQ,EAAa;AACrE,MAAK,MAAQ,KAAA,EAEZ,QAAO;EAIR,IAAM,IAAS,KAAK,OACd,IAAS,EAAM,OAEjB,IAAS,EAAO,gBAAiB,KAAK,EAAG,EACzC,IAAS,EAAO,gBAAiB,KAAK,EAAG,EACzC,IAAS,EAAO,gBAAiB,KAAK,EAAG;AAQ7C,EANK,EAAY,EAAQ,KACxB,IAAS,IAEL,EAAY,EAAQ,KACxB,IAAS,IAEL,EAAY,EAAQ,KACxB,IAAS;EAEV,IAAM,IAAW,IAAS,GACpB,IAAW,IAAS;AAC1B,MAAK,IAAW,KAAK,IAAW,EAE/B,QAAO;EAIR,IAAI,IAAS,EAAO,gBAAiB,EAAM,EAAG,EAC1C,IAAS,EAAO,gBAAiB,EAAM,EAAG,EAC1C,IAAS,EAAO,gBAAiB,EAAM,EAAG;AAQ9C,EANK,EAAY,EAAQ,KACxB,IAAS,IAEL,EAAY,EAAQ,KACxB,IAAS,IAEL,EAAY,EAAQ,KACxB,IAAS;EAEV,IAAM,IAAW,IAAS,GACpB,IAAW,IAAS;AAC1B,MAAK,IAAW,KAAK,IAAW,EAE/B,QAAO;AAKR,EADA,EAAK,KAAM,EAAO,OAAQ,EAC1B,EAAK,KAAM,EAAO,OAAQ;EAC1B,IAAM,IAAmB,EAAK,MAAO,EAAM,EAEvC,IAAiB,GACjB,IAAe,KAAK,IAAK,EAAiB,EAAG,EAC3C,IAAQ,KAAK,IAAK,EAAiB,EAAG;AAS5C,EARK,IAAQ,MAEZ,IAAe,GACf,IAAiB,IAIJ,KAAK,IAAK,EAAiB,EAAG,GAC/B,MAEZ,IAAiB;EAIlB,IAAM,IAAM,GAAe,IACrB,KAAS,KAAK,EAAG,IACjB,IAAS,KAAK,EAAG,IACjB,KAAS,KAAK,EAAG,IAEjB,KAAS,EAAM,EAAG,IAClB,KAAS,EAAM,EAAG,IAClB,KAAS,EAAM,EAAG;AAQxB,MANK,EAA4B,MAAM,IAAQ,GAAQ,IAAQ,GAAU,GAAU,GAAQ,GAAQ,GAAQ,GAAS,EAAO,IAMtH,EAA4B,GAAO,IAAQ,IAAQ,IAAQ,GAAU,GAAU,GAAQ,GAAQ,GAAQ,GAAS,EAAO,CAE3H,QAAO,EAA4B,MAAM,GAAO,GAAQ,EAAa;AAItE,MAAK,EAAQ,IAAI,EAAQ,GAAI;GAE5B,IAAM,IAAM,EAAQ;AAMpB,GALA,EAAQ,IAAI,EAAQ,GACpB,EAAQ,IAAI,GAEZ,EAAU,KAAM,EAAM,MAAO,EAC7B,EAAM,MAAM,KAAM,EAAM,IAAK,EAC7B,EAAM,IAAI,KAAM,EAAW;;AAI5B,MAAK,EAAQ,IAAI,EAAQ,GAAI;GAE5B,IAAM,IAAM,EAAQ;AAMpB,GALA,EAAQ,IAAI,EAAQ,GACpB,EAAQ,IAAI,GAEZ,EAAU,KAAM,EAAM,MAAO,EAC7B,EAAM,MAAM,KAAM,EAAM,IAAK,EAC7B,EAAM,IAAI,KAAM,EAAW;;AAkC5B,SA9BK,EAAQ,IAAI,EAAQ,KAAK,EAAQ,IAAI,EAAQ,IAE1C,MAIH,MAEC,EAAQ,IAAI,EAAQ,IAExB,EAAO,MAAM,KAAM,EAAM,MAAO,GAIhC,EAAO,MAAM,KAAM,EAAM,MAAO,EAI5B,EAAQ,IAAI,EAAQ,IAExB,EAAO,IAAI,KAAM,EAAM,IAAK,GAI5B,EAAO,IAAI,KAAM,EAAM,IAAK,GAMvB;;IAIJ,EASL,EAAiB,UAAU,mBAAoB,WAAY;CAE1D,IAAM,oBAAyB,IAAI,GAAS;AAC5C,QAAO,SAA0B,GAAQ;AAGxC,SADA,KAAK,oBAAqB,GAAO,EAAQ,EAClC,EAAM,WAAY,EAAQ;;IAI9B,EAWL,EAAiB,UAAU,sBAAuB,WAAY;CAE7D,IAAM,oBAAwB,IAAI,GAAS,EACrC,oBAAyB,IAAI,GAAS,EACtC,IAAe;EAAE;EAAK;EAAK;EAAK,EAChC,oBAAwB,IAAI,GAAO,EACnC,oBAAwB,IAAI,GAAO;AAEzC,QAAO,SAA6B,GAAO,IAAU,MAAM,IAAU,MAAO;EAE3E,IAAM,IAAa,KAAW,IAAU,IAAQ;AAKhD,MAAK,KAAK,mBAAoB,GAAO,GAAY,GAAM,CAStD,SAPK,KAAW,OAEV,KAAU,EAAW,UAAW,EAAS,EACzC,KAAU,EAAW,UAAW,EAAS,GAIxC;EAIR,IAAI,IAAoB;AAGxB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAI,GACE,IAAQ,EAAc,IACtB,IAAW,EAAO;AAKxB,GAJA,KAAK,oBAAqB,GAAU,EAAO,EAE3C,IAAO,EAAS,kBAAmB,EAAO,EAErC,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAO,EAC/B,KAAU,EAAQ,KAAM,EAAU;GAKxC,IAAM,IAAU,KAAM;AAKtB,GAJA,EAAM,oBAAqB,GAAS,EAAO,EAE3C,IAAO,EAAQ,kBAAmB,EAAO,EAEpC,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAS,EACjC,KAAU,EAAQ,KAAM,EAAO;;AAMtC,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAM,EAAc,IACpB,IAAM,GAAgB,IAAI,KAAM;AACtC,KAAM,IAAK,KAAM,IAAO,KAAM,GAAO;AACrC,QAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;IAEjC,IAAM,IAAM,EAAc,IACpB,IAAM,GAAgB,IAAK,KAAM;AAGvC,IAFA,EAAM,IAAK,EAAO,IAAO,EAAO,GAAO,EAEvC,GAA+B,GAAO,GAAO,GAAO,EAAQ;IAE5D,IAAM,IAAO,EAAM,kBAAmB,EAAQ;AAC9C,IAAK,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAO,EAC/B,KAAU,EAAQ,KAAM,EAAQ;;;AAQxC,SAAO,KAAK,KAAM,EAAmB;;IAIlC;;;ACp1BL,IAAa,IAAb,MAAyB;CAExB,YAAa,GAAK,GAAK,GAAS;AA8B/B,EA5BA,KAAK,gBAAgB,IAGrB,KAAK,MAAM,IAAI,GAAS,EAGxB,KAAK,MAAM,IAAI,GAAS,EAMxB,KAAK,SAAS,IAAI,GAAS,EAC3B,KAAK,YAAY,IAAI,GAAS,EAC9B,KAAK,SAAa,MAAO,EAAG,CAAC,MAAM,CAAC,UAAW,IAAI,GAAS,CAAE,EAC9D,KAAK,UAAU;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAS,CAAE,EAC/D,KAAK,YAAY;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAsB,CAAE,EAC9E,KAAK,mBAAmB;;;;GAAc,CAAC,MAAM,CAAC,UAAW,IAAI,GAAsB,CAAE,EAOrF,KAAK,cAAc,IAEd,KAAM,KAAK,IAAI,KAAM,EAAK,EAC1B,KAAM,KAAK,IAAI,KAAM,EAAK,EAC1B,KAAS,KAAK,OAAO,KAAM,EAAQ;;CAUzC,IAAK,GAAK,GAAK,GAAS;AAKvB,EAHA,KAAK,IAAI,KAAM,EAAK,EACpB,KAAK,IAAI,KAAM,EAAK,EACpB,KAAK,OAAO,KAAM,EAAQ,EAC1B,KAAK,cAAc;;CAIpB,KAAM,GAAQ;AAKb,EAHA,KAAK,IAAI,KAAM,EAAM,IAAK,EAC1B,KAAK,IAAI,KAAM,EAAM,IAAK,EAC1B,KAAK,OAAO,KAAM,EAAM,OAAQ,EAChC,KAAK,cAAc;;;AAMrB,EAAY,UAAU,UAAW,WAAY;AAE5C,QAAO,WAAkB;EAExB,IAAM,IAAS,KAAK,QACd,IAAM,KAAK,KACX,IAAM,KAAK,KAEX,IAAS,KAAK;AACpB,OAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,KAAO;GAG/B,IAAM,IAAI,EADI,IAAW,IAAU,IAAW,IAAU,IAAW;AAMnE,GAJA,EAAE,IAAI,IAAI,EAAI,IAAI,EAAI,GACtB,EAAE,IAAI,IAAI,EAAI,IAAI,EAAI,GACtB,EAAE,IAAI,IAAI,EAAI,IAAI,EAAI,GAEtB,EAAE,aAAc,EAAQ;;EAQ3B,IAAM,IAAY,KAAK,WACjB,IAAU,KAAK,SACf,IAAS,EAAQ;AACvB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAO,EAAS,IAChB,IAAK,EAAW,IAEhB,IAAK,EADG,KAAK;AAInB,GADA,EAAK,WAAY,GAAQ,EAAI,EAC7B,EAAG,cAAe,GAAM,EAAQ;;EAIjC,IAAM,IAAmB,KAAK;AAM9B,EALA,EAAkB,GAAI,mBAAoB,GAAQ,IAAK,EACvD,EAAkB,GAAI,mBAAoB,GAAQ,IAAK,EACvD,EAAkB,GAAI,mBAAoB,GAAQ,IAAK,EAEvD,KAAK,UAAU,KAAM,KAAK,OAAQ,CAAC,QAAQ,EAC3C,KAAK,cAAc;;IAIhB,EAQL,EAAY,UAAU,iBAAkB,WAAY;CAEnD,IAAM,oBAA6B,IAAI,GAAsB;AAC7D,QAAO,SAAwB,GAAM;AAGpC,EAAK,KAAK,eAET,KAAK,QAAQ;EAId,IAAM,IAAM,EAAI,KACV,IAAM,EAAI,KACV,IAAY,KAAK,WACjB,IAAU,KAAK,SACf,IAAmB,KAAK;AAY9B,MAVA,EAAW,MAAM,EAAI,GACrB,EAAW,MAAM,EAAI,GAChB,EAAkB,GAAI,YAAa,EAAY,KAEpD,EAAW,MAAM,EAAI,GACrB,EAAW,MAAM,EAAI,GAChB,EAAkB,GAAI,YAAa,EAAY,MAEpD,EAAW,MAAM,EAAI,GACrB,EAAW,MAAM,EAAI,GAChB,EAAkB,GAAI,YAAa,EAAY,EAAG,QAAO;AAE9D,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAO,EAAS,IAChB,IAAK,EAAW;AAEtB,OADA,EAAW,WAAY,GAAM,EAAK,EAC7B,EAAG,YAAa,EAAY,CAAG,QAAO;;AAI5C,SAAO;;IAIJ,EAQL,EAAY,UAAU,sBAAuB,WAAY;CAExD,IAAM,oBAAwB,IAAI,GAAkB,EAC9C,IAA4B;;;;EAAc,EAC1C,oBAAkC,IAAI,GAAsB,EAC5D,oBAAmC,IAAI,GAAsB,EAC7D,oBAA6B,IAAI,GAAS;AAChD,QAAO,SAA6B,GAAW;AAQ9C,EANK,KAAK,eAET,KAAK,QAAQ,EAIP,EAAS,qBAMJ,EAAS,eAEpB,EAAS,QAAQ,IANjB,EAAM,KAAM,EAAU,EACtB,EAAM,QAAQ,EACd,IAAW;EAQZ,IAAM,IAAY,KAAK,WACjB,IAAU,KAAK;AAIrB,EAFA,EAAW,KAAM,EAAS,GAC1B,EAAW,KAAM,EAAS,GAC1B,EAAW,KAAM,EAAS;AAE1B,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAW,IAChB,IAAK,EAAS;AAEpB,OADA,EAAgB,cAAe,GAAI,EAAW,EACzC,EAAG,YAAa,EAAiB,CAAG,QAAO;;EAIjD,IAAM,IAAe,EAAS,WACxB,IAAa,EAAS,SACtB,IAAS,KAAK;AACpB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAK,EAAc,IACnB,IAAK,EAAY;AAEvB,OADA,EAAgB,cAAe,GAAI,EAAQ,EACtC,EAAG,YAAa,EAAiB,CAAG,QAAO;;AAKjD,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAM,EAAS;AACrB,QAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;IAEjC,IAAM,IAAM,EAAY;AAIxB,QAHA,EAAW,aAAc,GAAK,EAAK,EACnC,EAAgB,cAAe,GAAY,EAAW,EACtD,EAAiB,cAAe,GAAY,EAAQ,EAC/C,EAAgB,YAAa,EAAkB,CAAG,QAAO;;;AAMhE,SAAO;;IAIJ,EAUL,EAAY,UAAU,uBAAwB,WAAY;AAEzD,QAAO,SAA8B,GAAO,GAAU;AAcrD,SAZK,KAAK,eAET,KAAK,QAAQ,EAId,EACE,KAAM,EAAO,CACb,aAAc,KAAK,UAAW,CAC9B,MAAO,KAAK,KAAK,KAAK,IAAK,CAC3B,aAAc,KAAK,OAAQ,EAEtB;;IAIJ,EAQL,EAAY,UAAU,mBAAoB,WAAY;CAErD,IAAM,IAAS,IAAI,GAAS;AAC5B,QAAO,SAA0B,GAAQ;AAGxC,SADA,KAAK,oBAAqB,GAAO,EAAQ,EAClC,EAAM,WAAY,EAAQ;;IAI9B,EAaL,EAAY,UAAU,iBAAkB,WAAY;CAEnD,IAAM,IAAY;EAAE;EAAK;EAAK;EAAK,EAC7B,IAA4B,gBAAI,MAAO,GAAI,CAAC,MAAM,CAAC,UAAW,IAAI,GAAO,CAAE,EAC3E,IAA4B,gBAAI,MAAO,GAAI,CAAC,MAAM,CAAC,UAAW,IAAI,GAAO,CAAE,EAE3E,oBAAyB,IAAI,GAAS,EACtC,oBAAyB,IAAI,GAAS;AAG5C,QAAO,SAAwB,GAAK,IAAY,GAAG,IAAU,MAAM,IAAU,MAAO;AAQnF,MANK,KAAK,eAET,KAAK,QAAQ,EAIT,KAAK,cAAe,EAAK,CAa7B,SAXK,KAAW,OAEf,EAAI,UAAW,EAAQ,EACvB,KAAK,oBAAqB,GAAQ,EAAQ,EAC1C,EAAI,oBAAqB,GAAQ,EAAQ,EAEpC,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAQ,GAI/B;EAIR,IAAM,IAAa,IAAY,GACzB,IAAM,EAAI,KACV,IAAM,EAAI,KACV,IAAS,KAAK,QAIhB,IAAoB;AAGxB,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;GAE9B,IAAM,IAAI,EAAQ;AAClB,KAAO,KAAM,EAAG,CAAC,MAAO,GAAK,EAAK;GAElC,IAAM,IAAO,EAAE,kBAAmB,EAAQ;AAC1C,OAAK,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAG,EAC3B,KAAU,EAAQ,KAAM,EAAQ,EAEhC,IAAO,GAAa,QAAO,KAAK,KAAM,EAAM;;EAOnD,IAAI,IAAQ;AACZ,OAAM,IAAI,IAAI,GAAG,IAAI,GAAG,IAEvB,MAAM,IAAI,IAAK,GAAG,KAAM,GAAG,IAE1B,MAAM,IAAI,IAAK,GAAG,KAAM,GAAG,KAAQ;GAElC,IAAM,KAAc,IAAI,KAAM,GACxB,KAAe,IAAI,KAAM,GAGzB,IAAQ,KAAM,IAAY,KAAM,GAChC,IAAS,KAAK,IAAI,KAAM,IAAY,KAAM,GAC1C,IAAK,EAAQ,IACb,IAAK,EAAQ;AACL,KAAW,GACnB,IAAK,GAAI,EAAI;GAInB,IAAM,IAAK,EAAW,IAChB,IAAK,EAAW,IAChB,IAAK,EAAW,IAChB,IAAQ,EAAW,IACnB,IAAQ,EAAM,OACd,IAAM,EAAM;AAUlB,GARA,EAAO,KAAO,EAAK,IACnB,EAAO,KAAO,IAAK,EAAK,KAAO,EAAK,IACpC,EAAO,KAAO,IAAK,EAAK,KAAO,EAAK,IAEpC,EAAK,KAAO,EAAK,IACjB,EAAK,KAAO,IAAK,EAAK,KAAO,EAAK,IAClC,EAAK,KAAO,IAAK,EAAK,KAAO,EAAK,IAElC;;AASH,OAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,IAExB,MAAM,IAAI,IAAI,GAAG,KAAK,GAAG,KAAO;AAM/B,GAJA,EAAO,IAAI,IAAI,EAAI,IAAI,EAAI,GAC3B,EAAO,IAAI,IAAI,EAAI,IAAI,EAAI,GAC3B,EAAO,IAAI,IAAI,EAAI,IAAI,EAAI,GAE3B,KAAK,oBAAqB,GAAQ,EAAQ;GAC1C,IAAM,IAAO,EAAO,kBAAmB,EAAQ;AAC/C,OAAK,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAQ,EAEhC,IAAO,GAAa,QAAO,KAAK,KAAM,EAAM;;AAUrD,OAAM,IAAI,IAAI,GAAG,IAAI,IAAI,KAAO;GAE/B,IAAM,IAAK,EAAW;AACtB,QAAM,IAAI,IAAK,GAAG,IAAK,IAAI,KAAQ;IAElC,IAAM,IAAK,EAAW;AACtB,OAA+B,GAAI,GAAI,GAAQ,EAAQ;IACvD,IAAM,IAAO,EAAO,kBAAmB,EAAQ;AAC/C,QAAK,IAAO,MAEX,IAAoB,GACf,KAAU,EAAQ,KAAM,EAAQ,EAChC,KAAU,EAAQ,KAAM,EAAQ,EAEhC,IAAO,GAAa,QAAO,KAAK,KAAM,EAAM;;;AAQpD,SAAO,KAAK,KAAM,EAAmB;;IAIlC;AC3dL,IAAa,oBAAuC,IAVpD,cAAuC,GAAc;CAEpD,cAAc;AAEb,cAAa,IAAI,GAAkB,CAAE;;GAM2C,ECX5E,qBAAuB,IAAI,GAAS,EACpCC,qBAAwB,IAAI,GAAS;AAE3C,SAAgB,GACf,GACA,GACA,IAAS,EAAG,EACZ,IAAe,GACf,IAAe,UACd;CAMD,IAAM,IAAiB,IAAe,GAChC,IAAiB,IAAe,GAClC,IAAoB,UACpB,IAA0B;AA8C9B,KA7CA,EAAI,UAEH;EAEC,sBAAqB,OAEpB,GAAK,KAAM,EAAO,CAAC,MAAO,EAAI,KAAK,EAAI,IAAK,EACrC,GAAK,kBAAmB,EAAO;EAIvC,mBAAoB,GAAK,GAAQ,MAEzB,IAAQ,KAAqB,IAAQ;EAI7C,qBAAsB,GAAK,MAAc;AAExC,KAAI,oBAAqB,GAAO,GAAM;GACtC,IAAM,IAAS,EAAM,kBAAmB,GAAM;AAe7C,UAdI,IAAS,MAEb,GAAM,KAAM,GAAM,EAClB,IAAoB,GACpB,IAA0B,IAItB,IAAS;;EAYf,CAED,EAEI,MAAsB,SAAW,QAAO;CAE7C,IAAM,IAAkB,KAAK,KAAM,EAAmB;AAOtD,QALO,EAAO,QACT,EAAO,MAAM,KAAMA,GAAO,GADT,EAAO,QAAQA,GAAM,OAAO,EAElD,EAAO,WAAW,GAClB,EAAO,YAAY,GAEZ;;;;ACzER,IAAMC,KAAqB,IACrBC,KAAqB,IAIrB,oBAAsB,IAAI,GAAS,EACnC,oBAAsB,IAAI,GAAS,EACnC,oBAAsB,IAAI,GAAS,EAEnCC,qBAAuB,IAAI,GAAS,EACpCC,qBAAuB,IAAI,GAAS,EACpCC,qBAAuB,IAAI,GAAS,EAEpCC,qBAA2B,IAAI,GAAS,EACxCC,qBAA2B,IAAI,GAAS,EACxCC,qBAA2B,IAAI,GAAS,EAExC,qBAAqC,IAAI,GAAS;AACxD,SAAS,GAAmB,GAAK,GAAI,GAAI,GAAI,GAAO,GAAM,GAAM,GAAM;CAErE,IAAI;AAWJ,KAVA,AAMC,IANI,MAAA,IAEQ,EAAI,kBAAmB,GAAI,GAAI,GAAI,IAAM,EAAO,GAIhD,EAAI,kBAAmB,GAAI,GAAI,GAAI,MAAA,GAAqB,EAAO,EAIvE,MAAc,KAAO,QAAO;CAEjC,IAAM,IAAW,EAAI,OAAO,WAAY,EAAO;AAI/C,QAFK,IAAW,KAAQ,IAAW,IAAa,OAEzC;EAEI;EACV,OAAO,EAAM,OAAO;EAEpB;;AAIF,SAAS,GAAiC,GAAK,GAAU,GAAQ,GAAI,GAAK,GAAG,GAAG,GAAG,GAAM,GAAM,GAAM;AAIpG,CAFA,EAAI,oBAAqB,GAAU,EAAG,EACtC,EAAI,oBAAqB,GAAU,EAAG,EACtC,EAAI,oBAAqB,GAAU,EAAG;CAEtC,IAAM,IAAe,GAAmB,GAAK,GAAK,GAAK,GAAK,IAAoB,GAAM,GAAM,EAAK;AAEjG,KAAK,GAAe;AAEnB,MAAK,GAAK;AAMT,GAJA,GAAK,oBAAqB,GAAI,EAAG,EACjC,GAAK,oBAAqB,GAAI,EAAG,EACjC,GAAK,oBAAqB,GAAI,EAAG,EAEjC,EAAa,KAAK,IAAI,GAAS;GAC/B,IAAM,IAAM,EAAS,iBAAkB,IAAoB,GAAK,GAAK,GAAKL,IAAMC,IAAMC,IAAM,EAAa,GAAI;AAC7G,GAAOJ,OAEN,EAAa,KAAK;;AAMpB,MAAK,GAAM;AAMV,GAJA,GAAK,oBAAqB,GAAK,EAAG,EAClC,GAAK,oBAAqB,GAAK,EAAG,EAClC,GAAK,oBAAqB,GAAK,EAAG,EAElC,EAAa,MAAM,IAAI,GAAS;GAChC,IAAM,IAAM,EAAS,iBAAkB,IAAoB,GAAK,GAAK,GAAKE,IAAMC,IAAMC,IAAM,EAAa,IAAK;AAO9G,GANOJ,OAEN,EAAa,MAAM,IAIfC,OAEJ,EAAa,MAAM,EAAa;;AAMlC,MAAK,GAAS;AAMb,GAJA,GAAS,oBAAqB,GAAQ,EAAG,EACzC,GAAS,oBAAqB,GAAQ,EAAG,EACzC,GAAS,oBAAqB,GAAQ,EAAG,EAEzC,EAAa,SAAS,IAAI,GAAS;GACnC,IAAM,IAAM,EAAS,iBAAkB,IAAoB,GAAK,GAAK,GAAKI,IAAUC,IAAUC,IAAU,EAAa,OAAQ;AAO7H,GANK,EAAa,OAAO,IAAK,EAAI,UAAW,GAAG,KAE/C,EAAa,OAAO,eAAgB,GAAK,EAInCP,OAEN,EAAa,SAAS;;EAMxB,IAAM,IAAO;GACT;GACA;GACA;GACH,QAAQ,IAAI,GAAS;GACrB,eAAe;GACf;AAOD,MALA,EAAS,UAAW,GAAK,GAAK,GAAK,EAAK,OAAQ,EAEhD,EAAa,OAAO,GACpB,EAAa,YAAY,GAEpBA,IAAqB;GAEzB,IAAM,IAAY,IAAI,GAAS;AAG/B,GAFA,EAAS,aAAc,IAAoB,GAAK,GAAK,GAAK,EAAW,EAErE,EAAa,YAAY;;;AAM3B,QAAO;;AAIR,SAAS,GAAS,GAAiB;AAElC,QAAO,KAAkB,EAAe,aAAa,EAAe,OAAO;;AAK5E,SAAgB,GAAc,GAAU,GAAgB,GAAK,GAAK,GAAe,GAAM,GAAM;CAE5F,IAAM,IAAY,IAAM,GACpB,IAAI,IAAY,GAChB,IAAI,IAAY,GAChB,IAAI,IAAY,GAEd,EAAE,UAAO,cAAW;AAC1B,CAAK,EAAS,UAEb,IAAI,EAAM,KAAM,EAAG,EACnB,IAAI,EAAM,KAAM,EAAG,EACnB,IAAI,EAAM,KAAM,EAAG;CAIpB,IAAM,EAAE,aAAU,WAAQ,OAAI,WAAQ,EAAS;AAC/C,KAAK,MAAM,QAAS,EAAgB,EAAG;EAItC,IAAM,IAAa,IAAM;AACzB,OAAM,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,IAAI,GAAG,KAAO;GAEjD,IAAM,EAAE,UAAO,UAAO,qBAAkB,EAAQ;AAChD,OAAK,KAAc,KAAS,IAAa,IAAQ,GAAQ;IAExD,IAAM,IAAO,GAAS,EAAgB,GAAiB,EACjD,IAAe,GAAiC,GAAK,GAAU,GAAQ,GAAI,GAAK,GAAG,GAAG,GAAG,GAAM,GAAM,EAAK;AAChH,QAAK,EAKJ,KAHA,EAAa,YAAY,GACzB,EAAa,KAAK,gBAAgB,GAE7B,EAEJ,GAAc,KAAM,EAAc;QAIlC,QAAO;;;QAUL;EAGN,IAAM,IAAO,GAAS,EAAgB,EAChC,IAAe,GAAiC,GAAK,GAAU,GAAQ,GAAI,GAAK,GAAG,GAAG,GAAG,GAAM,GAAM,EAAK;AAChH,MAAK,EAKJ,KAHA,EAAa,YAAY,GACzB,EAAa,KAAK,gBAAgB,GAE7B,EAEJ,GAAc,KAAM,EAAc;MAIlC,QAAO;;AAQV,QAAO;;;;AC/NR,SAAgB,EAAa,GAAK,GAAG,GAAO,GAAM;CAEjD,IAAM,IAAK,EAAI,GACT,IAAK,EAAI,GACT,IAAK,EAAI,GAEX,IAAK,GACL,IAAK,IAAI,GACT,IAAK,IAAI;AAmBb,CAlBK,MAEJ,IAAK,EAAM,KAAM,EAAI,EACrB,IAAK,EAAM,KAAM,EAAI,EACrB,IAAK,EAAM,KAAM,EAAI,GAItB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EAErB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EAErB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI,EACrB,EAAG,IAAI,EAAI,KAAM,EAAI;;;;ACxBtB,SAAS,GAAe,GAAK,GAAgB,GAAK,GAAQ,GAAO,GAAe,GAAM,GAAM;CAE3F,IAAM,EAAE,aAAU,uBAAoB;AACtC,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,IAGpD,IAAc,GAAU,GAAgB,GAAK,GAAG,GAAe,GAAM,EAAK;;AAO5E,SAAS,GAAqB,GAAK,GAAgB,GAAK,GAAQ,GAAO,GAAM,GAAM;CAElF,IAAM,EAAE,aAAU,uBAAoB,GAClC,IAAO,UACP,IAAM;AACV,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,KAAO;EAE3D,IAAI;AAKJ,EAHA,IAAe,GAAc,GAAU,GAAgB,GAAK,GAAG,MAAM,GAAM,EAAK,EAG3E,KAAgB,EAAa,WAAW,MAE5C,IAAM,GACN,IAAO,EAAa;;AAMtB,QAAO;;AAIR,SAASQ,GACR,GACA,GACA,GACA,GACA,GACA,GACA,GACC;CAED,IAAM,EAAE,gBAAa,GACf,EAAE,aAAU,GACZ,IAAM,EAAS,WAAW;AAChC,MAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;EAEvD,IAAI;AAOJ,MALA,IAAM,GAEN,EAAa,GAAU,IAAM,GAAG,GAAO,EAAK,EAC5C,EAAS,cAAc,IAElB,EAAwB,GAAU,GAAK,GAAW,EAAO,CAE7D,QAAO;;AAMT,QAAO;;;;ACpER,SAAS,GAAO,GAAK,IAAc,MAAO;AAEzC,CAAK,KAAe,MAAM,QAAS,EAAa,KAE/C,IAAc,IAAI,IAAK,EAAa;CAIrC,IAAM,IAAW,EAAI,UACf,IAAW,EAAS,QAAQ,EAAS,MAAM,QAAQ,MACnD,IAAU,EAAS,WAAW,UAEhC,GAAQ,GAAa,GAAa,GAClC,IAAa,GACX,IAAQ,EAAI;AAClB,MAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,IAQzC,CANA,IAAS,EAAO,IAChB,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAe,IAAI,aAAc,EAAQ,EAEzC,EAAW,GAAG,EAAY,EAC1B,KAAc,EAAO;CAItB,SAAS,EAAW,GAAa,GAAY,IAAQ,IAAQ;EAE5D,IAAM,IAAc,IAAc;AAClC,MAAK,EAAS,GAAa,EAAa,EAAG;GAE1C,IAAM,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa,EAE3C,IAAO,UACP,IAAO,UACP,IAAO,UACP,IAAO,WACP,IAAO,WACP,IAAO;AAGX,QAAM,IAAI,IAAI,IAAI,GAAQ,IAAI,KAAM,IAAS,IAAS,IAAI,GAAG,KAAO;IAEnE,IAAI,IAAQ,EAAU,IAChB,IAAI,EAAQ,KAAM,EAAO,EACzB,IAAI,EAAQ,KAAM,EAAO,EACzB,IAAI,EAAQ,KAAM,EAAO;AAS/B,IAPK,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO,IAElB,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO,IAElB,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO;;AA2BvB,UArBA,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KAEpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KAGpC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAElC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAE3B,MAIA;SAIF;GAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa,EAIhD,IAAgB,GAChB,IAAe,IACf,IAAgB;AAEpB,OAAK;QAIC,CAAE,GAAgB;KAEtB,IAAM,IAAa,IAAA,IAAyB,IAAA,IACtC,IAAc,IAAA,IAA0B,IAAA;AAG9C,KAFA,IAAe,EAAY,IAAK,EAAY,EAC5C,IAAgB,EAAY,IAAK,EAAa,EAC9C,IAAgB,CAAE,KAAgB,CAAE;;SAOrC,CADA,IAAe,IACf,IAAgB;GAIjB,IAAM,IAAe,KAAiB,GAChC,IAAgB,KAAiB,GAEnC,IAAa;AACjB,GAAK,MAEJ,IAAa,EAAW,GAAM,GAAY,EAAe;GAI1D,IAAI,IAAc;AAClB,GAAK,MAEJ,IAAc,EAAW,GAAO,GAAY,EAAe;GAI5D,IAAM,IAAY,KAAc;AAChC,OAAK,EAEJ,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;IAE9B,IAAM,IAAS,IAAO,GAChB,IAAU,IAAQ,GAClB,IAAe,EAAc,IAC7B,IAAe,EAAc,IAAS,IACtC,IAAgB,EAAc,IAC9B,IAAgB,EAAc,IAAU;AAG9C,IADA,EAAc,IAAc,KAAM,IAAe,IAAgB,IAAe,GAChF,EAAc,IAAc,IAAI,KAAM,IAAe,IAAgB,IAAe;;AAMtF,UAAO;;;;;;AClKV,SAAgB,EAAsB,GAAa,GAAO,GAAK,GAAM,GAAM;CAK1E,IAAI,GAAM,GAAM,GAAO,GAAO,GAAO,GAE/B,IAAU,IAAI,EAAI,UAAU,GACjC,IAAU,IAAI,EAAI,UAAU,GAC5B,IAAU,IAAI,EAAI,UAAU,GAEvB,IAAK,EAAI,OAAO,GAChB,IAAK,EAAI,OAAO,GAChB,IAAK,EAAI,OAAO,GAElB,IAAO,EAAO,IACd,IAAO,EAAO,IAAc,IAE5B,IAAO,EAAO,IAAc,IAC5B,IAAO,EAAO,IAAc,IAAI,IAEhC,IAAO,EAAO,IAAc,IAC5B,IAAO,EAAO,IAAc,IAAI;AAoDpC,QAlDK,KAAW,KAEf,KAAS,IAAO,KAAO,GACvB,KAAS,IAAO,KAAO,MAIvB,KAAS,IAAO,KAAO,GACvB,KAAS,IAAO,KAAO,IAInB,KAAW,KAEf,KAAU,IAAO,KAAO,GACxB,KAAU,IAAO,KAAO,MAIxB,KAAU,IAAO,KAAO,GACxB,KAAU,IAAO,KAAO,IAIlB,IAAO,KAAa,IAAQ,OAE9B,IAAQ,KAAQ,MAAO,EAAM,MAAG,IAAO,KAEvC,IAAQ,KAAQ,MAAO,EAAM,MAAG,IAAO,IAEvC,KAAW,KAEf,KAAU,IAAO,KAAO,GACxB,KAAU,IAAO,KAAO,MAIxB,KAAU,IAAO,KAAO,GACxB,KAAU,IAAO,KAAO,IAIlB,IAAO,KAAa,IAAQ,KAAgB,OAE9C,IAAQ,KAAQ,MAAS,OAAO,IAAO,KAEvC,IAAQ,KAAQ,MAAS,OAAO,IAAO,IAIrC,KAAQ,KAAO,KAAQ;;;;ACpE/B,SAAS,GAAwB,GAAK,GAAgB,GAAK,GAAQ,GAAO,GAAe,GAAM,GAAM;CAEpG,IAAM,EAAE,aAAU,uBAAoB;AACtC,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,IAGpD,IAAc,GAAU,GAAgB,GAD/B,IAAkB,EAAiB,KAAM,GACD,GAAe,GAAM,EAAK;;AAO7E,SAAS,GAA8B,GAAK,GAAgB,GAAK,GAAQ,GAAO,GAAM,GAAM;CAE3F,IAAM,EAAE,aAAU,uBAAoB,GAClC,IAAO,UACP,IAAM;AACV,MAAM,IAAI,IAAI,GAAQ,IAAM,IAAS,GAAO,IAAI,GAAK,KAAO;EAE3D,IAAI;AAIJ,EAHA,IAAe,GAAc,GAAU,GAAgB,GAAK,IAAkB,EAAiB,KAAM,GAAG,MAAM,GAAM,EAAK,EAGpH,KAAgB,EAAa,WAAW,MAE5C,IAAM,GACN,IAAO,EAAa;;AAMtB,QAAO;;AAIR,SAAS,GACR,GACA,GACA,GACA,GACA,GACA,GACA,GACC;CAED,IAAM,EAAE,gBAAa,GACf,EAAE,aAAU,GACZ,IAAM,EAAS,WAAW;AAChC,MAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;EAEvD,IAAI;AAMJ,MALA,IAAM,EAAI,qBAAsB,EAAG,EAEnC,EAAa,GAAU,IAAM,GAAG,GAAO,EAAK,EAC5C,EAAS,cAAc,IAElB,EAAwB,GAAU,GAAK,GAAW,EAAO,CAE7D,QAAO;;AAMT,QAAO;;;;AC/DR,SAAS,GAAS,GAAK,GAAM,GAAgB,GAAK,GAAY,GAAM,GAAM;AAIzE,CAFA,EAAY,UAAW,EAAI,OAAQ,GAAQ,EAC3C,GAAU,GAAG,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK,EAC9D,EAAY,aAAa;;AAI1B,SAASC,GAAU,GAAa,GAAK,GAAgB,GAAK,GAAY,GAAM,GAAM;CAEjF,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC7C,IAAc,IAAc;AAElC,KADe,EAAS,GAAa,EAAa,CAOjD,IAAe,GAAK,GAAgB,GAJrB,EAAQ,GAAa,EAAa,EACnC,EAAO,GAAa,EAAa,EAGS,GAAY,GAAM,EAAK;MAGzE;EAEN,IAAM,IAAY,EAAW,EAAa;AAC1C,EAAK,EAAsB,GAAW,GAAc,GAAK,GAAM,EAAK,IAEnE,GAAU,GAAW,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK;EAIvE,IAAM,IAAa,EAAY,GAAa,EAAa;AACzD,EAAK,EAAsB,GAAY,GAAc,GAAK,GAAM,EAAK,IAEpE,GAAU,GAAY,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK;;;;;AClC1E,IAAMC,KAAa;CAAE;CAAK;CAAK;CAAK;AAEpC,SAAS,GAAc,GAAK,GAAM,GAAgB,GAAK,GAAM,GAAM;AAElE,GAAY,UAAW,EAAI,OAAQ,GAAQ;CAC3C,IAAM,IAASC,GAAe,GAAG,GAAK,GAAgB,GAAK,GAAM,EAAK;AAGtE,QAFA,EAAY,aAAa,EAElB;;AAIR,SAASA,GAAe,GAAa,GAAK,GAAgB,GAAK,GAAM,GAAM;CAE1E,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAGhC,KADe,EAAS,GAAa,EAAa,CAQjD,QAAO,GAAqB,GAAK,GAAgB,GALlC,EAAQ,GAAa,EAAa,EACnC,EAAO,GAAa,EAAa,EAIsB,GAAM,EAAK;CAG1E;EAIN,IAAM,IAAY,EAAY,GAAa,EAAa,EAClD,IAAUD,GAAY,IAEtB,IADS,EAAI,UAAW,MACA,GAG1B,GAAI;AACR,EAAK,KAEJ,IAAK,EAAW,EAAa,EAC7B,IAAK,EAAY,GAAa,EAAa,KAI3C,IAAK,EAAY,GAAa,EAAa,EAC3C,IAAK,EAAW,EAAa;EAK9B,IAAM,IADiB,EAAsB,GAAI,GAAc,GAAK,GAAM,EAAK,GAC7CC,GAAe,GAAI,GAAK,GAAgB,GAAK,GAAM,EAAK,GAAG;AAI7F,MAAK,GAAW;GAIf,IAAM,IAAQ,EAAS,MAAO;AAK9B,OAJkB,IACjB,KAAS,EAAc,IAAK,KAC5B,KAAS,EAAc,IAAK,IAAY,GAIxC,QAAO;;EAST,IAAM,IADiB,EAAsB,GAAI,GAAc,GAAK,GAAM,EAAK,GAC7CA,GAAe,GAAI,GAAK,GAAgB,GAAK,GAAM,EAAK,GAAG;AAQ5F,SANI,KAAY,IAET,EAAS,YAAY,EAAS,WAAW,IAAW,IAIpD,KAAY,KAAY;;;;;AChFlC,IAAMC,qBAA8B,IAAI,GAAM,EACxCC,qBAA2B,IAAI,GAAkB,EACjDC,qBAA4B,IAAI,GAAkB,EAClDC,qBAA8B,IAAI,GAAS,EAE3CC,qBAAsB,IAAI,GAAa,EACvCC,qBAAuB,IAAI,GAAa;AAE9C,SAAS,GAAoB,GAAK,GAAM,GAAe,GAAgB;AAEtE,GAAY,UAAW,EAAI,OAAQ,GAAQ;CAC3C,IAAM,IAASC,GAAqB,GAAG,GAAK,GAAe,EAAe;AAG1E,QAFA,EAAY,aAAa,EAElB;;AAIR,SAASA,GAAqB,GAAa,GAAK,GAAe,GAAe,IAAY,MAAO;CAEhG,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAgBhC,KAdK,MAAc,SAEX,EAAc,eAEpB,EAAc,oBAAoB,EAInC,GAAI,IAAK,EAAc,YAAY,KAAK,EAAc,YAAY,KAAK,EAAe,EACtF,IAAYF,KAIE,EAAS,GAAa,EAAa,EACpC;EAEb,IAAM,IAAe,EAAI,UACnB,IAAY,EAAa,OACzB,IAAU,EAAa,WAAW,UAElC,IAAa,EAAc,OAC3B,IAAW,EAAc,WAAW,UAEpC,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa;AAO/C,MAFA,GAAY,KAAM,EAAe,CAAC,QAAQ,EAErC,EAAc,WAwClB,QArCA,EAAY,EAAqB,EAAa,EAAE,GAAcC,GAAM,EACpE,GAAK,OAAO,KAAMF,GAAa,EAC/B,GAAK,cAAc,IAGP,EAAc,WAAW,UAAW;GAE/C,mBAAkB,MAAOE,GAAK,cAAe,EAAK;GAElD,qBAAoB,MAAO;AAK1B,IAHA,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,cAAc;AAGlB,SAAM,IAAI,IAAI,IAAS,GAAG,KAAM,IAAQ,KAAW,GAAG,IAAI,GAAG,KAAK,EAKjE,KAFA,EAAaH,IAAW,GAAG,GAAW,EAAS,EAC/C,GAAU,cAAc,IACnB,EAAI,mBAAoBA,GAAW,CAEvC,QAAO;AAOT,WAAO;;GAIR,CAAE;EAIG;GAGN,IAAM,IAAqB,GAAa,EAAe;AAGvD,QAAM,IAAI,IAAI,IAAS,GAAG,KAAM,IAAQ,KAAW,GAAG,IAAI,GAAG,KAAK,GAAI;AASrE,IANA,EAAaD,IAAU,GAAG,GAAW,EAAS,EAG9C,GAAS,EAAE,aAAcE,GAAa,EACtC,GAAS,EAAE,aAAcA,GAAa,EACtC,GAAS,EAAE,aAAcA,GAAa,EACtC,GAAS,cAAc;AAEvB,SAAM,IAAI,IAAK,GAAG,IAAK,IAAqB,GAAG,IAAK,GAAI,KAAM,EAK7D,KAHA,EAAaD,IAAW,GAAI,GAAY,EAAU,EAClD,GAAU,cAAc,IAEnBD,GAAS,mBAAoBC,GAAW,CAE5C,QAAO;;;QAYL;EAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa;AAgBpD,SAdA,EAAY,EAAqB,EAAM,EAAE,GAAcF,GAAa,EAYpE,GAVC,EAAU,cAAeA,GAAa,IACtCM,GAAqB,GAAM,GAAK,GAAe,GAAe,EAAW,KAI1E,EAAY,EAAqB,EAAO,EAAE,GAAcN,GAAa,EAEpE,EAAU,cAAeA,GAAa,IACtCM,GAAqB,GAAO,GAAK,GAAe,GAAe,EAAW;;;;;ACvJ7E,IAAMC,qBAA6B,IAAI,GAAS,EAC1CC,qBAAsB,IAAI,GAAa,EACvCC,qBAAuB,IAAI,GAAa,EACxCC,qBAAwB,IAAI,GAAS,EACrCC,qBAAwB,IAAI,GAAS,EACrCC,qBAAwB,IAAI,GAAS,EACrCC,qBAAwB,IAAI,GAAS;AAE3C,SAAS,GACR,GACA,GACA,GACA,IAAU,EAAG,EACb,IAAU,EAAG,EACb,IAAe,GACf,IAAe,UACd;AASD,CAPO,EAAc,eAEpB,EAAc,oBAAoB,EAInC,GAAI,IAAK,EAAc,YAAY,KAAK,EAAc,YAAY,KAAK,EAAe,EACtF,GAAI,cAAc;CAElB,IAAM,IAAW,EAAI,UACf,IAAM,EAAS,WAAW,UAC1B,IAAQ,EAAS,OACjB,IAAW,EAAc,WAAW,UACpC,IAAa,EAAc,OAC3B,IAAW,EAAqB,cAAc,EAC9C,IAAY,EAAqB,cAAc,EAEjD,IAAcH,IACd,IAAkBC,IAClB,IAAc,MACd,IAAkB;AAEtB,CAAK,MAEJ,IAAcC,IACd,IAAkBC;CAInB,IAAI,IAAkB,UAClB,IAA0B,MAC1B,IAA+B;AAgMnC,QA/LA,GAAW,KAAM,EAAe,CAAC,QAAQ,EACzC,GAAK,OAAO,KAAMN,GAAY,EAC9B,EAAI,UACH;EAEC,sBAAqB,MAEbC,GAAI,cAAe,EAAK;EAIhC,mBAAoB,GAAK,GAAQ,MAE3B,IAAQ,KAAmB,IAAQ,KAIlC,MAEJ,GAAK,IAAI,KAAM,EAAI,IAAK,EACxB,GAAK,IAAI,KAAM,EAAI,IAAK,EACxB,GAAK,cAAc,KAIb,MAID;EAIR,kBAAmB,GAAQ,MAAW;AAErC,OAAK,EAAc,WAKlB,QADiB,EAAc,WACf,UAAW;IAC1B,sBAAqB,MAEbC,GAAK,cAAe,EAAK;IAIjC,mBAAoB,GAAK,GAAQ,MAEzB,IAAQ,KAAmB,IAAQ;IAI3C,kBAAmB,GAAa,MAAgB;AAE/C,UAAM,IAAI,IAAK,GAAa,IAAK,IAAc,GAAY,IAAK,GAAI,KAAQ;AAQ3E,MALA,EAAa,GAAW,IAAI,GAAI,GAAY,EAAU,EAEtD,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,WAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;AAKvD,OAFA,EAAa,GAAU,IAAI,GAAG,GAAO,EAAK,EAE1C,EAAS,cAAc;OAEvB,IAAM,IAAO,EAAS,mBAAoB,GAAW,GAAa,EAAa;AAkB/E,WAjBK,IAAO,MAEX,EAAgB,KAAM,EAAa,EAE9B,KAEJ,EAAgB,KAAM,EAAa,EAIpC,IAAkB,GAClB,IAA0B,GAC1B,IAA+B,IAK3B,IAAO,EAEX,QAAO;;;;IASX,CAAE;GAEG;IAGN,IAAM,IAAW,GAAa,EAAe;AAC7C,SAAM,IAAI,IAAK,GAAG,IAAK,GAAU,IAAK,GAAI,KAAQ;AAMjD,KAJA,EAAa,GAAW,IAAI,GAAI,GAAY,EAAU,EACtD,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,UAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;AAKvD,MAFA,EAAa,GAAU,IAAI,GAAG,GAAO,EAAK,EAE1C,EAAS,cAAc;MAEvB,IAAM,IAAO,EAAS,mBAAoB,GAAW,GAAa,EAAa;AAkB/E,UAjBK,IAAO,MAEX,EAAgB,KAAM,EAAa,EAE9B,KAEJ,EAAgB,KAAM,EAAa,EAIpC,IAAkB,GAClB,IAA0B,GAC1B,IAA+B,IAK3B,IAAO,EAEX,QAAO;;;;;EAYZ,CAED,EAED,EAAqB,iBAAkB,EAAU,EACjD,EAAqB,iBAAkB,EAAW,EAE7C,MAAoB,WAEjB,QAID,EAAQ,QAMd,EAAQ,MAAM,KAAM,EAAiB,GAJrC,EAAQ,QAAQ,EAAgB,OAAO,EAQxC,EAAQ,WAAW,GACnB,EAAQ,YAAY,GAEf,MAEG,EAAQ,QACV,EAAQ,MAAM,KAAM,EAAiB,GADnB,EAAQ,QAAQ,EAAgB,OAAO,EAE9D,EAAQ,MAAM,aAAcF,GAAY,EACxC,EAAgB,aAAcA,GAAY,EAC1C,EAAQ,WAAW,EAAgB,IAAK,EAAQ,MAAO,CAAC,QAAQ,EAChE,EAAQ,YAAY,IAId;;;;ACpPR,SAAS,GAAgB,GAAK,IAAc,MAAO;AAElD,CAAK,KAAe,MAAM,QAAS,EAAa,KAE/C,IAAc,IAAI,IAAK,EAAa;CAIrC,IAAM,IAAW,EAAI,UACf,IAAW,EAAS,QAAQ,EAAS,MAAM,QAAQ,MACnD,IAAU,EAAS,WAAW,UAEhC,GAAQ,GAAa,GAAa,GAClC,IAAa,GACX,IAAQ,EAAI;AAClB,MAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,IAQzC,CANA,IAAS,EAAO,IAChB,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAc,IAAI,YAAa,EAAQ,EACvC,IAAe,IAAI,aAAc,EAAQ,EAEzC,EAAW,GAAG,EAAY,EAC1B,KAAc,EAAO;CAItB,SAAS,EAAW,GAAa,GAAY,IAAQ,IAAQ;EAE5D,IAAM,IAAc,IAAc;AAClC,MAAK,EAAS,GAAa,EAAa,EAAG;GAE1C,IAAM,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa,EAE3C,IAAO,UACP,IAAO,UACP,IAAO,UACP,IAAO,WACP,IAAO,WACP,IAAO;AAEX,QAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;IAEvD,IAAM,IAAI,IAAI,EAAI,qBAAsB,EAAG;AAC3C,SAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;KAE9B,IAAI,IAAQ,IAAI;AAChB,SAAQ,IAAW,EAAU,KAAU;KAEvC,IAAM,IAAI,EAAQ,KAAM,EAAO,EACzB,IAAI,EAAQ,KAAM,EAAO,EACzB,IAAI,EAAQ,KAAM,EAAO;AAS/B,KAPK,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO,IAElB,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO,IAElB,IAAI,MAAO,IAAO,IAClB,IAAI,MAAO,IAAO;;;AA8BxB,UArBA,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KAEpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KACpC,EAAc,IAAc,OAAQ,KAGpC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAElC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAClC,EAAc,IAAc,KAAM,GAE3B,MAIA;SAIF;GAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa,EAIhD,IAAgB,GAChB,IAAe,IACf,IAAgB;AAEpB,OAAK;QAIC,CAAE,GAAgB;KAEtB,IAAM,IAAa,IAAA,IAAyB,IAAA,IACtC,IAAc,IAAA,IAA0B,IAAA;AAG9C,KAFA,IAAe,EAAY,IAAK,EAAY,EAC5C,IAAgB,EAAY,IAAK,EAAa,EAC9C,IAAgB,CAAE,KAAgB,CAAE;;SAOrC,CADA,IAAe,IACf,IAAgB;GAIjB,IAAM,IAAe,KAAiB,GAChC,IAAgB,KAAiB,GAEnC,IAAa;AACjB,GAAK,MAEJ,IAAa,EAAW,GAAM,GAAY,EAAe;GAI1D,IAAI,IAAc;AAClB,GAAK,MAEJ,IAAc,EAAW,GAAO,GAAY,EAAe;GAI5D,IAAM,IAAY,KAAc;AAChC,OAAK,EAEJ,MAAM,IAAI,IAAI,GAAG,IAAI,GAAG,KAAO;IAE9B,IAAM,IAAS,IAAO,GAChB,IAAU,IAAQ,GAClB,IAAe,EAAc,IAC7B,IAAe,EAAc,IAAS,IACtC,IAAgB,EAAc,IAC9B,IAAgB,EAAc,IAAU;AAG9C,IADA,EAAc,IAAc,KAAM,IAAe,IAAgB,IAAe,GAChF,EAAc,IAAc,IAAI,KAAM,IAAe,IAAgB,IAAe;;AAMtF,UAAO;;;;;;AChKV,SAAS,GAAkB,GAAK,GAAM,GAAgB,GAAK,GAAY,GAAM,GAAM;AAIlF,CAFA,EAAY,UAAW,EAAI,OAAQ,GAAQ,EAC3C,GAAU,GAAG,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK,EAC9D,EAAY,aAAa;;AAI1B,SAAS,GAAU,GAAa,GAAK,GAAgB,GAAK,GAAY,GAAM,GAAM;CAEjF,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC7C,IAAc,IAAc;AAElC,KADe,EAAS,GAAa,EAAa,CAMjD,IAAwB,GAAK,GAAgB,GAH9B,EAAQ,GAAa,EAAa,EACnC,EAAO,GAAa,EAAa,EAEkB,GAAY,GAAM,EAAK;MAGlF;EAEN,IAAM,IAAY,EAAW,EAAa;AAC1C,EAAK,EAAsB,GAAW,GAAc,GAAK,GAAM,EAAK,IAEnE,GAAU,GAAW,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK;EAIvE,IAAM,IAAa,EAAY,GAAa,EAAa;AACzD,EAAK,EAAsB,GAAY,GAAc,GAAK,GAAM,EAAK,IAEpE,GAAU,GAAY,GAAK,GAAgB,GAAK,GAAY,GAAM,EAAK;;;;;ACjC1E,IAAM,KAAa;CAAE;CAAK;CAAK;CAAK;AAEpC,SAAS,GAAuB,GAAK,GAAM,GAAgB,GAAK,GAAM,GAAM;AAE3E,GAAY,UAAW,EAAI,OAAQ,GAAQ;CAC3C,IAAM,IAAS,GAAe,GAAG,GAAK,GAAgB,GAAK,GAAM,EAAK;AAGtE,QAFA,EAAY,aAAa,EAElB;;AAIR,SAAS,GAAe,GAAa,GAAK,GAAgB,GAAK,GAAM,GAAM;CAE1E,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAGhC,KADe,EAAS,GAAa,EAAa,CAMjD,QAAO,GAA8B,GAAK,GAAgB,GAH3C,EAAQ,GAAa,EAAa,EACnC,EAAO,GAAa,EAAa,EAE+B,GAAM,EAAK;CAGnF;EAIN,IAAM,IAAY,EAAY,GAAa,EAAa,EAClD,IAAU,GAAY,IAEtB,IADS,EAAI,UAAW,MACA,GAG1B,GAAI;AACR,EAAK,KAEJ,IAAK,EAAW,EAAa,EAC7B,IAAK,EAAY,GAAa,EAAa,KAI3C,IAAK,EAAY,GAAa,EAAa,EAC3C,IAAK,EAAW,EAAa;EAK9B,IAAM,IADiB,EAAsB,GAAI,GAAc,GAAK,GAAM,EAAK,GAC7C,GAAe,GAAI,GAAK,GAAgB,GAAK,GAAM,EAAK,GAAG;AAI7F,MAAK,GAAW;GAIf,IAAM,IAAQ,EAAS,MAAO;AAK9B,OAJkB,IACjB,KAAS,EAAc,IAAK,KAC5B,KAAS,EAAc,IAAK,IAAY,GAIxC,QAAO;;EAST,IAAM,IADiB,EAAsB,GAAI,GAAc,GAAK,GAAM,EAAK,GAC7C,GAAe,GAAI,GAAK,GAAgB,GAAK,GAAM,EAAK,GAAG;AAQ5F,SANI,KAAY,IAET,EAAS,YAAY,EAAS,WAAW,IAAW,IAIpD,KAAY,KAAY;;;;;AC9ElC,IAAM,qBAA8B,IAAI,GAAM,EACxC,qBAA2B,IAAI,GAAkB,EACjD,qBAA4B,IAAI,GAAkB,EAClD,qBAA8B,IAAI,GAAS,EAE3CO,qBAAsB,IAAI,GAAa,EACvCC,qBAAuB,IAAI,GAAa;AAE9C,SAAS,GAA6B,GAAK,GAAM,GAAe,GAAgB;AAE/E,GAAY,UAAW,EAAI,OAAQ,GAAQ;CAC3C,IAAM,IAAS,GAAqB,GAAG,GAAK,GAAe,EAAe;AAG1E,QAFA,EAAY,aAAa,EAElB;;AAIR,SAAS,GAAqB,GAAa,GAAK,GAAe,GAAe,IAAY,MAAO;CAEhG,IAAM,EAAE,iBAAc,gBAAa,mBAAgB,GAC/C,IAAc,IAAc;AAgBhC,KAdK,MAAc,SAEX,EAAc,eAEpB,EAAc,oBAAoB,EAInC,GAAI,IAAK,EAAc,YAAY,KAAK,EAAc,YAAY,KAAK,EAAe,EACtF,IAAYD,KAIE,EAAS,GAAa,EAAa,EACpC;EAEb,IAAM,IAAe,EAAI,UACnB,IAAY,EAAa,OACzB,IAAU,EAAa,WAAW,UAElC,IAAa,EAAc,OAC3B,IAAW,EAAc,WAAW,UAEpC,IAAS,EAAQ,GAAa,EAAa,EAC3C,IAAQ,EAAO,GAAa,EAAa;AAO/C,MAFA,GAAY,KAAM,EAAe,CAAC,QAAQ,EAErC,EAAc,WAuClB,QApCA,EAAY,EAAqB,EAAa,EAAE,GAAcC,GAAM,EACpE,GAAK,OAAO,KAAM,GAAa,EAC/B,GAAK,cAAc,IAGP,EAAc,WAAW,UAAW;GAE/C,mBAAkB,MAAOA,GAAK,cAAe,EAAK;GAElD,qBAAoB,MAAO;AAK1B,IAHA,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,EAAE,aAAc,EAAe,EACnC,EAAI,cAAc;AAElB,SAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,IAKhD,KAFA,EAAa,IAAW,IAAI,EAAI,qBAAsB,EAAG,EAAE,GAAW,EAAS,EAC/E,GAAU,cAAc,IACnB,EAAI,mBAAoB,GAAW,CAEvC,QAAO;AAOT,WAAO;;GAIR,CAAE;EAIG;GAGN,IAAM,IAAqB,GAAa,EAAe;AAEvD,QAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;AAUvD,IANA,EAAa,IAAU,IADZ,EAAI,qBAAsB,EAAG,EACT,GAAW,EAAS,EAGnD,GAAS,EAAE,aAAc,GAAa,EACtC,GAAS,EAAE,aAAc,GAAa,EACtC,GAAS,EAAE,aAAc,GAAa,EACtC,GAAS,cAAc;AAEvB,SAAM,IAAI,IAAK,GAAG,IAAK,IAAqB,GAAG,IAAK,GAAI,KAAM,EAK7D,KAHA,EAAa,IAAW,GAAI,GAAY,EAAU,EAClD,GAAU,cAAc,IAEnB,GAAS,mBAAoB,GAAW,CAE5C,QAAO;;;QAWL;EAEN,IAAM,IAAO,EAAW,EAAa,EAC/B,IAAQ,EAAY,GAAa,EAAa;AAgBpD,SAdA,EAAY,EAAqB,EAAM,EAAE,GAAc,GAAa,EAYpE,GAVC,EAAU,cAAe,GAAa,IACtC,GAAqB,GAAM,GAAK,GAAe,GAAe,EAAW,KAI1E,EAAY,EAAqB,EAAO,EAAE,GAAc,GAAa,EAEpE,EAAU,cAAe,GAAa,IACtC,GAAqB,GAAO,GAAK,GAAe,GAAe,EAAW;;;;;ACrJ7E,IAAM,qBAA6B,IAAI,GAAS,EAC1C,qBAAsB,IAAI,GAAa,EACvC,qBAAuB,IAAI,GAAa,EACxC,qBAAwB,IAAI,GAAS,EACrC,qBAAwB,IAAI,GAAS,EACrC,qBAAwB,IAAI,GAAS,EACrC,qBAAwB,IAAI,GAAS;AAE3C,SAAS,GACR,GACA,GACA,GACA,IAAU,EAAG,EACb,IAAU,EAAG,EACb,IAAe,GACf,IAAe,UACd;AASD,CAPO,EAAc,eAEpB,EAAc,oBAAoB,EAInC,GAAI,IAAK,EAAc,YAAY,KAAK,EAAc,YAAY,KAAK,EAAe,EACtF,GAAI,cAAc;CAElB,IAAM,IAAW,EAAI,UACf,IAAM,EAAS,WAAW,UAC1B,IAAQ,EAAS,OACjB,IAAW,EAAc,WAAW,UACpC,IAAa,EAAc,OAC3B,IAAW,EAAqB,cAAc,EAC9C,IAAY,EAAqB,cAAc,EAEjD,IAAc,IACd,IAAkB,IAClB,IAAc,MACd,IAAkB;AAEtB,CAAK,MAEJ,IAAc,IACd,IAAkB;CAInB,IAAI,IAAkB,UAClB,IAA0B,MAC1B,IAA+B;AAgMnC,QA/LA,GAAW,KAAM,EAAe,CAAC,QAAQ,EACzC,GAAK,OAAO,KAAM,GAAY,EAC9B,EAAI,UACH;EAEC,sBAAqB,MAEb,GAAI,cAAe,EAAK;EAIhC,mBAAoB,GAAK,GAAQ,MAE3B,IAAQ,KAAmB,IAAQ,KAIlC,MAEJ,GAAK,IAAI,KAAM,EAAI,IAAK,EACxB,GAAK,IAAI,KAAM,EAAI,IAAK,EACxB,GAAK,cAAc,KAIb,MAID;EAIR,kBAAmB,GAAQ,MAAW;AAErC,OAAK,EAAc,YAAa;IAI/B,IAAM,IAAW,EAAc;AAC/B,WAAO,EAAS,UAAW;KAC1B,sBAAqB,MAEb,GAAK,cAAe,EAAK;KAIjC,mBAAoB,GAAK,GAAQ,MAEzB,IAAQ,KAAmB,IAAQ;KAI3C,kBAAmB,GAAa,MAAgB;AAE/C,WAAM,IAAI,IAAK,GAAa,IAAK,IAAc,GAAY,IAAK,GAAI,KAAQ;AAQ3E,OALA,EAAa,GAAW,IADZ,EAAS,qBAAsB,EAAI,EACd,GAAY,EAAU,EAEvD,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,YAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;AAKvD,QAFA,EAAa,GAAU,IADZ,EAAI,qBAAsB,EAAG,EACT,GAAO,EAAK,EAE3C,EAAS,cAAc;QAEvB,IAAM,IAAO,EAAS,mBAAoB,GAAW,GAAa,EAAa;AAkB/E,YAjBK,IAAO,MAEX,EAAgB,KAAM,EAAa,EAE9B,KAEJ,EAAgB,KAAM,EAAa,EAIpC,IAAkB,GAClB,IAA0B,GAC1B,IAA+B,IAK3B,IAAO,EAEX,QAAO;;;;KASX,CAAE;UAEG;IAGN,IAAM,IAAW,GAAa,EAAe;AAC7C,SAAM,IAAI,IAAK,GAAG,IAAK,GAAU,IAAK,GAAI,KAAQ;AAMjD,KAJA,EAAa,GAAW,IAAI,GAAI,GAAY,EAAU,EACtD,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,UAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;AAKvD,MAFA,EAAa,GAAU,IADZ,EAAI,qBAAsB,EAAG,EACT,GAAO,EAAK,EAE3C,EAAS,cAAc;MAEvB,IAAM,IAAO,EAAS,mBAAoB,GAAW,GAAa,EAAa;AAkB/E,UAjBK,IAAO,MAEX,EAAgB,KAAM,EAAa,EAE9B,KAEJ,EAAgB,KAAM,EAAa,EAIpC,IAAkB,GAClB,IAA0B,GAC1B,IAA+B,IAK3B,IAAO,EAEX,QAAO;;;;;EAYZ,CAED,EAED,EAAqB,iBAAkB,EAAU,EACjD,EAAqB,iBAAkB,EAAW,EAE7C,MAAoB,WAEjB,QAID,EAAQ,QAMd,EAAQ,MAAM,KAAM,EAAiB,GAJrC,EAAQ,QAAQ,EAAgB,OAAO,EAQxC,EAAQ,WAAW,GACnB,EAAQ,YAAY,GAEf,MAEG,EAAQ,QACV,EAAQ,MAAM,KAAM,EAAiB,GADnB,EAAQ,QAAQ,EAAgB,OAAO,EAE9D,EAAQ,MAAM,aAAc,GAAY,EACxC,EAAgB,aAAc,GAAY,EAC1C,EAAQ,WAAW,EAAgB,IAAK,EAAQ,MAAO,CAAC,QAAQ,EAChE,EAAQ,YAAY,IAId;;;;ACzPR,SAAgB,GAAyB,GAAK,GAAQ,GAAY;AAYjE,QAVK,MAAQ,OAEL,QAIR,EAAI,MAAM,aAAc,EAAO,YAAa,EAC5C,EAAI,WAAW,EAAI,MAAM,WAAY,EAAU,IAAI,OAAQ,EAC3D,EAAI,SAAS,GAEN;;;;ACaR,IAAM,qBAAuB,IAAI,GAAa,EACxCC,qBAAuB,IAAI,GAAK,EAChC,qBAA6B,IAAI,GAAS,EAC1CC,qBAAiC,IAAI,GAAS,EAC9C,qBAA8B,IAAI,GAAS,EAC3C,KAAW;CAAE;CAAQ;CAAQ;CAAQ,EA6D9B,KAAb,MAAa,UAAgB,GAAY;CAkBxC,OAAO,UAAW,GAAK,IAAU,EAAE,EAAG;AAErC,MAAU;GACT,cAAc;GACd,GAAG;GACH;EAED,IAAM,IAAW,EAAI,UACf,IAAW,EAAI,QACf,IAAiB,EAAI,iBACrB,IAAiB,EAAS,UAAU,EACpC,IAAS;GACd,SAAS;GACT,OAAO;GACP,OAAO;GACP,gBAAgB;GAChB;AAeD,SAdK,EAAQ,gBAEZ,EAAO,QAAQ,EAAS,KAAK,MAAQ,EAAK,OAAO,CAAE,EACnD,EAAO,QAAQ,IAAiB,EAAe,MAAM,OAAO,GAAG,MAC/D,EAAO,iBAAiB,IAAiB,EAAe,OAAO,GAAG,SAIlE,EAAO,QAAQ,GACf,EAAO,QAAQ,IAAiB,EAAe,QAAQ,MACvD,EAAO,iBAAiB,IAIlB;;CAiBR,OAAO,YAAa,GAAM,GAAU,IAAU,EAAE,EAAG;AAElD,MAAU;GACT,UAAU;GACV,UAAU,EAAS,EAAK;GACxB,GAAG;GACH;EAED,IAAM,EAAE,UAAO,UAAO,sBAAmB;AAIzC,EAAO,EAAK,YAEX,QAAQ,KACP,+IAEA,EACD,EAAe,EAAO;EAIvB,IAAM,IAAM,IAAI,EAAS,GAAU;GAAE,GAAG;IAAW,IAAmB;GAAM,CAAE;AAI9E,MAHA,EAAI,SAAS,GACb,EAAI,kBAAkB,KAAkB,MAEnC,EAAQ,UAAW;GAEvB,IAAM,IAAiB,EAAS,UAAU;AAC1C,OAAK,MAAmB,MAAO;IAE9B,IAAM,IAAW,IAAI,EAAiB,EAAK,OAAO,GAAG,GAAO;AAC5D,MAAS,SAAU,EAAU;UAElB,EAAe,UAAU,MAEpC,EAAe,MAAM,IAAK,EAAO,EACjC,EAAe,cAAc;;AAM/B,SAAO;EAGP,SAAS,EAAe,GAAQ;AAE/B,QAAM,IAAI,IAAY,GAAG,IAAY,EAAM,QAAQ,KAAe;IAEjE,IAAM,IAAO,EAAO,IACd,IAAc,IAAI,YAAa,EAAM,EACrC,IAAc,IAAI,YAAa,EAAM;AAG3C,SAAM,IAAI,IAAO,GAAG,IAAI,EAAK,aAAA,IAA6B,IAAO,GAAG,KAAU;KAE7E,IAAM,IAAA,IAAgC;AAEtC,KAAO,EADa,IAAI,GACK,EAAa,KAGzC,EAAa,IAAc,KAAM,EAAa,IAAc,KAAA,IAAwB;;;;;CAYzF,IAAI,kBAAkB;AAErB,SAAO;;CAWR,IAAI,uBAAuB;AAE1B,SAAO,KAAK;;CAIb,YAAa,GAAU,IAAU,EAAE,EAAG;AAYrC,EAVK,EAAQ,gBAEZ,QAAQ,KAAM,wFAAqF,EACnG,IAAU;GACT,GAAG;GACH,gBAAgB,EAAQ;GACxB,GAIF,MAAO,GAAU,EAAS;;CAe3B,qBAAsB,GAAS;AAE9B,SAAO,MAAM,sBAAuB,EAAQ;;CAK7C,qBAAsB,GAAG,GAAc,GAAY;EAElD,IAAM,IAAW,KAAK,UAChB,IAAiB,KAAK,iBACtB,IAAU,EAAS,WAAW,UAC9B,IAAQ,EAAS,QAAQ,EAAS,MAAM,QAAQ,MAGhD,KADM,IAAiB,EAAgB,KAAM,KAChC,GAEf,IAAK,IAAO,GACZ,IAAK,IAAO,GACZ,IAAK,IAAO;AAEhB,EAAK,MAEJ,IAAK,EAAO,IACZ,IAAK,EAAO,IACZ,IAAK,EAAO;AAIb,OAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;GAEjC,IAAM,IAAI,EAAS,GAAU,IAAQ,EAAI,EACnC,IAAI,EAAS,GAAU,IAAQ,EAAI,EACnC,IAAI,EAAS,GAAU,IAAQ,EAAI,EAErC,IAAM;AAEV,GADK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM;GAErB,IAAI,IAAM;AAMV,GALK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM,IAGrB,EAAc,IAAY,KAAO,GACjC,EAAc,IAAY,IAAK,KAAM;;AAItC,SAAO;;CAQR,uBAAwB,GAAQ,GAAO,GAAe;EAErD,IAAM,IAAW,KAAK,UAChB,IAAiB,KAAK,iBACtB,IAAU,EAAS,WAAW,UAC9B,IAAQ,EAAS,QAAQ,EAAS,MAAM,QAAQ,MAChD,IAAa,EAAQ;AAE3B,MAAK,IAAS,KAAK,IAAQ,IAAS,EAAa,SAAS,EAAa,SAAS,EAE/E,OAAU,MAAO,qDAAsD;EAKxE,IAAM,IAAS,EAAQ,OAGjB,IAAe,EAAQ,UAAU,GACnC,IAAS;AACb,EAAK,EAAQ,iCAEZ,IAAS,EAAQ,KAAK;EAKvB,IAAM,IAAU;GAAE;GAAQ;GAAQ;GAAQ,EACpC,IAAc,EAAa;AAGjC,OAAM,IAAI,IAAI,GAAQ,IAAI,IAAS,GAAO,IAAI,GAAG,KAAO;GAGvD,IAAM,KADM,IAAiB,EAAgB,KAAM,KAChC,GACb,KAAsB,IAAI,KAAgB,GAE5C,IAAK,IAAO,GACZ,IAAK,IAAO,GACZ,IAAK,IAAO;AAYhB,GAVK,MAEJ,IAAK,EAAO,IACZ,IAAK,EAAO,IACZ,IAAK,EAAO,KAMN,MAEN,IAAK,IAAK,IAAS,GACnB,IAAK,IAAK,IAAS,GACnB,IAAK,IAAK,IAAS;AAIpB,QAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;IAEjC,IAAI,GAAG,GAAG;AAEV,IAAK,KAEJ,IAAI,EAAS,EAAS,IAAQ,EAAI,EAClC,IAAI,EAAS,EAAS,IAAQ,EAAI,EAClC,IAAI,EAAS,EAAS,IAAQ,EAAI,KAIlC,IAAI,EAAQ,IAAK,IACjB,IAAI,EAAQ,IAAK,IACjB,IAAI,EAAQ,IAAK;IAIlB,IAAI,IAAM;AAEV,IADK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM;IAErB,IAAI,IAAM;AAEV,IADK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM;IAKrB,IAAM,KAAgB,IAAM,KAAQ,GAC9B,IAAM,IAAK;AAEjB,IADA,EAAc,IAAoB,IAAM,KAAM,IAAM,GACpD,EAAc,IAAoB,IAAM,KAAM,KAAgB,KAAK,IAAK,EAAK,GAAG,KAAgB;;;AAMlG,SAAO;;CAaR,gBAAiB,GAAQ,GAAW,IAAa,EAAE,EAAG;EAErD,IAAM,EAAE,gBAAa;AACrB,MAAK,MAAa,KAAA,EAEjB;AAQD,EAJA,GAAe,KAAM,EAAO,YAAa,CAAC,QAAQ,EAClD,GAAK,KAAM,EAAU,IAAK,CAAC,aAAcA,GAAgB,EAEzD,GAAY,mBAAoB,EAAO,YAAa,EACpD,GAAW,KAAMD,GAAK,UAAW,CAAC,SAAU,GAAa;EAEzD,IAAM,IAAc,GAAW,QAAQ,EACjC,IAAO,EAAU,OAAO,GACxB,IAAM,EAAU,MAAM;AAE5B,MAAK,EAAU,iBAAiB,IAAO;GAEtC,IAAI,IAAM,KAAK,aAAcA,IAAM,GAAU,GAAM,EAAK;AAExD,GADA,IAAM,GAAyB,GAAK,GAAQ,EAAW,EAClD,KAEJ,EAAW,KAAM,EAAK;SAIjB;GAEN,IAAM,IAAO,KAAK,QAASA,IAAM,GAAU,GAAM,EAAK;AACtD,QAAM,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,IAAI,GAAG,KAAO;IAE/C,IAAM,IAAM,GAAyB,EAAM,IAAK,GAAQ,EAAW;AACnE,IAAK,KAEJ,EAAW,KAAM,EAAK;;;AAQzB,SAAO;;CAYR,MAAO,IAAc,MAAO;AAG3B,UADkB,KAAK,WAAW,KAAiB,IACjC,MAAM,EAAa;;CAyBtC,QAAS,GAAK,IAAA,GAA4B,IAAO,GAAG,IAAM,UAAW;EAEpE,IAAM,IAAQ,KAAK,QACb,IAAa,EAAE,EACf,IAAc,KAAK,WAAW,KAAmB;AACvD,OAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,IAEzC,GAAa,MAAM,GAAG,GAAgB,GAAK,GAAY,GAAM,EAAK;AAInE,SAAO;;CAeR,aAAc,GAAK,IAAA,GAA4B,IAAO,GAAG,IAAM,UAAW;EAEzE,IAAM,IAAQ,KAAK,QACf,IAAgB,MAEd,IAAmB,KAAK,WAAW,KAAwB;AACjE,OAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,KAAO;GAEhD,IAAM,IAAS,EAAkB,MAAM,GAAG,GAAgB,GAAK,GAAM,EAAK;AAC1E,GAAK,KAAU,SAAU,KAAiB,QAAQ,EAAO,WAAW,EAAc,cAEjF,IAAgB;;AAMlB,SAAO;;CAgBR,mBAAoB,GAAe,GAAa;EAE/C,IAAI,IAAS,IACP,IAAQ,KAAK,QACb,IAAyB,KAAK,WAAW,KAA8B;AAC7E,OAAM,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,MAEtC,IAAS,EAAwB,MAAM,GAAG,GAAe,EAAY,EAEhE,KAJoC;AAY1C,SAAO;;CAiBR,UAAW,GAAY;EAEtB,IAAM,IAAW,EAAqB,cAAc,EAC9C,IAAS,MAAM,UACpB;GACC,GAAG;GACH,qBAAqB,EAAU;GAC/B,kBAAkB;GAIlB,SAAS,KAAK,WAAW,KAAgCE;GACzD,CACD;AAGD,SAFA,EAAqB,iBAAkB,EAAU,EAE1C;;CAoBR,QAAS,GAAU,GAAe,GAAY;EAE7C,IAAI,EACH,qBACA,2BACG,GAEE,IAAY,EAAqB,cAAc,EAC/C,IAAa,KAAK,SAAS,OAC3B,IAAgB,KAAK,SAAS,WAAW,UACzC,IAAkB,KAAK,YAC5B,MAAM;AAIL,KAAa,GADF,KAAK,qBAAsB,EAAI,GACb,GAAG,GAAY,EAAe;OAG5D,MAAM;AAEL,KAAa,GAAW,IAAK,GAAG,GAAY,EAAe;KAIvD,IAAY,EAAqB,cAAc,EAC/C,IAAa,EAAS,SAAS,OAC/B,IAAgB,EAAS,SAAS,WAAW,UAC7C,IAAkB,EAAS,YAChC,MAAM;AAGL,KAAa,GADD,EAAS,qBAAsB,EAAI,GACjB,GAAG,GAAY,EAAe;OAG7D,MAAM;AAEL,KAAa,GAAW,IAAK,GAAG,GAAY,EAAe;;AAK7D,MAAK,GAAsB;AAE1B,OAAK,EAAI,aAAoB,GAE5B,OAAU,MAAO,mFAAkF;GAIpG,IAAM,KAA+B,GAAS,GAAQ,GAAS,GAAQ,GAAQ,GAAY,GAAQ,MAAgB;AAElH,SAAM,IAAI,IAAK,GAAS,IAAK,IAAU,GAAQ,IAAK,GAAI,KAAQ;AAO/D,KALA,EAAiB,EAAI,EAErB,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,EAAE,aAAc,EAAe,EACzC,EAAU,cAAc;AAExB,UAAM,IAAI,IAAK,GAAS,IAAK,IAAU,GAAQ,IAAK,GAAI,IAMvD,KAJA,EAAiB,EAAI,EAErB,EAAU,cAAc,IAEnB,EAAqB,GAAW,GAAW,GAAI,GAAI,GAAQ,GAAY,GAAQ,EAAY,CAE/F,QAAO;;AAQV,WAAO;;AAIR,OAAK,GAAmB;IAEvB,IAAM,IAA2B;AACjC,QAAmB,SAAW,GAAS,GAAQ,GAAS,GAAQ,GAAQ,GAAY,GAAQ,GAAa;AAQxG,YANO,EAA0B,GAAS,GAAQ,GAAS,GAAQ,GAAQ,GAAY,GAAQ,EAAY,GAMpG,KAJC,EAA4B,GAAS,GAAQ,GAAS,GAAQ,GAAQ,GAAY,GAAQ,EAAY;;SAU/G,KAAmB;;AAMrB,SAAO,MAAM,QAAS,GAAU,GAAe,EAAE,qBAAkB,CAAE;;CAgBtE,cAAe,GAAK,GAAY;AAK/B,SAHA,GAAK,IAAK,EAAI,KAAK,EAAI,KAAK,EAAW,EACvC,GAAK,cAAc,IAEZ,KAAK,UACX;GACC,mBAAkB,MAAO,GAAK,cAAe,EAAK;GAClD,qBAAoB,MAAO,GAAK,mBAAoB,EAAK;GACzD,CACD;;CAUF,iBAAkB,GAAS;AAE1B,SAAO,KAAK,UACX;GACC,mBAAkB,MAAO,EAAO,cAAe,EAAK;GACpD,qBAAoB,MAAO,EAAI,iBAAkB,EAAQ;GACzD,CACD;;CAiCF,uBAAwB,GAAe,GAAe,IAAU,EAAG,EAAE,IAAU,EAAG,EAAE,IAAe,GAAG,IAAe,UAAW;AAG/H,UADmC,KAAK,WAAW,KAAkC,IAEpF,MACA,GACA,GACA,GACA,GACA,GACA,EACA;;CAuBF,oBAAqB,GAAO,IAAS,EAAG,EAAE,IAAe,GAAG,IAAe,UAAW;AAErF,SAAO,GACN,MACA,GACA,GACA,GACA,EACA;;GC32BG,oBAA4B,IAAI,GAAgB,EAChD,oBAA0B,IAAI,GAAS,EACvCC,qBAAiC,IAAI,GAAS,EAC9C,qBAAuB,IAAI,GAAM,EACjC,qBAA0B,IAAI,GAAQ,EACtCC,oBAAuB,IAAI,GAAS,EACpCC,qBAAuB,IAAI,GAAK,EAChC,oBAAwB,IAAI,GAAM,EAClC,KAAiB,EAAE,EAsBZ,KAAb,cAA+B,GAAI;CAElC,YAAa,GAAM,IAAU,EAAE,EAAG;AAUjC,EARA,IAAU;GACT,SAAS;GACT,kBAAkB;GAClB,aAAa,MAAM,QAAS,EAAM,GAAG,IAAI,GAAS,GAAG,EAAK;GAC1D,gBAAgB;GAChB,GAAG;GACH,EAED,OAAO;EAGP,IAAM,oBAAY,IAAI,KAAK;AAC3B,KAAgB,GAAM,EAAW;EAIjC,IAAM,IAAU,MAAM,KAAM,EAAW,EACjC,IAAS,KAAK,KAAM,KAAK,KAAM,EAAQ,OAAQ,CAAE,EACjD,KAAW,KAAK,KAAW;AAajC,EAXA,KAAK,UAAU,GACf,KAAK,SAAS,GACd,KAAK,SAAS,GACd,KAAK,kBAAkB,MACvB,KAAK,wBAAwB,GAG7B,KAAK,UAAU,EAAQ,SACvB,KAAK,mBAAmB,EAAQ,kBAChC,KAAK,cAAc,EAAQ,aAE3B,KAAK,KAAM,EAAS;;CASrB,gBAAiB,GAAc;EAE9B,IAAM,EAAE,WAAQ,eAAY;AAE5B,SAAO,EADI,GAAa,GAAa,EAAQ;;CAU9C,kBAAmB,GAAc;EAEhC,IAAM,EAAE,WAAQ,cAAW;AAC3B,SAAO,GAAe,GAAa,GAAQ,EAAQ;;CAIpD,KAAM,GAAU;EAEf,IAAM,EAAE,YAAS,WAAQ,mBAAgB;AAQzC,EALA,GAAe,KAAM,EAAa,CAAC,QAAQ,EAE3C,KAAK,kBAAkB,IAAI,YAAa,KAAK,iBAAkB,EAAS,CAAE,EAC1E,KAAK,qBAAsB,GAAS,GAAQ,KAAK,gBAAiB,EAElE,MAAM,KAAM,EAAS;;CAItB,MAAO,GAAG,GAAO;AAKhB,EAFA,GAAe,KAAM,KAAK,YAAa,CAAC,QAAQ,EAEhD,MAAM,MAAO,GAAG,EAAM;;CAIvB,qBAAsB,GAAG,GAAc,GAAc;EAEpD,IAAM,EAAE,uBAAoB;AAC5B,OAAK,yBAA0B,EAAiB,IAAKF,IAAgB,GAAM;EAE3E,IAAM,EAAE,QAAK,WAAQ;AAMrB,EALA,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI,GACtC,EAAc,IAAc,KAAM,EAAI;;CAIvC,gBAAgB;AAEf,SAAO,CAAE;GAAE,QAAQ;GAAG,OAAO,KAAK,gBAAgB;GAAQ,CAAE;;CAe7D,UAAW,GAAY;AAEtB,SAAO,MAAM,UAAW;GACvB,GAAG;GAEH,qBAAqB,EAAU;GAC/B,kBAAkB;GAClB,SAAS;GACT,CAAE;;CAMJ,QAAS,GAAW,IAAa,EAAE,EAAG;EAErC,IAAM,EAAE,gBAAa,wBAAqB,MACpC,EAAE,oBAAiB,GACnB,IAAkB,EAAE;AAI1B,EADA,GAAe,KAAM,EAAa,CAAC,QAAQ,EAC3C,GAAK,KAAM,EAAU,IAAK,CAAC,aAAcA,GAAgB;EAEzD,IAAI,IAAkB,UAClB,IAAa;AA+IjB,SA7IA,KAAK,UAAW;GACf,sBAAqB,MAEb,EAAI,gBAAiBE,GAAK,OAAQ;GAG1C,mBAAkB,MAAO;AAExB,QAAK,GAAe;AAEnB,SAAK,CAAEA,GAAK,aAAc,GAAKD,EAAM,CAEpC,QAAA;KAID,IAAI;AAaJ,YAZK,EAAI,cAAeC,GAAK,OAAQ,GAEpC,IAAO,KAIP,EAAK,aAAc,EAAa,EAChC,IAAO,EAAU,IAAI,OAAO,WAAYD,EAAM,GAKxC,IAAO,IAAA,IAAA;UAId,QAAOC,GAAK,cAAe,EAAK,GAAA,IAAA;;GAKlC,iBAAkB,GAAQ,GAAa;AAG/B,UAAO,SAQd;SAFA,EAAgB,SAAS,GAEpB,EAAO,mBAAmB,EAiB9B,CAdA,EAAM,WAAW,EAAO,UACxB,EAAM,WAAW,EAAO,UAExB,EAAO,YAAa,GAAY,EAAM,YAAa,EACnD,EAAM,YAAY,YAAa,EAAO,YAAa,EACnD,EAAM,QAAS,GAAW,EAAiB,EAE3C,EAAgB,SAAS,MAAO;AAG/B,MADA,EAAI,SAAS,GACb,EAAI,aAAa;OAEf,EAEH,EAAM,WAAW;cAEN,EAAO,iBAAiB,GAAmB;AAEtD,UAAK,CAAE,EAAO,aAAc,EAAY,CAEvC;MAKD,IAAM,IAAa,EAAO,gBAAiB,EAAY,EACjD,IAAgB,EAAO,mBAAoB,GAAY,GAAgB;AAyB7E,MAvBA,EAAU,QAAQ,EAAO,SAAS,OAClC,EAAU,aAAa,EAAO,SAAS,YACvC,EAAU,aAAc,EAAc,OAAO,EAAc,MAAO,EAElE,EAAM,WAAW,GACjB,EAAM,WAAW,EAAO,UAGxB,EAAO,YAAa,GAAY,EAAM,YAAa,EACnD,EAAM,YAAY,YAAa,EAAO,YAAa,EACnD,EAAM,QAAS,GAAW,EAAiB,EAG3C,EAAgB,SAAS,MAAO;AAG/B,OADA,EAAI,SAAS,GACb,EAAI,UAAU;QAEZ,EAEH,EAAM,WAAW,MACjB,EAAU,QAAQ,MAClB,EAAU,aAAa,MACvB,EAAU,aAAc,GAAG,SAAU;WAIrC,GAAO,QAAS,GAAW,EAAiB;AAK7C,KAAK,IAEJ,EAAgB,SAAS,MAAO;AAE/B,MAAK,EAAI,WAAW,MAEnB,IAAkB,EAAI,UACtB,IAAa;OAIZ,GAIH,EAAW,KAAM,GAAG,EAAiB;;;GAKvC,CAAE,EAGE,KAAgB,KAEpB,EAAW,KAAM,EAAY,EAIvB;;CAKR,yBAA0B,GAAa,GAAoB,GAAS;EAEnE,IAAM,EAAE,YAAS,WAAQ,WAAQ,YAAS,wBAAqB,MACzD,IAAK,GAAa,GAAa,EAAQ,EACvC,IAAa,GAAe,GAAa,GAAQ,EAAQ,EACzD,IAAS,EAAS;AAExB,MAAK,CAAE,MAAsB,EAAO,mBAAmB,EAAO,eA2B7D,CAxBO,EAAO,eAEb,EAAO,oBAAoB,EAIrB,EAAO,kBAEb,EAAO,uBAAuB,EAI/B,EACE,KAAM,EAAO,YAAa,CAC1B,YAAa,EAAoB,EAEnC,GACE,KAAM,EAAO,eAAgB,CAC7B,aAAc,EAAS,EAEzB,EACE,KAAM,EAAO,YAAa,CAC1B,aAAc,EAAS,EAEzB,GAAgB,GAAQ,GAAS;WAEtB,EAIX,KAAK,EAAO,gBASX,CAPA,EACE,YAAa,GAAY,EAAS,EAEpC,EACE,YAAa,EAAO,YAAa,CACjC,YAAa,EAAoB,EAEnC,GAAkB,EAAO,UAAU,GAAS,EAAQ;WAEzC,EAAO,eAAgB;GAElC,IAAM,IAAa,EAAO,gBAAiB,EAAY,EACjD,IAAgB,EAAO,mBAAoB,GAAY,GAAgB;AAe7E,GAbA,EAAU,QAAQ,EAAO,SAAS,OAClC,EAAU,aAAa,EAAO,SAAS,YACvC,EAAU,aAAc,EAAc,OAAO,EAAc,MAAO,EAElE,EACE,YAAa,GAAY,EAAS,EAEpC,EACE,YAAa,EAAO,YAAa,CACjC,YAAa,EAAoB,EAEnC,GAAkB,GAAW,GAAS,EAAQ,EAE9C,EAAU,aAAa;QAQvB,CAJA,EACE,KAAM,EAAO,YAAa,CAC1B,YAAa,EAAoB,EAEnC,EAAO,cAAe,GAAQ,GAAM,CAAC,aAAc,EAAoB;WAQnE,EAAO,gBA6BX,CA3BO,EAAO,SAAS,eAEtB,EAAO,SAAS,oBAAoB,EAI9B,EAAO,SAAS,kBAEtB,EAAO,SAAS,uBAAuB,EAIxC,EACE,YAAa,GAAY,EAAS,EAEpC,EACE,YAAa,EAAO,YAAa,CACjC,YAAa,EAAoB,EAEnC,GACE,KAAM,EAAO,SAAS,eAAgB,CACtC,aAAc,EAAS,EAEzB,EACE,KAAM,EAAO,SAAS,YAAa,CACnC,aAAc,EAAS,EAEzB,GAAgB,GAAQ,GAAS;WAEtB,EAAO,eAAgB;GAElC,IAAM,IAAa,EAAO,gBAAiB,EAAY;AAiBvD,GAfA,EACE,YAAa,GAAY,EAAS,EAEpC,EACE,YAAa,EAAO,YAAa,CACjC,YAAa,EAAoB,EAEnC,EACE,oBAAqB,GAAY,GAAS,CAC1C,aAAc,EAAS,EAEzB,EACE,iBAAkB,GAAY,EAAQ,CACtC,aAAc,EAAS,EAEzB,GAAgB,GAAQ,GAAS;QAIjC,GACE,cAAe,GAAQ,GAAO,CAC9B,aAAc,EAAoB;;CASvC,iBAAkB,GAAU;EAE3B,IAAM,EAAE,wBAAqB,MACzB,IAAQ;AAyBZ,SAxBA,EAAQ,SAAS,MAAU;AAE1B,OAAK,EAAO,mBAAmB,EAE9B,MAAS,EAAO;YAEL,EAAO,iBAAiB,GAAmB;AAEtD,QAAK,EAAI,mBAAmB,GAE3B,OAAU,MAAO,uEAAwE;AAI1F,SAAS,EAAO;SAIhB;IAIC,EAEI;;CAIR,qBAAsB,GAAS,GAAQ,GAAS;EAE/C,IAAM,EAAE,wBAAqB,MACzB,IAAQ;AACZ,IAAQ,SAAW,GAAQ,MAAO;AAEjC,OAAK,EAAO,mBAAmB,GAAmB;IAEjD,IAAM,IAAQ,EAAO;AACrB,SAAM,IAAI,IAAI,GAAG,IAAI,GAAO,IAG3B,CADA,EAAQ,KAAY,KAAK,IAAW,GACpC;cAIU,EAAO,iBAAiB,GAAmB;IAEtD,IAAM,EAAE,kBAAe,wBAAqB,GACxC,IAAiB,GACjB,IAAO;AAEX,WAAQ,IAAiB,KAAiB,IAAO,IAAmB;AAInE,SAAI;AAMH,MAJA,EAAO,aAAc,EAAM,EAE3B,EAAQ,KAAY,KAAQ,IAAW,GACvC,KACA;aAEO;AAMR;;SAOD,CADA,EAAQ,KAAU,GAClB;IAIC;;;AAQL,SAAS,GAAa,GAAI,GAAS;AAElC,QAAO,IAAK;;AAKb,SAAS,GAAe,GAAI,GAAQ,GAAS;AAE5C,SAAS,IAAO,CAAE,OAAe;;AAKlC,SAAS,GAAgB,GAAM,oBAAY,IAAI,KAAK,EAAG;AAEtD,CAAK,MAAM,QAAS,EAAM,GAEzB,EAAK,SAAS,MAAU,GAAgB,GAAQ,EAAW,CAAE,GAI7D,EAAK,UAAU,MAAS;AAEvB,GAAK,EAAM,UAAU,EAAM,UAAU,EAAM,aAE1C,EAAU,IAAK,EAAO;GAIrB;;AAOL,SAAS,GAAkB,GAAU,GAAQ,GAAS;AAErD,GAAO,WAAW;CAElB,IAAM,IAAY,EAAS,WACrB,IAAY,EAAS,OACrB,IAAU,EAAS,WAAW,UAC9B,IAAQ,EAAU,OAClB,IAAY,IAAY,EAAU,QAAQ,EAAQ,OAClD,IAAQ,KAAK,IAAK,IAAY,GAAO,EAAU,MAAO;AAC5D,MAAM,IAAI,IAAI,GAAO,IAAI,IAAQ,GAAO,IAAI,GAAG,KAAO;EAErD,IAAI,IAAK;AAQT,EAPK,MAEJ,IAAK,EAAU,KAAM,EAAI,GAI1B,EAAK,oBAAqB,GAAS,EAAI,CAAC,aAAc,EAAQ,EAC9D,EAAO,cAAeD,EAAM;;AAI7B,QAAO;;AAKR,SAAS,GAAoB,GAAQ,GAAO,GAAK,GAAU,GAAW,GAAuB;CAE5F,IAAM,EAAE,oBAAiB,YAAS,WAAQ,cAAW;AACrD,MAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;EAEvD,IAAM,IAAc,EAAiB,IAC/B,IAAK,GAAa,GAAa,EAAQ,EACvC,IAAa,GAAe,GAAa,GAAQ,EAAQ,EACzD,IAAS,EAAS;AACxB,MAAK,EAAU,GAAQ,GAAY,GAAW,EAAO,CAEpD,QAAO;;AAMT,QAAO;;AAIR,SAAS,GAAgB,GAAK,GAAS;AAMtC,CAJA,EAAK,KAAM,EAAO,OAAQ,CAAC,UAAW,CAAE,EAAO,OAAQ,EACvD,EAAI,IAAI,IAAKA,EAAM,EAEnB,EAAK,KAAM,EAAO,OAAQ,CAAC,UAAW,EAAO,OAAQ,EACrD,EAAI,IAAI,IAAKA,EAAM;;;;AC/oBpB,IAAM,qBAAsB,IAAI,GAAS,EACnC,qBAAsB,IAAI,GAAS,EACnC,qBAAsB,IAAI,GAAS,EACnC,oBAAuB,IAAI,GAAK,EAChC,qBAAiC,IAAI,GAAS,EAC9C,oBAA8B,IAAI,GAAS,EAC3C,qBAAuB,IAAI,GAAS,EACpC,KAAQ;CAAE;CAAK;CAAK;CAAK,EAEzB,KAAqB,IACrB,KAAqB,IAErB,qBAAuB,IAAI,GAAS,EACpC,qBAAuB,IAAI,GAAS,EACpC,qBAAuB,IAAI,GAAS,EACpC,qBAA2B,IAAI,GAAS,EACxC,qBAA2B,IAAI,GAAS,EACxC,qBAA2B,IAAI,GAAS,EAoBjC,KAAb,cAAoC,GAAY;CAE/C,IAAI,kBAAkB;AAErB,SAAO;;CAIR,YAAa,GAAM,IAAU,EAAE,EAAG;AAEjC,MAAK,CAAE,EAAK,OAEX,OAAU,MAAO,iDAAkD;AAapE,EANA,MAAO,EAAK,UAAU;GACrB,GAAG;IACD,IAAmB;GACrB,CAAE,EACH,KAAK,OAAO,GAEL,EAAS,MAEf,KAAK,KAAM,EAAS;;CAMtB,qBAAsB,GAAG,GAAc,GAAY;EAElD,IAAM,EAAE,SAAM,gBAAa,MACrB,IAAiB,KAAK,iBACtB,IAAQ,EAAS,QAAQ,EAAS,MAAM,QAAQ,MAGhD,KADM,IAAiB,EAAgB,KAAM,KAChC,GAEf,IAAK,IAAO,GACZ,IAAK,IAAO,GACZ,IAAK,IAAO;AAahB,EAXK,MAEJ,IAAK,EAAO,IACZ,IAAK,EAAO,IACZ,IAAK,EAAO,KAKb,EAAK,kBAAmB,GAAI,GAAK,EACjC,EAAK,kBAAmB,GAAI,GAAK,EACjC,EAAK,kBAAmB,GAAI,GAAK;AAGjC,OAAM,IAAI,IAAK,GAAG,IAAK,GAAG,KAAQ;GAEjC,IAAM,IAAO,GAAO,IACd,IAAI,GAAK,IACT,IAAI,GAAK,IACT,IAAI,GAAK,IAEX,IAAM;AAEV,GADK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM;GAErB,IAAI,IAAM;AAMV,GALK,IAAI,MAAM,IAAM,IAChB,IAAI,MAAM,IAAM,IAGrB,EAAc,IAAY,KAAO,GACjC,EAAc,IAAY,IAAK,KAAM;;AAItC,SAAO;;CAeR,UAAW,GAAY;EAEtB,IAAM,IAAW,IAAI,GAAkB;AACvC,SAAO,MAAM,UACZ;GACC,GAAG;GACH,qBAAqB,EAAU;GAC/B,kBAAkB;GAClB,SAAS;GACT,CACD;;CAIF,gBAAiB,GAAQ,GAAW,IAAa,EAAE,EAAG;EAErD,IAAM,EAAE,gBAAa;AACrB,MAAK,MAAa,KAAA,EAEjB;EAID,IAAM,EAAE,mBAAgB,GAClB,EAAE,oBAAiB;AAGzB,EADA,GAAe,KAAM,EAAa,CAAC,QAAQ,EAC3C,EAAK,KAAM,EAAU,IAAK,CAAC,aAAc,GAAgB;EAEzD,IAAI,IAAa,MACb,IAAkB;AA8LtB,SA5LA,KAAK,UAAW;GACf,sBAAqB,MAEb,EAAI,gBAAiB,EAAK,OAAQ;GAG1C,mBAAkB,MAAO;AAExB,QAAK,GAAe;AAEnB,SAAK,CAAE,EAAK,aAAc,GAAK,GAAM,CAEpC,QAAA;KAID,IAAI;AAaJ,YAZK,EAAI,cAAe,EAAK,OAAQ,GAEpC,IAAO,KAIP,GAAK,aAAc,EAAa,EAChC,IAAO,EAAU,IAAI,OAAO,WAAY,GAAM,GAKxC,IAAO,IAAA,IAAA;UAId,QAAO,EAAK,cAAe,EAAK,GAAA,IAAA;;GAKlC,qBAAsB,GAAK,MAAc;IAGxC,IAAI,IAAQ;AAeZ,QAdA,AAUC,IAVI,EAAS,SAAA,IAEL,EAAK,kBAAmB,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAM,EAAa,GAE7D,EAAS,SAAA,IAEZ,EAAK,kBAAmB,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAM,EAAa,GAIhE,EAAK,kBAAmB,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAO,EAAa,EAIrE,CAAE,EAEN;AAKD,QAAQ,EAAM,OAAO,CAAC,aAAc,EAAa;IAGjD,IAAM,IAAO,EAAU,IAAI,OAAO,WAAY,EAAO;AACrD,QAAK,KAAQ,EAAU,QAAQ,KAAQ,EAAU,KAAM;AAEtD,SAAK,KAAgB,KAAQ,EAE5B;KAKD,IAAM,EAAE,gBAAa,MACf,EAAE,aAAU,GACZ,IAAY,KAAK,sBAAuB,EAAU,EAClD,IAAY,IAAY,GAE1B,IAAK,IAAY,GACjB,IAAK,IAAY,GACjB,IAAK,IAAY;AAErB,KAAK,MAEJ,IAAK,EAAM,MAAO,IAClB,IAAK,EAAM,MAAO,IAClB,IAAK,EAAM,MAAO;KAKnB,IAAM,IAAM;MACX,UAAU;MACV,OAAO,EAAM,OAAO;MACpB;MACA,IAAI;MACJ,KAAK;MACL,QAAQ;MACR,MAAM;OACL,GAAG;OACH,GAAG;OACH,GAAG;OACH,QAAQ,EAAS,UAAW,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAI,GAAS,CAAE;OAChE,eAAe;OACf;MACD,WAAW;MACX;AAED,SAAK,IAAqB;MAEzB,IAAM,IAAY,IAAI,GAAS;AAE/B,MADA,EAAS,aAAc,GAAa,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,EAAW,EACpE,EAAI,YAAY;;KAKjB,IAAM,IAAK,EAAS,WAAW,IACzB,IAAM,EAAS,WAAW,KAC1B,IAAS,EAAS,WAAW;AAEnC,SAAK,GAAK;AAMT,MAJA,GAAK,oBAAqB,GAAI,EAAI,EAClC,GAAK,oBAAqB,GAAI,EAAI,EAClC,GAAK,oBAAqB,GAAI,EAAI,EAElC,EAAI,KAAK,IAAI,GAAS;MACtB,IAAM,IAAQ,EAAS,iBAAkB,GAAa,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAM,IAAM,IAAM,EAAI,GAAI;AACrG,MAAO,OAAqB,EAAI,KAAK;;AAItC,SAAK,GAAM;AAMV,MAJA,GAAK,oBAAqB,GAAK,EAAI,EACnC,GAAK,oBAAqB,GAAK,EAAI,EACnC,GAAK,oBAAqB,GAAK,EAAI,EAEnC,EAAI,MAAM,IAAI,GAAS;MACvB,IAAM,IAAS,EAAS,iBAAkB,GAAa,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAM,IAAM,IAAM,EAAI,IAAK;AAEvG,MADO,OAAqB,EAAI,MAAM,IACjC,OAAqB,EAAI,MAAM,EAAI;;AAIzC,SAAK,GAAS;AAMb,MAJA,GAAS,oBAAqB,GAAQ,EAAI,EAC1C,GAAS,oBAAqB,GAAQ,EAAI,EAC1C,GAAS,oBAAqB,GAAQ,EAAI,EAE1C,EAAI,SAAS,IAAI,GAAS;MAC1B,IAAM,IAAY,EAAS,iBAAkB,GAAa,EAAI,GAAG,EAAI,GAAG,EAAI,GAAG,IAAU,IAAU,IAAU,EAAI,OAAQ;AAOzH,MANK,EAAI,OAAO,IAAK,EAAK,UAAW,GAAG,KAEvC,EAAI,OAAO,eAAgB,GAAK,EAI1B,OAAqB,EAAI,SAAS;;AAQ1C,KAHA,IAAkB,EAAI,UACtB,IAAa,GAEN,KAEN,EAAW,KAAM,EAAK;;;GAOzB,CAAE,EAEE,KAAgB,KAEpB,EAAW,KAAM,EAAY,EAIvB;;;AAMT,SAAS,GACR,GACA,GACA,GACA,GACA,GACA,GACA,GACC;CAED,IAAM,EAAE,SAAM,gBAAa,GACrB,IAAQ,EAAS,QAAQ,EAAS,MAAM,QAAQ;AAEtD,MAAM,IAAI,IAAI,GAAQ,IAAI,IAAQ,GAAQ,IAAI,GAAG,KAAO;EAEvD,IAAM,IAAM,EAAI,sBAAuB,EAAG,EAEtC,IAAK,IAAI,IAAM,GACf,IAAK,IAAI,IAAM,GACf,IAAK,IAAI,IAAM;AAenB,MAbK,MAEJ,IAAK,EAAO,IACZ,IAAK,EAAO,IACZ,IAAK,EAAO,KAIb,EAAK,kBAAmB,GAAI,EAAS,EAAG,EACxC,EAAK,kBAAmB,GAAI,EAAS,EAAG,EACxC,EAAK,kBAAmB,GAAI,EAAS,EAAG,EACxC,EAAS,cAAc,IAElB,EAAwB,GAAU,GAAG,GAAW,EAAO,CAE3D,QAAO;;AAMT,QAAO"}