@milaboratories/graph-maker 1.1.175 → 1.1.177

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/index.js

@@ -1,23 +0,0 @@
-import { m as r } from "./main.js";
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-var m = r, i = m;
-export {
-  i as l
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/index.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Evaluate the complementary error function.\n*\n* @module @stdlib/math-base-special-erfc\n*\n* @example\n* var erfc = require( '@stdlib/math-base-special-erfc' );\n*\n* var y = erfc( 2.0 );\n* // returns ~0.0047\n*\n* y = erfc( -1.0 );\n* // returns ~1.8427\n*\n* y = erfc( 0.0 );\n* // returns 1.0\n*\n* y = erfc( Infinity );\n* // returns 0.0\n*\n* y = erfc( -Infinity );\n* // returns 2.0\n*\n* y = erfc( NaN );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["main","require$$0","lib"],"mappings":";;;;;;;;;;;;;;;;;;AAiDA,IAAIA,IAAOC,GAKXC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/main.js

@@ -1,76 +0,0 @@
-import { l } from "../../math-base-assert-is-nan/lib/index.js";
-import { l as v } from "../../math-base-special-exp/lib/index.js";
-import { l as a } from "../../number-float64-base-set-low-word/lib/index.js";
-import { l as c } from "../../constants-float64-pinf/lib/index.js";
-import { l as N } from "../../constants-float64-ninf/lib/index.js";
-import { p as d } from "./polyval_pp.js";
-import { p as g } from "./polyval_qq.js";
-import { p as h } from "./polyval_pa.js";
-import { p as j } from "./polyval_qa.js";
-import { p as k } from "./polyval_ra.js";
-import { p as w } from "./polyval_sa.js";
-import { p as x } from "./polyval_rb.js";
-import { p as z } from "./polyval_sb.js";
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*
-*
-* ## Notice
-*
-* The following copyright, license, and long comment were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_erf.c}. The implementation follows the original, but has been modified for JavaScript.
-*
-* ```text
-* Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
-*
-* Developed at SunPro, a Sun Microsystems, Inc. business.
-* Permission to use, copy, modify, and distribute this
-* software is freely granted, provided that this notice
-* is preserved.
-* ```
-*/
-var B = l, u = v, D = a, E = c, F = N, G = d, H = g, I = h, L = j, M = k, T = w, W = x, X = z, e = 1e-300, Y = 13877787807814457e-33, $ = 0.8450629115104675, b = 0.12837916709551256, q = 1, y = -0.0023621185607526594, A = 1, C = -0.009864944034847148, J = 1, K = -0.0098649429247001, O = 1;
-function P(o) {
-  var f, i, t, m, r, p, s, n;
-  if (B(o))
-    return NaN;
-  if (o === E)
-    return 0;
-  if (o === F)
-    return 2;
-  if (o === 0)
-    return 1;
-  if (o < 0 ? (f = !0, i = -o) : (f = !1, i = o), i < 0.84375)
-    return i < Y ? 1 - o : (t = o * o, m = b + t * G(t), r = q + t * H(t), p = m / r, o < 0.25 ? 1 - (o + o * p) : (m = o * p, m += o - 0.5, 0.5 - m));
-  if (i < 1.25)
-    return r = i - 1, s = y + r * I(r), n = A + r * L(r), f ? 1 + $ + s / n : 1 - $ - s / n;
-  if (i < 28) {
-    if (r = 1 / (i * i), i < 2.857142857142857)
-      m = C + r * M(r), r = J + r * T(r);
-    else {
-      if (o < -6)
-        return 2 - e;
-      m = K + r * W(r), r = O + r * X(r);
-    }
-    return t = D(i, 0), m = u(-(t * t) - 0.5625) * u((t - i) * (t + i) + m / r), f ? 2 - m / i : m / i;
-  }
-  return f ? 2 - e : e * e;
-}
-var er = P;
-export {
-  er as m
-};
-//# sourceMappingURL=main.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/main.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/main.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyright, license, and long comment were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_erf.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar polyvalPP = require( './polyval_pp.js' );\nvar polyvalQQ = require( './polyval_qq.js' );\nvar polyvalPA = require( './polyval_pa.js' );\nvar polyvalQA = require( './polyval_qa.js' );\nvar polyvalRA = require( './polyval_ra.js' );\nvar polyvalSA = require( './polyval_sa.js' );\nvar polyvalRB = require( './polyval_rb.js' );\nvar polyvalSB = require( './polyval_sb.js' );\n\n\n// VARIABLES //\n\nvar TINY = 1.0e-300;\n\n// 2**-56 = 1/(2**56) = 1/72057594037927940\nvar SMALL = 1.3877787807814457e-17;\n\nvar ERX = 8.45062911510467529297e-1;  // 0x3FEB0AC1, 0x60000000\n\nvar PPC = 1.28379167095512558561e-1;  // 0x3FC06EBA, 0x8214DB68\nvar QQC = 1.0;\n\nvar PAC = -2.36211856075265944077e-3; // 0xBF6359B8, 0xBEF77538\nvar QAC = 1.0;\n\nvar RAC = -9.86494403484714822705e-3; // 0xBF843412, 0x600D6435\nvar SAC = 1.0;\n\nvar RBC = -9.86494292470009928597e-3; // 0xBF843412, 0x39E86F4A\nvar SBC = 1.0;\n\n\n// MAIN //\n\n/**\n* Evaluates the complementary error function.\n*\n* ```tex\n* \\operatorname{erf}(x) = \\frac{2}{\\sqrt{\\pi}} \\int^{x}_{0} e^{-t^2}\\ \\mathrm{dt}\n* ```\n*\n* Note that\n*\n* ```tex\n* \\begin{align*}\n* \\operatorname{erfc}(x) &= 1 - \\operatorname{erf}(x) \\\\\n* \\operatorname{erf}(-x) &= -\\operatorname{erf}(x) \\\\\n* \\operatorname{erfc}(-x) &= 2 - \\operatorname{erfc}(x)\n* \\end{align*}\n* ```\n*\n* ## Method\n*\n* 1.  For \\\\(|x| \\in [0, 0.84375)\\\\),\n*\n*     ```tex\n*     \\operatorname{erf}(x) = x + x \\cdot \\operatorname{R}(x^2)\n*     ```\n*\n*     and\n*\n*     ```tex\n*     \\operatorname{erfc}(x) = \\begin{cases}\n*     1 - \\operatorname{erf}(x) & \\textrm{if}\\ x \\in (-.84375,0.25) \\\\\n*     0.5 + ((0.5-x)-x \\mathrm{R}) & \\textrm{if}\\ x \\in [0.25,0.84375)\n*     \\end{cases}\n*     ```\n*\n*     where \\\\(R = P/Q\\\\) and where \\\\(P\\\\) is an odd polynomial of degree \\\\(8\\\\) and \\\\(Q\\\\) is an odd polynomial of degree \\\\(10\\\\).\n*\n*     ```tex\n*     \\biggl| \\mathrm{R} - \\frac{\\operatorname{erf}(x)-x}{x} \\biggr| \\leq 2^{-57.90}\n*     ```\n*\n*     <!-- <note> -->\n*\n*     The formula is derived by noting\n*\n*     ```tex\n*     \\operatorname{erf}(x) = \\frac{2}{\\sqrt{\\pi}}\\biggl(x - \\frac{x^3}{3} + \\frac{x^5}{10} - \\frac{x^7}{42} + \\ldots \\biggr)\n*     ```\n*\n*     and that\n*\n*     ```tex\n*     \\frac{2}{\\sqrt{\\pi}} = 1.128379167095512573896158903121545171688\n*     ```\n*\n*     is close to unity. The interval is chosen because the fix point of \\\\(\\operatorname{erf}(x)\\\\) is near \\\\(0.6174\\\\) (i.e., \\\\(\\operatorname{erf(x)} = x\\\\) when \\\\(x\\\\) is near \\\\(0.6174\\\\)), and, by some experiment, \\\\(0.84375\\\\) is chosen to guarantee the error is less than one ulp for \\\\(\\operatorname{erf}(x)\\\\).\n*\n*     <!-- </note> -->\n*\n* 2.  For \\\\(|x| \\in [0.84375,1.25)\\\\), let \\\\(s = |x|-1\\\\), and \\\\(c = 0.84506291151\\\\) rounded to single (\\\\(24\\\\) bits)\n*\n*     ```tex\n*     \\operatorname{erf}(x) = \\operatorname{sign}(x) \\cdot \\biggl(c + \\frac{\\operatorname{P1}(s)}{\\operatorname{Q1}(s)}\\biggr)\n*     ```\n*\n*     and\n*\n*     ```tex\n*     \\operatorname{erfc}(x) = \\begin{cases}\n*     (1-c) - \\frac{\\operatorname{P1}(s)}{\\operatorname{Q1}(s)} & \\textrm{if}\\ x > 0 \\\\\n*     1 + \\biggl(c + \\frac{\\operatorname{P1}(s)}{\\operatorname{Q1}(s)}\\biggr) & \\textrm{if}\\ x < 0\n*     \\end{cases}\n*     ```\n*\n*     where\n*\n*     ```tex\n*     \\biggl|\\frac{\\mathrm{P1}}{\\mathrm{Q1}} - (\\operatorname{erf}(|x|)-c)\\biggr| \\leq 2^{-59.06}\n*     ```\n*\n*     <!-- <note> -->\n*\n*     Here, we use the Taylor series expansion at \\\\(x = 1\\\\)\n*\n*     ```tex\n*     \\begin{align*}\n*     \\operatorname{erf}(1+s) &= \\operatorname{erf}(1) + s\\cdot \\operatorname{poly}(s) \\\\\n*     &= 0.845.. + \\frac{\\operatorname{P1}(s)}{\\operatorname{Q1}(s)}\n*     \\end{align*}\n*     ```\n*\n*     using a rational approximation to approximate\n*\n*     ```tex\n*     \\operatorname{erf}(1+s) - (c = (\\mathrm{single})0.84506291151)\n*     ```\n*\n*     <!-- </note> -->\n*\n*     Note that, for \\\\(x \\in [0.84375,1.25)\\\\), \\\\(|\\mathrm{P1}/\\mathrm{Q1}| < 0.078\\\\), where\n*\n*     -   \\\\(\\operatorname{P1}(s)\\\\) is a degree \\\\(6\\\\) polynomial in \\\\(s\\\\)\n*     -   \\\\(\\operatorname{Q1}(s)\\\\) is a degree \\\\(6\\\\) polynomial in \\\\(s\\\\)\n*\n* 3.  For \\\\(x \\in [1.25,1/0.35)\\\\),\n*\n*     ```tex\n*     \\begin{align*}\n*     \\operatorname{erfc}(x) &= \\frac{1}{x}e^{-x^2-0.5625+(\\mathrm{R1}/\\mathrm{S1})} \\\\\n*     \\operatorname{erf}(x) &= 1 - \\operatorname{erfc}(x)\n*     \\end{align*}\n*     ```\n*\n*     where\n*\n*     -   \\\\(\\operatorname{R1}(z)\\\\) is a degree \\\\(7\\\\) polynomial in \\\\(z\\\\), where \\\\(z = 1/x^2\\\\)\n*     -   \\\\(\\operatorname{S1}(z)\\\\) is a degree \\\\(8\\\\) polynomial in \\\\(z\\\\)\n*\n* 4.  For \\\\(x \\in [1/0.35,28)\\\\),\n*\n*     ```tex\n*     \\operatorname{erfc}(x) = \\begin{cases}\n*     \\frac{1}{x} e^{-x^2-0.5625+(\\mathrm{R2}/\\mathrm{S2})} & \\textrm{if}\\ x > 0 \\\\\n*     2.0 - \\frac{1}{x} e^{-x^2-0.5625+(\\mathrm{R2}/\\mathrm{S2})} & \\textrm{if}\\ -6 < x < 0 \\\\\n*     2.0 - \\mathrm{tiny} & \\textrm{if}\\ x \\leq -6\n*     \\end{cases}\n*     ```\n*\n*     and\n*\n*     ```tex\n*     \\operatorname{erf}(x) = \\begin{cases}\n*     \\operatorname{sign}(x) \\cdot (1.0 - \\operatorname{erfc}(x)) & \\textrm{if}\\ x < 6 \\\\\n*     \\operatorname{sign}(x) \\cdot (1.0 - \\mathrm{tiny}) & \\textrm{otherwise}\n*     \\end{cases}\n*     ```\n*\n*     where\n*\n*     -   \\\\(\\operatorname{R2}(z)\\\\) is a degree \\\\(6\\\\) polynomial in \\\\(z\\\\), where \\\\(z = 1/x^2\\\\)\n*     -   \\\\(\\operatorname{S2}(z)\\\\) is a degree \\\\(7\\\\) polynomial in \\\\(z\\\\)\n*\n* 5.  For \\\\(x \\in [28, \\infty)\\\\),\n*\n*     ```tex\n*     \\begin{align*}\n*     \\operatorname{erf}(x) &= \\operatorname{sign}(x) \\cdot (1 - \\mathrm{tiny}) & \\textrm{(raise inexact)}\n*     \\end{align*}\n*     ```\n*\n*     and\n*\n*     ```tex\n*     \\operatorname{erfc}(x) = \\begin{cases}\n*     \\mathrm{tiny} \\cdot \\mathrm{tiny} & \\textrm{if}\\ x > 0\\ \\textrm{(raise underflow)} \\\\\n*     2 - \\mathrm{tiny} & \\textrm{if}\\ x < 0\n*     \\end{cases}\n*     ```\n*\n* ## Special Cases\n*\n* ```tex\n* \\begin{align*}\n* \\operatorname{erf}(0) &= 0 \\\\\n* \\operatorname{erf}(-0) &= -0 \\\\\n* \\operatorname{erf}(\\infty) &= 1 \\\\\n* \\operatorname{erf}(-\\infty) &= -1 \\\\\n* \\operatorname{erfc}(0) &= 1 \\\\\n* \\operatorname{erfc}(\\infty) &= 0 \\\\\n* \\operatorname{erfc}(-\\infty) &= 2 \\\\\n* \\operatorname{erf}(\\mathrm{NaN}) &= \\mathrm{NaN} \\\\\n* \\operatorname{erfc}(\\mathrm{NaN}) &= \\mathrm{NaN}\n* \\end{align*}\n* ```\n*\n* ## Notes\n*\n* -   To compute \\\\(\\exp(-x^2-0.5625+(\\mathrm{R}/\\mathrm{S}))\\\\), let \\\\(s\\\\) be a single precision number and \\\\(s := x\\\\); then\n*\n*     ```tex\n*     -x^2 = -s^2 + (s-x)(s+x)\n*     ```\n*\n*     and\n*\n*     ```tex\n*     e^{-x^2-0.5626+(\\mathrm{R}/\\mathrm{S})} = e^{-s^2-0.5625} e^{(s-x)(s+x)+(\\mathrm{R}/\\mathrm{S})}\n*     ```\n*\n* -   `#4` and `#5` make use of the asymptotic series\n*\n*     ```tex\n*     \\operatorname{erfc}(x) \\approx \\frac{e^{-x^2}}{x\\sqrt{\\pi}} (1 + \\operatorname{poly}(1/x^2))\n*     ```\n*\n*     We use a rational approximation to approximate\n*\n*     ```tex\n*     g(s) = f(1/x^2) = \\ln(\\operatorname{erfc}(x) \\cdot x) - x^2 + 0.5625\n*     ```\n*\n* -   The error bound for \\\\(\\mathrm{R1}/\\mathrm{S1}\\\\) is\n*\n*     ```tex\n*     |\\mathrm{R1}/\\mathrm{S1} - f(x)| < 2^{-62.57}\n*     ```\n*\n*     and for \\\\(\\mathrm{R2}/\\mathrm{S2}\\\\) is\n*\n*     ```tex\n*     |\\mathrm{R2}/\\mathrm{S2} - f(x)| < 2^{-61.52}\n*     ```\n*\n* @param {number} x - input value\n* @returns {number} function value\n*\n* @example\n* var y = erfc( 2.0 );\n* // returns ~0.0047\n*\n* @example\n* var y = erfc( -1.0 );\n* // returns ~1.8427\n*\n* @example\n* var y = erfc( 0.0 );\n* // returns 1.0\n*\n* @example\n* var y = erfc( Infinity );\n* // returns 0.0\n*\n* @example\n* var y = erfc( -Infinity );\n* // returns 2.0\n*\n* @example\n* var y = erfc( NaN );\n* // returns NaN\n*/\nfunction erfc( x ) {\n\tvar sign;\n\tvar ax;\n\tvar z;\n\tvar r;\n\tvar s;\n\tvar y;\n\tvar p;\n\tvar q;\n\n\t// Special case: NaN\n\tif ( isnan( x ) ) {\n\t\treturn NaN;\n\t}\n\t// Special case: +infinity\n\tif ( x === PINF ) {\n\t\treturn 0.0;\n\t}\n\t// Special case: -infinity\n\tif ( x === NINF ) {\n\t\treturn 2.0;\n\t}\n\t// Special case: +-0\n\tif ( x === 0.0 ) {\n\t\treturn 1.0;\n\t}\n\tif ( x < 0.0 ) {\n\t\tsign = true;\n\t\tax = -x;\n\t} else {\n\t\tsign = false;\n\t\tax = x;\n\t}\n\t// |x| < 0.84375\n\tif ( ax < 0.84375 ) {\n\t\tif ( ax < SMALL ) {\n\t\t\treturn 1.0 - x; // raise inexact\n\t\t}\n\t\tz = x * x;\n\t\tr = PPC + ( z*polyvalPP( z ) );\n\t\ts = QQC + ( z*polyvalQQ( z ) );\n\t\ty = r / s;\n\n\t\t// x < 1/4\n\t\tif ( x < 0.25 ) {\n\t\t\treturn 1.0 - ( x + (x*y) );\n\t\t}\n\t\tr = x * y;\n\t\tr += x - 0.5;\n\t\treturn 0.5 - r;\n\t}\n\t// 0.84375 <= |x| < 1.25\n\tif ( ax < 1.25 ) {\n\t\ts = ax - 1.0;\n\t\tp = PAC + ( s*polyvalPA( s ) );\n\t\tq = QAC + ( s*polyvalQA( s ) );\n\t\tif ( sign ) {\n\t\t\treturn 1.0 + ERX + (p/q);\n\t\t}\n\t\treturn 1.0 - ERX - (p/q);\n\t}\n\t// |x| < 28\n\tif ( ax < 28.0 ) {\n\t\ts = 1.0 / (ax*ax);\n\n\t\t// |x| < 1/0.35 ~ 2.857143\n\t\tif ( ax < 2.857142857142857 ) {\n\t\t\tr = RAC + ( s*polyvalRA( s ) );\n\t\t\ts = SAC + ( s*polyvalSA( s ) );\n\t\t}\n\t\t// |x| >= 1/0.35 ~ 2.857143\n\t\telse {\n\t\t\t// x < -6\n\t\t\tif ( x < -6.0 ) {\n\t\t\t\treturn 2.0 - TINY; // raise inexact\n\t\t\t}\n\t\t\tr = RBC + ( s*polyvalRB( s ) );\n\t\t\ts = SBC + ( s*polyvalSB( s ) );\n\t\t}\n\t\tz = setLowWord( ax, 0 ); // pseudo-single (20-bit) precision x\n\t\tr = exp( -(z*z) - 0.5625 ) * exp( ((z-ax)*(z+ax)) + (r/s) );\n\t\tif ( sign ) {\n\t\t\treturn 2.0 - (r/ax);\n\t\t}\n\t\treturn r/ax;\n\t}\n\tif ( sign ) {\n\t\treturn 2.0 - TINY; // raise inexact; ~2\n\t}\n\treturn TINY * TINY; // raise inexact; ~0\n}\n\n\n// EXPORTS //\n\nmodule.exports = erfc;\n"],"names":["isnan","require$$0","exp","require$$1","setLowWord","require$$2","PINF","require$$3","NINF","require$$4","polyvalPP","require$$5","polyvalQQ","require$$6","polyvalPA","require$$7","polyvalQA","require$$8","polyvalRA","require$$9","polyvalSA","require$$10","polyvalRB","require$$11","polyvalSB","require$$12","TINY","SMALL","ERX","PPC","QQC","PAC","QAC","RAC","SAC","RBC","SBC","erfc","x","sign","ax","z","r","s","y","p","q","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIA,IAAQC,GACRC,IAAMC,GACNC,IAAaC,GACbC,IAAOC,GACPC,IAAOC,GACPC,IAAYC,GACZC,IAAYC,GACZC,IAAYC,GACZC,IAAYC,GACZC,IAAYC,GACZC,IAAYC,GACZC,IAAYC,GACZC,IAAYC,GAKZC,IAAO,QAGPC,IAAQ,uBAERC,IAAM,oBAENC,IAAM,qBACNC,IAAM,GAENC,IAAM,wBACNC,IAAM,GAENC,IAAM,uBACNC,IAAM,GAENC,IAAM,qBACNC,IAAM;AAoPV,SAASC,EAAMC,GAAI;AAClB,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,MAAK9C,EAAOsC,CAAAA;AACX,WAAO;AAGR,MAAKA,MAAMhC;AACV,WAAO;AAGR,MAAKgC,MAAM9B;AACV,WAAO;AAGR,MAAK8B,MAAM;AACV,WAAO;AAUR,MARKA,IAAI,KACRC,IAAO,IACPC,IAAK,CAACF,MAENC,IAAO,IACPC,IAAKF,IAGDE,IAAK;AACT,WAAKA,IAAKb,IACF,IAAMW,KAEdG,IAAIH,IAAIA,GACRI,IAAIb,IAAQY,IAAE/B,EAAW+B,CAAC,GAC1BE,IAAIb,IAAQW,IAAE7B,EAAW6B,CAAC,GAC1BG,IAAIF,IAAIC,GAGHL,IAAI,OACD,KAAQA,IAAKA,IAAEM,MAEvBF,IAAIJ,IAAIM,GACRF,KAAKJ,IAAI,KACF,MAAMI;AAGd,MAAKF,IAAK;AAIT,WAHAG,IAAIH,IAAK,GACTK,IAAId,IAAQY,IAAE7B,EAAW6B,CAAC,GAC1BG,IAAId,IAAQW,IAAE3B,EAAW2B,CAAC,GACrBJ,IACG,IAAMX,IAAOiB,IAAEC,IAEhB,IAAMlB,IAAOiB,IAAEC;AAGvB,MAAKN,IAAK,IAAO;AAIhB,QAHAG,IAAI,KAAOH,IAAGA,IAGTA,IAAK;AACTE,MAAAA,IAAIT,IAAQU,IAAEzB,EAAWyB,CAAC,GAC1BA,IAAIT,IAAQS,IAAEvB,EAAWuB,CAAC;AAAA,SAGtB;AAEJ,UAAKL,IAAI;AACR,eAAO,IAAMZ;AAEdgB,MAAAA,IAAIP,IAAQQ,IAAErB,EAAWqB,CAAC,GAC1BA,IAAIP,IAAQO,IAAEnB,EAAWmB,CAAC;AAAA,IAC7B;AAGE,WAFAF,IAAIrC,EAAYoC,GAAI,CAAA,GACpBE,IAAIxC,EAAK,EAAEuC,IAAEA,KAAK,MAAM,IAAKvC,GAAOuC,IAAED,MAAKC,IAAED,KAAQE,IAAEC,CAAE,GACpDJ,IACG,IAAOG,IAAEF,IAEVE,IAAEF;AAAAA,EACX;AACC,SAAKD,IACG,IAAMb,IAEPA,IAAOA;AACf;AAKA,IAAAqB,KAAiBV;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_pa.js

