@milaboratories/miplots4 1.0.156 → 1.0.158

package/dist/node_modules/.pnpm/@stdlib_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/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_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/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 a one-sample Student's t-Test.\n*\n* @module @stdlib/stats-ttest\n*\n* @example\n* var normal = require( '@stdlib/random-base-normal' ).factory;\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ttest = require( '@stdlib/stats-ttest' );\n*\n* var rnorm;\n* var out;\n* var i;\n* var x;\n* var y;\n*\n* rnorm = normal( 1.0, 2.0, {\n*     'seed': 786\n* });\n*\n* // One-sample t-test:\n* x = new Float64Array( 100 );\n* for ( i = 0; i < x.length; i++ ) {\n*     x[ i ] = rnorm();\n* }\n* out = ttest( x );\n*\n* // Paired t-test:\n* x = new Float64Array( 100 );\n* y = new Float64Array( 100 );\n* for ( i = 0; i < x.length; i++ ) {\n*     x[ i ] = rnorm();\n*     y[ i ] = rnorm();\n* }\n* out = ttest( x, y );\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":";;;;;;;;;;;;;;;;;;;;;;AA2DA,MAAIA,IAAOC,EAAA;AAKX,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/main.js

@@ -0,0 +1,84 @@
+import { __require as I } from "../../../../../@stdlib_assert-is-number-array@0.2.2/node_modules/@stdlib/assert-is-number-array/lib/index.js";
+import { __require as M } from "../../../../../@stdlib_assert-is-typed-array-like@0.2.2/node_modules/@stdlib/assert-is-typed-array-like/lib/index.js";
+import { __require as R } from "../../../../../@stdlib_utils-define-read-only-property@0.2.2/node_modules/@stdlib/utils-define-read-only-property/lib/index.js";
+import { __require as S } from "../../../../../@stdlib_assert-is-plain-object@0.2.2/node_modules/@stdlib/assert-is-plain-object/lib/index.js";
+import { __require as k } from "../../../../../@stdlib_stats-base-dists-t-cdf@0.2.2/node_modules/@stdlib/stats-base-dists-t-cdf/lib/index.js";
+import { __require as C } from "../../../../../@stdlib_stats-base-dists-t-quantile@0.2.2/node_modules/@stdlib/stats-base-dists-t-quantile/lib/index.js";
+import { __require as D } from "../../../../../@stdlib_string-format@0.2.2/node_modules/@stdlib/string-format/lib/index.js";
+import { __require as Q } from "../../../../../@stdlib_math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/lib/index.js";
+import { __require as z } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
+import { __require as B } from "../../../../../@stdlib_stats-base-mean@0.2.2/node_modules/@stdlib/stats-base-mean/lib/index.js";
+import { __require as G } from "../../../../../@stdlib_stats-base-variance@0.2.2/node_modules/@stdlib/stats-base-variance/lib/index.js";
+import { __require as H } from "../../../../../@stdlib_blas-base-gcopy@0.2.1/node_modules/@stdlib/blas-base-gcopy/lib/index.js";
+import { __require as J } from "../../../../../@stdlib_constants-float64-ninf@0.2.2/node_modules/@stdlib/constants-float64-ninf/lib/index.js";
+import { __require as K } from "../../../../../@stdlib_constants-float64-pinf@0.2.2/node_modules/@stdlib/constants-float64-pinf/lib/index.js";
+import { __require as U } from "../../../../../@stdlib_array-float64@0.2.2/node_modules/@stdlib/array-float64/lib/index.js";
+import { __require as W } from "./validate.js";
+import { __require as X } from "./print.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, L;
+function fr() {
+  if (L) return c;
+  L = 1;
+  var _ = I().primitives, d = M(), a = R(), $ = S(), g = k(), h = C(), p = D(), y = Q(), F = z(), V = B(), E = G(), N = H(), T = J(), j = K(), A = U(), w = W(), O = X();
+  function P(t) {
+    var s, b, f, l, r, m, v, u, e, n, o, i, q;
+    if (!d(t) && !_(t))
+      throw new TypeError(p("invalid argument. First argument must be a numeric array. Value: `%s`.", t));
+    if (u = t.length, u < 2)
+      throw new Error(p("invalid argument. First argument must contain at least two elements. Value: `%s`.", t));
+    if (r = {
+      mu: 0,
+      alpha: 0.05,
+      alternative: "two-sided"
+    }, arguments.length === 2) {
+      if ($(arguments[1])) {
+        if (v = w(r, arguments[1]), v)
+          throw v;
+      } else if (i = arguments[1], !d(i) && !_(i))
+        throw new TypeError(p("invalid argument. Second argument must be either a numeric array or an options object. Value: `%s`.", i));
+    } else if (arguments.length > 2) {
+      if (i = arguments[1], !d(i) && !_(i))
+        throw new TypeError(p("invalid argument. Second argument must be a numeric array. Value: `%s`.", i));
+      if (v = w(r, arguments[2]), v)
+        throw v;
+    }
+    if (i) {
+      if (i.length !== u)
+        throw new Error("invalid arguments. First and second arguments must have the same length.");
+      for (t = N(u, t, 1, new A(u), 1), q = 0; q < u; q++)
+        t[q] -= i[q];
+    }
+    return s = y(E(u, 1, t, 1) / u), b = V(u, t, 1), m = (b - r.mu) / s, n = u - 1, r.alternative === "two-sided" ? (l = 2 * g(-F(m), n), o = h(1 - r.alpha / 2, n), f = [
+      r.mu + (m - o) * s,
+      r.mu + (m + o) * s
+    ]) : r.alternative === "greater" ? (l = 1 - g(m, n), o = h(1 - r.alpha, n), f = [
+      r.mu + (m - o) * s,
+      j
+    ]) : (l = g(m, n), o = h(1 - r.alpha, n), f = [
+      T,
+      r.mu + (m + o) * s
+    ]), e = {}, a(e, "rejected", l <= r.alpha), a(e, "alpha", r.alpha), a(e, "pValue", l), a(e, "statistic", m), a(e, "ci", f), a(e, "df", n), a(e, "nullValue", r.mu), a(e, "mean", b), a(e, "sd", s), a(e, "alternative", r.alternative), a(e, "method", i ? "Paired t-test" : "One-sample t-test"), a(e, "print", O), e;
+  }
+  return c = P, c;
+}
+export {
+  fr as __require
+};
+//# sourceMappingURL=main.js.map

