npm - @hellpig/anarchy-engine - Versions diffs - 21.3.1 → 22.0.0 - Mend

@hellpig/anarchy-engine 21.3.1 → 22.0.0

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

Files changed (2816) hide show

package/dist/node_modules/three-mesh-bvh/src/objects/MeshBVHHelper.js ADDED Viewed

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

package/dist/node_modules/three-mesh-bvh/src/objects/MeshBVHHelper.js.map ADDED Viewed

@@ -0,0 +1 @@

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

package/dist/node_modules/three-mesh-bvh/src/utils/ArrayBoxUtilities.js ADDED Viewed

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

package/dist/node_modules/three-mesh-bvh/src/utils/ArrayBoxUtilities.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"ArrayBoxUtilities.js","sources":["../../../../../../../node_modules/three-mesh-bvh/src/utils/ArrayBoxUtilities.js"],"sourcesContent":["export function arrayToBox( nodeIndex32, array, target ) {\n\n\ttarget.min.x = array[ nodeIndex32 ];\n\ttarget.min.y = array[ nodeIndex32 + 1 ];\n\ttarget.min.z = array[ nodeIndex32 + 2 ];\n\n\ttarget.max.x = array[ nodeIndex32 + 3 ];\n\ttarget.max.y = array[ nodeIndex32 + 4 ];\n\ttarget.max.z = array[ nodeIndex32 + 5 ];\n\n\treturn target;\n\n}\n\nexport function makeEmptyBounds( target ) {\n\n\ttarget[ 0 ] = target[ 1 ] = target[ 2 ] = Infinity;\n\ttarget[ 3 ] = target[ 4 ] = target[ 5 ] = - Infinity;\n\n}\n\nexport function getLongestEdgeIndex( bounds ) {\n\n\tlet splitDimIdx = - 1;\n\tlet splitDist = - Infinity;\n\n\tfor ( let i = 0; i < 3; i ++ ) {\n\n\t\tconst dist = bounds[ i + 3 ] - bounds[ i ];\n\t\tif ( dist > splitDist ) {\n\n\t\t\tsplitDist = dist;\n\t\t\tsplitDimIdx = i;\n\n\t\t}\n\n\t}\n\n\treturn splitDimIdx;\n\n}\n\n// copies bounds a into bounds b\nexport function copyBounds( source, target ) {\n\n\ttarget.set( source );\n\n}\n\n// sets bounds target to the union of bounds a and b\nexport function unionBounds( a, b, target ) {\n\n\tlet aVal, bVal;\n\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\tconst d3 = d + 3;\n\n\t\t// set the minimum values\n\t\taVal = a[ d ];\n\t\tbVal = b[ d ];\n\t\ttarget[ d ] = aVal < bVal ? aVal : bVal;\n\n\t\t// set the max values\n\t\taVal = a[ d3 ];\n\t\tbVal = b[ d3 ];\n\t\ttarget[ d3 ] = aVal > bVal ? aVal : bVal;\n\n\t}\n\n}\n\n// expands the given bounds by the provided triangle bounds\nexport function expandByTriangleBounds( startIndex, triangleBounds, bounds ) {\n\n\tfor ( let d = 0; d < 3; d ++ ) {\n\n\t\tconst tCenter = triangleBounds[ startIndex + 2 * d ];\n\t\tconst tHalf = triangleBounds[ startIndex + 2 * d + 1 ];\n\n\t\tconst tMin = tCenter - tHalf;\n\t\tconst tMax = tCenter + tHalf;\n\n\t\tif ( tMin < bounds[ d ] ) {\n\n\t\t\tbounds[ d ] = tMin;\n\n\t\t}\n\n\t\tif ( tMax > bounds[ d + 3 ] ) {\n\n\t\t\tbounds[ d + 3 ] = tMax;\n\n\t\t}\n\n\t}\n\n}\n\n// compute bounds surface area\nexport function computeSurfaceArea( bounds ) {\n\n\tconst d0 = bounds[ 3 ] - bounds[ 0 ];\n\tconst d1 = bounds[ 4 ] - bounds[ 1 ];\n\tconst d2 = bounds[ 5 ] - bounds[ 2 ];\n\n\treturn 2 * ( d0 * d1 + d1 * d2 + d2 * d0 );\n\n}\n"],"names":["arrayToBox","nodeIndex32","array","target","min","x","y","z","max","getLongestEdgeIndex","bounds","splitDimIdx","splitDist","i","dist","copyBounds","source","set","unionBounds","a","b","aVal","bVal","d","d3","expandByTriangleBounds","startIndex","triangleBounds","tCenter","tHalf","tMin","tMax","computeSurfaceArea","d0","d1","d2"],"mappings":"AAAO,SAASA,WAAYC,YAAaC,MAAOC,QAU/C,OARAA,OAAOC,IAAIC,EAAIH,MAAOD,aACtBE,OAAOC,IAAIE,EAAIJ,MAAOD,YAAc,GACpCE,OAAOC,IAAIG,EAAIL,MAAOD,YAAc,GAEpCE,OAAOK,IAAIH,EAAIH,MAAOD,YAAc,GACpCE,OAAOK,IAAIF,EAAIJ,MAAOD,YAAc,GACpCE,OAAOK,IAAID,EAAIL,MAAOD,YAAc,GAE7BE,MAER,CASO,SAASM,oBAAqBC,QAEpC,IAAIC,aAAc,EACdC,WAAY,IAEhB,IAAM,IAAIC,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAMC,KAAOJ,OAAQG,EAAI,GAAMH,OAAQG,GAClCC,KAAOF,YAEXA,UAAYE,KACZH,YAAcE,EAIhB,CAEA,OAAOF,WAER,CAGO,SAASI,WAAYC,OAAQb,QAEnCA,OAAOc,IAAKD,OAEb,CAGO,SAASE,YAAaC,EAAGC,EAAGjB,QAElC,IAAIkB,KAAMC,KACV,IAAM,IAAIC,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAMC,GAAKD,EAAI,EAGfF,KAAOF,EAAGI,GACVD,KAAOF,EAAGG,GACVpB,OAAQoB,GAAMF,KAAOC,KAAOD,KAAOC,KAGnCD,KAAOF,EAAGK,IACVF,KAAOF,EAAGI,IACVrB,OAAQqB,IAAOH,KAAOC,KAAOD,KAAOC,IAErC,CAED,CAGO,SAASG,uBAAwBC,WAAYC,eAAgBjB,QAEnE,IAAM,IAAIa,EAAI,EAAGA,EAAI,EAAGA,IAAO,CAE9B,MAAMK,QAAUD,eAAgBD,WAAa,EAAIH,GAC3CM,MAAQF,eAAgBD,WAAa,EAAIH,EAAI,GAE7CO,KAAOF,QAAUC,MACjBE,KAAOH,QAAUC,MAElBC,KAAOpB,OAAQa,KAEnBb,OAAQa,GAAMO,MAIVC,KAAOrB,OAAQa,EAAI,KAEvBb,OAAQa,EAAI,GAAMQ,KAIpB,CAED,CAGO,SAASC,mBAAoBtB,QAEnC,MAAMuB,GAAKvB,OAAQ,GAAMA,OAAQ,GAC3BwB,GAAKxB,OAAQ,GAAMA,OAAQ,GAC3ByB,GAAKzB,OAAQ,GAAMA,OAAQ,GAEjC,OAAO,GAAMuB,GAAKC,GAAKA,GAAKC,GAAKA,GAAKF,GAEvC","x_google_ignoreList":[0]}

package/dist/node_modules/three-mesh-bvh/src/utils/BufferUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ function isSharedArrayBufferSupported(){return"undefined"!=typeof SharedArrayBuffer}export{isSharedArrayBufferSupported};
2	+ //# sourceMappingURL=BufferUtils.js.map

package/dist/node_modules/three-mesh-bvh/src/utils/BufferUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"BufferUtils.js","sources":["../../../../../../../node_modules/three-mesh-bvh/src/utils/BufferUtils.js"],"sourcesContent":["export function isSharedArrayBufferSupported() {\n\n\treturn typeof SharedArrayBuffer !== 'undefined';\n\n}\n\nexport function convertToBufferType( array, BufferConstructor ) {\n\n\tif ( array === null ) {\n\n\t\treturn array;\n\n\t} else if ( array.buffer ) {\n\n\t\tconst buffer = array.buffer;\n\t\tif ( buffer.constructor === BufferConstructor ) {\n\n\t\t\treturn array;\n\n\t\t}\n\n\t\tconst ArrayConstructor = array.constructor;\n\t\tconst result = new ArrayConstructor( new BufferConstructor( buffer.byteLength ) );\n\t\tresult.set( array );\n\t\treturn result;\n\n\t} else {\n\n\t\tif ( array.constructor === BufferConstructor ) {\n\n\t\t\treturn array;\n\n\t\t}\n\n\t\tconst result = new BufferConstructor( array.byteLength );\n\t\tnew Uint8Array( result ).set( new Uint8Array( array ) );\n\t\treturn result;\n\n\t}\n\n}\n"],"names":["isSharedArrayBufferSupported","SharedArrayBuffer"],"mappings":"AAAO,SAASA,+BAEf,MAAoC,oBAAtBC,iBAEf","x_google_ignoreList":[0]}

package/dist/node_modules/three-mesh-bvh/src/utils/ExtendedTrianglePool.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import{ExtendedTriangle}from"../math/ExtendedTriangle.js";import{PrimitivePool}from"./PrimitivePool.js";class ExtendedTrianglePoolBase extends PrimitivePool{constructor(){super(()=>new ExtendedTriangle)}}const ExtendedTrianglePool=new ExtendedTrianglePoolBase;export{ExtendedTrianglePool};
2	+ //# sourceMappingURL=ExtendedTrianglePool.js.map

package/dist/node_modules/three-mesh-bvh/src/utils/ExtendedTrianglePool.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"ExtendedTrianglePool.js","sources":["../../../../../../../node_modules/three-mesh-bvh/src/utils/ExtendedTrianglePool.js"],"sourcesContent":["import { ExtendedTriangle } from '../math/ExtendedTriangle.js';\nimport { PrimitivePool } from './PrimitivePool.js';\n\nclass ExtendedTrianglePoolBase extends PrimitivePool {\n\n\tconstructor() {\n\n\t\tsuper( () => new ExtendedTriangle() );\n\n\t}\n\n}\n\nexport const ExtendedTrianglePool = /* @__PURE__ */ new ExtendedTrianglePoolBase();\n"],"names":["ExtendedTrianglePoolBase","PrimitivePool","constructor","super","ExtendedTriangle","ExtendedTrianglePool"],"mappings":"wGAGA,MAAMA,iCAAiCC,cAEtC,WAAAC,GAECC,MAAO,IAAM,IAAIC,iBAElB,EAIW,MAACC,qBAAuC,IAAIL","x_google_ignoreList":[0]}

package/dist/node_modules/three-mesh-bvh/src/utils/ExtensionUtilities.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import{Mesh,BatchedMesh,Sphere,Matrix4,Ray,Vector3}from"three";import{convertRaycastIntersect}from"./GeometryRayIntersectUtilities.js";import{MeshBVH}from"../core/MeshBVH.js";const ray=new Ray,direction=new Vector3,tmpInverseMatrix=new Matrix4,origMeshRaycastFunc=Mesh.prototype.raycast,origBatchedRaycastFunc=BatchedMesh.prototype.raycast,_worldScale=new Vector3,_mesh=new Mesh,_batchIntersects=[];function acceleratedRaycast(raycaster,intersects){this.isBatchedMesh?acceleratedBatchedMeshRaycast.call(this,raycaster,intersects):acceleratedMeshRaycast.call(this,raycaster,intersects)}function acceleratedBatchedMeshRaycast(raycaster,intersects){if(this.boundsTrees){const boundsTrees=this.boundsTrees,drawInfo=this._drawInfo\|\|this._instanceInfo,drawRanges=this._drawRanges\|\|this._geometryInfo,matrixWorld=this.matrixWorld;_mesh.material=this.material,_mesh.geometry=this.geometry;const oldBoundsTree=_mesh.geometry.boundsTree,oldDrawRange=_mesh.geometry.drawRange;null===_mesh.geometry.boundingSphere&&(_mesh.geometry.boundingSphere=new Sphere);for(let i=0,l=drawInfo.length;i<l;i++){if(!this.getVisibleAt(i))continue;const geometryId=drawInfo[i].geometryIndex;if(_mesh.geometry.boundsTree=boundsTrees[geometryId],this.getMatrixAt(i,_mesh.matrixWorld).premultiply(matrixWorld),!_mesh.geometry.boundsTree){this.getBoundingBoxAt(geometryId,_mesh.geometry.boundingBox),this.getBoundingSphereAt(geometryId,_mesh.geometry.boundingSphere);const drawRange=drawRanges[geometryId];_mesh.geometry.setDrawRange(drawRange.start,drawRange.count)}_mesh.raycast(raycaster,_batchIntersects);for(let j=0,l=_batchIntersects.length;j<l;j++){const intersect=_batchIntersects[j];intersect.object=this,intersect.batchId=i,intersects.push(intersect)}_batchIntersects.length=0}_mesh.geometry.boundsTree=oldBoundsTree,_mesh.geometry.drawRange=oldDrawRange,_mesh.material=null,_mesh.geometry=null}else origBatchedRaycastFunc.call(this,raycaster,intersects)}function acceleratedMeshRaycast(raycaster,intersects){if(this.geometry.boundsTree){if(void 0===this.material)return;tmpInverseMatrix.copy(this.matrixWorld).invert(),ray.copy(raycaster.ray).applyMatrix4(tmpInverseMatrix),_worldScale.setFromMatrixScale(this.matrixWorld),direction.copy(ray.direction).multiply(_worldScale);const scaleFactor=direction.length(),near=raycaster.near/scaleFactor,far=raycaster.far/scaleFactor,bvh=this.geometry.boundsTree;if(!0===raycaster.firstHitOnly){const hit=convertRaycastIntersect(bvh.raycastFirst(ray,this.material,near,far),this,raycaster);hit&&intersects.push(hit)}else{const hits=bvh.raycast(ray,this.material,near,far);for(let i=0,l=hits.length;i<l;i++){const hit=convertRaycastIntersect(hits[i],this,raycaster);hit&&intersects.push(hit)}}}else origMeshRaycastFunc.call(this,raycaster,intersects)}function computeBoundsTree(options={}){return this.boundsTree=new MeshBVH(this,options),this.boundsTree}function disposeBoundsTree(){this.boundsTree=null}export{acceleratedRaycast,computeBoundsTree,disposeBoundsTree};
2	+ //# sourceMappingURL=ExtensionUtilities.js.map

