@dpuse/dpuse-tool-d3-visualiser 0.0.49 → 0.0.51

package/dist/linear-q6e-7JBm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"linear-q6e-7JBm.js","names":["number","number","value","value","constant","number","rgb","string","date","numberArray","object","constant","bisect","interpolateValue","interpolateNumber","interpolateRound","formatDecimal","formatRounded","formatPrefixAuto","identity","formatGroup","formatNumerals","formatTypes","formatTrim","exponent","formatLocale","exponent","exponent","exponent","precisionPrefix","precisionRound","precisionFixed"],"sources":["../node_modules/d3-array/src/ascending.js","../node_modules/d3-array/src/descending.js","../node_modules/d3-array/src/bisector.js","../node_modules/d3-array/src/number.js","../node_modules/d3-array/src/bisect.js","../node_modules/d3-array/src/ticks.js","../node_modules/d3-interpolate/src/numberArray.js","../node_modules/d3-interpolate/src/array.js","../node_modules/d3-interpolate/src/date.js","../node_modules/d3-interpolate/src/object.js","../node_modules/d3-interpolate/src/value.js","../node_modules/d3-interpolate/src/round.js","../node_modules/d3-scale/src/init.js","../node_modules/d3-scale/src/constant.js","../node_modules/d3-scale/src/number.js","../node_modules/d3-scale/src/continuous.js","../node_modules/d3-format/src/formatDecimal.js","../node_modules/d3-format/src/exponent.js","../node_modules/d3-format/src/formatGroup.js","../node_modules/d3-format/src/formatNumerals.js","../node_modules/d3-format/src/formatSpecifier.js","../node_modules/d3-format/src/formatTrim.js","../node_modules/d3-format/src/formatPrefixAuto.js","../node_modules/d3-format/src/formatRounded.js","../node_modules/d3-format/src/formatTypes.js","../node_modules/d3-format/src/identity.js","../node_modules/d3-format/src/locale.js","../node_modules/d3-format/src/defaultLocale.js","../node_modules/d3-format/src/precisionFixed.js","../node_modules/d3-format/src/precisionPrefix.js","../node_modules/d3-format/src/precisionRound.js","../node_modules/d3-scale/src/tickFormat.js","../node_modules/d3-scale/src/linear.js"],"sourcesContent":["export default function ascending(a, b) {\n  return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n","export default function descending(a, b) {\n  return a == null || b == null ? NaN\n    : b < a ? -1\n    : b > a ? 1\n    : b >= a ? 0\n    : NaN;\n}\n","import ascending from \"./ascending.js\";\nimport descending from \"./descending.js\";\n\nexport default function bisector(f) {\n  let compare1, compare2, delta;\n\n  // If an accessor is specified, promote it to a comparator. In this case we\n  // can test whether the search value is (self-) comparable. We can’t do this\n  // for a comparator (except for specific, known comparators) because we can’t\n  // tell if the comparator is symmetric, and an asymmetric comparator can’t be\n  // used to test whether a single value is comparable.\n  if (f.length !== 2) {\n    compare1 = ascending;\n    compare2 = (d, x) => ascending(f(d), x);\n    delta = (d, x) => f(d) - x;\n  } else {\n    compare1 = f === ascending || f === descending ? f : zero;\n    compare2 = f;\n    delta = f;\n  }\n\n  function left(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) < 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function right(a, x, lo = 0, hi = a.length) {\n    if (lo < hi) {\n      if (compare1(x, x) !== 0) return hi;\n      do {\n        const mid = (lo + hi) >>> 1;\n        if (compare2(a[mid], x) <= 0) lo = mid + 1;\n        else hi = mid;\n      } while (lo < hi);\n    }\n    return lo;\n  }\n\n  function center(a, x, lo = 0, hi = a.length) {\n    const i = left(a, x, lo, hi - 1);\n    return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;\n  }\n\n  return {left, center, right};\n}\n\nfunction zero() {\n  return 0;\n}\n","export default function number(x) {\n  return x === null ? NaN : +x;\n}\n\nexport function* numbers(values, valueof) {\n  if (valueof === undefined) {\n    for (let value of values) {\n      if (value != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  } else {\n    let index = -1;\n    for (let value of values) {\n      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {\n        yield value;\n      }\n    }\n  }\n}\n","import ascending from \"./ascending.js\";\nimport bisector from \"./bisector.js\";\nimport number from \"./number.js\";\n\nconst ascendingBisect = bisector(ascending);\nexport const bisectRight = ascendingBisect.right;\nexport const bisectLeft = ascendingBisect.left;\nexport const bisectCenter = bisector(number).center;\nexport default bisectRight;\n","const e10 = Math.sqrt(50),\n    e5 = Math.sqrt(10),\n    e2 = Math.sqrt(2);\n\nfunction tickSpec(start, stop, count) {\n  const step = (stop - start) / Math.max(0, count),\n      power = Math.floor(Math.log10(step)),\n      error = step / Math.pow(10, power),\n      factor = error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1;\n  let i1, i2, inc;\n  if (power < 0) {\n    inc = Math.pow(10, -power) / factor;\n    i1 = Math.round(start * inc);\n    i2 = Math.round(stop * inc);\n    if (i1 / inc < start) ++i1;\n    if (i2 / inc > stop) --i2;\n    inc = -inc;\n  } else {\n    inc = Math.pow(10, power) * factor;\n    i1 = Math.round(start / inc);\n    i2 = Math.round(stop / inc);\n    if (i1 * inc < start) ++i1;\n    if (i2 * inc > stop) --i2;\n  }\n  if (i2 < i1 && 0.5 <= count && count < 2) return tickSpec(start, stop, count * 2);\n  return [i1, i2, inc];\n}\n\nexport default function ticks(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  if (!(count > 0)) return [];\n  if (start === stop) return [start];\n  const reverse = stop < start, [i1, i2, inc] = reverse ? tickSpec(stop, start, count) : tickSpec(start, stop, count);\n  if (!(i2 >= i1)) return [];\n  const n = i2 - i1 + 1, ticks = new Array(n);\n  if (reverse) {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i2 - i) * inc;\n  } else {\n    if (inc < 0) for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) / -inc;\n    else for (let i = 0; i < n; ++i) ticks[i] = (i1 + i) * inc;\n  }\n  return ticks;\n}\n\nexport function tickIncrement(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  return tickSpec(start, stop, count)[2];\n}\n\nexport function tickStep(start, stop, count) {\n  stop = +stop, start = +start, count = +count;\n  const reverse = stop < start, inc = reverse ? tickIncrement(stop, start, count) : tickIncrement(start, stop, count);\n  return (reverse ? -1 : 1) * (inc < 0 ? 1 / -inc : inc);\n}\n","export default function(a, b) {\n  if (!b) b = [];\n  var n = a ? Math.min(b.length, a.length) : 0,\n      c = b.slice(),\n      i;\n  return function(t) {\n    for (i = 0; i < n; ++i) c[i] = a[i] * (1 - t) + b[i] * t;\n    return c;\n  };\n}\n\nexport function isNumberArray(x) {\n  return ArrayBuffer.isView(x) && !(x instanceof DataView);\n}\n","import value from \"./value.js\";\nimport numberArray, {isNumberArray} from \"./numberArray.js\";\n\nexport default function(a, b) {\n  return (isNumberArray(b) ? numberArray : genericArray)(a, b);\n}\n\nexport function genericArray(a, b) {\n  var nb = b ? b.length : 0,\n      na = a ? Math.min(nb, a.length) : 0,\n      x = new Array(na),\n      c = new Array(nb),\n      i;\n\n  for (i = 0; i < na; ++i) x[i] = value(a[i], b[i]);\n  for (; i < nb; ++i) c[i] = b[i];\n\n  return function(t) {\n    for (i = 0; i < na; ++i) c[i] = x[i](t);\n    return c;\n  };\n}\n","export default function(a, b) {\n  var d = new Date;\n  return a = +a, b = +b, function(t) {\n    return d.setTime(a * (1 - t) + b * t), d;\n  };\n}\n","import value from \"./value.js\";\n\nexport default function(a, b) {\n  var i = {},\n      c = {},\n      k;\n\n  if (a === null || typeof a !== \"object\") a = {};\n  if (b === null || typeof b !== \"object\") b = {};\n\n  for (k in b) {\n    if (k in a) {\n      i[k] = value(a[k], b[k]);\n    } else {\n      c[k] = b[k];\n    }\n  }\n\n  return function(t) {\n    for (k in i) c[k] = i[k](t);\n    return c;\n  };\n}\n","import {color} from \"d3-color\";\nimport rgb from \"./rgb.js\";\nimport {genericArray} from \"./array.js\";\nimport date from \"./date.js\";\nimport number from \"./number.js\";\nimport object from \"./object.js\";\nimport string from \"./string.js\";\nimport constant from \"./constant.js\";\nimport numberArray, {isNumberArray} from \"./numberArray.js\";\n\nexport default function(a, b) {\n  var t = typeof b, c;\n  return b == null || t === \"boolean\" ? constant(b)\n      : (t === \"number\" ? number\n      : t === \"string\" ? ((c = color(b)) ? (b = c, rgb) : string)\n      : b instanceof color ? rgb\n      : b instanceof Date ? date\n      : isNumberArray(b) ? numberArray\n      : Array.isArray(b) ? genericArray\n      : typeof b.valueOf !== \"function\" && typeof b.toString !== \"function\" || isNaN(b) ? object\n      : number)(a, b);\n}\n","export default function(a, b) {\n  return a = +a, b = +b, function(t) {\n    return Math.round(a * (1 - t) + b * t);\n  };\n}\n","export function initRange(domain, range) {\n  switch (arguments.length) {\n    case 0: break;\n    case 1: this.range(domain); break;\n    default: this.range(range).domain(domain); break;\n  }\n  return this;\n}\n\nexport function initInterpolator(domain, interpolator) {\n  switch (arguments.length) {\n    case 0: break;\n    case 1: {\n      if (typeof domain === \"function\") this.interpolator(domain);\n      else this.range(domain);\n      break;\n    }\n    default: {\n      this.domain(domain);\n      if (typeof interpolator === \"function\") this.interpolator(interpolator);\n      else this.range(interpolator);\n      break;\n    }\n  }\n  return this;\n}\n","export default function constants(x) {\n  return function() {\n    return x;\n  };\n}\n","export default function number(x) {\n  return +x;\n}\n","import {bisect} from \"d3-array\";\nimport {interpolate as interpolateValue, interpolateNumber, interpolateRound} from \"d3-interpolate\";\nimport constant from \"./constant.js\";\nimport number from \"./number.js\";\n\nvar unit = [0, 1];\n\nexport function identity(x) {\n  return x;\n}\n\nfunction normalize(a, b) {\n  return (b -= (a = +a))\n      ? function(x) { return (x - a) / b; }\n      : constant(isNaN(b) ? NaN : 0.5);\n}\n\nfunction clamper(a, b) {\n  var t;\n  if (a > b) t = a, a = b, b = t;\n  return function(x) { return Math.max(a, Math.min(b, x)); };\n}\n\n// normalize(a, b)(x) takes a domain value x in [a,b] and returns the corresponding parameter t in [0,1].\n// interpolate(a, b)(t) takes a parameter t in [0,1] and returns the corresponding range value x in [a,b].\nfunction bimap(domain, range, interpolate) {\n  var d0 = domain[0], d1 = domain[1], r0 = range[0], r1 = range[1];\n  if (d1 < d0) d0 = normalize(d1, d0), r0 = interpolate(r1, r0);\n  else d0 = normalize(d0, d1), r0 = interpolate(r0, r1);\n  return function(x) { return r0(d0(x)); };\n}\n\nfunction polymap(domain, range, interpolate) {\n  var j = Math.min(domain.length, range.length) - 1,\n      d = new Array(j),\n      r = new Array(j),\n      i = -1;\n\n  // Reverse descending domains.\n  if (domain[j] < domain[0]) {\n    domain = domain.slice().reverse();\n    range = range.slice().reverse();\n  }\n\n  while (++i < j) {\n    d[i] = normalize(domain[i], domain[i + 1]);\n    r[i] = interpolate(range[i], range[i + 1]);\n  }\n\n  return function(x) {\n    var i = bisect(domain, x, 1, j) - 1;\n    return r[i](d[i](x));\n  };\n}\n\nexport function copy(source, target) {\n  return target\n      .domain(source.domain())\n      .range(source.range())\n      .interpolate(source.interpolate())\n      .clamp(source.clamp())\n      .unknown(source.unknown());\n}\n\nexport function transformer() {\n  var domain = unit,\n      range = unit,\n      interpolate = interpolateValue,\n      transform,\n      untransform,\n      unknown,\n      clamp = identity,\n      piecewise,\n      output,\n      input;\n\n  function rescale() {\n    var n = Math.min(domain.length, range.length);\n    if (clamp !== identity) clamp = clamper(domain[0], domain[n - 1]);\n    piecewise = n > 2 ? polymap : bimap;\n    output = input = null;\n    return scale;\n  }\n\n  function scale(x) {\n    return x == null || isNaN(x = +x) ? unknown : (output || (output = piecewise(domain.map(transform), range, interpolate)))(transform(clamp(x)));\n  }\n\n  scale.invert = function(y) {\n    return clamp(untransform((input || (input = piecewise(range, domain.map(transform), interpolateNumber)))(y)));\n  };\n\n  scale.domain = function(_) {\n    return arguments.length ? (domain = Array.from(_, number), rescale()) : domain.slice();\n  };\n\n  scale.range = function(_) {\n    return arguments.length ? (range = Array.from(_), rescale()) : range.slice();\n  };\n\n  scale.rangeRound = function(_) {\n    return range = Array.from(_), interpolate = interpolateRound, rescale();\n  };\n\n  scale.clamp = function(_) {\n    return arguments.length ? (clamp = _ ? true : identity, rescale()) : clamp !== identity;\n  };\n\n  scale.interpolate = function(_) {\n    return arguments.length ? (interpolate = _, rescale()) : interpolate;\n  };\n\n  scale.unknown = function(_) {\n    return arguments.length ? (unknown = _, scale) : unknown;\n  };\n\n  return function(t, u) {\n    transform = t, untransform = u;\n    return rescale();\n  };\n}\n\nexport default function continuous() {\n  return transformer()(identity, identity);\n}\n","export default function(x) {\n  return Math.abs(x = Math.round(x)) >= 1e21\n      ? x.toLocaleString(\"en\").replace(/,/g, \"\")\n      : x.toString(10);\n}\n\n// Computes the decimal coefficient and exponent of the specified number x with\n// significant digits p, where x is positive and p is in [1, 21] or undefined.\n// For example, formatDecimalParts(1.23) returns [\"123\", 0].\nexport function formatDecimalParts(x, p) {\n  if (!isFinite(x) || x === 0) return null; // NaN, ±Infinity, ±0\n  var i = (x = p ? x.toExponential(p - 1) : x.toExponential()).indexOf(\"e\"), coefficient = x.slice(0, i);\n\n  // The string returned by toExponential either has the form \\d\\.\\d+e[-+]\\d+\n  // (e.g., 1.2e+3) or the form \\de[-+]\\d+ (e.g., 1e+3).\n  return [\n    coefficient.length > 1 ? coefficient[0] + coefficient.slice(2) : coefficient,\n    +x.slice(i + 1)\n  ];\n}\n","import {formatDecimalParts} from \"./formatDecimal.js\";\n\nexport default function(x) {\n  return x = formatDecimalParts(Math.abs(x)), x ? x[1] : NaN;\n}\n","export default function(grouping, thousands) {\n  return function(value, width) {\n    var i = value.length,\n        t = [],\n        j = 0,\n        g = grouping[0],\n        length = 0;\n\n    while (i > 0 && g > 0) {\n      if (length + g + 1 > width) g = Math.max(1, width - length);\n      t.push(value.substring(i -= g, i + g));\n      if ((length += g + 1) > width) break;\n      g = grouping[j = (j + 1) % grouping.length];\n    }\n\n    return t.reverse().join(thousands);\n  };\n}\n","export default function(numerals) {\n  return function(value) {\n    return value.replace(/[0-9]/g, function(i) {\n      return numerals[+i];\n    });\n  };\n}\n","// [[fill]align][sign][symbol][0][width][,][.precision][~][type]\nvar re = /^(?:(.)?([<>=^]))?([+\\-( ])?([$#])?(0)?(\\d+)?(,)?(\\.\\d+)?(~)?([a-z%])?$/i;\n\nexport default function formatSpecifier(specifier) {\n  if (!(match = re.exec(specifier))) throw new Error(\"invalid format: \" + specifier);\n  var match;\n  return new FormatSpecifier({\n    fill: match[1],\n    align: match[2],\n    sign: match[3],\n    symbol: match[4],\n    zero: match[5],\n    width: match[6],\n    comma: match[7],\n    precision: match[8] && match[8].slice(1),\n    trim: match[9],\n    type: match[10]\n  });\n}\n\nformatSpecifier.prototype = FormatSpecifier.prototype; // instanceof\n\nexport function FormatSpecifier(specifier) {\n  this.fill = specifier.fill === undefined ? \" \" : specifier.fill + \"\";\n  this.align = specifier.align === undefined ? \">\" : specifier.align + \"\";\n  this.sign = specifier.sign === undefined ? \"-\" : specifier.sign + \"\";\n  this.symbol = specifier.symbol === undefined ? \"\" : specifier.symbol + \"\";\n  this.zero = !!specifier.zero;\n  this.width = specifier.width === undefined ? undefined : +specifier.width;\n  this.comma = !!specifier.comma;\n  this.precision = specifier.precision === undefined ? undefined : +specifier.precision;\n  this.trim = !!specifier.trim;\n  this.type = specifier.type === undefined ? \"\" : specifier.type + \"\";\n}\n\nFormatSpecifier.prototype.toString = function() {\n  return this.fill\n      + this.align\n      + this.sign\n      + this.symbol\n      + (this.zero ? \"0\" : \"\")\n      + (this.width === undefined ? \"\" : Math.max(1, this.width | 0))\n      + (this.comma ? \",\" : \"\")\n      + (this.precision === undefined ? \"\" : \".\" + Math.max(0, this.precision | 0))\n      + (this.trim ? \"~\" : \"\")\n      + this.type;\n};\n","// Trims insignificant zeros, e.g., replaces 1.2000k with 1.2k.\nexport default function(s) {\n  out: for (var n = s.length, i = 1, i0 = -1, i1; i < n; ++i) {\n    switch (s[i]) {\n      case \".\": i0 = i1 = i; break;\n      case \"0\": if (i0 === 0) i0 = i; i1 = i; break;\n      default: if (!+s[i]) break out; if (i0 > 0) i0 = 0; break;\n    }\n  }\n  return i0 > 0 ? s.slice(0, i0) + s.slice(i1 + 1) : s;\n}\n","import {formatDecimalParts} from \"./formatDecimal.js\";\n\nexport var prefixExponent;\n\nexport default function(x, p) {\n  var d = formatDecimalParts(x, p);\n  if (!d) return prefixExponent = undefined, x.toPrecision(p);\n  var coefficient = d[0],\n      exponent = d[1],\n      i = exponent - (prefixExponent = Math.max(-8, Math.min(8, Math.floor(exponent / 3))) * 3) + 1,\n      n = coefficient.length;\n  return i === n ? coefficient\n      : i > n ? coefficient + new Array(i - n + 1).join(\"0\")\n      : i > 0 ? coefficient.slice(0, i) + \".\" + coefficient.slice(i)\n      : \"0.\" + new Array(1 - i).join(\"0\") + formatDecimalParts(x, Math.max(0, p + i - 1))[0]; // less than 1y!\n}\n","import {formatDecimalParts} from \"./formatDecimal.js\";\n\nexport default function(x, p) {\n  var d = formatDecimalParts(x, p);\n  if (!d) return x + \"\";\n  var coefficient = d[0],\n      exponent = d[1];\n  return exponent < 0 ? \"0.\" + new Array(-exponent).join(\"0\") + coefficient\n      : coefficient.length > exponent + 1 ? coefficient.slice(0, exponent + 1) + \".\" + coefficient.slice(exponent + 1)\n      : coefficient + new Array(exponent - coefficient.length + 2).join(\"0\");\n}\n","import formatDecimal from \"./formatDecimal.js\";\nimport formatPrefixAuto from \"./formatPrefixAuto.js\";\nimport formatRounded from \"./formatRounded.js\";\n\nexport default {\n  \"%\": (x, p) => (x * 100).toFixed(p),\n  \"b\": (x) => Math.round(x).toString(2),\n  \"c\": (x) => x + \"\",\n  \"d\": formatDecimal,\n  \"e\": (x, p) => x.toExponential(p),\n  \"f\": (x, p) => x.toFixed(p),\n  \"g\": (x, p) => x.toPrecision(p),\n  \"o\": (x) => Math.round(x).toString(8),\n  \"p\": (x, p) => formatRounded(x * 100, p),\n  \"r\": formatRounded,\n  \"s\": formatPrefixAuto,\n  \"X\": (x) => Math.round(x).toString(16).toUpperCase(),\n  \"x\": (x) => Math.round(x).toString(16)\n};\n","export default function(x) {\n  return x;\n}\n","import exponent from \"./exponent.js\";\nimport formatGroup from \"./formatGroup.js\";\nimport formatNumerals from \"./formatNumerals.js\";\nimport formatSpecifier from \"./formatSpecifier.js\";\nimport formatTrim from \"./formatTrim.js\";\nimport formatTypes from \"./formatTypes.js\";\nimport {prefixExponent} from \"./formatPrefixAuto.js\";\nimport identity from \"./identity.js\";\n\nvar map = Array.prototype.map,\n    prefixes = [\"y\",\"z\",\"a\",\"f\",\"p\",\"n\",\"µ\",\"m\",\"\",\"k\",\"M\",\"G\",\"T\",\"P\",\"E\",\"Z\",\"Y\"];\n\nexport default function(locale) {\n  var group = locale.grouping === undefined || locale.thousands === undefined ? identity : formatGroup(map.call(locale.grouping, Number), locale.thousands + \"\"),\n      currencyPrefix = locale.currency === undefined ? \"\" : locale.currency[0] + \"\",\n      currencySuffix = locale.currency === undefined ? \"\" : locale.currency[1] + \"\",\n      decimal = locale.decimal === undefined ? \".\" : locale.decimal + \"\",\n      numerals = locale.numerals === undefined ? identity : formatNumerals(map.call(locale.numerals, String)),\n      percent = locale.percent === undefined ? \"%\" : locale.percent + \"\",\n      minus = locale.minus === undefined ? \"−\" : locale.minus + \"\",\n      nan = locale.nan === undefined ? \"NaN\" : locale.nan + \"\";\n\n  function newFormat(specifier, options) {\n    specifier = formatSpecifier(specifier);\n\n    var fill = specifier.fill,\n        align = specifier.align,\n        sign = specifier.sign,\n        symbol = specifier.symbol,\n        zero = specifier.zero,\n        width = specifier.width,\n        comma = specifier.comma,\n        precision = specifier.precision,\n        trim = specifier.trim,\n        type = specifier.type;\n\n    // The \"n\" type is an alias for \",g\".\n    if (type === \"n\") comma = true, type = \"g\";\n\n    // The \"\" type, and any invalid type, is an alias for \".12~g\".\n    else if (!formatTypes[type]) precision === undefined && (precision = 12), trim = true, type = \"g\";\n\n    // If zero fill is specified, padding goes after sign and before digits.\n    if (zero || (fill === \"0\" && align === \"=\")) zero = true, fill = \"0\", align = \"=\";\n\n    // Compute the prefix and suffix.\n    // For SI-prefix, the suffix is lazily computed.\n    var prefix = (options && options.prefix !== undefined ? options.prefix : \"\") + (symbol === \"$\" ? currencyPrefix : symbol === \"#\" && /[boxX]/.test(type) ? \"0\" + type.toLowerCase() : \"\"),\n        suffix = (symbol === \"$\" ? currencySuffix : /[%p]/.test(type) ? percent : \"\") + (options && options.suffix !== undefined ? options.suffix : \"\");\n\n    // What format function should we use?\n    // Is this an integer type?\n    // Can this type generate exponential notation?\n    var formatType = formatTypes[type],\n        maybeSuffix = /[defgprs%]/.test(type);\n\n    // Set the default precision if not specified,\n    // or clamp the specified precision to the supported range.\n    // For significant precision, it must be in [1, 21].\n    // For fixed precision, it must be in [0, 20].\n    precision = precision === undefined ? 6\n        : /[gprs]/.test(type) ? Math.max(1, Math.min(21, precision))\n        : Math.max(0, Math.min(20, precision));\n\n    function format(value) {\n      var valuePrefix = prefix,\n          valueSuffix = suffix,\n          i, n, c;\n\n      if (type === \"c\") {\n        valueSuffix = formatType(value) + valueSuffix;\n        value = \"\";\n      } else {\n        value = +value;\n\n        // Determine the sign. -0 is not less than 0, but 1 / -0 is!\n        var valueNegative = value < 0 || 1 / value < 0;\n\n        // Perform the initial formatting.\n        value = isNaN(value) ? nan : formatType(Math.abs(value), precision);\n\n        // Trim insignificant zeros.\n        if (trim) value = formatTrim(value);\n\n        // If a negative value rounds to zero after formatting, and no explicit positive sign is requested, hide the sign.\n        if (valueNegative && +value === 0 && sign !== \"+\") valueNegative = false;\n\n        // Compute the prefix and suffix.\n        valuePrefix = (valueNegative ? (sign === \"(\" ? sign : minus) : sign === \"-\" || sign === \"(\" ? \"\" : sign) + valuePrefix;\n        valueSuffix = (type === \"s\" && !isNaN(value) && prefixExponent !== undefined ? prefixes[8 + prefixExponent / 3] : \"\") + valueSuffix + (valueNegative && sign === \"(\" ? \")\" : \"\");\n\n        // Break the formatted value into the integer “value” part that can be\n        // grouped, and fractional or exponential “suffix” part that is not.\n        if (maybeSuffix) {\n          i = -1, n = value.length;\n          while (++i < n) {\n            if (c = value.charCodeAt(i), 48 > c || c > 57) {\n              valueSuffix = (c === 46 ? decimal + value.slice(i + 1) : value.slice(i)) + valueSuffix;\n              value = value.slice(0, i);\n              break;\n            }\n          }\n        }\n      }\n\n      // If the fill character is not \"0\", grouping is applied before padding.\n      if (comma && !zero) value = group(value, Infinity);\n\n      // Compute the padding.\n      var length = valuePrefix.length + value.length + valueSuffix.length,\n          padding = length < width ? new Array(width - length + 1).join(fill) : \"\";\n\n      // If the fill character is \"0\", grouping is applied after padding.\n      if (comma && zero) value = group(padding + value, padding.length ? width - valueSuffix.length : Infinity), padding = \"\";\n\n      // Reconstruct the final output based on the desired alignment.\n      switch (align) {\n        case \"<\": value = valuePrefix + value + valueSuffix + padding; break;\n        case \"=\": value = valuePrefix + padding + value + valueSuffix; break;\n        case \"^\": value = padding.slice(0, length = padding.length >> 1) + valuePrefix + value + valueSuffix + padding.slice(length); break;\n        default: value = padding + valuePrefix + value + valueSuffix; break;\n      }\n\n      return numerals(value);\n    }\n\n    format.toString = function() {\n      return specifier + \"\";\n    };\n\n    return format;\n  }\n\n  function formatPrefix(specifier, value) {\n    var e = Math.max(-8, Math.min(8, Math.floor(exponent(value) / 3))) * 3,\n        k = Math.pow(10, -e),\n        f = newFormat((specifier = formatSpecifier(specifier), specifier.type = \"f\", specifier), {suffix: prefixes[8 + e / 3]});\n    return function(value) {\n      return f(k * value);\n    };\n  }\n\n  return {\n    format: newFormat,\n    formatPrefix: formatPrefix\n  };\n}\n","import formatLocale from \"./locale.js\";\n\nvar locale;\nexport var format;\nexport var formatPrefix;\n\ndefaultLocale({\n  thousands: \",\",\n  grouping: [3],\n  currency: [\"$\", \"\"]\n});\n\nexport default function defaultLocale(definition) {\n  locale = formatLocale(definition);\n  format = locale.format;\n  formatPrefix = locale.formatPrefix;\n  return locale;\n}\n","import exponent from \"./exponent.js\";\n\nexport default function(step) {\n  return Math.max(0, -exponent(Math.abs(step)));\n}\n","import exponent from \"./exponent.js\";\n\nexport default function(step, value) {\n  return Math.max(0, Math.max(-8, Math.min(8, Math.floor(exponent(value) / 3))) * 3 - exponent(Math.abs(step)));\n}\n","import exponent from \"./exponent.js\";\n\nexport default function(step, max) {\n  step = Math.abs(step), max = Math.abs(max) - step;\n  return Math.max(0, exponent(max) - exponent(step)) + 1;\n}\n","import {tickStep} from \"d3-array\";\nimport {format, formatPrefix, formatSpecifier, precisionFixed, precisionPrefix, precisionRound} from \"d3-format\";\n\nexport default function tickFormat(start, stop, count, specifier) {\n  var step = tickStep(start, stop, count),\n      precision;\n  specifier = formatSpecifier(specifier == null ? \",f\" : specifier);\n  switch (specifier.type) {\n    case \"s\": {\n      var value = Math.max(Math.abs(start), Math.abs(stop));\n      if (specifier.precision == null && !isNaN(precision = precisionPrefix(step, value))) specifier.precision = precision;\n      return formatPrefix(specifier, value);\n    }\n    case \"\":\n    case \"e\":\n    case \"g\":\n    case \"p\":\n    case \"r\": {\n      if (specifier.precision == null && !isNaN(precision = precisionRound(step, Math.max(Math.abs(start), Math.abs(stop))))) specifier.precision = precision - (specifier.type === \"e\");\n      break;\n    }\n    case \"f\":\n    case \"%\": {\n      if (specifier.precision == null && !isNaN(precision = precisionFixed(step))) specifier.precision = precision - (specifier.type === \"%\") * 2;\n      break;\n    }\n  }\n  return format(specifier);\n}\n","import {ticks, tickIncrement} from \"d3-array\";\nimport continuous, {copy} from \"./continuous.js\";\nimport {initRange} from \"./init.js\";\nimport tickFormat from \"./tickFormat.js\";\n\nexport function linearish(scale) {\n  var domain = scale.domain;\n\n  scale.ticks = function(count) {\n    var d = domain();\n    return ticks(d[0], d[d.length - 1], count == null ? 10 : count);\n  };\n\n  scale.tickFormat = function(count, specifier) {\n    var d = domain();\n    return tickFormat(d[0], d[d.length - 1], count == null ? 10 : count, specifier);\n  };\n\n  scale.nice = function(count) {\n    if (count == null) count = 10;\n\n    var d = domain();\n    var i0 = 0;\n    var i1 = d.length - 1;\n    var start = d[i0];\n    var stop = d[i1];\n    var prestep;\n    var step;\n    var maxIter = 10;\n\n    if (stop < start) {\n      step = start, start = stop, stop = step;\n      step = i0, i0 = i1, i1 = step;\n    }\n    \n    while (maxIter-- > 0) {\n      step = tickIncrement(start, stop, count);\n      if (step === prestep) {\n        d[i0] = start\n        d[i1] = stop\n        return domain(d);\n      } else if (step > 0) {\n        start = Math.floor(start / step) * step;\n        stop = Math.ceil(stop / step) * step;\n      } else if (step < 0) {\n        start = Math.ceil(start * step) / step;\n        stop = Math.floor(stop * step) / step;\n      } else {\n        break;\n      }\n      prestep = step;\n    }\n\n    return scale;\n  };\n\n  return scale;\n}\n\nexport default function linear() {\n  var scale = continuous();\n\n  scale.copy = function() {\n    return copy(scale, linear());\n  };\n\n  initRange.apply(scale, arguments);\n\n  return linearish(scale);\n}\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32],"mappings":";;AAAA,SAAwB,EAAU,GAAG,GAAG;CACtC,OAAO,KAAK,QAAQ,KAAK,OAAO,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;AAC9E;;;ACFA,SAAwB,EAAW,GAAG,GAAG;CACvC,OAAO,KAAK,QAAQ,KAAK,OAAO,MAC5B,IAAI,IAAI,KACR,IAAI,IAAI,IACR,KAAK,IAAI,IACT;AACN;;;ACHA,SAAwB,EAAS,GAAG;CAClC,IAAI,GAAU,GAAU;CAOxB,AAAI,EAAE,WAAW,KAKf,IAAW,MAAM,KAAa,MAAM,IAAa,IAAI,GACrD,IAAW,GACX,IAAQ,MANR,IAAW,GACX,KAAY,GAAG,MAAM,EAAU,EAAE,CAAC,GAAG,CAAC,GACtC,KAAS,GAAG,MAAM,EAAE,CAAC,IAAI;CAO3B,SAAS,EAAK,GAAG,GAAG,IAAK,GAAG,IAAK,EAAE,QAAQ;EACzC,IAAI,IAAK,GAAI;GACX,IAAI,EAAS,GAAG,CAAC,MAAM,GAAG,OAAO;GACjC,GAAG;IACD,IAAM,IAAO,IAAK,MAAQ;IAC1B,AAAI,EAAS,EAAE,IAAM,CAAC,IAAI,IAAG,IAAK,IAAM,IACnC,IAAK;GACZ,SAAS,IAAK;EAChB;EACA,OAAO;CACT;CAEA,SAAS,EAAM,GAAG,GAAG,IAAK,GAAG,IAAK,EAAE,QAAQ;EAC1C,IAAI,IAAK,GAAI;GACX,IAAI,EAAS,GAAG,CAAC,MAAM,GAAG,OAAO;GACjC,GAAG;IACD,IAAM,IAAO,IAAK,MAAQ;IAC1B,AAAI,EAAS,EAAE,IAAM,CAAC,KAAK,IAAG,IAAK,IAAM,IACpC,IAAK;GACZ,SAAS,IAAK;EAChB;EACA,OAAO;CACT;CAEA,SAAS,EAAO,GAAG,GAAG,IAAK,GAAG,IAAK,EAAE,QAAQ;EAC3C,IAAM,IAAI,EAAK,GAAG,GAAG,GAAI,IAAK,CAAC;EAC/B,OAAO,IAAI,KAAM,EAAM,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,EAAM,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI;CAClE;CAEA,OAAO;EAAC;EAAM;EAAQ;CAAK;AAC7B;AAEA,SAAS,IAAO;CACd,OAAO;AACT;;;ACvDA,SAAwBA,EAAO,GAAG;CAChC,OAAO,MAAM,OAAO,MAAM,CAAC;AAC7B;AAEA,UAAiB,EAAQ,GAAQ,GAAS;CACxC,IAAI,MAAY,KAAA,GACT,KAAA,IAAI,KAAS,GAChB,AAAI,KAAS,SAAS,IAAQ,CAAC,MAAU,MACvC,MAAM;MAGL;EACL,IAAI,IAAQ;EACZ,KAAK,IAAI,KAAS,GAChB,CAAK,IAAQ,EAAQ,GAAO,EAAE,GAAO,CAAM,MAAM,SAAS,IAAQ,CAAC,MAAU,MAC3E,MAAM;CAGZ;AACF;;;ACfA,IAAM,IAAkB,EAAS,CAAS,GAC7B,IAAc,EAAgB;AACjB,EAAgB,MACd,EAASC,CAAM,CAAC,CAAC;;;ACP7C,IAAM,IAAM,KAAK,KAAK,EAAE,GACpB,IAAK,KAAK,KAAK,EAAE,GACjB,IAAK,KAAK,KAAK,CAAC;AAEpB,SAAS,EAAS,GAAO,GAAM,GAAO;CACpC,IAAM,KAAQ,IAAO,KAAS,KAAK,IAAI,GAAG,CAAK,GAC3C,IAAQ,KAAK,MAAM,KAAK,MAAM,CAAI,CAAC,GACnC,IAAQ,IAAgB,MAAI,GAC5B,IAAS,KAAS,IAAM,KAAK,KAAS,IAAK,IAAI,KAAS,IAAK,IAAI,GACjE,GAAI,GAAI;CAgBZ,OAfI,IAAQ,KACV,IAAe,MAAI,CAAC,IAAS,GAC7B,IAAK,KAAK,MAAM,IAAQ,CAAG,GAC3B,IAAK,KAAK,MAAM,IAAO,CAAG,GACtB,IAAK,IAAM,KAAO,EAAE,GACpB,IAAK,IAAM,KAAM,EAAE,GACvB,IAAM,CAAC,MAEP,IAAe,MAAI,IAAS,GAC5B,IAAK,KAAK,MAAM,IAAQ,CAAG,GAC3B,IAAK,KAAK,MAAM,IAAO,CAAG,GACtB,IAAK,IAAM,KAAO,EAAE,GACpB,IAAK,IAAM,KAAM,EAAE,IAErB,IAAK,KAAM,MAAO,KAAS,IAAQ,IAAU,EAAS,GAAO,GAAM,IAAQ,CAAC,IACzE;EAAC;EAAI;EAAI;CAAG;AACrB;AAEA,SAAwB,EAAM,GAAO,GAAM,GAAO;CAEhD,IADA,IAAO,CAAC,GAAM,IAAQ,CAAC,GAAO,IAAQ,CAAC,GACnC,EAAE,IAAQ,IAAI,OAAO,CAAC;CAC1B,IAAI,MAAU,GAAM,OAAO,CAAC,CAAK;CACjC,IAAM,IAAU,IAAO,GAAO,CAAC,GAAI,GAAI,KAAO,IAAU,EAAS,GAAM,GAAO,CAAK,IAAI,EAAS,GAAO,GAAM,CAAK;CAClH,IAAI,EAAE,KAAM,IAAK,OAAO,CAAC;CACzB,IAAM,IAAI,IAAK,IAAK,GAAG,IAAY,MAAM,CAAC;CAC1C,IAAI,GAAS;EACX,IAAI,IAAM,GAAG,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,EAAM,MAAM,IAAK,KAAK,CAAC;OAC3D,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,EAAM,MAAM,IAAK,KAAK;CACzD,OACE,IAAI,IAAM,GAAG,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,EAAM,MAAM,IAAK,KAAK,CAAC;MAC3D,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,EAAM,MAAM,IAAK,KAAK;CAEzD,OAAO;AACT;AAEA,SAAgB,EAAc,GAAO,GAAM,GAAO;CAEhD,OADA,IAAO,CAAC,GAAM,IAAQ,CAAC,GAAO,IAAQ,CAAC,GAChC,EAAS,GAAO,GAAM,CAAK,CAAC,CAAC;AACtC;AAEA,SAAgB,EAAS,GAAO,GAAM,GAAO;CAC3C,IAAO,CAAC,GAAM,IAAQ,CAAC,GAAO,IAAQ,CAAC;CACvC,IAAM,IAAU,IAAO,GAAO,IAAM,IAAU,EAAc,GAAM,GAAO,CAAK,IAAI,EAAc,GAAO,GAAM,CAAK;CAClH,QAAQ,IAAU,KAAK,MAAM,IAAM,IAAI,IAAI,CAAC,IAAM;AACpD;;;ACtDA,SAAA,EAAwB,GAAG,GAAG;CAC5B,AAAQ,MAAI,CAAC;CACb,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,IAAI,GACvC,IAAI,EAAE,MAAM,GACZ;CACJ,OAAO,SAAS,GAAG;EACjB,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,IAAI,KAAK,EAAE,KAAK;EACvD,OAAO;CACT;AACF;AAEA,SAAgB,EAAc,GAAG;CAC/B,OAAO,YAAY,OAAO,CAAC,KAAK,EAAE,aAAa;AACjD;;;ACNA,SAAgB,EAAa,GAAG,GAAG;CAOjC,KANA,IAAI,IAAK,IAAI,EAAE,SAAS,GACpB,IAAK,IAAI,KAAK,IAAI,GAAI,EAAE,MAAM,IAAI,GAClC,IAAQ,MAAM,CAAE,GAChB,IAAQ,MAAM,CAAE,GAChB,IAEK,GAAG,IAAI,GAAI,EAAE,GAAG,EAAE,KAAKC,EAAM,EAAE,IAAI,EAAE,EAAE;CAChD,OAAO,IAAI,GAAI,EAAE,GAAG,EAAE,KAAK,EAAE;CAE7B,OAAO,SAAS,GAAG;EACjB,KAAK,IAAI,GAAG,IAAI,GAAI,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;EACtC,OAAO;CACT;AACF;;;ACrBA,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,oBAAI,IAAI,KAAG;CACf,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,SAAS,GAAG;EACjC,OAAO,EAAE,QAAQ,KAAK,IAAI,KAAK,IAAI,CAAC,GAAG;CACzC;AACF;;;ACHA,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,IAAI,CAAC,GACL,IAAI,CAAC,GACL;CAKJ,KAAK,MAHa,OAAO,KAAM,aAA3B,OAAqC,IAAI,CAAC,KAC5B,OAAO,KAAM,aAA3B,OAAqC,IAAI,CAAC,IAEpC,GACR,AAAI,KAAK,IACP,EAAE,KAAKC,EAAM,EAAE,IAAI,EAAE,EAAE,IAEvB,EAAE,KAAK,EAAE;CAIb,OAAO,SAAS,GAAG;EACjB,KAAK,KAAK,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;EAC1B,OAAO;CACT;AACF;;;ACZA,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,IAAI,OAAO,GAAG;CAClB,OAAO,KAAK,QAAQ,MAAM,YAAYC,EAAS,CAAC,KACzC,MAAM,WAAWC,IAClB,MAAM,YAAa,IAAI,EAAM,CAAC,MAAM,IAAI,GAAGC,KAAOC,IAClD,aAAa,IAAQD,IACrB,aAAa,OAAOE,IACpB,EAAc,CAAC,IAAIC,IACnB,MAAM,QAAQ,CAAC,IAAI,IACnB,OAAO,EAAE,WAAY,cAAc,OAAO,EAAE,YAAa,cAAc,MAAM,CAAC,IAAIC,IAClFL,EAAAA,CAAQ,GAAG,CAAC;AACpB;;;ACrBA,SAAA,EAAwB,GAAG,GAAG;CAC5B,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,SAAS,GAAG;EACjC,OAAO,KAAK,MAAM,KAAK,IAAI,KAAK,IAAI,CAAC;CACvC;AACF;;;ACJA,SAAgB,EAAU,GAAQ,GAAO;CACvC,QAAQ,UAAU,QAAlB;EACE,KAAK,GAAG;EACR,KAAK;GAAG,KAAK,MAAM,CAAM;GAAG;EAC5B,SAAS,KAAK,MAAM,CAAK,CAAC,CAAC,OAAO,CAAM;CAC1C;CACA,OAAO;AACT;AAEA,SAAgB,GAAiB,GAAQ,GAAc;CACrD,QAAQ,UAAU,QAAlB;EACE,KAAK,GAAG;EACR,KAAK;GACH,AAAI,OAAO,KAAW,aAAY,KAAK,aAAa,CAAM,IACrD,KAAK,MAAM,CAAM;GACtB;EAEF,SAEE,AADA,KAAK,OAAO,CAAM,GACd,OAAO,KAAiB,aAAY,KAAK,aAAa,CAAY,IACjE,KAAK,MAAM,CAAY;CAGhC;CACA,OAAO;AACT;;;ACzBA,SAAwB,GAAU,GAAG;CACnC,OAAO,WAAW;EAChB,OAAO;CACT;AACF;;;ACJA,SAAwB,EAAO,GAAG;CAChC,OAAO,CAAC;AACV;;;ACGA,IAAI,IAAO,CAAC,GAAG,CAAC;AAEhB,SAAgB,EAAS,GAAG;CAC1B,OAAO;AACT;AAEA,SAAS,EAAU,GAAG,GAAG;CACvB,QAAQ,KAAM,IAAI,CAAC,KACb,SAAS,GAAG;EAAE,QAAQ,IAAI,KAAK;CAAG,IAClCM,GAAS,MAAM,CAAC,IAAI,MAAM,EAAG;AACrC;AAEA,SAAS,GAAQ,GAAG,GAAG;CACrB,IAAI;CAEJ,OADI,IAAI,MAAG,IAAI,GAAG,IAAI,GAAG,IAAI,IACtB,SAAS,GAAG;EAAE,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;CAAG;AAC3D;AAIA,SAAS,EAAM,GAAQ,GAAO,GAAa;CACzC,IAAI,IAAK,EAAO,IAAI,IAAK,EAAO,IAAI,IAAK,EAAM,IAAI,IAAK,EAAM;CAG9D,OAFI,IAAK,KAAI,IAAK,EAAU,GAAI,CAAE,GAAG,IAAK,EAAY,GAAI,CAAE,MACvD,IAAK,EAAU,GAAI,CAAE,GAAG,IAAK,EAAY,GAAI,CAAE,IAC7C,SAAS,GAAG;EAAE,OAAO,EAAG,EAAG,CAAC,CAAC;CAAG;AACzC;AAEA,SAAS,GAAQ,GAAQ,GAAO,GAAa;CAC3C,IAAI,IAAI,KAAK,IAAI,EAAO,QAAQ,EAAM,MAAM,IAAI,GAC5C,IAAQ,MAAM,CAAC,GACf,IAAQ,MAAM,CAAC,GACf,IAAI;CAQR,KALI,EAAO,KAAK,EAAO,OACrB,IAAS,EAAO,MAAM,CAAC,CAAC,QAAQ,GAChC,IAAQ,EAAM,MAAM,CAAC,CAAC,QAAQ,IAGzB,EAAE,IAAI,IAEX,AADA,EAAE,KAAK,EAAU,EAAO,IAAI,EAAO,IAAI,EAAE,GACzC,EAAE,KAAK,EAAY,EAAM,IAAI,EAAM,IAAI,EAAE;CAG3C,OAAO,SAAS,GAAG;EACjB,IAAI,IAAIC,EAAO,GAAQ,GAAG,GAAG,CAAC,IAAI;EAClC,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;CACrB;AACF;AAEA,SAAgB,EAAK,GAAQ,GAAQ;CACnC,OAAO,EACF,OAAO,EAAO,OAAO,CAAC,CAAC,CACvB,MAAM,EAAO,MAAM,CAAC,CAAC,CACrB,YAAY,EAAO,YAAY,CAAC,CAAC,CACjC,MAAM,EAAO,MAAM,CAAC,CAAC,CACrB,QAAQ,EAAO,QAAQ,CAAC;AAC/B;AAEA,SAAgB,IAAc;CAC5B,IAAI,IAAS,GACT,IAAQ,GACR,IAAcC,GACd,GACA,GACA,GACA,IAAQ,GACR,GACA,GACA;CAEJ,SAAS,IAAU;EACjB,IAAI,IAAI,KAAK,IAAI,EAAO,QAAQ,EAAM,MAAM;EAI5C,OAHI,MAAU,MAAU,IAAQ,GAAQ,EAAO,IAAI,EAAO,IAAI,EAAE,IAChE,IAAY,IAAI,IAAI,KAAU,GAC9B,IAAS,IAAQ,MACV;CACT;CAEA,SAAS,EAAM,GAAG;EAChB,OAAO,KAAK,QAAQ,MAAM,IAAI,CAAC,CAAC,IAAI,KAAW,AAAW,MAAS,EAAU,EAAO,IAAI,CAAS,GAAG,GAAO,CAAW,EAAA,CAAI,EAAU,EAAM,CAAC,CAAC,CAAC;CAC/I;CA8BA,OA5BA,EAAM,SAAS,SAAS,GAAG;EACzB,OAAO,EAAM,GAAa,AAAU,MAAQ,EAAU,GAAO,EAAO,IAAI,CAAS,GAAGC,CAAiB,EAAA,CAAI,CAAC,CAAC,CAAC;CAC9G,GAEA,EAAM,SAAS,SAAS,GAAG;EACzB,OAAO,UAAU,UAAU,IAAS,MAAM,KAAK,GAAG,CAAM,GAAG,EAAQ,KAAK,EAAO,MAAM;CACvF,GAEA,EAAM,QAAQ,SAAS,GAAG;EACxB,OAAO,UAAU,UAAU,IAAQ,MAAM,KAAK,CAAC,GAAG,EAAQ,KAAK,EAAM,MAAM;CAC7E,GAEA,EAAM,aAAa,SAAS,GAAG;EAC7B,OAAO,IAAQ,MAAM,KAAK,CAAC,GAAG,IAAcC,GAAkB,EAAQ;CACxE,GAEA,EAAM,QAAQ,SAAS,GAAG;EACxB,OAAO,UAAU,UAAU,IAAQ,IAAI,KAAO,GAAU,EAAQ,KAAK,MAAU;CACjF,GAEA,EAAM,cAAc,SAAS,GAAG;EAC9B,OAAO,UAAU,UAAU,IAAc,GAAG,EAAQ,KAAK;CAC3D,GAEA,EAAM,UAAU,SAAS,GAAG;EAC1B,OAAO,UAAU,UAAU,IAAU,GAAG,KAAS;CACnD,GAEO,SAAS,GAAG,GAAG;EAEpB,OADA,IAAY,GAAG,IAAc,GACtB,EAAQ;CACjB;AACF;AAEA,SAAwB,IAAa;CACnC,OAAO,EAAY,CAAC,CAAC,GAAU,CAAQ;AACzC;;;AC5HA,SAAA,GAAwB,GAAG;CACzB,OAAO,KAAK,IAAI,IAAI,KAAK,MAAM,CAAC,CAAC,KAAK,OAChC,EAAE,eAAe,IAAI,CAAC,CAAC,QAAQ,MAAM,EAAE,IACvC,EAAE,SAAS,EAAE;AACrB;AAKA,SAAgB,EAAmB,GAAG,GAAG;CACvC,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,GAAG,OAAO;CACpC,IAAI,KAAK,IAAI,IAAI,EAAE,cAAc,IAAI,CAAC,IAAI,EAAE,cAAc,EAAA,CAAG,QAAQ,GAAG,GAAG,IAAc,EAAE,MAAM,GAAG,CAAC;CAIrG,OAAO,CACL,EAAY,SAAS,IAAI,EAAY,KAAK,EAAY,MAAM,CAAC,IAAI,GACjE,CAAC,EAAE,MAAM,IAAI,CAAC,CAChB;AACF;;;ACjBA,SAAA,EAAwB,GAAG;CACzB,OAAO,IAAI,EAAmB,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,KAAK;AACzD;;;ACJA,SAAA,EAAwB,GAAU,GAAW;CAC3C,OAAO,SAAS,GAAO,GAAO;EAO5B,KANA,IAAI,IAAI,EAAM,QACV,IAAI,CAAC,GACL,IAAI,GACJ,IAAI,EAAS,IACb,IAAS,GAEN,IAAI,KAAK,IAAI,MACd,IAAS,IAAI,IAAI,MAAO,IAAI,KAAK,IAAI,GAAG,IAAQ,CAAM,IAC1D,EAAE,KAAK,EAAM,UAAU,KAAK,GAAG,IAAI,CAAC,CAAC,GACrC,GAAK,KAAU,IAAI,KAAK,MACxB,IAAI,EAAS,KAAK,IAAI,KAAK,EAAS;EAGtC,OAAO,EAAE,QAAQ,CAAC,CAAC,KAAK,CAAS;CACnC;AACF;;;ACjBA,SAAA,EAAwB,GAAU;CAChC,OAAO,SAAS,GAAO;EACrB,OAAO,EAAM,QAAQ,UAAU,SAAS,GAAG;GACzC,OAAO,EAAS,CAAC;EACnB,CAAC;CACH;AACF;;;ACLA,IAAI,KAAK;AAET,SAAwB,EAAgB,GAAW;CACjD,IAAI,EAAE,IAAQ,GAAG,KAAK,CAAS,IAAI,MAAU,MAAM,qBAAqB,CAAS;CACjF,IAAI;CACJ,OAAO,IAAI,EAAgB;EACzB,MAAM,EAAM;EACZ,OAAO,EAAM;EACb,MAAM,EAAM;EACZ,QAAQ,EAAM;EACd,MAAM,EAAM;EACZ,OAAO,EAAM;EACb,OAAO,EAAM;EACb,WAAW,EAAM,MAAM,EAAM,EAAE,CAAC,MAAM,CAAC;EACvC,MAAM,EAAM;EACZ,MAAM,EAAM;CACd,CAAC;AACH;AAEA,EAAgB,YAAY,EAAgB;AAE5C,SAAgB,EAAgB,GAAW;CAUzC,AATA,KAAK,OAAO,EAAU,SAAS,KAAA,IAAY,MAAM,EAAU,OAAO,IAClE,KAAK,QAAQ,EAAU,UAAU,KAAA,IAAY,MAAM,EAAU,QAAQ,IACrE,KAAK,OAAO,EAAU,SAAS,KAAA,IAAY,MAAM,EAAU,OAAO,IAClE,KAAK,SAAS,EAAU,WAAW,KAAA,IAAY,KAAK,EAAU,SAAS,IACvE,KAAK,OAAO,CAAC,CAAC,EAAU,MACxB,KAAK,QAAQ,EAAU,UAAU,KAAA,IAAY,KAAA,IAAY,CAAC,EAAU,OACpE,KAAK,QAAQ,CAAC,CAAC,EAAU,OACzB,KAAK,YAAY,EAAU,cAAc,KAAA,IAAY,KAAA,IAAY,CAAC,EAAU,WAC5E,KAAK,OAAO,CAAC,CAAC,EAAU,MACxB,KAAK,OAAO,EAAU,SAAS,KAAA,IAAY,KAAK,EAAU,OAAO;AACnE;AAEA,EAAgB,UAAU,WAAW,WAAW;CAC9C,OAAO,KAAK,OACN,KAAK,QACL,KAAK,OACL,KAAK,UACJ,KAAK,OAAO,MAAM,OAClB,KAAK,UAAU,KAAA,IAAY,KAAK,KAAK,IAAI,GAAG,KAAK,QAAQ,CAAC,MAC1D,KAAK,QAAQ,MAAM,OACnB,KAAK,cAAc,KAAA,IAAY,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,YAAY,CAAC,MACxE,KAAK,OAAO,MAAM,MACnB,KAAK;AACb;;;AC7CA,SAAA,GAAwB,GAAG;CACzB,KAAK,KAAK,IAAI,IAAI,EAAE,QAAQ,IAAI,GAAG,IAAK,IAAI,GAAI,IAAI,GAAG,EAAE,GACvD,QAAQ,EAAE,IAAV;EACE,KAAK;GAAK,IAAK,IAAK;GAAG;EACvB,KAAK;GAA2B,AAAlB,MAAO,MAAG,IAAK,IAAG,IAAK;GAAG;EACxC;GAAS,IAAI,CAAC,CAAC,EAAE,IAAI,MAAM;GAAK,AAAI,IAAK,MAAG,IAAK;CACnD;CAEF,OAAO,IAAK,IAAI,EAAE,MAAM,GAAG,CAAE,IAAI,EAAE,MAAM,IAAK,CAAC,IAAI;AACrD;;;ACRA,IAAW;AAEX,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,IAAI,EAAmB,GAAG,CAAC;CAC/B,IAAI,CAAC,GAAG,OAAO,IAAiB,KAAA,GAAW,EAAE,YAAY,CAAC;CAC1D,IAAI,IAAc,EAAE,IAChB,IAAW,EAAE,IACb,IAAI,KAAY,IAAiB,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,IAAW,CAAC,CAAC,CAAC,IAAI,KAAK,GAC5F,IAAI,EAAY;CACpB,OAAO,MAAM,IAAI,IACX,IAAI,IAAI,IAAkB,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,IACnD,IAAI,IAAI,EAAY,MAAM,GAAG,CAAC,IAAI,MAAM,EAAY,MAAM,CAAC,IAC3D,OAAW,MAAM,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,EAAmB,GAAG,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AAC1F;;;ACbA,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,IAAI,EAAmB,GAAG,CAAC;CAC/B,IAAI,CAAC,GAAG,OAAO,IAAI;CACnB,IAAI,IAAc,EAAE,IAChB,IAAW,EAAE;CACjB,OAAO,IAAW,IAAI,OAAW,MAAM,CAAC,CAAQ,CAAC,CAAC,KAAK,GAAG,IAAI,IACxD,EAAY,SAAS,IAAW,IAAI,EAAY,MAAM,GAAG,IAAW,CAAC,IAAI,MAAM,EAAY,MAAM,IAAW,CAAC,IAC7G,IAAkB,MAAM,IAAW,EAAY,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG;AAC3E;;;ACNA,IAAA,IAAe;CACb,MAAM,GAAG,OAAO,IAAI,IAAA,CAAK,QAAQ,CAAC;CAClC,IAAM,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;CACpC,IAAM,MAAM,IAAI;CAChB,GAAKC;CACL,IAAM,GAAG,MAAM,EAAE,cAAc,CAAC;CAChC,IAAM,GAAG,MAAM,EAAE,QAAQ,CAAC;CAC1B,IAAM,GAAG,MAAM,EAAE,YAAY,CAAC;CAC9B,IAAM,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;CACpC,IAAM,GAAG,MAAMC,EAAc,IAAI,KAAK,CAAC;CACvC,GAAKA;CACL,GAAKC;CACL,IAAM,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,YAAY;CACnD,IAAM,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE;AACvC;;;AClBA,SAAA,EAAwB,GAAG;CACzB,OAAO;AACT;;;ACOA,IAAI,IAAM,MAAM,UAAU,KACtB,IAAW;CAAC;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAG;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;AAAG;AAElF,SAAA,GAAwB,GAAQ;CAC9B,IAAI,IAAQ,EAAO,aAAa,KAAA,KAAa,EAAO,cAAc,KAAA,IAAYC,IAAWC,EAAY,EAAI,KAAK,EAAO,UAAU,MAAM,GAAG,EAAO,YAAY,EAAE,GACzJ,IAAiB,EAAO,aAAa,KAAA,IAAY,KAAK,EAAO,SAAS,KAAK,IAC3E,IAAiB,EAAO,aAAa,KAAA,IAAY,KAAK,EAAO,SAAS,KAAK,IAC3E,IAAU,EAAO,YAAY,KAAA,IAAY,MAAM,EAAO,UAAU,IAChE,IAAW,EAAO,aAAa,KAAA,IAAYD,IAAWE,EAAe,EAAI,KAAK,EAAO,UAAU,MAAM,CAAC,GACtG,IAAU,EAAO,YAAY,KAAA,IAAY,MAAM,EAAO,UAAU,IAChE,IAAQ,EAAO,UAAU,KAAA,IAAY,MAAM,EAAO,QAAQ,IAC1D,IAAM,EAAO,QAAQ,KAAA,IAAY,QAAQ,EAAO,MAAM;CAE1D,SAAS,EAAU,GAAW,GAAS;EACrC,IAAY,EAAgB,CAAS;EAErC,IAAI,IAAO,EAAU,MACjB,IAAQ,EAAU,OAClB,IAAO,EAAU,MACjB,IAAS,EAAU,QACnB,IAAO,EAAU,MACjB,IAAQ,EAAU,OAClB,IAAQ,EAAU,OAClB,IAAY,EAAU,WACtB,IAAO,EAAU,MACjB,IAAO,EAAU;EASrB,AANI,MAAS,OAAK,IAAQ,IAAM,IAAO,OAG7BC,EAAY,OAAO,MAAc,KAAA,MAAc,IAAY,KAAK,IAAO,IAAM,IAAO,OAG1F,KAAS,MAAS,OAAO,MAAU,SAAM,IAAO,IAAM,IAAO,KAAK,IAAQ;EAI9E,IAAI,KAAU,KAAW,EAAQ,WAAW,KAAA,IAAY,EAAQ,SAAS,OAAO,MAAW,MAAM,IAAiB,MAAW,OAAO,SAAS,KAAK,CAAI,IAAI,MAAM,EAAK,YAAY,IAAI,KACjL,KAAU,MAAW,MAAM,IAAiB,OAAO,KAAK,CAAI,IAAI,IAAU,OAAO,KAAW,EAAQ,WAAW,KAAA,IAAY,EAAQ,SAAS,KAK5I,IAAaA,EAAY,IACzB,IAAc,aAAa,KAAK,CAAI;EAMxC,IAAY,MAAc,KAAA,IAAY,IAChC,SAAS,KAAK,CAAI,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,CAAS,CAAC,IACzD,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,CAAS,CAAC;EAEzC,SAAS,EAAO,GAAO;GACrB,IAAI,IAAc,GACd,IAAc,GACd,GAAG,GAAG;GAEV,IAAI,MAAS,KAEX,AADA,IAAc,EAAW,CAAK,IAAI,GAClC,IAAQ;QACH;IACL,IAAQ,CAAC;IAGT,IAAI,IAAgB,IAAQ,KAAK,IAAI,IAAQ;IAiB7C,IAdA,IAAQ,MAAM,CAAK,IAAI,IAAM,EAAW,KAAK,IAAI,CAAK,GAAG,CAAS,GAG9D,MAAM,IAAQC,GAAW,CAAK,IAG9B,KAAiB,CAAC,KAAU,KAAK,MAAS,QAAK,IAAgB,KAGnE,KAAe,IAAiB,MAAS,MAAM,IAAO,IAAS,MAAS,OAAO,MAAS,MAAM,KAAK,KAAQ,GAC3G,KAAe,MAAS,OAAO,CAAC,MAAM,CAAK,KAAK,MAAmB,KAAA,IAAY,EAAS,IAAI,IAAiB,KAAK,MAAM,KAAe,KAAiB,MAAS,MAAM,MAAM,KAIzK,GAEF;UADA,IAAI,IAAI,IAAI,EAAM,QACX,EAAE,IAAI,IACX,IAAI,IAAI,EAAM,WAAW,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI;MAE7C,AADA,KAAe,MAAM,KAAK,IAAU,EAAM,MAAM,IAAI,CAAC,IAAI,EAAM,MAAM,CAAC,KAAK,GAC3E,IAAQ,EAAM,MAAM,GAAG,CAAC;MACxB;KACF;;GAGN;GAGA,AAAI,KAAS,CAAC,MAAM,IAAQ,EAAM,GAAO,QAAQ;GAGjD,IAAI,IAAS,EAAY,SAAS,EAAM,SAAS,EAAY,QACzD,IAAU,IAAS,IAAY,MAAM,IAAQ,IAAS,CAAC,CAAC,CAAC,KAAK,CAAI,IAAI;GAM1E,QAHI,KAAS,MAAM,IAAQ,EAAM,IAAU,GAAO,EAAQ,SAAS,IAAQ,EAAY,SAAS,QAAQ,GAAG,IAAU,KAG7G,GAAR;IACE,KAAK;KAAK,IAAQ,IAAc,IAAQ,IAAc;KAAS;IAC/D,KAAK;KAAK,IAAQ,IAAc,IAAU,IAAQ;KAAa;IAC/D,KAAK;KAAK,IAAQ,EAAQ,MAAM,GAAG,IAAS,EAAQ,UAAU,CAAC,IAAI,IAAc,IAAQ,IAAc,EAAQ,MAAM,CAAM;KAAG;IAC9H,SAAS,IAAQ,IAAU,IAAc,IAAQ;GACnD;GAEA,OAAO,EAAS,CAAK;EACvB;EAMA,OAJA,EAAO,WAAW,WAAW;GAC3B,OAAO,IAAY;EACrB,GAEO;CACT;CAEA,SAAS,EAAa,GAAW,GAAO;EACtC,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,KAAK,MAAMC,EAAS,CAAK,IAAI,CAAC,CAAC,CAAC,IAAI,GACjE,IAAa,MAAI,CAAC,GAClB,IAAI,GAAW,IAAY,EAAgB,CAAS,GAAG,EAAU,OAAO,KAAK,IAAY,EAAC,QAAQ,EAAS,IAAI,IAAI,GAAE,CAAC;EAC1H,OAAO,SAAS,GAAO;GACrB,OAAO,EAAE,IAAI,CAAK;EACpB;CACF;CAEA,OAAO;EACL,QAAQ;EACM;CAChB;AACF;;;AChJA,IAAI,GACO,GACA;AAEX,GAAc;CACZ,WAAW;CACX,UAAU,CAAC,CAAC;CACZ,UAAU,CAAC,KAAK,EAAE;AACpB,CAAC;AAED,SAAwB,GAAc,GAAY;CAIhD,OAHA,IAASC,GAAa,CAAU,GAChC,IAAS,EAAO,QAChB,IAAe,EAAO,cACf;AACT;;;ACfA,SAAA,GAAwB,GAAM;CAC5B,OAAO,KAAK,IAAI,GAAG,CAACC,EAAS,KAAK,IAAI,CAAI,CAAC,CAAC;AAC9C;;;ACFA,SAAA,GAAwB,GAAM,GAAO;CACnC,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,KAAK,MAAMC,EAAS,CAAK,IAAI,CAAC,CAAC,CAAC,IAAI,IAAIA,EAAS,KAAK,IAAI,CAAI,CAAC,CAAC;AAC9G;;;ACFA,SAAA,GAAwB,GAAM,GAAK;CAEjC,OADA,IAAO,KAAK,IAAI,CAAI,GAAG,IAAM,KAAK,IAAI,CAAG,IAAI,GACtC,KAAK,IAAI,GAAGC,EAAS,CAAG,IAAIA,EAAS,CAAI,CAAC,IAAI;AACvD;;;ACFA,SAAwB,GAAW,GAAO,GAAM,GAAO,GAAW;CAChE,IAAI,IAAO,EAAS,GAAO,GAAM,CAAK,GAClC;CAEJ,QADA,IAAY,EAAgB,KAAoB,IAAgB,GACxD,EAAU,MAAlB;EACE,KAAK;GACH,IAAI,IAAQ,KAAK,IAAI,KAAK,IAAI,CAAK,GAAG,KAAK,IAAI,CAAI,CAAC;GAEpD,OADI,EAAU,aAAa,QAAQ,CAAC,MAAM,IAAYC,GAAgB,GAAM,CAAK,CAAC,MAAG,EAAU,YAAY,IACpG,EAAa,GAAW,CAAK;EAEtC,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;GACH,AAAI,EAAU,aAAa,QAAQ,CAAC,MAAM,IAAYC,GAAe,GAAM,KAAK,IAAI,KAAK,IAAI,CAAK,GAAG,KAAK,IAAI,CAAI,CAAC,CAAC,CAAC,MAAG,EAAU,YAAY,KAAa,EAAU,SAAS;GAC9K;EAEF,KAAK;EACL,KAAK,KACH,AAAI,EAAU,aAAa,QAAQ,CAAC,MAAM,IAAYC,GAAe,CAAI,CAAC,MAAG,EAAU,YAAY,KAAa,EAAU,SAAS,OAAO;CAG9I;CACA,OAAO,EAAO,CAAS;AACzB;;;ACvBA,SAAgB,EAAU,GAAO;CAC/B,IAAI,IAAS,EAAM;CAkDnB,OAhDA,EAAM,QAAQ,SAAS,GAAO;EAC5B,IAAI,IAAI,EAAO;EACf,OAAO,EAAM,EAAE,IAAI,EAAE,EAAE,SAAS,IAAI,KAAgB,EAAU;CAChE,GAEA,EAAM,aAAa,SAAS,GAAO,GAAW;EAC5C,IAAI,IAAI,EAAO;EACf,OAAO,GAAW,EAAE,IAAI,EAAE,EAAE,SAAS,IAAI,KAAgB,IAAY,CAAS;CAChF,GAEA,EAAM,OAAO,SAAS,GAAO;EAC3B,AAAmB,MAAQ;EAE3B,IAAI,IAAI,EAAO,GACX,IAAK,GACL,IAAK,EAAE,SAAS,GAChB,IAAQ,EAAE,IACV,IAAO,EAAE,IACT,GACA,GACA,IAAU;EAOd,KALI,IAAO,MACT,IAAO,GAAO,IAAQ,GAAM,IAAO,GACnC,IAAO,GAAI,IAAK,GAAI,IAAK,IAGpB,MAAY,IAAG;GAEpB,IADA,IAAO,EAAc,GAAO,GAAM,CAAK,GACnC,MAAS,GAGX,OAFA,EAAE,KAAM,GACR,EAAE,KAAM,GACD,EAAO,CAAC;GACV,IAAI,IAAO,GAEhB,AADA,IAAQ,KAAK,MAAM,IAAQ,CAAI,IAAI,GACnC,IAAO,KAAK,KAAK,IAAO,CAAI,IAAI;QAC3B,IAAI,IAAO,GAEhB,AADA,IAAQ,KAAK,KAAK,IAAQ,CAAI,IAAI,GAClC,IAAO,KAAK,MAAM,IAAO,CAAI,IAAI;QAEjC;GAEF,IAAU;EACZ;EAEA,OAAO;CACT,GAEO;AACT;AAEA,SAAwB,IAAS;CAC/B,IAAI,IAAQ,EAAW;CAQvB,OANA,EAAM,OAAO,WAAW;EACtB,OAAO,EAAK,GAAO,EAAO,CAAC;CAC7B,GAEA,EAAU,MAAM,GAAO,SAAS,GAEzB,EAAU,CAAK;AACxB"}

package/dist/{networkDiagram-CcQxxJMB.js → networkDiagram-DZwLfY_R.js}

@@ -1,7 +1,7 @@
-import { i as e, r as t } from "./src-yL3ZdoR1.js";
+import { i as e, r as t } from "./src-kLpf-6r0.js";
 import { t as n } from "./select-BIuoFcZG.js";
-import { t as r } from "./drag-DfL4uwqz.js";
-import { t as i } from "./src-WDualLFV.js";
+import { t as r } from "./drag-Ieen6R0z.js";
+import { t as i } from "./src-Clugeype.js";
 //#region node_modules/d3-force/src/center.js
 function a(e, t) {
 	var n, r = 1;

package/dist/{networkDiagram-CcQxxJMB.js.map → networkDiagram-DZwLfY_R.js.map}

@@ -1 +1 @@
-{"version":3,"file":"networkDiagram-CcQxxJMB.js","names":["Quad","Quad","Quad","tree_add","tree_addAll","tree_cover","tree_data","tree_extent","tree_find","tree_remove","tree_removeAll","tree_root","tree_size","tree_visit","tree_visitAfter","tree_x","tree_y","constant","jiggle","lcg","constant","jiggle"],"sources":["../node_modules/d3-force/src/center.js","../node_modules/d3-quadtree/src/add.js","../node_modules/d3-quadtree/src/cover.js","../node_modules/d3-quadtree/src/data.js","../node_modules/d3-quadtree/src/extent.js","../node_modules/d3-quadtree/src/quad.js","../node_modules/d3-quadtree/src/find.js","../node_modules/d3-quadtree/src/remove.js","../node_modules/d3-quadtree/src/root.js","../node_modules/d3-quadtree/src/size.js","../node_modules/d3-quadtree/src/visit.js","../node_modules/d3-quadtree/src/visitAfter.js","../node_modules/d3-quadtree/src/x.js","../node_modules/d3-quadtree/src/y.js","../node_modules/d3-quadtree/src/quadtree.js","../node_modules/d3-force/src/constant.js","../node_modules/d3-force/src/jiggle.js","../node_modules/d3-force/src/link.js","../node_modules/d3-force/src/lcg.js","../node_modules/d3-force/src/simulation.js","../node_modules/d3-force/src/manyBody.js","../src/networkDiagram.ts"],"sourcesContent":["export default function(x, y) {\n  var nodes, strength = 1;\n\n  if (x == null) x = 0;\n  if (y == null) y = 0;\n\n  function force() {\n    var i,\n        n = nodes.length,\n        node,\n        sx = 0,\n        sy = 0;\n\n    for (i = 0; i < n; ++i) {\n      node = nodes[i], sx += node.x, sy += node.y;\n    }\n\n    for (sx = (sx / n - x) * strength, sy = (sy / n - y) * strength, i = 0; i < n; ++i) {\n      node = nodes[i], node.x -= sx, node.y -= sy;\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = +_, force) : x;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = +_, force) : y;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  return force;\n}\n","export default function(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d);\n  return add(this.cover(x, y), x, y, d);\n}\n\nfunction add(tree, x, y, d) {\n  if (isNaN(x) || isNaN(y)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      xm,\n      ym,\n      xp,\n      yp,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (parent = node, !(node = node[i = bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  if (x === xp && y === yp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(4) : tree._root = new Array(4);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n  } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n  var d, i, n = data.length,\n      x,\n      y,\n      xz = new Array(n),\n      yz = new Array(n),\n      x0 = Infinity,\n      y0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (i = 0; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0).cover(x1, y1);\n\n  // Add the new points.\n  for (i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], data[i]);\n  }\n\n  return this;\n}\n","export default function(x, y) {\n  if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1;\n\n  // If the quadtree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing quadrant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var z = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1) {\n      i = (y < y0) << 1 | (x < x0);\n      parent = new Array(4), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z, y1 = y0 + z; break;\n        case 1: x0 = x1 - z, y1 = y0 + z; break;\n        case 2: x1 = x0 + z, y0 = y1 - z; break;\n        case 3: x0 = x1 - z, y0 = y1 - z; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  return this;\n}\n","export default function() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n","export default function(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];\n}\n","export default function(node, x0, y0, x1, y1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.x1 = x1;\n  this.y1 = y1;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(x, y, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1,\n      y1,\n      x2,\n      y2,\n      x3 = this._x1,\n      y3 = this._y1,\n      quads = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) quads.push(new Quad(node, x0, y0, x3, y3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius;\n    x3 = x + radius, y3 = y + radius;\n    radius *= radius;\n  }\n\n  while (q = quads.pop()) {\n\n    // Stop searching if this quadrant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0) continue;\n\n    // Bisect the current quadrant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2;\n\n      quads.push(\n        new Quad(node[3], xm, ym, x2, y2),\n        new Quad(node[2], x1, ym, xm, y2),\n        new Quad(node[1], xm, y1, x2, ym),\n        new Quad(node[0], x1, y1, xm, ym)\n      );\n\n      // Visit the closest quadrant first.\n      if (i = (y >= ym) << 1 | (x >= xm)) {\n        q = quads[quads.length - 1];\n        quads[quads.length - 1] = quads[quads.length - 1 - i];\n        quads[quads.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          d2 = dx * dx + dy * dy;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d;\n        x3 = x + d, y3 = y + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n","export default function(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1,\n      x,\n      y,\n      xm,\n      ym,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (!(parent = node, node = node[i = bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3])\n      && node === (parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nexport function removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n","export default function() {\n  return this._root;\n}\n","export default function() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], q, node = this._root, child, x0, y0, x1, y1;\n  if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n    }\n  }\n  return this;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], next = [], q;\n  if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.x1, q.y1);\n  }\n  return this;\n}\n","export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\n\nexport default function quadtree(nodes, x, y) {\n  var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Quadtree(x, y, x0, y0, x1, y1) {\n  this._x = x;\n  this._y = y;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = quadtree.prototype = Quadtree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(4)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 4; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\n","export default function(x) {\n  return function() {\n    return x;\n  };\n}\n","export default function(random) {\n  return (random() - 0.5) * 1e-6;\n}\n","import constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction index(d) {\n  return d.index;\n}\n\nfunction find(nodeById, nodeId) {\n  var node = nodeById.get(nodeId);\n  if (!node) throw new Error(\"node not found: \" + nodeId);\n  return node;\n}\n\nexport default function(links) {\n  var id = index,\n      strength = defaultStrength,\n      strengths,\n      distance = constant(30),\n      distances,\n      nodes,\n      count,\n      bias,\n      random,\n      iterations = 1;\n\n  if (links == null) links = [];\n\n  function defaultStrength(link) {\n    return 1 / Math.min(count[link.source.index], count[link.target.index]);\n  }\n\n  function force(alpha) {\n    for (var k = 0, n = links.length; k < iterations; ++k) {\n      for (var i = 0, link, source, target, x, y, l, b; i < n; ++i) {\n        link = links[i], source = link.source, target = link.target;\n        x = target.x + target.vx - source.x - source.vx || jiggle(random);\n        y = target.y + target.vy - source.y - source.vy || jiggle(random);\n        l = Math.sqrt(x * x + y * y);\n        l = (l - distances[i]) / l * alpha * strengths[i];\n        x *= l, y *= l;\n        target.vx -= x * (b = bias[i]);\n        target.vy -= y * b;\n        source.vx += x * (b = 1 - b);\n        source.vy += y * b;\n      }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n\n    var i,\n        n = nodes.length,\n        m = links.length,\n        nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d])),\n        link;\n\n    for (i = 0, count = new Array(n); i < m; ++i) {\n      link = links[i], link.index = i;\n      if (typeof link.source !== \"object\") link.source = find(nodeById, link.source);\n      if (typeof link.target !== \"object\") link.target = find(nodeById, link.target);\n      count[link.source.index] = (count[link.source.index] || 0) + 1;\n      count[link.target.index] = (count[link.target.index] || 0) + 1;\n    }\n\n    for (i = 0, bias = new Array(m); i < m; ++i) {\n      link = links[i], bias[i] = count[link.source.index] / (count[link.source.index] + count[link.target.index]);\n    }\n\n    strengths = new Array(m), initializeStrength();\n    distances = new Array(m), initializeDistance();\n  }\n\n  function initializeStrength() {\n    if (!nodes) return;\n\n    for (var i = 0, n = links.length; i < n; ++i) {\n      strengths[i] = +strength(links[i], i, links);\n    }\n  }\n\n  function initializeDistance() {\n    if (!nodes) return;\n\n    for (var i = 0, n = links.length; i < n; ++i) {\n      distances[i] = +distance(links[i], i, links);\n    }\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.links = function(_) {\n    return arguments.length ? (links = _, initialize(), force) : links;\n  };\n\n  force.id = function(_) {\n    return arguments.length ? (id = _, force) : id;\n  };\n\n  force.iterations = function(_) {\n    return arguments.length ? (iterations = +_, force) : iterations;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initializeStrength(), force) : strength;\n  };\n\n  force.distance = function(_) {\n    return arguments.length ? (distance = typeof _ === \"function\" ? _ : constant(+_), initializeDistance(), force) : distance;\n  };\n\n  return force;\n}\n","// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport default function() {\n  let s = 1;\n  return () => (s = (a * s + c) % m) / m;\n}\n","import {dispatch} from \"d3-dispatch\";\nimport {timer} from \"d3-timer\";\nimport lcg from \"./lcg.js\";\n\nexport function x(d) {\n  return d.x;\n}\n\nexport function y(d) {\n  return d.y;\n}\n\nvar initialRadius = 10,\n    initialAngle = Math.PI * (3 - Math.sqrt(5));\n\nexport default function(nodes) {\n  var simulation,\n      alpha = 1,\n      alphaMin = 0.001,\n      alphaDecay = 1 - Math.pow(alphaMin, 1 / 300),\n      alphaTarget = 0,\n      velocityDecay = 0.6,\n      forces = new Map(),\n      stepper = timer(step),\n      event = dispatch(\"tick\", \"end\"),\n      random = lcg();\n\n  if (nodes == null) nodes = [];\n\n  function step() {\n    tick();\n    event.call(\"tick\", simulation);\n    if (alpha < alphaMin) {\n      stepper.stop();\n      event.call(\"end\", simulation);\n    }\n  }\n\n  function tick(iterations) {\n    var i, n = nodes.length, node;\n\n    if (iterations === undefined) iterations = 1;\n\n    for (var k = 0; k < iterations; ++k) {\n      alpha += (alphaTarget - alpha) * alphaDecay;\n\n      forces.forEach(function(force) {\n        force(alpha);\n      });\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        if (node.fx == null) node.x += node.vx *= velocityDecay;\n        else node.x = node.fx, node.vx = 0;\n        if (node.fy == null) node.y += node.vy *= velocityDecay;\n        else node.y = node.fy, node.vy = 0;\n      }\n    }\n\n    return simulation;\n  }\n\n  function initializeNodes() {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.index = i;\n      if (node.fx != null) node.x = node.fx;\n      if (node.fy != null) node.y = node.fy;\n      if (isNaN(node.x) || isNaN(node.y)) {\n        var radius = initialRadius * Math.sqrt(0.5 + i), angle = i * initialAngle;\n        node.x = radius * Math.cos(angle);\n        node.y = radius * Math.sin(angle);\n      }\n      if (isNaN(node.vx) || isNaN(node.vy)) {\n        node.vx = node.vy = 0;\n      }\n    }\n  }\n\n  function initializeForce(force) {\n    if (force.initialize) force.initialize(nodes, random);\n    return force;\n  }\n\n  initializeNodes();\n\n  return simulation = {\n    tick: tick,\n\n    restart: function() {\n      return stepper.restart(step), simulation;\n    },\n\n    stop: function() {\n      return stepper.stop(), simulation;\n    },\n\n    nodes: function(_) {\n      return arguments.length ? (nodes = _, initializeNodes(), forces.forEach(initializeForce), simulation) : nodes;\n    },\n\n    alpha: function(_) {\n      return arguments.length ? (alpha = +_, simulation) : alpha;\n    },\n\n    alphaMin: function(_) {\n      return arguments.length ? (alphaMin = +_, simulation) : alphaMin;\n    },\n\n    alphaDecay: function(_) {\n      return arguments.length ? (alphaDecay = +_, simulation) : +alphaDecay;\n    },\n\n    alphaTarget: function(_) {\n      return arguments.length ? (alphaTarget = +_, simulation) : alphaTarget;\n    },\n\n    velocityDecay: function(_) {\n      return arguments.length ? (velocityDecay = 1 - _, simulation) : 1 - velocityDecay;\n    },\n\n    randomSource: function(_) {\n      return arguments.length ? (random = _, forces.forEach(initializeForce), simulation) : random;\n    },\n\n    force: function(name, _) {\n      return arguments.length > 1 ? ((_ == null ? forces.delete(name) : forces.set(name, initializeForce(_))), simulation) : forces.get(name);\n    },\n\n    find: function(x, y, radius) {\n      var i = 0,\n          n = nodes.length,\n          dx,\n          dy,\n          d2,\n          node,\n          closest;\n\n      if (radius == null) radius = Infinity;\n      else radius *= radius;\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        dx = x - node.x;\n        dy = y - node.y;\n        d2 = dx * dx + dy * dy;\n        if (d2 < radius) closest = node, radius = d2;\n      }\n\n      return closest;\n    },\n\n    on: function(name, _) {\n      return arguments.length > 1 ? (event.on(name, _), simulation) : event.on(name);\n    }\n  };\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\nimport {x, y} from \"./simulation.js\";\n\nexport default function() {\n  var nodes,\n      node,\n      random,\n      alpha,\n      strength = constant(-30),\n      strengths,\n      distanceMin2 = 1,\n      distanceMax2 = Infinity,\n      theta2 = 0.81;\n\n  function force(_) {\n    var i, n = nodes.length, tree = quadtree(nodes, x, y).visitAfter(accumulate);\n    for (alpha = _, i = 0; i < n; ++i) node = nodes[i], tree.visit(apply);\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    strengths = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], strengths[node.index] = +strength(node, i, nodes);\n  }\n\n  function accumulate(quad) {\n    var strength = 0, q, c, weight = 0, x, y, i;\n\n    // For internal nodes, accumulate forces from child quadrants.\n    if (quad.length) {\n      for (x = y = i = 0; i < 4; ++i) {\n        if ((q = quad[i]) && (c = Math.abs(q.value))) {\n          strength += q.value, weight += c, x += c * q.x, y += c * q.y;\n        }\n      }\n      quad.x = x / weight;\n      quad.y = y / weight;\n    }\n\n    // For leaf nodes, accumulate forces from coincident quadrants.\n    else {\n      q = quad;\n      q.x = q.data.x;\n      q.y = q.data.y;\n      do strength += strengths[q.data.index];\n      while (q = q.next);\n    }\n\n    quad.value = strength;\n  }\n\n  function apply(quad, x1, _, x2) {\n    if (!quad.value) return true;\n\n    var x = quad.x - node.x,\n        y = quad.y - node.y,\n        w = x2 - x1,\n        l = x * x + y * y;\n\n    // Apply the Barnes-Hut approximation if possible.\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (w * w / theta2 < l) {\n      if (l < distanceMax2) {\n        if (x === 0) x = jiggle(random), l += x * x;\n        if (y === 0) y = jiggle(random), l += y * y;\n        if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n        node.vx += x * quad.value * alpha / l;\n        node.vy += y * quad.value * alpha / l;\n      }\n      return true;\n    }\n\n    // Otherwise, process points directly.\n    else if (quad.length || l >= distanceMax2) return;\n\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (quad.data !== node || quad.next) {\n      if (x === 0) x = jiggle(random), l += x * x;\n      if (y === 0) y = jiggle(random), l += y * y;\n      if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n    }\n\n    do if (quad.data !== node) {\n      w = strengths[quad.data.index] * alpha / l;\n      node.vx += x * w;\n      node.vy += y * w;\n    } while (quad = quad.next);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.distanceMin = function(_) {\n    return arguments.length ? (distanceMin2 = _ * _, force) : Math.sqrt(distanceMin2);\n  };\n\n  force.distanceMax = function(_) {\n    return arguments.length ? (distanceMax2 = _ * _, force) : Math.sqrt(distanceMax2);\n  };\n\n  force.theta = function(_) {\n    return arguments.length ? (theta2 = _ * _, force) : Math.sqrt(theta2);\n  };\n\n  return force;\n}\n","// ── External Dependencies & Registrations\nimport { select } from 'd3-selection';\nimport { type D3DragEvent, drag } from 'd3-drag';\nimport { type D3ZoomEvent, zoom } from 'd3-zoom';\nimport { forceCenter, forceLink, forceManyBody, forceSimulation, type Simulation, type SimulationLinkDatum, type SimulationNodeDatum } from 'd3-force';\n\n// ── Types ────────────────────────────────────────────────────────────────────────────────────────────────────────────\n\nexport interface NetworkDiagramNode {\n    id: string;\n}\n\nexport interface NetworkDiagramLink {\n    source: string;\n    target: string;\n}\n\nexport interface NetworkDiagramData {\n    links: NetworkDiagramLink[];\n    nodes: NetworkDiagramNode[];\n}\n\nexport interface NetworkDiagramOptions {\n    chargeStrength?: number;\n    linkDistance?: number;\n}\n\nexport interface NetworkDiagramHandle {\n    destroy: () => void;\n    resize: () => void;\n    svg: SVGSVGElement;\n    triggerAutoLayout: () => void;\n}\n\ntype LaidOutNode = NetworkDiagramNode & SimulationNodeDatum;\ntype LaidOutLink = SimulationLinkDatum<LaidOutNode>;\n\n// ── Constants ────────────────────────────────────────────────────────────────────────────────────────────────────────\n\nconst DEFAULT_CHARGE_STRENGTH = -300;\nconst DEFAULT_LINK_DISTANCE = 100;\nconst DEFAULT_WIDTH = 640;\nconst DEFAULT_HEIGHT = 480;\nconst AUTO_LAYOUT_TICKS = 180;\nconst NODE_RADIUS = 20;\nconst NODE_RADIUS_ACTIVE = 22;\n\nconst COLOR = {\n    linkStroke: '#9ca3af',\n    nodeFill: '#2563eb',\n    nodeFillHovered: '#3b82f6',\n    nodeFillSelected: '#f59e0b',\n    nodeStroke: '#1e40af',\n    nodeStrokeHovered: '#1d4ed8',\n    nodeStrokeSelected: '#b45309',\n    nodeText: '#ffffff'\n};\n\n// ── Actions ──────────────────────────────────────────────────────────────────────────────────────────────────────────\n\nexport function renderNetworkDiagram(data: NetworkDiagramData, renderTo: HTMLElement, options: NetworkDiagramOptions = {}): NetworkDiagramHandle {\n    const width = renderTo.clientWidth || DEFAULT_WIDTH;\n    const height = renderTo.clientHeight || DEFAULT_HEIGHT;\n\n    const nodes: LaidOutNode[] = data.nodes.map((node) => ({ ...node }));\n    const links: LaidOutLink[] = data.links.map((link) => ({ ...link }));\n\n    // Set deterministic initial positions so the graph is readable before force layout runs.\n    const startRadius = Math.min(width, height) * 0.22;\n    for (const [index, node] of nodes.entries()) {\n        const angle = (index / nodes.length) * Math.PI * 2;\n        node.x = width / 2 + Math.cos(angle) * startRadius;\n        node.y = height / 2 + Math.sin(angle) * startRadius;\n    }\n\n    const simulation: Simulation<LaidOutNode, LaidOutLink> = forceSimulation(nodes)\n        .force(\n            'link',\n            forceLink<LaidOutNode, LaidOutLink>(links)\n                .id((node) => node.id)\n                .distance(options.linkDistance ?? DEFAULT_LINK_DISTANCE)\n        )\n        .force('charge', forceManyBody().strength(options.chargeStrength ?? DEFAULT_CHARGE_STRENGTH))\n        .force('center', forceCenter(width / 2, height / 2));\n\n    const svgSelection = select(renderTo)\n        .append('svg')\n        .attr('width', width)\n        .attr('height', height)\n        .attr('viewBox', `0 0 ${String(width)} ${String(height)}`)\n        .style('touch-action', 'none');\n    const viewport = svgSelection.append('g');\n\n    const link = viewport.selectAll<SVGLineElement, LaidOutLink>('line').data(links).join('line').attr('stroke', COLOR.linkStroke).attr('stroke-width', 2);\n\n    const node = viewport.selectAll<SVGGElement, LaidOutNode>('g').data(nodes).join('g').style('cursor', 'pointer');\n    node.append('circle').attr('r', NODE_RADIUS).attr('fill', COLOR.nodeFill).attr('stroke', COLOR.nodeStroke).attr('stroke-width', 2);\n    node.append('text')\n        .text((laidOutNode) => laidOutNode.id)\n        .attr('text-anchor', 'middle')\n        .attr('dy', 4)\n        .attr('fill', COLOR.nodeText); // explicit - iOS Safari can default to transparent\n\n    let selectedNodeId: string | null = null;\n    let hoveredNodeId: string | null = null;\n\n    const updateNodeStyles = (): void => {\n        node.selectAll<SVGCircleElement, LaidOutNode>('circle')\n            .attr('fill', (laidOutNode) => {\n                if (laidOutNode.id === selectedNodeId) return COLOR.nodeFillSelected;\n                if (laidOutNode.id === hoveredNodeId) return COLOR.nodeFillHovered;\n                return COLOR.nodeFill;\n            })\n            .attr('stroke', (laidOutNode) => {\n                if (laidOutNode.id === selectedNodeId) return COLOR.nodeStrokeSelected;\n                if (laidOutNode.id === hoveredNodeId) return COLOR.nodeStrokeHovered;\n                return COLOR.nodeStroke;\n            })\n            .attr('stroke-width', (laidOutNode) => (laidOutNode.id === selectedNodeId ? 3 : 2))\n            .attr('r', (laidOutNode) => (laidOutNode.id === selectedNodeId || laidOutNode.id === hoveredNodeId ? NODE_RADIUS_ACTIVE : NODE_RADIUS));\n    };\n\n    node.on('mouseenter', (_event, laidOutNode) => {\n        hoveredNodeId = laidOutNode.id;\n        updateNodeStyles();\n    })\n        .on('mouseleave', (_event, laidOutNode) => {\n            if (hoveredNodeId === laidOutNode.id) hoveredNodeId = null;\n            updateNodeStyles();\n        })\n        .on('click', (event: MouseEvent, laidOutNode) => {\n            event.stopPropagation();\n            selectedNodeId = selectedNodeId === laidOutNode.id ? null : laidOutNode.id;\n            updateNodeStyles();\n        });\n\n    svgSelection.on('click', () => {\n        selectedNodeId = null;\n        updateNodeStyles();\n    });\n\n    const zoomBehavior = zoom<SVGSVGElement, unknown>()\n        .scaleExtent([0.5, 4])\n        .on('zoom', (event: D3ZoomEvent<SVGSVGElement, unknown>) => {\n            viewport.attr('transform', event.transform.toString());\n        });\n\n    svgSelection.call(zoomBehavior).on('dblclick.zoom', null);\n\n    const getNodePosition = (value: LaidOutNode | string | number, axis: 'x' | 'y'): number => {\n        if (typeof value === 'object') return value[axis] ?? 0;\n        return 0;\n    };\n\n    const renderGraph = (): void => {\n        link.attr('x1', (laidOutLink) => getNodePosition(laidOutLink.source, 'x'))\n            .attr('y1', (laidOutLink) => getNodePosition(laidOutLink.source, 'y'))\n            .attr('x2', (laidOutLink) => getNodePosition(laidOutLink.target, 'x'))\n            .attr('y2', (laidOutLink) => getNodePosition(laidOutLink.target, 'y'));\n        node.attr('transform', (laidOutNode) => `translate(${String(laidOutNode.x ?? 0)},${String(laidOutNode.y ?? 0)})`);\n    };\n\n    // Keep force simulation idle by default; run it only on explicit request.\n    simulation.stop();\n\n    type DragEvent = D3DragEvent<SVGGElement, LaidOutNode, LaidOutNode>;\n\n    node.call(\n        drag<SVGGElement, LaidOutNode>()\n            .on('start', (event: DragEvent, laidOutNode) => {\n                (event.sourceEvent as MouseEvent | TouchEvent | undefined)?.stopPropagation();\n                laidOutNode.fx = laidOutNode.x;\n                laidOutNode.fy = laidOutNode.y;\n            })\n            .on('drag', (event: DragEvent, laidOutNode) => {\n                laidOutNode.x = event.x;\n                laidOutNode.y = event.y;\n                laidOutNode.fx = event.x;\n                laidOutNode.fy = event.y;\n                renderGraph();\n            })\n            .on('end', (_event: DragEvent, laidOutNode) => {\n                laidOutNode.fx = null;\n                laidOutNode.fy = null;\n            })\n    );\n\n    renderGraph();\n\n    const svgNode = svgSelection.node();\n    if (svgNode == null) throw new Error('Failed to create network diagram SVG element.');\n\n    return {\n        destroy: () => {\n            simulation.stop();\n            svgSelection.remove();\n        },\n        resize: () => {\n            const newWidth = renderTo.clientWidth || DEFAULT_WIDTH;\n            const newHeight = renderTo.clientHeight || DEFAULT_HEIGHT;\n            svgSelection.attr('width', newWidth).attr('height', newHeight).attr('viewBox', `0 0 ${String(newWidth)} ${String(newHeight)}`);\n            simulation.force('center', forceCenter(newWidth / 2, newHeight / 2));\n        },\n        svg: svgNode,\n        triggerAutoLayout: () => {\n            simulation.alpha(1);\n            for (let step = 0; step < AUTO_LAYOUT_TICKS; step += 1) simulation.tick();\n            simulation.stop();\n            renderGraph();\n        }\n    };\n}\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],"mappings":";;;;;AAAA,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,GAAO,IAAW;CAGtB,AADA,AAAe,MAAI,GACnB,AAAe,MAAI;CAEnB,SAAS,IAAQ;EACf,IAAI,GACA,IAAI,EAAM,QACV,GACA,IAAK,GACL,IAAK;EAET,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GACnB,IAAO,EAAM,IAAI,KAAM,EAAK,GAAG,KAAM,EAAK;EAG5C,KAAK,KAAM,IAAK,IAAI,KAAK,GAAU,KAAM,IAAK,IAAI,KAAK,GAAU,IAAI,GAAG,IAAI,GAAG,EAAE,GAC/E,IAAO,EAAM,IAAI,EAAK,KAAK,GAAI,EAAK,KAAK;CAE7C;CAkBA,OAhBA,EAAM,aAAa,SAAS,GAAG;EAC7B,IAAQ;CACV,GAEA,EAAM,IAAI,SAAS,GAAG;EACpB,OAAO,UAAU,UAAU,IAAI,CAAC,GAAG,KAAS;CAC9C,GAEA,EAAM,IAAI,SAAS,GAAG;EACpB,OAAO,UAAU,UAAU,IAAI,CAAC,GAAG,KAAS;CAC9C,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,CAAC,GAAG,KAAS;CACrD,GAEO;AACT;;;ACvCA,SAAA,EAAwB,GAAG;CACzB,IAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,GAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC;CAC7B,OAAO,EAAI,KAAK,MAAM,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;AACtC;AAEA,SAAS,EAAI,GAAM,GAAG,GAAG,GAAG;CAC1B,IAAI,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG,OAAO;CAEjC,IAAI,GACA,IAAO,EAAK,OACZ,IAAO,EAAC,MAAM,EAAC,GACf,IAAK,EAAK,KACV,IAAK,EAAK,KACV,IAAK,EAAK,KACV,IAAK,EAAK,KACV,GACA,GACA,GACA,GACA,GACA,GACA,GACA;CAGJ,IAAI,CAAC,GAAM,OAAO,EAAK,QAAQ,GAAM;CAGrC,OAAO,EAAK,SAGV,KAFI,IAAQ,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,IACtD,IAAS,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,GACvD,IAAS,GAAM,EAAE,IAAO,EAAK,IAAI,KAAU,IAAI,KAAS,OAAO,EAAO,KAAK,GAAM;CAMvF,IAFA,IAAK,CAAC,EAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GAClC,IAAK,CAAC,EAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GAC9B,MAAM,KAAM,MAAM,GAAI,OAAO,EAAK,OAAO,GAAM,IAAS,EAAO,KAAK,IAAO,EAAK,QAAQ,GAAM;CAGlG;EAGE,AAFA,IAAS,IAAS,EAAO,KAAK;;;;;EAAW,IAAI,EAAK,QAAQ;;;;;EAAW,IACjE,IAAQ,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,IACtD,IAAS,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK;SACnD,IAAI,KAAU,IAAI,OAAY,KAAK,KAAM,MAAO,IAAK,KAAM;CACrE,OAAO,EAAO,KAAK,GAAM,EAAO,KAAK,GAAM;AAC7C;AAEA,SAAgB,EAAO,GAAM;CAC3B,IAAI,GAAG,GAAG,IAAI,EAAK,QACf,GACA,GACA,IAAS,MAAM,CAAC,GAChB,IAAS,MAAM,CAAC,GAChB,IAAK,UACL,IAAK,UACL,IAAK,WACL,IAAK;CAGT,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GACf,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,IAAI,EAAK,EAAE,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,MACnF,EAAG,KAAK,GACR,EAAG,KAAK,GACJ,IAAI,MAAI,IAAK,IACb,IAAI,MAAI,IAAK,IACb,IAAI,MAAI,IAAK,IACb,IAAI,MAAI,IAAK;CAInB,IAAI,IAAK,KAAM,IAAK,GAAI,OAAO;CAM/B,KAHA,KAAK,MAAM,GAAI,CAAE,CAAC,CAAC,MAAM,GAAI,CAAE,GAG1B,IAAI,GAAG,IAAI,GAAG,EAAE,GACnB,EAAI,MAAM,EAAG,IAAI,EAAG,IAAI,EAAK,EAAE;CAGjC,OAAO;AACT;;;ACnFA,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,MAAM,IAAI,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,GAAG,OAAO;CAE3C,IAAI,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK;CAKd,IAAI,MAAM,CAAE,GAEV,AADA,KAAM,IAAK,KAAK,MAAM,CAAC,KAAK,GAC5B,KAAM,IAAK,KAAK,MAAM,CAAC,KAAK;MAIzB;EAMH,KALA,IAAI,IAAI,IAAK,KAAM,GACf,IAAO,KAAK,OACZ,GACA,GAEG,IAAK,KAAK,KAAK,KAAM,IAAK,KAAK,KAAK,IAGzC,QAFA,KAAK,IAAI,MAAO,IAAK,IAAI,GACzB,IAAS;;;;;EAAW,GAAG,EAAO,KAAK,GAAM,IAAO,GAAQ,KAAK,GACrD,GAAR;GACE,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;GAClC,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;GAClC,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;GAClC,KAAK,GAAG,IAAK,IAAK,GAAG,IAAK,IAAK;EACjC;EAGF,AAAI,KAAK,SAAS,KAAK,MAAM,WAAQ,KAAK,QAAQ;CACpD;CAMA,OAJA,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACJ;AACT;;;AC1CA,SAAA,IAA0B;CACxB,IAAI,IAAO,CAAC;CAIZ,OAHA,KAAK,MAAM,SAAS,GAAM;EACxB,IAAI,CAAC,EAAK,QAAQ;GAAG,EAAK,KAAK,EAAK,IAAI;SAAU,IAAO,EAAK;CAChE,CAAC,GACM;AACT;;;ACNA,SAAA,EAAwB,GAAG;CACzB,OAAO,UAAU,SACX,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,IACvD,MAAM,KAAK,GAAG,IAAI,KAAA,IAAY,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AACjF;;;ACJA,SAAA,EAAwB,GAAM,GAAI,GAAI,GAAI,GAAI;CAK5C,AAJA,KAAK,OAAO,GACZ,KAAK,KAAK,GACV,KAAK,KAAK,GACV,KAAK,KAAK,GACV,KAAK,KAAK;AACZ;;;ACJA,SAAA,EAAwB,GAAG,GAAG,GAAQ;CACpC,IAAI,GACA,IAAK,KAAK,KACV,IAAK,KAAK,KACV,GACA,GACA,GACA,GACA,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAQ,CAAC,GACT,IAAO,KAAK,OACZ,GACA;CAUJ,KARI,KAAM,EAAM,KAAK,IAAIA,EAAK,GAAM,GAAI,GAAI,GAAI,CAAE,CAAC,GAC/C,KAAU,OAAM,IAAS,YAE3B,IAAK,IAAI,GAAQ,IAAK,IAAI,GAC1B,IAAK,IAAI,GAAQ,IAAK,IAAI,GAC1B,KAAU,IAGL,IAAI,EAAM,IAAI,IAGf,QAAE,IAAO,EAAE,UACP,IAAK,EAAE,MAAM,MACb,IAAK,EAAE,MAAM,MACb,IAAK,EAAE,MAAM,MACb,IAAK,EAAE,MAAM,IAGrB;MAAI,EAAK,QAAQ;GACf,IAAI,KAAM,IAAK,KAAM,GACjB,KAAM,IAAK,KAAM;GAUrB,AARA,EAAM,KACJ,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,GAChC,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,GAChC,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,GAChC,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,CAClC,IAGI,KAAK,KAAK,MAAO,IAAK,KAAK,OAC7B,IAAI,EAAM,EAAM,SAAS,IACzB,EAAM,EAAM,SAAS,KAAK,EAAM,EAAM,SAAS,IAAI,IACnD,EAAM,EAAM,SAAS,IAAI,KAAK;EAElC,OAGK;GACH,IAAI,IAAK,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GACtC,IAAK,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GACtC,IAAK,IAAK,IAAK,IAAK;GACxB,IAAI,IAAK,GAAQ;IACf,IAAI,IAAI,KAAK,KAAK,IAAS,CAAE;IAG7B,AAFA,IAAK,IAAI,GAAG,IAAK,IAAI,GACrB,IAAK,IAAI,GAAG,IAAK,IAAI,GACrB,IAAO,EAAK;GACd;EACF;;CAGF,OAAO;AACT;;;ACrEA,SAAA,EAAwB,GAAG;CACzB,IAAI,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,GAAG,OAAO;CAEnF,IAAI,GACA,IAAO,KAAK,OACZ,GACA,GACA,GACA,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK,KACV,GACA,GACA,GACA,GACA,GACA,GACA,GACA;CAGJ,IAAI,CAAC,GAAM,OAAO;CAIlB,IAAI,EAAK,QAAQ,SAAa;EAG5B,KAFI,IAAQ,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,IACtD,IAAS,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,GACrD,IAAS,GAAM,MAAO,EAAK,IAAI,KAAU,IAAI,KAAS,OAAO;EACnE,IAAI,CAAC,EAAK,QAAQ;EAClB,CAAI,EAAQ,IAAI,IAAK,MAAM,EAAQ,IAAI,IAAK,MAAM,EAAQ,IAAI,IAAK,QAAI,IAAW,GAAQ,IAAI;CAChG;CAGA,OAAO,EAAK,SAAS,IAAG,IAAM,IAAW,GAAM,MAAO,EAAK,OAAO,OAAO;CAoBzE,QAnBI,IAAO,EAAK,SAAM,OAAO,EAAK,MAG9B,KAAkB,IAAO,EAAS,OAAO,IAAO,OAAO,EAAS,MAAO,QAGtE,KAGL,IAAO,EAAO,KAAK,IAAO,OAAO,EAAO,KAGnC,IAAO,EAAO,MAAM,EAAO,MAAM,EAAO,MAAM,EAAO,OACnD,OAAU,EAAO,MAAM,EAAO,MAAM,EAAO,MAAM,EAAO,OACxD,CAAC,EAAK,WACP,IAAU,EAAS,KAAK,IACvB,KAAK,QAAQ,IAGb,SAba,KAAK,QAAQ,GAAM;AAczC;AAEA,SAAgB,EAAU,GAAM;CAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,IAAI,GAAG,EAAE,GAAG,KAAK,OAAO,EAAK,EAAE;CAChE,OAAO;AACT;;;AC7DA,SAAA,IAA0B;CACxB,OAAO,KAAK;AACd;;;ACFA,SAAA,IAA0B;CACxB,IAAI,IAAO;CAIX,OAHA,KAAK,MAAM,SAAS,GAAM;EACxB,IAAI,CAAC,EAAK,QAAQ;GAAG,EAAE;SAAa,IAAO,EAAK;CAClD,CAAC,GACM;AACT;;;ACJA,SAAA,EAAwB,GAAU;CAChC,IAAI,IAAQ,CAAC,GAAG,GAAG,IAAO,KAAK,OAAO,GAAO,GAAI,GAAI,GAAI;CAEzD,KADI,KAAM,EAAM,KAAK,IAAIC,EAAK,GAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GACpE,IAAI,EAAM,IAAI,IACnB,IAAI,CAAC,EAAS,IAAO,EAAE,MAAM,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,EAAE,KAAK,EAAK,QAAQ;EACvF,IAAI,KAAM,IAAK,KAAM,GAAG,KAAM,IAAK,KAAM;EAIzC,CAHI,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC;CACjE;CAEF,OAAO;AACT;;;ACbA,SAAA,EAAwB,GAAU;CAChC,IAAI,IAAQ,CAAC,GAAG,IAAO,CAAC,GAAG;CAE3B,KADI,KAAK,SAAO,EAAM,KAAK,IAAIC,EAAK,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GAChF,IAAI,EAAM,IAAI,IAAG;EACtB,IAAI,IAAO,EAAE;EACb,IAAI,EAAK,QAAQ;GACf,IAAI,GAAO,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,KAAM,IAAK,KAAM,GAAG,KAAM,IAAK,KAAM;GAI5F,CAHI,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC;EACjE;EACA,EAAK,KAAK,CAAC;CACb;CACA,OAAO,IAAI,EAAK,IAAI,IAClB,EAAS,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;CAEzC,OAAO;AACT;;;ACpBA,SAAgB,EAAS,GAAG;CAC1B,OAAO,EAAE;AACX;AAEA,SAAA,EAAwB,GAAG;CACzB,OAAO,UAAU,UAAU,KAAK,KAAK,GAAG,QAAQ,KAAK;AACvD;;;ACNA,SAAgB,EAAS,GAAG;CAC1B,OAAO,EAAE;AACX;AAEA,SAAA,EAAwB,GAAG;CACzB,OAAO,UAAU,UAAU,KAAK,KAAK,GAAG,QAAQ,KAAK;AACvD;;;ACOA,SAAwB,EAAS,GAAO,GAAG,GAAG;CAC5C,IAAI,IAAO,IAAI,EAAS,KAAY,GAAc,KAAY,GAAc,KAAK,KAAK,KAAK,GAAG;CAC9F,OAAO,KAAS,OAAO,IAAO,EAAK,OAAO,CAAK;AACjD;AAEA,SAAS,EAAS,GAAG,GAAG,GAAI,GAAI,GAAI,GAAI;CAOtC,AANA,KAAK,KAAK,GACV,KAAK,KAAK,GACV,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,QAAQ,KAAA;AACf;AAEA,SAAS,EAAU,GAAM;CAEvB,KADA,IAAI,IAAO,EAAC,MAAM,EAAK,KAAI,GAAG,IAAO,GAC9B,IAAO,EAAK,OAAM,IAAO,EAAK,OAAO,EAAC,MAAM,EAAK,KAAI;CAC5D,OAAO;AACT;AAEA,IAAI,IAAY,EAAS,YAAY,EAAS;AAE9C,EAAU,OAAO,WAAW;CAC1B,IAAI,IAAO,IAAI,EAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GAC5E,IAAO,KAAK,OACZ,GACA;CAEJ,IAAI,CAAC,GAAM,OAAO;CAElB,IAAI,CAAC,EAAK,QAAQ,OAAO,EAAK,QAAQ,EAAU,CAAI,GAAG;CAGvD,KADA,IAAQ,CAAC;EAAC,QAAQ;EAAM,QAAQ,EAAK,QAAQ;;;;;EAAW;CAAC,CAAC,GACnD,IAAO,EAAM,IAAI,IACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GACvB,CAAI,IAAQ,EAAK,OAAO,QAClB,EAAM,SAAQ,EAAM,KAAK;EAAC,QAAQ;EAAO,QAAQ,EAAK,OAAO,KAAK;;;;;EAAW;CAAC,CAAC,IAC9E,EAAK,OAAO,KAAK,EAAU,CAAK;CAK3C,OAAO;AACT,GAEA,EAAU,MAAMC,GAChB,EAAU,SAASC,GACnB,EAAU,QAAQC,GAClB,EAAU,OAAOC,GACjB,EAAU,SAASC,GACnB,EAAU,OAAOC,GACjB,EAAU,SAASC,GACnB,EAAU,YAAYC,GACtB,EAAU,OAAOC,GACjB,EAAU,OAAOC,GACjB,EAAU,QAAQC,GAClB,EAAU,aAAaC,GACvB,EAAU,IAAIC,GACd,EAAU,IAAIC;;;ACxEd,SAAA,EAAwB,GAAG;CACzB,OAAO,WAAW;EAChB,OAAO;CACT;AACF;;;ACJA,SAAA,EAAwB,GAAQ;CAC9B,QAAQ,EAAO,IAAI,MAAO;AAC5B;;;ACCA,SAAS,EAAM,GAAG;CAChB,OAAO,EAAE;AACX;AAEA,SAAS,EAAK,GAAU,GAAQ;CAC9B,IAAI,IAAO,EAAS,IAAI,CAAM;CAC9B,IAAI,CAAC,GAAM,MAAU,MAAM,qBAAqB,CAAM;CACtD,OAAO;AACT;AAEA,SAAA,EAAwB,GAAO;CAC7B,IAAI,IAAK,GACL,IAAW,GACX,GACA,IAAWC,EAAS,EAAE,GACtB,GACA,GACA,GACA,GACA,GACA,IAAa;CAEjB,AAAmB,MAAQ,CAAC;CAE5B,SAAS,EAAgB,GAAM;EAC7B,OAAO,IAAI,KAAK,IAAI,EAAM,EAAK,OAAO,QAAQ,EAAM,EAAK,OAAO,MAAM;CACxE;CAEA,SAAS,EAAM,GAAO;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAY,EAAE,GAClD,KAAK,IAAI,IAAI,GAAG,GAAM,GAAQ,GAAQ,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,EAAE,GAUzD,AATA,IAAO,EAAM,IAAI,IAAS,EAAK,QAAQ,IAAS,EAAK,QACrD,IAAI,EAAO,IAAI,EAAO,KAAK,EAAO,IAAI,EAAO,MAAMC,EAAO,CAAM,GAChE,IAAI,EAAO,IAAI,EAAO,KAAK,EAAO,IAAI,EAAO,MAAMA,EAAO,CAAM,GAChE,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC,GAC3B,KAAK,IAAI,EAAU,MAAM,IAAI,IAAQ,EAAU,IAC/C,KAAK,GAAG,KAAK,GACb,EAAO,MAAM,KAAK,IAAI,EAAK,KAC3B,EAAO,MAAM,IAAI,GACjB,EAAO,MAAM,KAAK,IAAI,IAAI,IAC1B,EAAO,MAAM,IAAI;CAGvB;CAEA,SAAS,IAAa;EACf,OAEL;OAAI,GACA,IAAI,EAAM,QACV,IAAI,EAAM,QACV,IAAW,IAAI,IAAI,EAAM,KAAK,GAAG,MAAM,CAAC,EAAG,GAAG,GAAG,CAAK,GAAG,CAAC,CAAC,CAAC,GAC5D;GAEJ,KAAK,IAAI,GAAG,IAAY,MAAM,CAAC,GAAG,IAAI,GAAG,EAAE,GAKzC,AAJA,IAAO,EAAM,IAAI,EAAK,QAAQ,GAC1B,OAAO,EAAK,UAAW,aAAU,EAAK,SAAS,EAAK,GAAU,EAAK,MAAM,IACzE,OAAO,EAAK,UAAW,aAAU,EAAK,SAAS,EAAK,GAAU,EAAK,MAAM,IAC7E,EAAM,EAAK,OAAO,UAAU,EAAM,EAAK,OAAO,UAAU,KAAK,GAC7D,EAAM,EAAK,OAAO,UAAU,EAAM,EAAK,OAAO,UAAU,KAAK;GAG/D,KAAK,IAAI,GAAG,IAAW,MAAM,CAAC,GAAG,IAAI,GAAG,EAAE,GACxC,IAAO,EAAM,IAAI,EAAK,KAAK,EAAM,EAAK,OAAO,UAAU,EAAM,EAAK,OAAO,SAAS,EAAM,EAAK,OAAO;GAItG,AADA,IAAgB,MAAM,CAAC,GAAG,EAAmB,GAC7C,IAAgB,MAAM,CAAC,GAAG,EAAmB;EAfzC;CAgBN;CAEA,SAAS,IAAqB;EACvB,OAEL,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,EAAE,GACzC,EAAU,KAAK,CAAC,EAAS,EAAM,IAAI,GAAG,CAAK;CAE/C;CAEA,SAAS,IAAqB;EACvB,OAEL,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,EAAE,GACzC,EAAU,KAAK,CAAC,EAAS,EAAM,IAAI,GAAG,CAAK;CAE/C;CA4BA,OA1BA,EAAM,aAAa,SAAS,GAAQ,GAAS;EAG3C,AAFA,IAAQ,GACR,IAAS,GACT,EAAW;CACb,GAEA,EAAM,QAAQ,SAAS,GAAG;EACxB,OAAO,UAAU,UAAU,IAAQ,GAAG,EAAW,GAAG,KAAS;CAC/D,GAEA,EAAM,KAAK,SAAS,GAAG;EACrB,OAAO,UAAU,UAAU,IAAK,GAAG,KAAS;CAC9C,GAEA,EAAM,aAAa,SAAS,GAAG;EAC7B,OAAO,UAAU,UAAU,IAAa,CAAC,GAAG,KAAS;CACvD,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,OAAO,KAAM,aAAa,IAAID,EAAS,CAAC,CAAC,GAAG,EAAmB,GAAG,KAAS;CACnH,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,CAAC,GAAG,EAAmB,GAAG,KAAS;CACnH,GAEO;AACT;;;ACnHA,IAAM,IAAI,SACJ,IAAI,YACJ,IAAI;AAEV,SAAA,IAA0B;CACxB,IAAI,IAAI;CACR,cAAc,KAAK,IAAI,IAAI,KAAK,KAAK;AACvC;;;ACJA,SAAgB,EAAE,GAAG;CACnB,OAAO,EAAE;AACX;AAEA,SAAgB,EAAE,GAAG;CACnB,OAAO,EAAE;AACX;AAEA,IAAI,IAAgB,IAChB,IAAe,KAAK,MAAM,IAAI,KAAK,KAAK,CAAC;AAE7C,SAAA,EAAwB,GAAO;CAC7B,IAAI,GACA,IAAQ,GACR,IAAW,MACX,IAAa,IAAa,MAAU,IAAI,MACxC,IAAc,GACd,IAAgB,IAChB,oBAAS,IAAI,IAAI,GACjB,IAAU,EAAM,CAAI,GACpB,IAAQ,EAAS,QAAQ,KAAK,GAC9B,IAASE,EAAI;CAEjB,AAAmB,MAAQ,CAAC;CAE5B,SAAS,IAAO;EAGd,AAFA,EAAK,GACL,EAAM,KAAK,QAAQ,CAAU,GACzB,IAAQ,MACV,EAAQ,KAAK,GACb,EAAM,KAAK,OAAO,CAAU;CAEhC;CAEA,SAAS,EAAK,GAAY;EACxB,IAAI,GAAG,IAAI,EAAM,QAAQ;EAEzB,AAAI,MAAe,KAAA,MAAW,IAAa;EAE3C,KAAK,IAAI,IAAI,GAAG,IAAI,GAAY,EAAE,GAOhC,KANA,MAAU,IAAc,KAAS,GAEjC,EAAO,QAAQ,SAAS,GAAO;GAC7B,EAAM,CAAK;EACb,CAAC,GAEI,IAAI,GAAG,IAAI,GAAG,EAAE,GAInB,AAHA,IAAO,EAAM,IACT,EAAK,MAAM,OAAM,EAAK,KAAK,EAAK,MAAM,KACrC,EAAK,IAAI,EAAK,IAAI,EAAK,KAAK,IAC7B,EAAK,MAAM,OAAM,EAAK,KAAK,EAAK,MAAM,KACrC,EAAK,IAAI,EAAK,IAAI,EAAK,KAAK;EAIrC,OAAO;CACT;CAEA,SAAS,IAAkB;EACzB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,GAAM,IAAI,GAAG,EAAE,GAAG;GAIlD,IAHA,IAAO,EAAM,IAAI,EAAK,QAAQ,GAC1B,EAAK,MAAM,SAAM,EAAK,IAAI,EAAK,KAC/B,EAAK,MAAM,SAAM,EAAK,IAAI,EAAK,KAC/B,MAAM,EAAK,CAAC,KAAK,MAAM,EAAK,CAAC,GAAG;IAClC,IAAI,IAAS,IAAgB,KAAK,KAAK,KAAM,CAAC,GAAG,IAAQ,IAAI;IAE7D,AADA,EAAK,IAAI,IAAS,KAAK,IAAI,CAAK,GAChC,EAAK,IAAI,IAAS,KAAK,IAAI,CAAK;GAClC;GACA,CAAI,MAAM,EAAK,EAAE,KAAK,MAAM,EAAK,EAAE,OACjC,EAAK,KAAK,EAAK,KAAK;EAExB;CACF;CAEA,SAAS,EAAgB,GAAO;EAE9B,OADI,EAAM,cAAY,EAAM,WAAW,GAAO,CAAM,GAC7C;CACT;CAIA,OAFA,EAAgB,GAET,IAAa;EACZ;EAEN,SAAS,WAAW;GAClB,OAAO,EAAQ,QAAQ,CAAI,GAAG;EAChC;EAEA,MAAM,WAAW;GACf,OAAO,EAAQ,KAAK,GAAG;EACzB;EAEA,OAAO,SAAS,GAAG;GACjB,OAAO,UAAU,UAAU,IAAQ,GAAG,EAAgB,GAAG,EAAO,QAAQ,CAAe,GAAG,KAAc;EAC1G;EAEA,OAAO,SAAS,GAAG;GACjB,OAAO,UAAU,UAAU,IAAQ,CAAC,GAAG,KAAc;EACvD;EAEA,UAAU,SAAS,GAAG;GACpB,OAAO,UAAU,UAAU,IAAW,CAAC,GAAG,KAAc;EAC1D;EAEA,YAAY,SAAS,GAAG;GACtB,OAAO,UAAU,UAAU,IAAa,CAAC,GAAG,KAAc,CAAC;EAC7D;EAEA,aAAa,SAAS,GAAG;GACvB,OAAO,UAAU,UAAU,IAAc,CAAC,GAAG,KAAc;EAC7D;EAEA,eAAe,SAAS,GAAG;GACzB,OAAO,UAAU,UAAU,IAAgB,IAAI,GAAG,KAAc,IAAI;EACtE;EAEA,cAAc,SAAS,GAAG;GACxB,OAAO,UAAU,UAAU,IAAS,GAAG,EAAO,QAAQ,CAAe,GAAG,KAAc;EACxF;EAEA,OAAO,SAAS,GAAM,GAAG;GACvB,OAAO,UAAU,SAAS,KAAM,KAAK,OAAO,EAAO,OAAO,CAAI,IAAI,EAAO,IAAI,GAAM,EAAgB,CAAC,CAAC,GAAI,KAAc,EAAO,IAAI,CAAI;EACxI;EAEA,MAAM,SAAS,GAAG,GAAG,GAAQ;GAC3B,IAAI,IAAI,GACJ,IAAI,EAAM,QACV,GACA,GACA,GACA,GACA;GAKJ,KAHI,KAAU,OAAM,IAAS,WACxB,KAAU,GAEV,IAAI,GAAG,IAAI,GAAG,EAAE,GAKnB,AAJA,IAAO,EAAM,IACb,IAAK,IAAI,EAAK,GACd,IAAK,IAAI,EAAK,GACd,IAAK,IAAK,IAAK,IAAK,GAChB,IAAK,MAAQ,IAAU,GAAM,IAAS;GAG5C,OAAO;EACT;EAEA,IAAI,SAAS,GAAM,GAAG;GACpB,OAAO,UAAU,SAAS,KAAK,EAAM,GAAG,GAAM,CAAC,GAAG,KAAc,EAAM,GAAG,CAAI;EAC/E;CACF;AACF;;;ACtJA,SAAA,IAA0B;CACxB,IAAI,GACA,GACA,GACA,GACA,IAAWC,EAAS,GAAG,GACvB,GACA,IAAe,GACf,IAAe,UACf,IAAS;CAEb,SAAS,EAAM,GAAG;EAChB,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAO,EAAS,GAAO,GAAG,CAAC,CAAC,CAAC,WAAW,CAAU;EAC3E,KAAK,IAAQ,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,IAAO,EAAM,IAAI,EAAK,MAAM,CAAK;CACtE;CAEA,SAAS,IAAa;EACf,OACL;OAAI,GAAG,IAAI,EAAM,QAAQ;GAEzB,KADA,IAAgB,MAAM,CAAC,GAClB,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,IAAO,EAAM,IAAI,EAAU,EAAK,SAAS,CAAC,EAAS,GAAM,GAAG,CAAK;EAFhE;CAG3B;CAEA,SAAS,EAAW,GAAM;EACxB,IAAI,IAAW,GAAG,GAAG,GAAG,IAAS,GAAG,GAAG,GAAG;EAG1C,IAAI,EAAK,QAAQ;GACf,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAC3B,CAAK,IAAI,EAAK,QAAQ,IAAI,KAAK,IAAI,EAAE,KAAK,OACxC,KAAY,EAAE,OAAO,KAAU,GAAG,KAAK,IAAI,EAAE,GAAG,KAAK,IAAI,EAAE;GAI/D,AADA,EAAK,IAAI,IAAI,GACb,EAAK,IAAI,IAAI;EACf,OAGK;GAGH,AAFA,IAAI,GACJ,EAAE,IAAI,EAAE,KAAK,GACb,EAAE,IAAI,EAAE,KAAK;GACb;IAAG,KAAY,EAAU,EAAE,KAAK;UACzB,IAAI,EAAE;EACf;EAEA,EAAK,QAAQ;CACf;CAEA,SAAS,EAAM,GAAM,GAAI,GAAG,GAAI;EAC9B,IAAI,CAAC,EAAK,OAAO,OAAO;EAExB,IAAI,IAAI,EAAK,IAAI,EAAK,GAClB,IAAI,EAAK,IAAI,EAAK,GAClB,IAAI,IAAK,GACT,IAAI,IAAI,IAAI,IAAI;EAIpB,IAAI,IAAI,IAAI,IAAS,GAQnB,OAPI,IAAI,MACF,MAAM,MAAG,IAAIC,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,IAAI,MAAc,IAAI,KAAK,KAAK,IAAe,CAAC,IACpD,EAAK,MAAM,IAAI,EAAK,QAAQ,IAAQ,GACpC,EAAK,MAAM,IAAI,EAAK,QAAQ,IAAQ,IAE/B;EAIA,QAAK,UAAU,KAAK,IAG7B;IAAI,EAAK,SAAS,KAAQ,EAAK,UACzB,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,IAAI,MAAc,IAAI,KAAK,KAAK,IAAe,CAAC;GAGtD;IAAG,AAAI,EAAK,SAAS,MACnB,IAAI,EAAU,EAAK,KAAK,SAAS,IAAQ,GACzC,EAAK,MAAM,IAAI,GACf,EAAK,MAAM,IAAI;UACR,IAAO,EAAK;EANrB;CAOF;CAwBA,OAtBA,EAAM,aAAa,SAAS,GAAQ,GAAS;EAG3C,AAFA,IAAQ,GACR,IAAS,GACT,EAAW;CACb,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,OAAO,KAAM,aAAa,IAAID,EAAS,CAAC,CAAC,GAAG,EAAW,GAAG,KAAS;CAC3G,GAEA,EAAM,cAAc,SAAS,GAAG;EAC9B,OAAO,UAAU,UAAU,IAAe,IAAI,GAAG,KAAS,KAAK,KAAK,CAAY;CAClF,GAEA,EAAM,cAAc,SAAS,GAAG;EAC9B,OAAO,UAAU,UAAU,IAAe,IAAI,GAAG,KAAS,KAAK,KAAK,CAAY;CAClF,GAEA,EAAM,QAAQ,SAAS,GAAG;EACxB,OAAO,UAAU,UAAU,IAAS,IAAI,GAAG,KAAS,KAAK,KAAK,CAAM;CACtE,GAEO;AACT;;;AC5EA,IAAM,IAA0B,MAC1B,IAAwB,KACxB,IAAgB,KAChB,IAAiB,KACjB,IAAoB,KACpB,IAAc,IACd,IAAqB,IAErB,IAAQ;CACV,YAAY;CACZ,UAAU;CACV,iBAAiB;CACjB,kBAAkB;CAClB,YAAY;CACZ,mBAAmB;CACnB,oBAAoB;CACpB,UAAU;AACd;AAIA,SAAgB,EAAqB,GAA0B,GAAuB,IAAiC,CAAC,GAAyB;CAC7I,IAAM,IAAQ,EAAS,eAAe,GAChC,IAAS,EAAS,gBAAgB,GAElC,IAAuB,EAAK,MAAM,KAAK,OAAU,EAAE,GAAG,EAAK,EAAE,GAC7D,IAAuB,EAAK,MAAM,KAAK,OAAU,EAAE,GAAG,EAAK,EAAE,GAG7D,IAAc,KAAK,IAAI,GAAO,CAAM,IAAI;CAC9C,KAAK,IAAM,CAAC,GAAO,MAAS,EAAM,QAAQ,GAAG;EACzC,IAAM,IAAS,IAAQ,EAAM,SAAU,KAAK,KAAK;EAEjD,AADA,EAAK,IAAI,IAAQ,IAAI,KAAK,IAAI,CAAK,IAAI,GACvC,EAAK,IAAI,IAAS,IAAI,KAAK,IAAI,CAAK,IAAI;CAC5C;CAEA,IAAM,IAAmD,EAAgB,CAAK,CAAC,CAC1E,MACG,QACA,EAAoC,CAAK,CAAC,CACrC,IAAI,MAAS,EAAK,EAAE,CAAC,CACrB,SAAS,EAAQ,gBAAgB,CAAqB,CAC/D,CAAC,CACA,MAAM,UAAU,EAAc,CAAC,CAAC,SAAS,EAAQ,kBAAkB,CAAuB,CAAC,CAAC,CAC5F,MAAM,UAAU,EAAY,IAAQ,GAAG,IAAS,CAAC,CAAC,GAEjD,IAAe,EAAO,CAAQ,CAAC,CAChC,OAAO,KAAK,CAAC,CACb,KAAK,SAAS,CAAK,CAAC,CACpB,KAAK,UAAU,CAAM,CAAC,CACtB,KAAK,WAAW,OAAO,OAAO,CAAK,EAAE,GAAG,OAAO,CAAM,GAAG,CAAC,CACzD,MAAM,gBAAgB,MAAM,GAC3B,IAAW,EAAa,OAAO,GAAG,GAElC,IAAO,EAAS,UAAuC,MAAM,CAAC,CAAC,KAAK,CAAK,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,KAAK,UAAU,EAAM,UAAU,CAAC,CAAC,KAAK,gBAAgB,CAAC,GAE/I,IAAO,EAAS,UAAoC,GAAG,CAAC,CAAC,KAAK,CAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,UAAU,SAAS;CAE9G,AADA,EAAK,OAAO,QAAQ,CAAC,CAAC,KAAK,KAAK,CAAW,CAAC,CAAC,KAAK,QAAQ,EAAM,QAAQ,CAAC,CAAC,KAAK,UAAU,EAAM,UAAU,CAAC,CAAC,KAAK,gBAAgB,CAAC,GACjI,EAAK,OAAO,MAAM,CAAC,CACd,MAAM,MAAgB,EAAY,EAAE,CAAC,CACrC,KAAK,eAAe,QAAQ,CAAC,CAC7B,KAAK,MAAM,CAAC,CAAC,CACb,KAAK,QAAQ,EAAM,QAAQ;CAEhC,IAAI,IAAgC,MAChC,IAA+B,MAE7B,UAA+B;EACjC,EAAK,UAAyC,QAAQ,CAAC,CAClD,KAAK,SAAS,MACP,EAAY,OAAO,IAAuB,EAAM,mBAChD,EAAY,OAAO,IAAsB,EAAM,kBAC5C,EAAM,QAChB,CAAC,CACD,KAAK,WAAW,MACT,EAAY,OAAO,IAAuB,EAAM,qBAChD,EAAY,OAAO,IAAsB,EAAM,oBAC5C,EAAM,UAChB,CAAC,CACD,KAAK,iBAAiB,MAAiB,EAAY,OAAO,IAAiB,IAAI,CAAE,CAAC,CAClF,KAAK,MAAM,MAAiB,EAAY,OAAO,KAAkB,EAAY,OAAO,IAAgB,IAAqB,CAAY;CAC9I;CAgBA,AAdA,EAAK,GAAG,eAAe,GAAQ,MAAgB;EAE3C,AADA,IAAgB,EAAY,IAC5B,EAAiB;CACrB,CAAC,CAAC,CACG,GAAG,eAAe,GAAQ,MAAgB;EAEvC,AADI,MAAkB,EAAY,OAAI,IAAgB,OACtD,EAAiB;CACrB,CAAC,CAAC,CACD,GAAG,UAAU,GAAmB,MAAgB;EAG7C,AAFA,EAAM,gBAAgB,GACtB,IAAiB,MAAmB,EAAY,KAAK,OAAO,EAAY,IACxE,EAAiB;CACrB,CAAC,GAEL,EAAa,GAAG,eAAe;EAE3B,AADA,IAAiB,MACjB,EAAiB;CACrB,CAAC;CAED,IAAM,IAAe,EAA6B,CAAC,CAC9C,YAAY,CAAC,IAAK,CAAC,CAAC,CAAC,CACrB,GAAG,SAAS,MAA+C;EACxD,EAAS,KAAK,aAAa,EAAM,UAAU,SAAS,CAAC;CACzD,CAAC;CAEL,EAAa,KAAK,CAAY,CAAC,CAAC,GAAG,iBAAiB,IAAI;CAExD,IAAM,KAAmB,GAAsC,MACvD,OAAO,KAAU,WAAiB,EAAM,MAAS,IAC9C,GAGL,UAA0B;EAK5B,AAJA,EAAK,KAAK,OAAO,MAAgB,EAAgB,EAAY,QAAQ,GAAG,CAAC,CAAC,CACrE,KAAK,OAAO,MAAgB,EAAgB,EAAY,QAAQ,GAAG,CAAC,CAAC,CACrE,KAAK,OAAO,MAAgB,EAAgB,EAAY,QAAQ,GAAG,CAAC,CAAC,CACrE,KAAK,OAAO,MAAgB,EAAgB,EAAY,QAAQ,GAAG,CAAC,GACzE,EAAK,KAAK,cAAc,MAAgB,aAAa,OAAO,EAAY,KAAK,CAAC,EAAE,GAAG,OAAO,EAAY,KAAK,CAAC,EAAE,EAAE;CACpH;CA2BA,AAxBA,EAAW,KAAK,GAIhB,EAAK,KACD,EAA+B,CAAC,CAC3B,GAAG,UAAU,GAAkB,MAAgB;EAG5C,AAFA,EAAO,aAAqD,gBAAgB,GAC5E,EAAY,KAAK,EAAY,GAC7B,EAAY,KAAK,EAAY;CACjC,CAAC,CAAC,CACD,GAAG,SAAS,GAAkB,MAAgB;EAK3C,AAJA,EAAY,IAAI,EAAM,GACtB,EAAY,IAAI,EAAM,GACtB,EAAY,KAAK,EAAM,GACvB,EAAY,KAAK,EAAM,GACvB,EAAY;CAChB,CAAC,CAAC,CACD,GAAG,QAAQ,GAAmB,MAAgB;EAE3C,AADA,EAAY,KAAK,MACjB,EAAY,KAAK;CACrB,CAAC,CACT,GAEA,EAAY;CAEZ,IAAM,IAAU,EAAa,KAAK;CAClC,IAAI,KAAW,MAAM,MAAU,MAAM,+CAA+C;CAEpF,OAAO;EACH,eAAe;GAEX,AADA,EAAW,KAAK,GAChB,EAAa,OAAO;EACxB;EACA,cAAc;GACV,IAAM,IAAW,EAAS,eAAe,GACnC,IAAY,EAAS,gBAAgB;GAE3C,AADA,EAAa,KAAK,SAAS,CAAQ,CAAC,CAAC,KAAK,UAAU,CAAS,CAAC,CAAC,KAAK,WAAW,OAAO,OAAO,CAAQ,EAAE,GAAG,OAAO,CAAS,GAAG,GAC7H,EAAW,MAAM,UAAU,EAAY,IAAW,GAAG,IAAY,CAAC,CAAC;EACvE;EACA,KAAK;EACL,yBAAyB;GACrB,EAAW,MAAM,CAAC;GAClB,KAAK,IAAI,IAAO,GAAG,IAAO,GAAmB,KAAQ,GAAG,EAAW,KAAK;GAExE,AADA,EAAW,KAAK,GAChB,EAAY;EAChB;CACJ;AACJ"}
+{"version":3,"file":"networkDiagram-DZwLfY_R.js","names":["Quad","Quad","Quad","tree_add","tree_addAll","tree_cover","tree_data","tree_extent","tree_find","tree_remove","tree_removeAll","tree_root","tree_size","tree_visit","tree_visitAfter","tree_x","tree_y","constant","jiggle","lcg","constant","jiggle"],"sources":["../node_modules/d3-force/src/center.js","../node_modules/d3-quadtree/src/add.js","../node_modules/d3-quadtree/src/cover.js","../node_modules/d3-quadtree/src/data.js","../node_modules/d3-quadtree/src/extent.js","../node_modules/d3-quadtree/src/quad.js","../node_modules/d3-quadtree/src/find.js","../node_modules/d3-quadtree/src/remove.js","../node_modules/d3-quadtree/src/root.js","../node_modules/d3-quadtree/src/size.js","../node_modules/d3-quadtree/src/visit.js","../node_modules/d3-quadtree/src/visitAfter.js","../node_modules/d3-quadtree/src/x.js","../node_modules/d3-quadtree/src/y.js","../node_modules/d3-quadtree/src/quadtree.js","../node_modules/d3-force/src/constant.js","../node_modules/d3-force/src/jiggle.js","../node_modules/d3-force/src/link.js","../node_modules/d3-force/src/lcg.js","../node_modules/d3-force/src/simulation.js","../node_modules/d3-force/src/manyBody.js","../src/networkDiagram.ts"],"sourcesContent":["export default function(x, y) {\n  var nodes, strength = 1;\n\n  if (x == null) x = 0;\n  if (y == null) y = 0;\n\n  function force() {\n    var i,\n        n = nodes.length,\n        node,\n        sx = 0,\n        sy = 0;\n\n    for (i = 0; i < n; ++i) {\n      node = nodes[i], sx += node.x, sy += node.y;\n    }\n\n    for (sx = (sx / n - x) * strength, sy = (sy / n - y) * strength, i = 0; i < n; ++i) {\n      node = nodes[i], node.x -= sx, node.y -= sy;\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = +_, force) : x;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = +_, force) : y;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  return force;\n}\n","export default function(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d);\n  return add(this.cover(x, y), x, y, d);\n}\n\nfunction add(tree, x, y, d) {\n  if (isNaN(x) || isNaN(y)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      xm,\n      ym,\n      xp,\n      yp,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (parent = node, !(node = node[i = bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  if (x === xp && y === yp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(4) : tree._root = new Array(4);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n  } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n  var d, i, n = data.length,\n      x,\n      y,\n      xz = new Array(n),\n      yz = new Array(n),\n      x0 = Infinity,\n      y0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (i = 0; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0).cover(x1, y1);\n\n  // Add the new points.\n  for (i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], data[i]);\n  }\n\n  return this;\n}\n","export default function(x, y) {\n  if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1;\n\n  // If the quadtree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing quadrant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var z = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1) {\n      i = (y < y0) << 1 | (x < x0);\n      parent = new Array(4), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z, y1 = y0 + z; break;\n        case 1: x0 = x1 - z, y1 = y0 + z; break;\n        case 2: x1 = x0 + z, y0 = y1 - z; break;\n        case 3: x0 = x1 - z, y0 = y1 - z; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  return this;\n}\n","export default function() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n","export default function(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];\n}\n","export default function(node, x0, y0, x1, y1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.x1 = x1;\n  this.y1 = y1;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(x, y, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1,\n      y1,\n      x2,\n      y2,\n      x3 = this._x1,\n      y3 = this._y1,\n      quads = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) quads.push(new Quad(node, x0, y0, x3, y3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius;\n    x3 = x + radius, y3 = y + radius;\n    radius *= radius;\n  }\n\n  while (q = quads.pop()) {\n\n    // Stop searching if this quadrant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0) continue;\n\n    // Bisect the current quadrant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2;\n\n      quads.push(\n        new Quad(node[3], xm, ym, x2, y2),\n        new Quad(node[2], x1, ym, xm, y2),\n        new Quad(node[1], xm, y1, x2, ym),\n        new Quad(node[0], x1, y1, xm, ym)\n      );\n\n      // Visit the closest quadrant first.\n      if (i = (y >= ym) << 1 | (x >= xm)) {\n        q = quads[quads.length - 1];\n        quads[quads.length - 1] = quads[quads.length - 1 - i];\n        quads[quads.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          d2 = dx * dx + dy * dy;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d;\n        x3 = x + d, y3 = y + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n","export default function(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1,\n      x,\n      y,\n      xm,\n      ym,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (!(parent = node, node = node[i = bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3])\n      && node === (parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nexport function removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n","export default function() {\n  return this._root;\n}\n","export default function() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], q, node = this._root, child, x0, y0, x1, y1;\n  if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n    }\n  }\n  return this;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], next = [], q;\n  if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.x1, q.y1);\n  }\n  return this;\n}\n","export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\n\nexport default function quadtree(nodes, x, y) {\n  var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Quadtree(x, y, x0, y0, x1, y1) {\n  this._x = x;\n  this._y = y;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = quadtree.prototype = Quadtree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(4)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 4; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\n","export default function(x) {\n  return function() {\n    return x;\n  };\n}\n","export default function(random) {\n  return (random() - 0.5) * 1e-6;\n}\n","import constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction index(d) {\n  return d.index;\n}\n\nfunction find(nodeById, nodeId) {\n  var node = nodeById.get(nodeId);\n  if (!node) throw new Error(\"node not found: \" + nodeId);\n  return node;\n}\n\nexport default function(links) {\n  var id = index,\n      strength = defaultStrength,\n      strengths,\n      distance = constant(30),\n      distances,\n      nodes,\n      count,\n      bias,\n      random,\n      iterations = 1;\n\n  if (links == null) links = [];\n\n  function defaultStrength(link) {\n    return 1 / Math.min(count[link.source.index], count[link.target.index]);\n  }\n\n  function force(alpha) {\n    for (var k = 0, n = links.length; k < iterations; ++k) {\n      for (var i = 0, link, source, target, x, y, l, b; i < n; ++i) {\n        link = links[i], source = link.source, target = link.target;\n        x = target.x + target.vx - source.x - source.vx || jiggle(random);\n        y = target.y + target.vy - source.y - source.vy || jiggle(random);\n        l = Math.sqrt(x * x + y * y);\n        l = (l - distances[i]) / l * alpha * strengths[i];\n        x *= l, y *= l;\n        target.vx -= x * (b = bias[i]);\n        target.vy -= y * b;\n        source.vx += x * (b = 1 - b);\n        source.vy += y * b;\n      }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n\n    var i,\n        n = nodes.length,\n        m = links.length,\n        nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d])),\n        link;\n\n    for (i = 0, count = new Array(n); i < m; ++i) {\n      link = links[i], link.index = i;\n      if (typeof link.source !== \"object\") link.source = find(nodeById, link.source);\n      if (typeof link.target !== \"object\") link.target = find(nodeById, link.target);\n      count[link.source.index] = (count[link.source.index] || 0) + 1;\n      count[link.target.index] = (count[link.target.index] || 0) + 1;\n    }\n\n    for (i = 0, bias = new Array(m); i < m; ++i) {\n      link = links[i], bias[i] = count[link.source.index] / (count[link.source.index] + count[link.target.index]);\n    }\n\n    strengths = new Array(m), initializeStrength();\n    distances = new Array(m), initializeDistance();\n  }\n\n  function initializeStrength() {\n    if (!nodes) return;\n\n    for (var i = 0, n = links.length; i < n; ++i) {\n      strengths[i] = +strength(links[i], i, links);\n    }\n  }\n\n  function initializeDistance() {\n    if (!nodes) return;\n\n    for (var i = 0, n = links.length; i < n; ++i) {\n      distances[i] = +distance(links[i], i, links);\n    }\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.links = function(_) {\n    return arguments.length ? (links = _, initialize(), force) : links;\n  };\n\n  force.id = function(_) {\n    return arguments.length ? (id = _, force) : id;\n  };\n\n  force.iterations = function(_) {\n    return arguments.length ? (iterations = +_, force) : iterations;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initializeStrength(), force) : strength;\n  };\n\n  force.distance = function(_) {\n    return arguments.length ? (distance = typeof _ === \"function\" ? _ : constant(+_), initializeDistance(), force) : distance;\n  };\n\n  return force;\n}\n","// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport default function() {\n  let s = 1;\n  return () => (s = (a * s + c) % m) / m;\n}\n","import {dispatch} from \"d3-dispatch\";\nimport {timer} from \"d3-timer\";\nimport lcg from \"./lcg.js\";\n\nexport function x(d) {\n  return d.x;\n}\n\nexport function y(d) {\n  return d.y;\n}\n\nvar initialRadius = 10,\n    initialAngle = Math.PI * (3 - Math.sqrt(5));\n\nexport default function(nodes) {\n  var simulation,\n      alpha = 1,\n      alphaMin = 0.001,\n      alphaDecay = 1 - Math.pow(alphaMin, 1 / 300),\n      alphaTarget = 0,\n      velocityDecay = 0.6,\n      forces = new Map(),\n      stepper = timer(step),\n      event = dispatch(\"tick\", \"end\"),\n      random = lcg();\n\n  if (nodes == null) nodes = [];\n\n  function step() {\n    tick();\n    event.call(\"tick\", simulation);\n    if (alpha < alphaMin) {\n      stepper.stop();\n      event.call(\"end\", simulation);\n    }\n  }\n\n  function tick(iterations) {\n    var i, n = nodes.length, node;\n\n    if (iterations === undefined) iterations = 1;\n\n    for (var k = 0; k < iterations; ++k) {\n      alpha += (alphaTarget - alpha) * alphaDecay;\n\n      forces.forEach(function(force) {\n        force(alpha);\n      });\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        if (node.fx == null) node.x += node.vx *= velocityDecay;\n        else node.x = node.fx, node.vx = 0;\n        if (node.fy == null) node.y += node.vy *= velocityDecay;\n        else node.y = node.fy, node.vy = 0;\n      }\n    }\n\n    return simulation;\n  }\n\n  function initializeNodes() {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.index = i;\n      if (node.fx != null) node.x = node.fx;\n      if (node.fy != null) node.y = node.fy;\n      if (isNaN(node.x) || isNaN(node.y)) {\n        var radius = initialRadius * Math.sqrt(0.5 + i), angle = i * initialAngle;\n        node.x = radius * Math.cos(angle);\n        node.y = radius * Math.sin(angle);\n      }\n      if (isNaN(node.vx) || isNaN(node.vy)) {\n        node.vx = node.vy = 0;\n      }\n    }\n  }\n\n  function initializeForce(force) {\n    if (force.initialize) force.initialize(nodes, random);\n    return force;\n  }\n\n  initializeNodes();\n\n  return simulation = {\n    tick: tick,\n\n    restart: function() {\n      return stepper.restart(step), simulation;\n    },\n\n    stop: function() {\n      return stepper.stop(), simulation;\n    },\n\n    nodes: function(_) {\n      return arguments.length ? (nodes = _, initializeNodes(), forces.forEach(initializeForce), simulation) : nodes;\n    },\n\n    alpha: function(_) {\n      return arguments.length ? (alpha = +_, simulation) : alpha;\n    },\n\n    alphaMin: function(_) {\n      return arguments.length ? (alphaMin = +_, simulation) : alphaMin;\n    },\n\n    alphaDecay: function(_) {\n      return arguments.length ? (alphaDecay = +_, simulation) : +alphaDecay;\n    },\n\n    alphaTarget: function(_) {\n      return arguments.length ? (alphaTarget = +_, simulation) : alphaTarget;\n    },\n\n    velocityDecay: function(_) {\n      return arguments.length ? (velocityDecay = 1 - _, simulation) : 1 - velocityDecay;\n    },\n\n    randomSource: function(_) {\n      return arguments.length ? (random = _, forces.forEach(initializeForce), simulation) : random;\n    },\n\n    force: function(name, _) {\n      return arguments.length > 1 ? ((_ == null ? forces.delete(name) : forces.set(name, initializeForce(_))), simulation) : forces.get(name);\n    },\n\n    find: function(x, y, radius) {\n      var i = 0,\n          n = nodes.length,\n          dx,\n          dy,\n          d2,\n          node,\n          closest;\n\n      if (radius == null) radius = Infinity;\n      else radius *= radius;\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        dx = x - node.x;\n        dy = y - node.y;\n        d2 = dx * dx + dy * dy;\n        if (d2 < radius) closest = node, radius = d2;\n      }\n\n      return closest;\n    },\n\n    on: function(name, _) {\n      return arguments.length > 1 ? (event.on(name, _), simulation) : event.on(name);\n    }\n  };\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\nimport {x, y} from \"./simulation.js\";\n\nexport default function() {\n  var nodes,\n      node,\n      random,\n      alpha,\n      strength = constant(-30),\n      strengths,\n      distanceMin2 = 1,\n      distanceMax2 = Infinity,\n      theta2 = 0.81;\n\n  function force(_) {\n    var i, n = nodes.length, tree = quadtree(nodes, x, y).visitAfter(accumulate);\n    for (alpha = _, i = 0; i < n; ++i) node = nodes[i], tree.visit(apply);\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    strengths = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], strengths[node.index] = +strength(node, i, nodes);\n  }\n\n  function accumulate(quad) {\n    var strength = 0, q, c, weight = 0, x, y, i;\n\n    // For internal nodes, accumulate forces from child quadrants.\n    if (quad.length) {\n      for (x = y = i = 0; i < 4; ++i) {\n        if ((q = quad[i]) && (c = Math.abs(q.value))) {\n          strength += q.value, weight += c, x += c * q.x, y += c * q.y;\n        }\n      }\n      quad.x = x / weight;\n      quad.y = y / weight;\n    }\n\n    // For leaf nodes, accumulate forces from coincident quadrants.\n    else {\n      q = quad;\n      q.x = q.data.x;\n      q.y = q.data.y;\n      do strength += strengths[q.data.index];\n      while (q = q.next);\n    }\n\n    quad.value = strength;\n  }\n\n  function apply(quad, x1, _, x2) {\n    if (!quad.value) return true;\n\n    var x = quad.x - node.x,\n        y = quad.y - node.y,\n        w = x2 - x1,\n        l = x * x + y * y;\n\n    // Apply the Barnes-Hut approximation if possible.\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (w * w / theta2 < l) {\n      if (l < distanceMax2) {\n        if (x === 0) x = jiggle(random), l += x * x;\n        if (y === 0) y = jiggle(random), l += y * y;\n        if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n        node.vx += x * quad.value * alpha / l;\n        node.vy += y * quad.value * alpha / l;\n      }\n      return true;\n    }\n\n    // Otherwise, process points directly.\n    else if (quad.length || l >= distanceMax2) return;\n\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (quad.data !== node || quad.next) {\n      if (x === 0) x = jiggle(random), l += x * x;\n      if (y === 0) y = jiggle(random), l += y * y;\n      if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n    }\n\n    do if (quad.data !== node) {\n      w = strengths[quad.data.index] * alpha / l;\n      node.vx += x * w;\n      node.vy += y * w;\n    } while (quad = quad.next);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.distanceMin = function(_) {\n    return arguments.length ? (distanceMin2 = _ * _, force) : Math.sqrt(distanceMin2);\n  };\n\n  force.distanceMax = function(_) {\n    return arguments.length ? (distanceMax2 = _ * _, force) : Math.sqrt(distanceMax2);\n  };\n\n  force.theta = function(_) {\n    return arguments.length ? (theta2 = _ * _, force) : Math.sqrt(theta2);\n  };\n\n  return force;\n}\n","// ── External Dependencies & Registrations\nimport { select } from 'd3-selection';\nimport { type D3DragEvent, drag } from 'd3-drag';\nimport { type D3ZoomEvent, zoom } from 'd3-zoom';\nimport { forceCenter, forceLink, forceManyBody, forceSimulation, type Simulation, type SimulationLinkDatum, type SimulationNodeDatum } from 'd3-force';\n\n// ── Types ────────────────────────────────────────────────────────────────────────────────────────────────────────────\n\nexport interface NetworkDiagramNode {\n    id: string;\n}\n\nexport interface NetworkDiagramLink {\n    source: string;\n    target: string;\n}\n\nexport interface NetworkDiagramData {\n    links: NetworkDiagramLink[];\n    nodes: NetworkDiagramNode[];\n}\n\nexport interface NetworkDiagramOptions {\n    chargeStrength?: number;\n    linkDistance?: number;\n}\n\nexport interface NetworkDiagramHandle {\n    destroy: () => void;\n    resize: () => void;\n    svg: SVGSVGElement;\n    triggerAutoLayout: () => void;\n}\n\ntype LaidOutNode = NetworkDiagramNode & SimulationNodeDatum;\ntype LaidOutLink = SimulationLinkDatum<LaidOutNode>;\n\n// ── Constants ────────────────────────────────────────────────────────────────────────────────────────────────────────\n\nconst DEFAULT_CHARGE_STRENGTH = -300;\nconst DEFAULT_LINK_DISTANCE = 100;\nconst DEFAULT_WIDTH = 640;\nconst DEFAULT_HEIGHT = 480;\nconst AUTO_LAYOUT_TICKS = 180;\nconst NODE_RADIUS = 20;\nconst NODE_RADIUS_ACTIVE = 22;\n\nconst COLOR = {\n    linkStroke: '#9ca3af',\n    nodeFill: '#2563eb',\n    nodeFillHovered: '#3b82f6',\n    nodeFillSelected: '#f59e0b',\n    nodeStroke: '#1e40af',\n    nodeStrokeHovered: '#1d4ed8',\n    nodeStrokeSelected: '#b45309',\n    nodeText: '#ffffff'\n};\n\n// ── Actions ──────────────────────────────────────────────────────────────────────────────────────────────────────────\n\nexport function renderNetworkDiagram(data: NetworkDiagramData, renderTo: HTMLElement, options: NetworkDiagramOptions = {}): NetworkDiagramHandle {\n    const width = renderTo.clientWidth || DEFAULT_WIDTH;\n    const height = renderTo.clientHeight || DEFAULT_HEIGHT;\n\n    const nodes: LaidOutNode[] = data.nodes.map((node) => ({ ...node }));\n    const links: LaidOutLink[] = data.links.map((link) => ({ ...link }));\n\n    // Set deterministic initial positions so the graph is readable before force layout runs.\n    const startRadius = Math.min(width, height) * 0.22;\n    for (const [index, node] of nodes.entries()) {\n        const angle = (index / nodes.length) * Math.PI * 2;\n        node.x = width / 2 + Math.cos(angle) * startRadius;\n        node.y = height / 2 + Math.sin(angle) * startRadius;\n    }\n\n    const simulation: Simulation<LaidOutNode, LaidOutLink> = forceSimulation(nodes)\n        .force(\n            'link',\n            forceLink<LaidOutNode, LaidOutLink>(links)\n                .id((node) => node.id)\n                .distance(options.linkDistance ?? DEFAULT_LINK_DISTANCE)\n        )\n        .force('charge', forceManyBody().strength(options.chargeStrength ?? DEFAULT_CHARGE_STRENGTH))\n        .force('center', forceCenter(width / 2, height / 2));\n\n    const svgSelection = select(renderTo)\n        .append('svg')\n        .attr('width', width)\n        .attr('height', height)\n        .attr('viewBox', `0 0 ${String(width)} ${String(height)}`)\n        .style('touch-action', 'none');\n    const viewport = svgSelection.append('g');\n\n    const link = viewport.selectAll<SVGLineElement, LaidOutLink>('line').data(links).join('line').attr('stroke', COLOR.linkStroke).attr('stroke-width', 2);\n\n    const node = viewport.selectAll<SVGGElement, LaidOutNode>('g').data(nodes).join('g').style('cursor', 'pointer');\n    node.append('circle').attr('r', NODE_RADIUS).attr('fill', COLOR.nodeFill).attr('stroke', COLOR.nodeStroke).attr('stroke-width', 2);\n    node.append('text')\n        .text((laidOutNode) => laidOutNode.id)\n        .attr('text-anchor', 'middle')\n        .attr('dy', 4)\n        .attr('fill', COLOR.nodeText); // explicit - iOS Safari can default to transparent\n\n    let selectedNodeId: string | null = null;\n    let hoveredNodeId: string | null = null;\n\n    const updateNodeStyles = (): void => {\n        node.selectAll<SVGCircleElement, LaidOutNode>('circle')\n            .attr('fill', (laidOutNode) => {\n                if (laidOutNode.id === selectedNodeId) return COLOR.nodeFillSelected;\n                if (laidOutNode.id === hoveredNodeId) return COLOR.nodeFillHovered;\n                return COLOR.nodeFill;\n            })\n            .attr('stroke', (laidOutNode) => {\n                if (laidOutNode.id === selectedNodeId) return COLOR.nodeStrokeSelected;\n                if (laidOutNode.id === hoveredNodeId) return COLOR.nodeStrokeHovered;\n                return COLOR.nodeStroke;\n            })\n            .attr('stroke-width', (laidOutNode) => (laidOutNode.id === selectedNodeId ? 3 : 2))\n            .attr('r', (laidOutNode) => (laidOutNode.id === selectedNodeId || laidOutNode.id === hoveredNodeId ? NODE_RADIUS_ACTIVE : NODE_RADIUS));\n    };\n\n    node.on('mouseenter', (_event, laidOutNode) => {\n        hoveredNodeId = laidOutNode.id;\n        updateNodeStyles();\n    })\n        .on('mouseleave', (_event, laidOutNode) => {\n            if (hoveredNodeId === laidOutNode.id) hoveredNodeId = null;\n            updateNodeStyles();\n        })\n        .on('click', (event: MouseEvent, laidOutNode) => {\n            event.stopPropagation();\n            selectedNodeId = selectedNodeId === laidOutNode.id ? null : laidOutNode.id;\n            updateNodeStyles();\n        });\n\n    svgSelection.on('click', () => {\n        selectedNodeId = null;\n        updateNodeStyles();\n    });\n\n    const zoomBehavior = zoom<SVGSVGElement, unknown>()\n        .scaleExtent([0.5, 4])\n        .on('zoom', (event: D3ZoomEvent<SVGSVGElement, unknown>) => {\n            viewport.attr('transform', event.transform.toString());\n        });\n\n    svgSelection.call(zoomBehavior).on('dblclick.zoom', null);\n\n    const getNodePosition = (value: LaidOutNode | string | number, axis: 'x' | 'y'): number => {\n        if (typeof value === 'object') return value[axis] ?? 0;\n        return 0;\n    };\n\n    const renderGraph = (): void => {\n        link.attr('x1', (laidOutLink) => getNodePosition(laidOutLink.source, 'x'))\n            .attr('y1', (laidOutLink) => getNodePosition(laidOutLink.source, 'y'))\n            .attr('x2', (laidOutLink) => getNodePosition(laidOutLink.target, 'x'))\n            .attr('y2', (laidOutLink) => getNodePosition(laidOutLink.target, 'y'));\n        node.attr('transform', (laidOutNode) => `translate(${String(laidOutNode.x ?? 0)},${String(laidOutNode.y ?? 0)})`);\n    };\n\n    // Keep force simulation idle by default; run it only on explicit request.\n    simulation.stop();\n\n    type DragEvent = D3DragEvent<SVGGElement, LaidOutNode, LaidOutNode>;\n\n    node.call(\n        drag<SVGGElement, LaidOutNode>()\n            .on('start', (event: DragEvent, laidOutNode) => {\n                (event.sourceEvent as MouseEvent | TouchEvent | undefined)?.stopPropagation();\n                laidOutNode.fx = laidOutNode.x;\n                laidOutNode.fy = laidOutNode.y;\n            })\n            .on('drag', (event: DragEvent, laidOutNode) => {\n                laidOutNode.x = event.x;\n                laidOutNode.y = event.y;\n                laidOutNode.fx = event.x;\n                laidOutNode.fy = event.y;\n                renderGraph();\n            })\n            .on('end', (_event: DragEvent, laidOutNode) => {\n                laidOutNode.fx = null;\n                laidOutNode.fy = null;\n            })\n    );\n\n    renderGraph();\n\n    const svgNode = svgSelection.node();\n    if (svgNode == null) throw new Error('Failed to create network diagram SVG element.');\n\n    return {\n        destroy: () => {\n            simulation.stop();\n            svgSelection.remove();\n        },\n        resize: () => {\n            const newWidth = renderTo.clientWidth || DEFAULT_WIDTH;\n            const newHeight = renderTo.clientHeight || DEFAULT_HEIGHT;\n            svgSelection.attr('width', newWidth).attr('height', newHeight).attr('viewBox', `0 0 ${String(newWidth)} ${String(newHeight)}`);\n            simulation.force('center', forceCenter(newWidth / 2, newHeight / 2));\n        },\n        svg: svgNode,\n        triggerAutoLayout: () => {\n            simulation.alpha(1);\n            for (let step = 0; step < AUTO_LAYOUT_TICKS; step += 1) simulation.tick();\n            simulation.stop();\n            renderGraph();\n        }\n    };\n}\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],"mappings":";;;;;AAAA,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,GAAO,IAAW;CAGtB,AADA,AAAe,MAAI,GACnB,AAAe,MAAI;CAEnB,SAAS,IAAQ;EACf,IAAI,GACA,IAAI,EAAM,QACV,GACA,IAAK,GACL,IAAK;EAET,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GACnB,IAAO,EAAM,IAAI,KAAM,EAAK,GAAG,KAAM,EAAK;EAG5C,KAAK,KAAM,IAAK,IAAI,KAAK,GAAU,KAAM,IAAK,IAAI,KAAK,GAAU,IAAI,GAAG,IAAI,GAAG,EAAE,GAC/E,IAAO,EAAM,IAAI,EAAK,KAAK,GAAI,EAAK,KAAK;CAE7C;CAkBA,OAhBA,EAAM,aAAa,SAAS,GAAG;EAC7B,IAAQ;CACV,GAEA,EAAM,IAAI,SAAS,GAAG;EACpB,OAAO,UAAU,UAAU,IAAI,CAAC,GAAG,KAAS;CAC9C,GAEA,EAAM,IAAI,SAAS,GAAG;EACpB,OAAO,UAAU,UAAU,IAAI,CAAC,GAAG,KAAS;CAC9C,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,CAAC,GAAG,KAAS;CACrD,GAEO;AACT;;;ACvCA,SAAA,EAAwB,GAAG;CACzB,IAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,GAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC;CAC7B,OAAO,EAAI,KAAK,MAAM,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;AACtC;AAEA,SAAS,EAAI,GAAM,GAAG,GAAG,GAAG;CAC1B,IAAI,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG,OAAO;CAEjC,IAAI,GACA,IAAO,EAAK,OACZ,IAAO,EAAC,MAAM,EAAC,GACf,IAAK,EAAK,KACV,IAAK,EAAK,KACV,IAAK,EAAK,KACV,IAAK,EAAK,KACV,GACA,GACA,GACA,GACA,GACA,GACA,GACA;CAGJ,IAAI,CAAC,GAAM,OAAO,EAAK,QAAQ,GAAM;CAGrC,OAAO,EAAK,SAGV,KAFI,IAAQ,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,IACtD,IAAS,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,GACvD,IAAS,GAAM,EAAE,IAAO,EAAK,IAAI,KAAU,IAAI,KAAS,OAAO,EAAO,KAAK,GAAM;CAMvF,IAFA,IAAK,CAAC,EAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GAClC,IAAK,CAAC,EAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GAC9B,MAAM,KAAM,MAAM,GAAI,OAAO,EAAK,OAAO,GAAM,IAAS,EAAO,KAAK,IAAO,EAAK,QAAQ,GAAM;CAGlG;EAGE,AAFA,IAAS,IAAS,EAAO,KAAK;;;;;EAAW,IAAI,EAAK,QAAQ;;;;;EAAW,IACjE,IAAQ,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,IACtD,IAAS,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK;SACnD,IAAI,KAAU,IAAI,OAAY,KAAK,KAAM,MAAO,IAAK,KAAM;CACrE,OAAO,EAAO,KAAK,GAAM,EAAO,KAAK,GAAM;AAC7C;AAEA,SAAgB,EAAO,GAAM;CAC3B,IAAI,GAAG,GAAG,IAAI,EAAK,QACf,GACA,GACA,IAAS,MAAM,CAAC,GAChB,IAAS,MAAM,CAAC,GAChB,IAAK,UACL,IAAK,UACL,IAAK,WACL,IAAK;CAGT,KAAK,IAAI,GAAG,IAAI,GAAG,EAAE,GACf,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,IAAI,EAAK,EAAE,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,MACnF,EAAG,KAAK,GACR,EAAG,KAAK,GACJ,IAAI,MAAI,IAAK,IACb,IAAI,MAAI,IAAK,IACb,IAAI,MAAI,IAAK,IACb,IAAI,MAAI,IAAK;CAInB,IAAI,IAAK,KAAM,IAAK,GAAI,OAAO;CAM/B,KAHA,KAAK,MAAM,GAAI,CAAE,CAAC,CAAC,MAAM,GAAI,CAAE,GAG1B,IAAI,GAAG,IAAI,GAAG,EAAE,GACnB,EAAI,MAAM,EAAG,IAAI,EAAG,IAAI,EAAK,EAAE;CAGjC,OAAO;AACT;;;ACnFA,SAAA,EAAwB,GAAG,GAAG;CAC5B,IAAI,MAAM,IAAI,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,GAAG,OAAO;CAE3C,IAAI,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK;CAKd,IAAI,MAAM,CAAE,GAEV,AADA,KAAM,IAAK,KAAK,MAAM,CAAC,KAAK,GAC5B,KAAM,IAAK,KAAK,MAAM,CAAC,KAAK;MAIzB;EAMH,KALA,IAAI,IAAI,IAAK,KAAM,GACf,IAAO,KAAK,OACZ,GACA,GAEG,IAAK,KAAK,KAAK,KAAM,IAAK,KAAK,KAAK,IAGzC,QAFA,KAAK,IAAI,MAAO,IAAK,IAAI,GACzB,IAAS;;;;;EAAW,GAAG,EAAO,KAAK,GAAM,IAAO,GAAQ,KAAK,GACrD,GAAR;GACE,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;GAClC,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;GAClC,KAAK;IAAG,IAAK,IAAK,GAAG,IAAK,IAAK;IAAG;GAClC,KAAK,GAAG,IAAK,IAAK,GAAG,IAAK,IAAK;EACjC;EAGF,AAAI,KAAK,SAAS,KAAK,MAAM,WAAQ,KAAK,QAAQ;CACpD;CAMA,OAJA,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACJ;AACT;;;AC1CA,SAAA,IAA0B;CACxB,IAAI,IAAO,CAAC;CAIZ,OAHA,KAAK,MAAM,SAAS,GAAM;EACxB,IAAI,CAAC,EAAK,QAAQ;GAAG,EAAK,KAAK,EAAK,IAAI;SAAU,IAAO,EAAK;CAChE,CAAC,GACM;AACT;;;ACNA,SAAA,EAAwB,GAAG;CACzB,OAAO,UAAU,SACX,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,IACvD,MAAM,KAAK,GAAG,IAAI,KAAA,IAAY,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AACjF;;;ACJA,SAAA,EAAwB,GAAM,GAAI,GAAI,GAAI,GAAI;CAK5C,AAJA,KAAK,OAAO,GACZ,KAAK,KAAK,GACV,KAAK,KAAK,GACV,KAAK,KAAK,GACV,KAAK,KAAK;AACZ;;;ACJA,SAAA,EAAwB,GAAG,GAAG,GAAQ;CACpC,IAAI,GACA,IAAK,KAAK,KACV,IAAK,KAAK,KACV,GACA,GACA,GACA,GACA,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAQ,CAAC,GACT,IAAO,KAAK,OACZ,GACA;CAUJ,KARI,KAAM,EAAM,KAAK,IAAIA,EAAK,GAAM,GAAI,GAAI,GAAI,CAAE,CAAC,GAC/C,KAAU,OAAM,IAAS,YAE3B,IAAK,IAAI,GAAQ,IAAK,IAAI,GAC1B,IAAK,IAAI,GAAQ,IAAK,IAAI,GAC1B,KAAU,IAGL,IAAI,EAAM,IAAI,IAGf,QAAE,IAAO,EAAE,UACP,IAAK,EAAE,MAAM,MACb,IAAK,EAAE,MAAM,MACb,IAAK,EAAE,MAAM,MACb,IAAK,EAAE,MAAM,IAGrB;MAAI,EAAK,QAAQ;GACf,IAAI,KAAM,IAAK,KAAM,GACjB,KAAM,IAAK,KAAM;GAUrB,AARA,EAAM,KACJ,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,GAChC,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,GAChC,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,GAChC,IAAIA,EAAK,EAAK,IAAI,GAAI,GAAI,GAAI,CAAE,CAClC,IAGI,KAAK,KAAK,MAAO,IAAK,KAAK,OAC7B,IAAI,EAAM,EAAM,SAAS,IACzB,EAAM,EAAM,SAAS,KAAK,EAAM,EAAM,SAAS,IAAI,IACnD,EAAM,EAAM,SAAS,IAAI,KAAK;EAElC,OAGK;GACH,IAAI,IAAK,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GACtC,IAAK,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,EAAK,IAAI,GACtC,IAAK,IAAK,IAAK,IAAK;GACxB,IAAI,IAAK,GAAQ;IACf,IAAI,IAAI,KAAK,KAAK,IAAS,CAAE;IAG7B,AAFA,IAAK,IAAI,GAAG,IAAK,IAAI,GACrB,IAAK,IAAI,GAAG,IAAK,IAAI,GACrB,IAAO,EAAK;GACd;EACF;;CAGF,OAAO;AACT;;;ACrEA,SAAA,EAAwB,GAAG;CACzB,IAAI,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,GAAG,OAAO;CAEnF,IAAI,GACA,IAAO,KAAK,OACZ,GACA,GACA,GACA,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK,KACV,IAAK,KAAK,KACV,GACA,GACA,GACA,GACA,GACA,GACA,GACA;CAGJ,IAAI,CAAC,GAAM,OAAO;CAIlB,IAAI,EAAK,QAAQ,SAAa;EAG5B,KAFI,IAAQ,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,IACtD,IAAS,MAAM,KAAM,IAAK,KAAM,MAAI,IAAK,IAAS,IAAK,GACrD,IAAS,GAAM,MAAO,EAAK,IAAI,KAAU,IAAI,KAAS,OAAO;EACnE,IAAI,CAAC,EAAK,QAAQ;EAClB,CAAI,EAAQ,IAAI,IAAK,MAAM,EAAQ,IAAI,IAAK,MAAM,EAAQ,IAAI,IAAK,QAAI,IAAW,GAAQ,IAAI;CAChG;CAGA,OAAO,EAAK,SAAS,IAAG,IAAM,IAAW,GAAM,MAAO,EAAK,OAAO,OAAO;CAoBzE,QAnBI,IAAO,EAAK,SAAM,OAAO,EAAK,MAG9B,KAAkB,IAAO,EAAS,OAAO,IAAO,OAAO,EAAS,MAAO,QAGtE,KAGL,IAAO,EAAO,KAAK,IAAO,OAAO,EAAO,KAGnC,IAAO,EAAO,MAAM,EAAO,MAAM,EAAO,MAAM,EAAO,OACnD,OAAU,EAAO,MAAM,EAAO,MAAM,EAAO,MAAM,EAAO,OACxD,CAAC,EAAK,WACP,IAAU,EAAS,KAAK,IACvB,KAAK,QAAQ,IAGb,SAba,KAAK,QAAQ,GAAM;AAczC;AAEA,SAAgB,EAAU,GAAM;CAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,IAAI,GAAG,EAAE,GAAG,KAAK,OAAO,EAAK,EAAE;CAChE,OAAO;AACT;;;AC7DA,SAAA,IAA0B;CACxB,OAAO,KAAK;AACd;;;ACFA,SAAA,IAA0B;CACxB,IAAI,IAAO;CAIX,OAHA,KAAK,MAAM,SAAS,GAAM;EACxB,IAAI,CAAC,EAAK,QAAQ;GAAG,EAAE;SAAa,IAAO,EAAK;CAClD,CAAC,GACM;AACT;;;ACJA,SAAA,EAAwB,GAAU;CAChC,IAAI,IAAQ,CAAC,GAAG,GAAG,IAAO,KAAK,OAAO,GAAO,GAAI,GAAI,GAAI;CAEzD,KADI,KAAM,EAAM,KAAK,IAAIC,EAAK,GAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GACpE,IAAI,EAAM,IAAI,IACnB,IAAI,CAAC,EAAS,IAAO,EAAE,MAAM,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,EAAE,KAAK,EAAK,QAAQ;EACvF,IAAI,KAAM,IAAK,KAAM,GAAG,KAAM,IAAK,KAAM;EAIzC,CAHI,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC;CACjE;CAEF,OAAO;AACT;;;ACbA,SAAA,EAAwB,GAAU;CAChC,IAAI,IAAQ,CAAC,GAAG,IAAO,CAAC,GAAG;CAE3B,KADI,KAAK,SAAO,EAAM,KAAK,IAAIC,EAAK,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GAChF,IAAI,EAAM,IAAI,IAAG;EACtB,IAAI,IAAO,EAAE;EACb,IAAI,EAAK,QAAQ;GACf,IAAI,GAAO,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,IAAK,EAAE,IAAI,KAAM,IAAK,KAAM,GAAG,KAAM,IAAK,KAAM;GAI5F,CAHI,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC,IAC3D,IAAQ,EAAK,OAAI,EAAM,KAAK,IAAIA,EAAK,GAAO,GAAI,GAAI,GAAI,CAAE,CAAC;EACjE;EACA,EAAK,KAAK,CAAC;CACb;CACA,OAAO,IAAI,EAAK,IAAI,IAClB,EAAS,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;CAEzC,OAAO;AACT;;;ACpBA,SAAgB,EAAS,GAAG;CAC1B,OAAO,EAAE;AACX;AAEA,SAAA,EAAwB,GAAG;CACzB,OAAO,UAAU,UAAU,KAAK,KAAK,GAAG,QAAQ,KAAK;AACvD;;;ACNA,SAAgB,EAAS,GAAG;CAC1B,OAAO,EAAE;AACX;AAEA,SAAA,EAAwB,GAAG;CACzB,OAAO,UAAU,UAAU,KAAK,KAAK,GAAG,QAAQ,KAAK;AACvD;;;ACOA,SAAwB,EAAS,GAAO,GAAG,GAAG;CAC5C,IAAI,IAAO,IAAI,EAAS,KAAY,GAAc,KAAY,GAAc,KAAK,KAAK,KAAK,GAAG;CAC9F,OAAO,KAAS,OAAO,IAAO,EAAK,OAAO,CAAK;AACjD;AAEA,SAAS,EAAS,GAAG,GAAG,GAAI,GAAI,GAAI,GAAI;CAOtC,AANA,KAAK,KAAK,GACV,KAAK,KAAK,GACV,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,MAAM,GACX,KAAK,QAAQ,KAAA;AACf;AAEA,SAAS,EAAU,GAAM;CAEvB,KADA,IAAI,IAAO,EAAC,MAAM,EAAK,KAAI,GAAG,IAAO,GAC9B,IAAO,EAAK,OAAM,IAAO,EAAK,OAAO,EAAC,MAAM,EAAK,KAAI;CAC5D,OAAO;AACT;AAEA,IAAI,IAAY,EAAS,YAAY,EAAS;AAE9C,EAAU,OAAO,WAAW;CAC1B,IAAI,IAAO,IAAI,EAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GAC5E,IAAO,KAAK,OACZ,GACA;CAEJ,IAAI,CAAC,GAAM,OAAO;CAElB,IAAI,CAAC,EAAK,QAAQ,OAAO,EAAK,QAAQ,EAAU,CAAI,GAAG;CAGvD,KADA,IAAQ,CAAC;EAAC,QAAQ;EAAM,QAAQ,EAAK,QAAQ;;;;;EAAW;CAAC,CAAC,GACnD,IAAO,EAAM,IAAI,IACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GACvB,CAAI,IAAQ,EAAK,OAAO,QAClB,EAAM,SAAQ,EAAM,KAAK;EAAC,QAAQ;EAAO,QAAQ,EAAK,OAAO,KAAK;;;;;EAAW;CAAC,CAAC,IAC9E,EAAK,OAAO,KAAK,EAAU,CAAK;CAK3C,OAAO;AACT,GAEA,EAAU,MAAMC,GAChB,EAAU,SAASC,GACnB,EAAU,QAAQC,GAClB,EAAU,OAAOC,GACjB,EAAU,SAASC,GACnB,EAAU,OAAOC,GACjB,EAAU,SAASC,GACnB,EAAU,YAAYC,GACtB,EAAU,OAAOC,GACjB,EAAU,OAAOC,GACjB,EAAU,QAAQC,GAClB,EAAU,aAAaC,GACvB,EAAU,IAAIC,GACd,EAAU,IAAIC;;;ACxEd,SAAA,EAAwB,GAAG;CACzB,OAAO,WAAW;EAChB,OAAO;CACT;AACF;;;ACJA,SAAA,EAAwB,GAAQ;CAC9B,QAAQ,EAAO,IAAI,MAAO;AAC5B;;;ACCA,SAAS,EAAM,GAAG;CAChB,OAAO,EAAE;AACX;AAEA,SAAS,EAAK,GAAU,GAAQ;CAC9B,IAAI,IAAO,EAAS,IAAI,CAAM;CAC9B,IAAI,CAAC,GAAM,MAAU,MAAM,qBAAqB,CAAM;CACtD,OAAO;AACT;AAEA,SAAA,EAAwB,GAAO;CAC7B,IAAI,IAAK,GACL,IAAW,GACX,GACA,IAAWC,EAAS,EAAE,GACtB,GACA,GACA,GACA,GACA,GACA,IAAa;CAEjB,AAAmB,MAAQ,CAAC;CAE5B,SAAS,EAAgB,GAAM;EAC7B,OAAO,IAAI,KAAK,IAAI,EAAM,EAAK,OAAO,QAAQ,EAAM,EAAK,OAAO,MAAM;CACxE;CAEA,SAAS,EAAM,GAAO;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAY,EAAE,GAClD,KAAK,IAAI,IAAI,GAAG,GAAM,GAAQ,GAAQ,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,EAAE,GAUzD,AATA,IAAO,EAAM,IAAI,IAAS,EAAK,QAAQ,IAAS,EAAK,QACrD,IAAI,EAAO,IAAI,EAAO,KAAK,EAAO,IAAI,EAAO,MAAMC,EAAO,CAAM,GAChE,IAAI,EAAO,IAAI,EAAO,KAAK,EAAO,IAAI,EAAO,MAAMA,EAAO,CAAM,GAChE,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC,GAC3B,KAAK,IAAI,EAAU,MAAM,IAAI,IAAQ,EAAU,IAC/C,KAAK,GAAG,KAAK,GACb,EAAO,MAAM,KAAK,IAAI,EAAK,KAC3B,EAAO,MAAM,IAAI,GACjB,EAAO,MAAM,KAAK,IAAI,IAAI,IAC1B,EAAO,MAAM,IAAI;CAGvB;CAEA,SAAS,IAAa;EACf,OAEL;OAAI,GACA,IAAI,EAAM,QACV,IAAI,EAAM,QACV,IAAW,IAAI,IAAI,EAAM,KAAK,GAAG,MAAM,CAAC,EAAG,GAAG,GAAG,CAAK,GAAG,CAAC,CAAC,CAAC,GAC5D;GAEJ,KAAK,IAAI,GAAG,IAAY,MAAM,CAAC,GAAG,IAAI,GAAG,EAAE,GAKzC,AAJA,IAAO,EAAM,IAAI,EAAK,QAAQ,GAC1B,OAAO,EAAK,UAAW,aAAU,EAAK,SAAS,EAAK,GAAU,EAAK,MAAM,IACzE,OAAO,EAAK,UAAW,aAAU,EAAK,SAAS,EAAK,GAAU,EAAK,MAAM,IAC7E,EAAM,EAAK,OAAO,UAAU,EAAM,EAAK,OAAO,UAAU,KAAK,GAC7D,EAAM,EAAK,OAAO,UAAU,EAAM,EAAK,OAAO,UAAU,KAAK;GAG/D,KAAK,IAAI,GAAG,IAAW,MAAM,CAAC,GAAG,IAAI,GAAG,EAAE,GACxC,IAAO,EAAM,IAAI,EAAK,KAAK,EAAM,EAAK,OAAO,UAAU,EAAM,EAAK,OAAO,SAAS,EAAM,EAAK,OAAO;GAItG,AADA,IAAgB,MAAM,CAAC,GAAG,EAAmB,GAC7C,IAAgB,MAAM,CAAC,GAAG,EAAmB;EAfzC;CAgBN;CAEA,SAAS,IAAqB;EACvB,OAEL,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,EAAE,GACzC,EAAU,KAAK,CAAC,EAAS,EAAM,IAAI,GAAG,CAAK;CAE/C;CAEA,SAAS,IAAqB;EACvB,OAEL,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAI,GAAG,EAAE,GACzC,EAAU,KAAK,CAAC,EAAS,EAAM,IAAI,GAAG,CAAK;CAE/C;CA4BA,OA1BA,EAAM,aAAa,SAAS,GAAQ,GAAS;EAG3C,AAFA,IAAQ,GACR,IAAS,GACT,EAAW;CACb,GAEA,EAAM,QAAQ,SAAS,GAAG;EACxB,OAAO,UAAU,UAAU,IAAQ,GAAG,EAAW,GAAG,KAAS;CAC/D,GAEA,EAAM,KAAK,SAAS,GAAG;EACrB,OAAO,UAAU,UAAU,IAAK,GAAG,KAAS;CAC9C,GAEA,EAAM,aAAa,SAAS,GAAG;EAC7B,OAAO,UAAU,UAAU,IAAa,CAAC,GAAG,KAAS;CACvD,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,OAAO,KAAM,aAAa,IAAID,EAAS,CAAC,CAAC,GAAG,EAAmB,GAAG,KAAS;CACnH,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,OAAO,KAAM,aAAa,IAAIA,EAAS,CAAC,CAAC,GAAG,EAAmB,GAAG,KAAS;CACnH,GAEO;AACT;;;ACnHA,IAAM,IAAI,SACJ,IAAI,YACJ,IAAI;AAEV,SAAA,IAA0B;CACxB,IAAI,IAAI;CACR,cAAc,KAAK,IAAI,IAAI,KAAK,KAAK;AACvC;;;ACJA,SAAgB,EAAE,GAAG;CACnB,OAAO,EAAE;AACX;AAEA,SAAgB,EAAE,GAAG;CACnB,OAAO,EAAE;AACX;AAEA,IAAI,IAAgB,IAChB,IAAe,KAAK,MAAM,IAAI,KAAK,KAAK,CAAC;AAE7C,SAAA,EAAwB,GAAO;CAC7B,IAAI,GACA,IAAQ,GACR,IAAW,MACX,IAAa,IAAa,MAAU,IAAI,MACxC,IAAc,GACd,IAAgB,IAChB,oBAAS,IAAI,IAAI,GACjB,IAAU,EAAM,CAAI,GACpB,IAAQ,EAAS,QAAQ,KAAK,GAC9B,IAASE,EAAI;CAEjB,AAAmB,MAAQ,CAAC;CAE5B,SAAS,IAAO;EAGd,AAFA,EAAK,GACL,EAAM,KAAK,QAAQ,CAAU,GACzB,IAAQ,MACV,EAAQ,KAAK,GACb,EAAM,KAAK,OAAO,CAAU;CAEhC;CAEA,SAAS,EAAK,GAAY;EACxB,IAAI,GAAG,IAAI,EAAM,QAAQ;EAEzB,AAAI,MAAe,KAAA,MAAW,IAAa;EAE3C,KAAK,IAAI,IAAI,GAAG,IAAI,GAAY,EAAE,GAOhC,KANA,MAAU,IAAc,KAAS,GAEjC,EAAO,QAAQ,SAAS,GAAO;GAC7B,EAAM,CAAK;EACb,CAAC,GAEI,IAAI,GAAG,IAAI,GAAG,EAAE,GAInB,AAHA,IAAO,EAAM,IACT,EAAK,MAAM,OAAM,EAAK,KAAK,EAAK,MAAM,KACrC,EAAK,IAAI,EAAK,IAAI,EAAK,KAAK,IAC7B,EAAK,MAAM,OAAM,EAAK,KAAK,EAAK,MAAM,KACrC,EAAK,IAAI,EAAK,IAAI,EAAK,KAAK;EAIrC,OAAO;CACT;CAEA,SAAS,IAAkB;EACzB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,GAAM,IAAI,GAAG,EAAE,GAAG;GAIlD,IAHA,IAAO,EAAM,IAAI,EAAK,QAAQ,GAC1B,EAAK,MAAM,SAAM,EAAK,IAAI,EAAK,KAC/B,EAAK,MAAM,SAAM,EAAK,IAAI,EAAK,KAC/B,MAAM,EAAK,CAAC,KAAK,MAAM,EAAK,CAAC,GAAG;IAClC,IAAI,IAAS,IAAgB,KAAK,KAAK,KAAM,CAAC,GAAG,IAAQ,IAAI;IAE7D,AADA,EAAK,IAAI,IAAS,KAAK,IAAI,CAAK,GAChC,EAAK,IAAI,IAAS,KAAK,IAAI,CAAK;GAClC;GACA,CAAI,MAAM,EAAK,EAAE,KAAK,MAAM,EAAK,EAAE,OACjC,EAAK,KAAK,EAAK,KAAK;EAExB;CACF;CAEA,SAAS,EAAgB,GAAO;EAE9B,OADI,EAAM,cAAY,EAAM,WAAW,GAAO,CAAM,GAC7C;CACT;CAIA,OAFA,EAAgB,GAET,IAAa;EACZ;EAEN,SAAS,WAAW;GAClB,OAAO,EAAQ,QAAQ,CAAI,GAAG;EAChC;EAEA,MAAM,WAAW;GACf,OAAO,EAAQ,KAAK,GAAG;EACzB;EAEA,OAAO,SAAS,GAAG;GACjB,OAAO,UAAU,UAAU,IAAQ,GAAG,EAAgB,GAAG,EAAO,QAAQ,CAAe,GAAG,KAAc;EAC1G;EAEA,OAAO,SAAS,GAAG;GACjB,OAAO,UAAU,UAAU,IAAQ,CAAC,GAAG,KAAc;EACvD;EAEA,UAAU,SAAS,GAAG;GACpB,OAAO,UAAU,UAAU,IAAW,CAAC,GAAG,KAAc;EAC1D;EAEA,YAAY,SAAS,GAAG;GACtB,OAAO,UAAU,UAAU,IAAa,CAAC,GAAG,KAAc,CAAC;EAC7D;EAEA,aAAa,SAAS,GAAG;GACvB,OAAO,UAAU,UAAU,IAAc,CAAC,GAAG,KAAc;EAC7D;EAEA,eAAe,SAAS,GAAG;GACzB,OAAO,UAAU,UAAU,IAAgB,IAAI,GAAG,KAAc,IAAI;EACtE;EAEA,cAAc,SAAS,GAAG;GACxB,OAAO,UAAU,UAAU,IAAS,GAAG,EAAO,QAAQ,CAAe,GAAG,KAAc;EACxF;EAEA,OAAO,SAAS,GAAM,GAAG;GACvB,OAAO,UAAU,SAAS,KAAM,KAAK,OAAO,EAAO,OAAO,CAAI,IAAI,EAAO,IAAI,GAAM,EAAgB,CAAC,CAAC,GAAI,KAAc,EAAO,IAAI,CAAI;EACxI;EAEA,MAAM,SAAS,GAAG,GAAG,GAAQ;GAC3B,IAAI,IAAI,GACJ,IAAI,EAAM,QACV,GACA,GACA,GACA,GACA;GAKJ,KAHI,KAAU,OAAM,IAAS,WACxB,KAAU,GAEV,IAAI,GAAG,IAAI,GAAG,EAAE,GAKnB,AAJA,IAAO,EAAM,IACb,IAAK,IAAI,EAAK,GACd,IAAK,IAAI,EAAK,GACd,IAAK,IAAK,IAAK,IAAK,GAChB,IAAK,MAAQ,IAAU,GAAM,IAAS;GAG5C,OAAO;EACT;EAEA,IAAI,SAAS,GAAM,GAAG;GACpB,OAAO,UAAU,SAAS,KAAK,EAAM,GAAG,GAAM,CAAC,GAAG,KAAc,EAAM,GAAG,CAAI;EAC/E;CACF;AACF;;;ACtJA,SAAA,IAA0B;CACxB,IAAI,GACA,GACA,GACA,GACA,IAAWC,EAAS,GAAG,GACvB,GACA,IAAe,GACf,IAAe,UACf,IAAS;CAEb,SAAS,EAAM,GAAG;EAChB,IAAI,GAAG,IAAI,EAAM,QAAQ,IAAO,EAAS,GAAO,GAAG,CAAC,CAAC,CAAC,WAAW,CAAU;EAC3E,KAAK,IAAQ,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,IAAO,EAAM,IAAI,EAAK,MAAM,CAAK;CACtE;CAEA,SAAS,IAAa;EACf,OACL;OAAI,GAAG,IAAI,EAAM,QAAQ;GAEzB,KADA,IAAgB,MAAM,CAAC,GAClB,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG,IAAO,EAAM,IAAI,EAAU,EAAK,SAAS,CAAC,EAAS,GAAM,GAAG,CAAK;EAFhE;CAG3B;CAEA,SAAS,EAAW,GAAM;EACxB,IAAI,IAAW,GAAG,GAAG,GAAG,IAAS,GAAG,GAAG,GAAG;EAG1C,IAAI,EAAK,QAAQ;GACf,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAC3B,CAAK,IAAI,EAAK,QAAQ,IAAI,KAAK,IAAI,EAAE,KAAK,OACxC,KAAY,EAAE,OAAO,KAAU,GAAG,KAAK,IAAI,EAAE,GAAG,KAAK,IAAI,EAAE;GAI/D,AADA,EAAK,IAAI,IAAI,GACb,EAAK,IAAI,IAAI;EACf,OAGK;GAGH,AAFA,IAAI,GACJ,EAAE,IAAI,EAAE,KAAK,GACb,EAAE,IAAI,EAAE,KAAK;GACb;IAAG,KAAY,EAAU,EAAE,KAAK;UACzB,IAAI,EAAE;EACf;EAEA,EAAK,QAAQ;CACf;CAEA,SAAS,EAAM,GAAM,GAAI,GAAG,GAAI;EAC9B,IAAI,CAAC,EAAK,OAAO,OAAO;EAExB,IAAI,IAAI,EAAK,IAAI,EAAK,GAClB,IAAI,EAAK,IAAI,EAAK,GAClB,IAAI,IAAK,GACT,IAAI,IAAI,IAAI,IAAI;EAIpB,IAAI,IAAI,IAAI,IAAS,GAQnB,OAPI,IAAI,MACF,MAAM,MAAG,IAAIC,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,IAAI,MAAc,IAAI,KAAK,KAAK,IAAe,CAAC,IACpD,EAAK,MAAM,IAAI,EAAK,QAAQ,IAAQ,GACpC,EAAK,MAAM,IAAI,EAAK,QAAQ,IAAQ,IAE/B;EAIA,QAAK,UAAU,KAAK,IAG7B;IAAI,EAAK,SAAS,KAAQ,EAAK,UACzB,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,MAAM,MAAG,IAAIA,EAAO,CAAM,GAAG,KAAK,IAAI,IACtC,IAAI,MAAc,IAAI,KAAK,KAAK,IAAe,CAAC;GAGtD;IAAG,AAAI,EAAK,SAAS,MACnB,IAAI,EAAU,EAAK,KAAK,SAAS,IAAQ,GACzC,EAAK,MAAM,IAAI,GACf,EAAK,MAAM,IAAI;UACR,IAAO,EAAK;EANrB;CAOF;CAwBA,OAtBA,EAAM,aAAa,SAAS,GAAQ,GAAS;EAG3C,AAFA,IAAQ,GACR,IAAS,GACT,EAAW;CACb,GAEA,EAAM,WAAW,SAAS,GAAG;EAC3B,OAAO,UAAU,UAAU,IAAW,OAAO,KAAM,aAAa,IAAID,EAAS,CAAC,CAAC,GAAG,EAAW,GAAG,KAAS;CAC3G,GAEA,EAAM,cAAc,SAAS,GAAG;EAC9B,OAAO,UAAU,UAAU,IAAe,IAAI,GAAG,KAAS,KAAK,KAAK,CAAY;CAClF,GAEA,EAAM,cAAc,SAAS,GAAG;EAC9B,OAAO,UAAU,UAAU,IAAe,IAAI,GAAG,KAAS,KAAK,KAAK,CAAY;CAClF,GAEA,EAAM,QAAQ,SAAS,GAAG;EACxB,OAAO,UAAU,UAAU,IAAS,IAAI,GAAG,KAAS,KAAK,KAAK,CAAM;CACtE,GAEO;AACT;;;AC5EA,IAAM,IAA0B,MAC1B,IAAwB,KACxB,IAAgB,KAChB,IAAiB,KACjB,IAAoB,KACpB,IAAc,IACd,IAAqB,IAErB,IAAQ;CACV,YAAY;CACZ,UAAU;CACV,iBAAiB;CACjB,kBAAkB;CAClB,YAAY;CACZ,mBAAmB;CACnB,oBAAoB;CACpB,UAAU;AACd;AAIA,SAAgB,EAAqB,GAA0B,GAAuB,IAAiC,CAAC,GAAyB;CAC7I,IAAM,IAAQ,EAAS,eAAe,GAChC,IAAS,EAAS,gBAAgB,GAElC,IAAuB,EAAK,MAAM,KAAK,OAAU,EAAE,GAAG,EAAK,EAAE,GAC7D,IAAuB,EAAK,MAAM,KAAK,OAAU,EAAE,GAAG,EAAK,EAAE,GAG7D,IAAc,KAAK,IAAI,GAAO,CAAM,IAAI;CAC9C,KAAK,IAAM,CAAC,GAAO,MAAS,EAAM,QAAQ,GAAG;EACzC,IAAM,IAAS,IAAQ,EAAM,SAAU,KAAK,KAAK;EAEjD,AADA,EAAK,IAAI,IAAQ,IAAI,KAAK,IAAI,CAAK,IAAI,GACvC,EAAK,IAAI,IAAS,IAAI,KAAK,IAAI,CAAK,IAAI;CAC5C;CAEA,IAAM,IAAmD,EAAgB,CAAK,CAAC,CAC1E,MACG,QACA,EAAoC,CAAK,CAAC,CACrC,IAAI,MAAS,EAAK,EAAE,CAAC,CACrB,SAAS,EAAQ,gBAAgB,CAAqB,CAC/D,CAAC,CACA,MAAM,UAAU,EAAc,CAAC,CAAC,SAAS,EAAQ,kBAAkB,CAAuB,CAAC,CAAC,CAC5F,MAAM,UAAU,EAAY,IAAQ,GAAG,IAAS,CAAC,CAAC,GAEjD,IAAe,EAAO,CAAQ,CAAC,CAChC,OAAO,KAAK,CAAC,CACb,KAAK,SAAS,CAAK,CAAC,CACpB,KAAK,UAAU,CAAM,CAAC,CACtB,KAAK,WAAW,OAAO,OAAO,CAAK,EAAE,GAAG,OAAO,CAAM,GAAG,CAAC,CACzD,MAAM,gBAAgB,MAAM,GAC3B,IAAW,EAAa,OAAO,GAAG,GAElC,IAAO,EAAS,UAAuC,MAAM,CAAC,CAAC,KAAK,CAAK,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,KAAK,UAAU,EAAM,UAAU,CAAC,CAAC,KAAK,gBAAgB,CAAC,GAE/I,IAAO,EAAS,UAAoC,GAAG,CAAC,CAAC,KAAK,CAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,UAAU,SAAS;CAE9G,AADA,EAAK,OAAO,QAAQ,CAAC,CAAC,KAAK,KAAK,CAAW,CAAC,CAAC,KAAK,QAAQ,EAAM,QAAQ,CAAC,CAAC,KAAK,UAAU,EAAM,UAAU,CAAC,CAAC,KAAK,gBAAgB,CAAC,GACjI,EAAK,OAAO,MAAM,CAAC,CACd,MAAM,MAAgB,EAAY,EAAE,CAAC,CACrC,KAAK,eAAe,QAAQ,CAAC,CAC7B,KAAK,MAAM,CAAC,CAAC,CACb,KAAK,QAAQ,EAAM,QAAQ;CAEhC,IAAI,IAAgC,MAChC,IAA+B,MAE7B,UAA+B;EACjC,EAAK,UAAyC,QAAQ,CAAC,CAClD,KAAK,SAAS,MACP,EAAY,OAAO,IAAuB,EAAM,mBAChD,EAAY,OAAO,IAAsB,EAAM,kBAC5C,EAAM,QAChB,CAAC,CACD,KAAK,WAAW,MACT,EAAY,OAAO,IAAuB,EAAM,qBAChD,EAAY,OAAO,IAAsB,EAAM,oBAC5C,EAAM,UAChB,CAAC,CACD,KAAK,iBAAiB,MAAiB,EAAY,OAAO,IAAiB,IAAI,CAAE,CAAC,CAClF,KAAK,MAAM,MAAiB,EAAY,OAAO,KAAkB,EAAY,OAAO,IAAgB,IAAqB,CAAY;CAC9I;CAgBA,AAdA,EAAK,GAAG,eAAe,GAAQ,MAAgB;EAE3C,AADA,IAAgB,EAAY,IAC5B,EAAiB;CACrB,CAAC,CAAC,CACG,GAAG,eAAe,GAAQ,MAAgB;EAEvC,AADI,MAAkB,EAAY,OAAI,IAAgB,OACtD,EAAiB;CACrB,CAAC,CAAC,CACD,GAAG,UAAU,GAAmB,MAAgB;EAG7C,AAFA,EAAM,gBAAgB,GACtB,IAAiB,MAAmB,EAAY,KAAK,OAAO,EAAY,IACxE,EAAiB;CACrB,CAAC,GAEL,EAAa,GAAG,eAAe;EAE3B,AADA,IAAiB,MACjB,EAAiB;CACrB,CAAC;CAED,IAAM,IAAe,EAA6B,CAAC,CAC9C,YAAY,CAAC,IAAK,CAAC,CAAC,CAAC,CACrB,GAAG,SAAS,MAA+C;EACxD,EAAS,KAAK,aAAa,EAAM,UAAU,SAAS,CAAC;CACzD,CAAC;CAEL,EAAa,KAAK,CAAY,CAAC,CAAC,GAAG,iBAAiB,IAAI;CAExD,IAAM,KAAmB,GAAsC,MACvD,OAAO,KAAU,WAAiB,EAAM,MAAS,IAC9C,GAGL,UAA0B;EAK5B,AAJA,EAAK,KAAK,OAAO,MAAgB,EAAgB,EAAY,QAAQ,GAAG,CAAC,CAAC,CACrE,KAAK,OAAO,MAAgB,EAAgB,EAAY,QAAQ,GAAG,CAAC,CAAC,CACrE,KAAK,OAAO,MAAgB,EAAgB,EAAY,QAAQ,GAAG,CAAC,CAAC,CACrE,KAAK,OAAO,MAAgB,EAAgB,EAAY,QAAQ,GAAG,CAAC,GACzE,EAAK,KAAK,cAAc,MAAgB,aAAa,OAAO,EAAY,KAAK,CAAC,EAAE,GAAG,OAAO,EAAY,KAAK,CAAC,EAAE,EAAE;CACpH;CA2BA,AAxBA,EAAW,KAAK,GAIhB,EAAK,KACD,EAA+B,CAAC,CAC3B,GAAG,UAAU,GAAkB,MAAgB;EAG5C,AAFA,EAAO,aAAqD,gBAAgB,GAC5E,EAAY,KAAK,EAAY,GAC7B,EAAY,KAAK,EAAY;CACjC,CAAC,CAAC,CACD,GAAG,SAAS,GAAkB,MAAgB;EAK3C,AAJA,EAAY,IAAI,EAAM,GACtB,EAAY,IAAI,EAAM,GACtB,EAAY,KAAK,EAAM,GACvB,EAAY,KAAK,EAAM,GACvB,EAAY;CAChB,CAAC,CAAC,CACD,GAAG,QAAQ,GAAmB,MAAgB;EAE3C,AADA,EAAY,KAAK,MACjB,EAAY,KAAK;CACrB,CAAC,CACT,GAEA,EAAY;CAEZ,IAAM,IAAU,EAAa,KAAK;CAClC,IAAI,KAAW,MAAM,MAAU,MAAM,+CAA+C;CAEpF,OAAO;EACH,eAAe;GAEX,AADA,EAAW,KAAK,GAChB,EAAa,OAAO;EACxB;EACA,cAAc;GACV,IAAM,IAAW,EAAS,eAAe,GACnC,IAAY,EAAS,gBAAgB;GAE3C,AADA,EAAa,KAAK,SAAS,CAAQ,CAAC,CAAC,KAAK,UAAU,CAAS,CAAC,CAAC,KAAK,WAAW,OAAO,OAAO,CAAQ,EAAE,GAAG,OAAO,CAAS,GAAG,GAC7H,EAAW,MAAM,UAAU,EAAY,IAAW,GAAG,IAAY,CAAC,CAAC;EACvE;EACA,KAAK;EACL,yBAAyB;GACrB,EAAW,MAAM,CAAC;GAClB,KAAK,IAAI,IAAO,GAAG,IAAO,GAAmB,KAAQ,GAAG,EAAW,KAAK;GAExE,AADA,EAAW,KAAK,GAChB,EAAY;EAChB;CACJ;AACJ"}