@milaboratories/miplots4 1.0.123 → 1.0.125

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

@@ -0,0 +1,43 @@
+/**
+* @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)
+* ```
+*/
+function n(t, o, a) {
+  var i, r;
+  if (a === 0)
+    return 1;
+  for (i = 1, r = 0; r < a; r++)
+    i *= (t + r) / (o + r);
+  return i;
+}
+var e = n;
+export {
+  e as r
+};
+//# sourceMappingURL=rising_factorial_ratio.js.map

package/dist/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/@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,SAASA,EAAsBC,GAAGC,GAAGC,GAAI;AACxC,MAAIC,GACAC;AACJ,MAAKF,MAAM;AACV,WAAO;AAGR,OADAC,IAAS,GACHC,IAAI,GAAGA,IAAIF,GAAGE;AACnB,IAAAD,MAAYH,IAAII,MAAQH,IAAIG;AAE7B,SAAOD;AACR;AAKA,IAAAE,IAAiBN;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,42 @@
+import { i as s } 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 f = s;
+function _(e, n, v) {
+  var t, i, a, r;
+  return i = n / 2, a = 1 - i, t = e * 2, r = f(t, i, a), v && (v.value = r * r / (t + r * r)), t / (t + r * r);
+}
+var o = _;
+export {
+  o as f
+};
+//# sourceMappingURL=find_ibeta_inv_from_t_dist.js.map

package/dist/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/@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,IAAIA,IAAmBC;AAcvB,SAASC,EAAuBC,GAAGC,GAAGC,GAAK;AAC1C,MAAIC,GACAC,GACAC,GACAC;AAEJ,SAAAF,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;AACxB;AAKA,IAAAC,IAAiBR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,62 @@
+import { l as O } from "../../math-base-special-abs/lib/index.js";
+import { l as U } from "../../math-base-special-ldexp/lib/index.js";
+import { l as V } from "../../math-base-special-signum/lib/index.js";
+import { l as X } from "../../math-base-special-max/lib/index.js";
+import { l as j } from "../../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 l = O, q = U, i = V, z = X, w = j;
+function C(B, e, a, t, I, M) {
+  var k, d, y, c, E, f, p, A, r, L, v, h, $, o, b, _;
+  o = 0, d = !1, f = e, E = q(1, 1 - I), r = z(1e7 * e, 1e7), p = 0, y = r, c = r, A = M;
+  do {
+    if (p = o, c = y, y = r, $ = B(f), o = $[0], b = $[1], _ = $[2], A -= 1, o === 0)
+      break;
+    if (b === 0 ? (p === 0 && (f === a ? e = t : e = a, p = B(e), r = e - f), i(p) * i(o) < 0 ? r < 0 ? r = (f - a) / 2 : r = (f - t) / 2 : r < 0 ? r = (f - t) / 2 : r = (f - a) / 2) : _ === 0 ? r = o / b : (L = 2 * o, h = 2 * b - o * (_ / b), l(h) < 1 && l(L) >= l(h) * w ? r = o / b : r = L / h, r * b / o < 0 && (r = o / b, l(r) > 2 * l(e) && (r = (r < 0 ? -1 : 1) * 2 * l(e)))), k = l(r / c), k > 0.8 && k < 2 && (r = r > 0 ? (f - a) / 2 : (f - t) / 2, l(r) > f && (r = i(r) * f), c = r * 3), e = f, f -= r, f < a) {
+      if (l(a) < 1 && l(f) > 1 && w / l(f) < l(a) ? v = 1e3 : v = f / a, l(v) < 1 && (v = 1 / v), !d && v > 0 && v < 3)
+        r = 0.99 * (e - a), f = e - r, d = !0;
+      else if (r = (e - a) / 2, f = e - r, f === a || f === t)
+        break;
+    } else if (f > t) {
+      if (l(t) < 1 && l(f) > 1 && w / l(f) < l(t) ? v = 1e3 : v = f / t, l(v) < 1 && (v = 1 / v), !d && v > 0 && v < 3)
+        r = 0.99 * (e - t), f = e - r, d = !0;
+      else if (r = (e - t) / 2, f = e - r, f === a || f === t)
+        break;
+    }
+    r > 0 ? t = e : a = e;
+  } while (A && l(f * E) < l(r));
+  return f;
+}
+var K = C;
+export {
+  K as h
+};
+//# sourceMappingURL=halley_iterate.js.map