@@ -1,25 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function t(n) {
-  return n === 0 ? 0.41485611868374833 : 0.41485611868374833 + n * (-0.3722078760357013 + n * (0.31834661990116175 + n * (-0.11089469428239668 + n * (0.035478304325618236 + n * -0.002166375594868791))));
-}
-var a = t;
-export {
-  a as p
-};
-//# sourceMappingURL=polyval_pa.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_pa.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_pa.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/polyval_pa.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 0.41485611868374833;\n\t}\n\treturn 0.41485611868374833 + (x * (-0.3722078760357013 + (x * (0.31834661990116175 + (x * (-0.11089469428239668 + (x * (0.035478304325618236 + (x * -0.002166375594868791))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_pa"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,sBAED,sBAAuBA,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,uBAAwBA,KAAK,uBAAwBA,IAAI;AACrJ;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_pp.js

@@ -1,25 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function e(r) {
-  return r === 0 ? -0.3250421072470015 : -0.3250421072470015 + r * (-0.02848174957559851 + r * (-0.005770270296489442 + r * -23763016656650163e-21));
-}
-var n = e;
-export {
-  n as p
-};
-//# sourceMappingURL=polyval_pp.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_pp.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_pp.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/polyval_pp.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn -0.3250421072470015;\n\t}\n\treturn -0.3250421072470015 + (x * (-0.02848174957559851 + (x * (-0.005770270296489442 + (x * -0.000023763016656650163))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_pp"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,sBAED,sBAAuBA,KAAK,uBAAwBA,KAAK,wBAAyBA,IAAI;AAC9F;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_qa.js

