netstar-ai-chat 1.0.0

package/dist/chunk-RYQCIY6F-Budeukwp.cjs

@@ -0,0 +1 @@
+const e=require("./_baseClone-D3YkUt7B.cjs"),t=require("./graphlib-B0pkl27u.cjs"),n=require("./map-CnWYCApZ.cjs"),r=require("./chunk-Y2CYZVJY-CnmLqFtv.cjs"),i=require("./src-CR--T_NF.cjs");var a=4;function o(t){return e.t(t,a)}function s(e){var n={options:{directed:e.isDirected(),multigraph:e.isMultigraph(),compound:e.isCompound()},nodes:c(e),edges:l(e)};return t.r(e.graph())||(n.value=o(e.graph())),n}function c(e){return n.t(e.nodes(),function(n){var r=e.node(n),i=e.parent(n),a={v:n};return t.r(r)||(a.value=r),t.r(i)||(a.parent=i),a})}function l(e){return n.t(e.edges(),function(n){var r=e.edge(n),i={v:n.v,w:n.w};return t.r(n.name)||(i.name=n.name),t.r(r)||(i.value=r),i})}var u=new Map,d=new Map,f=new Map,p=r.n(()=>{d.clear(),f.clear(),u.clear()},`clear`),m=r.n((e,t)=>{let n=d.get(t)||[];return i.m.trace(`In isDescendant`,t,` `,e,` = `,n.includes(e)),n.includes(e)},`isDescendant`),h=r.n((e,t)=>{let n=d.get(t)||[];return i.m.info(`Descendants of `,t,` is `,n),i.m.info(`Edge is `,e),e.v===t||e.w===t?!1:n?n.includes(e.v)||m(e.v,t)||m(e.w,t)||n.includes(e.w):(i.m.debug(`Tilt, `,t,`,not in descendants`),!1)},`edgeInCluster`),g=r.n((e,t,n,r)=>{i.m.warn(`Copying children of `,e,`root`,r,`data`,t.node(e),r);let a=t.children(e)||[];e!==r&&a.push(e),i.m.warn(`Copying (nodes) clusterId`,e,`nodes`,a),a.forEach(a=>{if(t.children(a).length>0)g(a,t,n,r);else{let o=t.node(a);i.m.info(`cp `,a,` to `,r,` with parent `,e),n.setNode(a,o),r!==t.parent(a)&&(i.m.warn(`Setting parent`,a,t.parent(a)),n.setParent(a,t.parent(a))),e!==r&&a!==e?(i.m.debug(`Setting parent`,a,e),n.setParent(a,e)):(i.m.info(`In copy `,e,`root`,r,`data`,t.node(e),r),i.m.debug(`Not Setting parent for node=`,a,`cluster!==rootId`,e!==r,`node!==clusterId`,a!==e));let s=t.edges(a);i.m.debug(`Copying Edges`,s),s.forEach(a=>{i.m.info(`Edge`,a);let o=t.edge(a.v,a.w,a.name);i.m.info(`Edge data`,o,r);try{if(h(a,r)){let e=d.get(r)||[],s=e.includes(a.v)||m(a.v,r)||a.v===r,c=e.includes(a.w)||m(a.w,r)||a.w===r;if(s&&c)i.m.info(`Copying as `,a.v,a.w,o,a.name),n.setEdge(a.v,a.w,o,a.name),i.m.info(`newGraph edges `,n.edges(),n.edge(n.edges()[0]));else{let e=s?r:a.v,n=c?r:a.w;i.m.info(`Rebinding cross-boundary edge as `,e,n,o,a.name),t.setEdge(e,n,o,a.name)}}else i.m.info(`Skipping copy of edge `,a.v,`-->`,a.w,` rootId: `,r,` clusterId:`,e)}catch(e){i.m.error(e)}})}i.m.debug(`Removing node`,a),t.removeNode(a)})},`copy`),_=r.n((e,t)=>{let n=t.children(e),r=[...n];for(let i of n)f.set(i,e),r=[...r,..._(i,t)];return r},`extractDescendants`),v=r.n((e,t,n)=>{let r=e.edges().filter(e=>e.v===t||e.w===t),i=e.edges().filter(e=>e.v===n||e.w===n),a=r.map(e=>({v:e.v===t?n:e.v,w:e.w===t?t:e.w})),o=i.map(e=>({v:e.v,w:e.w}));return a.filter(e=>o.some(t=>e.v===t.v&&e.w===t.w))},`findCommonEdges`),y=r.n((e,t,n)=>{let r=t.children(e);if(i.m.trace(`Searching children of id `,e,r),r.length<1)return e;let a;for(let e of r){let r=y(e,t,n),i=v(t,n,r);if(r)if(i.length>0)a=r;else return r}return a},`findNonClusterChild`),b=r.n(e=>!u.has(e)||!u.get(e).externalConnections?e:u.has(e)?u.get(e).id:e,`getAnchorId`),x=r.n((e,t)=>{if(!e||t>10){i.m.debug(`Opting out, no graph `);return}else i.m.debug(`Opting in, graph `);e.nodes().forEach(function(t){e.children(t).length>0&&(i.m.warn(`Cluster identified`,t,` Replacement id in edges: `,y(t,e,t)),d.set(t,_(t,e)),u.set(t,{id:y(t,e,t),clusterData:e.node(t)}))}),e.nodes().forEach(function(t){let n=e.children(t),r=e.edges();n.length>0?(i.m.debug(`Cluster identified`,t,d),r.forEach(e=>{m(e.v,t)^m(e.w,t)&&(i.m.warn(`Edge: `,e,` leaves cluster `,t),i.m.warn(`Descendants of XXX `,t,`: `,d.get(t)),u.get(t).externalConnections=!0)})):i.m.debug(`Not a cluster `,t,d)});for(let t of u.keys()){let n=u.get(t).id,r=e.parent(n);r!==t&&u.has(r)&&!u.get(r).externalConnections&&(u.get(t).id=r);let i=e.edges().some(e=>e.v===t);if(n&&u.get(t)?.externalConnections&&i&&T(e,n,t)){let r=E(e,t,e.parent(n));r&&(u.get(t).id=r)}}e.edges().forEach(function(t){let n=e.edge(t);i.m.warn(`Edge `+t.v+` -> `+t.w+`: `+JSON.stringify(t)),i.m.warn(`Edge `+t.v+` -> `+t.w+`: `+JSON.stringify(e.edge(t)));let r=t.v,a=t.w;if(i.m.warn(`Fix XXX`,u,`ids:`,t.v,t.w,`Translating: `,u.get(t.v),` --- `,u.get(t.w)),u.get(t.v)||u.get(t.w)){if(i.m.warn(`Fixing and trying - removing XXX`,t.v,t.w,t.name),r=b(t.v),a=b(t.w),e.removeEdge(t.v,t.w,t.name),r!==t.v){let i=e.parent(r);u.get(i).externalConnections=!0,n.fromCluster=t.v}if(a!==t.w){let r=e.parent(a);u.get(r).externalConnections=!0,n.toCluster=t.w}i.m.warn(`Fix Replacing with XXX`,r,a,t.name),e.setEdge(r,a,n,t.name)}}),i.m.warn(`Adjusted Graph`,s(e)),S(e,0),i.m.trace(u)},`adjustClustersAndEdges`),S=r.n((e,n)=>{if(i.m.warn(`extractor - `,n,s(e),e.children(`D`)),n>10){i.m.error(`Bailing out`);return}let r=e.nodes(),a=!1;for(let t of r){let n=e.children(t);a||=n.length>0}if(!a){i.m.debug(`Done, no node has children`,e.nodes());return}i.m.debug(`Nodes = `,r,n);for(let a of r)if(i.m.debug(`Extracting node`,a,u,u.has(a)&&!u.get(a).externalConnections,!e.parent(a),e.node(a),e.children(`D`),` Depth `,n),!u.has(a))i.m.debug(`Not a cluster`,a,n);else if(u.get(a)?.clusterData?.explicitDir&&e.children(a)&&e.children(a).length>0){i.m.warn(`Cluster with explicit dir, creating subgraph for children`,a,n);let r=u.get(a).clusterData.dir,o=new t.t({multigraph:!0,compound:!0}).setGraph({rankdir:r,nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}});g(a,e,o,a);let c=e.node(a)||{};e.setNode(a,{...c,clusterNode:!0,id:a,clusterData:u.get(a).clusterData,label:u.get(a).label,graph:o}),i.m.warn(`Subgraph for cluster with explicit dir created:`,a,s(o))}else if(!u.get(a).externalConnections&&e.children(a)&&e.children(a).length>0){i.m.warn(`Cluster without external connections, without a parent and with children`,a,n);let r=e.graph().rankdir===`TB`?`LR`:`TB`;u.get(a)?.clusterData?.dir&&(r=u.get(a).clusterData.dir,i.m.warn(`Fixing dir`,u.get(a).clusterData.dir,r));let o=new t.t({multigraph:!0,compound:!0}).setGraph({rankdir:r,nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}});g(a,e,o,a);let c=e.node(a)||{};e.setNode(a,{...c,clusterNode:!0,id:a,clusterData:u.get(a).clusterData,label:u.get(a).label,graph:o}),i.m.debug(`Old graph after copy`,s(e))}else i.m.warn(`Cluster ** `,a,` **not meeting the criteria !externalConnections:`,!u.get(a).externalConnections,` no parent: `,!e.parent(a),` children `,e.children(a)&&e.children(a).length>0,e.children(`D`),n),i.m.debug(u);r=e.nodes(),i.m.warn(`New list of nodes`,r);for(let t of r){let r=e.node(t);i.m.warn(` Now next level`,t,r),r?.clusterNode&&S(r.graph,n+1)}},`extractor`),C=r.n((e,t)=>{if(t.length===0)return[];let n=Object.assign([],t);return t.forEach(t=>{let r=C(e,e.children(t));n=[...n,...r]}),n},`sorter`),w=r.n(e=>C(e,e.children()),`sortNodesByHierarchy`),T=r.n((e,t,n)=>{let r=e.parent(t);for(;r&&r!==n;){let t=u.get(r);if(t&&!t.externalConnections)return!0;r=e.parent(r)}return!1},`isNodeInExtractableCluster`),E=r.n((e,t,n)=>{let r=e.children(t)??[];for(let i of r){if(i===n||m(i,n))continue;let r=y(i,e,t);if(r&&!T(e,r,t))return r}return null},`findSafeAnchorNode`);Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return w}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return y}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return x}});

