@milaboratories/miplots4 1.0.157 → 1.0.159

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betainc@0.2.2/node_modules/@stdlib/math-base-special-kernel-betainc/lib/rising_factorial_ratio.js

@@ -0,0 +1,48 @@
+/**
+* @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_37_0/boost/math/special_functions/beta.hpp}. The implementation 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 a, e;
+function f() {
+  if (e) return a;
+  e = 1;
+  function n(o, u, t) {
+    var i, r;
+    if (t === 0)
+      return 1;
+    for (i = 1, r = 0; r < t; r++)
+      i *= (o + r) / (u + r);
+    return i;
+  }
+  return a = n, a;
+}
+export {
+  f as __require
+};
+//# sourceMappingURL=rising_factorial_ratio.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betainc@0.2.2/node_modules/@stdlib/math-base-special-kernel-betainc/lib/rising_factorial_ratio.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rising_factorial_ratio.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betainc@0.2.2/node_modules/@stdlib/math-base-special-kernel-betainc/lib/rising_factorial_ratio.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_37_0/boost/math/special_functions/beta.hpp}. The implementation 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// MAIN //\n\n/**\n* Computes the delta in `beta(a,b,x) = prefix + delta * beta(a+k,b,x)`.\n*\n* ## Notes\n*\n* Specifically, the function calculates\n*\n* ```tex\n* \\frac{ (a)(a+1)(a+2)...(a+k-1) }{ (b)(b+1)(b+2)...(b+k-1) }\n* ```\n*\n* The function should only called with small `k`; for large `k`, it is grossly inefficient.\n*\n* @private\n* @param {number} a - input value\n* @param {number} b - input value\n* @param {NonNegativeInteger} k - input value\n* @returns {number} ratio value\n*/\nfunction risingFactorialRatio( a, b, k ) {\n\tvar result;\n\tvar i;\n\tif ( k === 0 ) {\n\t\treturn 1.0;\n\t}\n\tresult = 1.0;\n\tfor ( i = 0; i < k; i++ ) {\n\t\tresult *= ( a + i ) / ( b + i );\n\t}\n\treturn result;\n}\n\n\n// EXPORTS //\n\nmodule.exports = risingFactorialRatio;\n"],"names":["risingFactorialRatio","a","b","k","result","i","rising_factorial_ratio"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDA,WAASA,EAAsBC,GAAGC,GAAGC,GAAI;AACxC,QAAIC,GACAC;AACJ,QAAKF,MAAM;AACV,aAAO;AAGR,SADAC,IAAS,GACHC,IAAI,GAAGA,IAAIF,GAAGE;AACnB,MAAAD,MAAYH,IAAII,MAAQH,IAAIG;AAE7B,WAAOD;AAAA,EACR;AAKA,SAAAE,IAAiBN;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/find_ibeta_inv_from_t_dist.js

