@milaboratories/miplots4 1.0.157 → 1.0.158

package/dist/node_modules/.pnpm/@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/expmulti.js

@@ -0,0 +1,78 @@
+import { __require as n } from "../../../../../@stdlib_math-base-special-ldexp@0.2.3/node_modules/@stdlib/math-base-special-ldexp/lib/index.js";
+import { __require as q } from "./polyval_p.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 following copyrights, licenses, and long comment were part of the original implementation available as part of [Go]{@link https://github.com/golang/go/blob/cb07765045aed5104a3df31507564ac99e6ddce8/src/math/exp.go}, which in turn was based on an implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/e_exp.c}. The implementation follows the original, but has been modified for JavaScript.
+*
+* ```text
+* Copyright (c) 2009 The Go Authors. All rights reserved.
+*
+* Redistribution and use in source and binary forms, with or without
+* modification, are permitted provided that the following conditions are
+* met:
+*
+*    * Redistributions of source code must retain the above copyright
+* notice, this list of conditions and the following disclaimer.
+*    * Redistributions in binary form must reproduce the above
+* copyright notice, this list of conditions and the following disclaimer
+* in the documentation and/or other materials provided with the
+* distribution.
+*    * Neither the name of Google Inc. nor the names of its
+* contributors may be used to endorse or promote products derived from
+* this software without specific prior written permission.
+*
+* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+* ```
+*
+* ```text
+* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.
+*
+* Developed at SunPro, a Sun Microsystems, Inc. business.
+* Permission to use, copy, modify, and distribute this
+* software is freely granted, provided that this notice
+* is preserved.
+* ```
+*/
+var u, v;
+function s() {
+  if (v) return u;
+  v = 1;
+  var l = n(), m = q();
+  function o(a, t, _) {
+    var r, e, i, p;
+    return r = a - t, e = r * r, i = r - e * m(e), p = 1 - (t - r * i / (2 - i) - a), l(p, _);
+  }
+  return u = o, u;
+}
+export {
+  s as __require
+};
+//# sourceMappingURL=expmulti.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/expmulti.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expmulti.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/expmulti.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 following copyrights, licenses, and long comment were part of the original implementation available as part of [Go]{@link https://github.com/golang/go/blob/cb07765045aed5104a3df31507564ac99e6ddce8/src/math/exp.go}, which in turn was based on an implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/e_exp.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (c) 2009 The Go Authors. All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions are\n* met:\n*\n*    * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n*    * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following disclaimer\n* in the documentation and/or other materials provided with the\n* distribution.\n*    * Neither the name of Google Inc. nor the names of its\n* contributors may be used to endorse or promote products derived from\n* this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n* ```\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ldexp = require( '@stdlib/math-base-special-ldexp' );\nvar polyvalP = require( './polyval_p.js' );\n\n\n// MAIN //\n\n/**\n* Computes \\\\(e^{r} 2^k\\\\) where \\\\(r = \\mathrm{hi} - \\mathrm{lo}\\\\) and \\\\(|r| \\leq \\ln(2)/2\\\\).\n*\n* @private\n* @param {number} hi - upper bound\n* @param {number} lo - lower bound\n* @param {integer} k - power of 2\n* @returns {number} function value\n*/\nfunction expmulti( hi, lo, k ) {\n\tvar r;\n\tvar t;\n\tvar c;\n\tvar y;\n\n\tr = hi - lo;\n\tt = r * r;\n\tc = r - ( t*polyvalP( t ) );\n\ty = 1.0 - ( lo - ( (r*c)/(2.0-c) ) - hi );\n\n\treturn ldexp( y, k );\n}\n\n\n// EXPORTS //\n\nmodule.exports = expmulti;\n"],"names":["ldexp","require$$0","polyvalP","require$$1","expmulti","hi","lo","k","t","c","y","expmulti_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkEA,MAAIA,IAAQC,EAAA,GACRC,IAAWC,EAAA;AAcf,WAASC,EAAUC,GAAIC,GAAIC,GAAI;AAC9B,QAAI,GACAC,GACAC,GACAC;AAEJ,eAAIL,IAAKC,GACTE,IAAI,IAAI,GACRC,IAAI,IAAMD,IAAEN,EAAUM,CAAC,GACvBE,IAAI,KAAQJ,IAAQ,IAAEG,KAAI,IAAIA,KAAOJ,IAE9BL,EAAOU,GAAGH,CAAC;AAAA,EACnB;AAKA,SAAAI,IAAiBP;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/index.js

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

package/dist/node_modules/.pnpm/@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/index.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Evaluate the natural exponential function.\n*\n* @module @stdlib/math-base-special-exp\n*\n* @example\n* var exp = require( '@stdlib/math-base-special-exp' );\n*\n* var v = exp( 4.0 );\n* // returns ~54.5982\n*\n* v = exp( -9.0 );\n* // returns ~1.234e-4\n*\n* v = exp( 0.0 );\n* // returns 1.0\n*\n* v = exp( NaN );\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]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/main.js

