@stdlib/stats-wilcoxon 0.2.2 → 0.2.3

package/NOTICE

@@ -1 +1 @@
-Copyright (c) 2016-2024 The Stdlib Authors.
+Copyright (c) 2016-2026 The Stdlib Authors.

package/README.md

@@ -209,7 +209,7 @@ table = out.print();
 */
 ```
 
-By default, all zero-differences are discarded before calculating the ranks. Set `zeroMethod` to `pratt` when you wish differences of zero to be used in the rank calculation but then drop them or to `zsplit` when differences of zero are shall be used in the ranking procedure and the ranks then split between positive and negative ones. 
+By default, all zero-differences are discarded before calculating the ranks. Set `zeroMethod` to `pratt` when you wish differences of zero to be used in the rank calculation but then drop them or to `zsplit` when differences of zero are shall be used in the ranking procedure and the ranks then split between positive and negative ones.
 
 ```javascript
 var arr = [ 0, 2, 3, -1, -4, 0, 0, 8, 9 ];
@@ -243,21 +243,14 @@ out = wilcoxon( arr, {
 By default, the test uses the exact distribution of the rank statistic to calculate the critical values for the test in case of no ties and no zero-differences. Since it is more computationally efficient, starting with fifty observations a normal approximation is employed. If you would like the test to use the correct distribution even for larger samples, set the `exact` option to `true`.
 
 ```javascript
-var normal = require( '@stdlib/random-base-normal' ).factory;
-var rnorm;
-var arr;
-var out;
-var i;
+var normal = require( '@stdlib/random-array-normal' );
 
-rnorm = normal( 0.0, 4.0, {
+var rnorm = normal.factory( 0.0, 4.0, {
     'seed': 100
 });
-arr = new Array( 100 );
-for ( i = 0; i < arr.length; i++ ) {
-    arr[ i ] = rnorm();
-}
+var arr = rnorm( 100 );
 
-out = wilcoxon( arr, {
+var out = wilcoxon( arr, {
     'exact': false
 });
 /* e.g., returns
@@ -287,21 +280,14 @@ out = wilcoxon( arr, {
 By default, when using the normal approximation, the test uses a continuity correction, which adjusts the Wilcoxon rank statistic by `0.5` towards the mean. To disable this correction, set `correction` to `false`.
 
 ```javascript
-var normal = require( '@stdlib/random-base-normal' ).factory;
-var rnorm;
-var arr;
-var out;
-var i;
+var normal = require( '@stdlib/random-array-normal' );
 
-rnorm = normal( 0.0, 4.0, {
+var rnorm = normal.factory( 0.0, 4.0, {
     'seed': 100
 });
-arr = new Array( 100 );
-for ( i = 0; i < arr.length; i++ ) {
-    arr[ i ] = rnorm();
-}
+var arr = rnorm( 100 );
 
-out = wilcoxon( arr, {
+var out = wilcoxon( arr, {
     'correction': false
 });
 /* e.g., returns
@@ -339,26 +325,17 @@ out = wilcoxon( arr, {
 <!-- eslint no-undef: "error" -->
 
 ```javascript
-var uniform = require( '@stdlib/random-base-discrete-uniform' ).factory;
+var uniform = require( '@stdlib/random-array-discrete-uniform' );
 var wilcoxon = require( '@stdlib/stats-wilcoxon' );
 
-var table;
-var runif;
-var arr;
-var out;
-var i;
-
-runif = uniform( -50.0, 50.0, {
+var runif = uniform.factory( -50.0, 50.0, {
     'seed': 37827
 });
-arr = new Array( 100 );
-for ( i = 0; i < arr.length; i++ ) {
-    arr[ i ] = runif();
-}
+var arr = runif( 100 );
 
 // Test whether distribution is symmetric around zero:
-out = wilcoxon( arr );
-table = out.print();
+var out = wilcoxon( arr );
+var table = out.print();
 /* e.g., returns
     One-Sample Wilcoxon signed rank test
 
@@ -432,7 +409,7 @@ See [LICENSE][stdlib-license].
 
 ## Copyright
 
-Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
+Copyright &copy; 2016-2026. The Stdlib [Authors][stdlib-authors].
 
 </section>
 
@@ -445,8 +422,8 @@ Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/stats-wilcoxon.svg
 [npm-url]: https://npmjs.org/package/@stdlib/stats-wilcoxon
 
-[test-image]: https://github.com/stdlib-js/stats-wilcoxon/actions/workflows/test.yml/badge.svg?branch=v0.2.2
-[test-url]: https://github.com/stdlib-js/stats-wilcoxon/actions/workflows/test.yml?query=branch:v0.2.2
+[test-image]: https://github.com/stdlib-js/stats-wilcoxon/actions/workflows/test.yml/badge.svg?branch=v0.2.3
+[test-url]: https://github.com/stdlib-js/stats-wilcoxon/actions/workflows/test.yml?query=branch:v0.2.3
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/stats-wilcoxon/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/stats-wilcoxon?branch=main
@@ -458,8 +435,8 @@ Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
 
 -->
 
-[chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg
-[chat-url]: https://app.gitter.im/#/room/#stdlib-js_stdlib:gitter.im
+[chat-image]: https://img.shields.io/badge/zulip-join_chat-brightgreen.svg
+[chat-url]: https://stdlib.zulipchat.com
 
 [stdlib]: https://github.com/stdlib-js/stdlib
 

package/dist/index.js

@@ -1,4 +1,4 @@
-"use strict";var V=function(e,i){return function(){return i||e((i={exports:{}}).exports,i),i.exports}};var H=V(function(Oe,W){"use strict";var N=require("@stdlib/assert-contains"),_=require("@stdlib/assert-is-boolean").isPrimitive,B=require("@stdlib/assert-is-number").isPrimitive,te=require("@stdlib/assert-is-plain-object"),C=require("@stdlib/assert-is-string").isPrimitive,j=require("@stdlib/assert-is-nan"),E=require("@stdlib/assert-has-own-property"),d=require("@stdlib/string-format"),I=["two-sided","less","greater"],U=["pratt","wilcox","zsplit"];function ne(e,i){if(!te(i))return new TypeError(d("invalid argument. Options argument must be an object. Value: `%s`.",i));if(E(i,"alpha")){if(e.alpha=i.alpha,!B(e.alpha)||j(e.alpha))return new TypeError(d("invalid option. `%s` option must be a number. Option: `%s`.","alpha",e.alpha));if(e.alpha<0||e.alpha>1)return new RangeError(d("invalid option. `%s` option must be a number on the interval: [0, 1]. Option: `%f`.","alpha",e.alpha))}if(E(i,"alternative")){if(e.alternative=i.alternative,!C(e.alternative))return new TypeError(d("invalid option. `%s` option must be a string. Option: `%s`.","alternative",e.alternative));if(!N(I,e.alternative))return new Error(d('invalid option. `%s` option must be one of the following: "%s". Option: `%s`.',"alternative",I.join('", "'),e.alternative))}if(E(i,"correction")&&(e.correction=i.correction,!_(e.correction)||j(e.correction)))return new TypeError(d("invalid option. `%s` option must be a boolean. Option: `%s`.","correction",e.alpha));if(E(i,"exact")&&(e.exact=i.exact,!_(e.exact)||j(e.exact)))return new TypeError(d("invalid option. `%s` option must be a boolean. Option: `%s`.","exact",e.alpha));if(E(i,"mu")&&(e.mu=i.mu,!B(e.mu)||j(e.mu)))return new TypeError(d("invalid option. `%s` option must be a number. Option: `%s`.","mu",e.mu));if(E(i,"zeroMethod")){if(e.zeroMethod=i.zeroMethod,!C(e.zeroMethod))return new TypeError(d("invalid option. `%s` option must be a string. Option: `%s`.","zeroMethod",e.alternative));if(!N(U,e.zeroMethod))return new Error(d('invalid option. `%s` option must be one of the following: "%s". Option: `%s`.',"zeroMethod",U.join('", "'),e.zeroMethod))}return null}W.exports=ne});var G=V(function(Te,Z){"use strict";function oe(e,i){return e-i}function se(e){var i,o,a,u;for(e=e.slice(),e.sort(oe),i=e.length,a=1,u=0;a<i;a++)o=e[a],e[u]!==o&&(u+=1,e[u]=o);return e.length=u+1,e}Z.exports=se});var X=V(function(ze,Q){"use strict";var le=require("@stdlib/assert-is-positive-integer"),ue=require("@stdlib/assert-is-plain-object"),ve=require("@stdlib/assert-is-boolean").isPrimitive,J=require("@stdlib/assert-has-own-property"),K=require("@stdlib/math-base-special-roundn"),D=require("@stdlib/string-format");function fe(e){var i,o,a;if(o=4,i=!0,arguments.length>0){if(!ue(e))throw new TypeError(D("invalid argument. First argument must be an object. Value: `%s`.",e));if(J(e,"digits")){if(!le(e.digits))throw new TypeError(D("invalid option. `%s` option must be a positive integer. Option: `%s`.","digits",e.digits));o=e.digits}if(J(e,"decision")){if(!ve(e.decision))throw new TypeError(D("invalid option. `%s` option must be a boolean. Option: `%s`.","decision",e.decision));i=e.decision}}switch(a="",a+=this.method,a+="\n\n",a+="Alternative hypothesis: ",this.method==="Paired Wilcoxon signed rank test"?a+="Median of the difference `x - y` is ":a+="Median of `x` is ",this.alternative){case"less":a+="less than ";break;case"greater":a+="greater than ";break;case"two-sided":default:a+="not equal to ";break}return a+=this.nullValue,a+="\n\n",a+="    pValue: "+K(this.pValue,-o)+"\n",a+="    statistic: "+K(this.statistic,-o)+"\n",a+="\n",i&&(a+="Test Decision: ",this.rejected?a+="Reject null in favor of alternative at "+this.alpha*100+"% significance level":a+="Fail to reject null in favor of alternative at "+this.alpha*100+"% significance level",a+="\n"),a}Q.exports=fe});var ae=V(function(Me,ie){"use strict";var Y=require("@stdlib/assert-is-number-array").primitives,$=require("@stdlib/assert-is-typed-array-like"),p=require("@stdlib/utils-define-read-only-property"),ce=require("@stdlib/assert-is-plain-object"),he=require("@stdlib/stats-ranks"),de=require("@stdlib/stats-base-dists-normal-cdf").factory,k=require("@stdlib/stats-base-dists-signrank-cdf"),me=require("@stdlib/utils-tabulate"),ge=require("@stdlib/math-base-special-signum"),pe=require("@stdlib/math-base-special-sqrt"),ee=require("@stdlib/math-base-special-abs"),re=require("@stdlib/array-float64"),L=require("@stdlib/string-format"),we=H(),be=G(),qe=X(),S=de(0,1);function ye(){var e,i,o,a,u,O,T,l,P,z,m,v,f,w,A,t,F,c,R,q,M,y,n,r,g,x,b,s,h;if(s=arguments[0],!$(s)&&!Y(s))throw new TypeError(L("invalid argument. First argument must be a numeric array. Value: `%s`.",s));if(t=s.length,arguments.length>1)if(ce(arguments[1]))o=arguments[1];else{if(h=arguments[1],!$(h)&&!Y(h))throw new TypeError(L("invalid argument. `%s` argument must be a numeric array. Value: `%s`.","y",h));if(t!==h.length)throw new Error("invalid arguments. First and second arguments must have the same length.");arguments.length>2&&(o=arguments[2])}if(v={},o&&(A=we(v,o),A))throw A;if(q=v.mu||0,v.correction===void 0?e=!0:e=v.correction,v.alpha===void 0?z=.05:z=v.alpha,t<2)throw new Error(L("invalid argument. First argument must contain at least two elements. Value: `%s`.",s));if(w=v.alternative||"two-sided",i=v.zeroMethod||"wilcox",i==="wilcox"){if(n=[],h)for(r=0;r<t;r++)b=s[r]-h[r]-q,b!==0&&n.push(b);else for(r=0;r<t;r++)s[r]!==0&&n.push(s[r]-q);l=s.length-n.length}else if(n=new re(t),l=0,h)for(r=0;r<t;r++)n[r]=s[r]-h[r]-q,n[r]===0&&(l+=1);else for(r=0;r<t;r++)n[r]=s[r]-q,n[r]===0&&(l+=1);if(l===t)throw new Error("`x` or `x - y` cannot be zero for all elements.");for(t=n.length,R=new re(t),r=0;r<t;r++)R[r]=ee(n[r]);for(g=he(R),T=0,P=0,r=0;r<t;r++)n[r]>0?T+=g[r]:n[r]===0&&(P+=g[r]);if(a=be(g).length!==g.length,i==="zsplit"&&(T+=P/2),x=T,M=t*(t+1)*.25,y=t*(t+1)*(2*t+1),i==="pratt"){for(F=[],r=0;r<t;r++)n[r]!==0&&F.push(g[r]);g=F,M-=l*(l+1)*.25,y-=l*(l+1)*(2*l+1)}for(u=me(g),O=0,r=0;r<u.length;r++)u[r][1]>1&&(b=u[r][1],O+=b*(b*b-1));if(O>0&&(y-=.5*O),y=pe(y/24),t>50&&!v.exact||l>0||a){if(n=0,e)switch(w){case"two-sided":n=.5*ge(x-M);break;case"less":n=-.5;break;default:n=.5;break}f=(x-M-n)/y,w==="two-sided"?m=2*(1-S(ee(f))):w==="greater"?m=1-S(f):m=S(f)}else f=x,w==="two-sided"?f>t*(t+1)/4?m=2*(1-k(f-1,t)):m=2*k(f,t):w==="greater"?m=1-k(f-1,t):m=k(f,t);return c={},p(c,"rejected",m<=z),p(c,"alpha",z),p(c,"pValue",m),p(c,"statistic",x),p(c,"nullValue",q),p(c,"alternative",w),p(c,"method",(h?"Paired":"One-Sample")+" Wilcoxon signed rank test"),p(c,"print",qe),c}ie.exports=ye});var Ee=ae();module.exports=Ee;
+"use strict";var V=function(e,i){return function(){return i||e((i={exports:{}}).exports,i),i.exports}};var Z=V(function(ze,W){"use strict";var C=require("@stdlib/array-base-assert-contains").factory,N=require("@stdlib/assert-is-boolean").isPrimitive,_=require("@stdlib/assert-is-number").isPrimitive,te=require("@stdlib/assert-is-plain-object"),B=require("@stdlib/assert-is-string").isPrimitive,j=require("@stdlib/assert-is-nan"),E=require("@stdlib/assert-has-own-property"),d=require("@stdlib/string-format"),I=["two-sided","less","greater"],U=["pratt","wilcox","zsplit"],ne=C(I),oe=C(U);function se(e,i){if(!te(i))return new TypeError(d("invalid argument. Options argument must be an object. Value: `%s`.",i));if(E(i,"alpha")){if(e.alpha=i.alpha,!_(e.alpha)||j(e.alpha))return new TypeError(d("invalid option. `%s` option must be a number. Option: `%s`.","alpha",e.alpha));if(e.alpha<0||e.alpha>1)return new RangeError(d("invalid option. `%s` option must be a number on the interval: [0, 1]. Option: `%f`.","alpha",e.alpha))}if(E(i,"alternative")){if(e.alternative=i.alternative,!B(e.alternative))return new TypeError(d("invalid option. `%s` option must be a string. Option: `%s`.","alternative",e.alternative));if(!ne(e.alternative))return new Error(d('invalid option. `%s` option must be one of the following: "%s". Option: `%s`.',"alternative",I.join('", "'),e.alternative))}if(E(i,"correction")&&(e.correction=i.correction,!N(e.correction)||j(e.correction)))return new TypeError(d("invalid option. `%s` option must be a boolean. Option: `%s`.","correction",e.alpha));if(E(i,"exact")&&(e.exact=i.exact,!N(e.exact)||j(e.exact)))return new TypeError(d("invalid option. `%s` option must be a boolean. Option: `%s`.","exact",e.alpha));if(E(i,"mu")&&(e.mu=i.mu,!_(e.mu)||j(e.mu)))return new TypeError(d("invalid option. `%s` option must be a number. Option: `%s`.","mu",e.mu));if(E(i,"zeroMethod")){if(e.zeroMethod=i.zeroMethod,!B(e.zeroMethod))return new TypeError(d("invalid option. `%s` option must be a string. Option: `%s`.","zeroMethod",e.alternative));if(!oe(e.zeroMethod))return new Error(d('invalid option. `%s` option must be one of the following: "%s". Option: `%s`.',"zeroMethod",U.join('", "'),e.zeroMethod))}return null}W.exports=se});var G=V(function(Me,H){"use strict";function le(e,i){return e-i}function ue(e){var i,o,a,u;for(e=e.slice(),e.sort(le),i=e.length,a=1,u=0;a<i;a++)o=e[a],e[u]!==o&&(u+=1,e[u]=o);return e.length=u+1,e}H.exports=ue});var X=V(function(Ve,Q){"use strict";var ve=require("@stdlib/assert-is-positive-integer"),fe=require("@stdlib/assert-is-plain-object"),ce=require("@stdlib/assert-is-boolean").isPrimitive,J=require("@stdlib/assert-has-own-property"),K=require("@stdlib/math-base-special-roundn"),D=require("@stdlib/string-format");function he(e){var i,o,a;if(o=4,i=!0,arguments.length>0){if(!fe(e))throw new TypeError(D("invalid argument. First argument must be an object. Value: `%s`.",e));if(J(e,"digits")){if(!ve(e.digits))throw new TypeError(D("invalid option. `%s` option must be a positive integer. Option: `%s`.","digits",e.digits));o=e.digits}if(J(e,"decision")){if(!ce(e.decision))throw new TypeError(D("invalid option. `%s` option must be a boolean. Option: `%s`.","decision",e.decision));i=e.decision}}switch(a="",a+=this.method,a+="\n\n",a+="Alternative hypothesis: ",this.method==="Paired Wilcoxon signed rank test"?a+="Median of the difference `x - y` is ":a+="Median of `x` is ",this.alternative){case"less":a+="less than ";break;case"greater":a+="greater than ";break;default:a+="not equal to ";break}return a+=this.nullValue,a+="\n\n",a+="    pValue: "+K(this.pValue,-o)+"\n",a+="    statistic: "+K(this.statistic,-o)+"\n",a+="\n",i&&(a+="Test Decision: ",this.rejected?a+="Reject null in favor of alternative at "+this.alpha*100+"% significance level":a+="Fail to reject null in favor of alternative at "+this.alpha*100+"% significance level",a+="\n"),a}Q.exports=he});var ae=V(function(je,ie){"use strict";var Y=require("@stdlib/assert-is-number-array").primitives,$=require("@stdlib/assert-is-typed-array-like"),p=require("@stdlib/utils-define-read-only-property"),de=require("@stdlib/assert-is-plain-object"),me=require("@stdlib/stats-ranks"),ge=require("@stdlib/stats-base-dists-normal-cdf").factory,k=require("@stdlib/stats-base-dists-signrank-cdf"),pe=require("@stdlib/utils-tabulate"),we=require("@stdlib/math-base-special-signum"),be=require("@stdlib/math-base-special-sqrt"),ee=require("@stdlib/math-base-special-abs"),re=require("@stdlib/array-float64"),L=require("@stdlib/string-format"),qe=Z(),ye=G(),Ee=X(),S=ge(0,1);function xe(){var e,i,o,a,u,O,T,l,A,z,m,v,f,w,P,t,F,c,R,q,M,y,n,r,g,x,b,s,h;if(s=arguments[0],!$(s)&&!Y(s))throw new TypeError(L("invalid argument. First argument must be a numeric array. Value: `%s`.",s));if(t=s.length,arguments.length>1)if(de(arguments[1]))o=arguments[1];else{if(h=arguments[1],!$(h)&&!Y(h))throw new TypeError(L("invalid argument. `%s` argument must be a numeric array. Value: `%s`.","y",h));if(t!==h.length)throw new Error("invalid arguments. First and second arguments must have the same length.");arguments.length>2&&(o=arguments[2])}if(v={},o&&(P=qe(v,o),P))throw P;if(q=v.mu||0,v.correction===void 0?e=!0:e=v.correction,v.alpha===void 0?z=.05:z=v.alpha,t<2)throw new Error(L("invalid argument. First argument must contain at least two elements. Value: `%s`.",s));if(w=v.alternative||"two-sided",i=v.zeroMethod||"wilcox",i==="wilcox"){if(n=[],h)for(r=0;r<t;r++)b=s[r]-h[r]-q,b!==0&&n.push(b);else for(r=0;r<t;r++)s[r]!==0&&n.push(s[r]-q);l=s.length-n.length}else if(n=new re(t),l=0,h)for(r=0;r<t;r++)n[r]=s[r]-h[r]-q,n[r]===0&&(l+=1);else for(r=0;r<t;r++)n[r]=s[r]-q,n[r]===0&&(l+=1);if(l===t)throw new Error("`x` or `x - y` cannot be zero for all elements.");for(t=n.length,R=new re(t),r=0;r<t;r++)R[r]=ee(n[r]);for(g=me(R),T=0,A=0,r=0;r<t;r++)n[r]>0?T+=g[r]:n[r]===0&&(A+=g[r]);if(a=ye(g).length!==g.length,i==="zsplit"&&(T+=A/2),x=T,M=t*(t+1)*.25,y=t*(t+1)*(2*t+1),i==="pratt"){for(F=[],r=0;r<t;r++)n[r]!==0&&F.push(g[r]);g=F,M-=l*(l+1)*.25,y-=l*(l+1)*(2*l+1)}for(u=pe(g),O=0,r=0;r<u.length;r++)u[r][1]>1&&(b=u[r][1],O+=b*(b*b-1));if(O>0&&(y-=.5*O),y=be(y/24),t>50&&!v.exact||l>0||a){if(n=0,e)switch(w){case"two-sided":n=.5*we(x-M);break;case"less":n=-.5;break;default:n=.5;break}f=(x-M-n)/y,w==="two-sided"?m=2*(1-S(ee(f))):w==="greater"?m=1-S(f):m=S(f)}else f=x,w==="two-sided"?f>t*(t+1)/4?m=2*(1-k(f-1,t)):m=2*k(f,t):w==="greater"?m=1-k(f-1,t):m=k(f,t);return c={},p(c,"rejected",m<=z),p(c,"alpha",z),p(c,"pValue",m),p(c,"statistic",x),p(c,"nullValue",q),p(c,"alternative",w),p(c,"method",(h?"Paired":"One-Sample")+" Wilcoxon signed rank test"),p(c,"print",Ee),c}ie.exports=xe});var Oe=ae();module.exports=Oe;
 /**
 * @license Apache-2.0
 *

package/dist/index.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../lib/validate.js", "../lib/unique.js", "../lib/print.js", "../lib/main.js", "../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// MODULES //\n\nvar contains = require( '@stdlib/assert-contains' );\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\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/assert-is-nan' );\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar format = require( '@stdlib/string-format' );\n\n\n// VARIABLES //\n\nvar ALTERNATIVE_VALUES = [ 'two-sided', 'less', 'greater' ];\nvar ZERO_METHOD_VALUES = [ 'pratt', 'wilcox', 'zsplit' ];\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination for validated options\n* @param {Options} options - function options\n* @param {number} [options.alpha] - significance level\n* @param {string} [options.alternative] - alternative hypothesis (`two-sided`, `less` or `greater`)\n* @param {boolean} [options.exact] - whether to force using the exact distribution instead of a normal approximation when there are more than fifty data points\n* @param {boolean} [options.correction] - continuity correction adjusting the Wilcoxon rank statistic by 0.5 towards the mean\n* @param {string} [options.zeroMethod] - method governing how zero-differences are handled (`pratt`, `wilcox` or `zsplit`)\n* @param {number} [options.mu] - mean under H0\n* @returns {(null|Error)} null or an error\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_VALUES, opts.alternative ) ) {\n\t\t\treturn new Error( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'alternative', ALTERNATIVE_VALUES.join( '\", \"' ), opts.alternative ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'correction' ) ) {\n\t\topts.correction = options.correction;\n\t\tif ( !isBoolean( opts.correction ) || isnan( opts.correction ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'correction', opts.alpha ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'exact' ) ) {\n\t\topts.exact = options.exact;\n\t\tif (\n\t\t\t!isBoolean( opts.exact ) ||\n\t\t\tisnan( opts.exact )\n\t\t) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'exact', opts.alpha ) );\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\tif ( hasOwnProp( options, 'zeroMethod' ) ) {\n\t\topts.zeroMethod = options.zeroMethod;\n\t\tif ( !isString( opts.zeroMethod ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'zeroMethod', opts.alternative ) );\n\t\t}\n\t\tif ( !contains( ZERO_METHOD_VALUES, opts.zeroMethod ) ) {\n\t\t\treturn new Error( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'zeroMethod', ZERO_METHOD_VALUES.join( '\", \"' ), opts.zeroMethod ) );\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = validate;\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// 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", "/**\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", "/* 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", "/**\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"],
-  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAW,QAAS,yBAA0B,EAC9CC,EAAY,QAAS,2BAA4B,EAAE,YACnDC,EAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAW,QAAS,gCAAiC,EACrDC,EAAW,QAAS,0BAA2B,EAAE,YACjDC,EAAQ,QAAS,uBAAwB,EACzCC,EAAa,QAAS,iCAAkC,EACxDC,EAAS,QAAS,uBAAwB,EAK1CC,EAAqB,CAAE,YAAa,OAAQ,SAAU,EACtDC,EAAqB,CAAE,QAAS,SAAU,QAAS,EAmBvD,SAASC,GAAUC,EAAMC,EAAU,CAClC,GAAK,CAACT,GAAUS,CAAQ,EACvB,OAAO,IAAI,UAAWL,EAAQ,qEAAsEK,CAAQ,CAAE,EAE/G,GAAKN,EAAYM,EAAS,OAAQ,EAAI,CAErC,GADAD,EAAK,MAAQC,EAAQ,MAChB,CAACV,EAAUS,EAAK,KAAM,GAAKN,EAAOM,EAAK,KAAM,EACjD,OAAO,IAAI,UAAWJ,EAAQ,8DAA+D,QAASI,EAAK,KAAM,CAAE,EAEpH,GAAKA,EAAK,MAAQ,GAAOA,EAAK,MAAQ,EACrC,OAAO,IAAI,WAAYJ,EAAQ,sFAAuF,QAASI,EAAK,KAAM,CAAE,CAE9I,CACA,GAAKL,EAAYM,EAAS,aAAc,EAAI,CAE3C,GADAD,EAAK,YAAcC,EAAQ,YACtB,CAACR,EAAUO,EAAK,WAAY,EAChC,OAAO,IAAI,UAAWJ,EAAQ,8DAA+D,cAAeI,EAAK,WAAY,CAAE,EAEhI,GAAK,CAACX,EAAUQ,EAAoBG,EAAK,WAAY,EACpD,OAAO,IAAI,MAAOJ,EAAQ,gFAAiF,cAAeC,EAAmB,KAAM,MAAO,EAAGG,EAAK,WAAY,CAAE,CAElL,CACA,GAAKL,EAAYM,EAAS,YAAa,IACtCD,EAAK,WAAaC,EAAQ,WACrB,CAACX,EAAWU,EAAK,UAAW,GAAKN,EAAOM,EAAK,UAAW,GAC5D,OAAO,IAAI,UAAWJ,EAAQ,+DAAgE,aAAcI,EAAK,KAAM,CAAE,EAG3H,GAAKL,EAAYM,EAAS,OAAQ,IACjCD,EAAK,MAAQC,EAAQ,MAEpB,CAACX,EAAWU,EAAK,KAAM,GACvBN,EAAOM,EAAK,KAAM,GAElB,OAAO,IAAI,UAAWJ,EAAQ,+DAAgE,QAASI,EAAK,KAAM,CAAE,EAGtH,GAAKL,EAAYM,EAAS,IAAK,IAC9BD,EAAK,GAAKC,EAAQ,GACb,CAACV,EAAUS,EAAK,EAAG,GAAKN,EAAOM,EAAK,EAAG,GAC3C,OAAO,IAAI,UAAWJ,EAAQ,8DAA+D,KAAMI,EAAK,EAAG,CAAE,EAG/G,GAAKL,EAAYM,EAAS,YAAa,EAAI,CAE1C,GADAD,EAAK,WAAaC,EAAQ,WACrB,CAACR,EAAUO,EAAK,UAAW,EAC/B,OAAO,IAAI,UAAWJ,EAAQ,8DAA+D,aAAcI,EAAK,WAAY,CAAE,EAE/H,GAAK,CAACX,EAAUS,EAAoBE,EAAK,UAAW,EACnD,OAAO,IAAI,MAAOJ,EAAQ,gFAAiF,aAAcE,EAAmB,KAAM,MAAO,EAAGE,EAAK,UAAW,CAAE,CAEhL,CACA,OAAO,IACR,CAKAZ,EAAO,QAAUW,KChHjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cA+BA,SAASC,GAAWC,EAAGC,EAAI,CAC1B,OAAOD,EAAIC,CACZ,CAYA,SAASC,GAAQC,EAAM,CACtB,IAAIC,EACAC,EACAC,EACAC,EAOJ,IALAJ,EAAMA,EAAI,MAAM,EAChBA,EAAI,KAAMJ,EAAU,EACpBK,EAAMD,EAAI,OAGJG,EAAI,EAAGC,EAAI,EAAGD,EAAIF,EAAKE,IAC5BD,EAAMF,EAAKG,CAAE,EACRH,EAAKI,CAAE,IAAMF,IACjBE,GAAK,EACLJ,EAAKI,CAAE,EAAIF,GAIb,OAAAF,EAAI,OAASI,EAAI,EACVJ,CACR,CAKAL,EAAO,QAAUI,KCvEjB,IAAAM,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,GAAoB,QAAS,oCAAqC,EAClEC,GAAW,QAAS,gCAAiC,EACrDC,GAAY,QAAS,2BAA4B,EAAE,YACnDC,EAAa,QAAS,iCAAkC,EACxDC,EAAS,QAAS,kCAAmC,EACrDC,EAAS,QAAS,uBAAwB,EAe9C,SAASC,GAAOC,EAAO,CAEtB,IAAIC,EACAC,EACAC,EAIJ,GAFAD,EAAO,EACPD,EAAW,GACN,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACP,GAAUM,CAAK,EACpB,MAAM,IAAI,UAAWF,EAAQ,mEAAoEE,CAAK,CAAE,EAEzG,GAAKJ,EAAYI,EAAM,QAAS,EAAI,CACnC,GAAK,CAACP,GAAmBO,EAAK,MAAO,EACpC,MAAM,IAAI,UAAWF,EAAQ,wEAAyE,SAAUE,EAAK,MAAO,CAAE,EAE/HE,EAAOF,EAAK,MACb,CACA,GAAKJ,EAAYI,EAAM,UAAW,EAAI,CACrC,GAAK,CAACL,GAAWK,EAAK,QAAS,EAC9B,MAAM,IAAI,UAAWF,EAAQ,+DAAgE,WAAYE,EAAK,QAAS,CAAE,EAE1HC,EAAWD,EAAK,QACjB,CACD,CAUA,OATAG,EAAM,GACNA,GAAO,KAAK,OACZA,GAAO,OACPA,GAAO,2BACF,KAAK,SAAW,mCACpBA,GAAO,uCAEPA,GAAO,oBAEC,KAAK,YAAc,CAC5B,IAAK,OACJA,GAAO,aACP,MACD,IAAK,UACJA,GAAO,gBACP,MACD,IAAK,YACL,QACCA,GAAO,gBACP,KACD,CACA,OAAAA,GAAO,KAAK,UACZA,GAAO,OACPA,GAAO,eAAiBN,EAAQ,KAAK,OAAQ,CAACK,CAAK,EAAI,KACvDC,GAAO,kBAAoBN,EAAQ,KAAK,UAAW,CAACK,CAAK,EAAI,KAC7DC,GAAO,KACFF,IACJE,GAAO,kBACF,KAAK,SACTA,GAAO,0CAA6C,KAAK,MAAM,IAAO,uBAEtEA,GAAO,kDAAqD,KAAK,MAAM,IAAO,uBAE/EA,GAAO,MAEDA,CACR,CAKAX,EAAO,QAAUO,KC5GjB,IAAAK,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,EAAgB,QAAS,gCAAiC,EAAE,WAC5DC,EAAmB,QAAS,oCAAqC,EACjEC,EAAc,QAAS,yCAA0C,EACjEC,GAAW,QAAS,gCAAiC,EACrDC,GAAQ,QAAS,qBAAsB,EACvCC,GAAY,QAAS,qCAAsC,EAAE,QAC7DC,EAAc,QAAS,uCAAwC,EAC/DC,GAAW,QAAS,wBAAyB,EAC7CC,GAAS,QAAS,kCAAmC,EACrDC,GAAO,QAAS,gCAAiC,EACjDC,GAAM,QAAS,+BAAgC,EAC/CC,GAAe,QAAS,uBAAwB,EAChDC,EAAS,QAAS,uBAAwB,EAC1CC,GAAW,IACXC,GAAS,IACTC,GAAQ,IAKRC,EAAQX,GAAW,EAAK,CAAI,EA2ChC,SAASY,IAAW,CACnB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAGJ,GADAD,EAAI,UAAW,CAAE,EACZ,CAAC5C,EAAkB4C,CAAE,GAAK,CAAC7C,EAAe6C,CAAE,EAChD,MAAM,IAAI,UAAWjC,EAAQ,yEAA0EiC,CAAE,CAAE,EAG5G,GADAZ,EAAMY,EAAE,OACH,UAAU,OAAS,EACvB,GAAK1C,GAAU,UAAW,CAAE,CAAE,EAC7BiB,EAAU,UAAW,CAAE,MACjB,CAEN,GADA0B,EAAI,UAAW,CAAE,EACZ,CAAC7C,EAAkB6C,CAAE,GAAK,CAAC9C,EAAe8C,CAAE,EAChD,MAAM,IAAI,UAAWlC,EAAQ,wEAAyE,IAAKkC,CAAE,CAAE,EAEhH,GAAKb,IAAQa,EAAE,OACd,MAAM,IAAI,MAAO,0EAA2E,EAExF,UAAU,OAAS,IACvB1B,EAAU,UAAW,CAAE,EAEzB,CAGD,GADAS,EAAO,CAAC,EACHT,IACJY,EAAMnB,GAAUgB,EAAMT,CAAQ,EACzBY,GACJ,MAAMA,EAcR,GAXAK,EAAKR,EAAK,IAAM,EACXA,EAAK,aAAe,OACxBX,EAAa,GAEbA,EAAaW,EAAK,WAEdA,EAAK,QAAU,OACnBF,EAAQ,IAERA,EAAQE,EAAK,MAETI,EAAM,EACV,MAAM,IAAI,MAAOrB,EAAQ,oFAAqFiC,CAAE,CAAE,EAKnH,GAHAd,EAAMF,EAAK,aAAe,YAC1BV,EAAaU,EAAK,YAAc,SAE3BV,IAAe,SAAW,CAG9B,GADAqB,EAAI,CAAC,EACAM,EACJ,IAAML,EAAI,EAAGA,EAAIR,EAAKQ,IACrBG,EAAMC,EAAGJ,CAAE,EAAIK,EAAGL,CAAE,EAAMJ,EACrBO,IAAM,GACVJ,EAAE,KAAMI,CAAE,MAIZ,KAAMH,EAAI,EAAGA,EAAIR,EAAKQ,IAChBI,EAAGJ,CAAE,IAAM,GACfD,EAAE,KAAMK,EAAGJ,CAAE,EAAIJ,CAAG,EAIvBZ,EAAQoB,EAAE,OAASL,EAAE,MACtB,SACCA,EAAI,IAAI7B,GAAcsB,CAAI,EAC1BR,EAAQ,EACHqB,EACJ,IAAML,EAAI,EAAGA,EAAIR,EAAKQ,IACrBD,EAAGC,CAAE,EAAMI,EAAGJ,CAAE,EAAIK,EAAGL,CAAE,EAAMJ,EAC1BG,EAAGC,CAAE,IAAM,IACfhB,GAAS,OAIX,KAAMgB,EAAI,EAAGA,EAAIR,EAAKQ,IACrBD,EAAGC,CAAE,EAAII,EAAGJ,CAAE,EAAIJ,EACbG,EAAGC,CAAE,IAAM,IACfhB,GAAS,GAKb,GAAKA,IAAUQ,EACd,MAAM,IAAI,MAAO,iDAAkD,EAKpE,IAFAA,EAAMO,EAAE,OACRJ,EAAK,IAAIzB,GAAcsB,CAAI,EACrBQ,EAAI,EAAGA,EAAIR,EAAKQ,IACrBL,EAAIK,CAAE,EAAI/B,GAAK8B,EAAGC,CAAE,CAAE,EAKvB,IAHAC,EAAItC,GAAOgC,CAAG,EACdZ,EAAQ,EACRE,EAAQ,EACFe,EAAI,EAAGA,EAAIR,EAAKQ,IAChBD,EAAGC,CAAE,EAAI,EACbjB,GAASkB,EAAGD,CAAE,EAELD,EAAGC,CAAE,IAAM,IACpBf,GAASgB,EAAGD,CAAE,GAWhB,GARApB,EAAUP,GAAQ4B,CAAE,EAAE,SAAWA,EAAE,OAC9BvB,IAAe,WACnBK,GAASE,EAAQ,GAElBiB,EAAInB,EACJc,EAAKL,GAAQA,EAAM,GAAQ,IAC3BM,EAAKN,GAAQA,EAAM,IAAY,EAAMA,EAAQ,GAExCd,IAAe,QAAU,CAE7B,IADAe,EAAM,CAAC,EACDO,EAAI,EAAGA,EAAIR,EAAKQ,IAChBD,EAAGC,CAAE,IAAM,GACfP,EAAI,KAAMQ,EAAGD,CAAE,CAAE,EAGnBC,EAAIR,EACJI,GAAMb,GAAUA,EAAQ,GAAQ,IAChCc,GAAMd,GAAUA,EAAQ,IAAY,EAAMA,EAAU,EACrD,CAGA,IAFAH,EAASf,GAAUmC,CAAE,EACrBnB,EAAS,EACHkB,EAAI,EAAGA,EAAInB,EAAO,OAAQmB,IAC1BnB,EAAQmB,CAAE,EAAG,CAAE,EAAI,IACvBG,EAAItB,EAAQmB,CAAE,EAAG,CAAE,EACnBlB,GAAUqB,GAAOA,EAAEA,EAAK,IAS1B,GANKrB,EAAS,IAEbgB,GAAM,GAAMhB,GAEbgB,EAAK9B,GAAM8B,EAAK,EAAK,EAGlBN,EAAM,IAAM,CAACJ,EAAK,OACpBJ,EAAQ,GACRJ,EACC,CAED,GADAmB,EAAI,EACCtB,EACJ,OAASa,EAAM,CACf,IAAK,YACJS,EAAI,GAAMhC,GAAQmC,EAAIL,CAAG,EACzB,MACD,IAAK,OACJE,EAAI,IACJ,MACD,QACCA,EAAI,GACJ,KACD,CAGDV,GAASa,EAAIL,EAAKE,GAAMD,EACnBR,IAAQ,YACZH,EAAO,GAAQ,EAAMZ,EAAON,GAAKoB,CAAK,CAAE,GAC7BC,IAAQ,UACnBH,EAAO,EAAMZ,EAAOc,CAAK,EAEzBF,EAAOZ,EAAOc,CAAK,CAErB,MAECA,EAAOa,EACFZ,IAAQ,YACPD,EAASG,GAAQA,EAAI,GAAM,EAC/BL,EAAO,GAAQ,EAAItB,EAAawB,EAAO,EAAGG,CAAI,GAE9CL,EAAO,EAAMtB,EAAawB,EAAMG,CAAI,EAE1BF,IAAQ,UACnBH,EAAO,EAAMtB,EAAawB,EAAO,EAAGG,CAAI,EAExCL,EAAOtB,EAAawB,EAAMG,CAAI,EAGhC,OAAAE,EAAM,CAAC,EACPjC,EAAaiC,EAAK,WAAYP,GAAQD,CAAM,EAC5CzB,EAAaiC,EAAK,QAASR,CAAM,EACjCzB,EAAaiC,EAAK,SAAUP,CAAK,EACjC1B,EAAaiC,EAAK,YAAaQ,CAAE,EACjCzC,EAAaiC,EAAK,YAAaE,CAAG,EAClCnC,EAAaiC,EAAK,cAAeJ,CAAI,EACrC7B,EAAaiC,EAAK,UAAcW,EAAM,SAAW,cAAiB,4BAA6B,EAC/F5C,EAAaiC,EAAK,QAASpB,EAAM,EAC1BoB,CACR,CAKApC,GAAO,QAAUkB,KC7PjB,IAAI8B,GAAO,KAKX,OAAO,QAAUA",
-  "names": ["require_validate", "__commonJSMin", "exports", "module", "contains", "isBoolean", "isNumber", "isObject", "isString", "isnan", "hasOwnProp", "format", "ALTERNATIVE_VALUES", "ZERO_METHOD_VALUES", "validate", "opts", "options", "require_unique", "__commonJSMin", "exports", "module", "ascending", "a", "b", "unique", "arr", "len", "val", "i", "j", "require_print", "__commonJSMin", "exports", "module", "isPositiveInteger", "isObject", "isBoolean", "hasOwnProp", "roundn", "format", "print", "opts", "decision", "dgts", "str", "require_main", "__commonJSMin", "exports", "module", "isNumberArray", "isTypedArrayLike", "setReadOnly", "isObject", "ranks", "normalCDF", "signrankCDF", "tabulate", "signum", "sqrt", "abs", "Float64Array", "format", "validate", "unique", "print", "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"]
+  "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 contains = require( '@stdlib/array-base-assert-contains' ).factory;\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\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/assert-is-nan' );\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar format = require( '@stdlib/string-format' );\n\n\n// VARIABLES //\n\nvar ALTERNATIVE_VALUES = [ 'two-sided', 'less', 'greater' ];\nvar ZERO_METHOD_VALUES = [ 'pratt', 'wilcox', 'zsplit' ];\n\nvar isAlternativeValue = contains( ALTERNATIVE_VALUES );\nvar isZeroMethod = contains( ZERO_METHOD_VALUES );\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination for validated options\n* @param {Options} options - function options\n* @param {number} [options.alpha] - significance level\n* @param {string} [options.alternative] - alternative hypothesis (`two-sided`, `less` or `greater`)\n* @param {boolean} [options.exact] - whether to force using the exact distribution instead of a normal approximation when there are more than fifty data points\n* @param {boolean} [options.correction] - continuity correction adjusting the Wilcoxon rank statistic by 0.5 towards the mean\n* @param {string} [options.zeroMethod] - method governing how zero-differences are handled (`pratt`, `wilcox` or `zsplit`)\n* @param {number} [options.mu] - mean under H0\n* @returns {(null|Error)} null or an error\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 ( !isAlternativeValue( opts.alternative ) ) {\n\t\t\treturn new Error( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'alternative', ALTERNATIVE_VALUES.join( '\", \"' ), opts.alternative ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'correction' ) ) {\n\t\topts.correction = options.correction;\n\t\tif ( !isBoolean( opts.correction ) || isnan( opts.correction ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'correction', opts.alpha ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'exact' ) ) {\n\t\topts.exact = options.exact;\n\t\tif (\n\t\t\t!isBoolean( opts.exact ) ||\n\t\t\tisnan( opts.exact )\n\t\t) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'exact', opts.alpha ) );\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\tif ( hasOwnProp( options, 'zeroMethod' ) ) {\n\t\topts.zeroMethod = options.zeroMethod;\n\t\tif ( !isString( opts.zeroMethod ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'zeroMethod', opts.alternative ) );\n\t\t}\n\t\tif ( !isZeroMethod( opts.zeroMethod ) ) {\n\t\t\treturn new Error( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'zeroMethod', ZERO_METHOD_VALUES.join( '\", \"' ), opts.zeroMethod ) );\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = validate;\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// 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", "/**\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", "/* 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", "/**\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"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAW,QAAS,oCAAqC,EAAE,QAC3DC,EAAY,QAAS,2BAA4B,EAAE,YACnDC,EAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAW,QAAS,gCAAiC,EACrDC,EAAW,QAAS,0BAA2B,EAAE,YACjDC,EAAQ,QAAS,uBAAwB,EACzCC,EAAa,QAAS,iCAAkC,EACxDC,EAAS,QAAS,uBAAwB,EAK1CC,EAAqB,CAAE,YAAa,OAAQ,SAAU,EACtDC,EAAqB,CAAE,QAAS,SAAU,QAAS,EAEnDC,GAAqBV,EAAUQ,CAAmB,EAClDG,GAAeX,EAAUS,CAAmB,EAmBhD,SAASG,GAAUC,EAAMC,EAAU,CAClC,GAAK,CAACX,GAAUW,CAAQ,EACvB,OAAO,IAAI,UAAWP,EAAQ,qEAAsEO,CAAQ,CAAE,EAE/G,GAAKR,EAAYQ,EAAS,OAAQ,EAAI,CAErC,GADAD,EAAK,MAAQC,EAAQ,MAChB,CAACZ,EAAUW,EAAK,KAAM,GAAKR,EAAOQ,EAAK,KAAM,EACjD,OAAO,IAAI,UAAWN,EAAQ,8DAA+D,QAASM,EAAK,KAAM,CAAE,EAEpH,GAAKA,EAAK,MAAQ,GAAOA,EAAK,MAAQ,EACrC,OAAO,IAAI,WAAYN,EAAQ,sFAAuF,QAASM,EAAK,KAAM,CAAE,CAE9I,CACA,GAAKP,EAAYQ,EAAS,aAAc,EAAI,CAE3C,GADAD,EAAK,YAAcC,EAAQ,YACtB,CAACV,EAAUS,EAAK,WAAY,EAChC,OAAO,IAAI,UAAWN,EAAQ,8DAA+D,cAAeM,EAAK,WAAY,CAAE,EAEhI,GAAK,CAACH,GAAoBG,EAAK,WAAY,EAC1C,OAAO,IAAI,MAAON,EAAQ,gFAAiF,cAAeC,EAAmB,KAAM,MAAO,EAAGK,EAAK,WAAY,CAAE,CAElL,CACA,GAAKP,EAAYQ,EAAS,YAAa,IACtCD,EAAK,WAAaC,EAAQ,WACrB,CAACb,EAAWY,EAAK,UAAW,GAAKR,EAAOQ,EAAK,UAAW,GAC5D,OAAO,IAAI,UAAWN,EAAQ,+DAAgE,aAAcM,EAAK,KAAM,CAAE,EAG3H,GAAKP,EAAYQ,EAAS,OAAQ,IACjCD,EAAK,MAAQC,EAAQ,MAEpB,CAACb,EAAWY,EAAK,KAAM,GACvBR,EAAOQ,EAAK,KAAM,GAElB,OAAO,IAAI,UAAWN,EAAQ,+DAAgE,QAASM,EAAK,KAAM,CAAE,EAGtH,GAAKP,EAAYQ,EAAS,IAAK,IAC9BD,EAAK,GAAKC,EAAQ,GACb,CAACZ,EAAUW,EAAK,EAAG,GAAKR,EAAOQ,EAAK,EAAG,GAC3C,OAAO,IAAI,UAAWN,EAAQ,8DAA+D,KAAMM,EAAK,EAAG,CAAE,EAG/G,GAAKP,EAAYQ,EAAS,YAAa,EAAI,CAE1C,GADAD,EAAK,WAAaC,EAAQ,WACrB,CAACV,EAAUS,EAAK,UAAW,EAC/B,OAAO,IAAI,UAAWN,EAAQ,8DAA+D,aAAcM,EAAK,WAAY,CAAE,EAE/H,GAAK,CAACF,GAAcE,EAAK,UAAW,EACnC,OAAO,IAAI,MAAON,EAAQ,gFAAiF,aAAcE,EAAmB,KAAM,MAAO,EAAGI,EAAK,UAAW,CAAE,CAEhL,CACA,OAAO,IACR,CAKAd,EAAO,QAAUa,KCnHjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cA+BA,SAASC,GAAWC,EAAGC,EAAI,CAC1B,OAAOD,EAAIC,CACZ,CAYA,SAASC,GAAQC,EAAM,CACtB,IAAIC,EACAC,EACAC,EACAC,EAOJ,IALAJ,EAAMA,EAAI,MAAM,EAChBA,EAAI,KAAMJ,EAAU,EACpBK,EAAMD,EAAI,OAGJG,EAAI,EAAGC,EAAI,EAAGD,EAAIF,EAAKE,IAC5BD,EAAMF,EAAKG,CAAE,EACRH,EAAKI,CAAE,IAAMF,IACjBE,GAAK,EACLJ,EAAKI,CAAE,EAAIF,GAIb,OAAAF,EAAI,OAASI,EAAI,EACVJ,CACR,CAKAL,EAAO,QAAUI,KCvEjB,IAAAM,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,GAAoB,QAAS,oCAAqC,EAClEC,GAAW,QAAS,gCAAiC,EACrDC,GAAY,QAAS,2BAA4B,EAAE,YACnDC,EAAa,QAAS,iCAAkC,EACxDC,EAAS,QAAS,kCAAmC,EACrDC,EAAS,QAAS,uBAAwB,EAe9C,SAASC,GAAOC,EAAO,CAEtB,IAAIC,EACAC,EACAC,EAIJ,GAFAD,EAAO,EACPD,EAAW,GACN,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACP,GAAUM,CAAK,EACpB,MAAM,IAAI,UAAWF,EAAQ,mEAAoEE,CAAK,CAAE,EAEzG,GAAKJ,EAAYI,EAAM,QAAS,EAAI,CACnC,GAAK,CAACP,GAAmBO,EAAK,MAAO,EACpC,MAAM,IAAI,UAAWF,EAAQ,wEAAyE,SAAUE,EAAK,MAAO,CAAE,EAE/HE,EAAOF,EAAK,MACb,CACA,GAAKJ,EAAYI,EAAM,UAAW,EAAI,CACrC,GAAK,CAACL,GAAWK,EAAK,QAAS,EAC9B,MAAM,IAAI,UAAWF,EAAQ,+DAAgE,WAAYE,EAAK,QAAS,CAAE,EAE1HC,EAAWD,EAAK,QACjB,CACD,CAUA,OATAG,EAAM,GACNA,GAAO,KAAK,OACZA,GAAO,OACPA,GAAO,2BACF,KAAK,SAAW,mCACpBA,GAAO,uCAEPA,GAAO,oBAEC,KAAK,YAAc,CAC5B,IAAK,OACJA,GAAO,aACP,MACD,IAAK,UACJA,GAAO,gBACP,MAED,QACCA,GAAO,gBACP,KACD,CACA,OAAAA,GAAO,KAAK,UACZA,GAAO,OACPA,GAAO,eAAiBN,EAAQ,KAAK,OAAQ,CAACK,CAAK,EAAI,KACvDC,GAAO,kBAAoBN,EAAQ,KAAK,UAAW,CAACK,CAAK,EAAI,KAC7DC,GAAO,KACFF,IACJE,GAAO,kBACF,KAAK,SACTA,GAAO,0CAA6C,KAAK,MAAM,IAAO,uBAEtEA,GAAO,kDAAqD,KAAK,MAAM,IAAO,uBAE/EA,GAAO,MAEDA,CACR,CAKAX,EAAO,QAAUO,KC5GjB,IAAAK,GAAAC,EAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,EAAgB,QAAS,gCAAiC,EAAE,WAC5DC,EAAmB,QAAS,oCAAqC,EACjEC,EAAc,QAAS,yCAA0C,EACjEC,GAAW,QAAS,gCAAiC,EACrDC,GAAQ,QAAS,qBAAsB,EACvCC,GAAY,QAAS,qCAAsC,EAAE,QAC7DC,EAAc,QAAS,uCAAwC,EAC/DC,GAAW,QAAS,wBAAyB,EAC7CC,GAAS,QAAS,kCAAmC,EACrDC,GAAO,QAAS,gCAAiC,EACjDC,GAAM,QAAS,+BAAgC,EAC/CC,GAAe,QAAS,uBAAwB,EAChDC,EAAS,QAAS,uBAAwB,EAC1CC,GAAW,IACXC,GAAS,IACTC,GAAQ,IAKRC,EAAQX,GAAW,EAAK,CAAI,EA2ChC,SAASY,IAAW,CACnB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAGJ,GADAD,EAAI,UAAW,CAAE,EACZ,CAAC5C,EAAkB4C,CAAE,GAAK,CAAC7C,EAAe6C,CAAE,EAChD,MAAM,IAAI,UAAWjC,EAAQ,yEAA0EiC,CAAE,CAAE,EAG5G,GADAZ,EAAMY,EAAE,OACH,UAAU,OAAS,EACvB,GAAK1C,GAAU,UAAW,CAAE,CAAE,EAC7BiB,EAAU,UAAW,CAAE,MACjB,CAEN,GADA0B,EAAI,UAAW,CAAE,EACZ,CAAC7C,EAAkB6C,CAAE,GAAK,CAAC9C,EAAe8C,CAAE,EAChD,MAAM,IAAI,UAAWlC,EAAQ,wEAAyE,IAAKkC,CAAE,CAAE,EAEhH,GAAKb,IAAQa,EAAE,OACd,MAAM,IAAI,MAAO,0EAA2E,EAExF,UAAU,OAAS,IACvB1B,EAAU,UAAW,CAAE,EAEzB,CAGD,GADAS,EAAO,CAAC,EACHT,IACJY,EAAMnB,GAAUgB,EAAMT,CAAQ,EACzBY,GACJ,MAAMA,EAcR,GAXAK,EAAKR,EAAK,IAAM,EACXA,EAAK,aAAe,OACxBX,EAAa,GAEbA,EAAaW,EAAK,WAEdA,EAAK,QAAU,OACnBF,EAAQ,IAERA,EAAQE,EAAK,MAETI,EAAM,EACV,MAAM,IAAI,MAAOrB,EAAQ,oFAAqFiC,CAAE,CAAE,EAKnH,GAHAd,EAAMF,EAAK,aAAe,YAC1BV,EAAaU,EAAK,YAAc,SAE3BV,IAAe,SAAW,CAG9B,GADAqB,EAAI,CAAC,EACAM,EACJ,IAAML,EAAI,EAAGA,EAAIR,EAAKQ,IACrBG,EAAMC,EAAGJ,CAAE,EAAIK,EAAGL,CAAE,EAAMJ,EACrBO,IAAM,GACVJ,EAAE,KAAMI,CAAE,MAIZ,KAAMH,EAAI,EAAGA,EAAIR,EAAKQ,IAChBI,EAAGJ,CAAE,IAAM,GACfD,EAAE,KAAMK,EAAGJ,CAAE,EAAIJ,CAAG,EAIvBZ,EAAQoB,EAAE,OAASL,EAAE,MACtB,SACCA,EAAI,IAAI7B,GAAcsB,CAAI,EAC1BR,EAAQ,EACHqB,EACJ,IAAML,EAAI,EAAGA,EAAIR,EAAKQ,IACrBD,EAAGC,CAAE,EAAMI,EAAGJ,CAAE,EAAIK,EAAGL,CAAE,EAAMJ,EAC1BG,EAAGC,CAAE,IAAM,IACfhB,GAAS,OAIX,KAAMgB,EAAI,EAAGA,EAAIR,EAAKQ,IACrBD,EAAGC,CAAE,EAAII,EAAGJ,CAAE,EAAIJ,EACbG,EAAGC,CAAE,IAAM,IACfhB,GAAS,GAKb,GAAKA,IAAUQ,EACd,MAAM,IAAI,MAAO,iDAAkD,EAKpE,IAFAA,EAAMO,EAAE,OACRJ,EAAK,IAAIzB,GAAcsB,CAAI,EACrBQ,EAAI,EAAGA,EAAIR,EAAKQ,IACrBL,EAAIK,CAAE,EAAI/B,GAAK8B,EAAGC,CAAE,CAAE,EAKvB,IAHAC,EAAItC,GAAOgC,CAAG,EACdZ,EAAQ,EACRE,EAAQ,EACFe,EAAI,EAAGA,EAAIR,EAAKQ,IAChBD,EAAGC,CAAE,EAAI,EACbjB,GAASkB,EAAGD,CAAE,EAELD,EAAGC,CAAE,IAAM,IACpBf,GAASgB,EAAGD,CAAE,GAWhB,GARApB,EAAUP,GAAQ4B,CAAE,EAAE,SAAWA,EAAE,OAC9BvB,IAAe,WACnBK,GAASE,EAAQ,GAElBiB,EAAInB,EACJc,EAAKL,GAAQA,EAAM,GAAQ,IAC3BM,EAAKN,GAAQA,EAAM,IAAY,EAAMA,EAAQ,GAExCd,IAAe,QAAU,CAE7B,IADAe,EAAM,CAAC,EACDO,EAAI,EAAGA,EAAIR,EAAKQ,IAChBD,EAAGC,CAAE,IAAM,GACfP,EAAI,KAAMQ,EAAGD,CAAE,CAAE,EAGnBC,EAAIR,EACJI,GAAMb,GAAUA,EAAQ,GAAQ,IAChCc,GAAMd,GAAUA,EAAQ,IAAY,EAAMA,EAAU,EACrD,CAGA,IAFAH,EAASf,GAAUmC,CAAE,EACrBnB,EAAS,EACHkB,EAAI,EAAGA,EAAInB,EAAO,OAAQmB,IAC1BnB,EAAQmB,CAAE,EAAG,CAAE,EAAI,IACvBG,EAAItB,EAAQmB,CAAE,EAAG,CAAE,EACnBlB,GAAUqB,GAAOA,EAAEA,EAAK,IAS1B,GANKrB,EAAS,IAEbgB,GAAM,GAAMhB,GAEbgB,EAAK9B,GAAM8B,EAAK,EAAK,EAGlBN,EAAM,IAAM,CAACJ,EAAK,OACpBJ,EAAQ,GACRJ,EACC,CAED,GADAmB,EAAI,EACCtB,EACJ,OAASa,EAAM,CACf,IAAK,YACJS,EAAI,GAAMhC,GAAQmC,EAAIL,CAAG,EACzB,MACD,IAAK,OACJE,EAAI,IACJ,MACD,QACCA,EAAI,GACJ,KACD,CAGDV,GAASa,EAAIL,EAAKE,GAAMD,EACnBR,IAAQ,YACZH,EAAO,GAAQ,EAAMZ,EAAON,GAAKoB,CAAK,CAAE,GAC7BC,IAAQ,UACnBH,EAAO,EAAMZ,EAAOc,CAAK,EAEzBF,EAAOZ,EAAOc,CAAK,CAErB,MAECA,EAAOa,EACFZ,IAAQ,YACPD,EAASG,GAAQA,EAAI,GAAM,EAC/BL,EAAO,GAAQ,EAAItB,EAAawB,EAAO,EAAGG,CAAI,GAE9CL,EAAO,EAAMtB,EAAawB,EAAMG,CAAI,EAE1BF,IAAQ,UACnBH,EAAO,EAAMtB,EAAawB,EAAO,EAAGG,CAAI,EAExCL,EAAOtB,EAAawB,EAAMG,CAAI,EAGhC,OAAAE,EAAM,CAAC,EACPjC,EAAaiC,EAAK,WAAYP,GAAQD,CAAM,EAC5CzB,EAAaiC,EAAK,QAASR,CAAM,EACjCzB,EAAaiC,EAAK,SAAUP,CAAK,EACjC1B,EAAaiC,EAAK,YAAaQ,CAAE,EACjCzC,EAAaiC,EAAK,YAAaE,CAAG,EAClCnC,EAAaiC,EAAK,cAAeJ,CAAI,EACrC7B,EAAaiC,EAAK,UAAcW,EAAM,SAAW,cAAiB,4BAA6B,EAC/F5C,EAAaiC,EAAK,QAASpB,EAAM,EAC1BoB,CACR,CAKApC,GAAO,QAAUkB,KC7PjB,IAAI8B,GAAO,KAKX,OAAO,QAAUA",
+  "names": ["require_validate", "__commonJSMin", "exports", "module", "contains", "isBoolean", "isNumber", "isObject", "isString", "isnan", "hasOwnProp", "format", "ALTERNATIVE_VALUES", "ZERO_METHOD_VALUES", "isAlternativeValue", "isZeroMethod", "validate", "opts", "options", "require_unique", "__commonJSMin", "exports", "module", "ascending", "a", "b", "unique", "arr", "len", "val", "i", "j", "require_print", "__commonJSMin", "exports", "module", "isPositiveInteger", "isObject", "isBoolean", "hasOwnProp", "roundn", "format", "print", "opts", "decision", "dgts", "str", "require_main", "__commonJSMin", "exports", "module", "isNumberArray", "isTypedArrayLike", "setReadOnly", "isObject", "ranks", "normalCDF", "signrankCDF", "tabulate", "signum", "sqrt", "abs", "Float64Array", "format", "validate", "unique", "print", "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"]
 }

package/lib/validate.js

@@ -20,7 +20,7 @@
 
 // MODULES //
 
-var contains = require( '@stdlib/assert-contains' );
+var contains = require( '@stdlib/array-base-assert-contains' ).factory;
 var isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
 var isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;
 var isObject = require( '@stdlib/assert-is-plain-object' );
@@ -35,6 +35,9 @@ var format = require( '@stdlib/string-format' );
 var ALTERNATIVE_VALUES = [ 'two-sided', 'less', 'greater' ];
 var ZERO_METHOD_VALUES = [ 'pratt', 'wilcox', 'zsplit' ];
 
+var isAlternativeValue = contains( ALTERNATIVE_VALUES );
+var isZeroMethod = contains( ZERO_METHOD_VALUES );
+
 
 // MAIN //
 
@@ -70,7 +73,7 @@ function validate( opts, options ) {
 		if ( !isString( opts.alternative ) ) {
 			return new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'alternative', opts.alternative ) );
 		}
-		if ( !contains( ALTERNATIVE_VALUES, opts.alternative ) ) {
+		if ( !isAlternativeValue( opts.alternative ) ) {
 			return new Error( format( 'invalid option. `%s` option must be one of the following: "%s". Option: `%s`.', 'alternative', ALTERNATIVE_VALUES.join( '", "' ), opts.alternative ) );
 		}
 	}
@@ -100,7 +103,7 @@ function validate( opts, options ) {
 		if ( !isString( opts.zeroMethod ) ) {
 			return new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'zeroMethod', opts.alternative ) );
 		}
-		if ( !contains( ZERO_METHOD_VALUES, opts.zeroMethod ) ) {
+		if ( !isZeroMethod( opts.zeroMethod ) ) {
 			return new Error( format( 'invalid option. `%s` option must be one of the following: "%s". Option: `%s`.', 'zeroMethod', ZERO_METHOD_VALUES.join( '", "' ), opts.zeroMethod ) );
 		}
 	}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stdlib/stats-wilcoxon",
-  "version": "0.2.2",
+  "version": "0.2.3",
   "description": "Wilcoxon signed rank test.",
   "license": "Apache-2.0",
   "author": {
@@ -30,28 +30,28 @@
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
   "dependencies": {
-    "@stdlib/array-float64": "^0.2.2",
-    "@stdlib/assert-contains": "^0.2.2",
-    "@stdlib/assert-has-own-property": "^0.2.2",
-    "@stdlib/assert-is-boolean": "^0.2.2",
-    "@stdlib/assert-is-nan": "^0.2.2",
-    "@stdlib/assert-is-number": "^0.2.2",
-    "@stdlib/assert-is-number-array": "^0.2.2",
-    "@stdlib/assert-is-plain-object": "^0.2.2",
-    "@stdlib/assert-is-positive-integer": "^0.2.2",
-    "@stdlib/assert-is-string": "^0.2.2",
-    "@stdlib/assert-is-typed-array-like": "^0.2.2",
-    "@stdlib/math-base-special-abs": "^0.2.2",
-    "@stdlib/math-base-special-roundn": "^0.2.2",
-    "@stdlib/math-base-special-signum": "^0.2.2",
-    "@stdlib/math-base-special-sqrt": "^0.2.2",
-    "@stdlib/stats-base-dists-normal-cdf": "^0.2.1",
-    "@stdlib/stats-base-dists-signrank-cdf": "^0.2.2",
-    "@stdlib/stats-ranks": "^0.2.2",
-    "@stdlib/string-format": "^0.2.2",
-    "@stdlib/utils-define-read-only-property": "^0.2.2",
-    "@stdlib/utils-tabulate": "^0.2.2",
-    "@stdlib/error-tools-fmtprodmsg": "^0.2.2"
+    "@stdlib/array-base-assert-contains": "^0.2.2",
+    "@stdlib/array-float64": "^0.2.3",
+    "@stdlib/assert-has-own-property": "^0.2.3",
+    "@stdlib/assert-is-boolean": "^0.2.3",
+    "@stdlib/assert-is-nan": "^0.2.3",
+    "@stdlib/assert-is-number": "^0.2.3",
+    "@stdlib/assert-is-number-array": "^0.2.3",
+    "@stdlib/assert-is-plain-object": "^0.2.3",
+    "@stdlib/assert-is-positive-integer": "^0.2.3",
+    "@stdlib/assert-is-string": "^0.2.3",
+    "@stdlib/assert-is-typed-array-like": "^0.2.3",
+    "@stdlib/math-base-special-abs": "^0.2.3",
+    "@stdlib/math-base-special-roundn": "^0.2.3",
+    "@stdlib/math-base-special-signum": "^0.2.3",
+    "@stdlib/math-base-special-sqrt": "^0.2.3",
+    "@stdlib/stats-base-dists-normal-cdf": "^0.3.1",
+    "@stdlib/stats-base-dists-signrank-cdf": "^0.2.3",
+    "@stdlib/stats-ranks": "^0.2.3",
+    "@stdlib/string-format": "^0.2.3",
+    "@stdlib/utils-define-read-only-property": "^0.2.3",
+    "@stdlib/utils-tabulate": "^0.2.3",
+    "@stdlib/error-tools-fmtprodmsg": "^0.2.3"
   },
   "devDependencies": {},
   "engines": {