@performant-software/visualize 2.3.3-beta.7 → 2.3.3-beta.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (225) hide show
  1. package/dist/index.cjs179.js +1 -1
  2. package/dist/index.cjs180.js +1 -1
  3. package/dist/index.cjs181.js +1 -1
  4. package/dist/index.cjs183.js +1 -1
  5. package/dist/index.cjs185.js +1 -1
  6. package/dist/index.cjs185.js.map +1 -1
  7. package/dist/index.cjs186.js +1 -1
  8. package/dist/index.cjs186.js.map +1 -1
  9. package/dist/index.cjs187.js +1 -1
  10. package/dist/index.cjs187.js.map +1 -1
  11. package/dist/index.cjs188.js +1 -1
  12. package/dist/index.cjs188.js.map +1 -1
  13. package/dist/index.cjs189.js +1 -1
  14. package/dist/index.cjs189.js.map +1 -1
  15. package/dist/index.cjs192.js +1 -1
  16. package/dist/index.cjs193.js +1 -1
  17. package/dist/index.cjs194.js +1 -1
  18. package/dist/index.cjs197.js +1 -1
  19. package/dist/index.cjs197.js.map +1 -1
  20. package/dist/index.cjs198.js +1 -1
  21. package/dist/index.cjs198.js.map +1 -1
  22. package/dist/index.cjs199.js +1 -1
  23. package/dist/index.cjs199.js.map +1 -1
  24. package/dist/index.cjs200.js +1 -1
  25. package/dist/index.cjs200.js.map +1 -1
  26. package/dist/index.cjs203.js +1 -1
  27. package/dist/index.cjs204.js +1 -1
  28. package/dist/index.cjs205.js +1 -1
  29. package/dist/index.cjs223.js +1 -1
  30. package/dist/index.cjs232.js +1 -1
  31. package/dist/index.cjs234.js +1 -1
  32. package/dist/index.cjs234.js.map +1 -1
  33. package/dist/index.cjs235.js +8 -1
  34. package/dist/index.cjs235.js.map +1 -1
  35. package/dist/index.cjs236.js +8 -1
  36. package/dist/index.cjs236.js.map +1 -1
  37. package/dist/index.cjs237.js +5 -1
  38. package/dist/index.cjs237.js.map +1 -1
  39. package/dist/index.cjs238.js +1 -1
  40. package/dist/index.cjs238.js.map +1 -1
  41. package/dist/index.cjs239.js +1 -1
  42. package/dist/index.cjs239.js.map +1 -1
  43. package/dist/index.cjs240.js +1 -1
  44. package/dist/index.cjs240.js.map +1 -1
  45. package/dist/index.cjs241.js +1 -1
  46. package/dist/index.cjs241.js.map +1 -1
  47. package/dist/index.cjs242.js +1 -1
  48. package/dist/index.cjs242.js.map +1 -1
  49. package/dist/index.cjs243.js +1 -1
  50. package/dist/index.cjs243.js.map +1 -1
  51. package/dist/index.cjs244.js +1 -1
  52. package/dist/index.cjs244.js.map +1 -1
  53. package/dist/index.cjs245.js +1 -1
  54. package/dist/index.cjs245.js.map +1 -1
  55. package/dist/index.cjs246.js +1 -8
  56. package/dist/index.cjs246.js.map +1 -1
  57. package/dist/index.cjs247.js +1 -8
  58. package/dist/index.cjs247.js.map +1 -1
  59. package/dist/index.cjs248.js +1 -5
  60. package/dist/index.cjs248.js.map +1 -1
  61. package/dist/index.cjs249.js +1 -1
  62. package/dist/index.cjs249.js.map +1 -1
  63. package/dist/index.cjs250.js +1 -1
  64. package/dist/index.cjs250.js.map +1 -1
  65. package/dist/index.cjs251.js +1 -1
  66. package/dist/index.cjs251.js.map +1 -1
  67. package/dist/index.cjs252.js +1 -1
  68. package/dist/index.cjs253.js +1 -1
  69. package/dist/index.cjs254.js +1 -1
  70. package/dist/index.cjs255.js +1 -1
  71. package/dist/index.cjs255.js.map +1 -1
  72. package/dist/index.cjs256.js +1 -1
  73. package/dist/index.cjs256.js.map +1 -1
  74. package/dist/index.cjs257.js +1 -1
  75. package/dist/index.cjs257.js.map +1 -1
  76. package/dist/index.cjs258.js +1 -1
  77. package/dist/index.cjs258.js.map +1 -1
  78. package/dist/index.cjs259.js +1 -1
  79. package/dist/index.cjs259.js.map +1 -1
  80. package/dist/index.cjs260.js +1 -1
  81. package/dist/index.cjs260.js.map +1 -1
  82. package/dist/index.cjs261.js +1 -1
  83. package/dist/index.cjs261.js.map +1 -1
  84. package/dist/index.cjs262.js +1 -1
  85. package/dist/index.cjs262.js.map +1 -1
  86. package/dist/index.cjs264.js +1 -1
  87. package/dist/index.cjs264.js.map +1 -1
  88. package/dist/index.cjs265.js +1 -1
  89. package/dist/index.cjs265.js.map +1 -1
  90. package/dist/index.cjs266.js +1 -1
  91. package/dist/index.cjs266.js.map +1 -1
  92. package/dist/index.cjs267.js +1 -1
  93. package/dist/index.cjs267.js.map +1 -1
  94. package/dist/index.cjs268.js +1 -1
  95. package/dist/index.cjs268.js.map +1 -1
  96. package/dist/index.cjs272.js +1 -1
  97. package/dist/index.cjs272.js.map +1 -1
  98. package/dist/index.cjs273.js +1 -1
  99. package/dist/index.cjs273.js.map +1 -1
  100. package/dist/index.cjs274.js +1 -1
  101. package/dist/index.cjs274.js.map +1 -1
  102. package/dist/index.cjs275.js +1 -1
  103. package/dist/index.cjs275.js.map +1 -1
  104. package/dist/index.cjs277.js +1 -1
  105. package/dist/index.cjs280.js +1 -1
  106. package/dist/index.cjs291.js +1 -1
  107. package/dist/index.cjs294.js +1 -1
  108. package/dist/index.cjs36.js +1 -1
  109. package/dist/index.cjs37.js +1 -1
  110. package/dist/index.cjs65.js +1 -1
  111. package/dist/index.cjs76.js +1 -1
  112. package/dist/index.cjs8.js +1 -1
  113. package/dist/index.es179.js +3 -3
  114. package/dist/index.es180.js +2 -2
  115. package/dist/index.es181.js +3 -3
  116. package/dist/index.es183.js +4 -4
  117. package/dist/index.es185.js +32 -34
  118. package/dist/index.es185.js.map +1 -1
  119. package/dist/index.es186.js +16 -23
  120. package/dist/index.es186.js.map +1 -1
  121. package/dist/index.es187.js +36 -84
  122. package/dist/index.es187.js.map +1 -1
  123. package/dist/index.es188.js +21 -33
  124. package/dist/index.es188.js.map +1 -1
  125. package/dist/index.es189.js +84 -15
  126. package/dist/index.es189.js.map +1 -1
  127. package/dist/index.es192.js +3 -3
  128. package/dist/index.es193.js +4 -4
  129. package/dist/index.es194.js +1 -1
  130. package/dist/index.es197.js +6 -2
  131. package/dist/index.es197.js.map +1 -1
  132. package/dist/index.es198.js +5 -6
  133. package/dist/index.es198.js.map +1 -1
  134. package/dist/index.es199.js +21 -5
  135. package/dist/index.es199.js.map +1 -1
  136. package/dist/index.es200.js +2 -21
  137. package/dist/index.es200.js.map +1 -1
  138. package/dist/index.es203.js +1 -1
  139. package/dist/index.es204.js +1 -1
  140. package/dist/index.es205.js +1 -1
  141. package/dist/index.es223.js +1 -1
  142. package/dist/index.es232.js +1 -1
  143. package/dist/index.es234.js +2 -13
  144. package/dist/index.es234.js.map +1 -1
  145. package/dist/index.es235.js +76 -10
  146. package/dist/index.es235.js.map +1 -1
  147. package/dist/index.es236.js +95 -7
  148. package/dist/index.es236.js.map +1 -1
  149. package/dist/index.es237.js +52 -9
  150. package/dist/index.es237.js.map +1 -1
  151. package/dist/index.es238.js +8 -7
  152. package/dist/index.es238.js.map +1 -1
  153. package/dist/index.es239.js +4 -5
  154. package/dist/index.es239.js.map +1 -1
  155. package/dist/index.es240.js +52 -15
  156. package/dist/index.es240.js.map +1 -1
  157. package/dist/index.es241.js +12 -5
  158. package/dist/index.es241.js.map +1 -1
  159. package/dist/index.es242.js +10 -6
  160. package/dist/index.es242.js.map +1 -1
  161. package/dist/index.es243.js +7 -6
  162. package/dist/index.es243.js.map +1 -1
  163. package/dist/index.es244.js +9 -6
  164. package/dist/index.es244.js.map +1 -1
  165. package/dist/index.es245.js +8 -2
  166. package/dist/index.es245.js.map +1 -1
  167. package/dist/index.es246.js +5 -76
  168. package/dist/index.es246.js.map +1 -1
  169. package/dist/index.es247.js +15 -95
  170. package/dist/index.es247.js.map +1 -1
  171. package/dist/index.es248.js +5 -52
  172. package/dist/index.es248.js.map +1 -1
  173. package/dist/index.es249.js +6 -8
  174. package/dist/index.es249.js.map +1 -1
  175. package/dist/index.es250.js +6 -4
  176. package/dist/index.es250.js.map +1 -1
  177. package/dist/index.es251.js +6 -52
  178. package/dist/index.es251.js.map +1 -1
  179. package/dist/index.es252.js +1 -1
  180. package/dist/index.es253.js +1 -1
  181. package/dist/index.es254.js +2 -2
  182. package/dist/index.es255.js +3 -29
  183. package/dist/index.es255.js.map +1 -1
  184. package/dist/index.es256.js +8 -35
  185. package/dist/index.es256.js.map +1 -1
  186. package/dist/index.es257.js +6 -10
  187. package/dist/index.es257.js.map +1 -1
  188. package/dist/index.es258.js +29 -4
  189. package/dist/index.es258.js.map +1 -1
  190. package/dist/index.es259.js +34 -7
  191. package/dist/index.es259.js.map +1 -1
  192. package/dist/index.es260.js +10 -3
  193. package/dist/index.es260.js.map +1 -1
  194. package/dist/index.es261.js +4 -6
  195. package/dist/index.es261.js.map +1 -1
  196. package/dist/index.es262.js +8 -8
  197. package/dist/index.es262.js.map +1 -1
  198. package/dist/index.es264.js +3 -6
  199. package/dist/index.es264.js.map +1 -1
  200. package/dist/index.es265.js +2 -4
  201. package/dist/index.es265.js.map +1 -1
  202. package/dist/index.es266.js +6 -2
  203. package/dist/index.es266.js.map +1 -1
  204. package/dist/index.es267.js +7 -5
  205. package/dist/index.es267.js.map +1 -1
  206. package/dist/index.es268.js +6 -7
  207. package/dist/index.es268.js.map +1 -1
  208. package/dist/index.es272.js +3 -8
  209. package/dist/index.es272.js.map +1 -1
  210. package/dist/index.es273.js +7 -8
  211. package/dist/index.es273.js.map +1 -1
  212. package/dist/index.es274.js +8 -4
  213. package/dist/index.es274.js.map +1 -1
  214. package/dist/index.es275.js +5 -3
  215. package/dist/index.es275.js.map +1 -1
  216. package/dist/index.es277.js +1 -1
  217. package/dist/index.es280.js +1 -1
  218. package/dist/index.es291.js +1 -1
  219. package/dist/index.es294.js +1 -1
  220. package/dist/index.es36.js +3 -3
  221. package/dist/index.es37.js +11 -11
  222. package/dist/index.es65.js +2 -2
  223. package/dist/index.es76.js +1 -1
  224. package/dist/index.es8.js +1 -1
  225. package/package.json +1 -1
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index.cjs283.js"),n=require("./index.cjs284.js"),g=require("./index.cjs285.js");var t=r._Symbol,a=n._getRawTag,i=g._objectToString,T="[object Null]",b="[object Undefined]",o=t?t.toStringTag:void 0;function c(e){return e==null?e===void 0?b:T:o&&o in Object(e)?a(e):i(e)}var S=c;exports._baseGetTag=S;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var r=/\s/;function d(t){for(var e=t.length;e--&&r.test(t.charAt(e)););return e}var n=d;exports._trimmedEndIndex=n;
2
2
  //# sourceMappingURL=index.cjs273.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.cjs273.js","sources":["../../../node_modules/lodash/_baseGetTag.js"],"sourcesContent":["var Symbol = require('./_Symbol'),\n getRawTag = require('./_getRawTag'),\n objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n"],"names":["Symbol","require$$0","getRawTag","require$$1","objectToString","require$$2","nullTag","undefinedTag","symToStringTag","baseGetTag","value","_baseGetTag"],"mappings":"mLAAA,IAAIA,EAASC,EAAAA,QACTC,EAAYC,EAAAA,WACZC,EAAiBC,EAAAA,gBAGjBC,EAAU,gBACVC,EAAe,qBAGfC,EAAiBR,EAASA,EAAO,YAAc,OASnD,SAASS,EAAWC,EAAO,CACzB,OAAIA,GAAS,KACJA,IAAU,OAAYH,EAAeD,EAEtCE,GAAkBA,KAAkB,OAAOE,CAAK,EACpDR,EAAUQ,CAAK,EACfN,EAAeM,CAAK,CAC1B,CAEA,IAAAC,EAAiBF","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index.cjs273.js","sources":["../../../node_modules/lodash/_trimmedEndIndex.js"],"sourcesContent":["/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n}\n\nmodule.exports = trimmedEndIndex;\n"],"names":["reWhitespace","trimmedEndIndex","string","index","_trimmedEndIndex"],"mappings":"gFACA,IAAIA,EAAe,KAUnB,SAASC,EAAgBC,EAAQ,CAG/B,QAFIC,EAAQD,EAAO,OAEZC,KAAWH,EAAa,KAAKE,EAAO,OAAOC,CAAK,CAAC,GAAG,CACpD,OAAAA,CACT,CAEA,IAAAC,EAAiBH","x_google_ignoreList":[0]}
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e){return e!=null&&typeof e=="object"}var i=t;exports.isObjectLike_1=i;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index.cjs283.js"),n=require("./index.cjs284.js"),g=require("./index.cjs285.js");var t=r._Symbol,a=n._getRawTag,i=g._objectToString,T="[object Null]",b="[object Undefined]",o=t?t.toStringTag:void 0;function c(e){return e==null?e===void 0?b:T:o&&o in Object(e)?a(e):i(e)}var S=c;exports._baseGetTag=S;
2
2
  //# sourceMappingURL=index.cjs274.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.cjs274.js","sources":["../../../node_modules/lodash/isObjectLike.js"],"sourcesContent":["/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n"],"names":["isObjectLike","value","isObjectLike_1"],"mappings":"gFAwBA,SAASA,EAAaC,EAAO,CACpB,OAAAA,GAAS,MAAQ,OAAOA,GAAS,QAC1C,CAEA,IAAAC,EAAiBF","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index.cjs274.js","sources":["../../../node_modules/lodash/_baseGetTag.js"],"sourcesContent":["var Symbol = require('./_Symbol'),\n getRawTag = require('./_getRawTag'),\n objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n"],"names":["Symbol","require$$0","getRawTag","require$$1","objectToString","require$$2","nullTag","undefinedTag","symToStringTag","baseGetTag","value","_baseGetTag"],"mappings":"mLAAA,IAAIA,EAASC,EAAAA,QACTC,EAAYC,EAAAA,WACZC,EAAiBC,EAAAA,gBAGjBC,EAAU,gBACVC,EAAe,qBAGfC,EAAiBR,EAASA,EAAO,YAAc,OASnD,SAASS,EAAWC,EAAO,CACzB,OAAIA,GAAS,KACJA,IAAU,OAAYH,EAAeD,EAEtCE,GAAkBA,KAAkB,OAAOE,CAAK,EACpDR,EAAUQ,CAAK,EACfN,EAAeM,CAAK,CAC1B,CAEA,IAAAC,EAAiBF","x_google_ignoreList":[0]}
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("./index.cjs190.js");var e=typeof o.commonjsGlobal=="object"&&o.commonjsGlobal&&o.commonjsGlobal.Object===Object&&o.commonjsGlobal,l=e;exports._freeGlobal=l;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e){return e!=null&&typeof e=="object"}var i=t;exports.isObjectLike_1=i;
2
2
  //# sourceMappingURL=index.cjs275.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.cjs275.js","sources":["../../../node_modules/lodash/_freeGlobal.js"],"sourcesContent":["/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n"],"names":["freeGlobal","global","_freeGlobal"],"mappings":"qHACA,IAAIA,EAAa,OAAOC,EAAA,gBAAU,UAAYA,EAAAA,gBAAUA,EAAAA,eAAO,SAAW,QAAUA,iBAEpFC,EAAiBF","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index.cjs275.js","sources":["../../../node_modules/lodash/isObjectLike.js"],"sourcesContent":["/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n"],"names":["isObjectLike","value","isObjectLike_1"],"mappings":"gFAwBA,SAASA,EAAaC,EAAO,CACpB,OAAAA,GAAS,MAAQ,OAAOA,GAAS,QAC1C,CAEA,IAAAC,EAAiBF","x_google_ignoreList":[0]}
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index.cjs258.js");var d=function(){function i(t,h,e,o){return this.x=t,this.y=h,this.width=e,this.height=o,this.top=this.y,this.left=this.x,this.bottom=this.top+this.height,this.right=this.left+this.width,y.freeze(this)}return i.prototype.toJSON=function(){var t=this,h=t.x,e=t.y,o=t.top,r=t.right,s=t.bottom,n=t.left,f=t.width,u=t.height;return{x:h,y:e,top:o,right:r,bottom:s,left:n,width:f,height:u}},i.fromRect=function(t){return new i(t.x,t.y,t.width,t.height)},i}();exports.DOMRectReadOnly=d;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("./index.cjs261.js");var d=function(){function i(t,h,e,o){return this.x=t,this.y=h,this.width=e,this.height=o,this.top=this.y,this.left=this.x,this.bottom=this.top+this.height,this.right=this.left+this.width,y.freeze(this)}return i.prototype.toJSON=function(){var t=this,h=t.x,e=t.y,o=t.top,r=t.right,s=t.bottom,n=t.left,f=t.width,u=t.height;return{x:h,y:e,top:o,right:r,bottom:s,left:n,width:f,height:u}},i.fromRect=function(t){return new i(t.x,t.y,t.width,t.height)},i}();exports.DOMRectReadOnly=d;
2
2
  //# sourceMappingURL=index.cjs277.js.map
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index.cjs276.js"),o=require("./index.cjs181.js"),t=require("./index.cjs256.js");var n=function(e){return!t.isSVG(e)&&!t.isReplacedElement(e)&&getComputedStyle(e).display==="inline"},l=function(){function e(i,s){this.target=i,this.observedBox=s||r.ResizeObserverBoxOptions.CONTENT_BOX,this.lastReportedSize={inlineSize:0,blockSize:0}}return e.prototype.isActive=function(){var i=o.calculateBoxSize(this.target,this.observedBox,!0);return n(this.target)&&(this.lastReportedSize=i),this.lastReportedSize.inlineSize!==i.inlineSize||this.lastReportedSize.blockSize!==i.blockSize},e}();exports.ResizeObservation=l;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index.cjs276.js"),o=require("./index.cjs181.js"),t=require("./index.cjs259.js");var n=function(e){return!t.isSVG(e)&&!t.isReplacedElement(e)&&getComputedStyle(e).display==="inline"},l=function(){function e(i,s){this.target=i,this.observedBox=s||r.ResizeObserverBoxOptions.CONTENT_BOX,this.lastReportedSize={inlineSize:0,blockSize:0}}return e.prototype.isActive=function(){var i=o.calculateBoxSize(this.target,this.observedBox,!0);return n(this.target)&&(this.lastReportedSize=i),this.lastReportedSize.inlineSize!==i.inlineSize||this.lastReportedSize.blockSize!==i.blockSize},e}();exports.ResizeObservation=l;
2
2
  //# sourceMappingURL=index.cjs280.js.map
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index.cjs282.js"),b=require("./index.cjs257.js"),g=require("./index.cjs294.js"),h=require("./index.cjs181.js");var f=function(){var t=1/0,s=[];u.resizeObservers.forEach(function(e){if(e.activeTargets.length!==0){var i=[];e.activeTargets.forEach(function(r){var o=new b.ResizeObserverEntry(r.target),n=g.calculateDepthForNode(r.target);i.push(o),r.lastReportedSize=h.calculateBoxSize(r.target,r.observedBox),n<t&&(t=n)}),s.push(function(){e.callback.call(e.observer,i,e.observer)}),e.activeTargets.splice(0,e.activeTargets.length)}});for(var a=0,c=s;a<c.length;a++){var v=c[a];v()}return t};exports.broadcastActiveObservations=f;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./index.cjs282.js"),b=require("./index.cjs260.js"),g=require("./index.cjs294.js"),h=require("./index.cjs181.js");var f=function(){var t=1/0,s=[];u.resizeObservers.forEach(function(e){if(e.activeTargets.length!==0){var i=[];e.activeTargets.forEach(function(r){var o=new b.ResizeObserverEntry(r.target),n=g.calculateDepthForNode(r.target);i.push(o),r.lastReportedSize=h.calculateBoxSize(r.target,r.observedBox),n<t&&(t=n)}),s.push(function(){e.callback.call(e.observer,i,e.observer)}),e.activeTargets.splice(0,e.activeTargets.length)}});for(var a=0,c=s;a<c.length;a++){var v=c[a];v()}return t};exports.broadcastActiveObservations=f;
2
2
  //# sourceMappingURL=index.cjs291.js.map
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index.cjs256.js");var a=function(t){if(n.isHidden(t))return 1/0;for(var r=0,e=t.parentNode;e;)r+=1,e=e.parentNode;return r};exports.calculateDepthForNode=a;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index.cjs259.js");var a=function(t){if(n.isHidden(t))return 1/0;for(var r=0,e=t.parentNode;e;)r+=1,e=e.parentNode;return r};exports.calculateDepthForNode=a;
2
2
  //# sourceMappingURL=index.cjs294.js.map
