@hellpig/anarchy-engine 21.3.0 → 21.4.1

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/raycast.generated.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"raycast.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/raycast.generated.js"],"sourcesContent":["import { intersectRay } 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 ( intersectRay( 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 ( intersectRay( 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"],"names":["raycast","bvh","root","materialOrSide","ray","intersects","near","far","BufferStack","setBuffer","_roots","_raycast","clearBuffer","nodeIndex32","float32Array","uint16Array","uint32Array","nodeIndex16","IS_LEAF","offset","OFFSET","count","COUNT","intersectTris","leftIndex","LEFT_NODE","intersectRay","rightIndex","RIGHT_NODE"],"mappings":"yPAUA,SAASA,QAASC,IAAKC,KAAMC,eAAgBC,IAAKC,WAAYC,KAAMC,KAEnEC,YAAYC,UAAWR,IAAIS,OAAQR,OACnCS,SAAU,EAAGV,IAAKE,eAAgBC,IAAKC,WAAYC,KAAMC,KACzDC,YAAYI,aAEb,CAEA,SAASD,SAAUE,YAAaZ,IAAKE,eAAgBC,IAAKC,WAAYC,KAAMC,KAE3E,MAAMO,aAAEA,aAAYC,YAAEA,YAAWC,YAAEA,aAAgBR,YAC7CS,YAA4B,EAAdJ,YAEpB,GADeK,QAASD,YAAaF,aACvB,CAEb,MAAMI,OAASC,OAAQP,YAAaG,aAC9BK,MAAQC,MAAOL,YAAaF,aAGlCQ,cAAetB,IAAKE,eAAgBC,IAAKe,OAAQE,MAAOhB,WAAYC,KAAMC,IAG3E,KAAO,CAEN,MAAMiB,UAAYC,UAAWZ,aACxBa,aAAcF,UAAWV,aAAcV,IAAKE,KAAMC,MAEtDI,SAAUa,UAAWvB,IAAKE,eAAgBC,IAAKC,WAAYC,KAAMC,KAIlE,MAAMoB,WAAaC,WAAYf,YAAaG,aACvCU,aAAcC,WAAYb,aAAcV,IAAKE,KAAMC,MAEvDI,SAAUgB,WAAY1B,IAAKE,eAAgBC,IAAKC,WAAYC,KAAMC,IAIpE,CAED","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/raycastFirst.generated.js

@@ -0,0 +1,2 @@
+import{IS_LEAF,OFFSET,COUNT,SPLIT_AXIS,RIGHT_NODE,LEFT_NODE}from"../utils/nodeBufferUtils.js";import{BufferStack}from"../utils/BufferStack.js";import{intersectRay}from"../utils/intersectUtils.js";import{intersectClosestTri}from"../utils/iterationUtils.generated.js";const _xyzFields=["x","y","z"];function raycastFirst(bvh,root,materialOrSide,ray,near,far){BufferStack.setBuffer(bvh._roots[root]);const result=_raycastFirst(0,bvh,materialOrSide,ray,near,far);return BufferStack.clearBuffer(),result}function _raycastFirst(nodeIndex32,bvh,materialOrSide,ray,near,far){const{float32Array:float32Array,uint16Array:uint16Array,uint32Array:uint32Array}=BufferStack;let nodeIndex16=2*nodeIndex32;if(IS_LEAF(nodeIndex16,uint16Array)){const offset=OFFSET(nodeIndex32,uint32Array),count=COUNT(nodeIndex16,uint16Array);return intersectClosestTri(bvh,materialOrSide,ray,offset,count,near,far)}{const splitAxis=SPLIT_AXIS(nodeIndex32,uint32Array),xyzAxis=_xyzFields[splitAxis],leftToRight=ray.direction[xyzAxis]>=0;let c1,c2;leftToRight?(c1=LEFT_NODE(nodeIndex32),c2=RIGHT_NODE(nodeIndex32,uint32Array)):(c1=RIGHT_NODE(nodeIndex32,uint32Array),c2=LEFT_NODE(nodeIndex32));const c1Result=intersectRay(c1,float32Array,ray,near,far)?_raycastFirst(c1,bvh,materialOrSide,ray,near,far):null;if(c1Result){const point=c1Result.point[xyzAxis];if(leftToRight?point<=float32Array[c2+splitAxis]:point>=float32Array[c2+splitAxis+3])return c1Result}const c2Result=intersectRay(c2,float32Array,ray,near,far)?_raycastFirst(c2,bvh,materialOrSide,ray,near,far):null;return c1Result&&c2Result?c1Result.distance<=c2Result.distance?c1Result:c2Result:c1Result||c2Result||null}}export{raycastFirst};
+//# sourceMappingURL=raycastFirst.generated.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/raycastFirst.generated.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"raycastFirst.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/raycastFirst.generated.js"],"sourcesContent":["import { IS_LEAF, OFFSET, COUNT, SPLIT_AXIS, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { intersectRay } 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 = intersectRay( 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 = intersectRay( 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"],"names":["_xyzFields","raycastFirst","bvh","root","materialOrSide","ray","near","far","BufferStack","setBuffer","_roots","result","_raycastFirst","clearBuffer","nodeIndex32","float32Array","uint16Array","uint32Array","nodeIndex16","IS_LEAF","offset","OFFSET","count","COUNT","intersectClosestTri","splitAxis","SPLIT_AXIS","xyzAxis","leftToRight","direction","c1","c2","LEFT_NODE","RIGHT_NODE","c1Result","intersectRay","point","c2Result","distance"],"mappings":"0QAUA,MAAMA,WAAa,CAAE,IAAK,IAAK,KAE/B,SAASC,aAAcC,IAAKC,KAAMC,eAAgBC,IAAKC,KAAMC,KAE5DC,YAAYC,UAAWP,IAAIQ,OAAQP,OACnC,MAAMQ,OAASC,cAAe,EAAGV,IAAKE,eAAgBC,IAAKC,KAAMC,KAGjE,OAFAC,YAAYK,cAELF,MAER,CAEA,SAASC,cAAeE,YAAaZ,IAAKE,eAAgBC,IAAKC,KAAMC,KAEpE,MAAMQ,aAAEA,aAAYC,YAAEA,YAAWC,YAAEA,aAAgBT,YACnD,IAAIU,YAA4B,EAAdJ,YAGlB,GADeK,QAASD,YAAaF,aACvB,CAEb,MAAMI,OAASC,OAAQP,YAAaG,aAC9BK,MAAQC,MAAOL,YAAaF,aAIlC,OAAOQ,oBAAqBtB,IAAKE,eAAgBC,IAAKe,OAAQE,MAAOhB,KAAMC,IAG5E,CAAO,CAIN,MAAMkB,UAAYC,WAAYZ,YAAaG,aACrCU,QAAU3B,WAAYyB,WAEtBG,YADSvB,IAAIwB,UAAWF,UACA,EAG9B,IAAIG,GAAIC,GACHH,aAEJE,GAAKE,UAAWlB,aAChBiB,GAAKE,WAAYnB,YAAaG,eAI9Ba,GAAKG,WAAYnB,YAAaG,aAC9Bc,GAAKC,UAAWlB,cAIjB,MACMoB,SADiBC,aAAcL,GAAIf,aAAcV,IAAKC,KAAMC,KAChCK,cAAekB,GAAI5B,IAAKE,eAAgBC,IAAKC,KAAMC,KAAQ,KAI7F,GAAK2B,SAAW,CAIf,MAAME,MAAQF,SAASE,MAAOT,SAK9B,GAJkBC,YACjBQ,OAASrB,aAAcgB,GAAKN,WAC5BW,OAASrB,aAAcgB,GAAKN,UAAY,GAIxC,OAAOS,QAIT,CAIA,MACMG,SADiBF,aAAcJ,GAAIhB,aAAcV,IAAKC,KAAMC,KAChCK,cAAemB,GAAI7B,IAAKE,eAAgBC,IAAKC,KAAMC,KAAQ,KAE7F,OAAK2B,UAAYG,SAETH,SAASI,UAAYD,SAASC,SAAWJ,SAAWG,SAIpDH,UAAYG,UAAY,IAIjC,CAED","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/raycastFirst_indirect.generated.js

@@ -0,0 +1,2 @@
+import{IS_LEAF,OFFSET,COUNT,SPLIT_AXIS,RIGHT_NODE,LEFT_NODE}from"../utils/nodeBufferUtils.js";import{BufferStack}from"../utils/BufferStack.js";import{intersectRay}from"../utils/intersectUtils.js";import{intersectClosestTri_indirect}from"../utils/iterationUtils_indirect.generated.js";const _xyzFields=["x","y","z"];function raycastFirst_indirect(bvh,root,materialOrSide,ray,near,far){BufferStack.setBuffer(bvh._roots[root]);const result=_raycastFirst(0,bvh,materialOrSide,ray,near,far);return BufferStack.clearBuffer(),result}function _raycastFirst(nodeIndex32,bvh,materialOrSide,ray,near,far){const{float32Array:float32Array,uint16Array:uint16Array,uint32Array:uint32Array}=BufferStack;let nodeIndex16=2*nodeIndex32;if(IS_LEAF(nodeIndex16,uint16Array)){const offset=OFFSET(nodeIndex32,uint32Array),count=COUNT(nodeIndex16,uint16Array);return intersectClosestTri_indirect(bvh,materialOrSide,ray,offset,count,near,far)}{const splitAxis=SPLIT_AXIS(nodeIndex32,uint32Array),xyzAxis=_xyzFields[splitAxis],leftToRight=ray.direction[xyzAxis]>=0;let c1,c2;leftToRight?(c1=LEFT_NODE(nodeIndex32),c2=RIGHT_NODE(nodeIndex32,uint32Array)):(c1=RIGHT_NODE(nodeIndex32,uint32Array),c2=LEFT_NODE(nodeIndex32));const c1Result=intersectRay(c1,float32Array,ray,near,far)?_raycastFirst(c1,bvh,materialOrSide,ray,near,far):null;if(c1Result){const point=c1Result.point[xyzAxis];if(leftToRight?point<=float32Array[c2+splitAxis]:point>=float32Array[c2+splitAxis+3])return c1Result}const c2Result=intersectRay(c2,float32Array,ray,near,far)?_raycastFirst(c2,bvh,materialOrSide,ray,near,far):null;return c1Result&&c2Result?c1Result.distance<=c2Result.distance?c1Result:c2Result:c1Result||c2Result||null}}export{raycastFirst_indirect};
+//# sourceMappingURL=raycastFirst_indirect.generated.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/raycastFirst_indirect.generated.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"raycastFirst_indirect.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/raycastFirst_indirect.generated.js"],"sourcesContent":["import { IS_LEAF, OFFSET, COUNT, SPLIT_AXIS, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { intersectRay } 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 = intersectRay( 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 = intersectRay( 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"],"names":["_xyzFields","raycastFirst_indirect","bvh","root","materialOrSide","ray","near","far","BufferStack","setBuffer","_roots","result","_raycastFirst","clearBuffer","nodeIndex32","float32Array","uint16Array","uint32Array","nodeIndex16","IS_LEAF","offset","OFFSET","count","COUNT","intersectClosestTri_indirect","splitAxis","SPLIT_AXIS","xyzAxis","leftToRight","direction","c1","c2","LEFT_NODE","RIGHT_NODE","c1Result","intersectRay","point","c2Result","distance"],"mappings":"4RAUA,MAAMA,WAAa,CAAE,IAAK,IAAK,KAE/B,SAASC,sBAAuBC,IAAKC,KAAMC,eAAgBC,IAAKC,KAAMC,KAErEC,YAAYC,UAAWP,IAAIQ,OAAQP,OACnC,MAAMQ,OAASC,cAAe,EAAGV,IAAKE,eAAgBC,IAAKC,KAAMC,KAGjE,OAFAC,YAAYK,cAELF,MAER,CAEA,SAASC,cAAeE,YAAaZ,IAAKE,eAAgBC,IAAKC,KAAMC,KAEpE,MAAMQ,aAAEA,aAAYC,YAAEA,YAAWC,YAAEA,aAAgBT,YACnD,IAAIU,YAA4B,EAAdJ,YAGlB,GADeK,QAASD,YAAaF,aACvB,CAEb,MAAMI,OAASC,OAAQP,YAAaG,aAC9BK,MAAQC,MAAOL,YAAaF,aAElC,OAAOQ,6BAA8BtB,IAAKE,eAAgBC,IAAKe,OAAQE,MAAOhB,KAAMC,IAGrF,CAAO,CAIN,MAAMkB,UAAYC,WAAYZ,YAAaG,aACrCU,QAAU3B,WAAYyB,WAEtBG,YADSvB,IAAIwB,UAAWF,UACA,EAG9B,IAAIG,GAAIC,GACHH,aAEJE,GAAKE,UAAWlB,aAChBiB,GAAKE,WAAYnB,YAAaG,eAI9Ba,GAAKG,WAAYnB,YAAaG,aAC9Bc,GAAKC,UAAWlB,cAIjB,MACMoB,SADiBC,aAAcL,GAAIf,aAAcV,IAAKC,KAAMC,KAChCK,cAAekB,GAAI5B,IAAKE,eAAgBC,IAAKC,KAAMC,KAAQ,KAI7F,GAAK2B,SAAW,CAIf,MAAME,MAAQF,SAASE,MAAOT,SAK9B,GAJkBC,YACjBQ,OAASrB,aAAcgB,GAAKN,WAC5BW,OAASrB,aAAcgB,GAAKN,UAAY,GAIxC,OAAOS,QAIT,CAIA,MACMG,SADiBF,aAAcJ,GAAIhB,aAAcV,IAAKC,KAAMC,KAChCK,cAAemB,GAAI7B,IAAKE,eAAgBC,IAAKC,KAAMC,KAAQ,KAE7F,OAAK2B,UAAYG,SAETH,SAASI,UAAYD,SAASC,SAAWJ,SAAWG,SAIpDH,UAAYG,UAAY,IAIjC,CAED","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/raycast_indirect.generated.js

@@ -0,0 +1,2 @@
+import{intersectRay}from"../utils/intersectUtils.js";import{IS_LEAF,OFFSET,COUNT,RIGHT_NODE,LEFT_NODE}from"../utils/nodeBufferUtils.js";import{BufferStack}from"../utils/BufferStack.js";import{intersectTris_indirect}from"../utils/iterationUtils_indirect.generated.js";function raycast_indirect(bvh,root,materialOrSide,ray,intersects,near,far){BufferStack.setBuffer(bvh._roots[root]),_raycast(0,bvh,materialOrSide,ray,intersects,near,far),BufferStack.clearBuffer()}function _raycast(nodeIndex32,bvh,materialOrSide,ray,intersects,near,far){const{float32Array:float32Array,uint16Array:uint16Array,uint32Array:uint32Array}=BufferStack,nodeIndex16=2*nodeIndex32;if(IS_LEAF(nodeIndex16,uint16Array)){const offset=OFFSET(nodeIndex32,uint32Array),count=COUNT(nodeIndex16,uint16Array);intersectTris_indirect(bvh,materialOrSide,ray,offset,count,intersects,near,far)}else{const leftIndex=LEFT_NODE(nodeIndex32);intersectRay(leftIndex,float32Array,ray,near,far)&&_raycast(leftIndex,bvh,materialOrSide,ray,intersects,near,far);const rightIndex=RIGHT_NODE(nodeIndex32,uint32Array);intersectRay(rightIndex,float32Array,ray,near,far)&&_raycast(rightIndex,bvh,materialOrSide,ray,intersects,near,far)}}export{raycast_indirect};
+//# sourceMappingURL=raycast_indirect.generated.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/raycast_indirect.generated.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"raycast_indirect.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/raycast_indirect.generated.js"],"sourcesContent":["import { intersectRay } 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 ( intersectRay( 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 ( intersectRay( 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"],"names":["raycast_indirect","bvh","root","materialOrSide","ray","intersects","near","far","BufferStack","setBuffer","_roots","_raycast","clearBuffer","nodeIndex32","float32Array","uint16Array","uint32Array","nodeIndex16","IS_LEAF","offset","OFFSET","count","COUNT","intersectTris_indirect","leftIndex","LEFT_NODE","intersectRay","rightIndex","RIGHT_NODE"],"mappings":"2QAUA,SAASA,iBAAkBC,IAAKC,KAAMC,eAAgBC,IAAKC,WAAYC,KAAMC,KAE5EC,YAAYC,UAAWR,IAAIS,OAAQR,OACnCS,SAAU,EAAGV,IAAKE,eAAgBC,IAAKC,WAAYC,KAAMC,KACzDC,YAAYI,aAEb,CAEA,SAASD,SAAUE,YAAaZ,IAAKE,eAAgBC,IAAKC,WAAYC,KAAMC,KAE3E,MAAMO,aAAEA,aAAYC,YAAEA,YAAWC,YAAEA,aAAgBR,YAC7CS,YAA4B,EAAdJ,YAEpB,GADeK,QAASD,YAAaF,aACvB,CAEb,MAAMI,OAASC,OAAQP,YAAaG,aAC9BK,MAAQC,MAAOL,YAAaF,aAElCQ,uBAAwBtB,IAAKE,eAAgBC,IAAKe,OAAQE,MAAOhB,WAAYC,KAAMC,IAGpF,KAAO,CAEN,MAAMiB,UAAYC,UAAWZ,aACxBa,aAAcF,UAAWV,aAAcV,IAAKE,KAAMC,MAEtDI,SAAUa,UAAWvB,IAAKE,eAAgBC,IAAKC,WAAYC,KAAMC,KAIlE,MAAMoB,WAAaC,WAAYf,YAAaG,aACvCU,aAAcC,WAAYb,aAAcV,IAAKE,KAAMC,MAEvDI,SAAUgB,WAAY1B,IAAKE,eAAgBC,IAAKC,WAAYC,KAAMC,IAIpE,CAED","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/refit.generated.js