@@ -0,0 +1,47 @@
+import { __require as f } from "./inverse_students_t.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_62_0/boost/math/special_functions/detail/t_distribution_inv.hpp}. The implementation has been modified for JavaScript.
+*
+* ```text
+* Copyright John Maddock 2006.
+* Copyright Paul A. Bristow 2007.
+*
+* 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 t, a;
+function m() {
+  if (a) return t;
+  a = 1;
+  var v = f();
+  function u(s, d, _) {
+    var e, i, n, r;
+    return i = d / 2, n = 1 - i, e = s * 2, r = v(e, i, n), _ && (_.value = r * r / (e + r * r)), e / (e + r * r);
+  }
+  return t = u, t;
+}
+export {
+  m as __require
+};
+//# sourceMappingURL=find_ibeta_inv_from_t_dist.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/find_ibeta_inv_from_t_dist.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find_ibeta_inv_from_t_dist.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/find_ibeta_inv_from_t_dist.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_62_0/boost/math/special_functions/detail/t_distribution_inv.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006.\n* Copyright Paul A. Bristow 2007.\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 inverseStudentsT = require( './inverse_students_t.js' );\n\n\n// MAIN //\n\n/**\n* Returns the inverse of the incomplete beta function via the Student t distribution.\n*\n* @private\n* @param {PositiveNumber} a - function parameter\n* @param {Probability} p - probability value\n* @param {Object} py - placeholder object holding one minus the returned value\n* @returns {number} function value\n*/\nfunction findIBetaInvFromTDist( a, p, py ) {\n\tvar df;\n\tvar u;\n\tvar v;\n\tvar t;\n\n\tu = p / 2.0;\n\tv = 1.0 - u;\n\tdf = a * 2.0;\n\tt = inverseStudentsT( df, u, v );\n\tif ( py ) {\n\t\tpy.value = t * t / ( df + ( t*t ) );\n\t}\n\treturn df / ( df + ( t*t ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = findIBetaInvFromTDist;\n"],"names":["inverseStudentsT","require$$0","findIBetaInvFromTDist","a","p","py","df","u","v","t","find_ibeta_inv_from_t_dist"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAmBC,EAAA;AAcvB,WAASC,EAAuBC,GAAGC,GAAGC,GAAK;AAC1C,QAAIC,GACAC,GACAC,GACAC;AAEJ,WAAAF,IAAIH,IAAI,GACRI,IAAI,IAAMD,GACVD,IAAKH,IAAI,GACTM,IAAIT,EAAkBM,GAAIC,GAAGC,CAAC,GACzBH,MACJA,EAAG,QAAQI,IAAIA,KAAMH,IAAOG,IAAEA,KAExBH,KAAOA,IAAOG,IAAEA;AAAA,EACxB;AAKA,SAAAC,IAAiBR;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/halley_iterate.js

@@ -0,0 +1,67 @@
+import { __require as V } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
+import { __require as X } from "../../../../../@stdlib_math-base-special-ldexp@0.2.3/node_modules/@stdlib/math-base-special-ldexp/lib/index.js";
+import { __require as j } from "../../../../../@stdlib_math-base-special-signum@0.2.2/node_modules/@stdlib/math-base-special-signum/lib/index.js";
+import { __require as n } from "../../../../../@stdlib_math-base-special-max@0.3.0/node_modules/@stdlib/math-base-special-max/lib/index.js";
+import { __require as z } from "../../../../../@stdlib_constants-float64-max@0.2.2/node_modules/@stdlib/constants-float64-max/lib/index.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_62_0/boost/math/tools/roots.hpp}. The implementation has been modified for JavaScript.
+*
+* ```text
+* 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 H, E;
+function K() {
+  if (E) return H;
+  E = 1;
+  var f = V(), I = X(), L = j(), M = n(), c = z();
+  function O(w, a, t, v, R, U) {
+    var h, _, y, b, B, e, q, $, r, k, l, d, p, o, i, A;
+    o = 0, _ = !1, e = a, B = I(1, 1 - R), r = M(1e7 * a, 1e7), q = 0, y = r, b = r, $ = U;
+    do {
+      if (q = o, b = y, y = r, p = w(e), o = p[0], i = p[1], A = p[2], $ -= 1, o === 0)
+        break;
+      if (i === 0 ? (q === 0 && (e === t ? a = v : a = t, q = w(a), r = a - e), L(q) * L(o) < 0 ? r < 0 ? r = (e - t) / 2 : r = (e - v) / 2 : r < 0 ? r = (e - v) / 2 : r = (e - t) / 2) : A === 0 ? r = o / i : (k = 2 * o, d = 2 * i - o * (A / i), f(d) < 1 && f(k) >= f(d) * c ? r = o / i : r = k / d, r * i / o < 0 && (r = o / i, f(r) > 2 * f(a) && (r = (r < 0 ? -1 : 1) * 2 * f(a)))), h = f(r / b), h > 0.8 && h < 2 && (r = r > 0 ? (e - t) / 2 : (e - v) / 2, f(r) > e && (r = L(r) * e), b = r * 3), a = e, e -= r, e < t) {
+        if (f(t) < 1 && f(e) > 1 && c / f(e) < f(t) ? l = 1e3 : l = e / t, f(l) < 1 && (l = 1 / l), !_ && l > 0 && l < 3)
+          r = 0.99 * (a - t), e = a - r, _ = !0;
+        else if (r = (a - t) / 2, e = a - r, e === t || e === v)
+          break;
+      } else if (e > v) {
+        if (f(v) < 1 && f(e) > 1 && c / f(e) < f(v) ? l = 1e3 : l = e / v, f(l) < 1 && (l = 1 / l), !_ && l > 0 && l < 3)
+          r = 0.99 * (a - v), e = a - r, _ = !0;
+        else if (r = (a - v) / 2, e = a - r, e === t || e === v)
+          break;
+      }
+      r > 0 ? v = a : t = a;
+    } while ($ && f(e * B) < f(r));
+    return e;
+  }
+  return H = O, H;
+}
+export {
+  K as __require
+};
+//# sourceMappingURL=halley_iterate.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/halley_iterate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"halley_iterate.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/halley_iterate.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_62_0/boost/math/tools/roots.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* 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 abs = require( '@stdlib/math-base-special-abs' );\nvar ldexp = require( '@stdlib/math-base-special-ldexp' );\nvar sign = require( '@stdlib/math-base-special-signum' );\nvar max = require( '@stdlib/math-base-special-max' );\nvar MAX_VALUE = require( '@stdlib/constants-float64-max' );\n\n\n// MAIN //\n\n/**\n* Performs root finding via third order Halley iteration.\n*\n* @private\n* @param {Array} fun - array of function and its first two derivatives\n* @param {number} guess - initial starting value\n* @param {number} minimum - minimum possible value for the result, used as initial lower bracket\n* @param {number} maximum - maximum possible value for the result, used as initial upper bracket\n* @param {PositiveInteger} digits - desired number of binary digits\n* @param {PositiveInteger} maxIter - maximum number of iterations\n* @returns {number} function value\n*/\nfunction halleyIterate( fun, guess, minimum, maximum, digits, maxIter ) {\n\tvar convergence;\n\tvar outOfBounds;\n\tvar delta1;\n\tvar delta2;\n\tvar factor;\n\tvar result;\n\tvar f0Last;\n\tvar count;\n\tvar delta;\n\tvar denom;\n\tvar diff;\n\tvar num;\n\tvar res;\n\tvar f0;\n\tvar f1;\n\tvar f2;\n\n\tf0 = 0.0;\n\toutOfBounds = false;\n\tresult = guess;\n\tfactor = ldexp( 1.0, 1.0-digits );\n\tdelta = max( 10000000*guess, 10000000 );  // Arbitrarily large delta...\n\tf0Last = 0;\n\tdelta1 = delta;\n\tdelta2 = delta;\n\n\tcount = maxIter;\n\tdo {\n\t\tf0Last = f0;\n\t\tdelta2 = delta1;\n\t\tdelta1 = delta;\n\t\tres = fun( result );\n\t\tf0 = res[ 0 ];\n\t\tf1 = res[ 1 ];\n\t\tf2 = res[ 2 ];\n\t\tcount -= 1;\n\n\t\tif ( f0 === 0.0 ) {\n\t\t\tbreak;\n\t\t}\n\t\tif ( f1 === 0.0 ) {\n\t\t\t// Oops zero derivative!!!\n\t\t\tif ( f0Last === 0.0 ) {\n\t\t\t\t// Must be the first iteration, pretend that we had a previous one at either min or max:\n\t\t\t\tif ( result === minimum ) {\n\t\t\t\t\tguess = maximum;\n\t\t\t\t} else {\n\t\t\t\t\tguess = minimum;\n\t\t\t\t}\n\t\t\t\tf0Last = fun( guess );\n\t\t\t\tdelta = guess - result;\n\t\t\t}\n\t\t\tif ( sign( f0Last ) * sign( f0 ) < 0 ) {\n\t\t\t\t// We've crossed over so move in opposite direction to last step:\n\t\t\t\tif ( delta < 0 ) {\n\t\t\t\t\tdelta = ( result-minimum ) / 2.0;\n\t\t\t\t} else {\n\t\t\t\t\tdelta = ( result-maximum ) / 2.0;\n\t\t\t\t}\n\t\t\t// Move in same direction as last step:\n\t\t\t} else if ( delta < 0 ) {\n\t\t\t\tdelta = (result-maximum) / 2.0;\n\t\t\t} else {\n\t\t\t\tdelta = (result-minimum) / 2.0;\n\t\t\t}\n\t\t} else if ( f2 === 0.0 ) {\n\t\t\tdelta = f0 / f1;\n\t\t} else {\n\t\t\tdenom = 2.0 * f0;\n\t\t\tnum = ( 2.0 * f1 ) - ( f0 * ( f2 / f1 ) );\n\t\t\tif ( abs(num) < 1.0 && ( abs(denom) >= abs(num) * MAX_VALUE ) ) {\n\t\t\t\t// Possible overflow, use Newton step:\n\t\t\t\tdelta = f0 / f1;\n\t\t\t} else {\n\t\t\t\tdelta = denom / num;\n\t\t\t}\n\t\t\tif ( delta * f1 / f0 < 0.0 ) {\n\t\t\t\t// Probably cancellation error, try a Newton step instead:\n\t\t\t\tdelta = f0 / f1;\n\t\t\t\tif ( abs(delta) > 2.0 * abs(guess) ) {\n\t\t\t\t\tdelta = ( (delta < 0.0) ? -1.0 : 1.0 ) * 2.0 * abs( guess );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconvergence = abs( delta / delta2 );\n\t\tif ( convergence > 0.8 && convergence < 2.0 ) {\n\t\t\t// Last two steps haven't converged, try bisection:\n\t\t\tdelta = ( delta > 0.0 ) ? ( result-minimum )/2.0 : ( result-maximum )/2.0; // eslint-disable-line max-len\n\t\t\tif ( abs(delta) > result ) {\n\t\t\t\tdelta = sign( delta ) * result; // Protect against huge jumps!\n\t\t\t}\n\t\t\t// Reset delta2 so that this branch will *not* be taken on the next iteration:\n\t\t\tdelta2 = delta * 3.0;\n\t\t}\n\t\tguess = result;\n\t\tresult -= delta;\n\n\t\t// Check for out of bounds step:\n\t\tif ( result < minimum ) {\n\t\t\tif (\n\t\t\t\tabs(minimum) < 1 &&\n\t\t\t\tabs(result) > 1 &&\n\t\t\t\t( MAX_VALUE / abs(result) < abs(minimum) )\n\t\t\t) {\n\t\t\t\tdiff = 1000.0;\n\t\t\t} else {\n\t\t\t\tdiff = result / minimum;\n\t\t\t}\n\t\t\tif ( abs(diff) < 1.0 ) {\n\t\t\t\tdiff = 1.0 / diff;\n\t\t\t}\n\t\t\tif ( !outOfBounds && diff > 0.0 && diff < 3.0 ) {\n\t\t\t\t// Only a small out of bounds step, let's assume that the result is probably approximately at minimum:\n\t\t\t\tdelta = 0.99 * (guess - minimum);\n\t\t\t\tresult = guess - delta;\n\t\t\t\toutOfBounds = true; // Only take this branch once!\n\t\t\t} else {\n\t\t\t\tdelta = (guess - minimum) / 2.0;\n\t\t\t\tresult = guess - delta;\n\t\t\t\tif ( result === minimum || result === maximum ) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if ( result > maximum ) {\n\t\t\tif (\n\t\t\t\tabs(maximum) < 1.0 &&\n\t\t\t\tabs(result) > 1.0 &&\n\t\t\t\tMAX_VALUE / abs(result) < abs(maximum)\n\t\t\t) {\n\t\t\t\tdiff = 1000.0;\n\t\t\t} else {\n\t\t\t\tdiff = result / maximum;\n\t\t\t}\n\t\t\tif ( abs(diff) < 1.0 ) {\n\t\t\t\tdiff = 1.0 / diff;\n\t\t\t}\n\t\t\tif ( !outOfBounds && diff > 0.0 && diff < 3.0 ) {\n\t\t\t\t// Only a small out of bounds step, let's assume that the result is probably approximately at minimum:\n\t\t\t\tdelta = 0.99 * (guess - maximum);\n\t\t\t\tresult = guess - delta;\n\t\t\t\toutOfBounds = true; // Only take this branch once!\n\t\t\t} else {\n\t\t\t\tdelta = ( guess - maximum ) / 2.0;\n\t\t\t\tresult = guess - delta;\n\t\t\t\tif ( result === minimum || result === maximum ) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Update brackets:\n\t\tif ( delta > 0.0 ) {\n\t\t\tmaximum = guess;\n\t\t} else {\n\t\t\tminimum = guess;\n\t\t}\n\t} while ( count && ( abs(result * factor) < abs(delta) ) );\n\n\treturn result;\n}\n\n\n// EXPORTS //\n\nmodule.exports = halleyIterate;\n"],"names":["abs","require$$0","ldexp","require$$1","sign","require$$2","max","require$$3","MAX_VALUE","require$$4","halleyIterate","fun","guess","minimum","maximum","digits","maxIter","convergence","outOfBounds","delta1","delta2","factor","result","f0Last","count","delta","denom","diff","num","res","f0","f1","f2","halley_iterate"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,MAAIA,IAAMC,EAAA,GACNC,IAAQC,EAAA,GACRC,IAAOC,EAAA,GACPC,IAAMC,EAAA,GACNC,IAAYC,EAAA;AAiBhB,WAASC,EAAeC,GAAKC,GAAOC,GAASC,GAASC,GAAQC,GAAU;AACvE,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,IAAAF,IAAK,GACLZ,IAAc,IACdI,IAASV,GACTS,IAASnB,EAAO,GAAK,IAAIa,CAAM,GAC/BU,IAAQnB,EAAK,MAASM,GAAO,GAAQ,GACrCW,IAAS,GACTJ,IAASM,GACTL,IAASK,GAETD,IAAQR;AACR,OAAG;AAUF,UATAO,IAASO,GACTV,IAASD,GACTA,IAASM,GACTI,IAAMlB,EAAKW,CAAM,GACjBQ,IAAKD,EAAK,CAAC,GACXE,IAAKF,EAAK,CAAC,GACXG,IAAKH,EAAK,CAAC,GACXL,KAAS,GAEJM,MAAO;AACX;AA4DD,UA1DKC,MAAO,KAENR,MAAW,MAEVD,MAAWT,IACfD,IAAQE,IAERF,IAAQC,GAETU,IAASZ,EAAKC,CAAK,GACnBa,IAAQb,IAAQU,IAEZlB,EAAMmB,CAAM,IAAKnB,EAAM0B,CAAE,IAAK,IAE7BL,IAAQ,IACZA,KAAUH,IAAOT,KAAY,IAE7BY,KAAUH,IAAOR,KAAY,IAGnBW,IAAQ,IACnBA,KAASH,IAAOR,KAAW,IAE3BW,KAASH,IAAOT,KAAW,KAEjBmB,MAAO,IAClBP,IAAQK,IAAKC,KAEbL,IAAQ,IAAMI,GACdF,IAAQ,IAAMG,IAASD,KAAOE,IAAKD,IAC9B/B,EAAI4B,CAAG,IAAI,KAAS5B,EAAI0B,CAAK,KAAK1B,EAAI4B,CAAG,IAAIpB,IAEjDiB,IAAQK,IAAKC,IAEbN,IAAQC,IAAQE,GAEZH,IAAQM,IAAKD,IAAK,MAEtBL,IAAQK,IAAKC,GACR/B,EAAIyB,CAAK,IAAI,IAAMzB,EAAIY,CAAK,MAChCa,KAAWA,IAAQ,IAAO,KAAO,KAAQ,IAAMzB,EAAKY,CAAK,MAI5DK,IAAcjB,EAAKyB,IAAQL,CAAM,GAC5BH,IAAc,OAAOA,IAAc,MAEvCQ,IAAUA,IAAQ,KAAUH,IAAOT,KAAU,KAAQS,IAAOR,KAAU,GACjEd,EAAIyB,CAAK,IAAIH,MACjBG,IAAQrB,EAAMqB,CAAK,IAAKH,IAGzBF,IAASK,IAAQ,IAElBb,IAAQU,GACRA,KAAUG,GAGLH,IAAST;AAab,YAXCb,EAAIa,CAAO,IAAI,KACfb,EAAIsB,CAAM,IAAI,KACZd,IAAYR,EAAIsB,CAAM,IAAItB,EAAIa,CAAO,IAEvCc,IAAO,MAEPA,IAAOL,IAAST,GAEZb,EAAI2B,CAAI,IAAI,MAChBA,IAAO,IAAMA,IAET,CAACT,KAAeS,IAAO,KAAOA,IAAO;AAEzC,UAAAF,IAAQ,QAAQb,IAAQC,IACxBS,IAASV,IAAQa,GACjBP,IAAc;AAAA,iBAEdO,KAASb,IAAQC,KAAW,GAC5BS,IAASV,IAAQa,GACZH,MAAWT,KAAWS,MAAWR;AACrC;AAAA,iBAGSQ,IAASR;AAapB,YAXCd,EAAIc,CAAO,IAAI,KACfd,EAAIsB,CAAM,IAAI,KACdd,IAAYR,EAAIsB,CAAM,IAAItB,EAAIc,CAAO,IAErCa,IAAO,MAEPA,IAAOL,IAASR,GAEZd,EAAI2B,CAAI,IAAI,MAChBA,IAAO,IAAMA,IAET,CAACT,KAAeS,IAAO,KAAOA,IAAO;AAEzC,UAAAF,IAAQ,QAAQb,IAAQE,IACxBQ,IAASV,IAAQa,GACjBP,IAAc;AAAA,iBAEdO,KAAUb,IAAQE,KAAY,GAC9BQ,IAASV,IAAQa,GACZH,MAAWT,KAAWS,MAAWR;AACrC;AAAA;AAKH,MAAKW,IAAQ,IACZX,IAAUF,IAEVC,IAAUD;AAAA,IAEb,SAAWY,KAAWxB,EAAIsB,IAASD,CAAM,IAAIrB,EAAIyB,CAAK;AAErD,WAAOH;AAAA,EACR;AAKA,SAAAW,IAAiBvB;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/ibeta_roots.js

