@milaboratories/miplots4 1.0.176 → 1.0.178

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

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_co3.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/polyval_co3.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 7.0;\n\t}\n\treturn 7.0 + (x * (-2.0 + (x * (33.0 + (x * (-62.0 + (x * 31.0)))))));\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_co3"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoCA,WAASA,EAAUC,GAAI;AACtB,WAAKA,MAAM,IACH,IAED,IAAOA,KAAK,KAAQA,KAAK,KAAQA,KAAK,MAASA,IAAI;AAAA,EAC3D;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_co4.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/polyval_co4.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 25.0;\n\t}\n\treturn 25.0 + (x * (-52.0 + (x * (-17.0 + (x * (88.0 + (x * (-115.0 + (x * 46.0))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_co4"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoCA,WAASA,EAAUC,GAAI;AACtB,WAAKA,MAAM,IACH,KAED,KAAQA,KAAK,MAASA,KAAK,MAASA,KAAK,KAAQA,KAAK,OAAUA,IAAI;AAAA,EAC5E;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_co5.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/polyval_co5.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 7.0;\n\t}\n\treturn 7.0 + (x * (12.0 + (x * (-78.0 + (x * 52.0)))));\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_co5"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoCA,WAASA,EAAUC,GAAI;AACtB,WAAKA,MAAM,IACH,IAED,IAAOA,KAAK,KAAQA,KAAK,MAASA,IAAI;AAAA,EAC9C;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_co6.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/polyval_co6.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 -7.0;\n\t}\n\treturn -7.0 + (x * (2.0 + (x * (183.0 + (x * (-370.0 + (x * 185.0)))))));\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_co6"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoCA,WAASA,EAAUC,GAAI;AACtB,WAAKA,MAAM,IACH,KAED,KAAQA,KAAK,IAAOA,KAAK,MAASA,KAAK,OAAUA,IAAI;AAAA,EAC7D;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_co7.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/polyval_co7.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 -533.0;\n\t}\n\treturn -533.0 + (x * (776.0 + (x * (-1835.0 + (x * (10240.0 + (x * (-13525.0 + (x * 5410.0))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_co7"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoCA,WAASA,EAAUC,GAAI;AACtB,WAAKA,MAAM,IACH,OAED,OAAUA,KAAK,MAASA,KAAK,QAAWA,KAAK,QAAWA,KAAK,SAAYA,IAAI;AAAA,EACrF;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_co8.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/polyval_co8.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 -1579.0;\n\t}\n\treturn -1579.0 + (x * (3747.0 + (x * (-3372.0 + (x * (-15821.0 + (x * (45588.0 + (x * (-45213.0 + (x * 15071.0))))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_co8"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoCA,WAASA,EAAUC,GAAI;AACtB,WAAKA,MAAM,IACH,QAED,QAAWA,KAAK,OAAUA,KAAK,QAAWA,KAAK,SAAYA,KAAK,QAAWA,KAAK,SAAYA,IAAI;AAAA,EACxG;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_co9.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/polyval_co9.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 449.0;\n\t}\n\treturn 449.0 + (x * (-1259.0 + (x * (-769.0 + (x * (6686.0 + (x * (-9260.0 + (x * 3704.0))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_co9"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoCA,WAASA,EAAUC,GAAI;AACtB,WAAKA,MAAM,IACH,MAED,MAASA,KAAK,QAAWA,KAAK,OAAUA,KAAK,OAAUA,KAAK,QAAWA,IAAI;AAAA,EACnF;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

@@ -1,51 +0,0 @@
-import { __require as d } from "../../../../../@stdlib_math-base-special-ln@0.2.4/node_modules/@stdlib/math-base-special-ln/lib/index.js";
-import { __require as s } from "../../../../../@stdlib_constants-float64-max@0.2.2/node_modules/@stdlib/constants-float64-max/lib/index.js";
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*
-*
-* ## Notice
-*
-* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_62_0/boost/math/special_functions/detail/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.
-*
-* ```text
-* Copyright John Maddock 2006.
-* Copyright Paul A. Bristow 2007.
-*
-* Use, modification and distribution are subject to the
-* Boost Software License, Version 1.0. (See accompanying file
-* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
-* ```
-*/
-var o, a;
-function p() {
-  if (a) return o;
-  a = 1;
-  var t = d(), _ = s(), r = _ / 4;
-  function v(q, n) {
-    return m;
-    function m(e) {
-      var u, f, i;
-      return i = 1 - e, i === 0 ? [-r, -r] : e === 0 ? [-r, -r] : (f = t(e) + n * t(i) + q, u = 1 / e - n / i, [f, u]);
-    }
-  }
-  return o = v, o;
-}
-export {
-  p as __require
-};
-//# sourceMappingURL=root_finder.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"root_finder.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/root_finder.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/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006.\n* Copyright Paul A. Bristow 2007.\n*\n* Use, modification and distribution are subject to the\n* Boost Software License, Version 1.0. (See accompanying file\n* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ln = require( '@stdlib/math-base-special-ln' );\nvar MAX_VALUE = require( '@stdlib/constants-float64-max' );\n\n\n// VARIABLES //\n\nvar BIG = MAX_VALUE / 4.0;\n\n\n// MAIN //\n\n/**\n* Helper function used by root finding code to convert `eta` to `x`.\n*\n* @private\n* @param {number} t - first parameter\n* @param {number} a - second parameter\n* @returns {Function} root function\n*/\nfunction temmeRootFinder( t, a ) {\n\treturn roots;\n\n\t/**\n\t* Calculates roots.\n\t*\n\t* @private\n\t* @param {number} x - function value\n\t* @returns {Array} function roots\n\t*/\n\tfunction roots( x ) {\n\t\tvar f1;\n\t\tvar f;\n\t\tvar y;\n\n\t\ty = 1.0 - x;\n\t\tif ( y === 0.0 ) {\n\t\t\treturn [ -BIG, -BIG ];\n\t\t}\n\t\tif ( x === 0.0 ) {\n\t\t\treturn [ -BIG, -BIG ];\n\t\t}\n\t\tf = ln( x ) + ( a * ln( y ) ) + t;\n\t\tf1 = ( 1.0 / x ) - ( a / y );\n\t\treturn [ f, f1 ];\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = temmeRootFinder;\n"],"names":["ln","require$$0","MAX_VALUE","require$$1","BIG","temmeRootFinder","t","a","roots","x","f1","y","root_finder"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAKC,EAAA,GACLC,IAAYC,EAAA,GAKZC,IAAMF,IAAY;AAatB,WAASG,EAAiBC,GAAGC,GAAI;AAChC,WAAOC;AASP,aAASA,EAAOC,GAAI;AACnB,UAAIC,GACA,GACAC;AAGJ,aADAA,IAAI,IAAMF,GACLE,MAAM,IACH,CAAE,CAACP,GAAK,CAACA,CAAG,IAEfK,MAAM,IACH,CAAE,CAACL,GAAK,CAACA,CAAG,KAEpB,IAAIJ,EAAIS,CAAC,IAAOF,IAAIP,EAAIW,CAAC,IAAOL,GAChCI,IAAO,IAAMD,IAAQF,IAAII,GAClB,CAAE,GAAGD,CAAE;AAAA,IAChB;AAAA,EACA;AAKA,SAAAE,IAAiBP;;","x_google_ignoreList":[0]}

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

@@ -1,51 +0,0 @@
-import { __require as T } from "../../../../../@stdlib_math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/lib/index.js";
-import { __require as l } from "../../../../../@stdlib_math-base-special-erfcinv@0.2.3/node_modules/@stdlib/math-base-special-erfcinv/lib/index.js";
-import { __require as x } from "../../../../../@stdlib_math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/lib/index.js";
-import { __require as R } from "../../../../../@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/index.js";
-import { __require as d } from "../../../../../@stdlib_constants-float64-sqrt-two@0.2.2/node_modules/@stdlib/constants-float64-sqrt-two/lib/index.js";
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*
-*
-* ## Notice
-*
-* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/detail/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.
-*
-* ```text
-* Copyright John Maddock 2006.
-* Copyright Paul A. Bristow 2007.
-*
-* Use, modification and distribution are subject to the
-* Boost Software License, Version 1.0. (See accompanying file
-* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
-* ```
-*/
-var f, p;
-function S() {
-  if (p) return f;
-  p = 1;
-  var u = T(), b = l(), s = x(), c = R(), i = d(), r = [0, 0, 0, 0, 0, 0, 0], t = [0, 0, 0, 0];
-  function L(q, $, B) {
-    var m, v, o, a, _, e, n;
-    return m = b(2 * B), m /= -s(q / 2), t[0] = m, e = $ - q, a = e * e, _ = a * e, r[0] = -e * i / 2, r[1] = (1 - 2 * e) / 8, r[2] = -(e * i / 48), r[3] = -1 / 192, r[4] = -e * i / 3840, r[5] = 0, r[6] = 0, t[1] = u(r, m), r[0] = e * i * (3 * e - 2) / 12, r[1] = (20 * a - 12 * e + 1) / 128, r[2] = e * i * (20 * e - 1) / 960, r[3] = (16 * a + 30 * e - 15) / 4608, r[4] = e * i * (21 * e + 32) / 53760, r[5] = (-(32 * a) + 63) / 368640, r[6] = -e * i * (120 * e + 17) / 25804480, t[2] = u(r, m), r[0] = e * i * (-75 * a + 80 * e - 16) / 480, r[1] = (-1080 * _ + 868 * a - 90 * e - 45) / 9216, r[2] = e * i * (-1190 * a + 84 * e + 373) / 53760, r[3] = (-2240 * _ - 2508 * a + 2100 * e - 165) / 368640, r[4] = 0, r[5] = 0, r[6] = 0, t[3] = u(r, m), o = u(t, 1 / q), v = o * o, n = -c(-v / 2), v === 0 ? 0.5 : (1 + o * s((1 + n) / v)) / 2;
-  }
-  return f = L, f;
-}
-export {
-  S as __require
-};
-//# sourceMappingURL=temme1.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"temme1.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/temme1.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/detail/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006.\n* Copyright Paul A. Bristow 2007.\n*\n* Use, modification and distribution are subject to the\n* Boost Software License, Version 1.0. (See accompanying file\n* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar evalpoly = require( '@stdlib/math-base-tools-evalpoly' );\nvar erfcinv = require( '@stdlib/math-base-special-erfcinv' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar SQRT2 = require( '@stdlib/constants-float64-sqrt-two' );\n\n\n// VARIABLES //\n\n// Workspaces for the polynomial coefficients:\nvar workspace = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];\nvar terms = [ 0.0, 0.0, 0.0, 0.0 ];\n\n\n// MAIN //\n\n/**\n* Carries out the first method by Temme (described in section 2).\n*\n* ## References\n*\n* -   Temme, N. M. 1992. \"Incomplete Laplace Integrals: Uniform Asymptotic Expansion with Application to the Incomplete Beta Function.\" _Journal of Computational and Applied Mathematics_ 41 (1–2): 1638–63. doi:[10.1016/0377-0427(92)90244-R](https://doi.org/10.1016/0377-0427(92)90244-R).\n*\n* @private\n* @param {PositiveNumber} a - function parameter\n* @param {PositiveNumber} b - function parameter\n* @param {Probability} z - function parameter\n* @returns {number} function value\n*/\nfunction temme1( a, b, z ) {\n\tvar eta0;\n\tvar eta2;\n\tvar eta;\n\tvar B2;\n\tvar B3;\n\tvar B;\n\tvar c;\n\n\t// Get the first approximation for eta from the inverse error function (Eq: 2.9 and 2.10):\n\teta0 = erfcinv( 2.0 * z );\n\teta0 /= -sqrt( a / 2.0 );\n\n\tterms[ 0 ] = eta0;\n\n\t// Calculate powers:\n\tB = b - a;\n\tB2 = B * B;\n\tB3 = B2 * B;\n\n\t// Calculate correction terms:\n\n\t// See eq following 2.15:\n\tworkspace[ 0 ] = -B * SQRT2 / 2;\n\tworkspace[ 1 ] = ( 1 - (2.0*B) ) / 8.0;\n\tworkspace[ 2 ] = -(B * SQRT2 / 48.0);\n\tworkspace[ 3 ] = -1.0 / 192.0;\n\tworkspace[ 4 ] = -B * SQRT2 / 3840.0;\n\tworkspace[ 5 ] = 0.0;\n\tworkspace[ 6 ] = 0.0;\n\tterms[ 1 ] = evalpoly( workspace, eta0 );\n\n\t// Eq Following 2.17:\n\tworkspace[ 0 ] = B * SQRT2 * ( (3.0*B) - 2.0) / 12.0;\n\tworkspace[ 1 ] = ( (20.0*B2) - (12.0*B) + 1.0 ) / 128.0;\n\tworkspace[ 2 ] = B * SQRT2 * ( (20.0*B) - 1.0) / 960.0;\n\tworkspace[ 3 ] = ( (16.0*B2) + (30.0*B) - 15.0) / 4608.0;\n\tworkspace[ 4 ] = B * SQRT2 * ( (21.0*B) + 32) / 53760.0;\n\tworkspace[ 5 ] = (-(32.0*B2) + 63.0) / 368640.0;\n\tworkspace[ 6 ] = -B * SQRT2 * ( (120.0*B) + 17.0) / 25804480.0;\n\tterms[ 2 ] = evalpoly( workspace, eta0 );\n\n\t// Eq Following 2.17:\n\tworkspace[ 0 ] = B * SQRT2 * ( (-75*B2) + (80.0*B) - 16.0) / 480.0;\n\tworkspace[ 1 ] = ( (-1080.0*B3) + (868.0*B2) - (90.0*B) - 45.0) / 9216.0;\n\tworkspace[ 2 ] = B * SQRT2 * ( (-1190.0*B2) + (84.0*B) + 373.0) / 53760.0;\n\tworkspace[ 3 ] = ( (-2240.0*B3)-(2508.0*B2)+(2100.0*B)-165.0 ) / 368640.0;\n\tworkspace[ 4 ] = 0.0;\n\tworkspace[ 5 ] = 0.0;\n\tworkspace[ 6 ] = 0.0;\n\tterms[ 3 ] = evalpoly( workspace, eta0 );\n\n\t// Bring them together to get a final estimate for eta:\n\teta = evalpoly( terms, 1.0/a );\n\n\t// Now we need to convert eta to the return value `x`, by solving the appropriate quadratic equation:\n\teta2 = eta * eta;\n\tc = -exp( -eta2 / 2.0 );\n\tif ( eta2 === 0.0 ) {\n\t\treturn 0.5;\n\t}\n\treturn ( 1.0 + ( eta * sqrt( ( 1.0+c ) / eta2 ) ) ) / 2.0;\n}\n\n\n// EXPORTS //\n\nmodule.exports = temme1;\n"],"names":["evalpoly","require$$0","erfcinv","require$$1","sqrt","require$$2","exp","require$$3","SQRT2","require$$4","workspace","terms","temme1","a","b","z","eta0","eta2","eta","B2","B3","B","c","temme1_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAWC,EAAA,GACXC,IAAUC,EAAA,GACVC,IAAOC,EAAA,GACPC,IAAMC,EAAA,GACNC,IAAQC,EAAA,GAMRC,IAAY,CAAE,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,CAAG,GAC/CC,IAAQ,CAAE,GAAK,GAAK,GAAK,CAAG;AAkBhC,WAASC,EAAQC,GAAGC,GAAGC,GAAI;AAC1B,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAmDJ,WAhDAN,IAAOd,EAAS,IAAMa,CAAC,GACvBC,KAAQ,CAACZ,EAAMS,IAAI,CAAG,GAEtBF,EAAO,CAAC,IAAKK,GAGbK,IAAIP,IAAID,GACRM,IAAKE,IAAIA,GACTD,IAAKD,IAAKE,GAKVX,EAAW,CAAC,IAAK,CAACW,IAAIb,IAAQ,GAC9BE,EAAW,CAAC,KAAO,IAAK,IAAIW,KAAO,GACnCX,EAAW,CAAC,IAAK,EAAEW,IAAIb,IAAQ,KAC/BE,EAAW,KAAM,KAAO,KACxBA,EAAW,CAAC,IAAK,CAACW,IAAIb,IAAQ,MAC9BE,EAAW,CAAC,IAAK,GACjBA,EAAW,CAAC,IAAK,GACjBC,EAAO,CAAC,IAAKX,EAAUU,GAAWM,CAAI,GAGtCN,EAAW,CAAC,IAAKW,IAAIb,KAAW,IAAIa,IAAK,KAAO,IAChDX,EAAW,MAAS,KAAKS,IAAO,KAAKE,IAAK,KAAQ,KAClDX,EAAW,CAAC,IAAKW,IAAIb,KAAW,KAAKa,IAAK,KAAO,KACjDX,EAAW,MAAS,KAAKS,IAAO,KAAKE,IAAK,MAAQ,MAClDX,EAAW,CAAC,IAAKW,IAAIb,KAAW,KAAKa,IAAK,MAAM,OAChDX,EAAW,CAAC,KAAM,EAAE,KAAKS,KAAM,MAAQ,QACvCT,EAAW,KAAM,CAACW,IAAIb,KAAW,MAAMa,IAAK,MAAQ,UACpDV,EAAO,CAAC,IAAKX,EAAUU,GAAWM,CAAI,GAGtCN,EAAW,CAAC,IAAKW,IAAIb,KAAW,MAAIW,IAAO,KAAKE,IAAK,MAAQ,KAC7DX,EAAW,CAAC,KAAQ,QAAQU,IAAO,MAAMD,IAAO,KAAKE,IAAK,MAAQ,MAClEX,EAAW,CAAC,IAAKW,IAAIb,KAAW,QAAQW,IAAO,KAAKE,IAAK,OAAS,OAClEX,EAAW,CAAC,KAAQ,QAAQU,IAAK,OAAOD,IAAK,OAAOE,IAAG,OAAU,QACjEX,EAAW,CAAC,IAAK,GACjBA,EAAW,CAAC,IAAK,GACjBA,EAAW,CAAC,IAAK,GACjBC,EAAO,CAAC,IAAKX,EAAUU,GAAWM,CAAI,GAGtCE,IAAMlB,EAAUW,GAAO,IAAIE,CAAC,GAG5BI,IAAOC,IAAMA,GACbI,IAAI,CAAChB,EAAK,CAACW,IAAO,CAAG,GAChBA,MAAS,IACN,OAEC,IAAQC,IAAMd,GAAQ,IAAIkB,KAAML,CAAI,KAAS;AAAA,EACvD;AAKA,SAAAM,IAAiBX;;","x_google_ignoreList":[0]}

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

@@ -1,69 +0,0 @@
-import { __require as X } from "../../../../../@stdlib_math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/lib/index.js";
-import { __require as Y } from "../../../../../@stdlib_math-base-special-erfcinv@0.2.3/node_modules/@stdlib/math-base-special-erfcinv/lib/index.js";
-import { __require as Z } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
-import { __require as rr } from "../../../../../@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/index.js";
-import { __require as er } from "../../../../../@stdlib_math-base-special-ln@0.2.4/node_modules/@stdlib/math-base-special-ln/lib/index.js";
-import { __require as ar } from "../../../../../@stdlib_math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/lib/index.js";
-import { __require as or } from "../../../../../@stdlib_math-base-special-sin@0.3.0/node_modules/@stdlib/math-base-special-sin/lib/index.js";
-import { __require as ir } from "../../../../../@stdlib_math-base-special-cos@0.3.0/node_modules/@stdlib/math-base-special-cos/lib/index.js";
-import { __require as vr } from "./root_finder.js";
-import { __require as _r } from "./newton_raphson.js";
-import { __require as lr } from "./polyval_co1.js";
-import { __require as mr } from "./polyval_co2.js";
-import { __require as ur } from "./polyval_co3.js";
-import { __require as qr } from "./polyval_co4.js";
-import { __require as pr } from "./polyval_co5.js";
-import { __require as sr } from "./polyval_co6.js";
-import { __require as tr } from "./polyval_co7.js";
-import { __require as fr } from "./polyval_co8.js";
-import { __require as cr } from "./polyval_co9.js";
-import { __require as yr } from "./polyval_co10.js";
-import { __require as nr } from "./polyval_co11.js";
-import { __require as Pr } from "./polyval_co12.js";
-import { __require as br } from "./polyval_co13.js";
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*
-*
-* ## Notice
-*
-* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/detail/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.
-*
-* ```text
-* Copyright John Maddock 2006.
-* Copyright Paul A. Bristow 2007.
-*
-* Use, modification and distribution are subject to the
-* Boost Software License, Version 1.0. (See accompanying file
-* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
-* ```
-*/
-var $, T;
-function Kr() {
-  if (T) return $;
-  T = 1;
-  var m = X(), k = Y(), F = Z(), I = rr(), w = er(), N = ar(), g = or(), j = ir(), z = vr(), A = _r(), B = lr(), C = mr(), D = ur(), E = qr(), G = pr(), H = sr(), J = tr(), K = fr(), M = cr(), O = yr(), Q = nr(), S = Pr(), U = br(), r = [0, 0, 0, 0, 0, 0], u = [0, 0, 0, 0];
-  function V(W, R, d) {
-    var q, p, a, h, s, i, x, n, c, y, v, _, l, P, e, b, t, f, L, o;
-    return s = k(2 * W) / -N(R / 2), f = g(d), t = j(d), u[0] = s, e = f * f, b = t * t, l = f * t, _ = l * l, v = _ * l, y = _ * _, c = _ * v, n = v * v, x = y * v, r[0] = (2 * e - 1) / (3 * l), r[1] = -B(e) / (36 * _), r[2] = C(e) / (1620 * v), r[3] = D(e) / (6480 * y), r[4] = E(e) / (90720 * c), r[5] = 0, u[1] = m(r, s), r[0] = -G(e) / (405 * v), r[1] = H(e) / (2592 * y), r[2] = -J(e) / (204120 * c), r[3] = -K(e) / (2099520 * n), r[4] = 0, r[5] = 0, u[2] = m(r, s), r[0] = M(e) / (102060 * c), r[1] = -O(e) / (20995200 * n), r[2] = Q(e) / (36741600 * x), r[3] = 0, r[4] = 0, r[5] = 0, u[3] = m(r, s), i = m(u, 1 / R), a = t / f, a *= a, P = -(i * i) / (2 * e) + w(e) + b * w(b) / e, F(i) < 0.7 ? (r[0] = e, r[1] = l, r[2] = (1 - 2 * e) / 3, r[3] = S(e) / (36 * l), r[4] = U(e) / (270 * _), r[5] = 0, o = m(r, i)) : (L = I(P), r[0] = L, r[1] = a, r[2] = 0, r[3] = 3 * a * (3 * a + 1) / 6, r[4] = 4 * a * (4 * a + 1) * (4 * a + 2) / 24, r[5] = 5 * a * (5 * a + 1) * (5 * a + 2) * (5 * a + 3) / 120, o = m(r, L), (o - e) * i < 0 && (o = 1 - o)), i < 0 ? (p = 0, q = e) : (p = e, q = 1), (o < p || o > q) && (o = (p + q) / 2), h = z(-P, a), o = A(h, o, p, q, 32, 100), o;
-  }
-  return $ = V, $;
-}
-export {
-  Kr as __require
-};
-//# sourceMappingURL=temme2.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"temme2.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/temme2.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/detail/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006.\n* Copyright Paul A. Bristow 2007.\n*\n* Use, modification and distribution are subject to the\n* Boost Software License, Version 1.0. (See accompanying file\n* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar evalpoly = require( '@stdlib/math-base-tools-evalpoly' );\nvar erfcinv = require( '@stdlib/math-base-special-erfcinv' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar ln = require( '@stdlib/math-base-special-ln' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar sin = require( '@stdlib/math-base-special-sin' );\nvar cos = require( '@stdlib/math-base-special-cos' );\nvar temmeRootFinder = require( './root_finder.js' );\nvar newtonRaphsonIterate = require( './newton_raphson.js' );\nvar polyval1 = require( './polyval_co1.js' );\nvar polyval2 = require( './polyval_co2.js' );\nvar polyval3 = require( './polyval_co3.js' );\nvar polyval4 = require( './polyval_co4.js' );\nvar polyval5 = require( './polyval_co5.js' );\nvar polyval6 = require( './polyval_co6.js' );\nvar polyval7 = require( './polyval_co7.js' );\nvar polyval8 = require( './polyval_co8.js' );\nvar polyval9 = require( './polyval_co9.js' );\nvar polyval10 = require( './polyval_co10.js' );\nvar polyval11 = require( './polyval_co11.js' );\nvar polyval12 = require( './polyval_co12.js' );\nvar polyval13 = require( './polyval_co13.js' );\n\n\n// VARIABLES //\n\n// Workspaces for polynomial coefficients:\nvar workspace = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];\nvar terms = [ 0.0, 0.0, 0.0, 0.0 ];\n\n\n// MAIN //\n\n/**\n* Carries out the second method by Temme (described in section 3).\n*\n* ## References\n*\n* -   Temme, N. M. 1992. \"Incomplete Laplace Integrals: Uniform Asymptotic Expansion with Application to the Incomplete Beta Function.\" _Journal of Computational and Applied Mathematics_ 41 (1–2): 1638–63. doi:[10.1016/0377-0427(92)90244-R](https://doi.org/10.1016/0377-0427(92)90244-R).\n*\n* @private\n* @param {number} z - function parameter\n* @param {number} r - function parameter\n* @param {number} theta - function parameter\n* @returns {number} function value\n*/\nfunction temme2( z, r, theta ) {\n\tvar upper;\n\tvar lower;\n\tvar alpha;\n\tvar roots;\n\tvar eta0;\n\tvar eta;\n\tvar sc7;\n\tvar sc6;\n\tvar sc5;\n\tvar sc4;\n\tvar sc3;\n\tvar sc2;\n\tvar sc;\n\tvar lu;\n\tvar s2;\n\tvar c2;\n\tvar c;\n\tvar s;\n\tvar u;\n\tvar x;\n\n\t// Get first estimate for eta, see Eq 3.9 and 3.10, but note there is a typo in Eq 3.10:\n\teta0 = erfcinv( 2.0*z ) / (-sqrt( r/2.0 ));\n\n\ts = sin( theta );\n\tc = cos( theta );\n\n\t// Now we need to perturb eta0 to get eta, which we do by evaluating the polynomial in 1/r at the bottom of page 151, to do this we first need the error terms e1, e2 e3 which we'll fill into the array \"terms\".  Since these terms are themselves polynomials, we'll need another array \"workspace\" to calculate those...\n\tterms[ 0 ] = eta0;\n\n\t// Some powers of sin(theta) cos(theta) that we'll need later:\n\ts2 = s * s;\n\tc2 = c * c;\n\tsc = s * c;\n\tsc2 = sc * sc;\n\tsc3 = sc2 * sc;\n\tsc4 = sc2 * sc2;\n\tsc5 = sc2 * sc3;\n\tsc6 = sc3 * sc3;\n\tsc7 = sc4 * sc3;\n\n\t// Calculate e1 and put it in terms[1], see the middle of page 151:\n\tworkspace[ 0 ] = ((2.0*s2) - 1.0) / ( 3.0*sc );\n\tworkspace[ 1 ] = -polyval1( s2 ) / (36.0*sc2);\n\tworkspace[ 2 ] = polyval2( s2 ) / (1620.0*sc3);\n\tworkspace[ 3 ] = polyval3( s2 ) / (6480.0*sc4);\n\tworkspace[ 4 ] = polyval4( s2 ) / (90720.0*sc5);\n\tworkspace[ 5 ] = 0.0;\n\tterms[ 1 ] = evalpoly( workspace, eta0 );\n\n\t// Now evaluate e2 and put it in terms[2]:\n\tworkspace[ 0 ] = -polyval5( s2 ) / (405.0*sc3);\n\tworkspace[ 1 ] = polyval6( s2 ) / (2592.0*sc4);\n\tworkspace[ 2 ] = -polyval7( s2 ) / (204120.0*sc5);\n\tworkspace[ 3 ] = -polyval8( s2 ) / (2099520.0*sc6);\n\tworkspace[ 4 ] = 0.0;\n\tworkspace[ 5 ] = 0.0;\n\tterms[ 2 ] = evalpoly( workspace, eta0 );\n\n\t// And e3, and put it in terms[3]:\n\tworkspace[ 0 ] = polyval9( s2 ) / (102060.0*sc5);\n\tworkspace[ 1 ] = -polyval10( s2 ) / (20995200.0*sc6);\n\tworkspace[ 2 ] = polyval11( s2 ) / (36741600.0*sc7);\n\tworkspace[ 3 ] = 0.0;\n\tworkspace[ 4 ] = 0.0;\n\tworkspace[ 5 ] = 0.0;\n\tterms[ 3 ] = evalpoly( workspace, eta0 );\n\n\t// Bring the correction terms together to evaluate eta; this is the last equation on page 151:\n\teta = evalpoly( terms, 1.0/r );\n\n\t// Now that we have eta we need to back solve for x, we seek the value of x that gives eta in Eq 3.2. The two methods used are described in section 5. Begin by defining a few variables we'll need later:\n\talpha = c / s;\n\talpha *= alpha;\n\tlu = ( -( eta*eta )/( 2.0*s2 ) ) + ln(s2) + ( c2*ln(c2)/s2 );\n\n\t// Temme doesn't specify what value to switch on here, but this seems to work pretty well:\n\tif ( abs(eta) < 0.7 ) {\n\t\t// Small eta use the expansion Temme gives in the second equation of section 5, it's a polynomial in eta:\n\t\tworkspace[ 0 ] = s2;\n\t\tworkspace[ 1 ] = sc;\n\t\tworkspace[ 2 ] = (1.0-(2.0*s2)) / 3.0;\n\t\tworkspace[ 3 ] = polyval12( s2 ) / ( 36.0*sc );\n\t\tworkspace[ 4 ] = polyval13( s2 ) / ( 270.0*sc2 );\n\t\tworkspace[ 5 ] = 0.0;\n\t\tx = evalpoly( workspace, eta );\n\t} else {\n\t\t// If eta is large we need to solve Eq 3.2 more directly, begin by getting an initial approximation for x from the last equation on page 155, this is a polynomial in u:\n\t\tu = exp( lu );\n\t\tworkspace[ 0 ] = u;\n\t\tworkspace[ 1 ] = alpha;\n\t\tworkspace[ 2 ] = 0.0;\n\t\tworkspace[ 3 ] = 3.0 * alpha * ((3.0*alpha)+1.0) / 6.0;\n\t\tworkspace[ 4 ] = 4.0 * alpha * ((4.0*alpha)+1.0) * ((4.0*alpha)+2.0) / 24.0; // eslint-disable-line max-len\n\t\tworkspace[ 5 ] = 5.0 * alpha * ((5.0*alpha)+1.0) * ((5.0*alpha)+2.0) * ((5.0*alpha)+3.0) / 120.0; // eslint-disable-line max-len\n\t\tx = evalpoly( workspace, u );\n\n\t\t// At this point we may or may not have the right answer, Eq-3.2 has two solutions for x for any given eta, however the mapping in 3.2 is 1:1 with the sign of eta and x-sin^2(theta) being the same. So we can check if we have the right root of 3.2, and if not switch x for 1-x.  This transformation is motivated by the fact that the distribution is *almost* symmetric so 1-x will be in the right ball park for the solution:\n\t\tif ( (x-s2)*eta < 0.0 ) {\n\t\t\tx = 1.0 - x;\n\t\t}\n\t}\n\t// The final step is a few Newton-Raphson iterations to clean up our approximation for x, this is pretty cheap in general, and very cheap compared to an incomplete beta evaluation. The limits set on x come from the observation that the sign of eta and x-sin^2(theta) are the same.\n\tif ( eta < 0.0 ) {\n\t\tlower = 0.0;\n\t\tupper = s2;\n\t} else {\n\t\tlower = s2;\n\t\tupper = 1.0;\n\t}\n\t// If our initial approximation is out of bounds then bisect:\n\tif ( x < lower || x > upper ) {\n\t\tx = (lower+upper) / 2.0;\n\t}\n\troots = temmeRootFinder( -lu, alpha );\n\n\t// And iterate:\n\tx = newtonRaphsonIterate( roots, x, lower, upper, 32, 100 );\n\treturn x;\n}\n\n\n// EXPORTS //\n\nmodule.exports = temme2;\n"],"names":["evalpoly","require$$0","erfcinv","require$$1","abs","require$$2","exp","require$$3","ln","require$$4","sqrt","require$$5","sin","require$$6","cos","require$$7","temmeRootFinder","require$$8","newtonRaphsonIterate","require$$9","polyval1","require$$10","polyval2","require$$11","polyval3","require$$12","polyval4","require$$13","polyval5","require$$14","polyval6","require$$15","polyval7","require$$16","polyval8","require$$17","polyval9","require$$18","polyval10","require$$19","polyval11","require$$20","polyval12","require$$21","polyval13","require$$22","workspace","terms","temme2","z","r","theta","upper","lower","alpha","roots","eta0","eta","sc7","sc6","sc5","sc4","sc3","sc2","sc","lu","s2","c2","c","s","u","x","temme2_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAWC,EAAA,GACXC,IAAUC,EAAA,GACVC,IAAMC,EAAA,GACNC,IAAMC,GAAA,GACNC,IAAKC,GAAA,GACLC,IAAOC,GAAA,GACPC,IAAMC,GAAA,GACNC,IAAMC,GAAA,GACNC,IAAkBC,GAAA,GAClBC,IAAuBC,GAAA,GACvBC,IAAWC,GAAA,GACXC,IAAWC,GAAA,GACXC,IAAWC,GAAA,GACXC,IAAWC,GAAA,GACXC,IAAWC,GAAA,GACXC,IAAWC,GAAA,GACXC,IAAWC,GAAA,GACXC,IAAWC,GAAA,GACXC,IAAWC,GAAA,GACXC,IAAYC,GAAA,GACZC,IAAYC,GAAA,GACZC,IAAYC,GAAA,GACZC,IAAYC,GAAA,GAMZC,IAAY,CAAE,GAAK,GAAK,GAAK,GAAK,GAAK,CAAG,GAC1CC,IAAQ,CAAE,GAAK,GAAK,GAAK,CAAG;AAkBhC,WAASC,EAAQC,GAAGC,GAAGC,GAAQ;AAC9B,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,WAAAf,IAAOtD,EAAS,IAAI+C,CAAC,IAAM,CAACvC,EAAMwC,IAAE,IAEpCmB,IAAIzD,EAAKuC,CAAK,GACdiB,IAAItD,EAAKqC,CAAK,GAGdJ,EAAO,CAAC,IAAKS,GAGbU,IAAKG,IAAIA,GACTF,IAAKC,IAAIA,GACTJ,IAAKK,IAAID,GACTL,IAAMC,IAAKA,GACXF,IAAMC,IAAMC,GACZH,IAAME,IAAMA,GACZH,IAAMG,IAAMD,GACZH,IAAMG,IAAMA,GACZJ,IAAMG,IAAMC,GAGZhB,EAAW,CAAC,KAAO,IAAIoB,IAAM,MAAS,IAAIF,IAC1ClB,EAAW,CAAC,IAAK,CAAC1B,EAAU8C,CAAE,KAAM,KAAKH,IACzCjB,EAAW,CAAC,IAAKxB,EAAU4C,CAAE,KAAM,OAAOJ,IAC1ChB,EAAW,CAAC,IAAKtB,EAAU0C,CAAE,KAAM,OAAOL,IAC1Cf,EAAW,CAAC,IAAKpB,EAAUwC,CAAE,KAAM,QAAQN,IAC3Cd,EAAW,CAAC,IAAK,GACjBC,EAAO,CAAC,IAAK/C,EAAU8C,GAAWU,CAAI,GAGtCV,EAAW,CAAC,IAAK,CAAClB,EAAUsC,CAAE,KAAM,MAAMJ,IAC1ChB,EAAW,CAAC,IAAKhB,EAAUoC,CAAE,KAAM,OAAOL,IAC1Cf,EAAW,CAAC,IAAK,CAACd,EAAUkC,CAAE,KAAM,SAASN,IAC7Cd,EAAW,CAAC,IAAK,CAACZ,EAAUgC,CAAE,KAAM,UAAUP,IAC9Cb,EAAW,CAAC,IAAK,GACjBA,EAAW,CAAC,IAAK,GACjBC,EAAO,CAAC,IAAK/C,EAAU8C,GAAWU,CAAI,GAGtCV,EAAW,CAAC,IAAKV,EAAU8B,CAAE,KAAM,SAASN,IAC5Cd,EAAW,CAAC,IAAK,CAACR,EAAW4B,CAAE,KAAM,WAAWP,IAChDb,EAAW,CAAC,IAAKN,EAAW0B,CAAE,KAAM,WAAWR,IAC/CZ,EAAW,CAAC,IAAK,GACjBA,EAAW,CAAC,IAAK,GACjBA,EAAW,CAAC,IAAK,GACjBC,EAAO,CAAC,IAAK/C,EAAU8C,GAAWU,CAAI,GAGtCC,IAAMzD,EAAU+C,GAAO,IAAIG,CAAC,GAG5BI,IAAQc,IAAIC,GACZf,KAASA,GACTW,IAAO,EAAGR,IAAIA,MAAQ,IAAIS,KAAS1D,EAAG0D,CAAE,IAAMC,IAAG3D,EAAG2D,CAAE,IAAED,GAGnD9D,EAAIqD,CAAG,IAAI,OAEfX,EAAW,CAAC,IAAKoB,GACjBpB,EAAW,CAAC,IAAKkB,GACjBlB,EAAW,CAAC,KAAM,IAAK,IAAIoB,KAAO,GAClCpB,EAAW,CAAC,IAAKJ,EAAWwB,CAAE,KAAO,KAAKF,IAC1ClB,EAAW,CAAC,IAAKF,EAAWsB,CAAE,KAAO,MAAMH,IAC3CjB,EAAW,CAAC,IAAK,GACjByB,IAAIvE,EAAU8C,GAAWW,CAAG,MAG5Ba,IAAIhE,EAAK2D,CAAE,GACXnB,EAAW,CAAC,IAAKwB,GACjBxB,EAAW,CAAC,IAAKQ,GACjBR,EAAW,CAAC,IAAK,GACjBA,EAAW,CAAC,IAAK,IAAMQ,KAAU,IAAIA,IAAO,KAAO,GACnDR,EAAW,CAAC,IAAK,IAAMQ,KAAU,IAAIA,IAAO,MAAS,IAAIA,IAAO,KAAO,IACvER,EAAW,CAAC,IAAK,IAAMQ,KAAU,IAAIA,IAAO,MAAS,IAAIA,IAAO,MAAS,IAAIA,IAAO,KAAO,KAC3FiB,IAAIvE,EAAU8C,GAAWwB,CAAC,IAGpBC,IAAEL,KAAIT,IAAM,MACjBc,IAAI,IAAMA,KAIPd,IAAM,KACVJ,IAAQ,GACRD,IAAQc,MAERb,IAAQa,GACRd,IAAQ,KAGJmB,IAAIlB,KAASkB,IAAInB,OACrBmB,KAAKlB,IAAMD,KAAS,IAErBG,IAAQvC,EAAiB,CAACiD,GAAIX,CAAK,GAGnCiB,IAAIrD,EAAsBqC,GAAOgB,GAAGlB,GAAOD,GAAO,IAAI,GAAG,GAClDmB;AAAA,EACR;AAKA,SAAAC,IAAiBxB;;","x_google_ignoreList":[0]}

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

@@ -1,52 +0,0 @@
-import { __require as G } from "../../../../../@stdlib_math-base-special-gammaincinv@0.2.2/node_modules/@stdlib/math-base-special-gammaincinv/lib/index.js";
-import { __require as H } from "../../../../../@stdlib_math-base-special-ln@0.2.4/node_modules/@stdlib/math-base-special-ln/lib/index.js";
-import { __require as J } from "../../../../../@stdlib_math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/lib/index.js";
-import { __require as K } from "../../../../../@stdlib_constants-float64-smallest-subnormal@0.2.2/node_modules/@stdlib/constants-float64-smallest-subnormal/lib/index.js";
-import { __require as P } from "./root_finder.js";
-import { __require as Q } from "./newton_raphson.js";
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*
-*
-* ## Notice
-*
-* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/detail/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.
-*
-* ```text
-* Copyright John Maddock 2006.
-* Copyright Paul A. Bristow 2007.
-*
-* Use, modification and distribution are subject to the
-* Boost Software License, Version 1.0. (See accompanying file
-* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
-* ```
-*/
-var A, j;
-function e0() {
-  if (j) return A;
-  j = 1;
-  var M = G(), N = H(), k = J(), y = K(), z = P(), C = Q();
-  function D(m, h, g, B) {
-    var S, E, T, $, p, u, F, _, L, R, q, d, c, o, n, b, I, a, e, v, i, t, w, l, x, f, s, r, O, U;
-    return g < B ? p = M(g, h, !0) : p = M(B, h, !1), p /= m, o = h / m, r = k(1 + o), a = r * r, e = a * r, v = a * a, i = e * a, t = e * e, w = v * e, l = v * v, x = i * v, F = i * i, s = p - o, n = s * s, b = n * s, I = n * n, f = r + 1, _ = f * f, L = f * _, R = _ * _, q = (r + 2) * (r - 1) / (3 * r), q += (e + 9 * a + 21 * r + 5) * s / (36 * a * f), q -= (v - 13 * e + 69 * a + 167 * r + 46) * n / (1620 * _ * e), q -= (7 * i + 21 * v + 70 * e + 26 * a - 93 * r - 31) * b / (6480 * L * v), q -= (75 * t + 202 * i + 188 * v - 888 * e - 1345 * a + 118 * r + 138) * I / (272160 * R * i), d = (28 * v + 131 * e + 402 * a + 581 * r + 208) * (r - 1) / (1620 * f * e), d -= (35 * t - 154 * i - 623 * v - 1636 * e - 3983 * a - 3514 * r - 925) * s / (12960 * _ * v), d -= (2132 * w + 7915 * t + 16821 * i + 35066 * v + 87490 * e + 141183 * a + 95993 * r + 21640) * n / (816480 * i * L), d -= (11053 * l + 53308 * w + 117010 * t + 163924 * i + 116188 * v - 258428 * e - 677042 * a - 481940 * r - 105497) * b / (14696640 * R * t), c = -((3592 * w + 8375 * t - 1323 * i - 29198 * v - 89578 * e - 154413 * a - 116063 * r - 29632) * (r - 1)) / (816480 * i * _), c -= (442043 * x + 2054169 * l + 3803094 * w + 3470754 * t + 2141568 * i - 2393568 * v - 19904934 * e - 34714674 * a - 23128299 * r - 5253353) * s / (146966400 * t * L), c -= (116932 * F + 819281 * x + 2378172 * l + 4341330 * w + 6806004 * t + 10622748 * i + 18739500 * v + 30651894 * e + 30869976 * a + 15431867 * r + 2919016) * n / (146966400 * R * w), u = p + q / m + d / (m * m) + c / (m * m * m), u <= 0 && (u = y), O = u - o * N(u) + (1 + o) * N(1 + o) - o, S = 1 / (1 + o), T = u < o ? S : 0, $ = u < o ? 1 : S, U = (T + $) / 2, E = z(O, o), C(E, U, T, $, 32, 100);
-  }
-  return A = D, A;
-}
-export {
-  e0 as __require
-};
-//# sourceMappingURL=temme3.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"temme3.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-betaincinv@0.2.2/node_modules/@stdlib/math-base-special-kernel-betaincinv/lib/temme3.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/detail/ibeta_inverse.hpp}. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright John Maddock 2006.\n* Copyright Paul A. Bristow 2007.\n*\n* Use, modification and distribution are subject to the\n* Boost Software License, Version 1.0. (See accompanying file\n* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)\n* ```\n*/\n\n/* eslint-disable no-mixed-operators, max-len */\n\n'use strict';\n\n// MODULES //\n\nvar gammaincinv = require( '@stdlib/math-base-special-gammaincinv' );\nvar ln = require( '@stdlib/math-base-special-ln' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar SMALLEST_SUBNORMAL = require( '@stdlib/constants-float64-smallest-subnormal' );\nvar temmeRootFinder = require( './root_finder.js' );\nvar newtonRaphsonIterate = require( './newton_raphson.js' );\n\n\n// MAIN //\n\n/**\n* Carries out the third method by Temme (described in section 4).\n*\n* ## References\n*\n* -   Temme, N. M. 1992. \"Incomplete Laplace Integrals: Uniform Asymptotic Expansion with Application to the Incomplete Beta Function.\" _Journal of Computational and Applied Mathematics_ 41 (1–2): 1638–63. doi:[10.1016/0377-0427(92)90244-R](https://doi.org/10.1016/0377-0427(92)90244-R).\n*\n* @private\n* @param {PositiveNumber} a - function parameter\n* @param {PositiveNumber} b - function parameter\n* @param {Probability} p - function parameter\n* @param {Probability} q - probability equal to `1-p`\n* @returns {number} function value\n*/\nfunction temme3( a, b, p, q ) {\n\tvar cross;\n\tvar roots;\n\tvar lower;\n\tvar upper;\n\tvar eta0;\n\tvar eta;\n\tvar w10;\n\tvar w12;\n\tvar w13;\n\tvar w14;\n\tvar e1;\n\tvar e2;\n\tvar e3;\n\tvar mu;\n\tvar d2;\n\tvar d3;\n\tvar d4;\n\tvar w2;\n\tvar w3;\n\tvar w4;\n\tvar w5;\n\tvar w6;\n\tvar w7;\n\tvar w8;\n\tvar w9;\n\tvar w1;\n\tvar d;\n\tvar w;\n\tvar u;\n\tvar x;\n\n\t// Begin by getting an initial approximation for the quantity eta from the dominant part of the incomplete beta:\n\tif ( p < q ) {\n\t\teta0 = gammaincinv( p, b, true );\n\t} else {\n\t\teta0 = gammaincinv( q, b, false );\n\t}\n\teta0 /= a;\n\n\t// Define the variables and powers we'll need later on:\n\tmu = b / a;\n\tw = sqrt( 1.0+mu );\n\tw2 = w * w;\n\tw3 = w2 * w;\n\tw4 = w2 * w2;\n\tw5 = w3 * w2;\n\tw6 = w3 * w3;\n\tw7 = w4 * w3;\n\tw8 = w4 * w4;\n\tw9 = w5 * w4;\n\tw10 = w5 * w5;\n\td = eta0 - mu;\n\td2 = d * d;\n\td3 = d2 * d;\n\td4 = d2 * d2;\n\tw1 = w + 1.0;\n\tw12 = w1 * w1;\n\tw13 = w1 * w12;\n\tw14 = w12 * w12;\n\n\t// Now we need to compute the perturbation error terms that convert eta0 to eta, these are all polynomials of polynomials. Probably these should be re-written to use tabulated data (see examples above), but it's less of a win in this case as we need to calculate the individual powers for the denominator terms anyway, so we might as well use them for the numerator-polynomials as well. Refer to p154-p155 for the details of these expansions:\n\te1 = (w+2.0) * (w-1.0) / (3.0*w);\n\te1 += (w3 + 9.0*w2 + 21.0*w + 5.0) * d / (36.0*w2*w1);\n\te1 -= (w4 - 13.0*w3 + 69.0*w2 + 167.0*w + 46.0) * d2 / (1620.0*w12*w3);\n\te1 -= (7.0*w5 + 21.0*w4 + 70.0*w3 + 26.0*w2 - 93.0*w - 31.0) * d3 / (6480.0*w13*w4);\n\te1 -= (75.0*w6 + 202.0*w5 + 188.0*w4 - 888.0*w3 - 1345.0*w2 + 118.0*w + 138.0) * d4 / (272160.0*w14*w5);\n\n\te2 = (28.0*w4 + 131.0*w3 + 402.0*w2 + 581.0*w + 208.0) * (w-1.0) / (1620.0*w1*w3);\n\te2 -= (35.0*w6 - 154.0*w5 - 623.0*w4 - 1636.0*w3 - 3983.0*w2 - 3514.0*w - 925.0) * d / (12960.0*w12*w4);\n\te2 -= (2132.0*w7 + 7915.0*w6 + 16821.0*w5 + 35066.0*w4 + 87490.0*w3 + 141183.0*w2 + 95993.0*w + 21640.0) * d2 / (816480.0*w5*w13);\n\te2 -= (11053.0*w8 + 53308.0*w7 + 117010.0*w6 + 163924.0*w5 + 116188.0*w4 - 258428.0*w3 - 677042.0*w2 - 481940.0*w - 105497.0) * d3 / (14696640.0*w14*w6);\n\n\te3 = -((3592.0*w7 + 8375.0*w6 - 1323.0*w5 - 29198.0*w4 - 89578.0*w3 - 154413.0*w2 - 116063.0*w - 29632.0) * (w-1.0)) / (816480.0*w5*w12);\n\te3 -= (442043.0*w9 + 2054169.0*w8 + 3803094.0*w7 + 3470754.0*w6 + 2141568.0*w5 - 2393568.0*w4 - 19904934.0*w3 - 34714674.0*w2 - 23128299.0*w - 5253353.0) * d / (146966400.0*w6*w13);\n\te3 -= (116932.0*w10 + 819281.0*w9 + 2378172.0*w8 + 4341330.0*w7 + 6806004.0*w6 + 10622748.0*w5 + 18739500.0*w4 + 30651894.0*w3 + 30869976.0*w2 + 15431867.0*w + 2919016.0) * d2 / (146966400.0*w14*w7);\n\n\t// Combine eta0 and the error terms to compute eta (Second equation p155):\n\teta = eta0 + (e1/a) + (e2/(a*a)) + (e3/(a*a*a));\n\n\t/*\n\t\tNow we need to solve Eq 4.2 to obtain x.  For any given value of\n\t\teta there are two solutions to this equation, and since the distribution\n\t\tmay be very skewed, these are not related by x ~ 1-x we used when\n\t\timplementing section 3 above.  However we know that:\n\n\t\t\tcross < x <= 1       ; iff eta < mu\n\t\t\t\tx == cross   ; iff eta == mu\n\t\t\t\t0 <= x < cross    ; iff eta > mu\n\n\t\tWhere cross == 1 / (1 + mu)\n\t\tMany thanks to Prof Temme for clarifying this point. Therefore we'll just jump straight into Newton iterations to solve Eq 4.2 using these bounds, and simple bisection as the first guess, in practice this converges pretty quickly and we only need a few digits correct anyway:\n\t*/\n\tif ( eta <= 0 ) {\n\t\teta = SMALLEST_SUBNORMAL;\n\t}\n\tu = eta - ( mu*ln(eta) ) + ( ( 1.0+mu ) * ln( 1.0+mu ) ) - mu;\n\tcross = 1.0 / ( 1.0+mu );\n\tlower = (eta < mu) ? cross : 0.0;\n\tupper = (eta < mu) ? 1.0 : cross;\n\tx = (lower+upper) / 2.0;\n\troots = temmeRootFinder( u, mu );\n\treturn newtonRaphsonIterate( roots, x, lower, upper, 32, 100 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = temme3;\n"],"names":["gammaincinv","require$$0","ln","require$$1","sqrt","require$$2","SMALLEST_SUBNORMAL","require$$3","temmeRootFinder","require$$4","newtonRaphsonIterate","require$$5","temme3","a","b","p","q","cross","roots","lower","upper","eta0","eta","w10","w12","w13","w14","e1","e2","e3","mu","d2","d3","d4","w2","w3","w4","w5","w6","w7","w8","w9","w1","d","w","u","x","temme3_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,MAAIA,IAAcC,EAAA,GACdC,IAAKC,EAAA,GACLC,IAAOC,EAAA,GACPC,IAAqBC,EAAA,GACrBC,IAAkBC,EAAA,GAClBC,IAAuBC,EAAA;AAmB3B,WAASC,EAAQC,GAAGC,GAAGC,GAAGC,GAAI;AAC7B,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,WAAK/B,IAAIC,IACRK,IAAOrB,EAAae,GAAGD,GAAG,EAAI,IAE9BO,IAAOrB,EAAagB,GAAGF,GAAG,EAAK,GAEhCO,KAAQR,GAGRiB,IAAKhB,IAAID,GACT+B,IAAIxC,EAAM,IAAI0B,CAAE,GAChBI,IAAKU,IAAIA,GACTT,IAAKD,IAAKU,GACVR,IAAKF,IAAKA,GACVG,IAAKF,IAAKD,GACVI,IAAKH,IAAKA,GACVI,IAAKH,IAAKD,GACVK,IAAKJ,IAAKA,GACVK,IAAKJ,IAAKD,GACVb,IAAMc,IAAKA,GACXM,IAAItB,IAAOS,GACXC,IAAKY,IAAIA,GACTX,IAAKD,IAAKY,GACVV,IAAKF,IAAKA,GACVW,IAAKE,IAAI,GACTpB,IAAMkB,IAAKA,GACXjB,IAAMiB,IAAKlB,GACXE,IAAMF,IAAMA,GAGZG,KAAMiB,IAAE,MAAQA,IAAE,MAAQ,IAAIA,IAC9BjB,MAAOQ,IAAK,IAAID,IAAK,KAAKU,IAAI,KAAOD,KAAK,KAAKT,IAAGQ,IAClDf,MAAOS,IAAK,KAAKD,IAAK,KAAKD,IAAK,MAAMU,IAAI,MAAQb,KAAM,OAAOP,IAAIW,IACnER,MAAO,IAAIU,IAAK,KAAKD,IAAK,KAAKD,IAAK,KAAKD,IAAK,KAAKU,IAAI,MAAQZ,KAAM,OAAOP,IAAIW,IAChFT,MAAO,KAAKW,IAAK,MAAMD,IAAK,MAAMD,IAAK,MAAMD,IAAK,OAAOD,IAAK,MAAMU,IAAI,OAASX,KAAM,SAASP,IAAIW,IAEpGT,KAAM,KAAKQ,IAAK,MAAMD,IAAK,MAAMD,IAAK,MAAMU,IAAI,QAAUA,IAAE,MAAQ,OAAOF,IAAGP,IAC9EP,MAAO,KAAKU,IAAK,MAAMD,IAAK,MAAMD,IAAK,OAAOD,IAAK,OAAOD,IAAK,OAAOU,IAAI,OAASD,KAAK,QAAQnB,IAAIY,IACpGR,MAAO,OAAOW,IAAK,OAAOD,IAAK,QAAQD,IAAK,QAAQD,IAAK,QAAQD,IAAK,SAASD,IAAK,QAAQU,IAAI,SAAWb,KAAM,SAASM,IAAGZ,IAC7HG,MAAO,QAAQY,IAAK,QAAQD,IAAK,SAASD,IAAK,SAASD,IAAK,SAASD,IAAK,SAASD,IAAK,SAASD,IAAK,SAASU,IAAI,UAAYZ,KAAM,WAAWN,IAAIY,IAErJT,IAAK,GAAG,OAAOU,IAAK,OAAOD,IAAK,OAAOD,IAAK,QAAQD,IAAK,QAAQD,IAAK,SAASD,IAAK,SAASU,IAAI,UAAYA,IAAE,OAAS,SAASP,IAAGb,IACpIK,MAAO,SAASY,IAAK,UAAUD,IAAK,UAAUD,IAAK,UAAUD,IAAK,UAAUD,IAAK,UAAUD,IAAK,WAAWD,IAAK,WAAWD,IAAK,WAAWU,IAAI,WAAaD,KAAK,YAAYL,IAAGb,IAChLI,MAAO,SAASN,IAAM,SAASkB,IAAK,UAAUD,IAAK,UAAUD,IAAK,UAAUD,IAAK,WAAWD,IAAK,WAAWD,IAAK,WAAWD,IAAK,WAAWD,IAAK,WAAWU,IAAI,WAAab,KAAM,YAAYL,IAAIa,IAGnMjB,IAAMD,IAAQM,IAAGd,IAAMe,KAAIf,IAAEA,KAAOgB,KAAIhB,IAAEA,IAAEA,IAevCS,KAAO,MACXA,IAAMhB,IAEPuC,IAAIvB,IAAQQ,IAAG5B,EAAGoB,CAAG,KAAU,IAAIQ,KAAO5B,EAAI,IAAI4B,CAAE,IAAOA,GAC3Db,IAAQ,KAAQ,IAAIa,IACpBX,IAASG,IAAMQ,IAAMb,IAAQ,GAC7BG,IAASE,IAAMQ,IAAM,IAAMb,GAC3B6B,KAAK3B,IAAMC,KAAS,GACpBF,IAAQV,EAAiBqC,GAAGf,CAAE,GACvBpB,EAAsBQ,GAAO4B,GAAG3B,GAAOC,GAAO,IAAI,GAAG;AAAA,EAC7D;AAKA,SAAA2B,IAAiBnC;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-kernel-cos@0.2.3/node_modules/@stdlib/math-base-special-kernel-cos/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 cosine of a number on `[-π/4, π/4]`.\n*\n* @module @stdlib/math-base-special-kernel-cos\n*\n* @example\n* var kernelCos = require( '@stdlib/math-base-special-kernel-cos' );\n*\n* var v = kernelCos( 0.0, 0.0 );\n* // returns ~1.0\n*\n* v = kernelCos( 3.141592653589793/6.0, 0.0 );\n* // returns ~0.866\n*\n* v = kernelCos( 0.785, -1.144e-17 );\n* // returns ~0.707\n*\n* v = kernelCos( NaN, 0.0 );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["main","require$$0","lib"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AA2CA,MAAIA,IAAOC,EAAA;AAKX,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}