@stdlib/utils-reduce 0.0.7 → 0.1.0

package/dist/index.js

@@ -0,0 +1,10 @@
+"use strict";var d=function(r,e){return function(){return e||r((e={exports:{}}).exports,e),e.exports}};var m=d(function(H,b){
+var j=require('@stdlib/ndarray-base-vind2bind/dist'),F="throw";function x(r,e,a,u){var i,s,t,n,o,c,f,q,l,y,v;if(n=r.length,f=r.shape,i=r.data,q=r.strides,l=r.offset,s=r.order,o=r.accessors[0],c=r.ref,f.length===0)return a.call(u,e,o(i,l),0,c);for(t=e,v=0;v<n;v++)y=j(f,q,l,s,v,F),t=a.call(u,t,o(i,y),v,c);return t}b.exports=x
+});var h=d(function(I,g){
+function E(r,e,a,u){var i,s,t,n;for(i=r.data,s=r.accessors[0],t=e,n=0;n<i.length;n++)t=a.call(u,t,s(i,n),n,i);return t}g.exports=E
+});var w=d(function(J,k){
+var T=require('@stdlib/assert-is-array-like-object/dist'),L=require('@stdlib/assert-is-ndarray-like/dist'),O=require('@stdlib/assert-is-function/dist'),V=require('@stdlib/ndarray-base-ndarraylike2object/dist'),D=require('@stdlib/array-base-arraylike2object/dist'),p=require('@stdlib/error-tools-fmtprodmsg/dist'),M=m(),z=h();function B(r,e,a,u){if(!O(a))throw new TypeError(p('1XH3N',a));if(L(r))return M(V(r),e,a,u);if(T(r))return z(D(r),e,a,u);throw new TypeError(p('1XHBH',r))}k.exports=B
+});var C=w();module.exports=C;
+/** @license Apache-2.0 */
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/ndarray.js", "../lib/array.js", "../lib/main.js", "../lib/index.js"],
+  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 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 vind2bind = require( '@stdlib/ndarray-base-vind2bind' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Applies a function against an accumulator and each element in an array and returns the accumulated result.\n*\n* @private\n* @param {Object} x - object containing input ndarray meta data\n* @param {string} x.ref - reference to original input ndarray-like object\n* @param {string} x.dtype - data type\n* @param {Collection} x.data - data buffer\n* @param {NonNegativeInteger} x.length - number of elements\n* @param {NonNegativeIntegerArray} x.shape - dimensions\n* @param {IntegerArray} x.strides - stride lengths\n* @param {NonNegativeInteger} x.offset - index offset\n* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)\n* @param {Array<Function>} x.accessors - accessors for accessing data buffer elements\n* @param {*} initial - initial value\n* @param {Function} fcn - function to apply\n* @param {*} thisArg - function execution context\n* @returns {*} accumulated result\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n* var cadd = require( '@stdlib/math-base-ops-cadd' );\n* var naryFunction = require( '@stdlib/utils-nary-function' );\n*\n* // Create a data buffer:\n* var xbuf = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );\n*\n* // Define the shape of the input array:\n* var shape = [ 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n*\n* // Define the index offset:\n* var ox = 0;\n*\n* // Define a getter:\n* function getter( buf, idx ) {\n*     return buf.get( idx );\n* }\n*\n* // Create the input ndarray-like object:\n* var x = {\n*     'ref': null,\n*     'dtype': 'complex64',\n*     'data': xbuf,\n*     'length': 4,\n*     'shape': shape,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': [ getter ]\n* };\n* x.ref = x;\n*\n* // Compute the sum:\n* var v = reduce( x, new Complex64( 0.0, 0.0 ), naryFunction( cadd, 2 ) );\n*\n* var re = realf( v );\n* // returns 16.0\n*\n* var im = imagf( v );\n* // returns 20.0\n*/\nfunction reduce( x, initial, fcn, thisArg ) {\n\tvar xbuf;\n\tvar ordx;\n\tvar acc;\n\tvar len;\n\tvar get;\n\tvar ref;\n\tvar shx;\n\tvar sx;\n\tvar ox;\n\tvar ix;\n\tvar i;\n\n\t// Cache the total number of elements over which to iterate:\n\tlen = x.length;\n\n\t// Cache the input array shape:\n\tshx = x.shape;\n\n\t// Cache reference to the input ndarray data buffer:\n\txbuf = x.data;\n\n\t// Cache reference to the stride array:\n\tsx = x.strides;\n\n\t// Cache the index of the first indexed element:\n\tox = x.offset;\n\n\t// Cache the array order:\n\tordx = x.order;\n\n\t// Cache the element accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Cache the reference to the original input array:\n\tref = x.ref;\n\n\t// Check for a zero-dimensional array...\n\tif ( shx.length === 0 ) {\n\t\treturn fcn.call( thisArg, initial, get( xbuf, ox ), 0, ref );\n\t}\n\t// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory (note: this has negative performance implications for non-contiguous ndarrays due to a lack of data locality)...\n\tacc = initial;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tix = vind2bind( shx, sx, ox, ordx, i, MODE );\n\t\tacc = fcn.call( thisArg, acc, get( xbuf, ix ), i, ref );\n\t}\n\treturn acc;\n}\n\n\n// EXPORTS //\n\nmodule.exports = reduce;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 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* Applies a function against an accumulator and each element in an array and returns the accumulated result.\n*\n* @private\n* @param {Object} x - object containing input array data\n* @param {ArrayLikeObject} x.data - input array data\n* @param {Array<Function>} x.accessors - input array accessors\n* @param {*} initial - initial value\n* @param {Function} fcn - function to apply\n* @param {*} thisArg - function execution context\n* @returns {*} accumulated result\n*\n* @example\n* function sum( acc, value ) {\n*     return acc + value;\n* }\n*\n* // Define a getter:\n* function getter( buf, idx ) {\n*     return buf[ idx ];\n* }\n*\n* // Create the input array object:\n* var x = {\n*     'data': [ 1, 2, 3, 4 ],\n*     'accessors': [ getter ]\n* };\n*\n* // Compute the sum:\n* var out = reduce( x, 0, sum );\n* // returns 10\n*/\nfunction reduce( x, initial, fcn, thisArg ) {\n\tvar xbuf;\n\tvar get;\n\tvar acc;\n\tvar i;\n\n\t// Cache reference to the input data:\n\txbuf = x.data;\n\n\t// Cache the element accessor:\n\tget = x.accessors[ 0 ];\n\n\t// Iterate over each element...\n\tacc = initial;\n\tfor ( i = 0; i < xbuf.length; i++ ) {\n\t\tacc = fcn.call( thisArg, acc, get( xbuf, i ), i, xbuf );\n\t}\n\treturn acc;\n}\n\n\n// EXPORTS //\n\nmodule.exports = reduce;\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 isArrayLikeObject = require( '@stdlib/assert-is-array-like-object' );\nvar isndarrayLike = require( '@stdlib/assert-is-ndarray-like' );\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar ndarraylike2object = require( '@stdlib/ndarray-base-ndarraylike2object' );\nvar arraylike2object = require( '@stdlib/array-base-arraylike2object' );\nvar format = require( '@stdlib/string-format' );\nvar ndarrayFcn = require( './ndarray.js' );\nvar arrayFcn = require( './array.js' );\n\n\n// MAIN //\n\n/**\n* Applies a function against an accumulator and each element in an array and returns the accumulated result.\n*\n* ## Notes\n*\n* -   The applied function is provided the following arguments:\n*\n*     -   **accumulator**: accumulated value.\n*     -   **value**: array element.\n*     -   **index**: element index.\n*     -   **arr**: input array.\n*\n* @param {(ArrayLikeObject|ndarray)} arr - input array\n* @param {*} initial - initial value\n* @param {Function} reducer - reduction function\n* @param {*} [thisArg] - reduction function execution context\n* @throws {TypeError} first argument must be an array-like object or an ndarray\n* @throws {TypeError} third argument must be a function\n* @returns {*} accumulated result\n*\n* @example\n* function sum( acc, value ) {\n*     return acc + value;\n* }\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var out = reduce( arr, 0, sum );\n* // returns 10\n*\n* @example\n* var naryFunction = require( '@stdlib/utils-nary-function' );\n* var add = require( '@stdlib/math-base-ops-add' );\n* var array = require( '@stdlib/ndarray-array' );\n*\n* var opts = {\n*     'dtype': 'generic'\n* };\n* var arr = array( [ [ 1, 2, 3 ], [ 4, 5, 6 ] ], opts );\n*\n* var out = reduce( arr, 0, naryFunction( add, 2 ) );\n* // returns 21\n*/\nfunction reduce( arr, initial, reducer, thisArg ) {\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tif ( isndarrayLike( arr ) ) { // note: assertion order matters here, as an ndarray-like object is also array-like\n\t\treturn ndarrayFcn( ndarraylike2object( arr ), initial, reducer, thisArg ); // eslint-disable-line max-len\n\t}\n\tif ( isArrayLikeObject( arr ) ) {\n\t\treturn arrayFcn( arraylike2object( arr ), initial, reducer, thisArg );\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an ndarray. Value: `%s`.', arr ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = reduce;\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* Apply a function against an accumulator and each element in an array and return the accumulated result.\n*\n* @module @stdlib/utils-reduce\n*\n* @example\n* var reduce = require( '@stdlib/utils-reduce' );\n*\n* function sum( acc, value ) {\n*     return acc + value;\n* }\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var out = reduce( arr, 0, sum );\n* // returns 10\n*\n* @example\n* var naryFunction = require( '@stdlib/utils-nary-function' );\n* var add = require( '@stdlib/math-base-ops-add' );\n* var array = require( '@stdlib/ndarray-array' );\n* var reduce = require( '@stdlib/utils-reduce' );\n*\n* var opts = {\n*     'dtype': 'generic'\n* };\n* var arr = array( [ [ 1, 2, 3 ], [ 4, 5, 6 ] ], opts );\n*\n* var out = reduce( arr, 0, naryFunction( add, 2 ) );\n* // returns 21\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,EAAY,QAAS,gCAAiC,EAKtDC,EAAO,QAwEX,SAASC,EAAQC,EAAGC,EAASC,EAAKC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA2BJ,GAxBAP,EAAMP,EAAE,OAGRU,EAAMV,EAAE,MAGRI,EAAOJ,EAAE,KAGTW,EAAKX,EAAE,QAGPY,EAAKZ,EAAE,OAGPK,EAAOL,EAAE,MAGTQ,EAAMR,EAAE,UAAW,CAAE,EAGrBS,EAAMT,EAAE,IAGHU,EAAI,SAAW,EACnB,OAAOR,EAAI,KAAMC,EAASF,EAASO,EAAKJ,EAAMQ,CAAG,EAAG,EAAGH,CAAI,EAI5D,IADAH,EAAML,EACAa,EAAI,EAAGA,EAAIP,EAAKO,IACrBD,EAAKhB,EAAWa,EAAKC,EAAIC,EAAIP,EAAMS,EAAGhB,CAAK,EAC3CQ,EAAMJ,EAAI,KAAMC,EAASG,EAAKE,EAAKJ,EAAMS,CAAG,EAAGC,EAAGL,CAAI,EAEvD,OAAOH,CACR,CAKAV,EAAO,QAAUG,ICxJjB,IAAAgB,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsDA,SAASC,EAAQC,EAAGC,EAASC,EAAKC,EAAU,CAC3C,IAAIC,EACAC,EACAC,EACAC,EAUJ,IAPAH,EAAOJ,EAAE,KAGTK,EAAML,EAAE,UAAW,CAAE,EAGrBM,EAAML,EACAM,EAAI,EAAGA,EAAIH,EAAK,OAAQG,IAC7BD,EAAMJ,EAAI,KAAMC,EAASG,EAAKD,EAAKD,EAAMG,CAAE,EAAGA,EAAGH,CAAK,EAEvD,OAAOE,CACR,CAKAR,EAAO,QAAUC,IC7EjB,IAAAS,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAoB,QAAS,qCAAsC,EACnEC,EAAgB,QAAS,gCAAiC,EAC1DC,EAAa,QAAS,4BAA6B,EACnDC,EAAqB,QAAS,yCAA0C,EACxEC,EAAmB,QAAS,qCAAsC,EAClEC,EAAS,QAAS,uBAAwB,EAC1CC,EAAa,IACbC,EAAW,IAgDf,SAASC,EAAQC,EAAKC,EAASC,EAASC,EAAU,CACjD,GAAK,CAACV,EAAYS,CAAQ,EACzB,MAAM,IAAI,UAAWN,EAAQ,oEAAqEM,CAAQ,CAAE,EAE7G,GAAKV,EAAeQ,CAAI,EACvB,OAAOH,EAAYH,EAAoBM,CAAI,EAAGC,EAASC,EAASC,CAAQ,EAEzE,GAAKZ,EAAmBS,CAAI,EAC3B,OAAOF,EAAUH,EAAkBK,CAAI,EAAGC,EAASC,EAASC,CAAQ,EAErE,MAAM,IAAI,UAAWP,EAAQ,4FAA6FI,CAAI,CAAE,CACjI,CAKAV,EAAO,QAAUS,ICvCjB,IAAIK,EAAO,IAKX,OAAO,QAAUA",
+  "names": ["require_ndarray", "__commonJSMin", "exports", "module", "vind2bind", "MODE", "reduce", "x", "initial", "fcn", "thisArg", "xbuf", "ordx", "acc", "len", "get", "ref", "shx", "sx", "ox", "ix", "i", "require_array", "__commonJSMin", "exports", "module", "reduce", "x", "initial", "fcn", "thisArg", "xbuf", "get", "acc", "i", "require_main", "__commonJSMin", "exports", "module", "isArrayLikeObject", "isndarrayLike", "isFunction", "ndarraylike2object", "arraylike2object", "format", "ndarrayFcn", "arrayFcn", "reduce", "arr", "initial", "reducer", "thisArg", "main"]
+}