@@ -1,2 +1,2 @@
1
- "use strict";const t=require("./index.cjs62.js"),n=require("react"),h=require("./index.cjs76.js"),y=require("./index.cjs185.js"),N=require("./index.cjs186.js"),x=require("./index.cjs187.js"),s=require("./index.cjs35.js");function q(e){var v=e.top,z=e.left,C=e.className,E=e.root,c=e.size,l=e.nodeSize,u=e.separation,m=e.children,p=e.linkComponent,d=p===void 0?y:p,k=e.nodeComponent,f=k===void 0?N:k,r=x();c&&r.size(c),l&&r.nodeSize(l),u&&r.separation(u);var o=r(E);return m?n.createElement(n.Fragment,null,m(o)):n.createElement(s,{top:v,left:z,className:h("visx-tree",C)},d&&o.links().map(function(i,a){return n.createElement(s,{key:"tree-link-"+a},n.createElement(d,{link:i}))}),f&&o.descendants().map(function(i,a){return n.createElement(s,{key:"tree-node-"+a},n.createElement(f,{node:i}))}))}q.propTypes={children:t.func,top:t.number,left:t.number,className:t.string,separation:t.func};module.exports=q;
1
+ "use strict";const t=require("./index.cjs62.js"),n=require("react"),h=require("./index.cjs76.js"),y=require("./index.cjs187.js"),N=require("./index.cjs188.js"),x=require("./index.cjs189.js"),s=require("./index.cjs35.js");function q(e){var v=e.top,z=e.left,C=e.className,E=e.root,c=e.size,l=e.nodeSize,u=e.separation,m=e.children,p=e.linkComponent,d=p===void 0?y:p,k=e.nodeComponent,f=k===void 0?N:k,r=x();c&&r.size(c),l&&r.nodeSize(l),u&&r.separation(u);var o=r(E);return m?n.createElement(n.Fragment,null,m(o)):n.createElement(s,{top:v,left:z,className:h("visx-tree",C)},d&&o.links().map(function(i,a){return n.createElement(s,{key:"tree-link-"+a},n.createElement(d,{link:i}))}),f&&o.descendants().map(function(i,a){return n.createElement(s,{key:"tree-node-"+a},n.createElement(f,{node:i}))}))}q.propTypes={children:t.func,top:t.number,left:t.number,className:t.string,separation:t.func};module.exports=q;
2
2
  //# sourceMappingURL=index.cjs36.js.map
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const p=require("./index.cjs234.js"),f=require("./index.cjs235.js"),v=require("./index.cjs236.js"),q=require("./index.cjs237.js"),g=require("./index.cjs238.js"),y=require("./index.cjs239.js"),m=require("./index.cjs240.js"),w=require("./index.cjs241.js"),B=require("./index.cjs242.js"),A=require("./index.cjs243.js"),_=require("./index.cjs244.js");function s(e,r){var i=new o(e),d=+e.value&&(i.value=e.value),t,h=[i],a,c,n,u;for(r==null&&(r=k);t=h.pop();)if(d&&(t.value=+t.data.value),(c=r(t.data))&&(u=c.length))for(t.children=new Array(u),n=u-1;n>=0;--n)h.push(a=t.children[n]=new o(c[n])),a.parent=t,a.depth=t.depth+1;return i.eachBefore(l)}function b(){return s(this).eachBefore(H)}function k(e){return e.children}function H(e){e.data=e.data.data}function l(e){var r=0;do e.height=r;while((e=e.parent)&&e.height<++r)}function o(e){this.data=e,this.depth=this.height=0,this.parent=null}o.prototype=s.prototype={constructor:o,count:p,each:f,eachAfter:q,eachBefore:v,sum:g,sort:y,path:m,ancestors:w,descendants:B,leaves:A,links:_,copy:b};exports.Node=o;exports.computeHeight=l;exports.default=s;
1
+ "use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const p=require("./index.cjs241.js"),f=require("./index.cjs242.js"),v=require("./index.cjs243.js"),q=require("./index.cjs244.js"),g=require("./index.cjs245.js"),y=require("./index.cjs246.js"),m=require("./index.cjs247.js"),w=require("./index.cjs248.js"),B=require("./index.cjs249.js"),A=require("./index.cjs250.js"),_=require("./index.cjs251.js");function s(e,r){var i=new o(e),d=+e.value&&(i.value=e.value),t,h=[i],a,c,n,u;for(r==null&&(r=k);t=h.pop();)if(d&&(t.value=+t.data.value),(c=r(t.data))&&(u=c.length))for(t.children=new Array(u),n=u-1;n>=0;--n)h.push(a=t.children[n]=new o(c[n])),a.parent=t,a.depth=t.depth+1;return i.eachBefore(l)}function b(){return s(this).eachBefore(H)}function k(e){return e.children}function H(e){e.data=e.data.data}function l(e){var r=0;do e.height=r;while((e=e.parent)&&e.height<++r)}function o(e){this.data=e,this.depth=this.height=0,this.parent=null}o.prototype=s.prototype={constructor:o,count:p,each:f,eachAfter:q,eachBefore:v,sum:g,sort:y,path:m,ancestors:w,descendants:B,leaves:A,links:_,copy:b};exports.Node=o;exports.computeHeight=l;exports.default=s;
2
2
  //# sourceMappingURL=index.cjs37.js.map