@@ -1,25 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function e(a) {
-  return a === 0 ? 0.10642088040084423 : 0.10642088040084423 + a * (0.540397917702171 + a * (0.07182865441419627 + a * (0.12617121980876164 + a * (0.01363708391202905 + a * 0.011984499846799107))));
-}
-var n = e;
-export {
-  n as p
-};
-//# sourceMappingURL=polyval_qa.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_qa.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_qa.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/polyval_qa.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 0.10642088040084423;\n\t}\n\treturn 0.10642088040084423 + (x * (0.540397917702171 + (x * (0.07182865441419627 + (x * (0.12617121980876164 + (x * (0.01363708391202905 + (x * 0.011984499846799107))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_qa"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,sBAED,sBAAuBA,KAAK,oBAAqBA,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,sBAAuBA,IAAI;AACjJ;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_qq.js

@@ -1,25 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function a(e) {
-  return e === 0 ? 0.39791722395915535 : 0.39791722395915535 + e * (0.0650222499887673 + e * (0.005081306281875766 + e * (13249473800432164e-20 + e * -3960228278775368e-21)));
-}
-var n = a;
-export {
-  n as p
-};
-//# sourceMappingURL=polyval_qq.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_qq.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_qq.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/polyval_qq.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 0.39791722395915535;\n\t}\n\treturn 0.39791722395915535 + (x * (0.0650222499887673 + (x * (0.005081306281875766 + (x * (0.00013249473800432164 + (x * -0.000003960228278775368))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_qq"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,sBAED,sBAAuBA,KAAK,qBAAsBA,KAAK,uBAAwBA,KAAK,wBAA0BA,IAAI;AAC1H;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_ra.js