package/docs/types/index.d.ts

@@ -16,18 +16,19 @@
 * limitations under the License.
 */
 
-// TypeScript Version: 2.0
+// TypeScript Version: 4.1
 
 /// <reference types="@stdlib/types"/>
 
-import { Collection } from '@stdlib/types/object';
+import { Collection } from '@stdlib/types/array';
+import { typedndarray } from '@stdlib/types/ndarray';
 
 /**
 * Function applied against an accumulator.
 *
 * @returns accumulator value
 */
-type Nullary = () => void;
+type Nullary<U, V> = ( this: V ) => U;
 
 /**
 * Function applied against an accumulator.
@@ -35,64 +36,121 @@ type Nullary = () => void;
 * @param accumulator - accumulated value
 * @returns accumulator value
 */
-type Unary = ( accumulator: any ) => any;
+type Unary<U, V> = ( this: V, accumulator: U ) => U;
 
 /**
 * Function applied against an accumulator.
 *
 * @param accumulator - accumulated value
-* @param value - collection value
+* @param value - array element
 * @returns accumulator value
 */
-type Binary = ( accumulator: any, value: any ) => any;
+type Binary<T, U, V> = ( this: V, accumulator: U, value: T ) => U;
 
 /**
 * Function applied against an accumulator.
 *
 * @param accumulator - accumulated value
-* @param value - collection value
-* @param index - collection index
+* @param value - array element
+* @param index - element index
 * @returns accumulator value
 */
