@milaboratories/miplots4 1.0.157 → 1.0.158

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

@@ -0,0 +1,191 @@
+import { __require as P } from "../../../../../@stdlib_math-base-special-floor@0.2.3/node_modules/@stdlib/math-base-special-floor/lib/index.js";
+import { __require as R } from "../../../../../@stdlib_math-base-special-ldexp@0.2.3/node_modules/@stdlib/math-base-special-ldexp/lib/index.js";
+import { __require as T } from "../../../../../@stdlib_array-base-zeros@0.2.2/node_modules/@stdlib/array-base-zeros/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 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/k_rem_pio2.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 w, L;
+function g() {
+  if (L) return w;
+  L = 1;
+  var Q = P(), m = R(), p = T(), I = [
+    10680707,
+    7228996,
+    1387004,
+    2578385,
+    16069853,
+    12639074,
+    9804092,
+    4427841,
+    16666979,
+    11263675,
+    12935607,
+    2387514,
+    4345298,
+    14681673,
+    3074569,
+    13734428,
+    16653803,
+    1880361,
+    10960616,
+    8533493,
+    3062596,
+    8710556,
+    7349940,
+    6258241,
+    3772886,
+    3769171,
+    3798172,
+    8675211,
+    12450088,
+    3874808,
+    9961438,
+    366607,
+    15675153,
+    9132554,
+    7151469,
+    3571407,
+    2607881,
+    12013382,
+    4155038,
+    6285869,
+    7677882,
+    13102053,
+    15825725,
+    473591,
+    9065106,
+    15363067,
+    6271263,
+    9264392,
+    5636912,
+    4652155,
+    7056368,
+    13614112,
+    10155062,
+    1944035,
+    9527646,
+    15080200,
+    6658437,
+    6231200,
+    6832269,
+    16767104,
+    5075751,
+    3212806,
+    1398474,
+    7579849,
+    6349435,
+    12618859
+  ], d = [
+    1.570796251296997,
+    // 0x3FF921FB, 0x40000000
+    7549789415861596e-23,
+    // 0x3E74442D, 0x00000000
+    5390302529957765e-30,
+    // 0x3CF84698, 0x80000000
+    3282003415807913e-37,
+    // 0x3B78CC51, 0x60000000
+    1270655753080676e-44,
+    // 0x39F01B83, 0x80000000
+    12293330898111133e-52,
+    // 0x387A2520, 0x40000000
+    27337005381646456e-60,
+    // 0x36E38222, 0x80000000
+    21674168387780482e-67
+    // 0x3569F31D, 0x00000000
+  ], b = 16777216, h = 5960464477539063e-23, _ = p(20), O = p(20), c = p(20), F = p(20);
+  function k(n, C, x, u, i, E, D, v, A) {
+    var s, e, a, l, r, B, t, o, f;
+    for (l = E, f = u[x], o = x, r = 0; o > 0; r++)
+      e = h * f | 0, F[r] = f - b * e | 0, f = u[o - 1] + e, o -= 1;
+    if (f = m(f, i), f -= 8 * Q(f * 0.125), t = f | 0, f -= t, a = 0, i > 0 ? (r = F[x - 1] >> 24 - i, t += r, F[x - 1] -= r << 24 - i, a = F[x - 1] >> 23 - i) : i === 0 ? a = F[x - 1] >> 23 : f >= 0.5 && (a = 2), a > 0) {
+      for (t += 1, s = 0, r = 0; r < x; r++)
+        o = F[r], s === 0 ? o !== 0 && (s = 1, F[r] = 16777216 - o) : F[r] = 16777215 - o;
+      if (i > 0)
+        switch (i) {
+          // eslint-disable-line default-case
+          case 1:
+            F[x - 1] &= 8388607;
+            break;
+          case 2:
+            F[x - 1] &= 4194303;
+            break;
+        }
+      a === 2 && (f = 1 - f, s !== 0 && (f -= m(1, i)));
+    }
+    if (f === 0) {
+      for (o = 0, r = x - 1; r >= E; r--)
+        o |= F[r];
+      if (o === 0) {
+        for (B = 1; F[E - B] === 0; B++)
+          ;
+        for (r = x + 1; r <= x + B; r++) {
+          for (A[v + r] = I[D + r], e = 0, o = 0; o <= v; o++)
+            e += n[o] * A[v + (r - o)];
+          u[r] = e;
+        }
+        return x += B, k(n, C, x, u, i, E, D, v, A);
+      }
+    }
+    if (f === 0)
+      for (x -= 1, i -= 24; F[x] === 0; )
+        x -= 1, i -= 24;
+    else
+      f = m(f, -i), f >= b ? (e = h * f | 0, F[x] = f - b * e | 0, x += 1, i += 24, F[x] = e) : F[x] = f | 0;
+    for (e = m(1, i), r = x; r >= 0; r--)
+      u[r] = e * F[r], e *= h;
+    for (r = x; r >= 0; r--) {
+      for (e = 0, B = 0; B <= l && B <= x - r; B++)
+        e += d[B] * u[r + B];
+      c[x - r] = e;
+    }
+    for (e = 0, r = x; r >= 0; r--)
+      e += c[r];
+    for (a === 0 ? C[0] = e : C[0] = -e, e = c[0] - e, r = 1; r <= x; r++)
+      e += c[r];
+    return a === 0 ? C[1] = e : C[1] = -e, t & 7;
+  }
+  function K(n, C, x, u) {
+    var i, E, D, v, A, s, e, a, l;
+    for (E = 4, v = u - 1, D = (x - 3) / 24 | 0, D < 0 && (D = 0), s = x - 24 * (D + 1), a = D - v, l = v + E, e = 0; e <= l; e++)
+      a < 0 ? _[e] = 0 : _[e] = I[a], a += 1;
+    for (e = 0; e <= E; e++) {
+      for (i = 0, a = 0; a <= v; a++)
+        i += n[a] * _[v + (e - a)];
+      O[e] = i;
+    }
+    return A = E, k(n, C, A, O, s, E, D, v, _);
+  }
+  return w = K, w;
+}
+export {
+  g as __require
+};
+//# sourceMappingURL=kernel_rempio2.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"kernel_rempio2.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-rempio2@0.2.1/node_modules/@stdlib/math-base-special-rempio2/lib/kernel_rempio2.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/k_rem_pio2.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/* eslint-disable array-element-newline */\n\n'use strict';\n\n// MODULES //\n\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar ldexp = require( '@stdlib/math-base-special-ldexp' );\nvar zeros = require( '@stdlib/array-base-zeros' );\n\n\n// VARIABLES //\n\n/*\n* Table of constants for `2/π` (`396` hex digits, `476` decimal).\n*\n* Integer array which contains the (`24*i`)-th to (`24*i+23`)-th bit of `2/π` after binary point. The corresponding floating value is\n*\n* ```tex\n* \\operatorname{ipio2}[i] \\cdot 2^{-24(i+1)}\n* ```\n*\n* This table must have at least `(e0-3)/24 + jk` terms. For quad precision (`e0 <= 16360`, `jk = 6`), this is `686`.\n*/\nvar IPIO2 = [\n\t0xA2F983, 0x6E4E44, 0x1529FC, 0x2757D1, 0xF534DD, 0xC0DB62,\n\t0x95993C, 0x439041, 0xFE5163, 0xABDEBB, 0xC561B7, 0x246E3A,\n\t0x424DD2, 0xE00649, 0x2EEA09, 0xD1921C, 0xFE1DEB, 0x1CB129,\n\t0xA73EE8, 0x8235F5, 0x2EBB44, 0x84E99C, 0x7026B4, 0x5F7E41,\n\t0x3991D6, 0x398353, 0x39F49C, 0x845F8B, 0xBDF928, 0x3B1FF8,\n\t0x97FFDE, 0x05980F, 0xEF2F11, 0x8B5A0A, 0x6D1F6D, 0x367ECF,\n\t0x27CB09, 0xB74F46, 0x3F669E, 0x5FEA2D, 0x7527BA, 0xC7EBE5,\n\t0xF17B3D, 0x0739F7, 0x8A5292, 0xEA6BFB, 0x5FB11F, 0x8D5D08,\n\t0x560330, 0x46FC7B, 0x6BABF0, 0xCFBC20, 0x9AF436, 0x1DA9E3,\n\t0x91615E, 0xE61B08, 0x659985, 0x5F14A0, 0x68408D, 0xFFD880,\n\t0x4D7327, 0x310606, 0x1556CA, 0x73A8C9, 0x60E27B, 0xC08C6B\n];\n\n// Double precision array, obtained by cutting `π/2` into `24` bits chunks...\nvar PIO2 = [\n\t1.57079625129699707031e+00, // 0x3FF921FB, 0x40000000\n\t7.54978941586159635335e-08, // 0x3E74442D, 0x00000000\n\t5.39030252995776476554e-15, // 0x3CF84698, 0x80000000\n\t3.28200341580791294123e-22, // 0x3B78CC51, 0x60000000\n\t1.27065575308067607349e-29, // 0x39F01B83, 0x80000000\n\t1.22933308981111328932e-36, // 0x387A2520, 0x40000000\n\t2.73370053816464559624e-44, // 0x36E38222, 0x80000000\n\t2.16741683877804819444e-51  // 0x3569F31D, 0x00000000\n];\nvar TWO24 = 1.67772160000000000000e+07;  // 0x41700000, 0x00000000\nvar TWON24 = 5.96046447753906250000e-08; // 0x3E700000, 0x00000000\n\n// Arrays for storing temporary values (note that, in C, this is not thread safe):\nvar F = zeros( 20 );\nvar Q = zeros( 20 );\nvar FQ = zeros( 20 );\nvar IQ = zeros( 20 );\n\n\n// FUNCTIONS //\n\n/**\n* Performs the computation for `kernelRempio2()`.\n*\n* @private\n* @param {PositiveNumber} x - input value\n* @param {(Array|TypedArray|Object)} y - output object for storing double precision numbers\n* @param {integer} jz - number of terms of `ipio2[]` used\n* @param {Array<integer>} q - array with integral values, representing the 24-bits chunk of the product of `x` and `2/π`\n* @param {integer} q0 - the corresponding exponent of `q[0]` (the exponent for `q[i]` would be `q0-24*i`)\n* @param {integer} jk - `jk+1` is the initial number of terms of `IPIO2[]` needed in the computation\n* @param {integer} jv - index for pointing to the suitable `ipio2[]` for the computation\n* @param {integer} jx - `nx - 1`\n* @param {Array<number>} f - `IPIO2[]` in floating point\n* @returns {number} last three binary digits of `N`\n*/\nfunction compute( x, y, jz, q, q0, jk, jv, jx, f ) {\n\tvar carry;\n\tvar fw;\n\tvar ih;\n\tvar jp;\n\tvar i;\n\tvar k;\n\tvar n;\n\tvar j;\n\tvar z;\n\n\t// `jp+1` is the number of terms in `PIO2[]` needed:\n\tjp = jk;\n\n\t// Distill `q[]` into `IQ[]` in reverse order...\n\tz = q[ jz ];\n\tj = jz;\n\tfor ( i = 0; j > 0; i++ ) {\n\t\tfw = ( TWON24 * z )|0;\n\t\tIQ[ i ] = ( z - (TWO24*fw) )|0;\n\t\tz = q[ j-1 ] + fw;\n\t\tj -= 1;\n\t}\n\t// Compute `n`...\n\tz = ldexp( z, q0 );\n\tz -= 8.0 * floor( z*0.125 ); // Trim off integer >= 8\n\tn = z|0;\n\tz -= n;\n\tih = 0;\n\tif ( q0 > 0 ) {\n\t\t// Need `IQ[jz-1]` to determine `n`...\n\t\ti = ( IQ[ jz-1 ] >> (24-q0) );\n\t\tn += i;\n\t\tIQ[ jz-1 ] -= ( i << (24-q0) );\n\t\tih = ( IQ[ jz-1 ] >> (23-q0) );\n\t}\n\telse if ( q0 === 0 ) {\n\t\tih = ( IQ[ jz-1 ] >> 23 );\n\t}\n\telse if ( z >= 0.5 ) {\n\t\tih = 2;\n\t}\n\t// Case: q > 0.5\n\tif ( ih > 0 ) {\n\t\tn += 1;\n\t\tcarry = 0;\n\n\t\t// Compute `1-q`:\n\t\tfor ( i = 0; i < jz; i++ ) {\n\t\t\tj = IQ[ i ];\n\t\t\tif ( carry === 0 ) {\n\t\t\t\tif ( j !== 0 ) {\n\t\t\t\t\tcarry = 1;\n\t\t\t\t\tIQ[ i ] = 0x1000000 - j;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tIQ[ i ] = 0xffffff - j;\n\t\t\t}\n\t\t}\n\t\tif ( q0 > 0 ) {\n\t\t\t// Rare case: chance is 1 in 12...\n\t\t\tswitch ( q0 ) { // eslint-disable-line default-case\n\t\t\tcase 1:\n\t\t\t\tIQ[ jz-1 ] &= 0x7fffff;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tIQ[ jz-1 ] &= 0x3fffff;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif ( ih === 2 ) {\n\t\t\tz = 1.0 - z;\n\t\t\tif ( carry !== 0 ) {\n\t\t\t\tz -= ldexp( 1.0, q0 );\n\t\t\t}\n\t\t}\n\t}\n\t// Check if re-computation is needed...\n\tif ( z === 0.0 ) {\n\t\tj = 0;\n\t\tfor ( i = jz-1; i >= jk; i-- ) {\n\t\t\tj |= IQ[ i ];\n\t\t}\n\t\tif ( j === 0 ) {\n\t\t\t// Need re-computation...\n\t\t\tfor ( k = 1; IQ[ jk-k ] === 0; k++ ) {\n\t\t\t\t// `k` is the number of terms needed...\n\t\t\t}\n\t\t\tfor ( i = jz+1; i <= jz+k; i++ ) {\n\t\t\t\t// Add `q[jz+1]` to `q[jz+k]`...\n\t\t\t\tf[ jx+i ] = IPIO2[ jv+i ];\n\t\t\t\tfw = 0.0;\n\t\t\t\tfor ( j = 0; j <= jx; j++ ) {\n\t\t\t\t\tfw += x[ j ] * f[ jx + (i-j) ];\n\t\t\t\t}\n\t\t\t\tq[ i ] = fw;\n\t\t\t}\n\t\t\tjz += k;\n\t\t\treturn compute( x, y, jz, q, q0, jk, jv, jx, f );\n\t\t}\n\t}\n\t// Chop off zero terms...\n\tif ( z === 0.0 ) {\n\t\tjz -= 1;\n\t\tq0 -= 24;\n\t\twhile ( IQ[ jz ] === 0 ) {\n\t\t\tjz -= 1;\n\t\t\tq0 -= 24;\n\t\t}\n\t} else {\n\t\t// Break `z` into 24-bit if necessary...\n\t\tz = ldexp( z, -q0 );\n\t\tif ( z >= TWO24 ) {\n\t\t\tfw = (TWON24*z)|0;\n\t\t\tIQ[ jz ] = ( z - (TWO24*fw) )|0;\n\t\t\tjz += 1;\n\t\t\tq0 += 24;\n\t\t\tIQ[ jz ] = fw;\n\t\t} else {\n\t\t\tIQ[ jz ] = z|0;\n\t\t}\n\t}\n\t// Convert integer \"bit\" chunk to floating-point value...\n\tfw = ldexp( 1.0, q0 );\n\tfor ( i = jz; i >= 0; i-- ) {\n\t\tq[ i ] = fw * IQ[i];\n\t\tfw *= TWON24;\n\t}\n\t// Compute `PIO2[0,...,jp]*q[jz,...,0]`...\n\tfor ( i = jz; i >= 0; i-- ) {\n\t\tfw = 0.0;\n\t\tfor ( k = 0; k <= jp && k <= jz-i; k++ ) {\n\t\t\tfw += PIO2[ k ] * q[ i+k ];\n\t\t}\n\t\tFQ[ jz-i ] = fw;\n\t}\n\t// Compress `FQ[]` into `y[]`...\n\tfw = 0.0;\n\tfor ( i = jz; i >= 0; i-- ) {\n\t\tfw += FQ[ i ];\n\t}\n\tif ( ih === 0 ) {\n\t\ty[ 0 ] = fw;\n\t} else {\n\t\ty[ 0 ] = -fw;\n\t}\n\tfw = FQ[ 0 ] - fw;\n\tfor ( i = 1; i <= jz; i++ ) {\n\t\tfw += FQ[i];\n\t}\n\tif ( ih === 0 ) {\n\t\ty[ 1 ] = fw;\n\t} else {\n\t\ty[ 1 ] = -fw;\n\t}\n\treturn ( n & 7 );\n}\n\n\n// MAIN //\n\n/**\n* Returns the last three binary digits of `N` with `y = x - Nπ/2` so that `|y| < π/2`.\n*\n* ## Method\n*\n* -   The method is to compute the integer (`mod 8`) and fraction parts of `2x/π` without doing the full multiplication. In general, we skip the part of the product that is known to be a huge integer (more accurately, equals `0 mod 8` ). Thus, the number of operations is independent of the exponent of the input.\n*\n* @private\n* @param {PositiveNumber} x - input value\n* @param {(Array|TypedArray|Object)} y - remainder elements\n* @param {PositiveInteger} e0 - the exponent of `x[0]` (must be <= 16360)\n* @param {PositiveInteger} nx - dimension of `x[]`\n* @returns {number} last three binary digits of `N`\n*/\nfunction kernelRempio2( x, y, e0, nx ) {\n\tvar fw;\n\tvar jk;\n\tvar jv;\n\tvar jx;\n\tvar jz;\n\tvar q0;\n\tvar i;\n\tvar j;\n\tvar m;\n\n\t// Initialize `jk` for double-precision floating-point numbers:\n\tjk = 4;\n\n\t// Determine `jx`, `jv`, `q0` (note that `q0 < 3`):\n\tjx = nx - 1;\n\tjv = ( (e0 - 3) / 24 )|0;\n\tif ( jv < 0 ) {\n\t\tjv = 0;\n\t}\n\tq0 = e0 - (24 * (jv + 1));\n\n\t// Set up `F[0]` to `F[jx+jk]` where `F[jx+jk] = IPIO2[jv+jk]`:\n\tj = jv - jx;\n\tm = jx + jk;\n\tfor ( i = 0; i <= m; i++ ) {\n\t\tif ( j < 0 ) {\n\t\t\tF[ i ] = 0.0;\n\t\t} else {\n\t\t\tF[ i ] = IPIO2[ j ];\n\t\t}\n\t\tj += 1;\n\t}\n\t// Compute `Q[0],Q[1],...,Q[jk]`:\n\tfor ( i = 0; i <= jk; i++ ) {\n\t\tfw = 0.0;\n\t\tfor ( j = 0; j <= jx; j++ ) {\n\t\t\tfw += x[ j ] * F[ jx + (i-j) ];\n\t\t}\n\t\tQ[ i ] = fw;\n\t}\n\tjz = jk;\n\treturn compute( x, y, jz, Q, q0, jk, jv, jx, F );\n}\n\n\n// EXPORTS //\n\nmodule.exports = kernelRempio2;\n"],"names":["floor","require$$0","ldexp","require$$1","zeros","require$$2","IPIO2","PIO2","TWO24","TWON24","F","Q","FQ","IQ","compute","x","y","jz","q","q0","jk","jv","jx","f","carry","fw","ih","jp","i","k","n","j","z","kernelRempio2","e0","nx","m","kernel_rempio2"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,MAAIA,IAAQC,EAAA,GACRC,IAAQC,EAAA,GACRC,IAAQC,EAAA,GAgBRC,IAAQ;AAAA,IACX;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAClD;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,IAAU;AAAA,KAI/CC,IAAO;AAAA,IACV;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,KAEGC,IAAQ,UACRC,IAAS,sBAGTC,IAAIN,EAAO,EAAE,GACbO,IAAIP,EAAO,EAAE,GACbQ,IAAKR,EAAO,EAAE,GACdS,IAAKT,EAAO,EAAE;AAoBlB,WAASU,EAASC,GAAGC,GAAGC,GAAIC,GAAGC,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AAClD,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAQJ,SALAL,IAAKP,GAGLY,IAAId,EAAGD,CAAE,GACTc,IAAId,GACEW,IAAI,GAAGG,IAAI,GAAGH;AACnB,MAAAH,IAAOhB,IAASuB,IAAI,GACpBnB,EAAIe,CAAC,IAAOI,IAAKxB,IAAMiB,IAAM,GAC7BO,IAAId,EAAGa,IAAE,CAAC,IAAKN,GACfM,KAAK;AAsBN,QAnBAC,IAAI9B,EAAO8B,GAAGb,CAAE,GAChBa,KAAK,IAAMhC,EAAOgC,IAAE,KAAK,GACzBF,IAAIE,IAAE,GACNA,KAAKF,GACLJ,IAAK,GACAP,IAAK,KAETS,IAAMf,EAAII,IAAG,CAAC,KAAO,KAAGE,GACxBW,KAAKF,GACLf,EAAII,IAAG,CAAC,KAAQW,KAAM,KAAGT,GACzBO,IAAOb,EAAII,IAAG,CAAC,KAAO,KAAGE,KAEhBA,MAAO,IAChBO,IAAOb,EAAII,IAAG,CAAC,KAAM,KAEZe,KAAK,QACdN,IAAK,IAGDA,IAAK,GAAI;AAKb,WAJAI,KAAK,GACLN,IAAQ,GAGFI,IAAI,GAAGA,IAAIX,GAAIW;AACpB,QAAAG,IAAIlB,EAAIe,CAAC,GACJJ,MAAU,IACTO,MAAM,MACVP,IAAQ,GACRX,EAAIe,KAAM,WAAYG,KAGvBlB,EAAIe,KAAM,WAAWG;AAGvB,UAAKZ,IAAK;AAET,gBAASA,GAAE;AAAA;AAAA,UACX,KAAK;AACJ,YAAAN,EAAII,IAAG,CAAC,KAAM;AACd;AAAA,UACD,KAAK;AACJ,YAAAJ,EAAII,IAAG,CAAC,KAAM;AACd;AAAA,QACJ;AAEE,MAAKS,MAAO,MACXM,IAAI,IAAMA,GACLR,MAAU,MACdQ,KAAK9B,EAAO,GAAKiB,CAAE;AAAA,IAGvB;AAEC,QAAKa,MAAM,GAAM;AAEhB,WADAD,IAAI,GACEH,IAAIX,IAAG,GAAGW,KAAKR,GAAIQ;AACxB,QAAAG,KAAKlB,EAAIe,CAAC;AAEX,UAAKG,MAAM,GAAI;AAEd,aAAMF,IAAI,GAAGhB,EAAIO,IAAGS,OAAQ,GAAGA;AAAM;AAGrC,aAAMD,IAAIX,IAAG,GAAGW,KAAKX,IAAGY,GAAGD,KAAM;AAIhC,eAFAL,EAAGD,IAAGM,CAAC,IAAKtB,EAAOe,IAAGO,CAAC,GACvBH,IAAK,GACCM,IAAI,GAAGA,KAAKT,GAAIS;AACrB,YAAAN,KAAMV,EAAGgB,CAAC,IAAKR,EAAGD,KAAMM,IAAEG,EAAE;AAE7B,UAAAb,EAAGU,CAAC,IAAKH;AAAA,QACb;AACG,eAAAR,KAAMY,GACCf,EAASC,GAAGC,GAAGC,GAAIC,GAAGC,GAAIC,GAAIC,GAAIC,GAAIC,CAAC;AAAA,MACjD;AAAA,IACA;AAEC,QAAKS,MAAM;AAGV,WAFAf,KAAM,GACNE,KAAM,IACEN,EAAII,CAAE,MAAO;AACpB,QAAAA,KAAM,GACNE,KAAM;AAAA;AAIP,MAAAa,IAAI9B,EAAO8B,GAAG,CAACb,CAAE,GACZa,KAAKxB,KACTiB,IAAMhB,IAAOuB,IAAG,GAChBnB,EAAII,CAAE,IAAOe,IAAKxB,IAAMiB,IAAM,GAC9BR,KAAM,GACNE,KAAM,IACNN,EAAII,CAAE,IAAKQ,KAEXZ,EAAII,KAAOe,IAAE;AAKf,SADAP,IAAKvB,EAAO,GAAKiB,CAAE,GACbS,IAAIX,GAAIW,KAAK,GAAGA;AACrB,MAAAV,EAAGU,CAAC,IAAKH,IAAKZ,EAAGe,CAAC,GAClBH,KAAMhB;AAGP,SAAMmB,IAAIX,GAAIW,KAAK,GAAGA,KAAM;AAE3B,WADAH,IAAK,GACCI,IAAI,GAAGA,KAAKF,KAAME,KAAKZ,IAAGW,GAAGC;AAClC,QAAAJ,KAAMlB,EAAMsB,CAAC,IAAKX,EAAGU,IAAEC,CAAC;AAEzB,MAAAjB,EAAIK,IAAGW,CAAC,IAAKH;AAAA,IACf;AAGC,SADAA,IAAK,GACCG,IAAIX,GAAIW,KAAK,GAAGA;AACrB,MAAAH,KAAMb,EAAIgB,CAAC;AAQZ,SANKF,MAAO,IACXV,EAAG,CAAC,IAAKS,IAETT,EAAG,CAAC,IAAK,CAACS,GAEXA,IAAKb,EAAI,CAAC,IAAKa,GACTG,IAAI,GAAGA,KAAKX,GAAIW;AACrB,MAAAH,KAAMb,EAAGgB,CAAC;AAEX,WAAKF,MAAO,IACXV,EAAG,CAAC,IAAKS,IAETT,EAAG,CAAC,IAAK,CAACS,GAEFK,IAAI;AAAA,EACd;AAmBA,WAASG,EAAelB,GAAGC,GAAGkB,GAAIC,GAAK;AACtC,QAAIV,GACAL,GACAC,GACAC,GACAL,GACAE,GACAS,GACAG,GACAK;AAgBJ,SAbAhB,IAAK,GAGLE,IAAKa,IAAK,GACVd,KAAQa,IAAK,KAAK,KAAK,GAClBb,IAAK,MACTA,IAAK,IAENF,IAAKe,IAAM,MAAMb,IAAK,IAGtBU,IAAIV,IAAKC,GACTc,IAAId,IAAKF,GACHQ,IAAI,GAAGA,KAAKQ,GAAGR;AACpB,MAAKG,IAAI,IACRrB,EAAGkB,CAAC,IAAK,IAETlB,EAAGkB,CAAC,IAAKtB,EAAOyB,CAAC,GAElBA,KAAK;AAGN,SAAMH,IAAI,GAAGA,KAAKR,GAAIQ,KAAM;AAE3B,WADAH,IAAK,GACCM,IAAI,GAAGA,KAAKT,GAAIS;AACrB,QAAAN,KAAMV,EAAGgB,CAAC,IAAKrB,EAAGY,KAAMM,IAAEG,EAAE;AAE7B,MAAApB,EAAGiB,CAAC,IAAKH;AAAA,IACX;AACC,WAAAR,IAAKG,GACEN,EAASC,GAAGC,GAAGC,GAAIN,GAAGQ,GAAIC,GAAIC,GAAIC,GAAIZ,CAAC;AAAA,EAC/C;AAKA,SAAA2B,IAAiBJ;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,70 @@
+import { __require as w } 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 C } 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 U } from "../../../../../@stdlib_constants-float64-high-word-significand-mask@0.2.2/node_modules/@stdlib/constants-float64-high-word-significand-mask/lib/index.js";
+import { __require as V } 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 X } from "../../../../../@stdlib_number-float64-base-get-low-word@0.2.2/node_modules/@stdlib/number-float64-base-get-low-word/lib/index.js";
+import { __require as z } from "../../../../../@stdlib_number-float64-base-from-words@0.2.2/node_modules/@stdlib/number-float64-base-from-words/lib/index.js";
+import { __require as B } from "./kernel_rempio2.js";
+import { __require as Y } from "./rempio2_medium.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/e_rem_pio2.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.
+*
+* Optimized by Bruce D. Evans.
+* ```
+*/
+var R, P;
+function er() {
+  if (P) return R;
+  P = 1;
+  var W = w(), N = C(), T = U(), b = V(), s = X(), D = z(), G = B(), t = Y(), d = 0, M = 16777216, a = 1.5707963267341256, u = 6077100506506192e-26, I = 2 * u, n = 3 * u, m = 4 * u, L = 598523, S = 1072243195, c = 1073928572, A = 1074752122, K = 1074977148, $ = 1075183036, h = 1075388923, l = 1075594811, F = 1094263291, v = [0, 0, 0], f = [0, 0];
+  function g(i, r) {
+    var p, H, E, _, O, o, q, e;
+    if (E = b(i), _ = E & W | 0, _ <= S)
+      return r[0] = i, r[1] = 0, 0;
+    if (_ <= A)
+      return (_ & T) === L ? t(i, _, r) : _ <= c ? i > 0 ? (e = i - a, r[0] = e - u, r[1] = e - r[0] - u, 1) : (e = i + a, r[0] = e + u, r[1] = e - r[0] + u, -1) : i > 0 ? (e = i - 2 * a, r[0] = e - I, r[1] = e - r[0] - I, 2) : (e = i + 2 * a, r[0] = e + I, r[1] = e - r[0] + I, -2);
+    if (_ <= l)
+      return _ <= $ ? _ === K ? t(i, _, r) : i > 0 ? (e = i - 3 * a, r[0] = e - n, r[1] = e - r[0] - n, 3) : (e = i + 3 * a, r[0] = e + n, r[1] = e - r[0] + n, -3) : _ === h ? t(i, _, r) : i > 0 ? (e = i - 4 * a, r[0] = e - m, r[1] = e - r[0] - m, 4) : (e = i + 4 * a, r[0] = e + m, r[1] = e - r[0] + m, -4);
+    if (_ < F)
+      return t(i, _, r);
+    if (_ >= N)
+      return r[0] = NaN, r[1] = NaN, 0;
+    for (p = s(i), H = (_ >> 20) - 1046, e = D(_ - (H << 20 | 0), p), o = 0; o < 2; o++)
+      v[o] = e | 0, e = (e - v[o]) * M;
+    for (v[2] = e, O = 3; v[O - 1] === d; )
+      O -= 1;
+    return q = G(v, f, H, O, 1), i < 0 ? (r[0] = -f[0], r[1] = -f[1], -q) : (r[0] = f[0], r[1] = f[1], q);
+  }
+  return R = g, R;
+}
+export {
+  er as __require
+};
+//# sourceMappingURL=main.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-rempio2@0.2.1/node_modules/@stdlib/math-base-special-rempio2/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/e_rem_pio2.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* Optimized by Bruce D. Evans.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ABS_MASK = require( '@stdlib/constants-float64-high-word-abs-mask' );\nvar EXPONENT_MASK = require( '@stdlib/constants-float64-high-word-exponent-mask' );\nvar SIGNIFICAND_MASK = require( '@stdlib/constants-float64-high-word-significand-mask' );\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\nvar getLowWord = require( '@stdlib/number-float64-base-get-low-word' );\nvar fromWords = require( '@stdlib/number-float64-base-from-words' );\nvar rempio2Kernel = require( './kernel_rempio2.js' );\nvar rempio2Medium = require( './rempio2_medium.js' );\n\n\n// VARIABLES //\n\nvar ZERO = 0.00000000000000000000e+00;    // 0x00000000, 0x00000000\nvar TWO24 = 1.67772160000000000000e+07;   // 0x41700000, 0x00000000\n\n// 33 bits of π/2:\nvar PIO2_1 = 1.57079632673412561417e+00;  // 0x3FF921FB, 0x54400000\n\n// PIO2_1T = π/2 - PIO2_1:\nvar PIO2_1T = 6.07710050650619224932e-11; // 0x3DD0B461, 0x1A626331\nvar TWO_PIO2_1T = 2.0 * PIO2_1T;\nvar THREE_PIO2_1T = 3.0 * PIO2_1T;\nvar FOUR_PIO2_1T = 4.0 * PIO2_1T;\n\n// High word significand for π and π/2: 0x921fb = 598523 => 00000000000010010010000111111011\nvar PI_HIGH_WORD_SIGNIFICAND = 0x921fb|0; // asm type annotation\n\n// High word for π/4: 0x3fe921fb = 1072243195 => 00111111111010010010000111111011\nvar PIO4_HIGH_WORD = 0x3fe921fb|0; // asm type annotation\n\n// High word for 3π/4: 0x4002d97c = 1073928572 => 01000000000000101101100101111100\nvar THREE_PIO4_HIGH_WORD = 0x4002d97c|0; // asm type annotation\n\n// High word for 5π/4: 0x400f6a7a = 1074752122 => 01000000000011110110101001111010\nvar FIVE_PIO4_HIGH_WORD = 0x400f6a7a|0; // asm type annotation\n\n// High word for 6π/4: 0x4012d97c = 1074977148 => 01000000000100101101100101111100\nvar THREE_PIO2_HIGH_WORD = 0x4012d97c|0; // asm type annotation\n\n// High word for 7π/4: 0x4015fdbc = 1075183036 => 01000000000101011111110110111100\nvar SEVEN_PIO4_HIGH_WORD = 0x4015fdbc|0; // asm type annotation\n\n// High word for 8π/4: 0x401921fb = 1075388923 => 01000000000110010010000111111011\nvar TWO_PI_HIGH_WORD = 0x401921fb|0; // asm type annotation\n\n// High word for 9π/4: 0x401c463b = 1075594811 => 01000000000111000100011000111011\nvar NINE_PIO4_HIGH_WORD = 0x401c463b|0; // asm type annotation\n\n// 2^20*π/2 = 1647099.3291652855 => 0100000100111001001000011111101101010100010001000010110100011000 => high word => 0x413921fb = 1094263291 => 01000001001110010010000111111011\nvar MEDIUM = 0x413921fb|0; // asm type annotation\n\n// Arrays for storing temporary values:\nvar TX = [ 0.0, 0.0, 0.0 ];\nvar TY = [ 0.0, 0.0 ];\n\n\n// MAIN //\n\n/**\n* Computes `x - nπ/2 = r`.\n*\n* ## Notes\n*\n* -   Returns `n` and stores the remainder `r` as two numbers `y[0]` and `y[1]`, such that `y[0]+y[1] = r`.\n*\n* @param {number} x - input value\n* @param {(Array|TypedArray|Object)} y - remainder elements\n* @returns {integer} factor of `π/2`\n*\n* @example\n* var y = [ 0.0, 0.0 ];\n* var n = rempio2( 128.0, y );\n* // returns 81\n*\n* var y1 = y[ 0 ];\n* // returns ~0.765\n*\n* var y2 = y[ 1 ];\n* // returns ~3.618e-17\n*\n* @example\n* var y = [ 0.0, 0.0 ];\n* var n = rempio2( NaN, y );\n* // returns 0\n*\n* var y1 = y[ 0 ];\n* // returns NaN\n*\n* var y2 = y[ 1 ];\n* // returns NaN\n*/\nfunction rempio2( x, y ) {\n\tvar low;\n\tvar e0;\n\tvar hx;\n\tvar ix;\n\tvar nx;\n\tvar i;\n\tvar n;\n\tvar z;\n\n\thx = getHighWord( x );\n\tix = (hx & ABS_MASK)|0; // asm type annotation\n\n\t// Case: |x| ~<= π/4 (no need for reduction)\n\tif ( ix <= PIO4_HIGH_WORD ) {\n\t\ty[ 0 ] = x;\n\t\ty[ 1 ] = 0.0;\n\t\treturn 0;\n\t}\n\t// Case: |x| ~<= 5π/4\n\tif ( ix <= FIVE_PIO4_HIGH_WORD ) {\n\t\t// Case: |x| ~= π/2 or π\n\t\tif ( (ix & SIGNIFICAND_MASK) === PI_HIGH_WORD_SIGNIFICAND ) {\n\t\t\t// Cancellation => use medium case\n\t\t\treturn rempio2Medium( x, ix, y );\n\t\t}\n\t\t// Case: |x| ~<= 3π/4\n\t\tif ( ix <= THREE_PIO4_HIGH_WORD ) {\n\t\t\tif ( x > 0.0 ) {\n\t\t\t\tz = x - PIO2_1;\n\t\t\t\ty[ 0 ] = z - PIO2_1T;\n\t\t\t\ty[ 1 ] = (z - y[0]) - PIO2_1T;\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tz = x + PIO2_1;\n\t\t\ty[ 0 ] = z + PIO2_1T;\n\t\t\ty[ 1 ] = (z - y[0]) + PIO2_1T;\n\t\t\treturn -1;\n\t\t}\n\t\tif ( x > 0.0 ) {\n\t\t\tz = x - ( 2.0*PIO2_1 );\n\t\t\ty[ 0 ] = z - TWO_PIO2_1T;\n\t\t\ty[ 1 ] = (z - y[0]) - TWO_PIO2_1T;\n\t\t\treturn 2;\n\t\t}\n\t\tz = x + ( 2.0*PIO2_1 );\n\t\ty[ 0 ] = z + TWO_PIO2_1T;\n\t\ty[ 1 ] = (z - y[0]) + TWO_PIO2_1T;\n\t\treturn -2;\n\t}\n\t// Case: |x| ~<= 9π/4\n\tif ( ix <= NINE_PIO4_HIGH_WORD ) {\n\t\t// Case: |x| ~<= 7π/4\n\t\tif ( ix <= SEVEN_PIO4_HIGH_WORD ) {\n\t\t\t// Case: |x| ~= 3π/2\n\t\t\tif ( ix === THREE_PIO2_HIGH_WORD ) {\n\t\t\t\treturn rempio2Medium( x, ix, y );\n\t\t\t}\n\t\t\tif ( x > 0.0 ) {\n\t\t\t\tz = x - ( 3.0*PIO2_1 );\n\t\t\t\ty[ 0 ] = z - THREE_PIO2_1T;\n\t\t\t\ty[ 1 ] = (z - y[0]) - THREE_PIO2_1T;\n\t\t\t\treturn 3;\n\t\t\t}\n\t\t\tz = x + ( 3.0*PIO2_1 );\n\t\t\ty[ 0 ] = z + THREE_PIO2_1T;\n\t\t\ty[ 1 ] = (z - y[0]) + THREE_PIO2_1T;\n\t\t\treturn -3;\n\t\t}\n\t\t// Case: |x| ~= 4π/2\n\t\tif ( ix === TWO_PI_HIGH_WORD ) {\n\t\t\treturn rempio2Medium( x, ix, y );\n\t\t}\n\t\tif ( x > 0.0 ) {\n\t\t\tz = x - ( 4.0*PIO2_1 );\n\t\t\ty[ 0 ] = z - FOUR_PIO2_1T;\n\t\t\ty[ 1 ] = (z - y[0]) - FOUR_PIO2_1T;\n\t\t\treturn 4;\n\t\t}\n\t\tz = x + ( 4.0*PIO2_1 );\n\t\ty[ 0 ] = z + FOUR_PIO2_1T;\n\t\ty[ 1 ] = (z - y[0]) + FOUR_PIO2_1T;\n\t\treturn -4;\n\t}\n\t// Case: |x| ~< 2^20*π/2 (medium size)\n\tif ( ix < MEDIUM ) {\n\t\treturn rempio2Medium( x, ix, y );\n\t}\n\t// Case: x is NaN or infinity\n\tif ( ix >= EXPONENT_MASK ) {\n\t\ty[ 0 ] = NaN;\n\t\ty[ 1 ] = NaN;\n\t\treturn 0.0;\n\t}\n\t// Set z = scalbn(|x|, ilogb(x)-23)...\n\tlow = getLowWord( x );\n\te0 = (ix >> 20) - 1046; // `e0 = ilogb(z) - 23` => unbiased exponent minus 23\n\tz = fromWords( ix - ((e0 << 20)|0), low );\n\tfor ( i = 0; i < 2; i++ ) {\n\t\tTX[ i ] = z|0;\n\t\tz = (z - TX[i]) * TWO24;\n\t}\n\tTX[ 2 ] = z;\n\tnx = 3;\n\twhile ( TX[ nx-1 ] === ZERO ) {\n\t\t// Skip zero term...\n\t\tnx -= 1;\n\t}\n\tn = rempio2Kernel( TX, TY, e0, nx, 1 );\n\tif ( x < 0.0 ) {\n\t\ty[ 0 ] = -TY[ 0 ];\n\t\ty[ 1 ] = -TY[ 1 ];\n\t\treturn -n;\n\t}\n\ty[ 0 ] = TY[ 0 ];\n\ty[ 1 ] = TY[ 1 ];\n\treturn n;\n}\n\n\n// EXPORTS //\n\nmodule.exports = rempio2;\n"],"names":["ABS_MASK","require$$0","EXPONENT_MASK","require$$1","SIGNIFICAND_MASK","require$$2","getHighWord","require$$3","getLowWord","require$$4","fromWords","require$$5","rempio2Kernel","require$$6","rempio2Medium","require$$7","ZERO","TWO24","PIO2_1","PIO2_1T","TWO_PIO2_1T","THREE_PIO2_1T","FOUR_PIO2_1T","PI_HIGH_WORD_SIGNIFICAND","PIO4_HIGH_WORD","THREE_PIO4_HIGH_WORD","FIVE_PIO4_HIGH_WORD","THREE_PIO2_HIGH_WORD","SEVEN_PIO4_HIGH_WORD","TWO_PI_HIGH_WORD","NINE_PIO4_HIGH_WORD","MEDIUM","TX","TY","rempio2","x","y","low","e0","hx","ix","nx","i","n","z","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsCA,MAAIA,IAAWC,EAAA,GACXC,IAAgBC,EAAA,GAChBC,IAAmBC,EAAA,GACnBC,IAAcC,EAAA,GACdC,IAAaC,EAAA,GACbC,IAAYC,EAAA,GACZC,IAAgBC,EAAA,GAChBC,IAAgBC,EAAA,GAKhBC,IAAO,GACPC,IAAQ,UAGRC,IAAS,oBAGTC,IAAU,sBACVC,IAAc,IAAMD,GACpBE,IAAgB,IAAMF,GACtBG,IAAe,IAAMH,GAGrBI,IAA2B,QAG3BC,IAAiB,YAGjBC,IAAuB,YAGvBC,IAAsB,YAGtBC,IAAuB,YAGvBC,IAAuB,YAGvBC,IAAmB,YAGnBC,IAAsB,YAGtBC,IAAS,YAGTC,IAAK,CAAE,GAAK,GAAK,CAAG,GACpBC,IAAK,CAAE,GAAK,CAAG;AAsCnB,WAASC,EAASC,GAAGC,GAAI;AACxB,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAMJ,QAJAL,IAAKjC,EAAa6B,CAAC,GACnBK,IAAMD,IAAKvC,IAAU,GAGhBwC,KAAMhB;AACV,aAAAY,EAAG,CAAC,IAAKD,GACTC,EAAG,CAAC,IAAK,GACF;AAGR,QAAKI,KAAMd;AAEV,cAAMc,IAAKpC,OAAsBmB,IAEzBT,EAAeqB,GAAGK,GAAIJ,CAAC,IAG1BI,KAAMf,IACLU,IAAI,KACRS,IAAIT,IAAIjB,GACRkB,EAAG,KAAMQ,IAAIzB,GACbiB,EAAG,CAAC,IAAMQ,IAAIR,EAAE,CAAC,IAAKjB,GACf,MAERyB,IAAIT,IAAIjB,GACRkB,EAAG,KAAMQ,IAAIzB,GACbiB,EAAG,CAAC,IAAMQ,IAAIR,EAAE,CAAC,IAAKjB,GACf,MAEHgB,IAAI,KACRS,IAAIT,IAAM,IAAIjB,GACdkB,EAAG,KAAMQ,IAAIxB,GACbgB,EAAG,CAAC,IAAMQ,IAAIR,EAAE,CAAC,IAAKhB,GACf,MAERwB,IAAIT,IAAM,IAAIjB,GACdkB,EAAG,KAAMQ,IAAIxB,GACbgB,EAAG,CAAC,IAAMQ,IAAIR,EAAE,CAAC,IAAKhB,GACf;AAGR,QAAKoB,KAAMV;AAEV,aAAKU,KAAMZ,IAELY,MAAOb,IACJb,EAAeqB,GAAGK,GAAIJ,CAAC,IAE1BD,IAAI,KACRS,IAAIT,IAAM,IAAIjB,GACdkB,EAAG,KAAMQ,IAAIvB,GACbe,EAAG,CAAC,IAAMQ,IAAIR,EAAE,CAAC,IAAKf,GACf,MAERuB,IAAIT,IAAM,IAAIjB,GACdkB,EAAG,KAAMQ,IAAIvB,GACbe,EAAG,CAAC,IAAMQ,IAAIR,EAAE,CAAC,IAAKf,GACf,MAGHmB,MAAOX,IACJf,EAAeqB,GAAGK,GAAIJ,CAAC,IAE1BD,IAAI,KACRS,IAAIT,IAAM,IAAIjB,GACdkB,EAAG,KAAMQ,IAAItB,GACbc,EAAG,CAAC,IAAMQ,IAAIR,EAAE,CAAC,IAAKd,GACf,MAERsB,IAAIT,IAAM,IAAIjB,GACdkB,EAAG,KAAMQ,IAAItB,GACbc,EAAG,CAAC,IAAMQ,IAAIR,EAAE,CAAC,IAAKd,GACf;AAGR,QAAKkB,IAAKT;AACT,aAAOjB,EAAeqB,GAAGK,GAAIJ,CAAC;AAG/B,QAAKI,KAAMtC;AACV,aAAAkC,EAAG,CAAC,IAAK,KACTA,EAAG,CAAC,IAAK,KACF;AAMR,SAHAC,IAAM7B,EAAY2B,CAAC,GACnBG,KAAME,KAAM,MAAM,MAClBI,IAAIlC,EAAW8B,KAAOF,KAAM,KAAI,IAAID,CAAG,GACjCK,IAAI,GAAGA,IAAI,GAAGA;AACnB,MAAAV,EAAIU,KAAME,IAAE,GACZA,KAAKA,IAAIZ,EAAGU,CAAC,KAAKzB;AAInB,SAFAe,EAAI,CAAC,IAAKY,GACVH,IAAK,GACGT,EAAIS,IAAG,CAAC,MAAOzB;AAEtB,MAAAyB,KAAM;AAGP,WADAE,IAAI/B,EAAeoB,GAAIC,GAAIK,GAAIG,GAAI,CAAC,GAC/BN,IAAI,KACRC,EAAG,CAAC,IAAK,CAACH,EAAI,CAAC,GACfG,EAAG,CAAC,IAAK,CAACH,EAAI,CAAC,GACR,CAACU,MAETP,EAAG,CAAC,IAAKH,EAAI,CAAC,GACdG,EAAG,CAAC,IAAKH,EAAI,CAAC,GACPU;AAAA,EACR;AAKA,SAAAE,IAAiBX;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,48 @@
+import { __require as R } from "../../../../../@stdlib_math-base-special-round@0.2.1/node_modules/@stdlib/math-base-special-round/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";
+/**
+* @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/k_rem_pio2.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 o, I;
+function L() {
+  if (I) return o;
+  I = 1;
+  var O = R(), t = b(), P = 0.6366197723675814, d = 1.5707963267341256, p = 6077100506506192e-26, q = 6077100506303966e-26, h = 20222662487959506e-37, s = 20222662487111665e-37, T = 84784276603689e-45, f = 2047;
+  function g(n, N, a) {
+    var u, i, v, e, r, _, m;
+    return i = O(n * P), e = n - i * d, r = i * p, m = N >> 20 | 0, a[0] = e - r, u = t(a[0]), _ = m - (u >> 20 & f), _ > 16 && (v = e, r = i * q, e = v - r, r = i * h - (v - e - r), a[0] = e - r, u = t(a[0]), _ = m - (u >> 20 & f), _ > 49 && (v = e, r = i * s, e = v - r, r = i * T - (v - e - r), a[0] = e - r)), a[1] = e - a[0] - r, i;
+  }
+  return o = g, o;
+}
+export {
+  L as __require
+};
+//# sourceMappingURL=rempio2_medium.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rempio2_medium.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-rempio2@0.2.1/node_modules/@stdlib/math-base-special-rempio2/lib/rempio2_medium.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/k_rem_pio2.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 round = require( '@stdlib/math-base-special-round' );\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\n\n\n// VARIABLES //\n\n// 53 bits of 2/π:\nvar INVPIO2 = 6.36619772367581382433e-01; // 0x3FE45F30, 0x6DC9C883\n\n// First 33 bits of π/2:\nvar PIO2_1 = 1.57079632673412561417e+00;  // 0x3FF921FB, 0x54400000\n\n// PIO2_1T = π/2 - PIO2_1:\nvar PIO2_1T = 6.07710050650619224932e-11; // 0x3DD0B461, 0x1A626331\n\n// Another 33 bits of π/2:\nvar PIO2_2 = 6.07710050630396597660e-11;  // 0x3DD0B461, 0x1A600000\n\n// PIO2_2T = π/2 - ( PIO2_1 + PIO2_2 ):\nvar PIO2_2T = 2.02226624879595063154e-21; // 0x3BA3198A, 0x2E037073\n\n// Another 33 bits of π/2:\nvar PIO2_3 = 2.02226624871116645580e-21;  // 0x3BA3198A, 0x2E000000\n\n// PIO2_3T = π/2 - ( PIO2_1 + PIO2_2 + PIO2_3 ):\nvar PIO2_3T = 8.47842766036889956997e-32; // 0x397B839A, 0x252049C1\n\n// Exponent mask (2047 => 0x7ff):\nvar EXPONENT_MASK = 0x7ff|0; // asm type annotation\n\n\n// MAIN //\n\n/**\n* Computes `x - nπ/2 = r` for medium-sized inputs.\n*\n* @private\n* @param {number} x - input value\n* @param {uint32} ix - high word of `x`\n* @param {(Array|TypedArray|Object)} y - remainder elements\n* @returns {integer} factor of `π/2`\n*/\nfunction rempio2Medium( x, ix, y ) {\n\tvar high;\n\tvar n;\n\tvar t;\n\tvar r;\n\tvar w;\n\tvar i;\n\tvar j;\n\n\tn = round( x * INVPIO2 );\n\tr = x - ( n * PIO2_1 );\n\tw = n * PIO2_1T;\n\n\t// First rounding (good to 85 bits)...\n\tj = (ix >> 20)|0; // asm type annotation\n\ty[ 0 ] = r - w;\n\thigh = getHighWord( y[0] );\n\ti = j - ( (high >> 20) & EXPONENT_MASK );\n\n\t// Check if a second iteration is needed (good to 118 bits)...\n\tif ( i > 16 ) {\n\t\tt = r;\n\t\tw = n * PIO2_2;\n\t\tr = t - w;\n\t\tw = (n * PIO2_2T) - ((t-r) - w);\n\t\ty[ 0 ] = r - w;\n\t\thigh = getHighWord( y[0] );\n\t\ti = j - ( (high >> 20) & EXPONENT_MASK );\n\n\t\t// Check if a third iteration is needed (151 bits accumulated)...\n\t\tif ( i > 49 ) {\n\t\t\tt = r;\n\t\t\tw = n * PIO2_3;\n\t\t\tr = t - w;\n\t\t\tw = (n * PIO2_3T) - ((t-r) - w);\n\t\t\ty[ 0 ] = r - w;\n\t\t}\n\t}\n\ty[ 1 ] = (r - y[0]) - w;\n\treturn n;\n}\n\n\n// EXPORTS //\n\nmodule.exports = rempio2Medium;\n"],"names":["round","require$$0","getHighWord","require$$1","INVPIO2","PIO2_1","PIO2_1T","PIO2_2","PIO2_2T","PIO2_3","PIO2_3T","EXPONENT_MASK","rempio2Medium","x","ix","y","high","n","t","r","w","i","j","rempio2_medium"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,MAAIA,IAAQC,EAAA,GACRC,IAAcC,EAAA,GAMdC,IAAU,oBAGVC,IAAS,oBAGTC,IAAU,sBAGVC,IAAS,sBAGTC,IAAU,uBAGVC,IAAS,uBAGTC,IAAU,oBAGVC,IAAgB;AAcpB,WAASC,EAAeC,GAAGC,GAAIC,GAAI;AAClC,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,WAAAL,IAAIjB,EAAOa,IAAIT,CAAO,GACtBe,IAAIN,IAAMI,IAAIZ,GACde,IAAIH,IAAIX,GAGRgB,IAAKR,KAAM,KAAI,GACfC,EAAG,KAAMI,IAAIC,GACbJ,IAAOd,EAAaa,EAAE,CAAC,CAAC,GACxBM,IAAIC,KAAON,KAAQ,KAAML,IAGpBU,IAAI,OACRH,IAAIC,GACJC,IAAIH,IAAIV,GACRY,IAAID,IAAIE,GACRA,IAAKH,IAAIT,KAAaU,IAAEC,IAAKC,IAC7BL,EAAG,KAAMI,IAAIC,GACbJ,IAAOd,EAAaa,EAAE,CAAC,CAAC,GACxBM,IAAIC,KAAON,KAAQ,KAAML,IAGpBU,IAAI,OACRH,IAAIC,GACJC,IAAIH,IAAIR,GACRU,IAAID,IAAIE,GACRA,IAAKH,IAAIP,KAAaQ,IAAEC,IAAKC,IAC7BL,EAAG,KAAMI,IAAIC,KAGfL,EAAG,CAAC,IAAMI,IAAIJ,EAAE,CAAC,IAAKK,GACfH;AAAA,EACR;AAKA,SAAAM,IAAiBX;;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-round@0.2.1/node_modules/@stdlib/math-base-special-round/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// TODO: implementation\n\n/**\n* Round a numeric value to the nearest integer.\n*\n* @module @stdlib/math-base-special-round\n*\n* @example\n* var round = require( '@stdlib/math-base-special-round' );\n*\n* var v = round( -4.2 );\n* // returns -4.0\n*\n* v = round( -4.5 );\n* // returns -4.0\n*\n* v = round( -4.6 );\n* // returns -5.0\n*\n* v = round( 9.99999 );\n* // returns 10.0\n*\n* v = round( 9.5 );\n* // returns 10.0\n*\n* v = round( 9.2 );\n* // returns 9.0\n*\n* v = round( 0.0 );\n* // returns 0.0\n*\n* v = round( -0.0 );\n* // returns -0.0\n*\n* v = round( Infinity );\n* // returns Infinity\n*\n* v = round( -Infinity );\n* // returns -Infinity\n*\n* v = round( 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":";;;;;;;;;;;;;;;;;;;;;;AAkEA,MAAIA,IAAOC,EAAA;AAKX,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,28 @@
+/**
+* @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 n() {
+  if (a) return r;
+  a = 1;
+  var e = Math.round;
+  return r = e, r;
+}
+export {
+  n as __require
+};
+//# sourceMappingURL=main.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-round@0.2.1/node_modules/@stdlib/math-base-special-round/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// TODO: implementation\n\n/**\n* Rounds a numeric value to the nearest integer.\n*\n* @param {number} x - input value\n* @returns {number} function value\n*\n* @example\n* var v = round( -4.2 );\n* // returns -4.0\n*\n* @example\n* var v = round( -4.5 );\n* // returns -4.0\n*\n* @example\n* var v = round( -4.6 );\n* // returns -5.0\n*\n* @example\n* var v = round( 9.99999 );\n* // returns 10.0\n*\n* @example\n* var v = round( 9.5 );\n* // returns 10.0\n*\n* @example\n* var v = round( 9.2 );\n* // returns 9.0\n*\n* @example\n* var v = round( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = round( -0.0 );\n* // returns -0.0\n*\n* @example\n* var v = round( Infinity );\n* // returns Infinity\n*\n* @example\n* var v = round( -Infinity );\n* // returns -Infinity\n*\n* @example\n* var v = round( NaN );\n* // returns NaN\n*/\nvar round = Math.round; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nmodule.exports = round;\n"],"names":["round","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAwEA,MAAIA,IAAQ,KAAK;AAKjB,SAAAC,IAAiBD;;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-round@0.3.0/node_modules/@stdlib/math-base-special-round/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// TODO: implementation\n\n/**\n* Round a numeric value to the nearest integer.\n*\n* @module @stdlib/math-base-special-round\n*\n* @example\n* var round = require( '@stdlib/math-base-special-round' );\n*\n* var v = round( -4.2 );\n* // returns -4.0\n*\n* v = round( -4.5 );\n* // returns -4.0\n*\n* v = round( -4.6 );\n* // returns -5.0\n*\n* v = round( 9.99999 );\n* // returns 10.0\n*\n* v = round( 9.5 );\n* // returns 10.0\n*\n* v = round( 9.2 );\n* // returns 9.0\n*\n* v = round( 0.0 );\n* // returns 0.0\n*\n* v = round( -0.0 );\n* // returns -0.0\n*\n* v = round( Infinity );\n* // returns Infinity\n*\n* v = round( -Infinity );\n* // returns -Infinity\n*\n* v = round( 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":";;;;;;;;;;;;;;;;;;;;;;AAkEA,MAAIA,IAAOC,EAAA;AAKX,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,28 @@
+/**
+* @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 n() {
+  if (a) return r;
+  a = 1;
+  var e = Math.round;
+  return r = e, r;
+}
+export {
+  n as __require
+};
+//# sourceMappingURL=main.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-round@0.3.0/node_modules/@stdlib/math-base-special-round/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* Rounds a numeric value to the nearest integer.\n*\n* @param {number} x - input value\n* @returns {number} function value\n*\n* @example\n* var v = round( -4.2 );\n* // returns -4.0\n*\n* @example\n* var v = round( -4.5 );\n* // returns -4.0\n*\n* @example\n* var v = round( -4.6 );\n* // returns -5.0\n*\n* @example\n* var v = round( 9.99999 );\n* // returns 10.0\n*\n* @example\n* var v = round( 9.5 );\n* // returns 10.0\n*\n* @example\n* var v = round( 9.2 );\n* // returns 9.0\n*\n* @example\n* var v = round( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = round( -0.0 );\n* // returns -0.0\n*\n* @example\n* var v = round( Infinity );\n* // returns Infinity\n*\n* @example\n* var v = round( -Infinity );\n* // returns -Infinity\n*\n* @example\n* var v = round( NaN );\n* // returns NaN\n*/\nvar round = Math.round; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nmodule.exports = round;\n"],"names":["round","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAwEA,MAAIA,IAAQ,KAAK;AAKjB,SAAAC,IAAiBD;;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+math-base-special-roundn@0.2.2/node_modules/@stdlib/math-base-special-roundn/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 to the nearest multiple of `10^n`.\n*\n* @module @stdlib/math-base-special-roundn\n*\n* @example\n* var roundn = require( '@stdlib/math-base-special-roundn' );\n*\n* // Round a value to 2 decimal places:\n* var v = roundn( 3.141592653589793, -2 );\n* // returns 3.14\n*\n* // If n = 0, `roundn` behaves like `round`:\n* v = roundn( 3.141592653589793, 0 );\n* // returns 3.0\n*\n* // Round a value to the nearest thousand:\n* v = roundn( 12368.0, 3 );\n* // returns 12000.0\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-roundn@0.2.2/node_modules/@stdlib/math-base-special-roundn/lib/main.js

@@ -0,0 +1,47 @@
+import { __require as $ } from "../../../../../@stdlib_math-base-assert-is-nan@0.2.2/node_modules/@stdlib/math-base-assert-is-nan/lib/index.js";
+import { __require as E } from "../../../../../@stdlib_math-base-assert-is-infinite@0.2.2/node_modules/@stdlib/math-base-assert-is-infinite/lib/index.js";
+import { __require as N } from "../../../../../@stdlib_math-base-special-pow@0.3.0/node_modules/@stdlib/math-base-special-pow/lib/index.js";
+import { __require as X } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
+import { __require as A } from "../../../../../@stdlib_math-base-special-round@0.3.0/node_modules/@stdlib/math-base-special-round/lib/index.js";
+import { __require as I } from "../../../../../@stdlib_constants-float64-max-safe-integer@0.2.2/node_modules/@stdlib/constants-float64-max-safe-integer/lib/index.js";
+import { __require as d } from "../../../../../@stdlib_constants-float64-max-base10-exponent@0.2.2/node_modules/@stdlib/constants-float64-max-base10-exponent/lib/index.js";
+import { __require as P } from "../../../../../@stdlib_constants-float64-min-base10-exponent@0.2.2/node_modules/@stdlib/constants-float64-min-base10-exponent/lib/index.js";
+import { __require as R } from "../../../../../@stdlib_constants-float64-min-base10-exponent-subnormal@0.2.1/node_modules/@stdlib/constants-float64-min-base10-exponent-subnormal/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 _, n;
+function F() {
+  if (n) return _;
+  n = 1;
+  var o = $(), a = E(), t = N(), s = X(), q = A(), v = I(), f = d(), p = P(), b = R(), L = v + 1, m = 1e308;
+  function M(r, i) {
+    var e, u;
+    return o(r) || o(i) || a(i) ? NaN : (
+      // Handle infinities...
+      a(r) || // Handle +-0...
+      r === 0 || // If `n` exceeds the maximum number of feasible decimal places (such as with subnormal numbers), nothing to round...
+      i < b || // If `|x|` is large enough, no decimals to round...
+      s(r) > L && i <= 0 ? r : i > f ? 0 * r : i < p ? (e = t(10, -(i + f)), u = r * m * e, a(u) ? r : q(u) / m / e) : (e = t(10, -i), u = r * e, a(u) ? r : q(u) / e)
+    );
+  }
+  return _ = M, _;
+}
+export {
+  F as __require
+};
+//# sourceMappingURL=main.js.map