package/dist/node_modules/.pnpm/@stdlib_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/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 isNumberArray = require( '@stdlib/assert-is-number-array' ).primitives;\nvar isTypedArrayLike = require( '@stdlib/assert-is-typed-array-like' );\nvar setReadOnly = require( '@stdlib/utils-define-read-only-property' );\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar tCDF = require( '@stdlib/stats-base-dists-t-cdf' );\nvar tQuantile = require( '@stdlib/stats-base-dists-t-quantile' );\nvar format = require( '@stdlib/string-format' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar mean = require( '@stdlib/stats-base-mean' );\nvar variance = require( '@stdlib/stats-base-variance' );\nvar gcopy = require( '@stdlib/blas-base-gcopy' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar validate = require( './validate.js' );\nvar print = require( './print.js' ); // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Computes a one-sample or paired Student's t test.\n*\n* @param {NumericArray} x - input array\n* @param {NumericArray} [y] - optional paired array\n* @param {Options} [options] - function options\n* @param {number} [options.alpha=0.05] - significance level\n* @param {string} [options.alternative='two-sided'] - alternative hypothesis (`two-sided`, `less`, or `greater`)\n* @param {number} [options.mu=0.0] - mean under `H0`\n* @throws {TypeError} first argument must be a numeric array\n* @throws {Error} first argument must contain at least two elements\n* @throws {Error} paired array must have the same length as the first argument\n* @throws {TypeError} second argument must be either a numeric array or an options object\n* @throws {TypeError} `alpha` option must be number\n* @throws {RangeError} `alpha` option must be reside along the interval `[0,1]`\n* @throws {TypeError} `alternative` option must be a recognized option value (`two-sided`, `less`, or `greater`)\n* @throws {TypeError} `mu` option must be a number\n* @returns {Object} test results\n*\n* @example\n* var x = [ 4.0, 4.0, 6.0, 6.0, 5.0 ];\n* var opts = {\n*     'mu': 5.0\n* };\n* var out = ttest( x, opts );\n* // returns {...}\n*\n* @example\n* var x = [ 4.0, 4.0, 6.0, 6.0, 5.0 ];\n* var opts = {\n*     'alternative': 'greater'\n* };\n* var out = ttest( x, opts );\n* // returns {...}\n*/\nfunction ttest( x ) {\n\tvar stderr;\n\tvar xmean;\n\tvar cint;\n\tvar pval;\n\tvar opts;\n\tvar stat;\n\tvar err;\n\tvar len;\n\tvar out;\n\tvar df;\n\tvar tq;\n\tvar y;\n\tvar i;\n\n\tif ( !isTypedArrayLike( x ) && !isNumberArray( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a numeric array. Value: `%s`.', x ) );\n\t}\n\tlen = x.length;\n\tif ( len < 2 ) {\n\t\tthrow new Error( format( 'invalid argument. First argument must contain at least two elements. Value: `%s`.', x ) );\n\t}\n\topts = {\n\t\t'mu': 0.0,\n\t\t'alpha': 0.05,\n\t\t'alternative': 'two-sided'\n\t};\n\tif ( arguments.length === 2 ) {\n\t\tif ( isObject( arguments[ 1 ] ) ) {\n\t\t\terr = validate( opts, arguments[ 1 ] );\n\t\t\tif ( err ) {\n\t\t\t\tthrow err;\n\t\t\t}\n\t\t} else {\n\t\t\ty = arguments[ 1 ];\n\t\t\tif ( !isTypedArrayLike( y ) && !isNumberArray( y ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be either a numeric array or an options object. Value: `%s`.', y ) );\n\t\t\t}\n\t\t}\n\t} else if ( arguments.length > 2 ) {\n\t\ty = arguments[ 1 ];\n\t\tif ( !isTypedArrayLike( y ) && !isNumberArray( y ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a numeric array. Value: `%s`.', y ) );\n\t\t}\n\t\terr = validate( opts, arguments[ 2 ] );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tif ( y ) {\n\t\tif ( y.length !== len ) {\n\t\t\tthrow new Error( 'invalid arguments. First and second arguments must have the same length.' );\n\t\t}\n\t\tx = gcopy( len, x, 1, new Float64Array( len ), 1 );\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tx[ i ] -= y[ i ];\n\t\t}\n\t}\n\tstderr = sqrt( variance( len, 1, x, 1 ) / len ); // TODO: replace with base/sem\n\txmean = mean( len, x, 1 ); // TODO: ideally, we would get both the sem and the mean from the same function and without needing to traverse 3-4 times\n\tstat = ( xmean-opts.mu ) / stderr;\n\tdf = len - 1;\n\tif ( opts.alternative === 'two-sided' ) {\n\t\tpval = 2.0 * tCDF( -abs(stat), df );\n\t\ttq = tQuantile( 1.0-(opts.alpha/2.0), df );\n\t\tcint = [\n\t\t\topts.mu + ( (stat-tq)*stderr ),\n\t\t\topts.mu + ( (stat+tq)*stderr )\n\t\t];\n\t} else if ( opts.alternative === 'greater' ) {\n\t\tpval = 1.0 - tCDF( stat, df );\n\t\ttq = tQuantile( 1.0-opts.alpha, df );\n\t\tcint = [\n\t\t\topts.mu + ( (stat-tq)*stderr ),\n\t\t\tPINF\n\t\t];\n\t} else { // opts.alternative === 'less'\n\t\tpval = tCDF( stat, df );\n\t\ttq = tQuantile( 1.0-opts.alpha, df );\n\t\tcint = [\n\t\t\tNINF,\n\t\t\topts.mu + ( (stat+tq)*stderr )\n\t\t];\n\t}\n\tout = {};\n\tsetReadOnly( out, 'rejected', pval <= opts.alpha );\n\tsetReadOnly( out, 'alpha', opts.alpha );\n\tsetReadOnly( out, 'pValue', pval );\n\tsetReadOnly( out, 'statistic', stat );\n\tsetReadOnly( out, 'ci', cint );\n\tsetReadOnly( out, 'df', df );\n\tsetReadOnly( out, 'nullValue', opts.mu );\n\tsetReadOnly( out, 'mean', xmean );\n\tsetReadOnly( out, 'sd', stderr );\n\tsetReadOnly( out, 'alternative', opts.alternative );\n\tsetReadOnly( out, 'method', ( y ) ? 'Paired t-test' : 'One-sample t-test' );\n\tsetReadOnly( out, 'print', print );\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ttest;\n"],"names":["isNumberArray","require$$0","isTypedArrayLike","require$$1","setReadOnly","require$$2","isObject","require$$3","tCDF","require$$4","tQuantile","require$$5","format","require$$6","sqrt","require$$7","abs","require$$8","mean","require$$9","variance","require$$10","gcopy","require$$11","NINF","require$$12","PINF","require$$13","Float64Array","require$$14","validate","require$$15","print","require$$16","ttest","x","stderr","xmean","cint","pval","opts","stat","err","len","out","df","tq","y","i","main"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAgBC,EAAA,EAA4C,YAC5DC,IAAmBC,EAAA,GACnBC,IAAcC,EAAA,GACdC,IAAWC,EAAA,GACXC,IAAOC,EAAA,GACPC,IAAYC,EAAA,GACZC,IAASC,EAAA,GACTC,IAAOC,EAAA,GACPC,IAAMC,EAAA,GACNC,IAAOC,EAAA,GACPC,IAAWC,EAAA,GACXC,IAAQC,EAAA,GACRC,IAAOC,EAAA,GACPC,IAAOC,EAAA,GACPC,IAAeC,EAAA,GACfC,IAAWC,EAAA,GACXC,IAAQC;AAwCZ,WAASC,EAAOC,GAAI;AACnB,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAEJ,QAAK,CAAC9C,EAAkBiC,CAAC,KAAM,CAACnC,EAAemC,CAAC;AAC/C,YAAM,IAAI,UAAWvB,EAAQ,0EAA0EuB,CAAC,CAAE;AAG3G,QADAQ,IAAMR,EAAE,QACHQ,IAAM;AACV,YAAM,IAAI,MAAO/B,EAAQ,qFAAqFuB,CAAC,CAAE;AAOlH,QALAK,IAAO;AAAA,MACN,IAAM;AAAA,MACN,OAAS;AAAA,MACT,aAAe;AAAA,OAEX,UAAU,WAAW;AACzB,UAAKlC,EAAU,UAAW,CAAC;AAE1B,YADAoC,IAAMZ,EAAUU,GAAM,UAAW,CAAC,CAAE,GAC/BE;AACJ,gBAAMA;AAAA,iBAGPK,IAAI,UAAW,CAAC,GACX,CAAC7C,EAAkB6C,CAAC,KAAM,CAAC/C,EAAe+C,CAAC;AAC/C,cAAM,IAAI,UAAWnC,EAAQ,uGAAuGmC,CAAC,CAAE;AAAA,eAG9H,UAAU,SAAS,GAAI;AAElC,UADAA,IAAI,UAAW,CAAC,GACX,CAAC7C,EAAkB6C,CAAC,KAAM,CAAC/C,EAAe+C,CAAC;AAC/C,cAAM,IAAI,UAAWnC,EAAQ,2EAA2EmC,CAAC,CAAE;AAG5G,UADAL,IAAMZ,EAAUU,GAAM,UAAW,CAAC,CAAE,GAC/BE;AACJ,cAAMA;AAAA,IAET;AACC,QAAKK,GAAI;AACR,UAAKA,EAAE,WAAWJ;AACjB,cAAM,IAAI,MAAO,0EAA0E;AAG5F,WADAR,IAAIb,EAAOqB,GAAKR,GAAG,GAAG,IAAIP,EAAce,CAAG,GAAI,CAAC,GAC1CK,IAAI,GAAGA,IAAIL,GAAKK;AACrB,QAAAb,EAAGa,CAAC,KAAMD,EAAGC,CAAC;AAAA,IAEjB;AACC,WAAAZ,IAAStB,EAAMM,EAAUuB,GAAK,GAAGR,GAAG,KAAMQ,IAC1CN,IAAQnB,EAAMyB,GAAKR,GAAG,CAAC,GACvBM,KAASJ,IAAMG,EAAK,MAAOJ,GAC3BS,IAAKF,IAAM,GACNH,EAAK,gBAAgB,eACzBD,IAAO,IAAM/B,EAAM,CAACQ,EAAIyB,CAAI,GAAGI,CAAE,GACjCC,IAAKpC,EAAW,IAAK8B,EAAK,QAAM,GAAMK,CAAE,GACxCP,IAAO;AAAA,MACNE,EAAK,MAAQC,IAAKK,KAAIV;AAAA,MACtBI,EAAK,MAAQC,IAAKK,KAAIV;AAAA,SAEZI,EAAK,gBAAgB,aAChCD,IAAO,IAAM/B,EAAMiC,GAAMI,CAAE,GAC3BC,IAAKpC,EAAW,IAAI8B,EAAK,OAAOK,CAAE,GAClCP,IAAO;AAAA,MACNE,EAAK,MAAQC,IAAKK,KAAIV;AAAA,MACtBV;AAAA,UAGDa,IAAO/B,EAAMiC,GAAMI,CAAE,GACrBC,IAAKpC,EAAW,IAAI8B,EAAK,OAAOK,CAAE,GAClCP,IAAO;AAAA,MACNd;AAAA,MACAgB,EAAK,MAAQC,IAAKK,KAAIV;AAAA,QAGxBQ,IAAM,CAAA,GACNxC,EAAawC,GAAK,YAAYL,KAAQC,EAAK,KAAK,GAChDpC,EAAawC,GAAK,SAASJ,EAAK,KAAK,GACrCpC,EAAawC,GAAK,UAAUL,CAAI,GAChCnC,EAAawC,GAAK,aAAaH,CAAI,GACnCrC,EAAawC,GAAK,MAAMN,CAAI,GAC5BlC,EAAawC,GAAK,MAAMC,CAAE,GAC1BzC,EAAawC,GAAK,aAAaJ,EAAK,EAAE,GACtCpC,EAAawC,GAAK,QAAQP,CAAK,GAC/BjC,EAAawC,GAAK,MAAMR,CAAM,GAC9BhC,EAAawC,GAAK,eAAeJ,EAAK,WAAW,GACjDpC,EAAawC,GAAK,UAAYG,IAAM,kBAAkB,mBAAmB,GACzE3C,EAAawC,GAAK,SAASZ,CAAK,GACzBY;AAAA,EACR;AAKA,SAAAK,IAAiBf;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/print.js

@@ -0,0 +1,74 @@
+import { __require as d } from "../../../../../@stdlib_assert-is-positive-integer@0.2.2/node_modules/@stdlib/assert-is-positive-integer/lib/index.js";
+import { __require as v } from "../../../../../@stdlib_assert-is-plain-object@0.2.2/node_modules/@stdlib/assert-is-plain-object/lib/index.js";
+import { __require as m } from "../../../../../@stdlib_assert-is-boolean@0.2.2/node_modules/@stdlib/assert-is-boolean/lib/index.js";
+import { __require as p } from "../../../../../@stdlib_assert-has-own-property@0.2.2/node_modules/@stdlib/assert-has-own-property/lib/index.js";
+import { __require as g } from "../../../../../@stdlib_math-base-special-roundn@0.2.2/node_modules/@stdlib/math-base-special-roundn/lib/index.js";
+import { __require as q } from "../../../../../@stdlib_string-format@0.2.2/node_modules/@stdlib/string-format/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 s, u;
+function j() {
+  if (u) return s;
+  u = 1;
+  var l = d(), f = v(), c = m().isPrimitive, o = p(), t = g(), n = q();
+  function h(e) {
+    var a, r, i;
+    if (r = 4, a = !0, arguments.length > 0) {
+      if (!f(e))
+        throw new TypeError(n("invalid argument. First argument must be an object. Value: `%s`.", e));
+      if (o(e, "digits")) {
+        if (!l(e.digits))
+          throw new TypeError(n("invalid option. `%s` option must be a positive integer. Option: `%s`.", "digits", e.digits));
+        r = e.digits;
+      }
+      if (o(e, "decision")) {
+        if (!c(e.decision))
+          throw new TypeError(n("invalid option. `%s` option must be a boolean. Option: `%s`.", "decision", e.decision));
+        a = e.decision;
+      }
+    }
+    switch (i = "", i += this.method, i += `
+
+`, i += "Alternative hypothesis: ", this.method === "Paired t-test" ? i += "True difference in means is " : i += "True mean is ", this.alternative) {
+      case "less":
+        i += "less than ";
+        break;
+      case "greater":
+        i += "greater than ";
+        break;
+      case "two-sided":
+      default:
+        i += "not equal to ";
+        break;
+    }
+    return i += this.nullValue, i += `
+
+`, i += "    pValue: " + t(this.pValue, -r) + `
+`, i += "    statistic: " + t(this.statistic, -r) + `
+`, i += "    df: " + this.df + `
+`, i += "    " + (1 - this.alpha) * 100 + "% confidence interval: [" + t(this.ci[0], -r) + "," + t(this.ci[1], -r) + "]", i += `
+
+`, a && (i += "Test Decision: ", this.rejected ? i += "Reject null in favor of alternative at " + this.alpha * 100 + "% significance level" : i += "Fail to reject null in favor of alternative at " + this.alpha * 100 + "% significance level", i += `
+`), i;
+  }
+  return s = h, s;
+}
+export {
+  j as __require
+};
+//# sourceMappingURL=print.js.map

package/dist/node_modules/.pnpm/@stdlib_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/print.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"print.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/print.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 isPositiveInteger = require( '@stdlib/assert-is-positive-integer' );\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar roundn = require( '@stdlib/math-base-special-roundn' );\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Pretty-print output of test.\n*\n* @param {Object} [opts] - options object\n* @param {PositiveInteger} [opts.digits=4] - number of digits after the decimal point\n* @param {boolean} [opts.decision=true] - boolean indicating whether to print the test decision\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {string} formatted output\n*/\nfunction print( opts ) { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar decision;\n\tvar dgts;\n\tvar str;\n\n\tdgts = 4;\n\tdecision = true;\n\tif ( arguments.length > 0 ) {\n\t\tif ( !isObject( opts ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an object. Value: `%s`.', opts ) );\n\t\t}\n\t\tif ( hasOwnProp( opts, 'digits' ) ) {\n\t\t\tif ( !isPositiveInteger( opts.digits ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a positive integer. Option: `%s`.', 'digits', opts.digits ) );\n\t\t\t}\n\t\t\tdgts = opts.digits;\n\t\t}\n\t\tif ( hasOwnProp( opts, 'decision' ) ) {\n\t\t\tif ( !isBoolean( opts.decision ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'decision', opts.decision ) );\n\t\t\t}\n\t\t\tdecision = opts.decision;\n\t\t}\n\t}\n\tstr = '';\n\tstr += this.method;\n\tstr += '\\n\\n';\n\tstr += 'Alternative hypothesis: ';\n\tif ( this.method === 'Paired t-test' ) {\n\t\tstr += 'True difference in means is ';\n\t} else {\n\t\tstr += 'True mean is ';\n\t}\n\tswitch ( this.alternative ) {\n\tcase 'less':\n\t\tstr += 'less than ';\n\t\tbreak;\n\tcase 'greater':\n\t\tstr += 'greater than ';\n\t\tbreak;\n\tcase 'two-sided':\n\tdefault:\n\t\tstr += 'not equal to ';\n\t\tbreak;\n\t}\n\tstr += this.nullValue;\n\tstr += '\\n\\n';\n\tstr += '    pValue: ' + roundn( this.pValue, -dgts ) + '\\n';\n\tstr += '    statistic: ' + roundn( this.statistic, -dgts ) + '\\n';\n\tstr += '    df: ' + this.df + '\\n';\n\tstr += '    ' + ((1.0-this.alpha)*100) + '% confidence interval: [' +\n\t\troundn( this.ci[0], -dgts ) +\n\t\t',' +\n\t\troundn( this.ci[1], -dgts ) +\n\t']';\n\tstr += '\\n\\n';\n\tif ( decision ) {\n\t\tstr += 'Test Decision: ';\n\t\tif ( this.rejected ) {\n\t\t\tstr += 'Reject null in favor of alternative at ' + (this.alpha*100) + '% significance level';\n\t\t} else {\n\t\t\tstr += 'Fail to reject null in favor of alternative at ' + (this.alpha*100) + '% significance level';\n\t\t}\n\t\tstr += '\\n';\n\t}\n\treturn str;\n}\n\n\n// EXPORTS //\n\nmodule.exports = print;\n"],"names":["isPositiveInteger","require$$0","isObject","require$$1","isBoolean","require$$2","hasOwnProp","require$$3","roundn","require$$4","format","require$$5","print","opts","decision","dgts","str","print_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAoBC,EAAA,GACpBC,IAAWC,EAAA,GACXC,IAAYC,EAAA,EAAuC,aACnDC,IAAaC,EAAA,GACbC,IAASC,EAAA,GACTC,IAASC,EAAA;AAeb,WAASC,EAAOC,GAAO;AAEtB,QAAIC,GACAC,GACAC;AAIJ,QAFAD,IAAO,GACPD,IAAW,IACN,UAAU,SAAS,GAAI;AAC3B,UAAK,CAACZ,EAAUW;AACf,cAAM,IAAI,UAAWH,EAAQ,oEAAoEG,CAAI,CAAE;AAExG,UAAKP,EAAYO,GAAM,WAAa;AACnC,YAAK,CAACb,EAAmBa,EAAK;AAC7B,gBAAM,IAAI,UAAWH,EAAQ,yEAAyE,UAAUG,EAAK,OAAQ;AAE9H,QAAAE,IAAOF,EAAK;AAAA,MACf;AACE,UAAKP,EAAYO,GAAM,aAAe;AACrC,YAAK,CAACT,EAAWS,EAAK;AACrB,gBAAM,IAAI,UAAWH,EAAQ,gEAAgE,YAAYG,EAAK,SAAU;AAEzH,QAAAC,IAAWD,EAAK;AAAA,MACnB;AAAA,IACA;AAUC,YATAG,IAAM,IACNA,KAAO,KAAK,QACZA,KAAO;AAAA;AAAA,GACPA,KAAO,4BACF,KAAK,WAAW,kBACpBA,KAAO,iCAEPA,KAAO,iBAEC,KAAK,aAAW;AAAA,MACzB,KAAK;AACJ,QAAAA,KAAO;AACP;AAAA,MACD,KAAK;AACJ,QAAAA,KAAO;AACP;AAAA,MACD,KAAK;AAAA,MACL;AACC,QAAAA,KAAO;AACP;AAAA,IACF;AACC,WAAAA,KAAO,KAAK,WACZA,KAAO;AAAA;AAAA,GACPA,KAAO,iBAAiBR,EAAQ,KAAK,QAAQ,CAACO,CAAI,IAAK;AAAA,GACvDC,KAAO,oBAAoBR,EAAQ,KAAK,WAAW,CAACO,CAAI,IAAK;AAAA,GAC7DC,KAAO,aAAa,KAAK,KAAK;AAAA,GAC9BA,KAAO,UAAW,IAAI,KAAK,SAAO,MAAO,6BACxCR,EAAQ,KAAK,GAAG,CAAC,GAAG,CAACO,CAAI,IACzB,MACAP,EAAQ,KAAK,GAAG,CAAC,GAAG,CAACO,CAAI,IAC1B,KACAC,KAAO;AAAA;AAAA,GACFF,MACJE,KAAO,mBACF,KAAK,WACTA,KAAO,4CAA6C,KAAK,QAAM,MAAO,yBAEtEA,KAAO,oDAAqD,KAAK,QAAM,MAAO,wBAE/EA,KAAO;AAAA,IAEDA;AAAA,EACR;AAKA,SAAAC,IAAiBL;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/validate.js

@@ -0,0 +1,56 @@
+import { __require as p } from "../../../../../@stdlib_assert-is-number@0.2.2/node_modules/@stdlib/assert-is-number/lib/index.js";
+import { __require as q } from "../../../../../@stdlib_assert-is-plain-object@0.2.2/node_modules/@stdlib/assert-is-plain-object/lib/index.js";
+import { __require as s } from "../../../../../@stdlib_assert-is-string@0.2.2/node_modules/@stdlib/assert-is-string/lib/index.js";
+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 h } from "../../../../../@stdlib_assert-has-own-property@0.2.2/node_modules/@stdlib/assert-has-own-property/lib/index.js";
+import { __require as d } from "../../../../../@stdlib_assert-contains@0.2.2/node_modules/@stdlib/assert-contains/lib/index.js";
+import { __require as w } from "../../../../../@stdlib_string-format@0.2.2/node_modules/@stdlib/string-format/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, m;
+function y() {
+  if (m) return n;
+  m = 1;
+  var t = p().isPrimitive, o = q(), v = s().isPrimitive, u = _(), a = h(), f = d(), i = w(), l = [
+    "two-sided",
+    "less",
+    "greater"
+  ];
+  function b(r, e) {
+    if (!o(e))
+      return new TypeError(i("invalid argument. Options argument must be an object. Value: `%s`.", e));
+    if (a(e, "alpha")) {
+      if (r.alpha = e.alpha, !t(r.alpha) || u(r.alpha))
+        return new TypeError(i("invalid option. `%s` option must be a number. Option: `%s`.", "alpha", r.alpha));
+      if (r.alpha < 0 || r.alpha > 1)
+        return new RangeError(i("invalid option. `%s` option must be a number on the interval: [0, 1]. Option: `%f`.", "alpha", r.alpha));
+    }
+    if (a(e, "alternative")) {
+      if (r.alternative = e.alternative, !v(r.alternative))
+        return new TypeError(i("invalid option. `%s` option must be a string. Option: `%s`.", "alternative", r.alternative));
+      if (!f(l, r.alternative))
+        return new Error(i('invalid option. `%s` option must be one of the following: "%s". Option: `%s`.', "alternative", l.join('", "'), r.alternative));
+    }
+    return a(e, "mu") && (r.mu = e.mu, !t(r.mu) || u(r.mu)) ? new TypeError(i("invalid option. `%s` option must be a number. Option: `%s`.", "mu", r.mu)) : null;
+  }
+  return n = b, n;
+}
+export {
+  y as __require
+};
+//# sourceMappingURL=validate.js.map

package/dist/node_modules/.pnpm/@stdlib_stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/validate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+stats-ttest@0.2.2/node_modules/@stdlib/stats-ttest/lib/validate.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 isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar isString = require( '@stdlib/assert-is-string' ).isPrimitive;\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar contains = require( '@stdlib/assert-contains' );\nvar format = require( '@stdlib/string-format' );\n\n\n// VARIABLES //\n\nvar ALTERNATIVE = [\n\t'two-sided',\n\t'less',\n\t'greater'\n];\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination object\n* @param {Options} options - function options\n* @param {number} [options.alpha] - significance level\n* @param {string} [options.alternative] - alternative hypothesis\n* @param {number} [options.mu] - mean under `H0`\n* @returns {(null|Error)} null or an error object\n*\n* @example\n* var options = {\n*     'alpha': 0.05\n* };\n* var opts = {};\n*\n* var err = validate( opts, options );\n* if ( err ) {\n*     throw err;\n* }\n*/\nfunction validate( opts, options ) {\n\tif ( !isObject( options ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tif ( hasOwnProp( options, 'alpha' ) ) {\n\t\topts.alpha = options.alpha;\n\t\tif ( !isNumber( opts.alpha ) || isnan( opts.alpha ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a number. Option: `%s`.', 'alpha', opts.alpha ) );\n\t\t}\n\t\tif ( opts.alpha < 0.0 || opts.alpha > 1.0 ) {\n\t\t\treturn new RangeError( format( 'invalid option. `%s` option must be a number on the interval: [0, 1]. Option: `%f`.', 'alpha', opts.alpha ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'alternative' ) ) {\n\t\topts.alternative = options.alternative;\n\t\tif ( !isString( opts.alternative ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'alternative', opts.alternative ) );\n\t\t}\n\t\tif ( !contains( ALTERNATIVE, opts.alternative ) ) {\n\t\t\treturn new Error( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'alternative', ALTERNATIVE.join( '\", \"' ), opts.alternative ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'mu' ) ) {\n\t\topts.mu = options.mu;\n\t\tif ( !isNumber( opts.mu ) || isnan( opts.mu ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a number. Option: `%s`.', 'mu', opts.mu ) );\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = validate;\n"],"names":["isNumber","require$$0","isObject","require$$1","isString","require$$2","isnan","require$$3","hasOwnProp","require$$4","contains","require$$5","format","require$$6","ALTERNATIVE","validate","opts","options","validate_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAWC,EAAA,EAAsC,aACjDC,IAAWC,EAAA,GACXC,IAAWC,EAAA,EAAsC,aACjDC,IAAQC,EAAA,GACRC,IAAaC,EAAA,GACbC,IAAWC,EAAA,GACXC,IAASC,EAAA,GAKTC,IAAc;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA;AA4BD,WAASC,EAAUC,GAAMC,GAAU;AAClC,QAAK,CAACf,EAAUe;AACf,aAAO,IAAI,UAAWL,EAAQ,sEAAsEK,CAAO,CAAE;AAE9G,QAAKT,EAAYS,GAAS,UAAY;AAErC,UADAD,EAAK,QAAQC,EAAQ,OAChB,CAACjB,EAAUgB,EAAK,KAAK,KAAMV,EAAOU,EAAK;AAC3C,eAAO,IAAI,UAAWJ,EAAQ,+DAA+D,SAASI,EAAK,MAAO;AAEnH,UAAKA,EAAK,QAAQ,KAAOA,EAAK,QAAQ;AACrC,eAAO,IAAI,WAAYJ,EAAQ,uFAAuF,SAASI,EAAK,MAAO;AAAA,IAE9I;AACC,QAAKR,EAAYS,GAAS,gBAAkB;AAE3C,UADAD,EAAK,cAAcC,EAAQ,aACtB,CAACb,EAAUY,EAAK;AACpB,eAAO,IAAI,UAAWJ,EAAQ,+DAA+D,eAAeI,EAAK,YAAa;AAE/H,UAAK,CAACN,EAAUI,GAAaE,EAAK,WAAW;AAC5C,eAAO,IAAI,MAAOJ,EAAQ,iFAAiF,eAAeE,EAAY,KAAM,MAAM,GAAIE,EAAK,WAAW,CAAE;AAAA,IAE3K;AACC,WAAKR,EAAYS,GAAS,UACzBD,EAAK,KAAKC,EAAQ,IACb,CAACjB,EAAUgB,EAAK,EAAE,KAAMV,EAAOU,EAAK,OACjC,IAAI,UAAWJ,EAAQ,+DAA+D,MAAMI,EAAK,GAAI,IAGvG;AAAA,EACR;AAKA,SAAAE,IAAiBH;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/index.js

@@ -0,0 +1,29 @@
+import { __require as a } from "./main.js";
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2020 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_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/index.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 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 a Wilcoxon signed-rank test.\n*\n* @module @stdlib/stats-wilcoxon\n*\n* @example\n* var normal = require( '@stdlib/random-base-normal' ).factory;\n* var wilcoxon = require( '@stdlib/stats-wilcoxon' );\n*\n* var rnorm;\n* var out;\n* var i;\n* var x;\n* var y;\n*\n* rnorm = normal( 1.0, 2.0, {\n*     'seed': 786\n* });\n*\n* // One-sample Wilcoxon signed rank test:\n* x = new Array( 100 );\n* for ( i = 0; i < x.length; i++ ) {\n*     x[ i ] = rnorm();\n* }\n* out = wilcoxon( x );\n*\n* // Paired Wilcoxon signed rank test:\n* x = new Array( 100 );\n* y = new Array( 100 );\n* for ( i = 0; i < x.length; i++ ) {\n*     x[ i ] = rnorm();\n*     y[ i ] = rnorm();\n* }\n* out = wilcoxon( x, y );\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":";;;;;;;;;;;;;;;;;;;;;;AA0DA,MAAIA,IAAOC,EAAA;AAKX,SAAAC,IAAiBF;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/main.js

@@ -0,0 +1,90 @@
+import { __require as K } from "../../../../../@stdlib_assert-is-number-array@0.2.2/node_modules/@stdlib/assert-is-number-array/lib/index.js";
+import { __require as Q } from "../../../../../@stdlib_assert-is-typed-array-like@0.2.2/node_modules/@stdlib/assert-is-typed-array-like/lib/index.js";
+import { __require as X } from "../../../../../@stdlib_utils-define-read-only-property@0.2.2/node_modules/@stdlib/utils-define-read-only-property/lib/index.js";
+import { __require as Y } from "../../../../../@stdlib_assert-is-plain-object@0.2.2/node_modules/@stdlib/assert-is-plain-object/lib/index.js";
+import { __require as Z } from "../../../../../@stdlib_stats-ranks@0.2.2/node_modules/@stdlib/stats-ranks/lib/index.js";
+import { __require as rr } from "../../../../../@stdlib_stats-base-dists-normal-cdf@0.2.2/node_modules/@stdlib/stats-base-dists-normal-cdf/lib/index.js";
+import { __require as er } from "../../../../../@stdlib_stats-base-dists-signrank-cdf@0.2.2/node_modules/@stdlib/stats-base-dists-signrank-cdf/lib/index.js";
+import { __require as ir } from "../../../../../@stdlib_utils-tabulate@0.2.2/node_modules/@stdlib/utils-tabulate/lib/index.js";
+import { __require as ar } from "../../../../../@stdlib_math-base-special-signum@0.2.2/node_modules/@stdlib/math-base-special-signum/lib/index.js";
+import { __require as tr } from "../../../../../@stdlib_math-base-special-sqrt@0.2.2/node_modules/@stdlib/math-base-special-sqrt/lib/index.js";
+import { __require as or } from "../../../../../@stdlib_math-base-special-abs@0.2.2/node_modules/@stdlib/math-base-special-abs/lib/index.js";
+import { __require as sr } from "../../../../../@stdlib_array-float64@0.2.2/node_modules/@stdlib/array-float64/lib/index.js";
+import { __require as nr } from "../../../../../@stdlib_string-format@0.2.2/node_modules/@stdlib/string-format/lib/index.js";
+import { __require as ur } from "./validate.js";
+import { __require as mr } from "./unique.js";
+import { __require as fr } from "./print.js";
+var M, P;
+function zr() {
+  if (P) return M;
+  P = 1;
+  var A = K().primitives, O = Q(), f = X(), R = Y(), N = Z(), S = rr().factory, g = er(), U = ir(), W = ar(), B = tr(), j = or(), C = sr(), x = nr(), G = ur(), H = mr(), I = fr(), k = S(0, 1);
+  function J() {
+    var z, d, c, D, b, w, L, t, F, y, m, o, s, v, V, e, E, n, T, q, $, _, i, r, l, h, p, a, u;
+    if (a = arguments[0], !O(a) && !A(a))
+      throw new TypeError(x("invalid argument. First argument must be a numeric array. Value: `%s`.", a));
+    if (e = a.length, arguments.length > 1)
+      if (R(arguments[1]))
+        c = arguments[1];
+      else {
+        if (u = arguments[1], !O(u) && !A(u))
+          throw new TypeError(x("invalid argument. `%s` argument must be a numeric array. Value: `%s`.", "y", u));
+        if (e !== u.length)
+          throw new Error("invalid arguments. First and second arguments must have the same length.");
+        arguments.length > 2 && (c = arguments[2]);
+      }
+    if (o = {}, c && (V = G(o, c), V))
+      throw V;
+    if (q = o.mu || 0, o.correction === void 0 ? z = !0 : z = o.correction, o.alpha === void 0 ? y = 0.05 : y = o.alpha, e < 2)
+      throw new Error(x("invalid argument. First argument must contain at least two elements. Value: `%s`.", a));
+    if (v = o.alternative || "two-sided", d = o.zeroMethod || "wilcox", d === "wilcox") {
+      if (i = [], u)
+        for (r = 0; r < e; r++)
+          p = a[r] - u[r] - q, p !== 0 && i.push(p);
+      else
+        for (r = 0; r < e; r++)
+          a[r] !== 0 && i.push(a[r] - q);
+      t = a.length - i.length;
+    } else if (i = new C(e), t = 0, u)
+      for (r = 0; r < e; r++)
+        i[r] = a[r] - u[r] - q, i[r] === 0 && (t += 1);
+    else
+      for (r = 0; r < e; r++)
+        i[r] = a[r] - q, i[r] === 0 && (t += 1);
+    if (t === e)
+      throw new Error("`x` or `x - y` cannot be zero for all elements.");
+    for (e = i.length, T = new C(e), r = 0; r < e; r++)
+      T[r] = j(i[r]);
+    for (l = N(T), L = 0, F = 0, r = 0; r < e; r++)
+      i[r] > 0 ? L += l[r] : i[r] === 0 && (F += l[r]);
+    if (D = H(l).length !== l.length, d === "zsplit" && (L += F / 2), h = L, $ = e * (e + 1) * 0.25, _ = e * (e + 1) * (2 * e + 1), d === "pratt") {
+      for (E = [], r = 0; r < e; r++)
+        i[r] !== 0 && E.push(l[r]);
+      l = E, $ -= t * (t + 1) * 0.25, _ -= t * (t + 1) * (2 * t + 1);
+    }
+    for (b = U(l), w = 0, r = 0; r < b.length; r++)
+      b[r][1] > 1 && (p = b[r][1], w += p * (p * p - 1));
+    if (w > 0 && (_ -= 0.5 * w), _ = B(_ / 24), e > 50 && !o.exact || t > 0 || D) {
+      if (i = 0, z)
+        switch (v) {
+          case "two-sided":
+            i = 0.5 * W(h - $);
+            break;
+          case "less":
+            i = -0.5;
+            break;
+          default:
+            i = 0.5;
+            break;
+        }
+      s = (h - $ - i) / _, v === "two-sided" ? m = 2 * (1 - k(j(s))) : v === "greater" ? m = 1 - k(s) : m = k(s);
+    } else
+      s = h, v === "two-sided" ? s > e * (e + 1) / 4 ? m = 2 * (1 - g(s - 1, e)) : m = 2 * g(s, e) : v === "greater" ? m = 1 - g(s - 1, e) : m = g(s, e);
+    return n = {}, f(n, "rejected", m <= y), f(n, "alpha", y), f(n, "pValue", m), f(n, "statistic", h), f(n, "nullValue", q), f(n, "alternative", v), f(n, "method", (u ? "Paired" : "One-Sample") + " Wilcoxon signed rank test"), f(n, "print", I), n;
+  }
+  return M = J, M;
+}
+export {
+  zr as __require
+};
+//# sourceMappingURL=main.js.map

package/dist/node_modules/.pnpm/@stdlib_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/main.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/main.js"],"sourcesContent":["/* eslint-disable max-statements, max-lines-per-function */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 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 isNumberArray = require( '@stdlib/assert-is-number-array' ).primitives;\nvar isTypedArrayLike = require( '@stdlib/assert-is-typed-array-like' );\nvar setReadOnly = require( '@stdlib/utils-define-read-only-property' );\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar ranks = require( '@stdlib/stats-ranks' );\nvar normalCDF = require( '@stdlib/stats-base-dists-normal-cdf' ).factory;\nvar signrankCDF = require( '@stdlib/stats-base-dists-signrank-cdf' );\nvar tabulate = require( '@stdlib/utils-tabulate' );\nvar signum = require( '@stdlib/math-base-special-signum' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar format = require( '@stdlib/string-format' );\nvar validate = require( './validate.js' );\nvar unique = require( './unique.js' );\nvar print = require( './print.js' ); // eslint-disable-line stdlib/no-redeclare\n\n\n// VARIABLES //\n\nvar pnorm = normalCDF( 0.0, 1.0 );\n\n\n// MAIN //\n\n/**\n* Computes a Wilcoxon signed rank test.\n*\n* @param {NumericArray} x - data array\n* @param {NumericArray} [y] - optional paired data array\n* @param {Options} [options] - function options\n* @param {number} [options.alpha=0.05] - significance level\n* @param {string} [options.alternative='two-sided'] - alternative hypothesis (`two-sided`, `less`, or `greater`)\n* @param {string} [options.zeroMethod='wilcox'] - method governing how zero-differences are handled (`pratt`, `wilcox`, or `zsplit`)\n* @param {boolean} [options.correction=true] - continuity correction adjusting the Wilcoxon rank statistic by 0.5 towards the mean\n* @param {boolean} [options.exact=false] - whether to force using the exact distribution instead of a normal approximation when there are more than fifty data points\n* @param {number} [options.mu=0] - location parameter under H0\n* @throws {TypeError} `x` must be a numeric array\n* @throws {TypeError} `y` must be a numeric array\n* @throws {TypeError} options must be an object\n* @throws {TypeError} `alpha` option has to be a number\n* @throws {RangeError} `alpha` option has to be a number in the interval `[0,1]`\n* @throws {TypeError} `alternative` option has to be a string\n* @throws {Error} `alternative` option must be `two-sided`, `less`, or `greater`\n* @throws {TypeError} `zeroMethod` option has to be a string\n* @throws {Error} `zeroMethod` option must be `pratt`, `wilcox`, or `zsplit`\n* @throws {TypeError} `correction` option has to be a boolean\n* @throws {TypeError} `exact` option has to be a boolean\n* @throws {TypeError} `mu` option has to be a number\n* @returns {Object} test result object\n*\n* @example\n* var x = [ 6, 8, 14, 16, 23, 24, 28, 29, 41, -48, 49, 56, 60, -67, 75 ];\n* var out = wilcoxon( x, {\n*     'mu': 2\n* });\n*\n* @example\n* var x = [ 6, 8, 14, 16, 23, 24, 28, 29, 41, -48, 49, 56, 60, -67, 75 ];\n* var out = wilcoxon( x, {\n*     'alternative': 'greater'\n* });\n*/\nfunction wilcoxon() {\n\tvar correction;\n\tvar zeroMethod;\n\tvar options;\n\tvar hasTies;\n\tvar counts;\n\tvar repsum;\n\tvar rplus;\n\tvar nzero;\n\tvar rzero;\n\tvar alpha;\n\tvar pval;\n\tvar opts;\n\tvar stat;\n\tvar alt;\n\tvar err;\n\tvar len;\n\tvar tmp;\n\tvar out;\n\tvar ad;\n\tvar mu;\n\tvar mn;\n\tvar se;\n\tvar d;\n\tvar i;\n\tvar r;\n\tvar T;\n\tvar v;\n\tvar x;\n\tvar y;\n\n\tx = arguments[ 0 ];\n\tif ( !isTypedArrayLike( x ) && !isNumberArray( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a numeric array. Value: `%s`.', x ) );\n\t}\n\tlen = x.length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( isObject( arguments[ 1 ] ) ) {\n\t\t\toptions = arguments[ 1 ];\n\t\t} else {\n\t\t\ty = arguments[ 1 ];\n\t\t\tif ( !isTypedArrayLike( y ) && !isNumberArray( y ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. `%s` argument must be a numeric array. Value: `%s`.', 'y', y ) );\n\t\t\t}\n\t\t\tif ( len !== y.length ) {\n\t\t\t\tthrow new Error( 'invalid arguments. First and second arguments must have the same length.' );\n\t\t\t}\n\t\t\tif ( arguments.length > 2 ) {\n\t\t\t\toptions = arguments[ 2 ];\n\t\t\t}\n\t\t}\n\t}\n\topts = {};\n\tif ( options ) {\n\t\terr = validate( opts, options );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tmu = opts.mu || 0.0;\n\tif ( opts.correction === void 0 ) {\n\t\tcorrection = true;\n\t} else {\n\t\tcorrection = opts.correction;\n\t}\n\tif ( opts.alpha === void 0 ) {\n\t\talpha = 0.05;\n\t} else {\n\t\talpha = opts.alpha;\n\t}\n\tif ( len < 2 ) {\n\t\tthrow new Error( format( 'invalid argument. First argument must contain at least two elements. Value: `%s`.', x ) );\n\t}\n\talt = opts.alternative || 'two-sided';\n\tzeroMethod = opts.zeroMethod || 'wilcox';\n\n\tif ( zeroMethod === 'wilcox' ) {\n\t\t// Only keep all non-zero differences:\n\t\td = [];\n\t\tif ( y ) {\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = ( x[ i ] - y[ i ] ) - mu;\n\t\t\t\tif ( v !== 0 ) {\n\t\t\t\t\td.push( v );\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tif ( x[ i ] !== 0 ) {\n\t\t\t\t\td.push( x[ i ] - mu );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tnzero = x.length - d.length;\n\t} else {\n\t\td = new Float64Array( len );\n\t\tnzero = 0;\n\t\tif ( y ) {\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\td[ i ] = ( x[ i ] - y[ i ] ) - mu;\n\t\t\t\tif ( d[ i ] === 0 ) {\n\t\t\t\t\tnzero += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\td[ i ] = x[ i ] - mu;\n\t\t\t\tif ( d[ i ] === 0 ) {\n\t\t\t\t\tnzero += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif ( nzero === len ) {\n\t\tthrow new Error( '`x` or `x - y` cannot be zero for all elements.' );\n\t}\n\t// Update length after potentially discarding zero values:\n\tlen = d.length;\n\tad = new Float64Array( len );\n\tfor ( i = 0; i < len; i++ ) {\n\t\tad[ i ] = abs( d[ i ] );\n\t}\n\tr = ranks( ad );\n\trplus = 0;\n\trzero = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tif ( d[ i ] > 0 ) {\n\t\t\trplus += r[ i ];\n\t\t}\n\t\telse if ( d[ i ] === 0 ) {\n\t\t\trzero += r[ i ];\n\t\t}\n\t}\n\thasTies = unique( r ).length !== r.length;\n\tif ( zeroMethod === 'zsplit' ) {\n\t\trplus += rzero / 2.0;\n\t}\n\tT = rplus;\n\tmn = len * ( len + 1.0 ) * 0.25;\n\tse = len * ( len + 1.0 ) * ( ( 2.0 * len ) + 1.0 );\n\n\tif ( zeroMethod === 'pratt' ) {\n\t\ttmp = [];\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( d[ i ] !== 0 ) {\n\t\t\t\ttmp.push( r[ i ] );\n\t\t\t}\n\t\t}\n\t\tr = tmp;\n\t\tmn -= nzero * ( nzero + 1.0 ) * 0.25;\n\t\tse -= nzero * ( nzero + 1.0 ) * ( ( 2.0 * nzero ) + 1.0 );\n\t}\n\tcounts = tabulate( r );\n\trepsum = 0;\n\tfor ( i = 0; i < counts.length; i++ ) {\n\t\tif ( counts[ i ][ 1 ] > 1 ) {\n\t\t\tv = counts[ i ][ 1 ];\n\t\t\trepsum += v * ( (v*v) - 1 );\n\t\t}\n\t}\n\tif ( repsum > 0 ) {\n\t\t// Correction for repeated values:\n\t\tse -= 0.5 * repsum;\n\t}\n\tse = sqrt( se / 24.0 );\n\n\tif (\n\t\t( len > 50 && !opts.exact ) ||\n\t\tnzero > 0 ||\n\t\thasTies\n\t) {\n\t\td = 0.0;\n\t\tif ( correction ) {\n\t\t\tswitch ( alt ) {\n\t\t\tcase 'two-sided':\n\t\t\t\td = 0.5 * signum( T - mn );\n\t\t\t\tbreak;\n\t\t\tcase 'less':\n\t\t\t\td = -0.5;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\td = 0.5;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// Compute test statistic and p-value using normal approximation:\n\t\tstat = ( T - mn - d ) / se;\n\t\tif ( alt === 'two-sided' ) {\n\t\t\tpval = 2.0 * ( 1.0 - pnorm( abs( stat ) ) );\n\t\t} else if ( alt === 'greater' ) {\n\t\t\tpval = 1.0 - pnorm( stat );\n\t\t} else {\n\t\t\tpval = pnorm( stat );\n\t\t}\n\t} else {\n\t\t// Compute test statistic and p-value using exact critical values:\n\t\tstat = T;\n\t\tif ( alt === 'two-sided' ) {\n\t\t\tif ( stat > ( len * ( len+1 ) / 4 ) ) {\n\t\t\t\tpval = 2.0 * ( 1 - signrankCDF( stat - 1, len ) );\n\t\t\t} else {\n\t\t\t\tpval = 2.0 * signrankCDF( stat, len );\n\t\t\t}\n\t\t} else if ( alt === 'greater' ) {\n\t\t\tpval = 1.0 - signrankCDF( stat - 1, len );\n\t\t} else {\n\t\t\tpval = signrankCDF( stat, len );\n\t\t}\n\t}\n\tout = {};\n\tsetReadOnly( out, 'rejected', pval <= alpha );\n\tsetReadOnly( out, 'alpha', alpha );\n\tsetReadOnly( out, 'pValue', pval );\n\tsetReadOnly( out, 'statistic', T );\n\tsetReadOnly( out, 'nullValue', mu );\n\tsetReadOnly( out, 'alternative', alt );\n\tsetReadOnly( out, 'method', ( ( y ) ? 'Paired' : 'One-Sample' ) + ' Wilcoxon signed rank test' );\n\tsetReadOnly( out, 'print', print );\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = wilcoxon;\n"],"names":["isNumberArray","require$$0","isTypedArrayLike","require$$1","setReadOnly","require$$2","isObject","require$$3","ranks","require$$4","normalCDF","require$$5","signrankCDF","require$$6","tabulate","require$$7","signum","require$$8","sqrt","require$$9","abs","require$$10","Float64Array","require$$11","format","require$$12","validate","require$$13","unique","require$$14","print","require$$15","pnorm","wilcoxon","correction","zeroMethod","options","hasTies","counts","repsum","rplus","nzero","rzero","alpha","pval","opts","stat","alt","err","len","tmp","out","ad","mu","mn","se","d","i","r","T","v","x","y","main"],"mappings":";;;;;;;;;;;;;;;;;;;;AAwBA,MAAIA,IAAgBC,EAAA,EAA4C,YAC5DC,IAAmBC,EAAA,GACnBC,IAAcC,EAAA,GACdC,IAAWC,EAAA,GACXC,IAAQC,EAAA,GACRC,IAAYC,GAAA,EAAiD,SAC7DC,IAAcC,GAAA,GACdC,IAAWC,GAAA,GACXC,IAASC,GAAA,GACTC,IAAOC,GAAA,GACPC,IAAMC,GAAA,GACNC,IAAeC,GAAA,GACfC,IAASC,GAAA,GACTC,IAAWC,GAAA,GACXC,IAASC,GAAA,GACTC,IAAQC,MAKRC,IAAQtB,EAAW,GAAK,CAAG;AA2C/B,WAASuB,IAAW;AACnB,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,QADAD,IAAI,UAAW,CAAC,GACX,CAAC3D,EAAkB2D,CAAC,KAAM,CAAC7D,EAAe6D,CAAC;AAC/C,YAAM,IAAI,UAAWrC,EAAQ,0EAA0EqC,CAAC,CAAE;AAG3G,QADAZ,IAAMY,EAAE,QACH,UAAU,SAAS;AACvB,UAAKvD,EAAU,UAAW,CAAC;AAC1B,QAAA8B,IAAU,UAAW,CAAC;AAAA,WAChB;AAEN,YADA0B,IAAI,UAAW,CAAC,GACX,CAAC5D,EAAkB4D,CAAC,KAAM,CAAC9D,EAAe8D,CAAC;AAC/C,gBAAM,IAAI,UAAWtC,EAAQ,yEAAyE,KAAKsC,CAAC,CAAE;AAE/G,YAAKb,MAAQa,EAAE;AACd,gBAAM,IAAI,MAAO,0EAA0E;AAE5F,QAAK,UAAU,SAAS,MACvB1B,IAAU,UAAW,CAAC;AAAA,MAE1B;AAGC,QADAS,IAAO,CAAA,GACFT,MACJY,IAAMtB,EAAUmB,GAAMT,CAAO,GACxBY;AACJ,YAAMA;AAcR,QAXAK,IAAKR,EAAK,MAAM,GACXA,EAAK,eAAe,SACxBX,IAAa,KAEbA,IAAaW,EAAK,YAEdA,EAAK,UAAU,SACnBF,IAAQ,OAERA,IAAQE,EAAK,OAETI,IAAM;AACV,YAAM,IAAI,MAAOzB,EAAQ,qFAAqFqC,CAAC,CAAE;AAKlH,QAHAd,IAAMF,EAAK,eAAe,aAC1BV,IAAaU,EAAK,cAAc,UAE3BV,MAAe,UAAW;AAG9B,UADAqB,IAAI,CAAA,GACCM;AACJ,aAAML,IAAI,GAAGA,IAAIR,GAAKQ;AACrB,UAAAG,IAAMC,EAAGJ,CAAC,IAAKK,EAAGL,CAAC,IAAOJ,GACrBO,MAAM,KACVJ,EAAE,KAAMI,CAAC;AAAA;AAIX,aAAMH,IAAI,GAAGA,IAAIR,GAAKQ;AACrB,UAAKI,EAAGJ,CAAC,MAAO,KACfD,EAAE,KAAMK,EAAGJ,CAAC,IAAKJ,CAAE;AAItB,MAAAZ,IAAQoB,EAAE,SAASL,EAAE;AAAA,IACvB,WACEA,IAAI,IAAIlC,EAAc2B,CAAG,GACzBR,IAAQ,GACHqB;AACJ,WAAML,IAAI,GAAGA,IAAIR,GAAKQ;AACrB,QAAAD,EAAGC,CAAC,IAAOI,EAAGJ,CAAC,IAAKK,EAAGL,CAAC,IAAOJ,GAC1BG,EAAGC,CAAC,MAAO,MACfhB,KAAS;AAAA;AAIX,WAAMgB,IAAI,GAAGA,IAAIR,GAAKQ;AACrB,QAAAD,EAAGC,CAAC,IAAKI,EAAGJ,CAAC,IAAKJ,GACbG,EAAGC,CAAC,MAAO,MACfhB,KAAS;AAKb,QAAKA,MAAUQ;AACd,YAAM,IAAI,MAAO,iDAAiD;AAKnE,SAFAA,IAAMO,EAAE,QACRJ,IAAK,IAAI9B,EAAc2B,CAAG,GACpBQ,IAAI,GAAGA,IAAIR,GAAKQ;AACrB,MAAAL,EAAIK,CAAC,IAAKrC,EAAKoC,EAAGC,CAAC,CAAE;AAKtB,SAHAC,IAAIlD,EAAO4C,CAAE,GACbZ,IAAQ,GACRE,IAAQ,GACFe,IAAI,GAAGA,IAAIR,GAAKQ;AACrB,MAAKD,EAAGC,CAAC,IAAK,IACbjB,KAASkB,EAAGD,CAAC,IAEJD,EAAGC,CAAC,MAAO,MACpBf,KAASgB,EAAGD,CAAC;AAWf,QARApB,IAAUT,EAAQ8B,CAAC,EAAG,WAAWA,EAAE,QAC9BvB,MAAe,aACnBK,KAASE,IAAQ,IAElBiB,IAAInB,GACJc,IAAKL,KAAQA,IAAM,KAAQ,MAC3BM,IAAKN,KAAQA,IAAM,MAAY,IAAMA,IAAQ,IAExCd,MAAe,SAAU;AAE7B,WADAe,IAAM,CAAA,GACAO,IAAI,GAAGA,IAAIR,GAAKQ;AACrB,QAAKD,EAAGC,CAAC,MAAO,KACfP,EAAI,KAAMQ,EAAGD,EAAG;AAGlB,MAAAC,IAAIR,GACJI,KAAMb,KAAUA,IAAQ,KAAQ,MAChCc,KAAMd,KAAUA,IAAQ,MAAY,IAAMA,IAAU;AAAA,IACtD;AAGC,SAFAH,IAASxB,EAAU4C,CAAC,GACpBnB,IAAS,GACHkB,IAAI,GAAGA,IAAInB,EAAO,QAAQmB;AAC/B,MAAKnB,EAAQmB,CAAC,EAAI,CAAC,IAAK,MACvBG,IAAItB,EAAQmB,CAAC,EAAI,CAAC,GAClBlB,KAAUqB,KAAOA,IAAEA,IAAK;AAS1B,QANKrB,IAAS,MAEbgB,KAAM,MAAMhB,IAEbgB,IAAKrC,EAAMqC,IAAK,EAAI,GAGjBN,IAAM,MAAM,CAACJ,EAAK,SACpBJ,IAAQ,KACRJ,GACC;AAED,UADAmB,IAAI,GACCtB;AACJ,gBAASa,GAAG;AAAA,UACZ,KAAK;AACJ,YAAAS,IAAI,MAAMxC,EAAQ2C,IAAIL,CAAE;AACxB;AAAA,UACD,KAAK;AACJ,YAAAE,IAAI;AACJ;AAAA,UACD;AACC,YAAAA,IAAI;AACJ;AAAA,QACJ;AAGE,MAAAV,KAASa,IAAIL,IAAKE,KAAMD,GACnBR,MAAQ,cACZH,IAAO,KAAQ,IAAMZ,EAAOZ,EAAK0B,CAAI,MAC1BC,MAAQ,YACnBH,IAAO,IAAMZ,EAAOc,CAAI,IAExBF,IAAOZ,EAAOc,CAAI;AAAA,IAErB;AAEE,MAAAA,IAAOa,GACFZ,MAAQ,cACPD,IAASG,KAAQA,IAAI,KAAM,IAC/BL,IAAO,KAAQ,IAAIhC,EAAakC,IAAO,GAAGG,MAE1CL,IAAO,IAAMhC,EAAakC,GAAMG,CAAG,IAEzBF,MAAQ,YACnBH,IAAO,IAAMhC,EAAakC,IAAO,GAAGG,CAAG,IAEvCL,IAAOhC,EAAakC,GAAMG,CAAG;AAG/B,WAAAE,IAAM,CAAA,GACN/C,EAAa+C,GAAK,YAAYP,KAAQD,CAAK,GAC3CvC,EAAa+C,GAAK,SAASR,CAAK,GAChCvC,EAAa+C,GAAK,UAAUP,CAAI,GAChCxC,EAAa+C,GAAK,aAAaQ,CAAC,GAChCvD,EAAa+C,GAAK,aAAaE,CAAE,GACjCjD,EAAa+C,GAAK,eAAeJ,CAAG,GACpC3C,EAAa+C,GAAK,WAAcW,IAAM,WAAW,gBAAiB,4BAA4B,GAC9F1D,EAAa+C,GAAK,SAASrB,CAAK,GACzBqB;AAAA,EACR;AAKA,SAAAY,IAAiB9B;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/print.js

@@ -0,0 +1,72 @@
+import { __require as h } from "../../../../../@stdlib_assert-is-positive-integer@0.2.2/node_modules/@stdlib/assert-is-positive-integer/lib/index.js";
+import { __require as v } from "../../../../../@stdlib_assert-is-plain-object@0.2.2/node_modules/@stdlib/assert-is-plain-object/lib/index.js";
+import { __require as m } from "../../../../../@stdlib_assert-is-boolean@0.2.2/node_modules/@stdlib/assert-is-boolean/lib/index.js";
+import { __require as g } from "../../../../../@stdlib_assert-has-own-property@0.2.2/node_modules/@stdlib/assert-has-own-property/lib/index.js";
+import { __require as p } from "../../../../../@stdlib_math-base-special-roundn@0.2.2/node_modules/@stdlib/math-base-special-roundn/lib/index.js";
+import { __require as q } from "../../../../../@stdlib_string-format@0.2.2/node_modules/@stdlib/string-format/lib/index.js";
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2020 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, u;
+function y() {
+  if (u) return n;
+  u = 1;
+  var l = h(), f = v(), d = m().isPrimitive, s = g(), o = p(), t = q();
+  function c(e) {
+    var a, r, i;
+    if (r = 4, a = !0, arguments.length > 0) {
+      if (!f(e))
+        throw new TypeError(t("invalid argument. First argument must be an object. Value: `%s`.", e));
+      if (s(e, "digits")) {
+        if (!l(e.digits))
+          throw new TypeError(t("invalid option. `%s` option must be a positive integer. Option: `%s`.", "digits", e.digits));
+        r = e.digits;
+      }
+      if (s(e, "decision")) {
+        if (!d(e.decision))
+          throw new TypeError(t("invalid option. `%s` option must be a boolean. Option: `%s`.", "decision", e.decision));
+        a = e.decision;
+      }
+    }
+    switch (i = "", i += this.method, i += `
+
+`, i += "Alternative hypothesis: ", this.method === "Paired Wilcoxon signed rank test" ? i += "Median of the difference `x - y` is " : i += "Median of `x` is ", this.alternative) {
+      case "less":
+        i += "less than ";
+        break;
+      case "greater":
+        i += "greater than ";
+        break;
+      case "two-sided":
+      default:
+        i += "not equal to ";
+        break;
+    }
+    return i += this.nullValue, i += `
+
+`, i += "    pValue: " + o(this.pValue, -r) + `
+`, i += "    statistic: " + o(this.statistic, -r) + `
+`, i += `
+`, a && (i += "Test Decision: ", this.rejected ? i += "Reject null in favor of alternative at " + this.alpha * 100 + "% significance level" : i += "Fail to reject null in favor of alternative at " + this.alpha * 100 + "% significance level", i += `
+`), i;
+  }
+  return n = c, n;
+}
+export {
+  y as __require
+};
+//# sourceMappingURL=print.js.map

package/dist/node_modules/.pnpm/@stdlib_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/print.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"print.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/print.js"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 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 isPositiveInteger = require( '@stdlib/assert-is-positive-integer' );\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar roundn = require( '@stdlib/math-base-special-roundn' );\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Pretty-print output of test.\n*\n* @param {Object} [opts] - options object\n* @param {PositiveInteger} [opts.digits=4] - number of digits after the decimal point\n* @param {boolean} [opts.decision=true] - boolean indicating whether to print the test decision\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {string} formatted output\n*/\nfunction print( opts ) { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar decision;\n\tvar dgts;\n\tvar str;\n\n\tdgts = 4;\n\tdecision = true;\n\tif ( arguments.length > 0 ) {\n\t\tif ( !isObject( opts ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an object. Value: `%s`.', opts ) );\n\t\t}\n\t\tif ( hasOwnProp( opts, 'digits' ) ) {\n\t\t\tif ( !isPositiveInteger( opts.digits ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a positive integer. Option: `%s`.', 'digits', opts.digits ) );\n\t\t\t}\n\t\t\tdgts = opts.digits;\n\t\t}\n\t\tif ( hasOwnProp( opts, 'decision' ) ) {\n\t\t\tif ( !isBoolean( opts.decision ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'decision', opts.decision ) );\n\t\t\t}\n\t\t\tdecision = opts.decision;\n\t\t}\n\t}\n\tstr = '';\n\tstr += this.method;\n\tstr += '\\n\\n';\n\tstr += 'Alternative hypothesis: ';\n\tif ( this.method === 'Paired Wilcoxon signed rank test' ) {\n\t\tstr += 'Median of the difference `x - y` is ';\n\t} else {\n\t\tstr += 'Median of `x` is ';\n\t}\n\tswitch ( this.alternative ) {\n\tcase 'less':\n\t\tstr += 'less than ';\n\t\tbreak;\n\tcase 'greater':\n\t\tstr += 'greater than ';\n\t\tbreak;\n\tcase 'two-sided':\n\tdefault:\n\t\tstr += 'not equal to ';\n\t\tbreak;\n\t}\n\tstr += this.nullValue;\n\tstr += '\\n\\n';\n\tstr += '    pValue: ' + roundn( this.pValue, -dgts ) + '\\n';\n\tstr += '    statistic: ' + roundn( this.statistic, -dgts ) + '\\n';\n\tstr += '\\n';\n\tif ( decision ) {\n\t\tstr += 'Test Decision: ';\n\t\tif ( this.rejected ) {\n\t\t\tstr += 'Reject null in favor of alternative at ' + (this.alpha*100) + '% significance level';\n\t\t} else {\n\t\t\tstr += 'Fail to reject null in favor of alternative at ' + (this.alpha*100) + '% significance level';\n\t\t}\n\t\tstr += '\\n';\n\t}\n\treturn str;\n}\n\n\n// EXPORTS //\n\nmodule.exports = print;\n"],"names":["isPositiveInteger","require$$0","isObject","require$$1","isBoolean","require$$2","hasOwnProp","require$$3","roundn","require$$4","format","require$$5","print","opts","decision","dgts","str","print_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAIA,IAAoBC,EAAA,GACpBC,IAAWC,EAAA,GACXC,IAAYC,EAAA,EAAuC,aACnDC,IAAaC,EAAA,GACbC,IAASC,EAAA,GACTC,IAASC,EAAA;AAeb,WAASC,EAAOC,GAAO;AAEtB,QAAIC,GACAC,GACAC;AAIJ,QAFAD,IAAO,GACPD,IAAW,IACN,UAAU,SAAS,GAAI;AAC3B,UAAK,CAACZ,EAAUW;AACf,cAAM,IAAI,UAAWH,EAAQ,oEAAoEG,CAAI,CAAE;AAExG,UAAKP,EAAYO,GAAM,WAAa;AACnC,YAAK,CAACb,EAAmBa,EAAK;AAC7B,gBAAM,IAAI,UAAWH,EAAQ,yEAAyE,UAAUG,EAAK,OAAQ;AAE9H,QAAAE,IAAOF,EAAK;AAAA,MACf;AACE,UAAKP,EAAYO,GAAM,aAAe;AACrC,YAAK,CAACT,EAAWS,EAAK;AACrB,gBAAM,IAAI,UAAWH,EAAQ,gEAAgE,YAAYG,EAAK,SAAU;AAEzH,QAAAC,IAAWD,EAAK;AAAA,MACnB;AAAA,IACA;AAUC,YATAG,IAAM,IACNA,KAAO,KAAK,QACZA,KAAO;AAAA;AAAA,GACPA,KAAO,4BACF,KAAK,WAAW,qCACpBA,KAAO,yCAEPA,KAAO,qBAEC,KAAK,aAAW;AAAA,MACzB,KAAK;AACJ,QAAAA,KAAO;AACP;AAAA,MACD,KAAK;AACJ,QAAAA,KAAO;AACP;AAAA,MACD,KAAK;AAAA,MACL;AACC,QAAAA,KAAO;AACP;AAAA,IACF;AACC,WAAAA,KAAO,KAAK,WACZA,KAAO;AAAA;AAAA,GACPA,KAAO,iBAAiBR,EAAQ,KAAK,QAAQ,CAACO,CAAI,IAAK;AAAA,GACvDC,KAAO,oBAAoBR,EAAQ,KAAK,WAAW,CAACO,CAAI,IAAK;AAAA,GAC7DC,KAAO;AAAA,GACFF,MACJE,KAAO,mBACF,KAAK,WACTA,KAAO,4CAA6C,KAAK,QAAM,MAAO,yBAEtEA,KAAO,oDAAqD,KAAK,QAAM,MAAO,wBAE/EA,KAAO;AAAA,IAEDA;AAAA,EACR;AAKA,SAAAC,IAAiBL;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@stdlib_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/unique.js