-type Tertiary = ( accumulator: any, value: any, index: number ) => any;
+type Ternary<T, U, V> = ( this: V, accumulator: U, value: T, index: number ) => U;
 
 /**
 * Function applied against an accumulator.
 *
 * @param accumulator - accumulated value
-* @param value - collection value
-* @param index - collection index
-* @param collection - the input collection
+* @param value - array element
+* @param index - element index
+* @param arr - array
 * @returns accumulator value
 */
-type Quaternary = ( accumulator: any, value: any, index: number, collection: Collection ) => any; // tslint-disable-line max-line-length
+type Quaternary<T, U, V> = ( this: V, accumulator: U, value: T, index: number, arr: typedndarray<T> ) => U;
 
 /**
 * Function applied against an accumulator.
 *
 * @param accumulator - accumulated value
-* @param value - collection value
-* @param index - collection index
-* @param collection - the input collection
+* @param value - array element
+* @param index - element index
+* @param arr - array
 * @returns accumulator value
 */
-type Reducer = Nullary | Unary | Binary | Tertiary | Quaternary;
+type ArrayQuaternary<T, U, V> = ( this: V, accumulator: U, value: T, index: number, arr: Collection<T> ) => U;
 
 /**
-* Applies a function against an accumulator and each element in a collection and returns the accumulated result.
+* Function applied against an accumulator.
+*
+* @param accumulator - accumulated value
+* @param value - array element
+* @param index - element index
+* @param arr - array
+* @returns accumulator value
+*/
+type Reducer<T, U, V> = Nullary<U, V> | Unary<U, V> | Binary<T, U, V> | Ternary<T, U, V> | Quaternary<T, U, V>;
+
+/**
+* Function applied against an accumulator.
+*
+* @param accumulator - accumulated value
+* @param value - array element
+* @param index - element index
+* @param arr - array
+* @returns accumulator value
+*/
+type ArrayReducer<T, U, V> = Nullary<U, V> | Unary<U, V> | Binary<T, U, V> | Ternary<T, U, V> | ArrayQuaternary<T, U, V>;
+
+/**
+* Applies a function against an accumulator and each element in an array and returns the accumulated result.
+*
+* ## Notes
+*
+* -   The reduction function is provided four arguments:
+*
+*     -   **accumulator**: accumulated value.
+*     -   **value**: array element.
+*     -   **index**: element index.
+*     -   **arr**: input array.
+*
+* -   If provided an empty array, the function returns the initial value.
+*
+* @param arr - input array
+* @param initial - initial value
+* @param reducer - reduction function
+* @param thisArg - reduction function execution context
+* @returns accumulated result
+*
+* @example
+* var naryFunction = require( `@stdlib/utils/nary-function` );
+* var add = require( `@stdlib/math/base/ops/add` );
+* var array = require( `@stdlib/ndarray/array` );
+*
+* var opts = {
+*     'dtype': 'generic'
+* };
+* var arr = array( [ [ 1, 2, 3 ], [ 4, 5, 6 ] ], opts );
+*
+* var out = reduce( arr, 0, naryFunction( add, 2 ) );
+* // returns 21
+*/
+declare function reduce<T = unknown, U = unknown, V = unknown>( arr: typedndarray<T>, initial: U, reducer: Reducer<T, U, V>, thisArg?: ThisParameterType<Reducer<T, U, V>> ): U;
+
+/**
+* Applies a function against an accumulator and each element in an array and returns the accumulated result.
 *
 * ## Notes
 *
-* -   When invoked, the reduction function is provided four arguments:
+* -   The reduction function is provided four arguments:
 *
-*     -   `accumulator`: accumulated value
-*     -   `value`: collection value
-*     -   `index`: collection index
-*     -   `collection`: the input collection
+*     -   **accumulator**: accumulated value.
+*     -   **value**: array element.
+*     -   **index**: element index.
+*     -   **arr**: input array.
 *
-* -   If provided an empty collection, the function returns the initial value.
+* -   If provided an empty array, the function returns the initial value.
 *
-* @param collection - input collection
+* @param arr - input array
 * @param initial - initial value
 * @param reducer - reduction function
 * @param thisArg - reduction function execution context
@@ -105,10 +163,10 @@ type Reducer = Nullary | Unary | Binary | Tertiary | Quaternary;
 *
 * var arr = [ 1, 2, 3, 4 ];
 *
-* var s = reduce( arr, 0, sum );
+* var out = reduce( arr, 0, sum );
 * // returns 10
 */
