2 lines
16 KiB
JavaScript
2 lines
16 KiB
JavaScript
import{at as Tt,gY as I,cS as G,cT as j,hm as Q,cP as Z,hl as Ot,bT as N,bU as f,fn as tt,hS as K,A as bt,C as gt,aC as Rt,cO as z}from"./index-b5c8f851.js";import{v as Et,b as At,l as Nt}from"./lineSegment-95273d56.js";import{s as lt,d as et,T as w,p as nt,B as $,U as S,J as ot,E as M,i as it}from"./sphere-5667aa69.js";import"./plane-66dd48d1.js";import{a as st}from"./Indices-8bd7636c.js";import{m as St}from"./edgeProcessing-03347f0a.js";import"./ByteSizeUnit-d4757d40.js";import"./mat4f64-1413b4a7.js";import"./quatf64-3363c48e.js";import"./deduplicate-d84e5ef3.js";import"./InterleavedLayout-f58607b0.js";import"./BufferView-db785e2d.js";import"./types-1305598a.js";import"./VertexAttribute-0e674613.js";import"./enums-bdecffa2.js";import"./VertexElementDescriptor-2925c6af.js";function ut(o){return o?{ray:et(o.ray),c0:o.c0,c1:o.c1}:{ray:et(),c0:0,c1:Number.MAX_VALUE}}new lt(()=>ut());function C(o,t){for(let e=0;e<Ft;e++){const n=o[e];if(n[0]*t[0]+n[1]*t[1]+n[2]*t[2]+n[3]>=t[3])return!1}return!0}var rt,c;(function(o){o[o.LEFT=0]="LEFT",o[o.RIGHT=1]="RIGHT",o[o.BOTTOM=2]="BOTTOM",o[o.TOP=3]="TOP",o[o.NEAR=4]="NEAR",o[o.FAR=5]="FAR"})(rt||(rt={})),function(o){o[o.NEAR_BOTTOM_LEFT=0]="NEAR_BOTTOM_LEFT",o[o.NEAR_BOTTOM_RIGHT=1]="NEAR_BOTTOM_RIGHT",o[o.NEAR_TOP_RIGHT=2]="NEAR_TOP_RIGHT",o[o.NEAR_TOP_LEFT=3]="NEAR_TOP_LEFT",o[o.FAR_BOTTOM_LEFT=4]="FAR_BOTTOM_LEFT",o[o.FAR_BOTTOM_RIGHT=5]="FAR_BOTTOM_RIGHT",o[o.FAR_TOP_RIGHT=6]="FAR_TOP_RIGHT",o[o.FAR_TOP_LEFT=7]="FAR_TOP_LEFT"}(c||(c={}));c.FAR_BOTTOM_RIGHT,c.NEAR_BOTTOM_RIGHT,c.NEAR_BOTTOM_LEFT,c.FAR_BOTTOM_LEFT,c.NEAR_BOTTOM_LEFT,c.NEAR_BOTTOM_RIGHT,c.NEAR_TOP_RIGHT,c.NEAR_TOP_LEFT,c.FAR_BOTTOM_RIGHT,c.FAR_BOTTOM_LEFT,c.FAR_TOP_LEFT,c.FAR_TOP_RIGHT,c.NEAR_BOTTOM_RIGHT,c.FAR_BOTTOM_RIGHT,c.FAR_TOP_RIGHT,c.NEAR_TOP_RIGHT,c.FAR_BOTTOM_LEFT,c.NEAR_BOTTOM_LEFT,c.NEAR_TOP_LEFT,c.FAR_TOP_LEFT,c.FAR_TOP_LEFT,c.NEAR_TOP_LEFT,c.NEAR_TOP_RIGHT,c.FAR_TOP_RIGHT;const Ft=6;new lt(ut);let J=class H{get bounds(){return this._root.bounds}get halfSize(){return this._root.halfSize}get root(){return this._root.node}get maximumObjectsPerNode(){return this._maximumObjectsPerNode}get maximumDepth(){return this._maximumDepth}get objectCount(){return this._objectCount}constructor(t,e){this.objectToBoundingSphere=t,this._maximumObjectsPerNode=10,this._maximumDepth=20,this._degenerateObjects=new Set,this._root=new l,this._objectCount=0,e&&(e.maximumObjectsPerNode!==void 0&&(this._maximumObjectsPerNode=e.maximumObjectsPerNode),e.maximumDepth!==void 0&&(this._maximumDepth=e.maximumDepth))}destroy(){this._degenerateObjects.clear(),l.clearPool(),U[0]=null,F.prune(),x.prune()}add(t,e=t.length){this._objectCount+=e,this._grow(t,e);const n=l.acquire();for(let i=0;i<e;i++){const s=t[i];this._isDegenerate(s)?this._degenerateObjects.add(s):(n.init(this._root),this._add(s,n))}l.release(n)}remove(t,e=null){this._objectCount-=t.length;const n=l.acquire();for(const i of t){const s=e??w(this.objectToBoundingSphere(i),Pt);L(s[3])?(n.init(this._root),this._remove(i,s,n)):this._degenerateObjects.delete(i)}l.release(n),this._shrink()}update(t,e){if(!L(e[3])&&this._isDegenerate(t))return;const n=Bt(t);this.remove(n,e),this.add(n)}forEachAlongRay(t,e,n){const i=nt(t,e);this._forEachNode(this._root,s=>{if(!this._intersectsNode(i,s))return!1;const h=s.node;return h.terminals.forAll(a=>{this._intersectsObject(i,a)&&n(a)}),h.residents!==null&&h.residents.forAll(a=>{this._intersectsObject(i,a)&&n(a)}),!0})}forEachAlongRayWithVerticalOffset(t,e,n,i){const s=nt(t,e);this._forEachNode(this._root,h=>{if(!this._intersectsNodeWithOffset(s,h,i))return!1;const a=h.node;return a.terminals.forAll(r=>{this._intersectsObjectWithOffset(s,r,i)&&n(r)}),a.residents!==null&&a.residents.forAll(r=>{this._intersectsObjectWithOffset(s,r,i)&&n(r)}),!0})}forEach(t){this._forEachNode(this._root,e=>{const n=e.node;return n.terminals.forAll(t),n.residents!==null&&n.residents.forAll(t),!0}),this._degenerateObjects.forEach(t)}forEachDegenerateObject(t){this._degenerateObjects.forEach(t)}findClosest(t,e,n,i=()=>!0,s=1/0){let h=1/0,a=1/0,r=null;const d=q(t,e),_=u=>{if(--s,!i(u))return;const p=this.objectToBoundingSphere(u);if(!C(n,p))return;const g=A(t,e,S(p)),B=g-p[3],m=g+p[3];B<h&&(h=B,a=m,r=u)};return this._forEachNodeDepthOrdered(this._root,u=>{if(s<=0||!C(n,u.bounds)||(G(b,d,u.halfSize),j(b,b,u.bounds),A(t,e,b)>a))return!1;const p=u.node;return p.terminals.forAll(g=>_(g)),p.residents!==null&&p.residents.forAll(g=>_(g)),!0},t,e),r}forEachInDepthRange(t,e,n,i,s,h,a){let r=-1/0,d=1/0;const _={setRange:m=>{n===H.DepthOrder.FRONT_TO_BACK?(r=Math.max(r,m.near),d=Math.min(d,m.far)):(r=Math.max(r,-m.far),d=Math.min(d,-m.near))}};_.setRange(i);const u=A(e,n,t),p=q(e,n),g=q(e,-n),B=m=>{if(!a(m))return;const E=this.objectToBoundingSphere(m),P=S(E),Y=A(e,n,P)-u,ft=Y-E[3],pt=Y+E[3];ft>d||pt<r||!C(h,E)||s(m,_)};this._forEachNodeDepthOrdered(this._root,m=>{if(!C(h,m.bounds)||(G(b,p,m.halfSize),j(b,b,m.bounds),A(e,n,b)-u>d)||(G(b,g,m.halfSize),j(b,b,m.bounds),A(e,n,b)-u<r))return!1;const E=m.node;return E.terminals.forAll(P=>B(P)),E.residents!==null&&E.residents.forAll(P=>B(P)),!0},e,n)}forEachNode(t){this._forEachNode(this._root,e=>t(e.node,e.bounds,e.halfSize,e.depth))}forEachNeighbor(t,e){const n=$(e),i=S(e),s=r=>{const d=this.objectToBoundingSphere(r),_=$(d),u=n+_;return!(Q(S(d),i)-u*u<=0)||t(r)};let h=!0;const a=r=>{h&&(h=s(r))};this._forEachNode(this._root,r=>{const d=$(r.bounds),_=n+d;if(Q(S(r.bounds),i)-_*_>0)return!1;const u=r.node;return u.terminals.forAll(a),h&&u.residents!==null&&u.residents.forAll(a),h}),h&&this.forEachDegenerateObject(a)}_intersectsNode(t,e){return v(e.bounds,2*-e.halfSize,T),v(e.bounds,2*e.halfSize,O),st(t.origin,t.direction,T,O)}_intersectsNodeWithOffset(t,e,n){return v(e.bounds,2*-e.halfSize,T),v(e.bounds,2*e.halfSize,O),n.applyToMinMax(T,O),st(t.origin,t.direction,T,O)}_intersectsObject(t,e){const n=this.objectToBoundingSphere(e);return!(n[3]>0)||ot(n,t)}_intersectsObjectWithOffset(t,e,n){const i=this.objectToBoundingSphere(e);return!(i[3]>0)||ot(n.applyToBoundingSphere(i),t)}_forEachNode(t,e){let n=l.acquire().init(t);const i=[n];for(;i.length!==0;){if(n=i.pop(),e(n)&&!n.isLeaf())for(let s=0;s<n.node.children.length;s++)n.node.children[s]&&i.push(l.acquire().init(n).advance(s));l.release(n)}}_forEachNodeDepthOrdered(t,e,n,i=H.DepthOrder.FRONT_TO_BACK){let s=l.acquire().init(t);const h=[s];for(jt(n,i,dt);h.length!==0;){if(s=h.pop(),e(s)&&!s.isLeaf())for(let a=7;a>=0;--a){const r=dt[a];s.node.children[r]&&h.push(l.acquire().init(s).advance(r))}l.release(s)}}_remove(t,e,n){F.clear();const i=n.advanceTo(e,(s,h)=>{F.push(s.node),F.push(h)})?n.node.terminals:n.node.residents;if(i.removeUnordered(t),i.length===0)for(let s=F.length-2;s>=0;s-=2){const h=F.data[s],a=F.data[s+1];if(!this._purge(h,a))break}}_nodeIsEmpty(t){if(t.terminals.length!==0)return!1;if(t.residents!==null)return t.residents.length===0;for(let e=0;e<t.children.length;e++)if(t.children[e])return!1;return!0}_purge(t,e){return e>=0&&(t.children[e]=null),!!this._nodeIsEmpty(t)&&(t.residents===null&&(t.residents=new I({shrink:!0})),!0)}_add(t,e){e.advanceTo(this.objectToBoundingSphere(t))?e.node.terminals.push(t):(e.node.residents.push(t),e.node.residents.length>this._maximumObjectsPerNode&&e.depth<this._maximumDepth&&this._split(e))}_split(t){const e=t.node.residents;t.node.residents=null;for(let n=0;n<e.length;n++){const i=l.acquire().init(t);this._add(e.at(n),i),l.release(i)}}_grow(t,e){if(e!==0&&(ht(t,e,n=>this.objectToBoundingSphere(n),R),L(R[3])&&!this._fitsInsideTree(R)))if(this._nodeIsEmpty(this._root.node))w(R,this._root.bounds),this._root.halfSize=1.25*this._root.bounds[3],this._root.updateBoundsRadiusFromHalfSize();else{const n=this._rootBoundsForRootAsSubNode(R);this._placingRootViolatesMaxDepth(n)?this._rebuildTree(R,n):this._growRootAsSubNode(n),l.release(n)}}_rebuildTree(t,e){Z(V,e.bounds),V[3]=e.halfSize,ht([t,V],2,i=>i,W);const n=l.acquire().init(this._root);this._root.initFrom(null,W,W[3]),this._root.increaseHalfSize(1.25),this._forEachNode(n,i=>(this.add(i.node.terminals.data,i.node.terminals.length),i.node.residents!==null&&this.add(i.node.residents.data,i.node.residents.length),!0)),l.release(n)}_placingRootViolatesMaxDepth(t){const e=Math.log(t.halfSize/this._root.halfSize)*Math.LOG2E;let n=0;return this._forEachNode(this._root,i=>(n=Math.max(n,i.depth),n+e<=this._maximumDepth)),n+e>this._maximumDepth}_rootBoundsForRootAsSubNode(t){const e=t[3],n=t;let i=-1/0;const s=this._root.bounds,h=this._root.halfSize;for(let r=0;r<3;r++){const d=s[r]-h-(n[r]-e),_=n[r]+e-(s[r]+h),u=Math.max(0,Math.ceil(d/(2*h))),p=Math.max(0,Math.ceil(_/(2*h)))+1,g=2**Math.ceil(Math.log(u+p)*Math.LOG2E);i=Math.max(i,g),D[r].min=u,D[r].max=p}for(let r=0;r<3;r++){let d=D[r].min,_=D[r].max;const u=(i-(d+_))/2;d+=Math.ceil(u),_+=Math.floor(u);const p=s[r]-h-d*h*2;k[r]=p+(_+d)*h}const a=i*h;return k[3]=a*mt,l.acquire().initFrom(null,k,a,0)}_growRootAsSubNode(t){const e=this._root.node;Z(R,this._root.bounds),R[3]=this._root.halfSize,this._root.init(t),t.advanceTo(R,null,!0),t.node.children=e.children,t.node.residents=e.residents,t.node.terminals=e.terminals}_shrink(){for(;;){const t=this._findShrinkIndex();if(t===-1)break;this._root.advance(t),this._root.depth=0}}_findShrinkIndex(){if(this._root.node.terminals.length!==0||this._root.isLeaf())return-1;let t=null;const e=this._root.node.children;let n=0,i=0;for(;i<e.length&&t==null;)n=i++,t=e[n];for(;i<e.length;)if(e[i++])return-1;return n}_isDegenerate(t){return!L(this.objectToBoundingSphere(t)[3])}_fitsInsideTree(t){const e=this._root.bounds,n=this._root.halfSize;return t[3]<=n&&t[0]>=e[0]-n&&t[0]<=e[0]+n&&t[1]>=e[1]-n&&t[1]<=e[1]+n&&t[2]>=e[2]-n&&t[2]<=e[2]+n}toJSON(){const{maximumDepth:t,maximumObjectsPerNode:e,_objectCount:n}=this,i=this._nodeToJSON(this._root.node);return{maximumDepth:t,maximumObjectsPerNode:e,objectCount:n,root:{bounds:this._root.bounds,halfSize:this._root.halfSize,depth:this._root.depth,node:i}}}_nodeToJSON(t){var s,h;const e=t.children.map(a=>a?this._nodeToJSON(a):null),n=(s=t.residents)==null?void 0:s.map(a=>this.objectToBoundingSphere(a)),i=(h=t.terminals)==null?void 0:h.map(a=>this.objectToBoundingSphere(a));return{children:e,residents:n,terminals:i}}static fromJSON(t){const e=new H(n=>n,{maximumDepth:t.maximumDepth,maximumObjectsPerNode:t.maximumObjectsPerNode});return e._objectCount=t.objectCount,e._root.initFrom(t.root.node,t.root.bounds,t.root.halfSize,t.root.depth),e}};class l{constructor(){this.bounds=M(),this.halfSize=0,this.initFrom(null,null,0,0)}init(t){return this.initFrom(t.node,t.bounds,t.halfSize,t.depth)}initFrom(t,e,n,i=this.depth){return this.node=t??l.createEmptyNode(),e!=null&&w(e,this.bounds),this.halfSize=n,this.depth=i,this}increaseHalfSize(t){this.halfSize*=t,this.updateBoundsRadiusFromHalfSize()}updateBoundsRadiusFromHalfSize(){this.bounds[3]=this.halfSize*mt}advance(t){let e=this.node.children[t];e||(e=l.createEmptyNode(),this.node.children[t]=e),this.node=e,this.halfSize/=2,this.depth++;const n=_t[t];return this.bounds[0]+=n[0]*this.halfSize,this.bounds[1]+=n[1]*this.halfSize,this.bounds[2]+=n[2]*this.halfSize,this.updateBoundsRadiusFromHalfSize(),this}advanceTo(t,e,n=!1){for(;;){if(this.isTerminalFor(t))return e&&e(this,-1),!0;if(this.isLeaf()){if(!n)return e&&e(this,-1),!1;this.node.residents=null}const i=this._childIndex(t);e&&e(this,i),this.advance(i)}}isLeaf(){return this.node.residents!=null}isTerminalFor(t){return t[3]>this.halfSize/2}_childIndex(t){const e=this.bounds;return(e[0]<t[0]?1:0)+(e[1]<t[1]?2:0)+(e[2]<t[2]?4:0)}static createEmptyNode(){return{children:[null,null,null,null,null,null,null,null],terminals:new I({shrink:!0}),residents:new I({shrink:!0})}}static acquire(){return l._pool.acquire()}static release(t){l._pool.release(t)}static clearPool(){l._pool.prune()}}function xt(o,t){o[0]=Math.min(o[0],t[0]-t[3]),o[1]=Math.min(o[1],t[1]-t[3]),o[2]=Math.min(o[2],t[2]-t[3])}function Mt(o,t){o[0]=Math.max(o[0],t[0]+t[3]),o[1]=Math.max(o[1],t[1]+t[3]),o[2]=Math.max(o[2],t[2]+t[3])}function v(o,t,e){e[0]=o[0]+t,e[1]=o[1]+t,e[2]=o[2]+t}function ht(o,t,e,n){if(t===1){const i=e(o[0]);w(i,n)}else{T[0]=1/0,T[1]=1/0,T[2]=1/0,O[0]=-1/0,O[1]=-1/0,O[2]=-1/0;for(let i=0;i<t;i++){const s=e(o[i]);L(s[3])&&(xt(T,s),Mt(O,s))}Ot(n,T,O,.5),n[3]=Math.max(O[0]-T[0],O[1]-T[1],O[2]-T[2])/2}}function jt(o,t,e){if(!x.length)for(let n=0;n<8;++n)x.push({index:0,distance:0});for(let n=0;n<8;++n){const i=_t[n];x.data[n].index=n,x.data[n].distance=A(o,t,i)}x.sort((n,i)=>n.distance-i.distance);for(let n=0;n<8;++n)e[n]=x.data[n].index}function q(o,t){let e,n=1/0;for(let i=0;i<8;++i){const s=A(o,t,at[i]);s<n&&(n=s,e=at[i])}return e}function A(o,t,e){return t*(o[0]*e[0]+o[1]*e[1]+o[2]*e[2])}function L(o){return!isNaN(o)&&o!==-1/0&&o!==1/0&&o>0}l._pool=new Tt(l),function(o){var t;(t=o.DepthOrder||(o.DepthOrder={}))[t.FRONT_TO_BACK=1]="FRONT_TO_BACK",t[t.BACK_TO_FRONT=-1]="BACK_TO_FRONT"}(J||(J={}));const _t=[f(-1,-1,-1),f(1,-1,-1),f(-1,1,-1),f(1,1,-1),f(-1,-1,1),f(1,-1,1),f(-1,1,1),f(1,1,1)],at=[f(-1,-1,-1),f(-1,-1,1),f(-1,1,-1),f(-1,1,1),f(1,-1,-1),f(1,-1,1),f(1,1,-1),f(1,1,1)],mt=Math.sqrt(3),U=[null];function Bt(o){return U[0]=o,U}const k=M(),b=N(),T=N(),O=N(),F=new I,Pt=M(),R=M(),V=M(),W=M(),D=[{min:0,max:0},{min:0,max:0},{min:0,max:0}],x=new I,dt=[0,0,0,0,0,0,0,0],ct=J,Lt=1e3;function It(o,t,e){const n=M(),i=S(n);return tt(i,i,o,.5),tt(i,i,t,.5),n[3]=K(i,o),j(i,i,e),n}let X=class{constructor(){this._idToComponent=new Map,this._components=new ct(o=>o.bounds),this._edges=new ct(o=>o.bounds),this._tmpLineSegment=Et(),this._tmpP1=N(),this._tmpP2=N(),this._tmpP3=N(),this.remoteClient=null}async fetchCandidates(o,t){await Promise.resolve(),Rt(t),await this._ensureEdgeLocations(o,t);const e=[];return this._edges.forEachNeighbor(n=>(this._addCandidates(o,n,e),e.length<Lt),o.bounds),{result:{candidates:e}}}async _ensureEdgeLocations(o,t){const e=[];if(this._components.forEachNeighbor(s=>{if(s.info==null){const{id:h,uid:a}=s;e.push({id:h,uid:a})}return!0},o.bounds),!e.length)return;const n={components:e},i=await this.remoteClient.invoke("fetchAllEdgeLocations",n,t??{});for(const s of i.components)this._setFetchEdgeLocations(s)}async add(o){const t=new y(o.id,o.bounds);return this._idToComponent.set(t.id,t),this._components.add([t]),{result:{}}}async remove(o){const t=this._idToComponent.get(o.id);if(t){const e=[];this._edges.forEachNeighbor(n=>(n.component===t&&e.push(n),!0),t.bounds),this._edges.remove(e),this._components.remove([t]),this._idToComponent.delete(t.id)}return{result:{}}}_setFetchEdgeLocations(o){const t=this._idToComponent.get(o.id);if(t==null||o.uid!==t.uid)return;const e=St.createView(o.locations),n=new Array(e.count),i=N(),s=N();for(let r=0;r<e.count;r++){e.position0.getVec(r,i),e.position1.getVec(r,s);const d=It(i,s,o.origin),_=new zt(t,r,d);n[r]=_}this._edges.add(n);const{objectIds:h,origin:a}=o;t.info={locations:e,objectIds:h,origin:a}}_addCandidates(o,t,e){const{info:n}=t.component,{origin:i,objectIds:s}=n,h=n.locations,a=h.position0.getVec(t.index,this._tmpP1),r=h.position1.getVec(t.index,this._tmpP2);j(a,a,i),j(r,r,i);const d=s[h.componentIndex.get(t.index)];this._addEdgeCandidate(o,d,a,r,e),this._addVertexCandidate(o,d,a,e),this._addVertexCandidate(o,d,r,e)}_addEdgeCandidate(o,t,e,n,i){if(!o.returnEdge)return;const s=S(o.bounds),h=At(e,n,this._tmpLineSegment),a=Nt(h,s,this._tmpP3);it(o.bounds,a)&&i.push({type:"edge",objectId:t,target:z(a),distance:K(s,a),start:z(e),end:z(n)})}_addVertexCandidate(o,t,e,n){if(!o.returnVertex)return;const i=S(o.bounds);it(o.bounds,e)&&n.push({type:"vertex",objectId:t,target:z(e),distance:K(i,e)})}};X=bt([gt("esri.views.interactive.snapping.featureSources.sceneLayerSource.SceneLayerSnappingSourceWorker")],X);const Yt=X;class y{constructor(t,e){this.id=t,this.bounds=e,this.info=null,this.uid=++y.uid}}y.uid=0;class zt{constructor(t,e,n){this.component=t,this.index=e,this.bounds=n}}export{Yt as default};
|