@milaboratories/miplots4 1.0.157 → 1.0.159

package/dist/node_modules/@stdlib/math-base-special-gammaln/lib/polyval_w.js.map

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

package/dist/node_modules/@stdlib/math-base-special-gcd/lib/binary_gcd.js

@@ -1,39 +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.
-*/
-function t(r, i) {
-  var e = 1, n;
-  if (r === 0)
-    return i;
-  if (i === 0)
-    return r;
-  for (; r % 2 === 0 && i % 2 === 0; )
-    r /= 2, i /= 2, e *= 2;
-  for (; r % 2 === 0; )
-    r /= 2;
-  for (; i; ) {
-    for (; i % 2 === 0; )
-      i /= 2;
-    r > i && (n = i, i = r, r = n), i -= r;
-  }
-  return e * r;
-}
-var f = t;
-export {
-  f as b
-};
-//# sourceMappingURL=binary_gcd.js.map

package/dist/node_modules/@stdlib/math-base-special-gcd/lib/binary_gcd.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"binary_gcd.js","sources":["../../../../../node_modules/@stdlib/math-base-special-gcd/lib/binary_gcd.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* Computes the greatest common divisor (gcd) using the binary GCD algorithm.\n*\n* ## References\n*\n* -   Stein, Josef. 1967. \"Computational problems associated with Racah algebra.\" _Journal of Computational Physics_ 1 (3): 397–405. doi:[10.1016/0021-9991(67)90047-2][@stein:1967].\n*\n* [@stein:1967]: https://doi.org/10.1016/0021-9991(67)90047-2\n*\n* @private\n* @param {integer} a - integer\n* @param {integer} b - integer\n* @returns {integer} greatest common divisor\n*\n* @example\n* var v = gcd( 1.2676506002282294e+30, 9007199254740992 );\n* // returns 9007199254740992\n*/\nfunction gcd( a, b ) {\n\tvar k = 1;\n\tvar t;\n\n\t// Simple cases:\n\tif ( a === 0 ) {\n\t\treturn b;\n\t}\n\tif ( b === 0 ) {\n\t\treturn a;\n\t}\n\t// Reduce `a` and/or `b` to odd numbers and keep track of the greatest power of 2 dividing both `a` and `b`...\n\twhile ( a%2 === 0 && b%2 === 0 ) {\n\t\ta /= 2; // right shift\n\t\tb /= 2; // right shift\n\t\tk *= 2; // left shift\n\t}\n\t// Reduce `a` to an odd number...\n\twhile ( a%2 === 0 ) {\n\t\ta /= 2; // right shift\n\t}\n\t// Henceforth, `a` is always odd...\n\twhile ( b ) {\n\t\t// Remove all factors of 2 in `b`, as they are not common...\n\t\twhile ( b%2 === 0 ) {\n\t\t\tb /= 2; // right shift\n\t\t}\n\t\t// `a` and `b` are both odd. Swap values such that `b` is the larger of the two values, and then set `b` to the difference (which is even)...\n\t\tif ( a > b ) {\n\t\t\tt = b;\n\t\t\tb = a;\n\t\t\ta = t;\n\t\t}\n\t\tb -= a; // b=0 iff b=a\n\t}\n\t// Restore common factors of 2...\n\treturn k * a;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gcd;\n"],"names":["gcd","a","b","k","t","binary_gcd"],"mappings":";;;;;;;;;;;;;;;;;AAsCA,SAASA,EAAKC,GAAGC,GAAI;AACpB,MAAIC,IAAI,GACJC;AAGJ,MAAKH,MAAM;AACV,WAAOC;AAER,MAAKA,MAAM;AACV,WAAOD;AAGR,SAAQA,IAAE,MAAM,KAAKC,IAAE,MAAM;AAC5B,IAAAD,KAAK,GACLC,KAAK,GACLC,KAAK;AAGN,SAAQF,IAAE,MAAM;AACf,IAAAA,KAAK;AAGN,SAAQC,KAAI;AAEX,WAAQA,IAAE,MAAM;AACf,MAAAA,KAAK;AAGN,IAAKD,IAAIC,MACRE,IAAIF,GACJA,IAAID,GACJA,IAAIG,IAELF,KAAKD;AAAA,EACP;AAEC,SAAOE,IAAIF;AACZ;AAKA,IAAAI,IAAiBL;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/math-base-special-gcd/lib/bitwise_binary_gcd.js

@@ -1,39 +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.
-*/
-function n(i, r) {
-  var e = 0, t;
-  if (i === 0)
-    return r;
-  if (r === 0)
-    return i;
-  for (; !(i & 1) && !(r & 1); )
-    i >>>= 1, r >>>= 1, e += 1;
-  for (; !(i & 1); )
-    i >>>= 1;
-  for (; r; ) {
-    for (; !(r & 1); )
-      r >>>= 1;
-    i > r && (t = r, r = i, i = t), r -= i;
-  }
-  return i << e;
-}
-var w = n;
-export {
-  w as b
-};
-//# sourceMappingURL=bitwise_binary_gcd.js.map

package/dist/node_modules/@stdlib/math-base-special-gcd/lib/bitwise_binary_gcd.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bitwise_binary_gcd.js","sources":["../../../../../node_modules/@stdlib/math-base-special-gcd/lib/bitwise_binary_gcd.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* Computes the greatest common divisor (gcd) using the binary GCD algorithm and bitwise operations.\n*\n* ## References\n*\n* -   Stein, Josef. 1967. \"Computational problems associated with Racah algebra.\" _Journal of Computational Physics_ 1 (3): 397–405. doi:[10.1016/0021-9991(67)90047-2][@stein:1967].\n*\n* [@stein:1967]: https://doi.org/10.1016/0021-9991(67)90047-2\n*\n* @private\n* @param {integer32} a - integer\n* @param {integer32} b - integer\n* @returns {integer32} greatest common divisor\n*\n* @example\n* var v = gcd( 48, 18 );\n* // returns 6\n*/\nfunction gcd( a, b ) {\n\tvar k = 0;\n\tvar t;\n\n\t// Simple cases:\n\tif ( a === 0 ) {\n\t\treturn b;\n\t}\n\tif ( b === 0 ) {\n\t\treturn a;\n\t}\n\t// Reduce `a` and/or `b` to odd numbers and keep track of the greatest power of 2 dividing both `a` and `b`...\n\twhile ( (a & 1) === 0 && (b & 1) === 0 ) {\n\t\ta >>>= 1; // right shift\n\t\tb >>>= 1; // right shift\n\t\tk += 1;\n\t}\n\t// Reduce `a` to an odd number...\n\twhile ( (a & 1) === 0 ) {\n\t\ta >>>= 1; // right shift\n\t}\n\t// Henceforth, `a` is always odd...\n\twhile ( b ) {\n\t\t// Remove all factors of 2 in `b`, as they are not common...\n\t\twhile ( (b & 1) === 0 ) {\n\t\t\tb >>>= 1; // right shift\n\t\t}\n\t\t// `a` and `b` are both odd. Swap values such that `b` is the larger of the two values, and then set `b` to the difference (which is even)...\n\t\tif ( a > b ) {\n\t\t\tt = b;\n\t\t\tb = a;\n\t\t\ta = t;\n\t\t}\n\t\tb -= a; // b=0 iff b=a\n\t}\n\t// Restore common factors of 2...\n\treturn a << k;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gcd;\n"],"names":["gcd","a","b","k","bitwise_binary_gcd"],"mappings":";;;;;;;;;;;;;;;;;AAsCA,SAASA,EAAKC,GAAGC,GAAI;AACpB,MAAIC,IAAI,GACJ;AAGJ,MAAKF,MAAM;AACV,WAAOC;AAER,MAAKA,MAAM;AACV,WAAOD;AAGR,SAAS,EAAAA,IAAI,MAAa,EAAAC,IAAI;AAC7B,IAAAD,OAAO,GACPC,OAAO,GACPC,KAAK;AAGN,SAAS,EAAAF,IAAI;AACZ,IAAAA,OAAO;AAGR,SAAQC,KAAI;AAEX,WAAS,EAAAA,IAAI;AACZ,MAAAA,OAAO;AAGR,IAAKD,IAAIC,MACR,IAAIA,GACJA,IAAID,GACJA,IAAI,IAELC,KAAKD;AAAA,EACP;AAEC,SAAOA,KAAKE;AACb;AAKA,IAAAC,IAAiBJ;","x_google_ignoreList":[0]}

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

@@ -1,23 +0,0 @@
-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-gcd/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/@stdlib/math-base-special-gcd/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* Compute the greatest common divisor (gcd).\n*\n* @module @stdlib/math-base-special-gcd\n*\n* @example\n* var gcd = require( '@stdlib/math-base-special-gcd' );\n*\n* var v = gcd( 48, 18 );\n* // returns 6\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":";;;;;;;;;;;;;;;;;;AAkCA,IAAIA,IAAOC,GAKXC,IAAiBF;","x_google_ignoreList":[0]}

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