-declare function reduce( collection: Collection, initial: any, reducer: Reducer, thisArg?: any ): any; // tslint-disable-line max-line-length
+declare function reduce<T = unknown, U = unknown, V = unknown>( arr: Collection<T>, initial: U, reducer: ArrayReducer<T, U, V>, thisArg?: ThisParameterType<ArrayReducer<T, U, V>> ): U;
 
 
 // EXPORTS //

package/lib/array.js

@@ -0,0 +1,78 @@
+/**
+* @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.
+*/
+
+'use strict';
+
+// MAIN //
+
+/**
+* Applies a function against an accumulator and each element in an array and returns the accumulated result.
+*
+* @private
+* @param {Object} x - object containing input array data
+* @param {ArrayLikeObject} x.data - input array data
+* @param {Array<Function>} x.accessors - input array accessors
+* @param {*} initial - initial value
+* @param {Function} fcn - function to apply
+* @param {*} thisArg - function execution context
+* @returns {*} accumulated result
+*
+* @example
+* function sum( acc, value ) {
+*     return acc + value;
+* }
+*
+* // Define a getter:
+* function getter( buf, idx ) {
+*     return buf[ idx ];
+* }
+*
+* // Create the input array object:
+* var x = {
+*     'data': [ 1, 2, 3, 4 ],
+*     'accessors': [ getter ]
+* };
+*
+* // Compute the sum:
+* var out = reduce( x, 0, sum );
+* // returns 10
+*/
+function reduce( x, initial, fcn, thisArg ) {
+	var xbuf;
+	var get;
+	var acc;
+	var i;
+
+	// Cache reference to the input data:
+	xbuf = x.data;
+
+	// Cache the element accessor:
+	get = x.accessors[ 0 ];
+
+	// Iterate over each element...
+	acc = initial;
+	for ( i = 0; i < xbuf.length; i++ ) {
+		acc = fcn.call( thisArg, acc, get( xbuf, i ), i, xbuf );
+	}
+	return acc;
+}
+
+
+// EXPORTS //
+
+module.exports = reduce;