package/dist/node_modules/three-mesh-bvh/src/utils/ExtensionUtilities.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"ExtensionUtilities.js","sources":["../../../../../../../node_modules/three-mesh-bvh/src/utils/ExtensionUtilities.js"],"sourcesContent":["import { Ray, Matrix4, Mesh, Vector3, Sphere, BatchedMesh, REVISION } from 'three';\nimport { convertRaycastIntersect } from './GeometryRayIntersectUtilities.js';\nimport { MeshBVH } from '../core/MeshBVH.js';\n\nconst IS_REVISION_166 = parseInt( REVISION ) >= 166;\nconst ray = /* @__PURE__ */ new Ray();\nconst direction = /* @__PURE__ */ new Vector3();\nconst tmpInverseMatrix = /* @__PURE__ */ new Matrix4();\nconst origMeshRaycastFunc = Mesh.prototype.raycast;\nconst origBatchedRaycastFunc = BatchedMesh.prototype.raycast;\nconst _worldScale = /* @__PURE__ */ new Vector3();\nconst _mesh = /* @__PURE__ */ new Mesh();\nconst _batchIntersects = [];\n\nexport function acceleratedRaycast( raycaster, intersects ) {\n\n\tif ( this.isBatchedMesh ) {\n\n\t\tacceleratedBatchedMeshRaycast.call( this, raycaster, intersects );\n\n\t} else {\n\n\t\tacceleratedMeshRaycast.call( this, raycaster, intersects );\n\n\t}\n\n}\n\nfunction acceleratedBatchedMeshRaycast( raycaster, intersects ) {\n\n\tif ( this.boundsTrees ) {\n\n\t\t// TODO: remove use of geometry info, instance info when r170 is minimum version\n\t\tconst boundsTrees = this.boundsTrees;\n\t\tconst drawInfo = this._drawInfo || this._instanceInfo;\n\t\tconst drawRanges = this._drawRanges || this._geometryInfo;\n\t\tconst matrixWorld = this.matrixWorld;\n\n\t\t_mesh.material = this.material;\n\t\t_mesh.geometry = this.geometry;\n\n\t\tconst oldBoundsTree = _mesh.geometry.boundsTree;\n\t\tconst oldDrawRange = _mesh.geometry.drawRange;\n\n\t\tif ( _mesh.geometry.boundingSphere === null ) {\n\n\t\t\t_mesh.geometry.boundingSphere = new Sphere();\n\n\t\t}\n\n\t\t// TODO: provide new method to get instances count instead of 'drawInfo.length'\n\t\tfor ( let i = 0, l = drawInfo.length; i < l; i ++ ) {\n\n\t\t\tif ( ! this.getVisibleAt( i ) ) {\n\n\t\t\t\tcontinue;\n\n\t\t\t}\n\n\t\t\t// TODO: use getGeometryIndex\n\t\t\tconst geometryId = drawInfo[ i ].geometryIndex;\n\n\t\t\t_mesh.geometry.boundsTree = boundsTrees[ geometryId ];\n\n\t\t\tthis.getMatrixAt( i, _mesh.matrixWorld ).premultiply( matrixWorld );\n\n\t\t\tif ( ! _mesh.geometry.boundsTree ) {\n\n\t\t\t\tthis.getBoundingBoxAt( geometryId, _mesh.geometry.boundingBox );\n\t\t\t\tthis.getBoundingSphereAt( geometryId, _mesh.geometry.boundingSphere );\n\n\t\t\t\tconst drawRange = drawRanges[ geometryId ];\n\t\t\t\t_mesh.geometry.setDrawRange( drawRange.start, drawRange.count );\n\n\t\t\t}\n\n\t\t\t_mesh.raycast( raycaster, _batchIntersects );\n\n\t\t\tfor ( let j = 0, l = _batchIntersects.length; j < l; j ++ ) {\n\n\t\t\t\tconst intersect = _batchIntersects[ j ];\n\t\t\t\tintersect.object = this;\n\t\t\t\tintersect.batchId = i;\n\t\t\t\tintersects.push( intersect );\n\n\t\t\t}\n\n\t\t\t_batchIntersects.length = 0;\n\n\t\t}\n\n\t\t_mesh.geometry.boundsTree = oldBoundsTree;\n\t\t_mesh.geometry.drawRange = oldDrawRange;\n\t\t_mesh.material = null;\n\t\t_mesh.geometry = null;\n\n\t} else {\n\n\t\torigBatchedRaycastFunc.call( this, raycaster, intersects );\n\n\t}\n\n}\n\nfunction acceleratedMeshRaycast( raycaster, intersects ) {\n\n\tif ( this.geometry.boundsTree ) {\n\n\t\tif ( this.material === undefined ) return;\n\n\t\ttmpInverseMatrix.copy( this.matrixWorld ).invert();\n\t\tray.copy( raycaster.ray ).applyMatrix4( tmpInverseMatrix );\n\n\t\t_worldScale.setFromMatrixScale( this.matrixWorld );\n\t\tdirection.copy( ray.direction ).multiply( _worldScale );\n\n\t\tconst scaleFactor = direction.length();\n\t\tconst near = raycaster.near / scaleFactor;\n\t\tconst far = raycaster.far / scaleFactor;\n\n\t\tconst bvh = this.geometry.boundsTree;\n\t\tif ( raycaster.firstHitOnly === true ) {\n\n\t\t\tconst hit = convertRaycastIntersect( bvh.raycastFirst( ray, this.material, near, far ), this, raycaster );\n\t\t\tif ( hit ) {\n\n\t\t\t\tintersects.push( hit );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tconst hits = bvh.raycast( ray, this.material, near, far );\n\t\t\tfor ( let i = 0, l = hits.length; i < l; i ++ ) {\n\n\t\t\t\tconst hit = convertRaycastIntersect( hits[ i ], this, raycaster );\n\t\t\t\tif ( hit ) {\n\n\t\t\t\t\tintersects.push( hit );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t} else {\n\n\t\torigMeshRaycastFunc.call( this, raycaster, intersects );\n\n\t}\n\n}\n\nexport function computeBoundsTree( options = {} ) {\n\n\tthis.boundsTree = new MeshBVH( this, options );\n\treturn this.boundsTree;\n\n}\n\nexport function disposeBoundsTree() {\n\n\tthis.boundsTree = null;\n\n}\n\nexport function computeBatchedBoundsTree( index = - 1, options = {} ) {\n\n\tif ( ! IS_REVISION_166 ) {\n\n\t\tthrow new Error( 'BatchedMesh: Three r166+ is required to compute bounds trees.' );\n\n\t}\n\n\toptions = {\n\t\t...options,\n\t\trange: null\n\t};\n\n\tconst drawRanges = this._drawRanges || this._geometryInfo;\n\tconst geometryCount = this._geometryCount;\n\tif ( ! this.boundsTrees ) {\n\n\t\tthis.boundsTrees = new Array( geometryCount ).fill( null );\n\n\t}\n\n\tconst boundsTrees = this.boundsTrees;\n\twhile ( boundsTrees.length < geometryCount ) {\n\n\t\tboundsTrees.push( null );\n\n\t}\n\n\tif ( index < 0 ) {\n\n\t\tfor ( let i = 0; i < geometryCount; i ++ ) {\n\n\t\t\toptions.range = drawRanges[ i ];\n\t\t\tboundsTrees[ i ] = new MeshBVH( this.geometry, options );\n\n\t\t}\n\n\t\treturn boundsTrees;\n\n\t} else {\n\n\t\tif ( index < drawRanges.length ) {\n\n\t\t\toptions.range = drawRanges[ index ];\n\t\t\tboundsTrees[ index ] = new MeshBVH( this.geometry, options );\n\n\t\t}\n\n\t\treturn boundsTrees[ index ] || null;\n\n\t}\n\n}\n\nexport function disposeBatchedBoundsTree( index = - 1 ) {\n\n\tif ( index < 0 ) {\n\n\t\tthis.boundsTrees.fill( null );\n\n\t} else {\n\n\t\tif ( index < this.boundsTrees.length ) {\n\n\t\t\tthis.boundsTrees[ index ] = null;\n\n\t\t}\n\n\t}\n\n}\n"],"names":["ray","Ray","direction","Vector3","tmpInverseMatrix","Matrix4","origMeshRaycastFunc","Mesh","prototype","raycast","origBatchedRaycastFunc","BatchedMesh","_worldScale","_mesh","_batchIntersects","acceleratedRaycast","raycaster","intersects","this","isBatchedMesh","acceleratedBatchedMeshRaycast","call","acceleratedMeshRaycast","boundsTrees","drawInfo","_drawInfo","_instanceInfo","drawRanges","_drawRanges","_geometryInfo","matrixWorld","material","geometry","oldBoundsTree","boundsTree","oldDrawRange","drawRange","boundingSphere","Sphere","i","l","length","getVisibleAt","geometryId","geometryIndex","getMatrixAt","premultiply","getBoundingBoxAt","boundingBox","getBoundingSphereAt","setDrawRange","start","count","j","intersect","object","batchId","push","undefined","copy","invert","applyMatrix4","setFromMatrixScale","multiply","scaleFactor","near","far","bvh","firstHitOnly","hit","convertRaycastIntersect","raycastFirst","hits","computeBoundsTree","options","MeshBVH","disposeBoundsTree"],"mappings":"+KAKA,MAAMA,IAAsB,IAAIC,IAC1BC,UAA4B,IAAIC,QAChCC,iBAAmC,IAAIC,QACvCC,oBAAsBC,KAAKC,UAAUC,QACrCC,uBAAyBC,YAAYH,UAAUC,QAC/CG,YAA8B,IAAIT,QAClCU,MAAwB,IAAIN,KAC5BO,iBAAmB,GAElB,SAASC,mBAAoBC,UAAWC,YAEzCC,KAAKC,cAETC,8BAA8BC,KAAMH,KAAMF,UAAWC,YAIrDK,uBAAuBD,KAAMH,KAAMF,UAAWC,WAIhD,CAEA,SAASG,8BAA+BJ,UAAWC,YAElD,GAAKC,KAAKK,YAAc,CAGvB,MAAMA,YAAcL,KAAKK,YACnBC,SAAWN,KAAKO,WAAaP,KAAKQ,cAClCC,WAAaT,KAAKU,aAAeV,KAAKW,cACtCC,YAAcZ,KAAKY,YAEzBjB,MAAMkB,SAAWb,KAAKa,SACtBlB,MAAMmB,SAAWd,KAAKc,SAEtB,MAAMC,cAAgBpB,MAAMmB,SAASE,WAC/BC,aAAetB,MAAMmB,SAASI,UAEG,OAAlCvB,MAAMmB,SAASK,iBAEnBxB,MAAMmB,SAASK,eAAiB,IAAIC,QAKrC,IAAM,IAAIC,EAAI,EAAGC,EAAIhB,SAASiB,OAAQF,EAAIC,EAAGD,IAAO,CAEnD,IAAOrB,KAAKwB,aAAcH,GAEzB,SAKD,MAAMI,WAAanB,SAAUe,GAAIK,cAMjC,GAJA/B,MAAMmB,SAASE,WAAaX,YAAaoB,YAEzCzB,KAAK2B,YAAaN,EAAG1B,MAAMiB,aAAcgB,YAAahB,cAE/CjB,MAAMmB,SAASE,WAAa,CAElChB,KAAK6B,iBAAkBJ,WAAY9B,MAAMmB,SAASgB,aAClD9B,KAAK+B,oBAAqBN,WAAY9B,MAAMmB,SAASK,gBAErD,MAAMD,UAAYT,WAAYgB,YAC9B9B,MAAMmB,SAASkB,aAAcd,UAAUe,MAAOf,UAAUgB,MAEzD,CAEAvC,MAAMJ,QAASO,UAAWF,kBAE1B,IAAM,IAAIuC,EAAI,EAAGb,EAAI1B,iBAAiB2B,OAAQY,EAAIb,EAAGa,IAAO,CAE3D,MAAMC,UAAYxC,iBAAkBuC,GACpCC,UAAUC,OAASrC,KACnBoC,UAAUE,QAAUjB,EACpBtB,WAAWwC,KAAMH,UAElB,CAEAxC,iBAAiB2B,OAAS,CAE3B,CAEA5B,MAAMmB,SAASE,WAAaD,cAC5BpB,MAAMmB,SAASI,UAAYD,aAC3BtB,MAAMkB,SAAW,KACjBlB,MAAMmB,SAAW,IAElB,MAECtB,uBAAuBW,KAAMH,KAAMF,UAAWC,WAIhD,CAEA,SAASK,uBAAwBN,UAAWC,YAE3C,GAAKC,KAAKc,SAASE,WAAa,CAE/B,QAAuBwB,IAAlBxC,KAAKa,SAAyB,OAEnC3B,iBAAiBuD,KAAMzC,KAAKY,aAAc8B,SAC1C5D,IAAI2D,KAAM3C,UAAUhB,KAAM6D,aAAczD,kBAExCQ,YAAYkD,mBAAoB5C,KAAKY,aACrC5B,UAAUyD,KAAM3D,IAAIE,WAAY6D,SAAUnD,aAE1C,MAAMoD,YAAc9D,UAAUuC,SACxBwB,KAAOjD,UAAUiD,KAAOD,YACxBE,IAAMlD,UAAUkD,IAAMF,YAEtBG,IAAMjD,KAAKc,SAASE,WAC1B,IAAgC,IAA3BlB,UAAUoD,aAAwB,CAEtC,MAAMC,IAAMC,wBAAyBH,IAAII,aAAcvE,IAAKkB,KAAKa,SAAUkC,KAAMC,KAAOhD,KAAMF,WACzFqD,KAEJpD,WAAWwC,KAAMY,IAInB,KAAO,CAEN,MAAMG,KAAOL,IAAI1D,QAAST,IAAKkB,KAAKa,SAAUkC,KAAMC,KACpD,IAAM,IAAI3B,EAAI,EAAGC,EAAIgC,KAAK/B,OAAQF,EAAIC,EAAGD,IAAO,CAE/C,MAAM8B,IAAMC,wBAAyBE,KAAMjC,GAAKrB,KAAMF,WACjDqD,KAEJpD,WAAWwC,KAAMY,IAInB,CAED,CAED,MAEC/D,oBAAoBe,KAAMH,KAAMF,UAAWC,WAI7C,CAEO,SAASwD,kBAAmBC,QAAU,IAG5C,OADAxD,KAAKgB,WAAa,IAAIyC,QAASzD,KAAMwD,SAC9BxD,KAAKgB,UAEb,CAEO,SAAS0C,oBAEf1D,KAAKgB,WAAa,IAEnB","x_google_ignoreList":[0]}

package/dist/node_modules/three-mesh-bvh/src/utils/GeometryRayIntersectUtilities.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ function convertRaycastIntersect(hit,object,raycaster){return null===hit?null:(hit.point.applyMatrix4(object.matrixWorld),hit.distance=hit.point.distanceTo(raycaster.ray.origin),hit.object=object,hit)}export{convertRaycastIntersect};
2	+ //# sourceMappingURL=GeometryRayIntersectUtilities.js.map

package/dist/node_modules/three-mesh-bvh/src/utils/GeometryRayIntersectUtilities.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"GeometryRayIntersectUtilities.js","sources":["../../../../../../../node_modules/three-mesh-bvh/src/utils/GeometryRayIntersectUtilities.js"],"sourcesContent":["// converts the given BVH raycast intersection to align with the three.js raycast\n// structure (include object, world space distance and point).\nexport function convertRaycastIntersect( hit, object, raycaster ) {\n\n\tif ( hit === null ) {\n\n\t\treturn null;\n\n\t}\n\n\thit.point.applyMatrix4( object.matrixWorld );\n\thit.distance = hit.point.distanceTo( raycaster.ray.origin );\n\thit.object = object;\n\n\treturn hit;\n\n}\n"],"names":["convertRaycastIntersect","hit","object","raycaster","point","applyMatrix4","matrixWorld","distance","distanceTo","ray","origin"],"mappings":"AAEO,SAASA,wBAAyBC,IAAKC,OAAQC,WAErD,OAAa,OAARF,IAEG,MAIRA,IAAIG,MAAMC,aAAcH,OAAOI,aAC/BL,IAAIM,SAAWN,IAAIG,MAAMI,WAAYL,UAAUM,IAAIC,QACnDT,IAAIC,OAASA,OAEND,IAER","x_google_ignoreList":[0]}

package/dist/node_modules/three-mesh-bvh/src/utils/PrimitivePool.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ class PrimitivePool{constructor(getNewPrimitive){this._getNewPrimitive=getNewPrimitive,this._primitives=[]}getPrimitive(){const primitives=this._primitives;return 0===primitives.length?this._getNewPrimitive():primitives.pop()}releasePrimitive(primitive){this._primitives.push(primitive)}}export{PrimitivePool};
2	+ //# sourceMappingURL=PrimitivePool.js.map

package/dist/node_modules/three-mesh-bvh/src/utils/PrimitivePool.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"PrimitivePool.js","sources":["../../../../../../../node_modules/three-mesh-bvh/src/utils/PrimitivePool.js"],"sourcesContent":["export class PrimitivePool {\n\n\tconstructor( getNewPrimitive ) {\n\n\t\tthis._getNewPrimitive = getNewPrimitive;\n\t\tthis._primitives = [];\n\n\t}\n\n\tgetPrimitive() {\n\n\t\tconst primitives = this._primitives;\n\t\tif ( primitives.length === 0 ) {\n\n\t\t\treturn this._getNewPrimitive();\n\n\t\t} else {\n\n\t\t\treturn primitives.pop();\n\n\t\t}\n\n\t}\n\n\treleasePrimitive( primitive ) {\n\n\t\tthis._primitives.push( primitive );\n\n\t}\n\n}\n"],"names":["PrimitivePool","constructor","getNewPrimitive","this","_getNewPrimitive","_primitives","getPrimitive","primitives","length","pop","releasePrimitive","primitive","push"],"mappings":"AAAO,MAAMA,cAEZ,WAAAC,CAAaC,iBAEZC,KAAKC,iBAAmBF,gBACxBC,KAAKE,YAAc,EAEpB,CAEA,YAAAC,GAEC,MAAMC,WAAaJ,KAAKE,YACxB,OAA2B,IAAtBE,WAAWC,OAERL,KAAKC,mBAILG,WAAWE,KAIpB,CAEA,gBAAAC,CAAkBC,WAEjBR,KAAKE,YAAYO,KAAMD,UAExB","x_google_ignoreList":[0]}

