@milaboratories/miplots4 1.0.176 → 1.0.178

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

@@ -1,65 +0,0 @@
-import { __require as p } from "../../../../../@stdlib_constants-float64-high-word-abs-mask@0.2.2/node_modules/@stdlib/constants-float64-high-word-abs-mask/lib/index.js";
-import { __require as L } from "../../../../../@stdlib_constants-float64-high-word-exponent-mask@0.2.2/node_modules/@stdlib/constants-float64-high-word-exponent-mask/lib/index.js";
-import { __require as b } 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 c } from "../../../../../@stdlib_math-base-special-kernel-cos@0.2.3/node_modules/@stdlib/math-base-special-kernel-cos/lib/index.js";
-import { __require as O } from "../../../../../@stdlib_math-base-special-kernel-sin@0.2.3/node_modules/@stdlib/math-base-special-kernel-sin/lib/index.js";
-import { __require as I } from "../../../../../@stdlib_math-base-special-rempio2@0.2.1/node_modules/@stdlib/math-base-special-rempio2/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 following copyright, license, and long comment 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_sin.c}. The implementation follows the original, but has been modified for JavaScript.
-*
-* ```text
-* Copyright (C) 1993 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, t;
-function D() {
-  if (t) return u;
-  t = 1;
-  var o = p(), f = L(), q = b(), _ = c(), a = O(), m = I(), s = 1072243195, v = 1045430272, r = [0, 0];
-  function H(i) {
-    var e, n;
-    if (e = q(i), e &= o, e <= s)
-      return e < v ? i : a(i, 0);
-    if (e >= f)
-      return NaN;
-    switch (n = m(i, r), n & 3) {
-      case 0:
-        return a(r[0], r[1]);
-      case 1:
-        return _(r[0], r[1]);
-      case 2:
-        return -a(r[0], r[1]);
-      default:
-        return -_(r[0], r[1]);
-    }
-  }
-  return u = H, u;
-}
-export {
-  D as __require
-};
-//# sourceMappingURL=main.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-sin@0.3.0/node_modules/@stdlib/math-base-special-sin/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 [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_sin.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 1993 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 HIGH_WORD_ABS_MASK = require( '@stdlib/constants-float64-high-word-abs-mask' );\nvar HIGH_WORD_EXPONENT_MASK = require( '@stdlib/constants-float64-high-word-exponent-mask' );\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\nvar kernelCos = require( '@stdlib/math-base-special-kernel-cos' );\nvar kernelSin = require( '@stdlib/math-base-special-kernel-sin' );\nvar rempio2 = require( '@stdlib/math-base-special-rempio2' );\n\n\n// VARIABLES //\n\n// High word for PI/4: 0x3fe921fb = 1072243195 => 00111111111010010010000111111011\nvar PIO4_HIGH_WORD = 0x3fe921fb|0; // asm type annotation\n\n// 2^-26 = 1.4901161193847656e-8 => 0011111001010000000000000000000000000000000000000000000000000000 => high word => 00111110010100000000000000000000 => 0x3e500000 = 1045430272\nvar SMALL_HIGH_WORD = 0x3e500000|0; // asm type annotation\n\n// Array for storing remainder elements:\nvar Y = [ 0.0, 0.0 ];\n\n\n// MAIN //\n\n/**\n* Computes the sine of a number.\n*\n* ## Method\n*\n* -   Let \\\\(S\\\\), \\\\(C\\\\), and \\\\(T\\\\) denote the \\\\(\\sin\\\\), \\\\(\\cos\\\\), and \\\\(\\tan\\\\), respectively, on \\\\(\\[-\\pi/4, +\\pi/4\\]\\\\).\n*\n* -   Reduce the argument \\\\(x\\\\) to \\\\(y1+y2 = x-k\\pi/2\\\\) in \\\\(\\[-\\pi/4, +\\pi/4\\]\\\\), and let \\\\(n = k \\mod 4\\\\).\n*\n* -   We have\n*\n*     | n | sin(x) | cos(x) | tan(x) |\n*     | - | ------ | ------ | ------ |\n*     | 0 |   S    |   C    |    T   |\n*     | 1 |   C    |  -S    |  -1/T  |\n*     | 2 |  -S    |  -C    |    T   |\n*     | 3 |  -C    |   S    |  -1/T  |\n*\n* @param {number} x - input value (in radians)\n* @returns {number} sine\n*\n* @example\n* var v = sin( 0.0 );\n* // returns ~0.0\n*\n* @example\n* var v = sin( 3.141592653589793/2.0 );\n* // returns ~1.0\n*\n* @example\n* var v = sin( -3.141592653589793/6.0 );\n* // returns ~-0.5\n*\n* @example\n* var v = sin( NaN );\n* // returns NaN\n*/\nfunction sin( x ) {\n\tvar ix;\n\tvar n;\n\n\tix = getHighWord( x );\n\tix &= HIGH_WORD_ABS_MASK;\n\n\t// Case: |x| ~< π/4\n\tif ( ix <= PIO4_HIGH_WORD ) {\n\t\t// Case: |x| ~< 2^-26\n\t\tif ( ix < SMALL_HIGH_WORD ) {\n\t\t\treturn x;\n\t\t}\n\t\treturn kernelSin( x, 0.0 );\n\t}\n\t// Case: x is NaN or infinity\n\tif ( ix >= HIGH_WORD_EXPONENT_MASK ) {\n\t\treturn NaN;\n\t}\n\t// Argument reduction...\n\tn = rempio2( x, Y );\n\tswitch ( n & 3 ) {\n\tcase 0:\n\t\treturn kernelSin( Y[ 0 ], Y[ 1 ] );\n\tcase 1:\n\t\treturn kernelCos( Y[ 0 ], Y[ 1 ] );\n\tcase 2:\n\t\treturn -kernelSin( Y[ 0 ], Y[ 1 ] );\n\tdefault:\n\t\treturn -kernelCos( Y[ 0 ], Y[ 1 ] );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = sin;\n"],"names":["HIGH_WORD_ABS_MASK","require$$0","HIGH_WORD_EXPONENT_MASK","require$$1","getHighWord","require$$2","kernelCos","require$$3","kernelSin","require$$4","rempio2","require$$5","PIO4_HIGH_WORD","SMALL_HIGH_WORD","Y","sin","x","ix","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAqBC,EAAA,GACrBC,IAA0BC,EAAA,GAC1BC,IAAcC,EAAA,GACdC,IAAYC,EAAA,GACZC,IAAYC,EAAA,GACZC,IAAUC,EAAA,GAMVC,IAAiB,YAGjBC,IAAkB,YAGlBC,IAAI,CAAE,GAAK,CAAG;AA0ClB,WAASC,EAAKC,GAAI;AACjB,QAAIC,GACA;AAMJ,QAJAA,IAAKb,EAAaY,CAAC,GACnBC,KAAMjB,GAGDiB,KAAML;AAEV,aAAKK,IAAKJ,IACFG,IAEDR,EAAWQ,GAAG,CAAG;AAGzB,QAAKC,KAAMf;AACV,aAAO;AAIR,YADA,IAAIQ,EAASM,GAAGF,CAAC,GACR,IAAI,GAAC;AAAA,MACd,KAAK;AACJ,eAAON,EAAWM,EAAG,CAAC,GAAIA,EAAG,CAAC,CAAE;AAAA,MACjC,KAAK;AACJ,eAAOR,EAAWQ,EAAG,CAAC,GAAIA,EAAG,CAAC,CAAE;AAAA,MACjC,KAAK;AACJ,eAAO,CAACN,EAAWM,EAAG,CAAC,GAAIA,EAAG,EAAG;AAAA,MAClC;AACC,eAAO,CAACR,EAAWQ,EAAG,CAAC,GAAIA,EAAG,EAAG;AAAA,IACnC;AAAA,EACA;AAKA,SAAAI,IAAiBH;;","x_google_ignoreList":[0]}

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

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

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

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

@@ -1,39 +0,0 @@
-import { __require as v } from "../../../../../@stdlib_math-base-assert-is-nan@0.2.2/node_modules/@stdlib/math-base-assert-is-nan/lib/index.js";
-import { __require as p } from "../../../../../@stdlib_math-base-assert-is-infinite@0.2.2/node_modules/@stdlib/math-base-assert-is-infinite/lib/index.js";
-import { __require as b } from "../../../../../@stdlib_math-base-special-cos@0.2.1/node_modules/@stdlib/math-base-special-cos/lib/index.js";
-import { __require as L } from "../../../../../@stdlib_math-base-special-sin@0.2.1/node_modules/@stdlib/math-base-special-sin/lib/index.js";
-import { __require as $ } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
-import { __require as c } from "../../../../../@stdlib_math-base-special-copysign@0.2.2/node_modules/@stdlib/math-base-special-copysign/lib/index.js";
-import { __require as N } from "../../../../../@stdlib_constants-float64-pi@0.2.2/node_modules/@stdlib/constants-float64-pi/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.
-*/
-var t, f;
-function R() {
-  if (f) return t;
-  f = 1;
-  var q = v(), s = p(), o = b(), a = L(), _ = $(), e = c(), u = N();
-  function m(n) {
-    var i, r;
-    return q(n) ? NaN : s(n) ? NaN : (r = n % 2, i = _(r), i === 0 || i === 1 ? e(0, r) : i < 0.25 ? a(u * r) : i < 0.75 ? (i = 0.5 - i, e(o(u * i), r)) : i < 1.25 ? (r = e(1, r) - r, a(u * r)) : i < 1.75 ? (i -= 1.5, -e(o(u * i), r)) : (r -= e(2, r), a(u * r)));
-  }
-  return t = m, t;
-}
-export {
-  R as __require
-};
-//# sourceMappingURL=main.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-sinpi@0.2.1/node_modules/@stdlib/math-base-special-sinpi/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/*\n* Notes:\n*\t=> sin(-x) = -sin(x)\n*\t=> sin(+n) = +0, where `n` is a positive integer\n*\t=> sin(-n) = -sin(+n) = -0, where `n` is a positive integer\n*\t=> cos(-x) = cos(x)\n*/\n\n\n// MODULES //\n\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar isInfinite = require( '@stdlib/math-base-assert-is-infinite' );\nvar cos = require( '@stdlib/math-base-special-cos' );\nvar sin = require( '@stdlib/math-base-special-sin' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar copysign = require( '@stdlib/math-base-special-copysign' );\nvar PI = require( '@stdlib/constants-float64-pi' );\n\n\n// MAIN //\n\n/**\n* Computes the value of `sin(πx)`.\n*\n* @param {number} x - input value\n* @returns {number} function value\n*\n* @example\n* var y = sinpi( 0.0 );\n* // returns 0.0\n*\n* @example\n* var y = sinpi( 0.5 );\n* // returns 1.0\n*\n* @example\n* var y = sinpi( 0.9 );\n* // returns ~0.309\n*\n* @example\n* var y = sinpi( NaN );\n* // returns NaN\n*/\nfunction sinpi( x ) {\n\tvar ar;\n\tvar r;\n\tif ( isnan( x ) ) {\n\t\treturn NaN;\n\t}\n\tif ( isInfinite( x ) ) {\n\t\treturn NaN;\n\t}\n\t// Argument reduction (reduce to [0,2))...\n\tr = x % 2.0; // sign preserving\n\tar = abs( r );\n\n\t// If `x` is an integer, the mod is an integer...\n\tif ( ar === 0.0 || ar === 1.0 ) {\n\t\treturn copysign( 0.0, r );\n\t}\n\tif ( ar < 0.25 ) {\n\t\treturn sin( PI*r );\n\t}\n\t// In each of the following, we further reduce to [-π/4,π/4)...\n\tif ( ar < 0.75 ) {\n\t\tar = 0.5 - ar;\n\t\treturn copysign( cos( PI*ar ), r );\n\t}\n\tif ( ar < 1.25 ) {\n\t\tr = copysign( 1.0, r ) - r;\n\t\treturn sin( PI*r );\n\t}\n\tif ( ar < 1.75 ) {\n\t\tar -= 1.5;\n\t\treturn -copysign( cos( PI*ar ), r );\n\t}\n\tr -= copysign( 2.0, r );\n\treturn sin( PI*r );\n}\n\n\n// EXPORTS //\n\nmodule.exports = sinpi;\n"],"names":["isnan","require$$0","isInfinite","require$$1","cos","require$$2","sin","require$$3","abs","require$$4","copysign","require$$5","PI","require$$6","sinpi","x","ar","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BA,MAAIA,IAAQC,EAAA,GACRC,IAAaC,EAAA,GACbC,IAAMC,EAAA,GACNC,IAAMC,EAAA,GACNC,IAAMC,EAAA,GACNC,IAAWC,EAAA,GACXC,IAAKC,EAAA;AA2BT,WAASC,EAAOC,GAAI;AACnB,QAAIC,GACA;AACJ,WAAKhB,EAAOe,KACJ,MAEHb,EAAYa,KACT,OAGR,IAAIA,IAAI,GACRC,IAAKR,EAAK,CAAC,GAGNQ,MAAO,KAAOA,MAAO,IAClBN,EAAU,GAAK,CAAC,IAEnBM,IAAK,OACFV,EAAKM,IAAG,CAAC,IAGZI,IAAK,QACTA,IAAK,MAAMA,GACJN,EAAUN,EAAKQ,IAAGI,CAAE,GAAI,CAAC,KAE5BA,IAAK,QACT,IAAIN,EAAU,GAAK,CAAC,IAAK,GAClBJ,EAAKM,IAAG,CAAC,KAEZI,IAAK,QACTA,KAAM,KACC,CAACN,EAAUN,EAAKQ,IAAGI,CAAE,GAAI,CAAC,MAElC,KAAKN,EAAU,GAAK,CAAC,GACdJ,EAAKM,IAAG,CAAC;AAAA,EACjB;AAKA,SAAAK,IAAiBH;;","x_google_ignoreList":[0]}

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

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

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

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

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/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// MAIN //\n\n/**\n* Compute the principal square root of a double-precision floating-point number.\n*\n* @type {Function}\n* @param {number} x - input value\n* @returns {number} principal square root\n*\n* @example\n* var v = sqrt( 4.0 );\n* // returns 2.0\n*\n* v = sqrt( 9.0 );\n* // returns 3.0\n*\n* v = sqrt( 0.0 );\n* // returns 0.0\n*\n* v = sqrt( -4.0 );\n* // returns NaN\n*\n* v = sqrt( NaN );\n* // returns NaN\n*/\nvar sqrt = Math.sqrt; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nmodule.exports = sqrt;\n"],"names":["sqrt","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;AA6CA,MAAIA,IAAO,KAAK;AAKhB,SAAAC,IAAiBD;;","x_google_ignoreList":[0]}

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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-trunc@0.2.2/node_modules/@stdlib/math-base-special-trunc/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* Round a double-precision floating-point number toward zero.\n*\n* @module @stdlib/math-base-special-trunc\n*\n* @example\n* var trunc = require( '@stdlib/math-base-special-trunc' );\n*\n* var v = trunc( -4.2 );\n* // returns -4.0\n*\n* v = trunc( 9.99999 );\n* // returns 9.0\n*\n* v = trunc( 0.0 );\n* // returns 0.0\n*\n* v = trunc( -0.0 );\n* // returns -0.0\n*\n* v = trunc( NaN );\n* // returns NaN\n*\n* v = trunc( Infinity );\n* // returns Infinity\n*\n* v = trunc( -Infinity );\n* // returns -Infinity\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-trunc@0.2.2/node_modules/@stdlib/math-base-special-trunc/lib/main.js

@@ -1,33 +0,0 @@
-import { __require as t } from "../../../../../@stdlib_math-base-special-floor@0.2.3/node_modules/@stdlib/math-base-special-floor/lib/index.js";
-import { __require as o } from "../../../../../@stdlib_math-base-special-ceil@0.2.2/node_modules/@stdlib/math-base-special-ceil/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.
-*/
-var e, i;
-function _() {
-  if (i) return e;
-  i = 1;
-  var u = t(), n = o();
-  function a(r) {
-    return r < 0 ? n(r) : u(r);
-  }
-  return e = a, e;
-}
-export {
-  _ as __require
-};
-//# sourceMappingURL=main.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-trunc@0.2.2/node_modules/@stdlib/math-base-special-trunc/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 floor = require( '@stdlib/math-base-special-floor' );\nvar ceil = require( '@stdlib/math-base-special-ceil' );\n\n\n// MAIN //\n\n/**\n* Rounds a double-precision floating-point number toward zero.\n*\n* @param {number} x - input value\n* @returns {number} rounded value\n*\n* @example\n* var v = trunc( -4.2 );\n* // returns -4.0\n*\n* @example\n* var v = trunc( 9.99999 );\n* // returns 9.0\n*\n* @example\n* var v = trunc( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = trunc( -0.0 );\n* // returns -0.0\n*\n* @example\n* var v = trunc( NaN );\n* // returns NaN\n*\n* @example\n* var v = trunc( Infinity );\n* // returns Infinity\n*\n* @example\n* var v = trunc( -Infinity );\n* // returns -Infinity\n*/\nfunction trunc( x ) {\n\tif ( x < 0.0 ) {\n\t\treturn ceil( x );\n\t}\n\treturn floor( x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = trunc;\n"],"names":["floor","require$$0","ceil","require$$1","trunc","x","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAQC,EAAA,GACRC,IAAOC,EAAA;AAuCX,WAASC,EAAOC,GAAI;AACnB,WAAKA,IAAI,IACDH,EAAMG,CAAC,IAERL,EAAOK,CAAC;AAAA,EAChB;AAKA,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-continued-fraction@0.2.2/node_modules/@stdlib/math-base-tools-continued-fraction/lib/basic.js

@@ -1,51 +0,0 @@
-import { __require as l } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
-import { __require as b } from "../../../../../@stdlib_constants-float64-eps@0.2.2/node_modules/@stdlib/constants-float64-eps/lib/index.js";
-import { __require as A } from "../../../../../@stdlib_constants-float32-smallest-normal@0.2.2/node_modules/@stdlib/constants-float32-smallest-normal/lib/index.js";
-/**
-* @license Apache-2.0
-*
-* Copyright (c) 2018 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*    http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-var c, _;
-function B() {
-  if (_) return c;
-  _ = 1;
-  var s = l(), m = b(), f = A(), q = 1e6;
-  function d(u, o, v) {
-    var e, t, i, a, r, n;
-    n = u(), r = n[1], t = n[0], r === 0 && (r = f), i = r, a = 0;
-    do
-      n = u(), n && (a = n[1] + n[0] * a, a === 0 && (a = f), i = n[1] + n[0] / i, i === 0 && (i = f), a = 1 / a, e = i * a, r *= e);
-    while (n && s(e - 1) > o && --v);
-    return t / r;
-  }
-  function p(u, o, v) {
-    var e, t, i, a, r;
-    r = u(), a = r[1], a === 0 && (a = f), t = a, i = 0;
-    do
-      r = u(), r && (i = r[1] + r[0] * i, i === 0 && (i = f), t = r[1] + r[0] / t, t === 0 && (t = f), i = 1 / i, e = t * i, a *= e);
-    while (r && s(e - 1) > o && --v);
-    return a;
-  }
-  function L(u, o) {
-    var v, e, t;
-    return e = {}, arguments.length > 1 && (e = o), t = e.tolerance || m, v = e.maxIter || q, e.keep ? p(u, t, v) : d(u, t, v);
-  }
-  return c = L, c;
-}
-export {
-  B as __require
-};
-//# sourceMappingURL=basic.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-continued-fraction@0.2.2/node_modules/@stdlib/math-base-tools-continued-fraction/lib/basic.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"basic.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-tools-continued-fraction@0.2.2/node_modules/@stdlib/math-base-tools-continued-fraction/lib/basic.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 abs = require( '@stdlib/math-base-special-abs' );\nvar EPS = require( '@stdlib/constants-float64-eps' );\nvar FLOAT32_SMALLEST_NORMAL = require( '@stdlib/constants-float32-smallest-normal' );\n\n\n// VARIABLES //\n\nvar MAX_ITER = 1000000;\n\n\n// FUNCTIONS //\n\n/**\n* Evaluates a continued fraction expansion.\n*\n* ```text\n*           a1\n*      ---------------\n*      b1 +     a2\n*           ----------\n*            b2 +   a3\n*                -----\n*                b3 + ...\n* ```\n*\n* @private\n* @param {Function} gen - function giving terms of continued fraction expansion\n* @param {PositiveNumber} factor - further terms are only added as long as factor*result is smaller than the next term\n* @param {PositiveInteger} maxIter - maximum number of iterations\n* @returns {number} evaluated expansion\n*/\nfunction continuedFractionA( gen, factor, maxIter ) {\n\tvar delta;\n\tvar a0;\n\tvar C;\n\tvar D;\n\tvar f;\n\tvar v;\n\n\tv = gen();\n\tf = v[ 1 ];\n\ta0 = v[ 0 ];\n\tif ( f === 0 ) {\n\t\tf = FLOAT32_SMALLEST_NORMAL;\n\t}\n\tC = f;\n\tD = 0.0;\n\n\tdo {\n\t\tv = gen();\n\t\tif ( v ) {\n\t\t\tD = v[ 1 ] + ( v[ 0 ] * D );\n\t\t\tif ( D === 0.0 ) {\n\t\t\t\tD = FLOAT32_SMALLEST_NORMAL;\n\t\t\t}\n\t\t\tC = v[ 1 ] + ( v[ 0 ] / C );\n\t\t\tif ( C === 0.0 ) {\n\t\t\t\tC = FLOAT32_SMALLEST_NORMAL;\n\t\t\t}\n\t\t\tD = 1.0 / D;\n\t\t\tdelta = C * D;\n\t\t\tf *= delta;\n\t\t}\n\t} while ( v && ( abs( delta - 1.0 ) > factor ) && --maxIter ); // eslint-disable-line no-plusplus\n\n\treturn a0 / f;\n}\n\n/**\n* Evaluates a continued fraction expansion.\n*\n* ```text\n*      b0 +   a1\n*      ---------------\n*      b1 +   a2\n*           ----------\n*           b2 +   a3\n*                -----\n*                b3 + ...\n* ```\n*\n* @private\n* @param {Function} gen - function giving terms of continued fraction expansion\n* @param {PositiveNumber} factor - further terms are only added as long as factor*result is smaller than the next term\n* @param {PositiveInteger} maxIter - maximum number of iterations\n* @returns {number} evaluated expansion\n*/\nfunction continuedFractionB( gen, factor, maxIter ) {\n\tvar delta;\n\tvar C;\n\tvar D;\n\tvar f;\n\tvar v;\n\n\tv = gen();\n\tf = v[ 1 ];\n\tif ( f === 0.0 ) {\n\t\tf = FLOAT32_SMALLEST_NORMAL;\n\t}\n\tC = f;\n\tD = 0.0;\n\tdo {\n\t\tv = gen();\n\t\tif ( v ) {\n\t\t\tD = v[ 1 ] + ( v[ 0 ] * D );\n\t\t\tif ( D === 0.0 ) {\n\t\t\t\tD = FLOAT32_SMALLEST_NORMAL;\n\t\t\t}\n\t\t\tC = v[ 1 ] + ( v[ 0 ] / C );\n\t\t\tif ( C === 0.0 ) {\n\t\t\t\tC = FLOAT32_SMALLEST_NORMAL;\n\t\t\t}\n\t\t\tD = 1.0 / D;\n\t\t\tdelta = C * D;\n\t\t\tf *= delta;\n\t\t}\n\t} while ( v && ( abs( delta - 1.0 ) > factor ) && --maxIter ); // eslint-disable-line no-plusplus\n\treturn f;\n}\n\n\n// MAIN //\n\n/**\n* Evaluates the continued fraction approximation for the supplied series generator using the modified Lentz algorithm.\n*\n* ## References\n*\n* -   Lentz, William J. 1976. \"Generating bessel functions in Mie scattering calculations using continued fractions.\" _Applied Optics_ 15 (3): 668–71. doi:[10.1364/AO.15.000668](https://doi.org/10.1364/AO.15.000668).\n*\n* @param {Function} generator - function returning terms of continued fraction expansion\n* @param {Object} [options] - function options\n* @param {PositiveInteger} [options.maxIter=1000000] - maximum number of iterations\n* @param {PositiveNumber} [options.tolerance=2.22e-16] - further terms are only added as long as the next term is greater than current term times the tolerance\n* @param {boolean} [options.keep=false] - whether to keep the leading b term\n* @returns {number} value of continued fraction\n*\n* @example\n* // Continued fraction for (e-1)^(-1):\n* var gen = generator();\n* var out = continuedFraction( gen );\n* // returns ~0.582\n*\n* function generator() {\n*    var i = 0;\n*    return function() {\n*        i++;\n*        return [ i, i ];\n*    };\n* }\n*/\nfunction continuedFraction( generator, options ) {\n\tvar maxIter;\n\tvar opts;\n\tvar eps;\n\n\topts = {};\n\tif ( arguments.length > 1 ) {\n\t\topts = options;\n\t}\n\teps = opts.tolerance || EPS;\n\tmaxIter = opts.maxIter || MAX_ITER;\n\n\tif ( opts.keep ) {\n\t\treturn continuedFractionB( generator, eps, maxIter );\n\t}\n\treturn continuedFractionA( generator, eps, maxIter );\n}\n\n\n// EXPORTS //\n\nmodule.exports = continuedFraction;\n"],"names":["abs","require$$0","EPS","require$$1","FLOAT32_SMALLEST_NORMAL","require$$2","MAX_ITER","continuedFractionA","gen","factor","maxIter","delta","a0","C","D","f","v","continuedFractionB","continuedFraction","generator","options","opts","eps","basic"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAMC,EAAA,GACNC,IAAMC,EAAA,GACNC,IAA0BC,EAAA,GAK1BC,IAAW;AAwBf,WAASC,EAAoBC,GAAKC,GAAQC,GAAU;AACnD,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,IAAAA,IAAIR,EAAG,GACPO,IAAIC,EAAG,CAAC,GACRJ,IAAKI,EAAG,CAAC,GACJD,MAAM,MACVA,IAAIX,IAELS,IAAIE,GACJD,IAAI;AAEJ;AACC,MAAAE,IAAIR,EAAG,GACFQ,MACJF,IAAIE,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKF,GACnBA,MAAM,MACVA,IAAIV,IAELS,IAAIG,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKH,GACnBA,MAAM,MACVA,IAAIT,IAELU,IAAI,IAAMA,GACVH,IAAQE,IAAIC,GACZC,KAAKJ;AAAA,WAEGK,KAAOhB,EAAKW,IAAQ,CAAG,IAAKF,KAAY,EAAEC;AAEpD,WAAOE,IAAKG;AAAA,EACb;AAqBA,WAASE,EAAoBT,GAAKC,GAAQC,GAAU;AACnD,QAAIC,GACAE,GACAC,GACAC,GACAC;AAEJ,IAAAA,IAAIR,EAAG,GACPO,IAAIC,EAAG,CAAC,GACHD,MAAM,MACVA,IAAIX,IAELS,IAAIE,GACJD,IAAI;AACJ;AACC,MAAAE,IAAIR,EAAG,GACFQ,MACJF,IAAIE,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKF,GACnBA,MAAM,MACVA,IAAIV,IAELS,IAAIG,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKH,GACnBA,MAAM,MACVA,IAAIT,IAELU,IAAI,IAAMA,GACVH,IAAQE,IAAIC,GACZC,KAAKJ;AAAA,WAEGK,KAAOhB,EAAKW,IAAQ,CAAG,IAAKF,KAAY,EAAEC;AACpD,WAAOK;AAAA,EACR;AAiCA,WAASG,EAAmBC,GAAWC,GAAU;AAChD,QAAIV,GACAW,GACAC;AASJ,WAPAD,IAAO,CAAA,GACF,UAAU,SAAS,MACvBA,IAAOD,IAERE,IAAMD,EAAK,aAAanB,GACxBQ,IAAUW,EAAK,WAAWf,GAErBe,EAAK,OACFJ,EAAoBE,GAAWG,GAAKZ,CAAO,IAE5CH,EAAoBY,GAAWG,GAAKZ,CAAO;AAAA,EACnD;AAKA,SAAAa,IAAiBL;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-continued-fraction@0.2.2/node_modules/@stdlib/math-base-tools-continued-fraction/lib/generators.js

@@ -1,59 +0,0 @@
-import { __require as L } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
-import { __require as h } from "../../../../../@stdlib_constants-float32-smallest-normal@0.2.2/node_modules/@stdlib/constants-float32-smallest-normal/lib/index.js";
-import { __require as A } from "../../../../../@stdlib_constants-float64-eps@0.2.2/node_modules/@stdlib/constants-float64-eps/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.
-*/
-var c, _;
-function E() {
-  if (_) return c;
-  _ = 1;
-  var l = L(), f = h(), d = A(), p = 1e6;
-  function q(n, s, v) {
-    var u, a, o, i, e, r, t;
-    if (u = typeof n.next == "function", t = u ? n.next().value : n(), i = t[1], o = t[0], i === 0 && (i = f), e = i, r = 0, u === !0)
-      do
-        t = n.next().value, t && (r = t[1] + t[0] * r, r === 0 && (r = f), e = t[1] + t[0] / e, e === 0 && (e = f), r = 1 / r, a = e * r, i *= a);
-      while (l(a - 1) > s && --v);
-    else
-      do
-        t = n(), t && (r = t[1] + t[0] * r, r === 0 && (r = f), e = t[1] + t[0] / e, e === 0 && (e = f), r = 1 / r, a = e * r, i *= a);
-      while (t && l(a - 1) > s && --v);
-    return o / i;
-  }
-  function m(n, s, v) {
-    var u, a, o, i, e, r;
-    if (u = typeof n.next == "function", r = u ? n.next().value : n(), o = r[1], o === 0 && (o = f), i = o, e = 0, u === !0)
-      do
-        r = n.next().value, r && (e = r[1] + r[0] * e, e === 0 && (e = f), i = r[1] + r[0] / i, i === 0 && (i = f), e = 1 / e, a = i * e, o *= a);
-      while (r && l(a - 1) > s && --v);
-    else
-      do
-        r = n(), r && (e = r[1] + r[0] * e, e === 0 && (e = f), i = r[1] + r[0] / i, i === 0 && (i = f), e = 1 / e, a = i * e, o *= a);
-      while (r && l(a - 1) > s && --v);
-    return o;
-  }
-  function x(n, s) {
-    var v, u, a;
-    return u = {}, arguments.length > 1 && (u = s), v = u.maxIter || p, a = u.tolerance || d, u.keep ? m(n, a, v) : q(n, a, v);
-  }
-  return c = x, c;
-}
-export {
-  E as __require
-};
-//# sourceMappingURL=generators.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-continued-fraction@0.2.2/node_modules/@stdlib/math-base-tools-continued-fraction/lib/generators.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"generators.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-tools-continued-fraction@0.2.2/node_modules/@stdlib/math-base-tools-continued-fraction/lib/generators.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 abs = require( '@stdlib/math-base-special-abs' );\nvar FLOAT32_SMALLEST_NORMAL = require( '@stdlib/constants-float32-smallest-normal' );\nvar EPS = require( '@stdlib/constants-float64-eps' );\n\n\n// VARIABLES //\n\nvar MAX_ITER = 1000000;\n\n\n// FUNCTIONS //\n\n/**\n* Evaluates a continued fraction expansion.\n*\n* ```text\n*           a1\n*      ---------------\n*      b1 +     a2\n*           ----------\n*            b2 +   a3\n*                -----\n*                b3 + ...\n* ```\n*\n* @private\n* @param {Function} gen - function giving terms of continued fraction expansion\n* @param {PositiveNumber} factor - further terms are only added as long as factor*result is smaller than the next term\n* @param {PositiveInteger} maxIter - maximum number of iterations\n* @returns {number} evaluated expansion\n*/\nfunction continuedFractionA( gen, factor, maxIter ) {\n\tvar isgenerator;\n\tvar delta;\n\tvar a0;\n\tvar f;\n\tvar C;\n\tvar D;\n\tvar v;\n\n\tisgenerator = typeof gen.next === 'function';\n\tv = ( isgenerator ) ? gen.next().value : gen();\n\tf = v[ 1 ];\n\ta0 = v[ 0 ];\n\tif ( f === 0.0 ) {\n\t\tf = FLOAT32_SMALLEST_NORMAL;\n\t}\n\tC = f;\n\tD = 0;\n\tif ( isgenerator === true ) {\n\t\tdo {\n\t\t\tv = gen.next().value;\n\t\t\tif ( v ) {\n\t\t\t\tD = v[ 1 ] + ( v[ 0 ] * D );\n\t\t\t\tif ( D === 0.0 ) {\n\t\t\t\t\tD = FLOAT32_SMALLEST_NORMAL;\n\t\t\t\t}\n\t\t\t\tC = v[ 1 ] + ( v[ 0 ] / C );\n\t\t\t\tif ( C === 0.0 ) {\n\t\t\t\t\tC = FLOAT32_SMALLEST_NORMAL;\n\t\t\t\t}\n\t\t\t\tD = 1.0 / D;\n\t\t\t\tdelta = C * D;\n\t\t\t\tf *= delta;\n\t\t\t}\n\t\t} while ( ( abs( delta - 1.0 ) > factor ) && --maxIter ); // eslint-disable-line no-plusplus\n\t} else {\n\t\tdo {\n\t\t\tv = gen();\n\t\t\tif ( v ) {\n\t\t\t\tD = v[ 1 ] + ( v[ 0 ] * D );\n\t\t\t\tif ( D === 0.0 ) {\n\t\t\t\t\tD = FLOAT32_SMALLEST_NORMAL;\n\t\t\t\t}\n\t\t\t\tC = v[ 1 ] + ( v[ 0 ] / C );\n\t\t\t\tif ( C === 0.0 ) {\n\t\t\t\t\tC = FLOAT32_SMALLEST_NORMAL;\n\t\t\t\t}\n\t\t\t\tD = 1.0 / D;\n\t\t\t\tdelta = C * D;\n\t\t\t\tf *= delta;\n\t\t\t}\n\t\t} while ( v && ( abs( delta - 1.0 ) > factor ) && --maxIter ); // eslint-disable-line no-plusplus\n\t}\n\treturn a0 / f;\n}\n\n/**\n* Evaluates a continued fraction expansion.\n*\n* ```text\n*      b0 +    a1\n*      ---------------\n*      b1 +     a2\n*           ----------\n*           b2 +   a3\n*                -----\n*                b3 + ...\n* ```\n*\n* @private\n* @param {Function} gen - function giving terms of continued fraction expansion\n* @param {PositiveNumber} factor - further terms are only added as long as factor*result is smaller than the next term\n* @param {PositiveInteger} maxIter - maximum number of iterations\n* @returns {number} evaluated expansion\n*/\nfunction continuedFractionB( gen, factor, maxIter ) {\n\tvar isgenerator;\n\tvar delta;\n\tvar f;\n\tvar C;\n\tvar D;\n\tvar v;\n\n\tisgenerator = typeof gen.next === 'function';\n\tv = ( isgenerator ) ? gen.next().value : gen();\n\tf = v[ 1 ];\n\tif ( f === 0.0 ) {\n\t\tf = FLOAT32_SMALLEST_NORMAL;\n\t}\n\tC = f;\n\tD = 0.0;\n\tif ( isgenerator === true ) {\n\t\tdo {\n\t\t\tv = gen.next().value;\n\t\t\tif ( v ) {\n\t\t\t\tD = v[ 1 ] + ( v[ 0 ] * D );\n\t\t\t\tif ( D === 0.0 ) {\n\t\t\t\t\tD = FLOAT32_SMALLEST_NORMAL;\n\t\t\t\t}\n\t\t\t\tC = v[ 1 ] + ( v[ 0 ] / C );\n\t\t\t\tif ( C === 0.0 ) {\n\t\t\t\t\tC = FLOAT32_SMALLEST_NORMAL;\n\t\t\t\t}\n\t\t\t\tD = 1.0 / D;\n\t\t\t\tdelta = C * D;\n\t\t\t\tf *= delta;\n\t\t\t}\n\t\t} while ( v && ( abs( delta - 1.0 ) > factor ) && --maxIter ); // eslint-disable-line no-plusplus\n\t} else {\n\t\tdo {\n\t\t\tv = gen();\n\t\t\tif ( v ) {\n\t\t\t\tD = v[ 1 ] + ( v[ 0 ] * D );\n\t\t\t\tif ( D === 0.0 ) {\n\t\t\t\t\tD = FLOAT32_SMALLEST_NORMAL;\n\t\t\t\t}\n\t\t\t\tC = v[ 1 ] + ( v[ 0 ] / C );\n\t\t\t\tif ( C === 0.0 ) {\n\t\t\t\t\tC = FLOAT32_SMALLEST_NORMAL;\n\t\t\t\t}\n\t\t\t\tD = 1.0 / D;\n\t\t\t\tdelta = C * D;\n\t\t\t\tf *= delta;\n\t\t\t}\n\t\t} while ( v && ( abs( delta - 1.0 ) > factor ) && --maxIter ); // eslint-disable-line no-plusplus\n\t}\n\treturn f;\n}\n\n\n// MAIN //\n\n/**\n* Evaluates the continued fraction approximation for the supplied series generator using the modified Lentz algorithm.\n*\n* ## References\n*\n* -   Lentz, William J. 1976. \"Generating bessel functions in Mie scattering calculations using continued fractions.\" _Applied Optics_ 15 (3): 668–71. doi:[10.1364/AO.15.000668](https://doi.org/10.1364/AO.15.000668).\n*\n* @param {Function} generator - function returning terms of continued fraction expansion\n* @param {Object} [options] - function options\n* @param {PositiveInteger} [options.maxIter=1000] - maximum number of iterations\n* @param {PositiveNumber} [options.tolerance=2.22e-16] - further terms are only added as long as the next term is greater than current term times the tolerance\n* @param {boolean} [options.keep=false] - whether to keep the leading b term\n* @returns {number} value of continued fraction\n*\n* @example\n* // Continued fraction for (e-1)^(-1):\n* var gen = generator();\n* var out = continuedFraction( gen );\n* // returns ~0.582\n*\n* function* generator() {\n*    var i = 0;\n*    while ( true ) {\n*        i++;\n*        yield [ i, i ];\n*    }\n* }\n*/\nfunction continuedFraction( generator, options ) {\n\tvar maxIter;\n\tvar opts;\n\tvar eps;\n\n\topts = {};\n\tif ( arguments.length > 1 ) {\n\t\topts = options;\n\t}\n\tmaxIter = opts.maxIter || MAX_ITER;\n\teps = opts.tolerance || EPS;\n\n\tif ( opts.keep ) {\n\t\treturn continuedFractionB( generator, eps, maxIter );\n\t}\n\treturn continuedFractionA( generator, eps, maxIter );\n}\n\n\n// EXPORTS //\n\nmodule.exports = continuedFraction;\n"],"names":["abs","require$$0","FLOAT32_SMALLEST_NORMAL","require$$1","EPS","require$$2","MAX_ITER","continuedFractionA","gen","factor","maxIter","isgenerator","delta","a0","f","C","D","v","continuedFractionB","continuedFraction","generator","options","opts","eps","generators"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAMC,EAAA,GACNC,IAA0BC,EAAA,GAC1BC,IAAMC,EAAA,GAKNC,IAAW;AAwBf,WAASC,EAAoBC,GAAKC,GAAQC,GAAU;AACnD,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAWJ,QATAN,IAAc,OAAOH,EAAI,QAAS,YAClCS,IAAMN,IAAgBH,EAAI,KAAI,EAAG,QAAQA,EAAG,GAC5CM,IAAIG,EAAG,CAAC,GACRJ,IAAKI,EAAG,CAAC,GACJH,MAAM,MACVA,IAAIZ,IAELa,IAAID,GACJE,IAAI,GACCL,MAAgB;AACpB;AACC,QAAAM,IAAIT,EAAI,KAAI,EAAG,OACVS,MACJD,IAAIC,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKD,GACnBA,MAAM,MACVA,IAAId,IAELa,IAAIE,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKF,GACnBA,MAAM,MACVA,IAAIb,IAELc,IAAI,IAAMA,GACVJ,IAAQG,IAAIC,GACZF,KAAKF;AAAA,aAEKZ,EAAKY,IAAQ,CAAG,IAAKH,KAAY,EAAEC;AAAA;AAE/C;AACC,QAAAO,IAAIT,EAAG,GACFS,MACJD,IAAIC,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKD,GACnBA,MAAM,MACVA,IAAId,IAELa,IAAIE,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKF,GACnBA,MAAM,MACVA,IAAIb,IAELc,IAAI,IAAMA,GACVJ,IAAQG,IAAIC,GACZF,KAAKF;AAAA,aAEGK,KAAOjB,EAAKY,IAAQ,CAAG,IAAKH,KAAY,EAAEC;AAErD,WAAOG,IAAKC;AAAA,EACb;AAqBA,WAASI,EAAoBV,GAAKC,GAAQC,GAAU;AACnD,QAAIC,GACAC,GACAE,GACAC,GACAC,GACAC;AAUJ,QARAN,IAAc,OAAOH,EAAI,QAAS,YAClCS,IAAMN,IAAgBH,EAAI,KAAI,EAAG,QAAQA,EAAG,GAC5CM,IAAIG,EAAG,CAAC,GACHH,MAAM,MACVA,IAAIZ,IAELa,IAAID,GACJE,IAAI,GACCL,MAAgB;AACpB;AACC,QAAAM,IAAIT,EAAI,KAAI,EAAG,OACVS,MACJD,IAAIC,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKD,GACnBA,MAAM,MACVA,IAAId,IAELa,IAAIE,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKF,GACnBA,MAAM,MACVA,IAAIb,IAELc,IAAI,IAAMA,GACVJ,IAAQG,IAAIC,GACZF,KAAKF;AAAA,aAEGK,KAAOjB,EAAKY,IAAQ,CAAG,IAAKH,KAAY,EAAEC;AAAA;AAEpD;AACC,QAAAO,IAAIT,EAAG,GACFS,MACJD,IAAIC,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKD,GACnBA,MAAM,MACVA,IAAId,IAELa,IAAIE,EAAG,CAAC,IAAOA,EAAG,CAAC,IAAKF,GACnBA,MAAM,MACVA,IAAIb,IAELc,IAAI,IAAMA,GACVJ,IAAQG,IAAIC,GACZF,KAAKF;AAAA,aAEGK,KAAOjB,EAAKY,IAAQ,CAAG,IAAKH,KAAY,EAAEC;AAErD,WAAOI;AAAA,EACR;AAiCA,WAASK,EAAmBC,GAAWC,GAAU;AAChD,QAAIX,GACAY,GACAC;AASJ,WAPAD,IAAO,CAAA,GACF,UAAU,SAAS,MACvBA,IAAOD,IAERX,IAAUY,EAAK,WAAWhB,GAC1BiB,IAAMD,EAAK,aAAalB,GAEnBkB,EAAK,OACFJ,EAAoBE,GAAWG,GAAKb,CAAO,IAE5CH,EAAoBa,GAAWG,GAAKb,CAAO;AAAA,EACnD;AAKA,SAAAc,IAAiBL;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-continued-fraction@0.2.2/node_modules/@stdlib/math-base-tools-continued-fraction/lib/index.js

@@ -1,31 +0,0 @@
-import { __require as t } from "../../../../../@stdlib_assert-has-generator-support@0.2.2/node_modules/@stdlib/assert-has-generator-support/lib/index.js";
-import { __require as n } from "./generators.js";
-import { __require as s } from "./basic.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 m() {
-  if (i) return e;
-  i = 1;
-  var a = t(), o = n(), u = s(), r;
-  return a() ? r = o : r = u, e = r, e;
-}
-export {
-  m as __require
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-continued-fraction@0.2.2/node_modules/@stdlib/math-base-tools-continued-fraction/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-tools-continued-fraction@0.2.2/node_modules/@stdlib/math-base-tools-continued-fraction/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* Calculate a continued fraction approximation.\n*\n* @module @stdlib/math-base-tools-continued-fraction\n*\n* @example\n* var continuedFraction = require( '@stdlib/math-base-tools-continued-fraction' );\n*\n* // Continued fraction for (e-1)^(-1):\n* var gen = generator()\n* var out = continuedFraction( gen );\n* // returns ~0.582\n*\n* function generator() {\n*    var i = 0;\n*    return function() {\n*        i++;\n*        return [ i, i ];\n*    };\n* }\n*/\n\n// MODULES //\n\nvar hasGeneratorSupport = require( '@stdlib/assert-has-generator-support' );\nvar generator = require( './generators.js' );\nvar basic = require( './basic.js' );\n\n\n// MAIN //\n\nvar continuedFraction;\nif ( hasGeneratorSupport() ) {\n\tcontinuedFraction = generator;\n} else {\n\tcontinuedFraction = basic;\n}\n\n\n// EXPORTS //\n\nmodule.exports = continuedFraction;\n"],"names":["hasGeneratorSupport","require$$0","generator","require$$1","basic","require$$2","continuedFraction","lib"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA4CA,MAAIA,IAAsBC,EAAA,GACtBC,IAAYC,EAAA,GACZC,IAAQC,EAAA,GAKRC;AACJ,SAAKN,EAAmB,IACvBM,IAAoBJ,IAEpBI,IAAoBF,GAMrBG,IAAiBD;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/lib/factory.js

@@ -1,50 +0,0 @@
-import { __require as s } from "../../../../../@stdlib_function-ctor@0.2.2/node_modules/@stdlib/function-ctor/lib/index.js";
-import { __require as p } 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 i, u;
-function c() {
-  if (u) return i;
-  u = 1;
-  var o = s(), f = p();
-  function l(n) {
-    var r, t, a, e;
-    if (n.length > 500)
-      return v;
-    if (r = "return function evalpoly(x){", t = n.length, t === 0)
-      r += "return 0.0;";
-    else if (t === 1)
-      r += "return " + n[0] + ";";
-    else {
-      for (r += "if(x===0.0){return " + n[0] + ";}", r += "return " + n[0], a = t - 1, e = 1; e < t; e++)
-        r += "+x*", e < a && (r += "("), r += n[e];
-      for (e = 0; e < a - 1; e++)
-        r += ")";
-      r += ";";
-    }
-    return r += "}", r += "//# sourceURL=evalpoly.factory.js", new o(r)();
-    function v(y) {
-      return f(n, y);
-    }
-  }
-  return i = l, i;
-}
-export {
-  c as __require
-};
-//# sourceMappingURL=factory.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/lib/factory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"factory.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/lib/factory.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 Fcn = require( '@stdlib/function-ctor' );\nvar evalpoly = require( './main.js' );\n\n\n// MAIN //\n\n/**\n* Generates a function for evaluating a polynomial using double-precision floating-point arithmetic.\n*\n* ## Notes\n*\n* -   The compiled function uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @param {NumericArray} c - polynomial coefficients sorted in ascending degree\n* @returns {Function} function for evaluating a polynomial\n*\n* @example\n* var polyval = factory( [ 3.0, 2.0, 1.0 ] );\n*\n* var v = polyval( 10.0 ); // => 3*10^0 + 2*10^1 + 1*10^2\n* // returns 123.0\n*\n* v = polyval( 5.0 ); // => 3*5^0 + 2*5^1 + 1*5^2\n* // returns 38.0\n*/\nfunction factory( c ) {\n\tvar f;\n\tvar n;\n\tvar m;\n\tvar i;\n\n\t// Avoid exceeding the maximum stack size on V8 :(. Note that the choice of `500` was empirically determined...\n\tif ( c.length > 500 ) {\n\t\treturn polyval;\n\t}\n\t// Code generation. Start with the function definition...\n\tf = 'return function evalpoly(x){';\n\n\t// Create the function body...\n\tn = c.length;\n\n\t// If no coefficients, the function always returns 0...\n\tif ( n === 0 ) {\n\t\tf += 'return 0.0;';\n\t}\n\t// If only one coefficient, the function always returns that coefficient...\n\telse if ( n === 1 ) {\n\t\tf += 'return ' + c[ 0 ] + ';';\n\t}\n\t// If more than one coefficient, apply Horner's method...\n\telse {\n\t\t// If `x == 0`, return the first coefficient...\n\t\tf += 'if(x===0.0){return ' + c[ 0 ] + ';}';\n\n\t\t// Otherwise, evaluate the polynomial...\n\t\tf += 'return ' + c[ 0 ];\n\t\tm = n - 1;\n\t\tfor ( i = 1; i < n; i++ ) {\n\t\t\tf += '+x*';\n\t\t\tif ( i < m ) {\n\t\t\t\tf += '(';\n\t\t\t}\n\t\t\tf += c[ i ];\n\t\t}\n\t\t// Close all the parentheses...\n\t\tfor ( i = 0; i < m-1; i++ ) {\n\t\t\tf += ')';\n\t\t}\n\t\tf += ';';\n\t}\n\t// Close the function:\n\tf += '}';\n\n\t// Add a source directive for debugging:\n\tf += '//# sourceURL=evalpoly.factory.js';\n\n\t// Create the function in the global scope:\n\treturn ( new Fcn( f ) )();\n\n\t/*\n\t*    function evalpoly( x ) {\n\t*        if ( x === 0.0 ) {\n\t*            return c[ 0 ];\n\t*        }\n\t*        return c[0]+x*(c[1]+x*(c[2]+x*(c[3]+...+x*(c[n-2]+x*c[n-1]))));\n\t*    }\n\t*/\n\n\t/**\n\t* Evaluates a polynomial.\n\t*\n\t* @private\n\t* @param {number} x - value at which to evaluate a polynomial\n\t* @returns {number} evaluated polynomial\n\t*/\n\tfunction polyval( x ) {\n\t\treturn evalpoly( c, x );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = factory;\n"],"names":["Fcn","require$$0","evalpoly","require$$1","factory","c","f","n","m","i","polyval","x","factory_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAMC,EAAA,GACNC,IAAWC,EAAA;AA0Bf,WAASC,EAASC,GAAI;AACrB,QAAIC,GACAC,GACAC,GACAC;AAGJ,QAAKJ,EAAE,SAAS;AACf,aAAOK;AASR,QANAJ,IAAI,gCAGJC,IAAIF,EAAE,QAGDE,MAAM;AACV,MAAAD,KAAK;AAAA,aAGIC,MAAM;AACf,MAAAD,KAAK,YAAYD,EAAG,CAAC,IAAK;AAAA,SAGtB;AAOJ,WALAC,KAAK,wBAAwBD,EAAG,CAAC,IAAK,MAGtCC,KAAK,YAAYD,EAAG,CAAC,GACrBG,IAAID,IAAI,GACFE,IAAI,GAAGA,IAAIF,GAAGE;AACnB,QAAAH,KAAK,OACAG,IAAID,MACRF,KAAK,MAENA,KAAKD,EAAGI,CAAC;AAGV,WAAMA,IAAI,GAAGA,IAAID,IAAE,GAAGC;AACrB,QAAAH,KAAK;AAEN,MAAAA,KAAK;AAAA,IACP;AAEC,WAAAA,KAAK,KAGLA,KAAK,qCAGI,IAAIN,EAAKM,GAAG;AAkBrB,aAASI,EAASC,GAAI;AACrB,aAAOT,EAAUG,GAAGM,CAAC;AAAA,IACvB;AAAA,EACA;AAKA,SAAAC,IAAiBR;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/lib/index.js

@@ -1,31 +0,0 @@
-import { __require as o } from "../../../../../@stdlib_utils-define-nonenumerable-read-only-property@0.2.2/node_modules/@stdlib/utils-define-nonenumerable-read-only-property/lib/index.js";
-import { __require as t } from "./main.js";
-import { __require as q } from "./factory.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, i;
-function n() {
-  if (i) return r;
-  i = 1;
-  var a = o(), e = t(), u = q();
-  return a(e, "factory", u), r = e, r;
-}
-export {
-  n as __require
-};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/@stdlib_math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-tools-evalpoly@0.2.2/node_modules/@stdlib/math-base-tools-evalpoly/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 a polynomial using double-precision floating-point arithmetic.\n*\n* @module @stdlib/math-base-tools-evalpoly\n*\n* @example\n* var evalpoly = require( '@stdlib/math-base-tools-evalpoly' );\n*\n* var v = evalpoly( [ 3.0, 2.0, 1.0 ], 10.0 ); // 3*10^0 + 2*10^1 + 1*10^2\n* // returns 123.0\n*\n* @example\n* var evalpoly = require( '@stdlib/math-base-tools-evalpoly' );\n*\n* var polyval = evalpoly.factory( [ 3.0, 2.0, 1.0 ] );\n*\n* var v = polyval( 10.0 ); // => 3*10^0 + 2*10^1 + 1*10^2\n* // returns 123.0\n*\n* v = polyval( 5.0 ); // => 3*5^0 + 2*5^1 + 1*5^2\n* // returns 38.0\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],"names":["setReadOnly","require$$0","main","require$$1","factory","require$$2","lib"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA6CA,MAAIA,IAAcC,EAAA,GACdC,IAAOC,EAAA,GACPC,IAAUC,EAAA;AAKd,SAAAL,EAAaE,GAAM,WAAWE,CAAO,GAKrCE,IAAiBJ;;","x_google_ignoreList":[0]}