@@ -1,33 +0,0 @@
-import { l as n } from "../../math-base-assert-is-nan/lib/index.js";
-import { l as e } from "../../math-base-assert-is-integer/lib/index.js";
-import { l as s } from "../../constants-float64-pinf/lib/index.js";
-import { l } from "../../constants-float64-ninf/lib/index.js";
-import { l as N } from "../node_modules/@stdlib/constants-int32-max/lib/index.js";
-import { b as p } from "./bitwise_binary_gcd.js";
-import { b as v } from "./binary_gcd.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 t = n, m = e, o = s, a = l, f = N, g = p, u = v;
-function I(r, i) {
-  return t(r) || t(i) ? NaN : r === o || i === o || r === a || i === a ? NaN : m(r) && m(i) ? (r < 0 && (r = -r), i < 0 && (i = -i), r <= f && i <= f ? g(r, i) : u(r, i)) : NaN;
-}
-var F = I;
-export {
-  F as m
-};
-//# sourceMappingURL=main.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../node_modules/@stdlib/math-base-special-gcd/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 isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar isInteger = require( '@stdlib/math-base-assert-is-integer' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar INT32_MAX = require( '@stdlib/constants-int32-max' );\nvar bitwise = require( './bitwise_binary_gcd.js' );\nvar largeIntegers = require( './binary_gcd.js' );\n\n\n// MAIN //\n\n/**\n* Computes the greatest common divisor (gcd).\n*\n* @param {integer} a - integer\n* @param {integer} b - integer\n* @returns {integer} greatest common divisor\n*\n* @example\n* var v = gcd( 48, 18 );\n* // returns 6\n*\n* @example\n* var v = gcd( 3.14, 18 );\n* // returns NaN\n*\n* @example\n* var v = gcd( NaN, 18 );\n* // returns NaN\n*/\nfunction gcd( a, b ) {\n\tif ( isnan( a ) || isnan( b ) ) {\n\t\treturn NaN;\n\t}\n\tif (\n\t\ta === PINF ||\n\t\tb === PINF ||\n\t\ta === NINF ||\n\t\tb === NINF\n\t) {\n\t\treturn NaN;\n\t}\n\tif ( !( isInteger( a ) && isInteger( b ) ) ) {\n\t\treturn NaN;\n\t}\n\tif ( a < 0 ) {\n\t\ta = -a;\n\t}\n\tif ( b < 0 ) {\n\t\tb = -b;\n\t}\n\tif ( a <= INT32_MAX && b <= INT32_MAX ) {\n\t\treturn bitwise( a, b );\n\t}\n\treturn largeIntegers( a, b );\n}\n\n\n// EXPORTS //\n\nmodule.exports = gcd;\n"],"names":["isnan","require$$0","isInteger","require$$1","PINF","require$$2","NINF","require$$3","INT32_MAX","require$$4","bitwise","require$$5","largeIntegers","require$$6","gcd","a","b","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAsBA,IAAIA,IAAQC,GACRC,IAAYC,GACZC,IAAOC,GACPC,IAAOC,GACPC,IAAYC,GACZC,IAAUC,GACVC,IAAgBC;AAwBpB,SAASC,EAAKC,GAAGC,GAAI;AACpB,SAAKhB,EAAOe,CAAC,KAAMf,EAAOgB,CAAC,IACnB,MAGPD,MAAMX,KACNY,MAAMZ,KACNW,MAAMT,KACNU,MAAMV,IAEC,MAEAJ,EAAWa,CAAC,KAAMb,EAAWc,CAAC,KAGjCD,IAAI,MACRA,IAAI,CAACA,IAEDC,IAAI,MACRA,IAAI,CAACA,IAEDD,KAAKP,KAAaQ,KAAKR,IACpBE,EAASK,GAAGC,CAAC,IAEdJ,EAAeG,GAAGC,CAAC,KAXlB;AAYT;AAKA,IAAAC,IAAiBH;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/math-base-special-gcd/node_modules/@stdlib/constants-int32-max/lib/index.js

