"use strict";
/*
 * ATTENTION: The "eval" devtool has been used (maybe by default in mode: "development").
 * This devtool is neither made for production nor for readable output files.
 * It uses "eval()" calls to create a separate source file in the browser devtools.
 * If you are trying to read the output file, select a different devtool (https://webpack.js.org/configuration/devtool/)
 * or disable the default devtool with "devtool: false".
 * If you are looking for production-ready output files, see mode: "production" (https://webpack.js.org/configuration/mode/).
 */
(self["webpackChunk_JUPYTERLAB_CORE_OUTPUT"] = self["webpackChunk_JUPYTERLAB_CORE_OUTPUT"] || []).push([["vendors-node_modules_dagre-d3-es_src_dagre_index_js"],{

/***/ "../node_modules/dagre-d3-es/src/dagre/acyclic.js":
/*!********************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/acyclic.js ***!
  \********************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   run: () => (/* binding */ run),\n/* harmony export */   undo: () => (/* binding */ undo)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/uniqueId.js\");\n/* harmony import */ var _greedy_fas_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./greedy-fas.js */ \"../node_modules/dagre-d3-es/src/dagre/greedy-fas.js\");\n\n\n\n\n\nfunction run(g) {\n  var fas = g.graph().acyclicer === 'greedy' ? (0,_greedy_fas_js__WEBPACK_IMPORTED_MODULE_0__.greedyFAS)(g, weightFn(g)) : dfsFAS(g);\n  lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](fas, function (e) {\n    var label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"]('rev'));\n  });\n\n  function weightFn(g) {\n    return function (e) {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  var fas = [];\n  var stack = {};\n  var visited = {};\n\n  function dfs(v) {\n    if (Object.prototype.hasOwnProperty.call(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g.outEdges(v), function (e) {\n      if (Object.prototype.hasOwnProperty.call(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g.nodes(), dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g.edges(), function (e) {\n    var label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      var forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/acyclic.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/add-border-segments.js":
/*!********************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/add-border-segments.js ***!
  \********************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   addBorderSegments: () => (/* binding */ addBorderSegments)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./util.js */ \"../node_modules/dagre-d3-es/src/dagre/util.js\");\n\n\n\n\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    var children = g.children(v);\n    var node = g.node(v);\n    if (children.length) {\n      lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](children, dfs);\n    }\n\n    if (Object.prototype.hasOwnProperty.call(node, 'minRank')) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (var rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++rank) {\n        addBorderNode(g, 'borderLeft', '_bl', v, node, rank);\n        addBorderNode(g, 'borderRight', '_br', v, node, rank);\n      }\n    }\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  var label = { width: 0, height: 0, rank: rank, borderType: prop };\n  var prev = sgNode[prop][rank - 1];\n  var curr = _util_js__WEBPACK_IMPORTED_MODULE_0__.addDummyNode(g, 'border', label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/add-border-segments.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/coordinate-system.js":
/*!******************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/coordinate-system.js ***!
  \******************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   adjust: () => (/* binding */ adjust),\n/* harmony export */   undo: () => (/* binding */ undo)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n\n\n\n\nfunction adjust(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === 'lr' || rankDir === 'rl') {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === 'bt' || rankDir === 'rl') {\n    reverseY(g);\n  }\n\n  if (rankDir === 'lr' || rankDir === 'rl') {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.nodes(), function (v) {\n    swapWidthHeightOne(g.node(v));\n  });\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.edges(), function (e) {\n    swapWidthHeightOne(g.edge(e));\n  });\n}\n\nfunction swapWidthHeightOne(attrs) {\n  var w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.nodes(), function (v) {\n    reverseYOne(g.node(v));\n  });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](edge.points, reverseYOne);\n    if (Object.prototype.hasOwnProperty.call(edge, 'y')) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.nodes(), function (v) {\n    swapXYOne(g.node(v));\n  });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](edge.points, swapXYOne);\n    if (Object.prototype.hasOwnProperty.call(edge, 'x')) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  var x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/coordinate-system.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/data/list.js":
/*!**********************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/data/list.js ***!
  \**********************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   List: () => (/* binding */ List)\n/* harmony export */ });\n/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\n\n\nclass List {\n  constructor() {\n    var sentinel = {};\n    sentinel._next = sentinel._prev = sentinel;\n    this._sentinel = sentinel;\n  }\n  dequeue() {\n    var sentinel = this._sentinel;\n    var entry = sentinel._prev;\n    if (entry !== sentinel) {\n      unlink(entry);\n      return entry;\n    }\n  }\n  enqueue(entry) {\n    var sentinel = this._sentinel;\n    if (entry._prev && entry._next) {\n      unlink(entry);\n    }\n    entry._next = sentinel._next;\n    sentinel._next._prev = entry;\n    sentinel._next = entry;\n    entry._prev = sentinel;\n  }\n  toString() {\n    var strs = [];\n    var sentinel = this._sentinel;\n    var curr = sentinel._prev;\n    while (curr !== sentinel) {\n      strs.push(JSON.stringify(curr, filterOutLinks));\n      curr = curr._prev;\n    }\n    return '[' + strs.join(', ') + ']';\n  }\n}\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== '_next' && k !== '_prev') {\n    return v;\n  }\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/data/list.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/greedy-fas.js":
/*!***********************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/greedy-fas.js ***!
  \***********************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   greedyFAS: () => (/* binding */ greedyFAS)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/constant.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/flatten.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/range.js\");\n/* harmony import */ var _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../graphlib/index.js */ \"../node_modules/dagre-d3-es/src/graphlib/index.js\");\n/* harmony import */ var _data_list_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./data/list.js */ \"../node_modules/dagre-d3-es/src/dagre/data/list.js\");\n\n\n\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\n\n\nvar DEFAULT_WEIGHT_FN = lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](1);\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](\n    lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](results, function (e) {\n      return g.outEdges(e.v, e.w);\n    }),\n  );\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  var results = [];\n  var sources = buckets[buckets.length - 1];\n  var sinks = buckets[0];\n\n  var entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue())) {\n      removeNode(g, buckets, zeroIdx, entry);\n    }\n    while ((entry = sources.dequeue())) {\n      removeNode(g, buckets, zeroIdx, entry);\n    }\n    if (g.nodeCount()) {\n      for (var i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  var results = collectPredecessors ? [] : undefined;\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](g.inEdges(entry.v), function (edge) {\n    var weight = g.edge(edge);\n    var uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](g.outEdges(entry.v), function (edge) {\n    var weight = g.edge(edge);\n    var w = edge.w;\n    var wEntry = g.node(w);\n    wEntry['in'] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  var fasGraph = new _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__.Graph();\n  var maxIn = 0;\n  var maxOut = 0;\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](g.nodes(), function (v) {\n    fasGraph.setNode(v, { v: v, in: 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](g.edges(), function (e) {\n    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    var weight = weightFn(e);\n    var edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, (fasGraph.node(e.v).out += weight));\n    maxIn = Math.max(maxIn, (fasGraph.node(e.w)['in'] += weight));\n  });\n\n  var buckets = lodash_es__WEBPACK_IMPORTED_MODULE_6__[\"default\"](maxOut + maxIn + 3).map(function () {\n    return new _data_list_js__WEBPACK_IMPORTED_MODULE_1__.List();\n  });\n  var zeroIdx = maxIn + 1;\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](fasGraph.nodes(), function (v) {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry['in']) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry['in'] + zeroIdx].enqueue(entry);\n  }\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/greedy-fas.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/index.js":
/*!******************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/index.js ***!
  \******************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   acyclic: () => (/* reexport module object */ _acyclic_js__WEBPACK_IMPORTED_MODULE_0__),\n/* harmony export */   layout: () => (/* reexport safe */ _layout_js__WEBPACK_IMPORTED_MODULE_1__.layout),\n/* harmony export */   normalize: () => (/* reexport module object */ _normalize_js__WEBPACK_IMPORTED_MODULE_2__),\n/* harmony export */   rank: () => (/* reexport safe */ _rank_index_js__WEBPACK_IMPORTED_MODULE_3__.rank)\n/* harmony export */ });\n/* harmony import */ var _acyclic_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./acyclic.js */ \"../node_modules/dagre-d3-es/src/dagre/acyclic.js\");\n/* harmony import */ var _layout_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./layout.js */ \"../node_modules/dagre-d3-es/src/dagre/layout.js\");\n/* harmony import */ var _normalize_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./normalize.js */ \"../node_modules/dagre-d3-es/src/dagre/normalize.js\");\n/* harmony import */ var _rank_index_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./rank/index.js */ \"../node_modules/dagre-d3-es/src/dagre/rank/index.js\");\n\n\n\n\n\n\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/index.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/layout.js":
