@templmf/temp-solf-lmf 0.0.94 → 0.0.96

package/@antv/g@6.1.28/es2022/g.mjs

@@ -1,15 +0,0 @@
-/* esm.sh - @antv/g@6.1.28 */
-export*from"/@antv/g-camera-api@2.0.41/es2022/g-camera-api.mjs";export*from"/@antv/g-dom-mutation-observer-api@2.0.38/es2022/g-dom-mutation-observer-api.mjs";export*from"/@antv/g-lite@2.3.2/es2022/g-lite.mjs";export*from"/@antv/g-web-animations-api@2.1.28/es2022/g-web-animations-api.mjs";
-/*! Bundled license information:
-
-@antv/g/dist/index.esm.js:
-  (*!
-   * @antv/g
-   * @description A core module for rendering engine implements DOM API.
-   * @version 6.1.28
-   * @date 7/30/2025, 1:36:29 PM
-   * @author AntVis
-   * @docs https://g.antv.antgroup.com/
-   *)
-*/
-//# sourceMappingURL=g.mjs.map

package/@antv/graphlib@2.0.4/es2022/graphlib.mjs

@@ -1,3 +0,0 @@
-/* esm.sh - @antv/graphlib@2.0.4 */
-import N from"/@antv/event-emitter@^0.1.3?target=es2022";function c(h,e,t,s){for(;h.length;){let d=h.shift();if(t(d))return!0;e.add(d.id),s(d.id).forEach(a=>{e.has(a.id)||(e.add(a.id),h.push(a))})}return!1}function n(h,e,t,s){if(t(h))return!0;e.add(h.id);for(let r of s(h.id))if(!e.has(r.id)&&n(r,e,t,s))return!0;return!1}var p=()=>!0,g=class{graph;nodeFilter;edgeFilter;cacheEnabled;inEdgesMap=new Map;outEdgesMap=new Map;bothEdgesMap=new Map;allNodesMap=new Map;allEdgesMap=new Map;constructor(e){this.graph=e.graph;let t=e.nodeFilter||p,s=e.edgeFilter||p;this.nodeFilter=t,this.edgeFilter=d=>{let{source:r,target:a}=this.graph.getEdgeDetail(d.id);return!t(r)||!t(a)?!1:s(d,r,a)},e.cache==="auto"?(this.cacheEnabled=!0,this.startAutoCache()):e.cache==="manual"?this.cacheEnabled=!0:this.cacheEnabled=!1}clearCache=()=>{this.inEdgesMap.clear(),this.outEdgesMap.clear(),this.bothEdgesMap.clear(),this.allNodesMap.clear(),this.allEdgesMap.clear()};refreshCache=()=>{this.clearCache(),this.updateCache(this.graph.getAllNodes().map(e=>e.id))};updateCache=e=>{let t=new Set;e.forEach(s=>{let d=this.bothEdgesMap.get(s);if(d&&d.forEach(r=>t.add(r.id)),!this.hasNode(s))this.inEdgesMap.delete(s),this.outEdgesMap.delete(s),this.bothEdgesMap.delete(s),this.allNodesMap.delete(s);else{let r=this.graph.getRelatedEdges(s,"in").filter(this.edgeFilter),a=this.graph.getRelatedEdges(s,"out").filter(this.edgeFilter),i=Array.from(new Set([...r,...a]));i.forEach(o=>t.add(o.id)),this.inEdgesMap.set(s,r),this.outEdgesMap.set(s,a),this.bothEdgesMap.set(s,i),this.allNodesMap.set(s,this.graph.getNode(s))}}),t.forEach(s=>{this.hasEdge(s)?this.allEdgesMap.set(s,this.graph.getEdge(s)):this.allEdgesMap.delete(s)})};startAutoCache(){this.refreshCache(),this.graph.on("changed",this.handleGraphChanged)}stopAutoCache(){this.graph.off("changed",this.handleGraphChanged)}handleGraphChanged=e=>{let t=new Set;e.changes.forEach(s=>{switch(s.type){case"NodeAdded":t.add(s.value.id);break;case"NodeDataUpdated":t.add(s.id);break;case"EdgeAdded":t.add(s.value.source),t.add(s.value.target);break;case"EdgeUpdated":(s.propertyName==="source"||s.propertyName==="target")&&(t.add(s.oldValue),t.add(s.newValue));break;case"EdgeDataUpdated":if(e.graph.hasEdge(s.id)){let d=e.graph.getEdge(s.id);t.add(d.source),t.add(d.target)}break;case"EdgeRemoved":t.add(s.value.source),t.add(s.value.target);break;case"NodeRemoved":t.add(s.value.id);break;default:break}}),this.updateCache(t)};checkNodeExistence(e){this.getNode(e)}hasNode(e){if(!this.graph.hasNode(e))return!1;let t=this.graph.getNode(e);return this.nodeFilter(t)}areNeighbors(e,t){return this.checkNodeExistence(e),this.getNeighbors(t).some(s=>s.id===e)}getNode(e){let t=this.graph.getNode(e);if(!this.nodeFilter(t))throw new Error("Node not found for id: "+e);return t}getRelatedEdges(e,t){return this.checkNodeExistence(e),this.cacheEnabled?t==="in"?this.inEdgesMap.get(e):t==="out"?this.outEdgesMap.get(e):this.bothEdgesMap.get(e):this.graph.getRelatedEdges(e,t).filter(this.edgeFilter)}getDegree(e,t){return this.getRelatedEdges(e,t).length}getSuccessors(e){let s=this.getRelatedEdges(e,"out").map(d=>this.getNode(d.target));return Array.from(new Set(s))}getPredecessors(e){let s=this.getRelatedEdges(e,"in").map(d=>this.getNode(d.source));return Array.from(new Set(s))}getNeighbors(e){let t=this.getPredecessors(e),s=this.getSuccessors(e);return Array.from(new Set([...t,...s]))}hasEdge(e){if(!this.graph.hasEdge(e))return!1;let t=this.graph.getEdge(e);return this.edgeFilter(t)}getEdge(e){let t=this.graph.getEdge(e);if(!this.edgeFilter(t))throw new Error("Edge not found for id: "+e);return t}getEdgeDetail(e){let t=this.getEdge(e);return{edge:t,source:this.getNode(t.source),target:this.getNode(t.target)}}hasTreeStructure(e){return this.graph.hasTreeStructure(e)}getRoots(e){return this.graph.getRoots(e).filter(this.nodeFilter)}getChildren(e,t){return this.checkNodeExistence(e),this.graph.getChildren(e,t).filter(this.nodeFilter)}getParent(e,t){this.checkNodeExistence(e);let s=this.graph.getParent(e,t);return!s||!this.nodeFilter(s)?null:s}getAllNodes(){return this.cacheEnabled?Array.from(this.allNodesMap.values()):this.graph.getAllNodes().filter(this.nodeFilter)}getAllEdges(){return this.cacheEnabled?Array.from(this.allEdgesMap.values()):this.graph.getAllEdges().filter(this.edgeFilter)}bfs(e,t,s="out"){let d={in:this.getPredecessors.bind(this),out:this.getSuccessors.bind(this),both:this.getNeighbors.bind(this)}[s];c([this.getNode(e)],new Set,t,d)}dfs(e,t,s="out"){let d={in:this.getPredecessors.bind(this),out:this.getSuccessors.bind(this),both:this.getNeighbors.bind(this)}[s];n(this.getNode(e),new Set,t,d)}};var E=class h extends N{nodeMap=new Map;edgeMap=new Map;inEdgesMap=new Map;outEdgesMap=new Map;bothEdgesMap=new Map;treeIndices=new Map;changes=[];batchCount=0;onChanged=()=>{};constructor(e){super(),e&&(e.nodes&&this.addNodes(e.nodes),e.edges&&this.addEdges(e.edges),e.tree&&this.addTree(e.tree),e.onChanged&&(this.onChanged=e.onChanged))}batch=e=>{this.batchCount+=1,e(),this.batchCount-=1,this.batchCount||this.commit()};commit(){let e=this.changes;this.changes=[];let t={graph:this,changes:e};this.emit("changed",t),this.onChanged(t)}reduceChanges(e){let t=[];return e.forEach(s=>{switch(s.type){case"NodeRemoved":{let d=!1;t=t.filter(r=>{if(r.type==="NodeAdded"){let a=r.value.id===s.value.id;return a&&(d=!0),!a}else{if(r.type==="NodeDataUpdated")return r.id!==s.value.id;if(r.type==="TreeStructureChanged")return r.nodeId!==s.value.id}return!0}),d||t.push(s);break}case"EdgeRemoved":{let d=!1;t=t.filter(r=>{if(r.type==="EdgeAdded"){let a=r.value.id===s.value.id;return a&&(d=!0),!a}else if(r.type==="EdgeDataUpdated"||r.type==="EdgeUpdated")return r.id!==s.value.id;return!0}),d||t.push(s);break}case"NodeDataUpdated":case"EdgeDataUpdated":case"EdgeUpdated":{let d=t.findIndex(a=>a.type===s.type&&a.id===s.id&&(s.propertyName===void 0||a.propertyName===s.propertyName)),r=t[d];r?s.propertyName!==void 0?r.newValue=s.newValue:(t.splice(d,1),t.push(s)):t.push(s);break}case"TreeStructureDetached":{t=t.filter(d=>d.type==="TreeStructureAttached"||d.type==="TreeStructureChanged"?d.treeKey!==s.treeKey:!0),t.push(s);break}case"TreeStructureChanged":{let d=t.find(r=>r.type==="TreeStructureChanged"&&r.treeKey===s.treeKey&&r.nodeId===s.nodeId);d?d.newParentId=s.newParentId:t.push(s);break}default:t.push(s);break}}),t}checkNodeExistence(e){this.getNode(e)}hasNode(e){return this.nodeMap.has(e)}areNeighbors(e,t){return this.getNeighbors(t).some(s=>s.id===e)}getNode(e){let t=this.nodeMap.get(e);if(!t)throw new Error("Node not found for id: "+e);return t}getRelatedEdges(e,t){if(this.checkNodeExistence(e),t==="in"){let s=this.inEdgesMap.get(e);return Array.from(s)}else if(t==="out"){let s=this.outEdgesMap.get(e);return Array.from(s)}else{let s=this.bothEdgesMap.get(e);return Array.from(s)}}getDegree(e,t){return this.getRelatedEdges(e,t).length}getSuccessors(e){let s=this.getRelatedEdges(e,"out").map(d=>this.getNode(d.target));return Array.from(new Set(s))}getPredecessors(e){let s=this.getRelatedEdges(e,"in").map(d=>this.getNode(d.source));return Array.from(new Set(s))}getNeighbors(e){let t=this.getPredecessors(e),s=this.getSuccessors(e);return Array.from(new Set([...t,...s]))}doAddNode(e){if(this.hasNode(e.id))throw new Error("Node already exists: "+e.id);this.nodeMap.set(e.id,e),this.inEdgesMap.set(e.id,new Set),this.outEdgesMap.set(e.id,new Set),this.bothEdgesMap.set(e.id,new Set),this.treeIndices.forEach(t=>{t.childrenMap.set(e.id,new Set)}),this.changes.push({type:"NodeAdded",value:e})}addNodes(e){this.batch(()=>{for(let t of e)this.doAddNode(t)})}addNode(e){this.addNodes([e])}doRemoveNode(e){let t=this.getNode(e);this.bothEdgesMap.get(e)?.forEach(d=>this.doRemoveEdge(d.id)),this.nodeMap.delete(e),this.treeIndices.forEach(d=>{d.childrenMap.get(e)?.forEach(a=>{d.parentMap.delete(a.id)});let r=d.parentMap.get(e);r&&d.childrenMap.get(r.id)?.delete(t),d.parentMap.delete(e),d.childrenMap.delete(e)}),this.bothEdgesMap.delete(e),this.inEdgesMap.delete(e),this.outEdgesMap.delete(e),this.changes.push({type:"NodeRemoved",value:t})}removeNodes(e){this.batch(()=>{e.forEach(t=>this.doRemoveNode(t))})}removeNode(e){this.removeNodes([e])}updateNodeDataProperty(e,t,s){let d=this.getNode(e);this.batch(()=>{let r=d.data[t],a=s;d.data[t]=a,this.changes.push({type:"NodeDataUpdated",id:e,propertyName:t,oldValue:r,newValue:a})})}mergeNodeData(e,t){this.batch(()=>{Object.entries(t).forEach(([s,d])=>{this.updateNodeDataProperty(e,s,d)})})}updateNodeData(...e){let t=e[0],s=this.getNode(t);if(typeof e[1]=="string"){this.updateNodeDataProperty(t,e[1],e[2]);return}let d;if(typeof e[1]=="function"){let r=e[1];d=r(s.data)}else typeof e[1]=="object"&&(d=e[1]);this.batch(()=>{let r=s.data,a=d;s.data=d,this.changes.push({type:"NodeDataUpdated",id:t,oldValue:r,newValue:a})})}checkEdgeExistence(e){if(!this.hasEdge(e))throw new Error("Edge not found for id: "+e)}hasEdge(e){return this.edgeMap.has(e)}getEdge(e){return this.checkEdgeExistence(e),this.edgeMap.get(e)}getEdgeDetail(e){let t=this.getEdge(e);return{edge:t,source:this.getNode(t.source),target:this.getNode(t.target)}}doAddEdge(e){if(this.hasEdge(e.id))throw new Error("Edge already exists: "+e.id);this.checkNodeExistence(e.source),this.checkNodeExistence(e.target),this.edgeMap.set(e.id,e);let t=this.inEdgesMap.get(e.target),s=this.outEdgesMap.get(e.source),d=this.bothEdgesMap.get(e.source),r=this.bothEdgesMap.get(e.target);t.add(e),s.add(e),d.add(e),r.add(e),this.changes.push({type:"EdgeAdded",value:e})}addEdges(e){this.batch(()=>{for(let t of e)this.doAddEdge(t)})}addEdge(e){this.addEdges([e])}doRemoveEdge(e){let t=this.getEdge(e),s=this.outEdgesMap.get(t.source),d=this.inEdgesMap.get(t.target),r=this.bothEdgesMap.get(t.source),a=this.bothEdgesMap.get(t.target);s.delete(t),d.delete(t),r.delete(t),a.delete(t),this.edgeMap.delete(e),this.changes.push({type:"EdgeRemoved",value:t})}removeEdges(e){this.batch(()=>{e.forEach(t=>this.doRemoveEdge(t))})}removeEdge(e){this.removeEdges([e])}updateEdgeSource(e,t){let s=this.getEdge(e);this.checkNodeExistence(t);let d=s.source,r=t;this.outEdgesMap.get(d).delete(s),this.bothEdgesMap.get(d).delete(s),this.outEdgesMap.get(r).add(s),this.bothEdgesMap.get(r).add(s),s.source=t,this.batch(()=>{this.changes.push({type:"EdgeUpdated",id:e,propertyName:"source",oldValue:d,newValue:r})})}updateEdgeTarget(e,t){let s=this.getEdge(e);this.checkNodeExistence(t);let d=s.target,r=t;this.inEdgesMap.get(d).delete(s),this.bothEdgesMap.get(d).delete(s),this.inEdgesMap.get(r).add(s),this.bothEdgesMap.get(r).add(s),s.target=t,this.batch(()=>{this.changes.push({type:"EdgeUpdated",id:e,propertyName:"target",oldValue:d,newValue:r})})}updateEdgeDataProperty(e,t,s){let d=this.getEdge(e);this.batch(()=>{let r=d.data[t],a=s;d.data[t]=a,this.changes.push({type:"EdgeDataUpdated",id:e,propertyName:t,oldValue:r,newValue:a})})}updateEdgeData(...e){let t=e[0],s=this.getEdge(t);if(typeof e[1]=="string"){this.updateEdgeDataProperty(t,e[1],e[2]);return}let d;if(typeof e[1]=="function"){let r=e[1];d=r(s.data)}else typeof e[1]=="object"&&(d=e[1]);this.batch(()=>{let r=s.data,a=d;s.data=d,this.changes.push({type:"EdgeDataUpdated",id:t,oldValue:r,newValue:a})})}mergeEdgeData(e,t){this.batch(()=>{Object.entries(t).forEach(([s,d])=>{this.updateEdgeDataProperty(e,s,d)})})}checkTreeExistence(e){if(!this.hasTreeStructure(e))throw new Error("Tree structure not found for treeKey: "+e)}hasTreeStructure(e){return this.treeIndices.has(e)}attachTreeStructure(e){this.treeIndices.has(e)||(this.treeIndices.set(e,{parentMap:new Map,childrenMap:new Map}),this.batch(()=>{this.changes.push({type:"TreeStructureAttached",treeKey:e})}))}detachTreeStructure(e){this.checkTreeExistence(e),this.treeIndices.delete(e),this.batch(()=>{this.changes.push({type:"TreeStructureDetached",treeKey:e})})}addTree(e,t){this.batch(()=>{this.attachTreeStructure(t);let s=[],d=Array.isArray(e)?e:[e];for(;d.length;){let r=d.shift();s.push(r),r.children&&d.push(...r.children)}this.addNodes(s),s.forEach(r=>{r.children?.forEach(a=>{this.setParent(a.id,r.id,t)})})})}getRoots(e){return this.checkTreeExistence(e),this.getAllNodes().filter(t=>!this.getParent(t.id,e))}getChildren(e,t){this.checkNodeExistence(e),this.checkTreeExistence(t);let d=this.treeIndices.get(t).childrenMap.get(e);return Array.from(d||[])}getParent(e,t){return this.checkNodeExistence(e),this.checkTreeExistence(t),this.treeIndices.get(t).parentMap.get(e)||null}getAncestors(e,t){let s=[],d=this.getNode(e),r;for(;r=this.getParent(d.id,t);)s.push(r),d=r;return s}setParent(e,t,s){this.checkTreeExistence(s);let d=this.treeIndices.get(s);if(!d)return;let r=this.getNode(e),a=d.parentMap.get(e);if(a?.id===t)return;if(t==null){a&&d.childrenMap.get(a.id)?.delete(r),d.parentMap.delete(e);return}let i=this.getNode(t);d.parentMap.set(e,i),a&&d.childrenMap.get(a.id)?.delete(r);let o=d.childrenMap.get(i.id);o||(o=new Set,d.childrenMap.set(i.id,o)),o.add(r),this.batch(()=>{this.changes.push({type:"TreeStructureChanged",treeKey:s,nodeId:e,oldParentId:a?.id,newParentId:i.id})})}dfsTree(e,t,s){let d=r=>this.getChildren(r,s);return n(this.getNode(e),new Set,t,d)}bfsTree(e,t,s){let d=r=>this.getChildren(r,s);return c([this.getNode(e)],new Set,t,d)}getAllNodes(){return Array.from(this.nodeMap.values())}getAllEdges(){return Array.from(this.edgeMap.values())}bfs(e,t,s="out"){let d={in:this.getPredecessors.bind(this),out:this.getSuccessors.bind(this),both:this.getNeighbors.bind(this)}[s];return c([this.getNode(e)],new Set,t,d)}dfs(e,t,s="out"){let d={in:this.getPredecessors.bind(this),out:this.getSuccessors.bind(this),both:this.getNeighbors.bind(this)}[s];return n(this.getNode(e),new Set,t,d)}clone(){let e=this.getAllNodes().map(d=>({...d,data:{...d.data}})),t=this.getAllEdges().map(d=>({...d,data:{...d.data}})),s=new h({nodes:e,edges:t});return this.treeIndices.forEach(({parentMap:d,childrenMap:r},a)=>{let i=new Map;d.forEach((u,l)=>{i.set(l,s.getNode(u.id))});let o=new Map;r.forEach((u,l)=>{o.set(l,new Set(Array.from(u).map(f=>s.getNode(f.id))))}),s.treeIndices.set(a,{parentMap:i,childrenMap:o})}),s}toJSON(){return JSON.stringify({nodes:this.getAllNodes(),edges:this.getAllEdges()})}createView(e){return new g({graph:this,...e})}};export{E as Graph,g as GraphView};
-//# sourceMappingURL=graphlib.mjs.map