@@ -0,0 +1,81 @@
+import { __require as R } from "../../../../../@stdlib_math-base-assert-is-nan@0.2.2/node_modules/@stdlib/math-base-assert-is-nan/lib/index.js";
+import { __require as b } from "../../../../../@stdlib_math-base-special-trunc@0.2.2/node_modules/@stdlib/math-base-special-trunc/lib/index.js";
+import { __require as l } from "../../../../../@stdlib_constants-float64-ninf@0.2.2/node_modules/@stdlib/constants-float64-ninf/lib/index.js";
+import { __require as F } from "../../../../../@stdlib_constants-float64-pinf@0.2.2/node_modules/@stdlib/constants-float64-pinf/lib/index.js";
+import { __require as c } from "./expmulti.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 following copyrights, licenses, and long comment were part of the original implementation available as part of [Go]{@link https://github.com/golang/go/blob/cb07765045aed5104a3df31507564ac99e6ddce8/src/math/exp.go}, which in turn was based on an implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/e_exp.c}. The implementation follows the original, but has been modified for JavaScript.
+*
+* ```text
+* Copyright (c) 2009 The Go Authors. All rights reserved.
+*
+* Redistribution and use in source and binary forms, with or without
+* modification, are permitted provided that the following conditions are
+* met:
+*
+*    * Redistributions of source code must retain the above copyright
+* notice, this list of conditions and the following disclaimer.
+*    * Redistributions in binary form must reproduce the above
+* copyright notice, this list of conditions and the following disclaimer
+* in the documentation and/or other materials provided with the
+* distribution.
+*    * Neither the name of Google Inc. nor the names of its
+* contributors may be used to endorse or promote products derived from
+* this software without specific prior written permission.
+*
+* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+* ```
+*
+* ```text
+* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.
+*
+* Developed at SunPro, a Sun Microsystems, Inc. business.
+* Permission to use, copy, modify, and distribute this
+* software is freely granted, provided that this notice
+* is preserved.
+* ```
+*/
+var i, f;
+function M() {
+  if (f) return i;
+  f = 1;
+  var o = R(), a = b(), m = l(), u = F(), q = c(), L = 0.6931471803691238, p = 19082149292705877e-26, t = 1.4426950408889634, s = 709.782712893384, E = -745.1332191019411, n = 1 / (1 << 28), N = -n;
+  function O(r) {
+    var v, _, e;
+    return o(r) || r === u ? r : r === m ? 0 : r > s ? u : r < E ? 0 : r > N && r < n ? 1 + r : (r < 0 ? e = a(t * r - 0.5) : e = a(t * r + 0.5), v = r - e * L, _ = e * p, q(v, _, e));
+  }
+  return i = O, i;
+}
+export {
+  M as __require
+};
+//# sourceMappingURL=main.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/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* ## Notice\n*\n* The following copyrights, licenses, and long comment were part of the original implementation available as part of [Go]{@link https://github.com/golang/go/blob/cb07765045aed5104a3df31507564ac99e6ddce8/src/math/exp.go}, which in turn was based on an implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/e_exp.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (c) 2009 The Go Authors. All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions are\n* met:\n*\n*    * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n*    * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following disclaimer\n* in the documentation and/or other materials provided with the\n* distribution.\n*    * Neither the name of Google Inc. nor the names of its\n* contributors may be used to endorse or promote products derived from\n* this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n* ```\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar trunc = require( '@stdlib/math-base-special-trunc' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar expmulti = require( './expmulti.js' );\n\n\n// VARIABLES //\n\nvar LN2_HI = 6.93147180369123816490e-01;\nvar LN2_LO = 1.90821492927058770002e-10;\nvar LOG2_E = 1.44269504088896338700e+00;\nvar OVERFLOW = 7.09782712893383973096e+02;\nvar UNDERFLOW = -7.45133219101941108420e+02;\nvar NEARZERO = 1.0 / (1 << 28); // 2^-28\nvar NEG_NEARZERO = -NEARZERO;\n\n\n// MAIN //\n\n/**\n* Evaluates the natural exponential function.\n*\n* ## Method\n*\n* 1.  We reduce \\\\( x \\\\) to an \\\\( r \\\\) so that \\\\( |r| \\leq 0.5 \\cdot \\ln(2) \\approx 0.34658 \\\\). Given \\\\( x \\\\), we find an \\\\( r \\\\) and integer \\\\( k \\\\) such that\n*\n*     ```tex\n*     \\begin{align*}\n*     x &= k \\cdot \\ln(2) + r \\\\\n*     |r| &\\leq 0.5 \\cdot \\ln(2)\n*     \\end{align*}\n*     ```\n*\n*     <!-- <note> -->\n*\n*     \\\\( r \\\\) can be represented as \\\\( r = \\mathrm{hi} - \\mathrm{lo} \\\\) for better accuracy.\n*\n*     <!-- </note> -->\n*\n* 2.  We approximate of \\\\( e^{r} \\\\) by a special rational function on the interval \\\\(\\[0,0.34658]\\\\):\n*\n*     ```tex\n*     \\begin{align*}\n*     R\\left(r^2\\right) &= r \\cdot \\frac{ e^{r}+1 }{ e^{r}-1 } \\\\\n*     &= 2 + \\frac{r^2}{6} - \\frac{r^4}{360} + \\ldots\n*     \\end{align*}\n*     ```\n*\n*     We use a special Remes algorithm on \\\\(\\[0,0.34658]\\\\) to generate a polynomial of degree \\\\(5\\\\) to approximate \\\\(R\\\\). The maximum error of this polynomial approximation is bounded by \\\\(2^{-59}\\\\). In other words,\n*\n*     ```tex\n*     R(z) \\sim 2 + P_1 z + P_2 z^2 + P_3 z^3 + P_4 z^4 + P_5 z^5\n*     ```\n*\n*     where \\\\( z = r^2 \\\\) and\n*\n*     ```tex\n*     \\left|  2 + P_1 z + \\ldots + P_5 z^5  - R(z) \\right| \\leq 2^{-59}\n*     ```\n*\n*     <!-- <note> -->\n*\n*     The values of \\\\( P_1 \\\\) to \\\\( P_5 \\\\) are listed in the source code.\n*\n*     <!-- </note> -->\n*\n*     The computation of \\\\( e^{r} \\\\) thus becomes\n*\n*     ```tex\n*     \\begin{align*}\n*     e^{r} &= 1 + \\frac{2r}{R-r} \\\\\n*           &= 1 + r + \\frac{r \\cdot R_1(r)}{2 - R_1(r)}\\ \\text{for better accuracy}\n*     \\end{align*}\n*     ```\n*\n*     where\n*\n*     ```tex\n*     R_1(r) = r - P_1\\ r^2 + P_2\\ r^4 + \\ldots + P_5\\ r^{10}\n*     ```\n*\n* 3.  We scale back to obtain \\\\( e^{x} \\\\). From step 1, we have\n*\n*     ```tex\n*     e^{x} = 2^k e^{r}\n*     ```\n*\n* ## Special Cases\n*\n* ```tex\n* \\begin{align*}\n* e^\\infty &= \\infty \\\\\n* e^{-\\infty} &= 0 \\\\\n* e^{\\mathrm{NaN}} &= \\mathrm{NaN} \\\\\n* e^0 &= 1\\ \\mathrm{is\\ exact\\ for\\ finite\\ argument\\ only}\n* \\end{align*}\n* ```\n*\n* ## Notes\n*\n* -   According to an error analysis, the error is always less than \\\\(1\\\\) ulp (unit in the last place).\n*\n* -   For an IEEE double,\n*\n*     -   if \\\\(x > 7.09782712893383973096\\mbox{e+}02\\\\), then \\\\(e^{x}\\\\) overflows\n*     -   if \\\\(x < -7.45133219101941108420\\mbox{e+}02\\\\), then \\\\(e^{x}\\\\) underflows\n*\n* -   The hexadecimal values included in the source code are the intended ones for the used constants. Decimal values may be used, provided that the compiler will convert from decimal to binary accurately enough to produce the intended hexadecimal values.\n*\n* @param {number} x - input value\n* @returns {number} function value\n*\n* @example\n* var v = exp( 4.0 );\n* // returns ~54.5982\n*\n* @example\n* var v = exp( -9.0 );\n* // returns ~1.234e-4\n*\n* @example\n* var v = exp( 0.0 );\n* // returns 1.0\n*\n* @example\n* var v = exp( NaN );\n* // returns NaN\n*/\nfunction exp( x ) {\n\tvar hi;\n\tvar lo;\n\tvar k;\n\n\tif ( isnan( x ) || x === PINF ) {\n\t\treturn x;\n\t}\n\tif ( x === NINF ) {\n\t\treturn 0.0;\n\t}\n\tif ( x > OVERFLOW ) {\n\t\treturn PINF;\n\t}\n\tif ( x < UNDERFLOW ) {\n\t\treturn 0.0;\n\t}\n\tif (\n\t\tx > NEG_NEARZERO &&\n\t\tx < NEARZERO\n\t) {\n\t\treturn 1.0 + x;\n\t}\n\t// Reduce and compute `r = hi - lo` for extra precision...\n\tif ( x < 0.0 ) {\n\t\tk = trunc( (LOG2_E*x) - 0.5 );\n\t} else {\n\t\tk = trunc( (LOG2_E*x) + 0.5 );\n\t}\n\thi = x - (k*LN2_HI);\n\tlo = k * LN2_LO;\n\n\treturn expmulti( hi, lo, k );\n}\n\n\n// EXPORTS //\n\nmodule.exports = exp;\n"],"names":["isnan","require$$0","trunc","require$$1","NINF","require$$2","PINF","require$$3","expmulti","require$$4","LN2_HI","LN2_LO","LOG2_E","OVERFLOW","UNDERFLOW","NEARZERO","NEG_NEARZERO","exp","x","hi","lo","k","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkEA,MAAIA,IAAQC,EAAA,GACRC,IAAQC,EAAA,GACRC,IAAOC,EAAA,GACPC,IAAOC,EAAA,GACPC,IAAWC,EAAA,GAKXC,IAAS,oBACTC,IAAS,uBACTC,IAAS,oBACTC,IAAW,kBACXC,IAAY,oBACZC,IAAW,KAAO,KAAK,KACvBC,IAAe,CAACD;AAkHpB,WAASE,EAAKC,GAAI;AACjB,QAAIC,GACAC,GACAC;AAEJ,WAAKrB,EAAOkB,MAAOA,MAAMZ,IACjBY,IAEHA,MAAMd,IACH,IAEHc,IAAIL,IACDP,IAEHY,IAAIJ,IACD,IAGPI,IAAIF,KACJE,IAAIH,IAEG,IAAMG,KAGTA,IAAI,IACRG,IAAInB,EAAQU,IAAOM,IAAK,GAAG,IAE3BG,IAAInB,EAAQU,IAAOM,IAAK,GAAG,GAE5BC,IAAKD,IAAKG,IAAEX,GACZU,IAAKC,IAAIV,GAEFH,EAAUW,GAAIC,GAAIC,CAAC;AAAA,EAC3B;AAKA,SAAAC,IAAiBL;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/polyval_p.js

