@burdenoff/microfe-vibecontrols 2026.601.12 → 2026.601.13

package/dist/node_modules/graphlib/lib/data/priority-queue.js

@@ -0,0 +1,56 @@
+import { __commonJSMin as e } from "../../../../_virtual/_rolldown/runtime.js";
+import { require_lodash as t } from "../lodash.js";
+//#region node_modules/graphlib/lib/data/priority-queue.js
+var n = /* @__PURE__ */ e(((e, n) => {
+	var r = t();
+	n.exports = i;
+	function i() {
+		this._arr = [], this._keyIndices = {};
+	}
+	i.prototype.size = function() {
+		return this._arr.length;
+	}, i.prototype.keys = function() {
+		return this._arr.map(function(e) {
+			return e.key;
+		});
+	}, i.prototype.has = function(e) {
+		return r.has(this._keyIndices, e);
+	}, i.prototype.priority = function(e) {
+		var t = this._keyIndices[e];
+		if (t !== void 0) return this._arr[t].priority;
+	}, i.prototype.min = function() {
+		if (this.size() === 0) throw Error("Queue underflow");
+		return this._arr[0].key;
+	}, i.prototype.add = function(e, t) {
+		var n = this._keyIndices;
+		if (e = String(e), !r.has(n, e)) {
+			var i = this._arr, a = i.length;
+			return n[e] = a, i.push({
+				key: e,
+				priority: t
+			}), this._decrease(a), !0;
+		}
+		return !1;
+	}, i.prototype.removeMin = function() {
+		this._swap(0, this._arr.length - 1);
+		var e = this._arr.pop();
+		return delete this._keyIndices[e.key], this._heapify(0), e.key;
+	}, i.prototype.decrease = function(e, t) {
+		var n = this._keyIndices[e];
+		if (t > this._arr[n].priority) throw Error("New priority is greater than current priority. Key: " + e + " Old: " + this._arr[n].priority + " New: " + t);
+		this._arr[n].priority = t, this._decrease(n);
+	}, i.prototype._heapify = function(e) {
+		var t = this._arr, n = 2 * e, r = n + 1, i = e;
+		n < t.length && (i = t[n].priority < t[i].priority ? n : i, r < t.length && (i = t[r].priority < t[i].priority ? r : i), i !== e && (this._swap(e, i), this._heapify(i)));
+	}, i.prototype._decrease = function(e) {
+		for (var t = this._arr, n = t[e].priority, r; e !== 0 && (r = e >> 1, !(t[r].priority < n));) this._swap(e, r), e = r;
+	}, i.prototype._swap = function(e, t) {
+		var n = this._arr, r = this._keyIndices, i = n[e], a = n[t];
+		n[e] = a, n[t] = i, r[a.key] = e, r[i.key] = t;
+	};
+}));
+//#endregion
+export default n();
+export { n as require_priority_queue };
+
+//# sourceMappingURL=priority-queue.js.map