@@ -1,2 +1,2 @@
1
- "use strict";const s=require("./index.cjs66.js"),a=require("./index.cjs188.js"),u=require("./index.cjs189.js");function x(e,c){if(!e||!c)return null;var t=a(c),n=s.isSVGElement(e)?e.ownerSVGElement:e,i=s.isSVGGraphicsElement(n)?n.getScreenCTM():null;if(s.isSVGSVGElement(n)&&i){var r=n.createSVGPoint();return r.x=t.x,r.y=t.y,r=r.matrixTransform(i.inverse()),new u({x:r.x,y:r.y})}var l=e.getBoundingClientRect();return new u({x:t.x-l.left-e.clientLeft,y:t.y-l.top-e.clientTop})}module.exports=x;
1
+ "use strict";const s=require("./index.cjs66.js"),a=require("./index.cjs185.js"),u=require("./index.cjs186.js");function x(e,c){if(!e||!c)return null;var t=a(c),n=s.isSVGElement(e)?e.ownerSVGElement:e,i=s.isSVGGraphicsElement(n)?n.getScreenCTM():null;if(s.isSVGSVGElement(n)&&i){var r=n.createSVGPoint();return r.x=t.x,r.y=t.y,r=r.matrixTransform(i.inverse()),new u({x:r.x,y:r.y})}var l=e.getBoundingClientRect();return new u({x:t.x-l.left-e.clientLeft,y:t.y-l.top-e.clientTop})}module.exports=x;
2
2
  //# sourceMappingURL=index.cjs65.js.map