package/lib/index.js

@@ -19,7 +19,7 @@
 'use strict';
 
 /**
-* Apply a function against an accumulator and each element in a collection and return the accumulated result.
+* Apply a function against an accumulator and each element in an array and return the accumulated result.
 *
 * @module @stdlib/utils-reduce
 *
@@ -32,15 +32,29 @@
 *
 * var arr = [ 1, 2, 3, 4 ];
 *
-* var s = reduce( arr, 0, sum );
+* var out = reduce( arr, 0, sum );
 * // returns 10
+*
+* @example
+* var naryFunction = require( '@stdlib/utils-nary-function' );
+* var add = require( '@stdlib/math-base-ops-add' );
+* var array = require( '@stdlib/ndarray-array' );
+* var reduce = require( '@stdlib/utils-reduce' );
+*
+* var opts = {
+*     'dtype': 'generic'
+* };
+* var arr = array( [ [ 1, 2, 3 ], [ 4, 5, 6 ] ], opts );
+*
+* var out = reduce( arr, 0, naryFunction( add, 2 ) );
+* // returns 21
 */
 
 // MODULES //
 
-var reduce = require( './reduce.js' );
+var main = require( './main.js' );
 
 
 // EXPORTS //
 
-module.exports = reduce;
+module.exports = main;