@@ -0,0 +1,30 @@
+/**
+* @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, u;
+function l() {
+  if (u) return e;
+  u = 1;
+  function a(r) {
+    return r === 0 ? 0.16666666666666602 : 0.16666666666666602 + r * (-0.0027777777777015593 + r * (6613756321437934e-20 + r * (-16533902205465252e-22 + r * 41381367970572385e-24)));
+  }
+  return e = a, e;
+}
+export {
+  l as __require
+};
+//# sourceMappingURL=polyval_p.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/polyval_p.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polyval_p.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-exp@0.2.4/node_modules/@stdlib/math-base-special-exp/lib/polyval_p.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.16666666666666602;\n\t}\n\treturn 0.16666666666666602 + (x * (-0.0027777777777015593 + (x * (0.00006613756321437934 + (x * (-0.0000016533902205465252 + (x * 4.1381367970572385e-8))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_p"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoCA,WAASA,EAAUC,GAAI;AACtB,WAAKA,MAAM,IACH,sBAED,sBAAuBA,KAAK,yBAA0BA,KAAK,uBAA0BA,KAAK,yBAA6BA,IAAI;AAAA,EACnI;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-expm1@0.2.3/node_modules/@stdlib/math-base-special-expm1/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 `exp(x) - 1`.\n*\n* @module @stdlib/math-base-special-expm1\n*\n* @example\n* var expm1 = require( '@stdlib/math-base-special-expm1' );\n*\n* var v = expm1( 0.2 );\n* // returns ~0.221\n*\n* v = expm1( -9.0 );\n* // returns ~-0.999\n*\n* v = expm1( 0.0 );\n* // returns 0.0\n*\n* v = expm1( NaN );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar expm1 = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = expm1;\n"],"names":["expm1","require$$0","lib"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AA2CA,MAAIA,IAAQC,EAAA;AAKZ,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-expm1@0.2.3/node_modules/@stdlib/math-base-special-expm1/lib/main.js

@@ -0,0 +1,74 @@
+import { __require as P } from "../../../../../@stdlib_math-base-assert-is-nan@0.2.2/node_modules/@stdlib/math-base-assert-is-nan/lib/index.js";
+import { __require as R } from "../../../../../@stdlib_number-float64-base-get-high-word@0.2.2/node_modules/@stdlib/number-float64-base-get-high-word/lib/index.js";
+import { __require as T } from "../../../../../@stdlib_number-float64-base-set-high-word@0.2.2/node_modules/@stdlib/number-float64-base-set-high-word/lib/index.js";
+import { __require as X } from "../../../../../@stdlib_number-float64-base-from-words@0.2.2/node_modules/@stdlib/number-float64-base-from-words/lib/index.js";
+import { __require as k } from "../../../../../@stdlib_constants-float64-pinf@0.2.2/node_modules/@stdlib/constants-float64-pinf/lib/index.js";
+import { __require as M } from "../../../../../@stdlib_constants-float64-ninf@0.2.2/node_modules/@stdlib/constants-float64-ninf/lib/index.js";
+import { __require as S } from "../../../../../@stdlib_constants-float64-exponent-bias@0.2.2/node_modules/@stdlib/constants-float64-exponent-bias/lib/index.js";
+import { __require as V } from "../../../../../@stdlib_constants-float64-half-ln-two@0.2.2/node_modules/@stdlib/constants-float64-half-ln-two/lib/index.js";
+import { __require as w } from "./polyval_q.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 following copyright, license, and long comment were part of the original implementation available as part of [FDLIBM]{@link http://www.netlib.org/fdlibm/s_expm1.c} and [FreeBSD]{@link https://svnweb.freebsd.org/base/release/12.2.0/lib/msun/src/s_expm1.c}. The implementation follows the original, but has been modified for JavaScript.
+*
+* ```text
+* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.
+*
+* Developed at SunPro, a Sun Microsystems, Inc. business.
+* Permission to use, copy, modify, and distribute this
+* software is freely granted, provided that this notice
+* is preserved.
+* ```
+*/
+var p, F;
+function U() {
+  if (F) return p;
+  F = 1;
+  var O = P(), N = R(), _ = T(), I = X(), b = k(), d = M(), H = S(), g = V(), A = w(), E = 709.782712893384, n = 0.6931471803691238, s = 19082149292705877e-26, $ = 1.4426950408889634, W = 38.816242111356935, c = 1.0397207708399179;
+  function y(r) {
+    var q, m, t, u, o, h, L, e, v, l, a, f, i;
+    if (r === b || O(r))
+      return r;
+    if (r === d)
+      return -1;
+    if (r === 0)
+      return r;
+    if (r < 0 ? (t = !0, e = -r) : (t = !1, e = r), e >= W) {
+      if (t)
+        return -1;
+      if (e >= E)
+        return b;
+    }
+    if (h = N(e) | 0, e > g)
+      e < c ? t ? (u = r + n, o = -s, i = -1) : (u = r - n, o = s, i = 1) : (t ? i = $ * r - 0.5 : i = $ * r + 0.5, i |= 0, a = i, u = r - a * n, o = a * s), r = u - o, l = u - r - o;
+    else {
+      if (h < 1016070144)
+        return r;
+      i = 0;
+    }
+    return q = 0.5 * r, v = r * q, L = 1 + v * A(v), a = 3 - L * q, f = v * ((L - a) / (6 - r * a)), i === 0 ? r - (r * f - v) : (m = I(H + i << 20, 0), f = r * (f - l) - l, f -= v, i === -1 ? 0.5 * (r - f) - 0.5 : i === 1 ? r < -0.25 ? -2 * (f - (r + 0.5)) : 1 + 2 * (r - f) : i <= -2 || i > 56 ? (e = 1 - (f - r), i === 1024 ? (u = N(e) + (i << 20) | 0, e = _(e, u)) : e *= m, e - 1) : (a = 1, i < 20 ? (u = 1072693248 - (2097152 >> i) | 0, a = _(a, u), e = a - (f - r)) : (u = H - i << 20 | 0, a = _(a, u), e = r - (f + a), e += 1), e *= m, e));
+  }
+  return p = y, p;
+}
+export {
+  U as __require
+};
+//# sourceMappingURL=main.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-expm1@0.2.3/node_modules/@stdlib/math-base-special-expm1/lib/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-expm1@0.2.3/node_modules/@stdlib/math-base-special-expm1/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* ## Notice\n*\n* The following copyright, license, and long comment were part of the original implementation available as part of [FDLIBM]{@link http://www.netlib.org/fdlibm/s_expm1.c} and [FreeBSD]{@link https://svnweb.freebsd.org/base/release/12.2.0/lib/msun/src/s_expm1.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\nvar setHighWord = require( '@stdlib/number-float64-base-set-high-word' );\nvar fromWords = require( '@stdlib/number-float64-base-from-words' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar FLOAT64_EXPONENT_BIAS = require( '@stdlib/constants-float64-exponent-bias' );\nvar HALF_LN2 = require( '@stdlib/constants-float64-half-ln-two' );\nvar polyval = require( './polyval_q.js' );\n\n\n// VARIABLES //\n\nvar OVERFLOW_THRESHOLD = 7.09782712893383973096e+02; // 0x40862E42 0xFEFA39EF\n\n// High and low words of ln(2):\nvar LN2_HI = 6.93147180369123816490e-01; // 0x3FE62E42 0xFEE00000\nvar LN2_LO = 1.90821492927058770002e-10; // 0x3DEA39EF 0x35793C76\n\n// 1 / ln(2):\nvar LN2_INV = 1.44269504088896338700e+00; // 0x3FF71547 0x652B82FE\n\n// ln(2) * 56:\nvar LN2x56 = 3.88162421113569373274e+01; // 0x4043687A 0x9F1AF2B1\n\n// ln(2) * 1.5:\nvar LN2_HALFX3 = 1.03972077083991796413e+00; // 0x3FF0A2B2 0x3F3BAB73\n\n\n// MAIN //\n\n/**\n* Computes `exp(x) - 1`.\n*\n* ## Method\n*\n* 1.  Given \\\\(x\\\\), we use argument reduction to find \\\\(r\\\\) and an integer \\\\(k\\\\) such that\n*\n*     ```tex\n*     x = k \\cdot \\ln(2) + r\n*     ```\n*\n*     where\n*\n*     ```tex\n*     |r| \\leq \\frac{\\ln(2)}{2} \\approx 0.34658\n*     ```\n*\n*     <!-- <note> -->\n*\n*     A correction term \\\\(c\\\\) will need to be computed to compensate for the error in \\\\(r\\\\) when rounded to a floating-point number.\n*\n*     <!-- </note> -->\n*\n* 2.  To approximate \\\\(\\operatorname{expm1}(r)\\\\), we use a special rational function on the interval \\\\(\\[0,0.34658]\\\\). Since\n*\n*     ```tex\n*     r \\frac{e^r + 1}{e^r - 1} = 2 + \\frac{r^2}{6} - \\frac{r^4}{360} + \\ldots\n*     ```\n*\n*     we define \\\\(\\operatorname{R1}(r^2)\\\\) by\n*\n*     ```tex\n*     r \\frac{e^r + 1}{e^r - 1} = 2 + \\frac{r^2}{6} \\operatorname{R1}(r^2)\n*     ```\n*\n*     That is,\n*\n*     ```tex\n*     \\begin{align*}\n*     \\operatorname{R1}(r^2) &= \\frac{6}{r} \\biggl(\\frac{e^r+1}{e^r-1} - \\frac{2}{r}\\biggr) \\\\\n*     &= \\frac{6}{r} \\biggl( 1 + 2 \\biggl(\\frac{1}{e^r-1} - \\frac{1}{r}\\biggr)\\biggr) \\\\\n*     &= 1 - \\frac{r^2}{60} + \\frac{r^4}{2520} - \\frac{r^6}{100800} + \\ldots\n*     \\end{align*}\n*     ```\n*\n*     We use a special Remes algorithm on \\\\(\\[0,0.347]\\\\) to generate a polynomial of degree \\\\(5\\\\) in \\\\(r^2\\\\) to approximate \\\\(\\mathrm{R1}\\\\). The maximum error of this polynomial approximation is bounded by \\\\(2^{-61}\\\\). In other words,\n*\n*     ```tex\n*     \\operatorname{R1}(z) \\approx 1 + \\mathrm{Q1} \\cdot z + \\mathrm{Q2} \\cdot z^2 + \\mathrm{Q3} \\cdot z^3 + \\mathrm{Q4} \\cdot z^4 + \\mathrm{Q5} \\cdot z^5\n*     ```\n*\n*     where\n*\n*     ```tex\n*     \\begin{align*}\n*     \\mathrm{Q1} &= -1.6666666666666567384\\mbox{e-}2 \\\\\n*     \\mathrm{Q2} &= 3.9682539681370365873\\mbox{e-}4 \\\\\n*     \\mathrm{Q3} &= -9.9206344733435987357\\mbox{e-}6 \\\\\n*     \\mathrm{Q4} &= 2.5051361420808517002\\mbox{e-}7 \\\\\n*     \\mathrm{Q5} &= -6.2843505682382617102\\mbox{e-}9\n*     \\end{align*}\n*     ```\n*\n*     where \\\\(z = r^2\\\\) and the values of \\\\(\\mathrm{Q1}\\\\) to \\\\(\\mathrm{Q5}\\\\) are listed in the source. The error is bounded by\n*\n*     ```tex\n*     \\biggl| 1 + \\mathrm{Q1} \\cdot z + \\ldots + \\mathrm{Q5} \\cdot z - \\operatorname{R1}(z) \\biggr| \\leq 2^{-61}\n*     ```\n*\n*     \\\\(\\operatorname{expm1}(r) = e^r - 1\\\\) is then computed by the following specific way which minimizes the accumulated rounding error\n*\n*     ```tex\n*     \\operatorname{expm1}(r) = r + \\frac{r^2}{2} + \\frac{r^3}{2} \\biggl( \\frac{3 - (\\mathrm{R1} + \\mathrm{R1} \\cdot \\frac{r}{2})}{6 - r ( 3 - \\mathrm{R1} \\cdot \\frac{r}{2})} \\biggr)\n*     ```\n*\n*     To compensate for the error in the argument reduction, we use\n*\n*     ```tex\n*     \\begin{align*}\n*     \\operatorname{expm1}(r+c) &= \\operatorname{expm1}(r) + c + \\operatorname{expm1}(r) \\cdot c \\\\\n*     &\\approx \\operatorname{expm1}(r) + c + rc\n*     \\end{align*}\n*     ```\n*\n*     Thus, \\\\(c + rc\\\\) will be added in as the correction terms for \\\\(\\operatorname{expm1}(r+c)\\\\). Now, we can rearrange the term to avoid optimization screw up.\n*\n*     ```tex\n*     \\begin{align*}\n*     \\operatorname{expm1}(r+c) &\\approx r - \\biggl( \\biggl( r + \\biggl( \\frac{r^2}{2} \\biggl( \\frac{\\mathrm{R1} - (3 - \\mathrm{R1} \\cdot \\frac{r}{2})}{6 - r (3 - \\mathrm{R1} \\cdot \\frac{r}{2})} \\biggr) - c \\biggr) - c \\biggr) - \\frac{r^2}{2} \\biggr) \\\\\n*     &= r - \\mathrm{E}\n*     \\end{align*}\n*     ```\n*\n* 3.  To scale back to obtain \\\\(\\operatorname{expm1}(x)\\\\), we have (from step 1)\n*\n*     ```tex\n*     \\operatorname{expm1}(x) = \\begin{cases}\n*     2^k  (\\operatorname{expm1}(r) + 1) - 1 \\\\\n*     2^k (\\operatorname{expm1}(r) + (1-2^{-k}))\n*     \\end{cases}\n*     ```\n*\n* ## Special Cases\n*\n* ```tex\n* \\begin{align*}\n* \\operatorname{expm1}(\\infty) &= \\infty \\\\\n* \\operatorname{expm1}(-\\infty) &= -1 \\\\\n* \\operatorname{expm1}(\\mathrm{NaN}) &= \\mathrm{NaN}\n* \\end{align*}\n* ```\n*\n* ## Notes\n*\n* -   For finite arguments, only \\\\(\\operatorname{expm1}(0) = 0\\\\) is exact.\n*\n* -   To save one multiplication, we scale the coefficient \\\\(\\mathrm{Qi}\\\\) to \\\\(\\mathrm{Qi} \\cdot {2^i}\\\\) and replace \\\\(z\\\\) by \\\\(\\frac{x^2}{2}\\\\).\n*\n* -   To achieve maximum accuracy, we compute \\\\(\\operatorname{expm1}(x)\\\\) by\n*\n*     -   if \\\\(x < -56 \\cdot \\ln(2)\\\\), return \\\\(-1.0\\\\) (raise inexact if \\\\(x\\\\) does not equal \\\\(\\infty\\\\))\n*\n*     -   if \\\\(k = 0\\\\), return \\\\(r-\\mathrm{E}\\\\)\n*\n*     -   if \\\\(k = -1\\\\), return \\\\(\\frac{(r-\\mathrm{E})-1}{2}\\\\)\n*\n*     -   if \\\\(k = 1\\\\),\n*\n*         -   if \\\\(r < -0.25\\\\), return \\\\(2((r+0.5)- \\mathrm{E})\\\\)\n*         -   else return \\\\(1+2(r-\\mathrm{E})\\\\)\n*\n*     -   if \\\\(k < -2\\\\) or \\\\(k > 56\\\\), return \\\\(2^k(1-(\\mathrm{E}-r)) - 1\\\\) (or \\\\(e^x-1\\\\))\n*\n*     -   if \\\\(k \\leq 20\\\\), return \\\\(2^k((1-2^{-k})-(\\mathrm{E}-r))\\\\)\n*\n*     -   else return \\\\(2^k(1-((\\mathrm{E}+2^{-k})-r))\\\\)\n*\n* -   For IEEE 754 double, if \\\\(x > 7.09782712893383973096\\mbox{e+}02\\\\), then \\\\(\\operatorname{expm1}(x)\\\\) will overflow.\n*\n* -   The hexadecimal values listed in the source are the intended ones for the implementation constants. Decimal values may be used, provided that the compiler will convert from decimal to binary accurately enough to produce the intended hexadecimal values.\n*\n* -   According to an error analysis, the error is always less than \\\\(1\\\\) ulp (unit in the last place).\n*\n* @param {number} x - input value\n* @returns {number} function value\n*\n* @example\n* var v = expm1( 0.2 );\n* // returns ~0.221\n*\n* @example\n* var v = expm1( -9.0 );\n* // returns ~-0.9999\n*\n* @example\n* var v = expm1( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = expm1( NaN );\n* // returns NaN\n*/\nfunction expm1( x ) {\n\tvar halfX;\n\tvar twopk;\n\tvar sign;\n\tvar hi;\n\tvar lo;\n\tvar hx;\n\tvar r1;\n\tvar y;\n\tvar z;\n\tvar c;\n\tvar t;\n\tvar e;\n\tvar k;\n\n\tif ( x === PINF || isnan( x ) ) {\n\t\treturn x;\n\t}\n\tif ( x === NINF ) {\n\t\treturn -1.0;\n\t}\n\tif ( x === 0.0 ) {\n\t\treturn x; // handles +-0 (IEEE 754-2008)\n\t}\n\t// Set y = |x|:\n\tif ( x < 0.0 ) {\n\t\tsign = true;\n\t\ty = -x;\n\t} else {\n\t\tsign = false;\n\t\ty = x;\n\t}\n\t// Filter out huge and non-finite arguments...\n\tif ( y >= LN2x56 ) { // if |x| >= 56*ln(2)\n\t\tif ( sign ) { // if x <= -56*ln(2)\n\t\t\treturn -1.0;\n\t\t}\n\t\tif ( y >= OVERFLOW_THRESHOLD ) { // if |x| >= 709.78...\n\t\t\treturn PINF;\n\t\t}\n\t}\n\t// Extract the more significant bits from |x|:\n\thx = getHighWord( y )|0; // asm type annotation\n\n\t// Argument reduction...\n\tif ( y > HALF_LN2 ) { // if |x| > 0.5*ln(2)\n\t\tif ( y < LN2_HALFX3 ) { // if |x| < 1.5*ln(2)\n\t\t\tif ( sign ) {\n\t\t\t\thi = x + LN2_HI;\n\t\t\t\tlo = -LN2_LO;\n\t\t\t\tk = -1;\n\t\t\t} else {\n\t\t\t\thi = x - LN2_HI;\n\t\t\t\tlo = LN2_LO;\n\t\t\t\tk = 1;\n\t\t\t}\n\t\t} else {\n\t\t\tif ( sign ) {\n\t\t\t\tk = (LN2_INV*x) - 0.5;\n\t\t\t} else {\n\t\t\t\tk = (LN2_INV*x) + 0.5;\n\t\t\t}\n\t\t\tk |= 0; // use a bitwise OR to cast `k` to an integer (see also asm.js type annotations: http://asmjs.org/spec/latest/#annotations)\n\t\t\tt = k;\n\t\t\thi = x - (t*LN2_HI); // t*ln2_hi is exact here\n\t\t\tlo = t * LN2_LO;\n\t\t}\n\t\tx = hi - lo;\n\t\tc = (hi-x) - lo;\n\t}\n\t// If |x| < 2**-54 => high word: 0 01111001001 00000000000000000000 => 0x3c900000 = 1016070144  => exponent = 01111001001 = 969 = 1023-54\n\telse if ( hx < 1016070144 ) {\n\t\treturn x;\n\t} else {\n\t\tk = 0;\n\t}\n\t// x is now in primary range...\n\thalfX = 0.5 * x;\n\tz = x * halfX;\n\n\tr1 = 1.0 + ( z * polyval( z ) );\n\n\tt = 3.0 - (r1*halfX);\n\te = z * ( (r1-t) / (6.0 - (x*t)) );\n\tif ( k === 0 ) {\n\t\treturn x - ( (x*e) - z );\t// c is 0\n\t}\n\ttwopk = fromWords( (FLOAT64_EXPONENT_BIAS+k)<<20, 0 ); // 2^k\n\te = ( x * (e-c) ) - c;\n\te -= z;\n\tif ( k === -1 ) {\n\t\treturn ( 0.5*(x-e) ) - 0.5;\n\t}\n\tif ( k === 1 ) {\n\t\tif ( x < -0.25 ) {\n\t\t\treturn -2.0 * ( e - (x+0.5) );\n\t\t}\n\t\treturn 1.0 + ( 2.0 * (x-e) );\n\t}\n\tif ( k <= -2 || k > 56 ) { // suffice to return exp(x)-1\n\t\ty = 1.0 - (e-x);\n\t\tif ( k === 1024 ) {\n\t\t\t// Add k to y's exponent:\n\t\t\thi = (getHighWord( y ) + (k<<20))|0; // asm type annotation\n\t\t\ty = setHighWord( y, hi );\n\t\t} else {\n\t\t\ty *= twopk;\n\t\t}\n\t\treturn y - 1.0;\n\t}\n\tt = 1.0;\n\tif ( k < 20 ) {\n\t\t// 0x3ff00000 - (0x200000>>k) = 1072693248 - (0x200000>>k) => 0x3ff00000 = 00111111111100000000000000000000 and 0x200000 = 0 00000000010 00000000000000000000\n\t\thi = (1072693248 - (0x200000>>k))|0; // asm type annotation\n\t\tt = setHighWord( t, hi ); // t=1-2^-k\n\t\ty = t - (e-x);\n\t} else {\n\t\thi = ( (FLOAT64_EXPONENT_BIAS-k)<<20 )|0; // asm type annotation\n\t\tt = setHighWord( t, hi ); // t=2^-k\n\t\ty = x - (e+t);\n\t\ty += 1.0;\n\t}\n\ty *= twopk;\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = expm1;\n"],"names":["isnan","require$$0","getHighWord","require$$1","setHighWord","require$$2","fromWords","require$$3","PINF","require$$4","NINF","require$$5","FLOAT64_EXPONENT_BIAS","require$$6","HALF_LN2","require$$7","polyval","require$$8","OVERFLOW_THRESHOLD","LN2_HI","LN2_LO","LN2_INV","LN2x56","LN2_HALFX3","expm1","x","halfX","twopk","sign","hi","lo","hx","r1","y","z","c","t","e","k","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAQC,EAAA,GACRC,IAAcC,EAAA,GACdC,IAAcC,EAAA,GACdC,IAAYC,EAAA,GACZC,IAAOC,EAAA,GACPC,IAAOC,EAAA,GACPC,IAAwBC,EAAA,GACxBC,IAAWC,EAAA,GACXC,IAAUC,EAAA,GAKVC,IAAqB,kBAGrBC,IAAS,oBACTC,IAAS,uBAGTC,IAAU,oBAGVC,IAAS,oBAGTC,IAAa;AAuKjB,WAASC,EAAOC,GAAI;AACnB,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,QAAKb,MAAMjB,KAAQR,EAAOyB,CAAC;AAC1B,aAAOA;AAER,QAAKA,MAAMf;AACV,aAAO;AAER,QAAKe,MAAM;AACV,aAAOA;AAWR,QARKA,IAAI,KACRG,IAAO,IACPK,IAAI,CAACR,MAELG,IAAO,IACPK,IAAIR,IAGAQ,KAAKX,GAAS;AAClB,UAAKM;AACJ,eAAO;AAER,UAAKK,KAAKf;AACT,eAAOV;AAAA,IAEV;AAKC,QAHAuB,IAAK7B,EAAa+B,CAAC,IAAG,GAGjBA,IAAInB;AACR,MAAKmB,IAAIV,IACHK,KACJC,IAAKJ,IAAIN,GACTW,IAAK,CAACV,GACNkB,IAAI,OAEJT,IAAKJ,IAAIN,GACTW,IAAKV,GACLkB,IAAI,MAGAV,IACJU,IAAKjB,IAAQI,IAAK,MAElBa,IAAKjB,IAAQI,IAAK,KAEnBa,KAAK,GACLF,IAAIE,GACJT,IAAKJ,IAAKW,IAAEjB,GACZW,IAAKM,IAAIhB,IAEVK,IAAII,IAAKC,GACTK,IAAKN,IAAGJ,IAAKK;AAAA,SAGT;AAAA,UAAKC,IAAK;AACd,eAAON;AAEP,MAAAa,IAAI;AAAA;AAUL,WAPAZ,IAAQ,MAAMD,GACdS,IAAIT,IAAIC,GAERM,IAAK,IAAQE,IAAIlB,EAASkB,CAAC,GAE3BE,IAAI,IAAOJ,IAAGN,GACdW,IAAIH,MAAOF,IAAGI,MAAM,IAAOX,IAAEW,KACxBE,MAAM,IACHb,KAAOA,IAAEY,IAAKH,MAEtBP,IAAQrB,EAAYM,IAAsB0B,KAAI,IAAI,IAClDD,IAAMZ,KAAKY,IAAEF,KAAOA,GACpBE,KAAKH,GACAI,MAAM,KACD,OAAKb,IAAEY,KAAO,MAEnBC,MAAM,IACLb,IAAI,QACD,MAASY,KAAKZ,IAAE,QAEjB,IAAQ,KAAOA,IAAEY,KAEpBC,KAAK,MAAMA,IAAI,MACnBL,IAAI,KAAOI,IAAEZ,IACRa,MAAM,QAEVT,IAAM3B,EAAa+B,CAAC,KAAMK,KAAG,MAAK,GAClCL,IAAI7B,EAAa6B,GAAGJ,CAAE,KAEtBI,KAAKN,GAECM,IAAI,MAEZG,IAAI,GACCE,IAAI,MAERT,IAAM,cAAc,WAAUS,KAAI,GAClCF,IAAIhC,EAAagC,GAAGP,IACpBI,IAAIG,KAAKC,IAAEZ,OAEXI,IAAQjB,IAAsB0B,KAAI,KAAK,GACvCF,IAAIhC,EAAagC,GAAGP,IACpBI,IAAIR,KAAKY,IAAED,IACXH,KAAK,IAENA,KAAKN,GACEM;AAAA,EACR;AAKA,SAAAM,IAAiBf;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-expm1@0.2.3/node_modules/@stdlib/math-base-special-expm1/lib/polyval_q.js