package/dist/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/@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,IAAIA,IAAMC,GACNC,IAAQC,GACRC,IAAOC,GACPC,IAAMC,GACNC,IAAYC;AAiBhB,SAASC,EAAeC,GAAKC,GAAOC,GAASC,GAASC,GAAQC,GAAU;AACvE,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,EAAAF,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,KAAG;AAUF,QATAO,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,QA1DKC,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,UAXCb,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,QAAAF,IAAQ,QAAQb,IAAQC,IACxBS,IAASV,IAAQa,GACjBP,IAAc;AAAA,eAEdO,KAASb,IAAQC,KAAW,GAC5BS,IAASV,IAAQa,GACZH,MAAWT,KAAWS,MAAWR;AACrC;AAAA,eAGSQ,IAASR;AAapB,UAXCd,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,QAAAF,IAAQ,QAAQb,IAAQE,IACxBQ,IAASV,IAAQa,GACjBP,IAAc;AAAA,eAEdO,KAAUb,IAAQE,KAAY,GAC9BQ,IAASV,IAAQa,GACZH,MAAWT,KAAWS,MAAWR;AACrC;AAAA;AAKH,IAAKW,IAAQ,IACZX,IAAUF,IAEVC,IAAUD;AAAA,EAEb,SAAWY,KAAWxB,EAAIsB,IAASD,CAAM,IAAIrB,EAAIyB,CAAK;AAErD,SAAOH;AACR;AAKA,IAAAW,IAAiBvB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,48 @@
+import { l as n } from "../../math-base-special-kernel-betainc/lib/index.js";
+import { l as u } from "../../math-base-special-abs/lib/index.js";
+import { l as p } from "../../constants-float64-max/lib/index.js";
+import { l as _ } from "../../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 c = n.assign, A = u, M = p, s = _;
+function O(l, m, v, f) {
+  return e;
+  function e(r) {
+    var t, a, i, b, o;
+    return o = 1 - r, t = [0, 0], c(r, l, m, !0, f, t, 1, 0), b = t[0] - v, a = t[1], f && (a = -a), o === 0 && (o = s * 64), r === 0 && (r = s * 64), i = a * (-(o * l) + (m - 2) * r + 1), A(i) < o * r * M && (i /= o * r), f && (i = -i), a === 0 && (a = (f ? -1 : 1) * s * 64), [b, a, i];
+  }
+}
+var R = O;
+export {
+  R as i
+};
+//# sourceMappingURL=ibeta_roots.js.map