package/dist/node_modules/three-mesh-bvh/src/utils/ThreeRayIntersectUtilities.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import{Vector3,Vector2,Triangle,BackSide,DoubleSide,REVISION}from"three";const IS_GT_REVISION_169=parseInt(REVISION)>=169,IS_LT_REVISION_161=parseInt(REVISION)<=161,_vA=new Vector3,_vB=new Vector3,_vC=new Vector3,_uvA=new Vector2,_uvB=new Vector2,_uvC=new Vector2,_normalA=new Vector3,_normalB=new Vector3,_normalC=new Vector3,_intersectionPoint=new Vector3;function checkBufferGeometryIntersection(ray,position,normal,uv,uv1,a,b,c,side,near,far){_vA.fromBufferAttribute(position,a),_vB.fromBufferAttribute(position,b),_vC.fromBufferAttribute(position,c);const intersection=function(ray,pA,pB,pC,point,side,near,far){let intersect;if(intersect=side===BackSide?ray.intersectTriangle(pC,pB,pA,!0,point):ray.intersectTriangle(pA,pB,pC,side!==DoubleSide,point),null===intersect)return null;const distance=ray.origin.distanceTo(point);return distance<near\|\|distance>far?null:{distance:distance,point:point.clone()}}(ray,_vA,_vB,_vC,_intersectionPoint,side,near,far);if(intersection){if(uv){_uvA.fromBufferAttribute(uv,a),_uvB.fromBufferAttribute(uv,b),_uvC.fromBufferAttribute(uv,c),intersection.uv=new Vector2;const res=Triangle.getInterpolation(_intersectionPoint,_vA,_vB,_vC,_uvA,_uvB,_uvC,intersection.uv);IS_GT_REVISION_169\|\|(intersection.uv=res)}if(uv1){_uvA.fromBufferAttribute(uv1,a),_uvB.fromBufferAttribute(uv1,b),_uvC.fromBufferAttribute(uv1,c),intersection.uv1=new Vector2;const res=Triangle.getInterpolation(_intersectionPoint,_vA,_vB,_vC,_uvA,_uvB,_uvC,intersection.uv1);IS_GT_REVISION_169\|\|(intersection.uv1=res),IS_LT_REVISION_161&&(intersection.uv2=intersection.uv1)}if(normal){_normalA.fromBufferAttribute(normal,a),_normalB.fromBufferAttribute(normal,b),_normalC.fromBufferAttribute(normal,c),intersection.normal=new Vector3;const res=Triangle.getInterpolation(_intersectionPoint,_vA,_vB,_vC,_normalA,_normalB,_normalC,intersection.normal);intersection.normal.dot(ray.direction)>0&&intersection.normal.multiplyScalar(-1),IS_GT_REVISION_169\|\|(intersection.normal=res)}const face={a:a,b:b,c:c,normal:new Vector3,materialIndex:0};if(Triangle.getNormal(_vA,_vB,_vC,face.normal),intersection.face=face,intersection.faceIndex=a,IS_GT_REVISION_169){const barycoord=new Vector3;Triangle.getBarycoord(_intersectionPoint,_vA,_vB,_vC,barycoord),intersection.barycoord=barycoord}}return intersection}function getSide(materialOrSide){return materialOrSide&&materialOrSide.isMaterial?materialOrSide.side:materialOrSide}function intersectTri(geometry,materialOrSide,ray,tri,intersections,near,far){const triOffset=3tri;let a=triOffset+0,b=triOffset+1,c=triOffset+2;const{index:index,groups:groups}=geometry;geometry.index&&(a=index.getX(a),b=index.getX(b),c=index.getX(c));const{position:position,normal:normal,uv:uv,uv1:uv1}=geometry.attributes;if(Array.isArray(materialOrSide)){const firstIndex=3tri;for(let i=0,l=groups.length;i<l;i++){const{start:start,count:count,materialIndex:materialIndex}=groups[i];if(firstIndex>=start&&firstIndex<start+count){const intersection=checkBufferGeometryIntersection(ray,position,normal,uv,uv1,a,b,c,getSide(materialOrSide[materialIndex]),near,far);if(intersection){if(intersection.faceIndex=tri,intersection.face.materialIndex=materialIndex,!intersections)return intersection;intersections.push(intersection)}}}}else{const intersection=checkBufferGeometryIntersection(ray,position,normal,uv,uv1,a,b,c,getSide(materialOrSide),near,far);if(intersection){if(intersection.faceIndex=tri,intersection.face.materialIndex=0,!intersections)return intersection;intersections.push(intersection)}}return null}export{intersectTri};
2	+ //# sourceMappingURL=ThreeRayIntersectUtilities.js.map

package/dist/node_modules/three-mesh-bvh/src/utils/ThreeRayIntersectUtilities.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"ThreeRayIntersectUtilities.js","sources":["../../../../../../../node_modules/three-mesh-bvh/src/utils/ThreeRayIntersectUtilities.js"],"sourcesContent":["import { Vector3, Vector2, Triangle, DoubleSide, BackSide, REVISION } from 'three';\n\nconst IS_GT_REVISION_169 = parseInt( REVISION ) >= 169;\nconst IS_LT_REVISION_161 = parseInt( REVISION ) <= 161;\n\n// Ripped and modified From THREE.js Mesh raycast\n// https://github.com/mrdoob/three.js/blob/0aa87c999fe61e216c1133fba7a95772b503eddf/src/objects/Mesh.js#L115\nconst _vA = /* @__PURE__ */ new Vector3();\nconst _vB = /* @__PURE__ */ new Vector3();\nconst _vC = /* @__PURE__ */ new Vector3();\n\nconst _uvA = /* @__PURE__ */ new Vector2();\nconst _uvB = /* @__PURE__ */ new Vector2();\nconst _uvC = /* @__PURE__ */ new Vector2();\n\nconst _normalA = /* @__PURE__ */ new Vector3();\nconst _normalB = /* @__PURE__ */ new Vector3();\nconst _normalC = /* @__PURE__ */ new Vector3();\n\nconst _intersectionPoint = /* @__PURE__ */ new Vector3();\nfunction checkIntersection( ray, pA, pB, pC, point, side, near, far ) {\n\n\tlet intersect;\n\tif ( side === BackSide ) {\n\n\t\tintersect = ray.intersectTriangle( pC, pB, pA, true, point );\n\n\t} else {\n\n\t\tintersect = ray.intersectTriangle( pA, pB, pC, side !== DoubleSide, point );\n\n\t}\n\n\tif ( intersect === null ) return null;\n\n\tconst distance = ray.origin.distanceTo( point );\n\n\tif ( distance < near || distance > far ) return null;\n\n\treturn {\n\n\t\tdistance: distance,\n\t\tpoint: point.clone(),\n\n\t};\n\n}\n\nfunction checkBufferGeometryIntersection( ray, position, normal, uv, uv1, a, b, c, side, near, far ) {\n\n\t_vA.fromBufferAttribute( position, a );\n\t_vB.fromBufferAttribute( position, b );\n\t_vC.fromBufferAttribute( position, c );\n\n\tconst intersection = checkIntersection( ray, _vA, _vB, _vC, _intersectionPoint, side, near, far );\n\n\tif ( intersection ) {\n\n\t\tif ( uv ) {\n\n\t\t\t_uvA.fromBufferAttribute( uv, a );\n\t\t\t_uvB.fromBufferAttribute( uv, b );\n\t\t\t_uvC.fromBufferAttribute( uv, c );\n\n\t\t\tintersection.uv = new Vector2();\n\t\t\tconst res = Triangle.getInterpolation( _intersectionPoint, _vA, _vB, _vC, _uvA, _uvB, _uvC, intersection.uv );\n\t\t\tif ( ! IS_GT_REVISION_169 ) {\n\n\t\t\t\tintersection.uv = res;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( uv1 ) {\n\n\t\t\t_uvA.fromBufferAttribute( uv1, a );\n\t\t\t_uvB.fromBufferAttribute( uv1, b );\n\t\t\t_uvC.fromBufferAttribute( uv1, c );\n\n\t\t\tintersection.uv1 = new Vector2();\n\t\t\tconst res = Triangle.getInterpolation( _intersectionPoint, _vA, _vB, _vC, _uvA, _uvB, _uvC, intersection.uv1 );\n\t\t\tif ( ! IS_GT_REVISION_169 ) {\n\n\t\t\t\tintersection.uv1 = res;\n\n\t\t\t}\n\n\t\t\tif ( IS_LT_REVISION_161 ) {\n\n\t\t\t\tintersection.uv2 = intersection.uv1;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( normal ) {\n\n\t\t\t_normalA.fromBufferAttribute( normal, a );\n\t\t\t_normalB.fromBufferAttribute( normal, b );\n\t\t\t_normalC.fromBufferAttribute( normal, c );\n\n\t\t\tintersection.normal = new Vector3();\n\t\t\tconst res = Triangle.getInterpolation( _intersectionPoint, _vA, _vB, _vC, _normalA, _normalB, _normalC, intersection.normal );\n\t\t\tif ( intersection.normal.dot( ray.direction ) > 0 ) {\n\n\t\t\t\tintersection.normal.multiplyScalar( - 1 );\n\n\t\t\t}\n\n\t\t\tif ( ! IS_GT_REVISION_169 ) {\n\n\t\t\t\tintersection.normal = res;\n\n\t\t\t}\n\n\t\t}\n\n\t\tconst face = {\n\t\t\ta: a,\n\t\t\tb: b,\n\t\t\tc: c,\n\t\t\tnormal: new Vector3(),\n\t\t\tmaterialIndex: 0\n\t\t};\n\n\t\tTriangle.getNormal( _vA, _vB, _vC, face.normal );\n\n\t\tintersection.face = face;\n\t\tintersection.faceIndex = a;\n\n\t\tif ( IS_GT_REVISION_169 ) {\n\n\t\t\tconst barycoord = new Vector3();\n\t\t\tTriangle.getBarycoord( _intersectionPoint, _vA, _vB, _vC, barycoord );\n\n\t\t\tintersection.barycoord = barycoord;\n\n\t\t}\n\n\t}\n\n\treturn intersection;\n\n}\n\nfunction getSide( materialOrSide ) {\n\n\treturn materialOrSide && materialOrSide.isMaterial ? materialOrSide.side : materialOrSide;\n\n}\n\n// https://github.com/mrdoob/three.js/blob/0aa87c999fe61e216c1133fba7a95772b503eddf/src/objects/Mesh.js#L258\nexport function intersectTri( geometry, materialOrSide, ray, tri, intersections, near, far ) {\n\n\tconst triOffset = tri * 3;\n\tlet a = triOffset + 0;\n\tlet b = triOffset + 1;\n\tlet c = triOffset + 2;\n\n\tconst { index, groups } = geometry;\n\tif ( geometry.index ) {\n\n\t\ta = index.getX( a );\n\t\tb = index.getX( b );\n\t\tc = index.getX( c );\n\n\t}\n\n\tconst { position, normal, uv, uv1 } = geometry.attributes;\n\tif ( Array.isArray( materialOrSide ) ) {\n\n\t\t// check which groups a triangle is present in and run the intersections\n\t\t// TODO: we shouldn't need to run and intersection test multiple times\n\t\tconst firstIndex = tri * 3;\n\t\tfor ( let i = 0, l = groups.length; i < l; i ++ ) {\n\n\t\t\tconst { start, count, materialIndex } = groups[ i ];\n\t\t\tif ( firstIndex >= start && firstIndex < start + count ) {\n\n\t\t\t\tconst side = getSide( materialOrSide[ materialIndex ] );\n\t\t\t\tconst intersection = checkBufferGeometryIntersection( ray, position, normal, uv, uv1, a, b, c, side, near, far );\n\t\t\t\tif ( intersection ) {\n\n\t\t\t\t\tintersection.faceIndex = tri;\n\t\t\t\t\tintersection.face.materialIndex = materialIndex;\n\n\t\t\t\t\tif ( intersections ) {\n\n\t\t\t\t\t\tintersections.push( intersection );\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\treturn intersection;\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t} else {\n\n\t\t// run the intersection for the single material\n\t\tconst side = getSide( materialOrSide );\n\t\tconst intersection = checkBufferGeometryIntersection( ray, position, normal, uv, uv1, a, b, c, side, near, far );\n\t\tif ( intersection ) {\n\n\t\t\tintersection.faceIndex = tri;\n\t\t\tintersection.face.materialIndex = 0;\n\n\t\t\tif ( intersections ) {\n\n\t\t\t\tintersections.push( intersection );\n\n\t\t\t} else {\n\n\t\t\t\treturn intersection;\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn null;\n\n}\n"],"names":["IS_GT_REVISION_169","parseInt","REVISION","IS_LT_REVISION_161","_vA","Vector3","_vB","_vC","_uvA","Vector2","_uvB","_uvC","_normalA","_normalB","_normalC","_intersectionPoint","checkBufferGeometryIntersection","ray","position","normal","uv","uv1","a","b","c","side","near","far","fromBufferAttribute","intersection","pA","pB","pC","point","intersect","BackSide","intersectTriangle","DoubleSide","distance","origin","distanceTo","clone","checkIntersection","res","Triangle","getInterpolation","uv2","dot","direction","multiplyScalar","face","materialIndex","getNormal","faceIndex","barycoord","getBarycoord","getSide","materialOrSide","isMaterial","intersectTri","geometry","tri","intersections","triOffset","index","groups","getX","attributes","Array","isArray","firstIndex","i","l","length","start","count","push"],"mappings":"yEAEA,MAAMA,mBAAqBC,SAAUC,WAAc,IAC7CC,mBAAqBF,SAAUC,WAAc,IAI7CE,IAAsB,IAAIC,QAC1BC,IAAsB,IAAID,QAC1BE,IAAsB,IAAIF,QAE1BG,KAAuB,IAAIC,QAC3BC,KAAuB,IAAID,QAC3BE,KAAuB,IAAIF,QAE3BG,SAA2B,IAAIP,QAC/BQ,SAA2B,IAAIR,QAC/BS,SAA2B,IAAIT,QAE/BU,mBAAqC,IAAIV,QA6B/C,SAASW,gCAAiCC,IAAKC,SAAUC,OAAQC,GAAIC,IAAKC,EAAGC,EAAGC,EAAGC,KAAMC,KAAMC,KAE9FvB,IAAIwB,oBAAqBV,SAAUI,GACnChB,IAAIsB,oBAAqBV,SAAUK,GACnChB,IAAIqB,oBAAqBV,SAAUM,GAEnC,MAAMK,aAlCP,SAA4BZ,IAAKa,GAAIC,GAAIC,GAAIC,MAAOR,KAAMC,KAAMC,KAE/D,IAAIO,UAWJ,GARCA,UAFIT,OAASU,SAEDlB,IAAImB,kBAAmBJ,GAAID,GAAID,IAAI,EAAMG,OAIzChB,IAAImB,kBAAmBN,GAAIC,GAAIC,GAAIP,OAASY,WAAYJ,OAIlD,OAAdC,UAAqB,OAAO,KAEjC,MAAMI,SAAWrB,IAAIsB,OAAOC,WAAYP,OAExC,OAAKK,SAAWZ,MAAQY,SAAWX,IAAa,KAEzC,CAENW,SAAUA,SACVL,MAAOA,MAAMQ,QAIf,CAQsBC,CAAmBzB,IAAKb,IAAKE,IAAKC,IAAKQ,mBAAoBU,KAAMC,KAAMC,KAE5F,GAAKE,aAAe,CAEnB,GAAKT,GAAK,CAETZ,KAAKoB,oBAAqBR,GAAIE,GAC9BZ,KAAKkB,oBAAqBR,GAAIG,GAC9BZ,KAAKiB,oBAAqBR,GAAII,GAE9BK,aAAaT,GAAK,IAAIX,QACtB,MAAMkC,IAAMC,SAASC,iBAAkB9B,mBAAoBX,IAAKE,IAAKC,IAAKC,KAAME,KAAMC,KAAMkB,aAAaT,IAClGpB,qBAEN6B,aAAaT,GAAKuB,IAIpB,CAEA,GAAKtB,IAAM,CAEVb,KAAKoB,oBAAqBP,IAAKC,GAC/BZ,KAAKkB,oBAAqBP,IAAKE,GAC/BZ,KAAKiB,oBAAqBP,IAAKG,GAE/BK,aAAaR,IAAM,IAAIZ,QACvB,MAAMkC,IAAMC,SAASC,iBAAkB9B,mBAAoBX,IAAKE,IAAKC,IAAKC,KAAME,KAAMC,KAAMkB,aAAaR,KAClGrB,qBAEN6B,aAAaR,IAAMsB,KAIfxC,qBAEJ0B,aAAaiB,IAAMjB,aAAaR,IAIlC,CAEA,GAAKF,OAAS,CAEbP,SAASgB,oBAAqBT,OAAQG,GACtCT,SAASe,oBAAqBT,OAAQI,GACtCT,SAASc,oBAAqBT,OAAQK,GAEtCK,aAAaV,OAAS,IAAId,QAC1B,MAAMsC,IAAMC,SAASC,iBAAkB9B,mBAAoBX,IAAKE,IAAKC,IAAKK,SAAUC,SAAUC,SAAUe,aAAaV,QAChHU,aAAaV,OAAO4B,IAAK9B,IAAI+B,WAAc,GAE/CnB,aAAaV,OAAO8B,mBAIdjD,qBAEN6B,aAAaV,OAASwB,IAIxB,CAEA,MAAMO,KAAO,CACZ5B,EAAGA,EACHC,EAAGA,EACHC,EAAGA,EACHL,OAAQ,IAAId,QACZ8C,cAAe,GAQhB,GALAP,SAASQ,UAAWhD,IAAKE,IAAKC,IAAK2C,KAAK/B,QAExCU,aAAaqB,KAAOA,KACpBrB,aAAawB,UAAY/B,EAEpBtB,mBAAqB,CAEzB,MAAMsD,UAAY,IAAIjD,QACtBuC,SAASW,aAAcxC,mBAAoBX,IAAKE,IAAKC,IAAK+C,WAE1DzB,aAAayB,UAAYA,SAE1B,CAED,CAEA,OAAOzB,YAER,CAEA,SAAS2B,QAASC,gBAEjB,OAAOA,gBAAkBA,eAAeC,WAAaD,eAAehC,KAAOgC,cAE5E,CAGO,SAASE,aAAcC,SAAUH,eAAgBxC,IAAK4C,IAAKC,cAAepC,KAAMC,KAEtF,MAAMoC,UAAkB,EAANF,IAClB,IAAIvC,EAAIyC,UAAY,EAChBxC,EAAIwC,UAAY,EAChBvC,EAAIuC,UAAY,EAEpB,MAAMC,MAAEA,MAAKC,OAAEA,QAAWL,SACrBA,SAASI,QAEb1C,EAAI0C,MAAME,KAAM5C,GAChBC,EAAIyC,MAAME,KAAM3C,GAChBC,EAAIwC,MAAME,KAAM1C,IAIjB,MAAMN,SAAEA,SAAQC,OAAEA,OAAMC,GAAEA,GAAEC,IAAEA,KAAQuC,SAASO,WAC/C,GAAKC,MAAMC,QAASZ,gBAAmB,CAItC,MAAMa,WAAmB,EAANT,IACnB,IAAM,IAAIU,EAAI,EAAGC,EAAIP,OAAOQ,OAAQF,EAAIC,EAAGD,IAAO,CAEjD,MAAMG,MAAEA,MAAKC,MAAEA,MAAKxB,cAAEA,eAAkBc,OAAQM,GAChD,GAAKD,YAAcI,OAASJ,WAAaI,MAAQC,MAAQ,CAExD,MACM9C,aAAeb,gCAAiCC,IAAKC,SAAUC,OAAQC,GAAIC,IAAKC,EAAGC,EAAGC,EAD/EgC,QAASC,eAAgBN,gBAC+DzB,KAAMC,KAC3G,GAAKE,aAAe,CAKnB,GAHAA,aAAawB,UAAYQ,IACzBhC,aAAaqB,KAAKC,cAAgBA,eAE7BW,cAMJ,OAAOjC,aAJPiC,cAAcc,KAAM/C,aAQtB,CAED,CAED,CAED,KAAO,CAGN,MACMA,aAAeb,gCAAiCC,IAAKC,SAAUC,OAAQC,GAAIC,IAAKC,EAAGC,EAAGC,EAD/EgC,QAASC,gBAC+E/B,KAAMC,KAC3G,GAAKE,aAAe,CAKnB,GAHAA,aAAawB,UAAYQ,IACzBhC,aAAaqB,KAAKC,cAAgB,GAE7BW,cAMJ,OAAOjC,aAJPiC,cAAcc,KAAM/C,aAQtB,CAED,CAEA,OAAO,IAER","x_google_ignoreList":[0]}