/*!*******************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/layout.js ***!
  \*******************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   layout: () => (/* binding */ layout)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/merge.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/pick.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/defaults.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/max.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/last.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/mapValues.js\");\n/* harmony import */ var _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../graphlib/index.js */ \"../node_modules/dagre-d3-es/src/graphlib/index.js\");\n/* harmony import */ var _add_border_segments_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./add-border-segments.js */ \"../node_modules/dagre-d3-es/src/dagre/add-border-segments.js\");\n/* harmony import */ var _coordinate_system_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./coordinate-system.js */ \"../node_modules/dagre-d3-es/src/dagre/coordinate-system.js\");\n/* harmony import */ var _acyclic_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./acyclic.js */ \"../node_modules/dagre-d3-es/src/dagre/acyclic.js\");\n/* harmony import */ var _normalize_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./normalize.js */ \"../node_modules/dagre-d3-es/src/dagre/normalize.js\");\n/* harmony import */ var _rank_index_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./rank/index.js */ \"../node_modules/dagre-d3-es/src/dagre/rank/index.js\");\n/* harmony import */ var _nesting_graph_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./nesting-graph.js */ \"../node_modules/dagre-d3-es/src/dagre/nesting-graph.js\");\n/* harmony import */ var _order_index_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./order/index.js */ \"../node_modules/dagre-d3-es/src/dagre/order/index.js\");\n/* harmony import */ var _parent_dummy_chains_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./parent-dummy-chains.js */ \"../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js\");\n/* harmony import */ var _position_index_js__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./position/index.js */ \"../node_modules/dagre-d3-es/src/dagre/position/index.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./util.js */ \"../node_modules/dagre-d3-es/src/dagre/util.js\");\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nfunction layout(g, opts) {\n  var time = opts && opts.debugTiming ? _util_js__WEBPACK_IMPORTED_MODULE_10__.time : _util_js__WEBPACK_IMPORTED_MODULE_10__.notime;\n  time('layout', () => {\n    var layoutGraph = time('  buildLayoutGraph', () => buildLayoutGraph(g));\n    time('  runLayout', () => runLayout(layoutGraph, time));\n    time('  updateInputGraph', () => updateInputGraph(g, layoutGraph));\n  });\n}\n\nfunction runLayout(g, time) {\n  time('    makeSpaceForEdgeLabels', () => makeSpaceForEdgeLabels(g));\n  time('    removeSelfEdges', () => removeSelfEdges(g));\n  time('    acyclic', () => _acyclic_js__WEBPACK_IMPORTED_MODULE_3__.run(g));\n  time('    nestingGraph.run', () => _nesting_graph_js__WEBPACK_IMPORTED_MODULE_6__.run(g));\n  time('    rank', () => (0,_rank_index_js__WEBPACK_IMPORTED_MODULE_5__.rank)(_util_js__WEBPACK_IMPORTED_MODULE_10__.asNonCompoundGraph(g)));\n  time('    injectEdgeLabelProxies', () => injectEdgeLabelProxies(g));\n  time('    removeEmptyRanks', () => _util_js__WEBPACK_IMPORTED_MODULE_10__.removeEmptyRanks(g));\n  time('    nestingGraph.cleanup', () => _nesting_graph_js__WEBPACK_IMPORTED_MODULE_6__.cleanup(g));\n  time('    normalizeRanks', () => _util_js__WEBPACK_IMPORTED_MODULE_10__.normalizeRanks(g));\n  time('    assignRankMinMax', () => assignRankMinMax(g));\n  time('    removeEdgeLabelProxies', () => removeEdgeLabelProxies(g));\n  time('    normalize.run', () => _normalize_js__WEBPACK_IMPORTED_MODULE_4__.run(g));\n  time('    parentDummyChains', () => (0,_parent_dummy_chains_js__WEBPACK_IMPORTED_MODULE_8__.parentDummyChains)(g));\n  time('    addBorderSegments', () => (0,_add_border_segments_js__WEBPACK_IMPORTED_MODULE_1__.addBorderSegments)(g));\n  time('    order', () => (0,_order_index_js__WEBPACK_IMPORTED_MODULE_7__.order)(g));\n  time('    insertSelfEdges', () => insertSelfEdges(g));\n  time('    adjustCoordinateSystem', () => _coordinate_system_js__WEBPACK_IMPORTED_MODULE_2__.adjust(g));\n  time('    position', () => (0,_position_index_js__WEBPACK_IMPORTED_MODULE_9__.position)(g));\n  time('    positionSelfEdges', () => positionSelfEdges(g));\n  time('    removeBorderNodes', () => removeBorderNodes(g));\n  time('    normalize.undo', () => _normalize_js__WEBPACK_IMPORTED_MODULE_4__.undo(g));\n  time('    fixupEdgeLabelCoords', () => fixupEdgeLabelCoords(g));\n  time('    undoCoordinateSystem', () => _coordinate_system_js__WEBPACK_IMPORTED_MODULE_2__.undo(g));\n  time('    translateGraph', () => translateGraph(g));\n  time('    assignNodeIntersects', () => assignNodeIntersects(g));\n  time('    reversePoints', () => reversePointsForReversedEdges(g));\n  time('    acyclic.undo', () => _acyclic_js__WEBPACK_IMPORTED_MODULE_3__.undo(g));\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](inputGraph.nodes(), function (v) {\n    var inputLabel = inputGraph.node(v);\n    var layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](inputGraph.edges(), function (e) {\n    var inputLabel = inputGraph.edge(e);\n    var layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (Object.prototype.hasOwnProperty.call(layoutLabel, 'x')) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = ['nodesep', 'edgesep', 'ranksep', 'marginx', 'marginy'];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: 'tb' };\nvar graphAttrs = ['acyclicer', 'ranker', 'rankdir', 'align'];\nvar nodeNumAttrs = ['width', 'height'];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = ['minlen', 'weight', 'width', 'height', 'labeloffset'];\nvar edgeDefaults = {\n  minlen: 1,\n  weight: 1,\n  width: 0,\n  height: 0,\n  labeloffset: 10,\n  labelpos: 'r',\n};\nvar edgeAttrs = ['labelpos'];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  var g = new _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__.Graph({ multigraph: true, compound: true });\n  var graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(\n    lodash_es__WEBPACK_IMPORTED_MODULE_12__[\"default\"]({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), lodash_es__WEBPACK_IMPORTED_MODULE_13__[\"default\"](graph, graphAttrs)),\n  );\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](inputGraph.nodes(), function (v) {\n    var node = canonicalize(inputGraph.node(v));\n    g.setNode(v, lodash_es__WEBPACK_IMPORTED_MODULE_14__[\"default\"](selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](inputGraph.edges(), function (e) {\n    var edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(\n      e,\n      lodash_es__WEBPACK_IMPORTED_MODULE_12__[\"default\"]({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), lodash_es__WEBPACK_IMPORTED_MODULE_13__[\"default\"](edge, edgeAttrs)),\n    );\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  var graph = g.graph();\n  graph.ranksep /= 2;\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== 'c') {\n      if (graph.rankdir === 'TB' || graph.rankdir === 'BT') {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (edge.width && edge.height) {\n      var v = g.node(e.v);\n      var w = g.node(e.w);\n      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      _util_js__WEBPACK_IMPORTED_MODULE_10__.addDummyNode(g, 'edge-proxy', label, '_ep');\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  var maxRank = 0;\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.nodes(), function (v) {\n    var node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      // @ts-expect-error\n      maxRank = lodash_es__WEBPACK_IMPORTED_MODULE_15__[\"default\"](maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.nodes(), function (v) {\n    var node = g.node(v);\n    if (node.dummy === 'edge-proxy') {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  var minX = Number.POSITIVE_INFINITY;\n  var maxX = 0;\n  var minY = Number.POSITIVE_INFINITY;\n  var maxY = 0;\n  var graphLabel = g.graph();\n  var marginX = graphLabel.marginx || 0;\n  var marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    var x = attrs.x;\n    var y = attrs.y;\n    var w = attrs.width;\n    var h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.nodes(), function (v) {\n    getExtremes(g.node(v));\n  });\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (Object.prototype.hasOwnProperty.call(edge, 'x')) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.nodes(), function (v) {\n    var node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](edge.points, function (p) {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (Object.prototype.hasOwnProperty.call(edge, 'x')) {\n      edge.x -= minX;\n    }\n    if (Object.prototype.hasOwnProperty.call(edge, 'y')) {\n      edge.y -= minY;\n    }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    var nodeV = g.node(e.v);\n    var nodeW = g.node(e.w);\n    var p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(_util_js__WEBPACK_IMPORTED_MODULE_10__.intersectRect(nodeV, p1));\n    edge.points.push(_util_js__WEBPACK_IMPORTED_MODULE_10__.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (Object.prototype.hasOwnProperty.call(edge, 'x')) {\n      if (edge.labelpos === 'l' || edge.labelpos === 'r') {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n        case 'l':\n          edge.x -= edge.width / 2 + edge.labeloffset;\n          break;\n        case 'r':\n          edge.x += edge.width / 2 + edge.labeloffset;\n          break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.nodes(), function (v) {\n    if (g.children(v).length) {\n      var node = g.node(v);\n      var t = g.node(node.borderTop);\n      var b = g.node(node.borderBottom);\n      var l = g.node(lodash_es__WEBPACK_IMPORTED_MODULE_16__[\"default\"](node.borderLeft));\n      var r = g.node(lodash_es__WEBPACK_IMPORTED_MODULE_16__[\"default\"](node.borderRight));\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.nodes(), function (v) {\n    if (g.node(v).dummy === 'border') {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.edges(), function (e) {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = _util_js__WEBPACK_IMPORTED_MODULE_10__.buildLayerMatrix(g);\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](layers, function (layer) {\n    var orderShift = 0;\n    lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](layer, function (v, i) {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](node.selfEdges, function (selfEdge) {\n        _util_js__WEBPACK_IMPORTED_MODULE_10__.addDummyNode(\n          g,\n          'selfedge',\n          {\n            width: selfEdge.label.width,\n            height: selfEdge.label.height,\n            rank: node.rank,\n            order: i + ++orderShift,\n            e: selfEdge.e,\n            label: selfEdge.label,\n          },\n          '_se',\n        );\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](g.nodes(), function (v) {\n    var node = g.node(v);\n    if (node.dummy === 'selfedge') {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + (2 * dx) / 3, y: y - dy },\n        { x: x + (5 * dx) / 6, y: y - dy },\n        { x: x + dx, y: y },\n        { x: x + (5 * dx) / 6, y: y + dy },\n        { x: x + (2 * dx) / 3, y: y + dy },\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_17__[\"default\"](lodash_es__WEBPACK_IMPORTED_MODULE_13__[\"default\"](obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](attrs, function (v, k) {\n    newAttrs[k.toLowerCase()] = v;\n  });\n  return newAttrs;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/layout.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/nesting-graph.js":
/*!**************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/nesting-graph.js ***!
  \**************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   cleanup: () => (/* binding */ cleanup),\n/* harmony export */   run: () => (/* binding */ run)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/max.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/values.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/reduce.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./util.js */ \"../node_modules/dagre-d3-es/src/dagre/util.js\");\n\n\n\n\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  var root = _util_js__WEBPACK_IMPORTED_MODULE_0__.addDummyNode(g, 'root', {}, '_root');\n  var depths = treeDepths(g);\n  var height = lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](depths)) - 1; // Note: depths is an Object not an array\n  var nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.edges(), function (e) {\n    g.edge(e).minlen *= nodeSep;\n  });\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  var weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.children(), function (child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n  });\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  var children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  var top = _util_js__WEBPACK_IMPORTED_MODULE_0__.addBorderNode(g, '_bt');\n  var bottom = _util_js__WEBPACK_IMPORTED_MODULE_0__.addBorderNode(g, '_bb');\n  var label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](children, function (child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    var childNode = g.node(child);\n    var childTop = childNode.borderTop ? childNode.borderTop : child;\n    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true,\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true,\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](children, function (child) {\n        dfs(child, depth + 1);\n      });\n    }\n    depths[v] = depth;\n  }\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.children(), function (v) {\n    dfs(v, 1);\n  });\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](\n    g.edges(),\n    function (acc, e) {\n      return acc + g.edge(e).weight;\n    },\n    0,\n  );\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/nesting-graph.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/normalize.js":
/*!**********************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/normalize.js ***!
  \**********************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   run: () => (/* binding */ run),\n/* harmony export */   undo: () => (/* binding */ undo)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./util.js */ \"../node_modules/dagre-d3-es/src/dagre/util.js\");\n/**\n * TypeScript type imports:\n *\n * @import { Graph } from '../graphlib/graph.js';\n */\n\n\n\n\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g.edges(), function (edge) {\n    normalizeEdge(g, edge);\n  });\n}\n\n/**\n * @param {Graph} g\n */\nfunction normalizeEdge(g, e) {\n  var v = e.v;\n  var vRank = g.node(v).rank;\n  var w = e.w;\n  var wRank = g.node(w).rank;\n  var name = e.name;\n  var edgeLabel = g.edge(e);\n  var labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  /**\n   * @typedef {Object} Attrs\n   * @property {number} width\n   * @property {number} height\n   * @property {ReturnType<Graph[\"node\"]>} edgeLabel\n   * @property {any} edgeObj\n   * @property {ReturnType<Graph[\"node\"]>[\"rank\"]} rank\n   * @property {string} [dummy]\n   * @property {ReturnType<Graph[\"node\"]>[\"labelpos\"]} [labelpos]\n   */\n\n  /** @type {Attrs | undefined} */\n  var attrs = undefined;\n  var dummy, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0,\n      height: 0,\n      edgeLabel: edgeLabel,\n      edgeObj: e,\n      rank: vRank,\n    };\n    dummy = _util_js__WEBPACK_IMPORTED_MODULE_0__.addDummyNode(g, 'edge', attrs, '_d');\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = 'edge-label';\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g.graph().dummyChains, function (v) {\n    var node = g.node(v);\n    var origLabel = node.edgeLabel;\n    var w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === 'edge-label') {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/normalize.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js":