@@ -1,25 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function e(a) {
-  return a === 0 ? -0.6938585727071818 : -0.6938585727071818 + a * (-10.558626225323291 + a * (-62.375332450326006 + a * (-162.39666946257347 + a * (-184.60509290671104 + a * (-81.2874355063066 + a * -9.814329344169145)))));
-}
-var n = e;
-export {
-  n as p
-};
-//# sourceMappingURL=polyval_ra.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_ra.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_ra.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/polyval_ra.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn -0.6938585727071818;\n\t}\n\treturn -0.6938585727071818 + (x * (-10.558626225323291 + (x * (-62.375332450326006 + (x * (-162.39666946257347 + (x * (-184.60509290671104 + (x * (-81.2874355063066 + (x * -9.814329344169145))))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_ra"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,sBAED,sBAAuBA,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,oBAAqBA,IAAI;AAC7K;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_rb.js

@@ -1,25 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function e(a) {
-  return a === 0 ? -0.799283237680523 : -0.799283237680523 + a * (-17.757954917754752 + a * (-160.63638485582192 + a * (-637.5664433683896 + a * (-1025.0951316110772 + a * -483.5191916086514))));
-}
-var n = e;
-export {
-  n as p
-};
-//# sourceMappingURL=polyval_rb.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_rb.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_rb.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/polyval_rb.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn -0.799283237680523;\n\t}\n\treturn -0.799283237680523 + (x * (-17.757954917754752 + (x * (-160.63638485582192 + (x * (-637.5664433683896 + (x * (-1025.0951316110772 + (x * -483.5191916086514))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_rb"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,qBAED,qBAAsBA,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,qBAAsBA,KAAK,sBAAuBA,IAAI;AACjJ;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_sa.js

