@milaboratories/miplots4 1.0.157 → 1.0.159

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

@@ -1,75 +0,0 @@
-import { l as p } from "../../../../../math-base-assert-is-nan/lib/index.js";
-import { l as v } from "../../../../../math-base-assert-is-integer/lib/index.js";
-import { l as u } from "../../../../../math-base-assert-is-negative-zero/lib/index.js";
-import { l as b } from "../../../../../math-base-special-abs/lib/index.js";
-import { l as $ } from "../../../../../math-base-special-floor/lib/index.js";
-import { l as g } from "../../../../../math-base-special-sin/lib/index.js";
-import { l as N } from "../../../../../constants-float64-pinf/lib/index.js";
-import { l as I } from "../../../../../constants-float64-ninf/lib/index.js";
-import { l as h } from "../../../../../constants-float64-pi/lib/index.js";
-import { s as w } from "./stirling_approximation.js";
-import { s as _ } from "./small_approximation.js";
-import { r as q } from "./rational_pq.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, long comment, copyright, license, and constants are from [Cephes]{@link http://www.netlib.org/cephes}. The implementation follows the original, but has been modified for JavaScript.
-*
-* ```text
-* Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier
-*
-* Some software in this archive may be from the book _Methods and Programs for Mathematical Functions_ (Prentice-Hall or Simon & Schuster International, 1989) or from the Cephes Mathematical Library, a commercial product. In either event, it is copyrighted by the author. What you see here may be used freely but it comes with no support or guarantee.
-*
-* Stephen L. Moshier
-* moshier@na-net.ornl.gov
-* ```
-*/
-var A = p, F = v, P = u, m = b, c = $, z = g, l = N, f = I, s = h, e = w, n = _, Z = q;
-function d(r) {
-  var t, a, o, i;
-  if (F(r) && r < 0 || r === f || A(r))
-    return NaN;
-  if (r === 0)
-    return P(r) ? f : l;
-  if (r > 171.61447887182297)
-    return l;
-  if (r < -170.5674972726612)
-    return 0;
-  if (a = m(r), a > 33)
-    return r >= 0 ? e(r) : (o = c(a), o & 1 ? t = 1 : t = -1, i = a - o, i > 0.5 && (o += 1, i = a - o), i = a * z(s * i), t * s / (m(i) * e(a)));
-  for (i = 1; r >= 3; )
-    r -= 1, i *= r;
-  for (; r < 0; ) {
-    if (r > -1e-9)
-      return n(r, i);
-    i /= r, r += 1;
-  }
-  for (; r < 2; ) {
-    if (r < 1e-9)
-      return n(r, i);
-    i /= r, r += 1;
-  }
-  return r === 2 ? i : (r -= 2, i * Z(r));
-}
-var M = d;
-export {
-  M as m
-};
-//# sourceMappingURL=main.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/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 original C code, long comment, copyright, license, and constants are from [Cephes]{@link http://www.netlib.org/cephes}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier\n*\n* Some software in this archive may be from the book _Methods and Programs for Mathematical Functions_ (Prentice-Hall or Simon & Schuster International, 1989) or from the Cephes Mathematical Library, a commercial product. In either event, it is copyrighted by the author. What you see here may be used freely but it comes with no support or guarantee.\n*\n* Stephen L. Moshier\n* moshier@na-net.ornl.gov\n* ```\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 isNegativeZero = require( '@stdlib/math-base-assert-is-negative-zero' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar sin = require( '@stdlib/math-base-special-sin' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar PI = require( '@stdlib/constants-float64-pi' );\nvar stirlingApprox = require( './stirling_approximation.js' );\nvar smallApprox = require( './small_approximation.js' );\nvar rateval = require( './rational_pq.js' );\n\n\n// MAIN //\n\n/**\n* Evaluates the gamma function.\n*\n* ## Method\n*\n* 1.  Arguments \\\\(|x| \\leq 34\\\\) are reduced by recurrence and the function approximated by a rational function of degree \\\\(6/7\\\\) in the interval \\\\((2,3)\\\\).\n* 2.  Large negative arguments are made positive using a reflection formula.\n* 3.  Large arguments are handled by Stirling's formula.\n*\n* ## Notes\n*\n* -   Relative error:\n*\n*     | arithmetic | domain    | # trials | peak    | rms     |\n*     |:----------:|:---------:|:--------:|:-------:|:-------:|\n*     | DEC        | -34,34    | 10000    | 1.3e-16 | 2.5e-17 |\n*     | IEEE       | -170,-33  | 20000    | 2.3e-15 | 3.3e-16 |\n*     | IEEE       | -33, 33   | 20000    | 9.4e-16 | 2.2e-16 |\n*     | IEEE       | 33, 171.6 | 20000    | 2.3e-15 | 3.2e-16 |\n*\n* -   Error for arguments outside the test range will be larger owing to error amplification by the exponential function.\n*\n* @param {number} x - input value\n* @returns {number} function value\n*\n* @example\n* var v = gamma( 4.0 );\n* // returns 6.0\n*\n* @example\n* var v = gamma( -1.5 );\n* // returns ~2.363\n*\n* @example\n* var v = gamma( -0.5 );\n* // returns ~-3.545\n*\n* @example\n* var v = gamma( 0.5 );\n* // returns ~1.772\n*\n* @example\n* var v = gamma( 0.0 );\n* // returns Infinity\n*\n* @example\n* var v = gamma( -0.0 );\n* // returns -Infinity\n*\n* @example\n* var v = gamma( NaN );\n* // returns NaN\n*/\nfunction gamma( x ) {\n\tvar sign;\n\tvar q;\n\tvar p;\n\tvar z;\n\tif (\n\t\t(isInteger( x ) && x < 0) ||\n\t\tx === NINF ||\n\t\tisnan( x )\n\t) {\n\t\treturn NaN;\n\t}\n\tif ( x === 0.0 ) {\n\t\tif ( isNegativeZero( x ) ) {\n\t\t\treturn NINF;\n\t\t}\n\t\treturn PINF;\n\t}\n\tif ( x > 171.61447887182298 ) {\n\t\treturn PINF;\n\t}\n\tif ( x < -170.5674972726612 ) {\n\t\treturn 0.0;\n\t}\n\tq = abs( x );\n\tif ( q > 33.0 ) {\n\t\tif ( x >= 0.0 ) {\n\t\t\treturn stirlingApprox( x );\n\t\t}\n\t\tp = floor( q );\n\n\t\t// Check whether `x` is even...\n\t\tif ( (p&1) === 0 ) {\n\t\t\tsign = -1.0;\n\t\t} else {\n\t\t\tsign = 1.0;\n\t\t}\n\t\tz = q - p;\n\t\tif ( z > 0.5 ) {\n\t\t\tp += 1.0;\n\t\t\tz = q - p;\n\t\t}\n\t\tz = q * sin( PI * z );\n\t\treturn sign * PI / ( abs(z)*stirlingApprox(q) );\n\t}\n\t// Reduce `x`...\n\tz = 1.0;\n\twhile ( x >= 3.0 ) {\n\t\tx -= 1.0;\n\t\tz *= x;\n\t}\n\twhile ( x < 0.0 ) {\n\t\tif ( x > -1.0e-9 ) {\n\t\t\treturn smallApprox( x, z );\n\t\t}\n\t\tz /= x;\n\t\tx += 1.0;\n\t}\n\twhile ( x < 2.0 ) {\n\t\tif ( x < 1.0e-9 ) {\n\t\t\treturn smallApprox( x, z );\n\t\t}\n\t\tz /= x;\n\t\tx += 1.0;\n\t}\n\tif ( x === 2.0 ) {\n\t\treturn z;\n\t}\n\tx -= 2.0;\n\treturn z * rateval( x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = gamma;\n"],"names":["isnan","require$$0","isInteger","require$$1","isNegativeZero","require$$2","abs","require$$3","floor","require$$4","sin","require$$5","PINF","require$$6","NINF","require$$7","PI","require$$8","stirlingApprox","require$$9","smallApprox","require$$10","rateval","require$$11","gamma","x","sign","q","p","z","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIA,IAAQC,GACRC,IAAYC,GACZC,IAAiBC,GACjBC,IAAMC,GACNC,IAAQC,GACRC,IAAMC,GACNC,IAAOC,GACPC,IAAOC,GACPC,IAAKC,GACLC,IAAiBC,GACjBC,IAAcC,GACdC,IAAUC;AA0Dd,SAASC,EAAOC,GAAI;AACnB,MAAIC,GACAC,GACAC,GACAC;AACJ,MACE3B,EAAWuB,MAAOA,IAAI,KACvBA,MAAMX,KACNd,EAAOyB,CAAC;AAER,WAAO;AAER,MAAKA,MAAM;AACV,WAAKrB,EAAgBqB,KACbX,IAEDF;AAER,MAAKa,IAAI;AACR,WAAOb;AAER,MAAKa,IAAI;AACR,WAAO;AAGR,MADAE,IAAIrB,EAAKmB,CAAC,GACLE,IAAI;AACR,WAAKF,KAAK,IACFP,EAAgBO,CAAC,KAEzBG,IAAIpB,EAAOmB,CAAC,GAGNC,IAAE,IAGPF,IAAO,IAFPA,IAAO,IAIRG,IAAIF,IAAIC,GACHC,IAAI,QACRD,KAAK,GACLC,IAAIF,IAAIC,IAETC,IAAIF,IAAIjB,EAAKM,IAAKa,CAAC,GACZH,IAAOV,KAAOV,EAAIuB,CAAC,IAAEX,EAAeS,CAAC;AAI7C,OADAE,IAAI,GACIJ,KAAK;AACZ,IAAAA,KAAK,GACLI,KAAKJ;AAEN,SAAQA,IAAI,KAAM;AACjB,QAAKA,IAAI;AACR,aAAOL,EAAaK,GAAGI,CAAC;AAEzB,IAAAA,KAAKJ,GACLA,KAAK;AAAA,EACP;AACC,SAAQA,IAAI,KAAM;AACjB,QAAKA,IAAI;AACR,aAAOL,EAAaK,GAAGI,CAAC;AAEzB,IAAAA,KAAKJ,GACLA,KAAK;AAAA,EACP;AACC,SAAKA,MAAM,IACHI,KAERJ,KAAK,GACEI,IAAIP,EAASG,CAAC;AACtB;AAKA,IAAAK,IAAiBN;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/polyval_s.js