package/lib/main.js

@@ -0,0 +1,94 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2018 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var isArrayLikeObject = require( '@stdlib/assert-is-array-like-object' );
+var isndarrayLike = require( '@stdlib/assert-is-ndarray-like' );
+var isFunction = require( '@stdlib/assert-is-function' );
+var ndarraylike2object = require( '@stdlib/ndarray-base-ndarraylike2object' );
+var arraylike2object = require( '@stdlib/array-base-arraylike2object' );
+var format = require( '@stdlib/string-format' );
+var ndarrayFcn = require( './ndarray.js' );
+var arrayFcn = require( './array.js' );
+
+
+// MAIN //
+
+/**
+* Applies a function against an accumulator and each element in an array and returns the accumulated result.
+*
+* ## Notes
+*
+* -   The applied function is provided the following arguments:
+*
+*     -   **accumulator**: accumulated value.
+*     -   **value**: array element.
+*     -   **index**: element index.
+*     -   **arr**: input array.
+*
+* @param {(ArrayLikeObject|ndarray)} arr - input array
+* @param {*} initial - initial value
+* @param {Function} reducer - reduction function
+* @param {*} [thisArg] - reduction function execution context
+* @throws {TypeError} first argument must be an array-like object or an ndarray
+* @throws {TypeError} third argument must be a function
+* @returns {*} accumulated result
+*
+* @example
+* function sum( acc, value ) {
+*     return acc + value;
+* }
+*
+* var arr = [ 1, 2, 3, 4 ];
+*
+* var out = reduce( arr, 0, sum );
+* // returns 10
+*
+* @example
+* var naryFunction = require( '@stdlib/utils-nary-function' );
+* var add = require( '@stdlib/math-base-ops-add' );
+* var array = require( '@stdlib/ndarray-array' );
+*
+* var opts = {
+*     'dtype': 'generic'
+* };
+* var arr = array( [ [ 1, 2, 3 ], [ 4, 5, 6 ] ], opts );
+*
+* var out = reduce( arr, 0, naryFunction( add, 2 ) );
+* // returns 21
+*/
+function reduce( arr, initial, reducer, thisArg ) {
+	if ( !isFunction( reducer ) ) {
+		throw new TypeError( format( 'invalid argument. Third argument must be a function. Value: `%s`.', reducer ) );
+	}
+	if ( isndarrayLike( arr ) ) { // note: assertion order matters here, as an ndarray-like object is also array-like
+		return ndarrayFcn( ndarraylike2object( arr ), initial, reducer, thisArg ); // eslint-disable-line max-len
+	}
+	if ( isArrayLikeObject( arr ) ) {
+		return arrayFcn( arraylike2object( arr ), initial, reducer, thisArg );
+	}
+	throw new TypeError( format( 'invalid argument. First argument must be an array-like object or an ndarray. Value: `%s`.', arr ) );
+}
+
+
+// EXPORTS //
+
+module.exports = reduce;

