@hellpig/anarchy-engine 21.4.1 → 22.0.1

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

@@ -1 +0,0 @@
-{"version":3,"file":"Constants.js","sources":["../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/Constants.js"],"sourcesContent":["// Split strategy constants\nexport const CENTER = 0;\nexport const AVERAGE = 1;\nexport const SAH = 2;\n\n// Traversal constants\nexport const NOT_INTERSECTED = 0;\nexport const INTERSECTED = 1;\nexport const CONTAINED = 2;\n\n// SAH cost constants\n// TODO: hone these costs more. The relative difference between them should be the\n// difference in measured time to perform a triangle intersection vs traversing\n// bounds.\nexport const TRIANGLE_INTERSECT_COST = 1.25;\nexport const TRAVERSAL_COST = 1;\n\n\n// Build constants\nexport const BYTES_PER_NODE = 6 * 4 + 4 + 4;\nexport const UINT32_PER_NODE = BYTES_PER_NODE / 4;\nexport const IS_LEAFNODE_FLAG = 0xFFFF;\n\n// Bit masks for 32 bit node data\nexport const LEAFNODE_MASK_32 = IS_LEAFNODE_FLAG << 16;\n\n// EPSILON for computing floating point error during build\n// https://en.wikipedia.org/wiki/Machine_epsilon#Values_for_standard_hardware_floating_point_arithmetics\nexport const FLOAT32_EPSILON = Math.pow( 2, - 24 );\n\nexport const SKIP_GENERATION = Symbol( 'SKIP_GENERATION' );\n"],"names":["CENTER","AVERAGE","SAH","CONTAINED","TRIANGLE_INTERSECT_COST","TRAVERSAL_COST","BYTES_PER_NODE","UINT32_PER_NODE","IS_LEAFNODE_FLAG","FLOAT32_EPSILON","Math","pow","SKIP_GENERATION","Symbol"],"mappings":"AACY,MAACA,OAAS,EACTC,QAAU,EACVC,IAAM,EAKNC,UAAY,EAMZC,wBAA0B,KAC1BC,eAAiB,EAIjBC,eAAiB,GACjBC,gBAAkBD,EAClBE,iBAAmB,MAOnBC,gBAAkBC,KAAKC,IAAK,GAAG,IAE/BC,gBAAkBC,OAAQ","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-import"../../../three/build/three.module.js";import{SKIP_GENERATION,BYTES_PER_NODE,UINT32_PER_NODE,CENTER}from"./Constants.js";import{buildPackedTree}from"./build/buildTree.js";import{OrientedBox}from"../math/OrientedBox.js";import{arrayToBox}from"../utils/ArrayBoxUtilities.js";import{ExtendedTrianglePool}from"../utils/ExtendedTrianglePool.js";import{shapecast}from"./cast/shapecast.js";import{closestPointToPoint}from"./cast/closestPointToPoint.js";import{IS_LEAF,RIGHT_NODE,SPLIT_AXIS,LEFT_NODE}from"./utils/nodeBufferUtils.js";import{iterateOverTriangles}from"./utils/iterationUtils.generated.js";import{refit}from"./cast/refit.generated.js";import{raycast}from"./cast/raycast.generated.js";import{raycastFirst}from"./cast/raycastFirst.generated.js";import{intersectsGeometry}from"./cast/intersectsGeometry.generated.js";import{closestPointToGeometry}from"./cast/closestPointToGeometry.generated.js";import{iterateOverTriangles_indirect}from"./utils/iterationUtils_indirect.generated.js";import{refit_indirect}from"./cast/refit_indirect.generated.js";import{raycast_indirect}from"./cast/raycast_indirect.generated.js";import{raycastFirst_indirect}from"./cast/raycastFirst_indirect.generated.js";import{intersectsGeometry_indirect}from"./cast/intersectsGeometry_indirect.generated.js";import{closestPointToGeometry_indirect}from"./cast/closestPointToGeometry_indirect.generated.js";import{isSharedArrayBufferSupported}from"../utils/BufferUtils.js";import{setTriangle}from"../utils/TriangleUtilities.js";import{bvhcast}from"./cast/bvhcast.js";import{BufferAttribute,Box3,FrontSide}from"../../../three/build/three.core.js";const obb=new OrientedBox,tempBox=new Box3,DEFAULT_OPTIONS={strategy:CENTER,maxDepth:40,maxLeafTris:10,useSharedArrayBuffer:!1,setBoundingBox:!0,onProgress:null,indirect:!1,verbose:!0,range:null};class MeshBVH{static serialize(bvh,options={}){options={cloneBuffers:!0,...options};const rootData=bvh._roots,indirectBuffer=bvh._indirectBuffer,indexAttribute=bvh.geometry.getIndex(),result={version:1,roots:null,index:null,indirectBuffer:null};return options.cloneBuffers?(result.roots=rootData.map(root=>root.slice()),result.index=indexAttribute?indexAttribute.array.slice():null,result.indirectBuffer=indirectBuffer?indirectBuffer.slice():null):(result.roots=rootData,result.index=indexAttribute?indexAttribute.array:null,result.indirectBuffer=indirectBuffer),result}static deserialize(data,geometry,options={}){options={setIndex:!0,indirect:Boolean(data.indirectBuffer),...options};const{index:index,roots:roots,indirectBuffer:indirectBuffer}=data;data.version||(console.warn("MeshBVH.deserialize: Serialization format has been changed and will be fixed up. It is recommended to regenerate any stored serialized data."),function(roots){for(let rootIndex=0;rootIndex<roots.length;rootIndex++){const root=roots[rootIndex],uint32Array=new Uint32Array(root),uint16Array=new Uint16Array(root);for(let node=0,l=root.byteLength/BYTES_PER_NODE;node<l;node++){const node32Index=UINT32_PER_NODE*node;IS_LEAF(2*node32Index,uint16Array)||(uint32Array[node32Index+6]=uint32Array[node32Index+6]/UINT32_PER_NODE-node)}}}(roots));const bvh=new MeshBVH(geometry,{...options,[SKIP_GENERATION]:!0});if(bvh._roots=roots,bvh._indirectBuffer=indirectBuffer||null,options.setIndex){const indexAttribute=geometry.getIndex();if(null===indexAttribute){const newIndex=new BufferAttribute(data.index,1,!1);geometry.setIndex(newIndex)}else indexAttribute.array!==index&&(indexAttribute.array.set(index),indexAttribute.needsUpdate=!0)}return bvh}get indirect(){return!!this._indirectBuffer}constructor(geometry,options={}){if(!geometry.isBufferGeometry)throw new Error("MeshBVH: Only BufferGeometries are supported.");if(geometry.index&&geometry.index.isInterleavedBufferAttribute)throw new Error("MeshBVH: InterleavedBufferAttribute is not supported for the index attribute.");if((options=Object.assign({...DEFAULT_OPTIONS,[SKIP_GENERATION]:!1},options)).useSharedArrayBuffer&&!isSharedArrayBufferSupported())throw new Error("MeshBVH: SharedArrayBuffer is not available.");this.geometry=geometry,this._roots=null,this._indirectBuffer=null,options[SKIP_GENERATION]||(buildPackedTree(this,options),!geometry.boundingBox&&options.setBoundingBox&&(geometry.boundingBox=this.getBoundingBox(new Box3))),this.resolveTriangleIndex=options.indirect?i=>this._indirectBuffer[i]:i=>i}shiftTriangleOffsets(offset){const indirectBuffer=this._indirectBuffer;if(indirectBuffer)for(let i=0,l=indirectBuffer.length;i<l;i++)indirectBuffer[i]+=offset;else{const roots=this._roots;for(let rootIndex=0;rootIndex<roots.length;rootIndex++){const root=roots[rootIndex],uint32Array=new Uint32Array(root),uint16Array=new Uint16Array(root),totalNodes=root.byteLength/BYTES_PER_NODE;for(let node=0;node<totalNodes;node++){const node32Index=UINT32_PER_NODE*node;IS_LEAF(2*node32Index,uint16Array)&&(uint32Array[node32Index+6]+=offset)}}}}refit(nodeIndices=null){return(this.indirect?refit_indirect:refit)(this,nodeIndices)}traverse(callback,rootIndex=0){const buffer=this._roots[rootIndex],uint32Array=new Uint32Array(buffer),uint16Array=new Uint16Array(buffer);!function _traverse(node32Index,depth=0){const node16Index=2*node32Index,isLeaf=IS_LEAF(node16Index,uint16Array);if(isLeaf){const offset=uint32Array[node32Index+6],count=uint16Array[node16Index+14];callback(depth,isLeaf,new Float32Array(buffer,4*node32Index,6),offset,count)}else{const left=LEFT_NODE(node32Index),right=RIGHT_NODE(node32Index,uint32Array),splitAxis=SPLIT_AXIS(node32Index,uint32Array);callback(depth,isLeaf,new Float32Array(buffer,4*node32Index,6),splitAxis)||(_traverse(left,depth+1),_traverse(right,depth+1))}}(0)}raycast(ray,materialOrSide=FrontSide,near=0,far=1/0){const intersects=[],raycastFunc=this.indirect?raycast_indirect:raycast;for(let i=0,l=this._roots.length;i<l;i++)raycastFunc(this,i,materialOrSide,ray,intersects,near,far);return intersects}raycastFirst(ray,materialOrSide=FrontSide,near=0,far=1/0){let closestResult=null;const raycastFirstFunc=this.indirect?raycastFirst_indirect:raycastFirst;for(let i=0,l=this._roots.length;i<l;i++){const result=raycastFirstFunc(this,i,materialOrSide,ray,near,far);null!=result&&(null==closestResult||result.distance<closestResult.distance)&&(closestResult=result)}return closestResult}intersectsGeometry(otherGeometry,geomToMesh){let result=!1;const intersectsGeometryFunc=this.indirect?intersectsGeometry_indirect:intersectsGeometry;for(let i=0,l=this._roots.length;i<l&&(result=intersectsGeometryFunc(this,i,otherGeometry,geomToMesh),!result);i++);return result}shapecast(callbacks){const triangle=ExtendedTrianglePool.getPrimitive(),iterateFunc=this.indirect?iterateOverTriangles_indirect:iterateOverTriangles;let{boundsTraverseOrder:boundsTraverseOrder,intersectsBounds:intersectsBounds,intersectsRange:intersectsRange,intersectsTriangle:intersectsTriangle}=callbacks;if(intersectsRange&&intersectsTriangle){const originalIntersectsRange=intersectsRange;intersectsRange=(offset,count,contained,depth,nodeIndex)=>!!originalIntersectsRange(offset,count,contained,depth,nodeIndex)||iterateFunc(offset,count,this,intersectsTriangle,contained,depth,triangle)}else intersectsRange||(intersectsRange=intersectsTriangle?(offset,count,contained,depth)=>iterateFunc(offset,count,this,intersectsTriangle,contained,depth,triangle):(offset,count,contained)=>contained);let result=!1,nodeOffset=0;const roots=this._roots;for(let i=0,l=roots.length;i<l;i++){const root=roots[i];if(result=shapecast(this,i,intersectsBounds,intersectsRange,boundsTraverseOrder,nodeOffset),result)break;nodeOffset+=root.byteLength/BYTES_PER_NODE}return ExtendedTrianglePool.releasePrimitive(triangle),result}bvhcast(otherBvh,matrixToLocal,callbacks){let{intersectsRanges:intersectsRanges,intersectsTriangles:intersectsTriangles}=callbacks;const triangle1=ExtendedTrianglePool.getPrimitive(),indexAttr1=this.geometry.index,positionAttr1=this.geometry.attributes.position,assignTriangle1=this.indirect?i1=>{const ti=this.resolveTriangleIndex(i1);setTriangle(triangle1,3*ti,indexAttr1,positionAttr1)}:i1=>{setTriangle(triangle1,3*i1,indexAttr1,positionAttr1)},triangle2=ExtendedTrianglePool.getPrimitive(),indexAttr2=otherBvh.geometry.index,positionAttr2=otherBvh.geometry.attributes.position,assignTriangle2=otherBvh.indirect?i2=>{const ti2=otherBvh.resolveTriangleIndex(i2);setTriangle(triangle2,3*ti2,indexAttr2,positionAttr2)}:i2=>{setTriangle(triangle2,3*i2,indexAttr2,positionAttr2)};if(intersectsTriangles){const iterateOverDoubleTriangles=(offset1,count1,offset2,count2,depth1,nodeIndex1,depth2,nodeIndex2)=>{for(let i2=offset2,l2=offset2+count2;i2<l2;i2++){assignTriangle2(i2),triangle2.a.applyMatrix4(matrixToLocal),triangle2.b.applyMatrix4(matrixToLocal),triangle2.c.applyMatrix4(matrixToLocal),triangle2.needsUpdate=!0;for(let i1=offset1,l1=offset1+count1;i1<l1;i1++)if(assignTriangle1(i1),triangle1.needsUpdate=!0,intersectsTriangles(triangle1,triangle2,i1,i2,depth1,nodeIndex1,depth2,nodeIndex2))return!0}return!1};if(intersectsRanges){const originalIntersectsRanges=intersectsRanges;intersectsRanges=function(offset1,count1,offset2,count2,depth1,nodeIndex1,depth2,nodeIndex2){return!!originalIntersectsRanges(offset1,count1,offset2,count2,depth1,nodeIndex1,depth2,nodeIndex2)||iterateOverDoubleTriangles(offset1,count1,offset2,count2,depth1,nodeIndex1,depth2,nodeIndex2)}}else intersectsRanges=iterateOverDoubleTriangles}return bvhcast(this,otherBvh,matrixToLocal,intersectsRanges)}intersectsBox(box,boxToMesh){return obb.set(box.min,box.max,boxToMesh),obb.needsUpdate=!0,this.shapecast({intersectsBounds:box=>obb.intersectsBox(box),intersectsTriangle:tri=>obb.intersectsTriangle(tri)})}intersectsSphere(sphere){return this.shapecast({intersectsBounds:box=>sphere.intersectsBox(box),intersectsTriangle:tri=>tri.intersectsSphere(sphere)})}closestPointToGeometry(otherGeometry,geometryToBvh,target1={},target2={},minThreshold=0,maxThreshold=1/0){return(this.indirect?closestPointToGeometry_indirect:closestPointToGeometry)(this,otherGeometry,geometryToBvh,target1,target2,minThreshold,maxThreshold)}closestPointToPoint(point,target={},minThreshold=0,maxThreshold=1/0){return closestPointToPoint(this,point,target,minThreshold,maxThreshold)}getBoundingBox(target){return target.makeEmpty(),this._roots.forEach(buffer=>{arrayToBox(0,new Float32Array(buffer),tempBox),target.union(tempBox)}),target}}export{DEFAULT_OPTIONS,MeshBVH};
-//# sourceMappingURL=MeshBVH.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"MeshBVH.js","sources":["../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/MeshBVH.js"],"sourcesContent":["import { BufferAttribute, Box3, FrontSide } from 'three';\nimport { CENTER, SKIP_GENERATION, BYTES_PER_NODE, UINT32_PER_NODE } from './Constants.js';\nimport { buildPackedTree } from './build/buildTree.js';\nimport { OrientedBox } from '../math/OrientedBox.js';\nimport { arrayToBox } from '../utils/ArrayBoxUtilities.js';\nimport { ExtendedTrianglePool } from '../utils/ExtendedTrianglePool.js';\nimport { shapecast } from './cast/shapecast.js';\nimport { closestPointToPoint } from './cast/closestPointToPoint.js';\nimport { IS_LEAF, LEFT_NODE, RIGHT_NODE, SPLIT_AXIS } from './utils/nodeBufferUtils.js';\n\nimport { iterateOverTriangles } from './utils/iterationUtils.generated.js';\nimport { refit } from './cast/refit.generated.js';\nimport { raycast } from './cast/raycast.generated.js';\nimport { raycastFirst } from './cast/raycastFirst.generated.js';\nimport { intersectsGeometry } from './cast/intersectsGeometry.generated.js';\nimport { closestPointToGeometry } from './cast/closestPointToGeometry.generated.js';\n\nimport { iterateOverTriangles_indirect } from './utils/iterationUtils_indirect.generated.js';\nimport { refit_indirect } from './cast/refit_indirect.generated.js';\nimport { raycast_indirect } from './cast/raycast_indirect.generated.js';\nimport { raycastFirst_indirect } from './cast/raycastFirst_indirect.generated.js';\nimport { intersectsGeometry_indirect } from './cast/intersectsGeometry_indirect.generated.js';\nimport { closestPointToGeometry_indirect } from './cast/closestPointToGeometry_indirect.generated.js';\nimport { isSharedArrayBufferSupported } from '../utils/BufferUtils.js';\nimport { setTriangle } from '../utils/TriangleUtilities.js';\nimport { bvhcast } from './cast/bvhcast.js';\n\nconst obb = /* @__PURE__ */ new OrientedBox();\nconst tempBox = /* @__PURE__ */ new Box3();\nexport const DEFAULT_OPTIONS = {\n\tstrategy: CENTER,\n\tmaxDepth: 40,\n\tmaxLeafTris: 10,\n\tuseSharedArrayBuffer: false,\n\tsetBoundingBox: true,\n\tonProgress: null,\n\tindirect: false,\n\tverbose: true,\n\trange: null\n};\n\nexport class MeshBVH {\n\n\tstatic serialize( bvh, options = {} ) {\n\n\t\toptions = {\n\t\t\tcloneBuffers: true,\n\t\t\t...options,\n\t\t};\n\n\t\tconst geometry = bvh.geometry;\n\t\tconst rootData = bvh._roots;\n\t\tconst indirectBuffer = bvh._indirectBuffer;\n\t\tconst indexAttribute = geometry.getIndex();\n\t\tconst result = {\n\t\t\tversion: 1,\n\t\t\troots: null,\n\t\t\tindex: null,\n\t\t\tindirectBuffer: null,\n\t\t};\n\t\tif ( options.cloneBuffers ) {\n\n\t\t\tresult.roots = rootData.map( root => root.slice() );\n\t\t\tresult.index = indexAttribute ? indexAttribute.array.slice() : null;\n\t\t\tresult.indirectBuffer = indirectBuffer ? indirectBuffer.slice() : null;\n\n\t\t} else {\n\n\t\t\tresult.roots = rootData;\n\t\t\tresult.index = indexAttribute ? indexAttribute.array : null;\n\t\t\tresult.indirectBuffer = indirectBuffer;\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n\tstatic deserialize( data, geometry, options = {} ) {\n\n\t\toptions = {\n\t\t\tsetIndex: true,\n\t\t\tindirect: Boolean( data.indirectBuffer ),\n\t\t\t...options,\n\t\t};\n\n\t\tconst { index, roots, indirectBuffer } = data;\n\n\t\t// handle backwards compatibility by fixing up the buffer roots\n\t\t// see issue gkjohnson/three-mesh-bvh#759\n\t\tif ( ! data.version ) {\n\n\t\t\tconsole.warn(\n\t\t\t\t'MeshBVH.deserialize: Serialization format has been changed and will be fixed up. ' +\n\t\t\t\t'It is recommended to regenerate any stored serialized data.'\n\t\t\t);\n\t\t\tfixupVersion0( roots );\n\n\t\t}\n\n\t\tconst bvh = new MeshBVH( geometry, { ...options, [ SKIP_GENERATION ]: true } );\n\t\tbvh._roots = roots;\n\t\tbvh._indirectBuffer = indirectBuffer || null;\n\n\t\tif ( options.setIndex ) {\n\n\t\t\tconst indexAttribute = geometry.getIndex();\n\t\t\tif ( indexAttribute === null ) {\n\n\t\t\t\tconst newIndex = new BufferAttribute( data.index, 1, false );\n\t\t\t\tgeometry.setIndex( newIndex );\n\n\t\t\t} else if ( indexAttribute.array !== index ) {\n\n\t\t\t\tindexAttribute.array.set( index );\n\t\t\t\tindexAttribute.needsUpdate = true;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn bvh;\n\n\t\t// convert version 0 serialized data (uint32 indices) to version 1 (node indices)\n\t\tfunction fixupVersion0( roots ) {\n\n\t\t\tfor ( let rootIndex = 0; rootIndex < roots.length; rootIndex ++ ) {\n\n\t\t\t\tconst root = roots[ rootIndex ];\n\t\t\t\tconst uint32Array = new Uint32Array( root );\n\t\t\t\tconst uint16Array = new Uint16Array( root );\n\n\t\t\t\t// iterate over nodes and convert right child offsets\n\t\t\t\tfor ( let node = 0, l = root.byteLength / BYTES_PER_NODE; node < l; node ++ ) {\n\n\t\t\t\t\tconst node32Index = UINT32_PER_NODE * node;\n\t\t\t\t\tconst node16Index = 2 * node32Index;\n\t\t\t\t\tif ( ! IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\t\t\t// convert absolute right child offset to relative offset\n\t\t\t\t\t\tuint32Array[ node32Index + 6 ] = uint32Array[ node32Index + 6 ] / UINT32_PER_NODE - node;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tget indirect() {\n\n\t\treturn ! ! this._indirectBuffer;\n\n\t}\n\n\tconstructor( geometry, options = {} ) {\n\n\t\tif ( ! geometry.isBufferGeometry ) {\n\n\t\t\tthrow new Error( 'MeshBVH: Only BufferGeometries are supported.' );\n\n\t\t} else if ( geometry.index && geometry.index.isInterleavedBufferAttribute ) {\n\n\t\t\tthrow new Error( 'MeshBVH: InterleavedBufferAttribute is not supported for the index attribute.' );\n\n\t\t}\n\n\t\t// default options\n\t\toptions = Object.assign( {\n\n\t\t\t...DEFAULT_OPTIONS,\n\n\t\t\t// undocumented options\n\n\t\t\t// Whether to skip generating the tree. Used for deserialization.\n\t\t\t[ SKIP_GENERATION ]: false,\n\n\t\t}, options );\n\n\t\tif ( options.useSharedArrayBuffer && ! isSharedArrayBufferSupported() ) {\n\n\t\t\tthrow new Error( 'MeshBVH: SharedArrayBuffer is not available.' );\n\n\t\t}\n\n\t\t// retain references to the geometry so we can use them it without having to\n\t\t// take a geometry reference in every function.\n\t\tthis.geometry = geometry;\n\t\tthis._roots = null;\n\t\tthis._indirectBuffer = null;\n\t\tif ( ! options[ SKIP_GENERATION ] ) {\n\n\t\t\tbuildPackedTree( this, options );\n\n\t\t\tif ( ! geometry.boundingBox && options.setBoundingBox ) {\n\n\t\t\t\tgeometry.boundingBox = this.getBoundingBox( new Box3() );\n\n\t\t\t}\n\n\t\t}\n\n\t\tthis.resolveTriangleIndex = options.indirect ? i => this._indirectBuffer[ i ] : i => i;\n\n\t}\n\n\tshiftTriangleOffsets( offset ) {\n\n\t\tconst indirectBuffer = this._indirectBuffer;\n\t\tif ( indirectBuffer ) {\n\n\t\t\t// the offsets are embedded in the indirect buffer\n\t\t\tfor ( let i = 0, l = indirectBuffer.length; i < l; i ++ ) {\n\n\t\t\t\tindirectBuffer[ i ] += offset;\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// offsets are embedded in the leaf nodes\n\t\t\tconst roots = this._roots;\n\t\t\tfor ( let rootIndex = 0; rootIndex < roots.length; rootIndex ++ ) {\n\n\t\t\t\tconst root = roots[ rootIndex ];\n\t\t\t\tconst uint32Array = new Uint32Array( root );\n\t\t\t\tconst uint16Array = new Uint16Array( root );\n\t\t\t\tconst totalNodes = root.byteLength / BYTES_PER_NODE;\n\t\t\t\tfor ( let node = 0; node < totalNodes; node ++ ) {\n\n\t\t\t\t\tconst node32Index = UINT32_PER_NODE * node;\n\t\t\t\t\tconst node16Index = 2 * node32Index;\n\t\t\t\t\tif ( IS_LEAF( node16Index, uint16Array ) ) {\n\n\t\t\t\t\t\t// offset value\n\t\t\t\t\t\tuint32Array[ node32Index + 6 ] += offset;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\trefit( nodeIndices = null ) {\n\n\t\tconst refitFunc = this.indirect ? refit_indirect : refit;\n\t\treturn refitFunc( this, nodeIndices );\n\n\t}\n\n\ttraverse( callback, rootIndex = 0 ) {\n\n\t\tconst buffer = this._roots[ rootIndex ];\n\t\tconst uint32Array = new Uint32Array( buffer );\n\t\tconst uint16Array = new Uint16Array( buffer );\n\t\t_traverse( 0 );\n\n\t\tfunction _traverse( node32Index, depth = 0 ) {\n\n\t\t\tconst node16Index = node32Index * 2;\n\t\t\tconst isLeaf = IS_LEAF( node16Index, uint16Array );\n\t\t\tif ( isLeaf ) {\n\n\t\t\t\tconst offset = uint32Array[ node32Index + 6 ];\n\t\t\t\tconst count = uint16Array[ node16Index + 14 ];\n\t\t\t\tcallback( depth, isLeaf, new Float32Array( buffer, node32Index * 4, 6 ), offset, count );\n\n\t\t\t} else {\n\n\t\t\t\tconst left = LEFT_NODE( node32Index );\n\t\t\t\tconst right = RIGHT_NODE( node32Index, uint32Array );\n\t\t\t\tconst splitAxis = SPLIT_AXIS( node32Index, uint32Array );\n\t\t\t\tconst stopTraversal = callback( depth, isLeaf, new Float32Array( buffer, node32Index * 4, 6 ), splitAxis );\n\n\t\t\t\tif ( ! stopTraversal ) {\n\n\t\t\t\t\t_traverse( left, depth + 1 );\n\t\t\t\t\t_traverse( right, depth + 1 );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\t/* Core Cast Functions */\n\traycast( ray, materialOrSide = FrontSide, near = 0, far = Infinity ) {\n\n\t\tconst roots = this._roots;\n\t\tconst intersects = [];\n\t\tconst raycastFunc = this.indirect ? raycast_indirect : raycast;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\traycastFunc( this, i, materialOrSide, ray, intersects, near, far );\n\n\t\t}\n\n\t\treturn intersects;\n\n\t}\n\n\traycastFirst( ray, materialOrSide = FrontSide, near = 0, far = Infinity ) {\n\n\t\tconst roots = this._roots;\n\t\tlet closestResult = null;\n\n\t\tconst raycastFirstFunc = this.indirect ? raycastFirst_indirect : raycastFirst;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\tconst result = raycastFirstFunc( this, i, materialOrSide, ray, near, far );\n\t\t\tif ( result != null && ( closestResult == null || result.distance < closestResult.distance ) ) {\n\n\t\t\t\tclosestResult = result;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn closestResult;\n\n\t}\n\n\tintersectsGeometry( otherGeometry, geomToMesh ) {\n\n\t\tlet result = false;\n\t\tconst roots = this._roots;\n\t\tconst intersectsGeometryFunc = this.indirect ? intersectsGeometry_indirect : intersectsGeometry;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\tresult = intersectsGeometryFunc( this, i, otherGeometry, geomToMesh );\n\n\t\t\tif ( result ) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n\tshapecast( callbacks ) {\n\n\t\tconst triangle = ExtendedTrianglePool.getPrimitive();\n\t\tconst iterateFunc = this.indirect ? iterateOverTriangles_indirect : iterateOverTriangles;\n\t\tlet {\n\t\t\tboundsTraverseOrder,\n\t\t\tintersectsBounds,\n\t\t\tintersectsRange,\n\t\t\tintersectsTriangle,\n\t\t} = callbacks;\n\n\t\t// wrap the intersectsRange function\n\t\tif ( intersectsRange && intersectsTriangle ) {\n\n\t\t\tconst originalIntersectsRange = intersectsRange;\n\t\t\tintersectsRange = ( offset, count, contained, depth, nodeIndex ) => {\n\n\t\t\t\tif ( ! originalIntersectsRange( offset, count, contained, depth, nodeIndex ) ) {\n\n\t\t\t\t\treturn iterateFunc( offset, count, this, intersectsTriangle, contained, depth, triangle );\n\n\t\t\t\t}\n\n\t\t\t\treturn true;\n\n\t\t\t};\n\n\t\t} else if ( ! intersectsRange ) {\n\n\t\t\tif ( intersectsTriangle ) {\n\n\t\t\t\tintersectsRange = ( offset, count, contained, depth ) => {\n\n\t\t\t\t\treturn iterateFunc( offset, count, this, intersectsTriangle, contained, depth, triangle );\n\n\t\t\t\t};\n\n\t\t\t} else {\n\n\t\t\t\tintersectsRange = ( offset, count, contained ) => {\n\n\t\t\t\t\treturn contained;\n\n\t\t\t\t};\n\n\t\t\t}\n\n\t\t}\n\n\t\t// run shapecast\n\t\tlet result = false;\n\t\tlet nodeOffset = 0;\n\t\tconst roots = this._roots;\n\t\tfor ( let i = 0, l = roots.length; i < l; i ++ ) {\n\n\t\t\tconst root = roots[ i ];\n\t\t\tresult = shapecast( this, i, intersectsBounds, intersectsRange, boundsTraverseOrder, nodeOffset );\n\n\t\t\tif ( result ) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t\tnodeOffset += root.byteLength / BYTES_PER_NODE;\n\n\t\t}\n\n\t\tExtendedTrianglePool.releasePrimitive( triangle );\n\n\t\treturn result;\n\n\t}\n\n\tbvhcast( otherBvh, matrixToLocal, callbacks ) {\n\n\t\tlet {\n\t\t\tintersectsRanges,\n\t\t\tintersectsTriangles,\n\t\t} = callbacks;\n\n\t\tconst triangle1 = ExtendedTrianglePool.getPrimitive();\n\t\tconst indexAttr1 = this.geometry.index;\n\t\tconst positionAttr1 = this.geometry.attributes.position;\n\t\tconst assignTriangle1 = this.indirect ?\n\t\t\ti1 => {\n\n\n\t\t\t\tconst ti = this.resolveTriangleIndex( i1 );\n\t\t\t\tsetTriangle( triangle1, ti * 3, indexAttr1, positionAttr1 );\n\n\t\t\t} :\n\t\t\ti1 => {\n\n\t\t\t\tsetTriangle( triangle1, i1 * 3, indexAttr1, positionAttr1 );\n\n\t\t\t};\n\n\t\tconst triangle2 = ExtendedTrianglePool.getPrimitive();\n\t\tconst indexAttr2 = otherBvh.geometry.index;\n\t\tconst positionAttr2 = otherBvh.geometry.attributes.position;\n\t\tconst assignTriangle2 = otherBvh.indirect ?\n\t\t\ti2 => {\n\n\t\t\t\tconst ti2 = otherBvh.resolveTriangleIndex( i2 );\n\t\t\t\tsetTriangle( triangle2, ti2 * 3, indexAttr2, positionAttr2 );\n\n\t\t\t} :\n\t\t\ti2 => {\n\n\t\t\t\tsetTriangle( triangle2, i2 * 3, indexAttr2, positionAttr2 );\n\n\t\t\t};\n\n\t\t// generate triangle callback if needed\n\t\tif ( intersectsTriangles ) {\n\n\t\t\tconst iterateOverDoubleTriangles = ( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 ) => {\n\n\t\t\t\tfor ( let i2 = offset2, l2 = offset2 + count2; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\tassignTriangle2( i2 );\n\n\t\t\t\t\ttriangle2.a.applyMatrix4( matrixToLocal );\n\t\t\t\t\ttriangle2.b.applyMatrix4( matrixToLocal );\n\t\t\t\t\ttriangle2.c.applyMatrix4( matrixToLocal );\n\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\tfor ( let i1 = offset1, l1 = offset1 + count1; i1 < l1; i1 ++ ) {\n\n\t\t\t\t\t\tassignTriangle1( i1 );\n\n\t\t\t\t\t\ttriangle1.needsUpdate = true;\n\n\t\t\t\t\t\tif ( intersectsTriangles( triangle1, triangle2, i1, i2, depth1, nodeIndex1, depth2, nodeIndex2 ) ) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\t};\n\n\t\t\tif ( intersectsRanges ) {\n\n\t\t\t\tconst originalIntersectsRanges = intersectsRanges;\n\t\t\t\tintersectsRanges = function ( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 ) {\n\n\t\t\t\t\tif ( ! originalIntersectsRanges( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 ) ) {\n\n\t\t\t\t\t\treturn iterateOverDoubleTriangles( offset1, count1, offset2, count2, depth1, nodeIndex1, depth2, nodeIndex2 );\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t};\n\n\t\t\t} else {\n\n\t\t\t\tintersectsRanges = iterateOverDoubleTriangles;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn bvhcast( this, otherBvh, matrixToLocal, intersectsRanges );\n\n\t}\n\n\n\t/* Derived Cast Functions */\n\tintersectsBox( box, boxToMesh ) {\n\n\t\tobb.set( box.min, box.max, boxToMesh );\n\t\tobb.needsUpdate = true;\n\n\t\treturn this.shapecast(\n\t\t\t{\n\t\t\t\tintersectsBounds: box => obb.intersectsBox( box ),\n\t\t\t\tintersectsTriangle: tri => obb.intersectsTriangle( tri )\n\t\t\t}\n\t\t);\n\n\t}\n\n\tintersectsSphere( sphere ) {\n\n\t\treturn this.shapecast(\n\t\t\t{\n\t\t\t\tintersectsBounds: box => sphere.intersectsBox( box ),\n\t\t\t\tintersectsTriangle: tri => tri.intersectsSphere( sphere )\n\t\t\t}\n\t\t);\n\n\t}\n\n\tclosestPointToGeometry( otherGeometry, geometryToBvh, target1 = { }, target2 = { }, minThreshold = 0, maxThreshold = Infinity ) {\n\n\t\tconst closestPointToGeometryFunc = this.indirect ? closestPointToGeometry_indirect : closestPointToGeometry;\n\t\treturn closestPointToGeometryFunc(\n\t\t\tthis,\n\t\t\totherGeometry,\n\t\t\tgeometryToBvh,\n\t\t\ttarget1,\n\t\t\ttarget2,\n\t\t\tminThreshold,\n\t\t\tmaxThreshold,\n\t\t);\n\n\t}\n\n\tclosestPointToPoint( point, target = { }, minThreshold = 0, maxThreshold = Infinity ) {\n\n\t\treturn closestPointToPoint(\n\t\t\tthis,\n\t\t\tpoint,\n\t\t\ttarget,\n\t\t\tminThreshold,\n\t\t\tmaxThreshold,\n\t\t);\n\n\t}\n\n\tgetBoundingBox( target ) {\n\n\t\ttarget.makeEmpty();\n\n\t\tconst roots = this._roots;\n\t\troots.forEach( buffer => {\n\n\t\t\tarrayToBox( 0, new Float32Array( buffer ), tempBox );\n\t\t\ttarget.union( tempBox );\n\n\t\t} );\n\n\t\treturn target;\n\n\t}\n\n}\n"],"names":["obb","OrientedBox","tempBox","Box3","DEFAULT_OPTIONS","strategy","CENTER","maxDepth","maxLeafTris","useSharedArrayBuffer","setBoundingBox","onProgress","indirect","verbose","range","MeshBVH","serialize","bvh","options","cloneBuffers","rootData","_roots","indirectBuffer","_indirectBuffer","indexAttribute","geometry","getIndex","result","version","roots","index","map","root","slice","array","deserialize","data","setIndex","Boolean","console","warn","rootIndex","length","uint32Array","Uint32Array","uint16Array","Uint16Array","node","l","byteLength","BYTES_PER_NODE","node32Index","UINT32_PER_NODE","IS_LEAF","fixupVersion0","SKIP_GENERATION","newIndex","BufferAttribute","set","needsUpdate","this","constructor","isBufferGeometry","Error","isInterleavedBufferAttribute","Object","assign","isSharedArrayBufferSupported","buildPackedTree","boundingBox","getBoundingBox","resolveTriangleIndex","i","shiftTriangleOffsets","offset","totalNodes","refit","nodeIndices","refit_indirect","traverse","callback","buffer","_traverse","depth","node16Index","isLeaf","count","Float32Array","left","LEFT_NODE","right","RIGHT_NODE","splitAxis","SPLIT_AXIS","raycast","ray","materialOrSide","FrontSide","near","far","Infinity","intersects","raycastFunc","raycast_indirect","raycastFirst","closestResult","raycastFirstFunc","raycastFirst_indirect","distance","intersectsGeometry","otherGeometry","geomToMesh","intersectsGeometryFunc","intersectsGeometry_indirect","shapecast","callbacks","triangle","ExtendedTrianglePool","getPrimitive","iterateFunc","iterateOverTriangles_indirect","iterateOverTriangles","boundsTraverseOrder","intersectsBounds","intersectsRange","intersectsTriangle","originalIntersectsRange","contained","nodeIndex","nodeOffset","releasePrimitive","bvhcast","otherBvh","matrixToLocal","intersectsRanges","intersectsTriangles","triangle1","indexAttr1","positionAttr1","attributes","position","assignTriangle1","i1","ti","setTriangle","triangle2","indexAttr2","positionAttr2","assignTriangle2","i2","ti2","iterateOverDoubleTriangles","offset1","count1","offset2","count2","depth1","nodeIndex1","depth2","nodeIndex2","l2","a","applyMatrix4","b","c","l1","originalIntersectsRanges","intersectsBox","box","boxToMesh","min","max","tri","intersectsSphere","sphere","closestPointToGeometry","geometryToBvh","target1","target2","minThreshold","maxThreshold","closestPointToGeometry_indirect","closestPointToPoint","point","target","makeEmpty","forEach","arrayToBox","union"],"mappings":"ylDA2BA,MAAMA,IAAsB,IAAIC,YAC1BC,QAA0B,IAAIC,KACvBC,gBAAkB,CAC9BC,SAAUC,OACVC,SAAU,GACVC,YAAa,GACbC,sBAAsB,EACtBC,gBAAgB,EAChBC,WAAY,KACZC,UAAU,EACVC,SAAS,EACTC,MAAO,MAGD,MAAMC,QAEZ,gBAAOC,CAAWC,IAAKC,QAAU,IAEhCA,QAAU,CACTC,cAAc,KACXD,SAGJ,MACME,SAAWH,IAAII,OACfC,eAAiBL,IAAIM,gBACrBC,eAHWP,IAAIQ,SAGWC,WAC1BC,OAAS,CACdC,QAAS,EACTC,MAAO,KACPC,MAAO,KACPR,eAAgB,MAgBjB,OAdKJ,QAAQC,cAEZQ,OAAOE,MAAQT,SAASW,IAAKC,MAAQA,KAAKC,SAC1CN,OAAOG,MAAQN,eAAiBA,eAAeU,MAAMD,QAAU,KAC/DN,OAAOL,eAAiBA,eAAiBA,eAAeW,QAAU,OAIlEN,OAAOE,MAAQT,SACfO,OAAOG,MAAQN,eAAiBA,eAAeU,MAAQ,KACvDP,OAAOL,eAAiBA,gBAIlBK,MAER,CAEA,kBAAOQ,CAAaC,KAAMX,SAAUP,QAAU,CAAA,GAE7CA,QAAU,CACTmB,UAAU,EACVzB,SAAU0B,QAASF,KAAKd,mBACrBJ,SAGJ,MAAMY,MAAEA,MAAKD,MAAEA,MAAKP,eAAEA,gBAAmBc,KAIlCA,KAAKR,UAEXW,QAAQC,KACP,gJA+BF,SAAwBX,OAEvB,IAAM,IAAIY,UAAY,EAAGA,UAAYZ,MAAMa,OAAQD,YAAe,CAEjE,MAAMT,KAAOH,MAAOY,WACdE,YAAc,IAAIC,YAAaZ,MAC/Ba,YAAc,IAAIC,YAAad,MAGrC,IAAM,IAAIe,KAAO,EAAGC,EAAIhB,KAAKiB,WAAaC,eAAgBH,KAAOC,EAAGD,OAAU,CAE7E,MAAMI,YAAcC,gBAAkBL,KAE/BM,QADa,EAAIF,YACKN,eAG5BF,YAAaQ,YAAc,GAAMR,YAAaQ,YAAc,GAAMC,gBAAkBL,KAItF,CAED,CAED,CApDCO,CAAezB,QAIhB,MAAMZ,IAAM,IAAIF,QAASU,SAAU,IAAKP,QAASqC,CAAEA,kBAAmB,IAItE,GAHAtC,IAAII,OAASQ,MACbZ,IAAIM,gBAAkBD,gBAAkB,KAEnCJ,QAAQmB,SAAW,CAEvB,MAAMb,eAAiBC,SAASC,WAChC,GAAwB,OAAnBF,eAA0B,CAE9B,MAAMgC,SAAW,IAAIC,gBAAiBrB,KAAKN,MAAO,GAAG,GACrDL,SAASY,SAAUmB,SAEpB,MAAYhC,eAAeU,QAAUJ,QAEpCN,eAAeU,MAAMwB,IAAK5B,OAC1BN,eAAemC,aAAc,EAI/B,CAEA,OAAO1C,GA6BR,CAEA,YAAIL,GAEH,QAAWgD,KAAKrC,eAEjB,CAEA,WAAAsC,CAAapC,SAAUP,QAAU,IAEhC,IAAOO,SAASqC,iBAEf,MAAM,IAAIC,MAAO,iDAEX,GAAKtC,SAASK,OAASL,SAASK,MAAMkC,6BAE5C,MAAM,IAAID,MAAO,iFAgBlB,IAXA7C,QAAU+C,OAAOC,OAAQ,IAErB9D,gBAKHmD,CAAEA,kBAAmB,GAEnBrC,UAEUT,uBAA0B0D,+BAEtC,MAAM,IAAIJ,MAAO,gDAMlBH,KAAKnC,SAAWA,SAChBmC,KAAKvC,OAAS,KACduC,KAAKrC,gBAAkB,KAChBL,QAASqC,mBAEfa,gBAAiBR,KAAM1C,UAEhBO,SAAS4C,aAAenD,QAAQR,iBAEtCe,SAAS4C,YAAcT,KAAKU,eAAgB,IAAInE,QAMlDyD,KAAKW,qBAAuBrD,QAAQN,SAAW4D,GAAKZ,KAAKrC,gBAAiBiD,GAAMA,GAAKA,CAEtF,CAEA,oBAAAC,CAAsBC,QAErB,MAAMpD,eAAiBsC,KAAKrC,gBAC5B,GAAKD,eAGJ,IAAM,IAAIkD,EAAI,EAAGxB,EAAI1B,eAAeoB,OAAQ8B,EAAIxB,EAAGwB,IAElDlD,eAAgBkD,IAAOE,WAIlB,CAGN,MAAM7C,MAAQ+B,KAAKvC,OACnB,IAAM,IAAIoB,UAAY,EAAGA,UAAYZ,MAAMa,OAAQD,YAAe,CAEjE,MAAMT,KAAOH,MAAOY,WACdE,YAAc,IAAIC,YAAaZ,MAC/Ba,YAAc,IAAIC,YAAad,MAC/B2C,WAAa3C,KAAKiB,WAAaC,eACrC,IAAM,IAAIH,KAAO,EAAGA,KAAO4B,WAAY5B,OAAU,CAEhD,MAAMI,YAAcC,gBAAkBL,KAEjCM,QADe,EAAIF,YACGN,eAG1BF,YAAaQ,YAAc,IAAOuB,OAIpC,CAED,CAED,CAED,CAEA,KAAAE,CAAOC,YAAc,MAGpB,OADkBjB,KAAKhD,SAAWkE,eAAiBF,OACjChB,KAAMiB,YAEzB,CAEA,QAAAE,CAAUC,SAAUvC,UAAY,GAE/B,MAAMwC,OAASrB,KAAKvC,OAAQoB,WACtBE,YAAc,IAAIC,YAAaqC,QAC/BpC,YAAc,IAAIC,YAAamC,SAGrC,SAASC,UAAW/B,YAAagC,MAAQ,GAExC,MAAMC,YAA4B,EAAdjC,YACdkC,OAAShC,QAAS+B,YAAavC,aACrC,GAAKwC,OAAS,CAEb,MAAMX,OAAS/B,YAAaQ,YAAc,GACpCmC,MAAQzC,YAAauC,YAAc,IACzCJ,SAAUG,MAAOE,OAAQ,IAAIE,aAAcN,OAAsB,EAAd9B,YAAiB,GAAKuB,OAAQY,MAElF,KAAO,CAEN,MAAME,KAAOC,UAAWtC,aAClBuC,MAAQC,WAAYxC,YAAaR,aACjCiD,UAAYC,WAAY1C,YAAaR,aACrBqC,SAAUG,MAAOE,OAAQ,IAAIE,aAAcN,OAAsB,EAAd9B,YAAiB,GAAKyC,aAI9FV,UAAWM,KAAML,MAAQ,GACzBD,UAAWQ,MAAOP,MAAQ,GAI5B,CAED,CA5BAD,CAAW,EA8BZ,CAGA,OAAAY,CAASC,IAAKC,eAAiBC,UAAWC,KAAO,EAAGC,IAAMC,KAEzD,MACMC,WAAa,GACbC,YAAc1C,KAAKhD,SAAW2F,iBAAmBT,QACvD,IAAM,IAAItB,EAAI,EAAGxB,EAHHY,KAAKvC,OAGQqB,OAAQ8B,EAAIxB,EAAGwB,IAEzC8B,YAAa1C,KAAMY,EAAGwB,eAAgBD,IAAKM,WAAYH,KAAMC,KAI9D,OAAOE,UAER,CAEA,YAAAG,CAAcT,IAAKC,eAAiBC,UAAWC,KAAO,EAAGC,IAAMC,KAG9D,IAAIK,cAAgB,KAEpB,MAAMC,iBAAmB9C,KAAKhD,SAAW+F,sBAAwBH,aACjE,IAAM,IAAIhC,EAAI,EAAGxB,EAJHY,KAAKvC,OAIQqB,OAAQ8B,EAAIxB,EAAGwB,IAAO,CAEhD,MAAM7C,OAAS+E,iBAAkB9C,KAAMY,EAAGwB,eAAgBD,IAAKG,KAAMC,KACtD,MAAVxE,SAAqC,MAAjB8E,eAAyB9E,OAAOiF,SAAWH,cAAcG,YAEjFH,cAAgB9E,OAIlB,CAEA,OAAO8E,aAER,CAEA,kBAAAI,CAAoBC,cAAeC,YAElC,IAAIpF,QAAS,EACb,MACMqF,uBAAyBpD,KAAKhD,SAAWqG,4BAA8BJ,mBAC7E,IAAM,IAAIrC,EAAI,EAAGxB,EAFHY,KAAKvC,OAEQqB,OAAQ8B,EAAIxB,IAEtCrB,OAASqF,uBAAwBpD,KAAMY,EAAGsC,cAAeC,aAEpDpF,QAJoC6C,KAY1C,OAAO7C,MAER,CAEA,SAAAuF,CAAWC,WAEV,MAAMC,SAAWC,qBAAqBC,eAChCC,YAAc3D,KAAKhD,SAAW4G,8BAAgCC,qBACpE,IAAIC,oBACHA,oBAAmBC,iBACnBA,iBAAgBC,gBAChBA,gBAAeC,mBACfA,oBACGV,UAGJ,GAAKS,iBAAmBC,mBAAqB,CAE5C,MAAMC,wBAA0BF,gBAChCA,gBAAkB,CAAElD,OAAQY,MAAOyC,UAAW5C,MAAO6C,cAE7CF,wBAAyBpD,OAAQY,MAAOyC,UAAW5C,MAAO6C,YAEzDT,YAAa7C,OAAQY,MAAO1B,KAAMiE,mBAAoBE,UAAW5C,MAAOiC,SAQlF,MAAcQ,kBAIZA,gBAFIC,mBAEc,CAAEnD,OAAQY,MAAOyC,UAAW5C,QAEtCoC,YAAa7C,OAAQY,MAAO1B,KAAMiE,mBAAoBE,UAAW5C,MAAOiC,UAM9D,CAAE1C,OAAQY,MAAOyC,YAE3BA,WASV,IAAIpG,QAAS,EACTsG,WAAa,EACjB,MAAMpG,MAAQ+B,KAAKvC,OACnB,IAAM,IAAImD,EAAI,EAAGxB,EAAInB,MAAMa,OAAQ8B,EAAIxB,EAAGwB,IAAO,CAEhD,MAAMxC,KAAOH,MAAO2C,GAGpB,GAFA7C,OAASuF,UAAWtD,KAAMY,EAAGmD,iBAAkBC,gBAAiBF,oBAAqBO,YAEhFtG,OAEJ,MAIDsG,YAAcjG,KAAKiB,WAAaC,cAEjC,CAIA,OAFAmE,qBAAqBa,iBAAkBd,UAEhCzF,MAER,CAEA,OAAAwG,CAASC,SAAUC,cAAelB,WAEjC,IAAImB,iBACHA,iBAAgBC,oBAChBA,qBACGpB,UAEJ,MAAMqB,UAAYnB,qBAAqBC,eACjCmB,WAAa7E,KAAKnC,SAASK,MAC3B4G,cAAgB9E,KAAKnC,SAASkH,WAAWC,SACzCC,gBAAkBjF,KAAKhD,SAC5BkI,KAGC,MAAMC,GAAKnF,KAAKW,qBAAsBuE,IACtCE,YAAaR,UAAgB,EAALO,GAAQN,WAAYC,gBAG7CI,KAECE,YAAaR,UAAgB,EAALM,GAAQL,WAAYC,gBAIxCO,UAAY5B,qBAAqBC,eACjC4B,WAAad,SAAS3G,SAASK,MAC/BqH,cAAgBf,SAAS3G,SAASkH,WAAWC,SAC7CQ,gBAAkBhB,SAASxH,SAChCyI,KAEC,MAAMC,IAAMlB,SAAS7D,qBAAsB8E,IAC3CL,YAAaC,UAAiB,EAANK,IAASJ,WAAYC,gBAG9CE,KAECL,YAAaC,UAAgB,EAALI,GAAQH,WAAYC,gBAK9C,GAAKZ,oBAAsB,CAE1B,MAAMgB,2BAA6B,CAAEC,QAASC,OAAQC,QAASC,OAAQC,OAAQC,WAAYC,OAAQC,cAElG,IAAM,IAAIV,GAAKK,QAASM,GAAKN,QAAUC,OAAQN,GAAKW,GAAIX,KAAQ,CAE/DD,gBAAiBC,IAEjBJ,UAAUgB,EAAEC,aAAc7B,eAC1BY,UAAUkB,EAAED,aAAc7B,eAC1BY,UAAUmB,EAAEF,aAAc7B,eAC1BY,UAAUtF,aAAc,EAExB,IAAM,IAAImF,GAAKU,QAASa,GAAKb,QAAUC,OAAQX,GAAKuB,GAAIvB,KAMvD,GAJAD,gBAAiBC,IAEjBN,UAAU7E,aAAc,EAEnB4E,oBAAqBC,UAAWS,UAAWH,GAAIO,GAAIO,OAAQC,WAAYC,OAAQC,YAEnF,OAAO,CAMV,CAEA,OAAO,GAIR,GAAKzB,iBAAmB,CAEvB,MAAMgC,yBAA2BhC,iBACjCA,iBAAmB,SAAWkB,QAASC,OAAQC,QAASC,OAAQC,OAAQC,WAAYC,OAAQC,YAE3F,QAAOO,yBAA0Bd,QAASC,OAAQC,QAASC,OAAQC,OAAQC,WAAYC,OAAQC,aAEvFR,2BAA4BC,QAASC,OAAQC,QAASC,OAAQC,OAAQC,WAAYC,OAAQC,WAMnG,CAED,MAECzB,iBAAmBiB,0BAIrB,CAEA,OAAOpB,QAASvE,KAAMwE,SAAUC,cAAeC,iBAEhD,CAIA,aAAAiC,CAAeC,IAAKC,WAKnB,OAHAzK,IAAI0D,IAAK8G,IAAIE,IAAKF,IAAIG,IAAKF,WAC3BzK,IAAI2D,aAAc,EAEXC,KAAKsD,UACX,CACCS,iBAAkB6C,KAAOxK,IAAIuK,cAAeC,KAC5C3C,mBAAoB+C,KAAO5K,IAAI6H,mBAAoB+C,MAItD,CAEA,gBAAAC,CAAkBC,QAEjB,OAAOlH,KAAKsD,UACX,CACCS,iBAAkB6C,KAAOM,OAAOP,cAAeC,KAC/C3C,mBAAoB+C,KAAOA,IAAIC,iBAAkBC,SAIpD,CAEA,sBAAAC,CAAwBjE,cAAekE,cAAeC,QAAU,CAAA,EAAKC,QAAU,CAAA,EAAKC,aAAe,EAAGC,aAAehF,KAGpH,OADmCxC,KAAKhD,SAAWyK,gCAAkCN,wBAEpFnH,KACAkD,cACAkE,cACAC,QACAC,QACAC,aACAC,aAGF,CAEA,mBAAAE,CAAqBC,MAAOC,OAAS,CAAA,EAAKL,aAAe,EAAGC,aAAehF,KAE1E,OAAOkF,oBACN1H,KACA2H,MACAC,OACAL,aACAC,aAGF,CAEA,cAAA9G,CAAgBkH,QAYf,OAVAA,OAAOC,YAEO7H,KAAKvC,OACbqK,QAASzG,SAEd0G,WAAY,EAAG,IAAIpG,aAAcN,QAAU/E,SAC3CsL,OAAOI,MAAO1L,WAIRsL,MAER","x_google_ignoreList":[0]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"MeshBVHNode.js","sources":["../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/MeshBVHNode.js"],"sourcesContent":["export class MeshBVHNode {\n\n\tconstructor() {\n\n\t\t// internal nodes have boundingData, left, right, and splitAxis\n\t\t// leaf nodes have offset and count (referring to primitives in the mesh geometry)\n\n\t\tthis.boundingData = new Float32Array( 6 );\n\n\t}\n\n}\n"],"names":["MeshBVHNode","constructor","this","boundingData","Float32Array"],"mappings":"AAAO,MAAMA,YAEZ,WAAAC,GAKCC,KAAKC,aAAe,IAAIC,aAAc,EAEvC","x_google_ignoreList":[0]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"buildTree.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/build/buildTree.js"],"sourcesContent":["import { ensureIndex, getFullGeometryRange, getRootIndexRanges, getTriCount } from './geometryUtils.js';\nimport { getBounds, computeTriangleBounds } from './computeBoundsUtils.js';\nimport { getOptimalSplit } from './splitUtils.js';\nimport { MeshBVHNode } from '../MeshBVHNode.js';\nimport { BYTES_PER_NODE } from '../Constants.js';\n\nimport { partition } from './sortUtils.generated.js';\nimport { partition_indirect } from './sortUtils_indirect.generated.js';\nimport { countNodes, populateBuffer } from './buildUtils.js';\n\n// construct a new buffer that points to the set of triangles represented by the given ranges\nexport function generateIndirectBuffer( geometry, useSharedArrayBuffer, ranges ) {\n\n\tconst triCount = ( geometry.index ? geometry.index.count : geometry.attributes.position.count ) / 3;\n\tconst useUint32 = triCount > 2 ** 16;\n\n\t// use getRootIndexRanges which excludes gaps\n\tconst length = ranges.reduce( ( acc, val ) => acc + val.count, 0 );\n\tconst byteCount = useUint32 ? 4 : 2;\n\tconst buffer = useSharedArrayBuffer ? new SharedArrayBuffer( length * byteCount ) : new ArrayBuffer( length * byteCount );\n\tconst indirectBuffer = useUint32 ? new Uint32Array( buffer ) : new Uint16Array( buffer );\n\n\t// construct a compact form of the triangles in these ranges\n\tlet index = 0;\n\tfor ( let r = 0; r < ranges.length; r ++ ) {\n\n\t\tconst { offset, count } = ranges[ r ];\n\t\tfor ( let i = 0; i < count; i ++ ) {\n\n\t\t\tindirectBuffer[ index + i ] = offset + i;\n\n\t\t}\n\n\t\tindex += count;\n\n\t}\n\n\treturn indirectBuffer;\n\n}\n\nexport function buildTree( bvh, triangleBounds, offset, count, options ) {\n\n\t// expand variables\n\tconst {\n\t\tmaxDepth,\n\t\tverbose,\n\t\tmaxLeafTris,\n\t\tstrategy,\n\t\tonProgress,\n\t\tindirect,\n\t} = options;\n\tconst indirectBuffer = bvh._indirectBuffer;\n\tconst geometry = bvh.geometry;\n\tconst indexArray = geometry.index ? geometry.index.array : null;\n\tconst partionFunc = indirect ? partition_indirect : partition;\n\n\t// generate intermediate variables\n\tconst totalTriangles = getTriCount( geometry );\n\tconst cacheCentroidBoundingData = new Float32Array( 6 );\n\tlet reachedMaxDepth = false;\n\n\tconst root = new MeshBVHNode();\n\tgetBounds( triangleBounds, offset, count, root.boundingData, cacheCentroidBoundingData );\n\tsplitNode( root, offset, count, cacheCentroidBoundingData );\n\treturn root;\n\n\tfunction triggerProgress( trianglesProcessed ) {\n\n\t\tif ( onProgress ) {\n\n\t\t\tonProgress( trianglesProcessed / totalTriangles );\n\n\t\t}\n\n\t}\n\n\t// either recursively splits the given node, creating left and right subtrees for it, or makes it a leaf node,\n\t// recording the offset and count of its triangles and writing them into the reordered geometry index.\n\tfunction splitNode( node, offset, count, centroidBoundingData = null, depth = 0 ) {\n\n\t\tif ( ! reachedMaxDepth && depth >= maxDepth ) {\n\n\t\t\treachedMaxDepth = true;\n\t\t\tif ( verbose ) {\n\n\t\t\t\tconsole.warn( `MeshBVH: Max depth of ${ maxDepth } reached when generating BVH. Consider increasing maxDepth.` );\n\t\t\t\tconsole.warn( geometry );\n\n\t\t\t}\n\n\t\t}\n\n\t\t// early out if we've met our capacity\n\t\tif ( count <= maxLeafTris || depth >= maxDepth ) {\n\n\t\t\ttriggerProgress( offset + count );\n\t\t\tnode.offset = offset;\n\t\t\tnode.count = count;\n\t\t\treturn node;\n\n\t\t}\n\n\t\t// Find where to split the volume\n\t\tconst split = getOptimalSplit( node.boundingData, centroidBoundingData, triangleBounds, offset, count, strategy );\n\t\tif ( split.axis === - 1 ) {\n\n\t\t\ttriggerProgress( offset + count );\n\t\t\tnode.offset = offset;\n\t\t\tnode.count = count;\n\t\t\treturn node;\n\n\t\t}\n\n\t\tconst splitOffset = partionFunc( indirectBuffer, indexArray, triangleBounds, offset, count, split );\n\n\t\t// create the two new child nodes\n\t\tif ( splitOffset === offset || splitOffset === offset + count ) {\n\n\t\t\ttriggerProgress( offset + count );\n\t\t\tnode.offset = offset;\n\t\t\tnode.count = count;\n\n\t\t} else {\n\n\t\t\tnode.splitAxis = split.axis;\n\n\t\t\t// create the left child and compute its bounding box\n\t\t\tconst left = new MeshBVHNode();\n\t\t\tconst lstart = offset;\n\t\t\tconst lcount = splitOffset - offset;\n\t\t\tnode.left = left;\n\n\t\t\tgetBounds( triangleBounds, lstart, lcount, left.boundingData, cacheCentroidBoundingData );\n\t\t\tsplitNode( left, lstart, lcount, cacheCentroidBoundingData, depth + 1 );\n\n\t\t\t// repeat for right\n\t\t\tconst right = new MeshBVHNode();\n\t\t\tconst rstart = splitOffset;\n\t\t\tconst rcount = count - lcount;\n\t\t\tnode.right = right;\n\n\t\t\tgetBounds( triangleBounds, rstart, rcount, right.boundingData, cacheCentroidBoundingData );\n\t\t\tsplitNode( right, rstart, rcount, cacheCentroidBoundingData, depth + 1 );\n\n\t\t}\n\n\t\treturn node;\n\n\t}\n\n}\n\nexport function buildPackedTree( bvh, options ) {\n\n\tconst BufferConstructor = options.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer;\n\tconst geometry = bvh.geometry;\n\tlet triangleBounds, geometryRanges;\n\tif ( options.indirect ) {\n\n\t\t// construct an buffer that is indirectly sorts the triangles used for the BVH\n\t\tconst ranges = getRootIndexRanges( geometry, options.range );\n\t\tconst indirectBuffer = generateIndirectBuffer( geometry, options.useSharedArrayBuffer, ranges );\n\t\tbvh._indirectBuffer = indirectBuffer;\n\t\ttriangleBounds = computeTriangleBounds( geometry, 0, indirectBuffer.length, indirectBuffer );\n\t\tgeometryRanges = [ { offset: 0, count: indirectBuffer.length } ];\n\n\t} else {\n\n\t\tensureIndex( geometry, options );\n\n\t\tconst fullRange = getFullGeometryRange( geometry, options.range )[ 0 ];\n\t\ttriangleBounds = computeTriangleBounds( geometry, fullRange.offset, fullRange.count );\n\t\tgeometryRanges = getRootIndexRanges( geometry, options.range );\n\n\t}\n\n\t// Build BVH roots\n\tbvh._roots = geometryRanges.map( range => {\n\n\t\tconst root = buildTree( bvh, triangleBounds, range.offset, range.count, options );\n\t\tconst nodeCount = countNodes( root );\n\t\tconst buffer = new BufferConstructor( BYTES_PER_NODE * nodeCount );\n\t\tpopulateBuffer( 0, root, buffer );\n\t\treturn buffer;\n\n\t} );\n\n}\n"],"names":["generateIndirectBuffer","geometry","useSharedArrayBuffer","ranges","useUint32","index","count","attributes","position","length","reduce","acc","val","byteCount","buffer","SharedArrayBuffer","ArrayBuffer","indirectBuffer","Uint32Array","Uint16Array","r","offset","i","buildTree","bvh","triangleBounds","options","maxDepth","verbose","maxLeafTris","strategy","onProgress","indirect","_indirectBuffer","indexArray","array","partionFunc","partition_indirect","partition","totalTriangles","getTriCount","cacheCentroidBoundingData","Float32Array","reachedMaxDepth","root","MeshBVHNode","getBounds","boundingData","splitNode","node","centroidBoundingData","depth","console","warn","triggerProgress","split","getOptimalSplit","axis","splitOffset","splitAxis","left","lstart","lcount","right","rstart","rcount","trianglesProcessed","buildPackedTree","BufferConstructor","geometryRanges","getRootIndexRanges","range","computeTriangleBounds","ensureIndex","fullRange","getFullGeometryRange","_roots","map","nodeCount","countNodes","BYTES_PER_NODE","populateBuffer"],"mappings":"kdAWO,SAASA,uBAAwBC,SAAUC,qBAAsBC,QAEvE,MACMC,WADaH,SAASI,MAAQJ,SAASI,MAAMC,MAAQL,SAASM,WAAWC,SAASF,OAAU,EACrE,MAGvBG,OAASN,OAAOO,OAAQ,CAAEC,IAAKC,MAASD,IAAMC,IAAIN,MAAO,GACzDO,UAAYT,UAAY,EAAI,EAC5BU,OAASZ,qBAAuB,IAAIa,kBAAmBN,OAASI,WAAc,IAAIG,YAAaP,OAASI,WACxGI,eAAiBb,UAAY,IAAIc,YAAaJ,QAAW,IAAIK,YAAaL,QAGhF,IAAIT,MAAQ,EACZ,IAAM,IAAIe,EAAI,EAAGA,EAAIjB,OAAOM,OAAQW,IAAO,CAE1C,MAAMC,OAAEA,OAAMf,MAAEA,OAAUH,OAAQiB,GAClC,IAAM,IAAIE,EAAI,EAAGA,EAAIhB,MAAOgB,IAE3BL,eAAgBZ,MAAQiB,GAAMD,OAASC,EAIxCjB,OAASC,KAEV,CAEA,OAAOW,cAER,CAEO,SAASM,UAAWC,IAAKC,eAAgBJ,OAAQf,MAAOoB,SAG9D,MAAMC,SACLA,SAAQC,QACRA,QAAOC,YACPA,YAAWC,SACXA,SAAQC,WACRA,WAAUC,SACVA,UACGN,QACET,eAAiBO,IAAIS,gBACrBhC,SAAWuB,IAAIvB,SACfiC,WAAajC,SAASI,MAAQJ,SAASI,MAAM8B,MAAQ,KACrDC,YAAcJ,SAAWK,mBAAqBC,UAG9CC,eAAiBC,YAAavC,UAC9BwC,0BAA4B,IAAIC,aAAc,GACpD,IAAIC,iBAAkB,EAEtB,MAAMC,KAAO,IAAIC,YAGjB,OAFAC,UAAWrB,eAAgBJ,OAAQf,MAAOsC,KAAKG,aAAcN,2BAgB7D,SAASO,UAAWC,KAAM5B,OAAQf,MAAO4C,qBAAuB,KAAMC,MAAQ,GAe7E,IAbOR,iBAAmBQ,OAASxB,WAElCgB,iBAAkB,EACbf,UAEJwB,QAAQC,KAAM,yBAA0B1B,uEACxCyB,QAAQC,KAAMpD,YAOXK,OAASuB,aAAesB,OAASxB,SAKrC,OAHA2B,gBAAiBjC,OAASf,OAC1B2C,KAAK5B,OAASA,OACd4B,KAAK3C,MAAQA,MACN2C,KAKR,MAAMM,MAAQC,gBAAiBP,KAAKF,aAAcG,qBAAsBzB,eAAgBJ,OAAQf,MAAOwB,UACvG,QAAKyB,MAAME,KAKV,OAHAH,gBAAiBjC,OAASf,OAC1B2C,KAAK5B,OAASA,OACd4B,KAAK3C,MAAQA,MACN2C,KAIR,MAAMS,YAActB,YAAanB,eAAgBiB,WAAYT,eAAgBJ,OAAQf,MAAOiD,OAG5F,GAAKG,cAAgBrC,QAAUqC,cAAgBrC,OAASf,MAEvDgD,gBAAiBjC,OAASf,OAC1B2C,KAAK5B,OAASA,OACd4B,KAAK3C,MAAQA,UAEP,CAEN2C,KAAKU,UAAYJ,MAAME,KAGvB,MAAMG,KAAO,IAAIf,YACXgB,OAASxC,OACTyC,OAASJ,YAAcrC,OAC7B4B,KAAKW,KAAOA,KAEZd,UAAWrB,eAAgBoC,OAAQC,OAAQF,KAAKb,aAAcN,2BAC9DO,UAAWY,KAAMC,OAAQC,OAAQrB,0BAA2BU,MAAQ,GAGpE,MAAMY,MAAQ,IAAIlB,YACZmB,OAASN,YACTO,OAAS3D,MAAQwD,OACvBb,KAAKc,MAAQA,MAEbjB,UAAWrB,eAAgBuC,OAAQC,OAAQF,MAAMhB,aAAcN,2BAC/DO,UAAWe,MAAOC,OAAQC,OAAQxB,0BAA2BU,MAAQ,EAEtE,CAEA,OAAOF,IAER,CArFAD,CAAWJ,KAAMvB,OAAQf,MAAOmC,2BACzBG,KAEP,SAASU,gBAAiBY,oBAEpBnC,YAEJA,WAAYmC,mBAAqB3B,eAInC,CA4ED,CAEO,SAAS4B,gBAAiB3C,IAAKE,SAErC,MAAM0C,kBAAoB1C,QAAQxB,qBAAuBa,kBAAoBC,YACvEf,SAAWuB,IAAIvB,SACrB,IAAIwB,eAAgB4C,eACpB,GAAK3C,QAAQM,SAAW,CAGvB,MAAM7B,OAASmE,mBAAoBrE,SAAUyB,QAAQ6C,OAC/CtD,eAAiBjB,uBAAwBC,SAAUyB,QAAQxB,qBAAsBC,QACvFqB,IAAIS,gBAAkBhB,eACtBQ,eAAiB+C,sBAAuBvE,SAAU,EAAGgB,eAAeR,OAAQQ,gBAC5EoD,eAAiB,CAAE,CAAEhD,OAAQ,EAAGf,MAAOW,eAAeR,QAEvD,KAAO,CAENgE,YAAaxE,SAAUyB,SAEvB,MAAMgD,UAAYC,qBAAsB1E,SAAUyB,QAAQ6C,OAAS,GACnE9C,eAAiB+C,sBAAuBvE,SAAUyE,UAAUrD,OAAQqD,UAAUpE,OAC9E+D,eAAiBC,mBAAoBrE,SAAUyB,QAAQ6C,MAExD,CAGA/C,IAAIoD,OAASP,eAAeQ,IAAKN,QAEhC,MAAM3B,KAAOrB,UAAWC,IAAKC,eAAgB8C,MAAMlD,OAAQkD,MAAMjE,MAAOoB,SAClEoD,UAAYC,WAAYnC,MACxB9B,OAAS,IAAIsD,kBAAmBY,eAAiBF,WAEvD,OADAG,eAAgB,EAAGrC,KAAM9B,QAClBA,QAIT","x_google_ignoreList":[0]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"buildUtils.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/build/buildUtils.js"],"sourcesContent":["import { BYTES_PER_NODE, IS_LEAFNODE_FLAG } from '../Constants.js';\n\nlet float32Array, uint32Array, uint16Array, uint8Array;\nconst MAX_POINTER = Math.pow( 2, 32 );\n\nexport function countNodes( node ) {\n\n\tif ( 'count' in node ) {\n\n\t\treturn 1;\n\n\t} else {\n\n\t\treturn 1 + countNodes( node.left ) + countNodes( node.right );\n\n\t}\n\n}\n\nexport function populateBuffer( byteOffset, node, buffer ) {\n\n\tfloat32Array = new Float32Array( buffer );\n\tuint32Array = new Uint32Array( buffer );\n\tuint16Array = new Uint16Array( buffer );\n\tuint8Array = new Uint8Array( buffer );\n\n\treturn _populateBuffer( byteOffset, node );\n\n}\n\n// pack structure\n// boundingData  \t\t\t\t: 6 float32\n// right / offset \t\t\t\t: 1 uint32\n// splitAxis / isLeaf + count \t: 1 uint32 / 2 uint16\nfunction _populateBuffer( byteOffset, node ) {\n\n\tconst node32Index = byteOffset / 4;\n\tconst node16Index = byteOffset / 2;\n\tconst isLeaf = 'count' in node;\n\tconst boundingData = node.boundingData;\n\tfor ( let i = 0; i < 6; i ++ ) {\n\n\t\tfloat32Array[ node32Index + i ] = boundingData[ i ];\n\n\t}\n\n\tif ( isLeaf ) {\n\n\t\tif ( node.buffer ) {\n\n\t\t\tuint8Array.set( new Uint8Array( node.buffer ), byteOffset );\n\t\t\treturn byteOffset + node.buffer.byteLength;\n\n\t\t} else {\n\n\t\t\tuint32Array[ node32Index + 6 ] = node.offset;\n\t\t\tuint16Array[ node16Index + 14 ] = node.count;\n\t\t\tuint16Array[ node16Index + 15 ] = IS_LEAFNODE_FLAG;\n\t\t\treturn byteOffset + BYTES_PER_NODE;\n\n\t\t}\n\n\t} else {\n\n\t\tconst { left, right, splitAxis } = node;\n\n\t\t// fill in the left node contents\n\t\tconst leftByteOffset = byteOffset + BYTES_PER_NODE;\n\t\tlet rightByteOffset = _populateBuffer( leftByteOffset, left );\n\n\t\t// calculate relative offset from parent to right child\n\t\tconst currentNodeIndex = byteOffset / BYTES_PER_NODE;\n\t\tconst rightNodeIndex = rightByteOffset / BYTES_PER_NODE;\n\t\tconst relativeRightIndex = rightNodeIndex - currentNodeIndex;\n\n\t\t// check if the relative offset is too high\n\t\tif ( relativeRightIndex > MAX_POINTER ) {\n\n\t\t\tthrow new Error( 'MeshBVH: Cannot store relative child node offset greater than 32 bits.' );\n\n\t\t}\n\n\t\t// fill in the right node contents (store as relative offset)\n\t\tuint32Array[ node32Index + 6 ] = relativeRightIndex;\n\t\tuint32Array[ node32Index + 7 ] = splitAxis;\n\n\t\t// return the next available buffer pointer\n\t\treturn _populateBuffer( rightByteOffset, right );\n\n\t}\n\n}\n"],"names":["float32Array","uint32Array","uint16Array","uint8Array","MAX_POINTER","Math","pow","countNodes","node","left","right","populateBuffer","byteOffset","buffer","Float32Array","Uint32Array","Uint16Array","Uint8Array","_populateBuffer","node32Index","node16Index","isLeaf","boundingData","i","set","byteLength","offset","count","IS_LEAFNODE_FLAG","BYTES_PER_NODE","splitAxis","rightByteOffset","relativeRightIndex","Error"],"mappings":"6DAEA,IAAIA,aAAcC,YAAaC,YAAaC,WAC5C,MAAMC,YAAcC,KAAKC,IAAK,EAAG,IAE1B,SAASC,WAAYC,MAE3B,MAAK,UAAWA,KAER,EAIA,EAAID,WAAYC,KAAKC,MAASF,WAAYC,KAAKE,MAIxD,CAEO,SAASC,eAAgBC,WAAYJ,KAAMK,QAOjD,OALAb,aAAe,IAAIc,aAAcD,QACjCZ,YAAc,IAAIc,YAAaF,QAC/BX,YAAc,IAAIc,YAAaH,QAC/BV,WAAa,IAAIc,WAAYJ,QAEtBK,gBAAiBN,WAAYJ,KAErC,CAMA,SAASU,gBAAiBN,WAAYJ,MAErC,MAAMW,YAAcP,WAAa,EAC3BQ,YAAcR,WAAa,EAC3BS,OAAS,UAAWb,KACpBc,aAAed,KAAKc,aAC1B,IAAM,IAAIC,EAAI,EAAGA,EAAI,EAAGA,IAEvBvB,aAAcmB,YAAcI,GAAMD,aAAcC,GAIjD,GAAKF,OAEJ,OAAKb,KAAKK,QAETV,WAAWqB,IAAK,IAAIP,WAAYT,KAAKK,QAAUD,YACxCA,WAAaJ,KAAKK,OAAOY,aAIhCxB,YAAakB,YAAc,GAAMX,KAAKkB,OACtCxB,YAAakB,YAAc,IAAOZ,KAAKmB,MACvCzB,YAAakB,YAAc,IAAOQ,iBAC3BhB,WAAaiB,gBAIf,CAEN,MAAMpB,KAAEA,KAAIC,MAAEA,MAAKoB,UAAEA,WAActB,KAInC,IAAIuB,gBAAkBb,gBADCN,WAAaiB,eACmBpB,MAGvD,MAEMuB,mBADiBD,gBAAkBF,eADhBjB,WAAaiB,eAKtC,GAAKG,mBAAqB5B,YAEzB,MAAM,IAAI6B,MAAO,0EASlB,OAJAhC,YAAakB,YAAc,GAAMa,mBACjC/B,YAAakB,YAAc,GAAMW,UAG1BZ,gBAAiBa,gBAAiBrB,MAE1C,CAED","x_google_ignoreList":[0]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"computeBoundsUtils.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/build/computeBoundsUtils.js"],"sourcesContent":["import { FLOAT32_EPSILON } from '../Constants.js';\n\n// computes the union of the bounds of all of the given triangles and puts the resulting box in \"target\".\n// A bounding box is computed for the centroids of the triangles, as well, and placed in \"centroidTarget\".\n// These are computed together to avoid redundant accesses to bounds array.\nexport function getBounds( triangleBounds, offset, count, target, centroidTarget ) {\n\n\tlet minx = Infinity;\n\tlet miny = Infinity;\n\tlet minz = Infinity;\n\tlet maxx = - Infinity;\n\tlet maxy = - Infinity;\n\tlet maxz = - Infinity;\n\n\tlet cminx = Infinity;\n\tlet cminy = Infinity;\n\tlet cminz = Infinity;\n\tlet cmaxx = - Infinity;\n\tlet cmaxy = - Infinity;\n\tlet cmaxz = - Infinity;\n\n\tconst boundsOffset = triangleBounds.offset || 0;\n\tfor ( let i = ( offset - boundsOffset ) * 6, end = ( offset + count - boundsOffset ) * 6; i < end; i += 6 ) {\n\n\t\tconst cx = triangleBounds[ i + 0 ];\n\t\tconst hx = triangleBounds[ i + 1 ];\n\t\tconst lx = cx - hx;\n\t\tconst rx = cx + hx;\n\t\tif ( lx < minx ) minx = lx;\n\t\tif ( rx > maxx ) maxx = rx;\n\t\tif ( cx < cminx ) cminx = cx;\n\t\tif ( cx > cmaxx ) cmaxx = cx;\n\n\t\tconst cy = triangleBounds[ i + 2 ];\n\t\tconst hy = triangleBounds[ i + 3 ];\n\t\tconst ly = cy - hy;\n\t\tconst ry = cy + hy;\n\t\tif ( ly < miny ) miny = ly;\n\t\tif ( ry > maxy ) maxy = ry;\n\t\tif ( cy < cminy ) cminy = cy;\n\t\tif ( cy > cmaxy ) cmaxy = cy;\n\n\t\tconst cz = triangleBounds[ i + 4 ];\n\t\tconst hz = triangleBounds[ i + 5 ];\n\t\tconst lz = cz - hz;\n\t\tconst rz = cz + hz;\n\t\tif ( lz < minz ) minz = lz;\n\t\tif ( rz > maxz ) maxz = rz;\n\t\tif ( cz < cminz ) cminz = cz;\n\t\tif ( cz > cmaxz ) cmaxz = cz;\n\n\t}\n\n\ttarget[ 0 ] = minx;\n\ttarget[ 1 ] = miny;\n\ttarget[ 2 ] = minz;\n\n\ttarget[ 3 ] = maxx;\n\ttarget[ 4 ] = maxy;\n\ttarget[ 5 ] = maxz;\n\n\tcentroidTarget[ 0 ] = cminx;\n\tcentroidTarget[ 1 ] = cminy;\n\tcentroidTarget[ 2 ] = cminz;\n\n\tcentroidTarget[ 3 ] = cmaxx;\n\tcentroidTarget[ 4 ] = cmaxy;\n\tcentroidTarget[ 5 ] = cmaxz;\n\n}\n\n// precomputes the bounding box for each triangle; required for quickly calculating tree splits.\n// result is an array of size count * 6 where triangle i maps to a\n// [x_center, x_delta, y_center, y_delta, z_center, z_delta] tuple starting at index (i - offset) * 6,\n// representing the center and half-extent in each dimension of triangle i\nexport function computeTriangleBounds( geo, offset, count = null, indirectBuffer = null, targetBuffer = null ) {\n\n\tconst posAttr = geo.attributes.position;\n\tconst index = geo.index ? geo.index.array : null;\n\tconst normalized = posAttr.normalized;\n\n\tif ( targetBuffer === null ) {\n\n\t\t// store offset on the array for later use & allocate only for the\n\t\t// range being computed\n\t\ttargetBuffer = new Float32Array( count * 6 );\n\t\ttargetBuffer.offset = offset;\n\n\t} else {\n\n\t\tif ( offset < 0 || count + offset > targetBuffer.length / 6 ) {\n\n\t\t\tthrow new Error( 'MeshBVH: compute triangle bounds range is invalid.' );\n\n\t\t}\n\n\t}\n\n\t// used for non-normalized positions\n\tconst posArr = posAttr.array;\n\n\t// support for an interleaved position buffer\n\tconst bufferOffset = posAttr.offset || 0;\n\tlet stride = 3;\n\tif ( posAttr.isInterleavedBufferAttribute ) {\n\n\t\tstride = posAttr.data.stride;\n\n\t}\n\n\t// used for normalized positions\n\tconst getters = [ 'getX', 'getY', 'getZ' ];\n\tconst writeOffset = targetBuffer.offset;\n\n\t// iterate over the triangle range\n\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\tconst tri = indirectBuffer ? indirectBuffer[ i ] : i;\n\t\tconst tri3 = tri * 3;\n\t\tconst boundsIndexOffset = ( i - writeOffset ) * 6;\n\n\t\tlet ai = tri3 + 0;\n\t\tlet bi = tri3 + 1;\n\t\tlet ci = tri3 + 2;\n\n\t\tif ( index ) {\n\n\t\t\tai = index[ ai ];\n\t\t\tbi = index[ bi ];\n\t\t\tci = index[ ci ];\n\n\t\t}\n\n\t\t// we add the stride and offset here since we access the array directly\n\t\t// below for the sake of performance\n\t\tif ( ! normalized ) {\n\n\t\t\tai = ai * stride + bufferOffset;\n\t\t\tbi = bi * stride + bufferOffset;\n\t\t\tci = ci * stride + bufferOffset;\n\n\t\t}\n\n\t\tfor ( let el = 0; el < 3; el ++ ) {\n\n\t\t\tlet a, b, c;\n\n\t\t\tif ( normalized ) {\n\n\t\t\t\ta = posAttr[ getters[ el ] ]( ai );\n\t\t\t\tb = posAttr[ getters[ el ] ]( bi );\n\t\t\t\tc = posAttr[ getters[ el ] ]( ci );\n\n\t\t\t} else {\n\n\t\t\t\ta = posArr[ ai + el ];\n\t\t\t\tb = posArr[ bi + el ];\n\t\t\t\tc = posArr[ ci + el ];\n\n\t\t\t}\n\n\t\t\tlet min = a;\n\t\t\tif ( b < min ) min = b;\n\t\t\tif ( c < min ) min = c;\n\n\t\t\tlet max = a;\n\t\t\tif ( b > max ) max = b;\n\t\t\tif ( c > max ) max = c;\n\n\t\t\t// Increase the bounds size by float32 epsilon to avoid precision errors when\n\t\t\t// converting to 32 bit float. Scale the epsilon by the size of the numbers being\n\t\t\t// worked with.\n\t\t\tconst halfExtents = ( max - min ) / 2;\n\t\t\tconst el2 = el * 2;\n\t\t\ttargetBuffer[ boundsIndexOffset + el2 + 0 ] = min + halfExtents;\n\t\t\ttargetBuffer[ boundsIndexOffset + el2 + 1 ] = halfExtents + ( Math.abs( min ) + halfExtents ) * FLOAT32_EPSILON;\n\n\t\t}\n\n\t}\n\n\treturn targetBuffer;\n\n}\n"],"names":["getBounds","triangleBounds","offset","count","target","centroidTarget","minx","Infinity","miny","minz","maxx","maxy","maxz","cminx","cminy","cminz","cmaxx","cmaxy","cmaxz","boundsOffset","i","end","cx","hx","lx","rx","cy","hy","ly","ry","cz","hz","lz","rz","computeTriangleBounds","geo","indirectBuffer","targetBuffer","posAttr","attributes","position","index","array","normalized","Float32Array","length","Error","posArr","bufferOffset","stride","isInterleavedBufferAttribute","data","getters","writeOffset","l","tri3","boundsIndexOffset","ai","bi","ci","el","a","b","c","min","max","halfExtents","el2","Math","abs","FLOAT32_EPSILON"],"mappings":"6CAKO,SAASA,UAAWC,eAAgBC,OAAQC,MAAOC,OAAQC,gBAEjE,IAAIC,KAAOC,IACPC,KAAOD,IACPE,KAAOF,IACPG,MAAO,IACPC,MAAO,IACPC,MAAO,IAEPC,MAAQN,IACRO,MAAQP,IACRQ,MAAQR,IACRS,OAAQ,IACRC,OAAQ,IACRC,OAAQ,IAEZ,MAAMC,aAAelB,eAAeC,QAAU,EAC9C,IAAM,IAAIkB,EAAgC,GAA1BlB,OAASiB,cAAoBE,IAA0C,GAAlCnB,OAASC,MAAQgB,cAAoBC,EAAIC,IAAKD,GAAK,EAAI,CAE3G,MAAME,GAAKrB,eAAgBmB,EAAI,GACzBG,GAAKtB,eAAgBmB,EAAI,GACzBI,GAAKF,GAAKC,GACVE,GAAKH,GAAKC,GACXC,GAAKlB,OAAOA,KAAOkB,IACnBC,GAAKf,OAAOA,KAAOe,IACnBH,GAAKT,QAAQA,MAAQS,IACrBA,GAAKN,QAAQA,MAAQM,IAE1B,MAAMI,GAAKzB,eAAgBmB,EAAI,GACzBO,GAAK1B,eAAgBmB,EAAI,GACzBQ,GAAKF,GAAKC,GACVE,GAAKH,GAAKC,GACXC,GAAKpB,OAAOA,KAAOoB,IACnBC,GAAKlB,OAAOA,KAAOkB,IACnBH,GAAKZ,QAAQA,MAAQY,IACrBA,GAAKT,QAAQA,MAAQS,IAE1B,MAAMI,GAAK7B,eAAgBmB,EAAI,GACzBW,GAAK9B,eAAgBmB,EAAI,GACzBY,GAAKF,GAAKC,GACVE,GAAKH,GAAKC,GACXC,GAAKvB,OAAOA,KAAOuB,IACnBC,GAAKrB,OAAOA,KAAOqB,IACnBH,GAAKf,QAAQA,MAAQe,IACrBA,GAAKZ,QAAQA,MAAQY,GAE3B,CAEA1B,OAAQ,GAAME,KACdF,OAAQ,GAAMI,KACdJ,OAAQ,GAAMK,KAEdL,OAAQ,GAAMM,KACdN,OAAQ,GAAMO,KACdP,OAAQ,GAAMQ,KAEdP,eAAgB,GAAMQ,MACtBR,eAAgB,GAAMS,MACtBT,eAAgB,GAAMU,MAEtBV,eAAgB,GAAMW,MACtBX,eAAgB,GAAMY,MACtBZ,eAAgB,GAAMa,KAEvB,CAMO,SAASgB,sBAAuBC,IAAKjC,OAAQC,MAAQ,KAAMiC,eAAiB,KAAMC,aAAe,MAEvG,MAAMC,QAAUH,IAAII,WAAWC,SACzBC,MAAQN,IAAIM,MAAQN,IAAIM,MAAMC,MAAQ,KACtCC,WAAaL,QAAQK,WAE3B,GAAsB,OAAjBN,cAIJA,aAAe,IAAIO,aAAsB,EAARzC,QACpBD,OAASA,YAItB,GAAKA,OAAS,GAAKC,MAAQD,OAASmC,aAAaQ,OAAS,EAEzD,MAAM,IAAIC,MAAO,sDAOnB,MAAMC,OAAST,QAAQI,MAGjBM,aAAeV,QAAQpC,QAAU,EACvC,IAAI+C,OAAS,EACRX,QAAQY,+BAEZD,OAASX,QAAQa,KAAKF,QAKvB,MAAMG,QAAU,CAAE,OAAQ,OAAQ,QAC5BC,YAAchB,aAAanC,OAGjC,IAAM,IAAIkB,EAAIlB,OAAQoD,EAAIpD,OAASC,MAAOiB,EAAIkC,EAAGlC,IAAO,CAEvD,MACMmC,KAAa,GADPnB,eAAiBA,eAAgBhB,GAAMA,GAE7CoC,kBAA0C,GAApBpC,EAAIiC,aAEhC,IAAII,GAAKF,KAAO,EACZG,GAAKH,KAAO,EACZI,GAAKJ,KAAO,EAEXd,QAEJgB,GAAKhB,MAAOgB,IACZC,GAAKjB,MAAOiB,IACZC,GAAKlB,MAAOkB,KAMNhB,aAENc,GAAKA,GAAKR,OAASD,aACnBU,GAAKA,GAAKT,OAASD,aACnBW,GAAKA,GAAKV,OAASD,cAIpB,IAAM,IAAIY,GAAK,EAAGA,GAAK,EAAGA,KAAQ,CAEjC,IAAIC,EAAGC,EAAGC,EAELpB,YAEJkB,EAAIvB,QAASc,QAASQ,KAAQH,IAC9BK,EAAIxB,QAASc,QAASQ,KAAQF,IAC9BK,EAAIzB,QAASc,QAASQ,KAAQD,MAI9BE,EAAId,OAAQU,GAAKG,IACjBE,EAAIf,OAAQW,GAAKE,IACjBG,EAAIhB,OAAQY,GAAKC,KAIlB,IAAII,IAAMH,EACLC,EAAIE,MAAMA,IAAMF,GAChBC,EAAIC,MAAMA,IAAMD,GAErB,IAAIE,IAAMJ,EACLC,EAAIG,MAAMA,IAAMH,GAChBC,EAAIE,MAAMA,IAAMF,GAKrB,MAAMG,aAAgBD,IAAMD,KAAQ,EAC9BG,IAAW,EAALP,GACZvB,aAAcmB,kBAAoBW,IAAM,GAAMH,IAAME,YACpD7B,aAAcmB,kBAAoBW,IAAM,GAAMD,aAAgBE,KAAKC,IAAKL,KAAQE,aAAgBI,eAEjG,CAED,CAEA,OAAOjC,YAER","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-import"../../../../three/build/three.module.js";import{BufferAttribute}from"../../../../three/build/three.core.js";function getVertexCount(geo){return geo.index?geo.index.count:geo.attributes.position.count}function getTriCount(geo){return getVertexCount(geo)/3}function getIndexArray(vertexCount,BufferConstructor=ArrayBuffer){return vertexCount>65535?new Uint32Array(new BufferConstructor(4*vertexCount)):new Uint16Array(new BufferConstructor(2*vertexCount))}function ensureIndex(geo,options){if(!geo.index){const vertexCount=geo.attributes.position.count,index=getIndexArray(vertexCount,options.useSharedArrayBuffer?SharedArrayBuffer:ArrayBuffer);geo.setIndex(new BufferAttribute(index,1));for(let i=0;i<vertexCount;i++)index[i]=i}}function getFullGeometryRange(geo,range){const triCount=getTriCount(geo),drawRange=range||geo.drawRange,end=(drawRange.start+drawRange.count)/3,offset=Math.max(0,drawRange.start/3),count=Math.min(triCount,end)-offset;return[{offset:Math.floor(offset),count:Math.floor(count)}]}function getRootIndexRanges(geo,range){if(!geo.groups||!geo.groups.length)return getFullGeometryRange(geo,range);const ranges=[],drawRange=range||geo.drawRange,drawRangeStart=drawRange.start/3,drawRangeEnd=(drawRange.start+drawRange.count)/3,triCount=getTriCount(geo),events=[];for(const group of geo.groups){const{start:start,count:count}=group,groupStart=start/3,groupEnd=(start+(isFinite(count)?count:3*triCount-start))/3;groupStart<drawRangeEnd&&groupEnd>drawRangeStart&&(events.push({pos:Math.max(drawRangeStart,groupStart),isStart:!0}),events.push({pos:Math.min(drawRangeEnd,groupEnd),isStart:!1}))}events.sort((a,b)=>a.pos!==b.pos?a.pos-b.pos:"end"===a.type?-1:1);let activeGroups=0,lastPos=null;for(const event of events){const newPos=event.pos;0!==activeGroups&&newPos!==lastPos&&ranges.push({offset:lastPos,count:newPos-lastPos}),activeGroups+=event.isStart?1:-1,lastPos=newPos}return ranges}export{ensureIndex,getFullGeometryRange,getIndexArray,getRootIndexRanges,getTriCount,getVertexCount};
-//# sourceMappingURL=geometryUtils.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"geometryUtils.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/build/geometryUtils.js"],"sourcesContent":["import { BufferAttribute } from 'three';\n\nexport function getVertexCount( geo ) {\n\n\treturn geo.index ? geo.index.count : geo.attributes.position.count;\n\n}\n\nexport function getTriCount( geo ) {\n\n\treturn getVertexCount( geo ) / 3;\n\n}\n\nexport function getIndexArray( vertexCount, BufferConstructor = ArrayBuffer ) {\n\n\tif ( vertexCount > 65535 ) {\n\n\t\treturn new Uint32Array( new BufferConstructor( 4 * vertexCount ) );\n\n\t} else {\n\n\t\treturn new Uint16Array( new BufferConstructor( 2 * vertexCount ) );\n\n\t}\n\n}\n\n// ensures that an index is present on the geometry\nexport function ensureIndex( geo, options ) {\n\n\tif ( ! geo.index ) {\n\n\t\tconst vertexCount = geo.attributes.position.count;\n\t\tconst BufferConstructor = options.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer;\n\t\tconst index = getIndexArray( vertexCount, BufferConstructor );\n\t\tgeo.setIndex( new BufferAttribute( index, 1 ) );\n\n\t\tfor ( let i = 0; i < vertexCount; i ++ ) {\n\n\t\t\tindex[ i ] = i;\n\n\t\t}\n\n\t}\n\n}\n\n// Computes the set of { offset, count } ranges which need independent BVH roots. Each\n// region in the geometry index that belongs to a different set of material groups requires\n// a separate BVH root, so that triangles indices belonging to one group never get swapped\n// with triangle indices belongs to another group. For example, if the groups were like this:\n//\n// [-------------------------------------------------------------]\n// |__________________|\n//   g0 = [0, 20]  |______________________||_____________________|\n//                      g1 = [16, 40]           g2 = [41, 60]\n//\n// we would need four BVH roots: [0, 15], [16, 20], [21, 40], [41, 60].\nexport function getFullGeometryRange( geo, range ) {\n\n\tconst triCount = getTriCount( geo );\n\tconst drawRange = range ? range : geo.drawRange;\n\tconst start = drawRange.start / 3;\n\tconst end = ( drawRange.start + drawRange.count ) / 3;\n\n\tconst offset = Math.max( 0, start );\n\tconst count = Math.min( triCount, end ) - offset;\n\treturn [ {\n\t\toffset: Math.floor( offset ),\n\t\tcount: Math.floor( count ),\n\t} ];\n\n}\n\n// Function that extracts a set of mutually exclusive ranges representing the triangles being\n// drawn as determined by the geometry groups, draw range, and user specified range\nexport function getRootIndexRanges( geo, range ) {\n\n\tif ( ! geo.groups || ! geo.groups.length ) {\n\n\t\treturn getFullGeometryRange( geo, range );\n\n\t}\n\n\tconst ranges = [];\n\tconst drawRange = range ? range : geo.drawRange;\n\tconst drawRangeStart = drawRange.start / 3;\n\tconst drawRangeEnd = ( drawRange.start + drawRange.count ) / 3;\n\n\t// Create events for group boundaries\n\tconst triCount = getTriCount( geo );\n\tconst events = [];\n\tfor ( const group of geo.groups ) {\n\n\t\t// Account for cases where group size is set to Infinity\n\t\tconst { start, count } = group;\n\t\tconst groupStart = start / 3;\n\t\tconst groupCount = isFinite( count ) ? count : ( triCount * 3 - start );\n\t\tconst groupEnd = ( start + groupCount ) / 3;\n\n\t\t// Only add events if the group intersects with the draw range\n\t\tif ( groupStart < drawRangeEnd && groupEnd > drawRangeStart ) {\n\n\t\t\tevents.push( { pos: Math.max( drawRangeStart, groupStart ), isStart: true } );\n\t\t\tevents.push( { pos: Math.min( drawRangeEnd, groupEnd ), isStart: false } );\n\n\t\t}\n\n\t}\n\n\t// Sort events by position, with 'end' events before 'start' events at the same position\n\tevents.sort( ( a, b ) => {\n\n\t\tif ( a.pos !== b.pos ) {\n\n\t\t\treturn a.pos - b.pos;\n\n\t\t} else {\n\n\t\t\treturn a.type === 'end' ? - 1 : 1;\n\n\t\t}\n\n\t} );\n\n\t// sweep through events and create ranges where activeGroups > 0\n\tlet activeGroups = 0;\n\tlet lastPos = null;\n\tfor ( const event of events ) {\n\n\t\tconst newPos = event.pos;\n\t\tif ( activeGroups !== 0 && newPos !== lastPos ) {\n\n\t\t\tranges.push( {\n\t\t\t\toffset: lastPos,\n\t\t\t\tcount: newPos - lastPos,\n\t\t\t} );\n\n\t\t}\n\n\t\tactiveGroups += event.isStart ? 1 : - 1;\n\t\tlastPos = newPos;\n\n\t}\n\n\treturn ranges;\n\n}\n\nexport function hasGroupGaps( geometry, range ) {\n\n\tconst vertexCount = getTriCount( geometry );\n\tconst groups = getRootIndexRanges( geometry, range )\n\t\t.sort( ( a, b ) => a.offset - b.offset );\n\n\tconst finalGroup = groups[ groups.length - 1 ];\n\tfinalGroup.count = Math.min( vertexCount - finalGroup.offset, finalGroup.count );\n\n\tlet total = 0;\n\tgroups.forEach( ( { count } ) => total += count );\n\treturn vertexCount !== total;\n\n}\n"],"names":["getVertexCount","geo","index","count","attributes","position","getTriCount","getIndexArray","vertexCount","BufferConstructor","ArrayBuffer","Uint32Array","Uint16Array","ensureIndex","options","useSharedArrayBuffer","SharedArrayBuffer","setIndex","BufferAttribute","i","getFullGeometryRange","range","triCount","drawRange","end","start","offset","Math","max","min","floor","getRootIndexRanges","groups","length","ranges","drawRangeStart","drawRangeEnd","events","group","groupStart","groupEnd","isFinite","push","pos","isStart","sort","a","b","type","activeGroups","lastPos","event","newPos"],"mappings":"mHAEO,SAASA,eAAgBC,KAE/B,OAAOA,IAAIC,MAAQD,IAAIC,MAAMC,MAAQF,IAAIG,WAAWC,SAASF,KAE9D,CAEO,SAASG,YAAaL,KAE5B,OAAOD,eAAgBC,KAAQ,CAEhC,CAEO,SAASM,cAAeC,YAAaC,kBAAoBC,aAE/D,OAAKF,YAAc,MAEX,IAAIG,YAAa,IAAIF,kBAAmB,EAAID,cAI5C,IAAII,YAAa,IAAIH,kBAAmB,EAAID,aAIrD,CAGO,SAASK,YAAaZ,IAAKa,SAEjC,IAAOb,IAAIC,MAAQ,CAElB,MAAMM,YAAcP,IAAIG,WAAWC,SAASF,MAEtCD,MAAQK,cAAeC,YADHM,QAAQC,qBAAuBC,kBAAoBN,aAE7ET,IAAIgB,SAAU,IAAIC,gBAAiBhB,MAAO,IAE1C,IAAM,IAAIiB,EAAI,EAAGA,EAAIX,YAAaW,IAEjCjB,MAAOiB,GAAMA,CAIf,CAED,CAaO,SAASC,qBAAsBnB,IAAKoB,OAE1C,MAAMC,SAAWhB,YAAaL,KACxBsB,UAAYF,OAAgBpB,IAAIsB,UAEhCC,KAAQD,UAAUE,MAAQF,UAAUpB,OAAU,EAE9CuB,OAASC,KAAKC,IAAK,EAHXL,UAAUE,MAAQ,GAI1BtB,MAAQwB,KAAKE,IAAKP,SAAUE,KAAQE,OAC1C,MAAO,CAAE,CACRA,OAAQC,KAAKG,MAAOJ,QACpBvB,MAAOwB,KAAKG,MAAO3B,QAGrB,CAIO,SAAS4B,mBAAoB9B,IAAKoB,OAExC,IAAOpB,IAAI+B,SAAY/B,IAAI+B,OAAOC,OAEjC,OAAOb,qBAAsBnB,IAAKoB,OAInC,MAAMa,OAAS,GACTX,UAAYF,OAAgBpB,IAAIsB,UAChCY,eAAiBZ,UAAUE,MAAQ,EACnCW,cAAiBb,UAAUE,MAAQF,UAAUpB,OAAU,EAGvDmB,SAAWhB,YAAaL,KACxBoC,OAAS,GACf,IAAM,MAAMC,SAASrC,IAAI+B,OAAS,CAGjC,MAAMP,MAAEA,MAAKtB,MAAEA,OAAUmC,MACnBC,WAAad,MAAQ,EAErBe,UAAaf,OADAgB,SAAUtC,OAAUA,MAAqB,EAAXmB,SAAeG,QACtB,EAGrCc,WAAaH,cAAgBI,SAAWL,iBAE5CE,OAAOK,KAAM,CAAEC,IAAKhB,KAAKC,IAAKO,eAAgBI,YAAcK,SAAS,IACrEP,OAAOK,KAAM,CAAEC,IAAKhB,KAAKE,IAAKO,aAAcI,UAAYI,SAAS,IAInE,CAGAP,OAAOQ,KAAM,CAAEC,EAAGC,IAEZD,EAAEH,MAAQI,EAAEJ,IAETG,EAAEH,IAAMI,EAAEJ,IAIC,QAAXG,EAAEE,MAAiB,EAAM,GAOlC,IAAIC,aAAe,EACfC,QAAU,KACd,IAAM,MAAMC,SAASd,OAAS,CAE7B,MAAMe,OAASD,MAAMR,IACC,IAAjBM,cAAsBG,SAAWF,SAErChB,OAAOQ,KAAM,CACZhB,OAAQwB,QACR/C,MAAOiD,OAASF,UAKlBD,cAAgBE,MAAMP,QAAU,GAAI,EACpCM,QAAUE,MAEX,CAEA,OAAOlB,MAER","x_google_ignoreList":[0]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"sortUtils.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/build/sortUtils.generated.js"],"sourcesContent":["/********************************************************/\n/* This file is generated from \"sortUtils.template.js\". */\n/********************************************************/\n// reorders `tris` such that for `count` elements after `offset`, elements on the left side of the split\n// will be on the left and elements on the right side of the split will be on the right. returns the index\n// of the first element on the right side, or offset + count if there are no elements on the right side.\nfunction partition( indirectBuffer, index, triangleBounds, offset, count, split ) {\n\n\tlet left = offset;\n\tlet right = offset + count - 1;\n\tconst pos = split.pos;\n\tconst axisOffset = split.axis * 2;\n\tconst boundsOffset = triangleBounds.offset || 0;\n\n\t// hoare partitioning, see e.g. https://en.wikipedia.org/wiki/Quicksort#Hoare_partition_scheme\n\twhile ( true ) {\n\n\t\twhile ( left <= right && triangleBounds[ ( left - boundsOffset ) * 6 + axisOffset ] < pos ) {\n\n\t\t\tleft ++;\n\n\t\t}\n\n\t\t// if a triangle center lies on the partition plane it is considered to be on the right side\n\t\twhile ( left <= right && triangleBounds[ ( right - boundsOffset ) * 6 + axisOffset ] >= pos ) {\n\n\t\t\tright --;\n\n\t\t}\n\n\t\tif ( left < right ) {\n\n\t\t\t// we need to swap all of the information associated with the triangles at index\n\t\t\t// left and right; that's the verts in the geometry index, the bounds,\n\t\t\t// and perhaps the SAH planes\n\n\t\t\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\t\t\tlet t0 = index[ left * 3 + i ];\n\t\t\t\tindex[ left * 3 + i ] = index[ right * 3 + i ];\n\t\t\t\tindex[ right * 3 + i ] = t0;\n\n\t\t\t}\n\n\n\t\t\t// swap bounds\n\t\t\tfor ( let i = 0; i < 6; i ++ ) {\n\n\t\t\t\tconst l = left - boundsOffset;\n\t\t\t\tconst r = right - boundsOffset;\n\t\t\t\tconst tb = triangleBounds[ l * 6 + i ];\n\t\t\t\ttriangleBounds[ l * 6 + i ] = triangleBounds[ r * 6 + i ];\n\t\t\t\ttriangleBounds[ r * 6 + i ] = tb;\n\n\t\t\t}\n\n\t\t\tleft ++;\n\t\t\tright --;\n\n\t\t} else {\n\n\t\t\treturn left;\n\n\t\t}\n\n\t}\n\n}\n\nexport { partition };\n"],"names":["partition","indirectBuffer","index","triangleBounds","offset","count","split","left","right","pos","axisOffset","axis","boundsOffset","i","t0","l","r","tb"],"mappings":"AAMA,SAASA,UAAWC,eAAgBC,MAAOC,eAAgBC,OAAQC,MAAOC,OAEzE,IAAIC,KAAOH,OACPI,MAAQJ,OAASC,MAAQ,EAC7B,MAAMI,IAAMH,MAAMG,IACZC,WAA0B,EAAbJ,MAAMK,KACnBC,aAAeT,eAAeC,QAAU,EAG9C,OAAe,CAEd,KAAQG,MAAQC,OAASL,eAA0C,GAAxBI,KAAOK,cAAqBF,YAAeD,KAErFF,OAKD,KAAQA,MAAQC,OAASL,eAA2C,GAAzBK,MAAQI,cAAqBF,aAAgBD,KAEvFD,QAID,KAAKD,KAAOC,OA+BX,OAAOD,KAzBP,IAAM,IAAIM,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,IAAIC,GAAKZ,MAAc,EAAPK,KAAWM,GAC3BX,MAAc,EAAPK,KAAWM,GAAMX,MAAe,EAARM,MAAYK,GAC3CX,MAAe,EAARM,MAAYK,GAAMC,EAE1B,CAIA,IAAM,IAAID,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAME,EAAIR,KAAOK,aACXI,EAAIR,MAAQI,aACZK,GAAKd,eAAoB,EAAJY,EAAQF,GACnCV,eAAoB,EAAJY,EAAQF,GAAMV,eAAoB,EAAJa,EAAQH,GACtDV,eAAoB,EAAJa,EAAQH,GAAMI,EAE/B,CAEAV,OACAC,OAQF,CAED","x_google_ignoreList":[0]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"sortUtils_indirect.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/build/sortUtils_indirect.generated.js"],"sourcesContent":["/********************************************************/\n/* This file is generated from \"sortUtils.template.js\". */\n/********************************************************/\n// reorders `tris` such that for `count` elements after `offset`, elements on the left side of the split\n// will be on the left and elements on the right side of the split will be on the right. returns the index\n// of the first element on the right side, or offset + count if there are no elements on the right side.\nfunction partition_indirect( indirectBuffer, index, triangleBounds, offset, count, split ) {\n\n\tlet left = offset;\n\tlet right = offset + count - 1;\n\tconst pos = split.pos;\n\tconst axisOffset = split.axis * 2;\n\tconst boundsOffset = triangleBounds.offset || 0;\n\n\t// hoare partitioning, see e.g. https://en.wikipedia.org/wiki/Quicksort#Hoare_partition_scheme\n\twhile ( true ) {\n\n\t\twhile ( left <= right && triangleBounds[ ( left - boundsOffset ) * 6 + axisOffset ] < pos ) {\n\n\t\t\tleft ++;\n\n\t\t}\n\n\t\t// if a triangle center lies on the partition plane it is considered to be on the right side\n\t\twhile ( left <= right && triangleBounds[ ( right - boundsOffset ) * 6 + axisOffset ] >= pos ) {\n\n\t\t\tright --;\n\n\t\t}\n\n\t\tif ( left < right ) {\n\n\t\t\t// we need to swap all of the information associated with the triangles at index\n\t\t\t// left and right; that's the verts in the geometry index, the bounds,\n\t\t\t// and perhaps the SAH planes\n\t\t\tlet t = indirectBuffer[ left ];\n\t\t\tindirectBuffer[ left ] = indirectBuffer[ right ];\n\t\t\tindirectBuffer[ right ] = t;\n\n\n\t\t\t// swap bounds\n\t\t\tfor ( let i = 0; i < 6; i ++ ) {\n\n\t\t\t\tconst l = left - boundsOffset;\n\t\t\t\tconst r = right - boundsOffset;\n\t\t\t\tconst tb = triangleBounds[ l * 6 + i ];\n\t\t\t\ttriangleBounds[ l * 6 + i ] = triangleBounds[ r * 6 + i ];\n\t\t\t\ttriangleBounds[ r * 6 + i ] = tb;\n\n\t\t\t}\n\n\t\t\tleft ++;\n\t\t\tright --;\n\n\t\t} else {\n\n\t\t\treturn left;\n\n\t\t}\n\n\t}\n\n}\n\nexport { partition_indirect };\n"],"names":["partition_indirect","indirectBuffer","index","triangleBounds","offset","count","split","left","right","pos","axisOffset","axis","boundsOffset","t","i","l","r","tb"],"mappings":"AAMA,SAASA,mBAAoBC,eAAgBC,MAAOC,eAAgBC,OAAQC,MAAOC,OAElF,IAAIC,KAAOH,OACPI,MAAQJ,OAASC,MAAQ,EAC7B,MAAMI,IAAMH,MAAMG,IACZC,WAA0B,EAAbJ,MAAMK,KACnBC,aAAeT,eAAeC,QAAU,EAG9C,OAAe,CAEd,KAAQG,MAAQC,OAASL,eAA0C,GAAxBI,KAAOK,cAAqBF,YAAeD,KAErFF,OAKD,KAAQA,MAAQC,OAASL,eAA2C,GAAzBK,MAAQI,cAAqBF,aAAgBD,KAEvFD,QAID,KAAKD,KAAOC,OA0BX,OAAOD,KA1BY,CAKnB,IAAIM,EAAIZ,eAAgBM,MACxBN,eAAgBM,MAASN,eAAgBO,OACzCP,eAAgBO,OAAUK,EAI1B,IAAM,IAAIC,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAMC,EAAIR,KAAOK,aACXI,EAAIR,MAAQI,aACZK,GAAKd,eAAoB,EAAJY,EAAQD,GACnCX,eAAoB,EAAJY,EAAQD,GAAMX,eAAoB,EAAJa,EAAQF,GACtDX,eAAoB,EAAJa,EAAQF,GAAMG,EAE/B,CAEAV,OACAC,OAED,CAMD,CAED","x_google_ignoreList":[0]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"splitUtils.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/build/splitUtils.js"],"sourcesContent":["import { getLongestEdgeIndex, computeSurfaceArea, copyBounds, unionBounds, expandByTriangleBounds } from '../../utils/ArrayBoxUtilities.js';\nimport { CENTER, AVERAGE, SAH, TRIANGLE_INTERSECT_COST, TRAVERSAL_COST } from '../Constants.js';\n\nconst BIN_COUNT = 32;\nconst binsSort = ( a, b ) => a.candidate - b.candidate;\nconst sahBins = /* @__PURE__ */ new Array( BIN_COUNT ).fill().map( () => {\n\n\treturn {\n\n\t\tcount: 0,\n\t\tbounds: new Float32Array( 6 ),\n\t\trightCacheBounds: new Float32Array( 6 ),\n\t\tleftCacheBounds: new Float32Array( 6 ),\n\t\tcandidate: 0,\n\n\t};\n\n} );\nconst leftBounds = /* @__PURE__ */ new Float32Array( 6 );\n\nexport function getOptimalSplit( nodeBoundingData, centroidBoundingData, triangleBounds, offset, count, strategy ) {\n\n\tlet axis = - 1;\n\tlet pos = 0;\n\n\t// Center\n\tif ( strategy === CENTER ) {\n\n\t\taxis = getLongestEdgeIndex( centroidBoundingData );\n\t\tif ( axis !== - 1 ) {\n\n\t\t\tpos = ( centroidBoundingData[ axis ] + centroidBoundingData[ axis + 3 ] ) / 2;\n\n\t\t}\n\n\t} else if ( strategy === AVERAGE ) {\n\n\t\taxis = getLongestEdgeIndex( nodeBoundingData );\n\t\tif ( axis !== - 1 ) {\n\n\t\t\tpos = getAverage( triangleBounds, offset, count, axis );\n\n\t\t}\n\n\t} else if ( strategy === SAH ) {\n\n\t\tconst rootSurfaceArea = computeSurfaceArea( nodeBoundingData );\n\t\tlet bestCost = TRIANGLE_INTERSECT_COST * count;\n\n\t\t// iterate over all axes\n\t\tconst boundsOffset = triangleBounds.offset || 0;\n\t\tconst cStart = ( offset - boundsOffset ) * 6;\n\t\tconst cEnd = ( offset + count - boundsOffset ) * 6;\n\t\tfor ( let a = 0; a < 3; a ++ ) {\n\n\t\t\tconst axisLeft = centroidBoundingData[ a ];\n\t\t\tconst axisRight = centroidBoundingData[ a + 3 ];\n\t\t\tconst axisLength = axisRight - axisLeft;\n\t\t\tconst binWidth = axisLength / BIN_COUNT;\n\n\t\t\t// If we have fewer triangles than we're planning to split then just check all\n\t\t\t// the triangle positions because it will be faster.\n\t\t\tif ( count < BIN_COUNT / 4 ) {\n\n\t\t\t\t// initialize the bin candidates\n\t\t\t\tconst truncatedBins = [ ...sahBins ];\n\t\t\t\ttruncatedBins.length = count;\n\n\t\t\t\t// set the candidates\n\t\t\t\tlet b = 0;\n\t\t\t\tfor ( let c = cStart; c < cEnd; c += 6, b ++ ) {\n\n\t\t\t\t\tconst bin = truncatedBins[ b ];\n\t\t\t\t\tbin.candidate = triangleBounds[ c + 2 * a ];\n\t\t\t\t\tbin.count = 0;\n\n\t\t\t\t\tconst {\n\t\t\t\t\t\tbounds,\n\t\t\t\t\t\tleftCacheBounds,\n\t\t\t\t\t\trightCacheBounds,\n\t\t\t\t\t} = bin;\n\t\t\t\t\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\t\t\t\t\trightCacheBounds[ d ] = Infinity;\n\t\t\t\t\t\trightCacheBounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t\tleftCacheBounds[ d ] = Infinity;\n\t\t\t\t\t\tleftCacheBounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t\tbounds[ d ] = Infinity;\n\t\t\t\t\t\tbounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t}\n\n\t\t\t\t\texpandByTriangleBounds( c, triangleBounds, bounds );\n\n\t\t\t\t}\n\n\t\t\t\ttruncatedBins.sort( binsSort );\n\n\t\t\t\t// remove redundant splits\n\t\t\t\tlet splitCount = count;\n\t\t\t\tfor ( let bi = 0; bi < splitCount; bi ++ ) {\n\n\t\t\t\t\tconst bin = truncatedBins[ bi ];\n\t\t\t\t\twhile ( bi + 1 < splitCount && truncatedBins[ bi + 1 ].candidate === bin.candidate ) {\n\n\t\t\t\t\t\ttruncatedBins.splice( bi + 1, 1 );\n\t\t\t\t\t\tsplitCount --;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// find the appropriate bin for each triangle and expand the bounds.\n\t\t\t\tfor ( let c = cStart; c < cEnd; c += 6 ) {\n\n\t\t\t\t\tconst center = triangleBounds[ c + 2 * a ];\n\t\t\t\t\tfor ( let bi = 0; bi < splitCount; bi ++ ) {\n\n\t\t\t\t\t\tconst bin = truncatedBins[ bi ];\n\t\t\t\t\t\tif ( center >= bin.candidate ) {\n\n\t\t\t\t\t\t\texpandByTriangleBounds( c, triangleBounds, bin.rightCacheBounds );\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\texpandByTriangleBounds( c, triangleBounds, bin.leftCacheBounds );\n\t\t\t\t\t\t\tbin.count ++;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// expand all the bounds\n\t\t\t\tfor ( let bi = 0; bi < splitCount; bi ++ ) {\n\n\t\t\t\t\tconst bin = truncatedBins[ bi ];\n\t\t\t\t\tconst leftCount = bin.count;\n\t\t\t\t\tconst rightCount = count - bin.count;\n\n\t\t\t\t\t// check the cost of this split\n\t\t\t\t\tconst leftBounds = bin.leftCacheBounds;\n\t\t\t\t\tconst rightBounds = bin.rightCacheBounds;\n\n\t\t\t\t\tlet leftProb = 0;\n\t\t\t\t\tif ( leftCount !== 0 ) {\n\n\t\t\t\t\t\tleftProb = computeSurfaceArea( leftBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tlet rightProb = 0;\n\t\t\t\t\tif ( rightCount !== 0 ) {\n\n\t\t\t\t\t\trightProb = computeSurfaceArea( rightBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tconst cost = TRAVERSAL_COST + TRIANGLE_INTERSECT_COST * (\n\t\t\t\t\t\tleftProb * leftCount + rightProb * rightCount\n\t\t\t\t\t);\n\n\t\t\t\t\tif ( cost < bestCost ) {\n\n\t\t\t\t\t\taxis = a;\n\t\t\t\t\t\tbestCost = cost;\n\t\t\t\t\t\tpos = bin.candidate;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t} else {\n\n\t\t\t\t// reset the bins\n\t\t\t\tfor ( let i = 0; i < BIN_COUNT; i ++ ) {\n\n\t\t\t\t\tconst bin = sahBins[ i ];\n\t\t\t\t\tbin.count = 0;\n\t\t\t\t\tbin.candidate = axisLeft + binWidth + i * binWidth;\n\n\t\t\t\t\tconst bounds = bin.bounds;\n\t\t\t\t\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\t\t\t\t\tbounds[ d ] = Infinity;\n\t\t\t\t\t\tbounds[ d + 3 ] = - Infinity;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// iterate over all center positions\n\t\t\t\tfor ( let c = cStart; c < cEnd; c += 6 ) {\n\n\t\t\t\t\tconst triCenter = triangleBounds[ c + 2 * a ];\n\t\t\t\t\tconst relativeCenter = triCenter - axisLeft;\n\n\t\t\t\t\t// in the partition function if the centroid lies on the split plane then it is\n\t\t\t\t\t// considered to be on the right side of the split\n\t\t\t\t\tlet binIndex = ~ ~ ( relativeCenter / binWidth );\n\t\t\t\t\tif ( binIndex >= BIN_COUNT ) binIndex = BIN_COUNT - 1;\n\n\t\t\t\t\tconst bin = sahBins[ binIndex ];\n\t\t\t\t\tbin.count ++;\n\n\t\t\t\t\texpandByTriangleBounds( c, triangleBounds, bin.bounds );\n\n\t\t\t\t}\n\n\t\t\t\t// cache the unioned bounds from right to left so we don't have to regenerate them each time\n\t\t\t\tconst lastBin = sahBins[ BIN_COUNT - 1 ];\n\t\t\t\tcopyBounds( lastBin.bounds, lastBin.rightCacheBounds );\n\t\t\t\tfor ( let i = BIN_COUNT - 2; i >= 0; i -- ) {\n\n\t\t\t\t\tconst bin = sahBins[ i ];\n\t\t\t\t\tconst nextBin = sahBins[ i + 1 ];\n\t\t\t\t\tunionBounds( bin.bounds, nextBin.rightCacheBounds, bin.rightCacheBounds );\n\n\t\t\t\t}\n\n\t\t\t\tlet leftCount = 0;\n\t\t\t\tfor ( let i = 0; i < BIN_COUNT - 1; i ++ ) {\n\n\t\t\t\t\tconst bin = sahBins[ i ];\n\t\t\t\t\tconst binCount = bin.count;\n\t\t\t\t\tconst bounds = bin.bounds;\n\n\t\t\t\t\tconst nextBin = sahBins[ i + 1 ];\n\t\t\t\t\tconst rightBounds = nextBin.rightCacheBounds;\n\n\t\t\t\t\t// don't do anything with the bounds if the new bounds have no triangles\n\t\t\t\t\tif ( binCount !== 0 ) {\n\n\t\t\t\t\t\tif ( leftCount === 0 ) {\n\n\t\t\t\t\t\t\tcopyBounds( bounds, leftBounds );\n\n\t\t\t\t\t\t} else {\n\n\t\t\t\t\t\t\tunionBounds( bounds, leftBounds, leftBounds );\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t\tleftCount += binCount;\n\n\t\t\t\t\t// check the cost of this split\n\t\t\t\t\tlet leftProb = 0;\n\t\t\t\t\tlet rightProb = 0;\n\n\t\t\t\t\tif ( leftCount !== 0 ) {\n\n\t\t\t\t\t\tleftProb = computeSurfaceArea( leftBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tconst rightCount = count - leftCount;\n\t\t\t\t\tif ( rightCount !== 0 ) {\n\n\t\t\t\t\t\trightProb = computeSurfaceArea( rightBounds ) / rootSurfaceArea;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tconst cost = TRAVERSAL_COST + TRIANGLE_INTERSECT_COST * (\n\t\t\t\t\t\tleftProb * leftCount + rightProb * rightCount\n\t\t\t\t\t);\n\n\t\t\t\t\tif ( cost < bestCost ) {\n\n\t\t\t\t\t\taxis = a;\n\t\t\t\t\t\tbestCost = cost;\n\t\t\t\t\t\tpos = bin.candidate;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t} else {\n\n\t\tconsole.warn( `MeshBVH: Invalid build strategy value ${ strategy } used.` );\n\n\t}\n\n\treturn { axis, pos };\n\n}\n\n// returns the average coordinate on the specified axis of the all the provided triangles\nfunction getAverage( triangleBounds, offset, count, axis ) {\n\n\tlet avg = 0;\n\tconst boundsOffset = triangleBounds.offset;\n\tfor ( let i = offset, end = offset + count; i < end; i ++ ) {\n\n\t\tavg += triangleBounds[ ( i - boundsOffset ) * 6 + axis * 2 ];\n\n\t}\n\n\treturn avg / count;\n\n}\n"],"names":["binsSort","a","b","candidate","sahBins","Array","fill","map","count","bounds","Float32Array","rightCacheBounds","leftCacheBounds","leftBounds","getOptimalSplit","nodeBoundingData","centroidBoundingData","triangleBounds","offset","strategy","axis","pos","CENTER","getLongestEdgeIndex","AVERAGE","avg","boundsOffset","i","end","getAverage","SAH","rootSurfaceArea","computeSurfaceArea","bestCost","TRIANGLE_INTERSECT_COST","cStart","cEnd","axisLeft","binWidth","BIN_COUNT","truncatedBins","length","c","bin","d","Infinity","expandByTriangleBounds","sort","splitCount","bi","splice","center","leftCount","rightCount","rightBounds","leftProb","rightProb","cost","TRAVERSAL_COST","binIndex","lastBin","copyBounds","unionBounds","binCount","console","warn"],"mappings":"0NAGA,MACMA,SAAW,CAAEC,EAAGC,IAAOD,EAAEE,UAAYD,EAAEC,UACvCC,QAA0B,IAAIC,MAFlB,IAEqCC,OAAOC,IAAK,KAE3D,CAENC,MAAO,EACPC,OAAQ,IAAIC,aAAc,GAC1BC,iBAAkB,IAAID,aAAc,GACpCE,gBAAiB,IAAIF,aAAc,GACnCP,UAAW,KAKPU,WAA6B,IAAIH,aAAc,GAE9C,SAASI,gBAAiBC,iBAAkBC,qBAAsBC,eAAgBC,OAAQV,MAAOW,UAEvG,IAAIC,MAAO,EACPC,IAAM,EAGV,GAAKF,WAAaG,OAEjBF,KAAOG,oBAAqBP,uBACd,IAATI,OAEJC,KAAQL,qBAAsBI,MAASJ,qBAAsBI,KAAO,IAAQ,QAIvE,GAAKD,WAAaK,QAExBJ,KAAOG,oBAAqBR,mBACd,IAATK,OAEJC,IAgQH,SAAqBJ,eAAgBC,OAAQV,MAAOY,MAEnD,IAAIK,IAAM,EACV,MAAMC,aAAeT,eAAeC,OACpC,IAAM,IAAIS,EAAIT,OAAQU,IAAMV,OAASV,MAAOmB,EAAIC,IAAKD,IAEpDF,KAAOR,eAAuC,GAArBU,EAAID,cAA4B,EAAPN,MAInD,OAAOK,IAAMjB,KAEd,CA5QSqB,CAAYZ,eAAgBC,OAAQV,MAAOY,YAI5C,GAAKD,WAAaW,IAAM,CAE9B,MAAMC,gBAAkBC,mBAAoBjB,kBAC5C,IAAIkB,SAAWC,wBAA0B1B,MAGzC,MAAMkB,aAAeT,eAAeC,QAAU,EACxCiB,OAAqC,GAA1BjB,OAASQ,cACpBU,KAA2C,GAAlClB,OAASV,MAAQkB,cAChC,IAAM,IAAIzB,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAMoC,SAAWrB,qBAAsBf,GAGjCqC,UAFYtB,qBAAsBf,EAAI,GACboC,UAtDhB,GA2Df,GAAK7B,MAAQ+B,EAAgB,CAG5B,MAAMC,cAAgB,IAAKpC,SAC3BoC,cAAcC,OAASjC,MAGvB,IAAIN,EAAI,EACR,IAAM,IAAIwC,EAAIP,OAAQO,EAAIN,KAAMM,GAAK,EAAGxC,IAAO,CAE9C,MAAMyC,IAAMH,cAAetC,GAC3ByC,IAAIxC,UAAYc,eAAgByB,EAAI,EAAIzC,GACxC0C,IAAInC,MAAQ,EAEZ,MAAMC,OACLA,OAAMG,gBACNA,gBAAeD,iBACfA,kBACGgC,IACJ,IAAM,IAAIC,EAAI,EAAGA,EAAI,EAAGA,IAEvBjC,iBAAkBiC,GAAMC,IACxBlC,iBAAkBiC,EAAI,IAAM,IAE5BhC,gBAAiBgC,GAAMC,IACvBjC,gBAAiBgC,EAAI,IAAM,IAE3BnC,OAAQmC,GAAMC,IACdpC,OAAQmC,EAAI,IAAM,IAInBE,uBAAwBJ,EAAGzB,eAAgBR,OAE5C,CAEA+B,cAAcO,KAAM/C,UAGpB,IAAIgD,WAAaxC,MACjB,IAAM,IAAIyC,GAAK,EAAGA,GAAKD,WAAYC,KAAQ,CAE1C,MAAMN,IAAMH,cAAeS,IAC3B,KAAQA,GAAK,EAAID,YAAcR,cAAeS,GAAK,GAAI9C,YAAcwC,IAAIxC,WAExEqC,cAAcU,OAAQD,GAAK,EAAG,GAC9BD,YAIF,CAGA,IAAM,IAAIN,EAAIP,OAAQO,EAAIN,KAAMM,GAAK,EAAI,CAExC,MAAMS,OAASlC,eAAgByB,EAAI,EAAIzC,GACvC,IAAM,IAAIgD,GAAK,EAAGA,GAAKD,WAAYC,KAAQ,CAE1C,MAAMN,IAAMH,cAAeS,IACtBE,QAAUR,IAAIxC,UAElB2C,uBAAwBJ,EAAGzB,eAAgB0B,IAAIhC,mBAI/CmC,uBAAwBJ,EAAGzB,eAAgB0B,IAAI/B,iBAC/C+B,IAAInC,QAIN,CAED,CAGA,IAAM,IAAIyC,GAAK,EAAGA,GAAKD,WAAYC,KAAQ,CAE1C,MAAMN,IAAMH,cAAeS,IACrBG,UAAYT,IAAInC,MAChB6C,WAAa7C,MAAQmC,IAAInC,MAIzB8C,YAAcX,IAAIhC,iBAExB,IAAI4C,SAAW,EACI,IAAdH,YAEJG,SAAWvB,mBANOW,IAAI/B,iBAMwBmB,iBAI/C,IAAIyB,UAAY,EACI,IAAfH,aAEJG,UAAYxB,mBAAoBsB,aAAgBvB,iBAIjD,MAAM0B,KAAOC,eAAiBxB,yBAC7BqB,SAAWH,UAAYI,UAAYH,YAG/BI,KAAOxB,WAEXb,KAAOnB,EACPgC,SAAWwB,KACXpC,IAAMsB,IAAIxC,UAIZ,CAED,KAAO,CAGN,IAAM,IAAIwB,EAAI,EAAGA,EA/KH,GA+KkBA,IAAO,CAEtC,MAAMgB,IAAMvC,QAASuB,GACrBgB,IAAInC,MAAQ,EACZmC,IAAIxC,UAAYkC,SAAWC,SAAWX,EAAIW,SAE1C,MAAM7B,OAASkC,IAAIlC,OACnB,IAAM,IAAImC,EAAI,EAAGA,EAAI,EAAGA,IAEvBnC,OAAQmC,GAAMC,IACdpC,OAAQmC,EAAI,IAAM,GAIpB,CAGA,IAAM,IAAIF,EAAIP,OAAQO,EAAIN,KAAMM,GAAK,EAAI,CAOxC,IAAIiB,aALc1C,eAAgByB,EAAI,EAAIzC,GACPoC,UAIGC,UACjCqB,UAxMQ,KAwMgBA,SAAWpB,IAExC,MAAMI,IAAMvC,QAASuD,UACrBhB,IAAInC,QAEJsC,uBAAwBJ,EAAGzB,eAAgB0B,IAAIlC,OAEhD,CAGA,MAAMmD,QAAUxD,QAASmC,IACzBsB,WAAYD,QAAQnD,OAAQmD,QAAQjD,kBACpC,IAAM,IAAIgB,EAAIY,GAAeZ,GAAK,EAAGA,IAAO,CAE3C,MAAMgB,IAAMvC,QAASuB,GAErBmC,YAAanB,IAAIlC,OADDL,QAASuB,EAAI,GACIhB,iBAAkBgC,IAAIhC,iBAExD,CAEA,IAAIyC,UAAY,EAChB,IAAM,IAAIzB,EAAI,EAAGA,EAAIY,GAAeZ,IAAO,CAE1C,MAAMgB,IAAMvC,QAASuB,GACfoC,SAAWpB,IAAInC,MACfC,OAASkC,IAAIlC,OAGb6C,YADUlD,QAASuB,EAAI,GACDhB,iBAGV,IAAboD,WAEe,IAAdX,UAEJS,WAAYpD,OAAQI,YAIpBiD,YAAarD,OAAQI,WAAYA,aAMnCuC,WAAaW,SAGb,IAAIR,SAAW,EACXC,UAAY,EAEG,IAAdJ,YAEJG,SAAWvB,mBAAoBnB,YAAekB,iBAI/C,MAAMsB,WAAa7C,MAAQ4C,UACP,IAAfC,aAEJG,UAAYxB,mBAAoBsB,aAAgBvB,iBAIjD,MAAM0B,KAAOC,eAAiBxB,yBAC7BqB,SAAWH,UAAYI,UAAYH,YAG/BI,KAAOxB,WAEXb,KAAOnB,EACPgC,SAAWwB,KACXpC,IAAMsB,IAAIxC,UAIZ,CAED,CAED,CAED,MAEC6D,QAAQC,KAAM,yCAA0C9C,kBAIzD,MAAO,CAAEC,UAAMC,QAEhB","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-import"../../../../three/build/three.module.js";import{BufferStack}from"../utils/BufferStack.js";import{BOUNDING_DATA_INDEX,IS_LEAF,OFFSET,COUNT,RIGHT_NODE,LEFT_NODE}from"../utils/nodeBufferUtils.js";import{arrayToBox}from"../../utils/ArrayBoxUtilities.js";import{PrimitivePool}from"../../utils/PrimitivePool.js";import{BYTES_PER_NODE,UINT32_PER_NODE}from"../Constants.js";import{Matrix4,Box3}from"../../../../three/build/three.core.js";const _bufferStack1=new BufferStack.constructor,_bufferStack2=new BufferStack.constructor,_boxPool=new PrimitivePool(()=>new Box3),_leftBox1=new Box3,_rightBox1=new Box3,_leftBox2=new Box3,_rightBox2=new Box3;let _active=!1;function bvhcast(bvh,otherBvh,matrixToLocal,intersectsRanges){if(_active)throw new Error("MeshBVH: Recursive calls to bvhcast not supported.");_active=!0;const roots=bvh._roots,otherRoots=otherBvh._roots;let result,nodeOffset1=0,nodeOffset2=0;const invMat=(new Matrix4).copy(matrixToLocal).invert();for(let i=0,il=roots.length;i<il;i++){_bufferStack1.setBuffer(roots[i]),nodeOffset2=0;const localBox=_boxPool.getPrimitive();arrayToBox(BOUNDING_DATA_INDEX(0),_bufferStack1.float32Array,localBox),localBox.applyMatrix4(invMat);for(let j=0,jl=otherRoots.length;j<jl&&(_bufferStack2.setBuffer(otherRoots[j]),result=_traverse(0,0,matrixToLocal,invMat,intersectsRanges,nodeOffset1,nodeOffset2,0,0,localBox),_bufferStack2.clearBuffer(),nodeOffset2+=otherRoots[j].byteLength/BYTES_PER_NODE,!result);j++);if(_boxPool.releasePrimitive(localBox),_bufferStack1.clearBuffer(),nodeOffset1+=roots[i].byteLength/BYTES_PER_NODE,result)break}return _active=!1,result}function _traverse(node1Index32,node2Index32,matrix2to1,matrix1to2,intersectsRangesFunc,node1IndexOffset=0,node2IndexOffset=0,depth1=0,depth2=0,currBox=null,reversed=!1){let bufferStack1,bufferStack2;reversed?(bufferStack1=_bufferStack2,bufferStack2=_bufferStack1):(bufferStack1=_bufferStack1,bufferStack2=_bufferStack2);const float32Array1=bufferStack1.float32Array,uint32Array1=bufferStack1.uint32Array,uint16Array1=bufferStack1.uint16Array,float32Array2=bufferStack2.float32Array,uint32Array2=bufferStack2.uint32Array,uint16Array2=bufferStack2.uint16Array,node2Index16=2*node2Index32,isLeaf1=IS_LEAF(2*node1Index32,uint16Array1),isLeaf2=IS_LEAF(node2Index16,uint16Array2);let result=!1;if(isLeaf2&&isLeaf1)result=reversed?intersectsRangesFunc(OFFSET(node2Index32,uint32Array2),COUNT(2*node2Index32,uint16Array2),OFFSET(node1Index32,uint32Array1),COUNT(2*node1Index32,uint16Array1),depth2,node2IndexOffset+node2Index32/UINT32_PER_NODE,depth1,node1IndexOffset+node1Index32/UINT32_PER_NODE):intersectsRangesFunc(OFFSET(node1Index32,uint32Array1),COUNT(2*node1Index32,uint16Array1),OFFSET(node2Index32,uint32Array2),COUNT(2*node2Index32,uint16Array2),depth1,node1IndexOffset+node1Index32/UINT32_PER_NODE,depth2,node2IndexOffset+node2Index32/UINT32_PER_NODE);else if(isLeaf2){const newBox=_boxPool.getPrimitive();arrayToBox(BOUNDING_DATA_INDEX(node2Index32),float32Array2,newBox),newBox.applyMatrix4(matrix2to1);const cl1=LEFT_NODE(node1Index32),cr1=RIGHT_NODE(node1Index32,uint32Array1);arrayToBox(BOUNDING_DATA_INDEX(cl1),float32Array1,_leftBox1),arrayToBox(BOUNDING_DATA_INDEX(cr1),float32Array1,_rightBox1);const intersectCl1=newBox.intersectsBox(_leftBox1),intersectCr1=newBox.intersectsBox(_rightBox1);result=intersectCl1&&_traverse(node2Index32,cl1,matrix1to2,matrix2to1,intersectsRangesFunc,node2IndexOffset,node1IndexOffset,depth2,depth1+1,newBox,!reversed)||intersectCr1&&_traverse(node2Index32,cr1,matrix1to2,matrix2to1,intersectsRangesFunc,node2IndexOffset,node1IndexOffset,depth2,depth1+1,newBox,!reversed),_boxPool.releasePrimitive(newBox)}else{const cl2=LEFT_NODE(node2Index32),cr2=RIGHT_NODE(node2Index32,uint32Array2);arrayToBox(BOUNDING_DATA_INDEX(cl2),float32Array2,_leftBox2),arrayToBox(BOUNDING_DATA_INDEX(cr2),float32Array2,_rightBox2);const leftIntersects=currBox.intersectsBox(_leftBox2),rightIntersects=currBox.intersectsBox(_rightBox2);if(leftIntersects&&rightIntersects)result=_traverse(node1Index32,cl2,matrix2to1,matrix1to2,intersectsRangesFunc,node1IndexOffset,node2IndexOffset,depth1,depth2+1,currBox,reversed)||_traverse(node1Index32,cr2,matrix2to1,matrix1to2,intersectsRangesFunc,node1IndexOffset,node2IndexOffset,depth1,depth2+1,currBox,reversed);else if(leftIntersects)if(isLeaf1)result=_traverse(node1Index32,cl2,matrix2to1,matrix1to2,intersectsRangesFunc,node1IndexOffset,node2IndexOffset,depth1,depth2+1,currBox,reversed);else{const newBox=_boxPool.getPrimitive();newBox.copy(_leftBox2).applyMatrix4(matrix2to1);const cl1=LEFT_NODE(node1Index32),cr1=RIGHT_NODE(node1Index32,uint32Array1);arrayToBox(BOUNDING_DATA_INDEX(cl1),float32Array1,_leftBox1),arrayToBox(BOUNDING_DATA_INDEX(cr1),float32Array1,_rightBox1);const intersectCl1=newBox.intersectsBox(_leftBox1),intersectCr1=newBox.intersectsBox(_rightBox1);result=intersectCl1&&_traverse(cl2,cl1,matrix1to2,matrix2to1,intersectsRangesFunc,node2IndexOffset,node1IndexOffset,depth2,depth1+1,newBox,!reversed)||intersectCr1&&_traverse(cl2,cr1,matrix1to2,matrix2to1,intersectsRangesFunc,node2IndexOffset,node1IndexOffset,depth2,depth1+1,newBox,!reversed),_boxPool.releasePrimitive(newBox)}else if(rightIntersects)if(isLeaf1)result=_traverse(node1Index32,cr2,matrix2to1,matrix1to2,intersectsRangesFunc,node1IndexOffset,node2IndexOffset,depth1,depth2+1,currBox,reversed);else{const newBox=_boxPool.getPrimitive();newBox.copy(_rightBox2).applyMatrix4(matrix2to1);const cl1=LEFT_NODE(node1Index32),cr1=RIGHT_NODE(node1Index32,uint32Array1);arrayToBox(BOUNDING_DATA_INDEX(cl1),float32Array1,_leftBox1),arrayToBox(BOUNDING_DATA_INDEX(cr1),float32Array1,_rightBox1);const intersectCl1=newBox.intersectsBox(_leftBox1),intersectCr1=newBox.intersectsBox(_rightBox1);result=intersectCl1&&_traverse(cr2,cl1,matrix1to2,matrix2to1,intersectsRangesFunc,node2IndexOffset,node1IndexOffset,depth2,depth1+1,newBox,!reversed)||intersectCr1&&_traverse(cr2,cr1,matrix1to2,matrix2to1,intersectsRangesFunc,node2IndexOffset,node1IndexOffset,depth2,depth1+1,newBox,!reversed),_boxPool.releasePrimitive(newBox)}}return result}export{bvhcast};
-//# sourceMappingURL=bvhcast.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"bvhcast.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/bvhcast.js"],"sourcesContent":["import { Box3, Matrix4 } from 'three';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { BOUNDING_DATA_INDEX, COUNT, IS_LEAF, LEFT_NODE, OFFSET, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { PrimitivePool } from '../../utils/PrimitivePool.js';\nimport { BYTES_PER_NODE, UINT32_PER_NODE } from '../Constants.js';\n\nconst _bufferStack1 = /* @__PURE__ */ new BufferStack.constructor();\nconst _bufferStack2 = /* @__PURE__ */ new BufferStack.constructor();\nconst _boxPool = /* @__PURE__ */ new PrimitivePool( () => new Box3() );\nconst _leftBox1 = /* @__PURE__ */ new Box3();\nconst _rightBox1 = /* @__PURE__ */ new Box3();\n\nconst _leftBox2 = /* @__PURE__ */ new Box3();\nconst _rightBox2 = /* @__PURE__ */ new Box3();\n\nlet _active = false;\n\nexport function bvhcast( bvh, otherBvh, matrixToLocal, intersectsRanges ) {\n\n\tif ( _active ) {\n\n\t\tthrow new Error( 'MeshBVH: Recursive calls to bvhcast not supported.' );\n\n\t}\n\n\t_active = true;\n\n\tconst roots = bvh._roots;\n\tconst otherRoots = otherBvh._roots;\n\tlet result;\n\tlet nodeOffset1 = 0;\n\tlet nodeOffset2 = 0;\n\tconst invMat = new Matrix4().copy( matrixToLocal ).invert();\n\n\t// iterate over the first set of roots\n\tfor ( let i = 0, il = roots.length; i < il; i ++ ) {\n\n\t\t_bufferStack1.setBuffer( roots[ i ] );\n\t\tnodeOffset2 = 0;\n\n\t\t// prep the initial root box\n\t\tconst localBox = _boxPool.getPrimitive();\n\t\tarrayToBox( BOUNDING_DATA_INDEX( 0 ), _bufferStack1.float32Array, localBox );\n\t\tlocalBox.applyMatrix4( invMat );\n\n\t\t// iterate over the second set of roots\n\t\tfor ( let j = 0, jl = otherRoots.length; j < jl; j ++ ) {\n\n\t\t\t_bufferStack2.setBuffer( otherRoots[ j ] );\n\n\t\t\tresult = _traverse(\n\t\t\t\t0, 0, matrixToLocal, invMat, intersectsRanges,\n\t\t\t\tnodeOffset1, nodeOffset2, 0, 0,\n\t\t\t\tlocalBox,\n\t\t\t);\n\n\t\t\t_bufferStack2.clearBuffer();\n\t\t\tnodeOffset2 += otherRoots[ j ].byteLength / BYTES_PER_NODE;\n\n\t\t\tif ( result ) {\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\t// release stack info\n\t\t_boxPool.releasePrimitive( localBox );\n\t\t_bufferStack1.clearBuffer();\n\t\tnodeOffset1 += roots[ i ].byteLength / BYTES_PER_NODE;\n\n\t\tif ( result ) {\n\n\t\t\tbreak;\n\n\t\t}\n\n\t}\n\n\t_active = false;\n\treturn result;\n\n}\n\nfunction _traverse(\n\tnode1Index32,\n\tnode2Index32,\n\tmatrix2to1,\n\tmatrix1to2,\n\tintersectsRangesFunc,\n\n\t// offsets for ids\n\tnode1IndexOffset = 0,\n\tnode2IndexOffset = 0,\n\n\t// tree depth\n\tdepth1 = 0,\n\tdepth2 = 0,\n\n\tcurrBox = null,\n\treversed = false,\n\n) {\n\n\t// get the buffer stacks associated with the current indices\n\tlet bufferStack1, bufferStack2;\n\tif ( reversed ) {\n\n\t\tbufferStack1 = _bufferStack2;\n\t\tbufferStack2 = _bufferStack1;\n\n\t} else {\n\n\t\tbufferStack1 = _bufferStack1;\n\t\tbufferStack2 = _bufferStack2;\n\n\t}\n\n\t// get the local instances of the typed buffers\n\tconst\n\t\tfloat32Array1 = bufferStack1.float32Array,\n\t\tuint32Array1 = bufferStack1.uint32Array,\n\t\tuint16Array1 = bufferStack1.uint16Array,\n\t\tfloat32Array2 = bufferStack2.float32Array,\n\t\tuint32Array2 = bufferStack2.uint32Array,\n\t\tuint16Array2 = bufferStack2.uint16Array;\n\n\tconst node1Index16 = node1Index32 * 2;\n\tconst node2Index16 = node2Index32 * 2;\n\tconst isLeaf1 = IS_LEAF( node1Index16, uint16Array1 );\n\tconst isLeaf2 = IS_LEAF( node2Index16, uint16Array2 );\n\tlet result = false;\n\tif ( isLeaf2 && isLeaf1 ) {\n\n\t\t// if both bounds are leaf nodes then fire the callback if the boxes intersect\n\t\t// Note the \"nodeIndex\" values are just intended to be used as unique identifiers in the tree and\n\t\t// not used for accessing data\n\t\tif ( reversed ) {\n\n\t\t\tresult = intersectsRangesFunc(\n\t\t\t\tOFFSET( node2Index32, uint32Array2 ), COUNT( node2Index32 * 2, uint16Array2 ),\n\t\t\t\tOFFSET( node1Index32, uint32Array1 ), COUNT( node1Index32 * 2, uint16Array1 ),\n\t\t\t\tdepth2, node2IndexOffset + node2Index32 / UINT32_PER_NODE,\n\t\t\t\tdepth1, node1IndexOffset + node1Index32 / UINT32_PER_NODE,\n\t\t\t);\n\n\t\t} else {\n\n\t\t\tresult = intersectsRangesFunc(\n\t\t\t\tOFFSET( node1Index32, uint32Array1 ), COUNT( node1Index32 * 2, uint16Array1 ),\n\t\t\t\tOFFSET( node2Index32, uint32Array2 ), COUNT( node2Index32 * 2, uint16Array2 ),\n\t\t\t\tdepth1, node1IndexOffset + node1Index32 / UINT32_PER_NODE,\n\t\t\t\tdepth2, node2IndexOffset + node2Index32 / UINT32_PER_NODE,\n\t\t\t);\n\n\t\t}\n\n\t} else if ( isLeaf2 ) {\n\n\t\t// SWAP\n\t\t// If we've traversed to the leaf node on the other bvh then we need to swap over\n\t\t// to traverse down the first one\n\n\t\t// get the new box to use\n\t\tconst newBox = _boxPool.getPrimitive();\n\t\tarrayToBox( BOUNDING_DATA_INDEX( node2Index32 ), float32Array2, newBox );\n\t\tnewBox.applyMatrix4( matrix2to1 );\n\n\t\t// get the child bounds to check before traversal\n\t\tconst cl1 = LEFT_NODE( node1Index32 );\n\t\tconst cr1 = RIGHT_NODE( node1Index32, uint32Array1 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cl1 ), float32Array1, _leftBox1 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cr1 ), float32Array1, _rightBox1 );\n\n\t\t// precompute the intersections otherwise the global boxes will be modified during traversal\n\t\tconst intersectCl1 = newBox.intersectsBox( _leftBox1 );\n\t\tconst intersectCr1 = newBox.intersectsBox( _rightBox1 );\n\t\tresult = (\n\t\t\tintersectCl1 && _traverse(\n\t\t\t\tnode2Index32, cl1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\tnewBox, ! reversed,\n\t\t\t)\n\t\t) || (\n\t\t\tintersectCr1 && _traverse(\n\t\t\t\tnode2Index32, cr1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\tnewBox, ! reversed,\n\t\t\t)\n\t\t);\n\n\t\t_boxPool.releasePrimitive( newBox );\n\n\t} else {\n\n\t\t// if neither are leaves then we should swap if one of the children does not\n\t\t// intersect with the current bounds\n\n\t\t// get the child bounds to check\n\t\tconst cl2 = LEFT_NODE( node2Index32 );\n\t\tconst cr2 = RIGHT_NODE( node2Index32, uint32Array2 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cl2 ), float32Array2, _leftBox2 );\n\t\tarrayToBox( BOUNDING_DATA_INDEX( cr2 ), float32Array2, _rightBox2 );\n\n\t\tconst leftIntersects = currBox.intersectsBox( _leftBox2 );\n\t\tconst rightIntersects = currBox.intersectsBox( _rightBox2 );\n\t\tif ( leftIntersects && rightIntersects ) {\n\n\t\t\t// continue to traverse both children if they both intersect\n\t\t\tresult = _traverse(\n\t\t\t\tnode1Index32, cl2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\tcurrBox, reversed,\n\t\t\t) || _traverse(\n\t\t\t\tnode1Index32, cr2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\tcurrBox, reversed,\n\t\t\t);\n\n\t\t} else if ( leftIntersects ) {\n\n\t\t\tif ( isLeaf1 ) {\n\n\t\t\t\t// if the current box is a leaf then just continue\n\t\t\t\tresult = _traverse(\n\t\t\t\t\tnode1Index32, cl2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\t\tcurrBox, reversed,\n\t\t\t\t);\n\n\t\t\t} else {\n\n\t\t\t\t// SWAP\n\t\t\t\t// if only one box intersects then we have to swap to the other bvh to continue\n\t\t\t\tconst newBox = _boxPool.getPrimitive();\n\t\t\t\tnewBox.copy( _leftBox2 ).applyMatrix4( matrix2to1 );\n\n\t\t\t\tconst cl1 = LEFT_NODE( node1Index32 );\n\t\t\t\tconst cr1 = RIGHT_NODE( node1Index32, uint32Array1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cl1 ), float32Array1, _leftBox1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cr1 ), float32Array1, _rightBox1 );\n\n\t\t\t\t// precompute the intersections otherwise the global boxes will be modified during traversal\n\t\t\t\tconst intersectCl1 = newBox.intersectsBox( _leftBox1 );\n\t\t\t\tconst intersectCr1 = newBox.intersectsBox( _rightBox1 );\n\t\t\t\tresult = (\n\t\t\t\t\tintersectCl1 && _traverse(\n\t\t\t\t\t\tcl2, cl1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t) || (\n\t\t\t\t\tintersectCr1 && _traverse(\n\t\t\t\t\t\tcl2, cr1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\t_boxPool.releasePrimitive( newBox );\n\n\t\t\t}\n\n\t\t} else if ( rightIntersects ) {\n\n\t\t\tif ( isLeaf1 ) {\n\n\t\t\t\t// if the current box is a leaf then just continue\n\t\t\t\tresult = _traverse(\n\t\t\t\t\tnode1Index32, cr2, matrix2to1, matrix1to2, intersectsRangesFunc,\n\t\t\t\t\tnode1IndexOffset, node2IndexOffset, depth1, depth2 + 1,\n\t\t\t\t\tcurrBox, reversed,\n\t\t\t\t);\n\n\t\t\t} else {\n\n\t\t\t\t// SWAP\n\t\t\t\t// if only one box intersects then we have to swap to the other bvh to continue\n\t\t\t\tconst newBox = _boxPool.getPrimitive();\n\t\t\t\tnewBox.copy( _rightBox2 ).applyMatrix4( matrix2to1 );\n\n\t\t\t\tconst cl1 = LEFT_NODE( node1Index32 );\n\t\t\t\tconst cr1 = RIGHT_NODE( node1Index32, uint32Array1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cl1 ), float32Array1, _leftBox1 );\n\t\t\t\tarrayToBox( BOUNDING_DATA_INDEX( cr1 ), float32Array1, _rightBox1 );\n\n\t\t\t\t// precompute the intersections otherwise the global boxes will be modified during traversal\n\t\t\t\tconst intersectCl1 = newBox.intersectsBox( _leftBox1 );\n\t\t\t\tconst intersectCr1 = newBox.intersectsBox( _rightBox1 );\n\t\t\t\tresult = (\n\t\t\t\t\tintersectCl1 && _traverse(\n\t\t\t\t\t\tcr2, cl1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t) || (\n\t\t\t\t\tintersectCr1 && _traverse(\n\t\t\t\t\t\tcr2, cr1, matrix1to2, matrix2to1, intersectsRangesFunc,\n\t\t\t\t\t\tnode2IndexOffset, node1IndexOffset, depth2, depth1 + 1,\n\t\t\t\t\t\tnewBox, ! reversed,\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\t_boxPool.releasePrimitive( newBox );\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn result;\n\n}\n\n"],"names":["_bufferStack1","BufferStack","constructor","_bufferStack2","_boxPool","PrimitivePool","Box3","_leftBox1","_rightBox1","_leftBox2","_rightBox2","_active","bvhcast","bvh","otherBvh","matrixToLocal","intersectsRanges","Error","roots","_roots","otherRoots","result","nodeOffset1","nodeOffset2","invMat","Matrix4","copy","invert","i","il","length","setBuffer","localBox","getPrimitive","arrayToBox","BOUNDING_DATA_INDEX","float32Array","applyMatrix4","j","jl","_traverse","clearBuffer","byteLength","BYTES_PER_NODE","releasePrimitive","node1Index32","node2Index32","matrix2to1","matrix1to2","intersectsRangesFunc","node1IndexOffset","node2IndexOffset","depth1","depth2","currBox","reversed","bufferStack1","bufferStack2","float32Array1","uint32Array1","uint32Array","uint16Array1","uint16Array","float32Array2","uint32Array2","uint16Array2","node2Index16","isLeaf1","IS_LEAF","isLeaf2","OFFSET","COUNT","UINT32_PER_NODE","newBox","cl1","LEFT_NODE","cr1","RIGHT_NODE","intersectCl1","intersectsBox","intersectCr1","cl2","cr2","leftIntersects","rightIntersects"],"mappings":"qbAOA,MAAMA,cAAgC,IAAIC,YAAYC,YAChDC,cAAgC,IAAIF,YAAYC,YAChDE,SAA2B,IAAIC,cAAe,IAAM,IAAIC,MACxDC,UAA4B,IAAID,KAChCE,WAA6B,IAAIF,KAEjCG,UAA4B,IAAIH,KAChCI,WAA6B,IAAIJ,KAEvC,IAAIK,SAAU,EAEP,SAASC,QAASC,IAAKC,SAAUC,cAAeC,kBAEtD,GAAKL,QAEJ,MAAM,IAAIM,MAAO,sDAIlBN,SAAU,EAEV,MAAMO,MAAQL,IAAIM,OACZC,WAAaN,SAASK,OAC5B,IAAIE,OACAC,YAAc,EACdC,YAAc,EAClB,MAAMC,QAAS,IAAIC,SAAUC,KAAMX,eAAgBY,SAGnD,IAAM,IAAIC,EAAI,EAAGC,GAAKX,MAAMY,OAAQF,EAAIC,GAAID,IAAO,CAElD5B,cAAc+B,UAAWb,MAAOU,IAChCL,YAAc,EAGd,MAAMS,SAAW5B,SAAS6B,eAC1BC,WAAYC,oBAAqB,GAAKnC,cAAcoC,aAAcJ,UAClEA,SAASK,aAAcb,QAGvB,IAAM,IAAIc,EAAI,EAAGC,GAAKnB,WAAWU,OAAQQ,EAAIC,KAE5CpC,cAAc4B,UAAWX,WAAYkB,IAErCjB,OAASmB,UACR,EAAG,EAAGzB,cAAeS,OAAQR,iBAC7BM,YAAaC,YAAa,EAAG,EAC7BS,UAGD7B,cAAcsC,cACdlB,aAAeH,WAAYkB,GAAII,WAAaC,gBAEvCtB,QAb2CiB,KA0BjD,GAJAlC,SAASwC,iBAAkBZ,UAC3BhC,cAAcyC,cACdnB,aAAeJ,MAAOU,GAAIc,WAAaC,eAElCtB,OAEJ,KAIF,CAGA,OADAV,SAAU,EACHU,MAER,CAEA,SAASmB,UACRK,aACAC,aACAC,WACAC,WACAC,qBAGAC,iBAAmB,EACnBC,iBAAmB,EAGnBC,OAAS,EACTC,OAAS,EAETC,QAAU,KACVC,UAAW,GAKX,IAAIC,aAAcC,aACbF,UAEJC,aAAerD,cACfsD,aAAezD,gBAIfwD,aAAexD,cACfyD,aAAetD,eAKhB,MACCuD,cAAgBF,aAAapB,aAC7BuB,aAAeH,aAAaI,YAC5BC,aAAeL,aAAaM,YAC5BC,cAAgBN,aAAarB,aAC7B4B,aAAeP,aAAaG,YAC5BK,aAAeR,aAAaK,YAGvBI,aAA8B,EAAfpB,aACfqB,QAAUC,QAFoB,EAAfvB,aAEkBgB,cACjCQ,QAAUD,QAASF,aAAcD,cACvC,IAAI5C,QAAS,EACb,GAAKgD,SAAWF,QAOd9C,OAFIkC,SAEKN,qBACRqB,OAAQxB,aAAckB,cAAgBO,MAAsB,EAAfzB,aAAkBmB,cAC/DK,OAAQzB,aAAcc,cAAgBY,MAAsB,EAAf1B,aAAkBgB,cAC/DR,OAAQF,iBAAmBL,aAAe0B,gBAC1CpB,OAAQF,iBAAmBL,aAAe2B,iBAKlCvB,qBACRqB,OAAQzB,aAAcc,cAAgBY,MAAsB,EAAf1B,aAAkBgB,cAC/DS,OAAQxB,aAAckB,cAAgBO,MAAsB,EAAfzB,aAAkBmB,cAC/Db,OAAQF,iBAAmBL,aAAe2B,gBAC1CnB,OAAQF,iBAAmBL,aAAe0B,sBAKtC,GAAKH,QAAU,CAOrB,MAAMI,OAASrE,SAAS6B,eACxBC,WAAYC,oBAAqBW,cAAgBiB,cAAeU,QAChEA,OAAOpC,aAAcU,YAGrB,MAAM2B,IAAMC,UAAW9B,cACjB+B,IAAMC,WAAYhC,aAAcc,cACtCzB,WAAYC,oBAAqBuC,KAAOhB,cAAenD,WACvD2B,WAAYC,oBAAqByC,KAAOlB,cAAelD,YAGvD,MAAMsE,aAAeL,OAAOM,cAAexE,WACrCyE,aAAeP,OAAOM,cAAevE,YAC3Ca,OACCyD,cAAgBtC,UACfM,aAAc4B,IAAK1B,WAAYD,WAAYE,qBAC3CE,iBAAkBD,iBAAkBG,OAAQD,OAAS,EACrDqB,QAAUlB,WAGXyB,cAAgBxC,UACfM,aAAc8B,IAAK5B,WAAYD,WAAYE,qBAC3CE,iBAAkBD,iBAAkBG,OAAQD,OAAS,EACrDqB,QAAUlB,UAIZnD,SAASwC,iBAAkB6B,OAE5B,KAAO,CAMN,MAAMQ,IAAMN,UAAW7B,cACjBoC,IAAML,WAAY/B,aAAckB,cACtC9B,WAAYC,oBAAqB8C,KAAOlB,cAAetD,WACvDyB,WAAYC,oBAAqB+C,KAAOnB,cAAerD,YAEvD,MAAMyE,eAAiB7B,QAAQyB,cAAetE,WACxC2E,gBAAkB9B,QAAQyB,cAAerE,YAC/C,GAAKyE,gBAAkBC,gBAGtB/D,OAASmB,UACRK,aAAcoC,IAAKlC,WAAYC,WAAYC,qBAC3CC,iBAAkBC,iBAAkBC,OAAQC,OAAS,EACrDC,QAASC,WACLf,UACJK,aAAcqC,IAAKnC,WAAYC,WAAYC,qBAC3CC,iBAAkBC,iBAAkBC,OAAQC,OAAS,EACrDC,QAASC,eAGJ,GAAK4B,eAEX,GAAKhB,QAGJ9C,OAASmB,UACRK,aAAcoC,IAAKlC,WAAYC,WAAYC,qBAC3CC,iBAAkBC,iBAAkBC,OAAQC,OAAS,EACrDC,QAASC,cAGJ,CAIN,MAAMkB,OAASrE,SAAS6B,eACxBwC,OAAO/C,KAAMjB,WAAY4B,aAAcU,YAEvC,MAAM2B,IAAMC,UAAW9B,cACjB+B,IAAMC,WAAYhC,aAAcc,cACtCzB,WAAYC,oBAAqBuC,KAAOhB,cAAenD,WACvD2B,WAAYC,oBAAqByC,KAAOlB,cAAelD,YAGvD,MAAMsE,aAAeL,OAAOM,cAAexE,WACrCyE,aAAeP,OAAOM,cAAevE,YAC3Ca,OACCyD,cAAgBtC,UACfyC,IAAKP,IAAK1B,WAAYD,WAAYE,qBAClCE,iBAAkBD,iBAAkBG,OAAQD,OAAS,EACrDqB,QAAUlB,WAGXyB,cAAgBxC,UACfyC,IAAKL,IAAK5B,WAAYD,WAAYE,qBAClCE,iBAAkBD,iBAAkBG,OAAQD,OAAS,EACrDqB,QAAUlB,UAIZnD,SAASwC,iBAAkB6B,OAE5B,MAEM,GAAKW,gBAEX,GAAKjB,QAGJ9C,OAASmB,UACRK,aAAcqC,IAAKnC,WAAYC,WAAYC,qBAC3CC,iBAAkBC,iBAAkBC,OAAQC,OAAS,EACrDC,QAASC,cAGJ,CAIN,MAAMkB,OAASrE,SAAS6B,eACxBwC,OAAO/C,KAAMhB,YAAa2B,aAAcU,YAExC,MAAM2B,IAAMC,UAAW9B,cACjB+B,IAAMC,WAAYhC,aAAcc,cACtCzB,WAAYC,oBAAqBuC,KAAOhB,cAAenD,WACvD2B,WAAYC,oBAAqByC,KAAOlB,cAAelD,YAGvD,MAAMsE,aAAeL,OAAOM,cAAexE,WACrCyE,aAAeP,OAAOM,cAAevE,YAC3Ca,OACCyD,cAAgBtC,UACf0C,IAAKR,IAAK1B,WAAYD,WAAYE,qBAClCE,iBAAkBD,iBAAkBG,OAAQD,OAAS,EACrDqB,QAAUlB,WAGXyB,cAAgBxC,UACf0C,IAAKN,IAAK5B,WAAYD,WAAYE,qBAClCE,iBAAkBD,iBAAkBG,OAAQD,OAAS,EACrDqB,QAAUlB,UAIZnD,SAASwC,iBAAkB6B,OAE5B,CAIF,CAEA,OAAOpD,MAER","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-import"../../../../three/build/three.module.js";import{OrientedBox}from"../../math/OrientedBox.js";import{setTriangle}from"../../utils/TriangleUtilities.js";import{getTriCount}from"../build/geometryUtils.js";import{ExtendedTrianglePool}from"../../utils/ExtendedTrianglePool.js";import{Matrix4,Vector3}from"../../../../three/build/three.core.js";const tempMatrix=new Matrix4,obb=new OrientedBox,obb2=new OrientedBox,temp1=new Vector3,temp2=new Vector3,temp3=new Vector3,temp4=new Vector3;function closestPointToGeometry(bvh,otherGeometry,geometryToBvh,target1={},target2={},minThreshold=0,maxThreshold=1/0){otherGeometry.boundingBox||otherGeometry.computeBoundingBox(),obb.set(otherGeometry.boundingBox.min,otherGeometry.boundingBox.max,geometryToBvh),obb.needsUpdate=!0;const geometry=bvh.geometry,pos=geometry.attributes.position,index=geometry.index,otherPos=otherGeometry.attributes.position,otherIndex=otherGeometry.index,triangle=ExtendedTrianglePool.getPrimitive(),triangle2=ExtendedTrianglePool.getPrimitive();let tempTarget1=temp1,tempTargetDest1=temp2,tempTarget2=null,tempTargetDest2=null;target2&&(tempTarget2=temp3,tempTargetDest2=temp4);let closestDistance=1/0,closestDistanceTriIndex=null,closestDistanceOtherTriIndex=null;return tempMatrix.copy(geometryToBvh).invert(),obb2.matrix.copy(tempMatrix),bvh.shapecast({boundsTraverseOrder:box=>obb.distanceToBox(box),intersectsBounds:(box,isLeaf,score)=>score<closestDistance&&score<maxThreshold&&(isLeaf&&(obb2.min.copy(box.min),obb2.max.copy(box.max),obb2.needsUpdate=!0),!0),intersectsRange:(offset,count)=>{if(otherGeometry.boundsTree)return otherGeometry.boundsTree.shapecast({boundsTraverseOrder:box=>obb2.distanceToBox(box),intersectsBounds:(box,isLeaf,score)=>score<closestDistance&&score<maxThreshold,intersectsRange:(otherOffset,otherCount)=>{for(let i2=otherOffset,l2=otherOffset+otherCount;i2<l2;i2++){setTriangle(triangle2,3*i2,otherIndex,otherPos),triangle2.a.applyMatrix4(geometryToBvh),triangle2.b.applyMatrix4(geometryToBvh),triangle2.c.applyMatrix4(geometryToBvh),triangle2.needsUpdate=!0;for(let i=offset,l=offset+count;i<l;i++){setTriangle(triangle,3*i,index,pos),triangle.needsUpdate=!0;const dist=triangle.distanceToTriangle(triangle2,tempTarget1,tempTarget2);if(dist<closestDistance&&(tempTargetDest1.copy(tempTarget1),tempTargetDest2&&tempTargetDest2.copy(tempTarget2),closestDistance=dist,closestDistanceTriIndex=i,closestDistanceOtherTriIndex=i2),dist<minThreshold)return!0}}}});for(let i2=0,l2=getTriCount(otherGeometry);i2<l2;i2++){setTriangle(triangle2,3*i2,otherIndex,otherPos),triangle2.a.applyMatrix4(geometryToBvh),triangle2.b.applyMatrix4(geometryToBvh),triangle2.c.applyMatrix4(geometryToBvh),triangle2.needsUpdate=!0;for(let i=offset,l=offset+count;i<l;i++){setTriangle(triangle,3*i,index,pos),triangle.needsUpdate=!0;const dist=triangle.distanceToTriangle(triangle2,tempTarget1,tempTarget2);if(dist<closestDistance&&(tempTargetDest1.copy(tempTarget1),tempTargetDest2&&tempTargetDest2.copy(tempTarget2),closestDistance=dist,closestDistanceTriIndex=i,closestDistanceOtherTriIndex=i2),dist<minThreshold)return!0}}}}),ExtendedTrianglePool.releasePrimitive(triangle),ExtendedTrianglePool.releasePrimitive(triangle2),closestDistance===1/0?null:(target1.point?target1.point.copy(tempTargetDest1):target1.point=tempTargetDest1.clone(),target1.distance=closestDistance,target1.faceIndex=closestDistanceTriIndex,target2&&(target2.point?target2.point.copy(tempTargetDest2):target2.point=tempTargetDest2.clone(),target2.point.applyMatrix4(tempMatrix),tempTargetDest1.applyMatrix4(tempMatrix),target2.distance=tempTargetDest1.sub(target2.point).length(),target2.faceIndex=closestDistanceOtherTriIndex),target1)}export{closestPointToGeometry};
-//# sourceMappingURL=closestPointToGeometry.generated.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"closestPointToGeometry.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry.generated.js"],"sourcesContent":["import { Matrix4, Vector3 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { getTriCount } from '../build/geometryUtils.js';\nimport { ExtendedTrianglePool } from '../../utils/ExtendedTrianglePool.js';\n\n/*********************************************************************/\n/* This file is generated from \"closestPointToGeometry.template.js\". */\n/*********************************************************************/\n\nconst tempMatrix = /* @__PURE__ */ new Matrix4();\nconst obb = /* @__PURE__ */ new OrientedBox();\nconst obb2 = /* @__PURE__ */ new OrientedBox();\nconst temp1 = /* @__PURE__ */ new Vector3();\nconst temp2 = /* @__PURE__ */ new Vector3();\nconst temp3 = /* @__PURE__ */ new Vector3();\nconst temp4 = /* @__PURE__ */ new Vector3();\n\nfunction closestPointToGeometry(\n\tbvh,\n\totherGeometry,\n\tgeometryToBvh,\n\ttarget1 = { },\n\ttarget2 = { },\n\tminThreshold = 0,\n\tmaxThreshold = Infinity,\n) {\n\n\tif ( ! otherGeometry.boundingBox ) {\n\n\t\totherGeometry.computeBoundingBox();\n\n\t}\n\n\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\tobb.needsUpdate = true;\n\n\tconst geometry = bvh.geometry;\n\tconst pos = geometry.attributes.position;\n\tconst index = geometry.index;\n\tconst otherPos = otherGeometry.attributes.position;\n\tconst otherIndex = otherGeometry.index;\n\tconst triangle = ExtendedTrianglePool.getPrimitive();\n\tconst triangle2 = ExtendedTrianglePool.getPrimitive();\n\n\tlet tempTarget1 = temp1;\n\tlet tempTargetDest1 = temp2;\n\tlet tempTarget2 = null;\n\tlet tempTargetDest2 = null;\n\n\tif ( target2 ) {\n\n\t\ttempTarget2 = temp3;\n\t\ttempTargetDest2 = temp4;\n\n\t}\n\n\tlet closestDistance = Infinity;\n\tlet closestDistanceTriIndex = null;\n\tlet closestDistanceOtherTriIndex = null;\n\ttempMatrix.copy( geometryToBvh ).invert();\n\tobb2.matrix.copy( tempMatrix );\n\tbvh.shapecast(\n\t\t{\n\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn obb.distanceToBox( box );\n\n\t\t\t},\n\n\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\tif ( score < closestDistance && score < maxThreshold ) {\n\n\t\t\t\t\t// if we know the triangles of this bounds will be intersected next then\n\t\t\t\t\t// save the bounds to use during triangle checks.\n\t\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\t\tobb2.min.copy( box.min );\n\t\t\t\t\t\tobb2.max.copy( box.max );\n\t\t\t\t\t\tobb2.needsUpdate = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\t},\n\n\t\t\tintersectsRange: ( offset, count ) => {\n\n\t\t\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t\t\t// if the other geometry has a bvh then use the accelerated path where we use shapecast to find\n\t\t\t\t\t// the closest bounds in the other geometry to check.\n\t\t\t\t\tconst otherBvh = otherGeometry.boundsTree;\n\t\t\t\t\treturn otherBvh.shapecast( {\n\t\t\t\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\t\t\t\treturn obb2.distanceToBox( box );\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\t\t\t\treturn score < closestDistance && score < maxThreshold;\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsRange: ( otherOffset, otherCount ) => {\n\n\t\t\t\t\t\t\tfor ( let i2 = otherOffset, l2 = otherOffset + otherCount; i2 < l2; i2 ++ ) {\n\n\n\t\t\t\t\t\t\t\tsetTriangle( triangle2, 3 * i2, otherIndex, otherPos );\n\n\t\t\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\n\t\t\t\t\t\t\t\t\tsetTriangle( triangle, 3 * i, index, pos );\n\n\t\t\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t},\n\t\t\t\t\t} );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// If no bounds tree then we'll just check every triangle.\n\t\t\t\t\tconst triCount = getTriCount( otherGeometry );\n\t\t\t\t\tfor ( let i2 = 0, l2 = triCount; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\t\tsetTriangle( triangle2, 3 * i2, otherIndex, otherPos );\n\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\n\t\t\t\t\t\t\tsetTriangle( triangle, 3 * i, index, pos );\n\n\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t},\n\n\t\t}\n\n\t);\n\n\tExtendedTrianglePool.releasePrimitive( triangle );\n\tExtendedTrianglePool.releasePrimitive( triangle2 );\n\n\tif ( closestDistance === Infinity ) {\n\n\t\treturn null;\n\n\t}\n\n\tif ( ! target1.point ) {\n\n\t\ttarget1.point = tempTargetDest1.clone();\n\n\t} else {\n\n\t\ttarget1.point.copy( tempTargetDest1 );\n\n\t}\n\n\ttarget1.distance = closestDistance,\n\ttarget1.faceIndex = closestDistanceTriIndex;\n\n\tif ( target2 ) {\n\n\t\tif ( ! target2.point ) target2.point = tempTargetDest2.clone();\n\t\telse target2.point.copy( tempTargetDest2 );\n\t\ttarget2.point.applyMatrix4( tempMatrix );\n\t\ttempTargetDest1.applyMatrix4( tempMatrix );\n\t\ttarget2.distance = tempTargetDest1.sub( target2.point ).length();\n\t\ttarget2.faceIndex = closestDistanceOtherTriIndex;\n\n\t}\n\n\treturn target1;\n\n}\n\nexport { closestPointToGeometry };\n"],"names":["tempMatrix","Matrix4","obb","OrientedBox","obb2","temp1","Vector3","temp2","temp3","temp4","closestPointToGeometry","bvh","otherGeometry","geometryToBvh","target1","target2","minThreshold","maxThreshold","Infinity","boundingBox","computeBoundingBox","set","min","max","needsUpdate","geometry","pos","attributes","position","index","otherPos","otherIndex","triangle","ExtendedTrianglePool","getPrimitive","triangle2","tempTarget1","tempTargetDest1","tempTarget2","tempTargetDest2","closestDistance","closestDistanceTriIndex","closestDistanceOtherTriIndex","copy","invert","matrix","shapecast","boundsTraverseOrder","box","distanceToBox","intersectsBounds","isLeaf","score","intersectsRange","offset","count","boundsTree","otherOffset","otherCount","i2","l2","setTriangle","a","applyMatrix4","b","c","i","l","dist","distanceToTriangle","getTriCount","releasePrimitive","point","clone","distance","faceIndex","sub","length"],"mappings":"yVAUA,MAAMA,WAA6B,IAAIC,QACjCC,IAAsB,IAAIC,YAC1BC,KAAuB,IAAID,YAC3BE,MAAwB,IAAIC,QAC5BC,MAAwB,IAAID,QAC5BE,MAAwB,IAAIF,QAC5BG,MAAwB,IAAIH,QAElC,SAASI,uBACRC,IACAC,cACAC,cACAC,QAAU,CAAA,EACVC,QAAU,CAAA,EACVC,aAAe,EACfC,aAAeC,KAGRN,cAAcO,aAEpBP,cAAcQ,qBAIflB,IAAImB,IAAKT,cAAcO,YAAYG,IAAKV,cAAcO,YAAYI,IAAKV,eACvEX,IAAIsB,aAAc,EAElB,MAAMC,SAAWd,IAAIc,SACfC,IAAMD,SAASE,WAAWC,SAC1BC,MAAQJ,SAASI,MACjBC,SAAWlB,cAAce,WAAWC,SACpCG,WAAanB,cAAciB,MAC3BG,SAAWC,qBAAqBC,eAChCC,UAAYF,qBAAqBC,eAEvC,IAAIE,YAAc/B,MACdgC,gBAAkB9B,MAClB+B,YAAc,KACdC,gBAAkB,KAEjBxB,UAEJuB,YAAc9B,MACd+B,gBAAkB9B,OAInB,IAAI+B,gBAAkBtB,IAClBuB,wBAA0B,KAC1BC,6BAA+B,KAkKnC,OAjKA1C,WAAW2C,KAAM9B,eAAgB+B,SACjCxC,KAAKyC,OAAOF,KAAM3C,YAClBW,IAAImC,UACH,CAECC,oBAAqBC,KAEb9C,IAAI+C,cAAeD,KAI3BE,iBAAkB,CAAEF,IAAKG,OAAQC,QAE3BA,MAAQZ,iBAAmBY,MAAQnC,eAIlCkC,SAEJ/C,KAAKkB,IAAIqB,KAAMK,IAAI1B,KACnBlB,KAAKmB,IAAIoB,KAAMK,IAAIzB,KACnBnB,KAAKoB,aAAc,IAIb,GAQT6B,gBAAiB,CAAEC,OAAQC,SAE1B,GAAK3C,cAAc4C,WAKlB,OADiB5C,cAAc4C,WACfV,UAAW,CAC1BC,oBAAqBC,KAEb5C,KAAK6C,cAAeD,KAI5BE,iBAAkB,CAAEF,IAAKG,OAAQC,QAEzBA,MAAQZ,iBAAmBY,MAAQnC,aAI3CoC,gBAAiB,CAAEI,YAAaC,cAE/B,IAAM,IAAIC,GAAKF,YAAaG,GAAKH,YAAcC,WAAYC,GAAKC,GAAID,KAAQ,CAG3EE,YAAa1B,UAAW,EAAIwB,GAAI5B,WAAYD,UAE5CK,UAAU2B,EAAEC,aAAclD,eAC1BsB,UAAU6B,EAAED,aAAclD,eAC1BsB,UAAU8B,EAAEF,aAAclD,eAC1BsB,UAAUX,aAAc,EAExB,IAAM,IAAI0C,EAAIZ,OAAQa,EAAIb,OAASC,MAAOW,EAAIC,EAAGD,IAAO,CAGvDL,YAAa7B,SAAU,EAAIkC,EAAGrC,MAAOH,KAErCM,SAASR,aAAc,EAEvB,MAAM4C,KAAOpC,SAASqC,mBAAoBlC,UAAWC,YAAaE,aAkBlE,GAjBK8B,KAAO5B,kBAEXH,gBAAgBM,KAAMP,aAEjBG,iBAEJA,gBAAgBI,KAAML,aAIvBE,gBAAkB4B,KAClB3B,wBAA0ByB,EAC1BxB,6BAA+BiB,IAK3BS,KAAOpD,aAEX,OAAO,CAIT,CAED,KASF,IAAM,IAAI2C,GAAK,EAAGC,GADDU,YAAa1D,eACG+C,GAAKC,GAAID,KAAQ,CAEjDE,YAAa1B,UAAW,EAAIwB,GAAI5B,WAAYD,UAC5CK,UAAU2B,EAAEC,aAAclD,eAC1BsB,UAAU6B,EAAED,aAAclD,eAC1BsB,UAAU8B,EAAEF,aAAclD,eAC1BsB,UAAUX,aAAc,EAExB,IAAM,IAAI0C,EAAIZ,OAAQa,EAAIb,OAASC,MAAOW,EAAIC,EAAGD,IAAO,CAGvDL,YAAa7B,SAAU,EAAIkC,EAAGrC,MAAOH,KAErCM,SAASR,aAAc,EAEvB,MAAM4C,KAAOpC,SAASqC,mBAAoBlC,UAAWC,YAAaE,aAkBlE,GAjBK8B,KAAO5B,kBAEXH,gBAAgBM,KAAMP,aAEjBG,iBAEJA,gBAAgBI,KAAML,aAIvBE,gBAAkB4B,KAClB3B,wBAA0ByB,EAC1BxB,6BAA+BiB,IAK3BS,KAAOpD,aAEX,OAAO,CAIT,CAED,KAUJiB,qBAAqBsC,iBAAkBvC,UACvCC,qBAAqBsC,iBAAkBpC,WAElCK,kBAAoBtB,IAEjB,MAIDJ,QAAQ0D,MAMd1D,QAAQ0D,MAAM7B,KAAMN,iBAJpBvB,QAAQ0D,MAAQnC,gBAAgBoC,QAQjC3D,QAAQ4D,SAAWlC,gBACnB1B,QAAQ6D,UAAYlC,wBAEf1B,UAEGA,QAAQyD,MACVzD,QAAQyD,MAAM7B,KAAMJ,iBADFxB,QAAQyD,MAAQjC,gBAAgBkC,QAEvD1D,QAAQyD,MAAMT,aAAc/D,YAC5BqC,gBAAgB0B,aAAc/D,YAC9Be,QAAQ2D,SAAWrC,gBAAgBuC,IAAK7D,QAAQyD,OAAQK,SACxD9D,QAAQ4D,UAAYjC,8BAId5B,QAER","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-import"../../../../three/build/three.module.js";import{OrientedBox}from"../../math/OrientedBox.js";import{setTriangle}from"../../utils/TriangleUtilities.js";import{getTriCount}from"../build/geometryUtils.js";import{ExtendedTrianglePool}from"../../utils/ExtendedTrianglePool.js";import{Matrix4,Vector3}from"../../../../three/build/three.core.js";const tempMatrix=new Matrix4,obb=new OrientedBox,obb2=new OrientedBox,temp1=new Vector3,temp2=new Vector3,temp3=new Vector3,temp4=new Vector3;function closestPointToGeometry_indirect(bvh,otherGeometry,geometryToBvh,target1={},target2={},minThreshold=0,maxThreshold=1/0){otherGeometry.boundingBox||otherGeometry.computeBoundingBox(),obb.set(otherGeometry.boundingBox.min,otherGeometry.boundingBox.max,geometryToBvh),obb.needsUpdate=!0;const geometry=bvh.geometry,pos=geometry.attributes.position,index=geometry.index,otherPos=otherGeometry.attributes.position,otherIndex=otherGeometry.index,triangle=ExtendedTrianglePool.getPrimitive(),triangle2=ExtendedTrianglePool.getPrimitive();let tempTarget1=temp1,tempTargetDest1=temp2,tempTarget2=null,tempTargetDest2=null;target2&&(tempTarget2=temp3,tempTargetDest2=temp4);let closestDistance=1/0,closestDistanceTriIndex=null,closestDistanceOtherTriIndex=null;return tempMatrix.copy(geometryToBvh).invert(),obb2.matrix.copy(tempMatrix),bvh.shapecast({boundsTraverseOrder:box=>obb.distanceToBox(box),intersectsBounds:(box,isLeaf,score)=>score<closestDistance&&score<maxThreshold&&(isLeaf&&(obb2.min.copy(box.min),obb2.max.copy(box.max),obb2.needsUpdate=!0),!0),intersectsRange:(offset,count)=>{if(otherGeometry.boundsTree){const otherBvh=otherGeometry.boundsTree;return otherBvh.shapecast({boundsTraverseOrder:box=>obb2.distanceToBox(box),intersectsBounds:(box,isLeaf,score)=>score<closestDistance&&score<maxThreshold,intersectsRange:(otherOffset,otherCount)=>{for(let i2=otherOffset,l2=otherOffset+otherCount;i2<l2;i2++){const ti2=otherBvh.resolveTriangleIndex(i2);setTriangle(triangle2,3*ti2,otherIndex,otherPos),triangle2.a.applyMatrix4(geometryToBvh),triangle2.b.applyMatrix4(geometryToBvh),triangle2.c.applyMatrix4(geometryToBvh),triangle2.needsUpdate=!0;for(let i=offset,l=offset+count;i<l;i++){const ti=bvh.resolveTriangleIndex(i);setTriangle(triangle,3*ti,index,pos),triangle.needsUpdate=!0;const dist=triangle.distanceToTriangle(triangle2,tempTarget1,tempTarget2);if(dist<closestDistance&&(tempTargetDest1.copy(tempTarget1),tempTargetDest2&&tempTargetDest2.copy(tempTarget2),closestDistance=dist,closestDistanceTriIndex=i,closestDistanceOtherTriIndex=i2),dist<minThreshold)return!0}}}})}for(let i2=0,l2=getTriCount(otherGeometry);i2<l2;i2++){setTriangle(triangle2,3*i2,otherIndex,otherPos),triangle2.a.applyMatrix4(geometryToBvh),triangle2.b.applyMatrix4(geometryToBvh),triangle2.c.applyMatrix4(geometryToBvh),triangle2.needsUpdate=!0;for(let i=offset,l=offset+count;i<l;i++){const ti=bvh.resolveTriangleIndex(i);setTriangle(triangle,3*ti,index,pos),triangle.needsUpdate=!0;const dist=triangle.distanceToTriangle(triangle2,tempTarget1,tempTarget2);if(dist<closestDistance&&(tempTargetDest1.copy(tempTarget1),tempTargetDest2&&tempTargetDest2.copy(tempTarget2),closestDistance=dist,closestDistanceTriIndex=i,closestDistanceOtherTriIndex=i2),dist<minThreshold)return!0}}}}),ExtendedTrianglePool.releasePrimitive(triangle),ExtendedTrianglePool.releasePrimitive(triangle2),closestDistance===1/0?null:(target1.point?target1.point.copy(tempTargetDest1):target1.point=tempTargetDest1.clone(),target1.distance=closestDistance,target1.faceIndex=closestDistanceTriIndex,target2&&(target2.point?target2.point.copy(tempTargetDest2):target2.point=tempTargetDest2.clone(),target2.point.applyMatrix4(tempMatrix),tempTargetDest1.applyMatrix4(tempMatrix),target2.distance=tempTargetDest1.sub(target2.point).length(),target2.faceIndex=closestDistanceOtherTriIndex),target1)}export{closestPointToGeometry_indirect};
-//# sourceMappingURL=closestPointToGeometry_indirect.generated.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"closestPointToGeometry_indirect.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry_indirect.generated.js"],"sourcesContent":["import { Matrix4, Vector3 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { getTriCount } from '../build/geometryUtils.js';\nimport { ExtendedTrianglePool } from '../../utils/ExtendedTrianglePool.js';\n\n/*********************************************************************/\n/* This file is generated from \"closestPointToGeometry.template.js\". */\n/*********************************************************************/\n\nconst tempMatrix = /* @__PURE__ */ new Matrix4();\nconst obb = /* @__PURE__ */ new OrientedBox();\nconst obb2 = /* @__PURE__ */ new OrientedBox();\nconst temp1 = /* @__PURE__ */ new Vector3();\nconst temp2 = /* @__PURE__ */ new Vector3();\nconst temp3 = /* @__PURE__ */ new Vector3();\nconst temp4 = /* @__PURE__ */ new Vector3();\n\nfunction closestPointToGeometry_indirect(\n\tbvh,\n\totherGeometry,\n\tgeometryToBvh,\n\ttarget1 = { },\n\ttarget2 = { },\n\tminThreshold = 0,\n\tmaxThreshold = Infinity,\n) {\n\n\tif ( ! otherGeometry.boundingBox ) {\n\n\t\totherGeometry.computeBoundingBox();\n\n\t}\n\n\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\tobb.needsUpdate = true;\n\n\tconst geometry = bvh.geometry;\n\tconst pos = geometry.attributes.position;\n\tconst index = geometry.index;\n\tconst otherPos = otherGeometry.attributes.position;\n\tconst otherIndex = otherGeometry.index;\n\tconst triangle = ExtendedTrianglePool.getPrimitive();\n\tconst triangle2 = ExtendedTrianglePool.getPrimitive();\n\n\tlet tempTarget1 = temp1;\n\tlet tempTargetDest1 = temp2;\n\tlet tempTarget2 = null;\n\tlet tempTargetDest2 = null;\n\n\tif ( target2 ) {\n\n\t\ttempTarget2 = temp3;\n\t\ttempTargetDest2 = temp4;\n\n\t}\n\n\tlet closestDistance = Infinity;\n\tlet closestDistanceTriIndex = null;\n\tlet closestDistanceOtherTriIndex = null;\n\ttempMatrix.copy( geometryToBvh ).invert();\n\tobb2.matrix.copy( tempMatrix );\n\tbvh.shapecast(\n\t\t{\n\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\treturn obb.distanceToBox( box );\n\n\t\t\t},\n\n\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\tif ( score < closestDistance && score < maxThreshold ) {\n\n\t\t\t\t\t// if we know the triangles of this bounds will be intersected next then\n\t\t\t\t\t// save the bounds to use during triangle checks.\n\t\t\t\t\tif ( isLeaf ) {\n\n\t\t\t\t\t\tobb2.min.copy( box.min );\n\t\t\t\t\t\tobb2.max.copy( box.max );\n\t\t\t\t\t\tobb2.needsUpdate = true;\n\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t}\n\n\t\t\t\treturn false;\n\n\t\t\t},\n\n\t\t\tintersectsRange: ( offset, count ) => {\n\n\t\t\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t\t\t// if the other geometry has a bvh then use the accelerated path where we use shapecast to find\n\t\t\t\t\t// the closest bounds in the other geometry to check.\n\t\t\t\t\tconst otherBvh = otherGeometry.boundsTree;\n\t\t\t\t\treturn otherBvh.shapecast( {\n\t\t\t\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\t\t\t\treturn obb2.distanceToBox( box );\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\t\t\t\treturn score < closestDistance && score < maxThreshold;\n\n\t\t\t\t\t\t},\n\n\t\t\t\t\t\tintersectsRange: ( otherOffset, otherCount ) => {\n\n\t\t\t\t\t\t\tfor ( let i2 = otherOffset, l2 = otherOffset + otherCount; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\t\t\t\tconst ti2 = otherBvh.resolveTriangleIndex( i2 );\n\t\t\t\t\t\t\t\tsetTriangle( triangle2, 3 * ti2, otherIndex, otherPos );\n\n\t\t\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\t\t\t\t\t\t\tconst ti = bvh.resolveTriangleIndex( i );\n\t\t\t\t\t\t\t\t\tsetTriangle( triangle, 3 * ti, index, pos );\n\n\t\t\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t},\n\t\t\t\t\t} );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// If no bounds tree then we'll just check every triangle.\n\t\t\t\t\tconst triCount = getTriCount( otherGeometry );\n\t\t\t\t\tfor ( let i2 = 0, l2 = triCount; i2 < l2; i2 ++ ) {\n\n\t\t\t\t\t\tsetTriangle( triangle2, 3 * i2, otherIndex, otherPos );\n\t\t\t\t\t\ttriangle2.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\t\tfor ( let i = offset, l = offset + count; i < l; i ++ ) {\n\n\t\t\t\t\t\t\tconst ti = bvh.resolveTriangleIndex( i );\n\t\t\t\t\t\t\tsetTriangle( triangle, 3 * ti, index, pos );\n\n\t\t\t\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\t\t\t\tconst dist = triangle.distanceToTriangle( triangle2, tempTarget1, tempTarget2 );\n\t\t\t\t\t\t\tif ( dist < closestDistance ) {\n\n\t\t\t\t\t\t\t\ttempTargetDest1.copy( tempTarget1 );\n\n\t\t\t\t\t\t\t\tif ( tempTargetDest2 ) {\n\n\t\t\t\t\t\t\t\t\ttempTargetDest2.copy( tempTarget2 );\n\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tclosestDistance = dist;\n\t\t\t\t\t\t\t\tclosestDistanceTriIndex = i;\n\t\t\t\t\t\t\t\tclosestDistanceOtherTriIndex = i2;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// stop traversal if we find a point that's under the given threshold\n\t\t\t\t\t\t\tif ( dist < minThreshold ) {\n\n\t\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t},\n\n\t\t}\n\n\t);\n\n\tExtendedTrianglePool.releasePrimitive( triangle );\n\tExtendedTrianglePool.releasePrimitive( triangle2 );\n\n\tif ( closestDistance === Infinity ) {\n\n\t\treturn null;\n\n\t}\n\n\tif ( ! target1.point ) {\n\n\t\ttarget1.point = tempTargetDest1.clone();\n\n\t} else {\n\n\t\ttarget1.point.copy( tempTargetDest1 );\n\n\t}\n\n\ttarget1.distance = closestDistance,\n\ttarget1.faceIndex = closestDistanceTriIndex;\n\n\tif ( target2 ) {\n\n\t\tif ( ! target2.point ) target2.point = tempTargetDest2.clone();\n\t\telse target2.point.copy( tempTargetDest2 );\n\t\ttarget2.point.applyMatrix4( tempMatrix );\n\t\ttempTargetDest1.applyMatrix4( tempMatrix );\n\t\ttarget2.distance = tempTargetDest1.sub( target2.point ).length();\n\t\ttarget2.faceIndex = closestDistanceOtherTriIndex;\n\n\t}\n\n\treturn target1;\n\n}\n\nexport { closestPointToGeometry_indirect };\n"],"names":["tempMatrix","Matrix4","obb","OrientedBox","obb2","temp1","Vector3","temp2","temp3","temp4","closestPointToGeometry_indirect","bvh","otherGeometry","geometryToBvh","target1","target2","minThreshold","maxThreshold","Infinity","boundingBox","computeBoundingBox","set","min","max","needsUpdate","geometry","pos","attributes","position","index","otherPos","otherIndex","triangle","ExtendedTrianglePool","getPrimitive","triangle2","tempTarget1","tempTargetDest1","tempTarget2","tempTargetDest2","closestDistance","closestDistanceTriIndex","closestDistanceOtherTriIndex","copy","invert","matrix","shapecast","boundsTraverseOrder","box","distanceToBox","intersectsBounds","isLeaf","score","intersectsRange","offset","count","boundsTree","otherBvh","otherOffset","otherCount","i2","l2","ti2","resolveTriangleIndex","setTriangle","a","applyMatrix4","b","c","i","l","ti","dist","distanceToTriangle","getTriCount","releasePrimitive","point","clone","distance","faceIndex","sub","length"],"mappings":"yVAUA,MAAMA,WAA6B,IAAIC,QACjCC,IAAsB,IAAIC,YAC1BC,KAAuB,IAAID,YAC3BE,MAAwB,IAAIC,QAC5BC,MAAwB,IAAID,QAC5BE,MAAwB,IAAIF,QAC5BG,MAAwB,IAAIH,QAElC,SAASI,gCACRC,IACAC,cACAC,cACAC,QAAU,CAAA,EACVC,QAAU,CAAA,EACVC,aAAe,EACfC,aAAeC,KAGRN,cAAcO,aAEpBP,cAAcQ,qBAIflB,IAAImB,IAAKT,cAAcO,YAAYG,IAAKV,cAAcO,YAAYI,IAAKV,eACvEX,IAAIsB,aAAc,EAElB,MAAMC,SAAWd,IAAIc,SACfC,IAAMD,SAASE,WAAWC,SAC1BC,MAAQJ,SAASI,MACjBC,SAAWlB,cAAce,WAAWC,SACpCG,WAAanB,cAAciB,MAC3BG,SAAWC,qBAAqBC,eAChCC,UAAYF,qBAAqBC,eAEvC,IAAIE,YAAc/B,MACdgC,gBAAkB9B,MAClB+B,YAAc,KACdC,gBAAkB,KAEjBxB,UAEJuB,YAAc9B,MACd+B,gBAAkB9B,OAInB,IAAI+B,gBAAkBtB,IAClBuB,wBAA0B,KAC1BC,6BAA+B,KAkKnC,OAjKA1C,WAAW2C,KAAM9B,eAAgB+B,SACjCxC,KAAKyC,OAAOF,KAAM3C,YAClBW,IAAImC,UACH,CAECC,oBAAqBC,KAEb9C,IAAI+C,cAAeD,KAI3BE,iBAAkB,CAAEF,IAAKG,OAAQC,QAE3BA,MAAQZ,iBAAmBY,MAAQnC,eAIlCkC,SAEJ/C,KAAKkB,IAAIqB,KAAMK,IAAI1B,KACnBlB,KAAKmB,IAAIoB,KAAMK,IAAIzB,KACnBnB,KAAKoB,aAAc,IAIb,GAQT6B,gBAAiB,CAAEC,OAAQC,SAE1B,GAAK3C,cAAc4C,WAAa,CAI/B,MAAMC,SAAW7C,cAAc4C,WAC/B,OAAOC,SAASX,UAAW,CAC1BC,oBAAqBC,KAEb5C,KAAK6C,cAAeD,KAI5BE,iBAAkB,CAAEF,IAAKG,OAAQC,QAEzBA,MAAQZ,iBAAmBY,MAAQnC,aAI3CoC,gBAAiB,CAAEK,YAAaC,cAE/B,IAAM,IAAIC,GAAKF,YAAaG,GAAKH,YAAcC,WAAYC,GAAKC,GAAID,KAAQ,CAE3E,MAAME,IAAML,SAASM,qBAAsBH,IAC3CI,YAAa7B,UAAW,EAAI2B,IAAK/B,WAAYD,UAE7CK,UAAU8B,EAAEC,aAAcrD,eAC1BsB,UAAUgC,EAAED,aAAcrD,eAC1BsB,UAAUiC,EAAEF,aAAcrD,eAC1BsB,UAAUX,aAAc,EAExB,IAAM,IAAI6C,EAAIf,OAAQgB,EAAIhB,OAASC,MAAOc,EAAIC,EAAGD,IAAO,CAEvD,MAAME,GAAK5D,IAAIoD,qBAAsBM,GACrCL,YAAahC,SAAU,EAAIuC,GAAI1C,MAAOH,KAEtCM,SAASR,aAAc,EAEvB,MAAMgD,KAAOxC,SAASyC,mBAAoBtC,UAAWC,YAAaE,aAkBlE,GAjBKkC,KAAOhC,kBAEXH,gBAAgBM,KAAMP,aAEjBG,iBAEJA,gBAAgBI,KAAML,aAIvBE,gBAAkBgC,KAClB/B,wBAA0B4B,EAC1B3B,6BAA+BkB,IAK3BY,KAAOxD,aAEX,OAAO,CAIT,CAED,IAKH,CAIC,IAAM,IAAI4C,GAAK,EAAGC,GADDa,YAAa9D,eACGgD,GAAKC,GAAID,KAAQ,CAEjDI,YAAa7B,UAAW,EAAIyB,GAAI7B,WAAYD,UAC5CK,UAAU8B,EAAEC,aAAcrD,eAC1BsB,UAAUgC,EAAED,aAAcrD,eAC1BsB,UAAUiC,EAAEF,aAAcrD,eAC1BsB,UAAUX,aAAc,EAExB,IAAM,IAAI6C,EAAIf,OAAQgB,EAAIhB,OAASC,MAAOc,EAAIC,EAAGD,IAAO,CAEvD,MAAME,GAAK5D,IAAIoD,qBAAsBM,GACrCL,YAAahC,SAAU,EAAIuC,GAAI1C,MAAOH,KAEtCM,SAASR,aAAc,EAEvB,MAAMgD,KAAOxC,SAASyC,mBAAoBtC,UAAWC,YAAaE,aAkBlE,GAjBKkC,KAAOhC,kBAEXH,gBAAgBM,KAAMP,aAEjBG,iBAEJA,gBAAgBI,KAAML,aAIvBE,gBAAkBgC,KAClB/B,wBAA0B4B,EAC1B3B,6BAA+BkB,IAK3BY,KAAOxD,aAEX,OAAO,CAIT,CAED,KAUJiB,qBAAqB0C,iBAAkB3C,UACvCC,qBAAqB0C,iBAAkBxC,WAElCK,kBAAoBtB,IAEjB,MAIDJ,QAAQ8D,MAMd9D,QAAQ8D,MAAMjC,KAAMN,iBAJpBvB,QAAQ8D,MAAQvC,gBAAgBwC,QAQjC/D,QAAQgE,SAAWtC,gBACnB1B,QAAQiE,UAAYtC,wBAEf1B,UAEGA,QAAQ6D,MACV7D,QAAQ6D,MAAMjC,KAAMJ,iBADFxB,QAAQ6D,MAAQrC,gBAAgBsC,QAEvD9D,QAAQ6D,MAAMV,aAAclE,YAC5BqC,gBAAgB6B,aAAclE,YAC9Be,QAAQ+D,SAAWzC,gBAAgB2C,IAAKjE,QAAQ6D,OAAQK,SACxDlE,QAAQgE,UAAYrC,8BAId5B,QAER","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-import"../../../../three/build/three.module.js";import{Vector3}from"../../../../three/build/three.core.js";const temp=new Vector3,temp1=new Vector3;function closestPointToPoint(bvh,point,target={},minThreshold=0,maxThreshold=1/0){const minThresholdSq=minThreshold*minThreshold,maxThresholdSq=maxThreshold*maxThreshold;let closestDistanceSq=1/0,closestDistanceTriIndex=null;if(bvh.shapecast({boundsTraverseOrder:box=>(temp.copy(point).clamp(box.min,box.max),temp.distanceToSquared(point)),intersectsBounds:(box,isLeaf,score)=>score<closestDistanceSq&&score<maxThresholdSq,intersectsTriangle:(tri,triIndex)=>{tri.closestPointToPoint(point,temp);const distSq=point.distanceToSquared(temp);return distSq<closestDistanceSq&&(temp1.copy(temp),closestDistanceSq=distSq,closestDistanceTriIndex=triIndex),distSq<minThresholdSq}}),closestDistanceSq===1/0)return null;const closestDistance=Math.sqrt(closestDistanceSq);return target.point?target.point.copy(temp1):target.point=temp1.clone(),target.distance=closestDistance,target.faceIndex=closestDistanceTriIndex,target}export{closestPointToPoint};
-//# sourceMappingURL=closestPointToPoint.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"closestPointToPoint.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/closestPointToPoint.js"],"sourcesContent":["import { Vector3 } from 'three';\n\nconst temp = /* @__PURE__ */ new Vector3();\nconst temp1 = /* @__PURE__ */ new Vector3();\n\nexport function closestPointToPoint(\n\tbvh,\n\tpoint,\n\ttarget = { },\n\tminThreshold = 0,\n\tmaxThreshold = Infinity,\n) {\n\n\t// early out if under minThreshold\n\t// skip checking if over maxThreshold\n\t// set minThreshold = maxThreshold to quickly check if a point is within a threshold\n\t// returns Infinity if no value found\n\tconst minThresholdSq = minThreshold * minThreshold;\n\tconst maxThresholdSq = maxThreshold * maxThreshold;\n\tlet closestDistanceSq = Infinity;\n\tlet closestDistanceTriIndex = null;\n\tbvh.shapecast(\n\n\t\t{\n\n\t\t\tboundsTraverseOrder: box => {\n\n\t\t\t\ttemp.copy( point ).clamp( box.min, box.max );\n\t\t\t\treturn temp.distanceToSquared( point );\n\n\t\t\t},\n\n\t\t\tintersectsBounds: ( box, isLeaf, score ) => {\n\n\t\t\t\treturn score < closestDistanceSq && score < maxThresholdSq;\n\n\t\t\t},\n\n\t\t\tintersectsTriangle: ( tri, triIndex ) => {\n\n\t\t\t\ttri.closestPointToPoint( point, temp );\n\t\t\t\tconst distSq = point.distanceToSquared( temp );\n\t\t\t\tif ( distSq < closestDistanceSq ) {\n\n\t\t\t\t\ttemp1.copy( temp );\n\t\t\t\t\tclosestDistanceSq = distSq;\n\t\t\t\t\tclosestDistanceTriIndex = triIndex;\n\n\t\t\t\t}\n\n\t\t\t\tif ( distSq < minThresholdSq ) {\n\n\t\t\t\t\treturn true;\n\n\t\t\t\t} else {\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t},\n\n\t\t}\n\n\t);\n\n\tif ( closestDistanceSq === Infinity ) return null;\n\n\tconst closestDistance = Math.sqrt( closestDistanceSq );\n\n\tif ( ! target.point ) target.point = temp1.clone();\n\telse target.point.copy( temp1 );\n\ttarget.distance = closestDistance,\n\ttarget.faceIndex = closestDistanceTriIndex;\n\n\treturn target;\n\n}\n"],"names":["temp","Vector3","temp1","closestPointToPoint","bvh","point","target","minThreshold","maxThreshold","Infinity","minThresholdSq","maxThresholdSq","closestDistanceSq","closestDistanceTriIndex","shapecast","boundsTraverseOrder","box","copy","clamp","min","max","distanceToSquared","intersectsBounds","isLeaf","score","intersectsTriangle","tri","triIndex","distSq","closestDistance","Math","sqrt","clone","distance","faceIndex"],"mappings":"2GAEA,MAAMA,KAAuB,IAAIC,QAC3BC,MAAwB,IAAID,QAE3B,SAASE,oBACfC,IACAC,MACAC,OAAS,CAAA,EACTC,aAAe,EACfC,aAAeC,KAOf,MAAMC,eAAiBH,aAAeA,aAChCI,eAAiBH,aAAeA,aACtC,IAAII,kBAAoBH,IACpBI,wBAA0B,KA8C9B,GA7CAT,IAAIU,UAEH,CAECC,oBAAqBC,MAEpBhB,KAAKiB,KAAMZ,OAAQa,MAAOF,IAAIG,IAAKH,IAAII,KAChCpB,KAAKqB,kBAAmBhB,QAIhCiB,iBAAkB,CAAEN,IAAKO,OAAQC,QAEzBA,MAAQZ,mBAAqBY,MAAQb,eAI7Cc,mBAAoB,CAAEC,IAAKC,YAE1BD,IAAIvB,oBAAqBE,MAAOL,MAChC,MAAM4B,OAASvB,MAAMgB,kBAAmBrB,MASxC,OARK4B,OAAShB,oBAEbV,MAAMe,KAAMjB,MACZY,kBAAoBgB,OACpBf,wBAA0Bc,UAItBC,OAASlB,kBAgBZE,oBAAsBH,IAAW,OAAO,KAE7C,MAAMoB,gBAAkBC,KAAKC,KAAMnB,mBAOnC,OALON,OAAOD,MACTC,OAAOD,MAAMY,KAAMf,OADFI,OAAOD,MAAQH,MAAM8B,QAE3C1B,OAAO2B,SAAWJ,gBAClBvB,OAAO4B,UAAYrB,wBAEZP,MAER","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-import"../../../../three/build/three.module.js";import{OrientedBox}from"../../math/OrientedBox.js";import{ExtendedTriangle}from"../../math/ExtendedTriangle.js";import{setTriangle}from"../../utils/TriangleUtilities.js";import{arrayToBox}from"../../utils/ArrayBoxUtilities.js";import{IS_LEAF,OFFSET,COUNT,BOUNDING_DATA_INDEX,RIGHT_NODE,LEFT_NODE}from"../utils/nodeBufferUtils.js";import{BufferStack}from"../utils/BufferStack.js";import{getTriCount}from"../build/geometryUtils.js";import{Matrix4,Box3}from"../../../../three/build/three.core.js";const boundingBox=new Box3,triangle=new ExtendedTriangle,triangle2=new ExtendedTriangle,invertedMat=new Matrix4,obb=new OrientedBox,obb2=new OrientedBox;function intersectsGeometry(bvh,root,otherGeometry,geometryToBvh){BufferStack.setBuffer(bvh._roots[root]);const result=_intersectsGeometry(0,bvh,otherGeometry,geometryToBvh);return BufferStack.clearBuffer(),result}function _intersectsGeometry(nodeIndex32,bvh,otherGeometry,geometryToBvh,cachedObb=null){const{float32Array:float32Array,uint16Array:uint16Array,uint32Array:uint32Array}=BufferStack;let nodeIndex16=2*nodeIndex32;if(null===cachedObb&&(otherGeometry.boundingBox||otherGeometry.computeBoundingBox(),obb.set(otherGeometry.boundingBox.min,otherGeometry.boundingBox.max,geometryToBvh),cachedObb=obb),!IS_LEAF(nodeIndex16,uint16Array)){const left=LEFT_NODE(nodeIndex32),right=RIGHT_NODE(nodeIndex32,uint32Array);return arrayToBox(BOUNDING_DATA_INDEX(left),float32Array,boundingBox),!(!cachedObb.intersectsBox(boundingBox)||!_intersectsGeometry(left,bvh,otherGeometry,geometryToBvh,cachedObb))||(arrayToBox(BOUNDING_DATA_INDEX(right),float32Array,boundingBox),!(!cachedObb.intersectsBox(boundingBox)||!_intersectsGeometry(right,bvh,otherGeometry,geometryToBvh,cachedObb)))}{const thisGeometry=bvh.geometry,thisIndex=thisGeometry.index,thisPos=thisGeometry.attributes.position,otherIndex=otherGeometry.index,otherPos=otherGeometry.attributes.position,offset=OFFSET(nodeIndex32,uint32Array),count=COUNT(nodeIndex16,uint16Array);if(invertedMat.copy(geometryToBvh).invert(),otherGeometry.boundsTree)return arrayToBox(BOUNDING_DATA_INDEX(nodeIndex32),float32Array,obb2),obb2.matrix.copy(invertedMat),obb2.needsUpdate=!0,otherGeometry.boundsTree.shapecast({intersectsBounds:box=>obb2.intersectsBox(box),intersectsTriangle:tri=>{tri.a.applyMatrix4(geometryToBvh),tri.b.applyMatrix4(geometryToBvh),tri.c.applyMatrix4(geometryToBvh),tri.needsUpdate=!0;for(let i=3*offset,l=3*(count+offset);i<l;i+=3)if(setTriangle(triangle2,i,thisIndex,thisPos),triangle2.needsUpdate=!0,tri.intersectsTriangle(triangle2))return!0;return!1}});{const otherTriangleCount=getTriCount(otherGeometry);for(let i=3*offset,l=3*(count+offset);i<l;i+=3){setTriangle(triangle,i,thisIndex,thisPos),triangle.a.applyMatrix4(invertedMat),triangle.b.applyMatrix4(invertedMat),triangle.c.applyMatrix4(invertedMat),triangle.needsUpdate=!0;for(let i2=0,l2=3*otherTriangleCount;i2<l2;i2+=3)if(setTriangle(triangle2,i2,otherIndex,otherPos),triangle2.needsUpdate=!0,triangle.intersectsTriangle(triangle2))return!0}}}}export{intersectsGeometry};
-//# sourceMappingURL=intersectsGeometry.generated.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"intersectsGeometry.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry.generated.js"],"sourcesContent":["import { Box3, Matrix4 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { ExtendedTriangle } from '../../math/ExtendedTriangle.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { IS_LEAF, OFFSET, COUNT, BOUNDING_DATA_INDEX, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { getTriCount } from '../build/geometryUtils.js';\n\n/*****************************************************************/\n/* This file is generated from \"intersectsGeometry.template.js\". */\n/*****************************************************************/\n/* eslint-disable indent */\n\nconst boundingBox = /* @__PURE__ */ new Box3();\nconst triangle = /* @__PURE__ */ new ExtendedTriangle();\nconst triangle2 = /* @__PURE__ */ new ExtendedTriangle();\nconst invertedMat = /* @__PURE__ */ new Matrix4();\n\nconst obb = /* @__PURE__ */ new OrientedBox();\nconst obb2 = /* @__PURE__ */ new OrientedBox();\n\nfunction intersectsGeometry( bvh, root, otherGeometry, geometryToBvh ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _intersectsGeometry( 0, bvh, otherGeometry, geometryToBvh );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _intersectsGeometry( nodeIndex32, bvh, otherGeometry, geometryToBvh, cachedObb = null ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 * 2;\n\n\tif ( cachedObb === null ) {\n\n\t\tif ( ! otherGeometry.boundingBox ) {\n\n\t\t\totherGeometry.computeBoundingBox();\n\n\t\t}\n\n\t\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\t\tcachedObb = obb;\n\n\t}\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst thisGeometry = bvh.geometry;\n\t\tconst thisIndex = thisGeometry.index;\n\t\tconst thisPos = thisGeometry.attributes.position;\n\n\t\tconst otherIndex = otherGeometry.index;\n\t\tconst otherPos = otherGeometry.attributes.position;\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t// get the inverse of the geometry matrix so we can transform our triangles into the\n\t\t// geometry space we're trying to test. We assume there are fewer triangles being checked\n\t\t// here.\n\t\tinvertedMat.copy( geometryToBvh ).invert();\n\n\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t// if there's a bounds tree\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( nodeIndex32 ), float32Array, obb2 );\n\t\t\tobb2.matrix.copy( invertedMat );\n\t\t\tobb2.needsUpdate = true;\n\n\t\t\t// TODO: use a triangle iteration function here\n\t\t\tconst res = otherGeometry.boundsTree.shapecast( {\n\n\t\t\t\tintersectsBounds: box => obb2.intersectsBox( box ),\n\n\t\t\t\tintersectsTriangle: tri => {\n\n\t\t\t\t\ttri.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.needsUpdate = true;\n\n\n\t\t\t\t\tfor ( let i = offset * 3, l = ( count + offset ) * 3; i < l; i += 3 ) {\n\n\t\t\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\t\t\tsetTriangle( triangle2, i, thisIndex, thisPos );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\t\t\t\t\t\tif ( tri.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t\treturn res;\n\n\t\t} else {\n\n\t\t\t// if we're just dealing with raw geometry\n\t\t\tconst otherTriangleCount = getTriCount( otherGeometry );\n\n\n\t\t\tfor ( let i = offset * 3, l = ( count + offset ) * 3; i < l; i += 3 ) {\n\n\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\tsetTriangle( triangle, i, thisIndex, thisPos );\n\n\n\t\t\t\ttriangle.a.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.b.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.c.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\tfor ( let i2 = 0, l2 = otherTriangleCount * 3; i2 < l2; i2 += 3 ) {\n\n\t\t\t\t\tsetTriangle( triangle2, i2, otherIndex, otherPos );\n\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\tif ( triangle.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\n\t\t\t}\n\n\n\t\t}\n\n\t} else {\n\n\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( left ), float32Array, boundingBox );\n\t\tconst leftIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( left, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( leftIntersection ) return true;\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( right ), float32Array, boundingBox );\n\t\tconst rightIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( right, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( rightIntersection ) return true;\n\n\t\treturn false;\n\n\t}\n\n}\n\nexport { intersectsGeometry };\n"],"names":["boundingBox","Box3","triangle","ExtendedTriangle","triangle2","invertedMat","Matrix4","obb","OrientedBox","obb2","intersectsGeometry","bvh","root","otherGeometry","geometryToBvh","BufferStack","setBuffer","_roots","result","_intersectsGeometry","clearBuffer","nodeIndex32","cachedObb","float32Array","uint16Array","uint32Array","nodeIndex16","computeBoundingBox","set","min","max","IS_LEAF","left","LEFT_NODE","right","RIGHT_NODE","arrayToBox","BOUNDING_DATA_INDEX","intersectsBox","thisGeometry","geometry","thisIndex","index","thisPos","attributes","position","otherIndex","otherPos","offset","OFFSET","count","COUNT","copy","invert","boundsTree","matrix","needsUpdate","shapecast","intersectsBounds","box","intersectsTriangle","tri","a","applyMatrix4","b","c","i","l","setTriangle","otherTriangleCount","getTriCount","i2","l2"],"mappings":"8hBAcA,MAAMA,YAA8B,IAAIC,KAClCC,SAA2B,IAAIC,iBAC/BC,UAA4B,IAAID,iBAChCE,YAA8B,IAAIC,QAElCC,IAAsB,IAAIC,YAC1BC,KAAuB,IAAID,YAEjC,SAASE,mBAAoBC,IAAKC,KAAMC,cAAeC,eAEtDC,YAAYC,UAAWL,IAAIM,OAAQL,OACnC,MAAMM,OAASC,oBAAqB,EAAGR,IAAKE,cAAeC,eAG3D,OAFAC,YAAYK,cAELF,MAER,CAEA,SAASC,oBAAqBE,YAAaV,IAAKE,cAAeC,cAAeQ,UAAY,MAEzF,MAAMC,aAAEA,aAAYC,YAAEA,YAAWC,YAAEA,aAAgBV,YACnD,IAAIW,YAA4B,EAAdL,YAgBlB,GAdmB,OAAdC,YAEGT,cAAcb,aAEpBa,cAAcc,qBAIfpB,IAAIqB,IAAKf,cAAcb,YAAY6B,IAAKhB,cAAcb,YAAY8B,IAAKhB,eACvEQ,UAAYf,MAIEwB,QAASL,YAAaF,aAgG9B,CAEN,MAAMQ,KAAOC,UAAWZ,aAClBa,MAAQC,WAAYd,YAAaI,aAOvC,OALAW,WAAYC,oBAAqBL,MAAQT,aAAcvB,gBAEtDsB,UAAUgB,cAAetC,eACzBmB,oBAAqBa,KAAMrB,IAAKE,cAAeC,cAAeQ,cAI/Dc,WAAYC,oBAAqBH,OAASX,aAAcvB,gBAEvDsB,UAAUgB,cAAetC,eACzBmB,oBAAqBe,MAAOvB,IAAKE,cAAeC,cAAeQ,YAMjE,CApHc,CAEb,MAAMiB,aAAe5B,IAAI6B,SACnBC,UAAYF,aAAaG,MACzBC,QAAUJ,aAAaK,WAAWC,SAElCC,WAAajC,cAAc6B,MAC3BK,SAAWlC,cAAc+B,WAAWC,SAEpCG,OAASC,OAAQ5B,YAAaI,aAC9ByB,MAAQC,MAAOzB,YAAaF,aAOlC,GAFAnB,YAAY+C,KAAMtC,eAAgBuC,SAE7BxC,cAAcyC,WAwClB,OArCAlB,WAAYC,oBAAqBhB,aAAeE,aAAcd,MAC9DA,KAAK8C,OAAOH,KAAM/C,aAClBI,KAAK+C,aAAc,EAGP3C,cAAcyC,WAAWG,UAAW,CAE/CC,iBAAkBC,KAAOlD,KAAK6B,cAAeqB,KAE7CC,mBAAoBC,MAEnBA,IAAIC,EAAEC,aAAcjD,eACpB+C,IAAIG,EAAED,aAAcjD,eACpB+C,IAAII,EAAEF,aAAcjD,eACpB+C,IAAIL,aAAc,EAGlB,IAAM,IAAIU,EAAa,EAATlB,OAAYmB,EAAyB,GAAnBjB,MAAQF,QAAckB,EAAIC,EAAGD,GAAK,EAKjE,GAFAE,YAAahE,UAAW8D,EAAGzB,UAAWE,SACtCvC,UAAUoD,aAAc,EACnBK,IAAID,mBAAoBxD,WAE5B,OAAO,EAOT,OAAO,KAQH,CAGN,MAAMiE,mBAAqBC,YAAazD,eAGxC,IAAM,IAAIqD,EAAa,EAATlB,OAAYmB,EAAyB,GAAnBjB,MAAQF,QAAckB,EAAIC,EAAGD,GAAK,EAAI,CAGrEE,YAAalE,SAAUgE,EAAGzB,UAAWE,SAGrCzC,SAAS4D,EAAEC,aAAc1D,aACzBH,SAAS8D,EAAED,aAAc1D,aACzBH,SAAS+D,EAAEF,aAAc1D,aACzBH,SAASsD,aAAc,EAEvB,IAAM,IAAIe,GAAK,EAAGC,GAA0B,EAArBH,mBAAwBE,GAAKC,GAAID,IAAM,EAK7D,GAHAH,YAAahE,UAAWmE,GAAIzB,WAAYC,UACxC3C,UAAUoD,aAAc,EAEnBtD,SAAS0D,mBAAoBxD,WAEjC,OAAO,CAOV,CAGD,CAED,CAuBD","x_google_ignoreList":[0]}

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

@@ -1,2 +0,0 @@
-import"../../../../three/build/three.module.js";import{OrientedBox}from"../../math/OrientedBox.js";import{ExtendedTriangle}from"../../math/ExtendedTriangle.js";import{setTriangle}from"../../utils/TriangleUtilities.js";import{arrayToBox}from"../../utils/ArrayBoxUtilities.js";import{IS_LEAF,OFFSET,COUNT,BOUNDING_DATA_INDEX,RIGHT_NODE,LEFT_NODE}from"../utils/nodeBufferUtils.js";import{BufferStack}from"../utils/BufferStack.js";import{getTriCount}from"../build/geometryUtils.js";import{Matrix4,Box3}from"../../../../three/build/three.core.js";const boundingBox=new Box3,triangle=new ExtendedTriangle,triangle2=new ExtendedTriangle,invertedMat=new Matrix4,obb=new OrientedBox,obb2=new OrientedBox;function intersectsGeometry_indirect(bvh,root,otherGeometry,geometryToBvh){BufferStack.setBuffer(bvh._roots[root]);const result=_intersectsGeometry(0,bvh,otherGeometry,geometryToBvh);return BufferStack.clearBuffer(),result}function _intersectsGeometry(nodeIndex32,bvh,otherGeometry,geometryToBvh,cachedObb=null){const{float32Array:float32Array,uint16Array:uint16Array,uint32Array:uint32Array}=BufferStack;let nodeIndex16=2*nodeIndex32;if(null===cachedObb&&(otherGeometry.boundingBox||otherGeometry.computeBoundingBox(),obb.set(otherGeometry.boundingBox.min,otherGeometry.boundingBox.max,geometryToBvh),cachedObb=obb),!IS_LEAF(nodeIndex16,uint16Array)){const left=LEFT_NODE(nodeIndex32),right=RIGHT_NODE(nodeIndex32,uint32Array);return arrayToBox(BOUNDING_DATA_INDEX(left),float32Array,boundingBox),!(!cachedObb.intersectsBox(boundingBox)||!_intersectsGeometry(left,bvh,otherGeometry,geometryToBvh,cachedObb))||(arrayToBox(BOUNDING_DATA_INDEX(right),float32Array,boundingBox),!(!cachedObb.intersectsBox(boundingBox)||!_intersectsGeometry(right,bvh,otherGeometry,geometryToBvh,cachedObb)))}{const thisGeometry=bvh.geometry,thisIndex=thisGeometry.index,thisPos=thisGeometry.attributes.position,otherIndex=otherGeometry.index,otherPos=otherGeometry.attributes.position,offset=OFFSET(nodeIndex32,uint32Array),count=COUNT(nodeIndex16,uint16Array);if(invertedMat.copy(geometryToBvh).invert(),otherGeometry.boundsTree)return arrayToBox(BOUNDING_DATA_INDEX(nodeIndex32),float32Array,obb2),obb2.matrix.copy(invertedMat),obb2.needsUpdate=!0,otherGeometry.boundsTree.shapecast({intersectsBounds:box=>obb2.intersectsBox(box),intersectsTriangle:tri=>{tri.a.applyMatrix4(geometryToBvh),tri.b.applyMatrix4(geometryToBvh),tri.c.applyMatrix4(geometryToBvh),tri.needsUpdate=!0;for(let i=offset,l=count+offset;i<l;i++)if(setTriangle(triangle2,3*bvh.resolveTriangleIndex(i),thisIndex,thisPos),triangle2.needsUpdate=!0,tri.intersectsTriangle(triangle2))return!0;return!1}});{const otherTriangleCount=getTriCount(otherGeometry);for(let i=offset,l=count+offset;i<l;i++){const ti=bvh.resolveTriangleIndex(i);setTriangle(triangle,3*ti,thisIndex,thisPos),triangle.a.applyMatrix4(invertedMat),triangle.b.applyMatrix4(invertedMat),triangle.c.applyMatrix4(invertedMat),triangle.needsUpdate=!0;for(let i2=0,l2=3*otherTriangleCount;i2<l2;i2+=3)if(setTriangle(triangle2,i2,otherIndex,otherPos),triangle2.needsUpdate=!0,triangle.intersectsTriangle(triangle2))return!0}}}}export{intersectsGeometry_indirect};
-//# sourceMappingURL=intersectsGeometry_indirect.generated.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"intersectsGeometry_indirect.generated.js","sources":["../../../../../../../../../../../../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry_indirect.generated.js"],"sourcesContent":["import { Box3, Matrix4 } from 'three';\nimport { OrientedBox } from '../../math/OrientedBox.js';\nimport { ExtendedTriangle } from '../../math/ExtendedTriangle.js';\nimport { setTriangle } from '../../utils/TriangleUtilities.js';\nimport { arrayToBox } from '../../utils/ArrayBoxUtilities.js';\nimport { IS_LEAF, OFFSET, COUNT, BOUNDING_DATA_INDEX, LEFT_NODE, RIGHT_NODE } from '../utils/nodeBufferUtils.js';\nimport { BufferStack } from '../utils/BufferStack.js';\nimport { getTriCount } from '../build/geometryUtils.js';\n\n/*****************************************************************/\n/* This file is generated from \"intersectsGeometry.template.js\". */\n/*****************************************************************/\n/* eslint-disable indent */\n\nconst boundingBox = /* @__PURE__ */ new Box3();\nconst triangle = /* @__PURE__ */ new ExtendedTriangle();\nconst triangle2 = /* @__PURE__ */ new ExtendedTriangle();\nconst invertedMat = /* @__PURE__ */ new Matrix4();\n\nconst obb = /* @__PURE__ */ new OrientedBox();\nconst obb2 = /* @__PURE__ */ new OrientedBox();\n\nfunction intersectsGeometry_indirect( bvh, root, otherGeometry, geometryToBvh ) {\n\n\tBufferStack.setBuffer( bvh._roots[ root ] );\n\tconst result = _intersectsGeometry( 0, bvh, otherGeometry, geometryToBvh );\n\tBufferStack.clearBuffer();\n\n\treturn result;\n\n}\n\nfunction _intersectsGeometry( nodeIndex32, bvh, otherGeometry, geometryToBvh, cachedObb = null ) {\n\n\tconst { float32Array, uint16Array, uint32Array } = BufferStack;\n\tlet nodeIndex16 = nodeIndex32 * 2;\n\n\tif ( cachedObb === null ) {\n\n\t\tif ( ! otherGeometry.boundingBox ) {\n\n\t\t\totherGeometry.computeBoundingBox();\n\n\t\t}\n\n\t\tobb.set( otherGeometry.boundingBox.min, otherGeometry.boundingBox.max, geometryToBvh );\n\t\tcachedObb = obb;\n\n\t}\n\n\tconst isLeaf = IS_LEAF( nodeIndex16, uint16Array );\n\tif ( isLeaf ) {\n\n\t\tconst thisGeometry = bvh.geometry;\n\t\tconst thisIndex = thisGeometry.index;\n\t\tconst thisPos = thisGeometry.attributes.position;\n\n\t\tconst otherIndex = otherGeometry.index;\n\t\tconst otherPos = otherGeometry.attributes.position;\n\n\t\tconst offset = OFFSET( nodeIndex32, uint32Array );\n\t\tconst count = COUNT( nodeIndex16, uint16Array );\n\n\t\t// get the inverse of the geometry matrix so we can transform our triangles into the\n\t\t// geometry space we're trying to test. We assume there are fewer triangles being checked\n\t\t// here.\n\t\tinvertedMat.copy( geometryToBvh ).invert();\n\n\t\tif ( otherGeometry.boundsTree ) {\n\n\t\t\t// if there's a bounds tree\n\t\t\tarrayToBox( BOUNDING_DATA_INDEX( nodeIndex32 ), float32Array, obb2 );\n\t\t\tobb2.matrix.copy( invertedMat );\n\t\t\tobb2.needsUpdate = true;\n\n\t\t\t// TODO: use a triangle iteration function here\n\t\t\tconst res = otherGeometry.boundsTree.shapecast( {\n\n\t\t\t\tintersectsBounds: box => obb2.intersectsBox( box ),\n\n\t\t\t\tintersectsTriangle: tri => {\n\n\t\t\t\t\ttri.a.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.b.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.c.applyMatrix4( geometryToBvh );\n\t\t\t\t\ttri.needsUpdate = true;\n\n\t\t\t\t\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\t\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\t\t\tsetTriangle( triangle2, 3 * bvh.resolveTriangleIndex( i ), thisIndex, thisPos );\n\t\t\t\t\t\ttriangle2.needsUpdate = true;\n\t\t\t\t\t\tif ( tri.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\n\t\t\t\t\treturn false;\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t\treturn res;\n\n\t\t} else {\n\n\t\t\t// if we're just dealing with raw geometry\n\t\t\tconst otherTriangleCount = getTriCount( otherGeometry );\n\n\t\t\tfor ( let i = offset, l = count + offset; i < l; i ++ ) {\n\n\t\t\t\t// this triangle needs to be transformed into the current BVH coordinate frame\n\t\t\t\tconst ti = bvh.resolveTriangleIndex( i );\n\t\t\t\tsetTriangle( triangle, 3 * ti, thisIndex, thisPos );\n\n\n\t\t\t\ttriangle.a.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.b.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.c.applyMatrix4( invertedMat );\n\t\t\t\ttriangle.needsUpdate = true;\n\n\t\t\t\tfor ( let i2 = 0, l2 = otherTriangleCount * 3; i2 < l2; i2 += 3 ) {\n\n\t\t\t\t\tsetTriangle( triangle2, i2, otherIndex, otherPos );\n\t\t\t\t\ttriangle2.needsUpdate = true;\n\n\t\t\t\t\tif ( triangle.intersectsTriangle( triangle2 ) ) {\n\n\t\t\t\t\t\treturn true;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\n\t\t}\n\n\t} else {\n\n\t\tconst left = LEFT_NODE( nodeIndex32 );\n\t\tconst right = RIGHT_NODE( nodeIndex32, uint32Array );\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( left ), float32Array, boundingBox );\n\t\tconst leftIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( left, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( leftIntersection ) return true;\n\n\t\tarrayToBox( BOUNDING_DATA_INDEX( right ), float32Array, boundingBox );\n\t\tconst rightIntersection =\n\t\t\tcachedObb.intersectsBox( boundingBox ) &&\n\t\t\t_intersectsGeometry( right, bvh, otherGeometry, geometryToBvh, cachedObb );\n\n\t\tif ( rightIntersection ) return true;\n\n\t\treturn false;\n\n\t}\n\n}\n\nexport { intersectsGeometry_indirect };\n"],"names":["boundingBox","Box3","triangle","ExtendedTriangle","triangle2","invertedMat","Matrix4","obb","OrientedBox","obb2","intersectsGeometry_indirect","bvh","root","otherGeometry","geometryToBvh","BufferStack","setBuffer","_roots","result","_intersectsGeometry","clearBuffer","nodeIndex32","cachedObb","float32Array","uint16Array","uint32Array","nodeIndex16","computeBoundingBox","set","min","max","IS_LEAF","left","LEFT_NODE","right","RIGHT_NODE","arrayToBox","BOUNDING_DATA_INDEX","intersectsBox","thisGeometry","geometry","thisIndex","index","thisPos","attributes","position","otherIndex","otherPos","offset","OFFSET","count","COUNT","copy","invert","boundsTree","matrix","needsUpdate","shapecast","intersectsBounds","box","intersectsTriangle","tri","a","applyMatrix4","b","c","i","l","setTriangle","resolveTriangleIndex","otherTriangleCount","getTriCount","ti","i2","l2"],"mappings":"8hBAcA,MAAMA,YAA8B,IAAIC,KAClCC,SAA2B,IAAIC,iBAC/BC,UAA4B,IAAID,iBAChCE,YAA8B,IAAIC,QAElCC,IAAsB,IAAIC,YAC1BC,KAAuB,IAAID,YAEjC,SAASE,4BAA6BC,IAAKC,KAAMC,cAAeC,eAE/DC,YAAYC,UAAWL,IAAIM,OAAQL,OACnC,MAAMM,OAASC,oBAAqB,EAAGR,IAAKE,cAAeC,eAG3D,OAFAC,YAAYK,cAELF,MAER,CAEA,SAASC,oBAAqBE,YAAaV,IAAKE,cAAeC,cAAeQ,UAAY,MAEzF,MAAMC,aAAEA,aAAYC,YAAEA,YAAWC,YAAEA,aAAgBV,YACnD,IAAIW,YAA4B,EAAdL,YAgBlB,GAdmB,OAAdC,YAEGT,cAAcb,aAEpBa,cAAcc,qBAIfpB,IAAIqB,IAAKf,cAAcb,YAAY6B,IAAKhB,cAAcb,YAAY8B,IAAKhB,eACvEQ,UAAYf,MAIEwB,QAASL,YAAaF,aA8F9B,CAEN,MAAMQ,KAAOC,UAAWZ,aAClBa,MAAQC,WAAYd,YAAaI,aAOvC,OALAW,WAAYC,oBAAqBL,MAAQT,aAAcvB,gBAEtDsB,UAAUgB,cAAetC,eACzBmB,oBAAqBa,KAAMrB,IAAKE,cAAeC,cAAeQ,cAI/Dc,WAAYC,oBAAqBH,OAASX,aAAcvB,gBAEvDsB,UAAUgB,cAAetC,eACzBmB,oBAAqBe,MAAOvB,IAAKE,cAAeC,cAAeQ,YAMjE,CAlHc,CAEb,MAAMiB,aAAe5B,IAAI6B,SACnBC,UAAYF,aAAaG,MACzBC,QAAUJ,aAAaK,WAAWC,SAElCC,WAAajC,cAAc6B,MAC3BK,SAAWlC,cAAc+B,WAAWC,SAEpCG,OAASC,OAAQ5B,YAAaI,aAC9ByB,MAAQC,MAAOzB,YAAaF,aAOlC,GAFAnB,YAAY+C,KAAMtC,eAAgBuC,SAE7BxC,cAAcyC,WAuClB,OApCAlB,WAAYC,oBAAqBhB,aAAeE,aAAcd,MAC9DA,KAAK8C,OAAOH,KAAM/C,aAClBI,KAAK+C,aAAc,EAGP3C,cAAcyC,WAAWG,UAAW,CAE/CC,iBAAkBC,KAAOlD,KAAK6B,cAAeqB,KAE7CC,mBAAoBC,MAEnBA,IAAIC,EAAEC,aAAcjD,eACpB+C,IAAIG,EAAED,aAAcjD,eACpB+C,IAAII,EAAEF,aAAcjD,eACpB+C,IAAIL,aAAc,EAElB,IAAM,IAAIU,EAAIlB,OAAQmB,EAAIjB,MAAQF,OAAQkB,EAAIC,EAAGD,IAKhD,GAFAE,YAAahE,UAAW,EAAIO,IAAI0D,qBAAsBH,GAAKzB,UAAWE,SACtEvC,UAAUoD,aAAc,EACnBK,IAAID,mBAAoBxD,WAE5B,OAAO,EAOT,OAAO,KAQH,CAGN,MAAMkE,mBAAqBC,YAAa1D,eAExC,IAAM,IAAIqD,EAAIlB,OAAQmB,EAAIjB,MAAQF,OAAQkB,EAAIC,EAAGD,IAAO,CAGvD,MAAMM,GAAK7D,IAAI0D,qBAAsBH,GACrCE,YAAalE,SAAU,EAAIsE,GAAI/B,UAAWE,SAG1CzC,SAAS4D,EAAEC,aAAc1D,aACzBH,SAAS8D,EAAED,aAAc1D,aACzBH,SAAS+D,EAAEF,aAAc1D,aACzBH,SAASsD,aAAc,EAEvB,IAAM,IAAIiB,GAAK,EAAGC,GAA0B,EAArBJ,mBAAwBG,GAAKC,GAAID,IAAM,EAK7D,GAHAL,YAAahE,UAAWqE,GAAI3B,WAAYC,UACxC3C,UAAUoD,aAAc,EAEnBtD,SAAS0D,mBAAoBxD,WAEjC,OAAO,CAMV,CAGD,CAED,CAuBD","x_google_ignoreList":[0]}

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

@@ -1 +0,0 @@
-{"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.map

@@ -1 +0,0 @@
-{"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.map

@@ -1 +0,0 @@
-{"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.map

@@ -1 +0,0 @@
-{"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]}