/*!*******************************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js ***!
  \*******************************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   addSubgraphConstraints: () => (/* binding */ addSubgraphConstraints)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n\n\n\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  var prev = {},\n    rootPrev;\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](vs, function (v) {\n    var child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      _.each(children, function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/order/barycenter.js":
/*!*****************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/order/barycenter.js ***!
  \*****************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   barycenter: () => (/* binding */ barycenter)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/reduce.js\");\n\n\n\n\nfunction barycenter(g, movable) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](movable, function (v) {\n    var inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      var result = lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](\n        inV,\n        function (acc, e) {\n          var edge = g.edge(e),\n            nodeU = g.node(e.v);\n          return {\n            sum: acc.sum + edge.weight * nodeU.order,\n            weight: acc.weight + edge.weight,\n          };\n        },\n        { sum: 0, weight: 0 },\n      );\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight,\n      };\n    }\n  });\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/order/barycenter.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js":
/*!************************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js ***!
  \************************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   buildLayerGraph: () => (/* binding */ buildLayerGraph)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/isUndefined.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/uniqueId.js\");\n/* harmony import */ var _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../graphlib/index.js */ \"../node_modules/dagre-d3-es/src/graphlib/index.js\");\n\n\n\n\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship) {\n  var root = createRootNode(g),\n    result = new _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__.Graph({ compound: true })\n      .setGraph({ root: root })\n      .setDefaultNodeLabel(function (v) {\n        return g.node(v);\n      });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g.nodes(), function (v) {\n    var node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || (node.minRank <= rank && rank <= node.maxRank)) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g[relationship](v), function (e) {\n        var u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = !lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](edge) ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (Object.prototype.hasOwnProperty.call(node, 'minRank')) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank],\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"]('_root'))));\n  return v;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/order/cross-count.js":
/*!******************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/order/cross-count.js ***!
  \******************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   crossCount: () => (/* binding */ crossCount)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/zipObject.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/flatten.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/sortBy.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n\n\n\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  var cc = 0;\n  for (var i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i - 1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  var southPos = lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](\n    southLayer,\n    lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](southLayer, function (v, i) {\n      return i;\n    }),\n  );\n  var southEntries = lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](\n    lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](northLayer, function (v) {\n      return lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](\n        lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g.outEdges(v), function (e) {\n          return { pos: southPos[e.w], weight: g.edge(e).weight };\n        }),\n        'pos',\n      );\n    }),\n  );\n\n  // Build the accumulator tree\n  var firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  var treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  var tree = lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](new Array(treeSize), function () {\n    return 0;\n  });\n\n  // Calculate the weighted crossings\n  var cc = 0;\n  lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](\n    // @ts-expect-error\n    southEntries.forEach(function (entry) {\n      var index = entry.pos + firstIndex;\n      tree[index] += entry.weight;\n      var weightSum = 0;\n      // @ts-expect-error\n      while (index > 0) {\n        // @ts-expect-error\n        if (index % 2) {\n          weightSum += tree[index + 1];\n        }\n        // @ts-expect-error\n        index = (index - 1) >> 1;\n        tree[index] += entry.weight;\n      }\n      cc += entry.weight * weightSum;\n    }),\n  );\n\n  return cc;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/order/cross-count.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/order/index.js":
/*!************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/order/index.js ***!
  \************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   order: () => (/* binding */ order)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/range.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/cloneDeep.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../graphlib/index.js */ \"../node_modules/dagre-d3-es/src/graphlib/index.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../util.js */ \"../node_modules/dagre-d3-es/src/dagre/util.js\");\n/* harmony import */ var _add_subgraph_constraints_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./add-subgraph-constraints.js */ \"../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js\");\n/* harmony import */ var _build_layer_graph_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./build-layer-graph.js */ \"../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js\");\n/* harmony import */ var _cross_count_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./cross-count.js */ \"../node_modules/dagre-d3-es/src/dagre/order/cross-count.js\");\n/* harmony import */ var _init_order_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./init-order.js */ \"../node_modules/dagre-d3-es/src/dagre/order/init-order.js\");\n/* harmony import */ var _sort_subgraph_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./sort-subgraph.js */ \"../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js\");\n\n\n\n\n\n\n\n\n\n\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g) {\n  var maxRank = _util_js__WEBPACK_IMPORTED_MODULE_1__.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, lodash_es__WEBPACK_IMPORTED_MODULE_7__[\"default\"](1, maxRank + 1), 'inEdges'),\n    upLayerGraphs = buildLayerGraphs(g, lodash_es__WEBPACK_IMPORTED_MODULE_7__[\"default\"](maxRank - 1, -1, -1), 'outEdges');\n\n  var layering = (0,_init_order_js__WEBPACK_IMPORTED_MODULE_5__.initOrder)(g);\n  assignOrder(g, layering);\n\n  var bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = _util_js__WEBPACK_IMPORTED_MODULE_1__.buildLayerMatrix(g);\n    var cc = (0,_cross_count_js__WEBPACK_IMPORTED_MODULE_4__.crossCount)(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = lodash_es__WEBPACK_IMPORTED_MODULE_8__[\"default\"](layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_9__[\"default\"](ranks, function (rank) {\n    return (0,_build_layer_graph_js__WEBPACK_IMPORTED_MODULE_3__.buildLayerGraph)(g, rank, relationship);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  var cg = new _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__.Graph();\n  lodash_es__WEBPACK_IMPORTED_MODULE_10__[\"default\"](layerGraphs, function (lg) {\n    var root = lg.graph().root;\n    var sorted = (0,_sort_subgraph_js__WEBPACK_IMPORTED_MODULE_6__.sortSubgraph)(lg, root, cg, biasRight);\n    lodash_es__WEBPACK_IMPORTED_MODULE_10__[\"default\"](sorted.vs, function (v, i) {\n      lg.node(v).order = i;\n    });\n    (0,_add_subgraph_constraints_js__WEBPACK_IMPORTED_MODULE_2__.addSubgraphConstraints)(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_10__[\"default\"](layering, function (layer) {\n    lodash_es__WEBPACK_IMPORTED_MODULE_10__[\"default\"](layer, function (v, i) {\n      g.node(v).order = i;\n    });\n  });\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/order/index.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/order/init-order.js":
/*!*****************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/order/init-order.js ***!
  \*****************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   initOrder: () => (/* binding */ initOrder)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/filter.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/max.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/range.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/has.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/sortBy.js\");\n\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  var visited = {};\n  var simpleNodes = lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.nodes(), function (v) {\n    return !g.children(v).length;\n  });\n  var maxRank = lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](\n    lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](simpleNodes, function (v) {\n      return g.node(v).rank;\n    }),\n  );\n  var layers = lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](maxRank + 1), function () {\n    return [];\n  });\n\n  function dfs(v) {\n    if (lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](visited, v)) return;\n    visited[v] = true;\n    var node = g.node(v);\n    layers[node.rank].push(v);\n    lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](g.successors(v), dfs);\n  }\n\n  var orderedVs = lodash_es__WEBPACK_IMPORTED_MODULE_6__[\"default\"](simpleNodes, function (v) {\n    return g.node(v).rank;\n  });\n  lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](orderedVs, dfs);\n\n  return layers;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/order/init-order.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js":
/*!************************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js ***!
  \************************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   resolveConflicts: () => (/* binding */ resolveConflicts)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/isUndefined.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/filter.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/pick.js\");\n\n\n\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  var mappedEntries = {};\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](entries, function (entry, i) {\n    var tmp = (mappedEntries[entry.v] = {\n      indegree: 0,\n      in: [],\n      out: [],\n      vs: [entry.v],\n      i: i,\n    });\n    if (!lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](entry.barycenter)) {\n      // @ts-expect-error\n      tmp.barycenter = entry.barycenter;\n      // @ts-expect-error\n      tmp.weight = entry.weight;\n    }\n  });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](cg.edges(), function (e) {\n    var entryV = mappedEntries[e.v];\n    var entryW = mappedEntries[e.w];\n    if (!lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](entryV) && !lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](entryW)) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  var sourceSet = lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](mappedEntries, function (entry) {\n    // @ts-expect-error\n    return !entry.indegree;\n  });\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  var entries = [];\n\n  function handleIn(vEntry) {\n    return function (uEntry) {\n      if (uEntry.merged) {\n        return;\n      }\n      if (\n        lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](uEntry.barycenter) ||\n        lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](vEntry.barycenter) ||\n        uEntry.barycenter >= vEntry.barycenter\n      ) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return function (wEntry) {\n      wEntry['in'].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    var entry = sourceSet.pop();\n    entries.push(entry);\n    lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](entry['in'].reverse(), handleIn(entry));\n    lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](entry.out, handleOut(entry));\n  }\n\n  return lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](\n    lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](entries, function (entry) {\n      return !entry.merged;\n    }),\n    function (entry) {\n      return lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](entry, ['vs', 'i', 'barycenter', 'weight']);\n    },\n  );\n}\n\nfunction mergeEntries(target, source) {\n  var sum = 0;\n  var weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js":