package/lib/ndarray.js

@@ -0,0 +1,153 @@
+/**
+* @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.
+*/
+
+'use strict';
+
+// MODULES //
+
+var vind2bind = require( '@stdlib/ndarray-base-vind2bind' );
+
+
+// VARIABLES //
+
+var MODE = 'throw';
+
+
+// MAIN //
+
+/**
+* Applies a function against an accumulator and each element in an array and returns the accumulated result.
+*
+* @private
+* @param {Object} x - object containing input ndarray meta data
+* @param {string} x.ref - reference to original input ndarray-like object
+* @param {string} x.dtype - data type
+* @param {Collection} x.data - data buffer
+* @param {NonNegativeInteger} x.length - number of elements
+* @param {NonNegativeIntegerArray} x.shape - dimensions
+* @param {IntegerArray} x.strides - stride lengths
+* @param {NonNegativeInteger} x.offset - index offset
+* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
+* @param {Array<Function>} x.accessors - accessors for accessing data buffer elements
+* @param {*} initial - initial value
+* @param {Function} fcn - function to apply
+* @param {*} thisArg - function execution context
+* @returns {*} accumulated result
+*
+* @example
+* var Complex64Array = require( '@stdlib/array-complex64' );
+* var Complex64 = require( '@stdlib/complex-float32' );
+* var realf = require( '@stdlib/complex-realf' );
+* var imagf = require( '@stdlib/complex-imagf' );
+* var cadd = require( '@stdlib/math-base-ops-cadd' );
+* var naryFunction = require( '@stdlib/utils-nary-function' );
+*
+* // Create a data buffer:
+* var xbuf = new Complex64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
+*
+* // Define the shape of the input array:
+* var shape = [ 2, 2 ];
+*
+* // Define the array strides:
+* var sx = [ 2, 1 ];
+*
+* // Define the index offset:
+* var ox = 0;
+*
+* // Define a getter:
+* function getter( buf, idx ) {
+*     return buf.get( idx );
+* }
+*
+* // Create the input ndarray-like object:
+* var x = {
+*     'ref': null,
+*     'dtype': 'complex64',
+*     'data': xbuf,
+*     'length': 4,
+*     'shape': shape,
+*     'strides': sx,
+*     'offset': ox,
+*     'order': 'row-major',
+*     'accessors': [ getter ]
+* };
+* x.ref = x;
+*
+* // Compute the sum:
+* var v = reduce( x, new Complex64( 0.0, 0.0 ), naryFunction( cadd, 2 ) );
+*
+* var re = realf( v );
+* // returns 16.0
+*
+* var im = imagf( v );
+* // returns 20.0
+*/
+function reduce( x, initial, fcn, thisArg ) {
+	var xbuf;
+	var ordx;
+	var acc;
+	var len;
+	var get;
+	var ref;
+	var shx;
+	var sx;
+	var ox;
+	var ix;
+	var i;
+
+	// Cache the total number of elements over which to iterate:
+	len = x.length;
+
+	// Cache the input array shape:
+	shx = x.shape;
+
+	// Cache reference to the input ndarray data buffer:
+	xbuf = x.data;
+
+	// Cache reference to the stride array:
+	sx = x.strides;
+
+	// Cache the index of the first indexed element:
+	ox = x.offset;
+
+	// Cache the array order:
+	ordx = x.order;
+
+	// Cache the element accessor:
+	get = x.accessors[ 0 ];
+
+	// Cache the reference to the original input array:
+	ref = x.ref;
+
+	// Check for a zero-dimensional array...
+	if ( shx.length === 0 ) {
+		return fcn.call( thisArg, initial, get( xbuf, ox ), 0, ref );
+	}
+	// Iterate over each element based on the linear **view** index, regardless as to how the data is stored in memory (note: this has negative performance implications for non-contiguous ndarrays due to a lack of data locality)...
+	acc = initial;
+	for ( i = 0; i < len; i++ ) {
+		ix = vind2bind( shx, sx, ox, ordx, i, MODE );
+		acc = fcn.call( thisArg, acc, get( xbuf, ix ), i, ref );
+	}
+	return acc;
+}
+
+
+// EXPORTS //
+
+module.exports = reduce;

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@stdlib/utils-reduce",
-  "version": "0.0.7",
-  "description": "Apply a function against an accumulator and each element in a collection and return the accumulated result.",
+  "version": "0.1.0",
+  "description": "Apply a function against an accumulator and each element in an array and return the accumulated result.",
   "license": "Apache-2.0",
   "author": {
     "name": "The Stdlib Authors",
@@ -37,18 +37,37 @@
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
   "dependencies": {
-    "@stdlib/assert-is-collection": "^0.0.x",
-    "@stdlib/assert-is-function": "^0.0.x",
-    "@stdlib/types": "^0.0.x"
+    "@stdlib/array-base-arraylike2object": "^0.1.0",
+    "@stdlib/assert-is-array-like-object": "^0.1.0",
+    "@stdlib/assert-is-function": "^0.1.0",
+    "@stdlib/assert-is-ndarray-like": "^0.1.0",
+    "@stdlib/ndarray-base-ndarraylike2object": "^0.1.0",
+    "@stdlib/ndarray-base-vind2bind": "^0.1.0",
+    "@stdlib/string-format": "^0.1.0",
+    "@stdlib/types": "^0.1.0",
+    "@stdlib/error-tools-fmtprodmsg": "^0.1.0"
   },
   "devDependencies": {
-    "@stdlib/array-float64": "^0.0.x",
-    "@stdlib/bench": "^0.0.x",
-    "@stdlib/math-base-assert-is-nan": "^0.0.x",
-    "@stdlib/utils-noop": "^0.0.x",
+    "@stdlib/array-base-filled": "^0.1.0",
+    "@stdlib/array-complex64": "^0.1.0",
+    "@stdlib/array-filled-by": "^0.0.2",
+    "@stdlib/array-float64": "^0.1.0",
+    "@stdlib/bench": "^0.1.0",
+    "@stdlib/complex-float32": "^0.1.0",
+    "@stdlib/complex-imagf": "^0.1.0",
+    "@stdlib/complex-realf": "^0.1.0",
+    "@stdlib/math-base-assert-is-nan": "^0.1.0",
+    "@stdlib/math-base-ops-add": "^0.1.0",
+    "@stdlib/math-base-ops-cadd": "^0.1.0",
+    "@stdlib/math-base-special-pow": "^0.1.0",
+    "@stdlib/ndarray-array": "^0.0.9",
+    "@stdlib/ndarray-ctor": "^0.1.0",
+    "@stdlib/random-base-discrete-uniform": "^0.0.6",
+    "@stdlib/utils-nary-function": "^0.1.0",
+    "@stdlib/utils-noop": "^0.1.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"
   },
   "engines": {
     "node": ">=0.10.0",
@@ -87,10 +106,14 @@
     "typed array",
     "typed",
     "array",
-    "array-like"
+    "array-like",
+    "ndarray",
+    "tensor",
+    "matrix",
+    "vector"
   ],
   "funding": {
-    "type": "patreon",
-    "url": "https://www.patreon.com/athan"
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
   }
 }