@@ -0,0 +1,53 @@
+import { __require as A } from "../../../../../@stdlib_math-base-special-kernel-betainc@0.2.2/node_modules/@stdlib/math-base-special-kernel-betainc/lib/index.js";
+import { __require as I } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
+import { __require as M } from "../../../../../@stdlib_constants-float64-max@0.2.2/node_modules/@stdlib/constants-float64-max/lib/index.js";
+import { __require as O } from "../../../../../@stdlib_constants-float64-smallest-normal@0.2.2/node_modules/@stdlib/constants-float64-smallest-normal/lib/index.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_64_0/boost/math/special_functions/detail/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.
+*
+* ```text
+* Copyright John Maddock 2006.
+* Copyright Paul A. Bristow 2007.
+*
+* 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 f, n;
+function T() {
+  if (n) return f;
+  n = 1;
+  var b = A().assign, m = I(), v = M(), u = O();
+  function L(_, s, p, o) {
+    return c;
+    function c(r) {
+      var t, e, i, q, a;
+      return a = 1 - r, t = [0, 0], b(r, _, s, !0, o, t, 1, 0), q = t[0] - p, e = t[1], o && (e = -e), a === 0 && (a = u * 64), r === 0 && (r = u * 64), i = e * (-(a * _) + (s - 2) * r + 1), m(i) < a * r * v && (i /= a * r), o && (i = -i), e === 0 && (e = (o ? -1 : 1) * u * 64), [q, e, i];
+    }
+  }
+  return f = L, f;
+}
+export {
+  T as __require
+};
+//# sourceMappingURL=ibeta_roots.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/ibeta_roots.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ibeta_roots.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/ibeta_roots.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_64_0/boost/math/special_functions/detail/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006.\n* Copyright Paul A. Bristow 2007.\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 kernelBetainc = require( '@stdlib/math-base-special-kernel-betainc' ).assign;\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar FLOAT64_MAX = require( '@stdlib/constants-float64-max' );\nvar FLOAT64_MIN_NORM = require( '@stdlib/constants-float64-smallest-normal' );\n\n\n// MAIN //\n\n/**\n* Returns a root finding function.\n*\n* @private\n* @param {PositiveNumber} a - function parameter\n* @param {PositiveNumber} b - function parameter\n* @param {Probability} target - probability value\n* @param {boolean} invert - boolean indicating whether to find the roots of the upper or lower incomplete beta function\n* @returns {Function} root finding function\n*/\nfunction ibetaRoots( a, b, target, invert ) {\n\treturn roots;\n\n\t/**\n\t* Calculates roots.\n\t*\n\t* @private\n\t* @param {number} x - input value\n\t* @returns {Array} roots\n\t*/\n\tfunction roots( x ) {\n\t\tvar buf;\n\t\tvar f1;\n\t\tvar f2;\n\t\tvar f;\n\t\tvar y;\n\n\t\ty = 1.0 - x;\n\n\t\tbuf = [ 0.0, 0.0 ];\n\t\tkernelBetainc( x, a, b, true, invert, buf, 1, 0 );\n\t\tf = buf[ 0 ] - target;\n\t\tf1 = buf[ 1 ];\n\t\tif ( invert ) {\n\t\t\tf1 = -f1;\n\t\t}\n\t\tif ( y === 0.0 ) {\n\t\t\ty = FLOAT64_MIN_NORM * 64.0;\n\t\t}\n\t\tif ( x === 0.0 ) {\n\t\t\tx = FLOAT64_MIN_NORM * 64.0;\n\t\t}\n\t\tf2 = f1 * ( -(y*a) + ( ( b-2.0 ) * x ) + 1.0 );\n\t\tif ( abs( f2 ) < y * x * FLOAT64_MAX ) {\n\t\t\tf2 /= (y * x);\n\t\t}\n\t\tif ( invert ) {\n\t\t\tf2 = -f2;\n\t\t}\n\t\t// Make sure we don't have a zero derivative:\n\t\tif ( f1 === 0.0 ) {\n\t\t\tf1 = ( ( invert ) ? -1.0 : 1.0 ) * FLOAT64_MIN_NORM * 64.0;\n\t\t}\n\t\treturn [ f, f1, f2 ];\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = ibetaRoots;\n"],"names":["kernelBetainc","require$$0","abs","require$$1","FLOAT64_MAX","require$$2","FLOAT64_MIN_NORM","require$$3","ibetaRoots","a","b","target","invert","roots","x","buf","f1","f2","f","y","ibeta_roots"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAgBC,EAAA,EAAsD,QACtEC,IAAMC,EAAA,GACNC,IAAcC,EAAA,GACdC,IAAmBC,EAAA;AAevB,WAASC,EAAYC,GAAGC,GAAGC,GAAQC,GAAS;AAC3C,WAAOC;AASP,aAASA,EAAOC,GAAI;AACnB,UAAIC,GACAC,GACAC,GACAC,GACAC;AAEJ,aAAAA,IAAI,IAAML,GAEVC,IAAM,CAAE,GAAK,CAAG,GAChBf,EAAec,GAAGL,GAAGC,GAAG,IAAME,GAAQG,GAAK,GAAG,CAAC,GAC/CG,IAAIH,EAAK,CAAC,IAAKJ,GACfK,IAAKD,EAAK,CAAC,GACNH,MACJI,IAAK,CAACA,IAEFG,MAAM,MACVA,IAAIb,IAAmB,KAEnBQ,MAAM,MACVA,IAAIR,IAAmB,KAExBW,IAAKD,KAAO,EAAEG,IAAEV,MAASC,IAAE,KAAQI,IAAM,IACpCZ,EAAKe,CAAE,IAAKE,IAAIL,IAAIV,MACxBa,KAAOE,IAAIL,IAEPF,MACJK,IAAK,CAACA,IAGFD,MAAO,MACXA,KAASJ,IAAW,KAAO,KAAQN,IAAmB,KAEhD,CAAEY,GAAGF,GAAIC,CAAE;AAAA,IACpB;AAAA,EACA;AAKA,SAAAG,IAAiBZ;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/index.js

@@ -0,0 +1,29 @@
+import { __require as a } 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, e;
+function n() {
+  if (e) return r;
+  e = 1;
+  var i = a();
+  return r = i, r;
+}
+export {
+  n as __require
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/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 of the incomplete beta function.\n*\n* @module @stdlib/math-base-special-kernel-betaincinv\n*\n* @example\n* var kernelBetaincinv = require( '@stdlib/math-base-special-kernel-betaincinv' );\n*\n* var y = kernelBetaincinv( 3.0, 3.0, 0.2, 0.8 );\n* // returns [ ~0.327, ~0.673 ]\n*\n* y = kernelBetaincinv( 3.0, 3.0, 0.4, 0.6 );\n* // returns [ ~0.446, ~0.554 ]\n*\n* y = kernelBetaincinv( 1.0, 6.0, 0.4, 0.6 );\n* // returns [ ~0.082, ~0.918 ]\n*\n* y = kernelBetaincinv( 1.0, 6.0, 0.8, 0.2 );\n* // returns [ ~0.235, ~0.765 ]\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":";;;;;;;;;;;;;;;;;;;;;;AA2CA,MAAIA,IAAOC,EAAA;AAKX,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t.js

@@ -0,0 +1,85 @@
+import { __require as g } from "../../../../../@stdlib_math-base-special-erfcinv@0.2.3/node_modules/@stdlib/math-base-special-erfcinv/lib/index.js";
+import { __require as j } from "../../../../../@stdlib_math-base-special-floor@0.2.3/node_modules/@stdlib/math-base-special-floor/lib/index.js";
+import { __require as z } from "../../../../../@stdlib_math-base-special-ldexp@0.2.3/node_modules/@stdlib/math-base-special-ldexp/lib/index.js";
+import { __require as G } from "../../../../../@stdlib_math-base-special-round@0.3.0/node_modules/@stdlib/math-base-special-round/lib/index.js";
+import { __require as J } from "../../../../../@stdlib_math-base-special-acos@0.2.3/node_modules/@stdlib/math-base-special-acos/lib/index.js";
+import { __require as K } from "../../../../../@stdlib_math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/lib/index.js";
+import { __require as M } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
+import { __require as U } from "../../../../../@stdlib_math-base-special-cos@0.3.0/node_modules/@stdlib/math-base-special-cos/lib/index.js";
+import { __require as V } from "../../../../../@stdlib_math-base-special-pow@0.3.0/node_modules/@stdlib/math-base-special-pow/lib/index.js";
+import { __require as W } from "../../../../../@stdlib_math-base-special-sin@0.3.0/node_modules/@stdlib/math-base-special-sin/lib/index.js";
+import { __require as Y } from "../../../../../@stdlib_constants-float64-sqrt-two@0.2.2/node_modules/@stdlib/constants-float64-sqrt-two/lib/index.js";
+import { __require as Z } from "../../../../../@stdlib_constants-float64-pi@0.2.2/node_modules/@stdlib/constants-float64-pi/lib/index.js";
+import { __require as d } from "./inverse_students_t_body_series.js";
+import { __require as rr } from "./inverse_students_t_tail_series.js";
+import { __require as er } from "./inverse_students_t_hill.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_62_0/boost/math/special_functions/detail/t_distribution_inv.hpp}. The implementation has been modified for JavaScript.
+*
+* ```text
+* Copyright John Maddock 2006.
+* Copyright Paul A. Bristow 2007.
+*
+* 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 f, O;
+function Lr() {
+  if (O) return f;
+  O = 1;
+  var L = g(), c = j(), m = z(), $ = G(), P = J(), _ = K(), A = M(), S = U(), B = V(), C = W(), T = Y(), I = Z(), h = d(), o = rr(), l = er(), k = 268435456, F = 1 / 3, N = 106 / 3, Q = 0.8549879733383485;
+  function X(e, r, t) {
+    var s, x, p, v, i, H, R, w, q, u, D, a, E, b, n, y;
+    if (i = 0, r > t ? (R = t, t = r, r = R, v = !0) : v = !1, c(e) === e && e < 20)
+      switch (x = m(1, N), c(e)) {
+        case 1:
+          r === 0.5 ? i = 0 : i = -S(I * r) / C(I * r);
+          break;
+        case 2:
+          i = (2 * r - 1) / _(2 * r * t);
+          break;
+        case 4:
+          H = 4 * r * t, p = _(H), E = 4 * S(P(p) / 3) / p, b = _(E - 4), i = r - 0.5 < 0 ? -b : b;
+          break;
+        case 6:
+          if (r < 1e-150)
+            return (v ? -1 : 1) * l(e, r);
+          n = 4 * (r - r * r), y = B(n, F), a = 6 * (1 + Q * (1 / y - 1));
+          do
+            q = a * a, u = q * q, D = a * u, w = a, a = 2 * (8 * n * D - 270 * q + 2187) / (5 * (4 * n * u - 216 * a - 243));
+          while (A((a - w) / a) > x);
+          a = _(a - e), i = r - 0.5 < 0 ? -a : a;
+          break;
+        default:
+          e > k ? i = L(2 * r) * T : e < 3 ? (s = 0.2742 - e * 0.0242143, r > s ? i = h(e, r) : i = o(e, r)) : (s = m(1, $(e / -0.654)), r > s ? i = l(e, r) : i = o(e, r));
+      }
+    else e > k ? i = -L(2 * r) * T : e < 3 ? (s = 0.2742 - e * 0.0242143, r > s ? i = h(e, r) : i = o(e, r)) : (s = m(1, $(e / -0.654)), r > s ? i = l(e, r) : i = o(e, r));
+    return v ? -i : i;
+  }
+  return f = X, f;
+}
+export {
+  Lr as __require
+};
+//# sourceMappingURL=inverse_students_t.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inverse_students_t.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t.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_62_0/boost/math/special_functions/detail/t_distribution_inv.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006.\n* Copyright Paul A. Bristow 2007.\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 erfcinv = require( '@stdlib/math-base-special-erfcinv' );\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar ldexp = require( '@stdlib/math-base-special-ldexp' );\nvar round = require( '@stdlib/math-base-special-round' );\nvar acos = require( '@stdlib/math-base-special-acos' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar cos = require( '@stdlib/math-base-special-cos' );\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar sin = require( '@stdlib/math-base-special-sin' );\nvar SQRT2 = require( '@stdlib/constants-float64-sqrt-two' );\nvar PI = require( '@stdlib/constants-float64-pi' );\nvar inverseStudentsTBodySeries = require( './inverse_students_t_body_series.js' );\nvar inverseStudentsTTailSeries = require( './inverse_students_t_tail_series.js' );\nvar inverseStudentsTHill = require( './inverse_students_t_hill.js' );\n\n\n// VARIABLES //\n\nvar DF_THRESHOLD = 0x10000000; // 2^28\nvar ONE_THIRD = 1.0 / 3.0;\nvar EXP = ( 2.0 * 53.0 ) / 3.0;\nvar C = 0.85498797333834849467655443627193;\n\n\n// MAIN //\n\n/**\n* Evaluates Student's t quantiles.\n*\n* @private\n* @param {PositiveNumber} df - degrees of freedom\n* @param {Probability} u - input probability\n* @param {Probability} v - probability equal to `1-u`\n* @returns {number} function value\n*/\nfunction inverseStudentsT( df, u, v ) {\n\tvar crossover;\n\tvar tolerance;\n\tvar rootAlpha;\n\tvar invert;\n\tvar result;\n\tvar alpha;\n\tvar tmp;\n\tvar p0;\n\tvar p2;\n\tvar p4;\n\tvar p5;\n\tvar p;\n\tvar r;\n\tvar x;\n\tvar a;\n\tvar b;\n\n\tresult = 0;\n\tif ( u > v ) {\n\t\t// Function is symmetric, so invert it:\n\t\ttmp = v;\n\t\tv = u;\n\t\tu = tmp;\n\t\tinvert = true;\n\t} else {\n\t\tinvert = false;\n\t}\n\tif ( floor(df) === df && df < 20 ) {\n\t\t// We have integer degrees of freedom, try for the special cases first:\n\t\ttolerance = ldexp( 1.0, EXP );\n\n\t\tswitch ( floor( df ) ) {\n\t\tcase 1:\n\t\t\t// `df = 1` is the same as the Cauchy distribution, see Shaw Eq 35:\n\t\t\tif ( u === 0.5 ) {\n\t\t\t\tresult = 0.0;\n\t\t\t} else {\n\t\t\t\tresult = -cos( PI * u ) / sin( PI * u );\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\t// `df = 2` has an exact result, see Shaw Eq 36:\n\t\t\tresult = ( (2.0*u) - 1.0 ) / sqrt( 2.0 * u * v );\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\t// `df = 4` has an exact result, see Shaw Eq 38 & 39:\n\t\t\talpha = 4.0 * u * v;\n\t\t\trootAlpha = sqrt( alpha );\n\t\t\tr = 4 * cos( acos( rootAlpha ) / 3.0 ) / rootAlpha;\n\t\t\tx = sqrt( r - 4.0 );\n\t\t\tresult = ( u - 0.5 < 0.0 ) ? -x : x;\n\t\t\tbreak;\n\t\tcase 6:\n\t\t\t// We get numeric overflow in this area:\n\t\t\tif ( u < 1.0e-150 ) {\n\t\t\t\treturn ( ( invert ) ? -1 : 1 ) * inverseStudentsTHill( df, u );\n\t\t\t}\n\t\t\t// Newton-Raphson iteration of a polynomial case, choice of seed value is taken from Shaw's online supplement:\n\t\t\ta = 4.0 * ( u - (u*u) ); // 1 - 4 * (u - 0.5f) * (u - 0.5f);\n\t\t\tb = pow( a, ONE_THIRD );\n\t\t\tp = 6.0 * ( 1.0 + ( C * ( (1.0/b) - 1.0 ) ) );\n\t\t\tdo {\n\t\t\t\tp2 = p * p;\n\t\t\t\tp4 = p2 * p2;\n\t\t\t\tp5 = p * p4;\n\t\t\t\tp0 = p;\n\n\t\t\t\t// Next term is given by Eq 41:\n\t\t\t\tp = 2.0 * ( (8.0*a*p5) - (270.0*p2) + 2187 ) /\n\t\t\t\t\t( 5.0 * ( (4.0*a*p4) - (216.0*p) - 243.0 ) );\n\t\t\t} while ( abs( (p - p0) / p ) > tolerance );\n\n\t\t\t// Use Eq 45 to extract the result:\n\t\t\tp = sqrt( p - df );\n\t\t\tresult = ( u - 0.5 < 0.0 ) ? -p : p;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif ( df > DF_THRESHOLD ) { // 2^28\n\t\t\t\tresult = erfcinv( 2.0 * u ) * SQRT2;\n\t\t\t} else if ( df < 3 ) {\n\t\t\t\t// Use a roughly linear scheme to choose between Shaw's tail series and body series:\n\t\t\t\tcrossover = 0.2742 - ( df * 0.0242143 );\n\t\t\t\tif ( u > crossover ) {\n\t\t\t\t\tresult = inverseStudentsTBodySeries( df, u );\n\t\t\t\t} else {\n\t\t\t\t\tresult = inverseStudentsTTailSeries( df, u );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Use Hill's method except in the extreme tails where we use Shaw's tail series. The crossover point is roughly exponential in -df:\n\t\t\t\tcrossover = ldexp( 1.0, round( df / -0.654 ) );\n\t\t\t\tif ( u > crossover ) {\n\t\t\t\t\tresult = inverseStudentsTHill( df, u );\n\t\t\t\t} else {\n\t\t\t\t\tresult = inverseStudentsTTailSeries( df, u );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else if ( df > DF_THRESHOLD ) {\n\t\tresult = -erfcinv( 2.0 * u ) * SQRT2;\n\t} else if ( df < 3 ) {\n\t\t// Use a roughly linear scheme to choose between Shaw's tail series and body series:\n\t\tcrossover = 0.2742 - ( df * 0.0242143 );\n\t\tif ( u > crossover ) {\n\t\t\tresult = inverseStudentsTBodySeries( df, u );\n\t\t} else {\n\t\t\tresult = inverseStudentsTTailSeries( df, u );\n\t\t}\n\t} else {\n\t\t// Use Hill's method except in the extreme tails where we use Shaw's tail series. The crossover point is roughly exponential in -df:\n\t\tcrossover = ldexp( 1.0, round( df / -0.654 ) );\n\t\tif ( u > crossover ) {\n\t\t\tresult = inverseStudentsTHill( df, u );\n\t\t} else {\n\t\t\tresult = inverseStudentsTTailSeries( df, u );\n\t\t}\n\t}\n\treturn ( invert ) ? -result : result;\n}\n\n\n// EXPORTS //\n\nmodule.exports = inverseStudentsT;\n"],"names":["erfcinv","require$$0","floor","require$$1","ldexp","require$$2","round","require$$3","acos","require$$4","sqrt","require$$5","abs","require$$6","cos","require$$7","pow","require$$8","sin","require$$9","SQRT2","require$$10","PI","require$$11","inverseStudentsTBodySeries","require$$12","inverseStudentsTTailSeries","require$$13","inverseStudentsTHill","require$$14","DF_THRESHOLD","ONE_THIRD","EXP","C","inverseStudentsT","df","u","v","crossover","tolerance","rootAlpha","invert","result","alpha","tmp","p0","p2","p4","p5","p","r","x","a","b","inverse_students_t"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAUC,EAAA,GACVC,IAAQC,EAAA,GACRC,IAAQC,EAAA,GACRC,IAAQC,EAAA,GACRC,IAAOC,EAAA,GACPC,IAAOC,EAAA,GACPC,IAAMC,EAAA,GACNC,IAAMC,EAAA,GACNC,IAAMC,EAAA,GACNC,IAAMC,EAAA,GACNC,IAAQC,EAAA,GACRC,IAAKC,EAAA,GACLC,IAA6BC,EAAA,GAC7BC,IAA6BC,GAAA,GAC7BC,IAAuBC,GAAA,GAKvBC,IAAe,WACfC,IAAY,IAAM,GAClBC,IAAQ,MAAe,GACvBC,IAAI;AAcR,WAASC,EAAkBC,GAAIC,GAAGC,GAAI;AACrC,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAYJ,QAVAX,IAAS,GACJN,IAAIC,KAERO,IAAMP,GACNA,IAAID,GACJA,IAAIQ,GACJH,IAAS,MAETA,IAAS,IAELvC,EAAMiC,CAAE,MAAMA,KAAMA,IAAK;AAI7B,cAFAI,IAAYnC,EAAO,GAAK4B,CAAG,GAElB9B,EAAOiC,CAAE,GAAE;AAAA,QACpB,KAAK;AAEJ,UAAKC,MAAM,MACVM,IAAS,IAETA,IAAS,CAAC5B,EAAKQ,IAAKc,CAAC,IAAKlB,EAAKI,IAAKc,CAAC;AAEtC;AAAA,QACD,KAAK;AAEJ,UAAAM,KAAY,IAAIN,IAAK,KAAQ1B,EAAM,IAAM0B,IAAIC,CAAC;AAC9C;AAAA,QACD,KAAK;AAEJ,UAAAM,IAAQ,IAAMP,IAAIC,GAClBG,IAAY9B,EAAMiC,CAAK,GACvBO,IAAI,IAAIpC,EAAKN,EAAMgC,CAAS,IAAK,CAAG,IAAKA,GACzCW,IAAIzC,EAAMwC,IAAI,CAAG,GACjBR,IAAWN,IAAI,MAAM,IAAQ,CAACe,IAAIA;AAClC;AAAA,QACD,KAAK;AAEJ,cAAKf,IAAI;AACR,oBAAWK,IAAW,KAAK,KAAMb,EAAsBO,GAAIC,CAAC;AAG7D,UAAAgB,IAAI,KAAQhB,IAAKA,IAAEA,IACnBiB,IAAIrC,EAAKoC,GAAGrB,CAAS,GACrBkB,IAAI,KAAQ,IAAQhB,KAAO,IAAIoB,IAAK;AACpC;AACC,YAAAP,IAAKG,IAAIA,GACTF,IAAKD,IAAKA,GACVE,IAAKC,IAAIF,GACTF,IAAKI,GAGLA,IAAI,KAAS,IAAIG,IAAEJ,IAAO,MAAMF,IAAM,SACnC,KAAS,IAAIM,IAAEL,IAAO,MAAME,IAAK;AAAA,iBAC3BrC,GAAMqC,IAAIJ,KAAMI,CAAC,IAAKV;AAGhC,UAAAU,IAAIvC,EAAMuC,IAAId,CAAE,GAChBO,IAAWN,IAAI,MAAM,IAAQ,CAACa,IAAIA;AAClC;AAAA,QACD;AACC,UAAKd,IAAKL,IACTY,IAAS1C,EAAS,IAAMoC,CAAC,IAAKhB,IACnBe,IAAK,KAEhBG,IAAY,SAAWH,IAAK,WACvBC,IAAIE,IACRI,IAASlB,EAA4BW,GAAIC,CAAC,IAE1CM,IAAShB,EAA4BS,GAAIC,CAAC,MAI3CE,IAAYlC,EAAO,GAAKE,EAAO6B,IAAK,MAAM,CAAE,GACvCC,IAAIE,IACRI,IAASd,EAAsBO,GAAIC,CAAC,IAEpCM,IAAShB,EAA4BS,GAAIC,CAAC;AAAA,MAG/C;AAAA,QACQ,CAAKD,IAAKL,IAChBY,IAAS,CAAC1C,EAAS,IAAMoC,CAAC,IAAKhB,IACpBe,IAAK,KAEhBG,IAAY,SAAWH,IAAK,WACvBC,IAAIE,IACRI,IAASlB,EAA4BW,GAAIC,CAAC,IAE1CM,IAAShB,EAA4BS,GAAIC,CAAC,MAI3CE,IAAYlC,EAAO,GAAKE,EAAO6B,IAAK,MAAM,CAAE,GACvCC,IAAIE,IACRI,IAASd,EAAsBO,GAAIC,CAAC,IAEpCM,IAAShB,EAA4BS,GAAIC,CAAC;AAG5C,WAASK,IAAW,CAACC,IAASA;AAAA,EAC/B;AAKA,SAAAY,IAAiBpB;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t_body_series.js

