@milaboratories/miplots4 1.0.157 → 1.0.158

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

@@ -1,53 +0,0 @@
-import { l as c } from "../../math-base-tools-continued-fraction/lib/index.js";
-import { i as m } from "./ibeta_power_terms.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/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 u = c, s = m, p = {
-  keep: !0,
-  maxIter: 1e3
-};
-function b(t, a, i, v) {
-  var r = 0;
-  return f;
-  function f() {
-    var e, o, n;
-    return o = (t + r - 1) * (t + a + r - 1) * r * (a - r) * i * i, e = t + 2 * r - 1, o /= e * e, n = r, n += r * (a - r) * i / (t + 2 * r - 1), n += (t + r) * (t * v - a * i + 1 + r * (2 - i)) / (t + 2 * r + 1), r += 1, [o, n];
-  }
-}
-function l(t, a, i, v, r, f) {
-  var e, o, n;
-  return e = s(t, a, i, v, r), f && (f[1] = e), e === 0 ? e : (n = b(t, a, i, v), o = u(n, p), e / o);
-}
-var d = l;
-export {
-  d as i
-};
-//# sourceMappingURL=ibeta_fraction2.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ibeta_fraction2.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/ibeta_fraction2.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/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// MODULES //\n\nvar continuedFraction = require( '@stdlib/math-base-tools-continued-fraction' );\nvar ibetaPowerTerms = require( './ibeta_power_terms.js' );\n\n\n// VARIABLES //\n\nvar OPTS = {\n\t'keep': true,\n\t'maxIter': 1000\n};\n\n\n// FUNCTIONS //\n\n/**\n* Continued fraction for the incomplete beta.\n*\n* @private\n* @param {NonNegativeNumber} a - function parameter\n* @param {NonNegativeNumber} b - function parameter\n* @param {Probability} x - function parameter\n* @param {Probability} y - probability equal to `1-x`\n* @returns {Function} series function\n*/\nfunction ibetaFraction2t( a, b, x, y ) {\n\tvar m = 0;\n\treturn next;\n\n\t/**\n\t* Calculate the numerator and denominator of the next term of the series.\n\t*\n\t* @private\n\t* @returns {Array} series expansion terms\n\t*/\n\tfunction next() {\n\t\tvar denom;\n\t\tvar aN;\n\t\tvar bN;\n\n\t\taN = (a + m - 1) * (a + b + m - 1) * m * (b - m) * x * x;\n\t\tdenom = a + ( 2.0*m ) - 1.0;\n\t\taN /= denom * denom;\n\t\tbN = m;\n\t\tbN += (m * (b - m) * x) / ( a + ( 2.0*m ) - 1.0 );\n\t\tbN += ( (a+m) * ( (a*y) - (b*x) + 1.0 + ( m*(2.0-x) ) ) ) / ( a + (2.0*m) + 1.0 ); // eslint-disable-line max-len\n\t\tm += 1;\n\t\treturn [ aN, bN ];\n\t}\n}\n\n\n// MAIN //\n\n/**\n* Evaluates the incomplete beta via the continued fraction representation.\n*\n* @private\n* @param {NonNegativeNumber} a - function parameter\n* @param {NonNegativeNumber} b - function parameter\n* @param {Probability} x - function parameter\n* @param {Probability} y - probability equal to `1-x`\n* @param {boolean} normalized - boolean indicating whether to evaluate the power terms of the regularized or non-regularized incomplete beta function\n* @param {(Array|TypedArray|Object)} out - output array holding the derivative as the second element\n* @returns {number} incomplete beta value\n*/\nfunction ibetaFraction2( a, b, x, y, normalized, out ) {\n\tvar result;\n\tvar fract;\n\tvar f;\n\n\tresult = ibetaPowerTerms( a, b, x, y, normalized );\n\tif ( out ) {\n\t\tout[ 1 ] = result;\n\t}\n\tif ( result === 0.0 ) {\n\t\treturn result;\n\t}\n\tf = ibetaFraction2t( a, b, x, y );\n\tfract = continuedFraction( f, OPTS );\n\treturn result / fract;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ibetaFraction2;\n"],"names":["continuedFraction","require$$0","ibetaPowerTerms","require$$1","OPTS","ibetaFraction2t","a","b","x","y","m","next","denom","aN","bN","ibetaFraction2","normalized","out","result","fract","f","ibeta_fraction2"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,IAAIA,IAAoBC,GACpBC,IAAkBC,GAKlBC,IAAO;AAAA,EACV,MAAQ;AAAA,EACR,SAAW;AACZ;AAeA,SAASC,EAAiBC,GAAGC,GAAGC,GAAGC,GAAI;AACtC,MAAIC,IAAI;AACR,SAAOC;AAQP,WAASA,IAAO;AACf,QAAIC,GACAC,GACAC;AAEJ,WAAAD,KAAMP,IAAII,IAAI,MAAMJ,IAAIC,IAAIG,IAAI,KAAKA,KAAKH,IAAIG,KAAKF,IAAIA,GACvDI,IAAQN,IAAM,IAAII,IAAM,GACxBG,KAAMD,IAAQA,GACdE,IAAKJ,GACLI,KAAOJ,KAAKH,IAAIG,KAAKF,KAAOF,IAAM,IAAII,IAAM,IAC5CI,MAASR,IAAEI,MAAQJ,IAAEG,IAAMF,IAAEC,IAAK,IAAQE,KAAG,IAAIF,OAAaF,IAAK,IAAII,IAAK,IAC5EA,KAAK,GACE,CAAEG,GAAIC,CAAE;AAAA,EACjB;AACA;AAiBA,SAASC,EAAgBT,GAAGC,GAAGC,GAAGC,GAAGO,GAAYC,GAAM;AACtD,MAAIC,GACAC,GACAC;AAMJ,SAJAF,IAAShB,EAAiBI,GAAGC,GAAGC,GAAGC,GAAGO,CAAU,GAC3CC,MACJA,EAAK,CAAC,IAAKC,IAEPA,MAAW,IACRA,KAERE,IAAIf,EAAiBC,GAAGC,GAAGC,GAAGC,CAAC,GAC/BU,IAAQnB,EAAmBoB,GAAGhB,CAAI,GAC3Bc,IAASC;AACjB;AAKA,IAAAE,IAAiBN;","x_google_ignoreList":[0]}

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