@@ -0,0 +1,2 @@
+import{UINT32_PER_NODE,BYTES_PER_NODE}from"../Constants.js";import{IS_LEAF,RIGHT_NODE,LEFT_NODE}from"../utils/nodeBufferUtils.js";function refit(bvh,nodeIndices=null){nodeIndices&&Array.isArray(nodeIndices)&&(nodeIndices=new Set(nodeIndices));const geometry=bvh.geometry,indexArr=geometry.index?geometry.index.array:null,posAttr=geometry.attributes.position;let buffer,uint32Array,uint16Array,float32Array,byteOffset=0;const roots=bvh._roots;for(let i=0,l=roots.length;i<l;i++)buffer=roots[i],uint32Array=new Uint32Array(buffer),uint16Array=new Uint16Array(buffer),float32Array=new Float32Array(buffer),_traverse(0,byteOffset),byteOffset+=buffer.byteLength;function _traverse(nodeIndex32,byteOffset,force=!1){const nodeIndex16=2*nodeIndex32;if(IS_LEAF(nodeIndex16,uint16Array)){const offset=uint32Array[nodeIndex32+6];let minx=1/0,miny=1/0,minz=1/0,maxx=-1/0,maxy=-1/0,maxz=-1/0;for(let i=3*offset,l=3*(offset+uint16Array[nodeIndex16+14]);i<l;i++){let index=indexArr[i];const x=posAttr.getX(index),y=posAttr.getY(index),z=posAttr.getZ(index);x<minx&&(minx=x),x>maxx&&(maxx=x),y<miny&&(miny=y),y>maxy&&(maxy=y),z<minz&&(minz=z),z>maxz&&(maxz=z)}return(float32Array[nodeIndex32+0]!==minx||float32Array[nodeIndex32+1]!==miny||float32Array[nodeIndex32+2]!==minz||float32Array[nodeIndex32+3]!==maxx||float32Array[nodeIndex32+4]!==maxy||float32Array[nodeIndex32+5]!==maxz)&&(float32Array[nodeIndex32+0]=minx,float32Array[nodeIndex32+1]=miny,float32Array[nodeIndex32+2]=minz,float32Array[nodeIndex32+3]=maxx,float32Array[nodeIndex32+4]=maxy,float32Array[nodeIndex32+5]=maxz,!0)}{const left=LEFT_NODE(nodeIndex32),right=RIGHT_NODE(nodeIndex32,uint32Array);let forceChildren=force,includesLeft=!1,includesRight=!1;if(nodeIndices){if(!forceChildren){const rightNodeId=right/UINT32_PER_NODE+byteOffset/BYTES_PER_NODE;includesLeft=nodeIndices.has(left/UINT32_PER_NODE+byteOffset/BYTES_PER_NODE),includesRight=nodeIndices.has(rightNodeId),forceChildren=!includesLeft&&!includesRight}}else includesLeft=!0,includesRight=!0;const traverseRight=forceChildren||includesRight;let leftChange=!1;(forceChildren||includesLeft)&&(leftChange=_traverse(left,byteOffset,forceChildren));let rightChange=!1;traverseRight&&(rightChange=_traverse(right,byteOffset,forceChildren));const didChange=leftChange||rightChange;if(didChange)for(let i=0;i<3;i++){const left_i=left+i,right_i=right+i,minLeftValue=float32Array[left_i],maxLeftValue=float32Array[left_i+3],minRightValue=float32Array[right_i],maxRightValue=float32Array[right_i+3];float32Array[nodeIndex32+i]=minLeftValue<minRightValue?minLeftValue:minRightValue,float32Array[nodeIndex32+i+3]=maxLeftValue>maxRightValue?maxLeftValue:maxRightValue}return didChange}}}export{refit};
+//# sourceMappingURL=refit.generated.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/refit.generated.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refit.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/refit.generated.js"],"sourcesContent":["import { UINT32_PER_NODE, BYTES_PER_NODE } from '../Constants.js';\nimport { IS_LEAF, 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 = uint32Array[ nodeIndex32 + 6 ];\n\t\t\tconst count = uint16Array[ nodeIndex16 + 14 ];\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"],"names":["refit","bvh","nodeIndices","Array","isArray","Set","geometry","indexArr","index","array","posAttr","attributes","position","buffer","uint32Array","uint16Array","float32Array","byteOffset","roots","_roots","i","l","length","Uint32Array","Uint16Array","Float32Array","_traverse","byteLength","nodeIndex32","force","nodeIndex16","IS_LEAF","offset","minx","Infinity","miny","minz","maxx","maxy","maxz","x","getX","y","getY","z","getZ","left","LEFT_NODE","right","RIGHT_NODE","forceChildren","includesLeft","includesRight","rightNodeId","UINT32_PER_NODE","BYTES_PER_NODE","has","traverseRight","leftChange","rightChange","didChange","left_i","right_i","minLeftValue","maxLeftValue","minRightValue","maxRightValue"],"mappings":"kIAOA,SAASA,MAAOC,IAAKC,YAAc,MAE7BA,aAAeC,MAAMC,QAASF,eAElCA,YAAc,IAAIG,IAAKH,cAIxB,MAAMI,SAAWL,IAAIK,SACfC,SAAWD,SAASE,MAAQF,SAASE,MAAMC,MAAQ,KACnDC,QAAUJ,SAASK,WAAWC,SAEpC,IAAIC,OAAQC,YAAaC,YAAaC,aAClCC,WAAa,EACjB,MAAMC,MAAQjB,IAAIkB,OAClB,IAAM,IAAIC,EAAI,EAAGC,EAAIH,MAAMI,OAAQF,EAAIC,EAAGD,IAEzCP,OAASK,MAAOE,GAChBN,YAAc,IAAIS,YAAaV,QAC/BE,YAAc,IAAIS,YAAaX,QAC/BG,aAAe,IAAIS,aAAcZ,QAEjCa,UAAW,EAAGT,YACdA,YAAcJ,OAAOc,WAItB,SAASD,UAAWE,YAAaX,WAAYY,OAAQ,GAEpD,MAAMC,YAA4B,EAAdF,YACpB,GAAKG,QAASD,YAAaf,aAAgB,CAE1C,MAAMiB,OAASlB,YAAac,YAAc,GAG1C,IAAIK,KAAOC,IACPC,KAAOD,IACPE,KAAOF,IACPG,MAAO,IACPC,MAAO,IACPC,MAAO,IAGX,IAAM,IAAInB,EAAI,EAAIY,OAAQX,EAAI,GAAMW,OAVtBjB,YAAae,YAAc,KAUaV,EAAIC,EAAGD,IAAO,CAEnE,IAAIZ,MAAQD,SAAUa,GACtB,MAAMoB,EAAI9B,QAAQ+B,KAAMjC,OAClBkC,EAAIhC,QAAQiC,KAAMnC,OAClBoC,EAAIlC,QAAQmC,KAAMrC,OAEnBgC,EAAIP,OAAOA,KAAOO,GAClBA,EAAIH,OAAOA,KAAOG,GAElBE,EAAIP,OAAOA,KAAOO,GAClBA,EAAIJ,OAAOA,KAAOI,GAElBE,EAAIR,OAAOA,KAAOQ,GAClBA,EAAIL,OAAOA,KAAOK,EAExB,CAGA,OACC5B,aAAcY,YAAc,KAAQK,MACpCjB,aAAcY,YAAc,KAAQO,MACpCnB,aAAcY,YAAc,KAAQQ,MAEpCpB,aAAcY,YAAc,KAAQS,MACpCrB,aAAcY,YAAc,KAAQU,MACpCtB,aAAcY,YAAc,KAAQW,QAGpCvB,aAAcY,YAAc,GAAMK,KAClCjB,aAAcY,YAAc,GAAMO,KAClCnB,aAAcY,YAAc,GAAMQ,KAElCpB,aAAcY,YAAc,GAAMS,KAClCrB,aAAcY,YAAc,GAAMU,KAClCtB,aAAcY,YAAc,GAAMW,MAE3B,EAQT,CAAO,CAEN,MAAMO,KAAOC,UAAWnB,aAClBoB,MAAQC,WAAYrB,YAAad,aAIvC,IAAIoC,cAAgBrB,MAChBsB,cAAe,EACfC,eAAgB,EAEpB,GAAKlD,aAIJ,IAAOgD,cAAgB,CAEtB,MACMG,YAAcL,MAAQM,gBAAkBrC,WAAasC,eAC3DJ,aAAejD,YAAYsD,IAFRV,KAAOQ,gBAAkBrC,WAAasC,gBAGzDH,cAAgBlD,YAAYsD,IAAKH,aACjCH,eAAkBC,eAAkBC,aAErC,OAIAD,cAAe,EACfC,eAAgB,EAIjB,MACMK,cAAgBP,eAAiBE,cAEvC,IAAIM,YAAa,GAHIR,eAAiBC,gBAMrCO,WAAahC,UAAWoB,KAAM7B,WAAYiC,gBAI3C,IAAIS,aAAc,EACbF,gBAEJE,YAAcjC,UAAWsB,MAAO/B,WAAYiC,gBAI7C,MAAMU,UAAYF,YAAcC,YAChC,GAAKC,UAEJ,IAAM,IAAIxC,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAMyC,OAASf,KAAO1B,EAChB0C,QAAUd,MAAQ5B,EAClB2C,aAAe/C,aAAc6C,QAC7BG,aAAehD,aAAc6C,OAAS,GACtCI,cAAgBjD,aAAc8C,SAC9BI,cAAgBlD,aAAc8C,QAAU,GAE9C9C,aAAcY,YAAcR,GAAM2C,aAAeE,cAAgBF,aAAeE,cAChFjD,aAAcY,YAAcR,EAAI,GAAM4C,aAAeE,cAAgBF,aAAeE,aAErF,CAID,OAAON,SAER,CAED,CAED","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/refit_indirect.generated.js

@@ -0,0 +1,2 @@
+import{UINT32_PER_NODE,BYTES_PER_NODE}from"../Constants.js";import{IS_LEAF,RIGHT_NODE,LEFT_NODE}from"../utils/nodeBufferUtils.js";function refit_indirect(bvh,nodeIndices=null){nodeIndices&&Array.isArray(nodeIndices)&&(nodeIndices=new Set(nodeIndices));const geometry=bvh.geometry,indexArr=geometry.index?geometry.index.array:null,posAttr=geometry.attributes.position;let buffer,uint32Array,uint16Array,float32Array,byteOffset=0;const roots=bvh._roots;for(let i=0,l=roots.length;i<l;i++)buffer=roots[i],uint32Array=new Uint32Array(buffer),uint16Array=new Uint16Array(buffer),float32Array=new Float32Array(buffer),_traverse(0,byteOffset),byteOffset+=buffer.byteLength;function _traverse(nodeIndex32,byteOffset,force=!1){const nodeIndex16=2*nodeIndex32;if(IS_LEAF(nodeIndex16,uint16Array)){const offset=uint32Array[nodeIndex32+6];let minx=1/0,miny=1/0,minz=1/0,maxx=-1/0,maxy=-1/0,maxz=-1/0;for(let i=offset,l=offset+uint16Array[nodeIndex16+14];i<l;i++){const t=3*bvh.resolveTriangleIndex(i);for(let j=0;j<3;j++){let index=t+j;index=indexArr?indexArr[index]:index;const x=posAttr.getX(index),y=posAttr.getY(index),z=posAttr.getZ(index);x<minx&&(minx=x),x>maxx&&(maxx=x),y<miny&&(miny=y),y>maxy&&(maxy=y),z<minz&&(minz=z),z>maxz&&(maxz=z)}}return(float32Array[nodeIndex32+0]!==minx||float32Array[nodeIndex32+1]!==miny||float32Array[nodeIndex32+2]!==minz||float32Array[nodeIndex32+3]!==maxx||float32Array[nodeIndex32+4]!==maxy||float32Array[nodeIndex32+5]!==maxz)&&(float32Array[nodeIndex32+0]=minx,float32Array[nodeIndex32+1]=miny,float32Array[nodeIndex32+2]=minz,float32Array[nodeIndex32+3]=maxx,float32Array[nodeIndex32+4]=maxy,float32Array[nodeIndex32+5]=maxz,!0)}{const left=LEFT_NODE(nodeIndex32),right=RIGHT_NODE(nodeIndex32,uint32Array);let forceChildren=force,includesLeft=!1,includesRight=!1;if(nodeIndices){if(!forceChildren){const rightNodeId=right/UINT32_PER_NODE+byteOffset/BYTES_PER_NODE;includesLeft=nodeIndices.has(left/UINT32_PER_NODE+byteOffset/BYTES_PER_NODE),includesRight=nodeIndices.has(rightNodeId),forceChildren=!includesLeft&&!includesRight}}else includesLeft=!0,includesRight=!0;const traverseRight=forceChildren||includesRight;let leftChange=!1;(forceChildren||includesLeft)&&(leftChange=_traverse(left,byteOffset,forceChildren));let rightChange=!1;traverseRight&&(rightChange=_traverse(right,byteOffset,forceChildren));const didChange=leftChange||rightChange;if(didChange)for(let i=0;i<3;i++){const left_i=left+i,right_i=right+i,minLeftValue=float32Array[left_i],maxLeftValue=float32Array[left_i+3],minRightValue=float32Array[right_i],maxRightValue=float32Array[right_i+3];float32Array[nodeIndex32+i]=minLeftValue<minRightValue?minLeftValue:minRightValue,float32Array[nodeIndex32+i+3]=maxLeftValue>maxRightValue?maxLeftValue:maxRightValue}return didChange}}}export{refit_indirect};
+//# sourceMappingURL=refit_indirect.generated.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/refit_indirect.generated.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refit_indirect.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/refit_indirect.generated.js"],"sourcesContent":["import { UINT32_PER_NODE, BYTES_PER_NODE } from '../Constants.js';\nimport { IS_LEAF, 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 = uint32Array[ nodeIndex32 + 6 ];\n\t\t\tconst count = uint16Array[ nodeIndex16 + 14 ];\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"],"names":["refit_indirect","bvh","nodeIndices","Array","isArray","Set","geometry","indexArr","index","array","posAttr","attributes","position","buffer","uint32Array","uint16Array","float32Array","byteOffset","roots","_roots","i","l","length","Uint32Array","Uint16Array","Float32Array","_traverse","byteLength","nodeIndex32","force","nodeIndex16","IS_LEAF","offset","minx","Infinity","miny","minz","maxx","maxy","maxz","t","resolveTriangleIndex","j","x","getX","y","getY","z","getZ","left","LEFT_NODE","right","RIGHT_NODE","forceChildren","includesLeft","includesRight","rightNodeId","UINT32_PER_NODE","BYTES_PER_NODE","has","traverseRight","leftChange","rightChange","didChange","left_i","right_i","minLeftValue","maxLeftValue","minRightValue","maxRightValue"],"mappings":"kIAOA,SAASA,eAAgBC,IAAKC,YAAc,MAEtCA,aAAeC,MAAMC,QAASF,eAElCA,YAAc,IAAIG,IAAKH,cAIxB,MAAMI,SAAWL,IAAIK,SACfC,SAAWD,SAASE,MAAQF,SAASE,MAAMC,MAAQ,KACnDC,QAAUJ,SAASK,WAAWC,SAEpC,IAAIC,OAAQC,YAAaC,YAAaC,aAClCC,WAAa,EACjB,MAAMC,MAAQjB,IAAIkB,OAClB,IAAM,IAAIC,EAAI,EAAGC,EAAIH,MAAMI,OAAQF,EAAIC,EAAGD,IAEzCP,OAASK,MAAOE,GAChBN,YAAc,IAAIS,YAAaV,QAC/BE,YAAc,IAAIS,YAAaX,QAC/BG,aAAe,IAAIS,aAAcZ,QAEjCa,UAAW,EAAGT,YACdA,YAAcJ,OAAOc,WAItB,SAASD,UAAWE,YAAaX,WAAYY,OAAQ,GAEpD,MAAMC,YAA4B,EAAdF,YACpB,GAAKG,QAASD,YAAaf,aAAgB,CAE1C,MAAMiB,OAASlB,YAAac,YAAc,GAG1C,IAAIK,KAAOC,IACPC,KAAOD,IACPE,KAAOF,IACPG,MAAO,IACPC,MAAO,IACPC,MAAO,IAEX,IAAM,IAAInB,EAAIY,OAAQX,EAAIW,OATZjB,YAAae,YAAc,IASCV,EAAIC,EAAGD,IAAO,CAEvD,MAAMoB,EAAI,EAAIvC,IAAIwC,qBAAsBrB,GACxC,IAAM,IAAIsB,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,IAAIlC,MAAQgC,EAAIE,EAChBlC,MAAQD,SAAWA,SAAUC,OAAUA,MAEvC,MAAMmC,EAAIjC,QAAQkC,KAAMpC,OAClBqC,EAAInC,QAAQoC,KAAMtC,OAClBuC,EAAIrC,QAAQsC,KAAMxC,OAEnBmC,EAAIV,OAAOA,KAAOU,GAClBA,EAAIN,OAAOA,KAAOM,GAElBE,EAAIV,OAAOA,KAAOU,GAClBA,EAAIP,OAAOA,KAAOO,GAElBE,EAAIX,OAAOA,KAAOW,GAClBA,EAAIR,OAAOA,KAAOQ,EAGxB,CAED,CAGA,OACC/B,aAAcY,YAAc,KAAQK,MACpCjB,aAAcY,YAAc,KAAQO,MACpCnB,aAAcY,YAAc,KAAQQ,MAEpCpB,aAAcY,YAAc,KAAQS,MACpCrB,aAAcY,YAAc,KAAQU,MACpCtB,aAAcY,YAAc,KAAQW,QAGpCvB,aAAcY,YAAc,GAAMK,KAClCjB,aAAcY,YAAc,GAAMO,KAClCnB,aAAcY,YAAc,GAAMQ,KAElCpB,aAAcY,YAAc,GAAMS,KAClCrB,aAAcY,YAAc,GAAMU,KAClCtB,aAAcY,YAAc,GAAMW,MAE3B,EAQT,CAAO,CAEN,MAAMU,KAAOC,UAAWtB,aAClBuB,MAAQC,WAAYxB,YAAad,aAIvC,IAAIuC,cAAgBxB,MAChByB,cAAe,EACfC,eAAgB,EAEpB,GAAKrD,aAIJ,IAAOmD,cAAgB,CAEtB,MACMG,YAAcL,MAAQM,gBAAkBxC,WAAayC,eAC3DJ,aAAepD,YAAYyD,IAFRV,KAAOQ,gBAAkBxC,WAAayC,gBAGzDH,cAAgBrD,YAAYyD,IAAKH,aACjCH,eAAkBC,eAAkBC,aAErC,OAIAD,cAAe,EACfC,eAAgB,EAIjB,MACMK,cAAgBP,eAAiBE,cAEvC,IAAIM,YAAa,GAHIR,eAAiBC,gBAMrCO,WAAanC,UAAWuB,KAAMhC,WAAYoC,gBAI3C,IAAIS,aAAc,EACbF,gBAEJE,YAAcpC,UAAWyB,MAAOlC,WAAYoC,gBAI7C,MAAMU,UAAYF,YAAcC,YAChC,GAAKC,UAEJ,IAAM,IAAI3C,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAM4C,OAASf,KAAO7B,EAChB6C,QAAUd,MAAQ/B,EAClB8C,aAAelD,aAAcgD,QAC7BG,aAAenD,aAAcgD,OAAS,GACtCI,cAAgBpD,aAAciD,SAC9BI,cAAgBrD,aAAciD,QAAU,GAE9CjD,aAAcY,YAAcR,GAAM8C,aAAeE,cAAgBF,aAAeE,cAChFpD,aAAcY,YAAcR,EAAI,GAAM+C,aAAeE,cAAgBF,aAAeE,aAErF,CAID,OAAON,SAER,CAED,CAED","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/shapecast.js

@@ -0,0 +1,2 @@
+import{UINT32_PER_NODE,CONTAINED}from"../Constants.js";import{arrayToBox}from"../../utils/ArrayBoxUtilities.js";import{PrimitivePool}from"../../utils/PrimitivePool.js";import{IS_LEAF,OFFSET,COUNT,BOUNDING_DATA_INDEX,RIGHT_NODE,LEFT_NODE}from"../utils/nodeBufferUtils.js";import{BufferStack}from"../utils/BufferStack.js";import{Box3}from"../../../../three/build/three.core.js";let _box1,_box2;const boxStack=[],boxPool=new PrimitivePool(()=>new Box3);function shapecast(bvh,root,intersectsBounds,intersectsRange,boundsTraverseOrder,nodeOffset){_box1=boxPool.getPrimitive(),_box2=boxPool.getPrimitive(),boxStack.push(_box1,_box2),BufferStack.setBuffer(bvh._roots[root]);const result=shapecastTraverse(0,bvh.geometry,intersectsBounds,intersectsRange,boundsTraverseOrder,nodeOffset);BufferStack.clearBuffer(),boxPool.releasePrimitive(_box1),boxPool.releasePrimitive(_box2),boxStack.pop(),boxStack.pop();const length=boxStack.length;return length>0&&(_box2=boxStack[length-1],_box1=boxStack[length-2]),result}function shapecastTraverse(nodeIndex32,geometry,intersectsBoundsFunc,intersectsRangeFunc,nodeScoreFunc=null,nodeIndexOffset=0,depth=0){const{float32Array:float32Array,uint16Array:uint16Array,uint32Array:uint32Array}=BufferStack;let nodeIndex16=2*nodeIndex32;if(IS_LEAF(nodeIndex16,uint16Array)){const offset=OFFSET(nodeIndex32,uint32Array),count=COUNT(nodeIndex16,uint16Array);return arrayToBox(BOUNDING_DATA_INDEX(nodeIndex32),float32Array,_box1),intersectsRangeFunc(offset,count,!1,depth,nodeIndexOffset+nodeIndex32/UINT32_PER_NODE,_box1)}{const left=LEFT_NODE(nodeIndex32),right=RIGHT_NODE(nodeIndex32,uint32Array);let score1,score2,box1,box2,c1=left,c2=right;if(nodeScoreFunc&&(box1=_box1,box2=_box2,arrayToBox(BOUNDING_DATA_INDEX(c1),float32Array,box1),arrayToBox(BOUNDING_DATA_INDEX(c2),float32Array,box2),score1=nodeScoreFunc(box1),score2=nodeScoreFunc(box2),score2<score1)){c1=right,c2=left;const temp=score1;score1=score2,score2=temp,box1=box2}box1||(box1=_box1,arrayToBox(BOUNDING_DATA_INDEX(c1),float32Array,box1));const c1Intersection=intersectsBoundsFunc(box1,IS_LEAF(2*c1,uint16Array),score1,depth+1,nodeIndexOffset+c1/UINT32_PER_NODE);let c1StopTraversal;if(c1Intersection===CONTAINED){const offset=getLeftOffset(c1);c1StopTraversal=intersectsRangeFunc(offset,getRightEndOffset(c1)-offset,!0,depth+1,nodeIndexOffset+c1/UINT32_PER_NODE,box1)}else c1StopTraversal=c1Intersection&&shapecastTraverse(c1,geometry,intersectsBoundsFunc,intersectsRangeFunc,nodeScoreFunc,nodeIndexOffset,depth+1);if(c1StopTraversal)return!0;box2=_box2,arrayToBox(BOUNDING_DATA_INDEX(c2),float32Array,box2);const c2Intersection=intersectsBoundsFunc(box2,IS_LEAF(2*c2,uint16Array),score2,depth+1,nodeIndexOffset+c2/UINT32_PER_NODE);let c2StopTraversal;if(c2Intersection===CONTAINED){const offset=getLeftOffset(c2);c2StopTraversal=intersectsRangeFunc(offset,getRightEndOffset(c2)-offset,!0,depth+1,nodeIndexOffset+c2/UINT32_PER_NODE,box2)}else c2StopTraversal=c2Intersection&&shapecastTraverse(c2,geometry,intersectsBoundsFunc,intersectsRangeFunc,nodeScoreFunc,nodeIndexOffset,depth+1);return!!c2StopTraversal;function getLeftOffset(nodeIndex32){const{uint16Array:uint16Array,uint32Array:uint32Array}=BufferStack;let nodeIndex16=2*nodeIndex32;for(;!IS_LEAF(nodeIndex16,uint16Array);)nodeIndex16=2*(nodeIndex32=LEFT_NODE(nodeIndex32));return OFFSET(nodeIndex32,uint32Array)}function getRightEndOffset(nodeIndex32){const{uint16Array:uint16Array,uint32Array:uint32Array}=BufferStack;let nodeIndex16=2*nodeIndex32;for(;!IS_LEAF(nodeIndex16,uint16Array);)nodeIndex16=2*(nodeIndex32=RIGHT_NODE(nodeIndex32,uint32Array));return OFFSET(nodeIndex32,uint32Array)+COUNT(nodeIndex16,uint16Array)}}}export{shapecast};
+//# sourceMappingURL=shapecast.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/cast/shapecast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shapecast.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/shapecast.js"],"sourcesContent":["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 = /* @__PURE__ */ [];\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"],"names":["_box1","_box2","boxStack","boxPool","PrimitivePool","Box3","shapecast","bvh","root","intersectsBounds","intersectsRange","boundsTraverseOrder","nodeOffset","getPrimitive","push","BufferStack","setBuffer","_roots","result","shapecastTraverse","geometry","clearBuffer","releasePrimitive","pop","length","nodeIndex32","intersectsBoundsFunc","intersectsRangeFunc","nodeScoreFunc","nodeIndexOffset","depth","float32Array","uint16Array","uint32Array","nodeIndex16","IS_LEAF","offset","OFFSET","count","COUNT","arrayToBox","BOUNDING_DATA_INDEX","UINT32_PER_NODE","left","LEFT_NODE","right","RIGHT_NODE","score1","score2","box1","box2","c1","c2","temp","c1Intersection","c1StopTraversal","CONTAINED","getLeftOffset","getRightEndOffset","c2Intersection","c2StopTraversal"],"mappings":"wXAOA,IAAIA,MAAOC,MACX,MAAMC,SAA2B,GAC3BC,QAA0B,IAAIC,cAAe,IAAM,IAAIC,MAEtD,SAASC,UAAWC,IAAKC,KAAMC,iBAAkBC,gBAAiBC,oBAAqBC,YAG7FZ,MAAQG,QAAQU,eAChBZ,MAAQE,QAAQU,eAChBX,SAASY,KAAMd,MAAOC,OACtBc,YAAYC,UAAWT,IAAIU,OAAQT,OAEnC,MAAMU,OAASC,kBAAmB,EAAGZ,IAAIa,SAAUX,iBAAkBC,gBAAiBC,oBAAqBC,YAG3GG,YAAYM,cACZlB,QAAQmB,iBAAkBtB,OAC1BG,QAAQmB,iBAAkBrB,OAC1BC,SAASqB,MACTrB,SAASqB,MAET,MAAMC,OAAStB,SAASsB,OAQxB,OAPKA,OAAS,IAEbvB,MAAQC,SAAUsB,OAAS,GAC3BxB,MAAQE,SAAUsB,OAAS,IAIrBN,MAER,CAEA,SAASC,kBACRM,YACAL,SACAM,qBACAC,oBACAC,cAAgB,KAChBC,gBAAkB,EAClBC,MAAQ,GAGR,MAAMC,aAAEA,aAAYC,YAAEA,YAAWC,YAAEA,aAAgBlB,YACnD,IAAImB,YAA4B,EAAdT,YAGlB,GADeU,QAASD,YAAaF,aACvB,CAEb,MAAMI,OAASC,OAAQZ,YAAaQ,aAC9BK,MAAQC,MAAOL,YAAaF,aAElC,OADAQ,WAAYC,oBAAqBhB,aAAeM,aAAc/B,OACvD2B,oBAAqBS,OAAQE,OAAO,EAAOR,MAAOD,gBAAkBJ,YAAciB,gBAAiB1C,MAE3G,CAAO,CAEN,MAAM2C,KAAOC,UAAWnB,aAClBoB,MAAQC,WAAYrB,YAAaQ,aACvC,IAGIc,OAAQC,OACRC,KAAMC,KAJNC,GAAKR,KACLS,GAAKP,MAIT,GAAKjB,gBAEJqB,KAAOjD,MACPkD,KAAOjD,MAGPuC,WAAYC,oBAAqBU,IAAMpB,aAAckB,MACrDT,WAAYC,oBAAqBW,IAAMrB,aAAcmB,MAErDH,OAASnB,cAAeqB,MACxBD,OAASpB,cAAesB,MAEnBF,OAASD,QAAS,CAEtBI,GAAKN,MACLO,GAAKT,KAEL,MAAMU,KAAON,OACbA,OAASC,OACTA,OAASK,KAETJ,KAAOC,IAGR,CAKMD,OAENA,KAAOjD,MACPwC,WAAYC,oBAAqBU,IAAMpB,aAAckB,OAItD,MACMK,eAAiB5B,qBAAsBuB,KAD5Bd,QAAc,EAALgB,GAAQnB,aAC2Be,OAAQjB,MAAQ,EAAGD,gBAAkBsB,GAAKT,iBAEvG,IAAIa,gBACJ,GAAKD,iBAAmBE,UAAY,CAEnC,MAAMpB,OAASqB,cAAeN,IAI9BI,gBAAkB5B,oBAAqBS,OAH3BsB,kBAAmBP,IACXf,QAEkC,EAAMN,MAAQ,EAAGD,gBAAkBsB,GAAKT,gBAAiBO,KAEhH,MAECM,gBACCD,gBACAnC,kBACCgC,GACA/B,SACAM,qBACAC,oBACAC,cACAC,gBACAC,MAAQ,GAKX,GAAKyB,gBAAkB,OAAO,EAI9BL,KAAOjD,MACPuC,WAAYC,oBAAqBW,IAAMrB,aAAcmB,MAErD,MACMS,eAAiBjC,qBAAsBwB,KAD5Bf,QAAc,EAALiB,GAAQpB,aAC2BgB,OAAQlB,MAAQ,EAAGD,gBAAkBuB,GAAKV,iBAEvG,IAAIkB,gBACJ,GAAKD,iBAAmBH,UAAY,CAEnC,MAAMpB,OAASqB,cAAeL,IAI9BQ,gBAAkBjC,oBAAqBS,OAH3BsB,kBAAmBN,IACXhB,QAEkC,EAAMN,MAAQ,EAAGD,gBAAkBuB,GAAKV,gBAAiBQ,KAEhH,MAECU,gBACCD,gBACAxC,kBACCiC,GACAhC,SACAM,qBACAC,oBACAC,cACAC,gBACAC,MAAQ,GAKX,QAAK8B,gBAML,SAASH,cAAehC,aAEvB,MAAMO,YAAEA,YAAWC,YAAEA,aAAgBlB,YACrC,IAAImB,YAA4B,EAAdT,YAGlB,MAAUU,QAASD,YAAaF,cAG/BE,YAA4B,GAD5BT,YAAcmB,UAAWnB,cAK1B,OAAOY,OAAQZ,YAAaQ,YAE7B,CAEA,SAASyB,kBAAmBjC,aAE3B,MAAMO,YAAEA,YAAWC,YAAEA,aAAgBlB,YACrC,IAAImB,YAA4B,EAAdT,YAGlB,MAAUU,QAASD,YAAaF,cAI/BE,YAA4B,GAD5BT,YAAcqB,WAAYrB,YAAaQ,cAMxC,OAAOI,OAAQZ,YAAaQ,aAAgBM,MAAOL,YAAaF,YAEjE,CAED,CAED","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/BufferStack.js