package/dist/node_modules/three-mesh-bvh/src/utils/TriangleUtilities.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import"three";function setTriangle(tri,i,index,pos){const ta=tri.a,tb=tri.b,tc=tri.c;let i0=i,i1=i+1,i2=i+2;index&&(i0=index.getX(i0),i1=index.getX(i1),i2=index.getX(i2)),ta.x=pos.getX(i0),ta.y=pos.getY(i0),ta.z=pos.getZ(i0),tb.x=pos.getX(i1),tb.y=pos.getY(i1),tb.z=pos.getZ(i1),tc.x=pos.getX(i2),tc.y=pos.getY(i2),tc.z=pos.getZ(i2)}export{setTriangle};
2	+ //# sourceMappingURL=TriangleUtilities.js.map

package/dist/node_modules/three-mesh-bvh/src/utils/TriangleUtilities.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"TriangleUtilities.js","sources":["../../../../../../../node_modules/three-mesh-bvh/src/utils/TriangleUtilities.js"],"sourcesContent":["\nimport { Vector2, Vector3, Triangle } from 'three';\n\n// sets the vertices of triangle `tri` with the 3 vertices after i\nexport function setTriangle( tri, i, index, pos ) {\n\n\tconst ta = tri.a;\n\tconst tb = tri.b;\n\tconst tc = tri.c;\n\n\tlet i0 = i;\n\tlet i1 = i + 1;\n\tlet i2 = i + 2;\n\tif ( index ) {\n\n\t\ti0 = index.getX( i0 );\n\t\ti1 = index.getX( i1 );\n\t\ti2 = index.getX( i2 );\n\n\t}\n\n\tta.x = pos.getX( i0 );\n\tta.y = pos.getY( i0 );\n\tta.z = pos.getZ( i0 );\n\n\ttb.x = pos.getX( i1 );\n\ttb.y = pos.getY( i1 );\n\ttb.z = pos.getZ( i1 );\n\n\ttc.x = pos.getX( i2 );\n\ttc.y = pos.getY( i2 );\n\ttc.z = pos.getZ( i2 );\n\n}\n\nconst tempV1 = /* @__PURE__ */ new Vector3();\nconst tempV2 = /* @__PURE__ */ new Vector3();\nconst tempV3 = /* @__PURE__ */ new Vector3();\nconst tempUV1 = /* @__PURE__ */ new Vector2();\nconst tempUV2 = /* @__PURE__ */ new Vector2();\nconst tempUV3 = /* @__PURE__ */ new Vector2();\n\nexport function getTriangleHitPointInfo( point, geometry, triangleIndex, target ) {\n\n\tconst indices = geometry.getIndex().array;\n\tconst positions = geometry.getAttribute( 'position' );\n\tconst uvs = geometry.getAttribute( 'uv' );\n\n\tconst a = indices[ triangleIndex * 3 ];\n\tconst b = indices[ triangleIndex * 3 + 1 ];\n\tconst c = indices[ triangleIndex * 3 + 2 ];\n\n\ttempV1.fromBufferAttribute( positions, a );\n\ttempV2.fromBufferAttribute( positions, b );\n\ttempV3.fromBufferAttribute( positions, c );\n\n\t// find the associated material index\n\tlet materialIndex = 0;\n\tconst groups = geometry.groups;\n\tconst firstVertexIndex = triangleIndex * 3;\n\tfor ( let i = 0, l = groups.length; i < l; i ++ ) {\n\n\t\tconst group = groups[ i ];\n\t\tconst { start, count } = group;\n\t\tif ( firstVertexIndex >= start && firstVertexIndex < start + count ) {\n\n\t\t\tmaterialIndex = group.materialIndex;\n\t\t\tbreak;\n\n\t\t}\n\n\t}\n\n\t// extract barycoord\n\tconst barycoord = target && target.barycoord ? target.barycoord : new Vector3();\n\tTriangle.getBarycoord( point, tempV1, tempV2, tempV3, barycoord );\n\n\t// extract uvs\n\tlet uv = null;\n\tif ( uvs ) {\n\n\t\ttempUV1.fromBufferAttribute( uvs, a );\n\t\ttempUV2.fromBufferAttribute( uvs, b );\n\t\ttempUV3.fromBufferAttribute( uvs, c );\n\n\t\tif ( target && target.uv ) uv = target.uv;\n\t\telse uv = new Vector2();\n\n\t\tTriangle.getInterpolation( point, tempV1, tempV2, tempV3, tempUV1, tempUV2, tempUV3, uv );\n\n\t}\n\n\t// adjust the provided target or create a new one\n\tif ( target ) {\n\n\t\tif ( ! target.face ) target.face = { };\n\t\ttarget.face.a = a;\n\t\ttarget.face.b = b;\n\t\ttarget.face.c = c;\n\t\ttarget.face.materialIndex = materialIndex;\n\t\tif ( ! target.face.normal ) target.face.normal = new Vector3();\n\t\tTriangle.getNormal( tempV1, tempV2, tempV3, target.face.normal );\n\n\t\tif ( uv ) target.uv = uv;\n\t\ttarget.barycoord = barycoord;\n\n\t\treturn target;\n\n\t} else {\n\n\t\treturn {\n\t\t\tface: {\n\t\t\t\ta: a,\n\t\t\t\tb: b,\n\t\t\t\tc: c,\n\t\t\t\tmaterialIndex: materialIndex,\n\t\t\t\tnormal: Triangle.getNormal( tempV1, tempV2, tempV3, new Vector3() )\n\t\t\t},\n\t\t\tuv: uv,\n\t\t\tbarycoord: barycoord,\n\t\t};\n\n\t}\n\n}\n"],"names":["setTriangle","tri","i","index","pos","ta","a","tb","b","tc","c","i0","i1","i2","getX","x","y","getY","z","getZ"],"mappings":"cAIO,SAASA,YAAaC,IAAKC,EAAGC,MAAOC,KAE3C,MAAMC,GAAKJ,IAAIK,EACTC,GAAKN,IAAIO,EACTC,GAAKR,IAAIS,EAEf,IAAIC,GAAKT,EACLU,GAAKV,EAAI,EACTW,GAAKX,EAAI,EACRC,QAEJQ,GAAKR,MAAMW,KAAMH,IACjBC,GAAKT,MAAMW,KAAMF,IACjBC,GAAKV,MAAMW,KAAMD,KAIlBR,GAAGU,EAAIX,IAAIU,KAAMH,IACjBN,GAAGW,EAAIZ,IAAIa,KAAMN,IACjBN,GAAGa,EAAId,IAAIe,KAAMR,IAEjBJ,GAAGQ,EAAIX,IAAIU,KAAMF,IACjBL,GAAGS,EAAIZ,IAAIa,KAAML,IACjBL,GAAGW,EAAId,IAAIe,KAAMP,IAEjBH,GAAGM,EAAIX,IAAIU,KAAMD,IACjBJ,GAAGO,EAAIZ,IAAIa,KAAMJ,IACjBJ,GAAGS,EAAId,IAAIe,KAAMN,GAElB","x_google_ignoreList":[0]}

package/dist/node_modules/tslib/tslib.es6.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ var extendStatics=function(d,b){return extendStatics=Object.setPrototypeOf\|\|{__proto__:[]}instanceof Array&&function(d,b){d.__proto__=b}\|\|function(d,b){for(var p in b)Object.prototype.hasOwnProperty.call(b,p)&&(d[p]=b[p])},extendStatics(d,b)};function __extends(d,b){if("function"!=typeof b&&null!==b)throw new TypeError("Class extends value "+String(b)+" is not a constructor or null");function __(){this.constructor=d}extendStatics(d,b),d.prototype=null===b?Object.create(b):(__.prototype=b.prototype,new __)}function __awaiter(thisArg,_arguments,P,generator){return new(P\|\|(P=Promise))(function(resolve,reject){function fulfilled(value){try{step(generator.next(value))}catch(e){reject(e)}}function rejected(value){try{step(generator.throw(value))}catch(e){reject(e)}}function step(result){var value;result.done?resolve(result.value):(value=result.value,value instanceof P?value:new P(function(resolve){resolve(value)})).then(fulfilled,rejected)}step((generator=generator.apply(thisArg,_arguments\|\|[])).next())})}function __generator(thisArg,body){var f,y,t,_={label:0,sent:function(){if(1&t[0])throw t[1];return t[1]},trys:[],ops:[]},g=Object.create(("function"==typeof Iterator?Iterator:Object).prototype);return g.next=verb(0),g.throw=verb(1),g.return=verb(2),"function"==typeof Symbol&&(g[Symbol.iterator]=function(){return this}),g;function verb(n){return function(v){return function(op){if(f)throw new TypeError("Generator is already executing.");for(;g&&(g=0,op[0]&&(_=0)),_;)try{if(f=1,y&&(t=2&op[0]?y.return:op[0]?y.throw\|\|((t=y.return)&&t.call(y),0):y.next)&&!(t=t.call(y,op[1])).done)return t;switch(y=0,t&&(op=[2&op[0],t.value]),op[0]){case 0:case 1:t=op;break;case 4:return _.label++,{value:op[1],done:!1};case 5:_.label++,y=op[1],op=[0];continue;case 7:op=_.ops.pop(),_.trys.pop();continue;default:if(!((t=(t=_.trys).length>0&&t[t.length-1])\|\|6!==op[0]&&2!==op[0])){_=0;continue}if(3===op[0]&&(!t\|\|op[1]>t[0]&&op[1]<t[3])){_.label=op[1];break}if(6===op[0]&&_.label<t[1]){_.label=t[1],t=op;break}if(t&&_.label<t[2]){_.label=t[2],_.ops.push(op);break}t[2]&&_.ops.pop(),_.trys.pop();continue}op=body.call(thisArg,_)}catch(e){op=[6,e],y=0}finally{f=t=0}if(5&op[0])throw op[1];return{value:op[0]?op[1]:void 0,done:!0}}([n,v])}}}function __values(o){var s="function"==typeof Symbol&&Symbol.iterator,m=s&&o[s],i=0;if(m)return m.call(o);if(o&&"number"==typeof o.length)return{next:function(){return o&&i>=o.length&&(o=void 0),{value:o&&o[i++],done:!o}}};throw new TypeError(s?"Object is not iterable.":"Symbol.iterator is not defined.")}function __read(o,n){var m="function"==typeof Symbol&&o[Symbol.iterator];if(!m)return o;var r,e,i=m.call(o),ar=[];try{for(;(void 0===n\|\|n-- >0)&&!(r=i.next()).done;)ar.push(r.value)}catch(error){e={error:error}}finally{try{r&&!r.done&&(m=i.return)&&m.call(i)}finally{if(e)throw e.error}}return ar}function __spreadArray(to,from,pack){if(pack\|\|2===arguments.length)for(var ar,i=0,l=from.length;i<l;i++)!ar&&i in from\|\|(ar\|\|(ar=Array.prototype.slice.call(from,0,i)),ar[i]=from[i]);return to.concat(ar\|\|Array.prototype.slice.call(from))}function __await(v){return this instanceof __await?(this.v=v,this):new __await(v)}function __asyncGenerator(thisArg,_arguments,generator){if(!Symbol.asyncIterator)throw new TypeError("Symbol.asyncIterator is not defined.");var i,g=generator.apply(thisArg,_arguments\|\|[]),q=[];return i=Object.create(("function"==typeof AsyncIterator?AsyncIterator:Object).prototype),verb("next"),verb("throw"),verb("return",function(f){return function(v){return Promise.resolve(v).then(f,reject)}}),i[Symbol.asyncIterator]=function(){return this},i;function verb(n,f){g[n]&&(i[n]=function(v){return new Promise(function(a,b){q.push([n,v,a,b])>1\|\|resume(n,v)})},f&&(i[n]=f(i[n])))}function resume(n,v){try{(r=g[n](v)).value instanceof __await?Promise.resolve(r.value.v).then(fulfill,reject):settle(q[0][2],r)}catch(e){settle(q[0][3],e)}var r}function fulfill(value){resume("next",value)}function reject(value){resume("throw",value)}function settle(f,v){f(v),q.shift(),q.length&&resume(q[0][0],q[0][1])}}function __asyncValues(o){if(!Symbol.asyncIterator)throw new TypeError("Symbol.asyncIterator is not defined.");var i,m=o[Symbol.asyncIterator];return m?m.call(o):(o=__values(o),i={},verb("next"),verb("throw"),verb("return"),i[Symbol.asyncIterator]=function(){return this},i);function verb(n){i[n]=o[n]&&function(v){return new Promise(function(resolve,reject){!function(resolve,reject,d,v){Promise.resolve(v).then(function(v){resolve({value:v,done:d})},reject)}(resolve,reject,(v=o[n](v)).done,v.value)})}}}"function"==typeof SuppressedError&&SuppressedError;export{__asyncGenerator,__asyncValues,__await,__awaiter,__extends,__generator,__read,__spreadArray,__values};
2	+ //# sourceMappingURL=tslib.es6.js.map