@@ -0,0 +1,30 @@
+/**
+* @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, u;
+function l() {
+  if (u) return e;
+  u = 1;
+  function a(r) {
+    return r === 0 ? -0.03333333333333313 : -0.03333333333333313 + r * (0.0015873015872548146 + r * (-793650757867488e-19 + r * (4008217827329362e-21 + r * -20109921818362437e-23)));
+  }
+  return e = a, e;
+}
+export {
+  l as __require
+};
+//# sourceMappingURL=polyval_q.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-expm1@0.2.3/node_modules/@stdlib/math-base-special-expm1/lib/polyval_q.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polyval_q.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-expm1@0.2.3/node_modules/@stdlib/math-base-special-expm1/lib/polyval_q.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.03333333333333313;\n\t}\n\treturn -0.03333333333333313 + (x * (0.0015873015872548146 + (x * (-0.0000793650757867488 + (x * (0.000004008217827329362 + (x * -2.0109921818362437e-7))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_q"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoCA,WAASA,EAAUC,GAAI;AACtB,WAAKA,MAAM,IACH,uBAED,uBAAwBA,KAAK,wBAAyBA,KAAK,uBAA0BA,KAAK,uBAA2BA,IAAI;AAAA,EACjI;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-factorial@0.2.1/node_modules/@stdlib/math-base-special-factorial/lib/index.js

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

package/dist/node_modules/.pnpm/@stdlib_math-base-special-factorial@0.2.1/node_modules/@stdlib/math-base-special-factorial/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-factorial@0.2.1/node_modules/@stdlib/math-base-special-factorial/lib/index.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Evaluate the factorial function.\n*\n* @module @stdlib/math-base-special-factorial\n*\n* @example\n* var factorial = require( '@stdlib/math-base-special-factorial' );\n*\n* var v = factorial( 3.0 );\n* // returns 6.0\n*\n* v = factorial( -1.5 );\n* // returns ~-3.545\n*\n* v = factorial( -0.5 );\n* // returns ~1.772\n*\n* v = factorial( 0.5 );\n* // returns ~0.886\n*\n* v = factorial( -10.0 );\n* // returns NaN\n*\n* v = factorial( 171.0 );\n* // returns Infinity\n*\n* v = factorial( NaN );\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":";;;;;;;;;;;;;;;;;;;;;;AAoDA,MAAIA,IAAOC,EAAA;AAKX,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-factorial@0.2.1/node_modules/@stdlib/math-base-special-factorial/lib/main.js

@@ -0,0 +1,36 @@
+import { __require as q } from "../../../../../@stdlib_math-base-assert-is-nan@0.2.2/node_modules/@stdlib/math-base-assert-is-nan/lib/index.js";
+import { __require as _ } from "../../../../../@stdlib_math-base-assert-is-integer@0.2.5/node_modules/@stdlib/math-base-assert-is-integer/lib/index.js";
+import { __require as s } from "../../../../../@stdlib_math-base-special-gamma@0.2.1/node_modules/@stdlib/math-base-special-gamma/lib/index.js";
+import { __require as v } from "../../../../../@stdlib_constants-float64-pinf@0.2.2/node_modules/@stdlib/constants-float64-pinf/lib/index.js";
+import p from "./factorials.json.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 e, i;
+function I() {
+  if (i) return e;
+  i = 1;
+  var a = q(), u = _(), n = s(), t = v(), o = p, f = 170;
+  function m(r) {
+    return a(r) ? NaN : u(r) ? r < 0 ? NaN : r <= f ? o[r] : t : n(r + 1);
+  }
+  return e = m, e;
+}
+export {
+  I as __require
+};
+//# sourceMappingURL=main.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-factorial@0.2.1/node_modules/@stdlib/math-base-special-factorial/lib/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-factorial@0.2.1/node_modules/@stdlib/math-base-special-factorial/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 gamma = require( '@stdlib/math-base-special-gamma' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar FACTORIALS = require( './factorials.json' );\n\n\n// VARIABLES //\n\nvar MAX_FACTORIAL = 170; // TODO: consider extracting as a constant\n\n\n// MAIN //\n\n/**\n* Evaluates the factorial of `x`.\n*\n* @param {number} x - input value\n* @returns {number} factorial\n*\n* @example\n* var v = factorial( 3.0 );\n* // returns 6.0\n*\n* @example\n* var v = factorial( -1.5 );\n* // returns ~-3.545\n*\n* @example\n* var v = factorial( -0.5 );\n* // returns ~1.772\n*\n* @example\n* var v = factorial( 0.5 );\n* // returns ~0.886\n*\n* @example\n* var v = factorial( -10.0 );\n* // returns NaN\n*\n* @example\n* var v = factorial( 171.0 );\n* // returns Infinity\n*\n* @example\n* var v = factorial( NaN );\n* // returns NaN\n*/\nfunction factorial( x ) {\n\tif ( isnan( x ) ) {\n\t\treturn NaN;\n\t}\n\tif ( isInteger( x ) ) {\n\t\tif ( x < 0 ) {\n\t\t\treturn NaN;\n\t\t}\n\t\tif ( x <= MAX_FACTORIAL ) {\n\t\t\treturn FACTORIALS[ x ];\n\t\t}\n\t\treturn PINF;\n\t}\n\treturn gamma( x + 1.0 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = factorial;\n"],"names":["isnan","require$$0","isInteger","require$$1","gamma","require$$2","PINF","require$$3","FACTORIALS","require$$4","MAX_FACTORIAL","factorial","x","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAQC,EAAA,GACRC,IAAYC,EAAA,GACZC,IAAQC,EAAA,GACRC,IAAOC,EAAA,GACPC,IAAaC,GAKbC,IAAgB;AAuCpB,WAASC,EAAWC,GAAI;AACvB,WAAKZ,EAAOY,KACJ,MAEHV,EAAWU,KACVA,IAAI,IACD,MAEHA,KAAKF,IACFF,EAAYI,CAAC,IAEdN,IAEDF,EAAOQ,IAAI,CAAG;AAAA,EACtB;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-factorial@0.3.0/node_modules/@stdlib/math-base-special-factorial/lib/index.js

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

package/dist/node_modules/.pnpm/@stdlib_math-base-special-factorial@0.3.0/node_modules/@stdlib/math-base-special-factorial/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-factorial@0.3.0/node_modules/@stdlib/math-base-special-factorial/lib/index.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Evaluate the factorial function.\n*\n* @module @stdlib/math-base-special-factorial\n*\n* @example\n* var factorial = require( '@stdlib/math-base-special-factorial' );\n*\n* var v = factorial( 3.0 );\n* // returns 6.0\n*\n* v = factorial( -1.5 );\n* // returns ~-3.545\n*\n* v = factorial( -0.5 );\n* // returns ~1.772\n*\n* v = factorial( 0.5 );\n* // returns ~0.886\n*\n* v = factorial( -10.0 );\n* // returns NaN\n*\n* v = factorial( 171.0 );\n* // returns Infinity\n*\n* v = factorial( NaN );\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":";;;;;;;;;;;;;;;;;;;;;;AAoDA,MAAIA,IAAOC,EAAA;AAKX,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-special-factorial@0.3.0/node_modules/@stdlib/math-base-special-factorial/lib/main.js

@@ -0,0 +1,37 @@
+import { __require as f } from "../../../../../@stdlib_math-base-assert-is-nan@0.2.2/node_modules/@stdlib/math-base-assert-is-nan/lib/index.js";
+import { __require as q } from "../../../../../@stdlib_math-base-assert-is-integer@0.2.5/node_modules/@stdlib/math-base-assert-is-integer/lib/index.js";
+import { __require as s } from "../../../../../@stdlib_math-base-special-gamma@0.2.1/node_modules/@stdlib/math-base-special-gamma/lib/index.js";
+import { __require as v } from "../../../../../@stdlib_constants-float64-pinf@0.2.2/node_modules/@stdlib/constants-float64-pinf/lib/index.js";
+import { __require as L } from "../../../../../@stdlib_constants-float64-max-safe-nth-factorial@0.1.0/node_modules/@stdlib/constants-float64-max-safe-nth-factorial/lib/index.js";
+import p from "./factorials.json.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 e, i;
+function T() {
+  if (i) return e;
+  i = 1;
+  var a = f(), u = q(), t = s(), n = v(), o = L(), _ = p;
+  function m(r) {
+    return a(r) ? NaN : u(r) ? r < 0 ? NaN : r <= o ? _[r] : n : t(r + 1);
+  }
+  return e = m, e;
+}
+export {
+  T as __require
+};
+//# sourceMappingURL=main.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-special-factorial@0.3.0/node_modules/@stdlib/math-base-special-factorial/lib/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-factorial@0.3.0/node_modules/@stdlib/math-base-special-factorial/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 gamma = require( '@stdlib/math-base-special-gamma' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar FLOAT64_MAX_SAFE_NTH_FACTORIAL = require( '@stdlib/constants-float64-max-safe-nth-factorial' );\nvar FACTORIALS = require( './factorials.json' );\n\n\n// MAIN //\n\n/**\n* Evaluates the factorial of `x`.\n*\n* @param {number} x - input value\n* @returns {number} factorial\n*\n* @example\n* var v = factorial( 3.0 );\n* // returns 6.0\n*\n* @example\n* var v = factorial( -1.5 );\n* // returns ~-3.545\n*\n* @example\n* var v = factorial( -0.5 );\n* // returns ~1.772\n*\n* @example\n* var v = factorial( 0.5 );\n* // returns ~0.886\n*\n* @example\n* var v = factorial( -10.0 );\n* // returns NaN\n*\n* @example\n* var v = factorial( 171.0 );\n* // returns Infinity\n*\n* @example\n* var v = factorial( NaN );\n* // returns NaN\n*/\nfunction factorial( x ) {\n\tif ( isnan( x ) ) {\n\t\treturn NaN;\n\t}\n\tif ( isInteger( x ) ) {\n\t\tif ( x < 0 ) {\n\t\t\treturn NaN;\n\t\t}\n\t\tif ( x <= FLOAT64_MAX_SAFE_NTH_FACTORIAL ) {\n\t\t\treturn FACTORIALS[ x ];\n\t\t}\n\t\treturn PINF;\n\t}\n\treturn gamma( x + 1.0 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = factorial;\n"],"names":["isnan","require$$0","isInteger","require$$1","gamma","require$$2","PINF","require$$3","FLOAT64_MAX_SAFE_NTH_FACTORIAL","require$$4","FACTORIALS","require$$5","factorial","x","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAQC,EAAA,GACRC,IAAYC,EAAA,GACZC,IAAQC,EAAA,GACRC,IAAOC,EAAA,GACPC,IAAiCC,EAAA,GACjCC,IAAaC;AAuCjB,WAASC,EAAWC,GAAI;AACvB,WAAKb,EAAOa,KACJ,MAEHX,EAAWW,KACVA,IAAI,IACD,MAEHA,KAAKL,IACFE,EAAYG,CAAC,IAEdP,IAEDF,EAAOS,IAAI,CAAG;AAAA,EACtB;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}