@@ -1,4 +1,4 @@
1
- "use strict";const f=require("./index.cjs190.js"),i=require("./index.cjs197.js");/*!
1
+ "use strict";const f=require("./index.cjs190.js"),i=require("./index.cjs200.js");/*!
2
2
  Copyright (c) 2018 Jed Watson.
3
3
  Licensed under the MIT License (MIT), see
4
4
  http://jedwatson.github.io/classnames
@@ -1,2 +1,2 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index.cjs6.js"),e=require("./index.cjs260.js");var t=a.supportsDataView&&e(new DataView(new ArrayBuffer(8))),r=typeof Map<"u"&&e(new Map);exports.hasStringTagBug=t;exports.isIE11=r;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("./index.cjs6.js"),e=require("./index.cjs255.js");var t=a.supportsDataView&&e(new DataView(new ArrayBuffer(8))),r=typeof Map<"u"&&e(new Map);exports.hasStringTagBug=t;exports.isIE11=r;
2
2
  //# sourceMappingURL=index.cjs8.js.map
@@ -1,7 +1,7 @@
1
1
  import { getDefaultExportFromCjs as M } from "./index.es190.js";
2
- import { i as S } from "./index.es198.js";
3
- import { n as j } from "./index.es199.js";
4
- import { t as y } from "./index.es200.js";
2
+ import { i as S } from "./index.es197.js";
3
+ import { n as j } from "./index.es198.js";
4
+ import { t as y } from "./index.es199.js";
5
5
  var F = S, x = j, I = y, N = "Expected a function", O = Math.max, R = Math.min;
6
6
  function A(h, t, a) {
7
7
  var o, m, s, u, i, r, f = 0, b = !1, c = !1, d = !0;
@@ -1,5 +1,5 @@
1
- import { ResizeObserverController as t } from "./index.es255.js";
2
- import { isElement as o } from "./index.es256.js";
1
+ import { ResizeObserverController as t } from "./index.es258.js";
2
+ import { isElement as o } from "./index.es259.js";
3
3
  var u = function() {
4
4
  function r(e) {
5
5
  if (arguments.length === 0)
@@ -1,8 +1,8 @@
1
1
  import { ResizeObserverBoxOptions as z } from "./index.es276.js";
2
- import { ResizeObserverSize as X } from "./index.es259.js";
2
+ import { ResizeObserverSize as X } from "./index.es262.js";
3
3
  import { DOMRectReadOnly as P } from "./index.es277.js";
4
- import { isHidden as A, isSVG as I } from "./index.es256.js";
5
- import { freeze as O } from "./index.es258.js";
4
+ import { isHidden as A, isSVG as I } from "./index.es259.js";
5
+ import { freeze as O } from "./index.es261.js";
6
6
  import { global as R } from "./index.es278.js";
7
7
  var l = /* @__PURE__ */ new WeakMap(), S = /auto|scroll/, G = /^tb|vertical/, N = /msie|trident/i.test(R.navigator && R.navigator.userAgent), i = function(e) {
8
8
  return parseFloat(e || "0");
@@ -1,7 +1,7 @@
1
- import { slice as g } from "./index.es266.js";
2
- import p from "./index.es267.js";
3
- import { x as v, y as h } from "./index.es268.js";
4
- import c from "./index.es265.js";
1
+ import { slice as g } from "./index.es265.js";
2
+ import p from "./index.es266.js";
3
+ import { x as v, y as h } from "./index.es267.js";
4
+ import c from "./index.es264.js";
5
5
  import k from "./index.es184.js";
6
6
  function T(n) {
7
7
  return n.source;
@@ -1,40 +1,38 @@
1
- import e from "./index.es62.js";
2
- import s from "react";
1
+ import { isTouchEvent as a, isMouseEvent as c } from "./index.es66.js";
2
+ function i() {
3
+ return i = Object.assign ? Object.assign.bind() : function(n) {
4
+ for (var r = 1; r < arguments.length; r++) {
5
+ var t = arguments[r];
6
+ for (var e in t)
7
+ Object.prototype.hasOwnProperty.call(t, e) && (n[e] = t[e]);
8
+ }
9
+ return n;
10
+ }, i.apply(this, arguments);
11
+ }
3
12
  var u = {
4
- source: {
5
- x: 0,
6
- y: 0
7
- },
8
- target: {
9
- x: 0,
10
- y: 0
11
- }
13
+ x: 0,
14
+ y: 0
12
15
  };
13
- function a(t) {
14
- var i = t.link, r = i === void 0 ? u : i;
15
- return /* @__PURE__ */ s.createElement("line", {
16
- x1: r.source.x,
17
- y1: r.source.y,
18
- x2: r.target.x,
19
- y2: r.target.y,
20
- strokeWidth: 2,
21
- stroke: "#999",
22
- strokeOpacity: 0.6
23
- });
16
+ function g(n) {
17
+ if (!n)
18
+ return i({}, u);
19
+ if (a(n))
20
+ return n.changedTouches.length > 0 ? {
21
+ x: n.changedTouches[0].clientX,
22
+ y: n.changedTouches[0].clientY
23
+ } : i({}, u);
24
+ if (c(n))
25
+ return {
26
+ x: n.clientX,
27
+ y: n.clientY
28
+ };
29
+ var r = n == null ? void 0 : n.target, t = r && "getBoundingClientRect" in r ? r.getBoundingClientRect() : null;
30
+ return t ? {
31
+ x: t.x + t.width / 2,
32
+ y: t.y + t.height / 2
33
+ } : i({}, u);
24
34
  }
25
- a.propTypes = {
26
- link: e.shape({
27
- source: e.shape({
28
- x: e.number.isRequired,
29
- y: e.number.isRequired
30
- }).isRequired,
31
- target: e.shape({
32
- x: e.number.isRequired,
33
- y: e.number.isRequired
34
- }).isRequired
35
- })
36
- };
37
35
  export {
38
- a as default
36
+ g as default
39
37
  };
40
38
  //# sourceMappingURL=index.es185.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.es185.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultLink.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nvar DEFAULT_LINK = {\n source: {\n x: 0,\n y: 0\n },\n target: {\n x: 0,\n y: 0\n }\n};\nexport default function HierarchyDefaultLink(_ref) {\n var _ref$link = _ref.link,\n link = _ref$link === void 0 ? DEFAULT_LINK : _ref$link;\n return /*#__PURE__*/React.createElement(\"line\", {\n x1: link.source.x,\n y1: link.source.y,\n x2: link.target.x,\n y2: link.target.y,\n strokeWidth: 2,\n stroke: \"#999\",\n strokeOpacity: 0.6\n });\n}\nHierarchyDefaultLink.propTypes = {\n link: _pt.shape({\n source: _pt.shape({\n x: _pt.number.isRequired,\n y: _pt.number.isRequired\n }).isRequired,\n target: _pt.shape({\n x: _pt.number.isRequired,\n y: _pt.number.isRequired\n }).isRequired\n })\n};"],"names":["DEFAULT_LINK","HierarchyDefaultLink","_ref","_ref$link","link","React","_pt"],"mappings":";;AAEA,IAAIA,IAAe;AAAA,EACjB,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AAAA,EACA,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AACA,SAAwBC,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAASH,IAAeG;AAC3B,SAAA,gBAAAE,EAAM,cAAc,QAAQ;AAAA,IAC9C,IAAID,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,eAAe;AAAA,EAAA,CAChB;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,IACH,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,EAAA,CACJ;AACH;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index.es185.js","sources":["../../../node_modules/@visx/event/esm/getXAndYFromEvent.js"],"sourcesContent":["function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nimport { isMouseEvent, isTouchEvent } from './typeGuards';\nvar DEFAULT_POINT = {\n x: 0,\n y: 0\n};\nexport default function getXAndYFromEvent(event) {\n if (!event) return _extends({}, DEFAULT_POINT);\n if (isTouchEvent(event)) {\n return event.changedTouches.length > 0 ? {\n x: event.changedTouches[0].clientX,\n y: event.changedTouches[0].clientY\n } : _extends({}, DEFAULT_POINT);\n }\n if (isMouseEvent(event)) {\n return {\n x: event.clientX,\n y: event.clientY\n };\n }\n\n // for focus events try to extract the center position of the target element\n var target = event == null ? void 0 : event.target;\n var boundingClientRect = target && 'getBoundingClientRect' in target ? target.getBoundingClientRect() : null;\n if (!boundingClientRect) return _extends({}, DEFAULT_POINT);\n return {\n x: boundingClientRect.x + boundingClientRect.width / 2,\n y: boundingClientRect.y + boundingClientRect.height / 2\n };\n}"],"names":["_extends","target","i","source","key","DEFAULT_POINT","getXAndYFromEvent","event","isTouchEvent","isMouseEvent","boundingClientRect"],"mappings":";AAAA,SAASA,IAAW;AAAE,SAAAA,IAAW,OAAO,SAAS,OAAO,OAAO,KAAK,IAAI,SAAUC,GAAQ;AAAE,aAASC,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAM,UAAAC,IAAS,UAAUD,CAAC;AAAG,eAASE,KAAOD;AAAU,QAAI,OAAO,UAAU,eAAe,KAAKA,GAAQC,CAAG,MAAYH,EAAAG,CAAG,IAAID,EAAOC,CAAG;AAAA,IAAO;AAAS,WAAAH;AAAA,EAAA,GAAkBD,EAAS,MAAM,MAAM,SAAS;AAAG;AAElV,IAAIK,IAAgB;AAAA,EAClB,GAAG;AAAA,EACH,GAAG;AACL;AACA,SAAwBC,EAAkBC,GAAO;AAC/C,MAAI,CAACA;AAAc,WAAAP,EAAS,IAAIK,CAAa;AACzC,MAAAG,EAAaD,CAAK;AACb,WAAAA,EAAM,eAAe,SAAS,IAAI;AAAA,MACvC,GAAGA,EAAM,eAAe,CAAC,EAAE;AAAA,MAC3B,GAAGA,EAAM,eAAe,CAAC,EAAE;AAAA,IAAA,IACzBP,EAAS,IAAIK,CAAa;AAE5B,MAAAI,EAAaF,CAAK;AACb,WAAA;AAAA,MACL,GAAGA,EAAM;AAAA,MACT,GAAGA,EAAM;AAAA,IAAA;AAKb,MAAIN,IAASM,KAAS,OAAO,SAASA,EAAM,QACxCG,IAAqBT,KAAU,2BAA2BA,IAASA,EAAO,sBAA0B,IAAA;AACxG,SAAKS,IACE;AAAA,IACL,GAAGA,EAAmB,IAAIA,EAAmB,QAAQ;AAAA,IACrD,GAAGA,EAAmB,IAAIA,EAAmB,SAAS;AAAA,EAAA,IAHxBV,EAAS,IAAIK,CAAa;AAK5D;","x_google_ignoreList":[0]}
@@ -1,26 +1,19 @@
1
- import e from "./index.es62.js";
2
- import n from "react";
3
- function t(i) {
4
- var o = i.node, r = o === void 0 ? {
5
- x: 0,
6
- y: 0,
7
- r: 15
8
- } : o;
9
- return /* @__PURE__ */ n.createElement("circle", {
10
- cx: r.x,
11
- cy: r.y,
12
- r: r.r || 15,
13
- fill: "#21D4FD"
14
- });
15
- }
16
- t.propTypes = {
17
- node: e.shape({
18
- x: e.number.isRequired,
19
- y: e.number.isRequired,
20
- r: e.number
21
- })
22
- };
1
+ var a = /* @__PURE__ */ function() {
2
+ function r(t) {
3
+ var o = t.x, y = o === void 0 ? 0 : o, n = t.y, u = n === void 0 ? 0 : n;
4
+ this.x = 0, this.y = 0, this.x = y, this.y = u;
5
+ }
6
+ var i = r.prototype;
7
+ return i.value = function() {
8
+ return {
9
+ x: this.x,
10
+ y: this.y
11
+ };
12
+ }, i.toArray = function() {
13
+ return [this.x, this.y];
14
+ }, r;
15
+ }();
23
16
  export {
24
- t as default
17
+ a as default
25
18
  };
26
19
  //# sourceMappingURL=index.es186.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.es186.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultNode.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nexport default function HierarchyDefaultNode(_ref) {\n var _ref$node = _ref.node,\n node = _ref$node === void 0 ? {\n x: 0,\n y: 0,\n r: 15\n } : _ref$node;\n return /*#__PURE__*/React.createElement(\"circle\", {\n cx: node.x,\n cy: node.y,\n r: node.r || 15,\n fill: \"#21D4FD\"\n });\n}\nHierarchyDefaultNode.propTypes = {\n node: _pt.shape({\n x: _pt.number.isRequired,\n y: _pt.number.isRequired,\n r: _pt.number\n })\n};"],"names":["HierarchyDefaultNode","_ref","_ref$node","node","React","_pt"],"mappings":";;AAEA,SAAwBA,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAAS;AAAA,IAC5B,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACD,IAAAA;AACc,SAAA,gBAAAE,EAAM,cAAc,UAAU;AAAA,IAChD,IAAID,EAAK;AAAA,IACT,IAAIA,EAAK;AAAA,IACT,GAAGA,EAAK,KAAK;AAAA,IACb,MAAM;AAAA,EAAA,CACP;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI;AAAA,EAAA,CACR;AACH;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index.es186.js","sources":["../../../node_modules/@visx/point/esm/Point.js"],"sourcesContent":["var Point = /*#__PURE__*/function () {\n function Point(_ref) {\n var _ref$x = _ref.x,\n x = _ref$x === void 0 ? 0 : _ref$x,\n _ref$y = _ref.y,\n y = _ref$y === void 0 ? 0 : _ref$y;\n this.x = 0;\n this.y = 0;\n this.x = x;\n this.y = y;\n }\n var _proto = Point.prototype;\n _proto.value = function value() {\n return {\n x: this.x,\n y: this.y\n };\n };\n _proto.toArray = function toArray() {\n return [this.x, this.y];\n };\n return Point;\n}();\nexport { Point as default };"],"names":["Point","_ref","_ref$x","x","_ref$y","y","_proto"],"mappings":"AAAA,IAAIA,IAAiC,2BAAA;AACnC,WAASA,EAAMC,GAAM;AACnB,QAAIC,IAASD,EAAK,GAChBE,IAAID,MAAW,SAAS,IAAIA,GAC5BE,IAASH,EAAK,GACdI,IAAID,MAAW,SAAS,IAAIA;AAC9B,SAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAID,GACT,KAAK,IAAIE;AAAA,EACX;AACA,MAAIC,IAASN,EAAM;AACZ,SAAAM,EAAA,QAAQ,WAAiB;AACvB,WAAA;AAAA,MACL,GAAG,KAAK;AAAA,MACR,GAAG,KAAK;AAAA,IAAA;AAAA,EACV,GAEKA,EAAA,UAAU,WAAmB;AAClC,WAAO,CAAC,KAAK,GAAG,KAAK,CAAC;AAAA,EAAA,GAEjBN;AACT,EAAE;","x_google_ignoreList":[0]}
@@ -1,88 +1,40 @@
1
- import { Node as k } from "./index.es37.js";
2
- function o(r, n) {
3
- return r.parent === n.parent ? 1 : 2;
4
- }
5
- function S(r) {
6
- var n = r.children;
7
- return n ? n[0] : r.t;
8
- }
9
- function B(r) {
10
- var n = r.children;
11
- return n ? n[n.length - 1] : r.t;
12
- }
13
- function R(r, n, a) {
14
- var i = a / (n.i - r.i);
15
- n.c -= i, n.s += a, r.c += i, n.z += a, n.m += a;
16
- }
17
- function W(r) {
18
- for (var n = 0, a = 0, i = r.children, u = i.length, z; --u >= 0; )
19
- z = i[u], z.z += n, z.m += n, n += z.s + (a += z.c);
20
- }
21
- function b(r, n, a) {
22
- return r.a.parent === n.parent ? r.a : a;
23
- }
24
- function A(r, n) {
25
- this._ = r, this.parent = null, this.children = null, this.A = null, this.a = this, this.z = 0, this.m = 0, this.c = 0, this.s = 0, this.t = null, this.i = n;
26
- }
27
- A.prototype = Object.create(k.prototype);
28
- function j(r) {
29
- for (var n = new A(r, 0), a, i = [n], u, z, x, y; a = i.pop(); )
30
- if (z = a._.children)
31
- for (a.children = new Array(y = z.length), x = y - 1; x >= 0; --x)
32
- i.push(u = a.children[x] = new A(z[x], x)), u.parent = a;
33
- return (n.parent = new A(null, 0)).children = [n], n;
34
- }
35
- function L() {
36
- var r = o, n = 1, a = 1, i = null;
37
- function u(e) {
38
- var f = j(e);
39
- if (f.eachAfter(z), f.parent.m = -f.z, f.eachBefore(x), i)
40
- e.eachBefore(N);
41
- else {
42
- var d = e, t = e, c = e;
43
- e.eachBefore(function(l) {
44
- l.x < d.x && (d = l), l.x > t.x && (t = l), l.depth > c.depth && (c = l);
45
- });
46
- var h = d === t ? 1 : r(d, t) / 2, s = h - d.x, g = n / (t.x + h + s), _ = a / (c.depth || 1);
47
- e.eachBefore(function(l) {
48
- l.x = (l.x + s) * g, l.y = l.depth * _;
49
- });
50
- }
51
- return e;
1
+ import e from "./index.es62.js";
2
+ import s from "react";
3
+ var u = {
4
+ source: {
5
+ x: 0,
6
+ y: 0
7
+ },
8
+ target: {
9
+ x: 0,
10
+ y: 0
52
11
  }
53
- function z(e) {
54
- var f = e.children, d = e.parent.children, t = e.i ? d[e.i - 1] : null;
55
- if (f) {
56
- W(e);
57
- var c = (f[0].z + f[f.length - 1].z) / 2;
58
- t ? (e.z = t.z + r(e._, t._), e.m = e.z - c) : e.z = c;
59
- } else
60
- t && (e.z = t.z + r(e._, t._));
61
- e.parent.A = y(e, t, e.parent.A || d[0]);
62
- }
63
- function x(e) {
64
- e._.x = e.z + e.parent.m, e.m += e.parent.m;
65
- }
66
- function y(e, f, d) {
67
- if (f) {
68
- for (var t = e, c = e, h = f, s = t.parent.children[0], g = t.m, _ = c.m, l = h.m, w = s.m, p; h = B(h), t = S(t), h && t; )
69
- s = S(s), c = B(c), c.a = e, p = h.z + l - t.z - g + r(h._, t._), p > 0 && (R(b(h, e, d), e, p), g += p, _ += p), l += h.m, g += t.m, w += s.m, _ += c.m;
70
- h && !B(c) && (c.t = h, c.m += l - _), t && !S(s) && (s.t = t, s.m += g - w, d = e);
71
- }
72
- return d;
73
- }
74
- function N(e) {
75
- e.x *= n, e.y = e.depth * a;
76
- }
77
- return u.separation = function(e) {
78
- return arguments.length ? (r = e, u) : r;
79
- }, u.size = function(e) {
80
- return arguments.length ? (i = !1, n = +e[0], a = +e[1], u) : i ? null : [n, a];
81
- }, u.nodeSize = function(e) {
82
- return arguments.length ? (i = !0, n = +e[0], a = +e[1], u) : i ? [n, a] : null;
83
- }, u;
84
- }
12
+ };
13
+ function a(t) {
14
+ var i = t.link, r = i === void 0 ? u : i;
15
+ return /* @__PURE__ */ s.createElement("line", {
16
+ x1: r.source.x,
17
+ y1: r.source.y,
18
+ x2: r.target.x,
19
+ y2: r.target.y,
20
+ strokeWidth: 2,
21
+ stroke: "#999",
22
+ strokeOpacity: 0.6
23
+ });
24
+ }
25
+ a.propTypes = {
26
+ link: e.shape({
27
+ source: e.shape({
28
+ x: e.number.isRequired,
29
+ y: e.number.isRequired
30
+ }).isRequired,
31
+ target: e.shape({
32
+ x: e.number.isRequired,
33
+ y: e.number.isRequired
34
+ }).isRequired
35
+ })
36
+ };
85
37
  export {
86
- L as default
38
+ a as default
87
39
  };
88
40
  //# sourceMappingURL=index.es187.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.es187.js","sources":["../../../node_modules/d3-hierarchy/src/tree.js"],"sourcesContent":["import {Node} from \"./hierarchy/index.js\";\n\nfunction defaultSeparation(a, b) {\n return a.parent === b.parent ? 1 : 2;\n}\n\n// function radialSeparation(a, b) {\n// return (a.parent === b.parent ? 1 : 2) / a.depth;\n// }\n\n// This function is used to traverse the left contour of a subtree (or\n// subforest). It returns the successor of v on this contour. This successor is\n// either given by the leftmost child of v or by the thread of v. The function\n// returns null if and only if v is on the highest level of its subtree.\nfunction nextLeft(v) {\n var children = v.children;\n return children ? children[0] : v.t;\n}\n\n// This function works analogously to nextLeft.\nfunction nextRight(v) {\n var children = v.children;\n return children ? children[children.length - 1] : v.t;\n}\n\n// Shifts the current subtree rooted at w+. This is done by increasing\n// prelim(w+) and mod(w+) by shift.\nfunction moveSubtree(wm, wp, shift) {\n var change = shift / (wp.i - wm.i);\n wp.c -= change;\n wp.s += shift;\n wm.c += change;\n wp.z += shift;\n wp.m += shift;\n}\n\n// All other shifts, applied to the smaller subtrees between w- and w+, are\n// performed by this function. To prepare the shifts, we have to adjust\n// change(w+), shift(w+), and change(w-).\nfunction executeShifts(v) {\n var shift = 0,\n change = 0,\n children = v.children,\n i = children.length,\n w;\n while (--i >= 0) {\n w = children[i];\n w.z += shift;\n w.m += shift;\n shift += w.s + (change += w.c);\n }\n}\n\n// If vi-’s ancestor is a sibling of v, returns vi-’s ancestor. Otherwise,\n// returns the specified (default) ancestor.\nfunction nextAncestor(vim, v, ancestor) {\n return vim.a.parent === v.parent ? vim.a : ancestor;\n}\n\nfunction TreeNode(node, i) {\n this._ = node;\n this.parent = null;\n this.children = null;\n this.A = null; // default ancestor\n this.a = this; // ancestor\n this.z = 0; // prelim\n this.m = 0; // mod\n this.c = 0; // change\n this.s = 0; // shift\n this.t = null; // thread\n this.i = i; // number\n}\n\nTreeNode.prototype = Object.create(Node.prototype);\n\nfunction treeRoot(root) {\n var tree = new TreeNode(root, 0),\n node,\n nodes = [tree],\n child,\n children,\n i,\n n;\n\n while (node = nodes.pop()) {\n if (children = node._.children) {\n node.children = new Array(n = children.length);\n for (i = n - 1; i >= 0; --i) {\n nodes.push(child = node.children[i] = new TreeNode(children[i], i));\n child.parent = node;\n }\n }\n }\n\n (tree.parent = new TreeNode(null, 0)).children = [tree];\n return tree;\n}\n\n// Node-link tree diagram using the Reingold-Tilford \"tidy\" algorithm\nexport default function() {\n var separation = defaultSeparation,\n dx = 1,\n dy = 1,\n nodeSize = null;\n\n function tree(root) {\n var t = treeRoot(root);\n\n // Compute the layout using Buchheim et al.’s algorithm.\n t.eachAfter(firstWalk), t.parent.m = -t.z;\n t.eachBefore(secondWalk);\n\n // If a fixed node size is specified, scale x and y.\n if (nodeSize) root.eachBefore(sizeNode);\n\n // If a fixed tree size is specified, scale x and y based on the extent.\n // Compute the left-most, right-most, and depth-most nodes for extents.\n else {\n var left = root,\n right = root,\n bottom = root;\n root.eachBefore(function(node) {\n if (node.x < left.x) left = node;\n if (node.x > right.x) right = node;\n if (node.depth > bottom.depth) bottom = node;\n });\n var s = left === right ? 1 : separation(left, right) / 2,\n tx = s - left.x,\n kx = dx / (right.x + s + tx),\n ky = dy / (bottom.depth || 1);\n root.eachBefore(function(node) {\n node.x = (node.x + tx) * kx;\n node.y = node.depth * ky;\n });\n }\n\n return root;\n }\n\n // Computes a preliminary x-coordinate for v. Before that, FIRST WALK is\n // applied recursively to the children of v, as well as the function\n // APPORTION. After spacing out the children by calling EXECUTE SHIFTS, the\n // node v is placed to the midpoint of its outermost children.\n function firstWalk(v) {\n var children = v.children,\n siblings = v.parent.children,\n w = v.i ? siblings[v.i - 1] : null;\n if (children) {\n executeShifts(v);\n var midpoint = (children[0].z + children[children.length - 1].z) / 2;\n if (w) {\n v.z = w.z + separation(v._, w._);\n v.m = v.z - midpoint;\n } else {\n v.z = midpoint;\n }\n } else if (w) {\n v.z = w.z + separation(v._, w._);\n }\n v.parent.A = apportion(v, w, v.parent.A || siblings[0]);\n }\n\n // Computes all real x-coordinates by summing up the modifiers recursively.\n function secondWalk(v) {\n v._.x = v.z + v.parent.m;\n v.m += v.parent.m;\n }\n\n // The core of the algorithm. Here, a new subtree is combined with the\n // previous subtrees. Threads are used to traverse the inside and outside\n // contours of the left and right subtree up to the highest common level. The\n // vertices used for the traversals are vi+, vi-, vo-, and vo+, where the\n // superscript o means outside and i means inside, the subscript - means left\n // subtree and + means right subtree. For summing up the modifiers along the\n // contour, we use respective variables si+, si-, so-, and so+. Whenever two\n // nodes of the inside contours conflict, we compute the left one of the\n // greatest uncommon ancestors using the function ANCESTOR and call MOVE\n // SUBTREE to shift the subtree and prepare the shifts of smaller subtrees.\n // Finally, we add a new thread (if necessary).\n function apportion(v, w, ancestor) {\n if (w) {\n var vip = v,\n vop = v,\n vim = w,\n vom = vip.parent.children[0],\n sip = vip.m,\n sop = vop.m,\n sim = vim.m,\n som = vom.m,\n shift;\n while (vim = nextRight(vim), vip = nextLeft(vip), vim && vip) {\n vom = nextLeft(vom);\n vop = nextRight(vop);\n vop.a = v;\n shift = vim.z + sim - vip.z - sip + separation(vim._, vip._);\n if (shift > 0) {\n moveSubtree(nextAncestor(vim, v, ancestor), v, shift);\n sip += shift;\n sop += shift;\n }\n sim += vim.m;\n sip += vip.m;\n som += vom.m;\n sop += vop.m;\n }\n if (vim && !nextRight(vop)) {\n vop.t = vim;\n vop.m += sim - sop;\n }\n if (vip && !nextLeft(vom)) {\n vom.t = vip;\n vom.m += sip - som;\n ancestor = v;\n }\n }\n return ancestor;\n }\n\n function sizeNode(node) {\n node.x *= dx;\n node.y = node.depth * dy;\n }\n\n tree.separation = function(x) {\n return arguments.length ? (separation = x, tree) : separation;\n };\n\n tree.size = function(x) {\n return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], tree) : (nodeSize ? null : [dx, dy]);\n };\n\n tree.nodeSize = function(x) {\n return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], tree) : (nodeSize ? [dx, dy] : null);\n };\n\n return tree;\n}\n"],"names":["defaultSeparation","a","b","nextLeft","v","children","nextRight","moveSubtree","wm","wp","shift","change","executeShifts","i","w","nextAncestor","vim","ancestor","TreeNode","node","Node","treeRoot","root","tree","nodes","child","n","d3tree","separation","dx","dy","nodeSize","t","firstWalk","secondWalk","sizeNode","left","right","bottom","s","tx","kx","ky","siblings","midpoint","apportion","vip","vop","vom","sip","sop","sim","som","x"],"mappings":";AAEA,SAASA,EAAkBC,GAAGC,GAAG;AAC/B,SAAOD,EAAE,WAAWC,EAAE,SAAS,IAAI;AACrC;AAUA,SAASC,EAASC,GAAG;AACnB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAAS,CAAC,IAAID,EAAE;AACpC;AAGA,SAASE,EAAUF,GAAG;AACpB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAASA,EAAS,SAAS,CAAC,IAAID,EAAE;AACtD;AAIA,SAASG,EAAYC,GAAIC,GAAIC,GAAO;AAClC,MAAIC,IAASD,KAASD,EAAG,IAAID,EAAG;AAChC,EAAAC,EAAG,KAAKE,GACRF,EAAG,KAAKC,GACRF,EAAG,KAAKG,GACRF,EAAG,KAAKC,GACRD,EAAG,KAAKC;AACV;AAKA,SAASE,EAAcR,GAAG;AAMjB,WALHM,IAAQ,GACRC,IAAS,GACTN,IAAWD,EAAE,UACbS,IAAIR,EAAS,QACbS,GACG,EAAED,KAAK;AACZ,IAAAC,IAAIT,EAASQ,CAAC,GACdC,EAAE,KAAKJ,GACPI,EAAE,KAAKJ,GACEA,KAAAI,EAAE,KAAKH,KAAUG,EAAE;AAEhC;AAIA,SAASC,EAAaC,GAAKZ,GAAGa,GAAU;AACtC,SAAOD,EAAI,EAAE,WAAWZ,EAAE,SAASY,EAAI,IAAIC;AAC7C;AAEA,SAASC,EAASC,GAAMN,GAAG;AACzB,OAAK,IAAIM,GACT,KAAK,SAAS,MACd,KAAK,WAAW,MAChB,KAAK,IAAI,MACT,KAAK,IAAI,MACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,MACT,KAAK,IAAIN;AACX;AAEAK,EAAS,YAAY,OAAO,OAAOE,EAAK,SAAS;AAEjD,SAASC,EAASC,GAAM;AASf,WARHC,IAAO,IAAIL,EAASI,GAAM,CAAC,GAC3BH,GACAK,IAAQ,CAACD,CAAI,GACbE,GACApB,GACAQ,GACAa,GAEGP,IAAOK,EAAM;AACd,QAAAnB,IAAWc,EAAK,EAAE;AAEpB,WADAA,EAAK,WAAW,IAAI,MAAMO,IAAIrB,EAAS,MAAM,GACxCQ,IAAIa,IAAI,GAAGb,KAAK,GAAG,EAAEA;AACxB,QAAAW,EAAM,KAAKC,IAAQN,EAAK,SAASN,CAAC,IAAI,IAAIK,EAASb,EAASQ,CAAC,GAAGA,CAAC,CAAC,GAClEY,EAAM,SAASN;AAKpB,UAAAI,EAAK,SAAS,IAAIL,EAAS,MAAM,CAAC,GAAG,WAAW,CAACK,CAAI,GAC/CA;AACT;AAG0B,SAAAI,IAAA;AACxB,MAAIC,IAAa5B,GACb6B,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASR,EAAKD,GAAM;AACd,QAAAU,IAAIX,EAASC,CAAI;AAOjB,QAJJU,EAAE,UAAUC,CAAS,GAAGD,EAAE,OAAO,IAAI,CAACA,EAAE,GACxCA,EAAE,WAAWE,CAAU,GAGnBH;AAAU,MAAAT,EAAK,WAAWa,CAAQ;AAAA,SAIjC;AACH,UAAIC,IAAOd,GACPe,IAAQf,GACRgB,IAAShB;AACR,MAAAA,EAAA,WAAW,SAASH,GAAM;AACzB,QAAAA,EAAK,IAAIiB,EAAK,MAAUA,IAAAjB,IACxBA,EAAK,IAAIkB,EAAM,MAAWA,IAAAlB,IAC1BA,EAAK,QAAQmB,EAAO,UAAgBA,IAAAnB;AAAA,MAAA,CACzC;AACG,UAAAoB,IAAIH,MAASC,IAAQ,IAAIT,EAAWQ,GAAMC,CAAK,IAAI,GACnDG,IAAKD,IAAIH,EAAK,GACdK,IAAKZ,KAAMQ,EAAM,IAAIE,IAAIC,IACzBE,IAAKZ,KAAMQ,EAAO,SAAS;AAC1B,MAAAhB,EAAA,WAAW,SAASH,GAAM;AACxB,QAAAA,EAAA,KAAKA,EAAK,IAAIqB,KAAMC,GACpBtB,EAAA,IAAIA,EAAK,QAAQuB;AAAA,MAAA,CACvB;AAAA,IACH;AAEO,WAAApB;AAAA,EACT;AAMA,WAASW,EAAU7B,GAAG;AACpB,QAAIC,IAAWD,EAAE,UACbuC,IAAWvC,EAAE,OAAO,UACpBU,IAAIV,EAAE,IAAIuC,EAASvC,EAAE,IAAI,CAAC,IAAI;AAClC,QAAIC,GAAU;AACZ,MAAAO,EAAcR,CAAC;AACX,UAAAwC,KAAYvC,EAAS,CAAC,EAAE,IAAIA,EAASA,EAAS,SAAS,CAAC,EAAE,KAAK;AACnE,MAAIS,KACFV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC,GAC7BV,EAAA,IAAIA,EAAE,IAAIwC,KAEZxC,EAAE,IAAIwC;AAAA;MAEC9B,MACTV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC;AAE/B,IAAAV,EAAA,OAAO,IAAIyC,EAAUzC,GAAGU,GAAGV,EAAE,OAAO,KAAKuC,EAAS,CAAC,CAAC;AAAA,EACxD;AAGA,WAAST,EAAW9B,GAAG;AACrB,IAAAA,EAAE,EAAE,IAAIA,EAAE,IAAIA,EAAE,OAAO,GACrBA,EAAA,KAAKA,EAAE,OAAO;AAAA,EAClB;AAaS,WAAAyC,EAAUzC,GAAGU,GAAGG,GAAU;AACjC,QAAIH,GAAG;AAUE,eATHgC,IAAM1C,GACN2C,IAAM3C,GACNY,IAAMF,GACNkC,IAAMF,EAAI,OAAO,SAAS,CAAC,GAC3BG,IAAMH,EAAI,GACVI,IAAMH,EAAI,GACVI,IAAMnC,EAAI,GACVoC,IAAMJ,EAAI,GACVtC,GACGM,IAAMV,EAAUU,CAAG,GAAG8B,IAAM3C,EAAS2C,CAAG,GAAG9B,KAAO8B;AACvD,QAAAE,IAAM7C,EAAS6C,CAAG,GAClBD,IAAMzC,EAAUyC,CAAG,GACnBA,EAAI,IAAI3C,GACAM,IAAAM,EAAI,IAAImC,IAAML,EAAI,IAAIG,IAAMrB,EAAWZ,EAAI,GAAG8B,EAAI,CAAC,GACvDpC,IAAQ,MACVH,EAAYQ,EAAaC,GAAKZ,GAAGa,CAAQ,GAAGb,GAAGM,CAAK,GAC7CuC,KAAAvC,GACAwC,KAAAxC,IAETyC,KAAOnC,EAAI,GACXiC,KAAOH,EAAI,GACXM,KAAOJ,EAAI,GACXE,KAAOH,EAAI;AAEb,MAAI/B,KAAO,CAACV,EAAUyC,CAAG,MACvBA,EAAI,IAAI/B,GACR+B,EAAI,KAAKI,IAAMD,IAEbJ,KAAO,CAAC3C,EAAS6C,CAAG,MACtBA,EAAI,IAAIF,GACRE,EAAI,KAAKC,IAAMG,GACJnC,IAAAb;AAAA,IAEf;AACO,WAAAa;AAAA,EACT;AAEA,WAASkB,EAAShB,GAAM;AACtB,IAAAA,EAAK,KAAKU,GACLV,EAAA,IAAIA,EAAK,QAAQW;AAAA,EACxB;AAEK,SAAAP,EAAA,aAAa,SAAS8B,GAAG;AAC5B,WAAO,UAAU,UAAUzB,IAAayB,GAAG9B,KAAQK;AAAA,EAAA,GAGhDL,EAAA,OAAO,SAAS8B,GAAG;AACtB,WAAO,UAAU,UAAUtB,IAAW,IAAOF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EAAA,GAGpGP,EAAA,WAAW,SAAS8B,GAAG;AAC1B,WAAO,UAAU,UAAUtB,IAAW,IAAMF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EAAA,GAG9FP;AACT;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index.es187.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultLink.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nvar DEFAULT_LINK = {\n source: {\n x: 0,\n y: 0\n },\n target: {\n x: 0,\n y: 0\n }\n};\nexport default function HierarchyDefaultLink(_ref) {\n var _ref$link = _ref.link,\n link = _ref$link === void 0 ? DEFAULT_LINK : _ref$link;\n return /*#__PURE__*/React.createElement(\"line\", {\n x1: link.source.x,\n y1: link.source.y,\n x2: link.target.x,\n y2: link.target.y,\n strokeWidth: 2,\n stroke: \"#999\",\n strokeOpacity: 0.6\n });\n}\nHierarchyDefaultLink.propTypes = {\n link: _pt.shape({\n source: _pt.shape({\n x: _pt.number.isRequired,\n y: _pt.number.isRequired\n }).isRequired,\n target: _pt.shape({\n x: _pt.number.isRequired,\n y: _pt.number.isRequired\n }).isRequired\n })\n};"],"names":["DEFAULT_LINK","HierarchyDefaultLink","_ref","_ref$link","link","React","_pt"],"mappings":";;AAEA,IAAIA,IAAe;AAAA,EACjB,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AAAA,EACA,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AACA,SAAwBC,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAASH,IAAeG;AAC3B,SAAA,gBAAAE,EAAM,cAAc,QAAQ;AAAA,IAC9C,IAAID,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,eAAe;AAAA,EAAA,CAChB;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,IACH,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,EAAA,CACJ;AACH;","x_google_ignoreList":[0]}
@@ -1,38 +1,26 @@
1
- import { isTouchEvent as a, isMouseEvent as c } from "./index.es66.js";
2
- function i() {
3
- return i = Object.assign ? Object.assign.bind() : function(n) {
4
- for (var r = 1; r < arguments.length; r++) {
5
- var t = arguments[r];
6
- for (var e in t)
7
- Object.prototype.hasOwnProperty.call(t, e) && (n[e] = t[e]);
8
- }
9
- return n;
10
- }, i.apply(this, arguments);
1
+ import e from "./index.es62.js";
2
+ import n from "react";
3
+ function t(i) {
4
+ var o = i.node, r = o === void 0 ? {
5
+ x: 0,
6
+ y: 0,
7
+ r: 15
8
+ } : o;
9
+ return /* @__PURE__ */ n.createElement("circle", {
10
+ cx: r.x,
11
+ cy: r.y,
12
+ r: r.r || 15,
13
+ fill: "#21D4FD"
14
+ });
11
15
  }
12
- var u = {
13
- x: 0,
14
- y: 0
16
+ t.propTypes = {
17
+ node: e.shape({
18
+ x: e.number.isRequired,
19
+ y: e.number.isRequired,
20
+ r: e.number
21
+ })
15
22
  };
16
- function g(n) {
17
- if (!n)
18
- return i({}, u);
19
- if (a(n))
20
- return n.changedTouches.length > 0 ? {
21
- x: n.changedTouches[0].clientX,
22
- y: n.changedTouches[0].clientY
23
- } : i({}, u);
24
- if (c(n))
25
- return {
26
- x: n.clientX,
27
- y: n.clientY
28
- };
29
- var r = n == null ? void 0 : n.target, t = r && "getBoundingClientRect" in r ? r.getBoundingClientRect() : null;
30
- return t ? {
31
- x: t.x + t.width / 2,
32
- y: t.y + t.height / 2
33
- } : i({}, u);
34
- }
35
23
  export {
36
- g as default
24
+ t as default
37
25
  };
38
26
  //# sourceMappingURL=index.es188.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.es188.js","sources":["../../../node_modules/@visx/event/esm/getXAndYFromEvent.js"],"sourcesContent":["function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nimport { isMouseEvent, isTouchEvent } from './typeGuards';\nvar DEFAULT_POINT = {\n x: 0,\n y: 0\n};\nexport default function getXAndYFromEvent(event) {\n if (!event) return _extends({}, DEFAULT_POINT);\n if (isTouchEvent(event)) {\n return event.changedTouches.length > 0 ? {\n x: event.changedTouches[0].clientX,\n y: event.changedTouches[0].clientY\n } : _extends({}, DEFAULT_POINT);\n }\n if (isMouseEvent(event)) {\n return {\n x: event.clientX,\n y: event.clientY\n };\n }\n\n // for focus events try to extract the center position of the target element\n var target = event == null ? void 0 : event.target;\n var boundingClientRect = target && 'getBoundingClientRect' in target ? target.getBoundingClientRect() : null;\n if (!boundingClientRect) return _extends({}, DEFAULT_POINT);\n return {\n x: boundingClientRect.x + boundingClientRect.width / 2,\n y: boundingClientRect.y + boundingClientRect.height / 2\n };\n}"],"names":["_extends","target","i","source","key","DEFAULT_POINT","getXAndYFromEvent","event","isTouchEvent","isMouseEvent","boundingClientRect"],"mappings":";AAAA,SAASA,IAAW;AAAE,SAAAA,IAAW,OAAO,SAAS,OAAO,OAAO,KAAK,IAAI,SAAUC,GAAQ;AAAE,aAASC,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAM,UAAAC,IAAS,UAAUD,CAAC;AAAG,eAASE,KAAOD;AAAU,QAAI,OAAO,UAAU,eAAe,KAAKA,GAAQC,CAAG,MAAYH,EAAAG,CAAG,IAAID,EAAOC,CAAG;AAAA,IAAO;AAAS,WAAAH;AAAA,EAAA,GAAkBD,EAAS,MAAM,MAAM,SAAS;AAAG;AAElV,IAAIK,IAAgB;AAAA,EAClB,GAAG;AAAA,EACH,GAAG;AACL;AACA,SAAwBC,EAAkBC,GAAO;AAC/C,MAAI,CAACA;AAAc,WAAAP,EAAS,IAAIK,CAAa;AACzC,MAAAG,EAAaD,CAAK;AACb,WAAAA,EAAM,eAAe,SAAS,IAAI;AAAA,MACvC,GAAGA,EAAM,eAAe,CAAC,EAAE;AAAA,MAC3B,GAAGA,EAAM,eAAe,CAAC,EAAE;AAAA,IAAA,IACzBP,EAAS,IAAIK,CAAa;AAE5B,MAAAI,EAAaF,CAAK;AACb,WAAA;AAAA,MACL,GAAGA,EAAM;AAAA,MACT,GAAGA,EAAM;AAAA,IAAA;AAKb,MAAIN,IAASM,KAAS,OAAO,SAASA,EAAM,QACxCG,IAAqBT,KAAU,2BAA2BA,IAASA,EAAO,sBAA0B,IAAA;AACxG,SAAKS,IACE;AAAA,IACL,GAAGA,EAAmB,IAAIA,EAAmB,QAAQ;AAAA,IACrD,GAAGA,EAAmB,IAAIA,EAAmB,SAAS;AAAA,EAAA,IAHxBV,EAAS,IAAIK,CAAa;AAK5D;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index.es188.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultNode.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nexport default function HierarchyDefaultNode(_ref) {\n var _ref$node = _ref.node,\n node = _ref$node === void 0 ? {\n x: 0,\n y: 0,\n r: 15\n } : _ref$node;\n return /*#__PURE__*/React.createElement(\"circle\", {\n cx: node.x,\n cy: node.y,\n r: node.r || 15,\n fill: \"#21D4FD\"\n });\n}\nHierarchyDefaultNode.propTypes = {\n node: _pt.shape({\n x: _pt.number.isRequired,\n y: _pt.number.isRequired,\n r: _pt.number\n })\n};"],"names":["HierarchyDefaultNode","_ref","_ref$node","node","React","_pt"],"mappings":";;AAEA,SAAwBA,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAAS;AAAA,IAC5B,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACD,IAAAA;AACc,SAAA,gBAAAE,EAAM,cAAc,UAAU;AAAA,IAChD,IAAID,EAAK;AAAA,IACT,IAAIA,EAAK;AAAA,IACT,GAAGA,EAAK,KAAK;AAAA,IACb,MAAM;AAAA,EAAA,CACP;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI;AAAA,EAAA,CACR;AACH;","x_google_ignoreList":[0]}