@@ -0,0 +1,2 @@
+class _BufferStack{constructor(){this.float32Array=null,this.uint16Array=null,this.uint32Array=null;const stack=[];let prevBuffer=null;this.setBuffer=buffer=>{prevBuffer&&stack.push(prevBuffer),prevBuffer=buffer,this.float32Array=new Float32Array(buffer),this.uint16Array=new Uint16Array(buffer),this.uint32Array=new Uint32Array(buffer)},this.clearBuffer=()=>{prevBuffer=null,this.float32Array=null,this.uint16Array=null,this.uint32Array=null,0!==stack.length&&this.setBuffer(stack.pop())}}}const BufferStack=new _BufferStack;export{BufferStack};
+//# sourceMappingURL=BufferStack.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/BufferStack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BufferStack.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/utils/BufferStack.js"],"sourcesContent":["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"],"names":["_BufferStack","constructor","this","float32Array","uint16Array","uint32Array","stack","prevBuffer","setBuffer","buffer","push","Float32Array","Uint16Array","Uint32Array","clearBuffer","length","pop","BufferStack"],"mappings":"AAAA,MAAMA,aAEL,WAAAC,GAECC,KAAKC,aAAe,KACpBD,KAAKE,YAAc,KACnBF,KAAKG,YAAc,KAEnB,MAAMC,MAAQ,GACd,IAAIC,WAAa,KACjBL,KAAKM,UAAYC,SAEXF,YAEJD,MAAMI,KAAMH,YAIbA,WAAaE,OACbP,KAAKC,aAAe,IAAIQ,aAAcF,QACtCP,KAAKE,YAAc,IAAIQ,YAAaH,QACpCP,KAAKG,YAAc,IAAIQ,YAAaJ,SAIrCP,KAAKY,YAAc,KAElBP,WAAa,KACbL,KAAKC,aAAe,KACpBD,KAAKE,YAAc,KACnBF,KAAKG,YAAc,KAEG,IAAjBC,MAAMS,QAEVb,KAAKM,UAAWF,MAAMU,OAMzB,EAIW,MAACC,YAA8B,IAAIjB","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/intersectUtils.js

@@ -0,0 +1,2 @@
+function intersectRay(nodeIndex32,array,ray,near,far){let tmin,tmax,tymin,tymax,tzmin,tzmax;const invdirx=1/ray.direction.x,invdiry=1/ray.direction.y,invdirz=1/ray.direction.z,ox=ray.origin.x,oy=ray.origin.y,oz=ray.origin.z;let minx=array[nodeIndex32],maxx=array[nodeIndex32+3],miny=array[nodeIndex32+1],maxy=array[nodeIndex32+3+1],minz=array[nodeIndex32+2],maxz=array[nodeIndex32+3+2];return invdirx>=0?(tmin=(minx-ox)*invdirx,tmax=(maxx-ox)*invdirx):(tmin=(maxx-ox)*invdirx,tmax=(minx-ox)*invdirx),invdiry>=0?(tymin=(miny-oy)*invdiry,tymax=(maxy-oy)*invdiry):(tymin=(maxy-oy)*invdiry,tymax=(miny-oy)*invdiry),!(tmin>tymax||tymin>tmax)&&((tymin>tmin||isNaN(tmin))&&(tmin=tymin),(tymax<tmax||isNaN(tmax))&&(tmax=tymax),invdirz>=0?(tzmin=(minz-oz)*invdirz,tzmax=(maxz-oz)*invdirz):(tzmin=(maxz-oz)*invdirz,tzmax=(minz-oz)*invdirz),!(tmin>tzmax||tzmin>tmax)&&((tzmin>tmin||tmin!=tmin)&&(tmin=tzmin),(tzmax<tmax||tmax!=tmax)&&(tmax=tzmax),tmin<=far&&tmax>=near))}export{intersectRay};
+//# sourceMappingURL=intersectUtils.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/intersectUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersectUtils.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/utils/intersectUtils.js"],"sourcesContent":["/**\n * This function performs intersection tests similar to Ray.intersectBox in three.js,\n * with the difference that the box values are read from an array to improve performance.\n */\nexport function intersectRay( nodeIndex32, array, ray, near, far ) {\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"],"names":["intersectRay","nodeIndex32","array","ray","near","far","tmin","tmax","tymin","tymax","tzmin","tzmax","invdirx","direction","x","invdiry","y","invdirz","z","ox","origin","oy","oz","minx","maxx","miny","maxy","minz","maxz","isNaN"],"mappings":"AAIO,SAASA,aAAcC,YAAaC,MAAOC,IAAKC,KAAMC,KAE5D,IAAIC,KAAMC,KAAMC,MAAOC,MAAOC,MAAOC,MAErC,MAAMC,QAAU,EAAIT,IAAIU,UAAUC,EACjCC,QAAU,EAAIZ,IAAIU,UAAUG,EAC5BC,QAAU,EAAId,IAAIU,UAAUK,EAEvBC,GAAKhB,IAAIiB,OAAON,EAChBO,GAAKlB,IAAIiB,OAAOJ,EAChBM,GAAKnB,IAAIiB,OAAOF,EAEtB,IAAIK,KAAOrB,MAAOD,aACduB,KAAOtB,MAAOD,YAAc,GAE5BwB,KAAOvB,MAAOD,YAAc,GAC5ByB,KAAOxB,MAAOD,YAAc,EAAI,GAEhC0B,KAAOzB,MAAOD,YAAc,GAC5B2B,KAAO1B,MAAOD,YAAc,EAAI,GA0BpC,OAxBKW,SAAW,GAEfN,MAASiB,KAAOJ,IAAOP,QACvBL,MAASiB,KAAOL,IAAOP,UAIvBN,MAASkB,KAAOL,IAAOP,QACvBL,MAASgB,KAAOJ,IAAOP,SAInBG,SAAW,GAEfP,OAAUiB,KAAOJ,IAAON,QACxBN,OAAUiB,KAAOL,IAAON,UAIxBP,OAAUkB,KAAOL,IAAON,QACxBN,OAAUgB,KAAOJ,IAAON,WAIlBT,KAAOG,OAAaD,MAAQD,SAE9BC,MAAQF,MAAQuB,MAAOvB,SAASA,KAAOE,QAEvCC,MAAQF,MAAQsB,MAAOtB,SAASA,KAAOE,OAEvCQ,SAAW,GAEfP,OAAUiB,KAAOL,IAAOL,QACxBN,OAAUiB,KAAON,IAAOL,UAIxBP,OAAUkB,KAAON,IAAOL,QACxBN,OAAUgB,KAAOL,IAAOL,WAIlBX,KAAOK,OAAaD,MAAQH,SAE9BG,MAAQJ,MAAQA,MAASA,QAAOA,KAAOI,QAEvCC,MAAQJ,MAAQA,MAASA,QAAOA,KAAOI,OAIrCL,MAAQD,KAAOE,MAAQH,MAE/B","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/iterationUtils.generated.js

@@ -0,0 +1,2 @@
+import{intersectTri}from"../../utils/ThreeRayIntersectUtilities.js";import{setTriangle}from"../../utils/TriangleUtilities.js";function intersectTris(bvh,materialOrSide,ray,offset,count,intersections,near,far){const{geometry:geometry}=bvh;for(let i=offset,end=offset+count;i<end;i++)intersectTri(geometry,materialOrSide,ray,i,intersections,near,far)}function intersectClosestTri(bvh,materialOrSide,ray,offset,count,near,far){const{geometry:geometry}=bvh;let dist=1/0,res=null;for(let i=offset,end=offset+count;i<end;i++){let intersection;intersection=intersectTri(geometry,materialOrSide,ray,i,null,near,far),intersection&&intersection.distance<dist&&(res=intersection,dist=intersection.distance)}return res}function iterateOverTriangles(offset,count,bvh,intersectsTriangleFunc,contained,depth,triangle){const{geometry:geometry}=bvh,{index:index}=geometry,pos=geometry.attributes.position;for(let i=offset,l=count+offset;i<l;i++){let tri;if(tri=i,setTriangle(triangle,3*tri,index,pos),triangle.needsUpdate=!0,intersectsTriangleFunc(triangle,tri,contained,depth))return!0}return!1}export{intersectClosestTri,intersectTris,iterateOverTriangles};
+//# sourceMappingURL=iterationUtils.generated.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/iterationUtils.generated.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterationUtils.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/utils/iterationUtils.generated.js"],"sourcesContent":["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"],"names":["intersectTris","bvh","materialOrSide","ray","offset","count","intersections","near","far","geometry","i","end","intersectTri","intersectClosestTri","dist","Infinity","res","intersection","distance","iterateOverTriangles","intersectsTriangleFunc","contained","depth","triangle","index","pos","attributes","position","l","tri","setTriangle","needsUpdate"],"mappings":"8HAOA,SAASA,cAAeC,IAAKC,eAAgBC,IAAKC,OAAQC,MAAOC,cAAeC,KAAMC,KAErF,MAAMC,SAAEA,UAA8BR,IACtC,IAAM,IAAIS,EAAIN,OAAQO,IAAMP,OAASC,MAAOK,EAAIC,IAAKD,IAGpDE,aAAcH,SAAUP,eAAgBC,IAAKO,EAAGJ,cAAeC,KAAMC,IAKvE,CAEA,SAASK,oBAAqBZ,IAAKC,eAAgBC,IAAKC,OAAQC,MAAOE,KAAMC,KAE5E,MAAMC,SAAEA,UAA8BR,IACtC,IAAIa,KAAOC,IACPC,IAAM,KACV,IAAM,IAAIN,EAAIN,OAAQO,IAAMP,OAASC,MAAOK,EAAIC,IAAKD,IAAO,CAE3D,IAAIO,aAEJA,aAAeL,aAAcH,SAAUP,eAAgBC,IAAKO,EAAG,KAAMH,KAAMC,KAGtES,cAAgBA,aAAaC,SAAWJ,OAE5CE,IAAMC,aACNH,KAAOG,aAAaC,SAItB,CAEA,OAAOF,GAER,CAEA,SAASG,qBACRf,OACAC,MACAJ,IACAmB,uBACAC,UACAC,MACAC,UAGA,MAAMd,SAAEA,UAAaR,KACfuB,MAAEA,OAAUf,SACZgB,IAAMhB,SAASiB,WAAWC,SAChC,IAAM,IAAIjB,EAAIN,OAAQwB,EAAIvB,MAAQD,OAAQM,EAAIkB,EAAGlB,IAAO,CAEvD,IAAImB,IAOJ,GALAA,IAAMnB,EAENoB,YAAaP,SAAgB,EAANM,IAASL,MAAOC,KACvCF,SAASQ,aAAc,EAElBX,uBAAwBG,SAAUM,IAAKR,UAAWC,OAEtD,OAAO,CAIT,CAEA,OAAO,CAER","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/iterationUtils_indirect.generated.js

@@ -0,0 +1,2 @@
+import{intersectTri}from"../../utils/ThreeRayIntersectUtilities.js";import{setTriangle}from"../../utils/TriangleUtilities.js";function intersectTris_indirect(bvh,materialOrSide,ray,offset,count,intersections,near,far){const{geometry:geometry,_indirectBuffer:_indirectBuffer}=bvh;for(let i=offset,end=offset+count;i<end;i++)intersectTri(geometry,materialOrSide,ray,_indirectBuffer?_indirectBuffer[i]:i,intersections,near,far)}function intersectClosestTri_indirect(bvh,materialOrSide,ray,offset,count,near,far){const{geometry:geometry,_indirectBuffer:_indirectBuffer}=bvh;let dist=1/0,res=null;for(let i=offset,end=offset+count;i<end;i++){let intersection;intersection=intersectTri(geometry,materialOrSide,ray,_indirectBuffer?_indirectBuffer[i]:i,null,near,far),intersection&&intersection.distance<dist&&(res=intersection,dist=intersection.distance)}return res}function iterateOverTriangles_indirect(offset,count,bvh,intersectsTriangleFunc,contained,depth,triangle){const{geometry:geometry}=bvh,{index:index}=geometry,pos=geometry.attributes.position;for(let i=offset,l=count+offset;i<l;i++){let tri;if(tri=bvh.resolveTriangleIndex(i),setTriangle(triangle,3*tri,index,pos),triangle.needsUpdate=!0,intersectsTriangleFunc(triangle,tri,contained,depth))return!0}return!1}export{intersectClosestTri_indirect,intersectTris_indirect,iterateOverTriangles_indirect};
+//# sourceMappingURL=iterationUtils_indirect.generated.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/iterationUtils_indirect.generated.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterationUtils_indirect.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/utils/iterationUtils_indirect.generated.js"],"sourcesContent":["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"],"names":["intersectTris_indirect","bvh","materialOrSide","ray","offset","count","intersections","near","far","geometry","_indirectBuffer","i","end","intersectTri","intersectClosestTri_indirect","dist","Infinity","res","intersection","distance","iterateOverTriangles_indirect","intersectsTriangleFunc","contained","depth","triangle","index","pos","attributes","position","l","tri","resolveTriangleIndex","setTriangle","needsUpdate"],"mappings":"8HAOA,SAASA,uBAAwBC,IAAKC,eAAgBC,IAAKC,OAAQC,MAAOC,cAAeC,KAAMC,KAE9F,MAAMC,SAAEA,SAAQC,gBAAEA,iBAAoBT,IACtC,IAAM,IAAIU,EAAIP,OAAQQ,IAAMR,OAASC,MAAOM,EAAIC,IAAKD,IAGpDE,aAAcJ,SAAUP,eAAgBC,IAD/BO,gBAAkBA,gBAAiBC,GAAMA,EACDL,cAAeC,KAAMC,IAKxE,CAEA,SAASM,6BAA8Bb,IAAKC,eAAgBC,IAAKC,OAAQC,MAAOE,KAAMC,KAErF,MAAMC,SAAEA,SAAQC,gBAAEA,iBAAoBT,IACtC,IAAIc,KAAOC,IACPC,IAAM,KACV,IAAM,IAAIN,EAAIP,OAAQQ,IAAMR,OAASC,MAAOM,EAAIC,IAAKD,IAAO,CAE3D,IAAIO,aACJA,aAAeL,aAAcJ,SAAUP,eAAgBC,IAAKO,gBAAkBA,gBAAiBC,GAAMA,EAAG,KAAMJ,KAAMC,KAG/GU,cAAgBA,aAAaC,SAAWJ,OAE5CE,IAAMC,aACNH,KAAOG,aAAaC,SAItB,CAEA,OAAOF,GAER,CAEA,SAASG,8BACRhB,OACAC,MACAJ,IACAoB,uBACAC,UACAC,MACAC,UAGA,MAAMf,SAAEA,UAAaR,KACfwB,MAAEA,OAAUhB,SACZiB,IAAMjB,SAASkB,WAAWC,SAChC,IAAM,IAAIjB,EAAIP,OAAQyB,EAAIxB,MAAQD,OAAQO,EAAIkB,EAAGlB,IAAO,CAEvD,IAAImB,IAMJ,GALAA,IAAM7B,IAAI8B,qBAAsBpB,GAEhCqB,YAAaR,SAAgB,EAANM,IAASL,MAAOC,KACvCF,SAASS,aAAc,EAElBZ,uBAAwBG,SAAUM,IAAKR,UAAWC,OAEtD,OAAO,CAIT,CAEA,OAAO,CAER","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/nodeBufferUtils.js

@@ -0,0 +1,2 @@
+import{IS_LEAFNODE_FLAG,UINT32_PER_NODE}from"../Constants.js";function IS_LEAF(n16,uint16Array){return uint16Array[n16+15]===IS_LEAFNODE_FLAG}function OFFSET(n32,uint32Array){return uint32Array[n32+6]}function COUNT(n16,uint16Array){return uint16Array[n16+14]}function LEFT_NODE(n32){return n32+UINT32_PER_NODE}function RIGHT_NODE(n32,uint32Array){return n32+uint32Array[n32+6]*UINT32_PER_NODE}function SPLIT_AXIS(n32,uint32Array){return uint32Array[n32+7]}function BOUNDING_DATA_INDEX(n32){return n32}export{BOUNDING_DATA_INDEX,COUNT,IS_LEAF,LEFT_NODE,OFFSET,RIGHT_NODE,SPLIT_AXIS};
+//# sourceMappingURL=nodeBufferUtils.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/core/utils/nodeBufferUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeBufferUtils.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/utils/nodeBufferUtils.js"],"sourcesContent":["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"],"names":["IS_LEAF","n16","uint16Array","IS_LEAFNODE_FLAG","OFFSET","n32","uint32Array","COUNT","LEFT_NODE","UINT32_PER_NODE","RIGHT_NODE","SPLIT_AXIS","BOUNDING_DATA_INDEX"],"mappings":"8DAEO,SAASA,QAASC,IAAKC,aAE7B,OAAOA,YAAaD,IAAM,MAASE,gBAEpC,CAEO,SAASC,OAAQC,IAAKC,aAE5B,OAAOA,YAAaD,IAAM,EAE3B,CAEO,SAASE,MAAON,IAAKC,aAE3B,OAAOA,YAAaD,IAAM,GAE3B,CAGO,SAASO,UAAWH,KAE1B,OAAOA,IAAMI,eAEd,CAGO,SAASC,WAAYL,IAAKC,aAIhC,OAAOD,IADgBC,YAAaD,IAAM,GACZI,eAE/B,CAEO,SAASE,WAAYN,IAAKC,aAEhC,OAAOA,YAAaD,IAAM,EAE3B,CAEO,SAASO,oBAAqBP,KAEpC,OAAOA,GAER","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/math/ExtendedTriangle.js