@@ -1,25 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function e(a) {
-  return a === 0 ? 19.651271667439257 : 19.651271667439257 + a * (137.65775414351904 + a * (434.56587747522923 + a * (645.3872717332679 + a * (429.00814002756783 + a * (108.63500554177944 + a * (6.570249770319282 + a * -0.0604244152148581))))));
-}
-var n = e;
-export {
-  n as p
-};
-//# sourceMappingURL=polyval_sa.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_sa.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_sa.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/polyval_sa.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 19.651271667439257;\n\t}\n\treturn 19.651271667439257 + (x * (137.65775414351904 + (x * (434.56587747522923 + (x * (645.3872717332679 + (x * (429.00814002756783 + (x * (108.63500554177944 + (x * (6.570249770319282 + (x * -0.0604244152148581))))))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_sa"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,qBAED,qBAAsBA,KAAK,qBAAsBA,KAAK,qBAAsBA,KAAK,oBAAqBA,KAAK,qBAAsBA,KAAK,qBAAsBA,KAAK,oBAAqBA,IAAI;AAClM;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_sb.js

@@ -1,25 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function e(a) {
-  return a === 0 ? 30.33806074348246 : 30.33806074348246 + a * (325.7925129965739 + a * (1536.729586084437 + a * (3199.8582195085955 + a * (2553.0504064331644 + a * (474.52854120695537 + a * -22.44095244658582)))));
-}
-var n = e;
-export {
-  n as p
-};
-//# sourceMappingURL=polyval_sb.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfc/lib/polyval_sb.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_sb.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfc/lib/polyval_sb.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 30.33806074348246;\n\t}\n\treturn 30.33806074348246 + (x * (325.7925129965739 + (x * (1536.729586084437 + (x * (3199.8582195085955 + (x * (2553.0504064331644 + (x * (474.52854120695537 + (x * -22.44095244658582))))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_sb"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,oBAED,oBAAqBA,KAAK,oBAAqBA,KAAK,oBAAqBA,KAAK,qBAAsBA,KAAK,qBAAsBA,KAAK,qBAAsBA,IAAI;AACtK;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfcinv/lib/index.js