/*!********************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js ***!
  \********************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   sortSubgraph: () => (/* binding */ sortSubgraph)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/filter.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/flatten.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/isUndefined.js\");\n/* harmony import */ var _barycenter_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./barycenter.js */ \"../node_modules/dagre-d3-es/src/dagre/order/barycenter.js\");\n/* harmony import */ var _resolve_conflicts_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./resolve-conflicts.js */ \"../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js\");\n/* harmony import */ var _sort_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./sort.js */ \"../node_modules/dagre-d3-es/src/dagre/order/sort.js\");\n\n\n\n\n\n\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  var movable = g.children(v);\n  var node = g.node(v);\n  var bl = node ? node.borderLeft : undefined;\n  var br = node ? node.borderRight : undefined;\n  var subgraphs = {};\n\n  if (bl) {\n    movable = lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](movable, function (w) {\n      return w !== bl && w !== br;\n    });\n  }\n\n  var barycenters = (0,_barycenter_js__WEBPACK_IMPORTED_MODULE_0__.barycenter)(g, movable);\n  lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](barycenters, function (entry) {\n    if (g.children(entry.v).length) {\n      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (Object.prototype.hasOwnProperty.call(subgraphResult, 'barycenter')) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  var entries = (0,_resolve_conflicts_js__WEBPACK_IMPORTED_MODULE_1__.resolveConflicts)(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  var result = (0,_sort_js__WEBPACK_IMPORTED_MODULE_2__.sort)(entries, biasRight);\n\n  if (bl) {\n    result.vs = lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"]([bl, result.vs, br]);\n    if (g.predecessors(bl).length) {\n      var blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!Object.prototype.hasOwnProperty.call(result, 'barycenter')) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter =\n        (result.barycenter * result.weight + blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](entries, function (entry) {\n    entry.vs = lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](\n      entry.vs.map(function (v) {\n        if (subgraphs[v]) {\n          return subgraphs[v].vs;\n        }\n        return v;\n      }),\n    );\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (!lodash_es__WEBPACK_IMPORTED_MODULE_6__[\"default\"](target.barycenter)) {\n    target.barycenter =\n      (target.barycenter * target.weight + other.barycenter * other.weight) /\n      (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/order/sort.js":
/*!***********************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/order/sort.js ***!
  \***********************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   sort: () => (/* binding */ sort)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/sortBy.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/flatten.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/last.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../util.js */ \"../node_modules/dagre-d3-es/src/dagre/util.js\");\n\n\n\n\n\nfunction sort(entries, biasRight) {\n  var parts = _util_js__WEBPACK_IMPORTED_MODULE_0__.partition(entries, function (entry) {\n    return Object.prototype.hasOwnProperty.call(entry, 'barycenter');\n  });\n  var sortable = parts.lhs,\n    unsortable = lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](parts.rhs, function (entry) {\n      return -entry.i;\n    }),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](sortable, function (entry) {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  var result = { vs: lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](vs) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  var last;\n  while (unsortable.length && (last = lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](unsortable)).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return function (entryV, entryW) {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/order/sort.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js":
/*!********************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js ***!
  \********************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   parentDummyChains: () => (/* binding */ parentDummyChains)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n\n\n\n\nfunction parentDummyChains(g) {\n  var postorderNums = postorder(g);\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.graph().dummyChains, function (v) {\n    var node = g.node(v);\n    var edgeObj = node.edgeObj;\n    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    var path = pathData.path;\n    var lca = pathData.lca;\n    var pathIdx = 0;\n    var pathV = path[pathIdx];\n    var ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca && g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (\n          pathIdx < path.length - 1 &&\n          g.node((pathV = path[pathIdx + 1])).minRank <= node.rank\n        ) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  var vPath = [];\n  var wPath = [];\n  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  var parent;\n  var lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent && (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  var result = {};\n  var lim = 0;\n\n  function dfs(v) {\n    var low = lim;\n    lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.children(v), dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.children(), dfs);\n\n  return result;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/position/bk.js":
/*!************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/position/bk.js ***!
  \************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   addConflict: () => (/* binding */ addConflict),\n/* harmony export */   alignCoordinates: () => (/* binding */ alignCoordinates),\n/* harmony export */   balance: () => (/* binding */ balance),\n/* harmony export */   findSmallestWidthAlignment: () => (/* binding */ findSmallestWidthAlignment),\n/* harmony export */   findType1Conflicts: () => (/* binding */ findType1Conflicts),\n/* harmony export */   findType2Conflicts: () => (/* binding */ findType2Conflicts),\n/* harmony export */   hasConflict: () => (/* binding */ hasConflict),\n/* harmony export */   horizontalCompaction: () => (/* binding */ horizontalCompaction),\n/* harmony export */   positionX: () => (/* binding */ positionX),\n/* harmony export */   verticalAlignment: () => (/* binding */ verticalAlignment)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/last.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/reduce.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/range.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/find.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/sortBy.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/minBy.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/values.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forIn.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/min.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/max.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/mapValues.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/merge.js\");\n/* harmony import */ var _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../graphlib/index.js */ \"../node_modules/dagre-d3-es/src/graphlib/index.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../util.js */ \"../node_modules/dagre-d3-es/src/dagre/util.js\");\n\n\n\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\n\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  var conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    var // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](layer);\n\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layer, function (v, i) {\n      var w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layer.slice(scanPos, i + 1), function (scanNode) {\n          lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.predecessors(scanNode), function (u) {\n            var uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) && !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        // @ts-expect-error\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](layering, visitLayer);\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  var conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    var v;\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](southPos, southEnd), function (i) {\n      v = south[i];\n      if (g.node(v).dummy) {\n        lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.predecessors(v), function (u) {\n          var uNode = g.node(u);\n          if (uNode.dummy && (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n  function visitLayer(north, south) {\n    var prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](south, function (v, southLookahead) {\n      if (g.node(v).dummy === 'border') {\n        var predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          // @ts-expect-error\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](layering, visitLayer);\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return lodash_es__WEBPACK_IMPORTED_MODULE_6__[\"default\"](g.predecessors(v), function (u) {\n      return g.node(u).dummy;\n    });\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  var conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return !!conflicts[v] && Object.prototype.hasOwnProperty.call(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  var root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layering, function (layer) {\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layer, function (v, order) {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layering, function (layer) {\n    var prevIdx = -1;\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layer, function (v) {\n      var ws = neighborFn(v);\n      if (ws.length) {\n        ws = lodash_es__WEBPACK_IMPORTED_MODULE_7__[\"default\"](ws, function (w) {\n          return pos[w];\n        });\n        var mp = (ws.length - 1) / 2;\n        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          var w = ws[i];\n          if (align[v] === v && prevIdx < pos[w] && !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  var xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? 'borderLeft' : 'borderRight';\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    var stack = blockG.nodes();\n    var elem = stack.pop();\n    var visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce(function (acc, e) {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    var min = blockG.outEdges(elem).reduce(function (acc, e) {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    var node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](align, function (v) {\n    xs[v] = xs[root[v]];\n  });\n\n  return xs;\n}\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  var blockGraph = new _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__.Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layering, function (layer) {\n    var u;\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layer, function (v) {\n      var vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_8__[\"default\"](lodash_es__WEBPACK_IMPORTED_MODULE_9__[\"default\"](xss), function (xs) {\n    var max = Number.NEGATIVE_INFINITY;\n    var min = Number.POSITIVE_INFINITY;\n\n    lodash_es__WEBPACK_IMPORTED_MODULE_10__[\"default\"](xs, function (x, v) {\n      var halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    return max - min;\n  });\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  var alignToVals = lodash_es__WEBPACK_IMPORTED_MODULE_9__[\"default\"](alignTo),\n    alignToMin = lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](alignToVals),\n    alignToMax = lodash_es__WEBPACK_IMPORTED_MODULE_12__[\"default\"](alignToVals);\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](['u', 'd'], function (vert) {\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](['l', 'r'], function (horiz) {\n      var alignment = vert + horiz,\n        xs = xss[alignment],\n        delta;\n      if (xs === alignTo) return;\n\n      var xsVals = lodash_es__WEBPACK_IMPORTED_MODULE_9__[\"default\"](xs);\n      delta = horiz === 'l' ? alignToMin - lodash_es__WEBPACK_IMPORTED_MODULE_11__[\"default\"](xsVals) : alignToMax - lodash_es__WEBPACK_IMPORTED_MODULE_12__[\"default\"](xsVals);\n\n      if (delta) {\n        xss[alignment] = lodash_es__WEBPACK_IMPORTED_MODULE_13__[\"default\"](xs, function (x) {\n          return x + delta;\n        });\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_13__[\"default\"](xss.ul, function (ignore, v) {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      var xs = lodash_es__WEBPACK_IMPORTED_MODULE_7__[\"default\"](lodash_es__WEBPACK_IMPORTED_MODULE_14__[\"default\"](xss, v));\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  var layering = _util_js__WEBPACK_IMPORTED_MODULE_1__.buildLayerMatrix(g);\n  var conflicts = lodash_es__WEBPACK_IMPORTED_MODULE_15__[\"default\"](findType1Conflicts(g, layering), findType2Conflicts(g, layering));\n\n  var xss = {};\n  var adjustedLayering;\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](['u', 'd'], function (vert) {\n    adjustedLayering = vert === 'u' ? layering : lodash_es__WEBPACK_IMPORTED_MODULE_9__[\"default\"](layering).reverse();\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](['l', 'r'], function (horiz) {\n      if (horiz === 'r') {\n        adjustedLayering = lodash_es__WEBPACK_IMPORTED_MODULE_14__[\"default\"](adjustedLayering, function (inner) {\n          return lodash_es__WEBPACK_IMPORTED_MODULE_9__[\"default\"](inner).reverse();\n        });\n      }\n\n      var neighborFn = (vert === 'u' ? g.predecessors : g.successors).bind(g);\n      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      var xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, horiz === 'r');\n      if (horiz === 'r') {\n        xs = lodash_es__WEBPACK_IMPORTED_MODULE_13__[\"default\"](xs, function (x) {\n          return -x;\n        });\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n  var smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return function (g, v, w) {\n    var vLabel = g.node(v);\n    var wLabel = g.node(w);\n    var sum = 0;\n    var delta;\n\n    sum += vLabel.width / 2;\n    if (Object.prototype.hasOwnProperty.call(vLabel, 'labelpos')) {\n      switch (vLabel.labelpos.toLowerCase()) {\n        case 'l':\n          delta = -vLabel.width / 2;\n          break;\n        case 'r':\n          delta = vLabel.width / 2;\n          break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (Object.prototype.hasOwnProperty.call(wLabel, 'labelpos')) {\n      switch (wLabel.labelpos.toLowerCase()) {\n        case 'l':\n          delta = wLabel.width / 2;\n          break;\n        case 'r':\n          delta = -wLabel.width / 2;\n          break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/position/bk.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/position/index.js":
/*!***************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/position/index.js ***!
  \***************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   position: () => (/* binding */ position)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forOwn.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/max.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../util.js */ \"../node_modules/dagre-d3-es/src/dagre/util.js\");\n/* harmony import */ var _bk_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./bk.js */ \"../node_modules/dagre-d3-es/src/dagre/position/bk.js\");\n\n\n\n\n\n\nfunction position(g) {\n  g = _util_js__WEBPACK_IMPORTED_MODULE_0__.asNonCompoundGraph(g);\n\n  positionY(g);\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"]((0,_bk_js__WEBPACK_IMPORTED_MODULE_1__.positionX)(g), function (x, v) {\n    g.node(v).x = x;\n  });\n}\n\nfunction positionY(g) {\n  var layering = _util_js__WEBPACK_IMPORTED_MODULE_0__.buildLayerMatrix(g);\n  var rankSep = g.graph().ranksep;\n  var prevY = 0;\n  lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layering, function (layer) {\n    var maxHeight = lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](\n      lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](layer, function (v) {\n        return g.node(v).height;\n      }),\n    );\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](layer, function (v) {\n      g.node(v).y = prevY + maxHeight / 2;\n    });\n    prevY += maxHeight + rankSep;\n  });\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/position/index.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js":
/*!*******************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js ***!
  \*******************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   feasibleTree: () => (/* binding */ feasibleTree)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/minBy.js\");\n/* harmony import */ var _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../graphlib/index.js */ \"../node_modules/dagre-d3-es/src/graphlib/index.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./util.js */ \"../node_modules/dagre-d3-es/src/dagre/rank/util.js\");\n\n\n\n\n\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__.Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? (0,_util_js__WEBPACK_IMPORTED_MODULE_1__.slack)(g, edge) : -(0,_util_js__WEBPACK_IMPORTED_MODULE_1__.slack)(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.nodeEdges(v), function (e) {\n      var edgeV = e.v,\n        w = v === edgeV ? e.w : edgeV;\n      if (!t.hasNode(w) && !(0,_util_js__WEBPACK_IMPORTED_MODULE_1__.slack)(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](t.nodes(), dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.edges(), function (e) {\n    if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n      return (0,_util_js__WEBPACK_IMPORTED_MODULE_1__.slack)(g, e);\n    }\n  });\n}\n\nfunction shiftRanks(t, g, delta) {\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](t.nodes(), function (v) {\n    g.node(v).rank += delta;\n  });\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/rank/index.js":
/*!***********************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/rank/index.js ***!
  \***********************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   rank: () => (/* binding */ rank)\n/* harmony export */ });\n/* harmony import */ var _feasible_tree_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./feasible-tree.js */ \"../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js\");\n/* harmony import */ var _network_simplex_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./network-simplex.js */ \"../node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./util.js */ \"../node_modules/dagre-d3-es/src/dagre/rank/util.js\");\n\n\n\n\n\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  switch (g.graph().ranker) {\n    case 'network-simplex':\n      networkSimplexRanker(g);\n      break;\n    case 'tight-tree':\n      tightTreeRanker(g);\n      break;\n    case 'longest-path':\n      longestPathRanker(g);\n      break;\n    default:\n      networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = _util_js__WEBPACK_IMPORTED_MODULE_2__.longestPath;\n\nfunction tightTreeRanker(g) {\n  (0,_util_js__WEBPACK_IMPORTED_MODULE_2__.longestPath)(g);\n  (0,_feasible_tree_js__WEBPACK_IMPORTED_MODULE_0__.feasibleTree)(g);\n}\n\nfunction networkSimplexRanker(g) {\n  (0,_network_simplex_js__WEBPACK_IMPORTED_MODULE_1__.networkSimplex)(g);\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/rank/index.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js":