@@ -0,0 +1,2 @@
+import"../../../three/build/three.module.js";import{SeparatingAxisBounds}from"./SeparatingAxisBounds.js";import{sphereIntersectTriangle,closestPointsSegmentToSegment}from"./MathUtilities.js";import{Triangle,Vector3,Plane,Line3,Vector2}from"../../../three/build/three.core.js";const componentKeys=["x","y","z"];function isNearZero(value){return Math.abs(value)<1e-15}class ExtendedTriangle extends Triangle{constructor(...args){super(...args),this.isExtendedTriangle=!0,this.satAxes=new Array(4).fill().map(()=>new Vector3),this.satBounds=new Array(4).fill().map(()=>new SeparatingAxisBounds),this.points=[this.a,this.b,this.c],this.plane=new Plane,this.isDegenerateIntoSegment=!1,this.isDegenerateIntoPoint=!1,this.degenerateSegment=new Line3,this.needsUpdate=!0}intersectsSphere(sphere){return sphereIntersectTriangle(sphere,this)}update(){const a=this.a,b=this.b,c=this.c,points=this.points,satAxes=this.satAxes,satBounds=this.satBounds,axis0=satAxes[0],sab0=satBounds[0];this.getNormal(axis0),sab0.setFromPoints(axis0,points);const axis1=satAxes[1],sab1=satBounds[1];axis1.subVectors(a,b),sab1.setFromPoints(axis1,points);const axis2=satAxes[2],sab2=satBounds[2];axis2.subVectors(b,c),sab2.setFromPoints(axis2,points);const axis3=satAxes[3],sab3=satBounds[3];axis3.subVectors(c,a),sab3.setFromPoints(axis3,points);const lengthAB=axis1.length(),lengthBC=axis2.length(),lengthCA=axis3.length();this.isDegenerateIntoPoint=!1,this.isDegenerateIntoSegment=!1,lengthAB<1e-15?lengthBC<1e-15||lengthCA<1e-15?this.isDegenerateIntoPoint=!0:(this.isDegenerateIntoSegment=!0,this.degenerateSegment.start.copy(a),this.degenerateSegment.end.copy(c)):lengthBC<1e-15?lengthCA<1e-15?this.isDegenerateIntoPoint=!0:(this.isDegenerateIntoSegment=!0,this.degenerateSegment.start.copy(b),this.degenerateSegment.end.copy(a)):lengthCA<1e-15&&(this.isDegenerateIntoSegment=!0,this.degenerateSegment.start.copy(c),this.degenerateSegment.end.copy(b)),this.plane.setFromNormalAndCoplanarPoint(axis0,a),this.needsUpdate=!1}}ExtendedTriangle.prototype.closestPointToSegment=function(){const point1=new Vector3,point2=new Vector3,edge=new Line3;return function(segment,target1=null,target2=null){const{start:start,end:end}=segment,points=this.points;let distSq,closestDistanceSq=1/0;for(let i=0;i<3;i++){const nexti=(i+1)%3;edge.start.copy(points[i]),edge.end.copy(points[nexti]),closestPointsSegmentToSegment(edge,segment,point1,point2),distSq=point1.distanceToSquared(point2),distSq<closestDistanceSq&&(closestDistanceSq=distSq,target1&&target1.copy(point1),target2&&target2.copy(point2))}return this.closestPointToPoint(start,point1),distSq=start.distanceToSquared(point1),distSq<closestDistanceSq&&(closestDistanceSq=distSq,target1&&target1.copy(point1),target2&&target2.copy(start)),this.closestPointToPoint(end,point1),distSq=end.distanceToSquared(point1),distSq<closestDistanceSq&&(closestDistanceSq=distSq,target1&&target1.copy(point1),target2&&target2.copy(end)),Math.sqrt(closestDistanceSq)}}(),ExtendedTriangle.prototype.intersectsTriangle=function(){const saTri2=new ExtendedTriangle,cachedSatBounds=new SeparatingAxisBounds,cachedSatBounds2=new SeparatingAxisBounds,tmpVec=new Vector3,dir1=new Vector3,dir2=new Vector3,tempDir=new Vector3,edge1=new Line3,edge2=new Line3,tempPoint=new Vector3,bounds1=new Vector2,bounds2=new Vector2;function coplanarIntersectsTriangle(self,other,target,suppressLog){const planeNormal=tmpVec;planeNormal.copy(self.isDegenerateIntoPoint||self.isDegenerateIntoSegment?other.plane.normal:self.plane.normal);const satBounds1=self.satBounds,satAxes1=self.satAxes;for(let i=1;i<4;i++){const sb=satBounds1[i],sa=satAxes1[i];if(cachedSatBounds.setFromPoints(sa,other.points),sb.isSeparated(cachedSatBounds))return!1;if(tempDir.copy(planeNormal).cross(sa),cachedSatBounds.setFromPoints(tempDir,self.points),cachedSatBounds2.setFromPoints(tempDir,other.points),cachedSatBounds.isSeparated(cachedSatBounds2))return!1}const satBounds2=other.satBounds,satAxes2=other.satAxes;for(let i=1;i<4;i++){const sb=satBounds2[i],sa=satAxes2[i];if(cachedSatBounds.setFromPoints(sa,self.points),sb.isSeparated(cachedSatBounds))return!1;if(tempDir.crossVectors(planeNormal,sa),cachedSatBounds.setFromPoints(tempDir,self.points),cachedSatBounds2.setFromPoints(tempDir,other.points),cachedSatBounds.isSeparated(cachedSatBounds2))return!1}return target&&(suppressLog||console.warn("ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0."),target.start.set(0,0,0),target.end.set(0,0,0)),!0}function findSingleBounds(a,b,c,aProj,bProj,cProj,aDist,bDist,cDist,bounds,edge){let t=aDist/(aDist-bDist);bounds.x=aProj+(bProj-aProj)*t,edge.start.subVectors(b,a).multiplyScalar(t).add(a),t=aDist/(aDist-cDist),bounds.y=aProj+(cProj-aProj)*t,edge.end.subVectors(c,a).multiplyScalar(t).add(a)}function findIntersectionLineBounds(self,aProj,bProj,cProj,abDist,acDist,aDist,bDist,cDist,bounds,edge){if(abDist>0)findSingleBounds(self.c,self.a,self.b,cProj,aProj,bProj,cDist,aDist,bDist,bounds,edge);else if(acDist>0)findSingleBounds(self.b,self.a,self.c,bProj,aProj,cProj,bDist,aDist,cDist,bounds,edge);else if(bDist*cDist>0||0!=aDist)findSingleBounds(self.a,self.b,self.c,aProj,bProj,cProj,aDist,bDist,cDist,bounds,edge);else if(0!=bDist)findSingleBounds(self.b,self.a,self.c,bProj,aProj,cProj,bDist,aDist,cDist,bounds,edge);else{if(0==cDist)return!0;findSingleBounds(self.c,self.a,self.b,cProj,aProj,bProj,cDist,aDist,bDist,bounds,edge)}return!1}function intersectTriangleSegment(triangle,degenerateTriangle,target,suppressLog){const segment=degenerateTriangle.degenerateSegment,startDist=triangle.plane.distanceToPoint(segment.start),endDist=triangle.plane.distanceToPoint(segment.end);return isNearZero(startDist)?isNearZero(endDist)?coplanarIntersectsTriangle(triangle,degenerateTriangle,target,suppressLog):(target&&(target.start.copy(segment.start),target.end.copy(segment.start)),triangle.containsPoint(segment.start)):isNearZero(endDist)?(target&&(target.start.copy(segment.end),target.end.copy(segment.end)),triangle.containsPoint(segment.end)):null!=triangle.plane.intersectLine(segment,tmpVec)&&(target&&(target.start.copy(tmpVec),target.end.copy(tmpVec)),triangle.containsPoint(tmpVec))}function intersectTrianglePoint(triangle,degenerateTriangle,target){const point=degenerateTriangle.a;return!(!isNearZero(triangle.plane.distanceToPoint(point))||!triangle.containsPoint(point)||(target&&(target.start.copy(point),target.end.copy(point)),0))}function intersectSegmentPoint(segmentTri,pointTri,target){const point=pointTri.a;return segmentTri.degenerateSegment.closestPointToPoint(point,!0,tmpVec),point.distanceToSquared(tmpVec)<1e-30&&(target&&(target.start.copy(point),target.end.copy(point)),!0)}return function(other,target=null,suppressLog=!1){this.needsUpdate&&this.update(),other.isExtendedTriangle?other.needsUpdate&&other.update():(saTri2.copy(other),saTri2.update(),other=saTri2);const res=function(self,other,target,suppressLog){if(self.isDegenerateIntoSegment){if(other.isDegenerateIntoSegment){const segment1=self.degenerateSegment,segment2=other.degenerateSegment,delta1=dir1,delta2=dir2;segment1.delta(delta1),segment2.delta(delta2);const startDelta=tmpVec.subVectors(segment2.start,segment1.start),denom=delta1.x*delta2.y-delta1.y*delta2.x;if(isNearZero(denom))return!1;const t=(startDelta.x*delta2.y-startDelta.y*delta2.x)/denom,u=-(delta1.x*startDelta.y-delta1.y*startDelta.x)/denom;return!(t<0||t>1||u<0||u>1||!isNearZero(segment1.start.z+delta1.z*t-(segment2.start.z+delta2.z*u))||(target&&(target.start.copy(segment1.start).addScaledVector(delta1,t),target.end.copy(segment1.start).addScaledVector(delta1,t)),0))}return other.isDegenerateIntoPoint?intersectSegmentPoint(self,other,target):intersectTriangleSegment(other,self,target,suppressLog)}return self.isDegenerateIntoPoint?other.isDegenerateIntoPoint?other.a.distanceToSquared(self.a)<1e-30&&(target&&(target.start.copy(self.a),target.end.copy(self.a)),!0):other.isDegenerateIntoSegment?intersectSegmentPoint(other,self,target):intersectTrianglePoint(other,self,target):other.isDegenerateIntoPoint?intersectTrianglePoint(self,other,target):other.isDegenerateIntoSegment?intersectTriangleSegment(self,other,target,suppressLog):void 0}(this,other,target,suppressLog);if(void 0!==res)return res;const plane1=this.plane,plane2=other.plane;let a1Dist=plane2.distanceToPoint(this.a),b1Dist=plane2.distanceToPoint(this.b),c1Dist=plane2.distanceToPoint(this.c);isNearZero(a1Dist)&&(a1Dist=0),isNearZero(b1Dist)&&(b1Dist=0),isNearZero(c1Dist)&&(c1Dist=0);const a1b1Dist=a1Dist*b1Dist,a1c1Dist=a1Dist*c1Dist;if(a1b1Dist>0&&a1c1Dist>0)return!1;let a2Dist=plane1.distanceToPoint(other.a),b2Dist=plane1.distanceToPoint(other.b),c2Dist=plane1.distanceToPoint(other.c);isNearZero(a2Dist)&&(a2Dist=0),isNearZero(b2Dist)&&(b2Dist=0),isNearZero(c2Dist)&&(c2Dist=0);const a2b2Dist=a2Dist*b2Dist,a2c2Dist=a2Dist*c2Dist;if(a2b2Dist>0&&a2c2Dist>0)return!1;dir1.copy(plane1.normal),dir2.copy(plane2.normal);const intersectionLine=dir1.cross(dir2);let componentIndex=0,maxComponent=Math.abs(intersectionLine.x);const comp1=Math.abs(intersectionLine.y);comp1>maxComponent&&(maxComponent=comp1,componentIndex=1),Math.abs(intersectionLine.z)>maxComponent&&(componentIndex=2);const key=componentKeys[componentIndex],a2Proj=other.a[key],b2Proj=other.b[key],c2Proj=other.c[key];if(findIntersectionLineBounds(this,this.a[key],this.b[key],this.c[key],a1b1Dist,a1c1Dist,a1Dist,b1Dist,c1Dist,bounds1,edge1))return coplanarIntersectsTriangle(this,other,target,suppressLog);if(findIntersectionLineBounds(other,a2Proj,b2Proj,c2Proj,a2b2Dist,a2c2Dist,a2Dist,b2Dist,c2Dist,bounds2,edge2))return coplanarIntersectsTriangle(this,other,target,suppressLog);if(bounds1.y<bounds1.x){const tmp=bounds1.y;bounds1.y=bounds1.x,bounds1.x=tmp,tempPoint.copy(edge1.start),edge1.start.copy(edge1.end),edge1.end.copy(tempPoint)}if(bounds2.y<bounds2.x){const tmp=bounds2.y;bounds2.y=bounds2.x,bounds2.x=tmp,tempPoint.copy(edge2.start),edge2.start.copy(edge2.end),edge2.end.copy(tempPoint)}return!(bounds1.y<bounds2.x||bounds2.y<bounds1.x||(target&&(target.start.copy(bounds2.x>bounds1.x?edge2.start:edge1.start),target.end.copy(bounds2.y<bounds1.y?edge2.end:edge1.end)),0))}}(),ExtendedTriangle.prototype.distanceToPoint=function(){const target=new Vector3;return function(point){return this.closestPointToPoint(point,target),point.distanceTo(target)}}(),ExtendedTriangle.prototype.distanceToTriangle=function(){const point=new Vector3,point2=new Vector3,cornerFields=["a","b","c"],line1=new Line3,line2=new Line3;return function(other,target1=null,target2=null){const lineTarget=target1||target2?line1:null;if(this.intersectsTriangle(other,lineTarget))return(target1||target2)&&(target1&&lineTarget.getCenter(target1),target2&&lineTarget.getCenter(target2)),0;let closestDistanceSq=1/0;for(let i=0;i<3;i++){let dist;const field=cornerFields[i],otherVec=other[field];this.closestPointToPoint(otherVec,point),dist=otherVec.distanceToSquared(point),dist<closestDistanceSq&&(closestDistanceSq=dist,target1&&target1.copy(point),target2&&target2.copy(otherVec));const thisVec=this[field];other.closestPointToPoint(thisVec,point),dist=thisVec.distanceToSquared(point),dist<closestDistanceSq&&(closestDistanceSq=dist,target1&&target1.copy(thisVec),target2&&target2.copy(point))}for(let i=0;i<3;i++){line1.set(this[cornerFields[i]],this[cornerFields[(i+1)%3]]);for(let i2=0;i2<3;i2++){line2.set(other[cornerFields[i2]],other[cornerFields[(i2+1)%3]]),closestPointsSegmentToSegment(line1,line2,point,point2);const dist=point.distanceToSquared(point2);dist<closestDistanceSq&&(closestDistanceSq=dist,target1&&target1.copy(point),target2&&target2.copy(point2))}}return Math.sqrt(closestDistanceSq)}}();export{ExtendedTriangle};
+//# sourceMappingURL=ExtendedTriangle.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/math/ExtendedTriangle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExtendedTriangle.js","sources":["../../../../../../../../../../../../node_modules/three-mesh-bvh/src/math/ExtendedTriangle.js"],"sourcesContent":["import { 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\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\t\tthis.needsUpdate = true;\n\n\t}\n\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\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\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 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\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\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\tif ( this.intersectsTriangle( other, lineTarget ) ) {\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"],"names":["componentKeys","isNearZero","value","Math","abs","ExtendedTriangle","Triangle","constructor","args","super","this","isExtendedTriangle","satAxes","Array","fill","map","Vector3","satBounds","SeparatingAxisBounds","points","a","b","c","plane","Plane","isDegenerateIntoSegment","isDegenerateIntoPoint","degenerateSegment","Line3","needsUpdate","intersectsSphere","sphere","sphereIntersectTriangle","update","axis0","sab0","getNormal","setFromPoints","axis1","sab1","subVectors","axis2","sab2","axis3","sab3","lengthAB","length","lengthBC","lengthCA","start","copy","end","setFromNormalAndCoplanarPoint","prototype","closestPointToSegment","point1","point2","edge","segment","target1","target2","distSq","closestDistanceSq","Infinity","i","nexti","closestPointsSegmentToSegment","distanceToSquared","closestPointToPoint","sqrt","intersectsTriangle","saTri2","cachedSatBounds","cachedSatBounds2","tmpVec","dir1","dir2","tempDir","edge1","edge2","tempPoint","bounds1","Vector2","bounds2","coplanarIntersectsTriangle","self","other","target","suppressLog","planeNormal","normal","satBounds1","satAxes1","sb","sa","isSeparated","cross","satBounds2","satAxes2","crossVectors","console","warn","set","findSingleBounds","aProj","bProj","cProj","aDist","bDist","cDist","bounds","t","x","multiplyScalar","add","y","findIntersectionLineBounds","abDist","acDist","intersectTriangleSegment","triangle","degenerateTriangle","startDist","distanceToPoint","endDist","containsPoint","intersectLine","intersectTrianglePoint","point","intersectSegmentPoint","segmentTri","pointTri","ZERO_EPSILON","res","segment1","segment2","delta1","delta2","delta","startDelta","denom","u","z","addScaledVector","handleDegenerateCases","undefined","plane1","plane2","a1Dist","b1Dist","c1Dist","a1b1Dist","a1c1Dist","a2Dist","b2Dist","c2Dist","a2b2Dist","a2c2Dist","intersectionLine","componentIndex","maxComponent","comp1","key","a2Proj","b2Proj","c2Proj","tmp","distanceTo","distanceToTriangle","cornerFields","line1","line2","lineTarget","getCenter","dist","field","otherVec","thisVec","i2"],"mappings":"oRAIA,MAAMA,cAAgB,CAAE,IAAK,IAAK,KAGlC,SAASC,WAAYC,OAEpB,OAAOC,KAAKC,IAAKF,OAJG,KAMrB,CAEO,MAAMG,yBAAyBC,SAErC,WAAAC,IAAgBC,MAEfC,SAAUD,MAEVE,KAAKC,oBAAqB,EAC1BD,KAAKE,QAAU,IAAIC,MAAO,GAAIC,OAAOC,IAAK,IAAM,IAAIC,SACpDN,KAAKO,UAAY,IAAIJ,MAAO,GAAIC,OAAOC,IAAK,IAAM,IAAIG,sBACtDR,KAAKS,OAAS,CAAET,KAAKU,EAAGV,KAAKW,EAAGX,KAAKY,GACrCZ,KAAKa,MAAQ,IAAIC,MACjBd,KAAKe,yBAA0B,EAC/Bf,KAAKgB,uBAAwB,EAC7BhB,KAAKiB,kBAAoB,IAAIC,MAC7BlB,KAAKmB,aAAc,CAEpB,CAEA,gBAAAC,CAAkBC,QAEjB,OAAOC,wBAAyBD,OAAQrB,KAEzC,CAEA,MAAAuB,GAEC,MAAMb,EAAIV,KAAKU,EACTC,EAAIX,KAAKW,EACTC,EAAIZ,KAAKY,EACTH,OAAST,KAAKS,OAEdP,QAAUF,KAAKE,QACfK,UAAYP,KAAKO,UAEjBiB,MAAQtB,QAAS,GACjBuB,KAAOlB,UAAW,GACxBP,KAAK0B,UAAWF,OAChBC,KAAKE,cAAeH,MAAOf,QAE3B,MAAMmB,MAAQ1B,QAAS,GACjB2B,KAAOtB,UAAW,GACxBqB,MAAME,WAAYpB,EAAGC,GACrBkB,KAAKF,cAAeC,MAAOnB,QAE3B,MAAMsB,MAAQ7B,QAAS,GACjB8B,KAAOzB,UAAW,GACxBwB,MAAMD,WAAYnB,EAAGC,GACrBoB,KAAKL,cAAeI,MAAOtB,QAE3B,MAAMwB,MAAQ/B,QAAS,GACjBgC,KAAO3B,UAAW,GACxB0B,MAAMH,WAAYlB,EAAGF,GACrBwB,KAAKP,cAAeM,MAAOxB,QAE3B,MAAM0B,SAAWP,MAAMQ,SACjBC,SAAWN,MAAMK,SACjBE,SAAWL,MAAMG,SAEvBpC,KAAKgB,uBAAwB,EAC7BhB,KAAKe,yBAA0B,EAE1BoB,SArEc,MAuEbE,SAvEa,OAuEcC,SAvEd,MAyEjBtC,KAAKgB,uBAAwB,GAI7BhB,KAAKe,yBAA0B,EAC/Bf,KAAKiB,kBAAkBsB,MAAMC,KAAM9B,GACnCV,KAAKiB,kBAAkBwB,IAAID,KAAM5B,IAIvByB,SAnFO,MAqFbC,SArFa,MAuFjBtC,KAAKgB,uBAAwB,GAI7BhB,KAAKe,yBAA0B,EAC/Bf,KAAKiB,kBAAkBsB,MAAMC,KAAM7B,GACnCX,KAAKiB,kBAAkBwB,IAAID,KAAM9B,IAIvB4B,SAjGO,QAmGlBtC,KAAKe,yBAA0B,EAC/Bf,KAAKiB,kBAAkBsB,MAAMC,KAAM5B,GACnCZ,KAAKiB,kBAAkBwB,IAAID,KAAM7B,IAIlCX,KAAKa,MAAM6B,8BAA+BlB,MAAOd,GAEjDV,KAAKmB,aAAc,CAEpB,EAIDxB,iBAAiBgD,UAAUC,sBAAwB,WAElD,MAAMC,OAAyB,IAAIvC,QAC7BwC,OAAyB,IAAIxC,QAC7ByC,KAAuB,IAAI7B,MAEjC,OAAO,SAA4B8B,QAASC,QAAU,KAAMC,QAAU,MAErE,MAAMX,MAAEA,MAAKE,IAAEA,KAAQO,QACjBvC,OAAST,KAAKS,OACpB,IAAI0C,OACAC,kBAAoBC,IAGxB,IAAM,IAAIC,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAMC,OAAUD,EAAI,GAAM,EAC1BP,KAAKR,MAAMC,KAAM/B,OAAQ6C,IACzBP,KAAKN,IAAID,KAAM/B,OAAQ8C,QAEvBC,8BAA+BT,KAAMC,QAASH,OAAQC,QAEtDK,OAASN,OAAOY,kBAAmBX,QAC9BK,OAASC,oBAEbA,kBAAoBD,OACfF,SAAUA,QAAQT,KAAMK,QACxBK,SAAUA,QAAQV,KAAMM,QAI/B,CAuBA,OApBA9C,KAAK0D,oBAAqBnB,MAAOM,QACjCM,OAASZ,MAAMkB,kBAAmBZ,QAC7BM,OAASC,oBAEbA,kBAAoBD,OACfF,SAAUA,QAAQT,KAAMK,QACxBK,SAAUA,QAAQV,KAAMD,QAI9BvC,KAAK0D,oBAAqBjB,IAAKI,QAC/BM,OAASV,IAAIgB,kBAAmBZ,QAC3BM,OAASC,oBAEbA,kBAAoBD,OACfF,SAAUA,QAAQT,KAAMK,QACxBK,SAAUA,QAAQV,KAAMC,MAIvBhD,KAAKkE,KAAMP,kBAEnB,CAEA,CA1DkD,GA4DnDzD,iBAAiBgD,UAAUiB,mBAAqB,WAE/C,MAAMC,OAAyB,IAAIlE,iBAC7BmE,gBAAkC,IAAItD,qBACtCuD,iBAAmC,IAAIvD,qBACvCwD,OAAyB,IAAI1D,QAC7B2D,KAAuB,IAAI3D,QAC3B4D,KAAuB,IAAI5D,QAC3B6D,QAA0B,IAAI7D,QAC9B8D,MAAwB,IAAIlD,MAC5BmD,MAAwB,IAAInD,MAC5BoD,UAA4B,IAAIhE,QAChCiE,QAA0B,IAAIC,QAC9BC,QAA0B,IAAID,QAEpC,SAASE,2BAA4BC,KAAMC,MAAOC,OAAQC,aAKzD,MAAMC,YAAcf,OAOnBe,YAAYvC,KANNmC,KAAK3D,uBAA2B2D,KAAK5D,wBAMzB6D,MAAM/D,MAAMmE,OAJZL,KAAK9D,MAAMmE,QAQ9B,MAAMC,WAAaN,KAAKpE,UAClB2E,SAAWP,KAAKzE,QACtB,IAAM,IAAIoD,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAM6B,GAAKF,WAAY3B,GACjB8B,GAAKF,SAAU5B,GAErB,GADAQ,gBAAgBnC,cAAeyD,GAAIR,MAAMnE,QACpC0E,GAAGE,YAAavB,iBAAoB,OAAO,EAKhD,GAHAK,QAAQ3B,KAAMuC,aAAcO,MAAOF,IACnCtB,gBAAgBnC,cAAewC,QAASQ,KAAKlE,QAC7CsD,iBAAiBpC,cAAewC,QAASS,MAAMnE,QAC1CqD,gBAAgBuB,YAAatB,kBAAqB,OAAO,CAE/D,CAEA,MAAMwB,WAAaX,MAAMrE,UACnBiF,SAAWZ,MAAM1E,QACvB,IAAM,IAAIoD,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAM6B,GAAKI,WAAYjC,GACjB8B,GAAKI,SAAUlC,GAErB,GADAQ,gBAAgBnC,cAAeyD,GAAIT,KAAKlE,QACnC0E,GAAGE,YAAavB,iBAAoB,OAAO,EAKhD,GAHAK,QAAQsB,aAAcV,YAAaK,IACnCtB,gBAAgBnC,cAAewC,QAASQ,KAAKlE,QAC7CsD,iBAAiBpC,cAAewC,QAASS,MAAMnE,QAC1CqD,gBAAgBuB,YAAatB,kBAAqB,OAAO,CAE/D,CAgBA,OAdKc,SAGGC,aAENY,QAAQC,KAAM,+HAIfd,OAAOtC,MAAMqD,IAAK,EAAG,EAAG,GACxBf,OAAOpC,IAAImD,IAAK,EAAG,EAAG,KAIhB,CAER,CAEA,SAASC,iBAAkBnF,EAAGC,EAAGC,EAAGkF,MAAOC,MAAOC,MAAOC,MAAOC,MAAOC,MAAOC,OAAQrD,MAErF,IAAIsD,EAAIJ,OAAUA,MAAQC,OAC1BE,OAAOE,EAAIR,OAAUC,MAAQD,OAAUO,EACvCtD,KAAKR,MAAMT,WAAYnB,EAAGD,GAAI6F,eAAgBF,GAAIG,IAAK9F,GAEvD2F,EAAIJ,OAAUA,MAAQE,OACtBC,OAAOK,EAAIX,OAAUE,MAAQF,OAAUO,EACvCtD,KAAKN,IAAIX,WAAYlB,EAAGF,GAAI6F,eAAgBF,GAAIG,IAAK9F,EAEtD,CAQA,SAASgG,2BAA4B/B,KAAMmB,MAAOC,MAAOC,MAAOW,OAAQC,OAAQX,MAAOC,MAAOC,MAAOC,OAAQrD,MAE5G,GAAK4D,OAAS,EAGbd,iBAAkBlB,KAAK/D,EAAG+D,KAAKjE,EAAGiE,KAAKhE,EAAGqF,MAAOF,MAAOC,MAAOI,MAAOF,MAAOC,MAAOE,OAAQrD,WAEtF,GAAK6D,OAAS,EAEpBf,iBAAkBlB,KAAKhE,EAAGgE,KAAKjE,EAAGiE,KAAK/D,EAAGmF,MAAOD,MAAOE,MAAOE,MAAOD,MAAOE,MAAOC,OAAQrD,WAEtF,GAAKmD,MAAQC,MAAQ,GAAc,GAATF,MAEhCJ,iBAAkBlB,KAAKjE,EAAGiE,KAAKhE,EAAGgE,KAAK/D,EAAGkF,MAAOC,MAAOC,MAAOC,MAAOC,MAAOC,MAAOC,OAAQrD,WAEtF,GAAc,GAATmD,MAEXL,iBAAkBlB,KAAKhE,EAAGgE,KAAKjE,EAAGiE,KAAK/D,EAAGmF,MAAOD,MAAOE,MAAOE,MAAOD,MAAOE,MAAOC,OAAQrD,UAEtF,IAAc,GAAToD,MAMX,OAAO,EAJPN,iBAAkBlB,KAAK/D,EAAG+D,KAAKjE,EAAGiE,KAAKhE,EAAGqF,MAAOF,MAAOC,MAAOI,MAAOF,MAAOC,MAAOE,OAAQrD,KAM7F,CAEA,OAAO,CAER,CAEA,SAAS8D,yBAA0BC,SAAUC,mBAAoBlC,OAAQC,aAExE,MAAM9B,QAAU+D,mBAAmB9F,kBAC7B+F,UAAYF,SAASjG,MAAMoG,gBAAiBjE,QAAQT,OACpD2E,QAAUJ,SAASjG,MAAMoG,gBAAiBjE,QAAQP,KACxD,OAAKlD,WAAYyH,WAEXzH,WAAY2H,SAETxC,2BAA4BoC,SAAUC,mBAAoBlC,OAAQC,cAKpED,SAEJA,OAAOtC,MAAMC,KAAMQ,QAAQT,OAC3BsC,OAAOpC,IAAID,KAAMQ,QAAQT,QAInBuE,SAASK,cAAenE,QAAQT,QAI7BhD,WAAY2H,UAElBrC,SAEJA,OAAOtC,MAAMC,KAAMQ,QAAQP,KAC3BoC,OAAOpC,IAAID,KAAMQ,QAAQP,MAInBqE,SAASK,cAAenE,QAAQP,MAIiB,MAAnDqE,SAASjG,MAAMuG,cAAepE,QAASgB,UAEtCa,SAEJA,OAAOtC,MAAMC,KAAMwB,QACnBa,OAAOpC,IAAID,KAAMwB,SAIX8C,SAASK,cAAenD,QAUlC,CAEA,SAASqD,uBAAwBP,SAAUC,mBAAoBlC,QAE9D,MAAMyC,MAAQP,mBAAmBrG,EAEjC,SAAKnB,WAAYuH,SAASjG,MAAMoG,gBAAiBK,UAAaR,SAASK,cAAeG,SAEhFzC,SAEJA,OAAOtC,MAAMC,KAAM8E,OACnBzC,OAAOpC,IAAID,KAAM8E,QAIX,GAQT,CAEA,SAASC,sBAAuBC,WAAYC,SAAU5C,QAErD,MACMyC,MAAQG,SAAS/G,EAIvB,OALgB8G,WAAWvG,kBAGnByC,oBAAqB4D,OAAO,EAAMtD,QAErCsD,MAAM7D,kBAAmBO,QAzYP0D,QA2YjB7C,SAEJA,OAAOtC,MAAMC,KAAM8E,OACnBzC,OAAOpC,IAAID,KAAM8E,SAIX,EAQT,CAsHA,OAAO,SAA6B1C,MAAOC,OAAS,KAAMC,aAAc,GAElE9E,KAAKmB,aAETnB,KAAKuB,SAICqD,MAAM3E,mBAMD2E,MAAMzD,aAEjByD,MAAMrD,UANNsC,OAAOrB,KAAMoC,OACbf,OAAOtC,SACPqD,MAAQf,QAQT,MAAM8D,IAxIP,SAAgChD,KAAMC,MAAOC,OAAQC,aAEpD,GAAKH,KAAK5D,wBAA0B,CAEnC,GAAK6D,MAAM7D,wBAA0B,CAGpC,MAAM6G,SAAWjD,KAAK1D,kBAChB4G,SAAWjD,MAAM3D,kBACjB6G,OAAS7D,KACT8D,OAAS7D,KACf0D,SAASI,MAAOF,QAChBD,SAASG,MAAOD,QAChB,MAAME,WAAajE,OAAOlC,WAAY+F,SAAStF,MAAOqF,SAASrF,OAEzD2F,MAAQJ,OAAOxB,EAAIyB,OAAOtB,EAAIqB,OAAOrB,EAAIsB,OAAOzB,EACtD,GAAK/G,WAAY2I,OAEhB,OAAO,EAIR,MAAM7B,GAAM4B,WAAW3B,EAAIyB,OAAOtB,EAAIwB,WAAWxB,EAAIsB,OAAOzB,GAAM4B,MAC5DC,IAAQL,OAAOxB,EAAI2B,WAAWxB,EAAIqB,OAAOrB,EAAIwB,WAAW3B,GAAM4B,MAEpE,QAAK7B,EAAI,GAAKA,EAAI,GAAK8B,EAAI,GAAKA,EAAI,IAS/B5I,WAHMqI,SAASrF,MAAM6F,EAAIN,OAAOM,EAAI/B,GAC9BwB,SAAStF,MAAM6F,EAAIL,OAAOK,EAAID,MAInCtD,SAEJA,OAAOtC,MAAMC,KAAMoF,SAASrF,OAAQ8F,gBAAiBP,OAAQzB,GAC7DxB,OAAOpC,IAAID,KAAMoF,SAASrF,OAAQ8F,gBAAiBP,OAAQzB,IAIrD,GAQT,CAAO,OAAKzB,MAAM5D,sBAEVuG,sBAAuB5C,KAAMC,MAAOC,QAIpCgC,yBAA0BjC,MAAOD,KAAME,OAAQC,YAIxD,CAAO,OAAKH,KAAK3D,sBAEX4D,MAAM5D,sBAEL4D,MAAMlE,EAAE+C,kBAAmBkB,KAAKjE,GA7dhBgH,QA+df7C,SAEJA,OAAOtC,MAAMC,KAAMmC,KAAKjE,GACxBmE,OAAOpC,IAAID,KAAMmC,KAAKjE,KAIhB,GAQGkE,MAAM7D,wBAEVwG,sBAAuB3C,MAAOD,KAAME,QAIpCwC,uBAAwBzC,MAAOD,KAAME,QAMxCD,MAAM5D,sBAEHqG,uBAAwB1C,KAAMC,MAAOC,QAEjCD,MAAM7D,wBAEV8F,yBAA0BlC,KAAMC,MAAOC,OAAQC,kBAFhD,CAQT,CA8BawD,CAAuBtI,KAAM4E,MAAOC,OAAQC,aACxD,QAAayD,IAARZ,IAEJ,OAAOA,IAIR,MAAMa,OAASxI,KAAKa,MACd4H,OAAS7D,MAAM/D,MAErB,IAAI6H,OAASD,OAAOxB,gBAAiBjH,KAAKU,GACtCiI,OAASF,OAAOxB,gBAAiBjH,KAAKW,GACtCiI,OAASH,OAAOxB,gBAAiBjH,KAAKY,GAErCrB,WAAYmJ,UAChBA,OAAS,GAELnJ,WAAYoJ,UAChBA,OAAS,GAELpJ,WAAYqJ,UAChBA,OAAS,GAEV,MAAMC,SAAWH,OAASC,OACpBG,SAAWJ,OAASE,OAC1B,GAAKC,SAAW,GAAKC,SAAW,EAE/B,OAAO,EAIR,IAAIC,OAASP,OAAOvB,gBAAiBrC,MAAMlE,GACvCsI,OAASR,OAAOvB,gBAAiBrC,MAAMjE,GACvCsI,OAAST,OAAOvB,gBAAiBrC,MAAMhE,GAEtCrB,WAAYwJ,UAChBA,OAAS,GAELxJ,WAAYyJ,UAChBA,OAAS,GAELzJ,WAAY0J,UAChBA,OAAS,GAEV,MAAMC,SAAWH,OAASC,OACpBG,SAAWJ,OAASE,OAC1B,GAAKC,SAAW,GAAKC,SAAW,EAE/B,OAAO,EAIRlF,KAAKzB,KAAMgG,OAAOxD,QAClBd,KAAK1B,KAAMiG,OAAOzD,QAClB,MAAMoE,iBAAmBnF,KAAKqB,MAAOpB,MAErC,IAAImF,eAAiB,EACjBC,aAAe7J,KAAKC,IAAK0J,iBAAiB9C,GAC9C,MAAMiD,MAAQ9J,KAAKC,IAAK0J,iBAAiB3C,GACpC8C,MAAQD,eAEZA,aAAeC,MACfF,eAAiB,GAIJ5J,KAAKC,IAAK0J,iBAAiBhB,GAC5BkB,eAEZD,eAAiB,GAIlB,MAAMG,IAAMlK,cAAe+J,gBAKrBI,OAAS7E,MAAMlE,EAAG8I,KAClBE,OAAS9E,MAAMjE,EAAG6I,KAClBG,OAAS/E,MAAMhE,EAAG4I,KAExB,GAAK9C,2BAA4B1G,KARlBA,KAAKU,EAAG8I,KACRxJ,KAAKW,EAAG6I,KACRxJ,KAAKY,EAAG4I,KAMwCX,SAAUC,SAAUJ,OAAQC,OAAQC,OAAQrE,QAASH,OAEnH,OAAOM,2BAA4B1E,KAAM4E,MAAOC,OAAQC,aAIzD,GAAK4B,2BAA4B9B,MAAO6E,OAAQC,OAAQC,OAAQT,SAAUC,SAAUJ,OAAQC,OAAQC,OAAQxE,QAASJ,OAEpH,OAAOK,2BAA4B1E,KAAM4E,MAAOC,OAAQC,aAIzD,GAAKP,QAAQkC,EAAIlC,QAAQ+B,EAAI,CAE5B,MAAMsD,IAAMrF,QAAQkC,EACpBlC,QAAQkC,EAAIlC,QAAQ+B,EACpB/B,QAAQ+B,EAAIsD,IAEZtF,UAAU9B,KAAM4B,MAAM7B,OACtB6B,MAAM7B,MAAMC,KAAM4B,MAAM3B,KACxB2B,MAAM3B,IAAID,KAAM8B,UAEjB,CAEA,GAAKG,QAAQgC,EAAIhC,QAAQ6B,EAAI,CAE5B,MAAMsD,IAAMnF,QAAQgC,EACpBhC,QAAQgC,EAAIhC,QAAQ6B,EACpB7B,QAAQ6B,EAAIsD,IAEZtF,UAAU9B,KAAM6B,MAAM9B,OACtB8B,MAAM9B,MAAMC,KAAM6B,MAAM5B,KACxB4B,MAAM5B,IAAID,KAAM8B,UAEjB,CAEA,QAAKC,QAAQkC,EAAIhC,QAAQ6B,GAAK7B,QAAQgC,EAAIlC,QAAQ+B,IAM7CzB,SAIHA,OAAOtC,MAAMC,KAFTiC,QAAQ6B,EAAI/B,QAAQ+B,EAELjC,MAAM9B,MAIN6B,MAAM7B,OAMzBsC,OAAOpC,IAAID,KAFPiC,QAAQgC,EAAIlC,QAAQkC,EAEPpC,MAAM5B,IAIN2B,MAAM3B,MAMlB,GAER,CAEA,CAhhB+C,GAmhBhD9C,iBAAiBgD,UAAUsE,gBAAkB,WAE5C,MAAMpC,OAAyB,IAAIvE,QACnC,OAAO,SAA0BgH,OAGhC,OADAtH,KAAK0D,oBAAqB4D,MAAOzC,QAC1ByC,MAAMuC,WAAYhF,OAE1B,CAEA,CAV4C,GAa7ClF,iBAAiBgD,UAAUmH,mBAAqB,WAE/C,MAAMxC,MAAwB,IAAIhH,QAC5BwC,OAAyB,IAAIxC,QAC7ByJ,aAAe,CAAE,IAAK,IAAK,KAC3BC,MAAwB,IAAI9I,MAC5B+I,MAAwB,IAAI/I,MAElC,OAAO,SAA6B0D,MAAO3B,QAAU,KAAMC,QAAU,MAEpE,MAAMgH,WAAajH,SAAWC,QAAU8G,MAAQ,KAChD,GAAKhK,KAAK4D,mBAAoBgB,MAAOsF,YASpC,OAPKjH,SAAWC,WAEVD,SAAUiH,WAAWC,UAAWlH,SAChCC,SAAUgH,WAAWC,UAAWjH,UAI/B,EAIR,IAAIE,kBAAoBC,IAGxB,IAAM,IAAIC,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,IAAI8G,KACJ,MAAMC,MAAQN,aAAczG,GACtBgH,SAAW1F,MAAOyF,OACxBrK,KAAK0D,oBAAqB4G,SAAUhD,OAEpC8C,KAAOE,SAAS7G,kBAAmB6D,OAE9B8C,KAAOhH,oBAEXA,kBAAoBgH,KACfnH,SAAUA,QAAQT,KAAM8E,OACxBpE,SAAUA,QAAQV,KAAM8H,WAK9B,MAAMC,QAAUvK,KAAMqK,OACtBzF,MAAMlB,oBAAqB6G,QAASjD,OAEpC8C,KAAOG,QAAQ9G,kBAAmB6D,OAE7B8C,KAAOhH,oBAEXA,kBAAoBgH,KACfnH,SAAUA,QAAQT,KAAM+H,SACxBrH,SAAUA,QAAQV,KAAM8E,OAI/B,CAEA,IAAM,IAAIhE,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAI9B0G,MAAMpE,IAAK5F,KAFC+J,aAAczG,IAEFtD,KADZ+J,cAAgBzG,EAAI,GAAM,KAEtC,IAAM,IAAIkH,GAAK,EAAGA,GAAK,EAAGA,KAAQ,CAIjCP,MAAMrE,IAAKhB,MAFCmF,aAAcS,KAED5F,MADbmF,cAAgBS,GAAK,GAAM,KAGvChH,8BAA+BwG,MAAOC,MAAO3C,MAAOxE,QAEpD,MAAMsH,KAAO9C,MAAM7D,kBAAmBX,QACjCsH,KAAOhH,oBAEXA,kBAAoBgH,KACfnH,SAAUA,QAAQT,KAAM8E,OACxBpE,SAAUA,QAAQV,KAAMM,QAI/B,CAED,CAEA,OAAOrD,KAAKkE,KAAMP,kBAEnB,CAEA,CA1F+C","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/math/MathUtilities.js