@@ -1,22 +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.
-*/
-var a = 2147483647, r = a;
-export {
-  r as l
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/@stdlib/math-base-special-gcd/node_modules/@stdlib/constants-int32-max/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-gcd/node_modules/@stdlib/constants-int32-max/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* Maximum signed 32-bit integer.\n*\n* @module @stdlib/constants-int32-max\n* @type {integer32}\n*\n* @example\n* var INT32_MAX = require( '@stdlib/constants-int32-max' );\n* // returns 2147483647\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{31} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 01111111111111111111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 2147483647\n*/\nvar INT32_MAX = 2147483647|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = INT32_MAX;\n"],"names":["INT32_MAX","lib"],"mappings":";;;;;;;;;;;;;;;;;AAuDA,IAAIA,IAAY,YAKhBC,IAAiBD;","x_google_ignoreList":[0]}

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

@@ -1,47 +0,0 @@
-import { l as h } from "../../math-base-assert-is-nan/lib/index.js";
-import { l as j } from "../../math-base-special-expm1/lib/index.js";
-import { l as G } from "../../math-base-special-floor/lib/index.js";
-import { l as J } from "../../math-base-special-log1p/lib/index.js";
-import { l as K } from "../../math-base-special-asin/lib/index.js";
-import { l as Q } from "../../math-base-special-beta/lib/index.js";
-import { l as U } from "../../math-base-special-sqrt/lib/index.js";
-import { l as W } from "../../math-base-special-exp/lib/index.js";
-import { l as Y } from "../../math-base-special-pow/lib/index.js";
-import { l as Z } from "../../math-base-special-max/lib/index.js";
-import { l as e } from "../../math-base-special-min/lib/index.js";
-import { l as a } from "../../constants-float64-max/lib/index.js";
-import { l as b } from "../../constants-float64-smallest-normal/lib/index.js";
-import { l as g } from "../../constants-int32-max/lib/index.js";
-import { l as d } from "../../constants-float64-half-pi/lib/index.js";
-import { l as p } from "../../constants-float64-pi/lib/index.js";
-import { b as z } from "./beta_small_b_large_a_series.js";
-import { r as x } from "./rising_factorial_ratio.js";
-import { i as u } from "./ibeta_power_terms.js";
-import { i as f0 } from "./ibeta_fraction2.js";
-import { b as i0 } from "./binomial_ccdf.js";
-import { i as s0 } from "./ibeta_a_step.js";
-import { i as m0 } from "./ibeta_series.js";
-var l0 = h, v0 = j, T = G, k = J, q = K, A = Q, E = U, n0 = W, P = Y, _0 = Z, y = e, o = a, B = b, N0 = g, $0 = d, H = p, O = z, R = x, r0 = u, D = f0, c0 = i0, S = s0, t = m0, A0 = 1 / H;
-function F0(m, f, i, n, _, s, V, X) {
-  var w, F, l, I, M, N, r, $, C, c, L, v;
-  if (v = 1 - m, r = X, $ = X + V, s[$] = -1, l0(m) || m < 0 || m > 1)
-    return s[r] = NaN, s[$] = NaN, s;
-  if (n) {
-    if (f < 0 || i < 0)
-      return s[r] = NaN, s[$] = NaN, s;
-    if (f === 0) {
-      if (i === 0)
-        return s[r] = NaN, s[$] = NaN, s;
-      if (i > 0)
-        return s[r] = _ ? 0 : 1, s;
-    } else if (i === 0 && f > 0)
-      return s[r] = _ ? 1 : 0, s;
-  } else if (f <= 0 || i <= 0)
-    return s[r] = NaN, s[$] = NaN, s;
-  return m === 0 ? (f === 1 ? s[$] = 1 : s[$] = f < 1 ? o / 2 : B * 2, _ ? (s[r] = n ? 1 : A(f, i), s) : (s[r] = 0, s)) : m === 1 ? (i === 1 ? s[$] = 1 : s[$] = i < 1 ? o / 2 : B * 2, _ ? s[r] = 0 : s[r] = n ? 1 : A(f, i), s) : f === 0.5 && i === 0.5 ? (s[$] = A0 * E(v * m), L = q(E(_ ? v : m)), L /= $0, n || (L *= H), s[r] = L, s) : (f === 1 && (N = i, i = f, f = N, N = v, v = m, m = N, _ = !_), i === 1 ? f === 1 ? (s[r] = _ ? v : m, s[$] = 1, s) : (s[$] = f * P(m, f - 1), v < 0.5 ? L = _ ? -v0(f * k(-v)) : n0(f * k(-v)) : L = _ ? -(P(m, f) - 1) : P(m, f), n || (L /= f), s[r] = L, s) : (y(f, i) <= 1 ? (m > 0.5 && (N = i, i = f, f = N, N = v, v = m, m = N, _ = !_), _0(f, i) <= 1 ? f >= y(0.2, i) || P(m, f) <= 0.9 ? _ ? (l = -(n ? 1 : A(f, i)), _ = !1, l = -t(f, i, m, l, n, s, v)) : l = t(f, i, m, 0, n, s, v) : (N = i, i = f, f = N, N = v, v = m, m = N, _ = !_, v >= 0.3 ? _ ? (l = -(n ? 1 : A(f, i)), _ = !1, l = -t(f, i, m, l, n, s, v)) : l = t(f, i, m, 0, n, s, v) : (n ? F = 1 : F = R(f + i, f, 20), l = S(f, i, m, v, 20, n, s), _ ? (l -= n ? 1 : A(f, i), _ = !1, l = -O(f + 20, i, m, v, l, F, n)) : l = O(f + 20, i, m, v, l, F, n))) : i <= 1 || m < 0.1 && P(i * m, f) <= 0.7 ? _ ? (l = -(n ? 1 : A(f, i)), _ = !1, l = -t(f, i, m, l, n, s, v)) : l = t(f, i, m, 0, n, s, v) : (N = i, i = f, f = N, N = v, v = m, m = N, _ = !_, v >= 0.3 ? _ ? (l = -(n ? 1 : A(f, i)), _ = !1, l = -t(f, i, m, l, n, s, v)) : l = t(f, i, m, 0, n, s, v) : f >= 15 ? _ ? (l = -(n ? 1 : A(f, i)), _ = !1, l = -O(f, i, m, v, l, 1, n)) : l = O(f, i, m, v, 0, 1, n) : (n ? F = 1 : F = R(f + i, f, 20), l = S(f, i, m, v, 20, n, s), _ ? (l -= n ? 1 : A(f, i), _ = !1, l = -O(f + 20, i, m, v, l, F, n)) : l = O(f + 20, i, m, v, l, F, n)))) : (f < i ? w = f - (f + i) * m : w = (f + i) * v - i, w < 0 && (N = i, i = f, f = N, N = v, v = m, m = N, _ = !_), i < 40 ? T(f) === f && T(i) === i && f < N0 - 100 ? (C = f - 1, c = i + C, l = c0(c, C, m, v), n || (l *= A(f, i))) : i * m <= 0.7 ? _ ? (l = -(n ? 1 : A(f, i)), _ = !1, l = -t(f, i, m, l, n, s, v)) : l = t(f, i, m, 0, n, s, v) : f > 15 ? (c = T(i), c === i && (c -= 1), I = i - c, n ? F = 1 : F = R(f + I, I, c), l = S(I, f, v, m, c, n), l = O(f, I, m, v, l, 1, n), l /= F) : n ? (c = T(i), I = i - c, I <= 0 && (c -= 1, I += 1), l = S(I, f, v, m, c, n), l += S(f, I, m, v, 20, n), _ && (l -= 1), l = O(f + 20, I, m, v, l, 1, n), _ && (l = -l, _ = !1)) : l = D(f, i, m, v, n, s) : l = D(f, i, m, v, n, s)), s[$] < 0 && (s[$] = r0(f, i, m, v, !0)), M = v * m, s[$] !== 0 && (o * M < s[$] ? s[$] = o / 2 : s[$] /= M), s[r] = _ ? (n ? 1 : A(f, i)) - l : l, s));
-}
-var G0 = F0;
-export {
-  G0 as a
-};
-//# sourceMappingURL=assign.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"assign.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/assign.js"],"sourcesContent":["/* eslint-disable max-statements, max-lines */\n\n/**\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* (C) 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 isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar expm1 = require( '@stdlib/math-base-special-expm1' );\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar log1p = require( '@stdlib/math-base-special-log1p' );\nvar asin = require( '@stdlib/math-base-special-asin' );\nvar beta = require( '@stdlib/math-base-special-beta' );\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 max = require( '@stdlib/math-base-special-max' );\nvar min = require( '@stdlib/math-base-special-min' );\nvar MAX_FLOAT64 = require( '@stdlib/constants-float64-max' );\nvar MIN_FLOAT64 = require( '@stdlib/constants-float64-smallest-normal' );\nvar MAX_INT32 = require( '@stdlib/constants-int32-max' );\nvar HALF_PI = require( '@stdlib/constants-float64-half-pi' );\nvar PI = require( '@stdlib/constants-float64-pi' );\nvar betaSmallBLargeASeries = require( './beta_small_b_large_a_series.js' );\nvar risingFactorialRatio = require( './rising_factorial_ratio.js' );\nvar ibetaPowerTerms = require( './ibeta_power_terms.js' );\nvar ibetaFraction2 = require( './ibeta_fraction2.js' );\nvar binomialCCDF = require( './binomial_ccdf.js' );\nvar ibetaAStep = require( './ibeta_a_step.js' );\nvar ibetaSeries = require( './ibeta_series.js' );\n\n\n// VARIABLES //\n\nvar ONE_OVER_PI = 1.0 / PI;\n\n\n// MAIN //\n\n/**\n* Evaluates the incomplete beta function and its first derivative and assigns results to a provided output array.\n*\n* ## Notes\n*\n* -   This function divides up the input range and selects the right implementation method for each domain.\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* @param {(Array|TypedArray|Object)} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {(Array|TypedArray|Object)} function value and first derivative\n*\n* @example\n* var out = ibetaImp( 0.5, 2.0, 2.0, false, false, [ 0.0, 0.0 ], 1, 0 );\n* // returns [ ~0.083, ~1.5 ]\n*\n* @example\n* var out = ibetaImp( 0.2, 1.0, 2.0, false, true, [ 0.0, 0.0 ], 1, 0 );\n* // returns [ 0.32, 1.6 ]\n*\n* @example\n* var out = ibetaImp( 0.2, 1.0, 2.0, true, true, [ 0.0, 0.0 ], 1, 0 );\n* // returns [ 0.64, 1.6 ]\n*/\nfunction ibetaImp( x, a, b, regularized, upper, out, stride, offset ) {\n\tvar lambda;\n\tvar prefix;\n\tvar fract;\n\tvar bbar;\n\tvar div;\n\tvar tmp;\n\tvar i0;\n\tvar i1;\n\tvar k;\n\tvar n;\n\tvar p;\n\tvar y;\n\n\ty = 1.0 - x;\n\ti0 = offset;\n\ti1 = offset + stride;\n\n\t// Derivative not set...\n\tout[ i1 ] = -1;\n\tif ( isnan( x ) || x < 0.0 || x > 1.0 ) {\n\t\tout[ i0 ] = NaN;\n\t\tout[ i1 ] = NaN;\n\t\treturn out;\n\t}\n\tif ( regularized ) {\n\t\tif ( a < 0.0 || b < 0.0 ) {\n\t\t\tout[ i0 ] = NaN;\n\t\t\tout[ i1 ] = NaN;\n\t\t\treturn out;\n\t\t}\n\t\t// Extend to a few very special cases...\n\t\tif ( a === 0.0 ) {\n\t\t\tif ( b === 0.0 ) {\n\t\t\t\tout[ i0 ] = NaN;\n\t\t\t\tout[ i1 ] = NaN;\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\tif ( b > 0.0 ) {\n\t\t\t\tout[ i0 ] = ( upper ) ? 0.0 : 1.0;\n\t\t\t\treturn out;\n\t\t\t}\n\t\t} else if ( b === 0.0 ) {\n\t\t\tif ( a > 0.0 ) {\n\t\t\t\tout[ i0 ] = ( upper ) ? 1.0 : 0.0;\n\t\t\t\treturn out;\n\t\t\t}\n\t\t}\n\t} else if ( a <= 0.0 || b <= 0.0 ) {\n\t\tout[ i0 ] = NaN;\n\t\tout[ i1 ] = NaN;\n\t\treturn out;\n\t}\n\tif ( x === 0.0 ) {\n\t\tif ( a === 1.0 ) {\n\t\t\tout[ i1 ] = 1.0;\n\t\t} else {\n\t\t\tout[ i1 ] = ( a < 1.0 ) ? MAX_FLOAT64 / 2.0 : MIN_FLOAT64 * 2.0;\n\t\t}\n\t\tif ( upper ) {\n\t\t\tout[ i0 ] = ( regularized ) ? 1.0 : beta( a, b );\n\t\t\treturn out;\n\t\t}\n\t\tout[ i0 ] = 0.0;\n\t\treturn out;\n\t}\n\tif ( x === 1.0 ) {\n\t\tif ( b === 1.0 ) {\n\t\t\tout[ i1 ] = 1.0;\n\t\t} else {\n\t\t\tout[ i1 ] = ( b < 1.0 ) ? MAX_FLOAT64 / 2.0 : MIN_FLOAT64 * 2.0;\n\t\t}\n\t\tif ( upper ) {\n\t\t\tout[ i0 ] = 0.0;\n\t\t} else {\n\t\t\tout[ i0 ] = ( regularized ) ? 1.0 : beta( a, b );\n\t\t}\n\t\treturn out;\n\t}\n\tif ( a === 0.5 && b === 0.5 ) {\n\t\tout[ i1 ] = ONE_OVER_PI * sqrt( y * x );\n\n\t\t// We have an arcsine distribution:\n\t\tp = ( upper ) ? asin( sqrt(y) ) : asin( sqrt(x) );\n\t\tp /= HALF_PI;\n\t\tif ( !regularized ) {\n\t\t\tp *= PI;\n\t\t}\n\t\tout[ i0 ] = p;\n\t\treturn out;\n\t}\n\tif ( a === 1.0 ) {\n\t\ttmp = b;\n\t\tb = a;\n\t\ta = tmp;\n\n\t\ttmp = y;\n\t\ty = x;\n\t\tx = tmp;\n\n\t\tupper = !upper;\n\t}\n\tif ( b === 1.0 ) {\n\t\t// Special case see: http://functions.wolfram.com/GammaBetaErf/BetaRegularized/03/01/01/\n\t\tif ( a === 1.0 ) {\n\t\t\tout[ i0 ] = ( upper ) ? y : x;\n\t\t\tout[ i1 ] = 1.0;\n\t\t\treturn out;\n\t\t}\n\t\tout[ i1 ] = a * pow( x, a - 1.0 );\n\t\tif ( y < 0.5 ) {\n\t\t\tp = ( upper ) ? -expm1( a * log1p(-y) ) : exp( a * log1p(-y) );\n\t\t} else {\n\t\t\tp = ( upper ) ? -( pow( x, a ) - 1.0 ) : pow( x, a );\n\t\t}\n\t\tif ( !regularized ) {\n\t\t\tp /= a;\n\t\t}\n\t\tout[ i0 ] = p;\n\t\treturn out;\n\t}\n\tif ( min( a, b ) <= 1.0 ) {\n\t\tif ( x > 0.5 ) {\n\t\t\ttmp = b;\n\t\t\tb = a;\n\t\t\ta = tmp;\n\n\t\t\ttmp = y;\n\t\t\ty = x;\n\t\t\tx = tmp;\n\n\t\t\tupper = !upper;\n\t\t}\n\t\tif ( max( a, b ) <= 1.0 ) {\n\t\t\t// Both a,b < 1:\n\t\t\tif ( (a >= min( 0.2, b ) ) || ( pow(x, a) <= 0.9 ) ) {\n\t\t\t\tif ( upper ) {\n\t\t\t\t\tfract = -( ( regularized ) ? 1.0 : beta( a, b ) );\n\t\t\t\t\tupper = false;\n\t\t\t\t\tfract = -ibetaSeries( a, b, x, fract, regularized, out, y );\n\t\t\t\t} else {\n\t\t\t\t\tfract = ibetaSeries( a, b, x, 0, regularized, out, y );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\ttmp = b;\n\t\t\t\tb = a;\n\t\t\t\ta = tmp;\n\n\t\t\t\ttmp = y;\n\t\t\t\ty = x;\n\t\t\t\tx = tmp;\n\n\t\t\t\tupper = !upper;\n\t\t\t\tif ( y >= 0.3 ) {\n\t\t\t\t\tif ( upper ) {\n\t\t\t\t\t\tfract = -( ( regularized ) ? 1.0 : beta( a, b ) );\n\t\t\t\t\t\tupper = false;\n\t\t\t\t\t\tfract = -ibetaSeries( a, b, x, fract, regularized, out, y ); // eslint-disable-line max-len\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfract = ibetaSeries( a, b, x, 0, regularized, out, y );\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\t// Sidestep on a, and then use the series representation:\n\t\t\t\t\tif ( regularized ) {\n\t\t\t\t\t\tprefix = 1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tprefix = risingFactorialRatio( a + b, a, 20 );\n\t\t\t\t\t}\n\t\t\t\t\tfract = ibetaAStep( a, b, x, y, 20, regularized, out );\n\t\t\t\t\tif ( upper ) {\n\t\t\t\t\t\tfract -= ( ( regularized ) ? 1 : beta( a, b ) );\n\t\t\t\t\t\tupper = false;\n\t\t\t\t\t\tfract = -betaSmallBLargeASeries( a + 20.0, b, x, y, fract, prefix, regularized ); // eslint-disable-line max-len\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfract = betaSmallBLargeASeries( a + 20.0, b, x, y, fract, prefix, regularized ); // eslint-disable-line max-len\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else if ( b <= 1.0 || ( x < 0.1 && ( pow( b * x, a ) <= 0.7 ) ) ) {\n\t\t\tif ( upper ) {\n\t\t\t\tfract = -( ( regularized ) ? 1 : beta( a, b ) );\n\t\t\t\tupper = false;\n\t\t\t\tfract = -ibetaSeries( a, b, x, fract, regularized, out, y );\n\t\t\t} else {\n\t\t\t\tfract = ibetaSeries( a, b, x, 0.0, regularized, out, y );\n\t\t\t}\n\t\t} else {\n\t\t\ttmp = b;\n\t\t\tb = a;\n\t\t\ta = tmp;\n\n\t\t\ttmp = y;\n\t\t\ty = x;\n\t\t\tx = tmp;\n\t\t\tupper = !upper;\n\n\t\t\tif ( y >= 0.3 ) {\n\t\t\t\tif (upper) {\n\t\t\t\t\tfract = -(( regularized ) ? 1.0 : beta( a, b ));\n\t\t\t\t\tupper = false;\n\t\t\t\t\tfract = -ibetaSeries( a, b, x, fract, regularized, out, y );\n\t\t\t\t} else {\n\t\t\t\t\tfract = ibetaSeries( a, b, x, 0.0, regularized, out, y );\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ( a >= 15.0 ) {\n\t\t\t\tif ( upper ) {\n\t\t\t\t\tfract = -(( regularized ) ? 1.0 : beta( a, b ));\n\t\t\t\t\tupper = false;\n\t\t\t\t\tfract = -betaSmallBLargeASeries( a, b, x, y, fract, 1.0, regularized ); // eslint-disable-line max-len\n\t\t\t\t} else {\n\t\t\t\t\tfract = betaSmallBLargeASeries( a, b, x, y, 0.0, 1.0, regularized ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif ( regularized ) {\n\t\t\t\t\tprefix = 1;\n\t\t\t\t} else {\n\t\t\t\t\t// Sidestep to improve errors:\n\t\t\t\t\tprefix = risingFactorialRatio( a + b, a, 20.0 );\n\t\t\t\t}\n\t\t\t\tfract = ibetaAStep( a, b, x, y, 20.0, regularized, out );\n\t\t\t\tif ( upper ) {\n\t\t\t\t\tfract -= ( ( regularized ) ? 1.0 : beta( a, b ) );\n\t\t\t\t\tupper = false;\n\t\t\t\t\tfract = -betaSmallBLargeASeries( a + 20.0, b, x, y, fract, prefix, regularized ); // eslint-disable-line max-len\n\t\t\t\t} else {\n\t\t\t\t\tfract = betaSmallBLargeASeries( a + 20.0, b, x, y, fract, prefix, regularized ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\t// Both a,b >= 1:\n\t\tif ( a < b ) {\n\t\t\tlambda = a - ( (a + b) * x );\n\t\t} else {\n\t\t\tlambda = ( (a + b) * y ) - b;\n\t\t}\n\t\tif ( lambda < 0.0 ) {\n\t\t\ttmp = b;\n\t\t\tb = a;\n\t\t\ta = tmp;\n\n\t\t\ttmp = y;\n\t\t\ty = x;\n\t\t\tx = tmp;\n\t\t\tupper = !upper;\n\t\t}\n\t\tif ( b < 40.0 ) {\n\t\t\tif (\n\t\t\t\tfloor(a) === a &&\n\t\t\t\tfloor(b) === b &&\n\t\t\t\ta < MAX_INT32 - 100\n\t\t\t) {\n\t\t\t\t// Relate to the binomial distribution and use a finite sum:\n\t\t\t\tk = a - 1.0;\n\t\t\t\tn = b + k;\n\t\t\t\tfract = binomialCCDF( n, k, x, y );\n\t\t\t\tif ( !regularized ) {\n\t\t\t\t\tfract *= beta( a, b );\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ( b * x <= 0.7 ) {\n\t\t\t\tif ( upper ) {\n\t\t\t\t\tfract = -( ( regularized ) ? 1.0 : beta( a, b ) );\n\t\t\t\t\tupper = false;\n\t\t\t\t\tfract = -ibetaSeries( a, b, x, fract, regularized, out, y );\n\t\t\t\t} else {\n\t\t\t\t\tfract = ibetaSeries( a, b, x, 0.0, regularized, out, y );\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ( a > 15.0 ) {\n\t\t\t\t// Sidestep so we can use the series representation:\n\t\t\t\tn = floor( b );\n\t\t\t\tif ( n === b ) {\n\t\t\t\t\tn -= 1;\n\t\t\t\t}\n\t\t\t\tbbar = b - n;\n\t\t\t\tif ( regularized ) {\n\t\t\t\t\tprefix = 1;\n\t\t\t\t} else {\n\t\t\t\t\tprefix = risingFactorialRatio( a + bbar, bbar, n );\n\t\t\t\t}\n\t\t\t\tfract = ibetaAStep( bbar, a, y, x, n, regularized );\n\t\t\t\tfract = betaSmallBLargeASeries( a, bbar, x, y, fract, 1.0, regularized ); // eslint-disable-line max-len\n\t\t\t\tfract /= prefix;\n\t\t\t}\n\t\t\telse if ( regularized ) {\n\t\t\t\tn = floor( b );\n\t\t\t\tbbar = b - n;\n\t\t\t\tif ( bbar <= 0 ) {\n\t\t\t\t\tn -= 1;\n\t\t\t\t\tbbar += 1;\n\t\t\t\t}\n\t\t\t\tfract = ibetaAStep( bbar, a, y, x, n, regularized );\n\t\t\t\tfract += ibetaAStep( a, bbar, x, y, 20.0, regularized );\n\t\t\t\tif ( upper ) {\n\t\t\t\t\tfract -= 1;\n\t\t\t\t}\n\t\t\t\tfract = betaSmallBLargeASeries( a + 20.0, bbar, x, y, fract, 1, regularized ); // eslint-disable-line max-len\n\t\t\t\tif ( upper ) {\n\t\t\t\t\tfract = -fract;\n\t\t\t\t\tupper = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfract = ibetaFraction2( a, b, x, y, regularized, out );\n\t\t\t}\n\t\t} else {\n\t\t\tfract = ibetaFraction2( a, b, x, y, regularized, out );\n\t\t}\n\t}\n\tif ( out[ i1 ] < 0.0 ) {\n\t\tout[ i1 ] = ibetaPowerTerms( a, b, x, y, true );\n\t}\n\tdiv = y * x;\n\tif ( out[ i1 ] !== 0.0 ) {\n\t\tif ( ( MAX_FLOAT64 * div < out[ i1 ] ) ) {\n\t\t\t// Overflow, return an arbitrarily large value:\n\t\t\tout[ i1 ] = MAX_FLOAT64 / 2.0;\n\t\t} else {\n\t\t\tout[ i1 ] /= div;\n\t\t}\n\t}\n\tout[ i0 ] = ( upper ) ? ( ( regularized ) ? 1.0 : beta( a, b ) ) - fract : fract; // eslint-disable-line max-len\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ibetaImp;\n"],"names":["isnan","require$$0","expm1","require$$1","floor","require$$2","log1p","require$$3","asin","require$$4","beta","require$$5","sqrt","require$$6","exp","require$$7","pow","require$$8","max","require$$9","min","require$$10","MAX_FLOAT64","require$$11","MIN_FLOAT64","require$$12","MAX_INT32","require$$13","HALF_PI","require$$14","PI","require$$15","betaSmallBLargeASeries","require$$16","risingFactorialRatio","require$$17","ibetaPowerTerms","require$$18","ibetaFraction2","require$$19","binomialCCDF","require$$20","ibetaAStep","require$$21","ibetaSeries","require$$22","ONE_OVER_PI","ibetaImp","x","a","b","regularized","upper","out","stride","offset","lambda","prefix","fract","bbar","div","tmp","i0","i1","k","n","p","y","assign"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAsCA,IAAIA,KAAQC,GACRC,KAAQC,GACRC,IAAQC,GACRC,IAAQC,GACRC,IAAOC,GACPC,IAAOC,GACPC,IAAOC,GACPC,KAAMC,GACNC,IAAMC,GACNC,KAAMC,GACNC,IAAMC,GACNC,IAAcC,GACdC,IAAcC,GACdC,KAAYC,GACZC,KAAUC,GACVC,IAAKC,GACLC,IAAyBC,GACzBC,IAAuBC,GACvBC,KAAkBC,GAClBC,IAAiBC,IACjBC,KAAeC,IACfC,IAAaC,IACbC,IAAcC,IAKdC,KAAc,IAAMhB;AAkCxB,SAASiB,GAAUC,GAAGC,GAAGC,GAAGC,GAAaC,GAAOC,GAAKC,GAAQC,GAAS;AACrE,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAQJ,MANAA,IAAI,IAAMnB,GACVc,IAAKP,GACLQ,IAAKR,IAASD,GAGdD,EAAKU,CAAE,IAAK,IACP/D,GAAOgD,CAAC,KAAMA,IAAI,KAAOA,IAAI;AACjC,WAAAK,EAAKS,CAAE,IAAK,KACZT,EAAKU,CAAE,IAAK,KACLV;AAER,MAAKF,GAAc;AAClB,QAAKF,IAAI,KAAOC,IAAI;AACnB,aAAAG,EAAKS,CAAE,IAAK,KACZT,EAAKU,CAAE,IAAK,KACLV;AAGR,QAAKJ,MAAM,GAAM;AAChB,UAAKC,MAAM;AACV,eAAAG,EAAKS,CAAE,IAAK,KACZT,EAAKU,CAAE,IAAK,KACLV;AAER,UAAKH,IAAI;AACR,eAAAG,EAAKS,CAAE,IAAOV,IAAU,IAAM,GACvBC;AAAA,IAEX,WAAcH,MAAM,KACZD,IAAI;AACR,aAAAI,EAAKS,CAAE,IAAOV,IAAU,IAAM,GACvBC;AAAA,EAGX,WAAaJ,KAAK,KAAOC,KAAK;AAC5B,WAAAG,EAAKS,CAAE,IAAK,KACZT,EAAKU,CAAE,IAAK,KACLV;AAER,SAAKL,MAAM,KACLC,MAAM,IACVI,EAAKU,CAAE,IAAK,IAEZV,EAAKU,CAAE,IAAOd,IAAI,IAAQ3B,IAAc,IAAME,IAAc,GAExD4B,KACJC,EAAKS,CAAE,IAAOX,IAAgB,IAAMzC,EAAMuC,GAAGC,CAAC,GACvCG,MAERA,EAAKS,CAAE,IAAK,GACLT,MAEHL,MAAM,KACLE,MAAM,IACVG,EAAKU,CAAE,IAAK,IAEZV,EAAKU,CAAE,IAAOb,IAAI,IAAQ5B,IAAc,IAAME,IAAc,GAExD4B,IACJC,EAAKS,CAAE,IAAK,IAEZT,EAAKS,CAAE,IAAOX,IAAgB,IAAMzC,EAAMuC,GAAGC,CAAC,GAExCG,KAEHJ,MAAM,OAAOC,MAAM,OACvBG,EAAKU,CAAE,IAAKjB,KAAclC,EAAMuD,IAAInB,CAAC,GAGrCkB,IAAgB1D,EAAMI,EAAhBwC,IAAqBe,IAAkBnB,CAAjB,CAAC,GAC7BkB,KAAKtC,IACCuB,MACLe,KAAKpC,IAENuB,EAAKS,CAAE,IAAKI,GACLb,MAEHJ,MAAM,MACVY,IAAMX,GACNA,IAAID,GACJA,IAAIY,GAEJA,IAAMM,GACNA,IAAInB,GACJA,IAAIa,GAEJT,IAAQ,CAACA,IAELF,MAAM,IAELD,MAAM,KACVI,EAAKS,CAAE,IAAOV,IAAUe,IAAInB,GAC5BK,EAAKU,CAAE,IAAK,GACLV,MAERA,EAAKU,CAAE,IAAKd,IAAIjC,EAAKgC,GAAGC,IAAI,CAAG,GAC1BkB,IAAI,MACRD,IAAMd,IAAU,CAAClD,GAAO+C,IAAI3C,EAAM,CAAC6D,CAAC,CAAC,IAAKrD,GAAKmC,IAAI3C,EAAM,CAAC6D,CAAC,CAAC,IAE5DD,IAAMd,IAAU,EAAGpC,EAAKgC,GAAGC,CAAC,IAAK,KAAQjC,EAAKgC,GAAGC,CAAC,GAE7CE,MACLe,KAAKjB,IAENI,EAAKS,CAAE,IAAKI,GACLb,MAEHjC,EAAK6B,GAAGC,CAAC,KAAM,KACdF,IAAI,QACRa,IAAMX,GACNA,IAAID,GACJA,IAAIY,GAEJA,IAAMM,GACNA,IAAInB,GACJA,IAAIa,GAEJT,IAAQ,CAACA,IAELlC,GAAK+B,GAAGC,CAAC,KAAM,IAEbD,KAAK7B,EAAK,KAAK8B,CAAC,KAAUlC,EAAIgC,GAAGC,CAAC,KAAK,MACvCG,KACJM,IAAQ,EAAKP,IAAgB,IAAMzC,EAAMuC,GAAGC,KAC5CE,IAAQ,IACRM,IAAQ,CAACd,EAAaK,GAAGC,GAAGF,GAAGU,GAAOP,GAAaE,GAAKc,CAAC,KAEzDT,IAAQd,EAAaK,GAAGC,GAAGF,GAAG,GAAGG,GAAaE,GAAKc,CAAC,KAGrDN,IAAMX,GACNA,IAAID,GACJA,IAAIY,GAEJA,IAAMM,GACNA,IAAInB,GACJA,IAAIa,GAEJT,IAAQ,CAACA,GACJe,KAAK,MACJf,KACJM,IAAQ,EAAKP,IAAgB,IAAMzC,EAAMuC,GAAGC,KAC5CE,IAAQ,IACRM,IAAQ,CAACd,EAAaK,GAAGC,GAAGF,GAAGU,GAAOP,GAAaE,GAAKc,MAExDT,IAAQd,EAAaK,GAAGC,GAAGF,GAAG,GAAGG,GAAaE,GAAKc,CAAC,KAIhDhB,IACJM,IAAS,IAETA,IAASvB,EAAsBe,IAAIC,GAAGD,GAAG,EAAE,GAE5CS,IAAQhB,EAAYO,GAAGC,GAAGF,GAAGmB,GAAG,IAAIhB,GAAaE,CAAG,GAC/CD,KACJM,KAAaP,IAAgB,IAAIzC,EAAMuC,GAAGC,IAC1CE,IAAQ,IACRM,IAAQ,CAAC1B,EAAwBiB,IAAI,IAAMC,GAAGF,GAAGmB,GAAGT,GAAOD,GAAQN,CAAW,KAE9EO,IAAQ1B,EAAwBiB,IAAI,IAAMC,GAAGF,GAAGmB,GAAGT,GAAOD,GAAQN,OAI1DD,KAAK,KAASF,IAAI,OAAShC,EAAKkC,IAAIF,GAAGC,MAAO,MACpDG,KACJM,IAAQ,EAAKP,IAAgB,IAAIzC,EAAMuC,GAAGC,KAC1CE,IAAQ,IACRM,IAAQ,CAACd,EAAaK,GAAGC,GAAGF,GAAGU,GAAOP,GAAaE,GAAKc,CAAC,KAEzDT,IAAQd,EAAaK,GAAGC,GAAGF,GAAG,GAAKG,GAAaE,GAAKc,CAAC,KAGvDN,IAAMX,GACNA,IAAID,GACJA,IAAIY,GAEJA,IAAMM,GACNA,IAAInB,GACJA,IAAIa,GACJT,IAAQ,CAACA,GAEJe,KAAK,MACLf,KACHM,IAAQ,EAAIP,IAAgB,IAAMzC,EAAMuC,GAAGC,KAC3CE,IAAQ,IACRM,IAAQ,CAACd,EAAaK,GAAGC,GAAGF,GAAGU,GAAOP,GAAaE,GAAKc,CAAC,KAEzDT,IAAQd,EAAaK,GAAGC,GAAGF,GAAG,GAAKG,GAAaE,GAAKc,CAAC,IAG9ClB,KAAK,KACTG,KACJM,IAAQ,EAAIP,IAAgB,IAAMzC,EAAMuC,GAAGC,KAC3CE,IAAQ,IACRM,IAAQ,CAAC1B,EAAwBiB,GAAGC,GAAGF,GAAGmB,GAAGT,GAAO,GAAKP,MAEzDO,IAAQ1B,EAAwBiB,GAAGC,GAAGF,GAAGmB,GAAG,GAAK,GAAKhB,MAIlDA,IACJM,IAAS,IAGTA,IAASvB,EAAsBe,IAAIC,GAAGD,GAAG,EAAI,GAE9CS,IAAQhB,EAAYO,GAAGC,GAAGF,GAAGmB,GAAG,IAAMhB,GAAaE,CAAG,GACjDD,KACJM,KAAaP,IAAgB,IAAMzC,EAAMuC,GAAGC,IAC5CE,IAAQ,IACRM,IAAQ,CAAC1B,EAAwBiB,IAAI,IAAMC,GAAGF,GAAGmB,GAAGT,GAAOD,GAAQN,CAAW,KAE9EO,IAAQ1B,EAAwBiB,IAAI,IAAMC,GAAGF,GAAGmB,GAAGT,GAAOD,GAAQN,SAMhEF,IAAIC,IACRM,IAASP,KAAOA,IAAIC,KAAKF,IAEzBQ,KAAYP,IAAIC,KAAKiB,IAAMjB,GAEvBM,IAAS,MACbK,IAAMX,GACNA,IAAID,GACJA,IAAIY,GAEJA,IAAMM,GACNA,IAAInB,GACJA,IAAIa,GACJT,IAAQ,CAACA,IAELF,IAAI,KAEP9C,EAAM6C,CAAC,MAAMA,KACb7C,EAAM8C,CAAC,MAAMA,KACbD,IAAIvB,KAAY,OAGhBsC,IAAIf,IAAI,GACRgB,IAAIf,IAAIc,GACRN,IAAQlB,GAAcyB,GAAGD,GAAGhB,GAAGmB,CAAC,GAC1BhB,MACLO,KAAShD,EAAMuC,GAAGC,CAAC,MAGXA,IAAIF,KAAK,MACbI,KACJM,IAAQ,EAAKP,IAAgB,IAAMzC,EAAMuC,GAAGC,KAC5CE,IAAQ,IACRM,IAAQ,CAACd,EAAaK,GAAGC,GAAGF,GAAGU,GAAOP,GAAaE,GAAKc,CAAC,KAEzDT,IAAQd,EAAaK,GAAGC,GAAGF,GAAG,GAAKG,GAAaE,GAAKc,CAAC,IAG9ClB,IAAI,MAEbgB,IAAI7D,EAAO8C,CAAC,GACPe,MAAMf,MACVe,KAAK,IAENN,IAAOT,IAAIe,GACNd,IACJM,IAAS,IAETA,IAASvB,EAAsBe,IAAIU,GAAMA,GAAMM,CAAC,GAEjDP,IAAQhB,EAAYiB,GAAMV,GAAGkB,GAAGnB,GAAGiB,GAAGd,CAAW,GACjDO,IAAQ1B,EAAwBiB,GAAGU,GAAMX,GAAGmB,GAAGT,GAAO,GAAKP,IAC3DO,KAASD,KAEAN,KACTc,IAAI7D,EAAO8C,CAAC,GACZS,IAAOT,IAAIe,GACNN,KAAQ,MACZM,KAAK,GACLN,KAAQ,IAETD,IAAQhB,EAAYiB,GAAMV,GAAGkB,GAAGnB,GAAGiB,GAAGd,CAAW,GACjDO,KAAShB,EAAYO,GAAGU,GAAMX,GAAGmB,GAAG,IAAMhB,CAAW,GAChDC,MACJM,KAAS,IAEVA,IAAQ1B,EAAwBiB,IAAI,IAAMU,GAAMX,GAAGmB,GAAGT,GAAO,GAAGP,IAC3DC,MACJM,IAAQ,CAACA,GACTN,IAAQ,OAITM,IAAQpB,EAAgBW,GAAGC,GAAGF,GAAGmB,GAAGhB,GAAaE,CAAG,IAGrDK,IAAQpB,EAAgBW,GAAGC,GAAGF,GAAGmB,GAAGhB,GAAaE,CAAG,IAGjDA,EAAKU,CAAE,IAAK,MAChBV,EAAKU,CAAE,IAAK3B,GAAiBa,GAAGC,GAAGF,GAAGmB,GAAG,EAAI,IAE9CP,IAAMO,IAAInB,GACLK,EAAKU,CAAE,MAAO,MACXzC,IAAcsC,IAAMP,EAAKU,CAAE,IAEjCV,EAAKU,KAAOzC,IAAc,IAE1B+B,EAAKU,CAAE,KAAMH,IAGfP,EAAKS,CAAE,IAAOV,KAAcD,IAAgB,IAAMzC,EAAMuC,GAAGC,MAAQQ,IAAQA,GACpEL;AACR;AAKA,IAAAe,KAAiBrB;","x_google_ignoreList":[0]}

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

@@ -1,62 +0,0 @@
-import { l as E } from "../../math-base-special-gamma-delta-ratio/lib/index.js";
-import { l as G } from "../../math-base-special-factorial/lib/index.js";
-import { l as N } from "../../math-base-special-gammainc/lib/index.js";
-import { l as j } from "../../math-base-special-log1p/lib/index.js";
-import { l as B } from "../../math-base-special-abs/lib/index.js";
-import { l as D } from "../../math-base-special-pow/lib/index.js";
-import { l as M } from "../../math-base-special-ln/lib/index.js";
-import { l as O } from "../../constants-float64-smallest-normal/lib/index.js";
-import { l as R } from "../../constants-float64-eps/lib/index.js";
-import { f as U } from "./full_igamma_prefix.js";
-import { r as V } from "./regularized_gamma_prefix.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 q = E, S = G, y = N, C = j, b = B, d = D, F = M, H = O, h = R, J = U, K = V, m = new Array(30);
-function Q(A, a, k, I, L, w, z) {
-  var i, g, _, v, o, x, s, $, c, n, P, u, l, f, r, t, e, p;
-  if (x = a - 1, e = A + x / 2, I < 0.35 ? n = C(-I) : n = F(k), p = -e * n, u = K(a, p), u <= H)
-    return L;
-  for (z ? (i = u / q(A, a), i /= d(e, a)) : i = J(a, p) / d(e, a), i *= w, m[0] = 1, l = y(p, a, !0, !0), l /= u, v = L + i * l, _ = 1, s = n / 2, s *= s, $ = 1, P = 4 * e * e, o = a, r = 1; r < m.length; ++r) {
-    for (_ += 2, m[r] = 0, c = a - r, g = 3, f = 1; f < r; ++f)
-      c = f * a - r, m[r] += c * m[r - f] / S(g), g += 2;
-    if (m[r] /= r, m[r] += x / S(_), l = (o * (o + 1) * l + (p + o + 1) * $) / P, $ *= s, o += 2, t = i * m[r] * l, v += t, t > 1) {
-      if (b(t) < b(h * v))
-        break;
-    } else if (b(t / h) < b(v))
-      break;
-  }
-  return v;
-}
-var vr = Q;
-export {
-  vr as b
-};
-//# sourceMappingURL=beta_small_b_large_a_series.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"beta_small_b_large_a_series.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/beta_small_b_large_a_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/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 gammaDeltaRatio = require( '@stdlib/math-base-special-gamma-delta-ratio' );\nvar factorial = require( '@stdlib/math-base-special-factorial' );\nvar gammainc = require( '@stdlib/math-base-special-gammainc' );\nvar log1p = require( '@stdlib/math-base-special-log1p' );\nvar abs = require( '@stdlib/math-base-special-abs' );\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 EPSILON = require( '@stdlib/constants-float64-eps' );\nvar fullIGammaPrefix = require( './full_igamma_prefix.js' );\nvar regularizedGammaPrefix = require( './regularized_gamma_prefix.js' );\n\n\n// VARIABLES //\n\nvar p = new Array( 30 );\n\n\n// MAIN //\n\n/**\n* This is DiDonato and Morris's BGRAT routine, see Eq's 9 through 9.6.\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 {NonNegativeInteger} s0 - initial value\n* @param {number} mult - initial value\n* @param {boolean} normalized - boolean indicating whether to evaluate the regularized or non-regularized incomplete beta function\n* @returns {number} function value\n*/\nfunction betaSmallBLargeASeries( a, b, x, y, s0, mult, normalized ) {\n\tvar prefix;\n\tvar tmp1;\n\tvar tnp1;\n\tvar sum;\n\tvar b2n;\n\tvar bm1;\n\tvar lx2;\n\tvar lxp;\n\tvar mbn;\n\tvar lx;\n\tvar t4;\n\tvar h;\n\tvar j;\n\tvar m;\n\tvar n;\n\tvar r;\n\tvar t;\n\tvar u;\n\n\t// Some values we'll need later, these are Eq 9.1:\n\tbm1 = b - 1.0;\n\tt = a + ( bm1 / 2.0 );\n\tif ( y < 0.35 ) {\n\t\tlx = log1p( -y );\n\t} else {\n\t\tlx = ln( x );\n\t}\n\tu = -t * lx;\n\n\t// And from from 9.2:\n\th = regularizedGammaPrefix( b, u );\n\tif ( h <= MIN_VALUE ) {\n\t\treturn s0;\n\t}\n\tif ( normalized ) {\n\t\tprefix = h / gammaDeltaRatio( a, b );\n\t\tprefix /= pow( t, b );\n\t} else {\n\t\tprefix = fullIGammaPrefix( b, u ) / pow( t, b );\n\t}\n\tprefix *= mult;\n\n\t// We need the quantity Pn. Unfortunately, this is computed recursively and requires a full history of all the previous values. No choice but to declare a big table and hope it's big enough...\n\tp[ 0 ] = 1;  // see 9.3.\n\n\t// Now an initial value for J, see 9.6: gammainc( u, b, regularized, upper )\n\tj = gammainc( u, b, true, true );\n\tj /= h;\n\n\t// Now we can start to pull things together and evaluate the sum in Eq 9:\n\tsum = s0 + ( prefix * j ); // Value at N = 0\n\n\t// Some variables we'll need...\n\ttnp1 = 1.0; // 2*N+1\n\tlx2 = lx / 2.0;\n\tlx2 *= lx2;\n\tlxp = 1.0;\n\tt4 = 4.0 * t * t;\n\tb2n = b;\n\tfor ( n = 1; n < p.length; ++n ) {\n\t\t// Begin by evaluating the next Pn from Eq 9.4:\n\t\ttnp1 += 2.0;\n\t\tp[ n ] = 0.0;\n\t\tmbn = b - n;\n\t\ttmp1 = 3;\n\t\tfor ( m = 1; m < n; ++m ) {\n\t\t\tmbn = ( m * b ) - n;\n\t\t\tp[ n ] += mbn * p[ n-m ] / factorial( tmp1 );\n\t\t\ttmp1 += 2;\n\t\t}\n\t\tp[ n ] /= n;\n\t\tp[ n ] += bm1 / factorial( tnp1 );\n\n\t\t// Now we want Jn from Jn-1 using Eq 9.6:\n\t\tj = ( ( b2n * ( b2n+1.0 ) * j ) + ( ( u+b2n+1.0 ) * lxp ) ) / t4;\n\t\tlxp *= lx2;\n\t\tb2n += 2.0;\n\n\t\t// Pull it together with Eq 9:\n\t\tr = prefix * p[ n ] * j;\n\t\tsum += r;\n\t\tif ( r > 1.0 ) {\n\t\t\tif ( abs( r ) < abs( EPSILON * sum ) ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} else if ( abs( r / EPSILON ) < abs( sum ) ) {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn sum;\n}\n\n\n// EXPORTS //\n\nmodule.exports = betaSmallBLargeASeries;\n"],"names":["gammaDeltaRatio","require$$0","factorial","require$$1","gammainc","require$$2","log1p","require$$3","abs","require$$4","pow","require$$5","ln","require$$6","MIN_VALUE","require$$7","EPSILON","require$$8","fullIGammaPrefix","require$$9","regularizedGammaPrefix","require$$10","p","betaSmallBLargeASeries","a","b","x","y","s0","mult","normalized","prefix","tmp1","tnp1","sum","b2n","bm1","lx2","lxp","mbn","lx","t4","h","j","m","n","r","t","u","beta_small_b_large_a_series"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,IAAIA,IAAkBC,GAClBC,IAAYC,GACZC,IAAWC,GACXC,IAAQC,GACRC,IAAMC,GACNC,IAAMC,GACNC,IAAKC,GACLC,IAAYC,GACZC,IAAUC,GACVC,IAAmBC,GACnBC,IAAyBC,GAKzBC,IAAI,IAAI,MAAO,EAAE;AAkBrB,SAASC,EAAwBC,GAAGC,GAAGC,GAAGC,GAAGC,GAAIC,GAAMC,GAAa;AACnE,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAcJ,MAXAZ,IAAMX,IAAI,GACVsB,IAAIvB,IAAMY,IAAM,GACXT,IAAI,OACRa,IAAKlC,EAAO,CAACqB,CAAC,IAEda,IAAK5B,EAAIc,CAAC,GAEXsB,IAAI,CAACD,IAAIP,GAGTE,IAAItB,EAAwBK,GAAGuB,CAAC,GAC3BN,KAAK5B;AACT,WAAOc;AA2BR,OAzBKE,KACJC,IAASW,IAAI1C,EAAiBwB,GAAGC,CAAC,GAClCM,KAAUrB,EAAKqC,GAAGtB,CAAC,KAEnBM,IAASb,EAAkBO,GAAGuB,CAAC,IAAKtC,EAAKqC,GAAGtB,CAAC,GAE9CM,KAAUF,GAGVP,EAAG,CAAC,IAAK,GAGTqB,IAAIvC,EAAU4C,GAAGvB,GAAG,IAAM,EAAI,GAC9BkB,KAAKD,GAGLR,IAAMN,IAAOG,IAASY,GAGtBV,IAAO,GACPI,IAAMG,IAAK,GACXH,KAAOA,GACPC,IAAM,GACNG,IAAK,IAAMM,IAAIA,GACfZ,IAAMV,GACAoB,IAAI,GAAGA,IAAIvB,EAAE,QAAQ,EAAEuB,GAAI;AAMhC,SAJAZ,KAAQ,GACRX,EAAGuB,CAAC,IAAK,GACTN,IAAMd,IAAIoB,GACVb,IAAO,GACDY,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACrB,MAAAL,IAAQK,IAAInB,IAAMoB,GAClBvB,EAAGuB,CAAC,KAAMN,IAAMjB,EAAGuB,IAAED,CAAC,IAAK1C,EAAW8B,CAAI,GAC1CA,KAAQ;AAaT,QAXAV,EAAGuB,CAAC,KAAMA,GACVvB,EAAGuB,CAAC,KAAMT,IAAMlC,EAAW+B,CAAI,GAG/BU,KAAQR,KAAQA,IAAI,KAAQQ,KAAUK,IAAEb,IAAI,KAAQG,KAAUG,GAC9DH,KAAOD,GACPF,KAAO,GAGPW,IAAIf,IAAST,EAAGuB,CAAC,IAAKF,GACtBT,KAAOY,GACFA,IAAI;AACR,UAAKtC,EAAKsC,CAAC,IAAKtC,EAAKQ,IAAUkB,CAAG;AACjC;AAAA,eAEU1B,EAAKsC,IAAI9B,CAAO,IAAKR,EAAK0B;AACrC;AAAA,EAEH;AACC,SAAOA;AACR;AAKA,IAAAe,KAAiB1B;","x_google_ignoreList":[0]}

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

@@ -1,56 +0,0 @@
-import { l as p } from "../../math-base-special-binomcoef/lib/index.js";
-import { l as c } from "../../math-base-special-floor/lib/index.js";
-import { l as u } from "../../math-base-special-pow/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_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 b = p, m = c, s = u, C = $;
-function _(a, t, l, e) {
-  var v, o, i, f, r;
-  if (o = s(l, a), o > C)
-    for (f = o, r = m(a - 1); r > t; r--)
-      f *= (r + 1) * e / ((a - r) * l), o += f;
-  else if (i = m(a * l), i <= t + 1 && (i = m(t + 2)), o = s(l, i) * s(e, a - i), o *= b(m(a), m(i)), o === 0)
-    for (r = i - 1; r > t; r--)
-      o += s(l, r) * s(e, a - r), o *= b(m(a), m(r));
-  else {
-    for (f = o, v = o, r = i - 1; r > t; r--)
-      f *= (r + 1) * e / ((a - r) * l), o += f;
-    for (f = v, r = i + 1; r <= a; r++)
-      f *= (a - r + 1) * l / (r * e), o += f;
-  }
-  return o;
-}
-var E = _;
-export {
-  E as b
-};
-//# sourceMappingURL=binomial_ccdf.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"binomial_ccdf.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/binomial_ccdf.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 binomcoef = require( '@stdlib/math-base-special-binomcoef' );\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar MIN_VALUE = require( '@stdlib/constants-float64-smallest-normal' );\n\n\n// MAIN //\n\n/**\n* For integer arguments we can relate the incomplete beta to the complement of the binomial distribution cdf and use this finite sum.\n*\n* @private\n* @param {NonNegativeInteger} n - number of trials\n* @param {NonNegativeInteger} k - function input\n* @param {Probability} x - function input\n* @param {Probability} y - probability equal to `1-x`\n* @returns {number} sum\n*/\nfunction binomialCCDF( n, k, x, y ) {\n\tvar startTerm;\n\tvar result;\n\tvar start;\n\tvar term;\n\tvar i;\n\n\tresult = pow( x, n );\n\tif ( result > MIN_VALUE ) {\n\t\tterm = result;\n\t\tfor ( i = floor( n - 1 ); i > k; i-- ) {\n\t\t\tterm *= ((i + 1) * y) / ((n - i) * x);\n\t\t\tresult += term;\n\t\t}\n\t} else {\n\t\t// First term underflows so we need to start at the mode of the distribution and work outwards:\n\t\tstart = floor( n * x );\n\t\tif ( start <= k + 1 ) {\n\t\t\tstart = floor( k + 2 );\n\t\t}\n\t\tresult = pow( x, start ) * pow( y, n - start );\n\t\tresult *= binomcoef( floor(n), floor(start) );\n\t\tif ( result === 0.0 ) {\n\t\t\t// OK, starting slightly above the mode didn't work, we'll have to sum the terms the old fashioned way:\n\t\t\tfor ( i = start - 1; i > k; i-- ) {\n\t\t\t\tresult += pow( x, i ) * pow( y, n - i );\n\t\t\t\tresult *= binomcoef( floor(n), floor(i) );\n\t\t\t}\n\t\t} else {\n\t\t\tterm = result;\n\t\t\tstartTerm = result;\n\t\t\tfor ( i = start - 1; i > k; i-- ) {\n\t\t\t\tterm *= ((i + 1) * y) / ((n - i) * x);\n\t\t\t\tresult += term;\n\t\t\t}\n\t\t\tterm = startTerm;\n\t\t\tfor ( i = start + 1; i <= n; i++ ) {\n\t\t\t\tterm *= (n - i + 1) * x / (i * y);\n\t\t\t\tresult += term;\n\t\t\t}\n\t\t}\n\t}\n\treturn result;\n}\n\n\n// EXPORTS //\n\nmodule.exports = binomialCCDF;\n"],"names":["binomcoef","require$$0","floor","require$$1","pow","require$$2","MIN_VALUE","require$$3","binomialCCDF","n","k","x","y","startTerm","result","start","term","i","binomial_ccdf"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,IAAIA,IAAYC,GACZC,IAAQC,GACRC,IAAMC,GACNC,IAAYC;AAehB,SAASC,EAAcC,GAAGC,GAAGC,GAAGC,GAAI;AACnC,MAAIC,GACAC,GACAC,GACAC,GACAC;AAGJ,MADAH,IAASV,EAAKO,GAAGF,CAAC,GACbK,IAASR;AAEb,SADAU,IAAOF,GACDG,IAAIf,EAAOO,IAAI,CAAC,GAAIQ,IAAIP,GAAGO;AAChC,MAAAD,MAAUC,IAAI,KAAKL,MAAOH,IAAIQ,KAAKN,IACnCG,KAAUE;AAAA,WAIXD,IAAQb,EAAOO,IAAIE,CAAC,GACfI,KAASL,IAAI,MACjBK,IAAQb,EAAOQ,IAAI,CAAC,IAErBI,IAASV,EAAKO,GAAGI,CAAK,IAAKX,EAAKQ,GAAGH,IAAIM,CAAK,GAC5CD,KAAUd,EAAWE,EAAMO,CAAC,GAAGP,EAAMa,CAAK,CAAC,GACtCD,MAAW;AAEf,SAAMG,IAAIF,IAAQ,GAAGE,IAAIP,GAAGO;AAC3B,MAAAH,KAAUV,EAAKO,GAAGM,CAAC,IAAKb,EAAKQ,GAAGH,IAAIQ,CAAC,GACrCH,KAAUd,EAAWE,EAAMO,CAAC,GAAGP,EAAMe,CAAC,CAAC;AAAA,OAElC;AAGN,SAFAD,IAAOF,GACPD,IAAYC,GACNG,IAAIF,IAAQ,GAAGE,IAAIP,GAAGO;AAC3B,MAAAD,MAAUC,IAAI,KAAKL,MAAOH,IAAIQ,KAAKN,IACnCG,KAAUE;AAGX,SADAA,IAAOH,GACDI,IAAIF,IAAQ,GAAGE,KAAKR,GAAGQ;AAC5B,MAAAD,MAASP,IAAIQ,IAAI,KAAKN,KAAKM,IAAIL,IAC/BE,KAAUE;AAAA,EAEd;AAEC,SAAOF;AACR;AAKA,IAAAI,IAAiBV;","x_google_ignoreList":[0]}

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

@@ -1,46 +0,0 @@
-import { l as s } from "../../math-base-special-exp/lib/index.js";
-import { l as p } 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-max-ln/lib/index.js";
-import { l as b } from "../../constants-float64-min-ln/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_37_0/boost/math/special_functions/gamma.hpp}. The implementation has been modified for JavaScript.
-*
-* ```text
-* (C) Copyright John Maddock 2006.
-* (C) 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, m = p, x = t, o = v, a = b;
-function n(l, r) {
-  var i, e;
-  return e = l * x(r), r >= 1 ? e < o && -r > a ? i = m(r, l) * f(-r) : l >= 1 ? i = m(r / f(r / l), l) : i = f(e - r) : e > a ? i = m(r, l) * f(-r) : r / l < o ? i = m(r / f(r / l), l) : i = f(e - r), i;
-}
-var L = n;
-export {
-  L as f
-};
-//# sourceMappingURL=full_igamma_prefix.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"full_igamma_prefix.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/full_igamma_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_37_0/boost/math/special_functions/gamma.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* (C) Copyright John Maddock 2006.\n* (C) 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 exp = require( '@stdlib/math-base-special-exp' );\nvar pow = require( '@stdlib/math-base-special-pow' );\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' );\n\n\n// MAIN //\n\n/**\n* Calculates the power term prefix `(z^a)(e^-z)` used in the non-normalized incomplete gammas.\n*\n* @private\n* @param {number} a - function parameter\n* @param {number} z - function parameter\n* @returns {number} power term prefix\n*/\nfunction fullIGammaPrefix( a, z ) {\n\tvar prefix;\n\tvar alz;\n\n\talz = a * ln( z );\n\tif ( z >= 1.0 ) {\n\t\tif ( ( alz < MAX_LN ) && ( -z > MIN_LN ) ) {\n\t\t\tprefix = pow( z, a ) * exp( -z );\n\t\t}\n\t\telse if ( a >= 1.0 ) {\n\t\t\tprefix = pow( z / exp(z/a), a );\n\t\t}\n\t\telse {\n\t\t\tprefix = exp( alz - z );\n\t\t}\n\t}\n\telse if ( alz > MIN_LN ) {\n\t\tprefix = pow( z, a ) * exp( -z );\n\t}\n\telse if ( z/a < MAX_LN ) {\n\t\tprefix = pow( z / exp(z/a), a );\n\t}\n\telse {\n\t\tprefix = exp( alz - z );\n\t}\n\treturn prefix;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fullIGammaPrefix;\n"],"names":["exp","require$$0","pow","require$$1","ln","require$$2","MAX_LN","require$$3","MIN_LN","require$$4","fullIGammaPrefix","a","z","prefix","alz","full_igamma_prefix"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIA,IAAMC,GACNC,IAAMC,GACNC,IAAKC,GACLC,IAASC,GACTC,IAASC;AAab,SAASC,EAAkBC,GAAGC,GAAI;AACjC,MAAIC,GACAC;AAEJ,SAAAA,IAAMH,IAAIP,EAAIQ,CAAC,GACVA,KAAK,IACFE,IAAMR,KAAc,CAACM,IAAIJ,IAC/BK,IAASX,EAAKU,GAAGD,CAAC,IAAKX,EAAK,CAACY,CAAC,IAErBD,KAAK,IACdE,IAASX,EAAKU,IAAIZ,EAAIY,IAAED,CAAC,GAAGA,CAAC,IAG7BE,IAASb,EAAKc,IAAMF,CAAC,IAGbE,IAAMN,IACfK,IAASX,EAAKU,GAAGD,CAAC,IAAKX,EAAK,CAACY,CAAC,IAErBA,IAAED,IAAIL,IACfO,IAASX,EAAKU,IAAIZ,EAAIY,IAAED,CAAC,GAAGA,CAAC,IAG7BE,IAASb,EAAKc,IAAMF,CAAC,GAEfC;AACR;AAKA,IAAAE,IAAiBL;","x_google_ignoreList":[0]}

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

@@ -1,45 +0,0 @@
-import { i as n } 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 _ = n;
-function b(i, f, m, p, s, v, o) {
-  var r, t, a, e;
-  if (r = _(i, f, m, p, v), o && (o[1] = r), r /= i, r === 0)
-    return r;
-  for (a = 1, t = 1, e = 0; e < s - 1; ++e)
-    t *= (i + f + e) * m / (i + e + 1), a += t;
-  return r *= a, r;
-}
-var w = b;
-export {
-  w as i
-};
-//# sourceMappingURL=ibeta_a_step.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"ibeta_a_step.js","sources":["../../../../../node_modules/@stdlib/math-base-special-kernel-betainc/lib/ibeta_a_step.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 ibetaPowerTerms = require( './ibeta_power_terms.js' );\n\n\n// MAIN //\n\n/**\n* Computes the difference between `ibeta(a,b,x)` and `ibeta(a+k,b,x)`.\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 {NonNegativeInteger} k - function input\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} difference between ibeta(a,b,x) and ibeta(a+k,b,x)\n*/\nfunction ibetaAStep( a, b, x, y, k, normalized, out ) {\n\tvar prefix;\n\tvar term;\n\tvar sum;\n\tvar i;\n\n\tprefix = ibetaPowerTerms( a, b, x, y, normalized );\n\tif ( out ) {\n\t\tout[ 1 ] = prefix;\n\t}\n\tprefix /= a;\n\tif ( prefix === 0.0 ) {\n\t\treturn prefix;\n\t}\n\tsum = 1.0;\n\tterm = 1.0;\n\n\t// Series summation from 0 to k-1:\n\tfor ( i = 0; i < k-1; ++i ) {\n\t\tterm *= (a+b+i) * x / (a+i+1.0);\n\t\tsum += term;\n\t}\n\tprefix *= sum;\n\treturn prefix;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ibetaAStep;\n"],"names":["ibetaPowerTerms","require$$0","ibetaAStep","a","b","x","y","k","normalized","out","prefix","term","sum","i","ibeta_a_step"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,IAAIA,IAAkBC;AAkBtB,SAASC,EAAYC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAYC,GAAM;AACrD,MAAIC,GACAC,GACAC,GACAC;AAOJ,MALAH,IAASV,EAAiBG,GAAGC,GAAGC,GAAGC,GAAGE,CAAU,GAC3CC,MACJA,EAAK,CAAC,IAAKC,IAEZA,KAAUP,GACLO,MAAW;AACf,WAAOA;AAMR,OAJAE,IAAM,GACND,IAAO,GAGDE,IAAI,GAAGA,IAAIN,IAAE,GAAG,EAAEM;AACvB,IAAAF,MAASR,IAAEC,IAAES,KAAKR,KAAKF,IAAEU,IAAE,IAC3BD,KAAOD;AAER,SAAAD,KAAUE,GACHF;AACR;AAKA,IAAAI,IAAiBZ;","x_google_ignoreList":[0]}