@performant-software/visualize 2.2.24-beta.25 → 2.2.24-beta.27

package/dist/index.cjs184.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs184.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":"iDAEA,SAASA,EAAkBC,EAAGC,EAAG,CAC/B,OAAOD,EAAE,SAAWC,EAAE,OAAS,EAAI,CACrC,CAUA,SAASC,EAASC,EAAG,CACnB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAAS,CAAC,EAAID,EAAE,CACpC,CAGA,SAASE,EAAUF,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAASA,EAAS,OAAS,CAAC,EAAID,EAAE,CACtD,CAIA,SAASG,EAAYC,EAAIC,EAAIC,EAAO,CAClC,IAAIC,EAASD,GAASD,EAAG,EAAID,EAAG,GAChCC,EAAG,GAAKE,EACRF,EAAG,GAAKC,EACRF,EAAG,GAAKG,EACRF,EAAG,GAAKC,EACRD,EAAG,GAAKC,CACV,CAKA,SAASE,EAAcR,EAAG,CAMjB,QALHM,EAAQ,EACRC,EAAS,EACTN,EAAWD,EAAE,SACbS,EAAIR,EAAS,OACbS,EACG,EAAED,GAAK,GACZC,EAAIT,EAASQ,CAAC,EACdC,EAAE,GAAKJ,EACPI,EAAE,GAAKJ,EACEA,GAAAI,EAAE,GAAKH,GAAUG,EAAE,EAEhC,CAIA,SAASC,EAAaC,EAAKZ,EAAGa,EAAU,CACtC,OAAOD,EAAI,EAAE,SAAWZ,EAAE,OAASY,EAAI,EAAIC,CAC7C,CAEA,SAASC,EAASC,EAAMN,EAAG,CACzB,KAAK,EAAIM,EACT,KAAK,OAAS,KACd,KAAK,SAAW,KAChB,KAAK,EAAI,KACT,KAAK,EAAI,KACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,KACT,KAAK,EAAIN,CACX,CAEAK,EAAS,UAAY,OAAO,OAAOE,EAAA,KAAK,SAAS,EAEjD,SAASC,EAASC,EAAM,CASf,QARHC,EAAO,IAAIL,EAASI,EAAM,CAAC,EAC3BH,EACAK,EAAQ,CAACD,CAAI,EACbE,EACApB,EACAQ,EACAa,EAEGP,EAAOK,EAAM,OACd,GAAAnB,EAAWc,EAAK,EAAE,SAEpB,IADAA,EAAK,SAAW,IAAI,MAAMO,EAAIrB,EAAS,MAAM,EACxCQ,EAAIa,EAAI,EAAGb,GAAK,EAAG,EAAEA,EACxBW,EAAM,KAAKC,EAAQN,EAAK,SAASN,CAAC,EAAI,IAAIK,EAASb,EAASQ,CAAC,EAAGA,CAAC,CAAC,EAClEY,EAAM,OAASN,EAKpB,OAAAI,EAAK,OAAS,IAAIL,EAAS,KAAM,CAAC,GAAG,SAAW,CAACK,CAAI,EAC/CA,CACT,CAG0B,SAAAI,GAAA,CACxB,IAAIC,EAAa5B,EACb6B,EAAK,EACLC,EAAK,EACLC,EAAW,KAEf,SAASR,EAAKD,EAAM,CACd,IAAAU,EAAIX,EAASC,CAAI,EAOjB,GAJJU,EAAE,UAAUC,CAAS,EAAGD,EAAE,OAAO,EAAI,CAACA,EAAE,EACxCA,EAAE,WAAWE,CAAU,EAGnBH,EAAUT,EAAK,WAAWa,CAAQ,MAIjC,CACH,IAAIC,EAAOd,EACPe,EAAQf,EACRgB,EAAShB,EACRA,EAAA,WAAW,SAASH,EAAM,CACzBA,EAAK,EAAIiB,EAAK,IAAUA,EAAAjB,GACxBA,EAAK,EAAIkB,EAAM,IAAWA,EAAAlB,GAC1BA,EAAK,MAAQmB,EAAO,QAAgBA,EAAAnB,EAAA,CACzC,EACG,IAAAoB,EAAIH,IAASC,EAAQ,EAAIT,EAAWQ,EAAMC,CAAK,EAAI,EACnDG,EAAKD,EAAIH,EAAK,EACdK,EAAKZ,GAAMQ,EAAM,EAAIE,EAAIC,GACzBE,EAAKZ,GAAMQ,EAAO,OAAS,GAC1BhB,EAAA,WAAW,SAASH,EAAM,CACxBA,EAAA,GAAKA,EAAK,EAAIqB,GAAMC,EACpBtB,EAAA,EAAIA,EAAK,MAAQuB,CAAA,CACvB,CACH,CAEO,OAAApB,CACT,CAMA,SAASW,EAAU7B,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACbuC,EAAWvC,EAAE,OAAO,SACpBU,EAAIV,EAAE,EAAIuC,EAASvC,EAAE,EAAI,CAAC,EAAI,KAClC,GAAIC,EAAU,CACZO,EAAcR,CAAC,EACX,IAAAwC,GAAYvC,EAAS,CAAC,EAAE,EAAIA,EAASA,EAAS,OAAS,CAAC,EAAE,GAAK,EAC/DS,GACFV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,EAC7BV,EAAA,EAAIA,EAAE,EAAIwC,GAEZxC,EAAE,EAAIwC,OAEC9B,IACTV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,GAE/BV,EAAA,OAAO,EAAIyC,EAAUzC,EAAGU,EAAGV,EAAE,OAAO,GAAKuC,EAAS,CAAC,CAAC,CACxD,CAGA,SAAST,EAAW9B,EAAG,CACrBA,EAAE,EAAE,EAAIA,EAAE,EAAIA,EAAE,OAAO,EACrBA,EAAA,GAAKA,EAAE,OAAO,CAClB,CAaS,SAAAyC,EAAUzC,EAAGU,EAAGG,EAAU,CACjC,GAAIH,EAAG,CAUE,QATHgC,EAAM1C,EACN2C,EAAM3C,EACNY,EAAMF,EACNkC,EAAMF,EAAI,OAAO,SAAS,CAAC,EAC3BG,EAAMH,EAAI,EACVI,EAAMH,EAAI,EACVI,EAAMnC,EAAI,EACVoC,EAAMJ,EAAI,EACVtC,EACGM,EAAMV,EAAUU,CAAG,EAAG8B,EAAM3C,EAAS2C,CAAG,EAAG9B,GAAO8B,GACvDE,EAAM7C,EAAS6C,CAAG,EAClBD,EAAMzC,EAAUyC,CAAG,EACnBA,EAAI,EAAI3C,EACAM,EAAAM,EAAI,EAAImC,EAAML,EAAI,EAAIG,EAAMrB,EAAWZ,EAAI,EAAG8B,EAAI,CAAC,EACvDpC,EAAQ,IACVH,EAAYQ,EAAaC,EAAKZ,EAAGa,CAAQ,EAAGb,EAAGM,CAAK,EAC7CuC,GAAAvC,EACAwC,GAAAxC,GAETyC,GAAOnC,EAAI,EACXiC,GAAOH,EAAI,EACXM,GAAOJ,EAAI,EACXE,GAAOH,EAAI,EAET/B,GAAO,CAACV,EAAUyC,CAAG,IACvBA,EAAI,EAAI/B,EACR+B,EAAI,GAAKI,EAAMD,GAEbJ,GAAO,CAAC3C,EAAS6C,CAAG,IACtBA,EAAI,EAAIF,EACRE,EAAI,GAAKC,EAAMG,EACJnC,EAAAb,EAEf,CACO,OAAAa,CACT,CAEA,SAASkB,EAAShB,EAAM,CACtBA,EAAK,GAAKU,EACLV,EAAA,EAAIA,EAAK,MAAQW,CACxB,CAEK,OAAAP,EAAA,WAAa,SAAS8B,EAAG,CAC5B,OAAO,UAAU,QAAUzB,EAAayB,EAAG9B,GAAQK,CAAA,EAGhDL,EAAA,KAAO,SAAS8B,EAAG,CACtB,OAAO,UAAU,QAAUtB,EAAW,GAAOF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,KAAO,CAACF,EAAIC,CAAE,CAAA,EAGpGP,EAAA,SAAW,SAAS8B,EAAG,CAC1B,OAAO,UAAU,QAAUtB,EAAW,GAAMF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,CAACF,EAAIC,CAAE,EAAI,IAAA,EAG9FP,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs184.js","sources":["../../../node_modules/underscore/modules/chunk.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default function chunk(array, count) {\n  if (count == null || count < 1) return [];\n  var result = [];\n  var i = 0, length = array.length;\n  while (i < length) {\n    result.push(slice.call(array, i, i += count));\n  }\n  return result;\n}\n"],"names":["chunk","array","count","result","i","length","slice"],"mappings":"gDAIwB,SAAAA,EAAMC,EAAOC,EAAO,CACtC,GAAAA,GAAS,MAAQA,EAAQ,EAAG,MAAO,GAGvC,QAFIC,EAAS,CAAA,EACTC,EAAI,EAAGC,EAASJ,EAAM,OACnBG,EAAIC,GACTF,EAAO,KAAKG,EAAAA,MAAM,KAAKL,EAAOG,EAAGA,GAAKF,CAAK,CAAC,EAEvC,OAAAC,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs186.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./index.cjs268.js"),f=require("./index.cjs269.js"),p=require("./index.cjs270.js"),c=require("./index.cjs267.js"),k=require("./index.cjs187.js");function m(n){return n.source}function d(n){return n.target}function s(n){var r=m,e=d,u=p.x,l=p.y,a=null;function i(){var t,o=h.slice.call(arguments),g=r.apply(this,o),v=e.apply(this,o);if(a||(a=t=k()),n(a,+u.apply(this,(o[0]=g,o)),+l.apply(this,o),+u.apply(this,(o[0]=v,o)),+l.apply(this,o)),t)return a=null,t+""||null}return i.source=function(t){return arguments.length?(r=t,i):r},i.target=function(t){return arguments.length?(e=t,i):e},i.x=function(t){return arguments.length?(u=typeof t=="function"?t:f(+t),i):u},i.y=function(t){return arguments.length?(l=typeof t=="function"?t:f(+t),i):l},i.context=function(t){return arguments.length?(a=t??null,i):a},i}function T(n,r,e,u,l){n.moveTo(r,e),n.bezierCurveTo(r=(r+u)/2,e,r,l,u,l)}function b(n,r,e,u,l){n.moveTo(r,e),n.bezierCurveTo(r,e=(e+l)/2,u,e,u,l)}function y(n,r,e,u,l){var a=c(r,e),i=c(r,e=(e+l)/2),t=c(u,e),o=c(u,l);n.moveTo(a[0],a[1]),n.bezierCurveTo(i[0],i[1],t[0],t[1],o[0],o[1])}function z(){return s(T)}function q(){return s(b)}function R(){var n=s(y);return n.angle=n.x,delete n.x,n.radius=n.y,delete n.y,n}exports.linkHorizontal=z;exports.linkRadial=R;exports.linkVertical=q;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./index.cjs253.js"),f=require("./index.cjs254.js"),p=require("./index.cjs255.js"),c=require("./index.cjs252.js"),k=require("./index.cjs187.js");function m(n){return n.source}function d(n){return n.target}function s(n){var r=m,e=d,u=p.x,l=p.y,a=null;function i(){var t,o=h.slice.call(arguments),g=r.apply(this,o),v=e.apply(this,o);if(a||(a=t=k()),n(a,+u.apply(this,(o[0]=g,o)),+l.apply(this,o),+u.apply(this,(o[0]=v,o)),+l.apply(this,o)),t)return a=null,t+""||null}return i.source=function(t){return arguments.length?(r=t,i):r},i.target=function(t){return arguments.length?(e=t,i):e},i.x=function(t){return arguments.length?(u=typeof t=="function"?t:f(+t),i):u},i.y=function(t){return arguments.length?(l=typeof t=="function"?t:f(+t),i):l},i.context=function(t){return arguments.length?(a=t??null,i):a},i}function T(n,r,e,u,l){n.moveTo(r,e),n.bezierCurveTo(r=(r+u)/2,e,r,l,u,l)}function b(n,r,e,u,l){n.moveTo(r,e),n.bezierCurveTo(r,e=(e+l)/2,u,e,u,l)}function y(n,r,e,u,l){var a=c(r,e),i=c(r,e=(e+l)/2),t=c(u,e),o=c(u,l);n.moveTo(a[0],a[1]),n.bezierCurveTo(i[0],i[1],t[0],t[1],o[0],o[1])}function z(){return s(T)}function q(){return s(b)}function R(){var n=s(y);return n.angle=n.x,delete n.x,n.radius=n.y,delete n.y,n}exports.linkHorizontal=z;exports.linkRadial=R;exports.linkVertical=q;
 //# sourceMappingURL=index.cjs186.js.map