/*!*********************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js ***!
  \*********************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   networkSimplex: () => (/* binding */ networkSimplex)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/find.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/filter.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/minBy.js\");\n/* harmony import */ var _graphlib_alg_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../graphlib/alg/index.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/index.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../util.js */ \"../node_modules/dagre-d3-es/src/dagre/util.js\");\n/* harmony import */ var _feasible_tree_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./feasible-tree.js */ \"../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js\");\n/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./util.js */ \"../node_modules/dagre-d3-es/src/dagre/rank/util.js\");\n\n\n\n\n\n\n\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = (0,_util_js__WEBPACK_IMPORTED_MODULE_1__.simplify)(g);\n  (0,_util_js__WEBPACK_IMPORTED_MODULE_3__.longestPath)(g);\n  var t = (0,_feasible_tree_js__WEBPACK_IMPORTED_MODULE_2__.feasibleTree)(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = _graphlib_alg_index_js__WEBPACK_IMPORTED_MODULE_0__.postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](vs, function (v) {\n    assignCutValue(t, g, v);\n  });\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](g.nodeEdges(child), function (e) {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](tree.neighbors(v), function (w) {\n    if (!Object.prototype.hasOwnProperty.call(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](tree.edges(), function (e) {\n    return tree.edge(e).cutvalue < 0;\n  });\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = lodash_es__WEBPACK_IMPORTED_MODULE_6__[\"default\"](g.edges(), function (edge) {\n    return (\n      flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n      flip !== isDescendant(t, t.node(edge.w), tailLabel)\n    );\n  });\n\n  return lodash_es__WEBPACK_IMPORTED_MODULE_7__[\"default\"](candidates, function (edge) {\n    return (0,_util_js__WEBPACK_IMPORTED_MODULE_3__.slack)(g, edge);\n  });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](t.nodes(), function (v) {\n    return !g.node(v).parent;\n  });\n  var vs = _graphlib_alg_index_js__WEBPACK_IMPORTED_MODULE_0__.preorder(t, root);\n  vs = vs.slice(1);\n  lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](vs, function (v) {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/rank/util.js":
/*!**********************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/rank/util.js ***!
  \**********************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   longestPath: () => (/* binding */ longestPath),\n/* harmony export */   slack: () => (/* binding */ slack)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/min.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n\n\n\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (Object.prototype.hasOwnProperty.call(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    var rank = lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](\n      lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](g.outEdges(v), function (e) {\n        return dfs(e.w) - g.edge(e).minlen;\n      }),\n    );\n\n    if (\n      rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n      rank === undefined || // return value of _.map([]) for Lodash 4\n      rank === null\n    ) {\n      // return value of _.map([null])\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.sources(), dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/rank/util.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/dagre/util.js":
/*!*****************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/dagre/util.js ***!
  \*****************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   addBorderNode: () => (/* binding */ addBorderNode),\n/* harmony export */   addDummyNode: () => (/* binding */ addDummyNode),\n/* harmony export */   asNonCompoundGraph: () => (/* binding */ asNonCompoundGraph),\n/* harmony export */   buildLayerMatrix: () => (/* binding */ buildLayerMatrix),\n/* harmony export */   intersectRect: () => (/* binding */ intersectRect),\n/* harmony export */   maxRank: () => (/* binding */ maxRank),\n/* harmony export */   normalizeRanks: () => (/* binding */ normalizeRanks),\n/* harmony export */   notime: () => (/* binding */ notime),\n/* harmony export */   partition: () => (/* binding */ partition),\n/* harmony export */   predecessorWeights: () => (/* binding */ predecessorWeights),\n/* harmony export */   removeEmptyRanks: () => (/* binding */ removeEmptyRanks),\n/* harmony export */   simplify: () => (/* binding */ simplify),\n/* harmony export */   successorWeights: () => (/* binding */ successorWeights),\n/* harmony export */   time: () => (/* binding */ time)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/uniqueId.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/map.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/zipObject.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/range.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/isUndefined.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/min.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/has.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/max.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/now.js\");\n/* harmony import */ var _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../graphlib/index.js */ \"../node_modules/dagre-d3-es/src/graphlib/index.js\");\n\n\n\n\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v;\n  do {\n    v = lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](name);\n  } while (g.hasNode(v));\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  var simplified = new _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__.Graph().setGraph(g.graph());\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.nodes(), function (v) {\n    simplified.setNode(v, g.node(v));\n  });\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.edges(), function (e) {\n    var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    var label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen),\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  var simplified = new _graphlib_index_js__WEBPACK_IMPORTED_MODULE_0__.Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.nodes(), function (v) {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.edges(), function (e) {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  var weightMap = lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.nodes(), function (v) {\n    var sucs = {};\n    lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.outEdges(v), function (e) {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  var weightMap = lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.nodes(), function (v) {\n    var preds = {};\n    lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.inEdges(v), function (e) {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return lodash_es__WEBPACK_IMPORTED_MODULE_4__[\"default\"](g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  var x = rect.x;\n  var y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  var dx = point.x - x;\n  var dy = point.y - y;\n  var w = rect.width / 2;\n  var h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error('Not possible to find intersection inside of the rectangle');\n  }\n\n  var sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = (h * dx) / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = (w * dy) / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  var layering = lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](lodash_es__WEBPACK_IMPORTED_MODULE_5__[\"default\"](maxRank(g) + 1), function () {\n    return [];\n  });\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.nodes(), function (v) {\n    var node = g.node(v);\n    var rank = node.rank;\n    if (!lodash_es__WEBPACK_IMPORTED_MODULE_6__[\"default\"](rank)) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  var min = lodash_es__WEBPACK_IMPORTED_MODULE_7__[\"default\"](\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.nodes(), function (v) {\n      return g.node(v).rank;\n    }),\n  );\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.nodes(), function (v) {\n    var node = g.node(v);\n    if (lodash_es__WEBPACK_IMPORTED_MODULE_8__[\"default\"](node, 'rank')) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  var offset = lodash_es__WEBPACK_IMPORTED_MODULE_7__[\"default\"](\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.nodes(), function (v) {\n      return g.node(v).rank;\n    }),\n  );\n\n  var layers = [];\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.nodes(), function (v) {\n    var rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  var delta = 0;\n  var nodeRankFactor = g.graph().nodeRankFactor;\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](layers, function (vs, i) {\n    if (lodash_es__WEBPACK_IMPORTED_MODULE_6__[\"default\"](vs) && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (delta) {\n      lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](vs, function (v) {\n        g.node(v).rank += delta;\n      });\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  var node = {\n    width: 0,\n    height: 0,\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, 'border', node, prefix);\n}\n\nfunction maxRank(g) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_9__[\"default\"](\n    lodash_es__WEBPACK_IMPORTED_MODULE_3__[\"default\"](g.nodes(), function (v) {\n      var rank = g.node(v).rank;\n      if (!lodash_es__WEBPACK_IMPORTED_MODULE_6__[\"default\"](rank)) {\n        return rank;\n      }\n    }),\n  );\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  var result = { lhs: [], rhs: [] };\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](collection, function (value) {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  var start = lodash_es__WEBPACK_IMPORTED_MODULE_10__[\"default\"]();\n  try {\n    return fn();\n  } finally {\n    console.log(name + ' time: ' + (lodash_es__WEBPACK_IMPORTED_MODULE_10__[\"default\"]() - start) + 'ms');\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/dagre/util.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/components.js":
/*!******************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/components.js ***!
  \******************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   components: () => (/* binding */ components)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n\n\n\n\nfunction components(g) {\n  var visited = {};\n  var cmpts = [];\n  var cmpt;\n\n  function dfs(v) {\n    if (Object.prototype.hasOwnProperty.call(visited, v)) return;\n    visited[v] = true;\n    cmpt.push(v);\n    lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.successors(v), dfs);\n    lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.predecessors(v), dfs);\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.nodes(), function (v) {\n    cmpt = [];\n    dfs(v);\n    if (cmpt.length) {\n      cmpts.push(cmpt);\n    }\n  });\n\n  return cmpts;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/components.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js":
/*!***********************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js ***!
  \***********************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   dfs: () => (/* binding */ dfs)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/isArray.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n\n\n\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nfunction dfs(g, vs, order) {\n  if (!lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](vs)) {\n    vs = [vs];\n  }\n\n  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n  var acc = [];\n  var visited = {};\n  lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](vs, function (v) {\n    if (!g.hasNode(v)) {\n      throw new Error('Graph does not have node: ' + v);\n    }\n\n    doDfs(g, v, order === 'post', visited, navigation, acc);\n  });\n  return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n  if (!Object.prototype.hasOwnProperty.call(visited, v)) {\n    visited[v] = true;\n\n    if (!postorder) {\n      acc.push(v);\n    }\n    lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](navigation(v), function (w) {\n      doDfs(g, w, postorder, visited, navigation, acc);\n    });\n    if (postorder) {\n      acc.push(v);\n    }\n  }\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra-all.js":
/*!********************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra-all.js ***!
  \********************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   dijkstraAll: () => (/* binding */ dijkstraAll)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/transform.js\");\n/* harmony import */ var _dijkstra_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./dijkstra.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js\");\n\n\n\n\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](\n    g.nodes(),\n    function (acc, v) {\n      acc[v] = (0,_dijkstra_js__WEBPACK_IMPORTED_MODULE_0__.dijkstra)(g, v, weightFunc, edgeFunc);\n    },\n    {},\n  );\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra-all.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js":
/*!****************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js ***!
  \****************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   dijkstra: () => (/* binding */ dijkstra)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/constant.js\");\n/* harmony import */ var _data_priority_queue_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../data/priority-queue.js */ \"../node_modules/dagre-d3-es/src/graphlib/data/priority-queue.js\");\n\n\n\n\n\nvar DEFAULT_WEIGHT_FUNC = lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(\n    g,\n    String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn ||\n      function (v) {\n        return g.outEdges(v);\n      },\n  );\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  var results = {};\n  var pq = new _data_priority_queue_js__WEBPACK_IMPORTED_MODULE_0__.PriorityQueue();\n  var v, vEntry;\n\n  var updateNeighbors = function (edge) {\n    var w = edge.v !== v ? edge.v : edge.w;\n    var wEntry = results[w];\n    var weight = weightFn(edge);\n    var distance = vEntry.distance + weight;\n\n    if (weight < 0) {\n      throw new Error(\n        'dijkstra does not allow negative edge weights. ' +\n          'Bad edge: ' +\n          edge +\n          ' Weight: ' +\n          weight,\n      );\n    }\n\n    if (distance < wEntry.distance) {\n      wEntry.distance = distance;\n      wEntry.predecessor = v;\n      pq.decrease(w, distance);\n    }\n  };\n\n  g.nodes().forEach(function (v) {\n    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n    results[v] = { distance: distance };\n    pq.add(v, distance);\n  });\n\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    vEntry = results[v];\n    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n      break;\n    }\n\n    edgeFn(v).forEach(updateNeighbors);\n  }\n\n  return results;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/find-cycles.js":
/*!*******************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/find-cycles.js ***!
  \*******************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   findCycles: () => (/* binding */ findCycles)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/filter.js\");\n/* harmony import */ var _tarjan_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./tarjan.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/tarjan.js\");\n\n\n\n\n\nfunction findCycles(g) {\n  return lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"]((0,_tarjan_js__WEBPACK_IMPORTED_MODULE_0__.tarjan)(g), function (cmpt) {\n    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n  });\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/find-cycles.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js":
