@windrun-huaiin/third-ui 13.0.1 → 13.1.0

package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/selection.js

@@ -1,5 +1,7 @@
 'use strict';
 
+Object.defineProperty(exports, '__esModule', { value: true });
+
 var index = require('../../../../../d3-selection@3.0.0/node_modules/d3-selection/src/selection/index.js');
 
 var Selection = index.default.prototype.constructor;
@@ -8,4 +10,4 @@ function transition_selection() {
   return new Selection(this._groups, this._parents);
 }
 
-module.exports = transition_selection;
+exports.default = transition_selection;

package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/style.js

@@ -1,5 +1,7 @@
 'use strict';
 
+Object.defineProperty(exports, '__esModule', { value: true });
+
 var schedule = require('./schedule.js');
 var tween = require('./tween.js');
 var interpolate = require('./interpolate.js');
@@ -69,7 +71,7 @@ function styleMaybeRemove(id, name) {
 }
 
 function transition_style(name, value, priority) {
-  var i = (name += "") === "transform" ? index.interpolateTransformCss : interpolate;
+  var i = (name += "") === "transform" ? index.interpolateTransformCss : interpolate.default;
   return value == null ? this
       .styleTween(name, styleNull(name, i))
       .on("end.style." + name, styleRemove(name))
@@ -81,4 +83,4 @@ function transition_style(name, value, priority) {
       .on("end.style." + name, null);
 }
 
-module.exports = transition_style;
+exports.default = transition_style;

package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/styleTween.js

@@ -1,5 +1,7 @@
 'use strict';
 
+Object.defineProperty(exports, '__esModule', { value: true });
+
 function styleInterpolate(name, i, priority) {
   return function(t) {
     this.style.setProperty(name, i.call(this, t), priority);
@@ -25,4 +27,4 @@ function transition_styleTween(name, value, priority) {
   return this.tween(key, styleTween(name, value, priority == null ? "" : priority));
 }
 
-module.exports = transition_styleTween;
+exports.default = transition_styleTween;

package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/text.js

@@ -1,5 +1,7 @@
 'use strict';
 
+Object.defineProperty(exports, '__esModule', { value: true });
+
 var tween = require('./tween.js');
 
 function textConstant(value) {
@@ -21,4 +23,4 @@ function transition_text(value) {
       : textConstant(value == null ? "" : value + ""));
 }
 
-module.exports = transition_text;
+exports.default = transition_text;

package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/textTween.js

@@ -1,5 +1,7 @@
 'use strict';
 
+Object.defineProperty(exports, '__esModule', { value: true });
+
 function textInterpolate(i) {
   return function(t) {
     this.textContent = i.call(this, t);
@@ -25,4 +27,4 @@ function transition_textTween(value) {
   return this.tween(key, textTween(value));
 }
 
-module.exports = transition_textTween;
+exports.default = transition_textTween;

package/dist/node_modules/.pnpm/d3-transition@3.0.1_d3-selection@3.0.0/node_modules/d3-transition/src/transition/transition.js

@@ -1,5 +1,7 @@
 'use strict';
 
+Object.defineProperty(exports, '__esModule', { value: true });
+
 var index = require('./index.js');
 var schedule = require('./schedule.js');
 
@@ -25,4 +27,4 @@ function transition_transition() {
   return new index.Transition(groups, this._parents, name, id1);
 }
 
-module.exports = transition_transition;
+exports.default = transition_transition;

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/acyclic.js

@@ -6,12 +6,12 @@ var uniqueId = require('../../../../../lodash-es@4.17.23/node_modules/lodash-es/
 
 function run(g) {
   var fas = g.graph().acyclicer === 'greedy' ? greedyFas.greedyFAS(g, weightFn(g)) : dfsFAS(g);
-  forEach(fas, function (e) {
+  forEach.default(fas, function (e) {
     var label = g.edge(e);
     g.removeEdge(e);
     label.forwardName = e.name;
     label.reversed = true;
-    g.setEdge(e.w, e.v, label, uniqueId('rev'));
+    g.setEdge(e.w, e.v, label, uniqueId.default('rev'));
   });
 
   function weightFn(g) {
@@ -32,7 +32,7 @@ function dfsFAS(g) {
     }
     visited[v] = true;
     stack[v] = true;
-    forEach(g.outEdges(v), function (e) {
+    forEach.default(g.outEdges(v), function (e) {
       if (Object.prototype.hasOwnProperty.call(stack, e.w)) {
         fas.push(e);
       } else {
@@ -42,12 +42,12 @@ function dfsFAS(g) {
     delete stack[v];
   }
 
-  forEach(g.nodes(), dfs);
+  forEach.default(g.nodes(), dfs);
   return fas;
 }
 
 function undo(g) {
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var label = g.edge(e);
     if (label.reversed) {
       g.removeEdge(e);

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/add-border-segments.js

@@ -8,7 +8,7 @@ function addBorderSegments(g) {
     var children = g.children(v);
     var node = g.node(v);
     if (children.length) {
-      forEach(children, dfs);
+      forEach.default(children, dfs);
     }
 
     if (Object.prototype.hasOwnProperty.call(node, 'minRank')) {
@@ -21,7 +21,7 @@ function addBorderSegments(g) {
     }
   }
 
-  forEach(g.children(), dfs);
+  forEach.default(g.children(), dfs);
 }
 
 function addBorderNode(g, prop, prefix, sg, sgNode, rank) {

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/coordinate-system.js

@@ -22,10 +22,10 @@ function undo(g) {
 }
 
 function swapWidthHeight(g) {
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     swapWidthHeightOne(g.node(v));
   });
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     swapWidthHeightOne(g.edge(e));
   });
 }
@@ -37,13 +37,13 @@ function swapWidthHeightOne(attrs) {
 }
 
 function reverseY(g) {
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     reverseYOne(g.node(v));
   });
 
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
-    forEach(edge.points, reverseYOne);
+    forEach.default(edge.points, reverseYOne);
     if (Object.prototype.hasOwnProperty.call(edge, 'y')) {
       reverseYOne(edge);
     }
@@ -55,13 +55,13 @@ function reverseYOne(attrs) {
 }
 
 function swapXY(g) {
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     swapXYOne(g.node(v));
   });
 
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
-    forEach(edge.points, swapXYOne);
+    forEach.default(edge.points, swapXYOne);
     if (Object.prototype.hasOwnProperty.call(edge, 'x')) {
       swapXYOne(edge);
     }

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

@@ -8,7 +8,7 @@ var forEach = require('../../../../../lodash-es@4.17.23/node_modules/lodash-es/f
 var range = require('../../../../../lodash-es@4.17.23/node_modules/lodash-es/range.js');
 var constant = require('../../../../../lodash-es@4.17.23/node_modules/lodash-es/constant.js');
 
-var DEFAULT_WEIGHT_FN = constant(1);
+var DEFAULT_WEIGHT_FN = constant.default(1);
 
 function greedyFAS(g, weightFn) {
   if (g.nodeCount() <= 1) {
@@ -18,8 +18,8 @@ function greedyFAS(g, weightFn) {
   var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
 
   // Expand multi-edges
-  return flatten(
-    map(results, function (e) {
+  return flatten.default(
+    map.default(results, function (e) {
       return g.outEdges(e.v, e.w);
     }),
   );
@@ -55,7 +55,7 @@ function doGreedyFAS(g, buckets, zeroIdx) {
 function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
   var results = collectPredecessors ? [] : undefined;
 
-  forEach(g.inEdges(entry.v), function (edge) {
+  forEach.default(g.inEdges(entry.v), function (edge) {
     var weight = g.edge(edge);
     var uEntry = g.node(edge.v);
 
@@ -67,7 +67,7 @@ function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
     assignBucket(buckets, zeroIdx, uEntry);
   });
 
-  forEach(g.outEdges(entry.v), function (edge) {
+  forEach.default(g.outEdges(entry.v), function (edge) {
     var weight = g.edge(edge);
     var w = edge.w;
     var wEntry = g.node(w);
@@ -85,13 +85,13 @@ function buildState(g, weightFn) {
   var maxIn = 0;
   var maxOut = 0;
 
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     fasGraph.setNode(v, { v: v, in: 0, out: 0 });
   });
 
   // Aggregate weights on nodes, but also sum the weights across multi-edges
   // into a single edge for the fasGraph.
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var prevWeight = fasGraph.edge(e.v, e.w) || 0;
     var weight = weightFn(e);
     var edgeWeight = prevWeight + weight;
@@ -100,12 +100,12 @@ function buildState(g, weightFn) {
     maxIn = Math.max(maxIn, (fasGraph.node(e.w)['in'] += weight));
   });
 
-  var buckets = range(maxOut + maxIn + 3).map(function () {
+  var buckets = range.default(maxOut + maxIn + 3).map(function () {
     return new list.List();
   });
   var zeroIdx = maxIn + 1;
 
-  forEach(fasGraph.nodes(), function (v) {
+  forEach.default(fasGraph.nodes(), function (v) {
     assignBucket(buckets, zeroIdx, fasGraph.node(v));
   });
 

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

@@ -65,7 +65,7 @@ function runLayout(g, time) {
  * attributes can influence layout.
  */
 function updateInputGraph(inputGraph, layoutGraph) {
-  forEach(inputGraph.nodes(), function (v) {
+  forEach.default(inputGraph.nodes(), function (v) {
     var inputLabel = inputGraph.node(v);
     var layoutLabel = layoutGraph.node(v);
 
@@ -80,7 +80,7 @@ function updateInputGraph(inputGraph, layoutGraph) {
     }
   });
 
-  forEach(inputGraph.edges(), function (e) {
+  forEach.default(inputGraph.edges(), function (e) {
     var inputLabel = inputGraph.edge(e);
     var layoutLabel = layoutGraph.edge(e);
 
@@ -122,20 +122,20 @@ function buildLayoutGraph(inputGraph) {
   var graph$1 = canonicalize(inputGraph.graph());
 
   g.setGraph(
-    merge({}, graphDefaults, selectNumberAttrs(graph$1, graphNumAttrs), pick(graph$1, graphAttrs)),
+    merge.default({}, graphDefaults, selectNumberAttrs(graph$1, graphNumAttrs), pick.default(graph$1, graphAttrs)),
   );
 
-  forEach(inputGraph.nodes(), function (v) {
+  forEach.default(inputGraph.nodes(), function (v) {
     var node = canonicalize(inputGraph.node(v));
-    g.setNode(v, defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));
+    g.setNode(v, defaults.default(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));
     g.setParent(v, inputGraph.parent(v));
   });
 
-  forEach(inputGraph.edges(), function (e) {
+  forEach.default(inputGraph.edges(), function (e) {
     var edge = canonicalize(inputGraph.edge(e));
     g.setEdge(
       e,
-      merge({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pick(edge, edgeAttrs)),
+      merge.default({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pick.default(edge, edgeAttrs)),
     );
   });
 
@@ -153,7 +153,7 @@ function buildLayoutGraph(inputGraph) {
 function makeSpaceForEdgeLabels(g) {
   var graph = g.graph();
   graph.ranksep /= 2;
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
     edge.minlen *= 2;
     if (edge.labelpos.toLowerCase() !== 'c') {
@@ -173,7 +173,7 @@ function makeSpaceForEdgeLabels(g) {
  * label's position.
  */
 function injectEdgeLabelProxies(g) {
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
     if (edge.width && edge.height) {
       var v = g.node(e.v);
@@ -186,20 +186,20 @@ function injectEdgeLabelProxies(g) {
 
 function assignRankMinMax(g) {
   var maxRank = 0;
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     var node = g.node(v);
     if (node.borderTop) {
       node.minRank = g.node(node.borderTop).rank;
       node.maxRank = g.node(node.borderBottom).rank;
       // @ts-expect-error
-      maxRank = max(maxRank, node.maxRank);
+      maxRank = max.default(maxRank, node.maxRank);
     }
   });
   g.graph().maxRank = maxRank;
 }
 
 function removeEdgeLabelProxies(g) {
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     var node = g.node(v);
     if (node.dummy === 'edge-proxy') {
       g.edge(node.e).labelRank = node.rank;
@@ -228,10 +228,10 @@ function translateGraph(g) {
     maxY = Math.max(maxY, y + h / 2);
   }
 
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     getExtremes(g.node(v));
   });
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
     if (Object.prototype.hasOwnProperty.call(edge, 'x')) {
       getExtremes(edge);
@@ -241,15 +241,15 @@ function translateGraph(g) {
   minX -= marginX;
   minY -= marginY;
 
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     var node = g.node(v);
     node.x -= minX;
     node.y -= minY;
   });
 
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
-    forEach(edge.points, function (p) {
+    forEach.default(edge.points, function (p) {
       p.x -= minX;
       p.y -= minY;
     });
@@ -266,7 +266,7 @@ function translateGraph(g) {
 }
 
 function assignNodeIntersects(g) {
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
     var nodeV = g.node(e.v);
     var nodeW = g.node(e.w);
@@ -285,7 +285,7 @@ function assignNodeIntersects(g) {
 }
 
 function fixupEdgeLabelCoords(g) {
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
     if (Object.prototype.hasOwnProperty.call(edge, 'x')) {
       if (edge.labelpos === 'l' || edge.labelpos === 'r') {
@@ -304,7 +304,7 @@ function fixupEdgeLabelCoords(g) {
 }
 
 function reversePointsForReversedEdges(g) {
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
     if (edge.reversed) {
       edge.points.reverse();
@@ -313,13 +313,13 @@ function reversePointsForReversedEdges(g) {
 }
 
 function removeBorderNodes(g) {
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     if (g.children(v).length) {
       var node = g.node(v);
       var t = g.node(node.borderTop);
       var b = g.node(node.borderBottom);
-      var l = g.node(last(node.borderLeft));
-      var r = g.node(last(node.borderRight));
+      var l = g.node(last.default(node.borderLeft));
+      var r = g.node(last.default(node.borderRight));
 
       node.width = Math.abs(r.x - l.x);
       node.height = Math.abs(b.y - t.y);
@@ -328,7 +328,7 @@ function removeBorderNodes(g) {
     }
   });
 
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     if (g.node(v).dummy === 'border') {
       g.removeNode(v);
     }
@@ -336,7 +336,7 @@ function removeBorderNodes(g) {
 }
 
 function removeSelfEdges(g) {
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     if (e.v === e.w) {
       var node = g.node(e.v);
       if (!node.selfEdges) {
@@ -350,12 +350,12 @@ function removeSelfEdges(g) {
 
 function insertSelfEdges(g) {
   var layers = util.buildLayerMatrix(g);
-  forEach(layers, function (layer) {
+  forEach.default(layers, function (layer) {
     var orderShift = 0;
-    forEach(layer, function (v, i) {
+    forEach.default(layer, function (v, i) {
       var node = g.node(v);
       node.order = i + orderShift;
-      forEach(node.selfEdges, function (selfEdge) {
+      forEach.default(node.selfEdges, function (selfEdge) {
         util.addDummyNode(
           g,
           'selfedge',
@@ -376,7 +376,7 @@ function insertSelfEdges(g) {
 }
 
 function positionSelfEdges(g) {
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     var node = g.node(v);
     if (node.dummy === 'selfedge') {
       var selfNode = g.node(node.e.v);
@@ -400,12 +400,12 @@ function positionSelfEdges(g) {
 }
 
 function selectNumberAttrs(obj, attrs) {
-  return mapValues(pick(obj, attrs), Number);
+  return mapValues.default(pick.default(obj, attrs), Number);
 }
 
 function canonicalize(attrs) {
   var newAttrs = {};
-  forEach(attrs, function (v, k) {
+  forEach.default(attrs, function (v, k) {
     newAttrs[k.toLowerCase()] = v;
   });
   return newAttrs;

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

@@ -32,13 +32,13 @@ var reduce = require('../../../../../lodash-es@4.17.23/node_modules/lodash-es/re
 function run(g) {
   var root = util.addDummyNode(g, 'root', {}, '_root');
   var depths = treeDepths(g);
-  var height = max(values(depths)) - 1; // Note: depths is an Object not an array
+  var height = max.default(values.default(depths)) - 1; // Note: depths is an Object not an array
   var nodeSep = 2 * height + 1;
 
   g.graph().nestingRoot = root;
 
   // Multiply minlen by nodeSep to align nodes on non-border ranks.
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     g.edge(e).minlen *= nodeSep;
   });
 
@@ -46,7 +46,7 @@ function run(g) {
   var weight = sumWeights(g) + 1;
 
   // Create border nodes and link them up
-  forEach(g.children(), function (child) {
+  forEach.default(g.children(), function (child) {
     dfs(g, root, nodeSep, weight, height, depths, child);
   });
 
@@ -73,7 +73,7 @@ function dfs(g, root, nodeSep, weight, height, depths, v) {
   g.setParent(bottom, v);
   label.borderBottom = bottom;
 
-  forEach(children, function (child) {
+  forEach.default(children, function (child) {
     dfs(g, root, nodeSep, weight, height, depths, child);
 
     var childNode = g.node(child);
@@ -105,20 +105,20 @@ function treeDepths(g) {
   function dfs(v, depth) {
     var children = g.children(v);
     if (children && children.length) {
-      forEach(children, function (child) {
+      forEach.default(children, function (child) {
         dfs(child, depth + 1);
       });
     }
     depths[v] = depth;
   }
-  forEach(g.children(), function (v) {
+  forEach.default(g.children(), function (v) {
     dfs(v, 1);
   });
   return depths;
 }
 
 function sumWeights(g) {
-  return reduce(
+  return reduce.default(
     g.edges(),
     function (acc, e) {
       return acc + g.edge(e).weight;
@@ -131,7 +131,7 @@ function cleanup(g) {
   var graphLabel = g.graph();
   g.removeNode(graphLabel.nestingRoot);
   delete graphLabel.nestingRoot;
-  forEach(g.edges(), function (e) {
+  forEach.default(g.edges(), function (e) {
     var edge = g.edge(e);
     if (edge.nestingEdge) {
       g.removeEdge(e);

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/normalize.js

@@ -27,7 +27,7 @@ var forEach = require('../../../../../lodash-es@4.17.23/node_modules/lodash-es/f
  */
 function run(g) {
   g.graph().dummyChains = [];
-  forEach(g.edges(), function (edge) {
+  forEach.default(g.edges(), function (edge) {
     normalizeEdge(g, edge);
   });
 }
@@ -89,7 +89,7 @@ function normalizeEdge(g, e) {
 }
 
 function undo(g) {
-  forEach(g.graph().dummyChains, function (v) {
+  forEach.default(g.graph().dummyChains, function (v) {
     var node = g.node(v);
     var origLabel = node.edgeLabel;
     var w;

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js

@@ -6,7 +6,7 @@ function addSubgraphConstraints(g, cg, vs) {
   var prev = {},
     rootPrev;
 
-  forEach(vs, function (v) {
+  forEach.default(vs, function (v) {
     var child = g.parent(v),
       parent,
       prevChild;

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/order/barycenter.js

@@ -4,12 +4,12 @@ var map = require('../../../../../../lodash-es@4.17.23/node_modules/lodash-es/ma
 var reduce = require('../../../../../../lodash-es@4.17.23/node_modules/lodash-es/reduce.js');
 
 function barycenter(g, movable) {
-  return map(movable, function (v) {
+  return map.default(movable, function (v) {
     var inV = g.inEdges(v);
     if (!inV.length) {
       return { v: v };
     } else {
-      var result = reduce(
+      var result = reduce.default(
         inV,
         function (acc, e) {
           var edge = g.edge(e),

package/dist/node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js

@@ -43,7 +43,7 @@ function buildLayerGraph(g, rank, relationship) {
         return g.node(v);
       });
 
-  forEach(g.nodes(), function (v) {
+  forEach.default(g.nodes(), function (v) {
     var node = g.node(v),
       parent = g.parent(v);
 
@@ -52,10 +52,10 @@ function buildLayerGraph(g, rank, relationship) {
       result.setParent(v, parent || root);
 
       // This assumes we have only short edges!
-      forEach(g[relationship](v), function (e) {
+      forEach.default(g[relationship](v), function (e) {
         var u = e.v === v ? e.w : e.v,
           edge = result.edge(u, v),
-          weight = !isUndefined(edge) ? edge.weight : 0;
+          weight = !isUndefined.default(edge) ? edge.weight : 0;
         result.setEdge(u, v, { weight: g.edge(e).weight + weight });
       });
 
@@ -73,7 +73,7 @@ function buildLayerGraph(g, rank, relationship) {
 
 function createRootNode(g) {
   var v;
-  while (g.hasNode((v = uniqueId('_root'))));
+  while (g.hasNode((v = uniqueId.default('_root'))));
   return v;
 }
 

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

@@ -34,16 +34,16 @@ function twoLayerCrossCount(g, northLayer, southLayer) {
   // Sort all of the edges between the north and south layers by their position
   // in the north layer and then the south. Map these edges to the position of
   // their head in the south layer.
-  var southPos = zipObject(
+  var southPos = zipObject.default(
     southLayer,
-    map(southLayer, function (v, i) {
+    map.default(southLayer, function (v, i) {
       return i;
     }),
   );
-  var southEntries = flatten(
-    map(northLayer, function (v) {
-      return sortBy(
-        map(g.outEdges(v), function (e) {
+  var southEntries = flatten.default(
+    map.default(northLayer, function (v) {
+      return sortBy.default(
+        map.default(g.outEdges(v), function (e) {
           return { pos: southPos[e.w], weight: g.edge(e).weight };
         }),
         'pos',
@@ -56,13 +56,13 @@ function twoLayerCrossCount(g, northLayer, southLayer) {
   while (firstIndex < southLayer.length) firstIndex <<= 1;
   var treeSize = 2 * firstIndex - 1;
   firstIndex -= 1;
-  var tree = map(new Array(treeSize), function () {
+  var tree = map.default(new Array(treeSize), function () {
     return 0;
   });
 
   // Calculate the weighted crossings
   var cc = 0;
-  forEach(
+  forEach.default(
     // @ts-expect-error
     southEntries.forEach(function (entry) {
       var index = entry.pos + firstIndex;