package/dist/node_modules/tslib/tslib.es6.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"tslib.es6.js","sources":["../../../../../node_modules/tslib/tslib.es6.mjs"],"sourcesContent":["/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol, Iterator */\n\nvar extendStatics = function(d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n if (typeof b !== \"function\" && b !== null)\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n __assign = Object.assign || function __assign(t) {\n for (var s, i = 1, n = arguments.length; i < n; i++) {\n s = arguments[i];\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n }\n return t;\n }\n return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n var t = {};\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n t[p] = s[p];\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n t[p[i]] = s[p[i]];\n }\n return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n var _, done = false;\n for (var i = decorators.length - 1; i >= 0; i--) {\n var context = {};\n for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n if (kind === \"accessor\") {\n if (result === void 0) continue;\n if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n if (_ = accept(result.get)) descriptor.get = _;\n if (_ = accept(result.set)) descriptor.set = _;\n if (_ = accept(result.init)) initializers.unshift(_);\n }\n else if (_ = accept(result)) {\n if (kind === \"field\") initializers.unshift(_);\n else descriptor[key] = _;\n }\n }\n if (target) Object.defineProperty(target, contextIn.name, descriptor);\n done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n var useValue = arguments.length > 2;\n for (var i = 0; i < initializers.length; i++) {\n value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n }\n return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n}\n\nexport function __generator(thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n return g.next = verb(0), g[\"throw\"] = verb(1), g[\"return\"] = verb(2), typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (g && (g = 0, op[0] && (_ = 0)), _) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n var desc = Object.getOwnPropertyDescriptor(m, k);\n if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n desc = { enumerable: true, get: function() { return m[k]; } };\n }\n Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n if (m) return m.call(o);\n if (o && typeof o.length === \"number\") return {\n next: function () {\n if (o && i >= o.length) o = void 0;\n return { value: o && o[i++], done: !o };\n }\n };\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n if (!m) return o;\n var i = m.call(o), r, ar = [], e;\n try {\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n }\n catch (error) { e = { error: error }; }\n finally {\n try {\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\n }\n finally { if (e) throw e.error; }\n }\n return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n for (var ar = [], i = 0; i < arguments.length; i++)\n ar = ar.concat(__read(arguments[i]));\n return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n r[k] = a[j];\n return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n if (ar || !(i in from)) {\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n ar[i] = from[i];\n }\n }\n return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\n return i = Object.create((typeof AsyncIterator === \"function\" ? AsyncIterator : Object).prototype), verb(\"next\"), verb(\"throw\"), verb(\"return\", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;\n function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }\n function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n function fulfill(value) { resume(\"next\", value); }\n function reject(value) { resume(\"throw\", value); }\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n var i, p;\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n var m = o[Symbol.asyncIterator], i;\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n o[\"default\"] = v;\n};\n\nvar ownKeys = function(o) {\n ownKeys = Object.getOwnPropertyNames || function (o) {\n var ar = [];\n for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n return ar;\n };\n return ownKeys(o);\n};\n\nexport function __importStar(mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n __setModuleDefault(result, mod);\n return result;\n}\n\nexport function __importDefault(mod) {\n return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n if (value !== null && value !== void 0) {\n if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n var dispose, inner;\n if (async) {\n if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n dispose = value[Symbol.asyncDispose];\n }\n if (dispose === void 0) {\n if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n dispose = value[Symbol.dispose];\n if (async) inner = dispose;\n }\n if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };\n env.stack.push({ value: value, dispose: dispose, async: async });\n }\n else if (async) {\n env.stack.push({ async: true });\n }\n return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n var e = new Error(message);\n return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n function fail(e) {\n env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n env.hasError = true;\n }\n var r, s = 0;\n function next() {\n while (r = env.stack.pop()) {\n try {\n if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);\n if (r.dispose) {\n var result = r.dispose.call(r.value);\n if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n }\n else s |= 1;\n }\n catch (e) {\n fail(e);\n }\n }\n if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();\n if (env.hasError) throw env.error;\n }\n return next();\n}\n\nexport function __rewriteRelativeImportExtension(path, preserveJsx) {\n if (typeof path === \"string\" && /^\\.\\.?\\//.test(path)) {\n return path.replace(/\\.(tsx)$|((?:\\.d)?)((?:\\.[^./]+?)?)\\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {\n return tsx ? preserveJsx ? \".jsx\" : \".js\" : d && (!ext || !cm) ? m : (d + ext + \".\" + cm.toLowerCase() + \"js\");\n });\n }\n return path;\n}\n\nexport default {\n __extends,\n __assign,\n __rest,\n __decorate,\n __param,\n __esDecorate,\n __runInitializers,\n __propKey,\n __setFunctionName,\n __metadata,\n __awaiter,\n __generator,\n __createBinding,\n __exportStar,\n __values,\n __read,\n __spread,\n __spreadArrays,\n __spreadArray,\n __await,\n __asyncGenerator,\n __asyncDelegator,\n __asyncValues,\n __makeTemplateObject,\n __importStar,\n __importDefault,\n __classPrivateFieldGet,\n __classPrivateFieldSet,\n __classPrivateFieldIn,\n __addDisposableResource,\n __disposeResources,\n __rewriteRelativeImportExtension,\n};\n"],"names":["extendStatics","d","b","Object","setPrototypeOf","__proto__","Array","p","prototype","hasOwnProperty","call","__extends","TypeError","String","__","this","constructor","create","__awaiter","thisArg","_arguments","P","generator","Promise","resolve","reject","fulfilled","value","step","next","e","rejected","result","done","then","apply","__generator","body","f","y","t","_","label","sent","trys","ops","g","Iterator","verb","Symbol","iterator","n","v","op","pop","length","push","__values","o","s","m","i","__read","r","ar","error","__spreadArray","to","from","pack","arguments","l","slice","concat","__await","__asyncGenerator","asyncIterator","q","AsyncIterator","a","resume","fulfill","settle","shift","__asyncValues","SuppressedError"],"mappings":"AAgBA,IAAIA,cAAgB,SAASC,EAAGC,GAI9B,OAHAF,cAAgBG,OAAOC,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUL,EAAGC,GAAKD,EAAEI,UAAYH,CAAG,GAC1E,SAAUD,EAAGC,GAAK,IAAK,IAAIK,KAAKL,EAAOC,OAAOK,UAAUC,eAAeC,KAAKR,EAAGK,KAAIN,EAAEM,GAAKL,EAAEK,GAAI,EAC7FP,cAAcC,EAAGC,EAC1B,EAEO,SAASS,UAAUV,EAAGC,GAC3B,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAIU,UAAU,uBAAyBC,OAAOX,GAAK,iCAE7D,SAASY,KAAOC,KAAKC,YAAcf,CAAG,CADtCD,cAAcC,EAAGC,GAEjBD,EAAEO,UAAkB,OAANN,EAAaC,OAAOc,OAAOf,IAAMY,GAAGN,UAAYN,EAAEM,UAAW,IAAIM,GACjF,CAqFO,SAASI,UAAUC,QAASC,WAAYC,EAAGC,WAEhD,OAAO,IAAKD,IAAMA,EAAIE,UAAU,SAAUC,QAASC,QAC/C,SAASC,UAAUC,OAAS,IAAMC,KAAKN,UAAUO,KAAKF,OAAS,CAAE,MAAOG,GAAKL,OAAOK,EAAI,CAAE,CAC1F,SAASC,SAASJ,OAAS,IAAMC,KAAKN,UAAiB,MAAEK,OAAS,CAAE,MAAOG,GAAKL,OAAOK,EAAI,CAAE,CAC7F,SAASF,KAAKI,QAJlB,IAAeL,MAIaK,OAAOC,KAAOT,QAAQQ,OAAOL,QAJ1CA,MAIyDK,OAAOL,MAJhDA,iBAAiBN,EAAIM,MAAQ,IAAIN,EAAE,SAAUG,SAAWA,QAAQG,MAAQ,IAIjBO,KAAKR,UAAWK,SAAW,CAC7GH,MAAMN,UAAYA,UAAUa,MAAMhB,QAASC,YAAc,KAAKS,OAClE,EACF,CAEO,SAASO,YAAYjB,QAASkB,MACnC,IAAsGC,EAAGC,EAAGC,EAAxGC,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPH,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGI,KAAM,GAAIC,IAAK,IAAeC,EAAI3C,OAAOc,QAA4B,mBAAb8B,SAA0BA,SAAW5C,QAAQK,WACtL,OAAOsC,EAAEjB,KAAOmB,KAAK,GAAIF,EAAS,MAAIE,KAAK,GAAIF,EAAU,OAAIE,KAAK,GAAsB,mBAAXC,SAA0BH,EAAEG,OAAOC,UAAY,WAAa,OAAOnC,IAAM,GAAI+B,EAC1J,SAASE,KAAKG,GAAK,OAAO,SAAUC,GAAK,OACzC,SAAcC,IACV,GAAIf,EAAG,MAAM,IAAI1B,UAAU,mCAC3B,KAAOkC,IAAMA,EAAI,EAAGO,GAAG,KAAOZ,EAAI,IAAKA,OACnC,GAAIH,EAAI,EAAGC,IAAMC,EAAY,EAARa,GAAG,GAASd,EAAU,OAAIc,GAAG,GAAKd,EAAS,SAAOC,EAAID,EAAU,SAAMC,EAAE9B,KAAK6B,GAAI,GAAKA,EAAEV,SAAWW,EAAIA,EAAE9B,KAAK6B,EAAGc,GAAG,KAAKpB,KAAM,OAAOO,EAE3J,OADID,EAAI,EAAGC,IAAGa,GAAK,CAAS,EAARA,GAAG,GAAQb,EAAEb,QACzB0B,GAAG,IACP,KAAK,EAAG,KAAK,EAAGb,EAAIa,GAAI,MACxB,KAAK,EAAc,OAAXZ,EAAEC,QAAgB,CAAEf,MAAO0B,GAAG,GAAIpB,MAAM,GAChD,KAAK,EAAGQ,EAAEC,QAASH,EAAIc,GAAG,GAAIA,GAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,GAAKZ,EAAEI,IAAIS,MAAOb,EAAEG,KAAKU,MAAO,SACxC,QACI,MAAkBd,GAAZA,EAAIC,EAAEG,MAAYW,OAAS,GAAKf,EAAEA,EAAEe,OAAS,KAAkB,IAAVF,GAAG,IAAsB,IAAVA,GAAG,IAAW,CAAEZ,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAVY,GAAG,MAAcb,GAAMa,GAAG,GAAKb,EAAE,IAAMa,GAAG,GAAKb,EAAE,IAAM,CAAEC,EAAEC,MAAQW,GAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,GAAG,IAAYZ,EAAEC,MAAQF,EAAE,GAAI,CAAEC,EAAEC,MAAQF,EAAE,GAAIA,EAAIa,GAAI,KAAO,CACpE,GAAIb,GAAKC,EAAEC,MAAQF,EAAE,GAAI,CAAEC,EAAEC,MAAQF,EAAE,GAAIC,EAAEI,IAAIW,KAAKH,IAAK,KAAO,CAC9Db,EAAE,IAAIC,EAAEI,IAAIS,MAChBb,EAAEG,KAAKU,MAAO,SAEtBD,GAAKhB,KAAK3B,KAAKS,QAASsB,EAC5B,CAAE,MAAOX,GAAKuB,GAAK,CAAC,EAAGvB,GAAIS,EAAI,CAAG,CAAC,QAAWD,EAAIE,EAAI,CAAG,CACzD,GAAY,EAARa,GAAG,GAAQ,MAAMA,GAAG,GAAI,MAAO,CAAE1B,MAAO0B,GAAG,GAAKA,GAAG,QAAK,EAAQpB,MAAM,EAC9E,CAtBgDL,CAAK,CAACuB,EAAGC,GAAK,CAAG,CAuBnE,CAkBO,SAASK,SAASC,GACvB,IAAIC,EAAsB,mBAAXV,QAAyBA,OAAOC,SAAUU,EAAID,GAAKD,EAAEC,GAAIE,EAAI,EAC5E,GAAID,EAAG,OAAOA,EAAElD,KAAKgD,GACrB,GAAIA,GAAyB,iBAAbA,EAAEH,OAAqB,MAAO,CAC1C1B,KAAM,WAEF,OADI6B,GAAKG,GAAKH,EAAEH,SAAQG,OAAI,GACrB,CAAE/B,MAAO+B,GAAKA,EAAEG,KAAM5B,MAAOyB,EACxC,GAEJ,MAAM,IAAI9C,UAAU+C,EAAI,0BAA4B,kCACtD,CAEO,SAASG,OAAOJ,EAAGP,GACxB,IAAIS,EAAsB,mBAAXX,QAAyBS,EAAET,OAAOC,UACjD,IAAKU,EAAG,OAAOF,EACf,IAAmBK,EAAYjC,EAA3B+B,EAAID,EAAElD,KAAKgD,GAAOM,GAAK,GAC3B,IACI,WAAmB,IAAXb,GAAgBA,KAAM,MAAQY,EAAIF,EAAEhC,QAAQI,MAAM+B,GAAGR,KAAKO,EAAEpC,MACxE,CACA,MAAOsC,OAASnC,EAAI,CAAEmC,MAAOA,MAAS,CACxC,QACM,IACQF,IAAMA,EAAE9B,OAAS2B,EAAIC,EAAU,SAAID,EAAElD,KAAKmD,EAClD,CACN,QAAgB,GAAI/B,EAAG,MAAMA,EAAEmC,KAAO,CACpC,CACA,OAAOD,EACT,CAkBO,SAASE,cAAcC,GAAIC,KAAMC,MACtC,GAAIA,MAA6B,IAArBC,UAAUf,OAAc,IAAK,IAA4BS,GAAxBH,EAAI,EAAGU,EAAIH,KAAKb,OAAYM,EAAIU,EAAGV,KACxEG,IAAQH,KAAKO,OACRJ,KAAIA,GAAK1D,MAAME,UAAUgE,MAAM9D,KAAK0D,KAAM,EAAGP,IAClDG,GAAGH,GAAKO,KAAKP,IAGrB,OAAOM,GAAGM,OAAOT,IAAM1D,MAAME,UAAUgE,MAAM9D,KAAK0D,MACpD,CAEO,SAASM,QAAQtB,GACtB,OAAOrC,gBAAgB2D,SAAW3D,KAAKqC,EAAIA,EAAGrC,MAAQ,IAAI2D,QAAQtB,EACpE,CAEO,SAASuB,iBAAiBxD,QAASC,WAAYE,WACpD,IAAK2B,OAAO2B,cAAe,MAAM,IAAIhE,UAAU,wCAC/C,IAAoDiD,EAAhDf,EAAIxB,UAAUa,MAAMhB,QAASC,YAAc,IAAQyD,EAAI,GAC3D,OAAOhB,EAAI1D,OAAOc,QAAiC,mBAAlB6D,cAA+BA,cAAgB3E,QAAQK,WAAYwC,KAAK,QAASA,KAAK,SAAUA,KAAK,SACtI,SAAqBV,GAAK,OAAO,SAAUc,GAAK,OAAO7B,QAAQC,QAAQ4B,GAAGlB,KAAKI,EAAGb,OAAS,CAAG,GADgEoC,EAAEZ,OAAO2B,eAAiB,WAAc,OAAO7D,IAAM,EAAG8C,EAEtN,SAASb,KAAKG,EAAGb,GAASQ,EAAEK,KAAMU,EAAEV,GAAK,SAAUC,GAAK,OAAO,IAAI7B,QAAQ,SAAUwD,EAAG7E,GAAK2E,EAAErB,KAAK,CAACL,EAAGC,EAAG2B,EAAG7E,IAAM,GAAK8E,OAAO7B,EAAGC,EAAI,EAAI,EAAOd,IAAGuB,EAAEV,GAAKb,EAAEuB,EAAEV,KAAO,CACvK,SAAS6B,OAAO7B,EAAGC,GAAK,KACVW,EADqBjB,EAAEK,GAAGC,IACnBzB,iBAAiB+C,QAAUnD,QAAQC,QAAQuC,EAAEpC,MAAMyB,GAAGlB,KAAK+C,QAASxD,QAAUyD,OAAOL,EAAE,GAAG,GAAId,EADtE,CAAE,MAAOjC,GAAKoD,OAAOL,EAAE,GAAG,GAAI/C,EAAI,CAC/E,IAAciC,CADmE,CAEjF,SAASkB,QAAQtD,OAASqD,OAAO,OAAQrD,MAAQ,CACjD,SAASF,OAAOE,OAASqD,OAAO,QAASrD,MAAQ,CACjD,SAASuD,OAAO5C,EAAGc,GAASd,EAAEc,GAAIyB,EAAEM,QAASN,EAAEtB,QAAQyB,OAAOH,EAAE,GAAG,GAAIA,EAAE,GAAG,GAAK,CACnF,CAQO,SAASO,cAAc1B,GAC5B,IAAKT,OAAO2B,cAAe,MAAM,IAAIhE,UAAU,wCAC/C,IAAiCiD,EAA7BD,EAAIF,EAAET,OAAO2B,eACjB,OAAOhB,EAAIA,EAAElD,KAAKgD,IAAMA,EAAqCD,SAASC,GAA2BG,EAAI,CAAA,EAAIb,KAAK,QAASA,KAAK,SAAUA,KAAK,UAAWa,EAAEZ,OAAO2B,eAAiB,WAAc,OAAO7D,IAAM,EAAG8C,GAC9M,SAASb,KAAKG,GAAKU,EAAEV,GAAKO,EAAEP,IAAM,SAAUC,GAAK,OAAO,IAAI7B,QAAQ,SAAUC,QAASC,SACvF,SAAgBD,QAASC,OAAQxB,EAAGmD,GAAK7B,QAAQC,QAAQ4B,GAAGlB,KAAK,SAASkB,GAAK5B,QAAQ,CAAEG,MAAOyB,EAAGnB,KAAMhC,GAAM,EAAGwB,OAAS,CADbyD,CAAO1D,QAASC,QAA7B2B,EAAIM,EAAEP,GAAGC,IAA8BnB,KAAMmB,EAAEzB,MAAQ,EAAI,CAAG,CAEjK,CA2EkD,mBAApB0D,iBAAiCA","x_google_ignoreList":[0]}