@@ -0,0 +1,59 @@
+import { __require as I } from "../../../../../@stdlib_math-base-special-gamma-delta-ratio@0.2.2/node_modules/@stdlib/math-base-special-gamma-delta-ratio/lib/index.js";
+import { __require as $ } from "../../../../../@stdlib_math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/lib/index.js";
+import { __require as R } from "../../../../../@stdlib_math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/lib/index.js";
+import { __require as S } from "../../../../../@stdlib_constants-float64-pi@0.2.2/node_modules/@stdlib/constants-float64-pi/lib/index.js";
+import { __require as g } from "./polyval_co14.js";
+import { __require as h } from "./polyval_co15.js";
+import { __require as x } from "./polyval_co16.js";
+import { __require as B } from "./polyval_co17.js";
+import { __require as D } from "./polyval_co18.js";
+import { __require as T } from "./polyval_co19.js";
+import { __require as j } from "./polyval_co20.js";
+import { __require as k } from "./polyval_co21.js";
+import { __require as w } from "./polyval_co22.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_62_0/boost/math/special_functions/detail/t_distribution_inv.hpp}. The implementation has been modified for JavaScript.
+*
+* ```text
+* Copyright John Maddock 2006.
+* Copyright Paul A. Bristow 2007.
+*
+* 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 i, _;
+function U() {
+  if (_) return i;
+  _ = 1;
+  var v = I(), l = $(), u = R(), s = S(), t = g(), q = h(), m = x(), p = B(), y = D(), f = T(), n = j(), c = k(), P = w(), d = 0, r = [1, 0, 0, 0, 0, 0, 0, 0, 0, 0];
+  function b(a, L) {
+    var e, o;
+    return o = v(a / 2, 0.5) * u(a * s) * (L - 0.5), e = 1 / a, r[1] = t(e), r[2] = q(e), r[3] = m(e), r[4] = p(e), r[5] = y(e), r[6] = f(e), r[7] = n(e), r[8] = c(e), r[9] = P(e), d + o * l(r, o * o);
+  }
+  return i = b, i;
+}
+export {
+  U as __require
+};
+//# sourceMappingURL=inverse_students_t_body_series.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t_body_series.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inverse_students_t_body_series.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t_body_series.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_62_0/boost/math/special_functions/detail/t_distribution_inv.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006.\n* Copyright Paul A. Bristow 2007.\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 gammaDeltaRatio = require( '@stdlib/math-base-special-gamma-delta-ratio' );\nvar evalpoly = require( '@stdlib/math-base-tools-evalpoly' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar PI = require( '@stdlib/constants-float64-pi' );\nvar polyval1 = require( './polyval_co14.js' );\nvar polyval2 = require( './polyval_co15.js' );\nvar polyval3 = require( './polyval_co16.js' );\nvar polyval4 = require( './polyval_co17.js' );\nvar polyval5 = require( './polyval_co18.js' );\nvar polyval6 = require( './polyval_co19.js' );\nvar polyval7 = require( './polyval_co20.js' );\nvar polyval8 = require( './polyval_co21.js' );\nvar polyval9 = require( './polyval_co22.js' );\n\n\n// VARIABLES //\n\nvar c0 = 0.0;\n\n// Workspace for the polynomial coefficients:\nvar c = [ 1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ]; // WARNING: not thread safe\n\n\n// MAIN //\n\n/**\n* Evaluates Student's t quantiles via a body series expansion. Tail and body series are due to Shaw.\n*\n* ## References\n*\n* -   Shaw, William T. 2006. \"Sampling Student's T distribution – use of the inverse cumulative distribution function.\" _Journal of Computational Finance_ 9 (4): 37–73. [www.mth.kcl.ac.uk/~shaww/web\\_page/papers/Tdistribution06.pdf](www.mth.kcl.ac.uk/~shaww/web_page/papers/Tdistribution06.pdf).\n*\n* @private\n* @param {PositiveNumber} df - degrees of freedom\n* @param {Probability} u - input probability\n* @returns {number} function value\n*/\nfunction inverseStudentsTBodySeries( df, u ) {\n\tvar idf;\n\tvar v;\n\n\t// Body series for small N, start with Eq 56 of Shaw:\n\tv = gammaDeltaRatio( df/2, 0.5 ) * sqrt( df*PI ) * ( u-0.5 );\n\n\t// Figure out what the coefficients are. They depend only on the degrees of freedom (Eq 57 of Shaw):\n\tidf = 1.0 / df;\n\tc[ 1 ] = polyval1( idf );\n\tc[ 2 ] = polyval2( idf );\n\tc[ 3 ] = polyval3( idf );\n\tc[ 4 ] = polyval4( idf );\n\tc[ 5 ] = polyval5( idf );\n\tc[ 6 ] = polyval6( idf );\n\tc[ 7 ] = polyval7( idf );\n\tc[ 8 ] = polyval8( idf );\n\tc[ 9 ] = polyval9( idf );\n\n\t// Result is then an odd polynomial in v (see Eq 56 of Shaw)...\n\treturn c0 + ( v*evalpoly( c, v*v ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = inverseStudentsTBodySeries;\n"],"names":["gammaDeltaRatio","require$$0","evalpoly","require$$1","sqrt","require$$2","PI","require$$3","polyval1","require$$4","polyval2","require$$5","polyval3","require$$6","polyval4","require$$7","polyval5","require$$8","polyval6","require$$9","polyval7","require$$10","polyval8","require$$11","polyval9","require$$12","c0","c","inverseStudentsTBodySeries","df","u","idf","v","inverse_students_t_body_series"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAkBC,EAAA,GAClBC,IAAWC,EAAA,GACXC,IAAOC,EAAA,GACPC,IAAKC,EAAA,GACLC,IAAWC,EAAA,GACXC,IAAWC,EAAA,GACXC,IAAWC,EAAA,GACXC,IAAWC,EAAA,GACXC,IAAWC,EAAA,GACXC,IAAWC,EAAA,GACXC,IAAWC,EAAA,GACXC,IAAWC,EAAA,GACXC,IAAWC,EAAA,GAKXC,IAAK,GAGLC,IAAI,CAAE,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,CAAG;AAiB1D,WAASC,EAA4BC,GAAIC,GAAI;AAC5C,QAAIC,GACAC;AAGJ,WAAAA,IAAIhC,EAAiB6B,IAAG,GAAG,GAAG,IAAKzB,EAAMyB,IAAGvB,MAASwB,IAAE,MAGvDC,IAAM,IAAMF,GACZF,EAAG,CAAC,IAAKnB,EAAUuB,CAAG,GACtBJ,EAAG,CAAC,IAAKjB,EAAUqB,CAAG,GACtBJ,EAAG,CAAC,IAAKf,EAAUmB,CAAG,GACtBJ,EAAG,CAAC,IAAKb,EAAUiB,CAAG,GACtBJ,EAAG,CAAC,IAAKX,EAAUe,CAAG,GACtBJ,EAAG,CAAC,IAAKT,EAAUa,CAAG,GACtBJ,EAAG,CAAC,IAAKP,EAAUW,CAAG,GACtBJ,EAAG,CAAC,IAAKL,EAAUS,CAAG,GACtBJ,EAAG,CAAC,IAAKH,EAAUO,CAAG,GAGfL,IAAOM,IAAE9B,EAAUyB,GAAGK,IAAEA;EAChC;AAKA,SAAAC,IAAiBL;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t_hill.js

@@ -0,0 +1,52 @@
+import { __require as c } from "../../../../../@stdlib_math-base-special-erfcinv@0.2.3/node_modules/@stdlib/math-base-special-erfcinv/lib/index.js";
+import { __require as h } from "../../../../../@stdlib_math-base-special-expm1@0.2.3/node_modules/@stdlib/math-base-special-expm1/lib/index.js";
+import { __require as x } from "../../../../../@stdlib_math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/lib/index.js";
+import { __require as I } from "../../../../../@stdlib_math-base-special-pow@0.3.0/node_modules/@stdlib/math-base-special-pow/lib/index.js";
+import { __require as H } from "../../../../../@stdlib_constants-float64-half-pi@0.2.2/node_modules/@stdlib/constants-float64-half-pi/lib/index.js";
+import { __require as R } from "../../../../../@stdlib_constants-float64-sqrt-two@0.2.2/node_modules/@stdlib/constants-float64-sqrt-two/lib/index.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_61_0/boost/math/special_functions/detail/t_distribution_inv.hpp}. The implementation has been modified for JavaScript.
+*
+* ```text
+* Copyright John Maddock 2006.
+* Copyright Paul A. Bristow 2007.
+*
+* 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 v, p;
+function F() {
+  if (p) return v;
+  p = 1;
+  var q = c(), b = h(), o = x(), L = I(), n = H(), m = R();
+  function $(e, s) {
+    var i, a, _, u, l, t, r;
+    return e > 1e20 ? -q(2 * s) * m : (i = 1 / (e - 0.5), a = 48 / (i * i), _ = ((20700 * i / a - 98) * i - 16) * i + 96.36, u = ((94.5 / (a + _) - 3) / a + 1) * o(i * n) * e, r = L(u * 2 * s, 2 / e), r > 0.05 + i ? (t = -q(2 * s) * m, r = t * t, e < 5 && (_ += 0.3 * (e - 4.5) * (t + 0.6)), _ += (((0.05 * u * t - 5) * t - 7) * t - 2) * t + a, r = (((((0.4 * r + 6.3) * r + 36) * r + 94.5) / _ - r - 3) / a + 1) * t, r = b(i * r * r)) : r = ((1 / (((e + 6) / (e * r) - 0.089 * u - 0.822) * (e + 2) * 3) + 0.5 / (e + 4)) * r - 1) * (e + 1) / (e + 2) + 1 / r, l = o(e * r), -l);
+  }
+  return v = $, v;
+}
+export {
+  F as __require
+};
+//# sourceMappingURL=inverse_students_t_hill.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t_hill.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inverse_students_t_hill.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t_hill.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_61_0/boost/math/special_functions/detail/t_distribution_inv.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006.\n* Copyright Paul A. Bristow 2007.\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/* eslint-disable no-mixed-operators */\n\n'use strict';\n\n// MODULES //\n\nvar erfcinv = require( '@stdlib/math-base-special-erfcinv' );\nvar expm1 = require( '@stdlib/math-base-special-expm1' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar HALF_PI = require( '@stdlib/constants-float64-half-pi' );\nvar SQRT2 = require( '@stdlib/constants-float64-sqrt-two' );\n\n\n// MAIN //\n\n/**\n* Evaluates Student's t quantiles via a method due to Hill.\n*\n* ## References\n*\n* -   Hill, G. W. 1970. \"Algorithm 396: Student's T-Quantiles.\" _Communications of the ACM_ 13 (10). New York, NY, USA: ACM: 619–20. doi:[10.1145/355598.355600](https://doi.org/10.1145/355598.355600).\n*\n* @private\n* @param {PositiveNumber} ndf - degrees of freedom\n* @param {Probability} u - input probability\n* @returns {number} function value\n*/\nfunction inverseStudentsTHill( ndf, u ) {\n\tvar a;\n\tvar b;\n\tvar c;\n\tvar d;\n\tvar q;\n\tvar x;\n\tvar y;\n\n\tif ( ndf > 1e20 ) {\n\t\treturn -erfcinv( 2 * u ) * SQRT2;\n\t}\n\ta = 1.0 / ( ndf - 0.5 );\n\tb = 48.0 / (a * a);\n\tc = ( ( ( ( (20700.0*a/b) - 98.0 ) * a ) - 16.0 ) * a ) + 96.36;\n\td = ( ( ( (94.5/(b+c)) - 3.0 ) / b ) + 1.0 ) * sqrt( a * HALF_PI ) * ndf;\n\ty = pow( d * 2.0 * u, 2.0 / ndf );\n\n\tif ( y > ( 0.05 + a ) ) {\n\t\t// Asymptotic inverse expansion about normal:\n\t\tx = -erfcinv( 2.0 * u ) * SQRT2;\n\t\ty = x * x;\n\n\t\tif ( ndf < 5.0 ) {\n\t\t\tc += 0.3 * ( ndf-4.5 ) * ( x + 0.6 );\n\t\t}\n\t\tc += ( ( ( ( ( ( (0.05*d*x)-5.0 ) * x ) - 7.0 ) * x )- 2.0 ) * x ) + b;\n\t\ty = ((((((0.4*y+6.3)*y)+36.0) * y + 94.5) / c - y - 3.0) / b + 1.0) * x;\n\t\ty = expm1( a * y * y );\n\t} else {\n\t\ty = ((1.0 / ( ( (ndf+6.0) / (ndf*y) - 0.089 * d - 0.822 ) *\n\t\t(ndf+2.0) * 3.0 ) + 0.5 / (ndf+4.0)) * y - 1.0) *\n\t\t(ndf+1.0) / (ndf+2.0) + 1.0 / y;\n\t}\n\tq = sqrt( ndf * y );\n\treturn -q;\n}\n\n\n// EXPORTS //\n\nmodule.exports = inverseStudentsTHill;\n"],"names":["erfcinv","require$$0","expm1","require$$1","sqrt","require$$2","pow","require$$3","HALF_PI","require$$4","SQRT2","require$$5","inverseStudentsTHill","ndf","u","a","b","c","d","q","x","y","inverse_students_t_hill"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,MAAIA,IAAUC,EAAA,GACVC,IAAQC,EAAA,GACRC,IAAOC,EAAA,GACPC,IAAMC,EAAA,GACNC,IAAUC,EAAA,GACVC,IAAQC,EAAA;AAiBZ,WAASC,EAAsBC,GAAKC,GAAI;AACvC,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,WAAKR,IAAM,OACH,CAACb,EAAS,IAAIc,CAAC,IAAKJ,KAE5BK,IAAI,KAAQF,IAAM,MAClBG,IAAI,MAAQD,IAAIA,IAChBE,MAAa,QAAQF,IAAEC,IAAK,MAASD,IAAM,MAASA,IAAM,OAC1DG,MAAW,QAAMF,IAAEC,KAAM,KAAQD,IAAM,KAAQZ,EAAMW,IAAIP,CAAO,IAAKK,GACrEQ,IAAIf,EAAKY,IAAI,IAAMJ,GAAG,IAAMD,CAAG,GAE1BQ,IAAM,OAAON,KAEjBK,IAAI,CAACpB,EAAS,IAAMc,CAAC,IAAKJ,GAC1BW,IAAID,IAAIA,GAEHP,IAAM,MACVI,KAAK,OAAQJ,IAAI,QAAUO,IAAI,OAEhCH,QAAkB,OAAKC,IAAEE,IAAG,KAAQA,IAAM,KAAQA,IAAK,KAAQA,IAAMJ,GACrEK,SAAU,MAAIA,IAAE,OAAKA,IAAG,MAAQA,IAAI,QAAQJ,IAAII,IAAI,KAAOL,IAAI,KAAOI,GACtEC,IAAInB,EAAOa,IAAIM,IAAIA,CAAC,KAEpBA,MAAM,OAAWR,IAAI,MAAQA,IAAIQ,KAAK,QAAQH,IAAI,UACjDL,IAAI,KAAO,KAAQ,OAAOA,IAAI,MAAQQ,IAAI,MAC1CR,IAAI,MAAQA,IAAI,KAAO,IAAMQ,GAE/BF,IAAIf,EAAMS,IAAMQ,CAAC,GACV,CAACF;AAAA,EACT;AAKA,SAAAG,IAAiBV;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t_tail_series.js