@@ -0,0 +1,2 @@
+import"../../../three/build/three.module.js";import{Line3,Vector3,Plane,Vector2}from"../../../three/build/three.core.js";const closestPointLineToLine=function(){const dir1=new Vector3,dir2=new Vector3,v02=new Vector3;return function(l1,l2,result){const v10=dir1,v32=dir2;v02.subVectors(l1.start,l2.start),dir1.subVectors(l1.end,l1.start),dir2.subVectors(l2.end,l2.start);const d0232=v02.dot(v32),d3210=v32.dot(v10),d3232=v32.dot(v32),d0210=v02.dot(v10),denom=v10.dot(v10)*d3232-d3210*d3210;let d,d2;d=0!==denom?(d0232*d3210-d0210*d3232)/denom:0,d2=(d0232+d*d3210)/d3232,result.x=d,result.y=d2}}(),closestPointsSegmentToSegment=function(){const paramResult=new Vector2,temp1=new Vector3,temp2=new Vector3;return function(l1,l2,target1,target2){closestPointLineToLine(l1,l2,paramResult);let d=paramResult.x,d2=paramResult.y;if(d>=0&&d<=1&&d2>=0&&d2<=1)return l1.at(d,target1),void l2.at(d2,target2);if(d>=0&&d<=1)return l2.at(d2<0?0:1,target2),void l1.closestPointToPoint(target2,!0,target1);if(d2>=0&&d2<=1)return l1.at(d<0?0:1,target1),void l2.closestPointToPoint(target1,!0,target2);{let p,p2;p=d<0?l1.start:l1.end,p2=d2<0?l2.start:l2.end;const closestPoint=temp1,closestPoint2=temp2;return l1.closestPointToPoint(p2,!0,temp1),l2.closestPointToPoint(p,!0,temp2),closestPoint.distanceToSquared(p2)<=closestPoint2.distanceToSquared(p)?(target1.copy(closestPoint),void target2.copy(p2)):(target1.copy(p),void target2.copy(closestPoint2))}}}(),sphereIntersectTriangle=function(){const closestPointTemp=new Vector3,projectedPointTemp=new Vector3,planeTemp=new Plane,lineTemp=new Line3;return function(sphere,triangle){const{radius:radius,center:center}=sphere,{a:a,b:b,c:c}=triangle;if(lineTemp.start=a,lineTemp.end=b,lineTemp.closestPointToPoint(center,!0,closestPointTemp).distanceTo(center)<=radius)return!0;if(lineTemp.start=a,lineTemp.end=c,lineTemp.closestPointToPoint(center,!0,closestPointTemp).distanceTo(center)<=radius)return!0;if(lineTemp.start=b,lineTemp.end=c,lineTemp.closestPointToPoint(center,!0,closestPointTemp).distanceTo(center)<=radius)return!0;const plane=triangle.getPlane(planeTemp);if(Math.abs(plane.distanceToPoint(center))<=radius){const pp=plane.projectPoint(center,projectedPointTemp);if(triangle.containsPoint(pp))return!0}return!1}}();export{closestPointLineToLine,closestPointsSegmentToSegment,sphereIntersectTriangle};
+//# sourceMappingURL=MathUtilities.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/math/MathUtilities.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MathUtilities.js","sources":["../../../../../../../../../../../../node_modules/three-mesh-bvh/src/math/MathUtilities.js"],"sourcesContent":["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 = d1010*d3232 - d3210*d3210;\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"],"names":["closestPointLineToLine","dir1","Vector3","dir2","v02","l1","l2","result","v10","v32","subVectors","start","end","d0232","dot","d3210","d3232","d0210","denom","d","d2","x","y","closestPointsSegmentToSegment","paramResult","Vector2","temp1","temp2","target1","target2","at","closestPointToPoint","p","p2","closestPoint","closestPoint2","distanceToSquared","copy","sphereIntersectTriangle","closestPointTemp","projectedPointTemp","planeTemp","Plane","lineTemp","Line3","sphere","triangle","radius","center","a","b","c","distanceTo","plane","getPlane","Math","abs","distanceToPoint","pp","projectPoint","containsPoint"],"mappings":"yHAEY,MAACA,uBAAyB,WAGrC,MAAMC,KAAuB,IAAIC,QAC3BC,KAAuB,IAAID,QAC3BE,IAAsB,IAAIF,QAChC,OAAO,SAAiCG,GAAIC,GAAIC,QAE/C,MACMC,IAAMP,KAENQ,IAAMN,KAEZC,IAAIM,WALOL,GAAGM,MAEHL,GAAGK,OAIdV,KAAKS,WAAYL,GAAGO,IAAKP,GAAGM,OAC5BR,KAAKO,WAAYJ,GAAGM,IAAKN,GAAGK,OAG5B,MAAME,MAAQT,IAAIU,IAAKL,KAGjBM,MAAQN,IAAIK,IAAKN,KAGjBQ,MAAQP,IAAIK,IAAKL,KAGjBQ,MAAQb,IAAIU,IAAKN,KAMjBU,MAHQV,IAAIM,IAAKN,KAGDQ,MAAQD,MAAQA,MAEtC,IAAII,EAAGC,GAGND,EAFc,IAAVD,OAEEL,MAAQE,MAAQE,MAAQD,OAAUE,MAIpC,EAILE,IAAOP,MAAQM,EAAIJ,OAAUC,MAE7BT,OAAOc,EAAIF,EACXZ,OAAOe,EAAIF,EAEZ,CAEA,CArDqC,GAuDzBG,8BAAgC,WAG5C,MAAMC,YAA8B,IAAIC,QAClCC,MAAwB,IAAIxB,QAC5ByB,MAAwB,IAAIzB,QAClC,OAAO,SAAwCG,GAAIC,GAAIsB,QAASC,SAE/D7B,uBAAwBK,GAAIC,GAAIkB,aAEhC,IAAIL,EAAIK,YAAYH,EAChBD,GAAKI,YAAYF,EACrB,GAAKH,GAAK,GAAKA,GAAK,GAAKC,IAAM,GAAKA,IAAM,EAKzC,OAHAf,GAAGyB,GAAIX,EAAGS,cACVtB,GAAGwB,GAAIV,GAAIS,SAIL,GAAKV,GAAK,GAAKA,GAAK,EAc1B,OATCb,GAAGwB,GAFCV,GAAK,EAEF,EAIA,EAJGS,cAQXxB,GAAG0B,oBAAqBF,SAAS,EAAMD,SAGjC,GAAKR,IAAM,GAAKA,IAAM,EAc5B,OATCf,GAAGyB,GAFCX,EAAI,EAED,EAIA,EAJGS,cAQXtB,GAAGyB,oBAAqBH,SAAS,EAAMC,SAGjC,CAGN,IAAIG,EAWAC,GARHD,EAFIb,EAAI,EAEJd,GAAGM,MAIHN,GAAGO,IAOPqB,GAFIb,GAAK,EAEJd,GAAGK,MAIHL,GAAGM,IAIT,MAAMsB,aAAeR,MACfS,cAAgBR,MAItB,OAHAtB,GAAG0B,oBAAqBE,IAAI,EAAMP,OAClCpB,GAAGyB,oBAAqBC,GAAG,EAAML,OAE5BO,aAAaE,kBAAmBH,KAAQE,cAAcC,kBAAmBJ,IAE7EJ,QAAQS,KAAMH,mBACdL,QAAQQ,KAAMJ,MAKdL,QAAQS,KAAML,QACdH,QAAQQ,KAAMF,eAKhB,CAED,CAEA,CAnG4C,GAsGhCG,wBAA0B,WAGtC,MAAMC,iBAAmC,IAAIrC,QACvCsC,mBAAqC,IAAItC,QACzCuC,UAA4B,IAAIC,MAChCC,SAA2B,IAAIC,MACrC,OAAO,SAAkCC,OAAQC,UAEhD,MAAMC,OAAEA,OAAMC,OAAEA,QAAWH,QACrBI,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAML,SAMpB,GAHAH,SAAShC,MAAQsC,EACjBN,SAAS/B,IAAMsC,EACOP,SAASZ,oBAAqBiB,QAAQ,EAAMT,kBAC/Ca,WAAYJ,SAAYD,OAAS,OAAO,EAK3D,GAHAJ,SAAShC,MAAQsC,EACjBN,SAAS/B,IAAMuC,EACOR,SAASZ,oBAAqBiB,QAAQ,EAAMT,kBAC/Ca,WAAYJ,SAAYD,OAAS,OAAO,EAK3D,GAHAJ,SAAShC,MAAQuC,EACjBP,SAAS/B,IAAMuC,EACOR,SAASZ,oBAAqBiB,QAAQ,EAAMT,kBAC/Ca,WAAYJ,SAAYD,OAAS,OAAO,EAG3D,MAAMM,MAAQP,SAASQ,SAAUb,WAEjC,GADWc,KAAKC,IAAKH,MAAMI,gBAAiBT,UACjCD,OAAS,CAEnB,MAAMW,GAAKL,MAAMM,aAAcX,OAAQR,oBAEvC,GADWM,SAASc,cAAeF,IACzB,OAAO,CAElB,CAEA,OAAO,CAER,CAEA,CA3CsC","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/math/OrientedBox.js