@@ -1,93 +0,0 @@
-import { l as z } from "../../math-base-special-gamma-lanczos-sum-expg-scaled/lib/index.js";
-import { l as I } from "../../math-base-special-maxabs/lib/index.js";
-import { l as P } from "../../math-base-special-minabs/lib/index.js";
-import { l as T } from "../../math-base-special-expm1/lib/index.js";
-import { l as X } from "../../math-base-special-log1p/lib/index.js";
-import { l as j } from "../../math-base-special-sqrt/lib/index.js";
-import { l as k } from "../../math-base-special-abs/lib/index.js";
-import { l as x } from "../../math-base-special-exp/lib/index.js";
-import { l as B } from "../../math-base-special-pow/lib/index.js";
-import { l as C } from "../../math-base-special-min/lib/index.js";
-import { l as D } from "../../math-base-special-ln/lib/index.js";
-import { l as F } from "../../constants-float64-max-ln/lib/index.js";
-import { l as H } from "../../constants-float64-min-ln/lib/index.js";
-import { l as J } from "../../constants-float64-gamma-lanczos-g/lib/index.js";
-import { l as K } from "../../constants-float64-e/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/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 G = z, O = I, Q = P, M = T, $ = X, S = j, d = k, f = x, v = B, R = C, s = D, t = F, h = H, L = J, U = K;
-function V(l, e, u, c, q) {
-  var r, A, w, n, N, p, m, i, a, b, g, _, E, o;
-  if (!q)
-    return v(u, l) * v(c, e);
-  if (E = l + e, n = l + L - 0.5, N = e + L - 0.5, p = E + L - 0.5, r = G(E), r /= G(l) * G(e), r *= S(N / U), r *= S(n / p), m = (u * e - c * n) / n, i = (c * l - u * N) / N, Q(m, i) < 0.2)
-    if (m * i > 0 || R(l, e) < 1)
-      d(m) < 0.1 ? r *= f(l * $(m)) : r *= v(u * p / n, l), d(i) < 0.1 ? r *= f(e * $(i)) : r *= v(c * p / N, e);
-    else if (O(m, i) < 0.5)
-      A = l < e, w = e / l, A && w * i < 0.1 || !A && m / w > 0.1 ? (a = M(w * $(i)), a = m + a + a * m, a = l * $(a), r *= f(a)) : (a = M($(m) / w), a = i + a + a * i, a = e * $(a), r *= f(a));
-    else if (d(m) < d(i))
-      if (o = l * $(m) + e * s(c * p / N), o <= h || o >= t) {
-        if (o += s(r), o >= t)
-          return NaN;
-        r = f(o);
-      } else
-        r *= f(o);
-    else if (o = e * $(i) + l * s(u * p / n), o <= h || o >= t) {
-      if (o += s(r), o >= t)
-        return NaN;
-      r = f(o);
-    } else
-      r *= f(o);
-  else if (g = u * p / n, _ = c * p / N, m = l * s(g), i = e * s(_), m >= t || m <= h || i >= t || i <= h)
-    if (l < e)
-      if (b = v(_, e / l), a = l * (s(g) + s(b)), a < t && a > h)
-        r *= v(b * g, l);
-      else {
-        if (i += m + s(r), i >= t)
-          return NaN;
-        r = f(i);
-      }
-    else if (b = v(g, l / e), a = (s(b) + s(_)) * e, a < t && a > h)
-      r *= v(b * _, e);
-    else {
-      if (i += m + s(r), i >= t)
-        return NaN;
-      r = f(i);
-    }
-  else
-    r *= v(g, l) * v(_, e);
-  return r;
-}
-var pr = V;
-export {
-  pr as i
-};
-//# sourceMappingURL=ibeta_power_terms.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ibeta_power_terms.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/ibeta_power_terms.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/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// MODULES //\n\nvar lanczosSumExpGScaled = require( '@stdlib/math-base-special-gamma-lanczos-sum-expg-scaled' );\nvar maxabs = require( '@stdlib/math-base-special-maxabs' );\nvar minabs = require( '@stdlib/math-base-special-minabs' );\nvar expm1 = require( '@stdlib/math-base-special-expm1' );\nvar log1p = require( '@stdlib/math-base-special-log1p' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar min = require( '@stdlib/math-base-special-min' );\nvar ln = require( '@stdlib/math-base-special-ln' );\nvar MAX_LN = require( '@stdlib/constants-float64-max-ln' );\nvar MIN_LN = require( '@stdlib/constants-float64-min-ln' );\nvar G = require( '@stdlib/constants-float64-gamma-lanczos-g' );\nvar E = require( '@stdlib/constants-float64-e' );\n\n\n// MAIN //\n\n/**\n* Computes the leading power terms in the incomplete beta function.\n*\n* When normalized,\n*\n* ```tex\n* \\frac{ x^a y^b }{ \\operatorname{Beta}(a,b) }\n* ```\n*\n* and otherwise\n*\n* ```tex\n* x^a y^b\n* ```\n*\n* ## Notes\n*\n* -   Almost all of the error in the incomplete beta comes from this function, particularly when \\\\( a \\\\) and \\\\( b \\\\) are large. Computing large powers are _hard_ though, and using logarithms just leads to horrendous cancellation errors.\n*\n* -   For \\\\( l1 * l2 > 0 \\\\) or \\\\( \\operatorname{min}( a, b ) < 1 \\\\), the two power terms both go in the same direction (toward zero or toward infinity). In this case if either term overflows or underflows, then the product of the two must do so also. Alternatively, if one exponent is less than one, then we can't productively use it to eliminate overflow or underflow from the other term.  Problems with spurious overflow/underflow can't be ruled out. In this case, but it is _very_ unlikely since one of the power terms will evaluate to a number close to 1.\n*\n* -   If \\\\( \\max( \\abs(l1), \\abs(l2) ) < 0.5 \\\\), both exponents are near one and both the exponents are greater than one, and, further, these two power terms tend in opposite directions (one toward zero, the other toward infinity), so we have to combine the terms to avoid any risk of overflow or underflow. We do this by moving one power term inside the other, we have:\n*\n*     ```tex\n*     (1 + l_1)^a \\cdot (1 + l_2)^b \\\\\n*     = ((1 + l_1) \\cdot (1 + l_2)^(b/a))^a \\\\\n*     = (1 + l_1 + l_3 + l_1*l_3)^a\n*     ```\n*\n*     and\n*\n*     ```tex\n*     l_3 = (1 + l_2)^(b/a) - 1 \\\\\n*     = \\exp((b/a) * \\ln(1 + l_2)) - 1\n*     ```\n*\n*     The tricky bit is deciding which term to move inside. By preference, we move the larger term inside, so that the size of the largest exponent is reduced.  However, that can only be done as long as l3 (see above) is also small.\n*\n* @private\n* @param {NonNegativeNumber} a - function parameter\n* @param {NonNegativeNumber} b - function parameter\n* @param {Probability} x - function parameter\n* @param {Probability} y - probability equal to `1-x`\n* @param {boolean} normalized - boolean indicating whether to evaluate the power terms of the regularized or non-regularized incomplete beta function\n* @returns {number} power terms\n*/\nfunction ibetaPowerTerms( a, b, x, y, normalized ) {\n\tvar result;\n\tvar smallA;\n\tvar ratio;\n\tvar agh;\n\tvar bgh;\n\tvar cgh;\n\tvar l1;\n\tvar l2;\n\tvar l3;\n\tvar p1;\n\tvar b1;\n\tvar b2;\n\tvar c;\n\tvar l;\n\n\tif ( !normalized ) {\n\t\t// Can we do better here?\n\t\treturn pow( x, a ) * pow( y, b );\n\t}\n\tc = a + b;\n\n\t// Combine power terms with Lanczos approximation:\n\tagh = a + G - 0.5;\n\tbgh = b + G - 0.5;\n\tcgh = c + G - 0.5;\n\tresult = lanczosSumExpGScaled( c );\n\tresult /= lanczosSumExpGScaled( a ) * lanczosSumExpGScaled( b );\n\n\t// Combine with the leftover terms from the Lanczos approximation:\n\tresult *= sqrt( bgh / E );\n\tresult *= sqrt( agh / cgh );\n\n\t// `l1` and `l2` are the base of the exponents minus one:\n\tl1 = ( ( x * b ) - ( y * agh ) ) / agh;\n\tl2 = ( ( y * a ) - ( x * bgh ) ) / bgh;\n\tif ( minabs( l1, l2 ) < 0.2 ) {\n\t\t// When the base of the exponent is very near 1 we get really gross errors unless extra care is taken:\n\t\tif ( l1 * l2 > 0 || min( a, b ) < 1 ) {\n\t\t\tif ( abs(l1) < 0.1 ) {\n\t\t\t\tresult *= exp( a * log1p( l1 ) );\n\t\t\t} else {\n\t\t\t\tresult *= pow( ( x*cgh ) / agh, a );\n\t\t\t}\n\t\t\tif ( abs(l2) < 0.1 ) {\n\t\t\t\tresult *= exp( b * log1p( l2 ) );\n\t\t\t} else {\n\t\t\t\tresult *= pow((y * cgh) / bgh, b);\n\t\t\t}\n\t\t}\n\t\telse if ( maxabs( l1, l2 ) < 0.5 ) {\n\t\t\tsmallA = a < b;\n\t\t\tratio = b / a;\n\t\t\tif (\n\t\t\t\t(smallA && (ratio * l2 < 0.1)) ||\n\t\t\t\t(!smallA && (l1 / ratio > 0.1))\n\t\t\t) {\n\t\t\t\tl3 = expm1( ratio * log1p( l2 ) );\n\t\t\t\tl3 = l1 + l3 + ( l3 * l1 );\n\t\t\t\tl3 = a * log1p( l3 );\n\t\t\t\tresult *= exp( l3 );\n\t\t\t}\n\t\t\telse {\n\t\t\t\tl3 = expm1( log1p( l1 ) / ratio );\n\t\t\t\tl3 = l2 + l3 + ( l3 * l2 );\n\t\t\t\tl3 = b * log1p( l3 );\n\t\t\t\tresult *= exp( l3 );\n\t\t\t}\n\t\t}\n\t\telse if ( abs(l1) < abs(l2) ) {\n\t\t\t// First base near 1 only:\n\t\t\tl = ( a * log1p( l1 ) ) + ( b * ln( ( y*cgh ) / bgh ) );\n\t\t\tif ( l <= MIN_LN || l >= MAX_LN ) {\n\t\t\t\tl += ln(result);\n\t\t\t\tif ( l >= MAX_LN ) {\n\t\t\t\t\treturn NaN;\n\t\t\t\t}\n\t\t\t\tresult = exp( l );\n\t\t\t} else {\n\t\t\t\tresult *= exp( l );\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t// Second base near 1 only:\n\t\t\tl = ( b * log1p( l2 ) ) + ( a * ln( (x*cgh) / agh ) );\n\t\t\tif ( l <= MIN_LN || l >= MAX_LN ) {\n\t\t\t\tl += ln(result);\n\t\t\t\tif ( l >= MAX_LN ) {\n\t\t\t\t\treturn NaN;\n\t\t\t\t}\n\t\t\t\tresult = exp( l );\n\t\t\t} else {\n\t\t\t\tresult *= exp( l );\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\t// General case:\n\t\tb1 = (x * cgh) / agh;\n\t\tb2 = (y * cgh) / bgh;\n\t\tl1 = a * ln(b1);\n\t\tl2 = b * ln(b2);\n\t\tif (\n\t\t\tl1 >= MAX_LN ||\n\t\t\tl1 <= MIN_LN ||\n\t\t\tl2 >= MAX_LN ||\n\t\t\tl2 <= MIN_LN\n\t\t) {\n\t\t\t// Oops, under/overflow, sidestep if we can:\n\t\t\tif ( a < b ) {\n\t\t\t\tp1 = pow( b2, b / a );\n\t\t\t\tl3 = a * ( ln(b1) + ln(p1) );\n\t\t\t\tif ( l3 < MAX_LN && l3 > MIN_LN ) {\n\t\t\t\t\tresult *= pow( p1 * b1, a );\n\t\t\t\t} else {\n\t\t\t\t\tl2 += l1 + ln(result);\n\t\t\t\t\tif ( l2 >= MAX_LN ) {\n\t\t\t\t\t\treturn NaN;\n\t\t\t\t\t}\n\t\t\t\t\tresult = exp( l2 );\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tp1 = pow( b1, a / b );\n\t\t\t\tl3 = ( ln(p1) + ln(b2) ) * b;\n\t\t\t\tif ( l3 < MAX_LN && l3 > MIN_LN ) {\n\t\t\t\t\tresult *= pow( p1 * b2, b );\n\t\t\t\t} else {\n\t\t\t\t\tl2 += l1 + ln( result );\n\t\t\t\t\tif (l2 >= MAX_LN) {\n\t\t\t\t\t\treturn NaN;\n\t\t\t\t\t}\n\t\t\t\t\tresult = exp( l2 );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t// Finally the normal case:\n\t\t\tresult *= pow( b1, a ) * pow( b2, b );\n\t\t}\n\t}\n\treturn result;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ibetaPowerTerms;\n"],"names":["lanczosSumExpGScaled","require$$0","maxabs","require$$1","minabs","require$$2","expm1","require$$3","log1p","require$$4","sqrt","require$$5","abs","require$$6","exp","require$$7","pow","require$$8","min","require$$9","ln","require$$10","MAX_LN","require$$11","MIN_LN","require$$12","G","require$$13","E","require$$14","ibetaPowerTerms","a","b","x","y","normalized","result","smallA","ratio","agh","bgh","cgh","l1","l2","l3","p1","b1","b2","c","l","ibeta_power_terms"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,IAAIA,IAAuBC,GACvBC,IAASC,GACTC,IAASC,GACTC,IAAQC,GACRC,IAAQC,GACRC,IAAOC,GACPC,IAAMC,GACNC,IAAMC,GACNC,IAAMC,GACNC,IAAMC,GACNC,IAAKC,GACLC,IAASC,GACTC,IAASC,GACTC,IAAIC,GACJC,IAAIC;AAmDR,SAASC,EAAiBC,GAAGC,GAAGC,GAAGC,GAAGC,GAAa;AAClD,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,MAAK,CAACd;AAEL,WAAOnB,EAAKiB,GAAGF,CAAC,IAAKf,EAAKkB,GAAGF,CAAC;AAkB/B,MAhBAgB,IAAIjB,IAAIC,GAGRO,IAAMR,IAAIL,IAAI,KACdc,IAAMR,IAAIN,IAAI,KACde,IAAMO,IAAItB,IAAI,KACdU,IAASpC,EAAsBgD,CAAC,GAChCZ,KAAUpC,EAAsB+B,KAAM/B,EAAsBgC,CAAC,GAG7DI,KAAU1B,EAAM8B,IAAMZ,CAAC,GACvBQ,KAAU1B,EAAM6B,IAAME,CAAG,GAGzBC,KAAST,IAAID,IAAQE,IAAIK,KAAUA,GACnCI,KAAST,IAAIH,IAAQE,IAAIO,KAAUA,GAC9BpC,EAAQsC,GAAIC,CAAE,IAAK;AAEvB,QAAKD,IAAKC,IAAK,KAAKzB,EAAKa,GAAGC,CAAC,IAAK;AACjC,MAAKpB,EAAI8B,CAAE,IAAI,MACdN,KAAUtB,EAAKiB,IAAIvB,EAAOkC,CAAE,CAAE,IAE9BN,KAAUpB,EAAOiB,IAAEQ,IAAQF,GAAKR,CAAC,GAE7BnB,EAAI+B,CAAE,IAAI,MACdP,KAAUtB,EAAKkB,IAAIxB,EAAOmC,CAAE,CAAE,IAE9BP,KAAUpB,EAAKkB,IAAIO,IAAOD,GAAKR,CAAC;AAAA,aAGxB9B,EAAQwC,GAAIC,CAAE,IAAK;AAC5B,MAAAN,IAASN,IAAIC,GACbM,IAAQN,IAAID,GAEVM,KAAWC,IAAQK,IAAK,OACxB,CAACN,KAAWK,IAAKJ,IAAQ,OAE1BM,IAAKtC,EAAOgC,IAAQ9B,EAAOmC,CAAE,CAAE,GAC/BC,IAAKF,IAAKE,IAAOA,IAAKF,GACtBE,IAAKb,IAAIvB,EAAOoC,CAAE,GAClBR,KAAUtB,EAAK8B,CAAE,MAGjBA,IAAKtC,EAAOE,EAAOkC,CAAE,IAAKJ,CAAK,GAC/BM,IAAKD,IAAKC,IAAOA,IAAKD,GACtBC,IAAKZ,IAAIxB,EAAOoC,CAAE,GAClBR,KAAUtB,EAAK8B,CAAE;AAAA,aAGThC,EAAI8B,CAAE,IAAI9B,EAAI+B,CAAE;AAGzB,UADAM,IAAMlB,IAAIvB,EAAOkC,CAAE,IAASV,IAAIZ,EAAMc,IAAEO,IAAQD,CAAG,GAC9CS,KAAKzB,KAAUyB,KAAK3B,GAAS;AAEjC,YADA2B,KAAK7B,EAAGgB,CAAM,GACTa,KAAK3B;AACT,iBAAO;AAER,QAAAc,IAAStB,EAAKmC,CAAC;AAAA,MACnB;AACI,QAAAb,KAAUtB,EAAKmC,CAAC;AAAA,aAKjBA,IAAMjB,IAAIxB,EAAOmC,CAAE,IAASZ,IAAIX,EAAKa,IAAEQ,IAAOF,CAAG,GAC5CU,KAAKzB,KAAUyB,KAAK3B,GAAS;AAEjC,UADA2B,KAAK7B,EAAGgB,CAAM,GACTa,KAAK3B;AACT,eAAO;AAER,MAAAc,IAAStB,EAAKmC,CAAC;AAAA,IACnB;AACI,MAAAb,KAAUtB,EAAKmC,CAAC;AAAA,WAMlBH,IAAMb,IAAIQ,IAAOF,GACjBQ,IAAMb,IAAIO,IAAOD,GACjBE,IAAKX,IAAIX,EAAG0B,CAAE,GACdH,IAAKX,IAAIZ,EAAG2B,CAAE,GAEbL,KAAMpB,KACNoB,KAAMlB,KACNmB,KAAMrB,KACNqB,KAAMnB;AAGN,QAAKO,IAAIC;AAGR,UAFAa,IAAK7B,EAAK+B,GAAIf,IAAID,CAAC,GACnBa,IAAKb,KAAMX,EAAG0B,CAAE,IAAI1B,EAAGyB,CAAE,IACpBD,IAAKtB,KAAUsB,IAAKpB;AACxB,QAAAY,KAAUpB,EAAK6B,IAAKC,GAAIf,CAAC;AAAA,WACnB;AAEN,YADAY,KAAMD,IAAKtB,EAAGgB,CAAM,GACfO,KAAMrB;AACV,iBAAO;AAER,QAAAc,IAAStB,EAAK6B,CAAE;AAAA,MACrB;AAAA,aAGIE,IAAK7B,EAAK8B,GAAIf,IAAIC,CAAC,GACnBY,KAAOxB,EAAGyB,CAAE,IAAIzB,EAAG2B,CAAE,KAAMf,GACtBY,IAAKtB,KAAUsB,IAAKpB;AACxB,MAAAY,KAAUpB,EAAK6B,IAAKE,GAAIf,CAAC;AAAA,SACnB;AAEN,UADAW,KAAMD,IAAKtB,EAAIgB,CAAM,GACjBO,KAAMrB;AACT,eAAO;AAER,MAAAc,IAAStB,EAAK6B,CAAE;AAAA,IACrB;AAAA;AAKG,IAAAP,KAAUpB,EAAK8B,GAAIf,CAAC,IAAKf,EAAK+B,GAAIf,CAAC;AAGrC,SAAOI;AACR;AAKA,IAAAc,KAAiBpB;","x_google_ignoreList":[0]}

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

