@performant-software/visualize 2.1.0-beta.43 → 2.1.0-beta.44

package/dist/index.es79.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es79.js","sources":["../../../node_modules/@visx/zoom/esm/util/matrix.js"],"sourcesContent":["export function identityMatrix() {\n  return {\n    scaleX: 1,\n    scaleY: 1,\n    translateX: 0,\n    translateY: 0,\n    skewX: 0,\n    skewY: 0\n  };\n}\nexport function createMatrix(_ref) {\n  var _ref$scaleX = _ref.scaleX,\n    scaleX = _ref$scaleX === void 0 ? 1 : _ref$scaleX,\n    _ref$scaleY = _ref.scaleY,\n    scaleY = _ref$scaleY === void 0 ? 1 : _ref$scaleY,\n    _ref$translateX = _ref.translateX,\n    translateX = _ref$translateX === void 0 ? 0 : _ref$translateX,\n    _ref$translateY = _ref.translateY,\n    translateY = _ref$translateY === void 0 ? 0 : _ref$translateY,\n    _ref$skewX = _ref.skewX,\n    skewX = _ref$skewX === void 0 ? 0 : _ref$skewX,\n    _ref$skewY = _ref.skewY,\n    skewY = _ref$skewY === void 0 ? 0 : _ref$skewY;\n  return {\n    scaleX: scaleX,\n    scaleY: scaleY,\n    translateX: translateX,\n    translateY: translateY,\n    skewX: skewX,\n    skewY: skewY\n  };\n}\nexport function inverseMatrix(_ref2) {\n  var scaleX = _ref2.scaleX,\n    scaleY = _ref2.scaleY,\n    translateX = _ref2.translateX,\n    translateY = _ref2.translateY,\n    skewX = _ref2.skewX,\n    skewY = _ref2.skewY;\n  var denominator = scaleX * scaleY - skewY * skewX;\n  return {\n    scaleX: scaleY / denominator,\n    scaleY: scaleX / denominator,\n    translateX: (scaleY * translateX - skewX * translateY) / -denominator,\n    translateY: (skewY * translateX - scaleX * translateY) / denominator,\n    skewX: skewX / -denominator,\n    skewY: skewY / -denominator\n  };\n}\nexport function applyMatrixToPoint(matrix, _ref3) {\n  var x = _ref3.x,\n    y = _ref3.y;\n  return {\n    x: matrix.scaleX * x + matrix.skewX * y + matrix.translateX,\n    y: matrix.skewY * x + matrix.scaleY * y + matrix.translateY\n  };\n}\nexport function applyInverseMatrixToPoint(matrix, _ref4) {\n  var x = _ref4.x,\n    y = _ref4.y;\n  return applyMatrixToPoint(inverseMatrix(matrix), {\n    x: x,\n    y: y\n  });\n}\nexport function scaleMatrix(scaleX, maybeScaleY) {\n  if (maybeScaleY === void 0) {\n    maybeScaleY = undefined;\n  }\n  var scaleY = maybeScaleY || scaleX;\n  return createMatrix({\n    scaleX: scaleX,\n    scaleY: scaleY\n  });\n}\nexport function translateMatrix(translateX, translateY) {\n  return createMatrix({\n    translateX: translateX,\n    translateY: translateY\n  });\n}\nexport function multiplyMatrices(matrix1, matrix2) {\n  return {\n    scaleX: matrix1.scaleX * matrix2.scaleX + matrix1.skewX * matrix2.skewY,\n    scaleY: matrix1.skewY * matrix2.skewX + matrix1.scaleY * matrix2.scaleY,\n    translateX: matrix1.scaleX * matrix2.translateX + matrix1.skewX * matrix2.translateY + matrix1.translateX,\n    translateY: matrix1.skewY * matrix2.translateX + matrix1.scaleY * matrix2.translateY + matrix1.translateY,\n    skewX: matrix1.scaleX * matrix2.skewX + matrix1.skewX * matrix2.scaleY,\n    skewY: matrix1.skewY * matrix2.scaleX + matrix1.scaleY * matrix2.skewY\n  };\n}\nexport function composeMatrices() {\n  for (var _len = arguments.length, matrices = new Array(_len), _key = 0; _key < _len; _key++) {\n    matrices[_key] = arguments[_key];\n  }\n  switch (matrices.length) {\n    case 0:\n      throw new Error('composeMatrices() requires arguments: was called with no args');\n    case 1:\n      return matrices[0];\n    case 2:\n      return multiplyMatrices(matrices[0], matrices[1]);\n    default:\n      {\n        var matrix1 = matrices[0],\n          matrix2 = matrices[1],\n          restMatrices = matrices.slice(2);\n        var matrix = multiplyMatrices(matrix1, matrix2);\n        return composeMatrices.apply(void 0, [matrix].concat(restMatrices));\n      }\n  }\n}"],"names":["identityMatrix","createMatrix","_ref","_ref$scaleX","scaleX","_ref$scaleY","scaleY","_ref$translateX","translateX","_ref$translateY","translateY","_ref$skewX","skewX","_ref$skewY","skewY","inverseMatrix","_ref2","denominator","applyMatrixToPoint","matrix","_ref3","x","y","applyInverseMatrixToPoint","_ref4","scaleMatrix","maybeScaleY","translateMatrix","multiplyMatrices","matrix1","matrix2","composeMatrices","_len","matrices","_key","restMatrices"],"mappings":"AAAO,SAASA,IAAiB;AACxB,SAAA;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,OAAO;AAAA,IACP,OAAO;AAAA,EAAA;AAEX;AACO,SAASC,EAAaC,GAAM;AAC7B,MAAAC,IAAcD,EAAK,QACrBE,IAASD,MAAgB,SAAS,IAAIA,GACtCE,IAAcH,EAAK,QACnBI,IAASD,MAAgB,SAAS,IAAIA,GACtCE,IAAkBL,EAAK,YACvBM,IAAaD,MAAoB,SAAS,IAAIA,GAC9CE,IAAkBP,EAAK,YACvBQ,IAAaD,MAAoB,SAAS,IAAIA,GAC9CE,IAAaT,EAAK,OAClBU,IAAQD,MAAe,SAAS,IAAIA,GACpCE,IAAaX,EAAK,OAClBY,IAAQD,MAAe,SAAS,IAAIA;AAC/B,SAAA;AAAA,IACL,QAAAT;AAAA,IACA,QAAAE;AAAA,IACA,YAAAE;AAAA,IACA,YAAAE;AAAA,IACA,OAAAE;AAAA,IACA,OAAAE;AAAA,EAAA;AAEJ;AACO,SAASC,EAAcC,GAAO;AACnC,MAAIZ,IAASY,EAAM,QACjBV,IAASU,EAAM,QACfR,IAAaQ,EAAM,YACnBN,IAAaM,EAAM,YACnBJ,IAAQI,EAAM,OACdF,IAAQE,EAAM,OACZC,IAAcb,IAASE,IAASQ,IAAQF;AACrC,SAAA;AAAA,IACL,QAAQN,IAASW;AAAA,IACjB,QAAQb,IAASa;AAAA,IACjB,aAAaX,IAASE,IAAaI,IAAQF,KAAc,CAACO;AAAA,IAC1D,aAAaH,IAAQN,IAAaJ,IAASM,KAAcO;AAAA,IACzD,OAAOL,IAAQ,CAACK;AAAA,IAChB,OAAOH,IAAQ,CAACG;AAAA,EAAA;AAEpB;AACgB,SAAAC,EAAmBC,GAAQC,GAAO;AAChD,MAAIC,IAAID,EAAM,GACZE,IAAIF,EAAM;AACL,SAAA;AAAA,IACL,GAAGD,EAAO,SAASE,IAAIF,EAAO,QAAQG,IAAIH,EAAO;AAAA,IACjD,GAAGA,EAAO,QAAQE,IAAIF,EAAO,SAASG,IAAIH,EAAO;AAAA,EAAA;AAErD;AACgB,SAAAI,EAA0BJ,GAAQK,GAAO;AACvD,MAAIH,IAAIG,EAAM,GACZF,IAAIE,EAAM;AACL,SAAAN,EAAmBH,EAAcI,CAAM,GAAG;AAAA,IAC/C,GAAAE;AAAA,IACA,GAAAC;AAAA,EAAA,CACD;AACH;AACgB,SAAAG,EAAYrB,GAAQsB,GAAa;AAC/C,EAAIA,MAAgB,WACJA,IAAA;AAEhB,MAAIpB,IAASoB,KAAetB;AAC5B,SAAOH,EAAa;AAAA,IAClB,QAAAG;AAAA,IACA,QAAAE;AAAA,EAAA,CACD;AACH;AACgB,SAAAqB,EAAgBnB,GAAYE,GAAY;AACtD,SAAOT,EAAa;AAAA,IAClB,YAAAO;AAAA,IACA,YAAAE;AAAA,EAAA,CACD;AACH;AACgB,SAAAkB,EAAiBC,GAASC,GAAS;AAC1C,SAAA;AAAA,IACL,QAAQD,EAAQ,SAASC,EAAQ,SAASD,EAAQ,QAAQC,EAAQ;AAAA,IAClE,QAAQD,EAAQ,QAAQC,EAAQ,QAAQD,EAAQ,SAASC,EAAQ;AAAA,IACjE,YAAYD,EAAQ,SAASC,EAAQ,aAAaD,EAAQ,QAAQC,EAAQ,aAAaD,EAAQ;AAAA,IAC/F,YAAYA,EAAQ,QAAQC,EAAQ,aAAaD,EAAQ,SAASC,EAAQ,aAAaD,EAAQ;AAAA,IAC/F,OAAOA,EAAQ,SAASC,EAAQ,QAAQD,EAAQ,QAAQC,EAAQ;AAAA,IAChE,OAAOD,EAAQ,QAAQC,EAAQ,SAASD,EAAQ,SAASC,EAAQ;AAAA,EAAA;AAErE;AACO,SAASC,IAAkB;AAChC,WAASC,IAAO,UAAU,QAAQC,IAAW,IAAI,MAAMD,CAAI,GAAGE,IAAO,GAAGA,IAAOF,GAAME;AAC1E,IAAAD,EAAAC,CAAI,IAAI,UAAUA,CAAI;AAEjC,UAAQD,EAAS,QAAQ;AAAA,IACvB,KAAK;AACG,YAAA,IAAI,MAAM,+DAA+D;AAAA,IACjF,KAAK;AACH,aAAOA,EAAS,CAAC;AAAA,IACnB,KAAK;AACH,aAAOL,EAAiBK,EAAS,CAAC,GAAGA,EAAS,CAAC,CAAC;AAAA,IAClD,SACE;AACM,UAAAJ,IAAUI,EAAS,CAAC,GACtBH,IAAUG,EAAS,CAAC,GACpBE,IAAeF,EAAS,MAAM,CAAC,GAC7Bd,IAASS,EAAiBC,GAASC,CAAO;AACvC,aAAAC,EAAgB,MAAM,QAAQ,CAACZ,CAAM,EAAE,OAAOgB,CAAY,CAAC;AAAA,IACpE;AAAA,EACJ;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es79.js","sources":["../../../node_modules/d3-hierarchy/src/tree.js"],"sourcesContent":["import {Node} from \"./hierarchy/index.js\";\n\nfunction defaultSeparation(a, b) {\n  return a.parent === b.parent ? 1 : 2;\n}\n\n// function radialSeparation(a, b) {\n//   return (a.parent === b.parent ? 1 : 2) / a.depth;\n// }\n\n// This function is used to traverse the left contour of a subtree (or\n// subforest). It returns the successor of v on this contour. This successor is\n// either given by the leftmost child of v or by the thread of v. The function\n// returns null if and only if v is on the highest level of its subtree.\nfunction nextLeft(v) {\n  var children = v.children;\n  return children ? children[0] : v.t;\n}\n\n// This function works analogously to nextLeft.\nfunction nextRight(v) {\n  var children = v.children;\n  return children ? children[children.length - 1] : v.t;\n}\n\n// Shifts the current subtree rooted at w+. This is done by increasing\n// prelim(w+) and mod(w+) by shift.\nfunction moveSubtree(wm, wp, shift) {\n  var change = shift / (wp.i - wm.i);\n  wp.c -= change;\n  wp.s += shift;\n  wm.c += change;\n  wp.z += shift;\n  wp.m += shift;\n}\n\n// All other shifts, applied to the smaller subtrees between w- and w+, are\n// performed by this function. To prepare the shifts, we have to adjust\n// change(w+), shift(w+), and change(w-).\nfunction executeShifts(v) {\n  var shift = 0,\n      change = 0,\n      children = v.children,\n      i = children.length,\n      w;\n  while (--i >= 0) {\n    w = children[i];\n    w.z += shift;\n    w.m += shift;\n    shift += w.s + (change += w.c);\n  }\n}\n\n// If vi-’s ancestor is a sibling of v, returns vi-’s ancestor. Otherwise,\n// returns the specified (default) ancestor.\nfunction nextAncestor(vim, v, ancestor) {\n  return vim.a.parent === v.parent ? vim.a : ancestor;\n}\n\nfunction TreeNode(node, i) {\n  this._ = node;\n  this.parent = null;\n  this.children = null;\n  this.A = null; // default ancestor\n  this.a = this; // ancestor\n  this.z = 0; // prelim\n  this.m = 0; // mod\n  this.c = 0; // change\n  this.s = 0; // shift\n  this.t = null; // thread\n  this.i = i; // number\n}\n\nTreeNode.prototype = Object.create(Node.prototype);\n\nfunction treeRoot(root) {\n  var tree = new TreeNode(root, 0),\n      node,\n      nodes = [tree],\n      child,\n      children,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if (children = node._.children) {\n      node.children = new Array(n = children.length);\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = node.children[i] = new TreeNode(children[i], i));\n        child.parent = node;\n      }\n    }\n  }\n\n  (tree.parent = new TreeNode(null, 0)).children = [tree];\n  return tree;\n}\n\n// Node-link tree diagram using the Reingold-Tilford \"tidy\" algorithm\nexport default function() {\n  var separation = defaultSeparation,\n      dx = 1,\n      dy = 1,\n      nodeSize = null;\n\n  function tree(root) {\n    var t = treeRoot(root);\n\n    // Compute the layout using Buchheim et al.’s algorithm.\n    t.eachAfter(firstWalk), t.parent.m = -t.z;\n    t.eachBefore(secondWalk);\n\n    // If a fixed node size is specified, scale x and y.\n    if (nodeSize) root.eachBefore(sizeNode);\n\n    // If a fixed tree size is specified, scale x and y based on the extent.\n    // Compute the left-most, right-most, and depth-most nodes for extents.\n    else {\n      var left = root,\n          right = root,\n          bottom = root;\n      root.eachBefore(function(node) {\n        if (node.x < left.x) left = node;\n        if (node.x > right.x) right = node;\n        if (node.depth > bottom.depth) bottom = node;\n      });\n      var s = left === right ? 1 : separation(left, right) / 2,\n          tx = s - left.x,\n          kx = dx / (right.x + s + tx),\n          ky = dy / (bottom.depth || 1);\n      root.eachBefore(function(node) {\n        node.x = (node.x + tx) * kx;\n        node.y = node.depth * ky;\n      });\n    }\n\n    return root;\n  }\n\n  // Computes a preliminary x-coordinate for v. Before that, FIRST WALK is\n  // applied recursively to the children of v, as well as the function\n  // APPORTION. After spacing out the children by calling EXECUTE SHIFTS, the\n  // node v is placed to the midpoint of its outermost children.\n  function firstWalk(v) {\n    var children = v.children,\n        siblings = v.parent.children,\n        w = v.i ? siblings[v.i - 1] : null;\n    if (children) {\n      executeShifts(v);\n      var midpoint = (children[0].z + children[children.length - 1].z) / 2;\n      if (w) {\n        v.z = w.z + separation(v._, w._);\n        v.m = v.z - midpoint;\n      } else {\n        v.z = midpoint;\n      }\n    } else if (w) {\n      v.z = w.z + separation(v._, w._);\n    }\n    v.parent.A = apportion(v, w, v.parent.A || siblings[0]);\n  }\n\n  // Computes all real x-coordinates by summing up the modifiers recursively.\n  function secondWalk(v) {\n    v._.x = v.z + v.parent.m;\n    v.m += v.parent.m;\n  }\n\n  // The core of the algorithm. Here, a new subtree is combined with the\n  // previous subtrees. Threads are used to traverse the inside and outside\n  // contours of the left and right subtree up to the highest common level. The\n  // vertices used for the traversals are vi+, vi-, vo-, and vo+, where the\n  // superscript o means outside and i means inside, the subscript - means left\n  // subtree and + means right subtree. For summing up the modifiers along the\n  // contour, we use respective variables si+, si-, so-, and so+. Whenever two\n  // nodes of the inside contours conflict, we compute the left one of the\n  // greatest uncommon ancestors using the function ANCESTOR and call MOVE\n  // SUBTREE to shift the subtree and prepare the shifts of smaller subtrees.\n  // Finally, we add a new thread (if necessary).\n  function apportion(v, w, ancestor) {\n    if (w) {\n      var vip = v,\n          vop = v,\n          vim = w,\n          vom = vip.parent.children[0],\n          sip = vip.m,\n          sop = vop.m,\n          sim = vim.m,\n          som = vom.m,\n          shift;\n      while (vim = nextRight(vim), vip = nextLeft(vip), vim && vip) {\n        vom = nextLeft(vom);\n        vop = nextRight(vop);\n        vop.a = v;\n        shift = vim.z + sim - vip.z - sip + separation(vim._, vip._);\n        if (shift > 0) {\n          moveSubtree(nextAncestor(vim, v, ancestor), v, shift);\n          sip += shift;\n          sop += shift;\n        }\n        sim += vim.m;\n        sip += vip.m;\n        som += vom.m;\n        sop += vop.m;\n      }\n      if (vim && !nextRight(vop)) {\n        vop.t = vim;\n        vop.m += sim - sop;\n      }\n      if (vip && !nextLeft(vom)) {\n        vom.t = vip;\n        vom.m += sip - som;\n        ancestor = v;\n      }\n    }\n    return ancestor;\n  }\n\n  function sizeNode(node) {\n    node.x *= dx;\n    node.y = node.depth * dy;\n  }\n\n  tree.separation = function(x) {\n    return arguments.length ? (separation = x, tree) : separation;\n  };\n\n  tree.size = function(x) {\n    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], tree) : (nodeSize ? null : [dx, dy]);\n  };\n\n  tree.nodeSize = function(x) {\n    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], tree) : (nodeSize ? [dx, dy] : null);\n  };\n\n  return tree;\n}\n"],"names":["defaultSeparation","a","b","nextLeft","v","children","nextRight","moveSubtree","wm","wp","shift","change","executeShifts","i","w","nextAncestor","vim","ancestor","TreeNode","node","Node","treeRoot","root","tree","nodes","child","n","d3tree","separation","dx","dy","nodeSize","t","firstWalk","secondWalk","sizeNode","left","right","bottom","s","tx","kx","ky","siblings","midpoint","apportion","vip","vop","vom","sip","sop","sim","som","x"],"mappings":";AAEA,SAASA,EAAkBC,GAAGC,GAAG;AAC/B,SAAOD,EAAE,WAAWC,EAAE,SAAS,IAAI;AACrC;AAUA,SAASC,EAASC,GAAG;AACnB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAAS,CAAC,IAAID,EAAE;AACpC;AAGA,SAASE,EAAUF,GAAG;AACpB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAASA,EAAS,SAAS,CAAC,IAAID,EAAE;AACtD;AAIA,SAASG,EAAYC,GAAIC,GAAIC,GAAO;AAClC,MAAIC,IAASD,KAASD,EAAG,IAAID,EAAG;AAChC,EAAAC,EAAG,KAAKE,GACRF,EAAG,KAAKC,GACRF,EAAG,KAAKG,GACRF,EAAG,KAAKC,GACRD,EAAG,KAAKC;AACV;AAKA,SAASE,EAAcR,GAAG;AAMjB,WALHM,IAAQ,GACRC,IAAS,GACTN,IAAWD,EAAE,UACbS,IAAIR,EAAS,QACbS,GACG,EAAED,KAAK;AACZ,IAAAC,IAAIT,EAASQ,CAAC,GACdC,EAAE,KAAKJ,GACPI,EAAE,KAAKJ,GACEA,KAAAI,EAAE,KAAKH,KAAUG,EAAE;AAEhC;AAIA,SAASC,EAAaC,GAAKZ,GAAGa,GAAU;AACtC,SAAOD,EAAI,EAAE,WAAWZ,EAAE,SAASY,EAAI,IAAIC;AAC7C;AAEA,SAASC,EAASC,GAAMN,GAAG;AACzB,OAAK,IAAIM,GACT,KAAK,SAAS,MACd,KAAK,WAAW,MAChB,KAAK,IAAI,MACT,KAAK,IAAI,MACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,MACT,KAAK,IAAIN;AACX;AAEAK,EAAS,YAAY,OAAO,OAAOE,EAAK,SAAS;AAEjD,SAASC,EAASC,GAAM;AASf,WARHC,IAAO,IAAIL,EAASI,GAAM,CAAC,GAC3BH,GACAK,IAAQ,CAACD,CAAI,GACbE,GACApB,GACAQ,GACAa,GAEGP,IAAOK,EAAM;AACd,QAAAnB,IAAWc,EAAK,EAAE;AAEpB,WADAA,EAAK,WAAW,IAAI,MAAMO,IAAIrB,EAAS,MAAM,GACxCQ,IAAIa,IAAI,GAAGb,KAAK,GAAG,EAAEA;AACxB,QAAAW,EAAM,KAAKC,IAAQN,EAAK,SAASN,CAAC,IAAI,IAAIK,EAASb,EAASQ,CAAC,GAAGA,CAAC,CAAC,GAClEY,EAAM,SAASN;AAKpB,UAAAI,EAAK,SAAS,IAAIL,EAAS,MAAM,CAAC,GAAG,WAAW,CAACK,CAAI,GAC/CA;AACT;AAG0B,SAAAI,IAAA;AACxB,MAAIC,IAAa5B,GACb6B,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASR,EAAKD,GAAM;AACd,QAAAU,IAAIX,EAASC,CAAI;AAOjB,QAJJU,EAAE,UAAUC,CAAS,GAAGD,EAAE,OAAO,IAAI,CAACA,EAAE,GACxCA,EAAE,WAAWE,CAAU,GAGnBH;AAAU,MAAAT,EAAK,WAAWa,CAAQ;AAAA,SAIjC;AACH,UAAIC,IAAOd,GACPe,IAAQf,GACRgB,IAAShB;AACR,MAAAA,EAAA,WAAW,SAASH,GAAM;AACzB,QAAAA,EAAK,IAAIiB,EAAK,MAAUA,IAAAjB,IACxBA,EAAK,IAAIkB,EAAM,MAAWA,IAAAlB,IAC1BA,EAAK,QAAQmB,EAAO,UAAgBA,IAAAnB;AAAA,MAAA,CACzC;AACG,UAAAoB,IAAIH,MAASC,IAAQ,IAAIT,EAAWQ,GAAMC,CAAK,IAAI,GACnDG,IAAKD,IAAIH,EAAK,GACdK,IAAKZ,KAAMQ,EAAM,IAAIE,IAAIC,IACzBE,IAAKZ,KAAMQ,EAAO,SAAS;AAC1B,MAAAhB,EAAA,WAAW,SAASH,GAAM;AACxB,QAAAA,EAAA,KAAKA,EAAK,IAAIqB,KAAMC,GACpBtB,EAAA,IAAIA,EAAK,QAAQuB;AAAA,MAAA,CACvB;AAAA,IACH;AAEO,WAAApB;AAAA,EACT;AAMA,WAASW,EAAU7B,GAAG;AACpB,QAAIC,IAAWD,EAAE,UACbuC,IAAWvC,EAAE,OAAO,UACpBU,IAAIV,EAAE,IAAIuC,EAASvC,EAAE,IAAI,CAAC,IAAI;AAClC,QAAIC,GAAU;AACZ,MAAAO,EAAcR,CAAC;AACX,UAAAwC,KAAYvC,EAAS,CAAC,EAAE,IAAIA,EAASA,EAAS,SAAS,CAAC,EAAE,KAAK;AACnE,MAAIS,KACFV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC,GAC7BV,EAAA,IAAIA,EAAE,IAAIwC,KAEZxC,EAAE,IAAIwC;AAAA;MAEC9B,MACTV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC;AAE/B,IAAAV,EAAA,OAAO,IAAIyC,EAAUzC,GAAGU,GAAGV,EAAE,OAAO,KAAKuC,EAAS,CAAC,CAAC;AAAA,EACxD;AAGA,WAAST,EAAW9B,GAAG;AACrB,IAAAA,EAAE,EAAE,IAAIA,EAAE,IAAIA,EAAE,OAAO,GACrBA,EAAA,KAAKA,EAAE,OAAO;AAAA,EAClB;AAaS,WAAAyC,EAAUzC,GAAGU,GAAGG,GAAU;AACjC,QAAIH,GAAG;AAUE,eATHgC,IAAM1C,GACN2C,IAAM3C,GACNY,IAAMF,GACNkC,IAAMF,EAAI,OAAO,SAAS,CAAC,GAC3BG,IAAMH,EAAI,GACVI,IAAMH,EAAI,GACVI,IAAMnC,EAAI,GACVoC,IAAMJ,EAAI,GACVtC,GACGM,IAAMV,EAAUU,CAAG,GAAG8B,IAAM3C,EAAS2C,CAAG,GAAG9B,KAAO8B;AACvD,QAAAE,IAAM7C,EAAS6C,CAAG,GAClBD,IAAMzC,EAAUyC,CAAG,GACnBA,EAAI,IAAI3C,GACAM,IAAAM,EAAI,IAAImC,IAAML,EAAI,IAAIG,IAAMrB,EAAWZ,EAAI,GAAG8B,EAAI,CAAC,GACvDpC,IAAQ,MACVH,EAAYQ,EAAaC,GAAKZ,GAAGa,CAAQ,GAAGb,GAAGM,CAAK,GAC7CuC,KAAAvC,GACAwC,KAAAxC,IAETyC,KAAOnC,EAAI,GACXiC,KAAOH,EAAI,GACXM,KAAOJ,EAAI,GACXE,KAAOH,EAAI;AAEb,MAAI/B,KAAO,CAACV,EAAUyC,CAAG,MACvBA,EAAI,IAAI/B,GACR+B,EAAI,KAAKI,IAAMD,IAEbJ,KAAO,CAAC3C,EAAS6C,CAAG,MACtBA,EAAI,IAAIF,GACRE,EAAI,KAAKC,IAAMG,GACJnC,IAAAb;AAAA,IAEf;AACO,WAAAa;AAAA,EACT;AAEA,WAASkB,EAAShB,GAAM;AACtB,IAAAA,EAAK,KAAKU,GACLV,EAAA,IAAIA,EAAK,QAAQW;AAAA,EACxB;AAEK,SAAAP,EAAA,aAAa,SAAS8B,GAAG;AAC5B,WAAO,UAAU,UAAUzB,IAAayB,GAAG9B,KAAQK;AAAA,EAAA,GAGhDL,EAAA,OAAO,SAAS8B,GAAG;AACtB,WAAO,UAAU,UAAUtB,IAAW,IAAOF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EAAA,GAGpGP,EAAA,WAAW,SAAS8B,GAAG;AAC1B,WAAO,UAAU,UAAUtB,IAAW,IAAMF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EAAA,GAG9FP;AACT;","x_google_ignoreList":[0]}