@@ -0,0 +1,2 @@
+import"../../../three/build/three.module.js";import{SeparatingAxisBounds}from"./SeparatingAxisBounds.js";import{ExtendedTriangle}from"./ExtendedTriangle.js";import{closestPointsSegmentToSegment}from"./MathUtilities.js";import{Vector3,Matrix4,Line3}from"../../../three/build/three.core.js";class OrientedBox{constructor(min,max,matrix){this.isOrientedBox=!0,this.min=new Vector3,this.max=new Vector3,this.matrix=new Matrix4,this.invMatrix=new Matrix4,this.points=new Array(8).fill().map(()=>new Vector3),this.satAxes=new Array(3).fill().map(()=>new Vector3),this.satBounds=new Array(3).fill().map(()=>new SeparatingAxisBounds),this.alignedSatBounds=new Array(3).fill().map(()=>new SeparatingAxisBounds),this.needsUpdate=!1,min&&this.min.copy(min),max&&this.max.copy(max),matrix&&this.matrix.copy(matrix)}set(min,max,matrix){this.min.copy(min),this.max.copy(max),this.matrix.copy(matrix),this.needsUpdate=!0}copy(other){this.min.copy(other.min),this.max.copy(other.max),this.matrix.copy(other.matrix),this.needsUpdate=!0}}OrientedBox.prototype.update=function(){const matrix=this.matrix,min=this.min,max=this.max,points=this.points;for(let x=0;x<=1;x++)for(let y=0;y<=1;y++)for(let z=0;z<=1;z++){const v=points[1*x|2*y|4*z];v.x=x?max.x:min.x,v.y=y?max.y:min.y,v.z=z?max.z:min.z,v.applyMatrix4(matrix)}const satBounds=this.satBounds,satAxes=this.satAxes,minVec=points[0];for(let i=0;i<3;i++){const axis=satAxes[i],sb=satBounds[i];axis.subVectors(minVec,points[1<<i]),sb.setFromPoints(axis,points)}const alignedSatBounds=this.alignedSatBounds;alignedSatBounds[0].setFromPointsField(points,"x"),alignedSatBounds[1].setFromPointsField(points,"y"),alignedSatBounds[2].setFromPointsField(points,"z"),this.invMatrix.copy(this.matrix).invert(),this.needsUpdate=!1},OrientedBox.prototype.intersectsBox=function(){const aabbBounds=new SeparatingAxisBounds;return function(box){this.needsUpdate&&this.update();const min=box.min,max=box.max,satBounds=this.satBounds,satAxes=this.satAxes,alignedSatBounds=this.alignedSatBounds;if(aabbBounds.min=min.x,aabbBounds.max=max.x,alignedSatBounds[0].isSeparated(aabbBounds))return!1;if(aabbBounds.min=min.y,aabbBounds.max=max.y,alignedSatBounds[1].isSeparated(aabbBounds))return!1;if(aabbBounds.min=min.z,aabbBounds.max=max.z,alignedSatBounds[2].isSeparated(aabbBounds))return!1;for(let i=0;i<3;i++){const sb=satBounds[i];if(aabbBounds.setFromBox(satAxes[i],box),sb.isSeparated(aabbBounds))return!1}return!0}}(),OrientedBox.prototype.intersectsTriangle=function(){const saTri=new ExtendedTriangle,pointsArr=new Array(3),cachedSatBounds=new SeparatingAxisBounds,cachedSatBounds2=new SeparatingAxisBounds,cachedAxis=new Vector3;return function(triangle){this.needsUpdate&&this.update(),triangle.isExtendedTriangle?triangle.needsUpdate&&triangle.update():(saTri.copy(triangle),saTri.update(),triangle=saTri);const satBounds=this.satBounds,satAxes=this.satAxes;pointsArr[0]=triangle.a,pointsArr[1]=triangle.b,pointsArr[2]=triangle.c;for(let i=0;i<3;i++){const sb=satBounds[i];if(cachedSatBounds.setFromPoints(satAxes[i],pointsArr),sb.isSeparated(cachedSatBounds))return!1}const triSatBounds=triangle.satBounds,triSatAxes=triangle.satAxes,points=this.points;for(let i=0;i<3;i++){const sb=triSatBounds[i];if(cachedSatBounds.setFromPoints(triSatAxes[i],points),sb.isSeparated(cachedSatBounds))return!1}for(let i=0;i<3;i++){const sa1=satAxes[i];for(let i2=0;i2<4;i2++)if(cachedAxis.crossVectors(sa1,triSatAxes[i2]),cachedSatBounds.setFromPoints(cachedAxis,pointsArr),cachedSatBounds2.setFromPoints(cachedAxis,points),cachedSatBounds.isSeparated(cachedSatBounds2))return!1}return!0}}(),OrientedBox.prototype.closestPointToPoint=function(point,target1){return this.needsUpdate&&this.update(),target1.copy(point).applyMatrix4(this.invMatrix).clamp(this.min,this.max).applyMatrix4(this.matrix),target1},OrientedBox.prototype.distanceToPoint=function(){const target=new Vector3;return function(point){return this.closestPointToPoint(point,target),point.distanceTo(target)}}(),OrientedBox.prototype.distanceToBox=function(){const xyzFields=["x","y","z"],segments1=new Array(12).fill().map(()=>new Line3),segments2=new Array(12).fill().map(()=>new Line3),point1=new Vector3,point2=new Vector3;return function(box,threshold=0,target1=null,target2=null){if(this.needsUpdate&&this.update(),this.intersectsBox(box))return(target1||target2)&&(box.getCenter(point2),this.closestPointToPoint(point2,point1),box.closestPointToPoint(point1,point2),target1&&target1.copy(point1),target2&&target2.copy(point2)),0;const threshold2=threshold*threshold,min=box.min,max=box.max,points=this.points;let closestDistanceSq=1/0;for(let i=0;i<8;i++){const p=points[i];point2.copy(p).clamp(min,max);const dist=p.distanceToSquared(point2);if(dist<closestDistanceSq&&(closestDistanceSq=dist,target1&&target1.copy(p),target2&&target2.copy(point2),dist<threshold2))return Math.sqrt(dist)}let count=0;for(let i=0;i<3;i++)for(let i1=0;i1<=1;i1++)for(let i2=0;i2<=1;i2++){const nextIndex=(i+1)%3,nextIndex2=(i+2)%3;segments1[count].set(points[i1<<nextIndex|i2<<nextIndex2],points[1<<i|i1<<nextIndex|i2<<nextIndex2]);const f1=xyzFields[i],f2=xyzFields[nextIndex],f3=xyzFields[nextIndex2],line2=segments2[count],start=line2.start,end=line2.end;start[f1]=min[f1],start[f2]=i1?min[f2]:max[f2],start[f3]=i2?min[f3]:max[f2],end[f1]=max[f1],end[f2]=i1?min[f2]:max[f2],end[f3]=i2?min[f3]:max[f2],count++}for(let x=0;x<=1;x++)for(let y=0;y<=1;y++)for(let z=0;z<=1;z++){point2.x=x?max.x:min.x,point2.y=y?max.y:min.y,point2.z=z?max.z:min.z,this.closestPointToPoint(point2,point1);const dist=point2.distanceToSquared(point1);if(dist<closestDistanceSq&&(closestDistanceSq=dist,target1&&target1.copy(point1),target2&&target2.copy(point2),dist<threshold2))return Math.sqrt(dist)}for(let i=0;i<12;i++){const l1=segments1[i];for(let i2=0;i2<12;i2++){closestPointsSegmentToSegment(l1,segments2[i2],point1,point2);const dist=point1.distanceToSquared(point2);if(dist<closestDistanceSq&&(closestDistanceSq=dist,target1&&target1.copy(point1),target2&&target2.copy(point2),dist<threshold2))return Math.sqrt(dist)}}return Math.sqrt(closestDistanceSq)}}();export{OrientedBox};
+//# sourceMappingURL=OrientedBox.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/math/OrientedBox.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrientedBox.js","sources":["../../../../../../../../../../../../node_modules/three-mesh-bvh/src/math/OrientedBox.js"],"sourcesContent":["import { Vector3, Matrix4, Line3 } from 'three';\nimport { SeparatingAxisBounds } from './SeparatingAxisBounds.js';\nimport { ExtendedTriangle } from './ExtendedTriangle.js';\nimport { closestPointsSegmentToSegment } from './MathUtilities.js';\n\nexport class OrientedBox {\n\n\tconstructor( min, max, matrix ) {\n\n\t\tthis.isOrientedBox = true;\n\t\tthis.min = new Vector3();\n\t\tthis.max = new Vector3();\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\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\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\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\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\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\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\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"],"names":["OrientedBox","constructor","min","max","matrix","this","isOrientedBox","Vector3","Matrix4","invMatrix","points","Array","fill","map","satAxes","satBounds","SeparatingAxisBounds","alignedSatBounds","needsUpdate","copy","set","other","prototype","update","x","y","z","v","applyMatrix4","minVec","i","axis","sb","subVectors","setFromPoints","setFromPointsField","invert","intersectsBox","aabbBounds","box","isSeparated","setFromBox","intersectsTriangle","saTri","ExtendedTriangle","pointsArr","cachedSatBounds","cachedSatBounds2","cachedAxis","triangle","isExtendedTriangle","a","b","c","triSatBounds","triSatAxes","sa1","i2","crossVectors","closestPointToPoint","point","target1","clamp","distanceToPoint","target","distanceTo","distanceToBox","xyzFields","segments1","Line3","segments2","point1","point2","threshold","target2","getCenter","threshold2","closestDistanceSq","Infinity","p","dist","distanceToSquared","Math","sqrt","count","i1","nextIndex","nextIndex2","f1","f2","f3","line2","start","end","l1","closestPointsSegmentToSegment"],"mappings":"iSAKO,MAAMA,YAEZ,WAAAC,CAAaC,IAAKC,IAAKC,QAEtBC,KAAKC,eAAgB,EACrBD,KAAKH,IAAM,IAAIK,QACfF,KAAKF,IAAM,IAAII,QACfF,KAAKD,OAAS,IAAII,QAClBH,KAAKI,UAAY,IAAID,QACrBH,KAAKK,OAAS,IAAIC,MAAO,GAAIC,OAAOC,IAAK,IAAM,IAAIN,SACnDF,KAAKS,QAAU,IAAIH,MAAO,GAAIC,OAAOC,IAAK,IAAM,IAAIN,SACpDF,KAAKU,UAAY,IAAIJ,MAAO,GAAIC,OAAOC,IAAK,IAAM,IAAIG,sBACtDX,KAAKY,iBAAmB,IAAIN,MAAO,GAAIC,OAAOC,IAAK,IAAM,IAAIG,sBAC7DX,KAAKa,aAAc,EAEdhB,KAAMG,KAAKH,IAAIiB,KAAMjB,KACrBC,KAAME,KAAKF,IAAIgB,KAAMhB,KACrBC,QAASC,KAAKD,OAAOe,KAAMf,OAEjC,CAEA,GAAAgB,CAAKlB,IAAKC,IAAKC,QAEdC,KAAKH,IAAIiB,KAAMjB,KACfG,KAAKF,IAAIgB,KAAMhB,KACfE,KAAKD,OAAOe,KAAMf,QAClBC,KAAKa,aAAc,CAEpB,CAEA,IAAAC,CAAME,OAELhB,KAAKH,IAAIiB,KAAME,MAAMnB,KACrBG,KAAKF,IAAIgB,KAAME,MAAMlB,KACrBE,KAAKD,OAAOe,KAAME,MAAMjB,QACxBC,KAAKa,aAAc,CAEpB,EAIDlB,YAAYsB,UAAUC,OAEd,WAEN,MAAMnB,OAASC,KAAKD,OACdF,IAAMG,KAAKH,IACXC,IAAME,KAAKF,IAEXO,OAASL,KAAKK,OACpB,IAAM,IAAIc,EAAI,EAAGA,GAAK,EAAGA,IAExB,IAAM,IAAIC,EAAI,EAAGA,GAAK,EAAGA,IAExB,IAAM,IAAIC,EAAI,EAAGA,GAAK,EAAGA,IAAO,CAE/B,MACMC,EAAIjB,OADI,EAAWc,EAAQ,EAAaC,EAAQ,EAAaC,GAEnEC,EAAEH,EAAIA,EAAIrB,IAAIqB,EAAItB,IAAIsB,EACtBG,EAAEF,EAAIA,EAAItB,IAAIsB,EAAIvB,IAAIuB,EACtBE,EAAED,EAAIA,EAAIvB,IAAIuB,EAAIxB,IAAIwB,EAEtBC,EAAEC,aAAcxB,OAEjB,CAMF,MAAMW,UAAYV,KAAKU,UACjBD,QAAUT,KAAKS,QACfe,OAASnB,OAAQ,GACvB,IAAM,IAAIoB,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAMC,KAAOjB,QAASgB,GAChBE,GAAKjB,UAAWe,GAItBC,KAAKE,WAAYJ,OAFNnB,OADG,GAAKoB,IAInBE,GAAGE,cAAeH,KAAMrB,OAEzB,CAEA,MAAMO,iBAAmBZ,KAAKY,iBAC9BA,iBAAkB,GAAIkB,mBAAoBzB,OAAQ,KAClDO,iBAAkB,GAAIkB,mBAAoBzB,OAAQ,KAClDO,iBAAkB,GAAIkB,mBAAoBzB,OAAQ,KAElDL,KAAKI,UAAUU,KAAMd,KAAKD,QAASgC,SACnC/B,KAAKa,aAAc,CAEpB,EAIDlB,YAAYsB,UAAUe,cAAgB,WAErC,MAAMC,WAA6B,IAAItB,qBACvC,OAAO,SAAwBuB,KAGzBlC,KAAKa,aAETb,KAAKkB,SAIN,MAAMrB,IAAMqC,IAAIrC,IACVC,IAAMoC,IAAIpC,IACVY,UAAYV,KAAKU,UACjBD,QAAUT,KAAKS,QACfG,iBAAmBZ,KAAKY,iBAI9B,GAFAqB,WAAWpC,IAAMA,IAAIsB,EACrBc,WAAWnC,IAAMA,IAAIqB,EAChBP,iBAAkB,GAAIuB,YAAaF,YAAe,OAAO,EAI9D,GAFAA,WAAWpC,IAAMA,IAAIuB,EACrBa,WAAWnC,IAAMA,IAAIsB,EAChBR,iBAAkB,GAAIuB,YAAaF,YAAe,OAAO,EAI9D,GAFAA,WAAWpC,IAAMA,IAAIwB,EACrBY,WAAWnC,IAAMA,IAAIuB,EAChBT,iBAAkB,GAAIuB,YAAaF,YAAe,OAAO,EAE9D,IAAM,IAAIR,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MACME,GAAKjB,UAAWe,GAEtB,GADAQ,WAAWG,WAFE3B,QAASgB,GAEOS,KACxBP,GAAGQ,YAAaF,YAAe,OAAO,CAE5C,CAEA,OAAO,CAER,CAEA,CA3CqC,GA6CtCtC,YAAYsB,UAAUoB,mBAAqB,WAE1C,MAAMC,MAAwB,IAAIC,iBAC5BC,UAA4B,IAAIlC,MAAO,GACvCmC,gBAAkC,IAAI9B,qBACtC+B,iBAAmC,IAAI/B,qBACvCgC,WAA6B,IAAIzC,QACvC,OAAO,SAA6B0C,UAE9B5C,KAAKa,aAETb,KAAKkB,SAIC0B,SAASC,mBAMJD,SAAS/B,aAEpB+B,SAAS1B,UANToB,MAAMxB,KAAM8B,UACZN,MAAMpB,SACN0B,SAAWN,OAQZ,MAAM5B,UAAYV,KAAKU,UACjBD,QAAUT,KAAKS,QAErB+B,UAAW,GAAMI,SAASE,EAC1BN,UAAW,GAAMI,SAASG,EAC1BP,UAAW,GAAMI,SAASI,EAE1B,IAAM,IAAIvB,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAME,GAAKjB,UAAWe,GAGtB,GADAgB,gBAAgBZ,cADLpB,QAASgB,GACee,WAC9Bb,GAAGQ,YAAaM,iBAAoB,OAAO,CAEjD,CAEA,MAAMQ,aAAeL,SAASlC,UACxBwC,WAAaN,SAASnC,QACtBJ,OAASL,KAAKK,OACpB,IAAM,IAAIoB,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAME,GAAKsB,aAAcxB,GAGzB,GADAgB,gBAAgBZ,cADLqB,WAAYzB,GACYpB,QAC9BsB,GAAGQ,YAAaM,iBAAoB,OAAO,CAEjD,CAGA,IAAM,IAAIhB,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAM0B,IAAM1C,QAASgB,GACrB,IAAM,IAAI2B,GAAK,EAAGA,GAAK,EAAGA,KAMzB,GAHAT,WAAWU,aAAcF,IADbD,WAAYE,KAExBX,gBAAgBZ,cAAec,WAAYH,WAC3CE,iBAAiBb,cAAec,WAAYtC,QACvCoC,gBAAgBN,YAAaO,kBAAqB,OAAO,CAIhE,CAEA,OAAO,CAER,CAEA,CA3E0C,GA6E3C/C,YAAYsB,UAAUqC,oBAEd,SAA8BC,MAAOC,SAc3C,OAZKxD,KAAKa,aAETb,KAAKkB,SAINsC,QACE1C,KAAMyC,OACNhC,aAAcvB,KAAKI,WACnBqD,MAAOzD,KAAKH,IAAKG,KAAKF,KACtByB,aAAcvB,KAAKD,QAEdyD,OAER,EAID7D,YAAYsB,UAAUyC,gBAAkB,WAEvC,MAAMC,OAAS,IAAIzD,QACnB,OAAO,SAA0BqD,OAGhC,OADAvD,KAAKsD,oBAAqBC,MAAOI,QAC1BJ,MAAMK,WAAYD,OAE1B,CAEA,CAVuC,GAYxChE,YAAYsB,UAAU4C,cAAgB,WAErC,MAAMC,UAAY,CAAE,IAAK,IAAK,KACxBC,UAA4B,IAAIzD,MAAO,IAAKC,OAAOC,IAAK,IAAM,IAAIwD,OAClEC,UAA4B,IAAI3D,MAAO,IAAKC,OAAOC,IAAK,IAAM,IAAIwD,OAElEE,OAAyB,IAAIhE,QAC7BiE,OAAyB,IAAIjE,QAGnC,OAAO,SAAwBgC,IAAKkC,UAAY,EAAGZ,QAAU,KAAMa,QAAU,MAQ5E,GANKrE,KAAKa,aAETb,KAAKkB,SAIDlB,KAAKgC,cAAeE,KAaxB,OAXKsB,SAAWa,WAEfnC,IAAIoC,UAAWH,QACfnE,KAAKsD,oBAAqBa,OAAQD,QAClChC,IAAIoB,oBAAqBY,OAAQC,QAE5BX,SAAUA,QAAQ1C,KAAMoD,QACxBG,SAAUA,QAAQvD,KAAMqD,SAIvB,EAIR,MAAMI,WAAaH,UAAYA,UACzBvE,IAAMqC,IAAIrC,IACVC,IAAMoC,IAAIpC,IACVO,OAASL,KAAKK,OAIpB,IAAImE,kBAAoBC,IAGxB,IAAM,IAAIhD,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAMiD,EAAIrE,OAAQoB,GAClB0C,OAAOrD,KAAM4D,GAAIjB,MAAO5D,IAAKC,KAE7B,MAAM6E,KAAOD,EAAEE,kBAAmBT,QAClC,GAAKQ,KAAOH,oBAEXA,kBAAoBG,KACfnB,SAAUA,QAAQ1C,KAAM4D,GACxBL,SAAUA,QAAQvD,KAAMqD,QAExBQ,KAAOJ,YAAa,OAAOM,KAAKC,KAAMH,KAI7C,CAGA,IAAII,MAAQ,EACZ,IAAM,IAAItD,EAAI,EAAGA,EAAI,EAAGA,IAEvB,IAAM,IAAIuD,GAAK,EAAGA,IAAM,EAAGA,KAE1B,IAAM,IAAI5B,GAAK,EAAGA,IAAM,EAAGA,KAAQ,CAElC,MAAM6B,WAAcxD,EAAI,GAAM,EACxByD,YAAezD,EAAI,GAAM,EAOjBsC,UAAWgB,OACnBhE,IAHKV,OAFG2E,IAAMC,UAAY7B,IAAM8B,YAG3B7E,OAFI,GAAKoB,EAAIuD,IAAMC,UAAY7B,IAAM8B,aAQhD,MAAMC,GAAKrB,UAAWrC,GAChB2D,GAAKtB,UAAWmB,WAChBI,GAAKvB,UAAWoB,YAChBI,MAAQrB,UAAWc,OACnBQ,MAAQD,MAAMC,MACdC,IAAMF,MAAME,IAElBD,MAAOJ,IAAOtF,IAAKsF,IACnBI,MAAOH,IAAOJ,GAAKnF,IAAKuF,IAAOtF,IAAKsF,IACpCG,MAAOF,IAAOjC,GAAKvD,IAAKwF,IAAOvF,IAAKsF,IAEpCI,IAAKL,IAAOrF,IAAKqF,IACjBK,IAAKJ,IAAOJ,GAAKnF,IAAKuF,IAAOtF,IAAKsF,IAClCI,IAAKH,IAAOjC,GAAKvD,IAAKwF,IAAOvF,IAAKsF,IAElCL,OAED,CAOF,IAAM,IAAI5D,EAAI,EAAGA,GAAK,EAAGA,IAExB,IAAM,IAAIC,EAAI,EAAGA,GAAK,EAAGA,IAExB,IAAM,IAAIC,EAAI,EAAGA,GAAK,EAAGA,IAAO,CAE/B8C,OAAOhD,EAAIA,EAAIrB,IAAIqB,EAAItB,IAAIsB,EAC3BgD,OAAO/C,EAAIA,EAAItB,IAAIsB,EAAIvB,IAAIuB,EAC3B+C,OAAO9C,EAAIA,EAAIvB,IAAIuB,EAAIxB,IAAIwB,EAE3BrB,KAAKsD,oBAAqBa,OAAQD,QAClC,MAAMS,KAAOR,OAAOS,kBAAmBV,QACvC,GAAKS,KAAOH,oBAEXA,kBAAoBG,KACfnB,SAAUA,QAAQ1C,KAAMoD,QACxBG,SAAUA,QAAQvD,KAAMqD,QAExBQ,KAAOJ,YAAa,OAAOM,KAAKC,KAAMH,KAI7C,CAMF,IAAM,IAAIlD,EAAI,EAAGA,EAAI,GAAIA,IAAO,CAE/B,MAAMgE,GAAK1B,UAAWtC,GACtB,IAAM,IAAI2B,GAAK,EAAGA,GAAK,GAAIA,KAAQ,CAGlCsC,8BAA+BD,GADpBxB,UAAWb,IACiBc,OAAQC,QAC/C,MAAMQ,KAAOT,OAAOU,kBAAmBT,QACvC,GAAKQ,KAAOH,oBAEXA,kBAAoBG,KACfnB,SAAUA,QAAQ1C,KAAMoD,QACxBG,SAAUA,QAAQvD,KAAMqD,QAExBQ,KAAOJ,YAAa,OAAOM,KAAKC,KAAMH,KAI7C,CAED,CAEA,OAAOE,KAAKC,KAAMN,kBAEnB,CAEA,CAlKqC","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/math/SeparatingAxisBounds.js