@@ -1,62 +0,0 @@
-import { l as L } from "../../math-base-special-gamma-lanczos-sum-expg-scaled/lib/index.js";
-import { l as M } from "../../math-base-tools-sum-series/lib/index.js";
-import { l as x } from "../../math-base-special-log1p/lib/index.js";
-import { l as A } from "../../math-base-special-sqrt/lib/index.js";
-import { l as G } from "../../math-base-special-exp/lib/index.js";
-import { l as I } from "../../math-base-special-pow/lib/index.js";
-import { l as T } from "../../math-base-special-ln/lib/index.js";
-import { l as V } from "../../constants-float64-smallest-normal/lib/index.js";
-import { l as d } from "../../constants-float64-max-ln/lib/index.js";
-import { l as q } from "../../constants-float64-min-ln/lib/index.js";
-import { l as w } from "../../constants-float64-gamma-lanczos-g/lib/index.js";
-import { l as z } from "../../constants-float64-e/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/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 u = L, U = M, X = x, j = A, S = G, b = I, t = T, k = V, N = d, _ = q, g = w, B = z, E = {
-  maxTerms: 100
-};
-function C(i, a, o, m) {
-  var f = 1 - a, l = 1;
-  return p;
-  function p() {
-    var r = m / i;
-    return i += 1, m *= f * o / l, l += 1, f += 1, r;
-  }
-}
-function D(i, a, o, m, f, l, p) {
-  var r, e, s, v, n, $, c, h;
-  return f ? (c = i + a, e = i + g - 0.5, s = a + g - 0.5, v = c + g - 0.5, r = u(c) / (u(i) * u(a)), n = t(v / s) * (a - 0.5), $ = t(o * v / e) * i, n > _ && n < N && $ > _ && $ < N ? (i * a < s * 10 ? r *= S((a - 0.5) * X(i / s)) : r *= b(v / s, a - 0.5), r *= b(o * v / e, i), r *= j(e / B), l && (l[1] = r * b(p, a))) : (r = t(r) + n + $ + (t(e) - 1) / 2, l && (l[1] = S(r + a * t(p))), r = S(r))) : r = b(o, i), r < k ? m : (h = C(i, a, o, r), E.initialValue = m, U(h, E));
-}
-var rr = D;
-export {
-  rr as i
-};
-//# sourceMappingURL=ibeta_series.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ibeta_series.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/ibeta_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_64_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// MODULES //\n\nvar lanczosSumExpGScaled = require( '@stdlib/math-base-special-gamma-lanczos-sum-expg-scaled' );\nvar sumSeries = require( '@stdlib/math-base-tools-sum-series' );\nvar log1p = require( '@stdlib/math-base-special-log1p' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar ln = require( '@stdlib/math-base-special-ln' );\nvar MIN_VALUE = require( '@stdlib/constants-float64-smallest-normal' );\nvar MAX_LN = require( '@stdlib/constants-float64-max-ln' );\nvar MIN_LN = require( '@stdlib/constants-float64-min-ln' );\nvar G = require( '@stdlib/constants-float64-gamma-lanczos-g' );\nvar E = require( '@stdlib/constants-float64-e' );\n\n\n// VARIABLES //\n\nvar opts = {\n\t'maxTerms': 100\n};\n\n\n// FUNCTIONS //\n\n/**\n* Series approximation to the incomplete beta.\n*\n* @private\n* @param {NonNegativeNumber} a - function parameter\n* @param {NonNegativeNumber} b - function parameter\n* @param {Probability} x - function parameter\n* @param {number} result - initial result value\n* @returns {Function} series function\n*/\nfunction ibetaSeriesT( a, b, x, result ) {\n\tvar poch = 1.0 - b;\n\tvar n = 1;\n\treturn next;\n\n\t/**\n\t* Calculate the next term of the series.\n\t*\n\t* @private\n\t* @returns {number} series expansion term\n\t*/\n\tfunction next() {\n\t\tvar r = result / a;\n\t\ta += 1.0;\n\t\tresult *= poch * x / n;\n\t\tn += 1;\n\t\tpoch += 1.0;\n\t\treturn r;\n\t}\n}\n\n\n// MAIN //\n\n/**\n* Incomplete beta series.\n*\n* @private\n* @param {NonNegativeNumber} a - function parameter\n* @param {NonNegativeNumber} b - function parameter\n* @param {Probability} x - function parameter\n* @param {NonNegativeInteger} s0 - initial value\n* @param {boolean} normalized - boolean indicating whether to evaluate the power terms of the regularized or non-regularized incomplete beta function\n* @param {(Array|TypedArray|Object)} out - output array holding the derivative as the second element\n* @param {Probability} y - probability equal to `1-x`\n* @returns {number} function value\n*/\nfunction ibetaSeries( a, b, x, s0, normalized, out, y ) {\n\tvar result;\n\tvar agh;\n\tvar bgh;\n\tvar cgh;\n\tvar l1;\n\tvar l2;\n\tvar c;\n\tvar s;\n\n\tif ( normalized ) {\n\t\tc = a + b;\n\n\t\t// Incomplete beta power term, combined with the Lanczos approximation:\n\t\tagh = a + G - 0.5;\n\t\tbgh = b + G - 0.5;\n\t\tcgh = c + G - 0.5;\n\t\tresult = lanczosSumExpGScaled( c ) / ( lanczosSumExpGScaled( a ) * lanczosSumExpGScaled( b ) ); // eslint-disable-line max-len\n\n\t\tl1 = ln( cgh / bgh ) * ( b - 0.5 );\n\t\tl2 = ln( x * cgh / agh ) * a;\n\n\t\t// Check for over/underflow in the power terms:\n\t\tif (\n\t\t\tl1 > MIN_LN &&\n\t\t\tl1 < MAX_LN &&\n\t\t\tl2 > MIN_LN &&\n\t\t\tl2 < MAX_LN\n\t\t) {\n\t\t\tif ( a * b < bgh * 10.0 ) {\n\t\t\t\tresult *= exp( ( b-0.5 ) * log1p( a / bgh ) );\n\t\t\t} else {\n\t\t\t\tresult *= pow( cgh / bgh, b - 0.5 );\n\t\t\t}\n\t\t\tresult *= pow( x * cgh / agh, a );\n\t\t\tresult *= sqrt( agh / E );\n\n\t\t\tif ( out ) {\n\t\t\t\tout[ 1 ] = result * pow( y, b );\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t// We need logs, and this *will* cancel:\n\t\t\tresult = ln( result ) + l1 + l2 + ( ( ln( agh ) - 1.0 ) / 2.0 );\n\t\t\tif ( out ) {\n\t\t\t\tout[ 1 ] = exp( result + ( b * ln( y ) ) );\n\t\t\t}\n\t\t\tresult = exp( result );\n\t\t}\n\t}\n\telse {\n\t\t// Non-normalized, just compute the power:\n\t\tresult = pow( x, a );\n\t}\n\tif ( result < MIN_VALUE ) {\n\t\treturn s0; // Safeguard: series can't cope with denorms.\n\t}\n\ts = ibetaSeriesT( a, b, x, result );\n\topts.initialValue = s0;\n\treturn sumSeries( s, opts );\n}\n\n\n// EXPORTS //\n\nmodule.exports = ibetaSeries;\n"],"names":["lanczosSumExpGScaled","require$$0","sumSeries","require$$1","log1p","require$$2","sqrt","require$$3","exp","require$$4","pow","require$$5","ln","require$$6","MIN_VALUE","require$$7","MAX_LN","require$$8","MIN_LN","require$$9","G","require$$10","E","require$$11","opts","ibetaSeriesT","a","b","x","result","poch","n","next","ibetaSeries","s0","normalized","out","y","agh","bgh","cgh","l1","l2","s","ibeta_series"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,IAAIA,IAAuBC,GACvBC,IAAYC,GACZC,IAAQC,GACRC,IAAOC,GACPC,IAAMC,GACNC,IAAMC,GACNC,IAAKC,GACLC,IAAYC,GACZC,IAASC,GACTC,IAASC,GACTC,IAAIC,GACJC,IAAIC,GAKJC,IAAO;AAAA,EACV,UAAY;AACb;AAeA,SAASC,EAAcC,GAAGC,GAAGC,GAAGC,GAAS;AACxC,MAAIC,IAAO,IAAMH,GACbI,IAAI;AACR,SAAOC;AAQP,WAASA,IAAO;AACf,QAAI,IAAIH,IAASH;AACjB,WAAAA,KAAK,GACLG,KAAUC,IAAOF,IAAIG,GACrBA,KAAK,GACLD,KAAQ,GACD;AAAA,EACT;AACA;AAkBA,SAASG,EAAaP,GAAGC,GAAGC,GAAGM,GAAIC,GAAYC,GAAKC,GAAI;AACvD,MAAIR,GACAS,GACAC,GACAC,GACAC,GACAC,GACA,GACAC;AA8CJ,SA5CKR,KACJ,IAAIT,IAAIC,GAGRW,IAAMZ,IAAIN,IAAI,KACdmB,IAAMZ,IAAIP,IAAI,KACdoB,IAAM,IAAIpB,IAAI,KACdS,IAAS7B,EAAsB,MAAQA,EAAsB0B,KAAM1B,EAAsB2B,CAAC,IAE1Fc,IAAK7B,EAAI4B,IAAMD,CAAG,KAAOZ,IAAI,MAC7Be,IAAK9B,EAAIgB,IAAIY,IAAMF,CAAG,IAAKZ,GAI1Be,IAAKvB,KACLuB,IAAKzB,KACL0B,IAAKxB,KACLwB,IAAK1B,KAEAU,IAAIC,IAAIY,IAAM,KAClBV,KAAUrB,GAAOmB,IAAE,OAAQvB,EAAOsB,IAAIa,EAAK,IAE3CV,KAAUnB,EAAK8B,IAAMD,GAAKZ,IAAI,GAAG,GAElCE,KAAUnB,EAAKkB,IAAIY,IAAMF,GAAKZ,CAAC,GAC/BG,KAAUvB,EAAMgC,IAAMhB,CAAC,GAElBc,MACJA,EAAK,CAAC,IAAKP,IAASnB,EAAK2B,GAAGV,CAAC,OAK9BE,IAASjB,EAAIiB,CAAM,IAAKY,IAAKC,KAAS9B,EAAI0B,CAAG,IAAK,KAAQ,GACrDF,MACJA,EAAK,CAAC,IAAK5B,EAAKqB,IAAWF,IAAIf,EAAIyB,CAAC,CAAI,IAEzCR,IAASrB,EAAKqB,CAAM,MAKrBA,IAASnB,EAAKkB,GAAGF,CAAC,GAEdG,IAASf,IACNoB,KAERS,IAAIlB,EAAcC,GAAGC,GAAGC,GAAGC,CAAM,GACjCL,EAAK,eAAeU,GACbhC,EAAWyC,GAAGnB,CAAI;AAC1B;AAKA,IAAAoB,KAAiBX;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/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 incomplete beta function and its first derivative.\n*\n* @module @stdlib/math-base-special-kernel-betainc\n*\n* @example\n* var kernelBetainc = require( '@stdlib/math-base-special-kernel-betainc' );\n*\n* var out = kernelBetainc( 0.5, 2.0, 2.0, false, false );\n* // returns [ ~0.083, ~1.5 ]\n*\n* out = kernelBetainc( 0.2, 1.0, 2.0, true, false );\n* // returns [ 0.36, 1.6 ]\n*\n* @example\n* var kernelBetainc = require( '@stdlib/math-base-special-kernel-betainc' );\n*\n* var arr = [ 0.0, 0.0 ];\n* var out = kernelBetainc.assign( 0.2, 1.0, 2.0, true, true, arr, 1, 0 );\n* // returns [ 0.64, 1.6 ]\n*\n* var bool = ( arr === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["setReadOnly","require$$0","main","require$$1","assign","require$$2","lib"],"mappings":";;;;;;;;;;;;;;;;;;;;AA+CA,IAAIA,IAAcC,GACdC,IAAOC,GACPC,IAASC;AAKbL,EAAaE,GAAM,UAAUE,CAAM;AAKnC,IAAAE,IAAiBJ;","x_google_ignoreList":[0]}

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