@@ -0,0 +1,19 @@
+var q, v;
+function r() {
+  if (v) return q;
+  v = 1;
+  function f(e, u) {
+    return e - u;
+  }
+  function o(e) {
+    var u, t, i, n;
+    for (e = e.slice(), e.sort(f), u = e.length, i = 1, n = 0; i < u; i++)
+      t = e[i], e[n] !== t && (n += 1, e[n] = t);
+    return e.length = n + 1, e;
+  }
+  return q = o, q;
+}
+export {
+  r as __require
+};
+//# sourceMappingURL=unique.js.map

package/dist/node_modules/.pnpm/@stdlib_stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/unique.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique.js","sources":["../../../../../../../../../../node_modules/.pnpm/@stdlib+stats-wilcoxon@0.2.2/node_modules/@stdlib/stats-wilcoxon/lib/unique.js"],"sourcesContent":["\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2020 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// FUNCTIONS //\n\n/**\n* Comparator function to sort values in ascending order.\n*\n* @private\n* @param {number} a - first value\n* @param {number} b - second value\n* @returns {number} difference between `a` and `b`\n*/\nfunction ascending( a, b ) {\n\treturn a - b;\n}\n\n\n// MAIN //\n\n/**\n* Removes duplicate values from a numeric array.\n*\n* @private\n* @param {NumberArray} arr - array to be deduped\n* @returns {NumberArray} deduped array\n*/\nfunction unique( arr ) {\n\tvar len;\n\tvar val;\n\tvar i;\n\tvar j;\n\n\tarr = arr.slice();\n\tarr.sort( ascending );\n\tlen = arr.length;\n\n\t// Loop through the array, only incrementing a pointer when successive values are different. When a succeeding value is different, move the pointer and set the next value. In the trivial case where all array elements are unique, we incur a slight penalty in resetting the element value for each unique value. In other cases, we simply move a unique value to a new position in the array. The end result is a sorted array with unique values.\n\tfor ( i = 1, j = 0; i < len; i++ ) {\n\t\tval = arr[ i ];\n\t\tif ( arr[ j ] !== val ) {\n\t\t\tj += 1;\n\t\t\tarr[ j ] = val;\n\t\t}\n\t}\n\t// Truncate the array:\n\tarr.length = j + 1;\n\treturn arr;\n}\n\n\n// EXPORTS //\n\nmodule.exports = unique;\n"],"names":["ascending","a","b","unique","arr","len","val","j","unique_1"],"mappings":";;;;AA+BA,WAASA,EAAWC,GAAGC,GAAI;AAC1B,WAAOD,IAAIC;AAAA,EACZ;AAYA,WAASC,EAAQC,GAAM;AACtB,QAAIC,GACAC,GACA,GACAC;AAOJ,SALAH,IAAMA,EAAI,MAAK,GACfA,EAAI,KAAMJ,CAAS,GACnBK,IAAMD,EAAI,QAGJ,IAAI,GAAGG,IAAI,GAAG,IAAIF,GAAK;AAC5B,MAAAC,IAAMF,EAAK,CAAC,GACPA,EAAKG,CAAC,MAAOD,MACjBC,KAAK,GACLH,EAAKG,CAAC,IAAKD;AAIb,WAAAF,EAAI,SAASG,IAAI,GACVH;AAAA,EACR;AAKA,SAAAI,IAAiBL;;","x_google_ignoreList":[0]}