/*!**********************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js ***!
  \**********************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   floydWarshall: () => (/* binding */ floydWarshall)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/constant.js\");\n\n\n\n\nvar DEFAULT_WEIGHT_FUNC = lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(\n    g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn ||\n      function (v) {\n        return g.outEdges(v);\n      },\n  );\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  var results = {};\n  var nodes = g.nodes();\n\n  nodes.forEach(function (v) {\n    results[v] = {};\n    results[v][v] = { distance: 0 };\n    nodes.forEach(function (w) {\n      if (v !== w) {\n        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n      }\n    });\n    edgeFn(v).forEach(function (edge) {\n      var w = edge.v === v ? edge.w : edge.v;\n      var d = weightFn(edge);\n      results[v][w] = { distance: d, predecessor: v };\n    });\n  });\n\n  nodes.forEach(function (k) {\n    var rowK = results[k];\n    nodes.forEach(function (i) {\n      var rowI = results[i];\n      nodes.forEach(function (j) {\n        var ik = rowI[k];\n        var kj = rowK[j];\n        var ij = rowI[j];\n        var altDistance = ik.distance + kj.distance;\n        if (altDistance < ij.distance) {\n          ij.distance = altDistance;\n          ij.predecessor = kj.predecessor;\n        }\n      });\n    });\n  });\n\n  return results;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/index.js":
/*!*************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/index.js ***!
  \*************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   components: () => (/* reexport safe */ _components_js__WEBPACK_IMPORTED_MODULE_0__.components),\n/* harmony export */   dijkstra: () => (/* reexport safe */ _dijkstra_js__WEBPACK_IMPORTED_MODULE_1__.dijkstra),\n/* harmony export */   dijkstraAll: () => (/* reexport safe */ _dijkstra_all_js__WEBPACK_IMPORTED_MODULE_2__.dijkstraAll),\n/* harmony export */   findCycles: () => (/* reexport safe */ _find_cycles_js__WEBPACK_IMPORTED_MODULE_3__.findCycles),\n/* harmony export */   floydWarshall: () => (/* reexport safe */ _floyd_warshall_js__WEBPACK_IMPORTED_MODULE_4__.floydWarshall),\n/* harmony export */   isAcyclic: () => (/* reexport safe */ _is_acyclic_js__WEBPACK_IMPORTED_MODULE_5__.isAcyclic),\n/* harmony export */   postorder: () => (/* reexport safe */ _postorder_js__WEBPACK_IMPORTED_MODULE_6__.postorder),\n/* harmony export */   preorder: () => (/* reexport safe */ _preorder_js__WEBPACK_IMPORTED_MODULE_7__.preorder),\n/* harmony export */   prim: () => (/* reexport safe */ _prim_js__WEBPACK_IMPORTED_MODULE_8__.prim),\n/* harmony export */   tarjan: () => (/* reexport safe */ _tarjan_js__WEBPACK_IMPORTED_MODULE_9__.tarjan),\n/* harmony export */   topsort: () => (/* reexport safe */ _topsort_js__WEBPACK_IMPORTED_MODULE_10__.topsort)\n/* harmony export */ });\n/* harmony import */ var _components_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./components.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/components.js\");\n/* harmony import */ var _dijkstra_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./dijkstra.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js\");\n/* harmony import */ var _dijkstra_all_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./dijkstra-all.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra-all.js\");\n/* harmony import */ var _find_cycles_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./find-cycles.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/find-cycles.js\");\n/* harmony import */ var _floyd_warshall_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./floyd-warshall.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js\");\n/* harmony import */ var _is_acyclic_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./is-acyclic.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/is-acyclic.js\");\n/* harmony import */ var _postorder_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./postorder.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js\");\n/* harmony import */ var _preorder_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./preorder.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js\");\n/* harmony import */ var _prim_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./prim.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/prim.js\");\n/* harmony import */ var _tarjan_js__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./tarjan.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/tarjan.js\");\n/* harmony import */ var _topsort_js__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./topsort.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js\");\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/index.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/is-acyclic.js":
/*!******************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/is-acyclic.js ***!
  \******************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   isAcyclic: () => (/* binding */ isAcyclic)\n/* harmony export */ });\n/* harmony import */ var _topsort_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./topsort.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js\");\n\n\n\n\nfunction isAcyclic(g) {\n  try {\n    (0,_topsort_js__WEBPACK_IMPORTED_MODULE_0__.topsort)(g);\n  } catch (e) {\n    if (e instanceof _topsort_js__WEBPACK_IMPORTED_MODULE_0__.CycleException) {\n      return false;\n    }\n    throw e;\n  }\n  return true;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/is-acyclic.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js":
/*!*****************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js ***!
  \*****************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   postorder: () => (/* binding */ postorder)\n/* harmony export */ });\n/* harmony import */ var _dfs_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./dfs.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js\");\n\n\n\n\nfunction postorder(g, vs) {\n  return (0,_dfs_js__WEBPACK_IMPORTED_MODULE_0__.dfs)(g, vs, 'post');\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js":
/*!****************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js ***!
  \****************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   preorder: () => (/* binding */ preorder)\n/* harmony export */ });\n/* harmony import */ var _dfs_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./dfs.js */ \"../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js\");\n\n\n\n\nfunction preorder(g, vs) {\n  return (0,_dfs_js__WEBPACK_IMPORTED_MODULE_0__.dfs)(g, vs, 'pre');\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/prim.js":
/*!************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/prim.js ***!
  \************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   prim: () => (/* binding */ prim)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var _data_priority_queue_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../data/priority-queue.js */ \"../node_modules/dagre-d3-es/src/graphlib/data/priority-queue.js\");\n/* harmony import */ var _graph_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../graph.js */ \"../node_modules/dagre-d3-es/src/graphlib/graph.js\");\n\n\n\n\n\n\nfunction prim(g, weightFunc) {\n  var result = new _graph_js__WEBPACK_IMPORTED_MODULE_1__.Graph();\n  var parents = {};\n  var pq = new _data_priority_queue_js__WEBPACK_IMPORTED_MODULE_0__.PriorityQueue();\n  var v;\n\n  function updateNeighbors(edge) {\n    var w = edge.v === v ? edge.w : edge.v;\n    var pri = pq.priority(w);\n    if (pri !== undefined) {\n      var edgeWeight = weightFunc(edge);\n      if (edgeWeight < pri) {\n        parents[w] = v;\n        pq.decrease(w, edgeWeight);\n      }\n    }\n  }\n\n  if (g.nodeCount() === 0) {\n    return result;\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_2__[\"default\"](g.nodes(), function (v) {\n    pq.add(v, Number.POSITIVE_INFINITY);\n    result.setNode(v);\n  });\n\n  // Start from an arbitrary node\n  pq.decrease(g.nodes()[0], 0);\n\n  var init = false;\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    if (Object.prototype.hasOwnProperty.call(parents, v)) {\n      result.setEdge(v, parents[v]);\n    } else if (init) {\n      throw new Error('Input graph is not connected: ' + g);\n    } else {\n      init = true;\n    }\n\n    g.nodeEdges(v).forEach(updateNeighbors);\n  }\n\n  return result;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/prim.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/tarjan.js":
/*!**************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/tarjan.js ***!
  \**************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   tarjan: () => (/* binding */ tarjan)\n/* harmony export */ });\n\n\nfunction tarjan(g) {\n  var index = 0;\n  var stack = [];\n  var visited = {}; // node id -> { onStack, lowlink, index }\n  var results = [];\n\n  function dfs(v) {\n    var entry = (visited[v] = {\n      onStack: true,\n      lowlink: index,\n      index: index++,\n    });\n    stack.push(v);\n\n    g.successors(v).forEach(function (w) {\n      if (!Object.prototype.hasOwnProperty.call(visited, w)) {\n        dfs(w);\n        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n      } else if (visited[w].onStack) {\n        entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n      }\n    });\n\n    if (entry.lowlink === entry.index) {\n      var cmpt = [];\n      var w;\n      do {\n        w = stack.pop();\n        visited[w].onStack = false;\n        cmpt.push(w);\n      } while (v !== w);\n      results.push(cmpt);\n    }\n  }\n\n  g.nodes().forEach(function (v) {\n    if (!Object.prototype.hasOwnProperty.call(visited, v)) {\n      dfs(v);\n    }\n  });\n\n  return results;\n}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/tarjan.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js":
/*!***************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js ***!
  \***************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   CycleException: () => (/* binding */ CycleException),\n/* harmony export */   topsort: () => (/* binding */ topsort)\n/* harmony export */ });\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/forEach.js\");\n/* harmony import */ var lodash_es__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! lodash-es */ \"../node_modules/lodash-es/size.js\");\n\n\n\n\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (Object.prototype.hasOwnProperty.call(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!Object.prototype.hasOwnProperty.call(visited, node)) {\n      stack[node] = true;\n      visited[node] = true;\n      lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.predecessors(node), visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  lodash_es__WEBPACK_IMPORTED_MODULE_0__[\"default\"](g.sinks(), visit);\n\n  if (lodash_es__WEBPACK_IMPORTED_MODULE_1__[\"default\"](visited) !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js?");

/***/ }),