@@ -1,23 +0,0 @@
-import { m } from "./main.js";
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-var r = m, o = r;
-export {
-  o as l
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfcinv/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfcinv/lib/index.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Evaluate the inverse complementary error function.\n*\n* @module @stdlib/math-base-special-erfcinv\n*\n* @example\n* var erfcinv = require( '@stdlib/math-base-special-erfcinv' );\n*\n* var y = erfcinv( 0.5 );\n* // returns ~0.4769\n*\n* y = erfcinv( 0.8 );\n* // returns ~-0.1791\n*\n* y = erfcinv( 0.0 );\n* // returns Infinity\n*\n* y = erfcinv( 2.0 );\n* // returns -Infinity\n*\n* y = erfcinv( NaN );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["main","require$$0","lib"],"mappings":";;;;;;;;;;;;;;;;;;AA8CA,IAAIA,IAAOC,GAKXC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfcinv/lib/main.js

@@ -1,50 +0,0 @@
-import { l as $ } from "../../math-base-assert-is-nan/lib/index.js";
-import { l } from "../../math-base-special-sqrt/lib/index.js";
-import { l as n } from "../../math-base-special-ln/lib/index.js";
-import { l as N } from "../../constants-float64-pinf/lib/index.js";
-import { l as a } from "../../constants-float64-ninf/lib/index.js";
-import { r as v } from "./rational_p1q1.js";
-import { r as e } from "./rational_p2q2.js";
-import { r as u } from "./rational_p3q3.js";
-import { r as b } from "./rational_p4q4.js";
-import { r as c } from "./rational_p5q5.js";
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*
-*
-* ## Notice
-*
-* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_81_0/boost/math/special_functions/detail/erf_inv.hpp}. This implementation follows the original, but has been modified for JavaScript.
-*
-* ```text
-* (C) Copyright John Maddock 2006.
-*
-* Use, modification and distribution are subject to the
-* Boost Software License, Version 1.0. (See accompanying file
-* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
-* ```
-*/
-var d = $, p = l, s = n, g = N, h = a, j = v, k = e, w = u, x = b, y = c, I = 0.08913147449493408, L = 2.249481201171875, P = 0.807220458984375, R = 0.9399557113647461, Y = 0.9836282730102539;
-function _(o) {
-  var t, i, r, f, m;
-  return d(o) ? NaN : o === 0 ? g : o === 2 ? h : o === 1 ? 0 : o > 2 || o < 0 ? NaN : (o > 1 ? (t = -1, r = 2 - o) : (t = 1, r = o), o = 1 - r, o <= 0.5 ? (f = o * (o + 10), m = j(o), t * (f * I + f * m)) : r >= 0.25 ? (f = p(-2 * s(r)), r -= 0.25, m = k(r), t * (f / (L + m))) : (r = p(-s(r)), r < 3 ? (i = r - 1.125, m = w(i), t * (P * r + m * r)) : r < 6 ? (i = r - 3, m = x(i), t * (R * r + m * r)) : (i = r - 6, m = y(i), t * (Y * r + m * r))));
-}
-var J = _;
-export {
-  J as m
-};
-//# sourceMappingURL=main.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfcinv/lib/main.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfcinv/lib/main.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_81_0/boost/math/special_functions/detail/erf_inv.hpp}. This implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* (C) Copyright John Maddock 2006.\n*\n* Use, modification and distribution are subject to the\n* Boost Software License, Version 1.0. (See accompanying file\n* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar ln = require( '@stdlib/math-base-special-ln' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar rationalFcnR1 = require( './rational_p1q1.js' );\nvar rationalFcnR2 = require( './rational_p2q2.js' );\nvar rationalFcnR3 = require( './rational_p3q3.js' );\nvar rationalFcnR4 = require( './rational_p4q4.js' );\nvar rationalFcnR5 = require( './rational_p5q5.js' );\n\n\n// VARIABLES //\n\nvar Y1 = 8.91314744949340820313e-2;\nvar Y2 = 2.249481201171875;\nvar Y3 = 8.07220458984375e-1;\nvar Y4 = 9.3995571136474609375e-1;\nvar Y5 = 9.8362827301025390625e-1;\n\n\n// MAIN //\n\n/**\n* Evaluates the inverse complementary error function.\n*\n* Note that\n*\n* ```tex\n* \\operatorname{erfc^{-1}}(1-z) = \\operatorname{erf^{-1}}(z)\n* ```\n*\n* ## Method\n*\n* 1.  For \\\\(|x| \\leq 0.5\\\\), we evaluate the inverse error function using the rational approximation\n*\n*     ```tex\n*     \\operatorname{erf^{-1}}(x) = x(x+10)(\\mathrm{Y} + \\operatorname{R}(x))\n*     ```\n*\n*     where \\\\(Y\\\\) is a constant and \\\\(\\operatorname{R}(x)\\\\) is optimized for a low absolute error compared to \\\\(|Y|\\\\).\n*\n*     <!-- <note> -->\n*\n*     Max error \\\\(2.001849\\mbox{e-}18\\\\). Maximum deviation found (error term at infinite precision) \\\\(8.030\\mbox{e-}21\\\\).\n*\n*     <!-- </note> -->\n*\n* 2.  For \\\\(0.5 > 1-|x| \\geq 0\\\\), we evaluate the inverse error function using the rational approximation\n*\n*     ```tex\n*     \\operatorname{erf^{-1}} = \\frac{\\sqrt{-2 \\cdot \\ln(1-x)}}{\\mathrm{Y} + \\operatorname{R}(1-x)}\n*     ```\n*\n*     where \\\\(Y\\\\) is a constant, and \\\\(\\operatorname{R}(q)\\\\) is optimized for a low absolute error compared to \\\\(Y\\\\).\n*\n*     <!-- <note> -->\n*\n*     Max error \\\\(7.403372\\mbox{e-}17\\\\). Maximum deviation found (error term at infinite precision) \\\\(4.811\\mbox{e-}20\\\\).\n*\n*     <!-- </note> -->\n*\n* 3.  For \\\\(1-|x| < 0.25\\\\), we have a series of rational approximations all of the general form\n*\n*     ```tex\n*     p = \\sqrt{-\\ln(1-x)}\n*     ```\n*\n*     Accordingly, the result is given by\n*\n*     ```tex\n*     \\operatorname{erf^{-1}}(x) = p(\\mathrm{Y} + \\operatorname{R}(p-B))\n*     ```\n*\n*     where \\\\(Y\\\\) is a constant, \\\\(B\\\\) is the lowest value of \\\\(p\\\\) for which the approximation is valid, and \\\\(\\operatorname{R}(x-B)\\\\) is optimized for a low absolute error compared to \\\\(Y\\\\).\n*\n*     <!-- <note> -->\n*\n*     Almost all code will only go through the first or maybe second approximation.  After that we are dealing with very small input values.\n*\n*     -   If \\\\(p < 3\\\\), max error \\\\(1.089051\\mbox{e-}20\\\\).\n*     -   If \\\\(p < 6\\\\), max error \\\\(8.389174\\mbox{e-}21\\\\).\n*     -   If \\\\(p < 18\\\\), max error \\\\(1.481312\\mbox{e-}19\\\\).\n*     -   If \\\\(p < 44\\\\), max error \\\\(5.697761\\mbox{e-}20\\\\).\n*     -   If \\\\(p \\geq 44\\\\), max error \\\\(1.279746\\mbox{e-}20\\\\).\n*\n*     <!-- </note> -->\n*\n*     <!-- <note> -->\n*\n*     The Boost library can accommodate \\\\(80\\\\) and \\\\(128\\\\) bit long doubles. JavaScript only supports a \\\\(64\\\\) bit double (IEEE 754). Accordingly, the smallest \\\\(p\\\\) (in JavaScript at the time of this writing) is \\\\(\\sqrt{-\\ln(\\sim5\\mbox{e-}324)} = 27.284429111150214\\\\).\n*\n*     <!-- </note> -->\n*\n* @param {number} x - input value\n* @returns {number} function value\n*\n* @example\n* var y = erfcinv( 0.5 );\n* // returns ~0.4769\n*\n* @example\n* var y = erfcinv( 0.8 );\n* // returns ~0.1791\n*\n* @example\n* var y = erfcinv( 0.0 );\n* // returns Infinity\n*\n* @example\n* var y = erfcinv( 2.0 );\n* // returns -Infinity\n*\n* @example\n* var y = erfcinv( NaN );\n* // returns NaN\n*/\nfunction erfcinv( x ) {\n\tvar sign;\n\tvar qs;\n\tvar q;\n\tvar g;\n\tvar r;\n\n\t// Special case: NaN\n\tif ( isnan( x ) ) {\n\t\treturn NaN;\n\t}\n\t// Special case: 0\n\tif ( x === 0.0 ) {\n\t\treturn PINF;\n\t}\n\t// Special case: 2\n\tif ( x === 2.0 ) {\n\t\treturn NINF;\n\t}\n\t// Special case: 1\n\tif ( x === 1.0 ) {\n\t\treturn 0.0;\n\t}\n\tif ( x > 2.0 || x < 0.0 ) {\n\t\treturn NaN;\n\t}\n\t// Argument reduction (reduce to interval [0,1]). If `x` is outside [0,1], we can take advantage of the complementary error function reflection formula: `erfc(-z) = 2 - erfc(z)`, by negating the result once finished.\n\tif ( x > 1.0 ) {\n\t\tsign = -1.0;\n\t\tq = 2.0 - x;\n\t} else {\n\t\tsign = 1.0;\n\t\tq = x;\n\t}\n\tx = 1.0 - q;\n\n\t// x = 1-q <= 0.5\n\tif ( x <= 0.5 ) {\n\t\tg = x * ( x + 10.0 );\n\t\tr = rationalFcnR1( x );\n\t\treturn sign * ( (g*Y1) + (g*r) );\n\t}\n\t// q >= 0.25\n\tif ( q >= 0.25 ) {\n\t\tg = sqrt( -2.0 * ln(q) );\n\t\tq -= 0.25;\n\t\tr = rationalFcnR2( q );\n\t\treturn sign * ( g / (Y2+r) );\n\t}\n\tq = sqrt( -ln( q ) );\n\n\t// q < 3\n\tif ( q < 3.0 ) {\n\t\tqs = q - 1.125;\n\t\tr = rationalFcnR3( qs );\n\t\treturn sign * ( (Y3*q) + (r*q) );\n\t}\n\t// q < 6\n\tif ( q < 6.0 ) {\n\t\tqs = q - 3.0;\n\t\tr = rationalFcnR4( qs );\n\t\treturn sign * ( (Y4*q) + (r*q) );\n\t}\n\t// q < 18\n\tqs = q - 6.0;\n\tr = rationalFcnR5( qs );\n\treturn sign * ( (Y5*q) + (r*q) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = erfcinv;\n"],"names":["isnan","require$$0","sqrt","require$$1","ln","require$$2","PINF","require$$3","NINF","require$$4","rationalFcnR1","require$$5","rationalFcnR2","require$$6","rationalFcnR3","require$$7","rationalFcnR4","require$$8","rationalFcnR5","require$$9","Y1","Y2","Y3","Y4","Y5","erfcinv","x","sign","qs","q","g","r","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,IAAIA,IAAQC,GACRC,IAAOC,GACPC,IAAKC,GACLC,IAAOC,GACPC,IAAOC,GACPC,IAAgBC,GAChBC,IAAgBC,GAChBC,IAAgBC,GAChBC,IAAgBC,GAChBC,IAAgBC,GAKhBC,IAAK,qBACLC,IAAK,mBACLC,IAAK,mBACLC,IAAK,oBACLC,IAAK;AAmGT,SAASC,EAASC,GAAI;AACrB,MAAIC,GACAC,GACAC,GACAC,GACAC;AAGJ,SAAK/B,EAAO0B,CAAAA,IACJ,MAGHA,MAAM,IACHpB,IAGHoB,MAAM,IACHlB,IAGHkB,MAAM,IACH,IAEHA,IAAI,KAAOA,IAAI,IACZ,OAGHA,IAAI,KACRC,IAAO,IACPE,IAAI,IAAMH,MAEVC,IAAO,GACPE,IAAIH,IAELA,IAAI,IAAMG,GAGLH,KAAK,OACTI,IAAIJ,KAAMA,IAAI,KACdK,IAAIrB,EAAegB,CAAC,GACbC,KAAUG,IAAEV,IAAOU,IAAEC,MAGxBF,KAAK,QACTC,IAAI5B,EAAM,KAAOE,EAAGyB,CAAC,CAAC,GACtBA,KAAK,MACLE,IAAInB,EAAeiB,CAAC,GACbF,KAASG,KAAKT,IAAGU,QAEzBF,IAAI3B,EAAM,CAACE,EAAIyB,CAAC,CAAE,GAGbA,IAAI,KACRD,IAAKC,IAAI,OACTE,IAAIjB,EAAec,CAAE,GACdD,KAAUL,IAAGO,IAAME,IAAEF,MAGxBA,IAAI,KACRD,IAAKC,IAAI,GACTE,IAAIf,EAAeY,CAAE,GACdD,KAAUJ,IAAGM,IAAME,IAAEF,OAG7BD,IAAKC,IAAI,GACTE,IAAIb,EAAeU,CAAE,GACdD,KAAUH,IAAGK,IAAME,IAAEF;AAC7B;AAKA,IAAAG,IAAiBP;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfcinv/lib/rational_p1q1.js