package/dist/index.es8.js

@@ -1,5 +1,5 @@
 import { supportsDataView as e } from "./index.es6.js";
-import a from "./index.es252.js";
+import a from "./index.es255.js";
 var p = e && a(new DataView(new ArrayBuffer(8))), i = typeof Map < "u" && a(/* @__PURE__ */ new Map());
 export {
   p as hasStringTagBug,

package/dist/index.es81.js

@@ -2,7 +2,7 @@ import r from "./index.es10.js";
 import n from "./index.es148.js";
 import f from "./index.es109.js";
 import { push as u } from "./index.es6.js";
-import m from "./index.es233.js";
+import m from "./index.es238.js";
 function l(o) {
   return n(f(o), function(t) {
     var i = r[t] = o[t];

package/dist/index.es88.js

@@ -1,4 +1,4 @@
-import t from "./index.es207.js";
+import t from "./index.es212.js";
 const e = t("String");
 export {
   e as default

package/dist/index.es89.js

@@ -1,4 +1,4 @@
-import e from "./index.es207.js";
+import e from "./index.es212.js";
 const t = e("Number");
 export {
   t as default

package/dist/index.es9.js

@@ -1,5 +1,5 @@
-import e from "./index.es207.js";
-import n from "./index.es208.js";
+import e from "./index.es212.js";
+import n from "./index.es213.js";
 var t = e("Arguments");
 (function() {
   t(arguments) || (t = function(r) {

package/dist/index.es90.js

@@ -1,4 +1,4 @@
-import t from "./index.es207.js";
+import t from "./index.es212.js";
 const a = t("Date");
 export {
   a as default

package/dist/index.es91.js

@@ -1,4 +1,4 @@
-import e from "./index.es207.js";
+import e from "./index.es212.js";
 const o = e("RegExp");
 export {
   o as default

package/dist/index.es92.js

@@ -1,4 +1,4 @@
-import r from "./index.es207.js";
+import r from "./index.es212.js";
 const t = r("Error");
 export {
   t as default

package/dist/index.es93.js

@@ -1,4 +1,4 @@
-import o from "./index.es207.js";
+import o from "./index.es212.js";
 const e = o("Symbol");
 export {
   e as default

package/dist/index.es94.js

@@ -1,4 +1,4 @@
-import r from "./index.es207.js";
+import r from "./index.es212.js";
 const f = r("ArrayBuffer");
 export {
   f as default

package/dist/index.es95.js

@@ -1,4 +1,4 @@
-import r from "./index.es207.js";
+import r from "./index.es212.js";
 import i from "./index.es7.js";
 import a from "./index.es94.js";
 import { hasStringTagBug as e } from "./index.es8.js";

package/dist/index.es96.js

@@ -1,5 +1,5 @@
 import { nativeIsArray as r } from "./index.es6.js";
-import t from "./index.es207.js";
+import t from "./index.es212.js";
 const e = r || t("Array");
 export {
   e as default

package/dist/index.es99.js

@@ -1,7 +1,7 @@
 import { supportsArrayBuffer as i, nativeIsView as t, toString as a } from "./index.es6.js";
 import e from "./index.es95.js";
 import o from "./index.es120.js";
-import n from "./index.es209.js";
+import n from "./index.es214.js";
 var s = /\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\]/;
 function f(r) {
   return t ? t(r) && !e(r) : n(r) && s.test(a.call(r));

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@performant-software/visualize",
-  "version": "2.1.0-beta.43",
+  "version": "2.1.0-beta.44",
   "description": "A package of components used for data visualization",
   "license": "MIT",
   "main": "./dist/index.cjs.js",