@vc-shell/framework 2.0.0-alpha.8 → 2.0.0-pr221.637b802

package/dist/chunks/vendor-d3-interpolate-path-CpGLvKgS.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-d3-interpolate-path-CpGLvKgS.js","sources":["../../../node_modules/d3-interpolate-path/build/d3-interpolate-path.mjs"],"sourcesContent":["function ownKeys(object, enumerableOnly) {\n  var keys = Object.keys(object);\n\n  if (Object.getOwnPropertySymbols) {\n    var symbols = Object.getOwnPropertySymbols(object);\n\n    if (enumerableOnly) {\n      symbols = symbols.filter(function (sym) {\n        return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n      });\n    }\n\n    keys.push.apply(keys, symbols);\n  }\n\n  return keys;\n}\n\nfunction _objectSpread2(target) {\n  for (var i = 1; i < arguments.length; i++) {\n    var source = arguments[i] != null ? arguments[i] : {};\n\n    if (i % 2) {\n      ownKeys(Object(source), true).forEach(function (key) {\n        _defineProperty(target, key, source[key]);\n      });\n    } else if (Object.getOwnPropertyDescriptors) {\n      Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n    } else {\n      ownKeys(Object(source)).forEach(function (key) {\n        Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n      });\n    }\n  }\n\n  return target;\n}\n\nfunction _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    _typeof = function (obj) {\n      return typeof obj;\n    };\n  } else {\n    _typeof = function (obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n\n  return _typeof(obj);\n}\n\nfunction _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nfunction _extends() {\n  _extends = Object.assign || function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n\n    return target;\n  };\n\n  return _extends.apply(this, arguments);\n}\n\nfunction _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return _arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);\n}\n\nfunction _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n\n  for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];\n\n  return arr2;\n}\n\nfunction _createForOfIteratorHelper(o, allowArrayLike) {\n  var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"];\n\n  if (!it) {\n    if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") {\n      if (it) o = it;\n      var i = 0;\n\n      var F = function () {};\n\n      return {\n        s: F,\n        n: function () {\n          if (i >= o.length) return {\n            done: true\n          };\n          return {\n            done: false,\n            value: o[i++]\n          };\n        },\n        e: function (e) {\n          throw e;\n        },\n        f: F\n      };\n    }\n\n    throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n  }\n\n  var normalCompletion = true,\n      didErr = false,\n      err;\n  return {\n    s: function () {\n      it = it.call(o);\n    },\n    n: function () {\n      var step = it.next();\n      normalCompletion = step.done;\n      return step;\n    },\n    e: function (e) {\n      didErr = true;\n      err = e;\n    },\n    f: function () {\n      try {\n        if (!normalCompletion && it.return != null) it.return();\n      } finally {\n        if (didErr) throw err;\n      }\n    }\n  };\n}\n\n/**\n * de Casteljau's algorithm for drawing and splitting bezier curves.\n * Inspired by https://pomax.github.io/bezierinfo/\n *\n * @param {Number[][]} points Array of [x,y] points: [start, control1, control2, ..., end]\n *   The original segment to split.\n * @param {Number} t Where to split the curve (value between [0, 1])\n * @return {Object} An object { left, right } where left is the segment from 0..t and\n *   right is the segment from t..1.\n */\nfunction decasteljau(points, t) {\n  var left = [];\n  var right = [];\n\n  function decasteljauRecurse(points, t) {\n    if (points.length === 1) {\n      left.push(points[0]);\n      right.push(points[0]);\n    } else {\n      var newPoints = Array(points.length - 1);\n\n      for (var i = 0; i < newPoints.length; i++) {\n        if (i === 0) {\n          left.push(points[0]);\n        }\n\n        if (i === newPoints.length - 1) {\n          right.push(points[i + 1]);\n        }\n\n        newPoints[i] = [(1 - t) * points[i][0] + t * points[i + 1][0], (1 - t) * points[i][1] + t * points[i + 1][1]];\n      }\n\n      decasteljauRecurse(newPoints, t);\n    }\n  }\n\n  if (points.length) {\n    decasteljauRecurse(points, t);\n  }\n\n  return {\n    left: left,\n    right: right.reverse()\n  };\n}\n/**\n * Convert segments represented as points back into a command object\n *\n * @param {Number[][]} points Array of [x,y] points: [start, control1, control2, ..., end]\n *   Represents a segment\n * @return {Object} A command object representing the segment.\n */\n\n\nfunction pointsToCommand(points) {\n  var command = {};\n\n  if (points.length === 4) {\n    command.x2 = points[2][0];\n    command.y2 = points[2][1];\n  }\n\n  if (points.length >= 3) {\n    command.x1 = points[1][0];\n    command.y1 = points[1][1];\n  }\n\n  command.x = points[points.length - 1][0];\n  command.y = points[points.length - 1][1];\n\n  if (points.length === 4) {\n    // start, control1, control2, end\n    command.type = 'C';\n  } else if (points.length === 3) {\n    // start, control, end\n    command.type = 'Q';\n  } else {\n    // start, end\n    command.type = 'L';\n  }\n\n  return command;\n}\n/**\n * Runs de Casteljau's algorithm enough times to produce the desired number of segments.\n *\n * @param {Number[][]} points Array of [x,y] points for de Casteljau (the initial segment to split)\n * @param {Number} segmentCount Number of segments to split the original into\n * @return {Number[][][]} Array of segments\n */\n\n\nfunction splitCurveAsPoints(points, segmentCount) {\n  segmentCount = segmentCount || 2;\n  var segments = [];\n  var remainingCurve = points;\n  var tIncrement = 1 / segmentCount; // x-----x-----x-----x\n  // t=  0.33   0.66   1\n  // x-----o-----------x\n  // r=  0.33\n  //       x-----o-----x\n  // r=         0.5  (0.33 / (1 - 0.33))  === tIncrement / (1 - (tIncrement * (i - 1))\n  // x-----x-----x-----x----x\n  // t=  0.25   0.5   0.75  1\n  // x-----o----------------x\n  // r=  0.25\n  //       x-----o----------x\n  // r=         0.33  (0.25 / (1 - 0.25))\n  //             x-----o----x\n  // r=         0.5  (0.25 / (1 - 0.5))\n\n  for (var i = 0; i < segmentCount - 1; i++) {\n    var tRelative = tIncrement / (1 - tIncrement * i);\n    var split = decasteljau(remainingCurve, tRelative);\n    segments.push(split.left);\n    remainingCurve = split.right;\n  } // last segment is just to the end from the last point\n\n\n  segments.push(remainingCurve);\n  return segments;\n}\n/**\n * Convert command objects to arrays of points, run de Casteljau's algorithm on it\n * to split into to the desired number of segments.\n *\n * @param {Object} commandStart The start command object\n * @param {Object} commandEnd The end command object\n * @param {Number} segmentCount The number of segments to create\n * @return {Object[]} An array of commands representing the segments in sequence\n */\n\n\nfunction splitCurve(commandStart, commandEnd, segmentCount) {\n  var points = [[commandStart.x, commandStart.y]];\n\n  if (commandEnd.x1 != null) {\n    points.push([commandEnd.x1, commandEnd.y1]);\n  }\n\n  if (commandEnd.x2 != null) {\n    points.push([commandEnd.x2, commandEnd.y2]);\n  }\n\n  points.push([commandEnd.x, commandEnd.y]);\n  return splitCurveAsPoints(points, segmentCount).map(pointsToCommand);\n}\n\nvar commandTokenRegex = /[MLCSTQAHVZmlcstqahv]|-?[\\d.e+-]+/g;\n/**\n * List of params for each command type in a path `d` attribute\n */\n\nvar typeMap = {\n  M: ['x', 'y'],\n  L: ['x', 'y'],\n  H: ['x'],\n  V: ['y'],\n  C: ['x1', 'y1', 'x2', 'y2', 'x', 'y'],\n  S: ['x2', 'y2', 'x', 'y'],\n  Q: ['x1', 'y1', 'x', 'y'],\n  T: ['x', 'y'],\n  A: ['rx', 'ry', 'xAxisRotation', 'largeArcFlag', 'sweepFlag', 'x', 'y'],\n  Z: []\n}; // Add lower case entries too matching uppercase (e.g. 'm' == 'M')\n\nObject.keys(typeMap).forEach(function (key) {\n  typeMap[key.toLowerCase()] = typeMap[key];\n});\n\nfunction arrayOfLength(length, value) {\n  var array = Array(length);\n\n  for (var i = 0; i < length; i++) {\n    array[i] = value;\n  }\n\n  return array;\n}\n/**\n * Converts a command object to a string to be used in a `d` attribute\n * @param {Object} command A command object\n * @return {String} The string for the `d` attribute\n */\n\n\nfunction commandToString(command) {\n  return \"\".concat(command.type).concat(typeMap[command.type].map(function (p) {\n    return command[p];\n  }).join(','));\n}\n/**\n * Converts command A to have the same type as command B.\n *\n * e.g., L0,5 -> C0,5,0,5,0,5\n *\n * Uses these rules:\n * x1 <- x\n * x2 <- x\n * y1 <- y\n * y2 <- y\n * rx <- 0\n * ry <- 0\n * xAxisRotation <- read from B\n * largeArcFlag <- read from B\n * sweepflag <- read from B\n *\n * @param {Object} aCommand Command object from path `d` attribute\n * @param {Object} bCommand Command object from path `d` attribute to match against\n * @return {Object} aCommand converted to type of bCommand\n */\n\n\nfunction convertToSameType(aCommand, bCommand) {\n  var conversionMap = {\n    x1: 'x',\n    y1: 'y',\n    x2: 'x',\n    y2: 'y'\n  };\n  var readFromBKeys = ['xAxisRotation', 'largeArcFlag', 'sweepFlag']; // convert (but ignore M types)\n\n  if (aCommand.type !== bCommand.type && bCommand.type.toUpperCase() !== 'M') {\n    var aConverted = {};\n    Object.keys(bCommand).forEach(function (bKey) {\n      var bValue = bCommand[bKey]; // first read from the A command\n\n      var aValue = aCommand[bKey]; // if it is one of these values, read from B no matter what\n\n      if (aValue === undefined) {\n        if (readFromBKeys.includes(bKey)) {\n          aValue = bValue;\n        } else {\n          // if it wasn't in the A command, see if an equivalent was\n          if (aValue === undefined && conversionMap[bKey]) {\n            aValue = aCommand[conversionMap[bKey]];\n          } // if it doesn't have a converted value, use 0\n\n\n          if (aValue === undefined) {\n            aValue = 0;\n          }\n        }\n      }\n\n      aConverted[bKey] = aValue;\n    }); // update the type to match B\n\n    aConverted.type = bCommand.type;\n    aCommand = aConverted;\n  }\n\n  return aCommand;\n}\n/**\n * Interpolate between command objects commandStart and commandEnd segmentCount times.\n * If the types are L, Q, or C then the curves are split as per de Casteljau's algorithm.\n * Otherwise we just copy commandStart segmentCount - 1 times, finally ending with commandEnd.\n *\n * @param {Object} commandStart Command object at the beginning of the segment\n * @param {Object} commandEnd Command object at the end of the segment\n * @param {Number} segmentCount The number of segments to split this into. If only 1\n *   Then [commandEnd] is returned.\n * @return {Object[]} Array of ~segmentCount command objects between commandStart and\n *   commandEnd. (Can be segmentCount+1 objects if commandStart is type M).\n */\n\n\nfunction splitSegment(commandStart, commandEnd, segmentCount) {\n  var segments = []; // line, quadratic bezier, or cubic bezier\n\n  if (commandEnd.type === 'L' || commandEnd.type === 'Q' || commandEnd.type === 'C') {\n    segments = segments.concat(splitCurve(commandStart, commandEnd, segmentCount)); // general case - just copy the same point\n  } else {\n    var copyCommand = _extends({}, commandStart); // convert M to L\n\n\n    if (copyCommand.type === 'M') {\n      copyCommand.type = 'L';\n    }\n\n    segments = segments.concat(arrayOfLength(segmentCount - 1).map(function () {\n      return copyCommand;\n    }));\n    segments.push(commandEnd);\n  }\n\n  return segments;\n}\n/**\n * Extends an array of commandsToExtend to the length of the referenceCommands by\n * splitting segments until the number of commands match. Ensures all the actual\n * points of commandsToExtend are in the extended array.\n *\n * @param {Object[]} commandsToExtend The command object array to extend\n * @param {Object[]} referenceCommands The command object array to match in length\n * @param {Function} excludeSegment a function that takes a start command object and\n *   end command object and returns true if the segment should be excluded from splitting.\n * @return {Object[]} The extended commandsToExtend array\n */\n\n\nfunction extend(commandsToExtend, referenceCommands, excludeSegment) {\n  // compute insertion points:\n  // number of segments in the path to extend\n  var numSegmentsToExtend = commandsToExtend.length - 1; // number of segments in the reference path.\n\n  var numReferenceSegments = referenceCommands.length - 1; // this value is always between [0, 1].\n\n  var segmentRatio = numSegmentsToExtend / numReferenceSegments; // create a map, mapping segments in referenceCommands to how many points\n  // should be added in that segment (should always be >= 1 since we need each\n  // point itself).\n  // 0 = segment 0-1, 1 = segment 1-2, n-1 = last vertex\n\n  var countPointsPerSegment = arrayOfLength(numReferenceSegments).reduce(function (accum, d, i) {\n    var insertIndex = Math.floor(segmentRatio * i); // handle excluding segments\n\n    if (excludeSegment && insertIndex < commandsToExtend.length - 1 && excludeSegment(commandsToExtend[insertIndex], commandsToExtend[insertIndex + 1])) {\n      // set the insertIndex to the segment that this point should be added to:\n      // round the insertIndex essentially so we split half and half on\n      // neighbouring segments. hence the segmentRatio * i < 0.5\n      var addToPriorSegment = segmentRatio * i % 1 < 0.5; // only skip segment if we already have 1 point in it (can't entirely remove a segment)\n\n      if (accum[insertIndex]) {\n        // TODO - Note this is a naive algorithm that should work for most d3-area use cases\n        // but if two adjacent segments are supposed to be skipped, this will not perform as\n        // expected. Could be updated to search for nearest segment to place the point in, but\n        // will only do that if necessary.\n        // add to the prior segment\n        if (addToPriorSegment) {\n          if (insertIndex > 0) {\n            insertIndex -= 1; // not possible to add to previous so adding to next\n          } else if (insertIndex < commandsToExtend.length - 1) {\n            insertIndex += 1;\n          } // add to next segment\n\n        } else if (insertIndex < commandsToExtend.length - 1) {\n          insertIndex += 1; // not possible to add to next so adding to previous\n        } else if (insertIndex > 0) {\n          insertIndex -= 1;\n        }\n      }\n    }\n\n    accum[insertIndex] = (accum[insertIndex] || 0) + 1;\n    return accum;\n  }, []); // extend each segment to have the correct number of points for a smooth interpolation\n\n  var extended = countPointsPerSegment.reduce(function (extended, segmentCount, i) {\n    // if last command, just add `segmentCount` number of times\n    if (i === commandsToExtend.length - 1) {\n      var lastCommandCopies = arrayOfLength(segmentCount, _extends({}, commandsToExtend[commandsToExtend.length - 1])); // convert M to L\n\n      if (lastCommandCopies[0].type === 'M') {\n        lastCommandCopies.forEach(function (d) {\n          d.type = 'L';\n        });\n      }\n\n      return extended.concat(lastCommandCopies);\n    } // otherwise, split the segment segmentCount times.\n\n\n    return extended.concat(splitSegment(commandsToExtend[i], commandsToExtend[i + 1], segmentCount));\n  }, []); // add in the very first point since splitSegment only adds in the ones after it\n\n  extended.unshift(commandsToExtend[0]);\n  return extended;\n}\n/**\n * Takes a path `d` string and converts it into an array of command\n * objects. Drops the `Z` character.\n *\n * @param {String|null} d A path `d` string\n */\n\n\nfunction pathCommandsFromString(d) {\n  // split into valid tokens\n  var tokens = (d || '').match(commandTokenRegex) || [];\n  var commands = [];\n  var commandArgs;\n  var command; // iterate over each token, checking if we are at a new command\n  // by presence in the typeMap\n\n  for (var i = 0; i < tokens.length; ++i) {\n    commandArgs = typeMap[tokens[i]]; // new command found:\n\n    if (commandArgs) {\n      command = {\n        type: tokens[i]\n      }; // add each of the expected args for this command:\n\n      for (var a = 0; a < commandArgs.length; ++a) {\n        command[commandArgs[a]] = +tokens[i + a + 1];\n      } // need to increment our token index appropriately since\n      // we consumed token args\n\n\n      i += commandArgs.length;\n      commands.push(command);\n    }\n  }\n\n  return commands;\n}\n/**\n * Interpolate from A to B by extending A and B during interpolation to have\n * the same number of points. This allows for a smooth transition when they\n * have a different number of points.\n *\n * Ignores the `Z` command in paths unless both A and B end with it.\n *\n * This function works directly with arrays of command objects instead of with\n * path `d` strings (see interpolatePath for working with `d` strings).\n *\n * @param {Object[]} aCommandsInput Array of path commands\n * @param {Object[]} bCommandsInput Array of path commands\n * @param {(Function|Object)} interpolateOptions\n * @param {Function} interpolateOptions.excludeSegment a function that takes a start command object and\n *   end command object and returns true if the segment should be excluded from splitting.\n * @param {Boolean} interpolateOptions.snapEndsToInput a boolean indicating whether end of input should\n *   be sourced from input argument or computed.\n * @returns {Function} Interpolation function that maps t ([0, 1]) to an array of path commands.\n */\n\nfunction interpolatePathCommands(aCommandsInput, bCommandsInput, interpolateOptions) {\n  // make a copy so we don't mess with the input arrays\n  var aCommands = aCommandsInput == null ? [] : aCommandsInput.slice();\n  var bCommands = bCommandsInput == null ? [] : bCommandsInput.slice();\n\n  var _ref = _typeof(interpolateOptions) === 'object' ? interpolateOptions : {\n    excludeSegment: interpolateOptions,\n    snapEndsToInput: true\n  },\n      excludeSegment = _ref.excludeSegment,\n      snapEndsToInput = _ref.snapEndsToInput; // both input sets are empty, so we don't interpolate\n\n\n  if (!aCommands.length && !bCommands.length) {\n    return function nullInterpolator() {\n      return [];\n    };\n  } // do we add Z during interpolation? yes if both have it. (we'd expect both to have it or not)\n\n\n  var addZ = (aCommands.length === 0 || aCommands[aCommands.length - 1].type === 'Z') && (bCommands.length === 0 || bCommands[bCommands.length - 1].type === 'Z'); // we temporarily remove Z\n\n  if (aCommands.length > 0 && aCommands[aCommands.length - 1].type === 'Z') {\n    aCommands.pop();\n  }\n\n  if (bCommands.length > 0 && bCommands[bCommands.length - 1].type === 'Z') {\n    bCommands.pop();\n  } // if A is empty, treat it as if it used to contain just the first point\n  // of B. This makes it so the line extends out of from that first point.\n\n\n  if (!aCommands.length) {\n    aCommands.push(bCommands[0]); // otherwise if B is empty, treat it as if it contains the first point\n    // of A. This makes it so the line retracts into the first point.\n  } else if (!bCommands.length) {\n    bCommands.push(aCommands[0]);\n  } // extend to match equal size\n\n\n  var numPointsToExtend = Math.abs(bCommands.length - aCommands.length);\n\n  if (numPointsToExtend !== 0) {\n    // B has more points than A, so add points to A before interpolating\n    if (bCommands.length > aCommands.length) {\n      aCommands = extend(aCommands, bCommands, excludeSegment); // else if A has more points than B, add more points to B\n    } else if (bCommands.length < aCommands.length) {\n      bCommands = extend(bCommands, aCommands, excludeSegment);\n    }\n  } // commands have same length now.\n  // convert commands in A to the same type as those in B\n\n\n  aCommands = aCommands.map(function (aCommand, i) {\n    return convertToSameType(aCommand, bCommands[i]);\n  }); // create mutable interpolated command objects\n\n  var interpolatedCommands = aCommands.map(function (aCommand) {\n    return _objectSpread2({}, aCommand);\n  });\n\n  if (addZ) {\n    interpolatedCommands.push({\n      type: 'Z'\n    });\n    aCommands.push({\n      type: 'Z'\n    }); // required for when returning at t == 0\n  }\n\n  return function pathCommandInterpolator(t) {\n    // at 1 return the final value without the extensions used during interpolation\n    if (t === 1 && snapEndsToInput) {\n      return bCommandsInput == null ? [] : bCommandsInput;\n    } // work with aCommands directly since interpolatedCommands are mutated\n\n\n    if (t === 0) {\n      return aCommands;\n    } // interpolate the commands using the mutable interpolated command objs\n\n\n    for (var i = 0; i < interpolatedCommands.length; ++i) {\n      // if (interpolatedCommands[i].type === 'Z') continue;\n      var aCommand = aCommands[i];\n      var bCommand = bCommands[i];\n      var interpolatedCommand = interpolatedCommands[i];\n\n      var _iterator = _createForOfIteratorHelper(typeMap[interpolatedCommand.type]),\n          _step;\n\n      try {\n        for (_iterator.s(); !(_step = _iterator.n()).done;) {\n          var arg = _step.value;\n          interpolatedCommand[arg] = (1 - t) * aCommand[arg] + t * bCommand[arg]; // do not use floats for flags (#27), round to integer\n\n          if (arg === 'largeArcFlag' || arg === 'sweepFlag') {\n            interpolatedCommand[arg] = Math.round(interpolatedCommand[arg]);\n          }\n        }\n      } catch (err) {\n        _iterator.e(err);\n      } finally {\n        _iterator.f();\n      }\n    }\n\n    return interpolatedCommands;\n  };\n}\n/** @typedef InterpolateOptions  */\n\n/**\n * Interpolate from A to B by extending A and B during interpolation to have\n * the same number of points. This allows for a smooth transition when they\n * have a different number of points.\n *\n * Ignores the `Z` character in paths unless both A and B end with it.\n *\n * @param {String} a The `d` attribute for a path\n * @param {String} b The `d` attribute for a path\n * @param {((command1, command2) => boolean|{\n *   excludeSegment?: (command1, command2) => boolean;\n *   snapEndsToInput?: boolean\n * })} interpolateOptions The excludeSegment function or an options object\n *    - interpolateOptions.excludeSegment a function that takes a start command object and\n *      end command object and returns true if the segment should be excluded from splitting.\n *    - interpolateOptions.snapEndsToInput a boolean indicating whether end of input should\n *      be sourced from input argument or computed.\n * @returns {Function} Interpolation function that maps t ([0, 1]) to a path `d` string.\n */\n\nfunction interpolatePath(a, b, interpolateOptions) {\n  var aCommands = pathCommandsFromString(a);\n  var bCommands = pathCommandsFromString(b);\n\n  var _ref2 = _typeof(interpolateOptions) === 'object' ? interpolateOptions : {\n    excludeSegment: interpolateOptions,\n    snapEndsToInput: true\n  },\n      excludeSegment = _ref2.excludeSegment,\n      snapEndsToInput = _ref2.snapEndsToInput;\n\n  if (!aCommands.length && !bCommands.length) {\n    return function nullInterpolator() {\n      return '';\n    };\n  }\n\n  var commandInterpolator = interpolatePathCommands(aCommands, bCommands, {\n    excludeSegment: excludeSegment,\n    snapEndsToInput: snapEndsToInput\n  });\n  return function pathStringInterpolator(t) {\n    // at 1 return the final value without the extensions used during interpolation\n    if (t === 1 && snapEndsToInput) {\n      return b == null ? '' : b;\n    }\n\n    var interpolatedCommands = commandInterpolator(t); // convert to a string (fastest concat: https://jsperf.com/join-concat/150)\n\n    var interpolatedString = '';\n\n    var _iterator2 = _createForOfIteratorHelper(interpolatedCommands),\n        _step2;\n\n    try {\n      for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {\n        var interpolatedCommand = _step2.value;\n        interpolatedString += commandToString(interpolatedCommand);\n      }\n    } catch (err) {\n      _iterator2.e(err);\n    } finally {\n      _iterator2.f();\n    }\n\n    return interpolatedString;\n  };\n}\n\nexport { interpolatePath, interpolatePathCommands, pathCommandsFromString };\n"],"names":["ownKeys","object","enumerableOnly","keys","symbols","sym","_objectSpread2","target","i","source","key","_defineProperty","_typeof","obj","value","_extends","_unsupportedIterableToArray","o","minLen","_arrayLikeToArray","arr","len","arr2","_createForOfIteratorHelper","allowArrayLike","it","F","e","normalCompletion","didErr","err","step","decasteljau","points","t","left","right","decasteljauRecurse","newPoints","pointsToCommand","command","splitCurveAsPoints","segmentCount","segments","remainingCurve","tIncrement","tRelative","split","splitCurve","commandStart","commandEnd","commandTokenRegex","typeMap","arrayOfLength","length","array","commandToString","p","convertToSameType","aCommand","bCommand","conversionMap","readFromBKeys","aConverted","bKey","bValue","aValue","splitSegment","copyCommand","extend","commandsToExtend","referenceCommands","excludeSegment","numSegmentsToExtend","numReferenceSegments","segmentRatio","countPointsPerSegment","accum","d","insertIndex","addToPriorSegment","extended","lastCommandCopies","pathCommandsFromString","tokens","commands","commandArgs","a","interpolatePathCommands","aCommandsInput","bCommandsInput","interpolateOptions","aCommands","bCommands","_ref","snapEndsToInput","addZ","numPointsToExtend","interpolatedCommands","interpolatedCommand","_iterator","_step","arg","interpolatePath","b","_ref2","commandInterpolator","interpolatedString","_iterator2","_step2"],"mappings":"AAAA,SAASA,EAAQC,GAAQC,GAAgB;AACvC,MAAIC,IAAO,OAAO,KAAKF,CAAM;AAE7B,MAAI,OAAO,uBAAuB;AAChC,QAAIG,IAAU,OAAO,sBAAsBH,CAAM;AAEjD,IAAIC,MACFE,IAAUA,EAAQ,OAAO,SAAUC,GAAK;AACtC,aAAO,OAAO,yBAAyBJ,GAAQI,CAAG,EAAE;AAAA,IACtD,CAAC,IAGHF,EAAK,KAAK,MAAMA,GAAMC,CAAO;AAAA,EAC/B;AAEA,SAAOD;AACT;AAEA,SAASG,EAAeC,GAAQ;AAC9B,WAASC,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AACzC,QAAIC,IAAS,UAAUD,CAAC,KAAK,OAAO,UAAUA,CAAC,IAAI,CAAA;AAEnD,IAAIA,IAAI,IACNR,EAAQ,OAAOS,CAAM,GAAG,EAAI,EAAE,QAAQ,SAAUC,GAAK;AACnD,MAAAC,EAAgBJ,GAAQG,GAAKD,EAAOC,CAAG,CAAC;AAAA,IAC1C,CAAC,IACQ,OAAO,4BAChB,OAAO,iBAAiBH,GAAQ,OAAO,0BAA0BE,CAAM,CAAC,IAExET,EAAQ,OAAOS,CAAM,CAAC,EAAE,QAAQ,SAAUC,GAAK;AAC7C,aAAO,eAAeH,GAAQG,GAAK,OAAO,yBAAyBD,GAAQC,CAAG,CAAC;AAAA,IACjF,CAAC;AAAA,EAEL;AAEA,SAAOH;AACT;AAEA,SAASK,EAAQC,GAAK;AACpB;AAEA,SAAI,OAAO,UAAW,cAAc,OAAO,OAAO,YAAa,WAC7DD,IAAU,SAAUC,GAAK;AACvB,WAAO,OAAOA;AAAA,EAChB,IAEAD,IAAU,SAAUC,GAAK;AACvB,WAAOA,KAAO,OAAO,UAAW,cAAcA,EAAI,gBAAgB,UAAUA,MAAQ,OAAO,YAAY,WAAW,OAAOA;AAAA,EAC3H,GAGKD,EAAQC,CAAG;AACpB;AAEA,SAASF,EAAgBE,GAAKH,GAAKI,GAAO;AACxC,SAAIJ,KAAOG,IACT,OAAO,eAAeA,GAAKH,GAAK;AAAA,IAC9B,OAAOI;AAAA,IACP,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,UAAU;AAAA,EAChB,CAAK,IAEDD,EAAIH,CAAG,IAAII,GAGND;AACT;AAEA,SAASE,IAAW;AAClB,SAAAA,IAAW,OAAO,UAAU,SAAUR,GAAQ;AAC5C,aAASC,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AACzC,UAAIC,IAAS,UAAUD,CAAC;AAExB,eAASE,KAAOD;AACd,QAAI,OAAO,UAAU,eAAe,KAAKA,GAAQC,CAAG,MAClDH,EAAOG,CAAG,IAAID,EAAOC,CAAG;AAAA,IAG9B;AAEA,WAAOH;AAAA,EACT,GAEOQ,EAAS,MAAM,MAAM,SAAS;AACvC;AAEA,SAASC,EAA4BC,GAAGC,GAAQ;AAC9C,MAAKD,GACL;AAAA,QAAI,OAAOA,KAAM,SAAU,QAAOE,EAAkBF,GAAGC,CAAM;AAC7D,QAAI,IAAI,OAAO,UAAU,SAAS,KAAKD,CAAC,EAAE,MAAM,GAAG,EAAE;AAErD,QADI,MAAM,YAAYA,EAAE,gBAAa,IAAIA,EAAE,YAAY,OACnD,MAAM,SAAS,MAAM,MAAO,QAAO,MAAM,KAAKA,CAAC;AACnD,QAAI,MAAM,eAAe,2CAA2C,KAAK,CAAC,EAAG,QAAOE,EAAkBF,GAAGC,CAAM;AAAA;AACjH;AAEA,SAASC,EAAkBC,GAAKC,GAAK;AACnC,GAAIA,KAAO,QAAQA,IAAMD,EAAI,YAAQC,IAAMD,EAAI;AAE/C,WAASZ,IAAI,GAAGc,IAAO,IAAI,MAAMD,CAAG,GAAGb,IAAIa,GAAKb,IAAK,CAAAc,EAAKd,CAAC,IAAIY,EAAIZ,CAAC;AAEpE,SAAOc;AACT;AAEA,SAASC,EAA2BN,GAAGO,GAAgB;AACrD,MAAIC,IAAK,OAAO,SAAW,OAAeR,EAAE,OAAO,QAAQ,KAAKA,EAAE,YAAY;AAE9E,MAAI,CAACQ,GAAI;AACP,QAAI,MAAM,QAAQR,CAAC,MAAMQ,IAAKT,EAA4BC,CAAC,MAAMO,GAAqD;AACpH,MAAIC,MAAIR,IAAIQ;AACZ,UAAIjB,IAAI,GAEJkB,IAAI,WAAY;AAAA,MAAC;AAErB,aAAO;AAAA,QACL,GAAGA;AAAA,QACH,GAAG,WAAY;AACb,iBAAIlB,KAAKS,EAAE,SAAe;AAAA,YACxB,MAAM;AAAA,UAClB,IACiB;AAAA,YACL,MAAM;AAAA,YACN,OAAOA,EAAET,GAAG;AAAA,UACxB;AAAA,QACQ;AAAA,QACA,GAAG,SAAUmB,GAAG;AACd,gBAAMA;AAAA,QACR;AAAA,QACA,GAAGD;AAAA,MACX;AAAA,IACI;AAEA,UAAM,IAAI,UAAU;AAAA,mFAAuI;AAAA,EAC7J;AAEA,MAAIE,IAAmB,IACnBC,IAAS,IACTC;AACJ,SAAO;AAAA,IACL,GAAG,WAAY;AACb,MAAAL,IAAKA,EAAG,KAAKR,CAAC;AAAA,IAChB;AAAA,IACA,GAAG,WAAY;AACb,UAAIc,IAAON,EAAG,KAAI;AAClB,aAAAG,IAAmBG,EAAK,MACjBA;AAAA,IACT;AAAA,IACA,GAAG,SAAUJ,GAAG;AACd,MAAAE,IAAS,IACTC,IAAMH;AAAA,IACR;AAAA,IACA,GAAG,WAAY;AACb,UAAI;AACF,QAAI,CAACC,KAAoBH,EAAG,UAAU,QAAMA,EAAG,OAAM;AAAA,MACvD,UAAC;AACC,YAAII,EAAQ,OAAMC;AAAA,MACpB;AAAA,IACF;AAAA,EACJ;AACA;AAYA,SAASE,EAAYC,GAAQC,GAAG;AAC9B,MAAIC,IAAO,CAAA,GACPC,IAAQ,CAAA;AAEZ,WAASC,EAAmBJ,GAAQC,GAAG;AACrC,QAAID,EAAO,WAAW;AACpB,MAAAE,EAAK,KAAKF,EAAO,CAAC,CAAC,GACnBG,EAAM,KAAKH,EAAO,CAAC,CAAC;AAAA,SACf;AAGL,eAFIK,IAAY,MAAML,EAAO,SAAS,CAAC,GAE9BzB,IAAI,GAAGA,IAAI8B,EAAU,QAAQ9B;AACpC,QAAIA,MAAM,KACR2B,EAAK,KAAKF,EAAO,CAAC,CAAC,GAGjBzB,MAAM8B,EAAU,SAAS,KAC3BF,EAAM,KAAKH,EAAOzB,IAAI,CAAC,CAAC,GAG1B8B,EAAU9B,CAAC,IAAI,EAAE,IAAI0B,KAAKD,EAAOzB,CAAC,EAAE,CAAC,IAAI0B,IAAID,EAAOzB,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI0B,KAAKD,EAAOzB,CAAC,EAAE,CAAC,IAAI0B,IAAID,EAAOzB,IAAI,CAAC,EAAE,CAAC,CAAC;AAG9G,MAAA6B,EAAmBC,GAAWJ,CAAC;AAAA,IACjC;AAAA,EACF;AAEA,SAAID,EAAO,UACTI,EAAmBJ,GAAQC,CAAC,GAGvB;AAAA,IACL,MAAMC;AAAA,IACN,OAAOC,EAAM,QAAO;AAAA,EACxB;AACA;AAUA,SAASG,EAAgBN,GAAQ;AAC/B,MAAIO,IAAU,CAAA;AAEd,SAAIP,EAAO,WAAW,MACpBO,EAAQ,KAAKP,EAAO,CAAC,EAAE,CAAC,GACxBO,EAAQ,KAAKP,EAAO,CAAC,EAAE,CAAC,IAGtBA,EAAO,UAAU,MACnBO,EAAQ,KAAKP,EAAO,CAAC,EAAE,CAAC,GACxBO,EAAQ,KAAKP,EAAO,CAAC,EAAE,CAAC,IAG1BO,EAAQ,IAAIP,EAAOA,EAAO,SAAS,CAAC,EAAE,CAAC,GACvCO,EAAQ,IAAIP,EAAOA,EAAO,SAAS,CAAC,EAAE,CAAC,GAEnCA,EAAO,WAAW,IAEpBO,EAAQ,OAAO,MACNP,EAAO,WAAW,IAE3BO,EAAQ,OAAO,MAGfA,EAAQ,OAAO,KAGVA;AACT;AAUA,SAASC,EAAmBR,GAAQS,GAAc;AAChD,EAAAA,IAAeA,KAAgB;AAkB/B,WAjBIC,IAAW,CAAA,GACXC,IAAiBX,GACjBY,IAAa,IAAIH,GAeZlC,IAAI,GAAGA,IAAIkC,IAAe,GAAGlC,KAAK;AACzC,QAAIsC,IAAYD,KAAc,IAAIA,IAAarC,IAC3CuC,IAAQf,EAAYY,GAAgBE,CAAS;AACjD,IAAAH,EAAS,KAAKI,EAAM,IAAI,GACxBH,IAAiBG,EAAM;AAAA,EACzB;AAGA,SAAAJ,EAAS,KAAKC,CAAc,GACrBD;AACT;AAYA,SAASK,EAAWC,GAAcC,GAAYR,GAAc;AAC1D,MAAIT,IAAS,CAAC,CAACgB,EAAa,GAAGA,EAAa,CAAC,CAAC;AAE9C,SAAIC,EAAW,MAAM,QACnBjB,EAAO,KAAK,CAACiB,EAAW,IAAIA,EAAW,EAAE,CAAC,GAGxCA,EAAW,MAAM,QACnBjB,EAAO,KAAK,CAACiB,EAAW,IAAIA,EAAW,EAAE,CAAC,GAG5CjB,EAAO,KAAK,CAACiB,EAAW,GAAGA,EAAW,CAAC,CAAC,GACjCT,EAAmBR,GAAQS,CAAY,EAAE,IAAIH,CAAe;AACrE;AAEA,IAAIY,IAAoB,sCAKpBC,IAAU;AAAA,EACZ,GAAG,CAAC,KAAK,GAAG;AAAA,EACZ,GAAG,CAAC,KAAK,GAAG;AAAA,EACZ,GAAG,CAAC,GAAG;AAAA,EACP,GAAG,CAAC,GAAG;AAAA,EACP,GAAG,CAAC,MAAM,MAAM,MAAM,MAAM,KAAK,GAAG;AAAA,EACpC,GAAG,CAAC,MAAM,MAAM,KAAK,GAAG;AAAA,EACxB,GAAG,CAAC,MAAM,MAAM,KAAK,GAAG;AAAA,EACxB,GAAG,CAAC,KAAK,GAAG;AAAA,EACZ,GAAG,CAAC,MAAM,MAAM,iBAAiB,gBAAgB,aAAa,KAAK,GAAG;AAAA,EACtE,GAAG,CAAA;AACL;AAEA,OAAO,KAAKA,CAAO,EAAE,QAAQ,SAAU1C,GAAK;AAC1C,EAAA0C,EAAQ1C,EAAI,YAAW,CAAE,IAAI0C,EAAQ1C,CAAG;AAC1C,CAAC;AAED,SAAS2C,EAAcC,GAAQxC,GAAO;AAGpC,WAFIyC,IAAQ,MAAMD,CAAM,GAEf9C,IAAI,GAAGA,IAAI8C,GAAQ9C;AAC1B,IAAA+C,EAAM/C,CAAC,IAAIM;AAGb,SAAOyC;AACT;AAQA,SAASC,EAAgBhB,GAAS;AAChC,SAAO,GAAG,OAAOA,EAAQ,IAAI,EAAE,OAAOY,EAAQZ,EAAQ,IAAI,EAAE,IAAI,SAAUiB,GAAG;AAC3E,WAAOjB,EAAQiB,CAAC;AAAA,EAClB,CAAC,EAAE,KAAK,GAAG,CAAC;AACd;AAuBA,SAASC,EAAkBC,GAAUC,GAAU;AAC7C,MAAIC,IAAgB;AAAA,IAClB,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACR,GACMC,IAAgB,CAAC,iBAAiB,gBAAgB,WAAW;AAEjE,MAAIH,EAAS,SAASC,EAAS,QAAQA,EAAS,KAAK,YAAW,MAAO,KAAK;AAC1E,QAAIG,IAAa,CAAA;AACjB,WAAO,KAAKH,CAAQ,EAAE,QAAQ,SAAUI,GAAM;AAC5C,UAAIC,IAASL,EAASI,CAAI,GAEtBE,IAASP,EAASK,CAAI;AAE1B,MAAIE,MAAW,WACTJ,EAAc,SAASE,CAAI,IAC7BE,IAASD,KAGLC,MAAW,UAAaL,EAAcG,CAAI,MAC5CE,IAASP,EAASE,EAAcG,CAAI,CAAC,IAInCE,MAAW,WACbA,IAAS,MAKfH,EAAWC,CAAI,IAAIE;AAAA,IACrB,CAAC,GAEDH,EAAW,OAAOH,EAAS,MAC3BD,IAAWI;AAAA,EACb;AAEA,SAAOJ;AACT;AAeA,SAASQ,EAAalB,GAAcC,GAAYR,GAAc;AAC5D,MAAIC,IAAW,CAAA;AAEf,MAAIO,EAAW,SAAS,OAAOA,EAAW,SAAS,OAAOA,EAAW,SAAS;AAC5E,IAAAP,IAAWA,EAAS,OAAOK,EAAWC,GAAcC,GAAYR,CAAY,CAAC;AAAA,OACxE;AACL,QAAI0B,IAAcrD,EAAS,CAAA,GAAIkC,CAAY;AAG3C,IAAImB,EAAY,SAAS,QACvBA,EAAY,OAAO,MAGrBzB,IAAWA,EAAS,OAAOU,EAAcX,IAAe,CAAC,EAAE,IAAI,WAAY;AACzE,aAAO0B;AAAA,IACT,CAAC,CAAC,GACFzB,EAAS,KAAKO,CAAU;AAAA,EAC1B;AAEA,SAAOP;AACT;AAcA,SAAS0B,EAAOC,GAAkBC,GAAmBC,GAAgB;AAGnE,MAAIC,IAAsBH,EAAiB,SAAS,GAEhDI,IAAuBH,EAAkB,SAAS,GAElDI,IAAeF,IAAsBC,GAKrCE,IAAwBvB,EAAcqB,CAAoB,EAAE,OAAO,SAAUG,GAAOC,GAAGtE,GAAG;AAC5F,QAAIuE,IAAc,KAAK,MAAMJ,IAAenE,CAAC;AAE7C,QAAIgE,KAAkBO,IAAcT,EAAiB,SAAS,KAAKE,EAAeF,EAAiBS,CAAW,GAAGT,EAAiBS,IAAc,CAAC,CAAC,GAAG;AAInJ,UAAIC,IAAoBL,IAAenE,IAAI,IAAI;AAE/C,MAAIqE,EAAME,CAAW,MAMfC,IACED,IAAc,IAChBA,KAAe,IACNA,IAAcT,EAAiB,SAAS,MACjDS,KAAe,KAGRA,IAAcT,EAAiB,SAAS,IACjDS,KAAe,IACNA,IAAc,MACvBA,KAAe;AAAA,IAGrB;AAEA,WAAAF,EAAME,CAAW,KAAKF,EAAME,CAAW,KAAK,KAAK,GAC1CF;AAAA,EACT,GAAG,CAAA,CAAE,GAEDI,IAAWL,EAAsB,OAAO,SAAUK,GAAUvC,GAAclC,GAAG;AAE/E,QAAIA,MAAM8D,EAAiB,SAAS,GAAG;AACrC,UAAIY,IAAoB7B,EAAcX,GAAc3B,EAAS,CAAA,GAAIuD,EAAiBA,EAAiB,SAAS,CAAC,CAAC,CAAC;AAE/G,aAAIY,EAAkB,CAAC,EAAE,SAAS,OAChCA,EAAkB,QAAQ,SAAUJ,GAAG;AACrC,QAAAA,EAAE,OAAO;AAAA,MACX,CAAC,GAGIG,EAAS,OAAOC,CAAiB;AAAA,IAC1C;AAGA,WAAOD,EAAS,OAAOd,EAAaG,EAAiB9D,CAAC,GAAG8D,EAAiB9D,IAAI,CAAC,GAAGkC,CAAY,CAAC;AAAA,EACjG,GAAG,CAAA,CAAE;AAEL,SAAAuC,EAAS,QAAQX,EAAiB,CAAC,CAAC,GAC7BW;AACT;AASA,SAASE,EAAuBL,GAAG;AAQjC,WANIM,KAAUN,KAAK,IAAI,MAAM3B,CAAiB,KAAK,CAAA,GAC/CkC,IAAW,CAAA,GACXC,GACA9C,GAGKhC,IAAI,GAAGA,IAAI4E,EAAO,QAAQ,EAAE5E;AAGnC,QAFA8E,IAAclC,EAAQgC,EAAO5E,CAAC,CAAC,GAE3B8E,GAAa;AACf,MAAA9C,IAAU;AAAA,QACR,MAAM4C,EAAO5E,CAAC;AAAA,MACtB;AAEM,eAAS+E,IAAI,GAAGA,IAAID,EAAY,QAAQ,EAAEC;AACxC,QAAA/C,EAAQ8C,EAAYC,CAAC,CAAC,IAAI,CAACH,EAAO5E,IAAI+E,IAAI,CAAC;AAK7C,MAAA/E,KAAK8E,EAAY,QACjBD,EAAS,KAAK7C,CAAO;AAAA,IACvB;AAGF,SAAO6C;AACT;AAqBA,SAASG,EAAwBC,GAAgBC,GAAgBC,GAAoB;AAEnF,MAAIC,IAAYH,KAAkB,OAAO,CAAA,IAAKA,EAAe,MAAK,GAC9DI,IAAYH,KAAkB,OAAO,CAAA,IAAKA,EAAe,MAAK,GAE9DI,IAAOlF,EAAQ+E,CAAkB,MAAM,WAAWA,IAAqB;AAAA,IACzE,gBAAgBA;AAAA,IAChB,iBAAiB;AAAA,EACrB,GACMnB,IAAiBsB,EAAK,gBACtBC,IAAkBD,EAAK;AAG3B,MAAI,CAACF,EAAU,UAAU,CAACC,EAAU;AAClC,WAAO,WAA4B;AACjC,aAAO,CAAA;AAAA,IACT;AAIF,MAAIG,KAAQJ,EAAU,WAAW,KAAKA,EAAUA,EAAU,SAAS,CAAC,EAAE,SAAS,SAASC,EAAU,WAAW,KAAKA,EAAUA,EAAU,SAAS,CAAC,EAAE,SAAS;AAE3J,EAAID,EAAU,SAAS,KAAKA,EAAUA,EAAU,SAAS,CAAC,EAAE,SAAS,OACnEA,EAAU,IAAG,GAGXC,EAAU,SAAS,KAAKA,EAAUA,EAAU,SAAS,CAAC,EAAE,SAAS,OACnEA,EAAU,IAAG,GAKVD,EAAU,SAGHC,EAAU,UACpBA,EAAU,KAAKD,EAAU,CAAC,CAAC,IAH3BA,EAAU,KAAKC,EAAU,CAAC,CAAC;AAO7B,MAAII,IAAoB,KAAK,IAAIJ,EAAU,SAASD,EAAU,MAAM;AAEpE,EAAIK,MAAsB,MAEpBJ,EAAU,SAASD,EAAU,SAC/BA,IAAYvB,EAAOuB,GAAWC,GAAWrB,CAAc,IAC9CqB,EAAU,SAASD,EAAU,WACtCC,IAAYxB,EAAOwB,GAAWD,GAAWpB,CAAc,KAM3DoB,IAAYA,EAAU,IAAI,SAAUjC,GAAUnD,GAAG;AAC/C,WAAOkD,EAAkBC,GAAUkC,EAAUrF,CAAC,CAAC;AAAA,EACjD,CAAC;AAED,MAAI0F,IAAuBN,EAAU,IAAI,SAAUjC,GAAU;AAC3D,WAAOrD,EAAe,CAAA,GAAIqD,CAAQ;AAAA,EACpC,CAAC;AAED,SAAIqC,MACFE,EAAqB,KAAK;AAAA,IACxB,MAAM;AAAA,EACZ,CAAK,GACDN,EAAU,KAAK;AAAA,IACb,MAAM;AAAA,EACZ,CAAK,IAGI,SAAiC1D,GAAG;AAEzC,QAAIA,MAAM,KAAK6D;AACb,aAAOL,KAAyB,CAAA;AAIlC,QAAIxD,MAAM;AACR,aAAO0D;AAIT,aAASpF,IAAI,GAAGA,IAAI0F,EAAqB,QAAQ,EAAE1F,GAAG;AAEpD,UAAImD,IAAWiC,EAAUpF,CAAC,GACtBoD,IAAWiC,EAAUrF,CAAC,GACtB2F,IAAsBD,EAAqB1F,CAAC,GAE5C4F,IAAY7E,EAA2B6B,EAAQ+C,EAAoB,IAAI,CAAC,GACxEE;AAEJ,UAAI;AACF,aAAKD,EAAU,EAAC,GAAI,EAAEC,IAAQD,EAAU,EAAC,GAAI,QAAO;AAClD,cAAIE,IAAMD,EAAM;AAChB,UAAAF,EAAoBG,CAAG,KAAK,IAAIpE,KAAKyB,EAAS2C,CAAG,IAAIpE,IAAI0B,EAAS0C,CAAG,IAEjEA,MAAQ,kBAAkBA,MAAQ,iBACpCH,EAAoBG,CAAG,IAAI,KAAK,MAAMH,EAAoBG,CAAG,CAAC;AAAA,QAElE;AAAA,MACF,SAASxE,GAAK;AACZ,QAAAsE,EAAU,EAAEtE,CAAG;AAAA,MACjB,UAAC;AACC,QAAAsE,EAAU,EAAC;AAAA,MACb;AAAA,IACF;AAEA,WAAOF;AAAA,EACT;AACF;AAuBA,SAASK,EAAgBhB,GAAGiB,GAAGb,GAAoB;AACjD,MAAIC,IAAYT,EAAuBI,CAAC,GACpCM,IAAYV,EAAuBqB,CAAC,GAEpCC,IAAQ7F,EAAQ+E,CAAkB,MAAM,WAAWA,IAAqB;AAAA,IAC1E,gBAAgBA;AAAA,IAChB,iBAAiB;AAAA,EACrB,GACMnB,IAAiBiC,EAAM,gBACvBV,IAAkBU,EAAM;AAE5B,MAAI,CAACb,EAAU,UAAU,CAACC,EAAU;AAClC,WAAO,WAA4B;AACjC,aAAO;AAAA,IACT;AAGF,MAAIa,IAAsBlB,EAAwBI,GAAWC,GAAW;AAAA,IACtE,gBAAgBrB;AAAA,IAChB,iBAAiBuB;AAAA,EACrB,CAAG;AACD,SAAO,SAAgC7D,GAAG;AAExC,QAAIA,MAAM,KAAK6D;AACb,aAAOS,KAAY;AAGrB,QAAIN,IAAuBQ,EAAoBxE,CAAC,GAE5CyE,IAAqB,IAErBC,IAAarF,EAA2B2E,CAAoB,GAC5DW;AAEJ,QAAI;AACF,WAAKD,EAAW,EAAC,GAAI,EAAEC,IAASD,EAAW,EAAC,GAAI,QAAO;AACrD,YAAIT,IAAsBU,EAAO;AACjC,QAAAF,KAAsBnD,EAAgB2C,CAAmB;AAAA,MAC3D;AAAA,IACF,SAASrE,GAAK;AACZ,MAAA8E,EAAW,EAAE9E,CAAG;AAAA,IAClB,UAAC;AACC,MAAA8E,EAAW,EAAC;AAAA,IACd;AAEA,WAAOD;AAAA,EACT;AACF;","x_google_ignoreList":[0]}

package/dist/chunks/vendor-d3-path-DJOTitNW.js

@@ -0,0 +1,64 @@
+const x = Math.PI, c = 2 * x, d = 1e-6, P = c - d;
+function E(l) {
+  this._ += l[0];
+  for (let t = 1, h = l.length; t < h; ++t)
+    this._ += arguments[t] + l[t];
+}
+function m(l) {
+  let t = Math.floor(l);
+  if (!(t >= 0)) throw new Error(`invalid digits: ${l}`);
+  if (t > 15) return E;
+  const h = 10 ** t;
+  return function(i) {
+    this._ += i[0];
+    for (let s = 1, _ = i.length; s < _; ++s)
+      this._ += Math.round(arguments[s] * h) / h + i[s];
+  };
+}
+class q {
+  constructor(t) {
+    this._x0 = this._y0 = // start of current subpath
+    this._x1 = this._y1 = null, this._ = "", this._append = t == null ? E : m(t);
+  }
+  moveTo(t, h) {
+    this._append`M${this._x0 = this._x1 = +t},${this._y0 = this._y1 = +h}`;
+  }
+  closePath() {
+    this._x1 !== null && (this._x1 = this._x0, this._y1 = this._y0, this._append`Z`);
+  }
+  lineTo(t, h) {
+    this._append`L${this._x1 = +t},${this._y1 = +h}`;
+  }
+  quadraticCurveTo(t, h, i, s) {
+    this._append`Q${+t},${+h},${this._x1 = +i},${this._y1 = +s}`;
+  }
+  bezierCurveTo(t, h, i, s, _, n) {
+    this._append`C${+t},${+h},${+i},${+s},${this._x1 = +_},${this._y1 = +n}`;
+  }
+  arcTo(t, h, i, s, _) {
+    if (t = +t, h = +h, i = +i, s = +s, _ = +_, _ < 0) throw new Error(`negative radius: ${_}`);
+    let n = this._x1, u = this._y1, o = i - t, a = s - h, e = n - t, p = u - h, $ = e * e + p * p;
+    if (this._x1 === null)
+      this._append`M${this._x1 = t},${this._y1 = h}`;
+    else if ($ > d) if (!(Math.abs(p * o - a * e) > d) || !_)
+      this._append`L${this._x1 = t},${this._y1 = h}`;
+    else {
+      let f = i - n, M = s - u, y = o * o + a * a, L = f * f + M * M, v = Math.sqrt(y), b = Math.sqrt($), T = _ * Math.tan((x - Math.acos((y + $ - L) / (2 * v * b))) / 2), r = T / b, A = T / v;
+      Math.abs(r - 1) > d && this._append`L${t + r * e},${h + r * p}`, this._append`A${_},${_},0,0,${+(p * f > e * M)},${this._x1 = t + A * o},${this._y1 = h + A * a}`;
+    }
+  }
+  arc(t, h, i, s, _, n) {
+    if (t = +t, h = +h, i = +i, n = !!n, i < 0) throw new Error(`negative radius: ${i}`);
+    let u = i * Math.cos(s), o = i * Math.sin(s), a = t + u, e = h + o, p = 1 ^ n, $ = n ? s - _ : _ - s;
+    this._x1 === null ? this._append`M${a},${e}` : (Math.abs(this._x1 - a) > d || Math.abs(this._y1 - e) > d) && this._append`L${a},${e}`, i && ($ < 0 && ($ = $ % c + c), $ > P ? this._append`A${i},${i},0,1,${p},${t - u},${h - o}A${i},${i},0,1,${p},${this._x1 = a},${this._y1 = e}` : $ > d && this._append`A${i},${i},0,${+($ >= x)},${p},${this._x1 = t + i * Math.cos(_)},${this._y1 = h + i * Math.sin(_)}`);
+  }
+  rect(t, h, i, s) {
+    this._append`M${this._x0 = this._x1 = +t},${this._y0 = this._y1 = +h}h${i = +i}v${+s}h${-i}Z`;
+  }
+  toString() {
+    return this._;
+  }
+}
+export {
+  q as P
+};

package/dist/chunks/vendor-d3-path-DJOTitNW.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-d3-path-DJOTitNW.js","sources":["../../../node_modules/d3-path/src/path.js"],"sourcesContent":["const pi = Math.PI,\n    tau = 2 * pi,\n    epsilon = 1e-6,\n    tauEpsilon = tau - epsilon;\n\nfunction append(strings) {\n  this._ += strings[0];\n  for (let i = 1, n = strings.length; i < n; ++i) {\n    this._ += arguments[i] + strings[i];\n  }\n}\n\nfunction appendRound(digits) {\n  let d = Math.floor(digits);\n  if (!(d >= 0)) throw new Error(`invalid digits: ${digits}`);\n  if (d > 15) return append;\n  const k = 10 ** d;\n  return function(strings) {\n    this._ += strings[0];\n    for (let i = 1, n = strings.length; i < n; ++i) {\n      this._ += Math.round(arguments[i] * k) / k + strings[i];\n    }\n  };\n}\n\nexport class Path {\n  constructor(digits) {\n    this._x0 = this._y0 = // start of current subpath\n    this._x1 = this._y1 = null; // end of current subpath\n    this._ = \"\";\n    this._append = digits == null ? append : appendRound(digits);\n  }\n  moveTo(x, y) {\n    this._append`M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}`;\n  }\n  closePath() {\n    if (this._x1 !== null) {\n      this._x1 = this._x0, this._y1 = this._y0;\n      this._append`Z`;\n    }\n  }\n  lineTo(x, y) {\n    this._append`L${this._x1 = +x},${this._y1 = +y}`;\n  }\n  quadraticCurveTo(x1, y1, x, y) {\n    this._append`Q${+x1},${+y1},${this._x1 = +x},${this._y1 = +y}`;\n  }\n  bezierCurveTo(x1, y1, x2, y2, x, y) {\n    this._append`C${+x1},${+y1},${+x2},${+y2},${this._x1 = +x},${this._y1 = +y}`;\n  }\n  arcTo(x1, y1, x2, y2, r) {\n    x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(`negative radius: ${r}`);\n\n    let x0 = this._x1,\n        y0 = this._y1,\n        x21 = x2 - x1,\n        y21 = y2 - y1,\n        x01 = x0 - x1,\n        y01 = y0 - y1,\n        l01_2 = x01 * x01 + y01 * y01;\n\n    // Is this path empty? Move to (x1,y1).\n    if (this._x1 === null) {\n      this._append`M${this._x1 = x1},${this._y1 = y1}`;\n    }\n\n    // Or, is (x1,y1) coincident with (x0,y0)? Do nothing.\n    else if (!(l01_2 > epsilon));\n\n    // Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?\n    // Equivalently, is (x1,y1) coincident with (x2,y2)?\n    // Or, is the radius zero? Line to (x1,y1).\n    else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon) || !r) {\n      this._append`L${this._x1 = x1},${this._y1 = y1}`;\n    }\n\n    // Otherwise, draw an arc!\n    else {\n      let x20 = x2 - x0,\n          y20 = y2 - y0,\n          l21_2 = x21 * x21 + y21 * y21,\n          l20_2 = x20 * x20 + y20 * y20,\n          l21 = Math.sqrt(l21_2),\n          l01 = Math.sqrt(l01_2),\n          l = r * Math.tan((pi - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2),\n          t01 = l / l01,\n          t21 = l / l21;\n\n      // If the start tangent is not coincident with (x0,y0), line to.\n      if (Math.abs(t01 - 1) > epsilon) {\n        this._append`L${x1 + t01 * x01},${y1 + t01 * y01}`;\n      }\n\n      this._append`A${r},${r},0,0,${+(y01 * x20 > x01 * y20)},${this._x1 = x1 + t21 * x21},${this._y1 = y1 + t21 * y21}`;\n    }\n  }\n  arc(x, y, r, a0, a1, ccw) {\n    x = +x, y = +y, r = +r, ccw = !!ccw;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(`negative radius: ${r}`);\n\n    let dx = r * Math.cos(a0),\n        dy = r * Math.sin(a0),\n        x0 = x + dx,\n        y0 = y + dy,\n        cw = 1 ^ ccw,\n        da = ccw ? a0 - a1 : a1 - a0;\n\n    // Is this path empty? Move to (x0,y0).\n    if (this._x1 === null) {\n      this._append`M${x0},${y0}`;\n    }\n\n    // Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).\n    else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {\n      this._append`L${x0},${y0}`;\n    }\n\n    // Is this arc empty? We’re done.\n    if (!r) return;\n\n    // Does the angle go the wrong way? Flip the direction.\n    if (da < 0) da = da % tau + tau;\n\n    // Is this a complete circle? Draw two arcs to complete the circle.\n    if (da > tauEpsilon) {\n      this._append`A${r},${r},0,1,${cw},${x - dx},${y - dy}A${r},${r},0,1,${cw},${this._x1 = x0},${this._y1 = y0}`;\n    }\n\n    // Is this arc non-empty? Draw an arc!\n    else if (da > epsilon) {\n      this._append`A${r},${r},0,${+(da >= pi)},${cw},${this._x1 = x + r * Math.cos(a1)},${this._y1 = y + r * Math.sin(a1)}`;\n    }\n  }\n  rect(x, y, w, h) {\n    this._append`M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}h${w = +w}v${+h}h${-w}Z`;\n  }\n  toString() {\n    return this._;\n  }\n}\n\nexport function path() {\n  return new Path;\n}\n\n// Allow instanceof d3.path\npath.prototype = Path.prototype;\n\nexport function pathRound(digits = 3) {\n  return new Path(+digits);\n}\n"],"names":["pi","tau","epsilon","tauEpsilon","append","strings","i","n","appendRound","digits","d","k","Path","x","y","x1","y1","x2","y2","r","x0","y0","x21","y21","x01","y01","l01_2","x20","y20","l21_2","l20_2","l21","l01","l","t01","t21","a0","a1","ccw","dx","dy","cw","da","w","h"],"mappings":"AAAA,MAAMA,IAAK,KAAK,IACZC,IAAM,IAAID,GACVE,IAAU,MACVC,IAAaF,IAAMC;AAEvB,SAASE,EAAOC,GAAS;AACvB,OAAK,KAAKA,EAAQ,CAAC;AACnB,WAASC,IAAI,GAAGC,IAAIF,EAAQ,QAAQC,IAAIC,GAAG,EAAED;AAC3C,SAAK,KAAK,UAAUA,CAAC,IAAID,EAAQC,CAAC;AAEtC;AAEA,SAASE,EAAYC,GAAQ;AAC3B,MAAIC,IAAI,KAAK,MAAMD,CAAM;AACzB,MAAI,EAAEC,KAAK,GAAI,OAAM,IAAI,MAAM,mBAAmBD,CAAM,EAAE;AAC1D,MAAIC,IAAI,GAAI,QAAON;AACnB,QAAMO,IAAI,MAAMD;AAChB,SAAO,SAASL,GAAS;AACvB,SAAK,KAAKA,EAAQ,CAAC;AACnB,aAASC,IAAI,GAAGC,IAAIF,EAAQ,QAAQC,IAAIC,GAAG,EAAED;AAC3C,WAAK,KAAK,KAAK,MAAM,UAAUA,CAAC,IAAIK,CAAC,IAAIA,IAAIN,EAAQC,CAAC;AAAA,EAE1D;AACF;AAEO,MAAMM,EAAK;AAAA,EAChB,YAAYH,GAAQ;AAClB,SAAK,MAAM,KAAK;AAAA,IAChB,KAAK,MAAM,KAAK,MAAM,MACtB,KAAK,IAAI,IACT,KAAK,UAAUA,KAAU,OAAOL,IAASI,EAAYC,CAAM;AAAA,EAC7D;AAAA,EACA,OAAOI,GAAGC,GAAG;AACX,SAAK,WAAW,KAAK,MAAM,KAAK,MAAM,CAACD,CAAC,IAAI,KAAK,MAAM,KAAK,MAAM,CAACC,CAAC;AAAA,EACtE;AAAA,EACA,YAAY;AACV,IAAI,KAAK,QAAQ,SACf,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KACrC,KAAK;AAAA,EAET;AAAA,EACA,OAAOD,GAAGC,GAAG;AACX,SAAK,WAAW,KAAK,MAAM,CAACD,CAAC,IAAI,KAAK,MAAM,CAACC,CAAC;AAAA,EAChD;AAAA,EACA,iBAAiBC,GAAIC,GAAIH,GAAGC,GAAG;AAC7B,SAAK,WAAW,CAACC,CAAE,IAAI,CAACC,CAAE,IAAI,KAAK,MAAM,CAACH,CAAC,IAAI,KAAK,MAAM,CAACC,CAAC;AAAA,EAC9D;AAAA,EACA,cAAcC,GAAIC,GAAIC,GAAIC,GAAIL,GAAGC,GAAG;AAClC,SAAK,WAAW,CAACC,CAAE,IAAI,CAACC,CAAE,IAAI,CAACC,CAAE,IAAI,CAACC,CAAE,IAAI,KAAK,MAAM,CAACL,CAAC,IAAI,KAAK,MAAM,CAACC,CAAC;AAAA,EAC5E;AAAA,EACA,MAAMC,GAAIC,GAAIC,GAAIC,GAAIC,GAAG;AAIvB,QAHAJ,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAI,CAACA,GAGzCA,IAAI,EAAG,OAAM,IAAI,MAAM,oBAAoBA,CAAC,EAAE;AAElD,QAAIC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAML,IAAKF,GACXQ,IAAML,IAAKF,GACXQ,IAAMJ,IAAKL,GACXU,IAAMJ,IAAKL,GACXU,IAAQF,IAAMA,IAAMC,IAAMA;AAG9B,QAAI,KAAK,QAAQ;AACf,WAAK,WAAW,KAAK,MAAMV,CAAE,IAAI,KAAK,MAAMC,CAAE;AAAA,aAIrCU,IAAQxB,EAKd,KAAI,EAAE,KAAK,IAAIuB,IAAMH,IAAMC,IAAMC,CAAG,IAAItB,MAAY,CAACiB;AACxD,WAAK,WAAW,KAAK,MAAMJ,CAAE,IAAI,KAAK,MAAMC,CAAE;AAAA,SAI3C;AACH,UAAIW,IAAMV,IAAKG,GACXQ,IAAMV,IAAKG,GACXQ,IAAQP,IAAMA,IAAMC,IAAMA,GAC1BO,IAAQH,IAAMA,IAAMC,IAAMA,GAC1BG,IAAM,KAAK,KAAKF,CAAK,GACrBG,IAAM,KAAK,KAAKN,CAAK,GACrBO,IAAId,IAAI,KAAK,KAAKnB,IAAK,KAAK,MAAM6B,IAAQH,IAAQI,MAAU,IAAIC,IAAMC,EAAI,KAAK,CAAC,GAChFE,IAAMD,IAAID,GACVG,IAAMF,IAAIF;AAGd,MAAI,KAAK,IAAIG,IAAM,CAAC,IAAIhC,KACtB,KAAK,WAAWa,IAAKmB,IAAMV,CAAG,IAAIR,IAAKkB,IAAMT,CAAG,IAGlD,KAAK,WAAWN,CAAC,IAAIA,CAAC,QAAQ,EAAEM,IAAME,IAAMH,IAAMI,EAAI,IAAI,KAAK,MAAMb,IAAKoB,IAAMb,CAAG,IAAI,KAAK,MAAMN,IAAKmB,IAAMZ,CAAG;AAAA,IAClH;AAAA,EACF;AAAA,EACA,IAAIV,GAAGC,GAAGK,GAAGiB,GAAIC,GAAIC,GAAK;AAIxB,QAHAzB,IAAI,CAACA,GAAGC,IAAI,CAACA,GAAGK,IAAI,CAACA,GAAGmB,IAAM,CAAC,CAACA,GAG5BnB,IAAI,EAAG,OAAM,IAAI,MAAM,oBAAoBA,CAAC,EAAE;AAElD,QAAIoB,IAAKpB,IAAI,KAAK,IAAIiB,CAAE,GACpBI,IAAKrB,IAAI,KAAK,IAAIiB,CAAE,GACpBhB,IAAKP,IAAI0B,GACTlB,IAAKP,IAAI0B,GACTC,IAAK,IAAIH,GACTI,IAAKJ,IAAMF,IAAKC,IAAKA,IAAKD;AAa9B,IAVI,KAAK,QAAQ,OACf,KAAK,WAAWhB,CAAE,IAAIC,CAAE,MAIjB,KAAK,IAAI,KAAK,MAAMD,CAAE,IAAIlB,KAAW,KAAK,IAAI,KAAK,MAAMmB,CAAE,IAAInB,MACtE,KAAK,WAAWkB,CAAE,IAAIC,CAAE,IAIrBF,MAGDuB,IAAK,MAAGA,IAAKA,IAAKzC,IAAMA,IAGxByC,IAAKvC,IACP,KAAK,WAAWgB,CAAC,IAAIA,CAAC,QAAQsB,CAAE,IAAI5B,IAAI0B,CAAE,IAAIzB,IAAI0B,CAAE,IAAIrB,CAAC,IAAIA,CAAC,QAAQsB,CAAE,IAAI,KAAK,MAAMrB,CAAE,IAAI,KAAK,MAAMC,CAAE,KAInGqB,IAAKxC,KACZ,KAAK,WAAWiB,CAAC,IAAIA,CAAC,MAAM,EAAEuB,KAAM1C,EAAG,IAAIyC,CAAE,IAAI,KAAK,MAAM5B,IAAIM,IAAI,KAAK,IAAIkB,CAAE,CAAC,IAAI,KAAK,MAAMvB,IAAIK,IAAI,KAAK,IAAIkB,CAAE,CAAC;AAAA,EAEvH;AAAA,EACA,KAAKxB,GAAGC,GAAG6B,GAAGC,GAAG;AACf,SAAK,WAAW,KAAK,MAAM,KAAK,MAAM,CAAC/B,CAAC,IAAI,KAAK,MAAM,KAAK,MAAM,CAACC,CAAC,IAAI6B,IAAI,CAACA,CAAC,IAAI,CAACC,CAAC,IAAI,CAACD,CAAC;AAAA,EAC5F;AAAA,EACA,WAAW;AACT,WAAO,KAAK;AAAA,EACd;AACF;","x_google_ignoreList":[0]}

package/dist/chunks/vendor-d3-quadtree-l0sNRNKZ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-d3-quadtree-l0sNRNKZ.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/chunks/vendor-d3-sankey-l0sNRNKZ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-d3-sankey-l0sNRNKZ.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}