@@ -1,27 +0,0 @@
-import { a as i } from "./assign.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 = i;
-function o(a, r, n, e, t) {
-  return m(a, r, n, e, t, [0, 0], 1, 0);
-}
-var c = o;
-export {
-  c as m
-};
-//# sourceMappingURL=main.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/main.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar compute = require( './assign.js' );\n\n\n// MAIN //\n\n/**\n* Evaluates the incomplete beta function and its first derivative.\n*\n* @param {Probability} x - function input\n* @param {NonNegativeNumber} a - function parameter\n* @param {NonNegativeNumber} b - function parameter\n* @param {boolean} regularized - boolean indicating if the function should evaluate the regularized boolean beta function\n* @param {boolean} upper - boolean indicating if the function should return the upper tail of the incomplete beta function instead\n* @returns {Array} function value and first derivative\n*\n* @example\n* var out = kernelBetainc( 0.5, 2.0, 2.0, false, false );\n* // returns [ ~0.083, ~1.5 ]\n*\n* @example\n* var out = kernelBetainc( 0.2, 1.0, 2.0, true, false );\n* // returns [ 0.36, 1.6 ]\n*/\nfunction kernelBetainc( x, a, b, regularized, upper ) {\n\treturn compute( x, a, b, regularized, upper, [ 0.0, 0.0 ], 1, 0 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = kernelBetainc;\n"],"names":["compute","require$$0","kernelBetainc","x","a","b","regularized","upper","main"],"mappings":";;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAUC;AAuBd,SAASC,EAAeC,GAAGC,GAAGC,GAAGC,GAAaC,GAAQ;AACrD,SAAOP,EAASG,GAAGC,GAAGC,GAAGC,GAAaC,GAAO,CAAE,GAAK,IAAO,GAAG,CAAC;AAChE;AAKA,IAAAC,IAAiBN;","x_google_ignoreList":[0]}

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