package/dist/index.cjs188.js

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs74.js");function i(){return i=Object.assign?Object.assign.bind():function(n){for(var r=1;r<arguments.length;r++){var t=arguments[r];for(var e in t)Object.prototype.hasOwnProperty.call(t,e)&&(n[e]=t[e])}return n},i.apply(this,arguments)}var u={x:0,y:0};function a(n){if(!n)return i({},u);if(c.isTouchEvent(n))return n.changedTouches.length>0?{x:n.changedTouches[0].clientX,y:n.changedTouches[0].clientY}:i({},u);if(c.isMouseEvent(n))return{x:n.clientX,y:n.clientY};var r=n==null?void 0:n.target,t=r&&"getBoundingClientRect"in r?r.getBoundingClientRect():null;return t?{x:t.x+t.width/2,y:t.y+t.height/2}:i({},u)}module.exports=a;
+"use strict";const c=require("./index.cjs63.js");function i(){return i=Object.assign?Object.assign.bind():function(n){for(var r=1;r<arguments.length;r++){var t=arguments[r];for(var e in t)Object.prototype.hasOwnProperty.call(t,e)&&(n[e]=t[e])}return n},i.apply(this,arguments)}var u={x:0,y:0};function a(n){if(!n)return i({},u);if(c.isTouchEvent(n))return n.changedTouches.length>0?{x:n.changedTouches[0].clientX,y:n.changedTouches[0].clientY}:i({},u);if(c.isMouseEvent(n))return{x:n.clientX,y:n.clientY};var r=n==null?void 0:n.target,t=r&&"getBoundingClientRect"in r?r.getBoundingClientRect():null;return t?{x:t.x+t.width/2,y:t.y+t.height/2}:i({},u)}module.exports=a;
 //# sourceMappingURL=index.cjs188.js.map

package/dist/index.cjs19.js

@@ -1,2 +1,2 @@
-"use strict";const l=require("./index.cjs77.js"),h=require("./index.cjs213.js"),i=require("./index.cjs10.js");var a=l(function(o,e){var c=a.placeholder,s=function(){for(var t=0,u=e.length,n=Array(u),r=0;r<u;r++)n[r]=e[r]===c?arguments[t++]:e[r];for(;t<arguments.length;)n.push(arguments[t++]);return h(o,s,this,this,n)};return s});a.placeholder=i;module.exports=a;
+"use strict";const l=require("./index.cjs85.js"),h=require("./index.cjs228.js"),i=require("./index.cjs10.js");var a=l(function(o,e){var c=a.placeholder,s=function(){for(var t=0,u=e.length,n=Array(u),r=0;r<u;r++)n[r]=e[r]===c?arguments[t++]:e[r];for(;t<arguments.length;)n.push(arguments[t++]);return h(o,s,this,this,n)};return s});a.placeholder=i;module.exports=a;
 //# sourceMappingURL=index.cjs19.js.map

package/dist/index.cjs192.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index.cjs246.js"),t=require("./index.cjs247.js"),o=require("./index.cjs248.js");var r;function u(){return r||(r=1,process.env.NODE_ENV==="production"?e.__module.exports=t.__require():e.__module.exports=o.__require()),e.__module.exports}exports.__require=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index.cjs245.js"),t=require("./index.cjs246.js"),o=require("./index.cjs247.js");var r;function u(){return r||(r=1,process.env.NODE_ENV==="production"?e.__module.exports=t.__require():e.__module.exports=o.__require()),e.__module.exports}exports.__require=u;
 //# sourceMappingURL=index.cjs192.js.map

package/dist/index.cjs193.js