/***/ "../node_modules/dagre-d3-es/src/graphlib/data/priority-queue.js":
/*!***********************************************************************!*\
  !*** ../node_modules/dagre-d3-es/src/graphlib/data/priority-queue.js ***!
  \***********************************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   PriorityQueue: () => (/* binding */ PriorityQueue)\n/* harmony export */ });\n\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 */\nclass PriorityQueue {\n  constructor() {\n    this._arr = [];\n    this._keyIndices = {};\n  }\n  /**\n   * Returns the number of elements in the queue. Takes `O(1)` time.\n   */\n  size() {\n    return this._arr.length;\n  }\n  /**\n   * Returns the keys that are in the queue. Takes `O(n)` time.\n   */\n  keys() {\n    return this._arr.map(function (x) {\n      return x.key;\n    });\n  }\n  /**\n   * Returns `true` if **key** is in the queue and `false` if not.\n   */\n  has(key) {\n    return Object.prototype.hasOwnProperty.call(this._keyIndices, key);\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   */\n  priority(key) {\n    var index = this._keyIndices[key];\n    if (index !== undefined) {\n      return this._arr[index].priority;\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   */\n  min() {\n    if (this.size() === 0) {\n      throw new Error('Queue underflow');\n    }\n    return this._arr[0].key;\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   */\n  add(key, priority) {\n    var keyIndices = this._keyIndices;\n    key = String(key);\n    if (!Object.prototype.hasOwnProperty.call(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   * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n   */\n  removeMin() {\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   * 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   */\n  decrease(key, priority) {\n    var index = this._keyIndices[key];\n    if (priority > this._arr[index].priority) {\n      throw new Error(\n        'New priority is greater than current priority. ' +\n          'Key: ' +\n          key +\n          ' Old: ' +\n          this._arr[index].priority +\n          ' New: ' +\n          priority,\n      );\n    }\n    this._arr[index].priority = priority;\n    this._decrease(index);\n  }\n  _heapify(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  _decrease(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  _swap(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}\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/dagre-d3-es/src/graphlib/data/priority-queue.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_asciiSize.js":
/*!***********************************************!*\
  !*** ../node_modules/lodash-es/_asciiSize.js ***!
  \***********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseProperty_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_baseProperty.js */ \"../node_modules/lodash-es/_baseProperty.js\");\n\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 = (0,_baseProperty_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])('length');\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (asciiSize);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_asciiSize.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_baseGt.js":
/*!********************************************!*\
  !*** ../node_modules/lodash-es/_baseGt.js ***!
  \********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n *  else `false`.\n */\nfunction baseGt(value, other) {\n  return value > other;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseGt);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_baseGt.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_baseOrderBy.js":
/*!*************************************************!*\
  !*** ../node_modules/lodash-es/_baseOrderBy.js ***!
  \*************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _arrayMap_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_arrayMap.js */ \"../node_modules/lodash-es/_arrayMap.js\");\n/* harmony import */ var _baseGet_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_baseGet.js */ \"../node_modules/lodash-es/_baseGet.js\");\n/* harmony import */ var _baseIteratee_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./_baseIteratee.js */ \"../node_modules/lodash-es/_baseIteratee.js\");\n/* harmony import */ var _baseMap_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./_baseMap.js */ \"../node_modules/lodash-es/_baseMap.js\");\n/* harmony import */ var _baseSortBy_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./_baseSortBy.js */ \"../node_modules/lodash-es/_baseSortBy.js\");\n/* harmony import */ var _baseUnary_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./_baseUnary.js */ \"../node_modules/lodash-es/_baseUnary.js\");\n/* harmony import */ var _compareMultiple_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./_compareMultiple.js */ \"../node_modules/lodash-es/_compareMultiple.js\");\n/* harmony import */ var _identity_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./identity.js */ \"../node_modules/lodash-es/identity.js\");\n/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./isArray.js */ \"../node_modules/lodash-es/isArray.js\");\n\n\n\n\n\n\n\n\n\n\n/**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\nfunction baseOrderBy(collection, iteratees, orders) {\n  if (iteratees.length) {\n    iteratees = (0,_arrayMap_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(iteratees, function(iteratee) {\n      if ((0,_isArray_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(iteratee)) {\n        return function(value) {\n          return (0,_baseGet_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"])(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n        }\n      }\n      return iteratee;\n    });\n  } else {\n    iteratees = [_identity_js__WEBPACK_IMPORTED_MODULE_3__[\"default\"]];\n  }\n\n  var index = -1;\n  iteratees = (0,_arrayMap_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(iteratees, (0,_baseUnary_js__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(_baseIteratee_js__WEBPACK_IMPORTED_MODULE_5__[\"default\"]));\n\n  var result = (0,_baseMap_js__WEBPACK_IMPORTED_MODULE_6__[\"default\"])(collection, function(value, key, collection) {\n    var criteria = (0,_arrayMap_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(iteratees, function(iteratee) {\n      return iteratee(value);\n    });\n    return { 'criteria': criteria, 'index': ++index, 'value': value };\n  });\n\n  return (0,_baseSortBy_js__WEBPACK_IMPORTED_MODULE_7__[\"default\"])(result, function(object, other) {\n    return (0,_compareMultiple_js__WEBPACK_IMPORTED_MODULE_8__[\"default\"])(object, other, orders);\n  });\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseOrderBy);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_baseOrderBy.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_basePick.js":
/*!**********************************************!*\
  !*** ../node_modules/lodash-es/_basePick.js ***!
  \**********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _basePickBy_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_basePickBy.js */ \"../node_modules/lodash-es/_basePickBy.js\");\n/* harmony import */ var _hasIn_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./hasIn.js */ \"../node_modules/lodash-es/hasIn.js\");\n\n\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return (0,_basePickBy_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(object, paths, function(value, path) {\n    return (0,_hasIn_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(object, path);\n  });\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (basePick);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_basePick.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_baseRange.js":
/*!***********************************************!*\
  !*** ../node_modules/lodash-es/_baseRange.js ***!
  \***********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil,\n    nativeMax = Math.max;\n\n/**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\nfunction baseRange(start, end, step, fromRight) {\n  var index = -1,\n      length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n      result = Array(length);\n\n  while (length--) {\n    result[fromRight ? length : ++index] = start;\n    start += step;\n  }\n  return result;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseRange);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_baseRange.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_baseSortBy.js":
/*!************************************************!*\
  !*** ../node_modules/lodash-es/_baseSortBy.js ***!
  \************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\nfunction baseSortBy(array, comparer) {\n  var length = array.length;\n\n  array.sort(comparer);\n  while (length--) {\n    array[length] = array[length].value;\n  }\n  return array;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseSortBy);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_baseSortBy.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_baseZipObject.js":
/*!***************************************************!*\
  !*** ../node_modules/lodash-es/_baseZipObject.js ***!
  \***************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\nfunction baseZipObject(props, values, assignFunc) {\n  var index = -1,\n      length = props.length,\n      valsLength = values.length,\n      result = {};\n\n  while (++index < length) {\n    var value = index < valsLength ? values[index] : undefined;\n    assignFunc(result, props[index], value);\n  }\n  return result;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (baseZipObject);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_baseZipObject.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_compareAscending.js":
/*!******************************************************!*\
  !*** ../node_modules/lodash-es/_compareAscending.js ***!
  \******************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _isSymbol_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./isSymbol.js */ \"../node_modules/lodash-es/isSymbol.js\");\n\n\n/**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\nfunction compareAscending(value, other) {\n  if (value !== other) {\n    var valIsDefined = value !== undefined,\n        valIsNull = value === null,\n        valIsReflexive = value === value,\n        valIsSymbol = (0,_isSymbol_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(value);\n\n    var othIsDefined = other !== undefined,\n        othIsNull = other === null,\n        othIsReflexive = other === other,\n        othIsSymbol = (0,_isSymbol_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(other);\n\n    if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n        (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n        (valIsNull && othIsDefined && othIsReflexive) ||\n        (!valIsDefined && othIsReflexive) ||\n        !valIsReflexive) {\n      return 1;\n    }\n    if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n        (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n        (othIsNull && valIsDefined && valIsReflexive) ||\n        (!othIsDefined && valIsReflexive) ||\n        !othIsReflexive) {\n      return -1;\n    }\n  }\n  return 0;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (compareAscending);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_compareAscending.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_compareMultiple.js":
/*!*****************************************************!*\
  !*** ../node_modules/lodash-es/_compareMultiple.js ***!
  \*****************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _compareAscending_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_compareAscending.js */ \"../node_modules/lodash-es/_compareAscending.js\");\n\n\n/**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\nfunction compareMultiple(object, other, orders) {\n  var index = -1,\n      objCriteria = object.criteria,\n      othCriteria = other.criteria,\n      length = objCriteria.length,\n      ordersLength = orders.length;\n\n  while (++index < length) {\n    var result = (0,_compareAscending_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(objCriteria[index], othCriteria[index]);\n    if (result) {\n      if (index >= ordersLength) {\n        return result;\n      }\n      var order = orders[index];\n      return result * (order == 'desc' ? -1 : 1);\n    }\n  }\n  // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n  // that causes it, under certain circumstances, to provide the same value for\n  // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n  // for more details.\n  //\n  // This also ensures a stable sort in V8 and other engines.\n  // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n  return object.index - other.index;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (compareMultiple);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_compareMultiple.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_createRange.js":
/*!*************************************************!*\
  !*** ../node_modules/lodash-es/_createRange.js ***!
  \*************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseRange_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_baseRange.js */ \"../node_modules/lodash-es/_baseRange.js\");\n/* harmony import */ var _isIterateeCall_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isIterateeCall.js */ \"../node_modules/lodash-es/_isIterateeCall.js\");\n/* harmony import */ var _toFinite_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./toFinite.js */ \"../node_modules/lodash-es/toFinite.js\");\n\n\n\n\n/**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\nfunction createRange(fromRight) {\n  return function(start, end, step) {\n    if (step && typeof step != 'number' && (0,_isIterateeCall_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(start, end, step)) {\n      end = step = undefined;\n    }\n    // Ensure the sign of `-0` is preserved.\n    start = (0,_toFinite_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(start);\n    if (end === undefined) {\n      end = start;\n      start = 0;\n    } else {\n      end = (0,_toFinite_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(end);\n    }\n    step = step === undefined ? (start < end ? 1 : -1) : (0,_toFinite_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(step);\n    return (0,_baseRange_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"])(start, end, step, fromRight);\n  };\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (createRange);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_createRange.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_flatRest.js":
/*!**********************************************!*\
  !*** ../node_modules/lodash-es/_flatRest.js ***!
  \**********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _flatten_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./flatten.js */ \"../node_modules/lodash-es/flatten.js\");\n/* harmony import */ var _overRest_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_overRest.js */ \"../node_modules/lodash-es/_overRest.js\");\n/* harmony import */ var _setToString_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_setToString.js */ \"../node_modules/lodash-es/_setToString.js\");\n\n\n\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return (0,_setToString_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])((0,_overRest_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(func, undefined, _flatten_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"]), func + '');\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (flatRest);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_flatRest.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_stringSize.js":
/*!************************************************!*\
  !*** ../node_modules/lodash-es/_stringSize.js ***!
  \************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _asciiSize_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_asciiSize.js */ \"../node_modules/lodash-es/_asciiSize.js\");\n/* harmony import */ var _hasUnicode_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_hasUnicode.js */ \"../node_modules/lodash-es/_hasUnicode.js\");\n/* harmony import */ var _unicodeSize_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_unicodeSize.js */ \"../node_modules/lodash-es/_unicodeSize.js\");\n\n\n\n\n/**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\nfunction stringSize(string) {\n  return (0,_hasUnicode_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(string)\n    ? (0,_unicodeSize_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(string)\n    : (0,_asciiSize_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"])(string);\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (stringSize);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_stringSize.js?");

/***/ }),

/***/ "../node_modules/lodash-es/_unicodeSize.js":
/*!*************************************************!*\
  !*** ../node_modules/lodash-es/_unicodeSize.js ***!
  \*************************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nfunction unicodeSize(string) {\n  var result = reUnicode.lastIndex = 0;\n  while (reUnicode.test(string)) {\n    ++result;\n  }\n  return result;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (unicodeSize);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/_unicodeSize.js?");

/***/ }),

/***/ "../node_modules/lodash-es/cloneDeep.js":
/*!**********************************************!*\
  !*** ../node_modules/lodash-es/cloneDeep.js ***!
  \**********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseClone_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_baseClone.js */ \"../node_modules/lodash-es/_baseClone.js\");\n\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return (0,_baseClone_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (cloneDeep);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/cloneDeep.js?");

/***/ }),

/***/ "../node_modules/lodash-es/forIn.js":
/*!******************************************!*\
  !*** ../node_modules/lodash-es/forIn.js ***!
  \******************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseFor_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_baseFor.js */ \"../node_modules/lodash-es/_baseFor.js\");\n/* harmony import */ var _castFunction_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_castFunction.js */ \"../node_modules/lodash-es/_castFunction.js\");\n/* harmony import */ var _keysIn_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./keysIn.js */ \"../node_modules/lodash-es/keysIn.js\");\n\n\n\n\n/**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\nfunction forIn(object, iteratee) {\n  return object == null\n    ? object\n    : (0,_baseFor_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(object, (0,_castFunction_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(iteratee), _keysIn_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"]);\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (forIn);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/forIn.js?");

/***/ }),

/***/ "../node_modules/lodash-es/forOwn.js":
/*!*******************************************!*\
  !*** ../node_modules/lodash-es/forOwn.js ***!
  \*******************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseForOwn_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_baseForOwn.js */ \"../node_modules/lodash-es/_baseForOwn.js\");\n/* harmony import */ var _castFunction_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_castFunction.js */ \"../node_modules/lodash-es/_castFunction.js\");\n\n\n\n/**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forOwn(object, iteratee) {\n  return object && (0,_baseForOwn_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(object, (0,_castFunction_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(iteratee));\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (forOwn);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/forOwn.js?");