@@ -1,25 +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.
-*/
-function e(r) {
-  return r === 0 ? 0.08333333333334822 : 0.08333333333334822 + r * (0.0034722222160545866 + r * (-0.0026813261780578124 + r * (-22954996161337813e-20 + r * 7873113957930937e-19)));
-}
-var a = e;
-export {
-  a as p
-};
-//# sourceMappingURL=polyval_s.js.map

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/polyval_s.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_s.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/polyval_s.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.08333333333334822;\n\t}\n\treturn 0.08333333333334822 + (x * (0.0034722222160545866 + (x * (-0.0026813261780578124 + (x * (-0.00022954996161337813 + (x * 0.0007873113957930937))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_s"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,sBAED,sBAAuBA,KAAK,wBAAyBA,KAAK,yBAA0BA,KAAK,yBAA2BA,IAAI;AAChI;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/rational_pq.js

@@ -1,26 +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.
-*/
-function n(r) {
-  var a, e, i;
-  return r === 0 ? 1 : (r < 0 ? a = -r : a = r, a <= 1 ? (e = 1 + r * (0.4942148268014971 + r * (0.20744822764843598 + r * (0.04763678004571372 + r * (0.010421379756176158 + r * (0.0011913514700658638 + r * (16011952247675185e-20 + r * 0)))))), i = 1 + r * (0.0714304917030273 + r * (-0.23459179571824335 + r * (0.035823639860549865 + r * (0.011813978522206043 + r * (-0.004456419138517973 + r * (5396055804933034e-19 + r * -23158187332412014e-21))))))) : (r = 1 / r, e = 0 + r * (16011952247675185e-20 + r * (0.0011913514700658638 + r * (0.010421379756176158 + r * (0.04763678004571372 + r * (0.20744822764843598 + r * (0.4942148268014971 + r * 1)))))), i = -23158187332412014e-21 + r * (5396055804933034e-19 + r * (-0.004456419138517973 + r * (0.011813978522206043 + r * (0.035823639860549865 + r * (-0.23459179571824335 + r * (0.0714304917030273 + r * 1))))))), e / i);
-}
-var t = n;
-export {
-  t as r
-};
-//# sourceMappingURL=rational_pq.js.map

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/rational_pq.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rational_pq.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/rational_pq.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 rational function, i.e., the ratio of two polynomials described by the coefficients stored in \\\\(P\\\\) and \\\\(Q\\\\).\n*\n* ## Notes\n*\n* -   Coefficients should be sorted in ascending degree.\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 rational function\n* @returns {number} evaluated rational function\n*/\nfunction evalrational( x ) {\n\tvar ax;\n\tvar s1;\n\tvar s2;\n\tif ( x === 0.0 ) {\n\t\treturn 1.0;\n\t}\n\tif ( x < 0.0 ) {\n\t\tax = -x;\n\t} else {\n\t\tax = x;\n\t}\n\tif ( ax <= 1.0 ) {\n\t\ts1 = 1.0 + (x * (0.4942148268014971 + (x * (0.20744822764843598 + (x * (0.04763678004571372 + (x * (0.010421379756176158 + (x * (0.0011913514700658638 + (x * (0.00016011952247675185 + (x * 0.0))))))))))))); // eslint-disable-line max-len\n\t\ts2 = 1.0 + (x * (0.0714304917030273 + (x * (-0.23459179571824335 + (x * (0.035823639860549865 + (x * (0.011813978522206043 + (x * (-0.004456419138517973 + (x * (0.0005396055804933034 + (x * -0.000023158187332412014))))))))))))); // eslint-disable-line max-len\n\t} else {\n\t\tx = 1.0 / x;\n\t\ts1 = 0.0 + (x * (0.00016011952247675185 + (x * (0.0011913514700658638 + (x * (0.010421379756176158 + (x * (0.04763678004571372 + (x * (0.20744822764843598 + (x * (0.4942148268014971 + (x * 1.0))))))))))))); // eslint-disable-line max-len\n\t\ts2 = -0.000023158187332412014 + (x * (0.0005396055804933034 + (x * (-0.004456419138517973 + (x * (0.011813978522206043 + (x * (0.035823639860549865 + (x * (-0.23459179571824335 + (x * (0.0714304917030273 + (x * 1.0))))))))))))); // eslint-disable-line max-len\n\t}\n\treturn s1 / s2;\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalrational;\n"],"names":["evalrational","x","ax","s1","s2","rational_pq"],"mappings":";;;;;;;;;;;;;;;;;AAqCA,SAASA,EAAcC,GAAI;AAC1B,MAAIC,GACAC,GACAC;AACJ,SAAKH,MAAM,IACH,KAEHA,IAAI,IACRC,IAAK,CAACD,IAENC,IAAKD,GAEDC,KAAM,KACVC,IAAK,IAAOF,KAAK,qBAAsBA,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,uBAAwBA,KAAK,wBAAyBA,KAAK,wBAA0BA,IAAI,SAC7LG,IAAK,IAAOH,KAAK,qBAAsBA,KAAK,uBAAwBA,KAAK,uBAAwBA,KAAK,uBAAwBA,KAAK,wBAAyBA,KAAK,uBAAyBA,IAAI,iCAE9LA,IAAI,IAAMA,GACVE,IAAK,IAAOF,KAAK,wBAA0BA,KAAK,wBAAyBA,KAAK,uBAAwBA,KAAK,sBAAuBA,KAAK,sBAAuBA,KAAK,qBAAsBA,IAAI,SAC7LG,IAAK,yBAA4BH,KAAK,uBAAyBA,KAAK,wBAAyBA,KAAK,uBAAwBA,KAAK,uBAAwBA,KAAK,uBAAwBA,KAAK,qBAAsBA,IAAI,UAE7ME,IAAKC;AACb;AAKA,IAAAC,IAAiBL;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/small_approximation.js

@@ -1,41 +0,0 @@
-import { l as m } from "../../../../../constants-float64-eulergamma/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, copyright, license, and constants are from [Cephes]{@link http://www.netlib.org/cephes}. The implementation follows the original, but has been modified for JavaScript.
-*
-* ```text
-* Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier
-*
-* Some software in this archive may be from the book _Methods and Programs for Mathematical Functions_ (Prentice-Hall or Simon & Schuster International, 1989) or from the Cephes Mathematical Library, a commercial product. In either event, it is copyrighted by the author. What you see here may be used freely but it comes with no support or guarantee.
-*
-* Stephen L. Moshier
-* moshier@na-net.ornl.gov
-* ```
-*/
-var o = m;
-function i(a, r) {
-  return r / ((1 + o * a) * a);
-}
-var l = i;
-export {
-  l as s
-};
-//# sourceMappingURL=small_approximation.js.map

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/small_approximation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"small_approximation.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/small_approximation.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, copyright, license, and constants are from [Cephes]{@link http://www.netlib.org/cephes}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier\n*\n* Some software in this archive may be from the book _Methods and Programs for Mathematical Functions_ (Prentice-Hall or Simon & Schuster International, 1989) or from the Cephes Mathematical Library, a commercial product. In either event, it is copyrighted by the author. What you see here may be used freely but it comes with no support or guarantee.\n*\n* Stephen L. Moshier\n* moshier@na-net.ornl.gov\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar EULER = require( '@stdlib/constants-float64-eulergamma' );\n\n\n// MAIN //\n\n/**\n* Evaluates the gamma function using a small-value approximation.\n*\n* @private\n* @param {number} x - input value\n* @param {number} z - scale factor\n* @returns {number} function value\n*/\nfunction gamma( x, z ) {\n\treturn z / ( (1.0+( EULER*x )) * x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = gamma;\n"],"names":["EULER","require$$0","gamma","x","z","small_approximation"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIA,IAAQC;AAaZ,SAASC,EAAOC,GAAGC,GAAI;AACtB,SAAOA,MAAO,IAAMJ,IAAMG,KAAOA;AAClC;AAKA,IAAAE,IAAiBH;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/stirling_approximation.js

@@ -1,45 +0,0 @@
-import { l as p } from "../../../../../constants-float64-sqrt-two-pi/lib/index.js";
-import { l as v } from "../../math-base-special-pow/lib/index.js";
-import { l as m } from "../../../../../math-base-special-exp/lib/index.js";
-import { p as s } from "./polyval_s.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, copyright, license, and constants are from [Cephes]{@link http://www.netlib.org/cephes}. The implementation follows the original, but has been modified for JavaScript.
-*
-* ```text
-* Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier
-*
-* Some software in this archive may be from the book _Methods and Programs for Mathematical Functions_ (Prentice-Hall or Simon & Schuster International, 1989) or from the Cephes Mathematical Library, a commercial product. In either event, it is copyrighted by the author. What you see here may be used freely but it comes with no support or guarantee.
-*
-* Stephen L. Moshier
-* moshier@na-net.ornl.gov
-* ```
-*/
-var t = p, l = v, f = m, e = s, n = 143.01608;
-function _(r) {
-  var o, a, i;
-  return o = 1 / r, o = 1 + o * e(o), a = f(r), r > n ? (i = l(r, 0.5 * r - 0.25), a = i * (i / a)) : a = l(r, r - 0.5) / a, t * a * o;
-}
-var g = _;
-export {
-  g as s
-};
-//# sourceMappingURL=stirling_approximation.js.map

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/stirling_approximation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"stirling_approximation.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-gamma/lib/stirling_approximation.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, copyright, license, and constants are from [Cephes]{@link http://www.netlib.org/cephes}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier\n*\n* Some software in this archive may be from the book _Methods and Programs for Mathematical Functions_ (Prentice-Hall or Simon & Schuster International, 1989) or from the Cephes Mathematical Library, a commercial product. In either event, it is copyrighted by the author. What you see here may be used freely but it comes with no support or guarantee.\n*\n* Stephen L. Moshier\n* moshier@na-net.ornl.gov\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar SQRT_TWO_PI = require( '@stdlib/constants-float64-sqrt-two-pi' );\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar polyval = require( './polyval_s.js' );\n\n\n// VARIABLES //\n\nvar MAX_STIRLING = 143.01608;\n\n\n// MAIN //\n\n/**\n* Evaluates the gamma function using Stirling's formula. The polynomial is valid for \\\\(33 \\leq x \\leq 172\\\\).\n*\n* @private\n* @param {number} x - input value\n* @returns {number} function value\n*/\nfunction gamma( x ) {\n\tvar w;\n\tvar y;\n\tvar v;\n\n\tw = 1.0 / x;\n\tw = 1.0 + ( w * polyval( w ) );\n\ty = exp( x );\n\n\t// Check `x` to avoid `pow()` overflow...\n\tif ( x > MAX_STIRLING ) {\n\t\tv = pow( x, ( 0.5*x ) - 0.25 );\n\t\ty = v * (v/y);\n\t} else {\n\t\ty = pow( x, x-0.5 ) / y;\n\t}\n\treturn SQRT_TWO_PI * y * w;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gamma;\n"],"names":["SQRT_TWO_PI","require$$0","pow","require$$1","exp","require$$2","polyval","require$$3","MAX_STIRLING","gamma","x","w","y","v","stirling_approximation"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIA,IAAcC,GACdC,IAAMC,GACNC,IAAMC,GACNC,IAAUC,GAKVC,IAAe;AAYnB,SAASC,EAAOC,GAAI;AACnB,MAAIC,GACAC,GACAC;AAEJ,SAAAF,IAAI,IAAMD,GACVC,IAAI,IAAQA,IAAIL,EAASK,CAAC,GAC1BC,IAAIR,EAAKM,CAAC,GAGLA,IAAIF,KACRK,IAAIX,EAAKQ,GAAK,MAAIA,IAAM,IAAI,GAC5BE,IAAIC,KAAKA,IAAED,MAEXA,IAAIV,EAAKQ,GAAGA,IAAE,GAAG,IAAKE,GAEhBZ,IAAcY,IAAID;AAC1B;AAKA,IAAAG,IAAiBL;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/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 exponential function.\n*\n* @module @stdlib/math-base-special-pow\n*\n* @example\n* var pow = require( '@stdlib/math-base-special-pow' );\n*\n* var v = pow( 2.0, 3.0 );\n* // returns 8.0\n*\n* v = pow( 4.0, 0.5 );\n* // returns 2.0\n*\n* v = pow( 100.0, 0.0 );\n* // returns 1.0\n*\n* v = pow( 3.141592653589793, 5.0 );\n* // returns ~306.0197\n*\n* v = pow( 3.141592653589793, -0.2 );\n* // returns ~0.7954\n*\n* v = pow( NaN, 3.0 );\n* // returns NaN\n*\n* v = pow( 5.0, NaN );\n* // returns NaN\n*\n* v = pow( NaN, 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":";;;;;;;;;;;;;;;;;;AAuDA,IAAIA,IAAOC,GAKXC,IAAiBF;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/lib/log2ax.js

@@ -1,57 +0,0 @@
-import { l as n } from "../../../../../number-float64-base-get-high-word/lib/index.js";
-import { l as F } from "../../../../../number-float64-base-set-low-word/lib/index.js";
-import { l as M } from "../../../../../number-float64-base-set-high-word/lib/index.js";
-import { l as O } from "../../../../../constants-float64-exponent-bias/lib/index.js";
-import { p as W } from "./polyval_l.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 and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.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 X = n, G = F, g = M, $ = O, y = W, z = 1048575, d = 1048576, T = 1072693248, c = 536870912, j = 524288, k = 20, u = 9007199254740992, w = 0.9617966939259756, K = 0.9617967009544373, R = -7028461650952758e-24, U = [
-  1,
-  1.5
-], q = [
-  0,
-  0.5849624872207642
-  // 0x3FE2B803, 0x40000000
-], J = [
-  0,
-  1350039202129749e-23
-  // 0x3E4CFDEB, 0x43CFD006
-];
-function Q(N, a, v) {
-  var P, o, _, l, S, r, e, p, B, H, L, D, E, s, b, C, m, f, i, t, A, I;
-  return t = 0, v < d && (a *= u, t -= 53, v = X(a)), t += (v >> k) - $ | 0, A = v & z | 0, v = A | T | 0, A <= 235662 ? I = 0 : A < 767610 ? I = 1 : (I = 0, t += 1, v -= d), a = g(a, v), p = U[I], f = a - p, i = 1 / (a + p), o = f * i, l = G(o, 0), P = (v >> 1 | c) + j, P += I << 18, r = g(0, P), e = a - (r - p), S = i * (f - l * r - l * e), _ = o * o, m = _ * _ * y(_), m += S * (l + o), _ = l * l, r = 3 + _ + m, r = G(r, 0), e = m - (r - 3 - _), f = l * r, i = S * r + e * o, H = f + i, H = G(H, 0), L = i - (H - f), D = K * H, E = R * H + L * w + J[I], B = q[I], C = t, s = D + E + B + C, s = G(s, 0), b = E - (s - C - B - D), N[0] = s, N[1] = b, N;
-}
-var r0 = Q;
-export {
-  r0 as l
-};
-//# sourceMappingURL=log2ax.js.map

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/lib/log2ax.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"log2ax.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/lib/log2ax.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 and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.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 getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\nvar setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\nvar setHighWord = require( '@stdlib/number-float64-base-set-high-word' );\nvar BIAS = require( '@stdlib/constants-float64-exponent-bias' );\nvar polyvalL = require( './polyval_l.js' );\n\n\n// VARIABLES //\n\n// 0x000fffff = 1048575 => 0 00000000000 11111111111111111111\nvar HIGH_SIGNIFICAND_MASK = 0x000fffff|0; // asm type annotation\n\n// 0x00100000 = 1048576 => 0 00000000001 00000000000000000000 => biased exponent: 1 = -1022+1023 => 2^-1022\nvar HIGH_MIN_NORMAL_EXP = 0x00100000|0; // asm type annotation\n\n// 0x3ff00000 = 1072693248 => 0 01111111111 00000000000000000000 => biased exponent: 1023 = 0+1023 => 2^0 = 1\nvar HIGH_BIASED_EXP_0 = 0x3ff00000|0; // asm type annotation\n\n// 0x20000000 = 536870912 => 0 01000000000 00000000000000000000 => biased exponent: 512 = -511+1023\nvar HIGH_BIASED_EXP_NEG_512 = 0x20000000|0; // asm type annotation\n\n// 0x00080000 = 524288 => 0 00000000000 10000000000000000000\nvar HIGH_SIGNIFICAND_HALF = 0x00080000|0; // asm type annotation\n\n// TODO: consider making an external constant\nvar HIGH_NUM_SIGNIFICAND_BITS = 20|0; // asm type annotation\n\nvar TWO53 = 9007199254740992.0;\t// 0x43400000, 0x00000000\n\n// 2/(3*LN2)\nvar CP = 9.61796693925975554329e-01; // 0x3FEEC709, 0xDC3A03FD\n\n// (float)CP\nvar CP_HI = 9.61796700954437255859e-01; // 0x3FEEC709, 0xE0000000\n\n// Low: CP_HI\nvar CP_LO = -7.02846165095275826516e-09; // 0xBE3E2FE0, 0x145B01F5\n\nvar BP = [\n\t1.0,\n\t1.5\n];\nvar DP_HI = [\n\t0.0,\n\t5.84962487220764160156e-01 // 0x3FE2B803, 0x40000000\n];\nvar DP_LO = [\n\t0.0,\n\t1.35003920212974897128e-08 // 0x3E4CFDEB, 0x43CFD006\n];\n\n\n// MAIN //\n\n/**\n* Computes \\\\(\\operatorname{log2}(ax)\\\\).\n*\n* @private\n* @param {Array} out - output array\n* @param {number} ax - absolute value of `x`\n* @param {number} ahx - high word of `ax`\n* @returns {Array} output array containing a tuple comprised of high and low parts\n*\n* @example\n* var t = log2ax( [ 0.0, 0.0 ], 9.0, 1075970048 ); // => [ t1, t2 ]\n* // returns [ 3.169923782348633, 0.0000012190936795504075 ]\n*/\nfunction log2ax( out, ax, ahx ) {\n\tvar tmp;\n\tvar ss; // `hs + ls`\n\tvar s2; // `ss` squared\n\tvar hs;\n\tvar ls;\n\tvar ht;\n\tvar lt;\n\tvar bp; // `BP` constant\n\tvar dp; // `DP` constant\n\tvar hp;\n\tvar lp;\n\tvar hz;\n\tvar lz;\n\tvar t1;\n\tvar t2;\n\tvar t;\n\tvar r;\n\tvar u;\n\tvar v;\n\tvar n;\n\tvar j;\n\tvar k;\n\n\tn = 0|0; // asm type annotation\n\n\t// Check if `x` is subnormal...\n\tif ( ahx < HIGH_MIN_NORMAL_EXP ) {\n\t\tax *= TWO53;\n\t\tn -= 53|0; // asm type annotation\n\t\tahx = getHighWord( ax );\n\t}\n\t// Extract the unbiased exponent of `x`:\n\tn += ((ahx >> HIGH_NUM_SIGNIFICAND_BITS) - BIAS)|0; // asm type annotation\n\n\t// Isolate the significand bits of `x`:\n\tj = (ahx & HIGH_SIGNIFICAND_MASK)|0; // asm type annotation\n\n\t// Normalize `ahx` by setting the (biased) exponent to `1023`:\n\tahx = (j | HIGH_BIASED_EXP_0)|0; // asm type annotation\n\n\t// Determine the interval of `|x|` by comparing significand bits...\n\n\t// |x| < sqrt(3/2)\n\tif ( j <= 0x3988E ) { // 0 00000000000 00111001100010001110\n\t\tk = 0;\n\t}\n\t// |x| < sqrt(3)\n\telse if ( j < 0xBB67A ) { // 0 00000000000 10111011011001111010\n\t\tk = 1;\n\t}\n\t// |x| >= sqrt(3)\n\telse {\n\t\tk = 0;\n\t\tn += 1|0; // asm type annotation\n\t\tahx -= HIGH_MIN_NORMAL_EXP;\n\t}\n\t// Load the normalized high word into `|x|`:\n\tax = setHighWord( ax, ahx );\n\n\t// Compute `ss = hs + ls = (x-1)/(x+1)` or `(x-1.5)/(x+1.5)`:\n\tbp = BP[ k ]; // BP[0] = 1.0, BP[1] = 1.5\n\tu = ax - bp; // (x-1) || (x-1.5)\n\tv = 1.0 / (ax + bp); // 1/(x+1) || 1/(x+1.5)\n\tss = u * v;\n\ths = setLowWord( ss, 0 ); // set all low word (less significant significand) bits to 0s\n\n\t// Compute `ht = ax + bp` (via manipulation, i.e., bit flipping, of the high word):\n\ttmp = ((ahx>>1) | HIGH_BIASED_EXP_NEG_512) + HIGH_SIGNIFICAND_HALF;\n\ttmp += (k << 18); // `(k<<18)` can be considered the word equivalent of `1.0` or `1.5`\n\tht = setHighWord( 0.0, tmp );\n\tlt = ax - (ht - bp);\n\tls = v * ( ( u - (hs*ht) ) - ( hs*lt ) );\n\n\t// Compute `log(ax)`...\n\n\ts2 = ss * ss;\n\tr = s2 * s2 * polyvalL( s2 );\n\tr += ls * (hs + ss);\n\ts2 = hs * hs;\n\tht = 3.0 + s2 + r;\n\tht = setLowWord( ht, 0 );\n\tlt = r - ((ht-3.0) - s2);\n\n\t// u+v = ss*(1+...):\n\tu = hs * ht;\n\tv = ( ls*ht ) + ( lt*ss );\n\n\t// 2/(3LN2) * (ss+...):\n\thp = u + v;\n\thp = setLowWord( hp, 0 );\n\tlp = v - (hp - u);\n\thz = CP_HI * hp; // CP_HI+CP_LO = 2/(3*LN2)\n\tlz = ( CP_LO*hp ) + ( lp*CP ) + DP_LO[ k ];\n\n\t// log2(ax) = (ss+...)*2/(3*LN2) = n + dp + hz + lz\n\tdp = DP_HI[ k ];\n\tt = n;\n\tt1 = ((hz+lz) + dp) + t; // log2(ax)\n\tt1 = setLowWord( t1, 0 );\n\tt2 = lz - (((t1-t) - dp) - hz);\n\n\tout[ 0 ] = t1;\n\tout[ 1 ] = t2;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = log2ax;\n"],"names":["getHighWord","require$$0","setLowWord","require$$1","setHighWord","require$$2","BIAS","require$$3","polyvalL","require$$4","HIGH_SIGNIFICAND_MASK","HIGH_MIN_NORMAL_EXP","HIGH_BIASED_EXP_0","HIGH_BIASED_EXP_NEG_512","HIGH_SIGNIFICAND_HALF","HIGH_NUM_SIGNIFICAND_BITS","TWO53","CP","CP_HI","CP_LO","BP","DP_HI","DP_LO","log2ax","out","ax","ahx","tmp","ss","s2","hs","ls","ht","lt","bp","dp","hp","lp","hz","lz","t1","t2","t","r","u","v","n","j","k","log2ax_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIA,IAAcC,GACdC,IAAaC,GACbC,IAAcC,GACdC,IAAOC,GACPC,IAAWC,GAMXC,IAAwB,SAGxBC,IAAsB,SAGtBC,IAAoB,YAGpBC,IAA0B,WAG1BC,IAAwB,QAGxBC,IAA4B,IAE5BC,IAAQ,kBAGRC,IAAK,oBAGLC,IAAQ,oBAGRC,IAAQ,uBAERC,IAAK;AAAA,EACR;AAAA,EACA;AACD,GACIC,IAAQ;AAAA,EACX;AAAA,EACA;AAAA;AACD,GACIC,IAAQ;AAAA,EACX;AAAA,EACA;AAAA;AACD;AAkBA,SAASC,EAAQC,GAAKC,GAAIC,GAAM;AAC/B,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,SAAAF,IAAI,GAGCpB,IAAMf,MACVc,KAAMT,GACN8B,KAAK,IACLpB,IAAM1B,EAAayB,CAAE,IAGtBqB,MAAOpB,KAAOX,KAA6BT,IAAM,GAGjDyC,IAAKrB,IAAMhB,IAAuB,GAGlCgB,IAAOqB,IAAInC,IAAmB,GAKzBmC,KAAK,SACTC,IAAI,IAGKD,IAAI,SACbC,IAAI,KAIJA,IAAI,GACJF,KAAK,GACLpB,KAAOf,IAGRc,IAAKrB,EAAaqB,GAAIC,CAAG,GAGzBQ,IAAKd,EAAI4B,IACTJ,IAAInB,IAAKS,GACTW,IAAI,KAAOpB,IAAKS,IAChBN,IAAKgB,IAAIC,GACTf,IAAK5B,EAAY0B,GAAI,IAGrBD,KAAQD,KAAK,IAAKb,KAA2BC,GAC7Ca,KAAQqB,KAAK,IACbhB,IAAK5B,EAAa,GAAKuB,CAAG,GAC1BM,IAAKR,KAAMO,IAAKE,IAChBH,IAAKc,KAAQD,IAAKd,IAAGE,IAAUF,IAAGG,IAIlCJ,IAAKD,IAAKA,GACVe,IAAId,IAAKA,IAAKrB,EAAUqB,CAAE,GAC1Bc,KAAKZ,KAAMD,IAAKF,IAChBC,IAAKC,IAAKA,GACVE,IAAK,IAAMH,IAAKc,GAChBX,IAAK9B,EAAY8B,GAAI,CAAC,GACtBC,IAAKU,KAAMX,IAAG,IAAOH,IAGrBe,IAAId,IAAKE,GACTa,IAAMd,IAAGC,IAASC,IAAGL,GAGrBQ,IAAKQ,IAAIC,GACTT,IAAKlC,EAAYkC,GAAI,CAAC,GACtBC,IAAKQ,KAAKT,IAAKQ,IACfN,IAAKpB,IAAQkB,GACbG,IAAOpB,IAAMiB,IAASC,IAAGpB,IAAOK,EAAO0B,CAAC,GAGxCb,IAAKd,EAAO2B,CAAC,GACbN,IAAII,GACJN,IAAOF,IAAGC,IAAMJ,IAAMO,GACtBF,IAAKtC,EAAYsC,GAAI,CAAC,GACtBC,IAAKF,KAAQC,IAAGE,IAAKP,IAAMG,IAE3Bd,EAAK,CAAC,IAAKgB,GACXhB,EAAK,CAAC,IAAKiB,GACJjB;AACR;AAKA,IAAAyB,KAAiB1B;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/lib/logx.js

@@ -1,43 +0,0 @@
-import { l as p } from "../../../../../number-float64-base-set-low-word/lib/index.js";
-import { p as N } from "./polyval_w.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 and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.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 L = p, i = N, m = 1.4426950408889634, s = 1.4426950216293335, I = 19259629911266175e-24;
-function f(v, e) {
-  var t, a, r, _, o, l;
-  return r = e - 1, _ = r * r * i(r), o = s * r, l = r * I - _ * m, a = o + l, a = L(a, 0), t = l - (a - o), v[0] = a, v[1] = t, v;
-}
-var x = f;
-export {
-  x as l
-};
-//# sourceMappingURL=logx.js.map

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/lib/logx.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"logx.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/lib/logx.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 and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.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 setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\nvar polyvalW = require( './polyval_w.js' );\n\n\n// VARIABLES //\n\n// 1/LN2\nvar INV_LN2 = 1.44269504088896338700e+00; // 0x3FF71547, 0x652B82FE\n\n// High (24 bits): 1/LN2\nvar INV_LN2_HI = 1.44269502162933349609e+00; // 0x3FF71547, 0x60000000\n\n// Low: 1/LN2\nvar INV_LN2_LO = 1.92596299112661746887e-08; // 0x3E54AE0B, 0xF85DDF44\n\n\n// MAIN //\n\n/**\n* Computes \\\\(\\operatorname{log}(x)\\\\) assuming \\\\(|1-x|\\\\) is small and using the approximation \\\\(x - x^2/2 + x^3/3 - x^4/4\\\\).\n*\n* @private\n* @param {Array} out - output array\n* @param {number} ax - absolute value of `x`\n* @returns {Array} output array containing a tuple comprised of high and low parts\n*\n* @example\n* var t = logx( [ 0.0, 0.0 ], 9.0 ); // => [ t1, t2 ]\n* // returns [ -1265.7236328125, -0.0008163940840404393 ]\n*/\nfunction logx( out, ax ) {\n\tvar t2;\n\tvar t1;\n\tvar t;\n\tvar w;\n\tvar u;\n\tvar v;\n\n\tt = ax - 1.0; // `t` has `20` trailing zeros\n\tw = t * t * polyvalW( t );\n\tu = INV_LN2_HI * t; // `INV_LN2_HI` has `21` significant bits\n\tv = ( t*INV_LN2_LO ) - ( w*INV_LN2 );\n\tt1 = u + v;\n\tt1 = setLowWord( t1, 0 );\n\tt2 = v - (t1 - u);\n\n\tout[ 0 ] = t1;\n\tout[ 1 ] = t2;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = logx;\n"],"names":["setLowWord","require$$0","polyvalW","require$$1","INV_LN2","INV_LN2_HI","INV_LN2_LO","logx","out","ax","t2","t1","t","w","u","v","logx_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIA,IAAaC,GACbC,IAAWC,GAMXC,IAAU,oBAGVC,IAAa,oBAGbC,IAAa;AAiBjB,SAASC,EAAMC,GAAKC,GAAK;AACxB,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,SAAAH,IAAIH,IAAK,GACTI,IAAID,IAAIA,IAAIV,EAAUU,CAAC,GACvBE,IAAIT,IAAaO,GACjBG,IAAMH,IAAEN,IAAiBO,IAAET,GAC3BO,IAAKG,IAAIC,GACTJ,IAAKX,EAAYW,GAAI,CAAC,GACtBD,IAAKK,KAAKJ,IAAKG,IAEfN,EAAK,CAAC,IAAKG,GACXH,EAAK,CAAC,IAAKE,GACJF;AACR;AAKA,IAAAQ,IAAiBT;","x_google_ignoreList":[0]}

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

@@ -1,108 +0,0 @@
-import { l as X } from "../../../../../math-base-assert-is-nan/lib/index.js";
-import { l as d } from "../../math-base-assert-is-odd/lib/index.js";
-import { l as w } from "../../../../../math-base-assert-is-infinite/lib/index.js";
-import { l as W } from "../../../../../math-base-assert-is-integer/lib/index.js";
-import { l as M } from "../../../../../math-base-special-sqrt/lib/index.js";
-import { l as R } from "../../../../../math-base-special-abs/lib/index.js";
-import { l as U } from "../../../../../number-float64-base-to-words/lib/index.js";
-import { l as z } from "../../../../../number-float64-base-set-low-word/lib/index.js";
-import { l as F } from "../../../../../number-uint32-base-to-int32/lib/index.js";
-import { l as K } from "../../../../../constants-float64-ninf/lib/index.js";
-import { l as L } from "../../../../../constants-float64-pinf/lib/index.js";
-import { l as Y } from "../../../../../constants-float64-high-word-abs-mask/lib/index.js";
-import { x as j } from "./x_is_zero.js";
-import { y as q } from "./y_is_huge.js";
-import { y as C } from "./y_is_infinite.js";
-import { l as V } from "./log2ax.js";
-import { l as Z } from "./logx.js";
-import { p as k } from "./pow2.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 and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.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 S = X, A = d, c = w, J = W, h = M, Q = R, E = U, x = z, B = F, y = K, rr = L, G = Y, ir = j, ar = q, fr = C, tr = V, or = Z, er = k, vr = 1072693247, sr = 1105199104, nr = 1139802112, O = 1083179008, mr = 1072693248, lr = 1083231232, _r = 3230714880, P = 31, t = 1e300, o = 1e-300, ur = 8008566259537294e-32, f = [0, 0], D = [0, 0];
-function T(r, i) {
-  var l, u, p, _, $, I, g, a, H, b, s, n, m, e, v, N;
-  if (S(r) || S(i))
-    return NaN;
-  if (E.assign(i, f, 1, 0), I = f[0], g = f[1], g === 0) {
-    if (i === 0)
-      return 1;
-    if (i === 1)
-      return r;
-    if (i === -1)
-      return 1 / r;
-    if (i === 0.5)
-      return h(r);
-    if (i === -0.5)
-      return 1 / h(r);
-    if (i === 2)
-      return r * r;
-    if (i === 3)
-      return r * r * r;
-    if (i === 4)
-      return r *= r, r * r;
-    if (c(i))
-      return fr(r, i);
-  }
-  if (E.assign(r, f, 1, 0), _ = f[0], $ = f[1], $ === 0) {
-    if (_ === 0)
-      return ir(r, i);
-    if (r === 1)
-      return 1;
-    if (r === -1 && A(i))
-      return -1;
-    if (c(r))
-      return r === y ? T(-0, -i) : i < 0 ? 0 : rr;
-  }
-  if (r < 0 && J(i) === !1)
-    return (r - r) / (r - r);
-  if (p = Q(r), l = _ & G | 0, u = I & G | 0, a = _ >>> P | 0, H = I >>> P | 0, a && A(i) ? a = -1 : a = 1, u > sr) {
-    if (u > nr)
-      return ar(r, i);
-    if (l < vr)
-      return H === 1 ? a * t * t : a * o * o;
-    if (l > mr)
-      return H === 0 ? a * t * t : a * o * o;
-    m = or(D, p);
-  } else
-    m = tr(D, p, l);
-  if (b = x(i, 0), n = (i - b) * m[0] + i * m[1], s = b * m[0], e = n + s, E.assign(e, f, 1, 0), v = B(f[0]), N = B(f[1]), v >= O) {
-    if (v - O | N || n + ur > e - s)
-      return a * t * t;
-  } else if ((v & G) >= lr && (v - _r | N || n <= e - s))
-    return a * o * o;
-  return e = er(v, s, n), a * e;
-}
-var Xr = T;
-export {
-  Xr as m
-};
-//# sourceMappingURL=main.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/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 and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.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 isOdd = require( '@stdlib/math-base-assert-is-odd' );\nvar isInfinite = require( '@stdlib/math-base-assert-is-infinite' );\nvar isInteger = require( '@stdlib/math-base-assert-is-integer' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar toWords = require( '@stdlib/number-float64-base-to-words' );\nvar setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\nvar uint32ToInt32 = require( '@stdlib/number-uint32-base-to-int32' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar ABS_MASK = require( '@stdlib/constants-float64-high-word-abs-mask' );\nvar xIsZero = require( './x_is_zero.js' );\nvar yIsHuge = require( './y_is_huge.js' );\nvar yIsInfinite = require( './y_is_infinite.js' );\nvar log2ax = require( './log2ax.js' );\nvar logx = require( './logx.js' );\nvar pow2 = require( './pow2.js' );\n\n\n// VARIABLES //\n\n// 0x3fefffff = 1072693247 => 0 01111111110 11111111111111111111 => biased exponent: 1022 = -1+1023 => 2^-1\nvar HIGH_MAX_NEAR_UNITY = 0x3fefffff|0; // asm type annotation\n\n// 0x41e00000 = 1105199104 => 0 10000011110 00000000000000000000 => biased exponent: 1054 = 31+1023 => 2^31\nvar HIGH_BIASED_EXP_31 = 0x41e00000|0; // asm type annotation\n\n// 0x43f00000 = 1139802112 => 0 10000111111 00000000000000000000 => biased exponent: 1087 = 64+1023 => 2^64\nvar HIGH_BIASED_EXP_64 = 0x43f00000|0; // asm type annotation\n\n// 0x40900000 = 1083179008 => 0 10000001001 00000000000000000000 => biased exponent: 1033 = 10+1023 => 2^10 = 1024\nvar HIGH_BIASED_EXP_10 = 0x40900000|0; // asm type annotation\n\n// 0x3ff00000 = 1072693248 => 0 01111111111 00000000000000000000 => biased exponent: 1023 = 0+1023 => 2^0 = 1\nvar HIGH_BIASED_EXP_0 = 0x3ff00000|0; // asm type annotation\n\n// 0x4090cc00 = 1083231232 => 0 10000001001 00001100110000000000\nvar HIGH_1075 = 0x4090cc00|0; // asm type annotation\n\n// 0xc090cc00 = 3230714880 => 1 10000001001 00001100110000000000\nvar HIGH_NEG_1075 = 0xc090cc00>>>0; // asm type annotation\n\nvar HIGH_NUM_NONSIGN_BITS = 31|0; // asm type annotation\n\nvar HUGE = 1.0e300;\nvar TINY = 1.0e-300;\n\n// -(1024-log2(ovfl+.5ulp))\nvar OVT = 8.0085662595372944372e-17;\n\n// High/low words workspace:\nvar WORDS = [ 0|0, 0|0 ];\n\n// Log workspace:\nvar LOG_WORKSPACE = [ 0.0, 0.0 ];\n\n\n// MAIN //\n\n/**\n* Evaluates the exponential function.\n*\n* ## Method\n*\n* 1.  Let \\\\(x = 2^n (1+f)\\\\).\n*\n* 2.  Compute \\\\(\\operatorname{log2}(x)\\\\) as\n*\n*     ```tex\n*     \\operatorname{log2}(x) = w_1 + w_2\n*     ```\n*\n*     where \\\\(w_1\\\\) has \\\\(53 - 24 = 29\\\\) bit trailing zeros.\n*\n* 3.  Compute\n*\n*     ```tex\n*     y \\cdot \\operatorname{log2}(x) = n + y^\\prime\n*     ```\n*\n*     by simulating multi-precision arithmetic, where \\\\(|y^\\prime| \\leq 0.5\\\\).\n*\n* 4.  Return\n*\n*     ```tex\n*     x^y = 2^n e^{y^\\prime \\cdot \\mathrm{log2}}\n*     ```\n*\n* ## Special Cases\n*\n* ```tex\n* \\begin{align*}\n* x^{\\mathrm{NaN}} &= \\mathrm{NaN} & \\\\\n* (\\mathrm{NaN})^y &= \\mathrm{NaN} & \\\\\n* 1^y &= 1 & \\\\\n* x^0 &= 1 & \\\\\n* x^1 &= x & \\\\\n* (\\pm 0)^\\infty &= +0 & \\\\\n* (\\pm 0)^{-\\infty} &= +\\infty & \\\\\n* (+0)^y &= +0 & \\mathrm{if}\\ y > 0 \\\\\n* (+0)^y &= +\\infty & \\mathrm{if}\\ y < 0 \\\\\n* (-0)^y &= -\\infty & \\mathrm{if}\\ y\\ \\mathrm{is\\ an\\ odd\\ integer\\ and}\\ y < 0 \\\\\n* (-0)^y &= +\\infty & \\mathrm{if}\\ y\\ \\mathrm{is\\ not\\ an\\ odd\\ integer\\ and}\\ y < 0 \\\\\n* (-0)^y &= -0 & \\mathrm{if}\\ y\\ \\mathrm{is\\ an\\ odd\\ integer\\ and}\\ y > 0 \\\\\n* (-0)^y &= +0 & \\mathrm{if}\\ y\\ \\mathrm{is\\ not\\ an\\ odd\\ integer\\ and}\\ y > 0 \\\\\n* (-1)^{\\pm\\infty} &= \\mathrm{NaN} & \\\\\n* x^{\\infty} &= +\\infty & |x| > 1 \\\\\n* x^{\\infty} &= +0 & |x| < 1 \\\\\n* x^{-\\infty} &= +0 & |x| > 1 \\\\\n* x^{-\\infty} &= +\\infty & |x| < 1 \\\\\n* (-\\infty)^y &= (-0)^y & \\\\\n* \\infty^y &= +0 & y < 0 \\\\\n* \\infty^y &= +\\infty & y > 0 \\\\\n* x^y &= \\mathrm{NaN} & \\mathrm{if}\\ y\\ \\mathrm{is\\ not\\ a\\ finite\\ integer\\ and}\\ x < 0\n* \\end{align*}\n* ```\n*\n* ## Notes\n*\n* -   \\\\(\\operatorname{pow}(x,y)\\\\) returns \\\\(x^y\\\\) nearly rounded. In particular, \\\\(\\operatorname{pow}(<\\mathrm{integer}>,<\\mathrm{integer}>)\\\\) **always** returns the correct integer, provided the value is representable.\n* -   The hexadecimal values shown in the source code are the intended values for used constants. Decimal values may be used, provided the compiler will accurately convert decimal to binary in order to produce the hexadecimal values.\n*\n* @param {number} x - base\n* @param {number} y - exponent\n* @returns {number} function value\n*\n* @example\n* var v = pow( 2.0, 3.0 );\n* // returns 8.0\n*\n* @example\n* var v = pow( 4.0, 0.5 );\n* // returns 2.0\n*\n* @example\n* var v = pow( 100.0, 0.0 );\n* // returns 1.0\n*\n* @example\n* var v = pow( 3.141592653589793, 5.0 );\n* // returns ~306.0197\n*\n* @example\n* var v = pow( 3.141592653589793, -0.2 );\n* // returns ~0.7954\n*\n* @example\n* var v = pow( NaN, 3.0 );\n* // returns NaN\n*\n* @example\n* var v = pow( 5.0, NaN );\n* // returns NaN\n*\n* @example\n* var v = pow( NaN, NaN );\n* // returns NaN\n*/\nfunction pow( x, y ) {\n\tvar ahx; // absolute value high word `x`\n\tvar ahy; // absolute value high word `y`\n\tvar ax;  // absolute value `x`\n\tvar hx;  // high word `x`\n\tvar lx;  // low word `x`\n\tvar hy;  // high word `y`\n\tvar ly;  // low word `y`\n\tvar sx;  // sign `x`\n\tvar sy;  // sign `y`\n\tvar y1;\n\tvar hp;\n\tvar lp;\n\tvar t;\n\tvar z;   // y prime\n\tvar j;\n\tvar i;\n\tif ( isnan( x ) || isnan( y ) ) {\n\t\treturn NaN;\n\t}\n\t// Split `y` into high and low words:\n\ttoWords.assign( y, WORDS, 1, 0 );\n\thy = WORDS[ 0 ];\n\tly = WORDS[ 1 ];\n\n\t// Special cases `y`...\n\tif ( ly === 0 ) {\n\t\tif ( y === 0.0 ) {\n\t\t\treturn 1.0;\n\t\t}\n\t\tif ( y === 1.0 ) {\n\t\t\treturn x;\n\t\t}\n\t\tif ( y === -1.0 ) {\n\t\t\treturn 1.0 / x;\n\t\t}\n\t\tif ( y === 0.5 ) {\n\t\t\treturn sqrt( x );\n\t\t}\n\t\tif ( y === -0.5 ) {\n\t\t\treturn 1.0 / sqrt( x );\n\t\t}\n\t\tif ( y === 2.0 ) {\n\t\t\treturn x * x;\n\t\t}\n\t\tif ( y === 3.0 ) {\n\t\t\treturn x * x * x;\n\t\t}\n\t\tif ( y === 4.0 ) {\n\t\t\tx *= x;\n\t\t\treturn x * x;\n\t\t}\n\t\tif ( isInfinite( y ) ) {\n\t\t\treturn yIsInfinite( x, y );\n\t\t}\n\t}\n\t// Split `x` into high and low words:\n\ttoWords.assign( x, WORDS, 1, 0 );\n\thx = WORDS[ 0 ];\n\tlx = WORDS[ 1 ];\n\n\t// Special cases `x`...\n\tif ( lx === 0 ) {\n\t\tif ( hx === 0 ) {\n\t\t\treturn xIsZero( x, y );\n\t\t}\n\t\tif ( x === 1.0 ) {\n\t\t\treturn 1.0;\n\t\t}\n\t\tif (\n\t\t\tx === -1.0 &&\n\t\t\tisOdd( y )\n\t\t) {\n\t\t\treturn -1.0;\n\t\t}\n\t\tif ( isInfinite( x ) ) {\n\t\t\tif ( x === NINF ) {\n\t\t\t\t// `pow( 1/x, -y )`\n\t\t\t\treturn pow( -0.0, -y );\n\t\t\t}\n\t\t\tif ( y < 0.0 ) {\n\t\t\t\treturn 0.0;\n\t\t\t}\n\t\t\treturn PINF;\n\t\t}\n\t}\n\tif (\n\t\tx < 0.0 &&\n\t\tisInteger( y ) === false\n\t) {\n\t\t// Signal NaN...\n\t\treturn (x-x)/(x-x);\n\t}\n\tax = abs( x );\n\n\t// Remove the sign bits (i.e., get absolute values):\n\tahx = (hx & ABS_MASK)|0; // asm type annotation\n\tahy = (hy & ABS_MASK)|0; // asm type annotation\n\n\t// Extract the sign bits:\n\tsx = (hx >>> HIGH_NUM_NONSIGN_BITS)|0; // asm type annotation\n\tsy = (hy >>> HIGH_NUM_NONSIGN_BITS)|0; // asm type annotation\n\n\t// Determine the sign of the result...\n\tif ( sx && isOdd( y ) ) {\n\t\tsx = -1.0;\n\t} else {\n\t\tsx = 1.0;\n\t}\n\t// Case 1: `|y|` is huge...\n\n\t// |y| > 2^31\n\tif ( ahy > HIGH_BIASED_EXP_31 ) {\n\t\t// `|y| > 2^64`, then must over- or underflow...\n\t\tif ( ahy > HIGH_BIASED_EXP_64 ) {\n\t\t\treturn yIsHuge( x, y );\n\t\t}\n\t\t// Over- or underflow if `x` is not close to unity...\n\n\t\tif ( ahx < HIGH_MAX_NEAR_UNITY ) {\n\t\t\t// y < 0\n\t\t\tif ( sy === 1 ) {\n\t\t\t\t// Signal overflow...\n\t\t\t\treturn sx * HUGE * HUGE;\n\t\t\t}\n\t\t\t// Signal underflow...\n\t\t\treturn sx * TINY * TINY;\n\t\t}\n\t\tif ( ahx > HIGH_BIASED_EXP_0 ) {\n\t\t\t// y > 0\n\t\t\tif ( sy === 0 ) {\n\t\t\t\t// Signal overflow...\n\t\t\t\treturn sx * HUGE * HUGE;\n\t\t\t}\n\t\t\t// Signal underflow...\n\t\t\treturn sx * TINY * TINY;\n\t\t}\n\t\t// At this point, `|1-x|` is tiny (`<= 2^-20`). Suffice to compute `log(x)` by `x - x^2/2 + x^3/3 - x^4/4`.\n\t\tt = logx( LOG_WORKSPACE, ax );\n\t}\n\t// Case 2: `|y|` is not huge...\n\telse {\n\t\tt = log2ax( LOG_WORKSPACE, ax, ahx );\n\t}\n\t// Split `y` into `y1 + y2` and compute `(y1+y2) * (t1+t2)`...\n\ty1 = setLowWord( y, 0 );\n\tlp = ( (y-y1)*t[0] ) + ( y*t[1] );\n\thp = y1 * t[0];\n\tz = lp + hp;\n\n\t// Note: *can* be more performant to use `getHighWord` and `getLowWord` directly, but using `toWords` looks cleaner.\n\ttoWords.assign( z, WORDS, 1, 0 );\n\tj = uint32ToInt32( WORDS[0] );\n\ti = uint32ToInt32( WORDS[1] );\n\n\t// z >= 1024\n\tif ( j >= HIGH_BIASED_EXP_10 ) {\n\t\t// z > 1024\n\t\tif ( ((j-HIGH_BIASED_EXP_10)|i) !== 0 ) {\n\t\t\t// Signal overflow...\n\t\t\treturn sx * HUGE * HUGE;\n\t\t}\n\t\tif ( (lp+OVT) > (z-hp) ) {\n\t\t\t// Signal overflow...\n\t\t\treturn sx * HUGE * HUGE;\n\t\t}\n\t}\n\t// z <= -1075\n\telse if ( (j&ABS_MASK) >= HIGH_1075 ) {\n\t\t// z < -1075\n\t\tif ( ((j-HIGH_NEG_1075)|i) !== 0 ) {\n\t\t\t// Signal underflow...\n\t\t\treturn sx * TINY * TINY;\n\t\t}\n\t\tif ( lp <= (z-hp) ) {\n\t\t\t// Signal underflow...\n\t\t\treturn sx * TINY * TINY;\n\t\t}\n\t}\n\t// Compute `2^(hp+lp)`...\n\tz = pow2( j, hp, lp );\n\n\treturn sx * z;\n}\n\n\n// EXPORTS //\n\nmodule.exports = pow;\n"],"names":["isnan","require$$0","isOdd","require$$1","isInfinite","require$$2","isInteger","require$$3","sqrt","require$$4","abs","require$$5","toWords","require$$6","setLowWord","require$$7","uint32ToInt32","require$$8","NINF","require$$9","PINF","require$$10","ABS_MASK","require$$11","xIsZero","require$$12","yIsHuge","require$$13","yIsInfinite","require$$14","log2ax","require$$15","logx","require$$16","pow2","require$$17","HIGH_MAX_NEAR_UNITY","HIGH_BIASED_EXP_31","HIGH_BIASED_EXP_64","HIGH_BIASED_EXP_10","HIGH_BIASED_EXP_0","HIGH_1075","HIGH_NEG_1075","HIGH_NUM_NONSIGN_BITS","HUGE","TINY","OVT","WORDS","LOG_WORKSPACE","pow","x","y","ahx","ahy","ax","hx","lx","hy","ly","sx","sy","y1","hp","lp","t","z","j","i","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAIA,IAAQC,GACRC,IAAQC,GACRC,IAAaC,GACbC,IAAYC,GACZC,IAAOC,GACPC,IAAMC,GACNC,IAAUC,GACVC,IAAaC,GACbC,IAAgBC,GAChBC,IAAOC,GACPC,KAAOC,GACPC,IAAWC,GACXC,KAAUC,GACVC,KAAUC,GACVC,KAAcC,GACdC,KAASC,GACTC,KAAOC,GACPC,KAAOC,GAMPC,KAAsB,YAGtBC,KAAqB,YAGrBC,KAAqB,YAGrBC,IAAqB,YAGrBC,KAAoB,YAGpBC,KAAY,YAGZC,KAAgB,YAEhBC,IAAwB,IAExBC,IAAO,OACPC,IAAO,QAGPC,KAAM,sBAGNC,IAAQ,CAAE,GAAK,CAAG,GAGlBC,IAAgB,CAAE,GAAK,CAAG;AAwG9B,SAASC,EAAKC,GAAGC,GAAI;AACpB,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AACJ,MAAKnE,EAAOkD,CAAC,KAAMlD,EAAOmD,CAAC;AAC1B,WAAO;AAQR,MALAvC,EAAQ,OAAQuC,GAAGJ,GAAO,GAAG,CAAC,GAC9BU,IAAKV,EAAO,CAAC,GACbW,IAAKX,EAAO,CAAC,GAGRW,MAAO,GAAI;AACf,QAAKP,MAAM;AACV,aAAO;AAER,QAAKA,MAAM;AACV,aAAOD;AAER,QAAKC,MAAM;AACV,aAAO,IAAMD;AAEd,QAAKC,MAAM;AACV,aAAO3C,EAAM0C,CAAC;AAEf,QAAKC,MAAM;AACV,aAAO,IAAM3C,EAAM0C,CAAC;AAErB,QAAKC,MAAM;AACV,aAAOD,IAAIA;AAEZ,QAAKC,MAAM;AACV,aAAOD,IAAIA,IAAIA;AAEhB,QAAKC,MAAM;AACV,aAAAD,KAAKA,GACEA,IAAIA;AAEZ,QAAK9C,EAAY+C;AAChB,aAAOvB,GAAasB,GAAGC,CAAC;AAAA,EAE3B;AAOC,MALAvC,EAAQ,OAAQsC,GAAGH,GAAO,GAAG,CAAC,GAC9BQ,IAAKR,EAAO,CAAC,GACbS,IAAKT,EAAO,CAAC,GAGRS,MAAO,GAAI;AACf,QAAKD,MAAO;AACX,aAAO/B,GAAS0B,GAAGC,CAAC;AAErB,QAAKD,MAAM;AACV,aAAO;AAER,QACCA,MAAM,MACNhD,EAAOiD,CAAC;AAER,aAAO;AAER,QAAK/C,EAAY8C;AAChB,aAAKA,MAAMhC,IAEH+B,EAAK,IAAM,CAACE,CAAC,IAEhBA,IAAI,IACD,IAED/B;AAAA,EAEV;AACC,MACC8B,IAAI,KACJ5C,EAAW6C,CAAC,MAAO;AAGnB,YAAQD,IAAEA,MAAIA,IAAEA;AAqBjB,MAnBAI,IAAK5C,EAAKwC,CAAC,GAGXE,IAAOG,IAAKjC,IAAU,GACtB+B,IAAOI,IAAKnC,IAAU,GAGtBqC,IAAMJ,MAAOZ,IAAuB,GACpCiB,IAAMH,MAAOd,IAAuB,GAG/BgB,KAAMzD,EAAOiD,KACjBQ,IAAK,KAELA,IAAK,GAKDN,IAAMhB,IAAqB;AAE/B,QAAKgB,IAAMf;AACV,aAAOZ,GAASwB,GAAGC,CAAC;AAIrB,QAAKC,IAAMhB;AAEV,aAAKwB,MAAO,IAEJD,IAAKf,IAAOA,IAGbe,IAAKd,IAAOA;AAEpB,QAAKO,IAAMZ;AAEV,aAAKoB,MAAO,IAEJD,IAAKf,IAAOA,IAGbe,IAAKd,IAAOA;AAGpB,IAAAmB,IAAIhC,GAAMgB,GAAeM,CAAE;AAAA,EAC7B;AAGE,IAAAU,IAAIlC,GAAQkB,GAAeM,GAAIF,CAAG;AAcnC,MAXAS,IAAK/C,EAAYqC,GAAG,CAAC,GACrBY,KAAQZ,IAAEU,KAAIG,EAAE,CAAC,IAAQb,IAAEa,EAAE,CAAC,GAC9BF,IAAKD,IAAKG,EAAE,CAAC,GACbC,IAAIF,IAAKD,GAGTlD,EAAQ,OAAQqD,GAAGlB,GAAO,GAAG,CAAC,GAC9BmB,IAAIlD,EAAe+B,EAAM,CAAC,CAAC,GAC3BoB,IAAInD,EAAe+B,EAAM,CAAC,CAAC,GAGtBmB,KAAK3B;AAMT,QAJO2B,IAAE3B,IAAoB4B,KAIvBJ,IAAGjB,KAAQmB,IAAEH;AAElB,aAAOH,IAAKf,IAAOA;AAAA,cAIVsB,IAAE5C,MAAamB,OAElByB,IAAExB,KAAeyB,KAInBJ,KAAOE,IAAEH;AAEb,WAAOH,IAAKd,IAAOA;AAIrB,SAAAoB,IAAI/B,GAAMgC,GAAGJ,GAAIC,CAAE,GAEZJ,IAAKM;AACb;AAKA,IAAAG,KAAiBnB;","x_google_ignoreList":[0]}

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/lib/polyval_l.js

@@ -1,25 +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.
-*/
-function l(r) {
-  return r === 0 ? 0.5999999999999946 : 0.5999999999999946 + r * (0.4285714285785502 + r * (0.33333332981837743 + r * (0.272728123808534 + r * (0.23066074577556175 + r * 0.20697501780033842))));
-}
-var a = l;
-export {
-  a as p
-};
-//# sourceMappingURL=polyval_l.js.map

package/dist/node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/lib/polyval_l.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyval_l.js","sources":["../../../../../../../../node_modules/@stdlib/math-base-special-factorial/node_modules/@stdlib/math-base-special-pow/lib/polyval_l.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.5999999999999946;\n\t}\n\treturn 0.5999999999999946 + (x * (0.4285714285785502 + (x * (0.33333332981837743 + (x * (0.272728123808534 + (x * (0.23066074577556175 + (x * 0.20697501780033842))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n"],"names":["evalpoly","x","polyval_l"],"mappings":";;;;;;;;;;;;;;;;;AAoCA,SAASA,EAAUC,GAAI;AACtB,SAAKA,MAAM,IACH,qBAED,qBAAsBA,KAAK,qBAAsBA,KAAK,sBAAuBA,KAAK,oBAAqBA,KAAK,sBAAuBA,IAAI;AAC/I;AAKA,IAAAC,IAAiBF;","x_google_ignoreList":[0]}