npm - @stdlib/stats-incr-mgrubbs - Versions diffs - 0.0.6 → 0.2.0 - Mend

@stdlib/stats-incr-mgrubbs 0.0.6 → 0.2.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (15) hide show

package/LICENSE CHANGED Viewed

@@ -175,307 +175,3 @@
       of your accepting any such warranty or additional liability.
    END OF TERMS AND CONDITIONS
-Boost Software License - Version 1.0 - August 17th, 2003
-Permission is hereby granted, free of charge, to any person or organization
-obtaining a copy of the software and accompanying documentation covered by this
-license (the "Software") to use, reproduce, display, distribute, execute, and
-transmit the Software, and to prepare derivative works of the Software, and to
-permit third-parties to whom the Software is furnished to do so, all subject to
-the following:
-The copyright notices in the Software and this entire statement, including the
-above license grant, this restriction and the following disclaimer, must be
-included in all copies of the Software, in whole or in part, and all derivative
-works of the Software, unless such copies or derivative works are solely in the
-form of machine-executable object code generated by a source language processor.
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
-FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
-COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES
-OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
-OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-DEPENDENCIES
-The library links against the following external libraries, which have their own
-licenses:
-* OpenBLAS <https://raw.githubusercontent.com/xianyi/OpenBLAS/
-def146efed8d5908ea04e22668feeab7099599a0/LICENSE>
-Copyright (c) 2011-2014, The OpenBLAS Project
-All rights reserved.
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are
-met:
-   1. Redistributions of source code must retain the above copyright
-      notice, this list of conditions and the following disclaimer.
-   2. Redistributions in binary form must reproduce the above copyright
-      notice, this list of conditions and the following disclaimer in
-      the documentation and/or other materials provided with the
-      distribution.
-   3. Neither the name of the OpenBLAS project nor the names of
-      its contributors may be used to endorse or promote products
-      derived from this software without specific prior written
-      permission.
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
-GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
-THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-* Electron <https://raw.githubusercontent.com/electron/electron/
-c4cfb3e7110266b9d7ad80e1ae097c4db564501c/LICENSE>
-Copyright (c) 2013-2017 GitHub Inc.
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-* Boost <http://www.boost.org/LICENSE_1_0.txt>
-Boost Software License - Version 1.0 - August 17th, 2003
-Permission is hereby granted, free of charge, to any person or organization
-obtaining a copy of the software and accompanying documentation covered by
-this license (the "Software") to use, reproduce, display, distribute,
-execute, and transmit the Software, and to prepare derivative works of the
-Software, and to permit third-parties to whom the Software is furnished to
-do so, all subject to the following:
-The copyright notices in the Software and this entire statement, including
-the above license grant, this restriction and the following disclaimer,
-must be included in all copies of the Software, in whole or in part, and
-all derivative works of the Software, unless such copies or derivative
-works are solely in the form of machine-executable object code generated by
-a source language processor.
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
-SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
-FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
-ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-DEALINGS IN THE SOFTWARE.
-* Cephes <http://www.netlib.org/cephes/readme>
-Copyright (c) 1984-2000 Stephen L. Moshier
-Some software in this archive may be from the book _Methods and Programs for
-Mathematical Functions_ (Prentice-Hall or Simon & Schuster International, 1989)
-or from the Cephes Mathematical Library, a commercial product. In either event,
-it is copyrighted by the author. What you see here may be used freely but it
-comes with no support or guarantee.
-Stephen L. Moshier
-moshier@na-net.ornl.gov
-ATTRIBUTION
-The library contains implementations from the following external libraries,
-which have their own licenses:
-* FreeBSD <https://svnweb.freebsd.org/>
-Copyright (C) 1993-2004 by Sun Microsystems, Inc. All rights reserved.
-Developed at SunPro, a Sun Microsystems, Inc. business.
-Permission to use, copy, modify, and distribute this
-software is freely granted, provided that this notice
-is preserved.
-* FDLIBM <http://www.netlib.org/fdlibm/>
-Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.
-Developed at SunPro, a Sun Microsystems, Inc. business.
-Permission to use, copy, modify, and distribute this
-software is freely granted, provided that this notice
-is preserved.
-* Go <https://raw.githubusercontent.com/golang/go/master/LICENSE>
-Copyright (c) 2009 The Go Authors. All rights reserved.
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are
-met:
-   * Redistributions of source code must retain the above copyright
-notice, this list of conditions and the following disclaimer.
-   * Redistributions in binary form must reproduce the above
-copyright notice, this list of conditions and the following disclaimer
-in the documentation and/or other materials provided with the
-distribution.
-   * Neither the name of Google Inc. nor the names of its
-contributors may be used to endorse or promote products derived from
-this software without specific prior written permission.
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-* SLATEC Common Mathematical Library <http://www.netlib.no/netlib/slatec/>
-Public domain.
-* ESLint <https://raw.githubusercontent.com/eslint/eslint/master/LICENSE>
-Copyright JS Foundation and other contributors, https://js.foundation
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-* StatsFuns.jl <https://raw.githubusercontent.com/JuliaStats/StatsFuns.jl/
-e66dd973650c375bc1739c820e5b96bb5bd000a8/LICENSE.md>
-Copyright (c) 2015: Dahua Lin.
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-* SpecialFunctions.jl <https://raw.githubusercontent.com/JuliaMath/
-SpecialFunctions.jl/02a173fbe24a61c4b392aec17a9764ac5727feb1/LICENSE>
-The MIT License (MIT)
-Copyright (c) 2017 Jeff Bezanson, Stefan Karpinski, Viral B. Shah, and others:
-https://github.com/JuliaMath/SpecialFunctions.jl/graphs/contributors
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
-* MT19937 <http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/CODES/
-mt19937ar.c>
-Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
-All rights reserved.
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
- 1. Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the
-    documentation and/or other materials provided with the distribution.
- 3. The names of its contributors may not be used to endorse or promote
-    products derived from this software without specific prior written
-    permission.
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT
-OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

package/NOTICE CHANGED Viewed

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

package/README.md CHANGED Viewed

@@ -18,6 +18,17 @@ limitations under the License.
 -->