/***/ }),

/***/ "../node_modules/lodash-es/mapValues.js":
/*!**********************************************!*\
  !*** ../node_modules/lodash-es/mapValues.js ***!
  \**********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseAssignValue_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_baseAssignValue.js */ \"../node_modules/lodash-es/_baseAssignValue.js\");\n/* harmony import */ var _baseForOwn_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_baseForOwn.js */ \"../node_modules/lodash-es/_baseForOwn.js\");\n/* harmony import */ var _baseIteratee_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_baseIteratee.js */ \"../node_modules/lodash-es/_baseIteratee.js\");\n\n\n\n\n/**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n *   'fred':    { 'user': 'fred',    'age': 40 },\n *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\nfunction mapValues(object, iteratee) {\n  var result = {};\n  iteratee = (0,_baseIteratee_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(iteratee, 3);\n\n  (0,_baseForOwn_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(object, function(value, key, object) {\n    (0,_baseAssignValue_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"])(result, key, iteratee(value, key, object));\n  });\n  return result;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (mapValues);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/mapValues.js?");

/***/ }),

/***/ "../node_modules/lodash-es/max.js":
/*!****************************************!*\
  !*** ../node_modules/lodash-es/max.js ***!
  \****************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseExtremum_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_baseExtremum.js */ \"../node_modules/lodash-es/_baseExtremum.js\");\n/* harmony import */ var _baseGt_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_baseGt.js */ \"../node_modules/lodash-es/_baseGt.js\");\n/* harmony import */ var _identity_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./identity.js */ \"../node_modules/lodash-es/identity.js\");\n\n\n\n\n/**\n * Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * _.max([4, 2, 8, 6]);\n * // => 8\n *\n * _.max([]);\n * // => undefined\n */\nfunction max(array) {\n  return (array && array.length)\n    ? (0,_baseExtremum_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(array, _identity_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"], _baseGt_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"])\n    : undefined;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (max);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/max.js?");

/***/ }),

/***/ "../node_modules/lodash-es/minBy.js":
/*!******************************************!*\
  !*** ../node_modules/lodash-es/minBy.js ***!
  \******************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseExtremum_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_baseExtremum.js */ \"../node_modules/lodash-es/_baseExtremum.js\");\n/* harmony import */ var _baseIteratee_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_baseIteratee.js */ \"../node_modules/lodash-es/_baseIteratee.js\");\n/* harmony import */ var _baseLt_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_baseLt.js */ \"../node_modules/lodash-es/_baseLt.js\");\n\n\n\n\n/**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\nfunction minBy(array, iteratee) {\n  return (array && array.length)\n    ? (0,_baseExtremum_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(array, (0,_baseIteratee_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(iteratee, 2), _baseLt_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"])\n    : undefined;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (minBy);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/minBy.js?");

/***/ }),

/***/ "../node_modules/lodash-es/now.js":
/*!****************************************!*\
  !*** ../node_modules/lodash-es/now.js ***!
  \****************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _root_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_root.js */ \"../node_modules/lodash-es/_root.js\");\n\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return _root_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"].Date.now();\n};\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (now);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/now.js?");

/***/ }),

/***/ "../node_modules/lodash-es/pick.js":
/*!*****************************************!*\
  !*** ../node_modules/lodash-es/pick.js ***!
  \*****************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _basePick_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_basePick.js */ \"../node_modules/lodash-es/_basePick.js\");\n/* harmony import */ var _flatRest_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_flatRest.js */ \"../node_modules/lodash-es/_flatRest.js\");\n\n\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = (0,_flatRest_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(function(object, paths) {\n  return object == null ? {} : (0,_basePick_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(object, paths);\n});\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (pick);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/pick.js?");

/***/ }),

/***/ "../node_modules/lodash-es/range.js":
/*!******************************************!*\
  !*** ../node_modules/lodash-es/range.js ***!
  \******************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _createRange_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_createRange.js */ \"../node_modules/lodash-es/_createRange.js\");\n\n\n/**\n * Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n *\n * _.range(4);\n * // => [0, 1, 2, 3]\n *\n * _.range(-4);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 5);\n * // => [1, 2, 3, 4]\n *\n * _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n *\n * _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.range(0);\n * // => []\n */\nvar range = (0,_createRange_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])();\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (range);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/range.js?");

/***/ }),

/***/ "../node_modules/lodash-es/size.js":
/*!*****************************************!*\
  !*** ../node_modules/lodash-es/size.js ***!
  \*****************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseKeys_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./_baseKeys.js */ \"../node_modules/lodash-es/_baseKeys.js\");\n/* harmony import */ var _getTag_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./_getTag.js */ \"../node_modules/lodash-es/_getTag.js\");\n/* harmony import */ var _isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./isArrayLike.js */ \"../node_modules/lodash-es/isArrayLike.js\");\n/* harmony import */ var _isString_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./isString.js */ \"../node_modules/lodash-es/isString.js\");\n/* harmony import */ var _stringSize_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_stringSize.js */ \"../node_modules/lodash-es/_stringSize.js\");\n\n\n\n\n\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\nfunction size(collection) {\n  if (collection == null) {\n    return 0;\n  }\n  if ((0,_isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(collection)) {\n    return (0,_isString_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(collection) ? (0,_stringSize_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"])(collection) : collection.length;\n  }\n  var tag = (0,_getTag_js__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(collection);\n  if (tag == mapTag || tag == setTag) {\n    return collection.size;\n  }\n  return (0,_baseKeys_js__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(collection).length;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (size);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/size.js?");

/***/ }),

/***/ "../node_modules/lodash-es/sortBy.js":
/*!*******************************************!*\
  !*** ../node_modules/lodash-es/sortBy.js ***!
  \*******************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _baseFlatten_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./_baseFlatten.js */ \"../node_modules/lodash-es/_baseFlatten.js\");\n/* harmony import */ var _baseOrderBy_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_baseOrderBy.js */ \"../node_modules/lodash-es/_baseOrderBy.js\");\n/* harmony import */ var _baseRest_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_baseRest.js */ \"../node_modules/lodash-es/_baseRest.js\");\n/* harmony import */ var _isIterateeCall_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_isIterateeCall.js */ \"../node_modules/lodash-es/_isIterateeCall.js\");\n\n\n\n\n\n/**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n *  The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n *   { 'user': 'fred',   'age': 48 },\n *   { 'user': 'barney', 'age': 36 },\n *   { 'user': 'fred',   'age': 30 },\n *   { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\nvar sortBy = (0,_baseRest_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(function(collection, iteratees) {\n  if (collection == null) {\n    return [];\n  }\n  var length = iteratees.length;\n  if (length > 1 && (0,_isIterateeCall_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(collection, iteratees[0], iteratees[1])) {\n    iteratees = [];\n  } else if (length > 2 && (0,_isIterateeCall_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(iteratees[0], iteratees[1], iteratees[2])) {\n    iteratees = [iteratees[0]];\n  }\n  return (0,_baseOrderBy_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"])(collection, (0,_baseFlatten_js__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(iteratees, 1), []);\n});\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (sortBy);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/sortBy.js?");

/***/ }),

/***/ "../node_modules/lodash-es/transform.js":
/*!**********************************************!*\
  !*** ../node_modules/lodash-es/transform.js ***!
  \**********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _arrayEach_js__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./_arrayEach.js */ \"../node_modules/lodash-es/_arrayEach.js\");\n/* harmony import */ var _baseCreate_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./_baseCreate.js */ \"../node_modules/lodash-es/_baseCreate.js\");\n/* harmony import */ var _baseForOwn_js__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./_baseForOwn.js */ \"../node_modules/lodash-es/_baseForOwn.js\");\n/* harmony import */ var _baseIteratee_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./_baseIteratee.js */ \"../node_modules/lodash-es/_baseIteratee.js\");\n/* harmony import */ var _getPrototype_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./_getPrototype.js */ \"../node_modules/lodash-es/_getPrototype.js\");\n/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./isArray.js */ \"../node_modules/lodash-es/isArray.js\");\n/* harmony import */ var _isBuffer_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./isBuffer.js */ \"../node_modules/lodash-es/isBuffer.js\");\n/* harmony import */ var _isFunction_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./isFunction.js */ \"../node_modules/lodash-es/isFunction.js\");\n/* harmony import */ var _isObject_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./isObject.js */ \"../node_modules/lodash-es/isObject.js\");\n/* harmony import */ var _isTypedArray_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./isTypedArray.js */ \"../node_modules/lodash-es/isTypedArray.js\");\n\n\n\n\n\n\n\n\n\n\n\n/**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n *   result.push(n *= n);\n *   return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\nfunction transform(object, iteratee, accumulator) {\n  var isArr = (0,_isArray_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(object),\n      isArrLike = isArr || (0,_isBuffer_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"])(object) || (0,_isTypedArray_js__WEBPACK_IMPORTED_MODULE_2__[\"default\"])(object);\n\n  iteratee = (0,_baseIteratee_js__WEBPACK_IMPORTED_MODULE_3__[\"default\"])(iteratee, 4);\n  if (accumulator == null) {\n    var Ctor = object && object.constructor;\n    if (isArrLike) {\n      accumulator = isArr ? new Ctor : [];\n    }\n    else if ((0,_isObject_js__WEBPACK_IMPORTED_MODULE_4__[\"default\"])(object)) {\n      accumulator = (0,_isFunction_js__WEBPACK_IMPORTED_MODULE_5__[\"default\"])(Ctor) ? (0,_baseCreate_js__WEBPACK_IMPORTED_MODULE_6__[\"default\"])((0,_getPrototype_js__WEBPACK_IMPORTED_MODULE_7__[\"default\"])(object)) : {};\n    }\n    else {\n      accumulator = {};\n    }\n  }\n  (isArrLike ? _arrayEach_js__WEBPACK_IMPORTED_MODULE_8__[\"default\"] : _baseForOwn_js__WEBPACK_IMPORTED_MODULE_9__[\"default\"])(object, function(value, index, object) {\n    return iteratee(accumulator, value, index, object);\n  });\n  return accumulator;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (transform);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/transform.js?");

/***/ }),

/***/ "../node_modules/lodash-es/uniqueId.js":
/*!*********************************************!*\
  !*** ../node_modules/lodash-es/uniqueId.js ***!
  \*********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _toString_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toString.js */ \"../node_modules/lodash-es/toString.js\");\n\n\n/** Used to generate unique IDs. */\nvar idCounter = 0;\n\n/**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return (0,_toString_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(prefix) + id;\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (uniqueId);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/uniqueId.js?");

/***/ }),

/***/ "../node_modules/lodash-es/zipObject.js":
/*!**********************************************!*\
  !*** ../node_modules/lodash-es/zipObject.js ***!
  \**********************************************/
/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {

eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   \"default\": () => (__WEBPACK_DEFAULT_EXPORT__)\n/* harmony export */ });\n/* harmony import */ var _assignValue_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_assignValue.js */ \"../node_modules/lodash-es/_assignValue.js\");\n/* harmony import */ var _baseZipObject_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_baseZipObject.js */ \"../node_modules/lodash-es/_baseZipObject.js\");\n\n\n\n/**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\nfunction zipObject(props, values) {\n  return (0,_baseZipObject_js__WEBPACK_IMPORTED_MODULE_0__[\"default\"])(props || [], values || [], _assignValue_js__WEBPACK_IMPORTED_MODULE_1__[\"default\"]);\n}\n\n/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (zipObject);\n\n\n//# sourceURL=webpack://_JUPYTERLAB.CORE_OUTPUT/../node_modules/lodash-es/zipObject.js?");

/***/ })

}]);