package/dist/node_modules/typescript-fsm/dist/stateMachine.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import{__exports as stateMachine}from"../../../_virtual/stateMachine2.js";var hasRequiredStateMachine;function requireStateMachine(){if(hasRequiredStateMachine)return stateMachine;hasRequiredStateMachine=1,Object.defineProperty(stateMachine,"__esModule",{value:!0}),stateMachine.SyncStateMachine=stateMachine.StateMachine=void 0,stateMachine.t=function(fromState,event,toState,cb){return{fromState:fromState,event:event,toState:toState,cb:cb}};class StateMachine{constructor(init,transitions=[],logger=console){this.init=init,this.transitions=transitions,this.logger=logger,this._current=init}addTransitions(transitions){transitions.forEach(_tran=>{const tran=Object.create(_tran);tran.cb&&!tran.cb.name?.startsWith("bound ")&&(tran.cb=tran.cb.bind(this)),this.transitions.push(tran)})}getState(){return this._current}can(event){return this.transitions.some(trans=>trans.fromState===this._current&&trans.event===event)}getNextState(event){const transition=this.transitions.find(tran=>tran.fromState===this._current&&tran.event===event);return transition?.toState}isFinal(){return this.transitions.every(trans=>trans.fromState!==this._current)}formatErr(fromState,event){return`No transition: from ${String(fromState)} event ${String(event)}`}async dispatch(event,...args){return new Promise((resolve,reject)=>{setTimeout(me=>{if(!this.transitions.some(tran=>{if(tran.fromState===me._current&&tran.event===event){if(me._current=tran.toState,tran.cb)try{const p=tran.cb(...args);p instanceof Promise?p.then(resolve).catch(reject):resolve()}catch(e){this.logger.error("Exception in callback",e),reject(e)}else resolve();return!0}return!1})){const errorMessage=this.formatErr(me._current,event);this.logger.error(errorMessage),reject(new Error(errorMessage))}},0,this)})}toMermaid(title){const diagram=[];title&&(diagram.push("---"),diagram.push(`title: ${title}`),diagram.push("---")),diagram.push("stateDiagram-v2"),diagram.push(` [] --\x3e ${String(this.init)}`),this.transitions.forEach(({event:event,fromState:fromState,toState:toState})=>{const from=String(fromState),to=String(toState),evt=String(event);diagram.push(` ${from} --\x3e ${to}: ${evt}`)});const ts=new Set;return this.transitions.forEach(({toState:toState})=>ts.add(toState)),this.transitions.forEach(({fromState:fromState})=>ts.delete(fromState)),ts.forEach(state=>diagram.push(` ${String(state)} --\x3e []`)),diagram.join("\n")}}return stateMachine.StateMachine=StateMachine,stateMachine.SyncStateMachine=class extends StateMachine{constructor(init,transitions=[],logger=console){super(init,transitions,logger)}dispatch(_event,..._args){throw new Error("SyncStateMachine does not support async dispatch.")}syncDispatch(event,...args){const found=this.transitions.some(tran=>{if(tran.fromState===this._current&&tran.event===event){const current=this._current;if(this._current=tran.toState,tran.cb){try{tran.cb(...args)}catch(e){throw this._current=current,this.logger.error("Exception in callback",e),e}return!0}return!1}});if(!found){const errorMessage=this.formatErr(this._current,event);this.logger.error(errorMessage)}return!!found}},stateMachine}export{requireStateMachine as __require};
2	+ //# sourceMappingURL=stateMachine.js.map

package/dist/node_modules/typescript-fsm/dist/stateMachine.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"stateMachine.js","sources":["../../../../../../node_modules/typescript-fsm/dist/stateMachine.js"],"sourcesContent":["\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.SyncStateMachine = exports.StateMachine = void 0;\nexports.t = t;\nfunction t(fromState, event, toState, cb) {\n return { fromState, event, toState, cb };\n}\n/**\n * StateMachine\n * TypeScript finite state machine class with async transformations.\n */\nclass StateMachine {\n // initialize the state-machine\n constructor(init, transitions = [], logger = console) {\n this.init = init;\n this.transitions = transitions;\n this.logger = logger;\n this._current = init;\n }\n addTransitions(transitions) {\n // bind any unbound method\n transitions.forEach((_tran) => {\n const tran = Object.create(_tran);\n if (tran.cb && !tran.cb.name?.startsWith(\"bound \")) {\n tran.cb = tran.cb.bind(this);\n }\n this.transitions.push(tran);\n });\n }\n getState() { return this._current; }\n can(event) {\n return this.transitions.some((trans) => (trans.fromState === this._current && trans.event === event));\n }\n getNextState(event) {\n const transition = this.transitions.find((tran) => tran.fromState === this._current && tran.event === event);\n return transition?.toState;\n }\n isFinal() {\n // search for a transition that starts from current state.\n // if none is found it's a terminal state.\n return this.transitions.every((trans) => (trans.fromState !== this._current));\n }\n formatErr(fromState, event) {\n return `No transition: from ${String(fromState)} event ${String(event)}`;\n }\n // post event async\n async dispatch(event, ...args) {\n return new Promise((resolve, reject) => {\n // delay execution to make it async\n setTimeout((me) => {\n // find transition\n const found = this.transitions.some((tran) => {\n if (tran.fromState === me._current && tran.event === event) {\n me._current = tran.toState;\n if (tran.cb) {\n try {\n const p = tran.cb(...args);\n if (p instanceof Promise) {\n p.then(resolve).catch(reject);\n }\n else {\n resolve();\n }\n }\n catch (e) {\n this.logger.error(\"Exception in callback\", e);\n reject(e);\n }\n }\n else {\n resolve();\n }\n return true;\n }\n return false;\n });\n // no such transition\n if (!found) {\n const errorMessage = this.formatErr(me._current, event);\n this.logger.error(errorMessage);\n reject(new Error(errorMessage));\n }\n }, 0, this);\n });\n }\n /**\n * Generate a Mermaid StateDiagram of the current machine.\n */\n toMermaid(title) {\n const diagram = [];\n if (title) {\n diagram.push(\"---\");\n diagram.push(`title: ${title}`);\n diagram.push(\"---\");\n }\n diagram.push(\"stateDiagram-v2\");\n diagram.push(` [*] --> ${String(this.init)}`);\n this.transitions.forEach(({ event, fromState, toState }) => {\n const from = String(fromState);\n const to = String(toState);\n const evt = String(event);\n diagram.push(` ${from} --> ${to}: ${evt}`);\n });\n // find terminal states\n const ts = new Set();\n this.transitions.forEach(({ toState }) => ts.add(toState));\n this.transitions.forEach(({ fromState }) => ts.delete(fromState));\n ts.forEach((state) => diagram.push(` ${String(state)} --> [*]`));\n return diagram.join(\"\\n\");\n }\n}\nexports.StateMachine = StateMachine;\n/**\n * SyncStateMachine\n * TypeScript finite state machine class with sync transformations.\n */\nclass SyncStateMachine extends StateMachine {\n constructor(init, transitions = [], logger = console) {\n super(init, transitions, logger);\n }\n dispatch(_event, ..._args) {\n throw new Error(\"SyncStateMachine does not support async dispatch.\");\n }\n // post sync event\n // returns true if the event was handled, false otherwise\n syncDispatch(event, ...args) {\n // find transition\n const found = this.transitions.some((tran) => {\n if (tran.fromState === this._current && tran.event === event) {\n const current = this._current;\n this._current = tran.toState;\n if (tran.cb) {\n try {\n tran.cb(...args);\n }\n catch (e) {\n this._current = current; // revert to previous state\n this.logger.error(\"Exception in callback\", e);\n throw e;\n }\n return true;\n }\n return false; // search for more transitions\n }\n });\n // no such transition\n if (!found) {\n const errorMessage = this.formatErr(this._current, event);\n this.logger.error(errorMessage);\n }\n return (!!found);\n }\n}\nexports.SyncStateMachine = SyncStateMachine;\n//# sourceMappingURL=stateMachine.js.map"],"names":["Object","defineProperty","stateMachine","value","SyncStateMachine","StateMachine","t","fromState","event","toState","cb","constructor","init","transitions","logger","console","this","_current","addTransitions","forEach","_tran","tran","create","name","startsWith","bind","push","getState","can","some","trans","getNextState","transition","find","isFinal","every","formatErr","String","dispatch","args","Promise","resolve","reject","setTimeout","me","p","then","catch","e","error","errorMessage","Error","toMermaid","title","diagram","from","to","evt","ts","Set","add","delete","state","join","super","_event","_args","syncDispatch","found","current"],"mappings":"8MACAA,OAAOC,eAAeC,aAAS,aAAc,CAAEC,OAAO,IACtDD,aAAAE,iBAA2BF,aAAAG,kBAAuB,EAClDH,aAAAI,EACA,SAAWC,UAAWC,MAAOC,QAASC,IAClC,MAAO,CAAEH,oBAAWC,YAAOC,gBAASC,MACxC,EAKA,MAAML,aAEF,WAAAM,CAAYC,KAAMC,YAAc,GAAIC,OAASC,SACzCC,KAAKJ,KAAOA,KACZI,KAAKH,YAAcA,YACnBG,KAAKF,OAASA,OACdE,KAAKC,SAAWL,IACxB,CACI,cAAAM,CAAeL,aAEXA,YAAYM,QAASC,QACjB,MAAMC,KAAOrB,OAAOsB,OAAOF,OACvBC,KAAKX,KAAOW,KAAKX,GAAGa,MAAMC,WAAW,YACrCH,KAAKX,GAAKW,KAAKX,GAAGe,KAAKT,OAE3BA,KAAKH,YAAYa,KAAKL,OAElC,CACI,QAAAM,GAAa,OAAOX,KAAKC,QAAS,CAClC,GAAAW,CAAIpB,OACA,OAAOQ,KAAKH,YAAYgB,KAAMC,OAAWA,MAAMvB,YAAcS,KAAKC,UAAYa,MAAMtB,QAAUA,MACtG,CACI,YAAAuB,CAAavB,OACT,MAAMwB,WAAahB,KAAKH,YAAYoB,KAAMZ,MAASA,KAAKd,YAAcS,KAAKC,UAAYI,KAAKb,QAAUA,OACtG,OAAOwB,YAAYvB,OAC3B,CACI,OAAAyB,GAGI,OAAOlB,KAAKH,YAAYsB,MAAOL,OAAWA,MAAMvB,YAAcS,KAAKC,SAC3E,CACI,SAAAmB,CAAU7B,UAAWC,OACjB,MAAO,uBAAuB6B,OAAO9B,oBAAoB8B,OAAO7B,QACxE,CAEI,cAAM8B,CAAS9B,SAAU+B,MACrB,OAAO,IAAIC,QAAQ,CAACC,QAASC,UAEzBC,WAAYC,KA4BR,IA1Bc5B,KAAKH,YAAYgB,KAAMR,OACjC,GAAIA,KAAKd,YAAcqC,GAAG3B,UAAYI,KAAKb,QAAUA,MAAO,CAExD,GADAoC,GAAG3B,SAAWI,KAAKZ,QACfY,KAAKX,GACL,IACI,MAAMmC,EAAIxB,KAAKX,MAAM6B,MACjBM,aAAaL,QACbK,EAAEC,KAAKL,SAASM,MAAML,QAGtBD,SAEpC,CAC4B,MAAOO,GACHhC,KAAKF,OAAOmC,MAAM,wBAAyBD,GAC3CN,OAAOM,EACvC,MAG4BP,UAEJ,OAAO,CAC/B,CACoB,OAAO,IAGC,CACR,MAAMS,aAAelC,KAAKoB,UAAUQ,GAAG3B,SAAUT,OACjDQ,KAAKF,OAAOmC,MAAMC,cAClBR,OAAO,IAAIS,MAAMD,cACrC,GACe,EAAGlC,OAElB,CAII,SAAAoC,CAAUC,OACN,MAAMC,QAAU,GACZD,QACAC,QAAQ5B,KAAK,OACb4B,QAAQ5B,KAAK,UAAU2B,SACvBC,QAAQ5B,KAAK,QAEjB4B,QAAQ5B,KAAK,mBACb4B,QAAQ5B,KAAK,gBAAaW,OAAOrB,KAAKJ,SACtCI,KAAKH,YAAYM,QAAQ,EAAGX,YAAOD,oBAAWE,oBAC1C,MAAM8C,KAAOlB,OAAO9B,WACdiD,GAAKnB,OAAO5B,SACZgD,IAAMpB,OAAO7B,OACnB8C,QAAQ5B,KAAK,KAAK6B,eAAYC,OAAOC,SAGzC,MAAMC,GAAK,IAAIC,IAIf,OAHA3C,KAAKH,YAAYM,QAAQ,EAAGV,mBAAciD,GAAGE,IAAInD,UACjDO,KAAKH,YAAYM,QAAQ,EAAGZ,uBAAgBmD,GAAGG,OAAOtD,YACtDmD,GAAGvC,QAAS2C,OAAUR,QAAQ5B,KAAK,KAAKW,OAAOyB,sBACxCR,QAAQS,KAAK,KAC5B,SAEA7D,aAAAG,aAAuBA,aA0CvBH,aAAAE,iBArCA,cAA+BC,aAC3B,WAAAM,CAAYC,KAAMC,YAAc,GAAIC,OAASC,SACzCiD,MAAMpD,KAAMC,YAAaC,OACjC,CACI,QAAAwB,CAAS2B,UAAWC,OAChB,MAAM,IAAIf,MAAM,oDACxB,CAGI,YAAAgB,CAAa3D,SAAU+B,MAEnB,MAAM6B,MAAQpD,KAAKH,YAAYgB,KAAMR,OACjC,GAAIA,KAAKd,YAAcS,KAAKC,UAAYI,KAAKb,QAAUA,MAAO,CAC1D,MAAM6D,QAAUrD,KAAKC,SAErB,GADAD,KAAKC,SAAWI,KAAKZ,QACjBY,KAAKX,GAAI,CACT,IACIW,KAAKX,MAAM6B,KACnC,CACoB,MAAOS,GAGH,MAFAhC,KAAKC,SAAWoD,QAChBrD,KAAKF,OAAOmC,MAAM,wBAAyBD,GACrCA,CAC9B,CACoB,OAAO,CAC3B,CACgB,OAAO,CACvB,IAGQ,IAAKoB,MAAO,CACR,MAAMlB,aAAelC,KAAKoB,UAAUpB,KAAKC,SAAUT,OACnDQ,KAAKF,OAAOmC,MAAMC,aAC9B,CACQ,QAAUkB,KAClB","x_google_ignoreList":[0]}

package/dist/packages/anarchy-engine/node_modules/nanoid/index.browser.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import{urlAlphabet}from"./url-alphabet/index.js";let nanoid=(size=21)=>{let id="",bytes=crypto.getRandomValues(new Uint8Array(size\|=0));for(;size--;)id+=urlAlphabet[63&bytes[size]];return id};export{nanoid,urlAlphabet};
2	+ //# sourceMappingURL=index.browser.js.map

package/dist/packages/anarchy-engine/node_modules/nanoid/index.browser.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"index.browser.js","sources":["../../../../../node_modules/nanoid/index.browser.js"],"sourcesContent":["/* @ts-self-types=\"./index.d.ts\" */\nimport { urlAlphabet as scopedUrlAlphabet } from './url-alphabet/index.js'\nexport { urlAlphabet } from './url-alphabet/index.js'\nexport let random = bytes => crypto.getRandomValues(new Uint8Array(bytes))\nexport let customRandom = (alphabet, defaultSize, getRandom) => {\n let mask = (2 << Math.log2(alphabet.length - 1)) - 1\n let step = -~((1.6 * mask * defaultSize) / alphabet.length)\n return (size = defaultSize) => {\n let id = ''\n while (true) {\n let bytes = getRandom(step)\n let j = step | 0\n while (j--) {\n id += alphabet[bytes[j] & mask] || ''\n if (id.length >= size) return id\n }\n }\n }\n}\nexport let customAlphabet = (alphabet, size = 21) =>\n customRandom(alphabet, size | 0, random)\nexport let nanoid = (size = 21) => {\n let id = ''\n let bytes = crypto.getRandomValues(new Uint8Array((size |= 0)))\n while (size--) {\n id += scopedUrlAlphabet[bytes[size] & 63]\n }\n return id\n}\n"],"names":["nanoid","size","id","bytes","crypto","getRandomValues","Uint8Array","scopedUrlAlphabet"],"mappings":"iDAqBU,IAACA,OAAS,CAACC,KAAO,MAC1B,IAAIC,GAAK,GACLC,MAAQC,OAAOC,gBAAgB,IAAIC,WAAYL,MAAQ,IAC3D,KAAOA,QACLC,IAAMK,YAAgC,GAAdJ,MAAMF,OAEhC,OAAOC","x_google_ignoreList":[0]}

package/dist/packages/anarchy-engine/node_modules/nanoid/url-alphabet/index.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ const urlAlphabet="useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict";export{urlAlphabet};
2	+ //# sourceMappingURL=index.js.map

package/dist/packages/anarchy-engine/node_modules/nanoid/url-alphabet/index.js.map ADDED Viewed

	@@ -0,0 +1 @@
1	+ {"version":3,"file":"index.js","sources":["../../../../../../node_modules/nanoid/url-alphabet/index.js"],"sourcesContent":["export const urlAlphabet =\n 'useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict'\n"],"names":["urlAlphabet"],"mappings":"AAAY,MAACA,YACX","x_google_ignoreList":[0]}

package/dist/packages/anarchy-shared/src/Constants/CssUnits.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ var CssUnits=(CssUnits2=>(CssUnits2.Px="px",CssUnits2.Em="em",CssUnits2.Rem="rem",CssUnits2.Percent="%",CssUnits2.Pt="pt",CssUnits2))(CssUnits\|\|{});export{CssUnits};
2	+ //# sourceMappingURL=CssUnits.js.map

