@loopstack/loopstack-studio 0.27.0 → 0.29.0

package/dist/node_modules/dagre-d3-es/src/dagre/greedy-fas.js

@@ -1,15 +1,15 @@
 import constant_default from "../../../lodash-es/constant.js";
-import map_default from "../../../lodash-es/map.js";
 import flatten_default from "../../../lodash-es/flatten.js";
 import forEach_default from "../../../lodash-es/forEach.js";
+import map_default from "../../../lodash-es/map.js";
 import range_default from "../../../lodash-es/range.js";
 import { Graph } from "../graphlib/graph.js";
 import "../graphlib/index.js";
 import { List } from "./data/list.js";
 var DEFAULT_WEIGHT_FN = constant_default(1);
-function greedyFAS(e, a) {
+function greedyFAS(e, i) {
 	if (e.nodeCount() <= 1) return [];
-	var o = buildState(e, a || DEFAULT_WEIGHT_FN);
+	var o = buildState(e, i || DEFAULT_WEIGHT_FN);
 	return flatten_default(map_default(doGreedyFAS(o.graph, o.buckets, o.zeroIdx), function(r) {
 		return e.outEdges(r.v, r.w);
 	}));
@@ -27,38 +27,38 @@ function doGreedyFAS(e, r, i) {
 	}
 	return a;
 }
-function removeNode(e, r, i, o, s) {
+function removeNode(e, r, a, o, s) {
 	var c = s ? [] : void 0;
-	return forEach_default(e.inEdges(o.v), function(a) {
-		var o = e.edge(a), l = e.node(a.v);
+	return forEach_default(e.inEdges(o.v), function(i) {
+		var o = e.edge(i), l = e.node(i.v);
 		s && c.push({
-			v: a.v,
-			w: a.w
-		}), l.out -= o, assignBucket(r, i, l);
-	}), forEach_default(e.outEdges(o.v), function(a) {
-		var o = e.edge(a), s = a.w, c = e.node(s);
-		c.in -= o, assignBucket(r, i, c);
+			v: i.v,
+			w: i.w
+		}), l.out -= o, assignBucket(r, a, l);
+	}), forEach_default(e.outEdges(o.v), function(i) {
+		var o = e.edge(i), s = i.w, c = e.node(s);
+		c.in -= o, assignBucket(r, a, c);
 	}), e.removeNode(o.v), c;
 }
 function buildState(e, r) {
-	var i = new Graph(), l = 0, u = 0;
+	var a = new Graph(), l = 0, u = 0;
 	forEach_default(e.nodes(), function(e) {
-		i.setNode(e, {
+		a.setNode(e, {
 			v: e,
 			in: 0,
 			out: 0
 		});
 	}), forEach_default(e.edges(), function(e) {
-		var a = i.edge(e.v, e.w) || 0, o = r(e), s = a + o;
-		i.setEdge(e.v, e.w, s), u = Math.max(u, i.node(e.v).out += o), l = Math.max(l, i.node(e.w).in += o);
+		var i = a.edge(e.v, e.w) || 0, o = r(e), s = i + o;
+		a.setEdge(e.v, e.w, s), u = Math.max(u, a.node(e.v).out += o), l = Math.max(l, a.node(e.w).in += o);
 	});
 	var d = range_default(u + l + 3).map(function() {
 		return new List();
 	}), f = l + 1;
-	return forEach_default(i.nodes(), function(e) {
-		assignBucket(d, f, i.node(e));
+	return forEach_default(a.nodes(), function(e) {
+		assignBucket(d, f, a.node(e));
 	}), {
-		graph: i,
+		graph: a,
 		buckets: d,
 		zeroIdx: f
 	};

package/dist/node_modules/dagre-d3-es/src/dagre/layout.js

@@ -1,9 +1,9 @@
-import merge_default from "../../../lodash-es/merge.js";
-import forEach_default from "../../../lodash-es/forEach.js";
 import defaults_default from "../../../lodash-es/defaults.js";
 import last_default from "../../../lodash-es/last.js";
+import forEach_default from "../../../lodash-es/forEach.js";
 import mapValues_default from "../../../lodash-es/mapValues.js";
 import max_default from "../../../lodash-es/max.js";
+import merge_default from "../../../lodash-es/merge.js";
 import pick_default from "../../../lodash-es/pick.js";
 import { Graph } from "../graphlib/graph.js";
 import "../graphlib/index.js";
@@ -27,14 +27,14 @@ function layout(g, G) {
 function runLayout(g, G) {
 	G("    makeSpaceForEdgeLabels", () => makeSpaceForEdgeLabels(g)), G("    removeSelfEdges", () => removeSelfEdges(g)), G("    acyclic", () => run(g)), G("    nestingGraph.run", () => run$2(g)), G("    rank", () => rank(asNonCompoundGraph(g))), G("    injectEdgeLabelProxies", () => injectEdgeLabelProxies(g)), G("    removeEmptyRanks", () => removeEmptyRanks(g)), G("    nestingGraph.cleanup", () => cleanup(g)), G("    normalizeRanks", () => normalizeRanks(g)), G("    assignRankMinMax", () => assignRankMinMax(g)), G("    removeEdgeLabelProxies", () => removeEdgeLabelProxies(g)), G("    normalize.run", () => run$1(g)), G("    parentDummyChains", () => parentDummyChains(g)), G("    addBorderSegments", () => addBorderSegments(g)), G("    order", () => order(g)), G("    insertSelfEdges", () => insertSelfEdges(g)), G("    adjustCoordinateSystem", () => adjust(g)), G("    position", () => position(g)), G("    positionSelfEdges", () => positionSelfEdges(g)), G("    removeBorderNodes", () => removeBorderNodes(g)), G("    normalize.undo", () => undo$2(g)), G("    fixupEdgeLabelCoords", () => fixupEdgeLabelCoords(g)), G("    undoCoordinateSystem", () => undo$1(g)), G("    translateGraph", () => translateGraph(g)), G("    assignNodeIntersects", () => assignNodeIntersects(g)), G("    reversePoints", () => reversePointsForReversedEdges(g)), G("    acyclic.undo", () => undo(g));
 }
-function updateInputGraph(g, K) {
-	forEach_default(g.nodes(), function(G) {
-		var q = g.node(G), J = K.node(G);
-		q && (q.x = J.x, q.y = J.y, K.children(G).length && (q.width = J.width, q.height = J.height));
-	}), forEach_default(g.edges(), function(G) {
-		var q = g.edge(G), J = K.edge(G);
+function updateInputGraph(g, G) {
+	forEach_default(g.nodes(), function(K) {
+		var q = g.node(K), J = G.node(K);
+		q && (q.x = J.x, q.y = J.y, G.children(K).length && (q.width = J.width, q.height = J.height));
+	}), forEach_default(g.edges(), function(K) {
+		var q = g.edge(K), J = G.edge(K);
 		q.points = J.points, Object.prototype.hasOwnProperty.call(J, "x") && (q.x = J.x, q.y = J.y);
-	}), g.graph().width = K.graph().width, g.graph().height = K.graph().height;
+	}), g.graph().width = G.graph().width, g.graph().height = G.graph().height;
 }
 var graphNumAttrs = [
 	"nodesep",
@@ -69,24 +69,24 @@ var graphNumAttrs = [
 	labeloffset: 10,
 	labelpos: "r"
 }, edgeAttrs = ["labelpos"];
-function buildLayoutGraph(q) {
-	var J = new Graph({
+function buildLayoutGraph(G) {
+	var q = new Graph({
 		multigraph: !0,
 		compound: !0
-	}), Y = canonicalize(q.graph());
-	return J.setGraph(merge_default({}, graphDefaults, selectNumberAttrs(Y, graphNumAttrs), pick_default(Y, graphAttrs))), forEach_default(q.nodes(), function(g) {
-		var G = canonicalize(q.node(g));
-		J.setNode(g, defaults_default(selectNumberAttrs(G, nodeNumAttrs), nodeDefaults)), J.setParent(g, q.parent(g));
-	}), forEach_default(q.edges(), function(G) {
-		var K = canonicalize(q.edge(G));
-		J.setEdge(G, merge_default({}, edgeDefaults, selectNumberAttrs(K, edgeNumAttrs), pick_default(K, edgeAttrs)));
-	}), J;
+	}), J = canonicalize(G.graph());
+	return q.setGraph(merge_default({}, graphDefaults, selectNumberAttrs(J, graphNumAttrs), pick_default(J, graphAttrs))), forEach_default(G.nodes(), function(K) {
+		var J = canonicalize(G.node(K));
+		q.setNode(K, defaults_default(selectNumberAttrs(J, nodeNumAttrs), nodeDefaults)), q.setParent(K, G.parent(K));
+	}), forEach_default(G.edges(), function(g) {
+		var K = canonicalize(G.edge(g));
+		q.setEdge(g, merge_default({}, edgeDefaults, selectNumberAttrs(K, edgeNumAttrs), pick_default(K, edgeAttrs)));
+	}), q;
 }
 function makeSpaceForEdgeLabels(g) {
-	var K = g.graph();
-	K.ranksep /= 2, forEach_default(g.edges(), function(G) {
-		var q = g.edge(G);
-		q.minlen *= 2, q.labelpos.toLowerCase() !== "c" && (K.rankdir === "TB" || K.rankdir === "BT" ? q.width += q.labeloffset : q.height += q.labeloffset);
+	var G = g.graph();
+	G.ranksep /= 2, forEach_default(g.edges(), function(K) {
+		var q = g.edge(K);
+		q.minlen *= 2, q.labelpos.toLowerCase() !== "c" && (G.rankdir === "TB" || G.rankdir === "BT" ? q.width += q.labeloffset : q.height += q.labeloffset);
 	});
 }
 function injectEdgeLabelProxies(g) {
@@ -102,11 +102,11 @@ function injectEdgeLabelProxies(g) {
 	});
 }
 function assignRankMinMax(g) {
-	var K = 0;
-	forEach_default(g.nodes(), function(G) {
-		var q = g.node(G);
-		q.borderTop && (q.minRank = g.node(q.borderTop).rank, q.maxRank = g.node(q.borderBottom).rank, K = max_default(K, q.maxRank));
-	}), g.graph().maxRank = K;
+	var G = 0;
+	forEach_default(g.nodes(), function(K) {
+		var q = g.node(K);
+		q.borderTop && (q.minRank = g.node(q.borderTop).rank, q.maxRank = g.node(q.borderBottom).rank, G = max_default(G, q.maxRank));
+	}), g.graph().maxRank = G;
 }
 function removeEdgeLabelProxies(g) {
 	forEach_default(g.nodes(), function(G) {
@@ -115,25 +115,25 @@ function removeEdgeLabelProxies(g) {
 	});
 }
 function translateGraph(g) {
-	var K = Infinity, q = 0, J = Infinity, Y = 0, X = g.graph(), Z = X.marginx || 0, Q = X.marginy || 0;
+	var G = Infinity, q = 0, J = Infinity, Y = 0, X = g.graph(), Z = X.marginx || 0, Q = X.marginy || 0;
 	function $(g) {
-		var G = g.x, X = g.y, Z = g.width, Q = g.height;
-		K = Math.min(K, G - Z / 2), q = Math.max(q, G + Z / 2), J = Math.min(J, X - Q / 2), Y = Math.max(Y, X + Q / 2);
+		var K = g.x, X = g.y, Z = g.width, Q = g.height;
+		G = Math.min(G, K - Z / 2), q = Math.max(q, K + Z / 2), J = Math.min(J, X - Q / 2), Y = Math.max(Y, X + Q / 2);
 	}
 	forEach_default(g.nodes(), function(G) {
 		$(g.node(G));
 	}), forEach_default(g.edges(), function(G) {
 		var K = g.edge(G);
 		Object.prototype.hasOwnProperty.call(K, "x") && $(K);
-	}), K -= Z, J -= Q, forEach_default(g.nodes(), function(G) {
-		var q = g.node(G);
-		q.x -= K, q.y -= J;
+	}), G -= Z, J -= Q, forEach_default(g.nodes(), function(K) {
+		var q = g.node(K);
+		q.x -= G, q.y -= J;
 	}), forEach_default(g.edges(), function(q) {
 		var Y = g.edge(q);
 		forEach_default(Y.points, function(g) {
-			g.x -= K, g.y -= J;
-		}), Object.prototype.hasOwnProperty.call(Y, "x") && (Y.x -= K), Object.prototype.hasOwnProperty.call(Y, "y") && (Y.y -= J);
-	}), X.width = q - K + Z, X.height = Y - J + Q;
+			g.x -= G, g.y -= J;
+		}), Object.prototype.hasOwnProperty.call(Y, "x") && (Y.x -= G), Object.prototype.hasOwnProperty.call(Y, "y") && (Y.y -= J);
+	}), X.width = q - G + Z, X.height = Y - J + Q;
 }
 function assignNodeIntersects(g) {
 	forEach_default(g.edges(), function(G) {
@@ -161,10 +161,10 @@ function reversePointsForReversedEdges(g) {
 	});
 }
 function removeBorderNodes(g) {
-	forEach_default(g.nodes(), function(G) {
-		if (g.children(G).length) {
-			var K = g.node(G), J = g.node(K.borderTop), Y = g.node(K.borderBottom), X = g.node(last_default(K.borderLeft)), Z = g.node(last_default(K.borderRight));
-			K.width = Math.abs(Z.x - X.x), K.height = Math.abs(Y.y - J.y), K.x = X.x + K.width / 2, K.y = J.y + K.height / 2;
+	forEach_default(g.nodes(), function(K) {
+		if (g.children(K).length) {
+			var q = g.node(K), J = g.node(q.borderTop), Y = g.node(q.borderBottom), X = g.node(last_default(q.borderLeft)), Z = g.node(last_default(q.borderRight));
+			q.width = Math.abs(Z.x - X.x), q.height = Math.abs(Y.y - J.y), q.x = X.x + q.width / 2, q.y = J.y + q.height / 2;
 		}
 	}), forEach_default(g.nodes(), function(G) {
 		g.node(G).dummy === "border" && g.removeNode(G);
@@ -182,10 +182,10 @@ function removeSelfEdges(g) {
 	});
 }
 function insertSelfEdges(g) {
-	forEach_default(buildLayerMatrix(g), function(K) {
+	forEach_default(buildLayerMatrix(g), function(G) {
 		var q = 0;
-		forEach_default(K, function(K, J) {
-			var Y = g.node(K);
+		forEach_default(G, function(G, J) {
+			var Y = g.node(G);
 			Y.order = J + q, forEach_default(Y.selfEdges, function(G) {
 				addDummyNode(g, "selfedge", {
 					width: G.label.width,
@@ -233,9 +233,9 @@ function selectNumberAttrs(g, G) {
 	return mapValues_default(pick_default(g, G), Number);
 }
 function canonicalize(g) {
-	var K = {};
-	return forEach_default(g, function(g, G) {
-		K[G.toLowerCase()] = g;
-	}), K;
+	var G = {};
+	return forEach_default(g, function(g, K) {
+		G[K.toLowerCase()] = g;
+	}), G;
 }
 export { layout };

package/dist/node_modules/dagre-d3-es/src/dagre/nesting-graph.js

@@ -1,17 +1,17 @@
 import forEach_default from "../../../lodash-es/forEach.js";
-import reduce_default from "../../../lodash-es/reduce.js";
 import values_default from "../../../lodash-es/values.js";
 import max_default from "../../../lodash-es/max.js";
+import reduce_default from "../../../lodash-es/reduce.js";
 import { addBorderNode, addDummyNode } from "./util.js";
-function run(n) {
-	var a = addDummyNode(n, "root", {}, "_root"), s = treeDepths(n), u = max_default(values_default(s)) - 1, d = 2 * u + 1;
-	n.graph().nestingRoot = a, forEach_default(n.edges(), function(e) {
-		n.edge(e).minlen *= d;
+function run(i) {
+	var a = addDummyNode(i, "root", {}, "_root"), s = treeDepths(i), u = max_default(values_default(s)) - 1, d = 2 * u + 1;
+	i.graph().nestingRoot = a, forEach_default(i.edges(), function(e) {
+		i.edge(e).minlen *= d;
 	});
-	var f = sumWeights(n) + 1;
-	forEach_default(n.children(), function(e) {
-		dfs(n, a, d, f, u, s, e);
-	}), n.graph().nodeRankFactor = d;
+	var f = sumWeights(i) + 1;
+	forEach_default(i.children(), function(e) {
+		dfs(i, a, d, f, u, s, e);
+	}), i.graph().nodeRankFactor = d;
 }
 function dfs(n, r, i, o, s, c, l) {
 	var u = n.children(l);

package/dist/node_modules/dagre-d3-es/src/dagre/order/cross-count.js

@@ -1,6 +1,6 @@
-import map_default from "../../../../lodash-es/map.js";
 import flatten_default from "../../../../lodash-es/flatten.js";
 import forEach_default from "../../../../lodash-es/forEach.js";
+import map_default from "../../../../lodash-es/map.js";
 import sortBy_default from "../../../../lodash-es/sortBy.js";
 import zipObject_default from "../../../../lodash-es/zipObject.js";
 function crossCount(e, n) {
@@ -10,8 +10,8 @@ function crossCount(e, n) {
 function twoLayerCrossCount(a, o, s) {
 	for (var c = zipObject_default(s, map_default(s, function(e, n) {
 		return n;
-	})), l = flatten_default(map_default(o, function(n) {
-		return sortBy_default(map_default(a.outEdges(n), function(e) {
+	})), l = flatten_default(map_default(o, function(e) {
+		return sortBy_default(map_default(a.outEdges(e), function(e) {
 			return {
 				pos: c[e.w],
 				weight: a.edge(e).weight

package/dist/node_modules/dagre-d3-es/src/dagre/order/index.js

@@ -1,6 +1,6 @@
-import map_default from "../../../../lodash-es/map.js";
-import forEach_default from "../../../../lodash-es/forEach.js";
 import cloneDeep_default from "../../../../lodash-es/cloneDeep.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
+import map_default from "../../../../lodash-es/map.js";
 import range_default from "../../../../lodash-es/range.js";
 import { Graph } from "../../graphlib/graph.js";
 import "../../graphlib/index.js";
@@ -10,19 +10,19 @@ import { buildLayerGraph } from "./build-layer-graph.js";
 import { crossCount } from "./cross-count.js";
 import { initOrder } from "./init-order.js";
 import { sortSubgraph } from "./sort-subgraph.js";
-function order(e) {
-	var s = maxRank(e), u = buildLayerGraphs(e, range_default(1, s + 1), "inEdges"), f = buildLayerGraphs(e, range_default(s - 1, -1, -1), "outEdges"), p = initOrder(e);
-	assignOrder(e, p);
+function order(s) {
+	var c = maxRank(s), u = buildLayerGraphs(s, range_default(1, c + 1), "inEdges"), f = buildLayerGraphs(s, range_default(c - 1, -1, -1), "outEdges"), p = initOrder(s);
+	assignOrder(s, p);
 	for (var m = Infinity, h, g = 0, _ = 0; _ < 4; ++g, ++_) {
-		sweepLayerGraphs(g % 2 ? u : f, g % 4 >= 2), p = buildLayerMatrix(e);
-		var v = crossCount(e, p);
+		sweepLayerGraphs(g % 2 ? u : f, g % 4 >= 2), p = buildLayerMatrix(s);
+		var v = crossCount(s, p);
 		v < m && (_ = 0, h = cloneDeep_default(p), m = v);
 	}
-	assignOrder(e, h);
+	assignOrder(s, h);
 }
-function buildLayerGraphs(s, c, l) {
-	return map_default(c, function(e) {
-		return buildLayerGraph(s, e, l);
+function buildLayerGraphs(e, s, l) {
+	return map_default(s, function(s) {
+		return buildLayerGraph(e, s, l);
 	});
 }
 function sweepLayerGraphs(e, c) {

package/dist/node_modules/dagre-d3-es/src/dagre/order/init-order.js

@@ -1,6 +1,6 @@
-import map_default from "../../../../lodash-es/map.js";
-import filter_default from "../../../../lodash-es/filter.js";
 import forEach_default from "../../../../lodash-es/forEach.js";
+import filter_default from "../../../../lodash-es/filter.js";
+import map_default from "../../../../lodash-es/map.js";
 import has_default from "../../../../lodash-es/has.js";
 import max_default from "../../../../lodash-es/max.js";
 import range_default from "../../../../lodash-es/range.js";
@@ -13,8 +13,8 @@ function initOrder(s) {
 	})) + 1), function() {
 		return [];
 	});
-	function d(e) {
-		has_default(c, e) || (c[e] = !0, u[s.node(e).rank].push(e), forEach_default(s.successors(e), d));
+	function d(o) {
+		has_default(c, o) || (c[o] = !0, u[s.node(o).rank].push(o), forEach_default(s.successors(o), d));
 	}
 	return forEach_default(sortBy_default(l, function(e) {
 		return s.node(e).rank;

package/dist/node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js

@@ -1,11 +1,11 @@
-import map_default from "../../../../lodash-es/map.js";
-import filter_default from "../../../../lodash-es/filter.js";
 import forEach_default from "../../../../lodash-es/forEach.js";
+import filter_default from "../../../../lodash-es/filter.js";
+import map_default from "../../../../lodash-es/map.js";
 import isUndefined_default from "../../../../lodash-es/isUndefined.js";
 import pick_default from "../../../../lodash-es/pick.js";
-function resolveConflicts(e, a) {
+function resolveConflicts(r, a) {
 	var o = {};
-	return forEach_default(e, function(e, n) {
+	return forEach_default(r, function(e, n) {
 		var r = o[e.v] = {
 			indegree: 0,
 			in: [],

package/dist/node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js

@@ -1,6 +1,6 @@
-import filter_default from "../../../../lodash-es/filter.js";
 import flatten_default from "../../../../lodash-es/flatten.js";
 import forEach_default from "../../../../lodash-es/forEach.js";
+import filter_default from "../../../../lodash-es/filter.js";
 import isUndefined_default from "../../../../lodash-es/isUndefined.js";
 import { barycenter } from "./barycenter.js";
 import { resolveConflicts } from "./resolve-conflicts.js";
@@ -13,8 +13,8 @@ function sortSubgraph(l, u, d, f) {
 	var v = barycenter(l, p);
 	forEach_default(v, function(e) {
 		if (l.children(e.v).length) {
-			var c = sortSubgraph(l, e.v, d, f);
-			_[e.v] = c, Object.prototype.hasOwnProperty.call(c, "barycenter") && mergeBarycenters(e, c);
+			var s = sortSubgraph(l, e.v, d, f);
+			_[e.v] = s, Object.prototype.hasOwnProperty.call(s, "barycenter") && mergeBarycenters(e, s);
 		}
 	});
 	var y = resolveConflicts(v, d);
@@ -30,14 +30,14 @@ function sortSubgraph(l, u, d, f) {
 	}
 	return b;
 }
-function expandSubgraphs(e, l) {
-	forEach_default(e, function(e) {
-		e.vs = flatten_default(e.vs.map(function(e) {
+function expandSubgraphs(c, l) {
+	forEach_default(c, function(s) {
+		s.vs = flatten_default(s.vs.map(function(e) {
 			return l[e] ? l[e].vs : e;
 		}));
 	});
 }
-function mergeBarycenters(e, c) {
-	isUndefined_default(e.barycenter) ? (e.barycenter = c.barycenter, e.weight = c.weight) : (e.barycenter = (e.barycenter * e.weight + c.barycenter * c.weight) / (e.weight + c.weight), e.weight += c.weight);
+function mergeBarycenters(e, s) {
+	isUndefined_default(e.barycenter) ? (e.barycenter = s.barycenter, e.weight = s.weight) : (e.barycenter = (e.barycenter * e.weight + s.barycenter * s.weight) / (e.weight + s.weight), e.weight += s.weight);
 }
 export { sortSubgraph };

package/dist/node_modules/dagre-d3-es/src/dagre/order/sort.js

@@ -1,10 +1,10 @@
 import flatten_default from "../../../../lodash-es/flatten.js";
-import forEach_default from "../../../../lodash-es/forEach.js";
 import last_default from "../../../../lodash-es/last.js";
+import forEach_default from "../../../../lodash-es/forEach.js";
 import sortBy_default from "../../../../lodash-es/sortBy.js";
 import { partition } from "../util.js";
-function sort(i, s) {
-	var c = partition(i, function(e) {
+function sort(r, s) {
+	var c = partition(r, function(e) {
 		return Object.prototype.hasOwnProperty.call(e, "barycenter");
 	}), l = c.lhs, u = sortBy_default(c.rhs, function(e) {
 		return -e.i;
@@ -15,8 +15,8 @@ function sort(i, s) {
 	var h = { vs: flatten_default(d) };
 	return p && (h.barycenter = f / p, h.weight = p), h;
 }
-function consumeUnsortable(e, r, a) {
-	for (var o; r.length && (o = last_default(r)).i <= a;) r.pop(), e.push(o.vs), a++;
+function consumeUnsortable(e, i, a) {
+	for (var o; i.length && (o = last_default(i)).i <= a;) i.pop(), e.push(o.vs), a++;
 	return a;
 }
 function compareWithBias(e) {