@@ -1,3 +1,3 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const F=require("./index.cjs192.js"),N=require("./index.cjs249.js"),ee=require("./index.cjs250.js"),re=require("./index.cjs251.js"),ne=require("./index.cjs252.js");var A,C;function te(){if(C)return A;C=1;var k=F.__require(),W=N.__require(),h=ee.__require(),I=re.__require(),q=ne.__require(),b=function(){};process.env.NODE_ENV!=="production"&&(b=function(S){var x="Warning: "+S;typeof console<"u"&&console.error(x);try{throw new Error(x)}catch{}});function E(){return null}return A=function(S,x){var P=typeof Symbol=="function"&&Symbol.iterator,D="@@iterator";function M(e){var r=e&&(P&&e[P]||e[D]);if(typeof r=="function")return r}var _="<<anonymous>>",w={array:p("array"),bigint:p("bigint"),bool:p("boolean"),func:p("function"),number:p("number"),object:p("object"),string:p("string"),symbol:p("symbol"),any:U(),arrayOf:$,element:B(),elementType:J(),instanceOf:z,node:H(),objectOf:X,oneOf:L,oneOfType:G,shape:K,exact:Q};function Y(e,r){return e===r?e!==0||1/e===1/r:e!==e&&r!==r}function d(e,r){this.message=e,this.data=r&&typeof r=="object"?r:{},this.stack=""}d.prototype=Error.prototype;function v(e){if(process.env.NODE_ENV!=="production")var r={},u=0;function i(f,t,a,o,s,c,y){if(o=o||_,c=c||a,y!==h){if(x){var l=new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use `PropTypes.checkPropTypes()` to call them. Read more at http://fb.me/use-check-prop-types");throw l.name="Invariant Violation",l}else if(process.env.NODE_ENV!=="production"&&typeof console<"u"){var T=o+":"+a;!r[T]&&u<3&&(b("You are manually calling a React.PropTypes validation function for the `"+c+"` prop on `"+o+"`. This is deprecated and will throw in the standalone `prop-types` package. You may be seeing this warning due to a third-party PropTypes library. See https://fb.me/react-warning-dont-call-proptypes for details."),r[T]=!0,u++)}}return t[a]==null?f?t[a]===null?new d("The "+s+" `"+c+"` is marked as required "+("in `"+o+"`, but its value is `null`.")):new d("The "+s+" `"+c+"` is marked as required in "+("`"+o+"`, but its value is `undefined`.")):null:e(t,a,o,s,c)}var n=i.bind(null,!1);return n.isRequired=i.bind(null,!0),n}function p(e){function r(u,i,n,f,t,a){var o=u[i],s=g(o);if(s!==e){var c=O(o);return new d("Invalid "+f+" `"+t+"` of type "+("`"+c+"` supplied to `"+n+"`, expected ")+("`"+e+"`."),{expectedType:e})}return null}return v(r)}function U(){return v(E)}function $(e){function r(u,i,n,f,t){if(typeof e!="function")return new d("Property `"+t+"` of component `"+n+"` has invalid PropType notation inside arrayOf.");var a=u[i];if(!Array.isArray(a)){var o=g(a);return new d("Invalid "+f+" `"+t+"` of type "+("`"+o+"` supplied to `"+n+"`, expected an array."))}for(var s=0;s<a.length;s++){var c=e(a,s,n,f,t+"["+s+"]",h);if(c instanceof Error)return c}return null}return v(r)}function B(){function e(r,u,i,n,f){var t=r[u];if(!S(t)){var a=g(t);return new d("Invalid "+n+" `"+f+"` of type "+("`"+a+"` supplied to `"+i+"`, expected a single ReactElement."))}return null}return v(e)}function J(){function e(r,u,i,n,f){var t=r[u];if(!k.isValidElementType(t)){var a=g(t);return new d("Invalid "+n+" `"+f+"` of type "+("`"+a+"` supplied to `"+i+"`, expected a single ReactElement type."))}return null}return v(e)}function z(e){function r(u,i,n,f,t){if(!(u[i]instanceof e)){var a=e.name||_,o=V(u[i]);return new d("Invalid "+f+" `"+t+"` of type "+("`"+o+"` supplied to `"+n+"`, expected ")+("instance of `"+a+"`."))}return null}return v(r)}function L(e){if(!Array.isArray(e))return process.env.NODE_ENV!=="production"&&(arguments.length>1?b("Invalid arguments supplied to oneOf, expected an array, got "+arguments.length+" arguments. A common mistake is to write oneOf(x, y, z) instead of oneOf([x, y, z])."):b("Invalid argument supplied to oneOf, expected an array.")),E;function r(u,i,n,f,t){for(var a=u[i],o=0;o<e.length;o++)if(Y(a,e[o]))return null;var s=JSON.stringify(e,function(y,l){var T=O(l);return T==="symbol"?String(l):l});return new d("Invalid "+f+" `"+t+"` of value `"+String(a)+"` "+("supplied to `"+n+"`, expected one of "+s+"."))}return v(r)}function X(e){function r(u,i,n,f,t){if(typeof e!="function")return new d("Property `"+t+"` of component `"+n+"` has invalid PropType notation inside objectOf.");var a=u[i],o=g(a);if(o!=="object")return new d("Invalid "+f+" `"+t+"` of type "+("`"+o+"` supplied to `"+n+"`, expected an object."));for(var s in a)if(I(a,s)){var c=e(a,s,n,f,t+"."+s,h);if(c instanceof Error)return c}return null}return v(r)}function G(e){if(!Array.isArray(e))return process.env.NODE_ENV!=="production"&&b("Invalid argument supplied to oneOfType, expected an instance of array."),E;for(var r=0;r<e.length;r++){var u=e[r];if(typeof u!="function")return b("Invalid argument supplied to oneOfType. Expected an array of check functions, but received "+m(u)+" at index "+r+"."),E}function i(n,f,t,a,o){for(var s=[],c=0;c<e.length;c++){var y=e[c],l=y(n,f,t,a,o,h);if(l==null)return null;l.data&&I(l.data,"expectedType")&&s.push(l.data.expectedType)}var T=s.length>0?", expected one of type ["+s.join(", ")+"]":"";return new d("Invalid "+a+" `"+o+"` supplied to "+("`"+t+"`"+T+"."))}return v(i)}function H(){function e(r,u,i,n,f){return j(r[u])?null:new d("Invalid "+n+" `"+f+"` supplied to "+("`"+i+"`, expected a ReactNode."))}return v(e)}function R(e,r,u,i,n){return new d((e||"React class")+": "+r+" type `"+u+"."+i+"` is invalid; it must be a function, usually from the `prop-types` package, but received `"+n+"`.")}function K(e){function r(u,i,n,f,t){var a=u[i],o=g(a);if(o!=="object")return new d("Invalid "+f+" `"+t+"` of type `"+o+"` "+("supplied to `"+n+"`, expected `object`."));for(var s in e){var c=e[s];if(typeof c!="function")return R(n,f,t,s,O(c));var y=c(a,s,n,f,t+"."+s,h);if(y)return y}return null}return v(r)}function Q(e){function r(u,i,n,f,t){var a=u[i],o=g(a);if(o!=="object")return new d("Invalid "+f+" `"+t+"` of type `"+o+"` "+("supplied to `"+n+"`, expected `object`."));var s=W({},u[i],e);for(var c in s){var y=e[c];if(I(e,c)&&typeof y!="function")return R(n,f,t,c,O(y));if(!y)return new d("Invalid "+f+" `"+t+"` key `"+c+"` supplied to `"+n+"`.\nBad object: "+JSON.stringify(u[i],null,"  ")+`
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const F=require("./index.cjs192.js"),N=require("./index.cjs248.js"),ee=require("./index.cjs249.js"),re=require("./index.cjs250.js"),ne=require("./index.cjs251.js");var A,C;function te(){if(C)return A;C=1;var k=F.__require(),W=N.__require(),h=ee.__require(),I=re.__require(),q=ne.__require(),b=function(){};process.env.NODE_ENV!=="production"&&(b=function(S){var x="Warning: "+S;typeof console<"u"&&console.error(x);try{throw new Error(x)}catch{}});function E(){return null}return A=function(S,x){var P=typeof Symbol=="function"&&Symbol.iterator,D="@@iterator";function M(e){var r=e&&(P&&e[P]||e[D]);if(typeof r=="function")return r}var _="<<anonymous>>",w={array:p("array"),bigint:p("bigint"),bool:p("boolean"),func:p("function"),number:p("number"),object:p("object"),string:p("string"),symbol:p("symbol"),any:U(),arrayOf:$,element:B(),elementType:J(),instanceOf:z,node:H(),objectOf:X,oneOf:L,oneOfType:G,shape:K,exact:Q};function Y(e,r){return e===r?e!==0||1/e===1/r:e!==e&&r!==r}function d(e,r){this.message=e,this.data=r&&typeof r=="object"?r:{},this.stack=""}d.prototype=Error.prototype;function v(e){if(process.env.NODE_ENV!=="production")var r={},u=0;function i(f,t,a,o,s,c,y){if(o=o||_,c=c||a,y!==h){if(x){var l=new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use `PropTypes.checkPropTypes()` to call them. Read more at http://fb.me/use-check-prop-types");throw l.name="Invariant Violation",l}else if(process.env.NODE_ENV!=="production"&&typeof console<"u"){var T=o+":"+a;!r[T]&&u<3&&(b("You are manually calling a React.PropTypes validation function for the `"+c+"` prop on `"+o+"`. This is deprecated and will throw in the standalone `prop-types` package. You may be seeing this warning due to a third-party PropTypes library. See https://fb.me/react-warning-dont-call-proptypes for details."),r[T]=!0,u++)}}return t[a]==null?f?t[a]===null?new d("The "+s+" `"+c+"` is marked as required "+("in `"+o+"`, but its value is `null`.")):new d("The "+s+" `"+c+"` is marked as required in "+("`"+o+"`, but its value is `undefined`.")):null:e(t,a,o,s,c)}var n=i.bind(null,!1);return n.isRequired=i.bind(null,!0),n}function p(e){function r(u,i,n,f,t,a){var o=u[i],s=g(o);if(s!==e){var c=O(o);return new d("Invalid "+f+" `"+t+"` of type "+("`"+c+"` supplied to `"+n+"`, expected ")+("`"+e+"`."),{expectedType:e})}return null}return v(r)}function U(){return v(E)}function $(e){function r(u,i,n,f,t){if(typeof e!="function")return new d("Property `"+t+"` of component `"+n+"` has invalid PropType notation inside arrayOf.");var a=u[i];if(!Array.isArray(a)){var o=g(a);return new d("Invalid "+f+" `"+t+"` of type "+("`"+o+"` supplied to `"+n+"`, expected an array."))}for(var s=0;s<a.length;s++){var c=e(a,s,n,f,t+"["+s+"]",h);if(c instanceof Error)return c}return null}return v(r)}function B(){function e(r,u,i,n,f){var t=r[u];if(!S(t)){var a=g(t);return new d("Invalid "+n+" `"+f+"` of type "+("`"+a+"` supplied to `"+i+"`, expected a single ReactElement."))}return null}return v(e)}function J(){function e(r,u,i,n,f){var t=r[u];if(!k.isValidElementType(t)){var a=g(t);return new d("Invalid "+n+" `"+f+"` of type "+("`"+a+"` supplied to `"+i+"`, expected a single ReactElement type."))}return null}return v(e)}function z(e){function r(u,i,n,f,t){if(!(u[i]instanceof e)){var a=e.name||_,o=V(u[i]);return new d("Invalid "+f+" `"+t+"` of type "+("`"+o+"` supplied to `"+n+"`, expected ")+("instance of `"+a+"`."))}return null}return v(r)}function L(e){if(!Array.isArray(e))return process.env.NODE_ENV!=="production"&&(arguments.length>1?b("Invalid arguments supplied to oneOf, expected an array, got "+arguments.length+" arguments. A common mistake is to write oneOf(x, y, z) instead of oneOf([x, y, z])."):b("Invalid argument supplied to oneOf, expected an array.")),E;function r(u,i,n,f,t){for(var a=u[i],o=0;o<e.length;o++)if(Y(a,e[o]))return null;var s=JSON.stringify(e,function(y,l){var T=O(l);return T==="symbol"?String(l):l});return new d("Invalid "+f+" `"+t+"` of value `"+String(a)+"` "+("supplied to `"+n+"`, expected one of "+s+"."))}return v(r)}function X(e){function r(u,i,n,f,t){if(typeof e!="function")return new d("Property `"+t+"` of component `"+n+"` has invalid PropType notation inside objectOf.");var a=u[i],o=g(a);if(o!=="object")return new d("Invalid "+f+" `"+t+"` of type "+("`"+o+"` supplied to `"+n+"`, expected an object."));for(var s in a)if(I(a,s)){var c=e(a,s,n,f,t+"."+s,h);if(c instanceof Error)return c}return null}return v(r)}function G(e){if(!Array.isArray(e))return process.env.NODE_ENV!=="production"&&b("Invalid argument supplied to oneOfType, expected an instance of array."),E;for(var r=0;r<e.length;r++){var u=e[r];if(typeof u!="function")return b("Invalid argument supplied to oneOfType. Expected an array of check functions, but received "+m(u)+" at index "+r+"."),E}function i(n,f,t,a,o){for(var s=[],c=0;c<e.length;c++){var y=e[c],l=y(n,f,t,a,o,h);if(l==null)return null;l.data&&I(l.data,"expectedType")&&s.push(l.data.expectedType)}var T=s.length>0?", expected one of type ["+s.join(", ")+"]":"";return new d("Invalid "+a+" `"+o+"` supplied to "+("`"+t+"`"+T+"."))}return v(i)}function H(){function e(r,u,i,n,f){return j(r[u])?null:new d("Invalid "+n+" `"+f+"` supplied to "+("`"+i+"`, expected a ReactNode."))}return v(e)}function R(e,r,u,i,n){return new d((e||"React class")+": "+r+" type `"+u+"."+i+"` is invalid; it must be a function, usually from the `prop-types` package, but received `"+n+"`.")}function K(e){function r(u,i,n,f,t){var a=u[i],o=g(a);if(o!=="object")return new d("Invalid "+f+" `"+t+"` of type `"+o+"` "+("supplied to `"+n+"`, expected `object`."));for(var s in e){var c=e[s];if(typeof c!="function")return R(n,f,t,s,O(c));var y=c(a,s,n,f,t+"."+s,h);if(y)return y}return null}return v(r)}function Q(e){function r(u,i,n,f,t){var a=u[i],o=g(a);if(o!=="object")return new d("Invalid "+f+" `"+t+"` of type `"+o+"` "+("supplied to `"+n+"`, expected `object`."));var s=W({},u[i],e);for(var c in s){var y=e[c];if(I(e,c)&&typeof y!="function")return R(n,f,t,c,O(y));if(!y)return new d("Invalid "+f+" `"+t+"` key `"+c+"` supplied to `"+n+"`.\nBad object: "+JSON.stringify(u[i],null,"  ")+`
 Valid keys: `+JSON.stringify(Object.keys(e),null,"  "));var l=y(a,c,n,f,t+"."+c,h);if(l)return l}return null}return v(r)}function j(e){switch(typeof e){case"number":case"string":case"undefined":return!0;case"boolean":return!e;case"object":if(Array.isArray(e))return e.every(j);if(e===null||S(e))return!0;var r=M(e);if(r){var u=r.call(e),i;if(r!==e.entries){for(;!(i=u.next()).done;)if(!j(i.value))return!1}else for(;!(i=u.next()).done;){var n=i.value;if(n&&!j(n[1]))return!1}}else return!1;return!0;default:return!1}}function Z(e,r){return e==="symbol"?!0:r?r["@@toStringTag"]==="Symbol"||typeof Symbol=="function"&&r instanceof Symbol:!1}function g(e){var r=typeof e;return Array.isArray(e)?"array":e instanceof RegExp?"object":Z(r,e)?"symbol":r}function O(e){if(typeof e>"u"||e===null)return""+e;var r=g(e);if(r==="object"){if(e instanceof Date)return"date";if(e instanceof RegExp)return"regexp"}return r}function m(e){var r=O(e);switch(r){case"array":case"object":return"an "+r;case"boolean":case"date":case"regexp":return"a "+r;default:return r}}function V(e){return!e.constructor||!e.constructor.name?_:e.constructor.name}return w.checkPropTypes=q,w.resetWarningCache=q.resetWarningCache,w.PropTypes=w,w},A}exports.__require=te;
 //# sourceMappingURL=index.cjs193.js.map

package/dist/index.cjs194.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index.cjs250.js");var n,p;function y(){if(p)return n;p=1;var c=u.__require();function o(){}function i(){}return i.resetWarningCache=o,n=function(){function e(h,m,f,l,T,s){if(s!==c){var a=new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types");throw a.name="Invariant Violation",a}}e.isRequired=e;function r(){return e}var t={array:e,bigint:e,bool:e,func:e,number:e,object:e,string:e,symbol:e,any:e,arrayOf:r,element:e,elementType:e,instanceOf:r,node:e,objectOf:r,oneOf:r,oneOfType:r,shape:r,exact:r,checkPropTypes:i,resetWarningCache:o};return t.PropTypes=t,t},n}exports.__require=y;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index.cjs249.js");var n,p;function y(){if(p)return n;p=1;var c=u.__require();function o(){}function i(){}return i.resetWarningCache=o,n=function(){function e(h,m,f,l,T,s){if(s!==c){var a=new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types");throw a.name="Invariant Violation",a}}e.isRequired=e;function r(){return e}var t={array:e,bigint:e,bool:e,func:e,number:e,object:e,string:e,symbol:e,any:e,arrayOf:r,element:e,elementType:e,instanceOf:r,node:e,objectOf:r,oneOf:r,oneOfType:r,shape:r,exact:r,checkPropTypes:i,resetWarningCache:o};return t.PropTypes=t,t},n}exports.__require=y;
 //# sourceMappingURL=index.cjs194.js.map

package/dist/index.cjs195.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs6.js");function u(t){var r="[object "+t+"]";return function(e){return n.toString.call(e)===r}}module.exports=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var e={exports:{}};exports.__module=e;
 //# sourceMappingURL=index.cjs195.js.map

package/dist/index.cjs195.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs195.js","sources":["../../../node_modules/underscore/modules/_tagTester.js"],"sourcesContent":["import { toString } from './_setup.js';\n\n// Internal function for creating a `toString`-based type tester.\nexport default function tagTester(name) {\n  var tag = '[object ' + name + ']';\n  return function(obj) {\n    return toString.call(obj) === tag;\n  };\n}\n"],"names":["tagTester","name","tag","obj","toString"],"mappings":"gDAGA,SAAwBA,EAAUC,EAAM,CAClC,IAAAC,EAAM,WAAaD,EAAO,IAC9B,OAAO,SAASE,EAAK,CACZ,OAAAC,WAAS,KAAKD,CAAG,IAAMD,CAAA,CAElC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs195.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/index.cjs196.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs6.js");function s(r,t){return r!=null&&e.hasOwnProperty.call(r,t)}module.exports=s;
+"use strict";function u(i){var e=0,t=i.children,n=t&&t.length;if(!n)e=1;else for(;--n>=0;)e+=t[n].value;i.value=e}function c(){return this.eachAfter(u)}module.exports=c;
 //# sourceMappingURL=index.cjs196.js.map

package/dist/index.cjs196.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs196.js","sources":["../../../node_modules/underscore/modules/_has.js"],"sourcesContent":["import { hasOwnProperty } from './_setup.js';\n\n// Internal function to check whether `key` is an own property name of `obj`.\nexport default function has(obj, key) {\n  return obj != null && hasOwnProperty.call(obj, key);\n}\n"],"names":["has","obj","key","hasOwnProperty"],"mappings":"gDAGwB,SAAAA,EAAIC,EAAKC,EAAK,CACpC,OAAOD,GAAO,MAAQE,EAAAA,eAAe,KAAKF,EAAKC,CAAG,CACpD","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs196.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/count.js"],"sourcesContent":["function count(node) {\n  var sum = 0,\n      children = node.children,\n      i = children && children.length;\n  if (!i) sum = 1;\n  else while (--i >= 0) sum += children[i].value;\n  node.value = sum;\n}\n\nexport default function() {\n  return this.eachAfter(count);\n}\n"],"names":["count","node","sum","children","i","node_count"],"mappings":"aAAA,SAASA,EAAMC,EAAM,CACnB,IAAIC,EAAM,EACNC,EAAWF,EAAK,SAChBG,EAAID,GAAYA,EAAS,OAC7B,GAAI,CAACC,EAASF,EAAA,MACT,MAAO,EAAEE,GAAK,GAAUF,GAAAC,EAASC,CAAC,EAAE,MACzCH,EAAK,MAAQC,CACf,CAE0B,SAAAG,GAAA,CACjB,OAAA,KAAK,UAAUL,CAAK,CAC7B","x_google_ignoreList":[0]}

package/dist/index.cjs197.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs254.js"),t=require("./index.cjs199.js"),r=e(t);module.exports=r;
+"use strict";function s(o){var e=this,h,n=[e],r,t,i;do for(h=n.reverse(),n=[];e=h.pop();)if(o(e),r=e.children,r)for(t=0,i=r.length;t<i;++t)n.push(r[t]);while(n.length);return this}module.exports=s;
 //# sourceMappingURL=index.cjs197.js.map

package/dist/index.cjs197.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs197.js","sources":["../../../node_modules/underscore/modules/_isBufferLike.js"],"sourcesContent":["import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getByteLength from './_getByteLength.js';\n\n// Internal helper to determine whether we should spend extensive checks against\n// `ArrayBuffer` et al.\nexport default createSizePropertyCheck(getByteLength);\n"],"names":["createSizePropertyCheck","getByteLength"],"mappings":"iFAKeA,EAAAA,EAAwBC,CAAa","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs197.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/each.js"],"sourcesContent":["export default function(callback) {\n  var node = this, current, next = [node], children, i, n;\n  do {\n    current = next.reverse(), next = [];\n    while (node = current.pop()) {\n      callback(node), children = node.children;\n      if (children) for (i = 0, n = children.length; i < n; ++i) {\n        next.push(children[i]);\n      }\n    }\n  } while (next.length);\n  return this;\n}\n"],"names":["node_each","callback","node","current","next","children","i","n"],"mappings":"aAAA,SAAAA,EAAwBC,EAAU,CAC5B,IAAAC,EAAO,KAAMC,EAASC,EAAO,CAACF,CAAI,EAAGG,EAAUC,EAAGC,EACnD,EAEM,KADPJ,EAAUC,EAAK,UAAWA,EAAO,CAAA,EAC1BF,EAAOC,EAAQ,OAEhB,GADKF,EAAAC,CAAI,EAAGG,EAAWH,EAAK,SAC5BG,EAAe,IAAAC,EAAI,EAAGC,EAAIF,EAAS,OAAQC,EAAIC,EAAG,EAAED,EACjDF,EAAA,KAAKC,EAASC,CAAC,CAAC,QAGlBF,EAAK,QACP,OAAA,IACT","x_google_ignoreList":[0]}

package/dist/index.cjs198.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs253.js"),e=t("length");module.exports=e;
+"use strict";function o(h){for(var e=this,r=[e],i,n;e=r.pop();)if(h(e),i=e.children,i)for(n=i.length-1;n>=0;--n)r.push(i[n]);return this}module.exports=o;
 //# sourceMappingURL=index.cjs198.js.map

package/dist/index.cjs198.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs198.js","sources":["../../../node_modules/underscore/modules/_getLength.js"],"sourcesContent":["import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `length` property of an object.\nexport default shallowProperty('length');\n"],"names":["shallowProperty"],"mappings":"kDAGeA,EAAAA,EAAgB,QAAQ","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs198.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/eachBefore.js"],"sourcesContent":["export default function(callback) {\n  var node = this, nodes = [node], children, i;\n  while (node = nodes.pop()) {\n    callback(node), children = node.children;\n    if (children) for (i = children.length - 1; i >= 0; --i) {\n      nodes.push(children[i]);\n    }\n  }\n  return this;\n}\n"],"names":["node_eachBefore","callback","node","nodes","children","i"],"mappings":"aAAA,SAAAA,EAAwBC,EAAU,CAEzB,QADHC,EAAO,KAAMC,EAAQ,CAACD,CAAI,EAAGE,EAAUC,EACpCH,EAAOC,EAAM,OAEd,GADKF,EAAAC,CAAI,EAAGE,EAAWF,EAAK,SAC5BE,EAAU,IAAKC,EAAID,EAAS,OAAS,EAAGC,GAAK,EAAG,EAAEA,EAC9CF,EAAA,KAAKC,EAASC,CAAC,CAAC,EAGnB,OAAA,IACT","x_google_ignoreList":[0]}

package/dist/index.cjs199.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs253.js"),e=t("byteLength");module.exports=e;
+"use strict";function s(o){for(var e=this,i=[e],t=[],n,h,r;e=i.pop();)if(t.push(e),n=e.children,n)for(h=0,r=n.length;h<r;++h)i.push(n[h]);for(;e=t.pop();)o(e);return this}module.exports=s;
 //# sourceMappingURL=index.cjs199.js.map

package/dist/index.cjs199.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs199.js","sources":["../../../node_modules/underscore/modules/_getByteLength.js"],"sourcesContent":["import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `byteLength` property of an object.\nexport default shallowProperty('byteLength');\n"],"names":["shallowProperty"],"mappings":"kDAGeA,EAAAA,EAAgB,YAAY","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs199.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/eachAfter.js"],"sourcesContent":["export default function(callback) {\n  var node = this, nodes = [node], next = [], children, i, n;\n  while (node = nodes.pop()) {\n    next.push(node), children = node.children;\n    if (children) for (i = 0, n = children.length; i < n; ++i) {\n      nodes.push(children[i]);\n    }\n  }\n  while (node = next.pop()) {\n    callback(node);\n  }\n  return this;\n}\n"],"names":["node_eachAfter","callback","node","nodes","next","children","i","n"],"mappings":"aAAA,SAAAA,EAAwBC,EAAU,CAEzB,QADHC,EAAO,KAAMC,EAAQ,CAACD,CAAI,EAAGE,EAAO,GAAIC,EAAUC,EAAGC,EAClDL,EAAOC,EAAM,OAEd,GADJC,EAAK,KAAKF,CAAI,EAAGG,EAAWH,EAAK,SAC7BG,EAAe,IAAAC,EAAI,EAAGC,EAAIF,EAAS,OAAQC,EAAIC,EAAG,EAAED,EAChDH,EAAA,KAAKE,EAASC,CAAC,CAAC,EAGnB,KAAAJ,EAAOE,EAAK,OACjBH,EAASC,CAAI,EAER,OAAA,IACT","x_google_ignoreList":[0]}

package/dist/index.cjs20.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs77.js"),i=require("./index.cjs7.js"),c=require("./index.cjs213.js"),s=e(function(n,r,o){if(!i(n))throw new TypeError("Bind must be called on a function");var t=e(function(u){return c(n,t,r,this,o.concat(u))});return t});module.exports=s;
+"use strict";const e=require("./index.cjs85.js"),i=require("./index.cjs7.js"),c=require("./index.cjs228.js"),s=e(function(n,r,o){if(!i(n))throw new TypeError("Bind must be called on a function");var t=e(function(u){return c(n,t,r,this,o.concat(u))});return t});module.exports=s;
 //# sourceMappingURL=index.cjs20.js.map

package/dist/index.cjs200.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs199.js");function n(t){return new Uint8Array(t.buffer||t,t.byteOffset||0,e(t))}module.exports=n;
+"use strict";function n(u){return this.eachAfter(function(e){for(var i=+u(e.data)||0,t=e.children,r=t&&t.length;--r>=0;)i+=t[r].value;e.value=i})}module.exports=n;
 //# sourceMappingURL=index.cjs200.js.map

package/dist/index.cjs200.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs200.js","sources":["../../../node_modules/underscore/modules/_toBufferView.js"],"sourcesContent":["import getByteLength from './_getByteLength.js';\n\n// Internal function to wrap or shallow-copy an ArrayBuffer,\n// typed array or DataView to a new view, reusing the buffer.\nexport default function toBufferView(bufferSource) {\n  return new Uint8Array(\n    bufferSource.buffer || bufferSource,\n    bufferSource.byteOffset || 0,\n    getByteLength(bufferSource)\n  );\n}\n"],"names":["toBufferView","bufferSource","getByteLength"],"mappings":"kDAIA,SAAwBA,EAAaC,EAAc,CACjD,OAAO,IAAI,WACTA,EAAa,QAAUA,EACvBA,EAAa,YAAc,EAC3BC,EAAcD,CAAY,CAAA,CAE9B","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs200.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/sum.js"],"sourcesContent":["export default function(value) {\n  return this.eachAfter(function(node) {\n    var sum = +value(node.data) || 0,\n        children = node.children,\n        i = children && children.length;\n    while (--i >= 0) sum += children[i].value;\n    node.value = sum;\n  });\n}\n"],"names":["node_sum","value","node","sum","children","i"],"mappings":"aAAA,SAAAA,EAAwBC,EAAO,CACtB,OAAA,KAAK,UAAU,SAASC,EAAM,CAInC,QAHIC,EAAM,CAACF,EAAMC,EAAK,IAAI,GAAK,EAC3BE,EAAWF,EAAK,SAChBG,EAAID,GAAYA,EAAS,OACtB,EAAEC,GAAK,GAAUF,GAAAC,EAASC,CAAC,EAAE,MACpCH,EAAK,MAAQC,CAAA,CACd,CACH","x_google_ignoreList":[0]}

package/dist/index.cjs201.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index.cjs198.js"),i=require("./index.cjs7.js"),h=require("./index.cjs100.js");function d(t){var f=s(t);return function(e){if(e==null)return!1;var l=h(e);if(s(l))return!1;for(var r=0;r<f;r++)if(!i(e[t[r]]))return!1;return t!==u||!i(e[a])}}var a="forEach",o="has",n=["clear","delete"],c=["get",o,"set"],M=n.concat(a,c),u=n.concat(c),g=["add"].concat(n,a,o);exports.ie11fingerprint=d;exports.mapMethods=M;exports.setMethods=g;exports.weakMapMethods=u;
+"use strict";function e(t){return this.eachBefore(function(r){r.children&&r.children.sort(t)})}module.exports=e;
 //# sourceMappingURL=index.cjs201.js.map

package/dist/index.cjs201.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs201.js","sources":["../../../node_modules/underscore/modules/_methodFingerprint.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport isFunction from './isFunction.js';\nimport allKeys from './allKeys.js';\n\n// Since the regular `Object.prototype.toString` type tests don't work for\n// some types in IE 11, we use a fingerprinting heuristic instead, based\n// on the methods. It's not great, but it's the best we got.\n// The fingerprint method lists are defined below.\nexport function ie11fingerprint(methods) {\n  var length = getLength(methods);\n  return function(obj) {\n    if (obj == null) return false;\n    // `Map`, `WeakMap` and `Set` have no enumerable keys.\n    var keys = allKeys(obj);\n    if (getLength(keys)) return false;\n    for (var i = 0; i < length; i++) {\n      if (!isFunction(obj[methods[i]])) return false;\n    }\n    // If we are testing against `WeakMap`, we need to ensure that\n    // `obj` doesn't have a `forEach` method in order to distinguish\n    // it from a regular `Map`.\n    return methods !== weakMapMethods || !isFunction(obj[forEachName]);\n  };\n}\n\n// In the interest of compact minification, we write\n// each string in the fingerprints only once.\nvar forEachName = 'forEach',\n    hasName = 'has',\n    commonInit = ['clear', 'delete'],\n    mapTail = ['get', hasName, 'set'];\n\n// `Map`, `WeakMap` and `Set` each have slightly different\n// combinations of the above sublists.\nexport var mapMethods = commonInit.concat(forEachName, mapTail),\n    weakMapMethods = commonInit.concat(mapTail),\n    setMethods = ['add'].concat(commonInit, forEachName, hasName);\n"],"names":["ie11fingerprint","methods","length","getLength","obj","keys","allKeys","i","isFunction","weakMapMethods","forEachName","hasName","commonInit","mapTail","mapMethods","setMethods"],"mappings":"iLAQO,SAASA,EAAgBC,EAAS,CACnC,IAAAC,EAASC,EAAUF,CAAO,EAC9B,OAAO,SAASG,EAAK,CACnB,GAAIA,GAAO,KAAa,MAAA,GAEpB,IAAAC,EAAOC,EAAQF,CAAG,EACtB,GAAID,EAAUE,CAAI,EAAU,MAAA,GAC5B,QAASE,EAAI,EAAGA,EAAIL,EAAQK,IAC1B,GAAI,CAACC,EAAWJ,EAAIH,EAAQM,CAAC,CAAC,CAAC,EAAU,MAAA,GAK3C,OAAON,IAAYQ,GAAkB,CAACD,EAAWJ,EAAIM,CAAW,CAAC,CAAA,CAErE,CAIA,IAAIA,EAAc,UACdC,EAAU,MACVC,EAAa,CAAC,QAAS,QAAQ,EAC/BC,EAAU,CAAC,MAAOF,EAAS,KAAK,EAIzBG,EAAaF,EAAW,OAAOF,EAAaG,CAAO,EAC1DJ,EAAiBG,EAAW,OAAOC,CAAO,EAC1CE,EAAa,CAAC,KAAK,EAAE,OAAOH,EAAYF,EAAaC,CAAO","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs201.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/sort.js"],"sourcesContent":["export default function(compare) {\n  return this.eachBefore(function(node) {\n    if (node.children) {\n      node.children.sort(compare);\n    }\n  });\n}\n"],"names":["node_sort","compare","node"],"mappings":"aAAA,SAAAA,EAAwBC,EAAS,CACxB,OAAA,KAAK,WAAW,SAASC,EAAM,CAChCA,EAAK,UACFA,EAAA,SAAS,KAAKD,CAAO,CAC5B,CACD,CACH","x_google_ignoreList":[0]}

package/dist/index.cjs202.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs6.js"),s=require("./index.cjs7.js"),i=require("./index.cjs196.js");function a(t){for(var n={},c=t.length,o=0;o<c;++o)n[t[o]]=!0;return{contains:function(u){return n[u]===!0},push:function(u){return n[u]=!0,t.push(u)}}}function p(t,n){n=a(n);var c=e.nonEnumerableProps.length,o=t.constructor,u=s(o)&&o.prototype||e.ObjProto,r="constructor";for(i(t,r)&&!n.contains(r)&&n.push(r);c--;)r=e.nonEnumerableProps[c],r in t&&t[r]!==u[r]&&!n.contains(r)&&n.push(r)}module.exports=p;
+"use strict";function n(t){for(var r=this,o=p(r,t),e=[r];r!==o;)r=r.parent,e.push(r);for(var s=e.length;t!==o;)e.splice(s,0,t),t=t.parent;return e}function p(t,r){if(t===r)return t;var o=t.ancestors(),e=r.ancestors(),s=null;for(t=o.pop(),r=e.pop();t===r;)s=t,t=o.pop(),r=e.pop();return s}module.exports=n;
 //# sourceMappingURL=index.cjs202.js.map

package/dist/index.cjs202.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs202.js","sources":["../../../node_modules/underscore/modules/_collectNonEnumProps.js"],"sourcesContent":["import { nonEnumerableProps, ObjProto } from './_setup.js';\nimport isFunction from './isFunction.js';\nimport has from './_has.js';\n\n// Internal helper to create a simple lookup structure.\n// `collectNonEnumProps` used to depend on `_.contains`, but this led to\n// circular imports. `emulatedSet` is a one-off solution that only works for\n// arrays of strings.\nfunction emulatedSet(keys) {\n  var hash = {};\n  for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;\n  return {\n    contains: function(key) { return hash[key] === true; },\n    push: function(key) {\n      hash[key] = true;\n      return keys.push(key);\n    }\n  };\n}\n\n// Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't\n// be iterated by `for key in ...` and thus missed. Extends `keys` in place if\n// needed.\nexport default function collectNonEnumProps(obj, keys) {\n  keys = emulatedSet(keys);\n  var nonEnumIdx = nonEnumerableProps.length;\n  var constructor = obj.constructor;\n  var proto = (isFunction(constructor) && constructor.prototype) || ObjProto;\n\n  // Constructor is a special case.\n  var prop = 'constructor';\n  if (has(obj, prop) && !keys.contains(prop)) keys.push(prop);\n\n  while (nonEnumIdx--) {\n    prop = nonEnumerableProps[nonEnumIdx];\n    if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {\n      keys.push(prop);\n    }\n  }\n}\n"],"names":["emulatedSet","keys","hash","l","i","key","collectNonEnumProps","obj","nonEnumIdx","nonEnumerableProps","constructor","proto","isFunction","ObjProto","prop","has"],"mappings":"4GAQA,SAASA,EAAYC,EAAM,CAEzB,QADIC,EAAO,CAAA,EACFC,EAAIF,EAAK,OAAQG,EAAI,EAAGA,EAAID,EAAG,EAAEC,EAAQF,EAAAD,EAAKG,CAAC,CAAC,EAAI,GACtD,MAAA,CACL,SAAU,SAASC,EAAK,CAAS,OAAAH,EAAKG,CAAG,IAAM,EAAM,EACrD,KAAM,SAASA,EAAK,CAClB,OAAAH,EAAKG,CAAG,EAAI,GACLJ,EAAK,KAAKI,CAAG,CACtB,CAAA,CAEJ,CAKwB,SAAAC,EAAoBC,EAAKN,EAAM,CACrDA,EAAOD,EAAYC,CAAI,EACvB,IAAIO,EAAaC,EAAmB,mBAAA,OAChCC,EAAcH,EAAI,YAClBI,EAASC,EAAWF,CAAW,GAAKA,EAAY,WAAcG,WAG9DC,EAAO,cAGX,IAFIC,EAAIR,EAAKO,CAAI,GAAK,CAACb,EAAK,SAASa,CAAI,GAAGb,EAAK,KAAKa,CAAI,EAEnDN,KACLM,EAAOL,EAAAA,mBAAmBD,CAAU,EAChCM,KAAQP,GAAOA,EAAIO,CAAI,IAAMH,EAAMG,CAAI,GAAK,CAACb,EAAK,SAASa,CAAI,GACjEb,EAAK,KAAKa,CAAI,CAGpB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs202.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/path.js"],"sourcesContent":["export default function(end) {\n  var start = this,\n      ancestor = leastCommonAncestor(start, end),\n      nodes = [start];\n  while (start !== ancestor) {\n    start = start.parent;\n    nodes.push(start);\n  }\n  var k = nodes.length;\n  while (end !== ancestor) {\n    nodes.splice(k, 0, end);\n    end = end.parent;\n  }\n  return nodes;\n}\n\nfunction leastCommonAncestor(a, b) {\n  if (a === b) return a;\n  var aNodes = a.ancestors(),\n      bNodes = b.ancestors(),\n      c = null;\n  a = aNodes.pop();\n  b = bNodes.pop();\n  while (a === b) {\n    c = a;\n    a = aNodes.pop();\n    b = bNodes.pop();\n  }\n  return c;\n}\n"],"names":["node_path","end","start","ancestor","leastCommonAncestor","nodes","k","a","b","aNodes","bNodes","c"],"mappings":"aAAA,SAAAA,EAAwBC,EAAK,CAI3B,QAHIC,EAAQ,KACRC,EAAWC,EAAoBF,EAAOD,CAAG,EACzCI,EAAQ,CAACH,CAAK,EACXA,IAAUC,GACfD,EAAQA,EAAM,OACdG,EAAM,KAAKH,CAAK,EAGlB,QADII,EAAID,EAAM,OACPJ,IAAQE,GACPE,EAAA,OAAOC,EAAG,EAAGL,CAAG,EACtBA,EAAMA,EAAI,OAEL,OAAAI,CACT,CAEA,SAASD,EAAoBG,EAAGC,EAAG,CACjC,GAAID,IAAMC,EAAU,OAAAD,EAChB,IAAAE,EAASF,EAAE,YACXG,EAASF,EAAE,UAAA,EACXG,EAAI,KAGR,IAFAJ,EAAIE,EAAO,MACXD,EAAIE,EAAO,MACJH,IAAMC,GACPG,EAAAJ,EACJA,EAAIE,EAAO,MACXD,EAAIE,EAAO,MAEN,OAAAC,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs203.js

@@ -1,2 +1,2 @@
-"use strict";function i(v,e){return function(r){var u=arguments.length;if(e&&(r=Object(r)),u<2||r==null)return r;for(var t=1;t<u;t++)for(var f=arguments[t],g=v(f),c=g.length,n=0;n<c;n++){var a=g[n];(!e||r[a]===void 0)&&(r[a]=f[a])}return r}}module.exports=i;
+"use strict";function s(){for(var e=this,n=[e];e=e.parent;)n.push(e);return n}module.exports=s;
 //# sourceMappingURL=index.cjs203.js.map

package/dist/index.cjs203.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs203.js","sources":["../../../node_modules/underscore/modules/_createAssigner.js"],"sourcesContent":["// An internal function for creating assigner functions.\nexport default function createAssigner(keysFunc, defaults) {\n  return function(obj) {\n    var length = arguments.length;\n    if (defaults) obj = Object(obj);\n    if (length < 2 || obj == null) return obj;\n    for (var index = 1; index < length; index++) {\n      var source = arguments[index],\n          keys = keysFunc(source),\n          l = keys.length;\n      for (var i = 0; i < l; i++) {\n        var key = keys[i];\n        if (!defaults || obj[key] === void 0) obj[key] = source[key];\n      }\n    }\n    return obj;\n  };\n}\n"],"names":["createAssigner","keysFunc","defaults","obj","length","index","source","keys","l","i","key"],"mappings":"aACwB,SAAAA,EAAeC,EAAUC,EAAU,CACzD,OAAO,SAASC,EAAK,CACnB,IAAIC,EAAS,UAAU,OAEnB,GADAF,IAAUC,EAAM,OAAOA,CAAG,GAC1BC,EAAS,GAAKD,GAAO,KAAa,OAAAA,EACtC,QAASE,EAAQ,EAAGA,EAAQD,EAAQC,IAIlC,QAHIC,EAAS,UAAUD,CAAK,EACxBE,EAAON,EAASK,CAAM,EACtBE,EAAID,EAAK,OACJE,EAAI,EAAGA,EAAID,EAAGC,IAAK,CACtB,IAAAC,EAAMH,EAAKE,CAAC,GACZ,CAACP,GAAYC,EAAIO,CAAG,IAAM,UAAYP,EAAAO,CAAG,EAAIJ,EAAOI,CAAG,EAC7D,CAEK,OAAAP,CAAA,CAEX","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs203.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/ancestors.js"],"sourcesContent":["export default function() {\n  var node = this, nodes = [node];\n  while (node = node.parent) {\n    nodes.push(node);\n  }\n  return nodes;\n}\n"],"names":["node_ancestors","node","nodes"],"mappings":"aAA0B,SAAAA,GAAA,CAEjB,QADHC,EAAO,KAAMC,EAAQ,CAACD,CAAI,EACvBA,EAAOA,EAAK,QACjBC,EAAM,KAAKD,CAAI,EAEV,OAAAC,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs204.js

@@ -1,2 +1,2 @@
-"use strict";const u=require("./index.cjs78.js"),t=require("./index.cjs6.js");function i(){return function(){}}function s(e){if(!u(e))return{};if(t.nativeCreate)return t.nativeCreate(e);var r=i();r.prototype=e;var n=new r;return r.prototype=null,n}module.exports=s;
+"use strict";function s(){var n=[];return this.each(function(e){n.push(e)}),n}module.exports=s;
 //# sourceMappingURL=index.cjs204.js.map

package/dist/index.cjs204.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs204.js","sources":["../../../node_modules/underscore/modules/_baseCreate.js"],"sourcesContent":["import isObject from './isObject.js';\nimport { nativeCreate } from './_setup.js';\n\n// Create a naked function reference for surrogate-prototype-swapping.\nfunction ctor() {\n  return function(){};\n}\n\n// An internal function for creating a new object that inherits from another.\nexport default function baseCreate(prototype) {\n  if (!isObject(prototype)) return {};\n  if (nativeCreate) return nativeCreate(prototype);\n  var Ctor = ctor();\n  Ctor.prototype = prototype;\n  var result = new Ctor;\n  Ctor.prototype = null;\n  return result;\n}\n"],"names":["ctor","baseCreate","prototype","isObject","nativeCreate","Ctor","result"],"mappings":"8EAIA,SAASA,GAAO,CACd,OAAO,UAAU,CAAA,CACnB,CAGA,SAAwBC,EAAWC,EAAW,CACxC,GAAA,CAACC,EAASD,CAAS,EAAG,MAAO,GAC7B,GAAAE,EAAA,aAAc,OAAOA,EAAAA,aAAaF,CAAS,EAC/C,IAAIG,EAAOL,IACXK,EAAK,UAAYH,EACjB,IAAII,EAAS,IAAID,EACjB,OAAAA,EAAK,UAAY,KACVC,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs204.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/descendants.js"],"sourcesContent":["export default function() {\n  var nodes = [];\n  this.each(function(node) {\n    nodes.push(node);\n  });\n  return nodes;\n}\n"],"names":["node_descendants","nodes","node"],"mappings":"aAA0B,SAAAA,GAAA,CACxB,IAAIC,EAAQ,CAAA,EACP,YAAA,KAAK,SAASC,EAAM,CACvBD,EAAM,KAAKC,CAAI,CAAA,CAChB,EACMD,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs205.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs10.js");require("./index.cjs14.js");function e(r){return t.toPath(r)}module.exports=e;
+"use strict";function s(){var e=[];return this.eachBefore(function(r){r.children||e.push(r)}),e}module.exports=s;
 //# sourceMappingURL=index.cjs205.js.map

package/dist/index.cjs205.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs205.js","sources":["../../../node_modules/underscore/modules/_toPath.js"],"sourcesContent":["import _ from './underscore.js';\nimport './toPath.js';\n\n// Internal wrapper for `_.toPath` to enable minification.\n// Similar to `cb` for `_.iteratee`.\nexport default function toPath(path) {\n  return _.toPath(path);\n}\n"],"names":["toPath","path","_"],"mappings":"6EAKA,SAAwBA,EAAOC,EAAM,CAC5B,OAAAC,EAAE,OAAOD,CAAI,CACtB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs205.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/leaves.js"],"sourcesContent":["export default function() {\n  var leaves = [];\n  this.eachBefore(function(node) {\n    if (!node.children) {\n      leaves.push(node);\n    }\n  });\n  return leaves;\n}\n"],"names":["node_leaves","leaves","node"],"mappings":"aAA0B,SAAAA,GAAA,CACxB,IAAIC,EAAS,CAAA,EACR,YAAA,WAAW,SAASC,EAAM,CACxBA,EAAK,UACRD,EAAO,KAAKC,CAAI,CAClB,CACD,EACMD,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs206.js

@@ -1,2 +1,2 @@
-"use strict";function u(e,t){for(var n=t.length,r=0;r<n;r++){if(e==null)return;e=e[t[r]]}return n?e:void 0}module.exports=u;
+"use strict";function i(){var r=this,s=[];return r.each(function(t){t!==r&&s.push({source:t.parent,target:t})}),s}module.exports=i;
 //# sourceMappingURL=index.cjs206.js.map

package/dist/index.cjs206.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs206.js","sources":["../../../node_modules/underscore/modules/_deepGet.js"],"sourcesContent":["// Internal function to obtain a nested property in `obj` along `path`.\nexport default function deepGet(obj, path) {\n  var length = path.length;\n  for (var i = 0; i < length; i++) {\n    if (obj == null) return void 0;\n    obj = obj[path[i]];\n  }\n  return length ? obj : void 0;\n}\n"],"names":["deepGet","obj","path","length","i"],"mappings":"aACwB,SAAAA,EAAQC,EAAKC,EAAM,CAEzC,QADIC,EAASD,EAAK,OACTE,EAAI,EAAGA,EAAID,EAAQC,IAAK,CAC/B,GAAIH,GAAO,KAAa,OAClBA,EAAAA,EAAIC,EAAKE,CAAC,CAAC,CACnB,CACA,OAAOD,EAASF,EAAM,MACxB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs206.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/links.js"],"sourcesContent":["export default function() {\n  var root = this, links = [];\n  root.each(function(node) {\n    if (node !== root) { // Don’t include the root’s parent, if any.\n      links.push({source: node.parent, target: node});\n    }\n  });\n  return links;\n}\n"],"names":["node_links","root","links","node"],"mappings":"aAA0B,SAAAA,GAAA,CACpB,IAAAC,EAAO,KAAMC,EAAQ,GACpB,OAAAD,EAAA,KAAK,SAASE,EAAM,CACnBA,IAASF,GACXC,EAAM,KAAK,CAAC,OAAQC,EAAK,OAAQ,OAAQA,EAAK,CAChD,CACD,EACMD,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs207.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs10.js"),s=require("./index.cjs212.js"),n=require("./index.cjs15.js");function u(e,r,i){return t.iteratee!==n?t.iteratee(e,r):s(e,r,i)}module.exports=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function c(t){var e=typeof t;return t!=null&&(e=="object"||e=="function")}var i=c;exports.isObject_1=i;
 //# sourceMappingURL=index.cjs207.js.map

package/dist/index.cjs207.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs207.js","sources":["../../../node_modules/underscore/modules/_cb.js"],"sourcesContent":["import _ from './underscore.js';\nimport baseIteratee from './_baseIteratee.js';\nimport iteratee from './iteratee.js';\n\n// The function we call internally to generate a callback. It invokes\n// `_.iteratee` if overridden, otherwise `baseIteratee`.\nexport default function cb(value, context, argCount) {\n  if (_.iteratee !== iteratee) return _.iteratee(value, context);\n  return baseIteratee(value, context, argCount);\n}\n"],"names":["cb","value","context","argCount","_","iteratee","baseIteratee"],"mappings":"8GAMwB,SAAAA,EAAGC,EAAOC,EAASC,EAAU,CACnD,OAAIC,EAAE,WAAaC,EAAiBD,EAAE,SAASH,EAAOC,CAAO,EACtDI,EAAaL,EAAOC,EAASC,CAAQ,CAC9C","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs207.js","sources":["../../../node_modules/lodash/isObject.js"],"sourcesContent":["/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n"],"names":["isObject","value","type","isObject_1"],"mappings":"gFAyBA,SAASA,EAASC,EAAO,CACvB,IAAIC,EAAO,OAAOD,EAClB,OAAOA,GAAS,OAASC,GAAQ,UAAYA,GAAQ,WACvD,CAEA,IAAAC,EAAiBH","x_google_ignoreList":[0]}

package/dist/index.cjs208.js

@@ -1,2 +1,2 @@
-"use strict";function s(r,e,t){if(e===void 0)return r;switch(t??3){case 1:return function(n){return r.call(e,n)};case 3:return function(n,u,i){return r.call(e,n,u,i)};case 4:return function(n,u,i,l){return r.call(e,n,u,i,l)}}return function(){return r.apply(e,arguments)}}module.exports=s;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index.cjs256.js");var r=o._root,t=function(){return r.Date.now()},e=t;exports.now_1=e;
 //# sourceMappingURL=index.cjs208.js.map

package/dist/index.cjs208.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs208.js","sources":["../../../node_modules/underscore/modules/_optimizeCb.js"],"sourcesContent":["// Internal function that returns an efficient (for current engines) version\n// of the passed-in callback, to be repeatedly applied in other Underscore\n// functions.\nexport default function optimizeCb(func, context, argCount) {\n  if (context === void 0) return func;\n  switch (argCount == null ? 3 : argCount) {\n    case 1: return function(value) {\n      return func.call(context, value);\n    };\n    // The 2-argument case is omitted because we’re not using it.\n    case 3: return function(value, index, collection) {\n      return func.call(context, value, index, collection);\n    };\n    case 4: return function(accumulator, value, index, collection) {\n      return func.call(context, accumulator, value, index, collection);\n    };\n  }\n  return function() {\n    return func.apply(context, arguments);\n  };\n}\n"],"names":["optimizeCb","func","context","argCount","value","index","collection","accumulator"],"mappings":"aAGwB,SAAAA,EAAWC,EAAMC,EAASC,EAAU,CAC1D,GAAID,IAAY,OAAe,OAAAD,EACvB,OAAAE,GAAmB,EAAc,CACvC,IAAK,GAAG,OAAO,SAASC,EAAO,CACtB,OAAAH,EAAK,KAAKC,EAASE,CAAK,CAAA,EAGjC,IAAK,GAAU,OAAA,SAASA,EAAOC,EAAOC,EAAY,CAChD,OAAOL,EAAK,KAAKC,EAASE,EAAOC,EAAOC,CAAU,CAAA,EAEpD,IAAK,GAAG,OAAO,SAASC,EAAaH,EAAOC,EAAOC,EAAY,CAC7D,OAAOL,EAAK,KAAKC,EAASK,EAAaH,EAAOC,EAAOC,CAAU,CAAA,CAEnE,CACA,OAAO,UAAW,CACT,OAAAL,EAAK,MAAMC,EAAS,SAAS,CAAA,CAExC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs208.js","sources":["../../../node_modules/lodash/now.js"],"sourcesContent":["var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n"],"names":["root","require$$0","now","now_1"],"mappings":"qHAAA,IAAIA,EAAOC,EAAAA,MAkBPC,EAAM,UAAW,CACZ,OAAAF,EAAK,KAAK,KACnB,EAEAG,EAAiBD","x_google_ignoreList":[0]}

package/dist/index.cjs209.js

@@ -1,2 +1,2 @@
-"use strict";const p=require("./index.cjs99.js");function n(r){var t=function(e){return r[e]},c="(?:"+p(r).join("|")+")",u=RegExp(c),a=RegExp(c,"g");return function(e){return e=e==null?"":""+e,u.test(e)?e.replace(a,t):e}}module.exports=n;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index.cjs257.js"),o=require("./index.cjs207.js"),b=require("./index.cjs258.js");var f=n._baseTrim,s=o.isObject_1,c=b.isSymbol_1,e=NaN,m=/^[-+]0x[0-9a-f]+$/i,y=/^0b[01]+$/i,O=/^0o[0-7]+$/i,_=parseInt;function a(r){if(typeof r=="number")return r;if(c(r))return e;if(s(r)){var t=typeof r.valueOf=="function"?r.valueOf():r;r=s(t)?t+"":t}if(typeof r!="string")return r===0?r:+r;r=f(r);var i=y.test(r);return i||O.test(r)?_(r.slice(2),i?2:8):m.test(r)?e:+r}var p=a;exports.toNumber_1=p;
 //# sourceMappingURL=index.cjs209.js.map

package/dist/index.cjs209.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs209.js","sources":["../../../node_modules/underscore/modules/_createEscaper.js"],"sourcesContent":["import keys from './keys.js';\n\n// Internal helper to generate functions for escaping and unescaping strings\n// to/from HTML interpolation.\nexport default function createEscaper(map) {\n  var escaper = function(match) {\n    return map[match];\n  };\n  // Regexes for identifying a key that needs to be escaped.\n  var source = '(?:' + keys(map).join('|') + ')';\n  var testRegexp = RegExp(source);\n  var replaceRegexp = RegExp(source, 'g');\n  return function(string) {\n    string = string == null ? '' : '' + string;\n    return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;\n  };\n}\n"],"names":["createEscaper","map","escaper","match","source","keys","testRegexp","replaceRegexp","string"],"mappings":"iDAIA,SAAwBA,EAAcC,EAAK,CACrC,IAAAC,EAAU,SAASC,EAAO,CAC5B,OAAOF,EAAIE,CAAK,CAAA,EAGdC,EAAS,MAAQC,EAAKJ,CAAG,EAAE,KAAK,GAAG,EAAI,IACvCK,EAAa,OAAOF,CAAM,EAC1BG,EAAgB,OAAOH,EAAQ,GAAG,EACtC,OAAO,SAASI,EAAQ,CACb,OAAAA,EAAAA,GAAU,KAAO,GAAK,GAAKA,EAC7BF,EAAW,KAAKE,CAAM,EAAIA,EAAO,QAAQD,EAAeL,CAAO,EAAIM,CAAA,CAE9E","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs209.js","sources":["../../../node_modules/lodash/toNumber.js"],"sourcesContent":["var baseTrim = require('./_baseTrim'),\n    isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n"],"names":["baseTrim","require$$0","isObject","require$$1","isSymbol","require$$2","NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","toNumber","value","other","isBinary","toNumber_1"],"mappings":"mLAAA,IAAIA,EAAWC,EAAAA,UACXC,EAAWC,EAAAA,WACXC,EAAWC,EAAAA,WAGXC,EAAM,IAGNC,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAe,SAyBnB,SAASC,EAASC,EAAO,CACnB,GAAA,OAAOA,GAAS,SACX,OAAAA,EAEL,GAAAR,EAASQ,CAAK,EACT,OAAAN,EAEL,GAAAJ,EAASU,CAAK,EAAG,CACnB,IAAIC,EAAQ,OAAOD,EAAM,SAAW,WAAaA,EAAM,QAAY,EAAAA,EACnEA,EAAQV,EAASW,CAAK,EAAKA,EAAQ,GAAMA,CAC3C,CACI,GAAA,OAAOD,GAAS,SACX,OAAAA,IAAU,EAAIA,EAAQ,CAACA,EAEhCA,EAAQZ,EAASY,CAAK,EAClB,IAAAE,EAAWN,EAAW,KAAKI,CAAK,EACpC,OAAQE,GAAYL,EAAU,KAAKG,CAAK,EACpCF,EAAaE,EAAM,MAAM,CAAC,EAAGE,EAAW,EAAI,CAAC,EAC5CP,EAAW,KAAKK,CAAK,EAAIN,EAAM,CAACM,CACvC,CAEA,IAAAG,EAAiBJ","x_google_ignoreList":[0]}

package/dist/index.cjs21.js

@@ -1,2 +1,2 @@
-"use strict";const i=require("./index.cjs77.js"),s=require("./index.cjs214.js"),l=require("./index.cjs20.js"),u=i(function(n,r){r=s(r,!1,!1);var e=r.length;if(e<1)throw new Error("bindAll must be passed function names");for(;e--;){var t=r[e];n[t]=l(n[t],n)}return n});module.exports=u;
+"use strict";const i=require("./index.cjs85.js"),s=require("./index.cjs229.js"),l=require("./index.cjs20.js"),u=i(function(n,r){r=s(r,!1,!1);var e=r.length;if(e<1)throw new Error("bindAll must be passed function names");for(;e--;){var t=r[e];n[t]=l(n[t],n)}return n});module.exports=u;
 //# sourceMappingURL=index.cjs21.js.map

package/dist/index.cjs210.js

@@ -1,2 +1,2 @@
-"use strict";const t={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&#x27;","`":"&#x60;"};module.exports=t;
+"use strict";const n=require("./index.cjs6.js");function u(t){var r="[object "+t+"]";return function(e){return n.toString.call(e)===r}}module.exports=u;
 //# sourceMappingURL=index.cjs210.js.map

package/dist/index.cjs210.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs210.js","sources":["../../../node_modules/underscore/modules/_escapeMap.js"],"sourcesContent":["// Internal list of HTML entities for escaping.\nexport default {\n  '&': '&amp;',\n  '<': '&lt;',\n  '>': '&gt;',\n  '\"': '&quot;',\n  \"'\": '&#x27;',\n  '`': '&#x60;'\n};\n"],"names":["escapeMap"],"mappings":"aACA,MAAeA,EAAA,CACb,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SACL,IAAK,QACP","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs210.js","sources":["../../../node_modules/underscore/modules/_tagTester.js"],"sourcesContent":["import { toString } from './_setup.js';\n\n// Internal function for creating a `toString`-based type tester.\nexport default function tagTester(name) {\n  var tag = '[object ' + name + ']';\n  return function(obj) {\n    return toString.call(obj) === tag;\n  };\n}\n"],"names":["tagTester","name","tag","obj","toString"],"mappings":"gDAGA,SAAwBA,EAAUC,EAAM,CAClC,IAAAC,EAAM,WAAaD,EAAO,IAC9B,OAAO,SAASE,EAAK,CACZ,OAAAC,WAAS,KAAKD,CAAG,IAAMD,CAAA,CAElC","x_google_ignoreList":[0]}

package/dist/index.cjs211.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs103.js"),s=require("./index.cjs210.js"),r=e(s);module.exports=r;
+"use strict";const e=require("./index.cjs6.js");function s(r,t){return r!=null&&e.hasOwnProperty.call(r,t)}module.exports=s;
 //# sourceMappingURL=index.cjs211.js.map

package/dist/index.cjs211.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs211.js","sources":["../../../node_modules/underscore/modules/_unescapeMap.js"],"sourcesContent":["import invert from './invert.js';\nimport escapeMap from './_escapeMap.js';\n\n// Internal list of HTML entities for unescaping.\nexport default invert(escapeMap);\n"],"names":["unescapeMap","invert","escapeMap"],"mappings":"iFAIeA,EAAAC,EAAOC,CAAS","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs211.js","sources":["../../../node_modules/underscore/modules/_has.js"],"sourcesContent":["import { hasOwnProperty } from './_setup.js';\n\n// Internal function to check whether `key` is an own property name of `obj`.\nexport default function has(obj, key) {\n  return obj != null && hasOwnProperty.call(obj, key);\n}\n"],"names":["has","obj","key","hasOwnProperty"],"mappings":"gDAGwB,SAAAA,EAAIC,EAAKC,EAAK,CACpC,OAAOD,GAAO,MAAQE,EAAAA,eAAe,KAAKF,EAAKC,CAAG,CACpD","x_google_ignoreList":[0]}

package/dist/index.cjs212.js

@@ -1,2 +1,2 @@
-"use strict";const i=require("./index.cjs114.js"),n=require("./index.cjs7.js"),s=require("./index.cjs78.js"),c=require("./index.cjs91.js"),o=require("./index.cjs119.js"),u=require("./index.cjs117.js"),q=require("./index.cjs208.js");function f(r,t,e){return r==null?i:n(r)?q(r,t,e):s(r)&&!c(r)?o(r):u(r)}module.exports=f;
+"use strict";const e=require("./index.cjs265.js"),t=require("./index.cjs214.js"),r=e(t);module.exports=r;
 //# sourceMappingURL=index.cjs212.js.map

package/dist/index.cjs212.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs212.js","sources":["../../../node_modules/underscore/modules/_baseIteratee.js"],"sourcesContent":["import identity from './identity.js';\nimport isFunction from './isFunction.js';\nimport isObject from './isObject.js';\nimport isArray from './isArray.js';\nimport matcher from './matcher.js';\nimport property from './property.js';\nimport optimizeCb from './_optimizeCb.js';\n\n// An internal function to generate callbacks that can be applied to each\n// element in a collection, returning the desired result — either `_.identity`,\n// an arbitrary callback, a property matcher, or a property accessor.\nexport default function baseIteratee(value, context, argCount) {\n  if (value == null) return identity;\n  if (isFunction(value)) return optimizeCb(value, context, argCount);\n  if (isObject(value) && !isArray(value)) return matcher(value);\n  return property(value);\n}\n"],"names":["baseIteratee","value","context","argCount","identity","isFunction","optimizeCb","isObject","isArray","matcher","property"],"mappings":"wOAWwB,SAAAA,EAAaC,EAAOC,EAASC,EAAU,CAC7D,OAAIF,GAAS,KAAaG,EACtBC,EAAWJ,CAAK,EAAUK,EAAWL,EAAOC,EAASC,CAAQ,EAC7DI,EAASN,CAAK,GAAK,CAACO,EAAQP,CAAK,EAAUQ,EAAQR,CAAK,EACrDS,EAAST,CAAK,CACvB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs212.js","sources":["../../../node_modules/underscore/modules/_isBufferLike.js"],"sourcesContent":["import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getByteLength from './_getByteLength.js';\n\n// Internal helper to determine whether we should spend extensive checks against\n// `ArrayBuffer` et al.\nexport default createSizePropertyCheck(getByteLength);\n"],"names":["createSizePropertyCheck","getByteLength"],"mappings":"iFAKeA,EAAAA,EAAwBC,CAAa","x_google_ignoreList":[0]}

package/dist/index.cjs213.js

@@ -1,2 +1,2 @@
-"use strict";const a=require("./index.cjs204.js"),o=require("./index.cjs78.js");function u(e,n,p,s,t){if(!(s instanceof n))return e.apply(p,t);var r=a(e.prototype),i=e.apply(r,t);return o(i)?i:r}module.exports=u;
+"use strict";const t=require("./index.cjs264.js"),e=t("length");module.exports=e;
 //# sourceMappingURL=index.cjs213.js.map

package/dist/index.cjs213.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs213.js","sources":["../../../node_modules/underscore/modules/_executeBound.js"],"sourcesContent":["import baseCreate from './_baseCreate.js';\nimport isObject from './isObject.js';\n\n// Internal function to execute `sourceFunc` bound to `context` with optional\n// `args`. Determines whether to execute a function as a constructor or as a\n// normal function.\nexport default function executeBound(sourceFunc, boundFunc, context, callingContext, args) {\n  if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);\n  var self = baseCreate(sourceFunc.prototype);\n  var result = sourceFunc.apply(self, args);\n  if (isObject(result)) return result;\n  return self;\n}\n"],"names":["executeBound","sourceFunc","boundFunc","context","callingContext","args","self","baseCreate","result","isObject"],"mappings":"gFAMA,SAAwBA,EAAaC,EAAYC,EAAWC,EAASC,EAAgBC,EAAM,CACzF,GAAI,EAAED,aAA0BF,GAAmB,OAAAD,EAAW,MAAME,EAASE,CAAI,EAC7E,IAAAC,EAAOC,EAAWN,EAAW,SAAS,EACtCO,EAASP,EAAW,MAAMK,EAAMD,CAAI,EACxC,OAAII,EAASD,CAAM,EAAUA,EACtBF,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs213.js","sources":["../../../node_modules/underscore/modules/_getLength.js"],"sourcesContent":["import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `length` property of an object.\nexport default shallowProperty('length');\n"],"names":["shallowProperty"],"mappings":"kDAGeA,EAAAA,EAAgB,QAAQ","x_google_ignoreList":[0]}

package/dist/index.cjs214.js

@@ -1,2 +1,2 @@
-"use strict";const a=require("./index.cjs198.js"),l=require("./index.cjs217.js"),x=require("./index.cjs91.js"),L=require("./index.cjs9.js");function q(i,n,c,r){if(r=r||[],!n&&n!==0)n=1/0;else if(n<=0)return r.concat(i);for(var s=r.length,f=0,y=a(i);f<y;f++){var e=i[f];if(l(e)&&(x(e)||L(e)))if(n>1)q(e,n-1,c,r),s=r.length;else for(var g=0,A=e.length;g<A;)r[s++]=e[g++];else c||(r[s++]=e)}return r}module.exports=q;
+"use strict";const t=require("./index.cjs264.js"),e=t("byteLength");module.exports=e;
 //# sourceMappingURL=index.cjs214.js.map

package/dist/index.cjs214.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs214.js","sources":["../../../node_modules/underscore/modules/_flatten.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport isArrayLike from './_isArrayLike.js';\nimport isArray from './isArray.js';\nimport isArguments from './isArguments.js';\n\n// Internal implementation of a recursive `flatten` function.\nexport default function flatten(input, depth, strict, output) {\n  output = output || [];\n  if (!depth && depth !== 0) {\n    depth = Infinity;\n  } else if (depth <= 0) {\n    return output.concat(input);\n  }\n  var idx = output.length;\n  for (var i = 0, length = getLength(input); i < length; i++) {\n    var value = input[i];\n    if (isArrayLike(value) && (isArray(value) || isArguments(value))) {\n      // Flatten current level of array or arguments object.\n      if (depth > 1) {\n        flatten(value, depth - 1, strict, output);\n        idx = output.length;\n      } else {\n        var j = 0, len = value.length;\n        while (j < len) output[idx++] = value[j++];\n      }\n    } else if (!strict) {\n      output[idx++] = value;\n    }\n  }\n  return output;\n}\n"],"names":["flatten","input","depth","strict","output","idx","i","length","getLength","value","isArrayLike","isArray","isArguments","j","len"],"mappings":"4IAMA,SAAwBA,EAAQC,EAAOC,EAAOC,EAAQC,EAAQ,CAExD,GADJA,EAASA,GAAU,GACf,CAACF,GAASA,IAAU,EACdA,EAAA,YACCA,GAAS,EACX,OAAAE,EAAO,OAAOH,CAAK,EAGnB,QADLI,EAAMD,EAAO,OACRE,EAAI,EAAGC,EAASC,EAAUP,CAAK,EAAGK,EAAIC,EAAQD,IAAK,CACtD,IAAAG,EAAQR,EAAMK,CAAC,EACf,GAAAI,EAAYD,CAAK,IAAME,EAAQF,CAAK,GAAKG,EAAYH,CAAK,GAE5D,GAAIP,EAAQ,EACVF,EAAQS,EAAOP,EAAQ,EAAGC,EAAQC,CAAM,EACxCC,EAAMD,EAAO,WAGb,SADIS,EAAI,EAAGC,EAAML,EAAM,OAChBI,EAAIC,GAAYV,EAAAC,GAAK,EAAII,EAAMI,GAAG,OAEjCV,IACVC,EAAOC,GAAK,EAAII,EAEpB,CACO,OAAAL,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs214.js","sources":["../../../node_modules/underscore/modules/_getByteLength.js"],"sourcesContent":["import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `byteLength` property of an object.\nexport default shallowProperty('byteLength');\n"],"names":["shallowProperty"],"mappings":"kDAGeA,EAAAA,EAAgB,YAAY","x_google_ignoreList":[0]}

package/dist/index.cjs215.js

@@ -1,2 +1,2 @@
-"use strict";const i=require("./index.cjs207.js"),o=require("./index.cjs198.js");function s(r){return function(n,t,c){t=i(t,c);for(var u=o(n),e=r>0?0:u-1;e>=0&&e<u;e+=r)if(t(n[e],e,n))return e;return-1}}module.exports=s;
+"use strict";const e=require("./index.cjs214.js");function n(t){return new Uint8Array(t.buffer||t,t.byteOffset||0,e(t))}module.exports=n;
 //# sourceMappingURL=index.cjs215.js.map

package/dist/index.cjs215.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs215.js","sources":["../../../node_modules/underscore/modules/_createPredicateIndexFinder.js"],"sourcesContent":["import cb from './_cb.js';\nimport getLength from './_getLength.js';\n\n// Internal function to generate `_.findIndex` and `_.findLastIndex`.\nexport default function createPredicateIndexFinder(dir) {\n  return function(array, predicate, context) {\n    predicate = cb(predicate, context);\n    var length = getLength(array);\n    var index = dir > 0 ? 0 : length - 1;\n    for (; index >= 0 && index < length; index += dir) {\n      if (predicate(array[index], index, array)) return index;\n    }\n    return -1;\n  };\n}\n"],"names":["createPredicateIndexFinder","dir","array","predicate","context","cb","length","getLength","index"],"mappings":"iFAIA,SAAwBA,EAA2BC,EAAK,CAC/C,OAAA,SAASC,EAAOC,EAAWC,EAAS,CAC7BD,EAAAE,EAAGF,EAAWC,CAAO,EAGjC,QAFIE,EAASC,EAAUL,CAAK,EACxBM,EAAQP,EAAM,EAAI,EAAIK,EAAS,EAC5BE,GAAS,GAAKA,EAAQF,EAAQE,GAASP,EAC5C,GAAIE,EAAUD,EAAMM,CAAK,EAAGA,EAAON,CAAK,EAAU,OAAAM,EAE7C,MAAA,EAAA,CAEX","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs215.js","sources":["../../../node_modules/underscore/modules/_toBufferView.js"],"sourcesContent":["import getByteLength from './_getByteLength.js';\n\n// Internal function to wrap or shallow-copy an ArrayBuffer,\n// typed array or DataView to a new view, reusing the buffer.\nexport default function toBufferView(bufferSource) {\n  return new Uint8Array(\n    bufferSource.buffer || bufferSource,\n    bufferSource.byteOffset || 0,\n    getByteLength(bufferSource)\n  );\n}\n"],"names":["toBufferView","bufferSource","getByteLength"],"mappings":"kDAIA,SAAwBA,EAAaC,EAAc,CACjD,OAAO,IAAI,WACTA,EAAa,QAAUA,EACvBA,EAAa,YAAc,EAC3BC,EAAcD,CAAY,CAAA,CAE9B","x_google_ignoreList":[0]}

package/dist/index.cjs216.js

@@ -1,2 +1,2 @@
-"use strict";const o=require("./index.cjs198.js"),l=require("./index.cjs6.js"),h=require("./index.cjs93.js");function g(s,f,c){return function(t,u,e){var r=0,n=o(t);if(typeof e=="number")s>0?r=e>=0?e:Math.max(e+n,r):n=e>=0?Math.min(e+1,n):e+n+1;else if(c&&e&&n)return e=c(t,u),t[e]===u?e:-1;if(u!==u)return e=f(l.slice.call(t,r,n),h),e>=0?e+r:-1;for(e=s>0?r:n-1;e>=0&&e<n;e+=s)if(t[e]===u)return e;return-1}}module.exports=g;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index.cjs213.js"),i=require("./index.cjs7.js"),h=require("./index.cjs108.js");function d(t){var f=s(t);return function(e){if(e==null)return!1;var l=h(e);if(s(l))return!1;for(var r=0;r<f;r++)if(!i(e[t[r]]))return!1;return t!==u||!i(e[a])}}var a="forEach",o="has",n=["clear","delete"],c=["get",o,"set"],M=n.concat(a,c),u=n.concat(c),g=["add"].concat(n,a,o);exports.ie11fingerprint=d;exports.mapMethods=M;exports.setMethods=g;exports.weakMapMethods=u;
 //# sourceMappingURL=index.cjs216.js.map

package/dist/index.cjs216.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs216.js","sources":["../../../node_modules/underscore/modules/_createIndexFinder.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport { slice } from './_setup.js';\nimport isNaN from './isNaN.js';\n\n// Internal function to generate the `_.indexOf` and `_.lastIndexOf` functions.\nexport default function createIndexFinder(dir, predicateFind, sortedIndex) {\n  return function(array, item, idx) {\n    var i = 0, length = getLength(array);\n    if (typeof idx == 'number') {\n      if (dir > 0) {\n        i = idx >= 0 ? idx : Math.max(idx + length, i);\n      } else {\n        length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;\n      }\n    } else if (sortedIndex && idx && length) {\n      idx = sortedIndex(array, item);\n      return array[idx] === item ? idx : -1;\n    }\n    if (item !== item) {\n      idx = predicateFind(slice.call(array, i, length), isNaN);\n      return idx >= 0 ? idx + i : -1;\n    }\n    for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {\n      if (array[idx] === item) return idx;\n    }\n    return -1;\n  };\n}\n"],"names":["createIndexFinder","dir","predicateFind","sortedIndex","array","item","idx","i","length","getLength","slice","isNaN"],"mappings":"6GAKwB,SAAAA,EAAkBC,EAAKC,EAAeC,EAAa,CAClE,OAAA,SAASC,EAAOC,EAAMC,EAAK,CAChC,IAAIC,EAAI,EAAGC,EAASC,EAAUL,CAAK,EAC/B,GAAA,OAAOE,GAAO,SACZL,EAAM,EACRM,EAAID,GAAO,EAAIA,EAAM,KAAK,IAAIA,EAAME,EAAQD,CAAC,EAEpCC,EAAAF,GAAO,EAAI,KAAK,IAAIA,EAAM,EAAGE,CAAM,EAAIF,EAAME,EAAS,UAExDL,GAAeG,GAAOE,EACzB,OAAAF,EAAAH,EAAYC,EAAOC,CAAI,EACtBD,EAAME,CAAG,IAAMD,EAAOC,EAAM,GAErC,GAAID,IAASA,EACX,OAAAC,EAAMJ,EAAcQ,EAAAA,MAAM,KAAKN,EAAOG,EAAGC,CAAM,EAAGG,CAAK,EAChDL,GAAO,EAAIA,EAAMC,EAAI,GAEzB,IAAAD,EAAML,EAAM,EAAIM,EAAIC,EAAS,EAAGF,GAAO,GAAKA,EAAME,EAAQF,GAAOL,EAChE,GAAAG,EAAME,CAAG,IAAMD,EAAa,OAAAC,EAE3B,MAAA,EAAA,CAEX","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs216.js","sources":["../../../node_modules/underscore/modules/_methodFingerprint.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport isFunction from './isFunction.js';\nimport allKeys from './allKeys.js';\n\n// Since the regular `Object.prototype.toString` type tests don't work for\n// some types in IE 11, we use a fingerprinting heuristic instead, based\n// on the methods. It's not great, but it's the best we got.\n// The fingerprint method lists are defined below.\nexport function ie11fingerprint(methods) {\n  var length = getLength(methods);\n  return function(obj) {\n    if (obj == null) return false;\n    // `Map`, `WeakMap` and `Set` have no enumerable keys.\n    var keys = allKeys(obj);\n    if (getLength(keys)) return false;\n    for (var i = 0; i < length; i++) {\n      if (!isFunction(obj[methods[i]])) return false;\n    }\n    // If we are testing against `WeakMap`, we need to ensure that\n    // `obj` doesn't have a `forEach` method in order to distinguish\n    // it from a regular `Map`.\n    return methods !== weakMapMethods || !isFunction(obj[forEachName]);\n  };\n}\n\n// In the interest of compact minification, we write\n// each string in the fingerprints only once.\nvar forEachName = 'forEach',\n    hasName = 'has',\n    commonInit = ['clear', 'delete'],\n    mapTail = ['get', hasName, 'set'];\n\n// `Map`, `WeakMap` and `Set` each have slightly different\n// combinations of the above sublists.\nexport var mapMethods = commonInit.concat(forEachName, mapTail),\n    weakMapMethods = commonInit.concat(mapTail),\n    setMethods = ['add'].concat(commonInit, forEachName, hasName);\n"],"names":["ie11fingerprint","methods","length","getLength","obj","keys","allKeys","i","isFunction","weakMapMethods","forEachName","hasName","commonInit","mapTail","mapMethods","setMethods"],"mappings":"iLAQO,SAASA,EAAgBC,EAAS,CACnC,IAAAC,EAASC,EAAUF,CAAO,EAC9B,OAAO,SAASG,EAAK,CACnB,GAAIA,GAAO,KAAa,MAAA,GAEpB,IAAAC,EAAOC,EAAQF,CAAG,EACtB,GAAID,EAAUE,CAAI,EAAU,MAAA,GAC5B,QAASE,EAAI,EAAGA,EAAIL,EAAQK,IAC1B,GAAI,CAACC,EAAWJ,EAAIH,EAAQM,CAAC,CAAC,CAAC,EAAU,MAAA,GAK3C,OAAON,IAAYQ,GAAkB,CAACD,EAAWJ,EAAIM,CAAW,CAAC,CAAA,CAErE,CAIA,IAAIA,EAAc,UACdC,EAAU,MACVC,EAAa,CAAC,QAAS,QAAQ,EAC/BC,EAAU,CAAC,MAAOF,EAAS,KAAK,EAIzBG,EAAaF,EAAW,OAAOF,EAAaG,CAAO,EAC1DJ,EAAiBG,EAAW,OAAOC,CAAO,EAC1CE,EAAa,CAAC,KAAK,EAAE,OAAOH,EAAYF,EAAaC,CAAO","x_google_ignoreList":[0]}

package/dist/index.cjs217.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs254.js"),r=require("./index.cjs198.js"),t=e(r);module.exports=t;
+"use strict";const e=require("./index.cjs6.js"),s=require("./index.cjs7.js"),i=require("./index.cjs211.js");function a(t){for(var n={},c=t.length,o=0;o<c;++o)n[t[o]]=!0;return{contains:function(u){return n[u]===!0},push:function(u){return n[u]=!0,t.push(u)}}}function p(t,n){n=a(n);var c=e.nonEnumerableProps.length,o=t.constructor,u=s(o)&&o.prototype||e.ObjProto,r="constructor";for(i(t,r)&&!n.contains(r)&&n.push(r);c--;)r=e.nonEnumerableProps[c],r in t&&t[r]!==u[r]&&!n.contains(r)&&n.push(r)}module.exports=p;
 //# sourceMappingURL=index.cjs217.js.map

package/dist/index.cjs217.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs217.js","sources":["../../../node_modules/underscore/modules/_isArrayLike.js"],"sourcesContent":["import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getLength from './_getLength.js';\n\n// Internal helper for collection methods to determine whether a collection\n// should be iterated as an array or as an object.\n// Related: https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength\n// Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094\nexport default createSizePropertyCheck(getLength);\n"],"names":["createSizePropertyCheck","getLength"],"mappings":"iFAOeA,EAAAA,EAAwBC,CAAS","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs217.js","sources":["../../../node_modules/underscore/modules/_collectNonEnumProps.js"],"sourcesContent":["import { nonEnumerableProps, ObjProto } from './_setup.js';\nimport isFunction from './isFunction.js';\nimport has from './_has.js';\n\n// Internal helper to create a simple lookup structure.\n// `collectNonEnumProps` used to depend on `_.contains`, but this led to\n// circular imports. `emulatedSet` is a one-off solution that only works for\n// arrays of strings.\nfunction emulatedSet(keys) {\n  var hash = {};\n  for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;\n  return {\n    contains: function(key) { return hash[key] === true; },\n    push: function(key) {\n      hash[key] = true;\n      return keys.push(key);\n    }\n  };\n}\n\n// Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't\n// be iterated by `for key in ...` and thus missed. Extends `keys` in place if\n// needed.\nexport default function collectNonEnumProps(obj, keys) {\n  keys = emulatedSet(keys);\n  var nonEnumIdx = nonEnumerableProps.length;\n  var constructor = obj.constructor;\n  var proto = (isFunction(constructor) && constructor.prototype) || ObjProto;\n\n  // Constructor is a special case.\n  var prop = 'constructor';\n  if (has(obj, prop) && !keys.contains(prop)) keys.push(prop);\n\n  while (nonEnumIdx--) {\n    prop = nonEnumerableProps[nonEnumIdx];\n    if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {\n      keys.push(prop);\n    }\n  }\n}\n"],"names":["emulatedSet","keys","hash","l","i","key","collectNonEnumProps","obj","nonEnumIdx","nonEnumerableProps","constructor","proto","isFunction","ObjProto","prop","has"],"mappings":"4GAQA,SAASA,EAAYC,EAAM,CAEzB,QADIC,EAAO,CAAA,EACFC,EAAIF,EAAK,OAAQG,EAAI,EAAGA,EAAID,EAAG,EAAEC,EAAQF,EAAAD,EAAKG,CAAC,CAAC,EAAI,GACtD,MAAA,CACL,SAAU,SAASC,EAAK,CAAS,OAAAH,EAAKG,CAAG,IAAM,EAAM,EACrD,KAAM,SAASA,EAAK,CAClB,OAAAH,EAAKG,CAAG,EAAI,GACLJ,EAAK,KAAKI,CAAG,CACtB,CAAA,CAEJ,CAKwB,SAAAC,EAAoBC,EAAKN,EAAM,CACrDA,EAAOD,EAAYC,CAAI,EACvB,IAAIO,EAAaC,EAAmB,mBAAA,OAChCC,EAAcH,EAAI,YAClBI,EAASC,EAAWF,CAAW,GAAKA,EAAY,WAAcG,WAG9DC,EAAO,cAGX,IAFIC,EAAIR,EAAKO,CAAI,GAAK,CAACb,EAAK,SAASa,CAAI,GAAGb,EAAK,KAAKa,CAAI,EAEnDN,KACLM,EAAOL,EAAAA,mBAAmBD,CAAU,EAChCM,KAAQP,GAAOA,EAAIO,CAAI,IAAMH,EAAMG,CAAI,GAAK,CAACb,EAAK,SAASa,CAAI,GACjEb,EAAK,KAAKa,CAAI,CAGpB","x_google_ignoreList":[0]}