package/dist/packages/anarchy-shared/src/Constants/CssUnits.js.map ADDED Viewed

	@@ -0,0 +1 @@
1	+ {"version":3,"file":"CssUnits.js","sources":["../../../../../../anarchy-shared/src/Constants/CssUnits.ts"],"sourcesContent":["export enum CssUnits {\n Px = 'px',\n Em = 'em',\n Rem = 'rem',\n Percent = '%',\n Pt = 'pt'\n}\n"],"names":["CssUnits"],"mappings":"AAAO,IAAKA,UAAAA,YACVA,UAAA,GAAK,KACLA,UAAA,GAAK,KACLA,UAAA,IAAM,MACNA,UAAA,QAAU,IACVA,UAAA,GAAK,KALKA,YAAAA,UAAA,CAAA"}

package/dist/packages/anarchy-shared/src/Constants/FallBackFonts.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ const FallBackFonts='system-ui, -apple-system, "Segoe UI", Roboto, Arial, sans-serif';export{FallBackFonts};
2	+ //# sourceMappingURL=FallBackFonts.js.map

package/dist/packages/anarchy-shared/src/Constants/FallBackFonts.js.map ADDED Viewed

	@@ -0,0 +1 @@
1	+ {"version":3,"file":"FallBackFonts.js","sources":["../../../../../../anarchy-shared/src/Constants/FallBackFonts.ts"],"sourcesContent":["export const FallBackFonts: string = 'system-ui, -apple-system, \"Segoe UI\", Roboto, Arial, sans-serif';\n"],"names":["FallBackFonts"],"mappings":"AAAO,MAAMA,cAAwB"}

package/dist/packages/anarchy-shared/src/Utils/ArrayUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ function omitInArray(array,item){return array.filter(arrayItem=>arrayItem!==item)}function removeDuplicates(array){const uniqueMap=new Map;for(const item of array)uniqueMap.set(item.id,item);return Array.from(uniqueMap.values())}function findDuplicateString(arr){const seen=new Set;for(const str of arr){if(seen.has(str))return str;seen.add(str)}}export{findDuplicateString,omitInArray,removeDuplicates};
2	+ //# sourceMappingURL=ArrayUtils.js.map

package/dist/packages/anarchy-shared/src/Utils/ArrayUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"ArrayUtils.js","sources":["../../../../../../anarchy-shared/src/Utils/ArrayUtils.ts"],"sourcesContent":["export function omitInArray<T>(array: ReadonlyArray<T>, item: T): ReadonlyArray<T> {\n return array.filter((arrayItem: T): boolean => arrayItem !== item);\n}\n\nexport function forEachEnum<T extends Record<string | number, string | number>>(enumType: T, callback: (value: number | string, key: number | string, index: number) => void): void {\n Object.keys(enumType).forEach((key: string, index: number): void => callback(enumType[key], key, index));\n}\n\nexport function removeDuplicates<T extends { id: string }>(array: ReadonlyArray<T>): ReadonlyArray<T> {\n const uniqueMap = new Map<string, T>();\n // eslint-disable-next-line functional/no-loop-statements\n for (const item of array) {\n uniqueMap.set(item.id, item);\n }\n return Array.from(uniqueMap.values());\n}\n\nexport const removeDuplicatesStr = (arr: ReadonlyArray<string>): ReadonlyArray<string> => Array.from(new Set(arr));\n\nexport function asRecord<T, K extends keyof T, V extends string | number | symbol = T[K] & (string | number | symbol)>(key: K, list: ReadonlyArray<T>): Record<V, T> {\n return list.reduce(\n (acc, item) => {\n // eslint-disable-next-line functional/immutable-data\n acc[item[key] as V] = item;\n return acc;\n },\n {} as Record<V, T>\n );\n}\n\nexport function findDuplicateString(arr: ReadonlyArray<string>): string | undefined {\n const seen: Set<string> = new Set<string>();\n // eslint-disable-next-line functional/no-loop-statements\n for (const str of arr) {\n if (seen.has(str)) return str;\n seen.add(str);\n }\n return undefined;\n}\n"],"names":["omitInArray","array","item","filter","arrayItem","removeDuplicates","uniqueMap","Map","set","id","Array","from","values","findDuplicateString","arr","seen","Set","str","has","add"],"mappings":"AAAO,SAASA,YAAeC,MAAyBC,MACtD,OAAOD,MAAME,OAAQC,WAA0BA,YAAcF,KAC/D,CAMO,SAASG,iBAA2CJ,OACzD,MAAMK,cAAgBC,IAEtB,IAAA,MAAWL,QAAQD,MACjBK,UAAUE,IAAIN,KAAKO,GAAIP,MAEzB,OAAOQ,MAAMC,KAAKL,UAAUM,SAC9B,CAeO,SAASC,oBAAoBC,KAClC,MAAMC,SAAwBC,IAE9B,IAAA,MAAWC,OAAOH,IAAK,CACrB,GAAIC,KAAKG,IAAID,KAAM,OAAOA,IAC1BF,KAAKI,IAAIF,IACX,CAEF"}

package/dist/packages/anarchy-shared/src/Utils/AsyncUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ function createDeferredPromise(){let resolve,reject;const promise=new Promise((res,rej)=>{resolve=res,reject=rej});return{resolve:resolve,reject:reject,promise:promise}}export{createDeferredPromise};
2	+ //# sourceMappingURL=AsyncUtils.js.map

package/dist/packages/anarchy-shared/src/Utils/AsyncUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"AsyncUtils.js","sources":["../../../../../../anarchy-shared/src/Utils/AsyncUtils.ts"],"sourcesContent":["import type { TDeferredPromise } from '@Anarchy/Shared/Models';\n\nexport function createDeferredPromise<T>(): TDeferredPromise<T> {\n let resolve: (value: T | PromiseLike<T>) => void;\n let reject: (reason?: any) => void;\n\n const promise: Promise<T> = new Promise((res: (value: T | PromiseLike<T>) => void, rej: (reason?: any) => void): void => {\n resolve = res;\n reject = rej;\n });\n\n return {\n resolve: resolve!,\n reject: reject!,\n promise\n };\n}\n"],"names":["createDeferredPromise","resolve","reject","promise","Promise","res","rej"],"mappings":"AAEO,SAASA,wBACd,IAAIC,QACAC,OAEJ,MAAMC,QAAsB,IAAIC,QAAQ,CAACC,IAA0CC,OACjFL,QAAUI,IACVH,OAASI,MAGX,MAAO,CACLL,gBACAC,cACAC,gBAEJ"}

package/dist/packages/anarchy-shared/src/Utils/CheckUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ const isDefined=value=>null!=value,isNotDefined=value=>!isDefined(value),isString=value=>"string"==typeof value;export{isDefined,isNotDefined,isString};
2	+ //# sourceMappingURL=CheckUtils.js.map

package/dist/packages/anarchy-shared/src/Utils/CheckUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"CheckUtils.js","sources":["../../../../../../anarchy-shared/src/Utils/CheckUtils.ts"],"sourcesContent":["export const isDefined = <T>(value: T | undefined | null): value is T => <T>value !== undefined && <T>value !== null;\n\nexport const isAllDefined = <T>(values: ReadonlyArray<T | undefined | null>): values is ReadonlyArray<T> => !values.some(isNotDefined);\n\nexport const isNotDefined = <T>(value: T | undefined | null): value is undefined | null => !isDefined<T>(value);\n\nexport const isAllNotDefined = <T>(values: ReadonlyArray<T | undefined | null>): values is ReadonlyArray<undefined | null> => values.every(isNotDefined);\n\nexport const isString = (value: unknown): value is string => typeof value === 'string';\n\nexport const isBoolean = (value: unknown): value is boolean => typeof value === 'boolean';\n"],"names":["isDefined","value","isNotDefined","isString"],"mappings":"AAAO,MAAMA,UAAgBC,OAA+CA,YAI/DC,aAAmBD,QAA4DD,UAAaC,OAI5FE,SAAYF,OAAqD,iBAAVA"}

package/dist/packages/anarchy-shared/src/Utils/CssUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import{CssUnits}from"../Constants/CssUnits.js";import{isNotDefined}from"./CheckUtils.js";function getBaseTextSize(){return parseFloat(getComputedStyle(document.documentElement).fontSize)}function toPx(value){const baseTextSize=getBaseTextSize()\|\|16;return isNotDefined(value)?`${baseTextSize}px`:"number"==typeof value?`${value}px`:function(size){const units=getUnitsFromCssValue(size),value=stripUnits(size);switch(units){case CssUnits.Px:return`${value}px`;case CssUnits.Em:case CssUnits.Rem:return valuegetBaseTextSize()+"px";case CssUnits.Percent:return valuegetBaseTextSize()/100+"px";case CssUnits.Pt:return 4value/3+"px";default:return size}}(value)}function toRem(value){const baseTextSize=getBaseTextSize()\|\|16;return isNotDefined(value)?baseTextSize/16+"rem":"number"==typeof value?value/baseTextSize+"rem":function(size){const units=getUnitsFromCssValue(size),value=stripUnits(size);switch(units){case CssUnits.Px:return value/getBaseTextSize()+"rem";case CssUnits.Em:case CssUnits.Rem:return`${value}rem`;case CssUnits.Percent:return value/100(getBaseTextSize()/16)+"rem";case CssUnits.Pt:return 4value/(3getBaseTextSize())+"rem";default:return size}}(value)}const stripUnits=value=>parseFloat(value);function getUnitsFromCssValue(value){const match=value.match(/([a-zA-Z%]+)$/);return match?match[1]:""}export{getBaseTextSize,getUnitsFromCssValue,stripUnits,toPx,toRem};
2	+ //# sourceMappingURL=CssUtils.js.map

package/dist/packages/anarchy-shared/src/Utils/CssUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"CssUtils.js","sources":["../../../../../../anarchy-shared/src/Utils/CssUtils.ts"],"sourcesContent":["import { CssUnits } from '@Anarchy/Shared/Constants';\n\nimport { isNotDefined } from './CheckUtils';\n\nexport function getBaseTextSize(): number {\n return parseFloat(getComputedStyle(document.documentElement).fontSize);\n}\n\nexport function toPx(value: string | number | undefined): string {\n const defaultBaseTextSize: number = 16;\n const baseTextSize: number = getBaseTextSize() || defaultBaseTextSize;\n if (isNotDefined(value)) return `${baseTextSize}px`;\n if (typeof value === 'number') return `${value}px`;\n return getSizeInPx(value);\n}\n\nexport function toRem(value: string | number | undefined): string {\n const defaultBaseTextSize: number = 16;\n const baseTextSize: number = getBaseTextSize() || defaultBaseTextSize;\n if (isNotDefined(value)) return `${baseTextSize / 16}rem`;\n if (typeof value === 'number') return `${value / baseTextSize}rem`;\n return getSizeInRem(value);\n}\n\n// eslint-disable-next-line functional/prefer-tacit\nexport const stripUnits = (value: string): number => parseFloat(value);\n\nfunction getSizeInPx(size: string): string {\n const units: string = getUnitsFromCssValue(size);\n const value: number = stripUnits(size);\n switch (units) {\n case CssUnits.Px:\n return `${value}px`;\n case CssUnits.Em:\n return `${value * getBaseTextSize()}px`;\n case CssUnits.Rem:\n return `${value * getBaseTextSize()}px`;\n case CssUnits.Percent:\n return `${(value * getBaseTextSize()) / 100}px`;\n case CssUnits.Pt:\n return `${(value * 4) / 3}px`; // 1pt = 1.3333px\n default:\n return size;\n }\n}\n\nfunction getSizeInRem(size: string): string {\n const units: string = getUnitsFromCssValue(size);\n const value: number = stripUnits(size);\n switch (units) {\n case CssUnits.Px:\n return `${value / getBaseTextSize()}rem`;\n case CssUnits.Em:\n return `${value}rem`; // Em is relative to the font size of the element, so it remains the same\n case CssUnits.Rem:\n return `${value}rem`;\n case CssUnits.Percent:\n return `${(value / 100) * (getBaseTextSize() / 16)}rem`;\n case CssUnits.Pt:\n return `${(value * 4) / (3 * getBaseTextSize())}rem`; // 1pt = 1.3333px\n default:\n return size;\n }\n}\n\nexport function getUnitsFromCssValue(value: string): string {\n const match = value.match(/([a-zA-Z%]+)$/);\n return match ? match[1] : '';\n}\n"],"names":["getBaseTextSize","parseFloat","getComputedStyle","document","documentElement","fontSize","toPx","value","baseTextSize","isNotDefined","size","units","getUnitsFromCssValue","stripUnits","CssUnits","Px","Em","Rem","Percent","Pt","getSizeInPx","toRem","getSizeInRem","match"],"mappings":"yFAIO,SAASA,kBACd,OAAOC,WAAWC,iBAAiBC,SAASC,iBAAiBC,SAC/D,CAEO,SAASC,KAAKC,OACnB,MACMC,aAAuBR,mBADO,GAEpC,OAAIS,aAAaF,OAAe,GAAGC,iBACd,iBAAVD,MAA2B,GAAGA,UAe3C,SAAqBG,MACnB,MAAMC,MAAgBC,qBAAqBF,MACrCH,MAAgBM,WAAWH,MACjC,OAAQC,OACN,KAAKG,SAASC,GACZ,MAAO,GAAGR,UACZ,KAAKO,SAASE,GAEd,KAAKF,SAASG,IACZ,OAAUV,MAAQP,kBAAX,KACT,KAAKc,SAASI,QACZ,OAAWX,MAAQP,kBAAqB,IAAjC,KACT,KAAKc,SAASK,GACZ,OAAmB,EAARZ,MAAa,EAAjB,KACT,QACE,OAAOG,KAEb,CA/BSU,CAAYb,MACrB,CAEO,SAASc,MAAMd,OACpB,MACMC,aAAuBR,mBADO,GAEpC,OAAIS,aAAaF,OAAkBC,aAAe,GAAlB,MACX,iBAAVD,MAA8BA,MAAQC,aAAX,MA0BxC,SAAsBE,MACpB,MAAMC,MAAgBC,qBAAqBF,MACrCH,MAAgBM,WAAWH,MACjC,OAAQC,OACN,KAAKG,SAASC,GACZ,OAAUR,MAAQP,kBAAX,MACT,KAAKc,SAASE,GAEd,KAAKF,SAASG,IACZ,MAAO,GAAGV,WACZ,KAAKO,SAASI,QACZ,OAAWX,MAAQ,KAAQP,kBAAoB,IAAxC,MACT,KAAKc,SAASK,GACZ,OAAmB,EAARZ,OAAc,EAAIP,mBAAtB,MACT,QACE,OAAOU,KAEb,CA1CSY,CAAaf,MACtB,CAGO,MAAMM,WAAcN,OAA0BN,WAAWM,OAwCzD,SAASK,qBAAqBL,OACnC,MAAMgB,MAAQhB,MAAMgB,MAAM,iBAC1B,OAAOA,MAAQA,MAAM,GAAK,EAC5B"}

package/dist/packages/anarchy-shared/src/Utils/MapUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ function findInMap(map,cb){for(const[key,value]of map)if(cb(value,key))return map.get(key)}function findKeyInMap(map,cb){for(const[key,value]of map)if(cb(value,key))return key}function findKeyWithValue(map,value){for(const[key,val]of map.entries())if(val===value)return key}export{findInMap,findKeyInMap,findKeyWithValue};
2	+ //# sourceMappingURL=MapUtils.js.map

package/dist/packages/anarchy-shared/src/Utils/MapUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"MapUtils.js","sources":["../../../../../../anarchy-shared/src/Utils/MapUtils.ts"],"sourcesContent":["export function findInMap<K, V>(map: Map<K, V>, cb: (value: V, key: K) => boolean): V | undefined {\n // eslint-disable-next-line functional/no-loop-statements\n for (const [key, value] of map) {\n if (cb(value, key)) return map.get(key);\n }\n return undefined;\n}\n\nexport function findKeyInMap<K, V>(map: Map<K, V>, cb: (value: V, key: K) => boolean): K | undefined {\n // eslint-disable-next-line functional/no-loop-statements\n for (const [key, value] of map) {\n if (cb(value, key)) return key;\n }\n return undefined;\n}\n\n// NOTE: Slow O(n) linear lookup\nexport function findKeyWithValue<K, V>(map: Map<K, V>, value: V): K | undefined {\n // eslint-disable-next-line functional/no-loop-statements\n for (const [key, val] of map.entries()) if (val === value) return key;\n return undefined;\n}\n"],"names":["findInMap","map","cb","key","value","get","findKeyInMap","findKeyWithValue","val","entries"],"mappings":"AAAO,SAASA,UAAgBC,IAAgBC,IAE9C,IAAA,MAAYC,IAAKC,SAAUH,IACzB,GAAIC,GAAGE,MAAOD,KAAM,OAAOF,IAAII,IAAIF,IAGvC,CAEO,SAASG,aAAmBL,IAAgBC,IAEjD,IAAA,MAAYC,IAAKC,SAAUH,IACzB,GAAIC,GAAGE,MAAOD,KAAM,OAAOA,GAG/B,CAGO,SAASI,iBAAuBN,IAAgBG,OAErD,IAAA,MAAYD,IAAKK,OAAQP,IAAIQ,UAAW,GAAID,MAAQJ,MAAO,OAAOD,GAEpE"}