@@ -1,26 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function i(e) {
-  var a, n, t;
-  return e === 0 ? -5087819496582806e-19 : (e < 0 ? a = -e : a = e, a <= 1 ? (n = -5087819496582806e-19 + e * (-0.008368748197417368 + e * (0.03348066254097446 + e * (-0.012692614766297404 + e * (-0.03656379714117627 + e * (0.02198786811111689 + e * (0.008226878746769157 + e * (-0.005387729650712429 + e * (0 + e * 0)))))))), t = 1 + e * (-0.9700050433032906 + e * (-1.5657455823417585 + e * (1.5622155839842302 + e * (0.662328840472003 + e * (-0.7122890234154284 + e * (-0.05273963823400997 + e * (0.07952836873415717 + e * (-0.0023339375937419 + e * 8862163904564247e-19))))))))) : (e = 1 / e, n = 0 + e * (0 + e * (-0.005387729650712429 + e * (0.008226878746769157 + e * (0.02198786811111689 + e * (-0.03656379714117627 + e * (-0.012692614766297404 + e * (0.03348066254097446 + e * (-0.008368748197417368 + e * -5087819496582806e-19)))))))), t = 8862163904564247e-19 + e * (-0.0023339375937419 + e * (0.07952836873415717 + e * (-0.05273963823400997 + e * (-0.7122890234154284 + e * (0.662328840472003 + e * (1.5622155839842302 + e * (-1.5657455823417585 + e * (-0.9700050433032906 + e * 1))))))))), n / t);
-}
-var o = i;
-export {
-  o as r
-};
-//# sourceMappingURL=rational_p1q1.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfcinv/lib/rational_p1q1.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rational_p1q1.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfcinv/lib/rational_p1q1.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\\\(P\\\\) and \\\\(Q\\\\)).\n*\n* ## Notes\n*\n* -   Coefficients should be sorted in ascending degree.\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the rational function\n* @returns {number} evaluated rational function\n*/\nfunction evalrational( x ) {\n\tvar ax;\n\tvar s1;\n\tvar s2;\n\tif ( x === 0.0 ) {\n\t\treturn -0.0005087819496582806;\n\t}\n\tif ( x < 0.0 ) {\n\t\tax = -x;\n\t} else {\n\t\tax = x;\n\t}\n\tif ( ax <= 1.0 ) {\n\t\ts1 = -0.0005087819496582806 + (x * (-0.008368748197417368 + (x * (0.03348066254097446 + (x * (-0.012692614766297404 + (x * (-0.03656379714117627 + (x * (0.02198786811111689 + (x * (0.008226878746769157 + (x * (-0.005387729650712429 + (x * (0.0 + (x * 0.0))))))))))))))))); // eslint-disable-line max-len\n\t\ts2 = 1.0 + (x * (-0.9700050433032906 + (x * (-1.5657455823417585 + (x * (1.5622155839842302 + (x * (0.662328840472003 + (x * (-0.7122890234154284 + (x * (-0.05273963823400997 + (x * (0.07952836873415717 + (x * (-0.0023339375937419 + (x * 0.0008862163904564247))))))))))))))))); // eslint-disable-line max-len\n\t} else {\n\t\tx = 1.0 / x;\n\t\ts1 = 0.0 + (x * (0.0 + (x * (-0.005387729650712429 + (x * (0.008226878746769157 + (x * (0.02198786811111689 + (x * (-0.03656379714117627 + (x * (-0.012692614766297404 + (x * (0.03348066254097446 + (x * (-0.008368748197417368 + (x * -0.0005087819496582806))))))))))))))))); // eslint-disable-line max-len\n\t\ts2 = 0.0008862163904564247 + (x * (-0.0023339375937419 + (x * (0.07952836873415717 + (x * (-0.05273963823400997 + (x * (-0.7122890234154284 + (x * (0.662328840472003 + (x * (1.5622155839842302 + (x * (-1.5657455823417585 + (x * (-0.9700050433032906 + (x * 1.0))))))))))))))))); // eslint-disable-line max-len\n\t}\n\treturn s1 / s2;\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalrational;\n"],"names":["evalrational","x","ax","s1","s2","rational_p1q1"],"mappings":";;;;;;;;;;;;;;;;;AAqCA,SAASA,EAAcC,GAAI;AAC1B,MAAIC,GACAC,GACAC;AACJ,SAAKH,MAAM,IACH,yBAEHA,IAAI,IACRC,IAAK,CAACD,IAENC,IAAKD,GAEDC,KAAM,KACVC,IAAK,wBAA0BF,KAAK,wBAAyBA,KAAK,sBAAuBA,KAAK,wBAAyBA,KAAK,uBAAwBA,KAAK,sBAAuBA,KAAK,uBAAwBA,KAAK,wBAAyBA,KAAK,IAAOA,IAAI,WAC3PG,IAAK,IAAOH,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,qBAAsBA,KAAK,oBAAqBA,KAAK,sBAAuBA,KAAK,uBAAwBA,KAAK,sBAAuBA,KAAK,sBAAuBA,IAAI,iCAE9OA,IAAI,IAAMA,GACVE,IAAK,IAAOF,KAAK,IAAOA,KAAK,wBAAyBA,KAAK,uBAAwBA,KAAK,sBAAuBA,KAAK,uBAAwBA,KAAK,wBAAyBA,KAAK,sBAAuBA,KAAK,wBAAyBA,IAAI,+BACxOG,IAAK,uBAAyBH,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,uBAAwBA,KAAK,sBAAuBA,KAAK,oBAAqBA,KAAK,qBAAsBA,KAAK,sBAAuBA,KAAK,sBAAuBA,IAAI,YAE1PE,IAAKC;AACb;AAKA,IAAAC,IAAiBL;","x_google_ignoreList":[0]}

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfcinv/lib/rational_p2q2.js