+<details>
+  <summary>
+    About stdlib...
+  </summary>
+  <p>We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.</p>
+  <p>The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.</p>
+  <p>When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.</p>
+  <p>To join us in bringing numerical computing to the web, get started by checking us out on <a href="https://github.com/stdlib-js/stdlib">GitHub</a>, and please consider <a href="https://opencollective.com/stdlib">financially supporting stdlib</a>. We greatly appreciate your continued support!</p>
+</details>
 # incrmgrubbs
 [![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
@@ -38,7 +49,7 @@ For a window of size `W`, the [Grubbs' test][grubbs-test] statistic for a two-si
 <div class="equation" align="center" data-raw-text="G = \frac{\max_{i=0,\ldots,W-1} |Y_i - \bar{Y}|}{s}" data-equation="eq:grubbs_test_statistic">
     <img src="https://cdn.jsdelivr.net/gh/stdlib-js/stdlib@d157db87026794d6fab579039be09a8916cad4e0/lib/node_modules/@stdlib/stats/incr/mgrubbs/docs/img/equation_grubbs_test_statistic.svg" alt="Grubbs' test statistic.">
     <br>
-</div>
+</div> -->
 <!-- </equation> -->
@@ -48,10 +59,10 @@ The [Grubbs' test][grubbs-test] statistic for the alternative hypothesis that th
 <!-- <equation class="equation" label="eq:grubbs_test_statistic_min" align="center" raw="G = \frac{\bar{Y} - Y_{\textrm{min}}}{s}" alt="Grubbs' test statistic for testing whether the minimum value is an outlier."> -->
-<div class="equation" align="center" data-raw-text="G = \frac{\bar{Y} - Y_{\textrm{min}}}{s}" data-equation="eq:grubbs_test_statistic_min">
+<!-- <div class="equation" align="center" data-raw-text="G = \frac{\bar{Y} - Y_{\textrm{min}}}{s}" data-equation="eq:grubbs_test_statistic_min">
     <img src="https://cdn.jsdelivr.net/gh/stdlib-js/stdlib@d157db87026794d6fab579039be09a8916cad4e0/lib/node_modules/@stdlib/stats/incr/mgrubbs/docs/img/equation_grubbs_test_statistic_min.svg" alt="Grubbs' test statistic for testing whether the minimum value is an outlier.">
     <br>
-</div>
+</div> -->
 <!-- </equation> -->
@@ -59,10 +70,10 @@ The [Grubbs' test][grubbs-test] statistic for the alternative hypothesis that th
 <!-- <equation class="equation" label="eq:grubbs_test_statistic_max" align="center" raw="G = \frac{Y_{\textrm{max}} - \bar{Y}}{s}" alt="Grubbs' test statistic for testing whether the maximum value is an outlier."> -->
-<div class="equation" align="center" data-raw-text="G = \frac{Y_{\textrm{max}} - \bar{Y}}{s}" data-equation="eq:grubbs_test_statistic_max">
+<!-- <div class="equation" align="center" data-raw-text="G = \frac{Y_{\textrm{max}} - \bar{Y}}{s}" data-equation="eq:grubbs_test_statistic_max">
     <img src="https://cdn.jsdelivr.net/gh/stdlib-js/stdlib@d157db87026794d6fab579039be09a8916cad4e0/lib/node_modules/@stdlib/stats/incr/mgrubbs/docs/img/equation_grubbs_test_statistic_max.svg" alt="Grubbs' test statistic for testing whether the maximum value is an outlier.">
     <br>
-</div>
+</div> -->
 <!-- </equation> -->
@@ -70,10 +81,10 @@ For a two-sided test, the hypothesis that a dataset does **not** contain an outl
 <!-- <equation class="equation" label="eq:grubbs_test_two_sided" align="center" raw="G > \frac{W-1}{\sqrt{W}} \sqrt{\frac{t^2_{\alpha/(2W),W-2}}{W - 2 + t^2_{\alpha/(2W),W-2}}}" alt="Two-sided Grubbs' test."> -->
-<div class="equation" align="center" data-raw-text="G > \frac{W-1}{\sqrt{W}} \sqrt{\frac{t^2_{\alpha/(2W),W-2}}{W - 2 + t^2_{\alpha/(2W),W-2}}}" data-equation="eq:grubbs_test_two_sided">
+<!-- <div class="equation" align="center" data-raw-text="G > \frac{W-1}{\sqrt{W}} \sqrt{\frac{t^2_{\alpha/(2W),W-2}}{W - 2 + t^2_{\alpha/(2W),W-2}}}" data-equation="eq:grubbs_test_two_sided">
     <img src="https://cdn.jsdelivr.net/gh/stdlib-js/stdlib@d157db87026794d6fab579039be09a8916cad4e0/lib/node_modules/@stdlib/stats/incr/mgrubbs/docs/img/equation_grubbs_test_two_sided.svg" alt="Two-sided Grubbs' test.">
     <br>
-</div>
+</div> -->
 <!-- </equation> -->
@@ -83,7 +94,7 @@ For a one-sided test, the hypothesis that a dataset does **not** contain an outl
 <!-- <equation class="equation" label="eq:grubbs_test_one_sided" align="center" raw="G > \frac{W-1}{\sqrt{W}} \sqrt{\frac{t^2_{\alpha/W,W-2}}{W - 2 + t^2_{\alpha/W,W-2}}}" alt="One-sided Grubbs' test."> -->
-<div class="equation" align="center" data-raw-text="G > \frac{W-1}{\sqrt{W}} \sqrt{\frac{t^2_{\alpha/W,W-2}}{W - 2 + t^2_{\alpha/W,W-2}}}" data-equation="eq:grubbs_test_one_sided">
+<!-- <div class="equation" align="center" data-raw-text="G > \frac{W-1}{\sqrt{W}} \sqrt{\frac{t^2_{\alpha/W,W-2}}{W - 2 + t^2_{\alpha/W,W-2}}}" data-equation="eq:grubbs_test_one_sided">
     <img src="https://cdn.jsdelivr.net/gh/stdlib-js/stdlib@d157db87026794d6fab579039be09a8916cad4e0/lib/node_modules/@stdlib/stats/incr/mgrubbs/docs/img/equation_grubbs_test_one_sided.svg" alt="One-sided Grubbs' test.">
     <br>
 </div>
@@ -263,7 +274,7 @@ for ( i = 0; i < data.length; i++ ) {
 ## See Also
--   <span class="package-name">[`@stdlib/stats/incr/grubbs`][@stdlib/stats/incr/grubbs]</span><span class="delimiter">: </span><span class="description">grubbs' test for outliers.</span>
+-   <span class="package-name">[`@stdlib/stats-incr/grubbs`][@stdlib/stats/incr/grubbs]</span><span class="delimiter">: </span><span class="description">grubbs' test for outliers.</span>
 </section>
@@ -295,7 +306,7 @@ See [LICENSE][stdlib-license].
 ## Copyright
-Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
+Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
 </section>
@@ -308,8 +319,8 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/stats-incr-mgrubbs.svg
 [npm-url]: https://npmjs.org/package/@stdlib/stats-incr-mgrubbs
-[test-image]: https://github.com/stdlib-js/stats-incr-mgrubbs/actions/workflows/test.yml/badge.svg
-[test-url]: https://github.com/stdlib-js/stats-incr-mgrubbs/actions/workflows/test.yml
+[test-image]: https://github.com/stdlib-js/stats-incr-mgrubbs/actions/workflows/test.yml/badge.svg?branch=v0.2.0
+[test-url]: https://github.com/stdlib-js/stats-incr-mgrubbs/actions/workflows/test.yml?query=branch:v0.2.0
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/stats-incr-mgrubbs/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/stats-incr-mgrubbs?branch=main
@@ -321,19 +332,23 @@ Copyright &copy; 2016-2022. 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
+[stdlib]: https://github.com/stdlib-js/stdlib
+[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
 [umd]: https://github.com/umdjs/umd
 [es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
 [deno-url]: https://github.com/stdlib-js/stats-incr-mgrubbs/tree/deno
+[deno-readme]: https://github.com/stdlib-js/stats-incr-mgrubbs/blob/deno/README.md
 [umd-url]: https://github.com/stdlib-js/stats-incr-mgrubbs/tree/umd
+[umd-readme]: https://github.com/stdlib-js/stats-incr-mgrubbs/blob/umd/README.md
 [esm-url]: https://github.com/stdlib-js/stats-incr-mgrubbs/tree/esm
-[chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg
-[chat-url]: https://gitter.im/stdlib-js/stdlib/
-[stdlib]: https://github.com/stdlib-js/stdlib
-[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
+[esm-readme]: https://github.com/stdlib-js/stats-incr-mgrubbs/blob/esm/README.md
+[branches-url]: https://github.com/stdlib-js/stats-incr-mgrubbs/blob/main/branches.md
 [stdlib-license]: https://raw.githubusercontent.com/stdlib-js/stats-incr-mgrubbs/main/LICENSE

package/SECURITY.md ADDED Viewed

@@ -0,0 +1,5 @@
+# Security
+> Policy for reporting security vulnerabilities.
+See the security policy [in the main project repository](https://github.com/stdlib-js/stdlib/security).

package/dist/index.d.ts ADDED Viewed

@@ -0,0 +1,3 @@
+/// <reference path="../docs/types/index.d.ts" />
+import incrmgrubbs from '../docs/types/index';
+export = incrmgrubbs;

package/dist/index.js ADDED Viewed

@@ -0,0 +1,14 @@
+"use strict";var O=function(e,l){return function(){return l||e((l={exports:{}}).exports,l),l.exports}};var M=O(function(Oe,V){
+var R=require('@stdlib/assert-has-own-property/dist'),x=require('@stdlib/assert-is-plain-object/dist'),W=require('@stdlib/assert-is-number/dist').isPrimitive,ee=require('@stdlib/assert-is-string/dist').isPrimitive,E=require('@stdlib/error-tools-fmtprodmsg/dist'),re=require('@stdlib/assert-is-nan/dist');function ie(e,l){if(!x(l))return new TypeError(E('1Hz2V',l));if(R(l,"alpha")){if(e.alpha=l.alpha,!W(e.alpha)||re(e.alpha))return new TypeError(E('1Hz8P',"alpha",e.alpha));if(e.alpha<0||e.alpha>1)return new RangeError(E('1HzDZ',"alpha",e.alpha));}return R(l,"alternative")&&(e.alternative=l.alternative,!ee(e.alternative))?new TypeError(E('1Hz2W',"alternative",e.alternative)):null;}V.exports=ie
+});var A=O(function(Te,F){
+function ae(){return{alpha:.05,alternative:"two-sided",digits:4,decision:!0}}F.exports=ae
+});var S=O(function(be,I){
+var P=require('@stdlib/math-base-assert-is-positive-zero/dist'),T=require('@stdlib/math-base-assert-is-negative-zero/dist'),k=require('@stdlib/math-base-assert-is-nan/dist'),te=require('@stdlib/constants-float64-pinf/dist'),ne=require('@stdlib/constants-float64-ninf/dist');function se(e,l,a){var t,r,f;return t=te,r=ne,f=0,u;function u(i,s){var n,m,v;if(k(i))f=l,t=i,r=i;else if(f<l)f+=1,(i<t||i===t&&T(i))&&(t=i),(i>r||i===r&&P(i))&&(r=i);else if(a[s]===t&&i>t||a[s]===r&&i<r||k(a[s])){for(t=i,r=i,v=0;v<l;v++)if(v!==s){if(m=a[v],k(m)){t=m,r=m;break}(m<t||m===t&&T(m))&&(t=m),(m>r||m===r&&P(m))&&(r=m)}}else if(i<t)t=i;else if(i>r)r=i;else if(i===0){if(n=T(i),i===t)if(a[s]===t&&T(a[s])&&n===!1){for(t=i,v=0;v<l;v++)if(v!==s&&T(a[v])){t=a[v];break}}else n&&(t=i);if(i===r)if(a[s]===r&&P(a[s])&&n){for(r=i,v=0;v<l;v++)if(v!==s&&P(a[v])){r=a[v];break}}else n===!1&&(r=i)}return e[0]=t,e[1]=r,e}}I.exports=se
+});var G=O(function(ye,D){
+var j=require('@stdlib/math-base-assert-is-nan/dist'),z=require('@stdlib/math-base-special-sqrt/dist');function le(e,l,a){var t,r,f,u,i,s,n,m;return m=l-1,f=0,u=0,n=0,v;function v(c,p){var d,h;if(j(c))n=l,u=NaN,f=NaN;else{if(n<l)return n+=1,t=c-u,u+=t/n,f+=t*(c-u),e[0]=u,n===1?e[1]=0:e[1]=z(f/(n-1)),e;if(n===1)return u=c,f=0,e[0]=c,e[1]=0,e;if(j(a[p])){for(n=1,u=c,f=0,d=0;d<l;d++)if(d!==p){if(h=a[d],j(h)){n=l,u=NaN,f=NaN;break}n+=1,t=h-u,u+=t/n,f+=t*(h-u)}}else j(f)===!1&&(r=a[p],t=c-r,i=r-u,u+=t/l,s=c-u,f+=t*(i+s))}return e[0]=u,e[1]=z(f/m),e}}D.exports=le
+});var H=O(function(Ee,C){
+var Z=require('@stdlib/assert-has-own-property/dist'),ve=require('@stdlib/assert-is-plain-object/dist'),B=require('@stdlib/assert-is-positive-integer/dist').isPrimitive,ue=require('@stdlib/assert-is-boolean/dist').isPrimitive,w=require('@stdlib/utils-define-read-only-property/dist'),N=require('@stdlib/utils-define-read-only-accessor/dist'),fe=require('@stdlib/math-base-special-max/dist'),me=require('@stdlib/math-base-special-sqrt/dist'),Q=require('@stdlib/math-base-special-roundn/dist'),b=require('@stdlib/error-tools-fmtprodmsg/dist'),oe=require('@stdlib/stats-base-dists-t-quantile/dist'),ce=require('@stdlib/array-float64/dist'),de=M(),ge=A(),he=S(),pe=G();function qe(e){var l,a,t,r,f,u,i,s,n,m,v,c,p,d,h;if(!B(e))throw new TypeError(b('1Hz9b',e));if(e<3)throw new RangeError(b('1Hz9c',e));if(r=ge(),arguments.length>1&&(f=de(r,arguments[1]),f))throw f;return u=new ce(e),c=e-2,v=0,d=0,p=0,h=-1,r.alternative==="min"||r.alternative==="max"?i=r.alpha/e:i=r.alpha/(2*e),m=oe(1-i,c),v=(e-1)*m/me(e*(c+m*m)),s=[0,0],t=he(s,e,u),n=[0,0],l=pe(n,e,u),a={},N(a,"rejected",K),w(a,"alpha",r.alpha),w(a,"criticalValue",v),N(a,"statistic",L),w(a,"df",c),N(a,"mean",U),N(a,"sd",X),N(a,"min",Y),N(a,"max",_),w(a,"alt",r.alternative),w(a,"method","Grubbs' Test"),w(a,"print",$),J;function J(g){var q;return arguments.length===0?p<e?null:a:(p+=1,h=(h+1)%e,l(g,h),t(g,h),u[h]=g,p<e?null:(r.alternative==="min"?d=(n[0]-s[0])/n[1]:r.alternative==="max"?d=(s[1]-n[0])/n[1]:(q=fe(n[0]-s[0],s[1]-n[0]),d=q/n[1]),a))}function K(){return d>v}function L(){return d}function U(){return n[0]}function X(){return n[1]}function Y(){return s[0]}function _(){return s[1]}function $(g){var q,y,o;if(y=r.digits,q=r.decision,arguments.length>0){if(!ve(g))throw new TypeError(b('1Hz47',g));if(Z(g,"digits")){if(!B(g.digits))throw new TypeError(b('1Hz3P',"digits",g.digits));y=g.digits}if(Z(g,"decision")){if(!ue(g.decision))throw new TypeError(b('1Hz2o',"decision",g.decision));q=g.decision}}return o="",o+=a.method,o+="\n\n",o+="Alternative hypothesis: ",r.alternative==="max"?o+="The maximum value ("+s[1]+") is an outlier":r.alternative==="min"?o+="The minimum value ("+s[0]+") is an outlier":(o+="The ",n[0]-s[0]>s[1]-n[0]?o+="minimum value ("+s[0]+")":o+="maximum value ("+s[1]+")",o+=" is an outlier"),o+="\n\n",o+="    criticalValue: "+Q(v,-y)+"\n",o+="    statistic: "+Q(d,-y)+"\n",o+="    df: "+c+"\n",o+="\n",q&&(o+="Test Decision: ",d>v?o+="Reject null in favor of alternative at "+r.alpha*100+"% significance level":o+="Fail to reject null in favor of alternative at "+r.alpha*100+"% significance level",o+="\n"),o}}C.exports=qe
+});var we=H();module.exports=we;
+/** @license Apache-2.0 */
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map ADDED Viewed

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/validate.js", "../lib/defaults.js", "../lib/minmax.js", "../lib/meanstdev.js", "../lib/main.js", "../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// MODULES //\n\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;\nvar isString = require( '@stdlib/assert-is-string' ).isPrimitive;\nvar format = require( '@stdlib/string-format' );\nvar isnan = require( '@stdlib/assert-is-nan' );\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\n* @returns {(null|Error)} null or an error\n*\n* @example\n* var opts = {};\n*\n* var options = {\n*     'alpha': 0.05,\n*     'alernative': 'two-sided'\n* };\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 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}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = validate;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns default options.\n*\n* @private\n* @returns {Object} default options\n*\n* @example\n* var o = defaults();\n* // returns {...}\n*/\nfunction defaults() {\n\treturn {\n\t\t'alpha': 0.05,\n\t\t'alternative': 'two-sided',\n\t\t'digits': 4,\n\t\t'decision': true\n\t};\n}\n\n\n// EXPORTS //\n\nmodule.exports = defaults;\n", "/**\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 isPositiveZero = require( '@stdlib/math-base-assert-is-positive-zero' );\nvar isNegativeZero = require( '@stdlib/math-base-assert-is-negative-zero' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\n\n\n// MAIN //\n\n/**\n* Returns an accumulator function which incrementally computes moving minimum and maximum values.\n*\n* @private\n* @param {Collection} out - output array\n* @param {PositiveInteger} W - window size\n* @param {Collection} buf - data buffer\n* @returns {Function} accumulator function\n*\n* @example\n* var buf = [ 0.0, 0.0, 0.0 ];\n*\n* var accumulator = incrmminmax( [ 0.0, 0.0 ], 3, buf );\n*\n* var mm = accumulator( 2.0, 0 );\n* // returns [ 2.0, 2.0 ]\n*\n* buf[ 0 ] = 2.0;\n*\n* mm = accumulator( -5.0, 1 );\n* // returns [ -5.0, 2.0 ]\n*\n* buf[ 1 ] = -5.0;\n*\n* mm = accumulator( 3.0, 2 );\n* // returns [ -5.0, 3.0 ]\n*\n* buf[ 2 ] = 3.0;\n*\n* mm = accumulator( 5.0, 0 );\n* // returns [ -5.0, 5.0 ]\n*\n* buf[ 0 ] = 5.0;\n*/\nfunction incrmminmax( out, W, buf ) {\n\tvar min;\n\tvar max;\n\tvar N;\n\n\tmin = PINF;\n\tmax = NINF;\n\tN = 0;\n\n\treturn accumulator;\n\n\t/**\n\t* Updates accumulator state.\n\t*\n\t* @private\n\t* @param {number} x - input value\n\t* @param {NonNegativeInteger} i - buffer index\n\t* @returns {Collection} output array\n\t*/\n\tfunction accumulator( x, i ) {\n\t\tvar sgn;\n\t\tvar v;\n\t\tvar k;\n\n\t\t// Case: incoming value is NaN...\n\t\tif ( isnan( x ) ) {\n\t\t\tN = W; // explicitly set to avoid `N < W` branch\n\t\t\tmin = x;\n\t\t\tmax = x;\n\t\t}\n\t\t// Case: initial window...\n\t\telse if ( N < W ) {\n\t\t\tN += 1;\n\t\t\tif ( x < min || ( x === min && isNegativeZero( x ) ) ) {\n\t\t\t\tmin = x;\n\t\t\t}\n\t\t\tif ( x > max || ( x === max && isPositiveZero( x ) ) ) {\n\t\t\t\tmax = x;\n\t\t\t}\n\t\t}\n\t\t// Case: outgoing value is the current minimum or maximum and the new value is either greater than the minimum or less than the maximum, and, thus, we need to find new accumulated values among the current buffer values...\n\t\telse if (\n\t\t\t( buf[ i ] === min && x > min ) ||\n\t\t\t( buf[ i ] === max && x < max ) ||\n\t\t\tisnan( buf[ i ] )\n\t\t) {\n\t\t\tmin = x;\n\t\t\tmax = x;\n\t\t\tfor ( k = 0; k < W; k++ ) {\n\t\t\t\tif ( k !== i ) {\n\t\t\t\t\tv = buf[ k ];\n\t\t\t\t\tif ( isnan( v ) ) {\n\t\t\t\t\t\tmin = v;\n\t\t\t\t\t\tmax = v;\n\t\t\t\t\t\tbreak; // no need to continue searching\n\t\t\t\t\t}\n\t\t\t\t\tif ( v < min || ( v === min && isNegativeZero( v ) ) ) {\n\t\t\t\t\t\tmin = v;\n\t\t\t\t\t}\n\t\t\t\t\tif ( v > max || ( v === max && isPositiveZero( v ) ) ) {\n\t\t\t\t\t\tmax = v;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Case: incoming value is less than current minimum value...\n\t\telse if ( x < min ) {\n\t\t\tmin = x;\n\t\t}\n\t\t// Case: incoming value is greater than current maximum value...\n\t\telse if ( x > max ) {\n\t\t\tmax = x;\n\t\t}\n\t\t// Case: incoming value is zero, which means we need to be careful and correctly handle signed zeros...\n\t\telse if ( x === 0.0 ) {\n\t\t\tsgn = isNegativeZero( x );\n\t\t\tif ( x === min ) {\n\t\t\t\t// Case: outgoing value is the current minimum...\n\t\t\t\tif (\n\t\t\t\t\tbuf[ i ] === min &&\n\t\t\t\t\tisNegativeZero( buf[ i ] ) &&\n\t\t\t\t\tsgn === false\n\t\t\t\t) {\n\t\t\t\t\t// Because the outgoing and incoming are different signs (-,+), we need to search the buffer to see if it contains a negative zero. If so, the minimum value remains negative zero; otherwise, the minimum value is incoming value...\n\t\t\t\t\tmin = x;\n\t\t\t\t\tfor ( k = 0; k < W; k++ ) {\n\t\t\t\t\t\tif ( k !== i && isNegativeZero( buf[ k ] ) ) {\n\t\t\t\t\t\t\tmin = buf[ k ];\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else if ( sgn ) {\n\t\t\t\t\t// Ensure minimum value has the correct sign:\n\t\t\t\t\tmin = x;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( x === max ) {\n\t\t\t\t// Case: outgoing value is the current maximum...\n\t\t\t\tif (\n\t\t\t\t\tbuf[ i ] === max &&\n\t\t\t\t\tisPositiveZero( buf[ i ] ) &&\n\t\t\t\t\tsgn\n\t\t\t\t) {\n\t\t\t\t\t// Because the outgoing and incoming are different signs (+,-), we need to search the buffer to see if it contains a positive zero. If so, the maximum value remains positive zero; otherwise, the maximum value is incoming value...\n\t\t\t\t\tmax = x;\n\t\t\t\t\tfor ( k = 0; k < W; k++ ) {\n\t\t\t\t\t\tif ( k !== i && isPositiveZero( buf[ k ] ) ) {\n\t\t\t\t\t\t\tmax = buf[ k ];\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else if ( sgn === false ) {\n\t\t\t\t\t// Ensure maximum value has the correct sign:\n\t\t\t\t\tmax = x;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Case: updating existing window; however, the minimum and maximum values do not change so nothing to do...\n\n\t\tout[ 0 ] = min;\n\t\tout[ 1 ] = max;\n\t\treturn out;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = incrmminmax;\n", "/**\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 isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\n\n\n// MAIN //\n\n/**\n* Returns an accumulator function which incrementally computes a moving arithmetic mean and corrected sample standard deviation.\n*\n* ## Method\n*\n* -   Let \\\\(W\\\\) be a window of \\\\(N\\\\) elements over which we want to compute a corrected sample standard deviation.\n*\n* -   We first recognize that the corrected sample standard deviation is defined as the square root of the unbiased sample variance. Accordingly, in order to derive an update equation for the corrected sample standard deviation, deriving an update equation for the unbiased sample variance is sufficient.\n*\n* -   The difference between the unbiased sample variance in a window \\\\(W_i\\\\) and the unbiased sample variance in a window \\\\(W_{i+1})\\\\) is given by\n*\n*     ```tex\n*     \\Delta s^2 = s_{i+1}^2 - s_{i}^2\n*     ```\n*\n* -   If we multiply both sides by \\\\(N-1\\\\),\n*\n*     ```tex\n*     (N-1)(\\Delta s^2) = (N-1)s_{i+1}^2 - (N-1)s_{i}^2\n*     ```\n*\n* -   If we substitute the definition of the unbiased sample variance having the form\n*\n*     ```tex\n*     \\begin{align*}\n*     s^2 &= \\frac{1}{N-1} \\biggl( \\sum_{i=1}^{N} (x_i - \\bar{x})^2 \\biggr) \\\\\n*         &= \\frac{1}{N-1} \\biggl( \\sum_{i=1}^{N} (x_i^2 - 2\\bar{x}x_i + \\bar{x}^2) \\biggr) \\\\\n*         &= \\frac{1}{N-1} \\biggl( \\sum_{i=1}^{N} x_i^2 - 2\\bar{x} \\sum_{i=1}^{N} x_i + \\sum_{i=1}^{N} \\bar{x}^2) \\biggr) \\\\\n*         &= \\frac{1}{N-1} \\biggl( \\sum_{i=1}^{N} x_i^2 - \\frac{2N\\bar{x}\\sum_{i=1}^{N} x_i}{N} + N\\bar{x}^2 \\biggr) \\\\\n*         &= \\frac{1}{N-1} \\biggl( \\sum_{i=1}^{N} x_i^2 - 2N\\bar{x}^2 + N\\bar{x}^2 \\biggr) \\\\\n*         &= \\frac{1}{N-1} \\biggl( \\sum_{i=1}^{N} x_i^2 - N\\bar{x}^2 \\biggr)\n*     \\end{align*}\n*     ```\n*\n*     we return\n*\n*     ```tex\n*     (N-1)(\\Delta s^2) = \\biggl(\\sum_{k=1}^N x_k^2 - N\\bar{x}_{i+1}^2 \\biggr) - \\biggl(\\sum_{k=0}^{N-1} x_k^2 - N\\bar{x}_{i}^2 \\biggr)\n*     ```\n*\n* -   This can be further simplified by recognizing that subtracting the sums reduces to \\\\(x_N^2 - x_0^2\\\\); in which case,\n*\n*     ```tex\n*     \\begin{align*}\n*     (N-1)(\\Delta s^2) &= x_N^2 - x_0^2 - N\\bar{x}_{i+1}^2 + N\\bar{x}_{i}^2 \\\\\n*     &= x_N^2 - x_0^2 - N(\\bar{x}_{i+1}^2 - \\bar{x}_{i}^2) \\\\\n*     &= x_N^2 - x_0^2 - N(\\bar{x}_{i+1} - \\bar{x}_{i})(\\bar{x}_{i+1} + \\bar{x}_{i})\n*     \\end{align*}\n*     ```\n*\n* -   Recognizing that the difference of means can be expressed\n*\n*     ```tex\n*     \\bar{x}_{i+1} - \\bar{x}_i = \\frac{1}{N} \\biggl( \\sum_{k=1}^N x_k - \\sum_{k=0}^{N-1} x_k \\biggr) = \\frac{x_N - x_0}{N}\n*     ```\n*\n*     and substituting into the equation above\n*\n*     ```tex\n*     (N-1)(\\Delta s^2) = x_N^2 - x_0^2 - (x_N - x_0)(\\bar{x}_{i+1} + \\bar{x}_{i})\n*     ```\n*\n* -   Rearranging terms gives us the update equation\n*\n*     ```tex\n*     \\begin{align*}\n*     (N-1)(\\Delta s^2) &= (x_N - x_0)(x_N + x_0) - (x_N - x_0)(\\bar{x}_{i+1} + \\bar{x}_{i})\n*     &= (x_N - x_0)(x_N + x_0 - \\bar{x}_{i+1} - \\bar{x}_{i}) \\\\\n*     &= (x_N - x_0)(x_N - \\bar{x}_{i+1} + x_0 - \\bar{x}_{i})\n*     \\end{align*}\n*     ```\n*\n* @private\n* @param {Collection} out - output array\n* @param {PositiveInteger} W - window size\n* @param {Collection} buf - data buffer\n* @returns {Function} accumulator function\n*\n* @example\n* var buf = [ 0.0, 0.0, 0.0 ];\n* var accumulator = incrmmeanstdev( [ 0.0, 0.0 ], 3, buf );\n*\n* var v = accumulator( 2.0, 0 );\n* // returns [ 2.0, 0.0 ]\n*\n* buf[ 0 ] = 2.0;\n*\n* v = accumulator( -5.0, 1 );\n* // returns [ -1.5, ~4.95 ]\n*\n* buf[ 1 ] = -5.0;\n*\n* v = accumulator( 3.0, 2 );\n* // returns [ 0.0, ~4.36 ]\n*\n* buf[ 2 ] = 3.0;\n*\n* v = accumulator( 5.0, 0 );\n* // returns [ 1.0, ~5.29 ]\n*\n* buf[ 0 ] = 5.0;\n*/\nfunction incrmmeanstdev( out, W, buf ) {\n\tvar delta;\n\tvar tmp;\n\tvar M2;\n\tvar mu;\n\tvar d1;\n\tvar d2;\n\tvar N;\n\tvar n;\n\n\tn = W - 1;\n\tM2 = 0.0;\n\tmu = 0.0;\n\tN = 0;\n\n\treturn accumulator;\n\n\t/**\n\t* Updates accumulator state.\n\t*\n\t* @private\n\t* @param {number} x - input value\n\t* @param {NonNegativeInteger} i - buffer index\n\t* @returns {ArrayLike} output array\n\t*/\n\tfunction accumulator( x, i ) {\n\t\tvar k;\n\t\tvar v;\n\n\t\t// Case: incoming value is NaN, the sliding second moment is automatically NaN...\n\t\tif ( isnan( x ) ) {\n\t\t\tN = W; // explicitly set to avoid `N < W` branch\n\t\t\tmu = NaN;\n\t\t\tM2 = NaN;\n\t\t}\n\t\t// Case: initial window...\n\t\telse if ( N < W ) {\n\t\t\tN += 1;\n\t\t\tdelta = x - mu;\n\t\t\tmu += delta / N;\n\t\t\tM2 += delta * (x - mu);\n\n\t\t\tout[ 0 ] = mu;\n\t\t\tif ( N === 1 ) {\n\t\t\t\tout[ 1 ] = 0.0;\n\t\t\t} else {\n\t\t\t\tout[ 1 ] = sqrt( M2/(N-1) );\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\t// Case: N = W = 1\n\t\telse if ( N === 1 ) {\n\t\t\tmu = x;\n\t\t\tM2 = 0.0;\n\t\t\tout[ 0 ] = x;\n\t\t\tout[ 1 ] = 0.0;\n\t\t\treturn out;\n\t\t}\n\t\t// Case: outgoing value is NaN, and, thus, we need to compute the accumulated values...\n\t\telse if ( isnan( buf[ i ] ) ) {\n\t\t\tN = 1;\n\t\t\tmu = x;\n\t\t\tM2 = 0.0;\n\t\t\tfor ( k = 0; k < W; k++ ) {\n\t\t\t\tif ( k !== i ) {\n\t\t\t\t\tv = buf[ k ];\n\t\t\t\t\tif ( isnan( v ) ) {\n\t\t\t\t\t\tN = W; // explicitly set to avoid `N < W` branch\n\t\t\t\t\t\tmu = NaN;\n\t\t\t\t\t\tM2 = NaN;\n\t\t\t\t\t\tbreak; // second moment is automatically NaN, so no need to continue\n\t\t\t\t\t}\n\t\t\t\t\tN += 1;\n\t\t\t\t\tdelta = v - mu;\n\t\t\t\t\tmu += delta / N;\n\t\t\t\t\tM2 += delta * (v - mu);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Case: neither the current second moment nor the incoming value are NaN, so we need to update the accumulated values...\n\t\telse if ( isnan( M2 ) === false ) {\n\t\t\ttmp = buf[ i ];\n\t\t\tdelta = x - tmp;\n\t\t\td1 = tmp - mu;\n\t\t\tmu += delta / W;\n\t\t\td2 = x - mu;\n\t\t\tM2 += delta * (d1 + d2);\n\t\t}\n\t\t// Case: the current second moment is NaN, so nothing to do until the buffer no longer contains NaN values...\n\n\t\tout[ 0 ] = mu;\n\t\tout[ 1 ] = sqrt( M2/n );\n\t\treturn out;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = incrmmeanstdev;\n", "/**\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 hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar isPositiveInteger = require( '@stdlib/assert-is-positive-integer' ).isPrimitive;\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\nvar setReadOnly = require( '@stdlib/utils-define-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils-define-read-only-accessor' );\nvar max = require( '@stdlib/math-base-special-max' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar roundn = require( '@stdlib/math-base-special-roundn' );\nvar format = require( '@stdlib/string-format' );\nvar tQuantile = require( '@stdlib/stats-base-dists-t-quantile' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar validate = require( './validate.js' );\nvar defaults = require( './defaults.js' );\nvar incrmminmax = require( './minmax.js' );\nvar incrmmeanstdev = require( './meanstdev.js' );\n\n\n// MAIN //\n\n/**\n* Returns an accumulator function which incrementally performs a moving Grubbs' test for detecting outliers.\n*\n* @param {PositiveInteger} W - window size\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', 'min', 'max')\n* @throws {TypeError} first argument must be a positive integer\n* @throws {RangeError} first argument must be greater than or equal to 3\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @throws {RangeError} `alpha` option must be on the interval `[0,1]`\n* @returns {Function} accumulator function\n*\n* @example\n* var rnorm = require( '@stdlib/random-base-normal' );\n*\n* var accumulator;\n* var opts;\n* var i;\n*\n* accumulator = incrmgrubbs( 20, opts );\n*\n* for ( i = 0; i < 200; i++ ) {\n*     res = accumulator( rnorm( 10.0, 5.0 ) );\n* }\n*/\nfunction incrmgrubbs( W ) {\n\tvar meanstdev;\n\tvar results;\n\tvar minmax;\n\tvar opts;\n\tvar err;\n\tvar buf;\n\tvar sig;\n\tvar mm;\n\tvar ms;\n\tvar tc;\n\tvar gc;\n\tvar df;\n\tvar N;\n\tvar G;\n\tvar i;\n\n\tif ( !isPositiveInteger( W ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Window size must be a positive integer. Value: `%s`.', W ) );\n\t}\n\tif ( W < 3 ) {\n\t\tthrow new RangeError( format( 'invalid argument. Window size must be greater than or equal to 3. Value: `%s`.', W ) );\n\t}\n\topts = defaults();\n\tif ( arguments.length > 1 ) {\n\t\terr = validate( opts, arguments[ 1 ] );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tbuf = new Float64Array( W );\n\tdf = W - 2;\n\tgc = 0.0;\n\tG = 0.0;\n\tN = 0;\n\ti = -1;\n\n\t// Compute the critical values:\n\tif ( opts.alternative === 'min' ) {\n\t\tsig = opts.alpha / W;\n\t} else if ( opts.alternative === 'max' ) {\n\t\tsig = opts.alpha / W;\n\t} else { // two-sided\n\t\tsig = opts.alpha / (2*W);\n\t}\n\ttc = tQuantile( 1.0-sig, df );\n\tgc = (W-1)*tc / sqrt( W*(df+(tc*tc)) );\n\n\t// Initialize statistics accumulators:\n\tmm = [ 0.0, 0.0 ];\n\tminmax = incrmminmax( mm, W, buf );\n\n\tms = [ 0.0, 0.0 ];\n\tmeanstdev = incrmmeanstdev( ms, W, buf );\n\n\t// Initialize the results object:\n\tresults = {};\n\tsetReadOnlyAccessor( results, 'rejected', getRejected );\n\tsetReadOnly( results, 'alpha', opts.alpha );\n\tsetReadOnly( results, 'criticalValue', gc );\n\tsetReadOnlyAccessor( results, 'statistic', getStatistic );\n\tsetReadOnly( results, 'df', df );\n\tsetReadOnlyAccessor( results, 'mean', getMean );\n\tsetReadOnlyAccessor( results, 'sd', getStDev );\n\tsetReadOnlyAccessor( results, 'min', getMin );\n\tsetReadOnlyAccessor( results, 'max', getMax );\n\tsetReadOnly( results, 'alt', opts.alternative );\n\tsetReadOnly( results, 'method', 'Grubbs\\' Test' );\n\tsetReadOnly( results, 'print', print );\n\n\treturn accumulator;\n\n\t/**\n\t* If provided a value, the accumulator function returns updated Grubbs' test results. If not provided a value, the accumulator function returns the current Grubbs' test results.\n\t*\n\t* @private\n\t* @param {number} [x] - new value\n\t* @returns {(Object|null)} test results or null\n\t*/\n\tfunction accumulator( x ) {\n\t\tvar md;\n\t\tif ( arguments.length === 0 ) {\n\t\t\tif ( N < W ) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\treturn results;\n\t\t}\n\t\tN += 1;\n\n\t\t// Update the index for managing the circular buffer:\n\t\ti = (i+1) % W;\n\n\t\t// Update model statistics:\n\t\tmeanstdev( x, i );\n\t\tminmax( x, i );\n\n\t\t// Insert the value into the buffer:\n\t\tbuf[ i ] = x;\n\n\t\tif ( N < W ) {\n\t\t\treturn null;\n\t\t}\n\t\t// Compute the test statistic...\n\t\tif ( opts.alternative === 'min' ) {\n\t\t\tG = ( ms[0]-mm[0] ) / ms[ 1 ];\n\t\t} else if ( opts.alternative === 'max' ) {\n\t\t\tG = ( mm[1]-ms[0] ) / ms[ 1 ];\n\t\t} else { // two-sided\n\t\t\tmd = max( ms[0]-mm[0], mm[1]-ms[0] ); // maximum absolute deviation\n\t\t\tG = md / ms[ 1 ];\n\t\t}\n\t\treturn results;\n\t}\n\n\t/**\n\t* Returns a `boolean` indicating whether the null hypothesis should be rejected.\n\t*\n\t* @private\n\t* @returns {boolean} boolean indicating whether the null hypothesis should be rejected\n\t*/\n\tfunction getRejected() {\n\t\treturn ( G > gc );\n\t}\n\n\t/**\n\t* Returns the test statistic.\n\t*\n\t* @private\n\t* @returns {number} test statistic\n\t*/\n\tfunction getStatistic() {\n\t\treturn G;\n\t}\n\n\t/**\n\t* Returns the sample mean.\n\t*\n\t* @private\n\t* @returns {number} sample mean\n\t*/\n\tfunction getMean() {\n\t\treturn ms[ 0 ];\n\t}\n\n\t/**\n\t* Returns the corrected sample standard deviation.\n\t*\n\t* @private\n\t* @returns {number} corrected sample standard deviation\n\t*/\n\tfunction getStDev() {\n\t\treturn ms[ 1 ];\n\t}\n\n\t/**\n\t* Returns the sample minimum.\n\t*\n\t* @private\n\t* @returns {number} sample minimum\n\t*/\n\tfunction getMin() {\n\t\treturn mm[ 0 ];\n\t}\n\n\t/**\n\t* Returns the sample maximum.\n\t*\n\t* @private\n\t* @returns {number} sample maximum\n\t*/\n\tfunction getMax() {\n\t\treturn mm[ 1 ];\n\t}\n\n\t/**\n\t* Pretty-print test results.\n\t*\n\t* @private\n\t* @param {Object} [options] - options object\n\t* @param {PositiveInteger} [options.digits=4] - number of digits after the decimal point\n\t* @param {boolean} [options.decision=true] - boolean indicating whether to print the test decision\n\t* @throws {TypeError} options argument must be an object\n\t* @throws {TypeError} must provide valid options\n\t* @returns {string} formatted output\n\t*/\n\tfunction print( options ) {\n\t\tvar decision;\n\t\tvar digits;\n\t\tvar str;\n\n\t\tdigits = opts.digits;\n\t\tdecision = opts.decision;\n\t\tif ( arguments.length > 0 ) {\n\t\t\tif ( !isObject( options ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide an object. Value: `%s`.', options ) );\n\t\t\t}\n\t\t\tif ( hasOwnProp( options, 'digits' ) ) {\n\t\t\t\tif ( !isPositiveInteger( options.digits ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a positive integer. Option: `%s`.', 'digits', options.digits ) );\n\t\t\t\t}\n\t\t\t\tdigits = options.digits;\n\t\t\t}\n\t\t\tif ( hasOwnProp( options, 'decision' ) ) {\n\t\t\t\tif ( !isBoolean( options.decision ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'decision', options.decision ) );\n\t\t\t\t}\n\t\t\t\tdecision = options.decision;\n\t\t\t}\n\t\t}\n\t\tstr = '';\n\t\tstr += results.method;\n\t\tstr += '\\n\\n';\n\t\tstr += 'Alternative hypothesis: ';\n\t\tif ( opts.alternative === 'max' ) {\n\t\t\tstr += 'The maximum value (' + mm[ 1 ] + ') is an outlier';\n\t\t} else if ( opts.alternative === 'min' ) {\n\t\t\tstr += 'The minimum value (' + mm[ 0 ] + ') is an outlier';\n\t\t} else { // two-sided\n\t\t\tstr += 'The ';\n\t\t\tif ( ms[0]-mm[0] > mm[1]-ms[0] ) {\n\t\t\t\tstr += 'minimum value (' + mm[ 0 ] + ')';\n\t\t\t} else {\n\t\t\t\tstr += 'maximum value (' + mm[ 1 ] + ')';\n\t\t\t}\n\t\t\tstr += ' is an outlier';\n\t\t}\n\t\tstr += '\\n\\n';\n\t\tstr += '    criticalValue: ' + roundn( gc, -digits ) + '\\n';\n\t\tstr += '    statistic: ' + roundn( G, -digits ) + '\\n';\n\t\tstr += '    df: ' + df + '\\n';\n\t\tstr += '\\n';\n\t\tif ( decision ) {\n\t\t\tstr += 'Test Decision: ';\n\t\t\tif ( G > gc ) {\n\t\t\t\tstr += 'Reject null in favor of alternative at ' + (opts.alpha*100.0) + '% significance level';\n\t\t\t} else {\n\t\t\t\tstr += 'Fail to reject null in favor of alternative at ' + (opts.alpha*100.0) + '% significance level';\n\t\t\t}\n\t\t\tstr += '\\n';\n\t\t}\n\t\treturn str;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = incrmgrubbs;\n", "/**\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* Moving Grubbs' test for outliers.\n*\n* @module @stdlib/stats-incr-mgrubbs\n*\n* @example\n* var rnorm = require( '@stdlib/random-base-normal' );\n* var incrmgrubbs = require( '@stdlib/stats-incr-mgrubbs' );\n*\n* var accumulator;\n* var res;\n* var i;\n*\n* accumulator = incrmgrubbs( 20 );\n*\n* for ( i = 0; i < 200; i++ ) {\n*     res = accumulator( rnorm( 10.0, 5.0 ) );\n* }\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,EAAa,QAAS,iCAAkC,EACxDC,EAAW,QAAS,gCAAiC,EACrDC,EAAW,QAAS,0BAA2B,EAAE,YACjDC,GAAW,QAAS,0BAA2B,EAAE,YACjDC,EAAS,QAAS,uBAAwB,EAC1CC,GAAQ,QAAS,uBAAwB,EA4B7C,SAASC,GAAUC,EAAMC,EAAU,CAClC,GAAK,CAACP,EAAUO,CAAQ,EACvB,OAAO,IAAI,UAAWJ,EAAQ,qEAAsEI,CAAQ,CAAE,EAE/G,GAAKR,EAAYQ,EAAS,OAAQ,EAAI,CAErC,GADAD,EAAK,MAAQC,EAAQ,MAChB,CAACN,EAAUK,EAAK,KAAM,GAAKF,GAAOE,EAAK,KAAM,EACjD,OAAO,IAAI,UAAWH,EAAQ,8DAA+D,QAASG,EAAK,KAAM,CAAE,EAEpH,GAAKA,EAAK,MAAQ,GAAOA,EAAK,MAAQ,EACrC,OAAO,IAAI,WAAYH,EAAQ,6EAA8E,QAASG,EAAK,KAAM,CAAE,CAErI,CACA,OAAKP,EAAYQ,EAAS,aAAc,IACvCD,EAAK,YAAcC,EAAQ,YACtB,CAACL,GAAUI,EAAK,WAAY,GACzB,IAAI,UAAWH,EAAQ,8DAA+D,cAAeG,EAAK,WAAY,CAAE,EAG1H,IACR,CAKAR,EAAO,QAAUO,KChFjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAgCA,SAASC,IAAW,CACnB,MAAO,CACN,MAAS,IACT,YAAe,YACf,OAAU,EACV,SAAY,EACb,CACD,CAKAD,EAAO,QAAUC,KC5CjB,IAAAC,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAiB,QAAS,2CAA4C,EACtEC,EAAiB,QAAS,2CAA4C,EACtEC,EAAQ,QAAS,iCAAkC,EACnDC,GAAO,QAAS,gCAAiC,EACjDC,GAAO,QAAS,gCAAiC,EAuCrD,SAASC,GAAaC,EAAKC,EAAGC,EAAM,CACnC,IAAIC,EACAC,EACAC,EAEJ,OAAAF,EAAMN,GACNO,EAAMN,GACNO,EAAI,EAEGC,EAUP,SAASA,EAAaC,EAAGC,EAAI,CAC5B,IAAIC,EACAC,EACAC,EAGJ,GAAKf,EAAOW,CAAE,EACbF,EAAIJ,EACJE,EAAMI,EACNH,EAAMG,UAGGF,EAAIJ,EACbI,GAAK,GACAE,EAAIJ,GAASI,IAAMJ,GAAOR,EAAgBY,CAAE,KAChDJ,EAAMI,IAEFA,EAAIH,GAASG,IAAMH,GAAOV,EAAgBa,CAAE,KAChDH,EAAMG,WAKLL,EAAKM,CAAE,IAAML,GAAOI,EAAIJ,GACxBD,EAAKM,CAAE,IAAMJ,GAAOG,EAAIH,GAC1BR,EAAOM,EAAKM,CAAE,CAAE,GAIhB,IAFAL,EAAMI,EACNH,EAAMG,EACAI,EAAI,EAAGA,EAAIV,EAAGU,IACnB,GAAKA,IAAMH,EAAI,CAEd,GADAE,EAAIR,EAAKS,CAAE,EACNf,EAAOc,CAAE,EAAI,CACjBP,EAAMO,EACNN,EAAMM,EACN,KACD,EACKA,EAAIP,GAASO,IAAMP,GAAOR,EAAgBe,CAAE,KAChDP,EAAMO,IAEFA,EAAIN,GAASM,IAAMN,GAAOV,EAAgBgB,CAAE,KAChDN,EAAMM,EAER,UAIQH,EAAIJ,EACbA,EAAMI,UAGGA,EAAIH,EACbA,EAAMG,UAGGA,IAAM,EAAM,CAErB,GADAE,EAAMd,EAAgBY,CAAE,EACnBA,IAAMJ,EAEV,GACCD,EAAKM,CAAE,IAAML,GACbR,EAAgBO,EAAKM,CAAE,CAAE,GACzBC,IAAQ,IAIR,IADAN,EAAMI,EACAI,EAAI,EAAGA,EAAIV,EAAGU,IACnB,GAAKA,IAAMH,GAAKb,EAAgBO,EAAKS,CAAE,CAAE,EAAI,CAC5CR,EAAMD,EAAKS,CAAE,EACb,KACD,OAEUF,IAEXN,EAAMI,GAGR,GAAKA,IAAMH,EAEV,GACCF,EAAKM,CAAE,IAAMJ,GACbV,EAAgBQ,EAAKM,CAAE,CAAE,GACzBC,GAIA,IADAL,EAAMG,EACAI,EAAI,EAAGA,EAAIV,EAAGU,IACnB,GAAKA,IAAMH,GAAKd,EAAgBQ,EAAKS,CAAE,CAAE,EAAI,CAC5CP,EAAMF,EAAKS,CAAE,EACb,KACD,OAEUF,IAAQ,KAEnBL,EAAMG,EAGT,CAGA,OAAAP,EAAK,CAAE,EAAIG,EACXH,EAAK,CAAE,EAAII,EACJJ,CACR,CACD,CAKAP,EAAO,QAAUM,KCjMjB,IAAAa,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAQ,QAAS,iCAAkC,EACnDC,EAAO,QAAS,gCAAiC,EA2GrD,SAASC,GAAgBC,EAAKC,EAAGC,EAAM,CACtC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,OAAAA,EAAIT,EAAI,EACRI,EAAK,EACLC,EAAK,EACLG,EAAI,EAEGE,EAUP,SAASA,EAAaC,EAAGC,EAAI,CAC5B,IAAIC,EACAC,EAGJ,GAAKlB,EAAOe,CAAE,EACbH,EAAIR,EACJK,EAAK,IACLD,EAAK,QAGD,IAAKI,EAAIR,EACb,OAAAQ,GAAK,EACLN,EAAQS,EAAIN,EACZA,GAAMH,EAAQM,EACdJ,GAAMF,GAASS,EAAIN,GAEnBN,EAAK,CAAE,EAAIM,EACNG,IAAM,EACVT,EAAK,CAAE,EAAI,EAEXA,EAAK,CAAE,EAAIF,EAAMO,GAAII,EAAE,EAAG,EAEpBT,EAGH,GAAKS,IAAM,EACf,OAAAH,EAAKM,EACLP,EAAK,EACLL,EAAK,CAAE,EAAIY,EACXZ,EAAK,CAAE,EAAI,EACJA,EAGH,GAAKH,EAAOK,EAAKW,CAAE,CAAE,GAIzB,IAHAJ,EAAI,EACJH,EAAKM,EACLP,EAAK,EACCS,EAAI,EAAGA,EAAIb,EAAGa,IACnB,GAAKA,IAAMD,EAAI,CAEd,GADAE,EAAIb,EAAKY,CAAE,EACNjB,EAAOkB,CAAE,EAAI,CACjBN,EAAIR,EACJK,EAAK,IACLD,EAAK,IACL,KACD,CACAI,GAAK,EACLN,EAAQY,EAAIT,EACZA,GAAMH,EAAQM,EACdJ,GAAMF,GAASY,EAAIT,EACpB,OAIQT,EAAOQ,CAAG,IAAM,KACzBD,EAAMF,EAAKW,CAAE,EACbV,EAAQS,EAAIR,EACZG,EAAKH,EAAME,EACXA,GAAMH,EAAQF,EACdO,EAAKI,EAAIN,EACTD,GAAMF,GAASI,EAAKC,IAIrB,OAAAR,EAAK,CAAE,EAAIM,EACXN,EAAK,CAAE,EAAIF,EAAMO,EAAGK,CAAE,EACfV,CACR,CACD,CAKAJ,EAAO,QAAUG,KCrOjB,IAAAiB,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAa,QAAS,iCAAkC,EACxDC,GAAW,QAAS,gCAAiC,EACrDC,EAAoB,QAAS,oCAAqC,EAAE,YACpEC,GAAY,QAAS,2BAA4B,EAAE,YACnDC,EAAc,QAAS,yCAA0C,EACjEC,EAAsB,QAAS,yCAA0C,EACzEC,GAAM,QAAS,+BAAgC,EAC/CC,GAAO,QAAS,gCAAiC,EACjDC,EAAS,QAAS,kCAAmC,EACrDC,EAAS,QAAS,uBAAwB,EAC1CC,GAAY,QAAS,qCAAsC,EAC3DC,GAAe,QAAS,uBAAwB,EAChDC,GAAW,IACXC,GAAW,IACXC,GAAc,IACdC,GAAiB,IAgCrB,SAASC,GAAaC,EAAI,CACzB,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAK,CAAC9B,EAAmBe,CAAE,EAC1B,MAAM,IAAI,UAAWR,EAAQ,yEAA0EQ,CAAE,CAAE,EAE5G,GAAKA,EAAI,EACR,MAAM,IAAI,WAAYR,EAAQ,iFAAkFQ,CAAE,CAAE,EAGrH,GADAI,EAAOR,GAAS,EACX,UAAU,OAAS,IACvBS,EAAMV,GAAUS,EAAM,UAAW,CAAE,CAAE,EAChCC,GACJ,MAAMA,EAGR,OAAAC,EAAM,IAAIZ,GAAcM,CAAE,EAC1BY,EAAKZ,EAAI,EACTW,EAAK,EACLG,EAAI,EACJD,EAAI,EACJE,EAAI,GAGCX,EAAK,cAAgB,OAEdA,EAAK,cAAgB,MADhCG,EAAMH,EAAK,MAAQJ,EAInBO,EAAMH,EAAK,OAAS,EAAEJ,GAEvBU,EAAKjB,GAAW,EAAIc,EAAKK,CAAG,EAC5BD,GAAMX,EAAE,GAAGU,EAAKpB,GAAMU,GAAGY,EAAIF,EAAGA,EAAK,EAGrCF,EAAK,CAAE,EAAK,CAAI,EAChBL,EAASN,GAAaW,EAAIR,EAAGM,CAAI,EAEjCG,EAAK,CAAE,EAAK,CAAI,EAChBR,EAAYH,GAAgBW,EAAIT,EAAGM,CAAI,EAGvCJ,EAAU,CAAC,EACXd,EAAqBc,EAAS,WAAYc,CAAY,EACtD7B,EAAae,EAAS,QAASE,EAAK,KAAM,EAC1CjB,EAAae,EAAS,gBAAiBS,CAAG,EAC1CvB,EAAqBc,EAAS,YAAae,CAAa,EACxD9B,EAAae,EAAS,KAAMU,CAAG,EAC/BxB,EAAqBc,EAAS,OAAQgB,CAAQ,EAC9C9B,EAAqBc,EAAS,KAAMiB,CAAS,EAC7C/B,EAAqBc,EAAS,MAAOkB,CAAO,EAC5ChC,EAAqBc,EAAS,MAAOmB,CAAO,EAC5ClC,EAAae,EAAS,MAAOE,EAAK,WAAY,EAC9CjB,EAAae,EAAS,SAAU,cAAgB,EAChDf,EAAae,EAAS,QAASoB,CAAM,EAE9BC,EASP,SAASA,EAAaC,EAAI,CACzB,IAAIC,EACJ,OAAK,UAAU,SAAW,EACpBZ,EAAIb,EACD,KAEDE,GAERW,GAAK,EAGLE,GAAKA,EAAE,GAAKf,EAGZC,EAAWuB,EAAGT,CAAE,EAChBZ,EAAQqB,EAAGT,CAAE,EAGbT,EAAKS,CAAE,EAAIS,EAENX,EAAIb,EACD,MAGHI,EAAK,cAAgB,MACzBU,GAAML,EAAG,CAAC,EAAED,EAAG,CAAC,GAAMC,EAAI,CAAE,EACjBL,EAAK,cAAgB,MAChCU,GAAMN,EAAG,CAAC,EAAEC,EAAG,CAAC,GAAMA,EAAI,CAAE,GAE5BgB,EAAKpC,GAAKoB,EAAG,CAAC,EAAED,EAAG,CAAC,EAAGA,EAAG,CAAC,EAAEC,EAAG,CAAC,CAAE,EACnCK,EAAIW,EAAKhB,EAAI,CAAE,GAETP,GACR,CAQA,SAASc,GAAc,CACtB,OAASF,EAAIH,CACd,CAQA,SAASM,GAAe,CACvB,OAAOH,CACR,CAQA,SAASI,GAAU,CAClB,OAAOT,EAAI,CAAE,CACd,CAQA,SAASU,GAAW,CACnB,OAAOV,EAAI,CAAE,CACd,CAQA,SAASW,GAAS,CACjB,OAAOZ,EAAI,CAAE,CACd,CAQA,SAASa,GAAS,CACjB,OAAOb,EAAI,CAAE,CACd,CAaA,SAASc,EAAOI,EAAU,CACzB,IAAIC,EACAC,EACAC,EAIJ,GAFAD,EAASxB,EAAK,OACduB,EAAWvB,EAAK,SACX,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACpB,GAAU0C,CAAQ,EACvB,MAAM,IAAI,UAAWlC,EAAQ,yDAA0DkC,CAAQ,CAAE,EAElG,GAAK3C,EAAY2C,EAAS,QAAS,EAAI,CACtC,GAAK,CAACzC,EAAmByC,EAAQ,MAAO,EACvC,MAAM,IAAI,UAAWlC,EAAQ,wEAAyE,SAAUkC,EAAQ,MAAO,CAAE,EAElIE,EAASF,EAAQ,MAClB,CACA,GAAK3C,EAAY2C,EAAS,UAAW,EAAI,CACxC,GAAK,CAACxC,GAAWwC,EAAQ,QAAS,EACjC,MAAM,IAAI,UAAWlC,EAAQ,+DAAgE,WAAYkC,EAAQ,QAAS,CAAE,EAE7HC,EAAWD,EAAQ,QACpB,CACD,CACA,OAAAG,EAAM,GACNA,GAAO3B,EAAQ,OACf2B,GAAO,OACPA,GAAO,2BACFzB,EAAK,cAAgB,MACzByB,GAAO,sBAAwBrB,EAAI,CAAE,EAAI,kBAC9BJ,EAAK,cAAgB,MAChCyB,GAAO,sBAAwBrB,EAAI,CAAE,EAAI,mBAEzCqB,GAAO,OACFpB,EAAG,CAAC,EAAED,EAAG,CAAC,EAAIA,EAAG,CAAC,EAAEC,EAAG,CAAC,EAC5BoB,GAAO,kBAAoBrB,EAAI,CAAE,EAAI,IAErCqB,GAAO,kBAAoBrB,EAAI,CAAE,EAAI,IAEtCqB,GAAO,kBAERA,GAAO,OACPA,GAAO,sBAAwBtC,EAAQoB,EAAI,CAACiB,CAAO,EAAI,KACvDC,GAAO,kBAAoBtC,EAAQuB,EAAG,CAACc,CAAO,EAAI,KAClDC,GAAO,WAAajB,EAAK,KACzBiB,GAAO,KACFF,IACJE,GAAO,kBACFf,EAAIH,EACRkB,GAAO,0CAA6CzB,EAAK,MAAM,IAAS,uBAExEyB,GAAO,kDAAqDzB,EAAK,MAAM,IAAS,uBAEjFyB,GAAO,MAEDA,CACR,CACD,CAKA/C,EAAO,QAAUiB,KClRjB,IAAI+B,GAAO,IAKX,OAAO,QAAUA",
+  "names": ["require_validate", "__commonJSMin", "exports", "module", "hasOwnProp", "isObject", "isNumber", "isString", "format", "isnan", "validate", "opts", "options", "require_defaults", "__commonJSMin", "exports", "module", "defaults", "require_minmax", "__commonJSMin", "exports", "module", "isPositiveZero", "isNegativeZero", "isnan", "PINF", "NINF", "incrmminmax", "out", "W", "buf", "min", "max", "N", "accumulator", "x", "i", "sgn", "v", "k", "require_meanstdev", "__commonJSMin", "exports", "module", "isnan", "sqrt", "incrmmeanstdev", "out", "W", "buf", "delta", "tmp", "M2", "mu", "d1", "d2", "N", "n", "accumulator", "x", "i", "k", "v", "require_main", "__commonJSMin", "exports", "module", "hasOwnProp", "isObject", "isPositiveInteger", "isBoolean", "setReadOnly", "setReadOnlyAccessor", "max", "sqrt", "roundn", "format", "tQuantile", "Float64Array", "validate", "defaults", "incrmminmax", "incrmmeanstdev", "incrmgrubbs", "W", "meanstdev", "results", "minmax", "opts", "err", "buf", "sig", "mm", "ms", "tc", "gc", "df", "N", "G", "i", "getRejected", "getStatistic", "getMean", "getStDev", "getMin", "getMax", "print", "accumulator", "x", "md", "options", "decision", "digits", "str", "main"]
+}

package/docs/types/index.d.ts CHANGED Viewed

@@ -16,7 +16,7 @@
 * limitations under the License.
 */
-// TypeScript Version: 2.0
+// TypeScript Version: 4.1
 /**
 * Interface defining function options.
@@ -120,7 +120,7 @@ type accumulator = ( x?: number ) => Results | null;
 * @returns accumulator function
 *
 * @example
-* var rnorm = require( `@stdlib/random/base/normal` );
+* var rnorm = require( '@stdlib/random-base-normal' );
 *
 * var accumulator;
 * var opts;

package/lib/defaults.js ADDED Viewed

@@ -0,0 +1,45 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2023 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.
+*/
+'use strict';
+// MAIN //
+/**
+* Returns default options.
+*
+* @private
+* @returns {Object} default options
+*
+* @example
+* var o = defaults();
+* // returns {...}
+*/
+function defaults() {
+	return {
+		'alpha': 0.05,
+		'alternative': 'two-sided',
+		'digits': 4,
+		'decision': true
+	};
+}
+// EXPORTS //
+module.exports = defaults;

package/lib/main.js CHANGED Viewed

@@ -24,16 +24,16 @@ var hasOwnProp = require( '@stdlib/assert-has-own-property' );
 var isObject = require( '@stdlib/assert-is-plain-object' );
 var isPositiveInteger = require( '@stdlib/assert-is-positive-integer' ).isPrimitive;
 var isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;
-var copy = require( '@stdlib/utils-copy' );
 var setReadOnly = require( '@stdlib/utils-define-read-only-property' );
 var setReadOnlyAccessor = require( '@stdlib/utils-define-read-only-accessor' );
 var max = require( '@stdlib/math-base-special-max' );
 var sqrt = require( '@stdlib/math-base-special-sqrt' );
 var roundn = require( '@stdlib/math-base-special-roundn' );
+var format = require( '@stdlib/string-format' );
 var tQuantile = require( '@stdlib/stats-base-dists-t-quantile' );
 var Float64Array = require( '@stdlib/array-float64' );
 var validate = require( './validate.js' );
-var defaults = require( './defaults.json' );
+var defaults = require( './defaults.js' );
 var incrmminmax = require( './minmax.js' );
 var incrmmeanstdev = require( './meanstdev.js' );
@@ -85,12 +85,12 @@ function incrmgrubbs( W ) {
 	var i;
 	if ( !isPositiveInteger( W ) ) {
-		throw new TypeError( 'invalid argument. Window size must be a positive integer. Value: `' + W + '`.' );
+		throw new TypeError( format( 'invalid argument. Window size must be a positive integer. Value: `%s`.', W ) );
 	}
 	if ( W < 3 ) {
-		throw new RangeError( 'invalid argument. Window size must be greater than or equal to 3. Value: `' + W + '`.' );
+		throw new RangeError( format( 'invalid argument. Window size must be greater than or equal to 3. Value: `%s`.', W ) );
 	}
-	opts = copy( defaults );
+	opts = defaults();
 	if ( arguments.length > 1 ) {
 		err = validate( opts, arguments[ 1 ] );
 		if ( err ) {
@@ -261,17 +261,17 @@ function incrmgrubbs( W ) {
 		decision = opts.decision;
 		if ( arguments.length > 0 ) {
 			if ( !isObject( options ) ) {
-				throw new TypeError( 'invalid argument. Must provide an object. Value: `' + options + '`.' );
+				throw new TypeError( format( 'invalid argument. Must provide an object. Value: `%s`.', options ) );
 			}
 			if ( hasOwnProp( options, 'digits' ) ) {
 				if ( !isPositiveInteger( options.digits ) ) {
-					throw new TypeError( 'invalid option. `digits` option must be a positive integer. Option: `' + options.digits + '`.' );
+					throw new TypeError( format( 'invalid option. `%s` option must be a positive integer. Option: `%s`.', 'digits', options.digits ) );
 				}
 				digits = options.digits;
 			}
 			if ( hasOwnProp( options, 'decision' ) ) {
 				if ( !isBoolean( options.decision ) ) {
-					throw new TypeError( 'invalid option. `decision` option must be boolean. Option: `' + options.decision + '`.' );
+					throw new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'decision', options.decision ) );
 				}
 				decision = options.decision;
 			}

package/lib/validate.js CHANGED Viewed

@@ -24,6 +24,7 @@ var hasOwnProp = require( '@stdlib/assert-has-own-property' );
 var isObject = require( '@stdlib/assert-is-plain-object' );
 var isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;
 var isString = require( '@stdlib/assert-is-string' ).isPrimitive;
+var format = require( '@stdlib/string-format' );
 var isnan = require( '@stdlib/assert-is-nan' );
@@ -54,21 +55,21 @@ var isnan = require( '@stdlib/assert-is-nan' );
 */
 function validate( opts, options ) {
 	if ( !isObject( options ) ) {
-		return new TypeError( 'invalid argument. Options argument must be an object. Value: `' + options + '`.' );
+		return new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );
 	}
 	if ( hasOwnProp( options, 'alpha' ) ) {
 		opts.alpha = options.alpha;
 		if ( !isNumber( opts.alpha ) || isnan( opts.alpha ) ) {
-			return new TypeError( 'invalid option. `alpha` option must be a number primitive. Option: `' + opts.alpha + '`.' );
+			return new TypeError( format( 'invalid option. `%s` option must be a number. Option: `%s`.', 'alpha', opts.alpha ) );
 		}
 		if ( opts.alpha < 0.0 || opts.alpha > 1.0 ) {
-			return new RangeError( 'invalid option. `alpha` option must be on the interval [0,1]. Option: `' + opts.alpha + '`.' );
+			return new RangeError( format( 'invalid option. `%s` option must be on the interval: [0, 1]. Option: `%f`.', 'alpha', opts.alpha ) );
 		}
 	}
 	if ( hasOwnProp( options, 'alternative' ) ) {
 		opts.alternative = options.alternative;
 		if ( !isString( opts.alternative ) ) {
-			return new TypeError( 'invalid option. `alternative` option must be a string primitive. Option: `' + opts.alternative + '`.' );
+			return new TypeError( format( 'invalid option. `%s` option must be a string. Option: `%s`.', 'alternative', opts.alternative ) );
 		}
 	}
 	return null;

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "@stdlib/stats-incr-mgrubbs",
-  "version": "0.0.6",
+  "version": "0.2.0",
   "description": "Moving Grubbs' test for outliers.",
   "license": "Apache-2.0",
   "author": {
@@ -37,41 +37,43 @@
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
   "dependencies": {
-    "@stdlib/array-float64": "^0.0.x",
-    "@stdlib/assert-has-own-property": "^0.0.x",
-    "@stdlib/assert-is-boolean": "^0.0.x",
-    "@stdlib/assert-is-nan": "^0.0.x",
-    "@stdlib/assert-is-number": "^0.0.x",
-    "@stdlib/assert-is-plain-object": "^0.0.x",
-    "@stdlib/assert-is-positive-integer": "^0.0.x",
-    "@stdlib/assert-is-string": "^0.0.x",
-    "@stdlib/constants-float64-ninf": "^0.0.x",
-    "@stdlib/constants-float64-pinf": "^0.0.x",
-    "@stdlib/math-base-assert-is-nan": "^0.0.x",
-    "@stdlib/math-base-assert-is-negative-zero": "^0.0.x",
-    "@stdlib/math-base-assert-is-positive-zero": "^0.0.x",
-    "@stdlib/math-base-special-max": "^0.0.x",
-    "@stdlib/math-base-special-roundn": "^0.0.x",
-    "@stdlib/math-base-special-sqrt": "^0.0.x",
-    "@stdlib/stats-base-dists-t-quantile": "^0.0.x",
-    "@stdlib/utils-copy": "^0.0.x",
-    "@stdlib/utils-define-read-only-accessor": "^0.0.x",
-    "@stdlib/utils-define-read-only-property": "^0.0.x"
+    "@stdlib/array-float64": "^0.2.0",
+    "@stdlib/assert-has-own-property": "^0.2.0",
+    "@stdlib/assert-is-boolean": "^0.2.0",
+    "@stdlib/assert-is-nan": "^0.2.0",
+    "@stdlib/assert-is-number": "^0.2.0",
+    "@stdlib/assert-is-plain-object": "^0.2.0",
+    "@stdlib/assert-is-positive-integer": "^0.2.0",
+    "@stdlib/assert-is-string": "^0.2.0",
+    "@stdlib/constants-float64-ninf": "^0.2.0",
+    "@stdlib/constants-float64-pinf": "^0.2.0",
+    "@stdlib/math-base-assert-is-nan": "^0.2.0",
+    "@stdlib/math-base-assert-is-negative-zero": "^0.2.0",
+    "@stdlib/math-base-assert-is-positive-zero": "^0.2.0",
+    "@stdlib/math-base-special-max": "^0.2.0",
+    "@stdlib/math-base-special-roundn": "^0.2.0",
+    "@stdlib/math-base-special-sqrt": "^0.2.0",
+    "@stdlib/stats-base-dists-t-quantile": "^0.2.0",
+    "@stdlib/string-format": "^0.2.0",
+    "@stdlib/utils-define-read-only-accessor": "^0.2.0",
+    "@stdlib/utils-define-read-only-property": "^0.2.0",
+    "@stdlib/error-tools-fmtprodmsg": "^0.2.0"
   },
   "devDependencies": {
-    "@stdlib/assert-is-function": "^0.0.x",
-    "@stdlib/bench": "^0.0.x",
-    "@stdlib/datasets-herndon-venus-semidiameters": "^0.0.x",
-    "@stdlib/datasets-suthaharan-single-hop-sensor-network": "^0.0.x",
-    "@stdlib/random-base-normal": "^0.0.x",
-    "@stdlib/random-base-randu": "^0.0.x",
-    "@stdlib/stats-incr-mmax": "^0.0.x",
-    "@stdlib/stats-incr-mmean": "^0.0.x",
-    "@stdlib/stats-incr-mmin": "^0.0.x",
-    "@stdlib/stats-incr-mstdev": "^0.0.x",
+    "@stdlib/assert-is-function": "^0.2.0",
+    "@stdlib/datasets-herndon-venus-semidiameters": "^0.2.0",
+    "@stdlib/datasets-suthaharan-single-hop-sensor-network": "^0.2.0",
+    "@stdlib/random-base-normal": "^0.1.0",
+    "@stdlib/random-base-randu": "^0.1.0",
+    "@stdlib/stats-incr-mmax": "^0.2.0",
+    "@stdlib/stats-incr-mmean": "^0.2.0",
+    "@stdlib/stats-incr-mmin": "^0.2.0",
+    "@stdlib/stats-incr-mstdev": "^0.2.0",
     "tape": "git+https://github.com/kgryte/tape.git#fix/globby",
     "istanbul": "^0.4.1",
-    "tap-spec": "5.x.x"
+    "tap-min": "git+https://github.com/Planeshifter/tap-min.git",
+    "@stdlib/bench-harness": "^0.2.0",
+    "@stdlib/bench": "^0.3.1"
   },
   "engines": {
     "node": ">=0.10.0",
@@ -120,7 +122,7 @@
     "moving"
   ],
   "funding": {
-    "type": "patreon",
-    "url": "https://www.patreon.com/athan"
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
   }
 }

package/docs/repl.txt DELETED Viewed

@@ -1,81 +0,0 @@
-{{alias}}( W[, options] )
-    Returns an accumulator function which incrementally performs a moving
-    Grubbs' test for detecting outliers.
-    Grubbs' test assumes that data is normally distributed. Accordingly, one
-    should first verify that the data can be reasonably approximated by a normal
-    distribution before applying the Grubbs' test.
-    The `W` parameter defines the number of values over which to perform Grubbs'
-    test. The minimum window size is 3.
-    If provided a value, the accumulator function returns updated test results.
-    If not provided a value, the accumulator function returns the current test
-    results.
-    Until provided `W` values, the accumulator function returns `null`.
-    The accumulator function returns an object having the following fields:
-    - rejected: boolean indicating whether the null hypothesis should be
-    rejected.
-    - alpha: significance level.
-    - criticalValue: critical value.
-    - statistic: test statistic.
-    - df: degrees of freedom.
-    - mean: sample mean.
-    - sd: corrected sample standard deviation.
-    - min: minimum value.
-    - max: maximum value.
-    - alt: alternative hypothesis.
-    - method: method name.
-    - print: method for pretty-printing test output.
-    Parameters
-    ----------
-    W: integer
-        Window size.
-    options: Object (optional)
-        Function options.
-    options.alpha: number (optional)
-        Significance level. Default: 0.05.
-    options.alternative: string (optional)
-        Alternative hypothesis. The option may be one of the following values:
-        - 'two-sided': test whether the minimum or maximum value is an outlier.
-        - 'min': test whether the minimum value is an outlier.
-        - 'max': test whether the maximum value is an outlier.
-        Default: 'two-sided'.
-    Returns
-    -------
-    acc: Function
-        Accumulator function.
-    Examples
-    --------
-    > var acc = {{alias}}( 20 );
-    > var res = acc()
-    null
-    > for ( var i = 0; i < 200; i++ ) {
-    ...     res = acc( {{alias:@stdlib/random/base/normal}}( 10.0, 5.0 ) );
-    ... };
-    > res.print()
-    References
-    ----------
-    - Grubbs, Frank E. 1950. "Sample Criteria for Testing Outlying
-    Observations." _The Annals of Mathematical Statistics_ 21 (1). The Institute
-    of Mathematical Statistics: 27–58. doi:10.1214/aoms/1177729885.
-    - Grubbs, Frank E. 1969. "Procedures for Detecting Outlying Observations in
-    Samples." _Technometrics_ 11 (1). Taylor & Francis: 1–21. doi:10.1080/
-    00401706.1969.10490657.
-    See Also
-    --------

package/docs/types/test.ts DELETED Viewed

@@ -1,103 +0,0 @@
-/*
-* @license Apache-2.0
-*
-* Copyright (c) 2021 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.
-*/
-import incrmgrubbs = require( './index' );
-// TESTS //
-// The function returns an accumulator function...
-{
-	incrmgrubbs( 20 ); // $ExpectType accumulator
-	incrmgrubbs( 20, { 'alpha': 0.1 } ); // $ExpectType accumulator
-	incrmgrubbs( 20, { 'alternative': 'max' } ); // $ExpectType accumulator
-}
-// The compiler throws an error if the function is provided a first argument that is not a number...
-{
-	incrmgrubbs( 'abc' ); // $ExpectError
-	incrmgrubbs( true ); // $ExpectError
-	incrmgrubbs( false ); // $ExpectError
-	incrmgrubbs( null ); // $ExpectError
-	incrmgrubbs( undefined ); // $ExpectError
-	incrmgrubbs( [] ); // $ExpectError
-	incrmgrubbs( {} ); // $ExpectError
-	incrmgrubbs( ( x: number ): number => x ); // $ExpectError
-}
-// The compiler throws an error if the function is provided a second argument which is not an options object...
-{
-	incrmgrubbs( 20, '5' ); // $ExpectError
-	incrmgrubbs( 20, 5 ); // $ExpectError
-	incrmgrubbs( 20, true ); // $ExpectError
-	incrmgrubbs( 20, false ); // $ExpectError
-	incrmgrubbs( 20, null ); // $ExpectError
-	incrmgrubbs( 20, [] ); // $ExpectError
-	incrmgrubbs( 20, ( x: number ): number => x ); // $ExpectError
-}
-// The compiler throws an error if the function is provided an `alpha` option which is not a number...
-{
-	incrmgrubbs( 20, { 'alpha': 'abc' } ); // $ExpectError
-	incrmgrubbs( 20, { 'alpha': '123' } ); // $ExpectError
-	incrmgrubbs( 20, { 'alpha': true } ); // $ExpectError
-	incrmgrubbs( 20, { 'alpha': false } ); // $ExpectError
-	incrmgrubbs( 20, { 'alpha': null } ); // $ExpectError
-	incrmgrubbs( 20, { 'alpha': [] } ); // $ExpectError
-	incrmgrubbs( 20, { 'alpha': {} } ); // $ExpectError
-	incrmgrubbs( 20, { 'alpha': ( x: number ): number => x } ); // $ExpectError
-}
-// The compiler throws an error if the function is provided an `alternative` option which is not a recognized alternative...
-{
-	incrmgrubbs( 20, { 'alternative': 'abc' } ); // $ExpectError
-	incrmgrubbs( 20, { 'alternative': 123 } ); // $ExpectError
-	incrmgrubbs( 20, { 'alternative': true } ); // $ExpectError
-	incrmgrubbs( 20, { 'alternative': false } ); // $ExpectError
-	incrmgrubbs( 20, { 'alternative': null } ); // $ExpectError
-	incrmgrubbs( 20, { 'alternative': [] } ); // $ExpectError
-	incrmgrubbs( 20, { 'alternative': {} } ); // $ExpectError
-	incrmgrubbs( 20, { 'alternative': ( x: number ): number => x } ); // $ExpectError
-}
-// The compiler throws an error if the function is provided an invalid number of arguments...
-{
-	incrmgrubbs(); // $ExpectError
-	incrmgrubbs( 3, {}, {} ); // $ExpectError
-}
-// The function returns an accumulator function which returns an accumulated result...
-{
-	const acc = incrmgrubbs( 5 );
-	acc(); // $ExpectType Results | null
-	acc( 3.14 ); // $ExpectType Results | null
-}
-// The compiler throws an error if the returned accumulator function is provided invalid arguments...
-{
-	const acc = incrmgrubbs( 5 );
-	acc( 'abc' ); // $ExpectError
-	acc( true ); // $ExpectError
-	acc( false ); // $ExpectError
-	acc( null ); // $ExpectError
-	acc( [] ); // $ExpectError
-	acc( {} ); // $ExpectError
-	acc( ( x: number ): number => x ); // $ExpectError
-}

package/lib/defaults.json DELETED Viewed

@@ -1,6 +0,0 @@
-{
-	"alpha": 0.05,
-	"alternative": "two-sided",
-	"digits": 4,
-	"decision": true
-}