package/dist/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/@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,IAAIA,IAAgBC,EAAsD,QACtEC,IAAMC,GACNC,IAAcC,GACdC,IAAmBC;AAevB,SAASC,EAAYC,GAAGC,GAAGC,GAAQC,GAAS;AAC3C,SAAOC;AASP,WAASA,EAAOC,GAAI;AACnB,QAAIC,GACAC,GACAC,GACAC,GACAC;AAEJ,WAAAA,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,EACpB;AACA;AAKA,IAAAG,IAAiBZ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,23 @@
+import { m 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 m = a, i = m;
+export {
+  i as l
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../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,IAAIA,IAAOC,GAKXC,IAAiBF;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,80 @@
+import { l as q } from "../../math-base-special-erfcinv/lib/index.js";
+import { l as A } from "../../math-base-special-floor/lib/index.js";
+import { l as B } from "../../math-base-special-ldexp/lib/index.js";
+import { l as C } from "../../math-base-special-round/lib/index.js";
+import { l as F } from "../../math-base-special-acos/lib/index.js";
+import { l as L } from "../../math-base-special-sqrt/lib/index.js";
+import { l as N } from "../../math-base-special-abs/lib/index.js";
+import { l as Q } from "../node_modules/@stdlib/math-base-special-cos/lib/index.js";
+import { l as X } from "../../math-base-special-pow/lib/index.js";
+import { l as g } from "../node_modules/@stdlib/math-base-special-sin/lib/index.js";
+import { l as j } from "../../constants-float64-sqrt-two/lib/index.js";
+import { l as z } from "../../constants-float64-pi/lib/index.js";
+import { i as G } from "./inverse_students_t_body_series.js";
+import { i as J } from "./inverse_students_t_tail_series.js";
+import { i as K } 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 w = q, D = A, c = B, E = C, M = F, m = L, U = N, R = Q, V = X, W = g, y = j, I = z, O = G, p = J, f = K, P = 268435456, Y = 1 / 3, Z = 2 * 53 / 3, d = 0.8549879733383485;
+function u(e, r, l) {
+  var i, $, n, t, a, S, T, h, o, b, k, s, x, _, v, H;
+  if (a = 0, r > l ? (T = l, l = r, r = T, t = !0) : t = !1, D(e) === e && e < 20)
+    switch ($ = c(1, Z), D(e)) {
+      case 1:
+        r === 0.5 ? a = 0 : a = -R(I * r) / W(I * r);
+        break;
+      case 2:
+        a = (2 * r - 1) / m(2 * r * l);
+        break;
+      case 4:
+        S = 4 * r * l, n = m(S), x = 4 * R(M(n) / 3) / n, _ = m(x - 4), a = r - 0.5 < 0 ? -_ : _;
+        break;
+      case 6:
+        if (r < 1e-150)
+          return (t ? -1 : 1) * f(e, r);
+        v = 4 * (r - r * r), H = V(v, Y), s = 6 * (1 + d * (1 / H - 1));
+        do
+          o = s * s, b = o * o, k = s * b, h = s, s = 2 * (8 * v * k - 270 * o + 2187) / (5 * (4 * v * b - 216 * s - 243));
+        while (U((s - h) / s) > $);
+        s = m(s - e), a = r - 0.5 < 0 ? -s : s;
+        break;
+      default:
+        e > P ? a = w(2 * r) * y : e < 3 ? (i = 0.2742 - e * 0.0242143, r > i ? a = O(e, r) : a = p(e, r)) : (i = c(1, E(e / -0.654)), r > i ? a = f(e, r) : a = p(e, r));
+    }
+  else e > P ? a = -w(2 * r) * y : e < 3 ? (i = 0.2742 - e * 0.0242143, r > i ? a = O(e, r) : a = p(e, r)) : (i = c(1, E(e / -0.654)), r > i ? a = f(e, r) : a = p(e, r));
+  return t ? -a : a;
+}
+var fr = u;
+export {
+  fr as i
+};
+//# sourceMappingURL=inverse_students_t.js.map

package/dist/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/@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,IAAIA,IAAUC,GACVC,IAAQC,GACRC,IAAQC,GACRC,IAAQC,GACRC,IAAOC,GACPC,IAAOC,GACPC,IAAMC,GACNC,IAAMC,GACNC,IAAMC,GACNC,IAAMC,GACNC,IAAQC,GACRC,IAAKC,GACLC,IAA6BC,GAC7BC,IAA6BC,GAC7BC,IAAuBC,GAKvBC,IAAe,WACfC,IAAY,IAAM,GAClBC,IAAQ,IAAM,KAAS,GACvBC,IAAI;AAcR,SAASC,EAAkBC,GAAIC,GAAGC,GAAI;AACrC,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAYJ,MAVAX,IAAS,GACJN,IAAIC,KAERO,IAAMP,GACNA,IAAID,GACJA,IAAIQ,GACJH,IAAS,MAETA,IAAS,IAELvC,EAAMiC,CAAE,MAAMA,KAAMA,IAAK;AAI7B,YAFAI,IAAYnC,EAAO,GAAK4B,CAAG,GAElB9B,EAAOiC,CAAE,GAAE;AAAA,MACpB,KAAK;AAEJ,QAAKC,MAAM,MACVM,IAAS,IAETA,IAAS,CAAC5B,EAAKQ,IAAKc,CAAC,IAAKlB,EAAKI,IAAKc,CAAC;AAEtC;AAAA,MACD,KAAK;AAEJ,QAAAM,KAAY,IAAIN,IAAK,KAAQ1B,EAAM,IAAM0B,IAAIC,CAAC;AAC9C;AAAA,MACD,KAAK;AAEJ,QAAAM,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,MACD,KAAK;AAEJ,YAAKf,IAAI;AACR,kBAAWK,IAAW,KAAK,KAAMb,EAAsBO,GAAIC,CAAC;AAG7D,QAAAgB,IAAI,KAAQhB,IAAKA,IAAEA,IACnBiB,IAAIrC,EAAKoC,GAAGrB,CAAS,GACrBkB,IAAI,KAAQ,IAAQhB,KAAO,IAAIoB,IAAK;AACpC;AACC,UAAAP,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,eAC3BrC,GAAMqC,IAAIJ,KAAMI,CAAC,IAAKV;AAGhC,QAAAU,IAAIvC,EAAMuC,IAAId,CAAE,GAChBO,IAAWN,IAAI,MAAM,IAAQ,CAACa,IAAIA;AAClC;AAAA,MACD;AACC,QAAKd,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,IAG/C;AAAA,MACQ,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,SAASK,IAAW,CAACC,IAASA;AAC/B;AAKA,IAAAY,KAAiBpB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,54 @@
+import { l as v } from "../../math-base-special-gamma-delta-ratio/lib/index.js";
+import { l as m } from "../../math-base-tools-evalpoly/lib/index.js";
+import { l as i } from "../../math-base-special-sqrt/lib/index.js";
+import { l as t } from "../../constants-float64-pi/lib/index.js";
+import { p as s } from "./polyval_co14.js";
+import { p as y } from "./polyval_co15.js";
+import { p as e } from "./polyval_co16.js";
+import { p as f } from "./polyval_co17.js";
+import { p as _ } from "./polyval_co18.js";
+import { p as c } from "./polyval_co19.js";
+import { p as n } from "./polyval_co20.js";
+import { p as b } from "./polyval_co21.js";
+import { p as u } 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 d = v, $ = m, S = i, g = t, q = s, x = y, B = e, D = f, I = _, P = c, R = n, T = b, h = u, j = 0, a = [1, 0, 0, 0, 0, 0, 0, 0, 0, 0];
+function k(l, p) {
+  var o, r;
+  return r = d(l / 2, 0.5) * S(l * g) * (p - 0.5), o = 1 / l, a[1] = q(o), a[2] = x(o), a[3] = B(o), a[4] = D(o), a[5] = I(o), a[6] = P(o), a[7] = R(o), a[8] = T(o), a[9] = h(o), j + r * $(a, r * r);
+}
+var O = k;
+export {
+  O as i
+};
+//# sourceMappingURL=inverse_students_t_body_series.js.map

package/dist/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/@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,IAAIA,IAAkBC,GAClBC,IAAWC,GACXC,IAAOC,GACPC,IAAKC,GACLC,IAAWC,GACXC,IAAWC,GACXC,IAAWC,GACXC,IAAWC,GACXC,IAAWC,GACXC,IAAWC,GACXC,IAAWC,GACXC,IAAWC,GACXC,IAAWC,GAKXC,IAAK,GAGLC,IAAI,CAAE,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,CAAG;AAiB1D,SAASC,EAA4BC,GAAIC,GAAI;AAC5C,MAAIC,GACAC;AAGJ,SAAAA,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;AAChC;AAKA,IAAAC,IAAiBL;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,47 @@
+import { l as $ } from "../../math-base-special-erfcinv/lib/index.js";
+import { l as _ } from "../../math-base-special-expm1/lib/index.js";
+import { l as c } from "../../math-base-special-sqrt/lib/index.js";
+import { l as u } from "../../math-base-special-pow/lib/index.js";
+import { l as x } from "../../constants-float64-half-pi/lib/index.js";
+import { l as q } from "../../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 m = $, H = _, p = c, S = u, T = x, b = q;
+function h(a, e) {
+  var i, v, t, o, s, l, r;
+  return a > 1e20 ? -m(2 * e) * b : (i = 1 / (a - 0.5), v = 48 / (i * i), t = ((20700 * i / v - 98) * i - 16) * i + 96.36, o = ((94.5 / (v + t) - 3) / v + 1) * p(i * T) * a, r = S(o * 2 * e, 2 / a), r > 0.05 + i ? (l = -m(2 * e) * b, r = l * l, a < 5 && (t += 0.3 * (a - 4.5) * (l + 0.6)), t += (((0.05 * o * l - 5) * l - 7) * l - 2) * l + v, r = (((((0.4 * r + 6.3) * r + 36) * r + 94.5) / t - r - 3) / v + 1) * l, r = H(i * r * r)) : r = ((1 / (((a + 6) / (a * r) - 0.089 * o - 0.822) * (a + 2) * 3) + 0.5 / (a + 4)) * r - 1) * (a + 1) / (a + 2) + 1 / r, s = p(a * r), -s);
+}
+var P = h;
+export {
+  P as i
+};
+//# sourceMappingURL=inverse_students_t_hill.js.map

package/dist/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/@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,IAAIA,IAAUC,GACVC,IAAQC,GACRC,IAAOC,GACPC,IAAMC,GACNC,IAAUC,GACVC,IAAQC;AAiBZ,SAASC,EAAsBC,GAAKC,GAAI;AACvC,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,SAAKR,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;AACT;AAKA,IAAAG,IAAiBV;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,46 @@
+import { l as b } from "../../math-base-special-gamma-delta-ratio/lib/index.js";
+import { l as u } from "../../math-base-tools-evalpoly/lib/index.js";
+import { l as _ } from "../../math-base-special-sqrt/lib/index.js";
+import { l as $ } from "../../math-base-special-pow/lib/index.js";
+import { l as w } from "../../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 S = b, T = u, p = _, c = $, g = w, v = [0, 0, 0, 0, 0, 0, 0];
+function q(r, n) {
+  var e, s, l, a, i, t, o, m;
+  return m = S(r / 2, 0.5) * p(r * g) * n, a = r + 2, i = r + 4, t = r + 6, v[0] = 1, v[1] = -(r + 1) / (2 * a), a *= r + 2, v[2] = -r * (r + 1) * (r + 3) / (8 * a * i), a *= r + 2, v[3] = -r * (r + 1) * (r + 5) * ((3 * r + 7) * r - 2) / (48 * a * i * t), a *= r + 2, i *= r + 4, v[4] = -r * (r + 1) * (r + 7) * (((((15 * r + 154) * r + 465) * r + 286) * r - 336) * r + 64) / (384 * a * i * t * (r + 8)), a *= r + 2, v[5] = -r * (r + 1) * (r + 3) * (r + 9) * ((((((35 * r + 452) * r + 1573) * r + 600) * r - 2020) * r + 928) * r - 128) / (1280 * a * i * t * (r + 8) * (r + 10)), a *= r + 2, i *= r + 4, t *= r + 6, v[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 * a * i * t * (r + 8) * (r + 10) * (r + 12)), o = p(r), l = c(o * m, 1 / r), s = l * l, e = T(v, s), e *= o, e /= l, -e;
+}
+var R = q;
+export {
+  R as i
+};
+//# sourceMappingURL=inverse_students_t_tail_series.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"inverse_students_t_tail_series.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/inverse_students_t_tail_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_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'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 pow = require( '@stdlib/math-base-special-pow' );\nvar PI = require( '@stdlib/constants-float64-pi' );\n\n\n// VARIABLES //\n\n// Array for the coefficients d(k), these depend only on the number of degrees of freedom df, so at least in theory we could tabulate these for fixed df, see p15 of Shaw:\nvar d = [ 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 tail 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 {number} df - degrees of freedom\n* @param {number} v - function value\n* @returns {number} tail value\n*/\nfunction inverseStudentsTTailSeries( df, v ) { // eslint-disable-line id-length\n\tvar result;\n\tvar power;\n\tvar div;\n\tvar np2;\n\tvar np4;\n\tvar np6;\n\tvar rn;\n\tvar w;\n\n\t// Tail series expansion, see section 6 of Shaw's paper. `w` is calculated using Eq 60:\n\tw = gammaDeltaRatio( df/2.0, 0.5 ) * sqrt( df*PI ) * v;\n\n\t// Define some variables:\n\tnp2 = df + 2.0;\n\tnp4 = df + 4.0;\n\tnp6 = df + 6.0;\n\n\td[ 0 ] = 1.0;\n\td[ 1 ] = -(df+1.0) / (2.0*np2);\n\tnp2 *= (df + 2.0);\n\td[ 2 ] = -df * (df+1.0) * (df+3.0) / (8.0*np2*np4);\n\tnp2 *= df + 2.0;\n\td[ 3 ] = -df * (df+1.0) * (df+5.0) * (((3.0*df) + 7.0) * df - 2.0) / (48.0*np2*np4*np6); // eslint-disable-line max-len, no-mixed-operators\n\tnp2 *= (df + 2.0);\n\tnp4 *= (df + 4.0);\n\td[ 4 ] = -df * (df+1.0) * (df+7.0) * ( (((((15.0*df) + 154.0) * df + 465.0) * df + 286.0) * df - 336.0) * df + 64.0) / (384.0*np2*np4*np6*(df+8.0)); // eslint-disable-line max-len, no-mixed-operators\n\tnp2 *= (df + 2.0);\n\td[ 5 ] = -df * (df+1.0) * (df+3.0) * (df+9.0) * (((((((35.0 * df + 452.0) * df+1573.0) * df + 600.0) * df - 2020.0) * df) + 928.0) * df - 128.0) / (1280.0*np2*np4*np6*(df+8.0) * (df+10.0)); // eslint-disable-line max-len, no-mixed-operators\n\tnp2 *= (df + 2.0);\n\tnp4 *= (df + 4.0);\n\tnp6 *= (df + 6.0);\n\td[ 6 ] = -df * (df+1.0) * (df+11.0) * ((((((((((((945.0*df) + 31506.0) * df + 425858.0) * df + 2980236.0) * df + 11266745.0) * df + 20675018.0) * df + 7747124.0) * df - 22574632.0) * df - 8565600.0) * df + 18108416.0) * df - 7099392.0) * df + 884736.0) / (46080.0*np2*np4*np6*(df+8.0) * (df+10.0) * (df+12.0)); // eslint-disable-line max-len, no-mixed-operators\n\n\t// Now bring everything together to provide the result this is Eq 62 of Shaw:\n\trn = sqrt( df );\n\tdiv = pow( rn*w, 1.0/df );\n\tpower = div * div;\n\tresult = evalpoly( d, power );\n\tresult *= rn;\n\tresult /= div;\n\treturn -result;\n}\n\n\n// EXPORTS //\n\nmodule.exports = inverseStudentsTTailSeries;\n"],"names":["gammaDeltaRatio","require$$0","evalpoly","require$$1","sqrt","require$$2","pow","require$$3","PI","require$$4","d","inverseStudentsTTailSeries","df","v","result","power","div","np2","np4","np6","rn","w","inverse_students_t_tail_series"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIA,IAAkBC,GAClBC,IAAWC,GACXC,IAAOC,GACPC,IAAMC,GACNC,IAAKC,GAMLC,IAAI,CAAE,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK;AAiBxC,SAASC,EAA4BC,GAAIC,GAAI;AAC5C,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,SAAAA,IAAIrB,EAAiBY,IAAG,GAAK,GAAG,IAAKR,EAAMQ,IAAGJ,CAAE,IAAKK,GAGrDI,IAAML,IAAK,GACXM,IAAMN,IAAK,GACXO,IAAMP,IAAK,GAEXF,EAAG,CAAC,IAAK,GACTA,EAAG,CAAC,IAAK,EAAEE,IAAG,MAAQ,IAAIK,IAC1BA,KAAQL,IAAK,GACbF,EAAG,CAAC,IAAK,CAACE,KAAMA,IAAG,MAAQA,IAAG,MAAQ,IAAIK,IAAIC,IAC9CD,KAAOL,IAAK,GACZF,EAAG,CAAC,IAAK,CAACE,KAAMA,IAAG,MAAQA,IAAG,OAAU,IAAIA,IAAM,KAAOA,IAAK,MAAQ,KAAKK,IAAIC,IAAIC,IACnFF,KAAQL,IAAK,GACbM,KAAQN,IAAK,GACbF,EAAG,CAAC,IAAK,CAACE,KAAMA,IAAG,MAAQA,IAAG,UAAc,KAAKA,IAAM,OAASA,IAAK,OAASA,IAAK,OAASA,IAAK,OAASA,IAAK,OAAS,MAAMK,IAAIC,IAAIC,KAAKP,IAAG,KAC9IK,KAAQL,IAAK,GACbF,EAAG,CAAC,IAAK,CAACE,KAAMA,IAAG,MAAQA,IAAG,MAAQA,IAAG,WAAc,KAAOA,IAAK,OAASA,IAAG,QAAUA,IAAK,OAASA,IAAK,QAAUA,IAAM,OAASA,IAAK,QAAU,OAAOK,IAAIC,IAAIC,KAAKP,IAAG,MAAQA,IAAG,MACtLK,KAAQL,IAAK,GACbM,KAAQN,IAAK,GACbO,KAAQP,IAAK,GACbF,EAAG,CAAC,IAAK,CAACE,KAAMA,IAAG,MAAQA,IAAG,iBAAoB,MAAMA,IAAM,SAAWA,IAAK,UAAYA,IAAK,WAAaA,IAAK,YAAcA,IAAK,YAAcA,IAAK,WAAaA,IAAK,YAAcA,IAAK,WAAaA,IAAK,YAAcA,IAAK,WAAaA,IAAK,WAAa,QAAQK,IAAIC,IAAIC,KAAKP,IAAG,MAAQA,IAAG,OAASA,IAAG,MAG/SQ,IAAKhB,EAAMQ,CAAE,GACbI,IAAMV,EAAKc,IAAGC,GAAG,IAAIT,CAAE,GACvBG,IAAQC,IAAMA,GACdF,IAASZ,EAAUQ,GAAGK,CAAK,GAC3BD,KAAUM,GACVN,KAAUE,GACH,CAACF;AACT;AAKA,IAAAQ,IAAiBX;","x_google_ignoreList":[0]}