package/dist/chunk-RYQCIY6F-CTIaeOkt.js

@@ -0,0 +1,240 @@
+import { t as e } from "./_baseClone-M9Eo-ngy.js";
+import { r as t, t as n } from "./graphlib-DjREGp7-.js";
+import { t as r } from "./map-DmTyBWxT.js";
+import { n as i } from "./chunk-Y2CYZVJY-QdJ4V9rh.js";
+import { m as a } from "./src-DR6txdQ-.js";
+//#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/clone.js
+var o = 4;
+function s(t) {
+	return e(t, o);
+}
+//#endregion
+//#region ../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/json.js
+function c(e) {
+	var n = {
+		options: {
+			directed: e.isDirected(),
+			multigraph: e.isMultigraph(),
+			compound: e.isCompound()
+		},
+		nodes: l(e),
+		edges: u(e)
+	};
+	return t(e.graph()) || (n.value = s(e.graph())), n;
+}
+function l(e) {
+	return r(e.nodes(), function(n) {
+		var r = e.node(n), i = e.parent(n), a = { v: n };
+		return t(r) || (a.value = r), t(i) || (a.parent = i), a;
+	});
+}
+function u(e) {
+	return r(e.edges(), function(n) {
+		var r = e.edge(n), i = {
+			v: n.v,
+			w: n.w
+		};
+		return t(n.name) || (i.name = n.name), t(r) || (i.value = r), i;
+	});
+}
+//#endregion
+//#region ../../node_modules/.pnpm/mermaid@11.16.0/node_modules/mermaid/dist/chunks/mermaid.core/chunk-RYQCIY6F.mjs
+var d = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ i(() => {
+	f.clear(), p.clear(), d.clear();
+}, "clear"), h = /* @__PURE__ */ i((e, t) => {
+	let n = f.get(t) || [];
+	return a.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
+}, "isDescendant"), g = /* @__PURE__ */ i((e, t) => {
+	let n = f.get(t) || [];
+	return a.info("Descendants of ", t, " is ", n), a.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || h(e.v, t) || h(e.w, t) || n.includes(e.w) : (a.debug("Tilt, ", t, ",not in descendants"), !1);
+}, "edgeInCluster"), _ = /* @__PURE__ */ i((e, t, n, r) => {
+	a.warn("Copying children of ", e, "root", r, "data", t.node(e), r);
+	let i = t.children(e) || [];
+	e !== r && i.push(e), a.warn("Copying (nodes) clusterId", e, "nodes", i), i.forEach((i) => {
+		if (t.children(i).length > 0) _(i, t, n, r);
+		else {
+			let o = t.node(i);
+			a.info("cp ", i, " to ", r, " with parent ", e), n.setNode(i, o), r !== t.parent(i) && (a.warn("Setting parent", i, t.parent(i)), n.setParent(i, t.parent(i))), e !== r && i !== e ? (a.debug("Setting parent", i, e), n.setParent(i, e)) : (a.info("In copy ", e, "root", r, "data", t.node(e), r), a.debug("Not Setting parent for node=", i, "cluster!==rootId", e !== r, "node!==clusterId", i !== e));
+			let s = t.edges(i);
+			a.debug("Copying Edges", s), s.forEach((i) => {
+				a.info("Edge", i);
+				let o = t.edge(i.v, i.w, i.name);
+				a.info("Edge data", o, r);
+				try {
+					if (g(i, r)) {
+						let e = f.get(r) || [], s = e.includes(i.v) || h(i.v, r) || i.v === r, c = e.includes(i.w) || h(i.w, r) || i.w === r;
+						if (s && c) a.info("Copying as ", i.v, i.w, o, i.name), n.setEdge(i.v, i.w, o, i.name), a.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]));
+						else {
+							let e = s ? r : i.v, n = c ? r : i.w;
+							a.info("Rebinding cross-boundary edge as ", e, n, o, i.name), t.setEdge(e, n, o, i.name);
+						}
+					} else a.info("Skipping copy of edge ", i.v, "-->", i.w, " rootId: ", r, " clusterId:", e);
+				} catch (e) {
+					a.error(e);
+				}
+			});
+		}
+		a.debug("Removing node", i), t.removeNode(i);
+	});
+}, "copy"), v = /* @__PURE__ */ i((e, t) => {
+	let n = t.children(e), r = [...n];
+	for (let i of n) p.set(i, e), r = [...r, ...v(i, t)];
+	return r;
+}, "extractDescendants"), y = /* @__PURE__ */ i((e, t, n) => {
+	let r = e.edges().filter((e) => e.v === t || e.w === t), i = e.edges().filter((e) => e.v === n || e.w === n), a = r.map((e) => ({
+		v: e.v === t ? n : e.v,
+		w: e.w === t ? t : e.w
+	})), o = i.map((e) => ({
+		v: e.v,
+		w: e.w
+	}));
+	return a.filter((e) => o.some((t) => e.v === t.v && e.w === t.w));
+}, "findCommonEdges"), b = /* @__PURE__ */ i((e, t, n) => {
+	let r = t.children(e);
+	if (a.trace("Searching children of id ", e, r), r.length < 1) return e;
+	let i;
+	for (let e of r) {
+		let r = b(e, t, n), a = y(t, n, r);
+		if (r) if (a.length > 0) i = r;
+		else return r;
+	}
+	return i;
+}, "findNonClusterChild"), x = /* @__PURE__ */ i((e) => !d.has(e) || !d.get(e).externalConnections ? e : d.has(e) ? d.get(e).id : e, "getAnchorId"), S = /* @__PURE__ */ i((e, t) => {
+	if (!e || t > 10) {
+		a.debug("Opting out, no graph ");
+		return;
+	} else a.debug("Opting in, graph ");
+	e.nodes().forEach(function(t) {
+		e.children(t).length > 0 && (a.warn("Cluster identified", t, " Replacement id in edges: ", b(t, e, t)), f.set(t, v(t, e)), d.set(t, {
+			id: b(t, e, t),
+			clusterData: e.node(t)
+		}));
+	}), e.nodes().forEach(function(t) {
+		let n = e.children(t), r = e.edges();
+		n.length > 0 ? (a.debug("Cluster identified", t, f), r.forEach((e) => {
+			h(e.v, t) ^ h(e.w, t) && (a.warn("Edge: ", e, " leaves cluster ", t), a.warn("Descendants of XXX ", t, ": ", f.get(t)), d.get(t).externalConnections = !0);
+		})) : a.debug("Not a cluster ", t, f);
+	});
+	for (let t of d.keys()) {
+		let n = d.get(t).id, r = e.parent(n);
+		r !== t && d.has(r) && !d.get(r).externalConnections && (d.get(t).id = r);
+		let i = e.edges().some((e) => e.v === t);
+		if (n && d.get(t)?.externalConnections && i && E(e, n, t)) {
+			let r = D(e, t, e.parent(n));
+			r && (d.get(t).id = r);
+		}
+	}
+	e.edges().forEach(function(t) {
+		let n = e.edge(t);
+		a.warn("Edge " + t.v + " -> " + t.w + ": " + JSON.stringify(t)), a.warn("Edge " + t.v + " -> " + t.w + ": " + JSON.stringify(e.edge(t)));
+		let r = t.v, i = t.w;
+		if (a.warn("Fix XXX", d, "ids:", t.v, t.w, "Translating: ", d.get(t.v), " --- ", d.get(t.w)), d.get(t.v) || d.get(t.w)) {
+			if (a.warn("Fixing and trying - removing XXX", t.v, t.w, t.name), r = x(t.v), i = x(t.w), e.removeEdge(t.v, t.w, t.name), r !== t.v) {
+				let i = e.parent(r);
+				d.get(i).externalConnections = !0, n.fromCluster = t.v;
+			}
+			if (i !== t.w) {
+				let r = e.parent(i);
+				d.get(r).externalConnections = !0, n.toCluster = t.w;
+			}
+			a.warn("Fix Replacing with XXX", r, i, t.name), e.setEdge(r, i, n, t.name);
+		}
+	}), a.warn("Adjusted Graph", c(e)), C(e, 0), a.trace(d);
+}, "adjustClustersAndEdges"), C = /* @__PURE__ */ i((e, t) => {
+	if (a.warn("extractor - ", t, c(e), e.children("D")), t > 10) {
+		a.error("Bailing out");
+		return;
+	}
+	let r = e.nodes(), i = !1;
+	for (let t of r) {
+		let n = e.children(t);
+		i ||= n.length > 0;
+	}
+	if (!i) {
+		a.debug("Done, no node has children", e.nodes());
+		return;
+	}
+	a.debug("Nodes = ", r, t);
+	for (let i of r) if (a.debug("Extracting node", i, d, d.has(i) && !d.get(i).externalConnections, !e.parent(i), e.node(i), e.children("D"), " Depth ", t), !d.has(i)) a.debug("Not a cluster", i, t);
+	else if (d.get(i)?.clusterData?.explicitDir && e.children(i) && e.children(i).length > 0) {
+		a.warn("Cluster with explicit dir, creating subgraph for children", i, t);
+		let r = d.get(i).clusterData.dir, o = new n({
+			multigraph: !0,
+			compound: !0
+		}).setGraph({
+			rankdir: r,
+			nodesep: 50,
+			ranksep: 50,
+			marginx: 8,
+			marginy: 8
+		}).setDefaultEdgeLabel(function() {
+			return {};
+		});
+		_(i, e, o, i);
+		let s = e.node(i) || {};
+		e.setNode(i, {
+			...s,
+			clusterNode: !0,
+			id: i,
+			clusterData: d.get(i).clusterData,
+			label: d.get(i).label,
+			graph: o
+		}), a.warn("Subgraph for cluster with explicit dir created:", i, c(o));
+	} else if (!d.get(i).externalConnections && e.children(i) && e.children(i).length > 0) {
+		a.warn("Cluster without external connections, without a parent and with children", i, t);
+		let r = e.graph().rankdir === "TB" ? "LR" : "TB";
+		d.get(i)?.clusterData?.dir && (r = d.get(i).clusterData.dir, a.warn("Fixing dir", d.get(i).clusterData.dir, r));
+		let o = new n({
+			multigraph: !0,
+			compound: !0
+		}).setGraph({
+			rankdir: r,
+			nodesep: 50,
+			ranksep: 50,
+			marginx: 8,
+			marginy: 8
+		}).setDefaultEdgeLabel(function() {
+			return {};
+		});
+		_(i, e, o, i);
+		let s = e.node(i) || {};
+		e.setNode(i, {
+			...s,
+			clusterNode: !0,
+			id: i,
+			clusterData: d.get(i).clusterData,
+			label: d.get(i).label,
+			graph: o
+		}), a.debug("Old graph after copy", c(e));
+	} else a.warn("Cluster ** ", i, " **not meeting the criteria !externalConnections:", !d.get(i).externalConnections, " no parent: ", !e.parent(i), " children ", e.children(i) && e.children(i).length > 0, e.children("D"), t), a.debug(d);
+	r = e.nodes(), a.warn("New list of nodes", r);
+	for (let n of r) {
+		let r = e.node(n);
+		a.warn(" Now next level", n, r), r?.clusterNode && C(r.graph, t + 1);
+	}
+}, "extractor"), w = /* @__PURE__ */ i((e, t) => {
+	if (t.length === 0) return [];
+	let n = Object.assign([], t);
+	return t.forEach((t) => {
+		let r = w(e, e.children(t));
+		n = [...n, ...r];
+	}), n;
+}, "sorter"), T = /* @__PURE__ */ i((e) => w(e, e.children()), "sortNodesByHierarchy"), E = /* @__PURE__ */ i((e, t, n) => {
+	let r = e.parent(t);
+	for (; r && r !== n;) {
+		let t = d.get(r);
+		if (t && !t.externalConnections) return !0;
+		r = e.parent(r);
+	}
+	return !1;
+}, "isNodeInExtractableCluster"), D = /* @__PURE__ */ i((e, t, n) => {
+	let r = e.children(t) ?? [];
+	for (let i of r) {
+		if (i === n || h(i, n)) continue;
+		let r = b(i, e, t);
+		if (r && !E(e, r, t)) return r;
+	}
+	return null;
+}, "findSafeAnchorNode");
+//#endregion
+export { T as a, b as i, m as n, c as o, d as r, S as t };