@stdlib/stats-incr-pcorrdistmat 0.0.7 → 0.1.0

package/CITATION.cff

@@ -0,0 +1,30 @@
+cff-version: 1.2.0
+title: stdlib
+message: >-
+  If you use this software, please cite it using the
+  metadata from this file.
+
+type: software
+
+authors:
+  - name: The Stdlib Authors
+    url: https://github.com/stdlib-js/stdlib/graphs/contributors
+
+repository-code: https://github.com/stdlib-js/stdlib
+url: https://stdlib.io
+
+abstract: |
+  Standard library for JavaScript and Node.js.
+
+keywords:
+  - JavaScript
+  - Node.js
+  - TypeScript
+  - standard library
+  - scientific computing
+  - numerical computing
+  - statistical computing
+
+license: Apache-2.0 AND BSL-1.0
+
+date-released: 2016

package/LICENSE

@@ -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

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

package/README.md

@@ -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>
+
 # incrpcorrdistmat
 
 [![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
@@ -219,8 +230,8 @@ for ( i = 0; i < 100; i++ ) {
 
 ## See Also
 
--   <span class="package-name">[`@stdlib/stats/incr/pcorrdist`][@stdlib/stats/incr/pcorrdist]</span><span class="delimiter">: </span><span class="description">compute a sample Pearson product-moment correlation distance.</span>
--   <span class="package-name">[`@stdlib/stats/incr/pcorrmat`][@stdlib/stats/incr/pcorrmat]</span><span class="delimiter">: </span><span class="description">compute a sample Pearson product-moment correlation matrix incrementally.</span>
+-   <span class="package-name">[`@stdlib/stats-incr/pcorrdist`][@stdlib/stats/incr/pcorrdist]</span><span class="delimiter">: </span><span class="description">compute a sample Pearson product-moment correlation distance.</span>
+-   <span class="package-name">[`@stdlib/stats-incr/pcorrmat`][@stdlib/stats/incr/pcorrmat]</span><span class="delimiter">: </span><span class="description">compute a sample Pearson product-moment correlation matrix incrementally.</span>
 
 </section>
 
@@ -252,7 +263,7 @@ See [LICENSE][stdlib-license].
 
 ## Copyright
 
-Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
+Copyright &copy; 2016-2023. The Stdlib [Authors][stdlib-authors].
 
 </section>
 
@@ -265,8 +276,8 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/stats-incr-pcorrdistmat.svg
 [npm-url]: https://npmjs.org/package/@stdlib/stats-incr-pcorrdistmat
 
-[test-image]: https://github.com/stdlib-js/stats-incr-pcorrdistmat/actions/workflows/test.yml/badge.svg
-[test-url]: https://github.com/stdlib-js/stats-incr-pcorrdistmat/actions/workflows/test.yml
+[test-image]: https://github.com/stdlib-js/stats-incr-pcorrdistmat/actions/workflows/test.yml/badge.svg?branch=v0.1.0
+[test-url]: https://github.com/stdlib-js/stats-incr-pcorrdistmat/actions/workflows/test.yml?query=branch:v0.1.0
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/stats-incr-pcorrdistmat/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/stats-incr-pcorrdistmat?branch=main
@@ -278,19 +289,20 @@ 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-pcorrdistmat/tree/deno
 [umd-url]: https://github.com/stdlib-js/stats-incr-pcorrdistmat/tree/umd
 [esm-url]: https://github.com/stdlib-js/stats-incr-pcorrdistmat/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
+[branches-url]: https://github.com/stdlib-js/stats-incr-pcorrdistmat/blob/main/branches.md
 
 [stdlib-license]: https://raw.githubusercontent.com/stdlib-js/stats-incr-pcorrdistmat/main/LICENSE
 

package/dist/index.d.ts

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

package/dist/index.js

@@ -0,0 +1,5 @@
+"use strict";var I=function(i,o){return function(){return o||i((o={exports:{}}).exports,o),o.exports}};var S=I(function(K,P){
+var L=require('@stdlib/assert-is-positive-integer/dist').isPrimitive,z=require('@stdlib/assert-is-square-matrix/dist'),b=require('@stdlib/assert-is-vector-like/dist'),E=require('@stdlib/array-float64/dist'),x=require('@stdlib/error-tools-fmtprodmsg/dist'),M=require('@stdlib/math-base-special-sqrt/dist'),B=require('@stdlib/ndarray-ctor/dist'),F=require('@stdlib/ndarray-base-ctor/dist'),T=require('@stdlib/ndarray-base-numel/dist');function A(i,o){var e,s,c,u;return o?u=F:u=B,s=new E(i*i),c=[i,i],e=[i,1],u("float64",s,c,e,0,"row-major")}function D(i){var o,e,s;return e=new E(i),s=[i],o=[1],F("float64",e,s,o,0,"row-major")}function G(i,o){var e,s,c,u,q,l,h,v;if(v=0,L(i))e=i,s=A(e,!1);else if(z(i))e=i.shape[0],s=i;else throw new TypeError(x('1JdDe',i));if(h=new E(e),c=new E(e),u=new E(e),l=A(e,!0),arguments.length>1){if(!b(o))throw new TypeError(x('1JdDc',o));if(T(o.shape)!==e)throw new Error(x('1Jd9f',e,T(o.shape)));return q=o,C}return q=D(e),k;function k(d){var w,g,m,p,a,t,y,f,j,V,r,n;if(arguments.length===0)return v===0?null:s;if(!b(d))throw new TypeError(x('1JdDd',d));if(d.shape[0]!==e)throw new Error(x('1Jd9g',e,d.shape[0]));if(j=v,v+=1,V=j/v,w=j||1,v===1)for(r=0;r<e;r++)for(y=d.get(r),f=q.get(r),t=y-f,f+=t/v,q.set(r,f),h[r]=t,c[r]+=t*(y-f),u[r]=M(c[r]/w),g=V*h[r],n=0;n<=r;n++)m=l.get(r,n)+g*h[n],l.set(r,n,m),l.set(n,r,m);else for(r=0;r<e;r++)for(y=d.get(r),f=q.get(r),t=y-f,f+=t/v,q.set(r,f),h[r]=t,c[r]+=t*(y-f),u[r]=M(c[r]/w),g=V*h[r],a=u[r],n=0;n<r;n++)m=l.get(r,n)+g*h[n],l.set(r,n,m),l.set(n,r,m),p=1-m/w/(a*u[n]),s.set(r,n,p),s.set(n,r,p);return s}function C(d){var w,g,m,p,a,t;if(arguments.length===0)return v===0?null:s;if(!b(d))throw new TypeError(x('1JdDd',d));if(d.shape[0]!==e)throw new Error(x('1Jd9h',e,d.shape[0]));for(v+=1,a=0;a<e;a++)for(p=d.get(a)-q.get(a),h[a]=p,c[a]+=p*p,u[a]=M(c[a]/v),m=u[a],t=0;t<a;t++)g=l.get(a,t)+p*h[t],l.set(a,t,g),l.set(t,a,g),w=1-g/v/(m*u[t]),s.set(a,t,w),s.set(t,a,w);return s}}P.exports=G
+});var H=S();module.exports=H;
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../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 isPositiveInteger = require( '@stdlib/assert-is-positive-integer' ).isPrimitive;\nvar isSquareMatrix = require( '@stdlib/assert-is-square-matrix' );\nvar isVectorLike = require( '@stdlib/assert-is-vector-like' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar format = require( '@stdlib/string-format' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar ctor = require( '@stdlib/ndarray-ctor' );\nvar bctor = require( '@stdlib/ndarray-base-ctor' );\nvar numel = require( '@stdlib/ndarray-base-numel' );\n\n\n// FUNCTIONS //\n\n/**\n* Returns a matrix.\n*\n* @private\n* @param {PositiveInteger} n - matrix order\n* @param {boolean} bool - boolean indicating whether to create a low-level ndarray\n* @returns {ndarray} matrix\n*/\nfunction createMatrix( n, bool ) {\n\tvar strides;\n\tvar buffer;\n\tvar shape;\n\tvar f;\n\n\tif ( bool ) {\n\t\tf = bctor;\n\t} else {\n\t\tf = ctor;\n\t}\n\tbuffer = new Float64Array( n*n );\n\tshape = [ n, n ];\n\tstrides = [ n, 1 ];\n\treturn f( 'float64', buffer, shape, strides, 0, 'row-major' );\n}\n\n/**\n* Returns a vector.\n*\n* @private\n* @param {PositiveInteger} N - number of elements\n* @returns {ndarray} vector\n*/\nfunction createVector( N ) {\n\tvar strides;\n\tvar buffer;\n\tvar shape;\n\n\tbuffer = new Float64Array( N );\n\tshape = [ N ];\n\tstrides = [ 1 ];\n\n\treturn bctor( 'float64', buffer, shape, strides, 0, 'row-major' );\n}\n\n\n// MAIN //\n\n/**\n* Returns an accumulator function which incrementally computes a sample Pearson product-moment correlation distance matrix.\n*\n* ## Method\n*\n* -   For each sample Pearson product-moment correlation distance, we begin by defining the co-moment \\\\(C_{jn}\\\\)\n*\n*     ```tex\n*     C_n = \\sum_{i=1}^{n} ( x_i - \\bar{x}_n ) ( y_i - \\bar{y}_n )\n*     ```\n*\n*     where \\\\(\\bar{x}_n\\\\) and \\\\(\\bar{y}_n\\\\) are the sample means for \\\\(x\\\\) and \\\\(y\\\\), respectively.\n*\n* -   Based on Welford's method, we know the update formulas for the sample means are given by\n*\n*     ```tex\n*     \\bar{x}_n = \\bar{x}_{n-1} + \\frac{x_n - \\bar{x}_{n-1}}{n}\n*     ```\n*\n*     and\n*\n*     ```tex\n*     \\bar{y}_n = \\bar{y}_{n-1} + \\frac{y_n - \\bar{y}_{n-1}}{n}\n*     ```\n*\n* -   Substituting into the equation for \\\\(C_n\\\\) and rearranging terms\n*\n*     ```tex\n*     C_n = C_{n-1} + (x_n - \\bar{x}_n) (y_n - \\bar{y}_{n-1})\n*     ```\n*\n*     where the apparent asymmetry arises from\n*\n*     ```tex\n*     x_n - \\bar{x}_n = \\frac{n-1}{n} (x_n - \\bar{x}_{n-1})\n*     ```\n*\n*     and, hence, the update term can be equivalently expressed\n*\n*     ```tex\n*     \\frac{n-1}{n} (x_n - \\bar{x}_{n-1}) (y_n - \\bar{y}_{n-1})\n*     ```\n*\n* -   The covariance can be defined\n*\n*     ```tex\n*     \\begin{align*}\n*     \\operatorname{cov}_n(x,y) &= \\frac{C_n}{n} \\\\\n*     &= \\frac{C_{n-1} + \\frac{n-1}{n} (x_n - \\bar{x}_{n-1}) (y_n - \\bar{y}_{n-1})}{n} \\\\\n*     &= \\frac{(n-1)\\operatorname{cov}_{n-1}(x,y) + \\frac{n-1}{n} (x_n - \\bar{x}_{n-1}) (y_n - \\bar{y}_{n-1})}{n}\n*     \\end{align*}\n*     ```\n*\n* -   Applying Bessel's correction, we arrive at an update formula for calculating an unbiased sample covariance\n*\n*     ```tex\n*     \\begin{align*}\n*     \\operatorname{cov}_n(x,y) &= \\frac{n}{n-1}\\cdot\\frac{(n-1)\\operatorname{cov}_{n-1}(x,y) + \\frac{n-1}{n} (x_n - \\bar{x}_{n-1}) (y_n - \\bar{y}_{n-1})}{n} \\\\\n*     &= \\operatorname{cov}_{n-1}(x,y) + \\frac{(x_n - \\bar{x}_{n-1}) (y_n - \\bar{y}_{n-1})}{n} \\\\\n*     &= \\frac{C_{n-1}}{n-1} + \\frac{(x_n - \\bar{x}_{n-1}) (y_n - \\bar{y}_{n-1})}{n}\n*     &= \\frac{C_{n-1} + \\frac{n-1}{n} (x_n - \\bar{x}_{n-1}) (y_n - \\bar{y}_{n-1})}{n-1}\n*     \\end{align*}\n*     ```\n*\n* -   To calculate the corrected sample standard deviation, we can use Welford's method, which can be derived as follows. We can express the variance as\n*\n*     ```tex\n*     \\begin{align*}\n*     S_n &= n \\sigma_n^2 \\\\\n*         &= \\sum_{i=1}^{n} (x_i - \\mu_n)^2 \\\\\n*         &= \\biggl(\\sum_{i=1}^{n} x_i^2 \\biggr) - n\\mu_n^2\n*     \\end{align*}\n*     ```\n*\n*     Accordingly,\n*\n*     ```tex\n*     \\begin{align*}\n*     S_n - S_{n-1} &= \\sum_{i=1}^{n} x_i^2 - n\\mu_n^2 - \\sum_{i=1}^{n-1} x_i^2 + (n-1)\\mu_{n-1}^2 \\\\\n*                   &= x_n^2 - n\\mu_n^2 + (n-1)\\mu_{n-1}^2 \\\\\n*                   &= x_n^2 - \\mu_{n-1}^2 + n(\\mu_{n-1}^2 - \\mu_n^2) \\\\\n*                   &= x_n^2 - \\mu_{n-1}^2 + n(\\mu_{n-1} - \\mu_n)(\\mu_{n-1} + \\mu_n) \\\\\n*                   &= x_n^2 - \\mu_{n-1}^2 + (\\mu_{n-1} - x_n)(\\mu_{n-1} + \\mu_n) \\\\\n*                   &= x_n^2 - \\mu_{n-1}^2 + \\mu_{n-1}^2 - x_n\\mu_n - x_n\\mu_{n-1} + \\mu_n\\mu_{n-1} \\\\\n*                   &= x_n^2 - x_n\\mu_n - x_n\\mu_{n-1} + \\mu_n\\mu_{n-1} \\\\\n*                   &= (x_n - \\mu_{n-1})(x_n - \\mu_n) \\\\\n*                   &= S_{n-1} + (x_n - \\mu_{n-1})(x_n - \\mu_n)\n*     \\end{align*}\n*     ```\n*\n*     where we use the identity\n*\n*     ```tex\n*     x_n - \\mu_{n-1} = n (\\mu_n - \\mu_{n-1})\n*     ```\n*\n* -   To compute the corrected sample standard deviation, we apply Bessel's correction and take the square root.\n*\n* -   The sample Pearson product-moment correlation coefficient can thus be calculated as\n*\n*     ```tex\n*     r = \\frac{\\operatorname{cov}_n(x,y)}{\\sigma_x \\sigma_y}\n*     ```\n*\n*     where \\\\(\\sigma_x\\\\) and \\\\(\\sigma_y\\\\) are the corrected sample standard deviations for \\\\(x\\\\) and \\\\(y\\\\), respectively.\n*\n* -   The sample Pearson product-moment correlation distance is defined as\n*\n*     ```tex\n*     d = 1 - r = 1 - \\frac{\\operatorname{cov}_n(x,y)}{\\sigma_x \\sigma_y}\n*     ```\n*\n* -   The implementation thus computes each sample Pearson product-moment correlation coefficient \\\\(r\\\\) and subtracts each coefficient from 1.\n*\n* @param {(PositiveInteger|ndarray)} out - order of the correlation distance matrix or a square 2-dimensional output ndarray for storing the correlation distance matrix\n* @param {ndarray} [means] - mean values\n* @throws {TypeError} first argument must be either a positive integer or a 2-dimensional ndarray having equal dimensions\n* @throws {TypeError} second argument must be a 1-dimensional ndarray\n* @throws {Error} number of means must match correlation distance matrix dimensions\n* @returns {Function} accumulator function\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray = require( '@stdlib/ndarray-ctor' );\n*\n* // Create an output correlation distance matrix:\n* var buffer = new Float64Array( 4 );\n* var shape = [ 2, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n* var order = 'row-major';\n*\n* var dist = ndarray( 'float64', buffer, shape, strides, offset, order );\n*\n* // Create a correlation distance matrix accumulator:\n* var accumulator = incrpcorrdistmat( dist );\n*\n* var out = accumulator();\n* // returns null\n*\n* // Create a data vector:\n* buffer = new Float64Array( 2 );\n* shape = [ 2 ];\n* strides = [ 1 ];\n*\n* var vec = ndarray( 'float64', buffer, shape, strides, offset, order );\n*\n* // Provide data to the accumulator:\n* vec.set( 0, 2.0 );\n* vec.set( 1, 1.0 );\n*\n* out = accumulator( vec );\n* // returns <ndarray>\n*\n* var bool = ( out === dist );\n* // returns true\n*\n* vec.set( 0, -5.0 );\n* vec.set( 1, 3.14 );\n*\n* out = accumulator( vec );\n* // returns <ndarray>\n*\n* // Retrieve the correlation distance matrix:\n* out = accumulator();\n* // returns <ndarray>\n*/\nfunction incrpcorrdistmat( out, means ) {\n\tvar order;\n\tvar dist;\n\tvar M2;\n\tvar sd;\n\tvar mu;\n\tvar C;\n\tvar d;\n\tvar N;\n\n\tN = 0;\n\tif ( isPositiveInteger( out ) ) {\n\t\torder = out;\n\t\tdist = createMatrix( order, false );\n\t} else if ( isSquareMatrix( out ) ) {\n\t\torder = out.shape[ 0 ];\n\t\tdist = out;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must either specify the order of the correlation distance matrix or be a square two-dimensional ndarray for storing the correlation distance matrix. Value: `%s`.', out ) );\n\t}\n\t// Create a scratch array for storing residuals (i.e., `x_i - xbar_{i-1}`):\n\td = new Float64Array( order );\n\n\t// Create a scratch array for storing second moments:\n\tM2 = new Float64Array( order );\n\n\t// Create a scratch array for storing standard deviations:\n\tsd = new Float64Array( order );\n\n\t// Create a low-level scratch matrix for storing co-moments:\n\tC = createMatrix( order, true );\n\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isVectorLike( means ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a one-dimensional ndarray. Value: `%s`.', means ) );\n\t\t}\n\t\tif ( numel( means.shape ) !== order ) {\n\t\t\tthrow new Error( format( 'invalid argument. The number of elements (means) in the second argument must match correlation distance matrix dimensions. Expected: `%u`. Actual: `%u`.', order, numel( means.shape ) ) );\n\t\t}\n\t\tmu = means; // TODO: should we copy this? Otherwise, internal state could be \"corrupted\" due to mutation outside the accumulator\n\t\treturn accumulator2;\n\t}\n\t// Create an ndarray vector for storing sample means (note: an ndarray interface is not necessary, but it reduces implementation complexity by ensuring a consistent abstraction for accessing and updating sample means):\n\tmu = createVector( order );\n\n\treturn accumulator1;\n\n\t/**\n\t* If provided a data vector, the accumulator function returns an updated sample correlation distance matrix. If not provided a data vector, the accumulator function returns the current sample correlation distance matrix.\n\t*\n\t* @private\n\t* @param {ndarray} [v] - data vector\n\t* @throws {TypeError} must provide a 1-dimensional ndarray\n\t* @throws {Error} vector length must match correlation distance matrix dimensions\n\t* @returns {(ndarray|null)} sample correlation distance matrix or null\n\t*/\n\tfunction accumulator1( v ) {\n\t\tvar denom;\n\t\tvar rdx;\n\t\tvar cij;\n\t\tvar dij;\n\t\tvar sdi;\n\t\tvar di;\n\t\tvar vi;\n\t\tvar m;\n\t\tvar n;\n\t\tvar r;\n\t\tvar i;\n\t\tvar j;\n\t\tif ( arguments.length === 0 ) {\n\t\t\tif ( N === 0 ) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\treturn dist;\n\t\t}\n\t\tif ( !isVectorLike( v ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a one-dimensional ndarray. Value: `%s`.', v ) );\n\t\t}\n\t\tif ( v.shape[ 0 ] !== order ) {\n\t\t\tthrow new Error( format( 'invalid argument. Vector length must match correlation matrix dimensions. Expected: `%u`. Actual: `%u`.', order, v.shape[ 0 ] ) );\n\t\t}\n\t\tn = N;\n\t\tN += 1;\n\t\tr = n / N;\n\n\t\tdenom = n || 1; // Bessel's correction (avoiding divide-by-zero below)\n\n\t\tif ( N === 1 ) {\n\t\t\tfor ( i = 0; i < order; i++ ) {\n\t\t\t\tvi = v.get( i );\n\t\t\t\tm = mu.get( i );\n\n\t\t\t\t// Compute the residual:\n\t\t\t\tdi = vi - m;\n\n\t\t\t\t// Update the sample mean:\n\t\t\t\tm += di / N;\n\t\t\t\tmu.set( i, m );\n\n\t\t\t\t// Update the sample standard deviation:\n\t\t\t\td[ i ] = di;\n\t\t\t\tM2[ i ] += di * ( vi-m );\n\t\t\t\tsd[ i ] = sqrt( M2[i]/denom );\n\n\t\t\t\t// Update the co-moments and correlation distance matrix, recognizing that the matrices are symmetric...\n\t\t\t\trdx = r * d[i]; // if `n=0`, `r=0.0`\n\t\t\t\tfor ( j = 0; j <= i; j++ ) {\n\t\t\t\t\tcij = C.get( i, j ) + ( rdx*d[j] );\n\t\t\t\t\tC.set( i, j, cij );\n\t\t\t\t\tC.set( j, i, cij ); // via symmetry\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor ( i = 0; i < order; i++ ) {\n\t\t\t\tvi = v.get( i );\n\t\t\t\tm = mu.get( i );\n\n\t\t\t\t// Compute the residual:\n\t\t\t\tdi = vi - m;\n\n\t\t\t\t// Update the sample mean:\n\t\t\t\tm += di / N;\n\t\t\t\tmu.set( i, m );\n\n\t\t\t\t// Update the sample standard deviation:\n\t\t\t\td[ i ] = di;\n\t\t\t\tM2[ i ] += di * ( vi-m );\n\t\t\t\tsd[ i ] = sqrt( M2[i]/denom );\n\n\t\t\t\t// Update the co-moments and correlation distance matrix, recognizing that the matrices are symmetric...\n\t\t\t\trdx = r * d[i];\n\t\t\t\tsdi = sd[ i ];\n\t\t\t\tfor ( j = 0; j < i; j++ ) {\n\t\t\t\t\tcij = C.get( i, j ) + ( rdx*d[j] );\n\t\t\t\t\tC.set( i, j, cij );\n\t\t\t\t\tC.set( j, i, cij ); // via symmetry\n\n\t\t\t\t\tdij = 1.0 - ( (cij/denom)/(sdi*sd[j]) );\n\t\t\t\t\tdist.set( i, j, dij );\n\t\t\t\t\tdist.set( j, i, dij ); // via symmetry\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dist;\n\t}\n\n\t/**\n\t* If provided a data vector, the accumulator function returns an updated sample correlation distance matrix. If not provided a data vector, the accumulator function returns the current sample correlation distance matrix.\n\t*\n\t* @private\n\t* @param {ndarray} [v] - data vector\n\t* @throws {TypeError} must provide a 1-dimensional ndarray\n\t* @throws {Error} vector length must match correlation distance matrix dimensions\n\t* @returns {(ndarray|null)} sample correlation distance matrix or null\n\t*/\n\tfunction accumulator2( v ) {\n\t\tvar dij;\n\t\tvar cij;\n\t\tvar sdi;\n\t\tvar di;\n\t\tvar i;\n\t\tvar j;\n\t\tif ( arguments.length === 0 ) {\n\t\t\tif ( N === 0 ) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\treturn dist;\n\t\t}\n\t\tif ( !isVectorLike( v ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a one-dimensional ndarray. Value: `%s`.', v ) );\n\t\t}\n\t\tif ( v.shape[ 0 ] !== order ) {\n\t\t\tthrow new Error( format( 'invalid argument. Vector length must match correlation distance matrix dimensions. Expected: `%u`. Actual: `%u`.', order, v.shape[ 0 ] ) );\n\t\t}\n\t\tN += 1;\n\t\tfor ( i = 0; i < order; i++ ) {\n\t\t\t// Compute the residual:\n\t\t\tdi = v.get( i ) - mu.get( i );\n\n\t\t\t// Update standard deviation:\n\t\t\td[ i ] = di;\n\t\t\tM2[ i ] += di * di;\n\t\t\tsd[ i ] = sqrt( M2[i]/N );\n\n\t\t\t// Update the co-moments and correlation distance matrix, recognizing that the matrices are symmetric...\n\t\t\tsdi = sd[ i ];\n\t\t\tfor ( j = 0; j < i; j++ ) {\n\t\t\t\tcij = C.get( i, j ) + ( di*d[j] );\n\t\t\t\tC.set( i, j, cij );\n\t\t\t\tC.set( j, i, cij ); // via symmetry\n\n\t\t\t\tdij = 1.0 - ( (cij/N)/(sdi*sd[j]) );\n\t\t\t\tdist.set( i, j, dij );\n\t\t\t\tdist.set( j, i, dij ); // via symmetry\n\t\t\t}\n\t\t}\n\t\treturn dist;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = incrpcorrdistmat;\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* Compute a sample Pearson product-moment correlation distance matrix incrementally.\n*\n* @module @stdlib/stats-incr-pcorrdistmat\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray = require( '@stdlib/ndarray-ctor' );\n* var incrpcorrdistmat = require( '@stdlib/stats-incr-pcorrdistmat' );\n*\n* // Create an output correlation distance matrix:\n* var buffer = new Float64Array( 4 );\n* var shape = [ 2, 2 ];\n* var strides = [ 2, 1 ];\n* var offset = 0;\n* var order = 'row-major';\n*\n* var dist = ndarray( 'float64', buffer, shape, strides, offset, order );\n*\n* // Create a correlation distance matrix accumulator:\n* var accumulator = incrpcorrdistmat( dist );\n*\n* var out = accumulator();\n* // returns null\n*\n* // Create a data vector:\n* buffer = new Float64Array( 2 );\n* shape = [ 2 ];\n* strides = [ 1 ];\n*\n* var vec = ndarray( 'float64', buffer, shape, strides, offset, order );\n*\n* // Provide data to the accumulator:\n* vec.set( 0, 2.0 );\n* vec.set( 1, 1.0 );\n*\n* out = accumulator( vec );\n* // returns <ndarray>\n*\n* var bool = ( out === dist );\n* // returns true\n*\n* vec.set( 0, -5.0 );\n* vec.set( 1, 3.14 );\n*\n* out = accumulator( vec );\n* // returns <ndarray>\n*\n* // Retrieve the distance matrix:\n* out = accumulator();\n* // returns <ndarray>\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,EAAAC,EAAA,cAsBA,IAAIC,EAAoB,QAAS,oCAAqC,EAAE,YACpEC,EAAiB,QAAS,iCAAkC,EAC5DC,EAAe,QAAS,+BAAgC,EACxDC,EAAe,QAAS,uBAAwB,EAChDC,EAAS,QAAS,uBAAwB,EAC1CC,EAAO,QAAS,gCAAiC,EACjDC,EAAO,QAAS,sBAAuB,EACvCC,EAAQ,QAAS,2BAA4B,EAC7CC,EAAQ,QAAS,4BAA6B,EAalD,SAASC,EAAcC,EAAGC,EAAO,CAChC,IAAIC,EACAC,EACAC,EACAC,EAEJ,OAAKJ,EACJI,EAAIR,EAEJQ,EAAIT,EAELO,EAAS,IAAIV,EAAcO,EAAEA,CAAE,EAC/BI,EAAQ,CAAEJ,EAAGA,CAAE,EACfE,EAAU,CAAEF,EAAG,CAAE,EACVK,EAAG,UAAWF,EAAQC,EAAOF,EAAS,EAAG,WAAY,CAC7D,CASA,SAASI,EAAcC,EAAI,CAC1B,IAAIL,EACAC,EACAC,EAEJ,OAAAD,EAAS,IAAIV,EAAcc,CAAE,EAC7BH,EAAQ,CAAEG,CAAE,EACZL,EAAU,CAAE,CAAE,EAEPL,EAAO,UAAWM,EAAQC,EAAOF,EAAS,EAAG,WAAY,CACjE,CA4KA,SAASM,EAAkBC,EAAKC,EAAQ,CACvC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAV,EAGJ,GADAA,EAAI,EACCjB,EAAmBmB,CAAI,EAC3BE,EAAQF,EACRG,EAAOb,EAAcY,EAAO,EAAM,UACvBpB,EAAgBkB,CAAI,EAC/BE,EAAQF,EAAI,MAAO,CAAE,EACrBG,EAAOH,MAEP,OAAM,IAAI,UAAWf,EAAQ,qMAAsMe,CAAI,CAAE,EAc1O,GAXAQ,EAAI,IAAIxB,EAAckB,CAAM,EAG5BE,EAAK,IAAIpB,EAAckB,CAAM,EAG7BG,EAAK,IAAIrB,EAAckB,CAAM,EAG7BK,EAAIjB,EAAcY,EAAO,EAAK,EAEzB,UAAU,OAAS,EAAI,CAC3B,GAAK,CAACnB,EAAckB,CAAM,EACzB,MAAM,IAAI,UAAWhB,EAAQ,oFAAqFgB,CAAM,CAAE,EAE3H,GAAKZ,EAAOY,EAAM,KAAM,IAAMC,EAC7B,MAAM,IAAI,MAAOjB,EAAQ,2JAA4JiB,EAAOb,EAAOY,EAAM,KAAM,CAAE,CAAE,EAEpN,OAAAK,EAAKL,EACEQ,CACR,CAEA,OAAAH,EAAKT,EAAcK,CAAM,EAElBQ,EAWP,SAASA,EAAcC,EAAI,CAC1B,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA5B,EACA6B,EACAC,EACAC,EACJ,GAAK,UAAU,SAAW,EACzB,OAAKxB,IAAM,EACH,KAEDK,EAER,GAAK,CAACpB,EAAc4B,CAAE,EACrB,MAAM,IAAI,UAAW1B,EAAQ,yEAA0E0B,CAAE,CAAE,EAE5G,GAAKA,EAAE,MAAO,CAAE,IAAMT,EACrB,MAAM,IAAI,MAAOjB,EAAQ,0GAA2GiB,EAAOS,EAAE,MAAO,CAAE,CAAE,CAAE,EAQ3J,GANApB,EAAIO,EACJA,GAAK,EACLsB,EAAI7B,EAAIO,EAERc,EAAQrB,GAAK,EAERO,IAAM,EACV,IAAMuB,EAAI,EAAGA,EAAInB,EAAOmB,IAkBvB,IAjBAH,EAAKP,EAAE,IAAKU,CAAE,EACdF,EAAIb,EAAG,IAAKe,CAAE,EAGdJ,EAAKC,EAAKC,EAGVA,GAAKF,EAAKnB,EACVQ,EAAG,IAAKe,EAAGF,CAAE,EAGbX,EAAGa,CAAE,EAAIJ,EACTb,EAAIiB,CAAE,GAAKJ,GAAOC,EAAGC,GACrBd,EAAIgB,CAAE,EAAInC,EAAMkB,EAAGiB,CAAC,EAAET,CAAM,EAG5BC,EAAMO,EAAIZ,EAAEa,CAAC,EACPC,EAAI,EAAGA,GAAKD,EAAGC,IACpBR,EAAMP,EAAE,IAAKc,EAAGC,CAAE,EAAMT,EAAIL,EAAEc,CAAC,EAC/Bf,EAAE,IAAKc,EAAGC,EAAGR,CAAI,EACjBP,EAAE,IAAKe,EAAGD,EAAGP,CAAI,MAInB,KAAMO,EAAI,EAAGA,EAAInB,EAAOmB,IAmBvB,IAlBAH,EAAKP,EAAE,IAAKU,CAAE,EACdF,EAAIb,EAAG,IAAKe,CAAE,EAGdJ,EAAKC,EAAKC,EAGVA,GAAKF,EAAKnB,EACVQ,EAAG,IAAKe,EAAGF,CAAE,EAGbX,EAAGa,CAAE,EAAIJ,EACTb,EAAIiB,CAAE,GAAKJ,GAAOC,EAAGC,GACrBd,EAAIgB,CAAE,EAAInC,EAAMkB,EAAGiB,CAAC,EAAET,CAAM,EAG5BC,EAAMO,EAAIZ,EAAEa,CAAC,EACbL,EAAMX,EAAIgB,CAAE,EACNC,EAAI,EAAGA,EAAID,EAAGC,IACnBR,EAAMP,EAAE,IAAKc,EAAGC,CAAE,EAAMT,EAAIL,EAAEc,CAAC,EAC/Bf,EAAE,IAAKc,EAAGC,EAAGR,CAAI,EACjBP,EAAE,IAAKe,EAAGD,EAAGP,CAAI,EAEjBC,EAAM,EAASD,EAAIF,GAAQI,EAAIX,EAAGiB,CAAC,GACnCnB,EAAK,IAAKkB,EAAGC,EAAGP,CAAI,EACpBZ,EAAK,IAAKmB,EAAGD,EAAGN,CAAI,EAIvB,OAAOZ,CACR,CAWA,SAASM,EAAcE,EAAI,CAC1B,IAAII,EACAD,EACAE,EACAC,EACAI,EACAC,EACJ,GAAK,UAAU,SAAW,EACzB,OAAKxB,IAAM,EACH,KAEDK,EAER,GAAK,CAACpB,EAAc4B,CAAE,EACrB,MAAM,IAAI,UAAW1B,EAAQ,yEAA0E0B,CAAE,CAAE,EAE5G,GAAKA,EAAE,MAAO,CAAE,IAAMT,EACrB,MAAM,IAAI,MAAOjB,EAAQ,mHAAoHiB,EAAOS,EAAE,MAAO,CAAE,CAAE,CAAE,EAGpK,IADAb,GAAK,EACCuB,EAAI,EAAGA,EAAInB,EAAOmB,IAWvB,IATAJ,EAAKN,EAAE,IAAKU,CAAE,EAAIf,EAAG,IAAKe,CAAE,EAG5Bb,EAAGa,CAAE,EAAIJ,EACTb,EAAIiB,CAAE,GAAKJ,EAAKA,EAChBZ,EAAIgB,CAAE,EAAInC,EAAMkB,EAAGiB,CAAC,EAAEvB,CAAE,EAGxBkB,EAAMX,EAAIgB,CAAE,EACNC,EAAI,EAAGA,EAAID,EAAGC,IACnBR,EAAMP,EAAE,IAAKc,EAAGC,CAAE,EAAML,EAAGT,EAAEc,CAAC,EAC9Bf,EAAE,IAAKc,EAAGC,EAAGR,CAAI,EACjBP,EAAE,IAAKe,EAAGD,EAAGP,CAAI,EAEjBC,EAAM,EAASD,EAAIhB,GAAIkB,EAAIX,EAAGiB,CAAC,GAC/BnB,EAAK,IAAKkB,EAAGC,EAAGP,CAAI,EACpBZ,EAAK,IAAKmB,EAAGD,EAAGN,CAAI,EAGtB,OAAOZ,CACR,CACD,CAKAvB,EAAO,QAAUmB,ICzXjB,IAAIwB,EAAO,IAKX,OAAO,QAAUA",
+  "names": ["require_main", "__commonJSMin", "exports", "module", "isPositiveInteger", "isSquareMatrix", "isVectorLike", "Float64Array", "format", "sqrt", "ctor", "bctor", "numel", "createMatrix", "n", "bool", "strides", "buffer", "shape", "f", "createVector", "N", "incrpcorrdistmat", "out", "means", "order", "dist", "M2", "sd", "mu", "C", "d", "accumulator2", "accumulator1", "v", "denom", "rdx", "cij", "dij", "sdi", "di", "vi", "m", "r", "i", "j", "main"]
+}

package/docs/types/index.d.ts

@@ -16,7 +16,7 @@
 * limitations under the License.
 */
 
-// TypeScript Version: 2.0
+// TypeScript Version: 4.1
 
 /// <reference types="@stdlib/types"/>
 

package/lib/index.js

@@ -73,9 +73,9 @@
 
 // MODULES //
 
-var incrpcorrdistmat = require( './main.js' );
+var main = require( './main.js' );
 
 
 // EXPORTS //
 
-module.exports = incrpcorrdistmat;
+module.exports = main;

package/lib/main.js

@@ -24,6 +24,7 @@ var isPositiveInteger = require( '@stdlib/assert-is-positive-integer' ).isPrimit
 var isSquareMatrix = require( '@stdlib/assert-is-square-matrix' );
 var isVectorLike = require( '@stdlib/assert-is-vector-like' );
 var Float64Array = require( '@stdlib/array-float64' );
+var format = require( '@stdlib/string-format' );
 var sqrt = require( '@stdlib/math-base-special-sqrt' );
 var ctor = require( '@stdlib/ndarray-ctor' );
 var bctor = require( '@stdlib/ndarray-base-ctor' );
@@ -264,7 +265,7 @@ function incrpcorrdistmat( out, means ) {
 		order = out.shape[ 0 ];
 		dist = out;
 	} else {
-		throw new TypeError( 'invalid argument. First argument must either specify the order of the correlation distance matrix or be a square 2-dimensional ndarray for storing the correlation distance matrix. Value: `' + out + '`.' );
+		throw new TypeError( format( 'invalid argument. First argument must either specify the order of the correlation distance matrix or be a square two-dimensional ndarray for storing the correlation distance matrix. Value: `%s`.', out ) );
 	}
 	// Create a scratch array for storing residuals (i.e., `x_i - xbar_{i-1}`):
 	d = new Float64Array( order );
@@ -280,10 +281,10 @@ function incrpcorrdistmat( out, means ) {
 
 	if ( arguments.length > 1 ) {
 		if ( !isVectorLike( means ) ) {
-			throw new TypeError( 'invalid argument. Second argument must be a 1-dimensional ndarray. Value: `' + means + '`.' );
+			throw new TypeError( format( 'invalid argument. Second argument must be a one-dimensional ndarray. Value: `%s`.', means ) );
 		}
 		if ( numel( means.shape ) !== order ) {
-			throw new Error( 'invalid argument. The number of elements (means) in the second argument must match correlation distance matrix dimensions. Expected: '+order+'. Actual: '+numel( means.shape )+'.' );
+			throw new Error( format( 'invalid argument. The number of elements (means) in the second argument must match correlation distance matrix dimensions. Expected: `%u`. Actual: `%u`.', order, numel( means.shape ) ) );
 		}
 		mu = means; // TODO: should we copy this? Otherwise, internal state could be "corrupted" due to mutation outside the accumulator
 		return accumulator2;
@@ -322,10 +323,10 @@ function incrpcorrdistmat( out, means ) {
 			return dist;
 		}
 		if ( !isVectorLike( v ) ) {
-			throw new TypeError( 'invalid argument. Must provide a 1-dimensional ndarray. Value: `' + v + '`.' );
+			throw new TypeError( format( 'invalid argument. Must provide a one-dimensional ndarray. Value: `%s`.', v ) );
 		}
 		if ( v.shape[ 0 ] !== order ) {
-			throw new Error( 'invalid argument. Vector length must match correlation matrix dimensions. Expected: '+order+'. Actual: '+v.shape[ 0 ]+'.' );
+			throw new Error( format( 'invalid argument. Vector length must match correlation matrix dimensions. Expected: `%u`. Actual: `%u`.', order, v.shape[ 0 ] ) );
 		}
 		n = N;
 		N += 1;
@@ -415,10 +416,10 @@ function incrpcorrdistmat( out, means ) {
 			return dist;
 		}
 		if ( !isVectorLike( v ) ) {
-			throw new TypeError( 'invalid argument. Must provide a 1-dimensional ndarray. Value: `' + v + '`.' );
+			throw new TypeError( format( 'invalid argument. Must provide a one-dimensional ndarray. Value: `%s`.', v ) );
 		}
 		if ( v.shape[ 0 ] !== order ) {
-			throw new Error( 'invalid argument. Vector length must match correlation distance matrix dimensions. Expected: '+order+'. Actual: '+v.shape[ 0 ]+'.' );
+			throw new Error( format( 'invalid argument. Vector length must match correlation distance matrix dimensions. Expected: `%u`. Actual: `%u`.', order, v.shape[ 0 ] ) );
 		}
 		N += 1;
 		for ( i = 0; i < order; i++ ) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stdlib/stats-incr-pcorrdistmat",
-  "version": "0.0.7",
+  "version": "0.1.0",
   "description": "Compute a sample Pearson product-moment correlation distance matrix incrementally.",
   "license": "Apache-2.0",
   "author": {
@@ -37,25 +37,27 @@
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
   "dependencies": {
-    "@stdlib/array-float64": "^0.0.x",
-    "@stdlib/assert-is-positive-integer": "^0.0.x",
-    "@stdlib/assert-is-square-matrix": "^0.0.x",
-    "@stdlib/assert-is-vector-like": "^0.0.x",
-    "@stdlib/math-base-special-sqrt": "^0.0.x",
-    "@stdlib/ndarray-base-ctor": "^0.0.x",
-    "@stdlib/ndarray-base-numel": "^0.0.x",
-    "@stdlib/ndarray-ctor": "^0.0.x",
-    "@stdlib/types": "^0.0.x"
+    "@stdlib/array-float64": "^0.1.0",
+    "@stdlib/assert-is-positive-integer": "^0.1.0",
+    "@stdlib/assert-is-square-matrix": "^0.1.0",
+    "@stdlib/assert-is-vector-like": "^0.1.0",
+    "@stdlib/math-base-special-sqrt": "^0.1.0",
+    "@stdlib/ndarray-base-ctor": "^0.1.0",
+    "@stdlib/ndarray-base-numel": "^0.1.0",
+    "@stdlib/ndarray-ctor": "^0.1.0",
+    "@stdlib/string-format": "^0.1.0",
+    "@stdlib/types": "^0.1.0",
+    "@stdlib/error-tools-fmtprodmsg": "^0.1.0"
   },
   "devDependencies": {
-    "@stdlib/assert-is-symmetric-matrix": "^0.0.x",
-    "@stdlib/bench": "^0.0.x",
-    "@stdlib/constants-float64-eps": "^0.0.x",
-    "@stdlib/math-base-special-abs": "^0.0.x",
-    "@stdlib/random-base-randu": "^0.0.x",
+    "@stdlib/assert-is-symmetric-matrix": "^0.1.0",
+    "@stdlib/bench": "^0.1.0",
+    "@stdlib/constants-float64-eps": "^0.1.0",
+    "@stdlib/math-base-special-abs": "^0.1.0",
+    "@stdlib/random-base-randu": "^0.0.8",
     "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"
   },
   "engines": {
     "node": ">=0.10.0",
@@ -94,7 +96,7 @@
     "accumulator"
   ],
   "funding": {
-    "type": "patreon",
-    "url": "https://www.patreon.com/athan"
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
   }
 }

package/docs/repl.txt

@@ -1,53 +0,0 @@
-
-{{alias}}( out[, means] )
-    Returns an accumulator function which incrementally computes a sample
-    Pearson product-moment correlation distance matrix.
-
-    If provided a data vector, the accumulator function returns an updated
-    sample correlation distance matrix. If not provided a data vector, the
-    accumulator function returns the current sample correlation distance matrix.
-
-    Due to limitations inherent in representing numeric values using floating-
-    point format (i.e., the inability to represent numeric values with infinite
-    precision), the correlation distance between perfectly correlated random
-    variables may *not* be `0` or `2`. In fact, the correlation distance is
-    *not* guaranteed to be strictly on the interval [0,2]. Any computed distance
-    should, however, be within floating-point roundoff error.
-
-    Parameters
-    ----------
-    out: integer|ndarray
-        Order of the correlation distance matrix or a square 2-dimensional
-        ndarray for storing the correlation distance matrix.
-
-    means: ndarray (optional)
-        Known means.
-
-    Returns
-    -------
-    acc: Function
-        Accumulator function.
-
-    Examples
-    --------
-    > var accumulator = {{alias}}( 2 );
-    > var out = accumulator()
-    <ndarray>
-    > var buf = new {{alias:@stdlib/array/float64}}( 2 );
-    > var shape = [ 2 ];
-    > var strides = [ 1 ];
-    > var v = {{alias:@stdlib/ndarray/ctor}}( 'float64', buf, shape, strides, 0, 'row-major' );
-    > v.set( 0, 2.0 );
-    > v.set( 1, 1.0 );
-    > out = accumulator( v )
-    <ndarray>
-    > v.set( 0, -5.0 );
-    > v.set( 1, 3.14 );
-    > out = accumulator( v )
-    <ndarray>
-    > out = accumulator()
-    <ndarray>
-
-    See Also
-    --------
-

package/docs/types/test.ts

@@ -1,161 +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 Float64Array = require( '@stdlib/array-float64' );
-import ndarray = require( '@stdlib/ndarray-ctor' );
-import incrpcorrdistmat = require( './index' );
-
-
-// TESTS //
-
-// The function returns an accumulator function...
-{
-	let buffer = new Float64Array( 4 );
-	let shape = [ 2, 2 ];
-	let strides = [ 2, 1 ];
-
-	// Create a 2-dimensional output covariance matrix:
-	const cov = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );
-
-	incrpcorrdistmat( cov ); // $ExpectType accumulator
-	incrpcorrdistmat( 2 ); // $ExpectType accumulator
-
-	buffer = new Float64Array( 2 );
-	shape = [ 2 ];
-	strides = [ 1 ];
-
-	const means = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );
-	means.set( 0, 3.0 );
-	means.set( 1, -5.5 );
-	incrpcorrdistmat( 2, means ); // $ExpectType accumulator
-}
-
-// The compiler throws an error if the function is provided a first argument which is not an ndarray or number...
-{
-	incrpcorrdistmat( '5' ); // $ExpectError
-	incrpcorrdistmat( true ); // $ExpectError
-	incrpcorrdistmat( false ); // $ExpectError
-	incrpcorrdistmat( null ); // $ExpectError
-	incrpcorrdistmat( undefined ); // $ExpectError
-	incrpcorrdistmat( [] ); // $ExpectError
-	incrpcorrdistmat( {} ); // $ExpectError
-	incrpcorrdistmat( ( x: number ): number => x ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a second argument which is not an ndarray...
-{
-	incrpcorrdistmat( 2, '5' ); // $ExpectError
-	incrpcorrdistmat( 2, true ); // $ExpectError
-	incrpcorrdistmat( 2, false ); // $ExpectError
-	incrpcorrdistmat( 2, null ); // $ExpectError
-	incrpcorrdistmat( 2, [] ); // $ExpectError
-	incrpcorrdistmat( 2, {} ); // $ExpectError
-	incrpcorrdistmat( 2, ( x: number ): number => x ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided an invalid number of arguments...
-{
-	let buffer = new Float64Array( 4 );
-	let shape = [ 2, 2 ];
-	let strides = [ 2, 1 ];
-
-	// Create a 2-dimensional output covariance matrix:
-	const cov = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );
-
-	buffer = new Float64Array( 2 );
-	shape = [ 2 ];
-	strides = [ 1 ];
-
-	const means = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );
-	means.set( 0, 3.0 );
-	means.set( 1, -5.5 );
-
-	incrpcorrdistmat(); // $ExpectError
-	incrpcorrdistmat( cov, means, {} ); // $ExpectError
-}
-
-// The function returns an accumulator function which returns an accumulated result...
-{
-	const acc = incrpcorrdistmat( 2 );
-	acc(); // $ExpectType ndarray | null
-
-	const buffer = new Float64Array( 2 );
-	const shape = [ 2 ];
-	const strides = [ 1 ];
-
-	const vec = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );
-	vec.set( 0, 37.0 );
-	vec.set( 1, 45.0 );
-	acc( vec ); // $ExpectType ndarray | null
-}
-
-// The function returns an accumulator function which returns an accumulated result (known means)...
-{
-	let buffer = new Float64Array( 2 );
-	let shape = [ 2 ];
-	let strides = [ 1 ];
-
-	const means = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );
-	means.set( 0, 3.0 );
-	means.set( 1, -5.5 );
-	const acc = incrpcorrdistmat( 2, means );
-
-	acc(); // $ExpectType ndarray | null
-	buffer = new Float64Array( 2 );
-	shape = [ 2 ];
-	strides = [ 1 ];
-
-	const vec = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );
-	vec.set( 0, 37.0 );
-	vec.set( 1, 45.0 );
-	acc( vec ); // $ExpectType ndarray | null
-}
-
-// The compiler throws an error if the returned accumulator function is provided an argument which is not an ndarray...
-{
-	const acc = incrpcorrdistmat( 2 );
-
-	acc( 123 ); // $ExpectError
-	acc( 'abc' ); // $ExpectError
-	acc( true ); // $ExpectError
-	acc( false ); // $ExpectError
-	acc( null ); // $ExpectError
-	acc( [] ); // $ExpectError
-	acc( {} ); // $ExpectError
-	acc( ( x: number ): number => x ); // $ExpectError
-}
-
-// The compiler throws an error if the returned accumulator function is provided invalid arguments (known means)...
-{
-	const buffer = new Float64Array( 2 );
-	const shape = [ 2 ];
-	const strides = [ 1 ];
-
-	const means = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );
-	means.set( 0, 3.0 );
-	means.set( 1, -5.5 );
-	const acc = incrpcorrdistmat( 2, means );
-
-	acc( '5' ); // $ExpectError
-	acc( true ); // $ExpectError
-	acc( false ); // $ExpectError
-	acc( null ); // $ExpectError
-	acc( [] ); // $ExpectError
-	acc( {} ); // $ExpectError
-	acc( ( x: number ): number => x ); // $ExpectError
-}