@@ -0,0 +1,2 @@
+import"../../../three/build/three.module.js";import{Vector3}from"../../../three/build/three.core.js";class SeparatingAxisBounds{constructor(){this.min=1/0,this.max=-1/0}setFromPointsField(points,field){let min=1/0,max=-1/0;for(let i=0,l=points.length;i<l;i++){const val=points[i][field];min=val<min?val:min,max=val>max?val:max}this.min=min,this.max=max}setFromPoints(axis,points){let min=1/0,max=-1/0;for(let i=0,l=points.length;i<l;i++){const val=axis.dot(points[i]);min=val<min?val:min,max=val>max?val:max}this.min=min,this.max=max}isSeparated(other){return this.min>other.max||other.min>this.max}}SeparatingAxisBounds.prototype.setFromBox=function(){const p=new Vector3;return function(axis,box){const boxMin=box.min,boxMax=box.max;let min=1/0,max=-1/0;for(let x=0;x<=1;x++)for(let y=0;y<=1;y++)for(let z=0;z<=1;z++){p.x=boxMin.x*x+boxMax.x*(1-x),p.y=boxMin.y*y+boxMax.y*(1-y),p.z=boxMin.z*z+boxMax.z*(1-z);const val=axis.dot(p);min=Math.min(val,min),max=Math.max(val,max)}this.min=min,this.max=max}}();export{SeparatingAxisBounds};
+//# sourceMappingURL=SeparatingAxisBounds.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/math/SeparatingAxisBounds.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SeparatingAxisBounds.js","sources":["../../../../../../../../../../../../node_modules/three-mesh-bvh/src/math/SeparatingAxisBounds.js"],"sourcesContent":["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"],"names":["SeparatingAxisBounds","constructor","this","min","Infinity","max","setFromPointsField","points","field","i","l","length","val","setFromPoints","axis","dot","isSeparated","other","prototype","setFromBox","p","Vector3","box","boxMin","boxMax","x","y","z","Math"],"mappings":"qGAEO,MAAMA,qBAEZ,WAAAC,GAECC,KAAKC,IAAMC,IACXF,KAAKG,KAAM,GAEZ,CAEA,kBAAAC,CAAoBC,OAAQC,OAE3B,IAAIL,IAAMC,IACNC,KAAM,IACV,IAAM,IAAII,EAAI,EAAGC,EAAIH,OAAOI,OAAQF,EAAIC,EAAGD,IAAO,CAEjD,MACMG,IADIL,OAAQE,GACHD,OACfL,IAAMS,IAAMT,IAAMS,IAAMT,IACxBE,IAAMO,IAAMP,IAAMO,IAAMP,GAEzB,CAEAH,KAAKC,IAAMA,IACXD,KAAKG,IAAMA,GAEZ,CAEA,aAAAQ,CAAeC,KAAMP,QAEpB,IAAIJ,IAAMC,IACNC,KAAM,IACV,IAAM,IAAII,EAAI,EAAGC,EAAIH,OAAOI,OAAQF,EAAIC,EAAGD,IAAO,CAEjD,MACMG,IAAME,KAAKC,IADPR,OAAQE,IAElBN,IAAMS,IAAMT,IAAMS,IAAMT,IACxBE,IAAMO,IAAMP,IAAMO,IAAMP,GAEzB,CAEAH,KAAKC,IAAMA,IACXD,KAAKG,IAAMA,GAEZ,CAEA,WAAAW,CAAaC,OAEZ,OAAOf,KAAKC,IAAMc,MAAMZ,KAAOY,MAAMd,IAAMD,KAAKG,GAEjD,EAIDL,qBAAqBkB,UAAUC,WAAa,WAE3C,MAAMC,EAAoB,IAAIC,QAC9B,OAAO,SAAqBP,KAAMQ,KAEjC,MAAMC,OAASD,IAAInB,IACbqB,OAASF,IAAIjB,IACnB,IAAIF,IAAMC,IACNC,KAAM,IACV,IAAM,IAAIoB,EAAI,EAAGA,GAAK,EAAGA,IAExB,IAAM,IAAIC,EAAI,EAAGA,GAAK,EAAGA,IAExB,IAAM,IAAIC,EAAI,EAAGA,GAAK,EAAGA,IAAO,CAE/BP,EAAEK,EAAIF,OAAOE,EAAIA,EAAID,OAAOC,GAAM,EAAIA,GACtCL,EAAEM,EAAIH,OAAOG,EAAIA,EAAIF,OAAOE,GAAM,EAAIA,GACtCN,EAAEO,EAAIJ,OAAOI,EAAIA,EAAIH,OAAOG,GAAM,EAAIA,GAEtC,MAAMf,IAAME,KAAKC,IAAKK,GACtBjB,IAAMyB,KAAKzB,IAAKS,IAAKT,KACrBE,IAAMuB,KAAKvB,IAAKO,IAAKP,IAEtB,CAMFH,KAAKC,IAAMA,IACXD,KAAKG,IAAMA,GAEZ,CAEA,CAlC2C","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/objects/MeshBVHHelper.js