package/dist/node_modules/graphlib/lib/data/priority-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-queue.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/data/priority-queue.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = PriorityQueue;\n\n/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nfunction PriorityQueue() {\n  this._arr = [];\n  this._keyIndices = {};\n}\n\n/**\n * Returns the number of elements in the queue. Takes `O(1)` time.\n */\nPriorityQueue.prototype.size = function() {\n  return this._arr.length;\n};\n\n/**\n * Returns the keys that are in the queue. Takes `O(n)` time.\n */\nPriorityQueue.prototype.keys = function() {\n  return this._arr.map(function(x) { return x.key; });\n};\n\n/**\n * Returns `true` if **key** is in the queue and `false` if not.\n */\nPriorityQueue.prototype.has = function(key) {\n  return _.has(this._keyIndices, key);\n};\n\n/**\n * Returns the priority for **key**. If **key** is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n *\n * @param {Object} key\n */\nPriorityQueue.prototype.priority = function(key) {\n  var index = this._keyIndices[key];\n  if (index !== undefined) {\n    return this._arr[index].priority;\n  }\n};\n\n/**\n * Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n */\nPriorityQueue.prototype.min = function() {\n  if (this.size() === 0) {\n    throw new Error(\"Queue underflow\");\n  }\n  return this._arr[0].key;\n};\n\n/**\n * Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n *\n * @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n */\nPriorityQueue.prototype.add = function(key, priority) {\n  var keyIndices = this._keyIndices;\n  key = String(key);\n  if (!_.has(keyIndices, key)) {\n    var arr = this._arr;\n    var index = arr.length;\n    keyIndices[key] = index;\n    arr.push({key: key, priority: priority});\n    this._decrease(index);\n    return true;\n  }\n  return false;\n};\n\n/**\n * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n */\nPriorityQueue.prototype.removeMin = function() {\n  this._swap(0, this._arr.length - 1);\n  var min = this._arr.pop();\n  delete this._keyIndices[min.key];\n  this._heapify(0);\n  return min.key;\n};\n\n/**\n * Decreases the priority for **key** to **priority**. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n *\n * @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n */\nPriorityQueue.prototype.decrease = function(key, priority) {\n  var index = this._keyIndices[key];\n  if (priority > this._arr[index].priority) {\n    throw new Error(\"New priority is greater than current priority. \" +\n        \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n  }\n  this._arr[index].priority = priority;\n  this._decrease(index);\n};\n\nPriorityQueue.prototype._heapify = function(i) {\n  var arr = this._arr;\n  var l = 2 * i;\n  var r = l + 1;\n  var largest = i;\n  if (l < arr.length) {\n    largest = arr[l].priority < arr[largest].priority ? l : largest;\n    if (r < arr.length) {\n      largest = arr[r].priority < arr[largest].priority ? r : largest;\n    }\n    if (largest !== i) {\n      this._swap(i, largest);\n      this._heapify(largest);\n    }\n  }\n};\n\nPriorityQueue.prototype._decrease = function(index) {\n  var arr = this._arr;\n  var priority = arr[index].priority;\n  var parent;\n  while (index !== 0) {\n    parent = index >> 1;\n    if (arr[parent].priority < priority) {\n      break;\n    }\n    this._swap(index, parent);\n    index = parent;\n  }\n};\n\nPriorityQueue.prototype._swap = function(i, j) {\n  var arr = this._arr;\n  var keyIndices = this._keyIndices;\n  var origArrI = arr[i];\n  var origArrJ = arr[j];\n  arr[i] = origArrJ;\n  arr[j] = origArrI;\n  keyIndices[origArrJ.key] = i;\n  keyIndices[origArrI.key] = j;\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CASjB,SAAS,IAAgB;AAEvB,EADA,KAAK,OAAO,EAAE,EACd,KAAK,cAAc,EAAE;;AAiIvB,CA3HA,EAAc,UAAU,OAAO,WAAW;AACxC,SAAO,KAAK,KAAK;IAMnB,EAAc,UAAU,OAAO,WAAW;AACxC,SAAO,KAAK,KAAK,IAAI,SAAS,GAAG;AAAE,UAAO,EAAE;IAAO;IAMrD,EAAc,UAAU,MAAM,SAAS,GAAK;AAC1C,SAAO,EAAE,IAAI,KAAK,aAAa,EAAI;IASrC,EAAc,UAAU,WAAW,SAAS,GAAK;EAC/C,IAAI,IAAQ,KAAK,YAAY;AAC7B,MAAI,MAAU,KAAA,EACZ,QAAO,KAAK,KAAK,GAAO;IAQ5B,EAAc,UAAU,MAAM,WAAW;AACvC,MAAI,KAAK,MAAM,KAAK,EAClB,OAAU,MAAM,kBAAkB;AAEpC,SAAO,KAAK,KAAK,GAAG;IAWtB,EAAc,UAAU,MAAM,SAAS,GAAK,GAAU;EACpD,IAAI,IAAa,KAAK;AAEtB,MADA,IAAM,OAAO,EAAI,EACb,CAAC,EAAE,IAAI,GAAY,EAAI,EAAE;GAC3B,IAAI,IAAM,KAAK,MACX,IAAQ,EAAI;AAIhB,UAHA,EAAW,KAAO,GAClB,EAAI,KAAK;IAAM;IAAe;IAAS,CAAC,EACxC,KAAK,UAAU,EAAM,EACd;;AAET,SAAO;IAMT,EAAc,UAAU,YAAY,WAAW;AAC7C,OAAK,MAAM,GAAG,KAAK,KAAK,SAAS,EAAE;EACnC,IAAI,IAAM,KAAK,KAAK,KAAK;AAGzB,SAFA,OAAO,KAAK,YAAY,EAAI,MAC5B,KAAK,SAAS,EAAE,EACT,EAAI;IAUb,EAAc,UAAU,WAAW,SAAS,GAAK,GAAU;EACzD,IAAI,IAAQ,KAAK,YAAY;AAC7B,MAAI,IAAW,KAAK,KAAK,GAAO,SAC9B,OAAU,MAAM,yDACF,IAAM,WAAW,KAAK,KAAK,GAAO,WAAW,WAAW,EAAS;AAGjF,EADA,KAAK,KAAK,GAAO,WAAW,GAC5B,KAAK,UAAU,EAAM;IAGvB,EAAc,UAAU,WAAW,SAAS,GAAG;EAC7C,IAAI,IAAM,KAAK,MACX,IAAI,IAAI,GACR,IAAI,IAAI,GACR,IAAU;AACd,EAAI,IAAI,EAAI,WACV,IAAU,EAAI,GAAG,WAAW,EAAI,GAAS,WAAW,IAAI,GACpD,IAAI,EAAI,WACV,IAAU,EAAI,GAAG,WAAW,EAAI,GAAS,WAAW,IAAI,IAEtD,MAAY,MACd,KAAK,MAAM,GAAG,EAAQ,EACtB,KAAK,SAAS,EAAQ;IAK5B,EAAc,UAAU,YAAY,SAAS,GAAO;AAIlD,OAHA,IAAI,IAAM,KAAK,MACX,IAAW,EAAI,GAAO,UACtB,GACG,MAAU,MACf,IAAS,KAAS,GACd,IAAI,GAAQ,WAAW,KAI3B,CADA,KAAK,MAAM,GAAO,EAAO,EACzB,IAAQ;IAIZ,EAAc,UAAU,QAAQ,SAAS,GAAG,GAAG;EAC7C,IAAI,IAAM,KAAK,MACX,IAAa,KAAK,aAClB,IAAW,EAAI,IACf,IAAW,EAAI;AAInB,EAHA,EAAI,KAAK,GACT,EAAI,KAAK,GACT,EAAW,EAAS,OAAO,GAC3B,EAAW,EAAS,OAAO"}

package/dist/node_modules/graphlib/lib/graph.js

@@ -0,0 +1,196 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+import { require_lodash as t } from "./lodash.js";
+//#region node_modules/graphlib/lib/graph.js
+var n = /* @__PURE__ */ e(((e, n) => {
+	var r = t();
+	n.exports = s;
+	var i = "\0", a = "\0", o = "
";
+	function s(e) {
+		this._isDirected = r.has(e, "directed") ? e.directed : !0, this._isMultigraph = r.has(e, "multigraph") ? e.multigraph : !1, this._isCompound = r.has(e, "compound") ? e.compound : !1, this._label = void 0, this._defaultNodeLabelFn = r.constant(void 0), this._defaultEdgeLabelFn = r.constant(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[a] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
+	}
+	s.prototype._nodeCount = 0, s.prototype._edgeCount = 0, s.prototype.isDirected = function() {
+		return this._isDirected;
+	}, s.prototype.isMultigraph = function() {
+		return this._isMultigraph;
+	}, s.prototype.isCompound = function() {
+		return this._isCompound;
+	}, s.prototype.setGraph = function(e) {
+		return this._label = e, this;
+	}, s.prototype.graph = function() {
+		return this._label;
+	}, s.prototype.setDefaultNodeLabel = function(e) {
+		return r.isFunction(e) || (e = r.constant(e)), this._defaultNodeLabelFn = e, this;
+	}, s.prototype.nodeCount = function() {
+		return this._nodeCount;
+	}, s.prototype.nodes = function() {
+		return r.keys(this._nodes);
+	}, s.prototype.sources = function() {
+		var e = this;
+		return r.filter(this.nodes(), function(t) {
+			return r.isEmpty(e._in[t]);
+		});
+	}, s.prototype.sinks = function() {
+		var e = this;
+		return r.filter(this.nodes(), function(t) {
+			return r.isEmpty(e._out[t]);
+		});
+	}, s.prototype.setNodes = function(e, t) {
+		var n = arguments, i = this;
+		return r.each(e, function(e) {
+			n.length > 1 ? i.setNode(e, t) : i.setNode(e);
+		}), this;
+	}, s.prototype.setNode = function(e, t) {
+		return r.has(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = a, this._children[e] = {}, this._children[a][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+	}, s.prototype.node = function(e) {
+		return this._nodes[e];
+	}, s.prototype.hasNode = function(e) {
+		return r.has(this._nodes, e);
+	}, s.prototype.removeNode = function(e) {
+		var t = this;
+		if (r.has(this._nodes, e)) {
+			var n = function(e) {
+				t.removeEdge(t._edgeObjs[e]);
+			};
+			delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], r.each(this.children(e), function(e) {
+				t.setParent(e);
+			}), delete this._children[e]), r.each(r.keys(this._in[e]), n), delete this._in[e], delete this._preds[e], r.each(r.keys(this._out[e]), n), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+		}
+		return this;
+	}, s.prototype.setParent = function(e, t) {
+		if (!this._isCompound) throw Error("Cannot set parent in a non-compound graph");
+		if (r.isUndefined(t)) t = a;
+		else {
+			t += "";
+			for (var n = t; !r.isUndefined(n); n = this.parent(n)) if (n === e) throw Error("Setting " + t + " as parent of " + e + " would create a cycle");
+			this.setNode(t);
+		}
+		return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
+	}, s.prototype._removeFromParentsChildList = function(e) {
+		delete this._children[this._parent[e]][e];
+	}, s.prototype.parent = function(e) {
+		if (this._isCompound) {
+			var t = this._parent[e];
+			if (t !== a) return t;
+		}
+	}, s.prototype.children = function(e) {
+		if (r.isUndefined(e) && (e = a), this._isCompound) {
+			var t = this._children[e];
+			if (t) return r.keys(t);
+		} else if (e === a) return this.nodes();
+		else if (this.hasNode(e)) return [];
+	}, s.prototype.predecessors = function(e) {
+		var t = this._preds[e];
+		if (t) return r.keys(t);
+	}, s.prototype.successors = function(e) {
+		var t = this._sucs[e];
+		if (t) return r.keys(t);
+	}, s.prototype.neighbors = function(e) {
+		var t = this.predecessors(e);
+		if (t) return r.union(t, this.successors(e));
+	}, s.prototype.isLeaf = function(e) {
+		return (this.isDirected() ? this.successors(e) : this.neighbors(e)).length === 0;
+	}, s.prototype.filterNodes = function(e) {
+		var t = new this.constructor({
+			directed: this._isDirected,
+			multigraph: this._isMultigraph,
+			compound: this._isCompound
+		});
+		t.setGraph(this.graph());
+		var n = this;
+		r.each(this._nodes, function(n, r) {
+			e(r) && t.setNode(r, n);
+		}), r.each(this._edgeObjs, function(e) {
+			t.hasNode(e.v) && t.hasNode(e.w) && t.setEdge(e, n.edge(e));
+		});
+		var i = {};
+		function a(e) {
+			var r = n.parent(e);
+			return r === void 0 || t.hasNode(r) ? (i[e] = r, r) : r in i ? i[r] : a(r);
+		}
+		return this._isCompound && r.each(t.nodes(), function(e) {
+			t.setParent(e, a(e));
+		}), t;
+	}, s.prototype.setDefaultEdgeLabel = function(e) {
+		return r.isFunction(e) || (e = r.constant(e)), this._defaultEdgeLabelFn = e, this;
+	}, s.prototype.edgeCount = function() {
+		return this._edgeCount;
+	}, s.prototype.edges = function() {
+		return r.values(this._edgeObjs);
+	}, s.prototype.setPath = function(e, t) {
+		var n = this, i = arguments;
+		return r.reduce(e, function(e, r) {
+			return i.length > 1 ? n.setEdge(e, r, t) : n.setEdge(e, r), r;
+		}), this;
+	}, s.prototype.setEdge = function() {
+		var e, t, n, i, a = !1, o = arguments[0];
+		typeof o == "object" && o && "v" in o ? (e = o.v, t = o.w, n = o.name, arguments.length === 2 && (i = arguments[1], a = !0)) : (e = o, t = arguments[1], n = arguments[3], arguments.length > 2 && (i = arguments[2], a = !0)), e = "" + e, t = "" + t, r.isUndefined(n) || (n = "" + n);
+		var s = u(this._isDirected, e, t, n);
+		if (r.has(this._edgeLabels, s)) return a && (this._edgeLabels[s] = i), this;
+		if (!r.isUndefined(n) && !this._isMultigraph) throw Error("Cannot set a named edge when isMultigraph = false");
+		this.setNode(e), this.setNode(t), this._edgeLabels[s] = a ? i : this._defaultEdgeLabelFn(e, t, n);
+		var l = d(this._isDirected, e, t, n);
+		return e = l.v, t = l.w, Object.freeze(l), this._edgeObjs[s] = l, c(this._preds[t], e), c(this._sucs[e], t), this._in[t][s] = l, this._out[e][s] = l, this._edgeCount++, this;
+	}, s.prototype.edge = function(e, t, n) {
+		var r = arguments.length === 1 ? f(this._isDirected, arguments[0]) : u(this._isDirected, e, t, n);
+		return this._edgeLabels[r];
+	}, s.prototype.hasEdge = function(e, t, n) {
+		var i = arguments.length === 1 ? f(this._isDirected, arguments[0]) : u(this._isDirected, e, t, n);
+		return r.has(this._edgeLabels, i);
+	}, s.prototype.removeEdge = function(e, t, n) {
+		var r = arguments.length === 1 ? f(this._isDirected, arguments[0]) : u(this._isDirected, e, t, n), i = this._edgeObjs[r];
+		return i && (e = i.v, t = i.w, delete this._edgeLabels[r], delete this._edgeObjs[r], l(this._preds[t], e), l(this._sucs[e], t), delete this._in[t][r], delete this._out[e][r], this._edgeCount--), this;
+	}, s.prototype.inEdges = function(e, t) {
+		var n = this._in[e];
+		if (n) {
+			var i = r.values(n);
+			return t ? r.filter(i, function(e) {
+				return e.v === t;
+			}) : i;
+		}
+	}, s.prototype.outEdges = function(e, t) {
+		var n = this._out[e];
+		if (n) {
+			var i = r.values(n);
+			return t ? r.filter(i, function(e) {
+				return e.w === t;
+			}) : i;
+		}
+	}, s.prototype.nodeEdges = function(e, t) {
+		var n = this.inEdges(e, t);
+		if (n) return n.concat(this.outEdges(e, t));
+	};
+	function c(e, t) {
+		e[t] ? e[t]++ : e[t] = 1;
+	}
+	function l(e, t) {
+		--e[t] || delete e[t];
+	}
+	function u(e, t, n, a) {
+		var s = "" + t, c = "" + n;
+		if (!e && s > c) {
+			var l = s;
+			s = c, c = l;
+		}
+		return s + o + c + o + (r.isUndefined(a) ? i : a);
+	}
+	function d(e, t, n, r) {
+		var i = "" + t, a = "" + n;
+		if (!e && i > a) {
+			var o = i;
+			i = a, a = o;
+		}
+		var s = {
+			v: i,
+			w: a
+		};
+		return r && (s.name = r), s;
+	}
+	function f(e, t) {
+		return u(e, t.v, t.w, t.name);
+	}
+}));
+//#endregion
+export default n();
+export { n as require_graph };
+
+//# sourceMappingURL=graph.js.map

package/dist/node_modules/graphlib/lib/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","names":[],"sources":["../../../../node_modules/graphlib/lib/graph.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = Graph;\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nfunction Graph(opts) {\n  this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n  this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n  this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n  // Label for the graph itself\n  this._label = undefined;\n\n  // Defaults to be set when creating a new node\n  this._defaultNodeLabelFn = _.constant(undefined);\n\n  // Defaults to be set when creating a new edge\n  this._defaultEdgeLabelFn = _.constant(undefined);\n\n  // v -> label\n  this._nodes = {};\n\n  if (this._isCompound) {\n    // v -> parent\n    this._parent = {};\n\n    // v -> children\n    this._children = {};\n    this._children[GRAPH_NODE] = {};\n  }\n\n  // v -> edgeObj\n  this._in = {};\n\n  // u -> v -> Number\n  this._preds = {};\n\n  // v -> edgeObj\n  this._out = {};\n\n  // v -> w -> Number\n  this._sucs = {};\n\n  // e -> edgeObj\n  this._edgeObjs = {};\n\n  // e -> label\n  this._edgeLabels = {};\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. */\nGraph.prototype._nodeCount = 0;\n\n/* Number of edges in the graph. Should only be changed by the implementation. */\nGraph.prototype._edgeCount = 0;\n\n\n/* === Graph functions ========= */\n\nGraph.prototype.isDirected = function() {\n  return this._isDirected;\n};\n\nGraph.prototype.isMultigraph = function() {\n  return this._isMultigraph;\n};\n\nGraph.prototype.isCompound = function() {\n  return this._isCompound;\n};\n\nGraph.prototype.setGraph = function(label) {\n  this._label = label;\n  return this;\n};\n\nGraph.prototype.graph = function() {\n  return this._label;\n};\n\n\n/* === Node functions ========== */\n\nGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultNodeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.nodeCount = function() {\n  return this._nodeCount;\n};\n\nGraph.prototype.nodes = function() {\n  return _.keys(this._nodes);\n};\n\nGraph.prototype.sources = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._in[v]);\n  });\n};\n\nGraph.prototype.sinks = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._out[v]);\n  });\n};\n\nGraph.prototype.setNodes = function(vs, value) {\n  var args = arguments;\n  var self = this;\n  _.each(vs, function(v) {\n    if (args.length > 1) {\n      self.setNode(v, value);\n    } else {\n      self.setNode(v);\n    }\n  });\n  return this;\n};\n\nGraph.prototype.setNode = function(v, value) {\n  if (_.has(this._nodes, v)) {\n    if (arguments.length > 1) {\n      this._nodes[v] = value;\n    }\n    return this;\n  }\n\n  this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n  if (this._isCompound) {\n    this._parent[v] = GRAPH_NODE;\n    this._children[v] = {};\n    this._children[GRAPH_NODE][v] = true;\n  }\n  this._in[v] = {};\n  this._preds[v] = {};\n  this._out[v] = {};\n  this._sucs[v] = {};\n  ++this._nodeCount;\n  return this;\n};\n\nGraph.prototype.node = function(v) {\n  return this._nodes[v];\n};\n\nGraph.prototype.hasNode = function(v) {\n  return _.has(this._nodes, v);\n};\n\nGraph.prototype.removeNode =  function(v) {\n  var self = this;\n  if (_.has(this._nodes, v)) {\n    var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n    delete this._nodes[v];\n    if (this._isCompound) {\n      this._removeFromParentsChildList(v);\n      delete this._parent[v];\n      _.each(this.children(v), function(child) {\n        self.setParent(child);\n      });\n      delete this._children[v];\n    }\n    _.each(_.keys(this._in[v]), removeEdge);\n    delete this._in[v];\n    delete this._preds[v];\n    _.each(_.keys(this._out[v]), removeEdge);\n    delete this._out[v];\n    delete this._sucs[v];\n    --this._nodeCount;\n  }\n  return this;\n};\n\nGraph.prototype.setParent = function(v, parent) {\n  if (!this._isCompound) {\n    throw new Error(\"Cannot set parent in a non-compound graph\");\n  }\n\n  if (_.isUndefined(parent)) {\n    parent = GRAPH_NODE;\n  } else {\n    // Coerce parent to string\n    parent += \"\";\n    for (var ancestor = parent;\n      !_.isUndefined(ancestor);\n      ancestor = this.parent(ancestor)) {\n      if (ancestor === v) {\n        throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n                        \" would create a cycle\");\n      }\n    }\n\n    this.setNode(parent);\n  }\n\n  this.setNode(v);\n  this._removeFromParentsChildList(v);\n  this._parent[v] = parent;\n  this._children[parent][v] = true;\n  return this;\n};\n\nGraph.prototype._removeFromParentsChildList = function(v) {\n  delete this._children[this._parent[v]][v];\n};\n\nGraph.prototype.parent = function(v) {\n  if (this._isCompound) {\n    var parent = this._parent[v];\n    if (parent !== GRAPH_NODE) {\n      return parent;\n    }\n  }\n};\n\nGraph.prototype.children = function(v) {\n  if (_.isUndefined(v)) {\n    v = GRAPH_NODE;\n  }\n\n  if (this._isCompound) {\n    var children = this._children[v];\n    if (children) {\n      return _.keys(children);\n    }\n  } else if (v === GRAPH_NODE) {\n    return this.nodes();\n  } else if (this.hasNode(v)) {\n    return [];\n  }\n};\n\nGraph.prototype.predecessors = function(v) {\n  var predsV = this._preds[v];\n  if (predsV) {\n    return _.keys(predsV);\n  }\n};\n\nGraph.prototype.successors = function(v) {\n  var sucsV = this._sucs[v];\n  if (sucsV) {\n    return _.keys(sucsV);\n  }\n};\n\nGraph.prototype.neighbors = function(v) {\n  var preds = this.predecessors(v);\n  if (preds) {\n    return _.union(preds, this.successors(v));\n  }\n};\n\nGraph.prototype.isLeaf = function (v) {\n  var neighbors;\n  if (this.isDirected()) {\n    neighbors = this.successors(v);\n  } else {\n    neighbors = this.neighbors(v);\n  }\n  return neighbors.length === 0;\n};\n\nGraph.prototype.filterNodes = function(filter) {\n  var copy = new this.constructor({\n    directed: this._isDirected,\n    multigraph: this._isMultigraph,\n    compound: this._isCompound\n  });\n\n  copy.setGraph(this.graph());\n\n  var self = this;\n  _.each(this._nodes, function(value, v) {\n    if (filter(v)) {\n      copy.setNode(v, value);\n    }\n  });\n\n  _.each(this._edgeObjs, function(e) {\n    if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n      copy.setEdge(e, self.edge(e));\n    }\n  });\n\n  var parents = {};\n  function findParent(v) {\n    var parent = self.parent(v);\n    if (parent === undefined || copy.hasNode(parent)) {\n      parents[v] = parent;\n      return parent;\n    } else if (parent in parents) {\n      return parents[parent];\n    } else {\n      return findParent(parent);\n    }\n  }\n\n  if (this._isCompound) {\n    _.each(copy.nodes(), function(v) {\n      copy.setParent(v, findParent(v));\n    });\n  }\n\n  return copy;\n};\n\n/* === Edge functions ========== */\n\nGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultEdgeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.edgeCount = function() {\n  return this._edgeCount;\n};\n\nGraph.prototype.edges = function() {\n  return _.values(this._edgeObjs);\n};\n\nGraph.prototype.setPath = function(vs, value) {\n  var self = this;\n  var args = arguments;\n  _.reduce(vs, function(v, w) {\n    if (args.length > 1) {\n      self.setEdge(v, w, value);\n    } else {\n      self.setEdge(v, w);\n    }\n    return w;\n  });\n  return this;\n};\n\n/*\n * setEdge(v, w, [value, [name]])\n * setEdge({ v, w, [name] }, [value])\n */\nGraph.prototype.setEdge = function() {\n  var v, w, name, value;\n  var valueSpecified = false;\n  var arg0 = arguments[0];\n\n  if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n    v = arg0.v;\n    w = arg0.w;\n    name = arg0.name;\n    if (arguments.length === 2) {\n      value = arguments[1];\n      valueSpecified = true;\n    }\n  } else {\n    v = arg0;\n    w = arguments[1];\n    name = arguments[3];\n    if (arguments.length > 2) {\n      value = arguments[2];\n      valueSpecified = true;\n    }\n  }\n\n  v = \"\" + v;\n  w = \"\" + w;\n  if (!_.isUndefined(name)) {\n    name = \"\" + name;\n  }\n\n  var e = edgeArgsToId(this._isDirected, v, w, name);\n  if (_.has(this._edgeLabels, e)) {\n    if (valueSpecified) {\n      this._edgeLabels[e] = value;\n    }\n    return this;\n  }\n\n  if (!_.isUndefined(name) && !this._isMultigraph) {\n    throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n  }\n\n  // It didn't exist, so we need to create it.\n  // First ensure the nodes exist.\n  this.setNode(v);\n  this.setNode(w);\n\n  this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n  var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n  // Ensure we add undirected edges in a consistent way.\n  v = edgeObj.v;\n  w = edgeObj.w;\n\n  Object.freeze(edgeObj);\n  this._edgeObjs[e] = edgeObj;\n  incrementOrInitEntry(this._preds[w], v);\n  incrementOrInitEntry(this._sucs[v], w);\n  this._in[w][e] = edgeObj;\n  this._out[v][e] = edgeObj;\n  this._edgeCount++;\n  return this;\n};\n\nGraph.prototype.edge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return this._edgeLabels[e];\n};\n\nGraph.prototype.hasEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return _.has(this._edgeLabels, e);\n};\n\nGraph.prototype.removeEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  var edge = this._edgeObjs[e];\n  if (edge) {\n    v = edge.v;\n    w = edge.w;\n    delete this._edgeLabels[e];\n    delete this._edgeObjs[e];\n    decrementOrRemoveEntry(this._preds[w], v);\n    decrementOrRemoveEntry(this._sucs[v], w);\n    delete this._in[w][e];\n    delete this._out[v][e];\n    this._edgeCount--;\n  }\n  return this;\n};\n\nGraph.prototype.inEdges = function(v, u) {\n  var inV = this._in[v];\n  if (inV) {\n    var edges = _.values(inV);\n    if (!u) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.v === u; });\n  }\n};\n\nGraph.prototype.outEdges = function(v, w) {\n  var outV = this._out[v];\n  if (outV) {\n    var edges = _.values(outV);\n    if (!w) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.w === w; });\n  }\n};\n\nGraph.prototype.nodeEdges = function(v, w) {\n  var inEdges = this.inEdges(v, w);\n  if (inEdges) {\n    return inEdges.concat(this.outEdges(v, w));\n  }\n};\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n             (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj =  { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAEA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,IAAI,IAAoB,MACpB,IAAa,MACb,IAAiB;CAYrB,SAAS,EAAM,GAAM;AA0CnB,EAzCA,KAAK,cAAc,EAAE,IAAI,GAAM,WAAW,GAAG,EAAK,WAAW,IAC7D,KAAK,gBAAgB,EAAE,IAAI,GAAM,aAAa,GAAG,EAAK,aAAa,IACnE,KAAK,cAAc,EAAE,IAAI,GAAM,WAAW,GAAG,EAAK,WAAW,IAG7D,KAAK,SAAS,KAAA,GAGd,KAAK,sBAAsB,EAAE,SAAS,KAAA,EAAU,EAGhD,KAAK,sBAAsB,EAAE,SAAS,KAAA,EAAU,EAGhD,KAAK,SAAS,EAAE,EAEZ,KAAK,gBAEP,KAAK,UAAU,EAAE,EAGjB,KAAK,YAAY,EAAE,EACnB,KAAK,UAAU,KAAc,EAAE,GAIjC,KAAK,MAAM,EAAE,EAGb,KAAK,SAAS,EAAE,EAGhB,KAAK,OAAO,EAAE,EAGd,KAAK,QAAQ,EAAE,EAGf,KAAK,YAAY,EAAE,EAGnB,KAAK,cAAc,EAAE;;AAqavB,CAjaA,EAAM,UAAU,aAAa,GAG7B,EAAM,UAAU,aAAa,GAK7B,EAAM,UAAU,aAAa,WAAW;AACtC,SAAO,KAAK;IAGd,EAAM,UAAU,eAAe,WAAW;AACxC,SAAO,KAAK;IAGd,EAAM,UAAU,aAAa,WAAW;AACtC,SAAO,KAAK;IAGd,EAAM,UAAU,WAAW,SAAS,GAAO;AAEzC,SADA,KAAK,SAAS,GACP;IAGT,EAAM,UAAU,QAAQ,WAAW;AACjC,SAAO,KAAK;IAMd,EAAM,UAAU,sBAAsB,SAAS,GAAY;AAKzD,SAJK,EAAE,WAAW,EAAW,KAC3B,IAAa,EAAE,SAAS,EAAW,GAErC,KAAK,sBAAsB,GACpB;IAGT,EAAM,UAAU,YAAY,WAAW;AACrC,SAAO,KAAK;IAGd,EAAM,UAAU,QAAQ,WAAW;AACjC,SAAO,EAAE,KAAK,KAAK,OAAO;IAG5B,EAAM,UAAU,UAAU,WAAW;EACnC,IAAI,IAAO;AACX,SAAO,EAAE,OAAO,KAAK,OAAO,EAAE,SAAS,GAAG;AACxC,UAAO,EAAE,QAAQ,EAAK,IAAI,GAAG;IAC7B;IAGJ,EAAM,UAAU,QAAQ,WAAW;EACjC,IAAI,IAAO;AACX,SAAO,EAAE,OAAO,KAAK,OAAO,EAAE,SAAS,GAAG;AACxC,UAAO,EAAE,QAAQ,EAAK,KAAK,GAAG;IAC9B;IAGJ,EAAM,UAAU,WAAW,SAAS,GAAI,GAAO;EAC7C,IAAI,IAAO,WACP,IAAO;AAQX,SAPA,EAAE,KAAK,GAAI,SAAS,GAAG;AACrB,GAAI,EAAK,SAAS,IAChB,EAAK,QAAQ,GAAG,EAAM,GAEtB,EAAK,QAAQ,EAAE;IAEjB,EACK;IAGT,EAAM,UAAU,UAAU,SAAS,GAAG,GAAO;AAmB3C,SAlBI,EAAE,IAAI,KAAK,QAAQ,EAAE,IACnB,UAAU,SAAS,MACrB,KAAK,OAAO,KAAK,IAEZ,SAGT,KAAK,OAAO,KAAK,UAAU,SAAS,IAAI,IAAQ,KAAK,oBAAoB,EAAE,EACvE,KAAK,gBACP,KAAK,QAAQ,KAAK,GAClB,KAAK,UAAU,KAAK,EAAE,EACtB,KAAK,UAAU,GAAY,KAAK,KAElC,KAAK,IAAI,KAAK,EAAE,EAChB,KAAK,OAAO,KAAK,EAAE,EACnB,KAAK,KAAK,KAAK,EAAE,EACjB,KAAK,MAAM,KAAK,EAAE,EAClB,EAAE,KAAK,YACA;IAGT,EAAM,UAAU,OAAO,SAAS,GAAG;AACjC,SAAO,KAAK,OAAO;IAGrB,EAAM,UAAU,UAAU,SAAS,GAAG;AACpC,SAAO,EAAE,IAAI,KAAK,QAAQ,EAAE;IAG9B,EAAM,UAAU,aAAc,SAAS,GAAG;EACxC,IAAI,IAAO;AACX,MAAI,EAAE,IAAI,KAAK,QAAQ,EAAE,EAAE;GACzB,IAAI,IAAa,SAAS,GAAG;AAAE,MAAK,WAAW,EAAK,UAAU,GAAG;;AAgBjE,GAfA,OAAO,KAAK,OAAO,IACf,KAAK,gBACP,KAAK,4BAA4B,EAAE,EACnC,OAAO,KAAK,QAAQ,IACpB,EAAE,KAAK,KAAK,SAAS,EAAE,EAAE,SAAS,GAAO;AACvC,MAAK,UAAU,EAAM;KACrB,EACF,OAAO,KAAK,UAAU,KAExB,EAAE,KAAK,EAAE,KAAK,KAAK,IAAI,GAAG,EAAE,EAAW,EACvC,OAAO,KAAK,IAAI,IAChB,OAAO,KAAK,OAAO,IACnB,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,GAAG,EAAE,EAAW,EACxC,OAAO,KAAK,KAAK,IACjB,OAAO,KAAK,MAAM,IAClB,EAAE,KAAK;;AAET,SAAO;IAGT,EAAM,UAAU,YAAY,SAAS,GAAG,GAAQ;AAC9C,MAAI,CAAC,KAAK,YACR,OAAU,MAAM,4CAA4C;AAG9D,MAAI,EAAE,YAAY,EAAO,CACvB,KAAS;OACJ;AAEL,QAAU;AACV,QAAK,IAAI,IAAW,GAClB,CAAC,EAAE,YAAY,EAAS,EACxB,IAAW,KAAK,OAAO,EAAS,CAChC,KAAI,MAAa,EACf,OAAU,MAAM,aAAa,IAAQ,mBAAmB,IACxC,wBAAwB;AAI5C,QAAK,QAAQ,EAAO;;AAOtB,SAJA,KAAK,QAAQ,EAAE,EACf,KAAK,4BAA4B,EAAE,EACnC,KAAK,QAAQ,KAAK,GAClB,KAAK,UAAU,GAAQ,KAAK,IACrB;IAGT,EAAM,UAAU,8BAA8B,SAAS,GAAG;AACxD,SAAO,KAAK,UAAU,KAAK,QAAQ,IAAI;IAGzC,EAAM,UAAU,SAAS,SAAS,GAAG;AACnC,MAAI,KAAK,aAAa;GACpB,IAAI,IAAS,KAAK,QAAQ;AAC1B,OAAI,MAAW,EACb,QAAO;;IAKb,EAAM,UAAU,WAAW,SAAS,GAAG;AAKrC,MAJI,EAAE,YAAY,EAAE,KAClB,IAAI,IAGF,KAAK,aAAa;GACpB,IAAI,IAAW,KAAK,UAAU;AAC9B,OAAI,EACF,QAAO,EAAE,KAAK,EAAS;aAEhB,MAAM,EACf,QAAO,KAAK,OAAO;WACV,KAAK,QAAQ,EAAE,CACxB,QAAO,EAAE;IAIb,EAAM,UAAU,eAAe,SAAS,GAAG;EACzC,IAAI,IAAS,KAAK,OAAO;AACzB,MAAI,EACF,QAAO,EAAE,KAAK,EAAO;IAIzB,EAAM,UAAU,aAAa,SAAS,GAAG;EACvC,IAAI,IAAQ,KAAK,MAAM;AACvB,MAAI,EACF,QAAO,EAAE,KAAK,EAAM;IAIxB,EAAM,UAAU,YAAY,SAAS,GAAG;EACtC,IAAI,IAAQ,KAAK,aAAa,EAAE;AAChC,MAAI,EACF,QAAO,EAAE,MAAM,GAAO,KAAK,WAAW,EAAE,CAAC;IAI7C,EAAM,UAAU,SAAS,SAAU,GAAG;AAOpC,UALI,KAAK,YAAY,GACP,KAAK,WAAW,EAAE,GAElB,KAAK,UAAU,EAAE,EAEd,WAAW;IAG9B,EAAM,UAAU,cAAc,SAAS,GAAQ;EAC7C,IAAI,IAAO,IAAI,KAAK,YAAY;GAC9B,UAAU,KAAK;GACf,YAAY,KAAK;GACjB,UAAU,KAAK;GAChB,CAAC;AAEF,IAAK,SAAS,KAAK,OAAO,CAAC;EAE3B,IAAI,IAAO;AAOX,EANA,EAAE,KAAK,KAAK,QAAQ,SAAS,GAAO,GAAG;AACrC,GAAI,EAAO,EAAE,IACX,EAAK,QAAQ,GAAG,EAAM;IAExB,EAEF,EAAE,KAAK,KAAK,WAAW,SAAS,GAAG;AACjC,GAAI,EAAK,QAAQ,EAAE,EAAE,IAAI,EAAK,QAAQ,EAAE,EAAE,IACxC,EAAK,QAAQ,GAAG,EAAK,KAAK,EAAE,CAAC;IAE/B;EAEF,IAAI,IAAU,EAAE;EAChB,SAAS,EAAW,GAAG;GACrB,IAAI,IAAS,EAAK,OAAO,EAAE;AAOzB,UANE,MAAW,KAAA,KAAa,EAAK,QAAQ,EAAO,IAC9C,EAAQ,KAAK,GACN,KACE,KAAU,IACZ,EAAQ,KAER,EAAW,EAAO;;AAU7B,SANI,KAAK,eACP,EAAE,KAAK,EAAK,OAAO,EAAE,SAAS,GAAG;AAC/B,KAAK,UAAU,GAAG,EAAW,EAAE,CAAC;IAChC,EAGG;IAKT,EAAM,UAAU,sBAAsB,SAAS,GAAY;AAKzD,SAJK,EAAE,WAAW,EAAW,KAC3B,IAAa,EAAE,SAAS,EAAW,GAErC,KAAK,sBAAsB,GACpB;IAGT,EAAM,UAAU,YAAY,WAAW;AACrC,SAAO,KAAK;IAGd,EAAM,UAAU,QAAQ,WAAW;AACjC,SAAO,EAAE,OAAO,KAAK,UAAU;IAGjC,EAAM,UAAU,UAAU,SAAS,GAAI,GAAO;EAC5C,IAAI,IAAO,MACP,IAAO;AASX,SARA,EAAE,OAAO,GAAI,SAAS,GAAG,GAAG;AAM1B,UALI,EAAK,SAAS,IAChB,EAAK,QAAQ,GAAG,GAAG,EAAM,GAEzB,EAAK,QAAQ,GAAG,EAAE,EAEb;IACP,EACK;IAOT,EAAM,UAAU,UAAU,WAAW;EACnC,IAAI,GAAG,GAAG,GAAM,GACZ,IAAiB,IACjB,IAAO,UAAU;AAsBrB,EApBI,OAAO,KAAS,YAAY,KAAiB,OAAO,KACtD,IAAI,EAAK,GACT,IAAI,EAAK,GACT,IAAO,EAAK,MACR,UAAU,WAAW,MACvB,IAAQ,UAAU,IAClB,IAAiB,QAGnB,IAAI,GACJ,IAAI,UAAU,IACd,IAAO,UAAU,IACb,UAAU,SAAS,MACrB,IAAQ,UAAU,IAClB,IAAiB,MAIrB,IAAI,KAAK,GACT,IAAI,KAAK,GACJ,EAAE,YAAY,EAAK,KACtB,IAAO,KAAK;EAGd,IAAI,IAAI,EAAa,KAAK,aAAa,GAAG,GAAG,EAAK;AAClD,MAAI,EAAE,IAAI,KAAK,aAAa,EAAE,CAI5B,QAHI,MACF,KAAK,YAAY,KAAK,IAEjB;AAGT,MAAI,CAAC,EAAE,YAAY,EAAK,IAAI,CAAC,KAAK,cAChC,OAAU,MAAM,oDAAoD;AAQtE,EAHA,KAAK,QAAQ,EAAE,EACf,KAAK,QAAQ,EAAE,EAEf,KAAK,YAAY,KAAK,IAAiB,IAAQ,KAAK,oBAAoB,GAAG,GAAG,EAAK;EAEnF,IAAI,IAAU,EAAc,KAAK,aAAa,GAAG,GAAG,EAAK;AAYzD,SAVA,IAAI,EAAQ,GACZ,IAAI,EAAQ,GAEZ,OAAO,OAAO,EAAQ,EACtB,KAAK,UAAU,KAAK,GACpB,EAAqB,KAAK,OAAO,IAAI,EAAE,EACvC,EAAqB,KAAK,MAAM,IAAI,EAAE,EACtC,KAAK,IAAI,GAAG,KAAK,GACjB,KAAK,KAAK,GAAG,KAAK,GAClB,KAAK,cACE;IAGT,EAAM,UAAU,OAAO,SAAS,GAAG,GAAG,GAAM;EAC1C,IAAI,IAAK,UAAU,WAAW,IAC1B,EAAY,KAAK,aAAa,UAAU,GAAG,GAC3C,EAAa,KAAK,aAAa,GAAG,GAAG,EAAK;AAC9C,SAAO,KAAK,YAAY;IAG1B,EAAM,UAAU,UAAU,SAAS,GAAG,GAAG,GAAM;EAC7C,IAAI,IAAK,UAAU,WAAW,IAC1B,EAAY,KAAK,aAAa,UAAU,GAAG,GAC3C,EAAa,KAAK,aAAa,GAAG,GAAG,EAAK;AAC9C,SAAO,EAAE,IAAI,KAAK,aAAa,EAAE;IAGnC,EAAM,UAAU,aAAa,SAAS,GAAG,GAAG,GAAM;EAChD,IAAI,IAAK,UAAU,WAAW,IAC1B,EAAY,KAAK,aAAa,UAAU,GAAG,GAC3C,EAAa,KAAK,aAAa,GAAG,GAAG,EAAK,EAC1C,IAAO,KAAK,UAAU;AAY1B,SAXI,MACF,IAAI,EAAK,GACT,IAAI,EAAK,GACT,OAAO,KAAK,YAAY,IACxB,OAAO,KAAK,UAAU,IACtB,EAAuB,KAAK,OAAO,IAAI,EAAE,EACzC,EAAuB,KAAK,MAAM,IAAI,EAAE,EACxC,OAAO,KAAK,IAAI,GAAG,IACnB,OAAO,KAAK,KAAK,GAAG,IACpB,KAAK,eAEA;IAGT,EAAM,UAAU,UAAU,SAAS,GAAG,GAAG;EACvC,IAAI,IAAM,KAAK,IAAI;AACnB,MAAI,GAAK;GACP,IAAI,IAAQ,EAAE,OAAO,EAAI;AAIzB,UAHK,IAGE,EAAE,OAAO,GAAO,SAAS,GAAM;AAAE,WAAO,EAAK,MAAM;KAAK,GAFtD;;IAMb,EAAM,UAAU,WAAW,SAAS,GAAG,GAAG;EACxC,IAAI,IAAO,KAAK,KAAK;AACrB,MAAI,GAAM;GACR,IAAI,IAAQ,EAAE,OAAO,EAAK;AAI1B,UAHK,IAGE,EAAE,OAAO,GAAO,SAAS,GAAM;AAAE,WAAO,EAAK,MAAM;KAAK,GAFtD;;IAMb,EAAM,UAAU,YAAY,SAAS,GAAG,GAAG;EACzC,IAAI,IAAU,KAAK,QAAQ,GAAG,EAAE;AAChC,MAAI,EACF,QAAO,EAAQ,OAAO,KAAK,SAAS,GAAG,EAAE,CAAC;;CAI9C,SAAS,EAAqB,GAAK,GAAG;AACpC,EAAI,EAAI,KACN,EAAI,OAEJ,EAAI,KAAK;;CAIb,SAAS,EAAuB,GAAK,GAAG;AACtC,EAAK,EAAE,EAAI,MAAM,OAAO,EAAI;;CAG9B,SAAS,EAAa,GAAY,GAAI,GAAI,GAAM;EAC9C,IAAI,IAAI,KAAK,GACT,IAAI,KAAK;AACb,MAAI,CAAC,KAAc,IAAI,GAAG;GACxB,IAAI,IAAM;AAEV,GADA,IAAI,GACJ,IAAI;;AAEN,SAAO,IAAI,IAAiB,IAAI,KACpB,EAAE,YAAY,EAAK,GAAG,IAAoB;;CAGxD,SAAS,EAAc,GAAY,GAAI,GAAI,GAAM;EAC/C,IAAI,IAAI,KAAK,GACT,IAAI,KAAK;AACb,MAAI,CAAC,KAAc,IAAI,GAAG;GACxB,IAAI,IAAM;AAEV,GADA,IAAI,GACJ,IAAI;;EAEN,IAAI,IAAW;GAAK;GAAM;GAAG;AAI7B,SAHI,MACF,EAAQ,OAAO,IAEV;;CAGT,SAAS,EAAY,GAAY,GAAS;AACxC,SAAO,EAAa,GAAY,EAAQ,GAAG,EAAQ,GAAG,EAAQ,KAAK"}

package/dist/node_modules/graphlib/lib/index.js

@@ -0,0 +1,15 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+import { require_graph as t } from "./graph.js";
+import { require_version as n } from "./version.js";
+//#region node_modules/graphlib/lib/index.js
+var r = /* @__PURE__ */ e(((e, r) => {
+	r.exports = {
+		Graph: t(),
+		version: n()
+	};
+}));
+//#endregion
+export default r();
+export { r as require_lib };
+
+//# sourceMappingURL=index.js.map

package/dist/node_modules/graphlib/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../../../node_modules/graphlib/lib/index.js"],"sourcesContent":["// Includes only the \"core\" of graphlib\nmodule.exports = {\n  Graph: require(\"./graph\"),\n  version: require(\"./version\")\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;AACA,GAAO,UAAU;EACf,OAAA,GAAA;EACA,SAAA,GAAA;EACD"}

package/dist/node_modules/graphlib/lib/json.js

@@ -0,0 +1,55 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+import { require_lodash as t } from "./lodash.js";
+import { require_graph as n } from "./graph.js";
+//#region node_modules/graphlib/lib/json.js
+var r = /* @__PURE__ */ e(((e, r) => {
+	var i = t(), a = n();
+	r.exports = {
+		write: o,
+		read: l
+	};
+	function o(e) {
+		var t = {
+			options: {
+				directed: e.isDirected(),
+				multigraph: e.isMultigraph(),
+				compound: e.isCompound()
+			},
+			nodes: s(e),
+			edges: c(e)
+		};
+		return i.isUndefined(e.graph()) || (t.value = i.clone(e.graph())), t;
+	}
+	function s(e) {
+		return i.map(e.nodes(), function(t) {
+			var n = e.node(t), r = e.parent(t), a = { v: t };
+			return i.isUndefined(n) || (a.value = n), i.isUndefined(r) || (a.parent = r), a;
+		});
+	}
+	function c(e) {
+		return i.map(e.edges(), function(t) {
+			var n = e.edge(t), r = {
+				v: t.v,
+				w: t.w
+			};
+			return i.isUndefined(t.name) || (r.name = t.name), i.isUndefined(n) || (r.value = n), r;
+		});
+	}
+	function l(e) {
+		var t = new a(e.options).setGraph(e.value);
+		return i.each(e.nodes, function(e) {
+			t.setNode(e.v, e.value), e.parent && t.setParent(e.v, e.parent);
+		}), i.each(e.edges, function(e) {
+			t.setEdge({
+				v: e.v,
+				w: e.w,
+				name: e.name
+			}, e.value);
+		}), t;
+	}
+}));
+//#endregion
+export default r();
+export { r as require_json };
+
+//# sourceMappingURL=json.js.map

package/dist/node_modules/graphlib/lib/json.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json.js","names":[],"sources":["../../../../node_modules/graphlib/lib/json.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar Graph = require(\"./graph\");\n\nmodule.exports = {\n  write: write,\n  read: read\n};\n\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound()\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g)\n  };\n  if (!_.isUndefined(g.graph())) {\n    json.value = _.clone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function(v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (!_.isUndefined(nodeValue)) {\n      node.value = nodeValue;\n    }\n    if (!_.isUndefined(parent)) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return _.map(g.edges(), function(e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (!_.isUndefined(e.name)) {\n      edge.name = e.name;\n    }\n    if (!_.isUndefined(edgeValue)) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  _.each(json.nodes, function(entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  _.each(json.edges, function(entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;EACR;EACD;EACP;CAED,SAAS,EAAM,GAAG;EAChB,IAAI,IAAO;GACT,SAAS;IACP,UAAU,EAAE,YAAY;IACxB,YAAY,EAAE,cAAc;IAC5B,UAAU,EAAE,YAAY;IACzB;GACD,OAAO,EAAW,EAAE;GACpB,OAAO,EAAW,EAAE;GACrB;AAID,SAHK,EAAE,YAAY,EAAE,OAAO,CAAC,KAC3B,EAAK,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,GAE1B;;CAGT,SAAS,EAAW,GAAG;AACrB,SAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,GAAG;GAClC,IAAI,IAAY,EAAE,KAAK,EAAE,EACrB,IAAS,EAAE,OAAO,EAAE,EACpB,IAAO,EAAK,MAAG;AAOnB,UANK,EAAE,YAAY,EAAU,KAC3B,EAAK,QAAQ,IAEV,EAAE,YAAY,EAAO,KACxB,EAAK,SAAS,IAET;IACP;;CAGJ,SAAS,EAAW,GAAG;AACrB,SAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,GAAG;GAClC,IAAI,IAAY,EAAE,KAAK,EAAE,EACrB,IAAO;IAAE,GAAG,EAAE;IAAG,GAAG,EAAE;IAAG;AAO7B,UANK,EAAE,YAAY,EAAE,KAAK,KACxB,EAAK,OAAO,EAAE,OAEX,EAAE,YAAY,EAAU,KAC3B,EAAK,QAAQ,IAER;IACP;;CAGJ,SAAS,EAAK,GAAM;EAClB,IAAI,IAAI,IAAI,EAAM,EAAK,QAAQ,CAAC,SAAS,EAAK,MAAM;AAUpD,SATA,EAAE,KAAK,EAAK,OAAO,SAAS,GAAO;AAEjC,GADA,EAAE,QAAQ,EAAM,GAAG,EAAM,MAAM,EAC3B,EAAM,UACR,EAAE,UAAU,EAAM,GAAG,EAAM,OAAO;IAEpC,EACF,EAAE,KAAK,EAAK,OAAO,SAAS,GAAO;AACjC,KAAE,QAAQ;IAAE,GAAG,EAAM;IAAG,GAAG,EAAM;IAAG,MAAM,EAAM;IAAM,EAAE,EAAM,MAAM;IACpE,EACK"}

package/dist/node_modules/graphlib/lib/lodash.js

@@ -0,0 +1,47 @@
+import { __commonJSMin as e, __require as t } from "../../../_virtual/_rolldown/runtime.js";
+import { require_isArray as n } from "../../lodash/isArray.js";
+import { require_isFunction as r } from "../../lodash/isFunction.js";
+import { require_keys as i } from "../../lodash/keys.js";
+import { require_constant as a } from "../../lodash/constant.js";
+import { require_map as o } from "../../lodash/map.js";
+import { require_clone as s } from "../../lodash/clone.js";
+import { require_each as c } from "../../lodash/each.js";
+import { require_filter as l } from "../../lodash/filter.js";
+import { require_has as u } from "../../lodash/has.js";
+import { require_isEmpty as d } from "../../lodash/isEmpty.js";
+import { require_isUndefined as f } from "../../lodash/isUndefined.js";
+import { require_reduce as p } from "../../lodash/reduce.js";
+import { require_size as m } from "../../lodash/size.js";
+import { require_transform as h } from "../../lodash/transform.js";
+import { require_union as g } from "../../lodash/union.js";
+import { require_values as _ } from "../../lodash/values.js";
+//#region node_modules/graphlib/lib/lodash.js
+var v = /* @__PURE__ */ e(((e, v) => {
+	var y;
+	if (typeof t == "function") try {
+		y = {
+			clone: s(),
+			constant: a(),
+			each: c(),
+			filter: l(),
+			has: u(),
+			isArray: n(),
+			isEmpty: d(),
+			isFunction: r(),
+			isUndefined: f(),
+			keys: i(),
+			map: o(),
+			reduce: p(),
+			size: m(),
+			transform: h(),
+			union: g(),
+			values: _()
+		};
+	} catch {}
+	y ||= window._, v.exports = y;
+}));
+//#endregion
+export default v();
+export { v as require_lodash };
+
+//# sourceMappingURL=lodash.js.map

package/dist/node_modules/graphlib/lib/lodash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lodash.js","names":[],"sources":["../../../../node_modules/graphlib/lib/lodash.js"],"sourcesContent":["/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      clone: require(\"lodash/clone\"),\n      constant: require(\"lodash/constant\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      has:  require(\"lodash/has\"),\n      isArray: require(\"lodash/isArray\"),\n      isEmpty: require(\"lodash/isEmpty\"),\n      isFunction: require(\"lodash/isFunction\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      keys: require(\"lodash/keys\"),\n      map: require(\"lodash/map\"),\n      reduce: require(\"lodash/reduce\"),\n      size: require(\"lodash/size\"),\n      transform: require(\"lodash/transform\"),\n      union: require(\"lodash/union\"),\n      values: require(\"lodash/values\")\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;CAEA,IAAI;AAEJ,KAAI,OAAA,KAAmB,WACrB,KAAI;AACF,MAAS;GACP,OAAA,GAAA;GACA,UAAA,GAAA;GACA,MAAA,GAAA;GACA,QAAA,GAAA;GACA,KAAA,GAAA;GACA,SAAA,GAAA;GACA,SAAA,GAAA;GACA,YAAA,GAAA;GACA,aAAA,GAAA;GACA,MAAA,GAAA;GACA,KAAA,GAAA;GACA,QAAA,GAAA;GACA,MAAA,GAAA;GACA,WAAA,GAAA;GACA,OAAA,GAAA;GACA,QAAA,GAAA;GACD;SACS;AASd,CAJA,AACE,MAAS,OAAO,GAGlB,EAAO,UAAU"}

package/dist/node_modules/graphlib/lib/version.js

@@ -0,0 +1,10 @@
+import { __commonJSMin as e } from "../../../_virtual/_rolldown/runtime.js";
+//#region node_modules/graphlib/lib/version.js
+var t = /* @__PURE__ */ e(((e, t) => {
+	t.exports = "2.1.8";
+}));
+//#endregion
+export default t();
+export { t as require_version };
+
+//# sourceMappingURL=version.js.map

package/dist/node_modules/graphlib/lib/version.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"version.js","names":[],"sources":["../../../../node_modules/graphlib/lib/version.js"],"sourcesContent":["module.exports = '2.1.8';\n"],"x_google_ignoreList":[0],"mappings":";;;AAAA,GAAO,UAAU"}

package/dist/node_modules/lodash/_arrayEach.js

@@ -0,0 +1,14 @@
+import { __commonJSMin as e } from "../../_virtual/_rolldown/runtime.js";
+//#region node_modules/lodash/_arrayEach.js
+var t = /* @__PURE__ */ e(((e, t) => {
+	function n(e, t) {
+		for (var n = -1, r = e == null ? 0 : e.length; ++n < r && t(e[n], n, e) !== !1;);
+		return e;
+	}
+	t.exports = n;
+}));
+//#endregion
+export default t();
+export { t as require__arrayEach };
+
+//# sourceMappingURL=_arrayEach.js.map

package/dist/node_modules/lodash/_arrayEach.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_arrayEach.js","names":[],"sources":["../../../node_modules/lodash/_arrayEach.js"],"sourcesContent":["/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\nmodule.exports = arrayEach;\n"],"x_google_ignoreList":[0],"mappings":";;;CASA,SAAS,EAAU,GAAO,GAAU;AAIlC,OAHA,IAAI,IAAQ,IACR,IAAS,KAAS,OAAO,IAAI,EAAM,QAEhC,EAAE,IAAQ,KACX,EAAS,EAAM,IAAQ,GAAO,EAAM,KAAK;AAI/C,SAAO;;AAGT,GAAO,UAAU"}

package/dist/node_modules/lodash/_arrayReduce.js

@@ -0,0 +1,15 @@
+import { __commonJSMin as e } from "../../_virtual/_rolldown/runtime.js";
+//#region node_modules/lodash/_arrayReduce.js
+var t = /* @__PURE__ */ e(((e, t) => {
+	function n(e, t, n, r) {
+		var i = -1, a = e == null ? 0 : e.length;
+		for (r && a && (n = e[++i]); ++i < a;) n = t(n, e[i], i, e);
+		return n;
+	}
+	t.exports = n;
+}));
+//#endregion
+export default t();
+export { t as require__arrayReduce };
+
+//# sourceMappingURL=_arrayReduce.js.map

package/dist/node_modules/lodash/_arrayReduce.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_arrayReduce.js","names":[],"sources":["../../../node_modules/lodash/_arrayReduce.js"],"sourcesContent":["/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\nmodule.exports = arrayReduce;\n"],"x_google_ignoreList":[0],"mappings":";;;CAYA,SAAS,EAAY,GAAO,GAAU,GAAa,GAAW;EAC5D,IAAI,IAAQ,IACR,IAAS,KAAS,OAAO,IAAI,EAAM;AAKvC,OAHI,KAAa,MACf,IAAc,EAAM,EAAE,KAEjB,EAAE,IAAQ,GACf,KAAc,EAAS,GAAa,EAAM,IAAQ,GAAO,EAAM;AAEjE,SAAO;;AAGT,GAAO,UAAU"}

package/dist/node_modules/lodash/_asciiSize.js

@@ -0,0 +1,11 @@
+import { __commonJSMin as e } from "../../_virtual/_rolldown/runtime.js";
+import { require__baseProperty as t } from "./_baseProperty.js";
+//#region node_modules/lodash/_asciiSize.js
+var n = /* @__PURE__ */ e(((e, n) => {
+	n.exports = t()("length");
+}));
+//#endregion
+export default n();
+export { n as require__asciiSize };
+
+//# sourceMappingURL=_asciiSize.js.map

package/dist/node_modules/lodash/_asciiSize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_asciiSize.js","names":[],"sources":["../../../node_modules/lodash/_asciiSize.js"],"sourcesContent":["var baseProperty = require('./_baseProperty');\n\n/**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nvar asciiSize = baseProperty('length');\n\nmodule.exports = asciiSize;\n"],"x_google_ignoreList":[0],"mappings":";;;;AAWA,GAAO,UAFH,GAAA,CAAyB,SAAS"}

package/dist/node_modules/lodash/_assignMergeValue.js

@@ -0,0 +1,16 @@
+import { __commonJSMin as e } from "../../_virtual/_rolldown/runtime.js";
+import { require_eq as t } from "./eq.js";
+import { require__baseAssignValue as n } from "./_baseAssignValue.js";
+//#region node_modules/lodash/_assignMergeValue.js
+var r = /* @__PURE__ */ e(((e, r) => {
+	var i = n(), a = t();
+	function o(e, t, n) {
+		(n !== void 0 && !a(e[t], n) || n === void 0 && !(t in e)) && i(e, t, n);
+	}
+	r.exports = o;
+}));
+//#endregion
+export default r();
+export { r as require__assignMergeValue };
+
+//# sourceMappingURL=_assignMergeValue.js.map

package/dist/node_modules/lodash/_assignMergeValue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_assignMergeValue.js","names":[],"sources":["../../../node_modules/lodash/_assignMergeValue.js"],"sourcesContent":["var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignMergeValue(object, key, value) {\n  if ((value !== undefined && !eq(object[key], value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignMergeValue;\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;CAWJ,SAAS,EAAiB,GAAQ,GAAK,GAAO;AAC5C,GAAK,MAAU,KAAA,KAAa,CAAC,EAAG,EAAO,IAAM,EAAM,IAC9C,MAAU,KAAA,KAAa,EAAE,KAAO,OACnC,EAAgB,GAAQ,GAAK,EAAM;;AAIvC,GAAO,UAAU"}

package/dist/node_modules/lodash/_assignValue.js

@@ -0,0 +1,17 @@
+import { __commonJSMin as e } from "../../_virtual/_rolldown/runtime.js";
+import { require_eq as t } from "./eq.js";
+import { require__baseAssignValue as n } from "./_baseAssignValue.js";
+//#region node_modules/lodash/_assignValue.js
+var r = /* @__PURE__ */ e(((e, r) => {
+	var i = n(), a = t(), o = Object.prototype.hasOwnProperty;
+	function s(e, t, n) {
+		var r = e[t];
+		(!(o.call(e, t) && a(r, n)) || n === void 0 && !(t in e)) && i(e, t, n);
+	}
+	r.exports = s;
+}));
+//#endregion
+export default r();
+export { r as require__assignValue };
+
+//# sourceMappingURL=_assignValue.js.map

package/dist/node_modules/lodash/_assignValue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_assignValue.js","names":[],"sources":["../../../node_modules/lodash/_assignValue.js"],"sourcesContent":["var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignValue;\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EAMA,IAHc,OAAO,UAGQ;CAYjC,SAAS,EAAY,GAAQ,GAAK,GAAO;EACvC,IAAI,IAAW,EAAO;AACtB,GAAI,EAAE,EAAe,KAAK,GAAQ,EAAI,IAAI,EAAG,GAAU,EAAM,KACxD,MAAU,KAAA,KAAa,EAAE,KAAO,OACnC,EAAgB,GAAQ,GAAK,EAAM;;AAIvC,GAAO,UAAU"}

package/dist/node_modules/lodash/_baseAssign.js

@@ -0,0 +1,16 @@
+import { __commonJSMin as e } from "../../_virtual/_rolldown/runtime.js";
+import { require_keys as t } from "./keys.js";
+import { require__copyObject as n } from "./_copyObject.js";
+//#region node_modules/lodash/_baseAssign.js
+var r = /* @__PURE__ */ e(((e, r) => {
+	var i = n(), a = t();
+	function o(e, t) {
+		return e && i(t, a(t), e);
+	}
+	r.exports = o;
+}));
+//#endregion
+export default r();
+export { r as require__baseAssign };
+
+//# sourceMappingURL=_baseAssign.js.map

package/dist/node_modules/lodash/_baseAssign.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_baseAssign.js","names":[],"sources":["../../../node_modules/lodash/_baseAssign.js"],"sourcesContent":["var copyObject = require('./_copyObject'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n  return object && copyObject(source, keys(source), object);\n}\n\nmodule.exports = baseAssign;\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;CAWJ,SAAS,EAAW,GAAQ,GAAQ;AAClC,SAAO,KAAU,EAAW,GAAQ,EAAK,EAAO,EAAE,EAAO;;AAG3D,GAAO,UAAU"}

package/dist/node_modules/lodash/_baseAssignIn.js

@@ -0,0 +1,16 @@
+import { __commonJSMin as e } from "../../_virtual/_rolldown/runtime.js";
+import { require__copyObject as t } from "./_copyObject.js";
+import { require_keysIn as n } from "./keysIn.js";
+//#region node_modules/lodash/_baseAssignIn.js
+var r = /* @__PURE__ */ e(((e, r) => {
+	var i = t(), a = n();
+	function o(e, t) {
+		return e && i(t, a(t), e);
+	}
+	r.exports = o;
+}));
+//#endregion
+export default r();
+export { r as require__baseAssignIn };
+
+//# sourceMappingURL=_baseAssignIn.js.map

package/dist/node_modules/lodash/_baseAssignIn.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_baseAssignIn.js","names":[],"sources":["../../../node_modules/lodash/_baseAssignIn.js"],"sourcesContent":["var copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssignIn(object, source) {\n  return object && copyObject(source, keysIn(source), object);\n}\n\nmodule.exports = baseAssignIn;\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;CAWJ,SAAS,EAAa,GAAQ,GAAQ;AACpC,SAAO,KAAU,EAAW,GAAQ,EAAO,EAAO,EAAE,EAAO;;AAG7D,GAAO,UAAU"}