package/@antv/hierarchy@0.7.1/es2022/hierarchy.mjs

@@ -1,3 +0,0 @@
-/* esm.sh - @antv/hierarchy@0.7.1 */
-function A(n,t,i,e="height"){let l=n[e],r=t[e];return i==="center"?(l+r)/2:n.height}var M=Object.assign,$={getId:n=>n.id||n.name,getPreH:n=>n.preH||0,getPreV:n=>n.preV||0,getHGap:n=>n.hgap||18,getVGap:n=>n.vgap||18,getChildren:n=>n.children,getHeight:n=>n.height||36,getWidth(n){let t=n.label||" ";return n.width||18*t.split("").length}},L=class n{constructor(t,i){if(this.x=0,this.y=0,this.depth=0,this.children=[],this.hgap=0,this.vgap=0,t instanceof n||"x"in t&&"y"in t&&"children"in t){let r=t;return this.data=r.data,this.id=r.id,this.x=r.x,this.y=r.y,this.width=r.width,this.height=r.height,this.depth=r.depth,this.children=r.children,this.parent=r.parent,this.hgap=r.hgap,this.vgap=r.vgap,this.preH=r.preH,void(this.preV=r.preV)}this.data=t;let e=i.getHGap(t),l=i.getVGap(t);this.preH=i.getPreH(t),this.preV=i.getPreV(t),this.width=i.getWidth(t),this.height=i.getHeight(t),this.width+=this.preH,this.height+=this.preV,this.id=i.getId(t),this.addGap(e,l)}isRoot(){return this.depth===0}isLeaf(){return this.children.length===0}addGap(t,i){this.hgap+=t,this.vgap+=i,this.width+=2*t,this.height+=2*i}eachNode(t){let i,e=[this];for(;i=e.shift();)t(i),e=i.children.concat(e)}DFTraverse(t){this.eachNode(t)}BFTraverse(t){let i,e=[this];for(;i=e.shift();)t(i),e=e.concat(i.children)}getBoundingBox(){let t={left:Number.MAX_VALUE,top:Number.MAX_VALUE,width:0,height:0};return this.eachNode(i=>{t.left=Math.min(t.left,i.x),t.top=Math.min(t.top,i.y),t.width=Math.max(t.width,i.x+i.width),t.height=Math.max(t.height,i.y+i.height)}),t}translate(t=0,i=0){this.eachNode(e=>{e.x+=t,e.y+=i,e.x+=e.preH,e.y+=e.preV})}right2left(){let t=this.getBoundingBox();this.eachNode(i=>{i.x=i.x-2*(i.x-t.left)-i.width}),this.translate(t.width,0)}bottom2top(){let t=this.getBoundingBox();this.eachNode(i=>{i.y=i.y-2*(i.y-t.top)-i.height}),this.translate(0,t.height)}};function z(n,t={},i){t=M({},$,t);let e=new L(n,t),l=[e],r;if(!i&&!n.collapsed){for(;r=l.shift();)if(!r.data.collapsed){let s=t.getChildren(r.data),h=s?s.length:0;if(r.children=new Array(h),s&&h)for(let d=0;d<h;d++){let p=new L(s[d],t);r.children[d]=p,l.push(p),p.parent=r,p.depth=r.depth+1}}}return e}var E=class{constructor(t,i={}){this.options=i,this.rootNode=z(t,i)}execute(){throw new Error("please override this method")}},j=class B{constructor(t=0,i=0,e=0,l=[]){this.x=0,this.prelim=0,this.mod=0,this.shift=0,this.change=0,this.tl=null,this.tr=null,this.el=null,this.er=null,this.msel=0,this.mser=0,this.w=t||0,this.h=i||0,this.y=e||0,this.c=l||[],this.cs=l.length}static fromNode(t,i){if(!t)return null;let e=[];return t.children.forEach(l=>{let r=B.fromNode(l,i);r&&e.push(r)}),i?new B(t.height,t.width,t.x,e):new B(t.width,t.height,t.y,e)}};function F(n,t,i){i?n.y+=t:n.x+=t,n.children.forEach(e=>{F(e,t,i)})}function O(n,t){let i=t?n.y:n.x;return n.children.forEach(e=>{i=Math.min(O(e,t),i)}),i}function q(n,t){F(n,-O(n,t),t)}function P(n,t,i){i?t.y=n.x:t.x=n.x,n.c.forEach((e,l)=>{P(e,t.children[l],i)})}function k(n,t,i=0){t?(n.x=i,i+=n.width):(n.y=i,i+=n.height),n.children.forEach(e=>{k(e,t,i)})}function J(n,t={}){let i=t.isHorizontal;function e(o){o.cs===0?(o.el=o,o.er=o,o.msel=o.mser=0):(o.el=o.c[0].el,o.msel=o.c[0].msel,o.er=o.c[o.cs-1].er,o.mser=o.c[o.cs-1].mser)}function l(o,a,f){let c=o.c[a-1],m=c.mod,g=o.c[a],w=g.mod;for(;c!==null&&g!==null;){f&&d(c)>f.low&&(f=f.nxt);let u=m+c.prelim+c.w-(w+g.prelim);u>0&&(w+=u,f&&r(o,a,f.index,u));let y=d(c),H=d(g);y<=H&&(c=h(c),c!==null&&(m+=c.mod)),y>=H&&(g=s(g),g!==null&&(w+=g.mod))}!c&&g?(function(u,y,H,V){let v=u.c[0].el;v.tl=H;let T=V-H.mod-u.c[0].msel;v.mod+=T,v.prelim-=T,u.c[0].el=u.c[y].el,u.c[0].msel=u.c[y].msel})(o,a,g,w):c&&!g&&(function(u,y,H,V){let v=u.c[y].er;v.tr=H;let T=V-H.mod-u.c[y].mser;v.mod+=T,v.prelim-=T,u.c[y].er=u.c[y-1].er,u.c[y].mser=u.c[y-1].mser})(o,a,c,m)}function r(o,a,f,c){o.c[a].mod+=c,o.c[a].msel+=c,o.c[a].mser+=c,(function(m,g,w,u){if(w!==g-1){let y=g-w;m.c[w+1].shift+=u/y,m.c[g].shift-=u/y,m.c[g].change-=u-u/y}})(o,a,f,c)}function s(o){return o.cs===0?o.tl:o.c[0]}function h(o){return o.cs===0?o.tr:o.c[o.cs-1]}function d(o){return o.y+o.h}function p(o,a,f){for(;f!==null&&o>=f.low;)f=f.nxt;return{low:o,index:a,nxt:f}}k(n,i);let x=j.fromNode(n,i);return x&&((function o(a){if(a.cs===0)return void e(a);o(a.c[0]);let f=p(d(a.c[0].el),0,null);for(let c=1;c<a.cs;++c){o(a.c[c]);let m=d(a.c[c].er);l(a,c,f),f=p(m,c,f)}(function(c){c.prelim=(c.c[0].prelim+c.c[0].mod+c.c[c.cs-1].mod+c.c[c.cs-1].prelim+c.c[c.cs-1].w)/2-c.w/2})(a),e(a)})(x),(function o(a,f){f+=a.mod,a.x=a.prelim+f,(function(c){let m=0,g=0;for(let w=0;w<c.cs;w++)m+=c.c[w].shift,g+=m+c.c[w].change,c.c[w].mod+=g})(a);for(let c=0;c<a.cs;c++)o(a.c[c],f)})(x,0),P(x,n,i),q(n,i)),n}function U(n,t){let i=z(n.data,t,!0),e=z(n.data,t,!0),l=n.children.length,r=Math.round(l/2),s=t.getSide||function(h,d){return d<r?"right":"left"};for(let h=0;h<l;h++){let d=n.children[h];s(d,h)==="right"?e.children.push(d):i.children.push(d)}return i.eachNode(h=>{h.isRoot()||(h.side="left")}),e.eachNode(h=>{h.isRoot()||(h.side="right")}),{left:i,right:e}}var N=["LR","RL","TB","BT","H","V"],K=["LR","RL","H"],Q=N[0];function I(n,t,i){let e=t.direction||Q;if(t.isHorizontal=(r=>K.indexOf(r)>-1)(e),e&&N.indexOf(e)===-1)throw new TypeError(`Invalid direction: ${e}`);if(e===N[0])i(n,t);else if(e===N[1])i(n,t),n.right2left();else if(e===N[2])i(n,t);else if(e===N[3])i(n,t),n.bottom2top();else if(e===N[4]||e===N[5]){let{left:r,right:s}=U(n,t);i(r,t),i(s,t),t.isHorizontal?r.right2left():r.bottom2top(),s.translate(r.x-s.x,r.y-s.y),n.x=r.x,n.y=s.y;let h=n.getBoundingBox();t.isHorizontal?h.top<0&&n.translate(0,-h.top):h.left<0&&n.translate(-h.left,0)}let l=t.fixedRoot;return l===void 0&&(l=!0),l&&n.translate(-(n.x+n.width/2+n.hgap),-(n.y+n.height/2+n.vgap)),(function(r,s){if(s.radial){let[h,d]=s.isHorizontal?["x","y"]:["y","x"],p={x:1/0,y:1/0},x={x:-1/0,y:-1/0},o=0;r.DFTraverse(c=>{o++;let{x:m,y:g}=c;p.x=Math.min(p.x,m),p.y=Math.min(p.y,g),x.x=Math.max(x.x,m),x.y=Math.max(x.y,g)});let a=x[d]-p[d];if(a===0)return;let f=2*Math.PI/o;r.DFTraverse(c=>{let m=c[d],g=p[d],w=c[h],u=r[h],y=(m-g)/a*(2*Math.PI-f)+f,H=w-u;c.x=Math.cos(y)*H,c.y=Math.sin(y)*H})}})(n,t),n}var C=class extends E{execute(){return I(this.rootNode,this.options,J)}},Z={};function tt(n,t){let i=M({},Z,t);return new C(n,i).execute()}var R=class{constructor(t=0,i=[]){this.x=0,this.y=0,this.leftChild=null,this.rightChild=null,this.isLeaf=!1,this.height=t,this.children=i}},nt={isHorizontal:!0,nodeSep:20,nodeSize:20,rankSep:200,subTreeSep:10};function W(n,t,i){i?(t.x=n.x,t.y=n.y):(t.x=n.y,t.y=n.x),n.children.forEach((e,l)=>{W(e,t.children[l],i)})}function it(n,t={}){let i=M({},nt,t),e=0,l=null,r=(function s(h){h.width=0,h.depth&&h.depth>e&&(e=h.depth);let d=h.children,p=d.length,x=new R(0,[]);return d.forEach((o,a)=>{let f=s(o);x.children.push(f),a===0&&(x.leftChild=f),a===p-1&&(x.rightChild=f)}),x.originNode=h,x.isLeaf=h.isLeaf(),x})(n);return(function s(h){if(h.isLeaf||h.children.length===0)h.drawingDepth=e;else{let d=h.children.map(x=>s(x)),p=Math.min(...d);h.drawingDepth=p-1}return h.drawingDepth})(r),(function s(h){h.x=h.drawingDepth*i.rankSep,h.isLeaf?(h.y=0,l&&(h.y=l.y+l.height+i.nodeSep,h.originNode.parent!==l.originNode.parent&&(h.y+=i.subTreeSep)),l=h):(h.children.forEach(d=>{s(d)}),h.y=(h.leftChild.y+h.rightChild.y)/2)})(r),W(r,n,i.isHorizontal),n}var D=class extends E{execute(){return this.rootNode.width=0,I(this.rootNode,this.options,it)}},et={};function ht(n,t){let i=M({},et,t);return new D(n,i).execute()}function b(n,t,i,e){let l=null;n.eachNode(r=>{(function(s,h,d,p,x){let o=(typeof d=="function"?d(s):d)*s.depth;if(!p)try{if(s.parent&&s.id===s.parent.children[0].id)return s.x+=o,void(s.y=h?h.y:0)}catch{}if(s.x+=o,h){if(s.y=h.y+A(h,s,x),h.parent&&s.parent&&s.parent.id!==h.parent.id){let a=h.parent,f=a.y+A(a,s,x);s.y=f>s.y?f:s.y}}else s.y=0})(r,l,t,i,e),l=r})}var S=["LR","RL","H"],rt=S[0],Y=class extends E{execute(){let t=this.options,i=this.rootNode;t.isHorizontal=!0;let{indent:e=20,dropCap:l=!0,direction:r=rt,align:s}=t;if(r&&S.indexOf(r)===-1)throw new TypeError(`Invalid direction: ${r}`);if(r===S[0])b(i,e,l,s);else if(r===S[1])b(i,e,l,s),i.right2left();else if(r===S[2]){let{left:h,right:d}=U(i,t);b(h,e,l,s),h.right2left(),b(d,e,l,s);let p=h.getBoundingBox();d.translate(p.width,0),i.x=d.x-i.width/2}return i}},ot={};function st(n,t){let i=M({},ot,t);return new Y(n,i).execute()}function X(n,t){let i=0;return n.children.length?n.children.forEach(e=>{i+=X(e,t)}):i=n.height,n._subTreeSep=t.getSubTreeSep(n.data),n.totalHeight=Math.max(n.height,i)+2*n._subTreeSep,n.totalHeight}function _(n){let t=n.children,i=t.length;if(i){t.forEach(h=>{_(h)});let e=t[0],l=t[i-1],r=l.y-e.y+l.height,s=0;if(t.forEach(h=>{s+=h.totalHeight}),r>n.height)n.y=e.y+r/2-n.height/2;else if(t.length!==1||n.height>s){let h=n.y+(n.height-r)/2-e.y;t.forEach(d=>{d.translate(0,h)})}else n.y=(e.y+e.height/2+l.y+l.height/2)/2-n.height/2}}var ct={getSubTreeSep:()=>0};function lt(n,t={}){return t=M({},ct,t),n.parent={x:0,width:0,height:0,y:0},n.BFTraverse(i=>{i.x=i.parent.x+i.parent.width}),n.parent=void 0,X(n,t),n.startY=0,n.y=n.totalHeight/2-n.height/2,n.eachNode(i=>{let e=i.children,l=e.length;if(l){let r=e[0];if(r.startY=i.startY+i._subTreeSep,l===1)r.y=i.y+i.height/2-r.height/2;else{r.y=r.startY+r.totalHeight/2-r.height/2;for(let s=1;s<l;s++){let h=e[s];h.startY=e[s-1].startY+e[s-1].totalHeight,h.y=h.startY+h.totalHeight/2-h.height/2}}}}),_(n),n}var G=class extends E{execute(){return I(this.rootNode,this.options,lt)}},at={};function dt(n,t){let i=M({},at,t);return new G(n,i).execute()}var ft={compactBox:tt,dendrogram:ht,indented:st,mindmap:dt},gt="0.7.0";export{tt as compactBox,ft as default,ht as dendrogram,st as indented,dt as mindmap,gt as version};
-//# sourceMappingURL=hierarchy.mjs.map