@@ -0,0 +1,2 @@
+import"../../../three/build/three.module.js";import{arrayToBox}from"../utils/ArrayBoxUtilities.js";import{MeshBVH}from"../core/MeshBVH.js";import{Group,LineBasicMaterial,MeshBasicMaterial,Matrix4,Object3D,Mesh,BufferGeometry,Box3,BufferAttribute}from"../../../three/build/three.core.js";const boundingBox=new Box3,matrix=new Matrix4;class MeshBVHRootHelper extends Object3D{get isMesh(){return!this.displayEdges}get isLineSegments(){return this.displayEdges}get isLine(){return this.displayEdges}getVertexPosition(...args){return Mesh.prototype.getVertexPosition.call(this,...args)}constructor(bvh,material,depth=10,group=0){super(),this.material=material,this.geometry=new BufferGeometry,this.name="MeshBVHRootHelper",this.depth=depth,this.displayParents=!1,this.bvh=bvh,this.displayEdges=!0,this._group=group}raycast(){}update(){const geometry=this.geometry,boundsTree=this.bvh,group=this._group;if(geometry.dispose(),this.visible=!1,boundsTree){const targetDepth=this.depth-1,displayParents=this.displayParents;let boundsCount=0;boundsTree.traverse((depth,isLeaf)=>{if(depth>=targetDepth||isLeaf)return boundsCount++,!0;displayParents&&boundsCount++},group);let posIndex=0;const positionArray=new Float32Array(24*boundsCount);let indexArray,indices;boundsTree.traverse((depth,isLeaf,boundingData)=>{const terminate=depth>=targetDepth||isLeaf;if(terminate||displayParents){arrayToBox(0,boundingData,boundingBox);const{min:min,max:max}=boundingBox;for(let x=-1;x<=1;x+=2){const xVal=x<0?min.x:max.x;for(let y=-1;y<=1;y+=2){const yVal=y<0?min.y:max.y;for(let z=-1;z<=1;z+=2){const zVal=z<0?min.z:max.z;positionArray[posIndex+0]=xVal,positionArray[posIndex+1]=yVal,positionArray[posIndex+2]=zVal,posIndex+=3}}}return terminate}},group),indices=this.displayEdges?new Uint8Array([0,4,1,5,2,6,3,7,0,2,1,3,4,6,5,7,0,1,2,3,4,5,6,7]):new Uint8Array([0,1,2,2,1,3,4,6,5,6,7,5,1,4,5,0,4,1,2,3,6,3,7,6,0,2,4,2,6,4,1,5,3,3,5,7]),indexArray=positionArray.length>65535?new Uint32Array(indices.length*boundsCount):new Uint16Array(indices.length*boundsCount);const indexLength=indices.length;for(let i=0;i<boundsCount;i++){const posOffset=8*i,indexOffset=i*indexLength;for(let j=0;j<indexLength;j++)indexArray[indexOffset+j]=posOffset+indices[j]}geometry.setIndex(new BufferAttribute(indexArray,1,!1)),geometry.setAttribute("position",new BufferAttribute(positionArray,3,!1)),this.visible=!0}}}class MeshBVHHelper extends Group{get color(){return this.edgeMaterial.color}get opacity(){return this.edgeMaterial.opacity}set opacity(v){this.edgeMaterial.opacity=v,this.meshMaterial.opacity=v}constructor(mesh=null,bvh=null,depth=10){mesh instanceof MeshBVH&&(depth=bvh||10,bvh=mesh,mesh=null),"number"==typeof bvh&&(depth=bvh,bvh=null),super(),this.name="MeshBVHHelper",this.depth=depth,this.mesh=mesh,this.bvh=bvh,this.displayParents=!1,this.displayEdges=!0,this.objectIndex=0,this._roots=[];const edgeMaterial=new LineBasicMaterial({color:65416,transparent:!0,opacity:.3,depthWrite:!1}),meshMaterial=new MeshBasicMaterial({color:65416,transparent:!0,opacity:.3,depthWrite:!1});meshMaterial.color=edgeMaterial.color,this.edgeMaterial=edgeMaterial,this.meshMaterial=meshMaterial,this.update()}update(){const mesh=this.mesh;let bvh=this.bvh||mesh.geometry.boundsTree||null;if(mesh&&mesh.isBatchedMesh&&mesh.boundsTrees&&!bvh){const drawInfo=mesh._drawInfo[this.objectIndex];drawInfo&&(bvh=mesh.boundsTrees[drawInfo.geometryIndex]||bvh)}const totalRoots=bvh?bvh._roots.length:0;for(;this._roots.length>totalRoots;){const root=this._roots.pop();root.geometry.dispose(),this.remove(root)}for(let i=0;i<totalRoots;i++){const{depth:depth,edgeMaterial:edgeMaterial,meshMaterial:meshMaterial,displayParents:displayParents,displayEdges:displayEdges}=this;if(i>=this._roots.length){const root=new MeshBVHRootHelper(bvh,edgeMaterial,depth,i);this.add(root),this._roots.push(root)}const root=this._roots[i];root.bvh=bvh,root.depth=depth,root.displayParents=displayParents,root.displayEdges=displayEdges,root.material=displayEdges?edgeMaterial:meshMaterial,root.update()}}updateMatrixWorld(...args){const mesh=this.mesh,parent=this.parent;null!==mesh&&(mesh.updateWorldMatrix(!0,!1),parent?this.matrix.copy(parent.matrixWorld).invert().multiply(mesh.matrixWorld):this.matrix.copy(mesh.matrixWorld),(mesh.isInstancedMesh||mesh.isBatchedMesh)&&(mesh.getMatrixAt(this.objectIndex,matrix),this.matrix.multiply(matrix)),this.matrix.decompose(this.position,this.quaternion,this.scale)),super.updateMatrixWorld(...args)}copy(source){this.depth=source.depth,this.mesh=source.mesh,this.bvh=source.bvh,this.opacity=source.opacity,this.color.copy(source.color)}clone(){return new MeshBVHHelper(this.mesh,this.bvh,this.depth)}dispose(){this.edgeMaterial.dispose(),this.meshMaterial.dispose();const children=this.children;for(let i=0,l=children.length;i<l;i++)children[i].geometry.dispose()}}export{MeshBVHHelper};
+//# sourceMappingURL=MeshBVHHelper.js.map

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/objects/MeshBVHHelper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MeshBVHHelper.js","sources":["../../../../../../../../../../../../node_modules/three-mesh-bvh/src/objects/MeshBVHHelper.js"],"sourcesContent":["import { LineBasicMaterial, BufferAttribute, Box3, Group, MeshBasicMaterial, Object3D, BufferGeometry, Mesh, Matrix4 } from 'three';\nimport { arrayToBox } from '../utils/ArrayBoxUtilities.js';\nimport { MeshBVH } from '../core/MeshBVH.js';\n\nconst boundingBox = /* @__PURE__ */ new Box3();\nconst matrix = /* @__PURE__ */ new Matrix4();\n\nclass MeshBVHRootHelper extends Object3D {\n\n\tget isMesh() {\n\n\t\treturn ! this.displayEdges;\n\n\t}\n\n\tget isLineSegments() {\n\n\t\treturn this.displayEdges;\n\n\t}\n\n\tget isLine() {\n\n\t\treturn this.displayEdges;\n\n\t}\n\n\tgetVertexPosition( ...args ) {\n\n\t\t// implement this function so it works with Box3.setFromObject\n\t\treturn Mesh.prototype.getVertexPosition.call( this, ...args );\n\n\t}\n\n\tconstructor( bvh, material, depth = 10, group = 0 ) {\n\n\t\tsuper();\n\n\t\tthis.material = material;\n\t\tthis.geometry = new BufferGeometry();\n\t\tthis.name = 'MeshBVHRootHelper';\n\t\tthis.depth = depth;\n\t\tthis.displayParents = false;\n\t\tthis.bvh = bvh;\n\t\tthis.displayEdges = true;\n\t\tthis._group = group;\n\n\t}\n\n\traycast() {}\n\n\tupdate() {\n\n\t\tconst geometry = this.geometry;\n\t\tconst boundsTree = this.bvh;\n\t\tconst group = this._group;\n\t\tgeometry.dispose();\n\t\tthis.visible = false;\n\t\tif ( boundsTree ) {\n\n\t\t\t// count the number of bounds required\n\t\t\tconst targetDepth = this.depth - 1;\n\t\t\tconst displayParents = this.displayParents;\n\t\t\tlet boundsCount = 0;\n\t\t\tboundsTree.traverse( ( depth, isLeaf ) => {\n\n\t\t\t\tif ( depth >= targetDepth || isLeaf ) {\n\n\t\t\t\t\tboundsCount ++;\n\t\t\t\t\treturn true;\n\n\t\t\t\t} else if ( displayParents ) {\n\n\t\t\t\t\tboundsCount ++;\n\n\t\t\t\t}\n\n\t\t\t}, group );\n\n\t\t\t// fill in the position buffer with the bounds corners\n\t\t\tlet posIndex = 0;\n\t\t\tconst positionArray = new Float32Array( 8 * 3 * boundsCount );\n\t\t\tboundsTree.traverse( ( depth, isLeaf, boundingData ) => {\n\n\t\t\t\tconst terminate = depth >= targetDepth || isLeaf;\n\t\t\t\tif ( terminate || displayParents ) {\n\n\t\t\t\t\tarrayToBox( 0, boundingData, boundingBox );\n\n\t\t\t\t\tconst { min, max } = boundingBox;\n\t\t\t\t\tfor ( let x = - 1; x <= 1; x += 2 ) {\n\n\t\t\t\t\t\tconst xVal = x < 0 ? min.x : max.x;\n\t\t\t\t\t\tfor ( let y = - 1; y <= 1; y += 2 ) {\n\n\t\t\t\t\t\t\tconst yVal = y < 0 ? min.y : max.y;\n\t\t\t\t\t\t\tfor ( let z = - 1; z <= 1; z += 2 ) {\n\n\t\t\t\t\t\t\t\tconst zVal = z < 0 ? min.z : max.z;\n\t\t\t\t\t\t\t\tpositionArray[ posIndex + 0 ] = xVal;\n\t\t\t\t\t\t\t\tpositionArray[ posIndex + 1 ] = yVal;\n\t\t\t\t\t\t\t\tpositionArray[ posIndex + 2 ] = zVal;\n\n\t\t\t\t\t\t\t\tposIndex += 3;\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\treturn terminate;\n\n\t\t\t\t}\n\n\t\t\t}, group );\n\n\t\t\tlet indexArray;\n\t\t\tlet indices;\n\t\t\tif ( this.displayEdges ) {\n\n\t\t\t\t// fill in the index buffer to point to the corner points\n\t\t\t\tindices = new Uint8Array( [\n\t\t\t\t\t// x axis\n\t\t\t\t\t0, 4,\n\t\t\t\t\t1, 5,\n\t\t\t\t\t2, 6,\n\t\t\t\t\t3, 7,\n\n\t\t\t\t\t// y axis\n\t\t\t\t\t0, 2,\n\t\t\t\t\t1, 3,\n\t\t\t\t\t4, 6,\n\t\t\t\t\t5, 7,\n\n\t\t\t\t\t// z axis\n\t\t\t\t\t0, 1,\n\t\t\t\t\t2, 3,\n\t\t\t\t\t4, 5,\n\t\t\t\t\t6, 7,\n\t\t\t\t] );\n\n\t\t\t} else {\n\n\t\t\t\tindices = new Uint8Array( [\n\n\t\t\t\t\t// X-, X+\n\t\t\t\t\t0, 1, 2,\n\t\t\t\t\t2, 1, 3,\n\n\t\t\t\t\t4, 6, 5,\n\t\t\t\t\t6, 7, 5,\n\n\t\t\t\t\t// Y-, Y+\n\t\t\t\t\t1, 4, 5,\n\t\t\t\t\t0, 4, 1,\n\n\t\t\t\t\t2, 3, 6,\n\t\t\t\t\t3, 7, 6,\n\n\t\t\t\t\t// Z-, Z+\n\t\t\t\t\t0, 2, 4,\n\t\t\t\t\t2, 6, 4,\n\n\t\t\t\t\t1, 5, 3,\n\t\t\t\t\t3, 5, 7,\n\n\t\t\t\t] );\n\n\t\t\t}\n\n\t\t\tif ( positionArray.length > 65535 ) {\n\n\t\t\t\tindexArray = new Uint32Array( indices.length * boundsCount );\n\n\t\t\t} else {\n\n\t\t\t\tindexArray = new Uint16Array( indices.length * boundsCount );\n\n\t\t\t}\n\n\t\t\tconst indexLength = indices.length;\n\t\t\tfor ( let i = 0; i < boundsCount; i ++ ) {\n\n\t\t\t\tconst posOffset = i * 8;\n\t\t\t\tconst indexOffset = i * indexLength;\n\t\t\t\tfor ( let j = 0; j < indexLength; j ++ ) {\n\n\t\t\t\t\tindexArray[ indexOffset + j ] = posOffset + indices[ j ];\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\t// update the geometry\n\t\t\tgeometry.setIndex(\n\t\t\t\tnew BufferAttribute( indexArray, 1, false ),\n\t\t\t);\n\t\t\tgeometry.setAttribute(\n\t\t\t\t'position',\n\t\t\t\tnew BufferAttribute( positionArray, 3, false ),\n\t\t\t);\n\t\t\tthis.visible = true;\n\n\t\t}\n\n\t}\n\n}\n\nclass MeshBVHHelper extends Group {\n\n\tget color() {\n\n\t\treturn this.edgeMaterial.color;\n\n\t}\n\n\tget opacity() {\n\n\t\treturn this.edgeMaterial.opacity;\n\n\t}\n\n\tset opacity( v ) {\n\n\t\tthis.edgeMaterial.opacity = v;\n\t\tthis.meshMaterial.opacity = v;\n\n\t}\n\n\tconstructor( mesh = null, bvh = null, depth = 10 ) {\n\n\t\t// handle bvh, depth signature\n\t\tif ( mesh instanceof MeshBVH ) {\n\n\t\t\tdepth = bvh || 10;\n\t\t\tbvh = mesh;\n\t\t\tmesh = null;\n\n\t\t}\n\n\t\t// handle mesh, depth signature\n\t\tif ( typeof bvh === 'number' ) {\n\n\t\t\tdepth = bvh;\n\t\t\tbvh = null;\n\n\t\t}\n\n\t\tsuper();\n\n\t\tthis.name = 'MeshBVHHelper';\n\t\tthis.depth = depth;\n\t\tthis.mesh = mesh;\n\t\tthis.bvh = bvh;\n\t\tthis.displayParents = false;\n\t\tthis.displayEdges = true;\n\t\tthis.objectIndex = 0;\n\t\tthis._roots = [];\n\n\t\tconst edgeMaterial = new LineBasicMaterial( {\n\t\t\tcolor: 0x00FF88,\n\t\t\ttransparent: true,\n\t\t\topacity: 0.3,\n\t\t\tdepthWrite: false,\n\t\t} );\n\n\t\tconst meshMaterial = new MeshBasicMaterial( {\n\t\t\tcolor: 0x00FF88,\n\t\t\ttransparent: true,\n\t\t\topacity: 0.3,\n\t\t\tdepthWrite: false,\n\t\t} );\n\n\t\tmeshMaterial.color = edgeMaterial.color;\n\n\t\tthis.edgeMaterial = edgeMaterial;\n\t\tthis.meshMaterial = meshMaterial;\n\n\t\tthis.update();\n\n\t}\n\n\tupdate() {\n\n\t\tconst mesh = this.mesh;\n\t\tlet bvh = this.bvh || mesh.geometry.boundsTree || null;\n\t\tif ( mesh && mesh.isBatchedMesh && mesh.boundsTrees && ! bvh ) {\n\n\t\t\t// get the bvh from a batchedMesh if not provided\n\t\t\t// TODO: we should have an official way to get the geometry index cleanly\n\t\t\tconst drawInfo = mesh._drawInfo[ this.objectIndex ];\n\t\t\tif ( drawInfo ) {\n\n\t\t\t\tbvh = mesh.boundsTrees[ drawInfo.geometryIndex ] || bvh;\n\n\t\t\t}\n\n\t\t}\n\n\t\tconst totalRoots = bvh ? bvh._roots.length : 0;\n\t\twhile ( this._roots.length > totalRoots ) {\n\n\t\t\tconst root = this._roots.pop();\n\t\t\troot.geometry.dispose();\n\t\t\tthis.remove( root );\n\n\t\t}\n\n\t\tfor ( let i = 0; i < totalRoots; i ++ ) {\n\n\t\t\tconst { depth, edgeMaterial, meshMaterial, displayParents, displayEdges } = this;\n\n\t\t\tif ( i >= this._roots.length ) {\n\n\t\t\t\tconst root = new MeshBVHRootHelper( bvh, edgeMaterial, depth, i );\n\t\t\t\tthis.add( root );\n\t\t\t\tthis._roots.push( root );\n\n\t\t\t}\n\n\t\t\tconst root = this._roots[ i ];\n\t\t\troot.bvh = bvh;\n\t\t\troot.depth = depth;\n\t\t\troot.displayParents = displayParents;\n\t\t\troot.displayEdges = displayEdges;\n\t\t\troot.material = displayEdges ? edgeMaterial : meshMaterial;\n\t\t\troot.update();\n\n\t\t}\n\n\t}\n\n\tupdateMatrixWorld( ...args ) {\n\n\t\tconst mesh = this.mesh;\n\t\tconst parent = this.parent;\n\n\t\tif ( mesh !== null ) {\n\n\t\t\tmesh.updateWorldMatrix( true, false );\n\n\t\t\tif ( parent ) {\n\n\t\t\t\tthis.matrix\n\t\t\t\t\t.copy( parent.matrixWorld )\n\t\t\t\t\t.invert()\n\t\t\t\t\t.multiply( mesh.matrixWorld );\n\n\t\t\t} else {\n\n\t\t\t\tthis.matrix\n\t\t\t\t\t.copy( mesh.matrixWorld );\n\n\t\t\t}\n\n\t\t\t// handle batched and instanced mesh bvhs\n\t\t\tif ( mesh.isInstancedMesh || mesh.isBatchedMesh ) {\n\n\t\t\t\tmesh.getMatrixAt( this.objectIndex, matrix );\n\t\t\t\tthis.matrix.multiply( matrix );\n\n\t\t\t}\n\n\t\t\tthis.matrix.decompose(\n\t\t\t\tthis.position,\n\t\t\t\tthis.quaternion,\n\t\t\t\tthis.scale,\n\t\t\t);\n\n\t\t}\n\n\t\tsuper.updateMatrixWorld( ...args );\n\n\t}\n\n\tcopy( source ) {\n\n\t\tthis.depth = source.depth;\n\t\tthis.mesh = source.mesh;\n\t\tthis.bvh = source.bvh;\n\t\tthis.opacity = source.opacity;\n\t\tthis.color.copy( source.color );\n\n\t}\n\n\tclone() {\n\n\t\treturn new MeshBVHHelper( this.mesh, this.bvh, this.depth );\n\n\t}\n\n\tdispose() {\n\n\t\tthis.edgeMaterial.dispose();\n\t\tthis.meshMaterial.dispose();\n\n\t\tconst children = this.children;\n\t\tfor ( let i = 0, l = children.length; i < l; i ++ ) {\n\n\t\t\tchildren[ i ].geometry.dispose();\n\n\t\t}\n\n\t}\n\n}\n\nexport class MeshBVHVisualizer extends MeshBVHHelper {\n\n\tconstructor( ...args ) {\n\n\t\tsuper( ...args );\n\n\t\tconsole.warn( 'MeshBVHVisualizer: MeshBVHVisualizer has been deprecated. Use MeshBVHHelper, instead.' );\n\n\t}\n\n}\n\nexport { MeshBVHHelper };\n"],"names":["boundingBox","Box3","matrix","Matrix4","MeshBVHRootHelper","Object3D","isMesh","this","displayEdges","isLineSegments","isLine","getVertexPosition","args","Mesh","prototype","call","constructor","bvh","material","depth","group","super","geometry","BufferGeometry","name","displayParents","_group","raycast","update","boundsTree","dispose","visible","targetDepth","boundsCount","traverse","isLeaf","posIndex","positionArray","Float32Array","indexArray","indices","boundingData","terminate","arrayToBox","min","max","x","xVal","y","yVal","z","zVal","Uint8Array","length","Uint32Array","Uint16Array","indexLength","i","posOffset","indexOffset","j","setIndex","BufferAttribute","setAttribute","MeshBVHHelper","Group","color","edgeMaterial","opacity","v","meshMaterial","mesh","MeshBVH","objectIndex","_roots","LineBasicMaterial","transparent","depthWrite","MeshBasicMaterial","isBatchedMesh","boundsTrees","drawInfo","_drawInfo","geometryIndex","totalRoots","root","pop","remove","add","push","updateMatrixWorld","parent","updateWorldMatrix","copy","matrixWorld","invert","multiply","isInstancedMesh","getMatrixAt","decompose","position","quaternion","scale","source","clone","children","l"],"mappings":"+RAIA,MAAMA,YAA8B,IAAIC,KAClCC,OAAyB,IAAIC,QAEnC,MAAMC,0BAA0BC,SAE/B,UAAIC,GAEH,OAASC,KAAKC,YAEf,CAEA,kBAAIC,GAEH,OAAOF,KAAKC,YAEb,CAEA,UAAIE,GAEH,OAAOH,KAAKC,YAEb,CAEA,iBAAAG,IAAsBC,MAGrB,OAAOC,KAAKC,UAAUH,kBAAkBI,KAAMR,QAASK,KAExD,CAEA,WAAAI,CAAaC,IAAKC,SAAUC,MAAQ,GAAIC,MAAQ,GAE/CC,QAEAd,KAAKW,SAAWA,SAChBX,KAAKe,SAAW,IAAIC,eACpBhB,KAAKiB,KAAO,oBACZjB,KAAKY,MAAQA,MACbZ,KAAKkB,gBAAiB,EACtBlB,KAAKU,IAAMA,IACXV,KAAKC,cAAe,EACpBD,KAAKmB,OAASN,KAEf,CAEA,OAAAO,GAAW,CAEX,MAAAC,GAEC,MAAMN,SAAWf,KAAKe,SAChBO,WAAatB,KAAKU,IAClBG,MAAQb,KAAKmB,OAGnB,GAFAJ,SAASQ,UACTvB,KAAKwB,SAAU,EACVF,WAAa,CAGjB,MAAMG,YAAczB,KAAKY,MAAQ,EAC3BM,eAAiBlB,KAAKkB,eAC5B,IAAIQ,YAAc,EAClBJ,WAAWK,SAAU,CAAEf,MAAOgB,UAE7B,GAAKhB,OAASa,aAAeG,OAG5B,OADAF,eACO,EAEIR,gBAEXQ,eAICb,OAGH,IAAIgB,SAAW,EACf,MAAMC,cAAgB,IAAIC,aAAc,GAAQL,aAoChD,IAAIM,WACAC,QApCJX,WAAWK,SAAU,CAAEf,MAAOgB,OAAQM,gBAErC,MAAMC,UAAYvB,OAASa,aAAeG,OAC1C,GAAKO,WAAajB,eAAiB,CAElCkB,WAAY,EAAGF,aAAczC,aAE7B,MAAM4C,IAAEA,IAAGC,IAAEA,KAAQ7C,YACrB,IAAM,IAAI8C,GAAI,EAAKA,GAAK,EAAGA,GAAK,EAAI,CAEnC,MAAMC,KAAOD,EAAI,EAAIF,IAAIE,EAAID,IAAIC,EACjC,IAAM,IAAIE,GAAI,EAAKA,GAAK,EAAGA,GAAK,EAAI,CAEnC,MAAMC,KAAOD,EAAI,EAAIJ,IAAII,EAAIH,IAAIG,EACjC,IAAM,IAAIE,GAAI,EAAKA,GAAK,EAAGA,GAAK,EAAI,CAEnC,MAAMC,KAAOD,EAAI,EAAIN,IAAIM,EAAIL,IAAIK,EACjCb,cAAeD,SAAW,GAAMW,KAChCV,cAAeD,SAAW,GAAMa,KAChCZ,cAAeD,SAAW,GAAMe,KAEhCf,UAAY,CAEb,CAED,CAED,CAEA,OAAOM,SAER,GAEEtB,OAOFoB,QAHIjC,KAAKC,aAGC,IAAI4C,WAAY,CAEzB,EAAG,EACH,EAAG,EACH,EAAG,EACH,EAAG,EAGH,EAAG,EACH,EAAG,EACH,EAAG,EACH,EAAG,EAGH,EAAG,EACH,EAAG,EACH,EAAG,EACH,EAAG,IAKM,IAAIA,WAAY,CAGzB,EAAG,EAAG,EACN,EAAG,EAAG,EAEN,EAAG,EAAG,EACN,EAAG,EAAG,EAGN,EAAG,EAAG,EACN,EAAG,EAAG,EAEN,EAAG,EAAG,EACN,EAAG,EAAG,EAGN,EAAG,EAAG,EACN,EAAG,EAAG,EAEN,EAAG,EAAG,EACN,EAAG,EAAG,IAQPb,WAFIF,cAAcgB,OAAS,MAEd,IAAIC,YAAad,QAAQa,OAASpB,aAIlC,IAAIsB,YAAaf,QAAQa,OAASpB,aAIhD,MAAMuB,YAAchB,QAAQa,OAC5B,IAAM,IAAII,EAAI,EAAGA,EAAIxB,YAAawB,IAAO,CAExC,MAAMC,UAAgB,EAAJD,EACZE,YAAcF,EAAID,YACxB,IAAM,IAAII,EAAI,EAAGA,EAAIJ,YAAaI,IAEjCrB,WAAYoB,YAAcC,GAAMF,UAAYlB,QAASoB,EAIvD,CAGAtC,SAASuC,SACR,IAAIC,gBAAiBvB,WAAY,GAAG,IAErCjB,SAASyC,aACR,WACA,IAAID,gBAAiBzB,cAAe,GAAG,IAExC9B,KAAKwB,SAAU,CAEhB,CAED,EAID,MAAMiC,sBAAsBC,MAE3B,SAAIC,GAEH,OAAO3D,KAAK4D,aAAaD,KAE1B,CAEA,WAAIE,GAEH,OAAO7D,KAAK4D,aAAaC,OAE1B,CAEA,WAAIA,CAASC,GAEZ9D,KAAK4D,aAAaC,QAAUC,EAC5B9D,KAAK+D,aAAaF,QAAUC,CAE7B,CAEA,WAAArD,CAAauD,KAAO,KAAMtD,IAAM,KAAME,MAAQ,IAGxCoD,gBAAgBC,UAEpBrD,MAAQF,KAAO,GACfA,IAAMsD,KACNA,KAAO,MAKY,iBAARtD,MAEXE,MAAQF,IACRA,IAAM,MAIPI,QAEAd,KAAKiB,KAAO,gBACZjB,KAAKY,MAAQA,MACbZ,KAAKgE,KAAOA,KACZhE,KAAKU,IAAMA,IACXV,KAAKkB,gBAAiB,EACtBlB,KAAKC,cAAe,EACpBD,KAAKkE,YAAc,EACnBlE,KAAKmE,OAAS,GAEd,MAAMP,aAAe,IAAIQ,kBAAmB,CAC3CT,MAAO,MACPU,aAAa,EACbR,QAAS,GACTS,YAAY,IAGPP,aAAe,IAAIQ,kBAAmB,CAC3CZ,MAAO,MACPU,aAAa,EACbR,QAAS,GACTS,YAAY,IAGbP,aAAaJ,MAAQC,aAAaD,MAElC3D,KAAK4D,aAAeA,aACpB5D,KAAK+D,aAAeA,aAEpB/D,KAAKqB,QAEN,CAEA,MAAAA,GAEC,MAAM2C,KAAOhE,KAAKgE,KAClB,IAAItD,IAAMV,KAAKU,KAAOsD,KAAKjD,SAASO,YAAc,KAClD,GAAK0C,MAAQA,KAAKQ,eAAiBR,KAAKS,cAAiB/D,IAAM,CAI9D,MAAMgE,SAAWV,KAAKW,UAAW3E,KAAKkE,aACjCQ,WAEJhE,IAAMsD,KAAKS,YAAaC,SAASE,gBAAmBlE,IAItD,CAEA,MAAMmE,WAAanE,IAAMA,IAAIyD,OAAOrB,OAAS,EAC7C,KAAQ9C,KAAKmE,OAAOrB,OAAS+B,YAAa,CAEzC,MAAMC,KAAO9E,KAAKmE,OAAOY,MACzBD,KAAK/D,SAASQ,UACdvB,KAAKgF,OAAQF,KAEd,CAEA,IAAM,IAAI5B,EAAI,EAAGA,EAAI2B,WAAY3B,IAAO,CAEvC,MAAMtC,MAAEA,MAAKgD,aAAEA,aAAYG,aAAEA,aAAY7C,eAAEA,eAAcjB,aAAEA,cAAiBD,KAE5E,GAAKkD,GAAKlD,KAAKmE,OAAOrB,OAAS,CAE9B,MAAMgC,KAAO,IAAIjF,kBAAmBa,IAAKkD,aAAchD,MAAOsC,GAC9DlD,KAAKiF,IAAKH,MACV9E,KAAKmE,OAAOe,KAAMJ,KAEnB,CAEA,MAAMA,KAAO9E,KAAKmE,OAAQjB,GAC1B4B,KAAKpE,IAAMA,IACXoE,KAAKlE,MAAQA,MACbkE,KAAK5D,eAAiBA,eACtB4D,KAAK7E,aAAeA,aACpB6E,KAAKnE,SAAWV,aAAe2D,aAAeG,aAC9Ce,KAAKzD,QAEN,CAED,CAEA,iBAAA8D,IAAsB9E,MAErB,MAAM2D,KAAOhE,KAAKgE,KACZoB,OAASpF,KAAKoF,OAEN,OAATpB,OAEJA,KAAKqB,mBAAmB,GAAM,GAEzBD,OAEJpF,KAAKL,OACH2F,KAAMF,OAAOG,aACbC,SACAC,SAAUzB,KAAKuB,aAIjBvF,KAAKL,OACH2F,KAAMtB,KAAKuB,cAKTvB,KAAK0B,iBAAmB1B,KAAKQ,iBAEjCR,KAAK2B,YAAa3F,KAAKkE,YAAavE,QACpCK,KAAKL,OAAO8F,SAAU9F,SAIvBK,KAAKL,OAAOiG,UACX5F,KAAK6F,SACL7F,KAAK8F,WACL9F,KAAK+F,QAKPjF,MAAMqE,qBAAsB9E,KAE7B,CAEA,IAAAiF,CAAMU,QAELhG,KAAKY,MAAQoF,OAAOpF,MACpBZ,KAAKgE,KAAOgC,OAAOhC,KACnBhE,KAAKU,IAAMsF,OAAOtF,IAClBV,KAAK6D,QAAUmC,OAAOnC,QACtB7D,KAAK2D,MAAM2B,KAAMU,OAAOrC,MAEzB,CAEA,KAAAsC,GAEC,OAAO,IAAIxC,cAAezD,KAAKgE,KAAMhE,KAAKU,IAAKV,KAAKY,MAErD,CAEA,OAAAW,GAECvB,KAAK4D,aAAarC,UAClBvB,KAAK+D,aAAaxC,UAElB,MAAM2E,SAAWlG,KAAKkG,SACtB,IAAM,IAAIhD,EAAI,EAAGiD,EAAID,SAASpD,OAAQI,EAAIiD,EAAGjD,IAE5CgD,SAAUhD,GAAInC,SAASQ,SAIzB","x_google_ignoreList":[0]}

package/dist/home/runner/work/anarchy-engine/anarchy-engine/node_modules/three-mesh-bvh/src/utils/ArrayBoxUtilities.js

@@ -0,0 +1,2 @@
+function arrayToBox(nodeIndex32,array,target){return target.min.x=array[nodeIndex32],target.min.y=array[nodeIndex32+1],target.min.z=array[nodeIndex32+2],target.max.x=array[nodeIndex32+3],target.max.y=array[nodeIndex32+4],target.max.z=array[nodeIndex32+5],target}function getLongestEdgeIndex(bounds){let splitDimIdx=-1,splitDist=-1/0;for(let i=0;i<3;i++){const dist=bounds[i+3]-bounds[i];dist>splitDist&&(splitDist=dist,splitDimIdx=i)}return splitDimIdx}function copyBounds(source,target){target.set(source)}function unionBounds(a,b,target){let aVal,bVal;for(let d=0;d<3;d++){const d3=d+3;aVal=a[d],bVal=b[d],target[d]=aVal<bVal?aVal:bVal,aVal=a[d3],bVal=b[d3],target[d3]=aVal>bVal?aVal:bVal}}function expandByTriangleBounds(startIndex,triangleBounds,bounds){for(let d=0;d<3;d++){const tCenter=triangleBounds[startIndex+2*d],tHalf=triangleBounds[startIndex+2*d+1],tMin=tCenter-tHalf,tMax=tCenter+tHalf;tMin<bounds[d]&&(bounds[d]=tMin),tMax>bounds[d+3]&&(bounds[d+3]=tMax)}}function computeSurfaceArea(bounds){const d0=bounds[3]-bounds[0],d1=bounds[4]-bounds[1],d2=bounds[5]-bounds[2];return 2*(d0*d1+d1*d2+d2*d0)}export{arrayToBox,computeSurfaceArea,copyBounds,expandByTriangleBounds,getLongestEdgeIndex,unionBounds};
+//# sourceMappingURL=ArrayBoxUtilities.js.map