@@ -1,26 +0,0 @@
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-function i(a) {
-  var n, t, e;
-  return a === 0 ? -0.20243350835593876 : (a < 0 ? n = -a : n = a, n <= 1 ? (t = -0.20243350835593876 + a * (0.10526468069939171 + a * (8.3705032834312 + a * (17.644729840837403 + a * (-18.851064805871424 + a * (-44.6382324441787 + a * (17.445385985570866 + a * (21.12946554483405 + a * -3.6719225470772936))))))), e = 1 + a * (6.242641248542475 + a * (3.971343795334387 + a * (-28.66081804998 + a * (-20.14326346804852 + a * (48.560921310873994 + a * (10.826866735546016 + a * (-22.643693341313973 + a * 1.7211476576120028)))))))) : (a = 1 / a, t = -3.6719225470772936 + a * (21.12946554483405 + a * (17.445385985570866 + a * (-44.6382324441787 + a * (-18.851064805871424 + a * (17.644729840837403 + a * (8.3705032834312 + a * (0.10526468069939171 + a * -0.20243350835593876))))))), e = 1.7211476576120028 + a * (-22.643693341313973 + a * (10.826866735546016 + a * (48.560921310873994 + a * (-20.14326346804852 + a * (-28.66081804998 + a * (3.971343795334387 + a * (6.242641248542475 + a * 1)))))))), t / e);
-}
-var o = i;
-export {
-  o as r
-};
-//# sourceMappingURL=rational_p2q2.js.map

package/dist/node_modules/@milaboratories/miplots4/dist/node_modules/@stdlib/math-base-special-erfcinv/lib/rational_p2q2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rational_p2q2.js","sources":["../../../../../../../../../node_modules/@milaboratories/miplots4/node_modules/@stdlib/math-base-special-erfcinv/lib/rational_p2q2.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a rational function (i.e., the ratio of two polynomials described by the coefficients stored in \\\\(P\\\\) and \\\\(Q\\\\)).\n*\n* ## Notes\n*\n* -   Coefficients should be sorted in ascending degree.\n* -   The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the rational function\n* @returns {number} evaluated rational function\n*/\nfunction evalrational( x ) {\n\tvar ax;\n\tvar s1;\n\tvar s2;\n\tif ( x === 0.0 ) {\n\t\treturn -0.20243350835593876;\n\t}\n\tif ( x < 0.0 ) {\n\t\tax = -x;\n\t} else {\n\t\tax = x;\n\t}\n\tif ( ax <= 1.0 ) {\n\t\ts1 = -0.20243350835593876 + (x * (0.10526468069939171 + (x * (8.3705032834312 + (x * (17.644729840837403 + (x * (-18.851064805871424 + (x * (-44.6382324441787 + (x * (17.445385985570866 + (x * (21.12946554483405 + (x * -3.6719225470772936))))))))))))))); // eslint-disable-line max-len\n\t\ts2 = 1.0 + (x * (6.242641248542475 + (x * (3.971343795334387 + (x * (-28.66081804998 + (x * (-20.14326346804852 + (x * (48.560921310873994 + (x * (10.826866735546016 + (x * (-22.643693341313973 + (x * 1.7211476576120028))))))))))))))); // eslint-disable-line max-len\n\t} else {\n\t\tx = 1.0 / x;\n\t\ts1 = -3.6719225470772936 + (x * (21.12946554483405 + (x * (17.445385985570866 + (x * (-44.6382324441787 + (x * (-18.851064805871424 + (x * (17.644729840837403 + (x * (8.3705032834312 + (x * (0.10526468069939171 + (x * -0.20243350835593876))))))))))))))); // eslint-disable-line max-len\n\t\ts2 = 1.7211476576120028 + (x * (-22.643693341313973 + (x * (10.826866735546016 + (x * (48.560921310873994 + (x * (-20.14326346804852 + (x * (-28.66081804998 + (x * (3.971343795334387 + (x * (6.242641248542475 + (x * 1.0))))))))))))))); // eslint-disable-line max-len\n\t}\n\treturn s1 / s2;\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalrational;\n"],"names":["evalrational","x","ax","s1","s2","rational_p2q2"],"mappings":";;;;;;;;;;;;;;;;;AAqCA,SAASA,EAAcC,GAAI;AAC1B,MAAIC,GACAC,GACAC;AACJ,SAAKH,MAAM,IACH,wBAEHA,IAAI,IACRC,IAAK,CAACD,IAENC,IAAKD,GAEDC,KAAM,KACVC,IAAK,uBAAwBF,KAAK,sBAAuBA,KAAK,kBAAmBA,KAAK,qBAAsBA,KAAK,sBAAuBA,KAAK,oBAAqBA,KAAK,qBAAsBA,KAAK,oBAAqBA,IAAI,4BAC3NG,IAAK,IAAOH,KAAK,oBAAqBA,KAAK,oBAAqBA,KAAK,kBAAmBA,KAAK,qBAAsBA,KAAK,qBAAsBA,KAAK,qBAAsBA,KAAK,sBAAuBA,IAAI,8BAEzMA,IAAI,IAAMA,GACVE,IAAK,sBAAuBF,KAAK,oBAAqBA,KAAK,qBAAsBA,KAAK,oBAAqBA,KAAK,sBAAuBA,KAAK,qBAAsBA,KAAK,kBAAmBA,KAAK,sBAAuBA,IAAI,6BAC1NG,IAAK,qBAAsBH,KAAK,sBAAuBA,KAAK,qBAAsBA,KAAK,qBAAsBA,KAAK,qBAAsBA,KAAK,kBAAmBA,KAAK,oBAAqBA,KAAK,oBAAqBA,IAAI,WAElNE,IAAKC;AACb;AAKA,IAAAC,IAAiBL;","x_google_ignoreList":[0]}