@@ -1,58 +0,0 @@
-import { l as x } from "../../math-base-special-gamma-lanczos-sum-expg-scaled/lib/index.js";
-import { l as d } from "../../math-base-special-gammaln/lib/index.js";
-import { l as c } from "../../math-base-special-gamma/lib/index.js";
-import { l as _ } from "../../math-base-special-log1p/lib/index.js";
-import { l as G } 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 "../../math-base-special-exp/lib/index.js";
-import { l as E } from "../../math-base-special-pow/lib/index.js";
-import { l as L } from "../../math-base-special-max/lib/index.js";
-import { l as M } from "../../math-base-special-min/lib/index.js";
-import { l as S } from "../../math-base-special-ln/lib/index.js";
-import { l as h } from "../../constants-float64-max-ln/lib/index.js";
-import { l as w } from "../../constants-float64-min-ln/lib/index.js";
-import { l as A } from "../../constants-float64-gamma-lanczos-g/lib/index.js";
-import { l as I } from "../../constants-float64-e/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/gamma.hpp}. The implementation has been modified for JavaScript.
-*
-* ```text
-* Copyright John Maddock 2006-7, 2013-14.
-* Copyright Paul A. Bristow 2007, 2013-14.
-* Copyright Nikhar Agrawal 2013-14.
-* Copyright Christopher Kormanyos 2013-14.
-*
-* 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 P = x, X = d, j = c, k = _, y = G, B = N, f = q, v = E, $ = L, n = M, u = S, b = h, p = w, g = A, C = I;
-function D(r, i) {
-  var l, t, a, o, m, s, e;
-  return a = r + g - 0.5, e = (i - r - g + 0.5) / a, r < 1 ? i <= p ? f(r * u(i) - i - X(r)) : v(i, r) * f(-i) / j(r) : (B(e * e * r) <= 100 && r > 150 ? (l = r * (k(e) - e) + i * (0.5 - g) / a, l = f(l)) : (o = r * u(i / a), m = r - i, n(o, m) <= p || $(o, m) >= b ? (t = m / r, n(o, m) / 2 > p && $(o, m) / 2 < b ? (s = v(i / a, r / 2) * f(m / 2), l = s * s) : n(o, m) / 4 > p && $(o, m) / 4 < b && i > r ? (s = v(i / a, r / 4) * f(m / 4), l = s * s, l *= l) : t > p && t < b ? l = v(i * f(t) / a, r) : l = f(o + m)) : l = v(i / a, r) * f(m)), l *= y(a / C) / P(r), l);
-}
-var ir = D;
-export {
-  ir as r
-};
-//# sourceMappingURL=regularized_gamma_prefix.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"regularized_gamma_prefix.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/regularized_gamma_prefix.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/gamma.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006-7, 2013-14.\n* Copyright Paul A. Bristow 2007, 2013-14.\n* Copyright Nikhar Agrawal 2013-14.\n* Copyright Christopher Kormanyos 2013-14.\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 lanczosSumExpGScaled = require( '@stdlib/math-base-special-gamma-lanczos-sum-expg-scaled' );\nvar gammaln = require( '@stdlib/math-base-special-gammaln' );\nvar gamma = require( '@stdlib/math-base-special-gamma' );\nvar log1p = require( '@stdlib/math-base-special-log1p' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar max = require( '@stdlib/math-base-special-max' );\nvar min = require( '@stdlib/math-base-special-min' );\nvar ln = require( '@stdlib/math-base-special-ln' );\nvar MAX_LN = require( '@stdlib/constants-float64-max-ln' );\nvar MIN_LN = require( '@stdlib/constants-float64-min-ln' );\nvar G = require( '@stdlib/constants-float64-gamma-lanczos-g' );\nvar E = require( '@stdlib/constants-float64-e' );\n\n\n// MAIN //\n\n/**\n* Computes `(z^a)*(e^-z) / gamma(a)`.\n*\n* @private\n* @param {number} a - input value\n* @param {number} z - input value\n* @returns {number} function value\n*/\nfunction regularizedGammaPrefix( a, z ) {\n\tvar prefix;\n\tvar amza;\n\tvar agh;\n\tvar alz;\n\tvar amz;\n\tvar sq;\n\tvar d;\n\n\tagh = a + G - 0.5;\n\td = ( (z - a) - G + 0.5 ) / agh;\n\tif ( a < 1.0 ) {\n\t\t// Treat a < 1 as a special case because our Lanczos approximations are optimized against the factorials with a > 1, and for high precision types very small values of `a` can give rather erroneous results for gamma:\n\t\tif ( z <= MIN_LN ) {\n\t\t\t// Use logs, so should be free of cancellation errors:\n\t\t\treturn exp( ( a * ln(z) ) - z - gammaln( a ) );\n\t\t}\n\t\t// No danger of overflow as gamma(a) < 1/a for small a, so direct calculation:\n\t\treturn pow( z, a ) * exp( -z ) / gamma( a );\n\t}\n\tif ( abs(d*d*a) <= 100.0 && a > 150.0 ) {\n\t\t// Special case for large a and a ~ z:\n\t\tprefix = ( a * ( log1p( d ) - d ) ) + ( z * ( 0.5-G ) / agh );\n\t\tprefix = exp( prefix );\n\t}\n\telse {\n\t\t// General case. Direct computation is most accurate, but use various fallbacks for different parts of the problem domain:\n\t\talz = a * ln(z / agh);\n\t\tamz = a - z;\n\t\tif (\n\t\t\tmin(alz, amz) <= MIN_LN ||\n\t\t\tmax(alz, amz) >= MAX_LN\n\t\t) {\n\t\t\tamza = amz / a;\n\t\t\tif (\n\t\t\t\tmin(alz, amz)/2.0 > MIN_LN &&\n\t\t\t\tmax(alz, amz)/2.0 < MAX_LN\n\t\t\t) {\n\t\t\t\t// Compute square root of the result and then square it:\n\t\t\t\tsq = pow( z/agh, a/2.0 ) * exp( amz/2.0 );\n\t\t\t\tprefix = sq * sq;\n\t\t\t}\n\t\t\telse if (\n\t\t\t\tmin(alz, amz)/4.0 > MIN_LN &&\n\t\t\t\tmax(alz, amz)/4.0 < MAX_LN &&\n\t\t\t\tz > a\n\t\t\t) {\n\t\t\t\t// Compute the 4th root of the result then square it twice:\n\t\t\t\tsq = pow( z/agh, a/4.0 ) * exp( amz/4.0 );\n\t\t\t\tprefix = sq * sq;\n\t\t\t\tprefix *= prefix;\n\t\t\t}\n\t\t\telse if (\n\t\t\t\tamza > MIN_LN &&\n\t\t\t\tamza < MAX_LN\n\t\t\t) {\n\t\t\t\tprefix = pow( (z * exp(amza)) / agh, a );\n\t\t\t}\n\t\t\telse {\n\t\t\t\tprefix = exp( alz + amz );\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprefix = pow( z/agh, a ) * exp( amz );\n\t\t}\n\t}\n\tprefix *= sqrt( agh/E ) / lanczosSumExpGScaled( a );\n\treturn prefix;\n}\n\n\n// EXPORTS //\n\nmodule.exports = regularizedGammaPrefix;\n"],"names":["lanczosSumExpGScaled","require$$0","gammaln","require$$1","gamma","require$$2","log1p","require$$3","sqrt","require$$4","abs","require$$5","exp","require$$6","pow","require$$7","max","require$$8","min","require$$9","ln","require$$10","MAX_LN","require$$11","MIN_LN","require$$12","G","require$$13","E","require$$14","regularizedGammaPrefix","a","z","prefix","amza","agh","alz","amz","sq","d","regularized_gamma_prefix"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,IAAIA,IAAuBC,GACvBC,IAAUC,GACVC,IAAQC,GACRC,IAAQC,GACRC,IAAOC,GACPC,IAAMC,GACNC,IAAMC,GACNC,IAAMC,GACNC,IAAMC,GACNC,IAAMC,GACNC,IAAKC,GACLC,IAASC,GACTC,IAASC,GACTC,IAAIC,GACJC,IAAIC;AAaR,SAASC,EAAwBC,GAAGC,GAAI;AACvC,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAIJ,SAFAJ,IAAMJ,IAAIL,IAAI,KACda,KAAOP,IAAID,IAAKL,IAAI,OAAQS,GACvBJ,IAAI,IAEHC,KAAKR,IAEFZ,EAAOmB,IAAIX,EAAGY,CAAC,IAAMA,IAAI9B,EAAS6B,EAAG,IAGtCjB,EAAKkB,GAAGD,CAAC,IAAKnB,EAAK,CAACoB,CAAC,IAAK5B,EAAO2B,CAAC,KAErCrB,EAAI6B,IAAEA,IAAER,CAAC,KAAK,OAASA,IAAI,OAE/BE,IAAWF,KAAMzB,EAAOiC,CAAC,IAAKA,KAAUP,KAAM,MAAIN,KAAMS,GACxDF,IAASrB,EAAKqB,CAAM,MAIpBG,IAAML,IAAIX,EAAGY,IAAIG,CAAG,GACpBE,IAAMN,IAAIC,GAETd,EAAIkB,GAAKC,CAAG,KAAKb,KACjBR,EAAIoB,GAAKC,CAAG,KAAKf,KAEjBY,IAAOG,IAAMN,GAEZb,EAAIkB,GAAKC,CAAG,IAAE,IAAMb,KACpBR,EAAIoB,GAAKC,CAAG,IAAE,IAAMf,KAGpBgB,IAAKxB,EAAKkB,IAAEG,GAAKJ,IAAE,KAAQnB,EAAKyB,IAAI,CAAG,GACvCJ,IAASK,IAAKA,KAGdpB,EAAIkB,GAAKC,CAAG,IAAE,IAAMb,KACpBR,EAAIoB,GAAKC,CAAG,IAAE,IAAMf,KACpBU,IAAID,KAGJO,IAAKxB,EAAKkB,IAAEG,GAAKJ,IAAE,KAAQnB,EAAKyB,IAAI,CAAG,GACvCJ,IAASK,IAAKA,GACdL,KAAUA,KAGVC,IAAOV,KACPU,IAAOZ,IAEPW,IAASnB,EAAMkB,IAAIpB,EAAIsB,CAAI,IAAKC,GAAKJ,CAAC,IAGtCE,IAASrB,EAAKwB,IAAMC,CAAG,KAKxBJ,IAASnB,EAAKkB,IAAEG,GAAKJ,CAAC,IAAKnB,EAAKyB,CAAG,IAGrCJ,KAAUzB,EAAM2B,IAAIP,CAAC,IAAK5B,EAAsB+B,CAAC,GAC1CE;AACR;AAKA,IAAAO,KAAiBV;","x_google_ignoreList":[0]}

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

@@ -1,43 +0,0 @@
-/**
-* @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

@@ -1 +0,0 @@
-{"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

@@ -1,42 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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

@@ -1,62 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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]}