package/dist/packages/anarchy-shared/src/Utils/ObjectUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ import cloneDeepWith from"../../../../node_modules/lodash-es/cloneDeepWith.js";import isPlainObject from"../../../../node_modules/lodash-es/isPlainObject.js";function isObject(obj,shouldAllowCustomObjects=!1){if(!obj)return!1;const hasConstructor=!!shouldAllowCustomObjects\|\|obj.constructor===Object;return"object"==typeof obj&&!Array.isArray(obj)&&hasConstructor}const omitInObjectWithoutMutation=(obj,keys)=>{let result={};return Object.keys(obj).forEach(key=>{keys.includes(key)\|\|(result={...result,[key]:obj[key]})}),result},filterValues=value=>null!=value&&value!==1/0&&value!==-1/0;function filterOutEmptyFields(item){return Array.isArray(item)?item.filter(filterValues):Object.fromEntries(Object.entries(item).filter(([,value])=>filterValues(value)))}function filterOutEmptyFieldsRecursive(input){const customizer=value=>{if(!(null===value\|\|"object"!=typeof value\|\|value instanceof Date\|\|value instanceof RegExp\|\|value instanceof Map\|\|value instanceof Set\|\|"undefined"!=typeof ArrayBuffer&&ArrayBuffer.isView(value))){if(Array.isArray(value))return value.map(v=>cloneDeepWith(v,customizer)).filter(v=>void 0!==v);if(isPlainObject(value))return Object.entries(value).filter(([,v])=>void 0!==v).map(([k,v])=>[k,cloneDeepWith(v,customizer)]).filter(([,cleanedValue])=>void 0!==cleanedValue).reduce((acc,[k,cleanedValue])=>({...acc,[k]:cleanedValue}),{})}};return cloneDeepWith(input,customizer)}export{filterOutEmptyFields,filterOutEmptyFieldsRecursive,isObject,omitInObjectWithoutMutation};
2	+ //# sourceMappingURL=ObjectUtils.js.map

package/dist/packages/anarchy-shared/src/Utils/ObjectUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"ObjectUtils.js","sources":["../../../../../../anarchy-shared/src/Utils/ObjectUtils.ts"],"sourcesContent":["import type { TDeepPartial } from '@Anarchy/Shared/Utils/TypesUtils';\nimport { cloneDeepWith, isPlainObject } from 'lodash-es';\n\nexport function cleanObject<T extends Record<string, unknown>>(obj: T): void {\n Object.keys(obj).forEach((key: keyof T): void => {\n // eslint-disable-next-line functional/immutable-data\n obj[key] = null as any;\n // eslint-disable-next-line functional/immutable-data\n delete obj[key];\n });\n}\n\nexport function isObject(obj: unknown, shouldAllowCustomObjects: boolean = false): obj is Record<string, unknown> {\n if (!obj) return false;\n\n const hasConstructor = shouldAllowCustomObjects ? true : (obj as any).constructor === Object;\n return typeof obj === 'object' && !Array.isArray(obj) && hasConstructor;\n}\n\nexport const isEmptyObject = (obj: Record<string, unknown>): boolean => Object.keys(obj).length === 0 && isObject(obj);\n\nexport const omitInObjectWithoutMutation = <T extends Readonly<Record<string, unknown>>, K extends keyof T>(obj: T, keys: ReadonlyArray<K>): Omit<T, K> => {\n let result: T = {} as T;\n Object.keys(obj).forEach((key: keyof T): void => {\n if (!keys.includes(key as K)) {\n result = { ...result, [key]: obj[key] };\n }\n });\n return result;\n};\n\nexport const omitInObjectWithMutation = <T extends Record<string, unknown>, K extends keyof T>(obj: T, keys: ReadonlyArray<K>): Omit<T, K> => {\n // eslint-disable-next-line functional/immutable-data\n keys.forEach((key: K) => delete obj[key]);\n return obj;\n};\n\nconst filterValues = (value: unknown): boolean => value !== undefined && value !== null && value !== Infinity && value !== -Infinity;\n\nexport function filterOutEmptyFields<T extends Record<string, unknown> | ReadonlyArray<unknown>>(item: T): T {\n if (Array.isArray(item)) return item.filter(filterValues) as unknown as T;\n return Object.fromEntries(Object.entries(item).filter(([, value]: [string, unknown]): boolean => filterValues(value))) as T;\n}\n\nexport function filterOutEmptyFieldsRecursive<T extends Record<string, unknown> | ReadonlyArray<unknown>>(input: T): T {\n const customizer = (value: unknown): unknown => {\n if (\n value === null ||\n typeof value !== 'object' ||\n value instanceof Date ||\n value instanceof RegExp ||\n value instanceof Map ||\n value instanceof Set ||\n (typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView(value)) // TypedArray/DataView\n )\n return undefined;\n\n if (Array.isArray(value)) {\n const cleaned = (value as ReadonlyArray<unknown>).map((v) => cloneDeepWith(v, customizer));\n return cleaned.filter((v): boolean => v !== undefined);\n }\n\n if (isPlainObject(value)) {\n const src: Record<string, unknown> = value as Record<string, unknown>;\n return Object.entries(src)\n .filter(([, v]): boolean => v !== undefined)\n .map(([k, v]) => [k, cloneDeepWith(v, customizer)])\n .filter(([, cleanedValue]): boolean => cleanedValue !== undefined)\n .reduce((acc, [k, cleanedValue]) => ({ ...acc, [k]: cleanedValue }), {} as Record<string, unknown>);\n }\n\n return undefined;\n };\n\n return cloneDeepWith(input, customizer) as T;\n}\n\n// Merges objects but overrides only defined values from patch\nexport function patchObject<T extends Record<string, any>>(base: T, patch?: TDeepPartial<T>): T {\n if (patch === undefined) return base;\n\n if (!isObject(base) || Array.isArray(patch)) return patch as T;\n const out: Record<string, unknown> = { ...base };\n\n Object.entries(patch).forEach(([key, patchVal]): void => {\n if (patchVal === undefined) return;\n const baseVal = base[key];\n\n // eslint-disable-next-line functional/immutable-data\n out[key] = Array.isArray(patchVal) ? patchVal.slice() : isObject(patchVal) && isObject(baseVal) ? patchObject(baseVal, patchVal) : patchVal;\n });\n\n return out as T;\n}\n"],"names":["isObject","obj","shouldAllowCustomObjects","hasConstructor","constructor","Object","Array","isArray","omitInObjectWithoutMutation","keys","result","forEach","key","includes","filterValues","value","Infinity","filterOutEmptyFields","item","filter","fromEntries","entries","filterOutEmptyFieldsRecursive","input","customizer","Date","RegExp","Map","Set","ArrayBuffer","isView","map","v","cloneDeepWith","isPlainObject","k","cleanedValue","reduce","acc"],"mappings":"8JAYO,SAASA,SAASC,IAAcC,0BAAoC,GACzE,IAAKD,IAAK,OAAO,EAEjB,MAAME,iBAAiBD,0BAAmCD,IAAYG,cAAgBC,OACtF,MAAsB,iBAARJ,MAAqBK,MAAMC,QAAQN,MAAQE,cAC3D,CAIO,MAAMK,4BAA8B,CAAiEP,IAAQQ,QAClH,IAAIC,OAAY,CAAA,EAMhB,OALAL,OAAOI,KAAKR,KAAKU,QAASC,MACnBH,KAAKI,SAASD,OACjBF,OAAS,IAAKA,OAAQE,CAACA,KAAMX,IAAIW,SAG9BF,QASHI,aAAgBC,OAA4BA,aAAyCA,QAAUC,KAAYD,SAAU,IAEpH,SAASE,qBAAiFC,MAC/F,OAAIZ,MAAMC,QAAQW,MAAcA,KAAKC,OAAOL,cACrCT,OAAOe,YAAYf,OAAOgB,QAAQH,MAAMC,OAAO,EAAC,CAAGJ,SAAuCD,aAAaC,QAChH,CAEO,SAASO,8BAA0FC,OACxG,MAAMC,WAAcT,QAClB,KACY,OAAVA,OACiB,iBAAVA,OACPA,iBAAiBU,MACjBV,iBAAiBW,QACjBX,iBAAiBY,KACjBZ,iBAAiBa,KACO,oBAAhBC,aAA+BA,YAAYC,OAAOf,QAP5D,CAWA,GAAIT,MAAMC,QAAQQ,OAEhB,OADiBA,MAAiCgB,IAAKC,GAAMC,cAAcD,EAAGR,aAC/DL,OAAQa,QAAqB,IAANA,GAGxC,GAAIE,cAAcnB,OAEhB,OAAOV,OAAOgB,QADuBN,OAElCI,OAAO,EAAC,CAAGa,UAAsB,IAANA,GAC3BD,IAAI,EAAEI,EAAGH,KAAO,CAACG,EAAGF,cAAcD,EAAGR,cACrCL,OAAO,EAAC,CAAGiB,yBAA2BA,cACtCC,OAAO,CAACC,KAAMH,EAAGC,iBAAY,IAAYE,IAAKH,CAACA,GAAIC,eAAiB,GAbhE,GAmBX,OAAOH,cAAcV,MAAOC,WAC9B"}

package/dist/packages/anarchy-shared/src/Utils/StringUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ function camelToKebab(str){return str.replace(/([a-z0-9])([A-Z])/g,"$1-$2").toLowerCase()}function kebabToCamel(input){return input.includes("-")?input.toLowerCase().split("-").map((part,index)=>0===index?part:part.charAt(0).toUpperCase()+part.slice(1)).join(""):input}export{camelToKebab,kebabToCamel};
2	+ //# sourceMappingURL=StringUtils.js.map

package/dist/packages/anarchy-shared/src/Utils/StringUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"StringUtils.js","sources":["../../../../../../anarchy-shared/src/Utils/StringUtils.ts"],"sourcesContent":["export function camelToKebab(str: string): string {\n return str.replace(/([a-z0-9])([A-Z])/g, '$1-$2').toLowerCase();\n}\n\nexport function kebabToCamel(input: string): string {\n if (!input.includes('-')) return input;\n\n return input\n .toLowerCase()\n .split('-')\n .map((part: string, index: number): string => (index === 0 ? part : part.charAt(0).toUpperCase() + part.slice(1)))\n .join('');\n}\n"],"names":["camelToKebab","str","replace","toLowerCase","kebabToCamel","input","includes","split","map","part","index","charAt","toUpperCase","slice","join"],"mappings":"AAAO,SAASA,aAAaC,KAC3B,OAAOA,IAAIC,QAAQ,qBAAsB,SAASC,aACpD,CAEO,SAASC,aAAaC,OAC3B,OAAKA,MAAMC,SAAS,KAEbD,MACJF,cACAI,MAAM,KACNC,IAAI,CAACC,KAAcC,QAAqC,IAAVA,MAAcD,KAAOA,KAAKE,OAAO,GAAGC,cAAgBH,KAAKI,MAAM,IAC7GC,KAAK,IANyBT,KAOnC"}

package/dist/packages/anarchy-shared/src/Utils/TypesUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ function nullsToUndefined(obj){const result={};for(const key in obj){const value=obj[key];result[key]=null===value?void 0:value}return result}export{nullsToUndefined};
2	+ //# sourceMappingURL=TypesUtils.js.map

package/dist/packages/anarchy-shared/src/Utils/TypesUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"TypesUtils.js","sources":["../../../../../../anarchy-shared/src/Utils/TypesUtils.ts"],"sourcesContent":["export type TWriteable<T> = { -readonly [P in keyof T]: T[P] };\n\nexport type TDeepWriteable<T> = { -readonly [P in keyof T]: TDeepWriteable<T[P]> };\n\nexport type TOptional<T> = {\n [P in keyof T]?: T[P];\n};\n\nexport type TWithNull<T> = {\n [P in keyof T]: T[P] | null;\n};\n\nexport type TWithUndefined<T> = {\n [P in keyof T]: T[P] | undefined;\n};\n\nexport type TWithoutNull<T> = {\n [K in keyof T]: Exclude<T[K], null> extends never ? undefined : Exclude<T[K], null> | undefined;\n};\n\nexport type TWithMandatoryField<T, K extends keyof T> = Omit<T, K> & Required<Pick<T, K>>;\n\nexport type TValueOf<T> = T[keyof T];\n\nexport type TNullToUndefined<T> = {\n [K in keyof T]: T[K] extends null ? undefined : T[K] extends null | infer U ? U | undefined : T[K];\n};\n\nexport function nullsToUndefined<T extends Record<string, any>>(obj: T): TNullToUndefined<T> {\n const result = {} as TNullToUndefined<T>;\n // eslint-disable-next-line functional/no-loop-statements\n for (const key in obj) {\n const value = obj[key];\n // eslint-disable-next-line functional/immutable-data\n (result as any)[key] = value === null ? undefined : value;\n }\n return result;\n}\n\nexport type TUnionToIntersection<U> = (U extends any ? (k: U) => void : never) extends (k: infer I) => void ? I : never;\n\nexport type TDeepPartial<T> = T extends ReadonlyArray<infer U> ? ReadonlyArray<TDeepPartial<U>> : T extends object ? { readonly [K in keyof T]?: TDeepPartial<T[K]> } : T;\n"],"names":["nullsToUndefined","obj","result","key","value"],"mappings":"AA4BO,SAASA,iBAAgDC,KAC9D,MAAMC,OAAS,CAAA,EAEf,IAAA,MAAWC,OAAOF,IAAK,CACrB,MAAMG,MAAQH,IAAIE,KAEjBD,OAAeC,KAAiB,OAAVC,WAAiB,EAAYA,KACtD,CACA,OAAOF,MACT"}

package/dist/packages/anarchy-shared/src/Utils/WebGlUtils.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ function isWebGLAvailable(){let canvas;try{return!!(window&&document&&(canvas=document.createElement("canvas"),canvas&&window.WebGLRenderingContext&&(canvas.getContext("webgl")\|\|canvas.getContext("experimental-webgl"))))}catch{return!1}finally{canvas=void 0}}function isWebGL2Available(){let canvas;try{return!!(window&&document&&(canvas=document.createElement("canvas"),canvas&&window.WebGL2RenderingContext&&canvas.getContext("webgl2")))}finally{canvas=void 0}}export{isWebGL2Available,isWebGLAvailable};
2	+ //# sourceMappingURL=WebGlUtils.js.map

package/dist/packages/anarchy-shared/src/Utils/WebGlUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"WebGlUtils.js","sources":["../../../../../../anarchy-shared/src/Utils/WebGlUtils.ts"],"sourcesContent":["export function isWebGLAvailable(): boolean {\n let canvas: Readonly<HTMLCanvasElement> | undefined = undefined;\n\n try {\n if (!window || !document) return false;\n canvas = document.createElement('canvas');\n if (!canvas) return false;\n return !!(window.WebGLRenderingContext && (canvas.getContext('webgl') || canvas.getContext('experimental-webgl')));\n } catch {\n return false;\n } finally {\n canvas = undefined;\n }\n}\n\nexport function isWebGL2Available(): boolean {\n let canvas: Readonly<HTMLCanvasElement> | undefined = undefined;\n\n try {\n if (!window || !document) return false;\n canvas = document.createElement('canvas');\n if (!canvas) return false;\n return !!(window.WebGL2RenderingContext && canvas.getContext('webgl2'));\n } finally {\n canvas = undefined;\n }\n}\n"],"names":["isWebGLAvailable","canvas","window","document","createElement","WebGLRenderingContext","getContext","isWebGL2Available","WebGL2RenderingContext"],"mappings":"AAAO,SAASA,mBACd,IAAIC,OAEJ,IACE,SAAKC,QAAWC,WAChBF,OAASE,SAASC,cAAc,UAC3BH,QACKC,OAAOG,wBAA0BJ,OAAOK,WAAW,UAAYL,OAAOK,WAAW,wBAC7F,CAAA,MACE,OAAO,CACT,CAAA,QACEL,YAAS,CACX,CACF,CAEO,SAASM,oBACd,IAAIN,OAEJ,IACE,SAAKC,QAAWC,WAChBF,OAASE,SAASC,cAAc,UAC3BH,QACKC,OAAOM,wBAA0BP,OAAOK,WAAW,WAC/D,CAAA,QACEL,YAAS,CACX,CACF"}

package/legal/NOTICE.md CHANGED Viewed

@@ -5,7 +5,7 @@
 This product includes third-party components. Their **licenses and attributions** are listed below.
 For the **full license texts**, see `THIRD_PARTY_LICENSES.md`.
-Components listed: 16
+Components listed: 15
 ## 1) Mandatory Attributions (verbatim)
@@ -23,19 +23,7 @@ The following notices are reproduced as provided by the respective licensors (e.
 ---
-## @dimforge/rapier3d@0.19.3
-**License(s):** Apache-2.0
-**Repository:** https://github.com/dimforge/rapier.js
-**URL:** https://rapier.rs
-**Attribution:** copyright notice that is included in or attached to the work
----
-## @hellpig/anarchy-shared@1.5.2
+## @hellpig/anarchy-shared@1.6.1
 **License(s):** MIT