@@ -0,0 +1,51 @@
+import { __require as I } from "../../../../../@stdlib_math-base-special-gamma-delta-ratio@0.2.2/node_modules/@stdlib/math-base-special-gamma-delta-ratio/lib/index.js";
+import { __require as c } from "../../../../../@stdlib_math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/lib/index.js";
+import { __require as R } from "../../../../../@stdlib_math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/lib/index.js";
+import { __require as S } from "../../../../../@stdlib_math-base-special-pow@0.3.0/node_modules/@stdlib/math-base-special-pow/lib/index.js";
+import { __require as T } from "../../../../../@stdlib_constants-float64-pi@0.2.2/node_modules/@stdlib/constants-float64-pi/lib/index.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_61_0/boost/math/special_functions/detail/t_distribution_inv.hpp}. The implementation has been modified for JavaScript.
+*
+* ```text
+* Copyright John Maddock 2006.
+* Copyright Paul A. Bristow 2007.
+*
+* 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 v, m;
+function P() {
+  if (m) return v;
+  m = 1;
+  var p = I(), l = c(), n = R(), b = S(), L = T(), i = [0, 0, 0, 0, 0, 0, 0];
+  function $(r, w) {
+    var s, o, _, e, a, t, u, q;
+    return q = p(r / 2, 0.5) * n(r * L) * w, e = r + 2, a = r + 4, t = r + 6, i[0] = 1, i[1] = -(r + 1) / (2 * e), e *= r + 2, i[2] = -r * (r + 1) * (r + 3) / (8 * e * a), e *= r + 2, i[3] = -r * (r + 1) * (r + 5) * ((3 * r + 7) * r - 2) / (48 * e * a * t), e *= r + 2, a *= r + 4, i[4] = -r * (r + 1) * (r + 7) * (((((15 * r + 154) * r + 465) * r + 286) * r - 336) * r + 64) / (384 * e * a * t * (r + 8)), e *= r + 2, i[5] = -r * (r + 1) * (r + 3) * (r + 9) * ((((((35 * r + 452) * r + 1573) * r + 600) * r - 2020) * r + 928) * r - 128) / (1280 * e * a * t * (r + 8) * (r + 10)), e *= r + 2, a *= r + 4, t *= r + 6, i[6] = -r * (r + 1) * (r + 11) * (((((((((((945 * r + 31506) * r + 425858) * r + 2980236) * r + 11266745) * r + 20675018) * r + 7747124) * r - 22574632) * r - 8565600) * r + 18108416) * r - 7099392) * r + 884736) / (46080 * e * a * t * (r + 8) * (r + 10) * (r + 12)), u = n(r), _ = b(u * q, 1 / r), o = _ * _, s = l(i, o), s *= u, s /= _, -s;
+  }
+  return v = $, v;
+}
+export {
+  P as __require
+};
+//# sourceMappingURL=inverse_students_t_tail_series.js.map