@stdlib/ndarray-base-binary-reduce-strided1d 0.1.0

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/initialize_array_views.js", "../lib/reshape_strategy.js", "../lib/increment_offsets.js", "../lib/set_view_offsets.js", "../lib/offsets.js", "../lib/2d_blocked_accessors.js", "../lib/3d_blocked_accessors.js", "../lib/4d_blocked_accessors.js", "../lib/5d_blocked_accessors.js", "../lib/6d_blocked_accessors.js", "../lib/7d_blocked_accessors.js", "../lib/8d_blocked_accessors.js", "../lib/9d_blocked_accessors.js", "../lib/10d_blocked_accessors.js", "../lib/2d_blocked.js", "../lib/3d_blocked.js", "../lib/4d_blocked.js", "../lib/5d_blocked.js", "../lib/6d_blocked.js", "../lib/7d_blocked.js", "../lib/8d_blocked.js", "../lib/9d_blocked.js", "../lib/10d_blocked.js", "../lib/0d_accessors.js", "../lib/1d_accessors.js", "../lib/2d_accessors.js", "../lib/3d_accessors.js", "../lib/4d_accessors.js", "../lib/5d_accessors.js", "../lib/6d_accessors.js", "../lib/7d_accessors.js", "../lib/8d_accessors.js", "../lib/9d_accessors.js", "../lib/10d_accessors.js", "../lib/nd_accessors.js", "../lib/0d.js", "../lib/1d.js", "../lib/2d.js", "../lib/3d.js", "../lib/4d.js", "../lib/5d.js", "../lib/6d.js", "../lib/7d.js", "../lib/8d.js", "../lib/9d.js", "../lib/10d.js", "../lib/nd.js", "../lib/main.js", "../lib/factory.js", "../lib/index.js"],
+  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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* Initialize ndarray-like objects for representing zero-dimensional sub-array views of ancillary ndarray arguments.\n*\n* ## Notes\n*\n* -   This function ignores the first three ndarray-like objects, which are assumed to be two input ndarrays and one output ndarray, respectively.\n* -   This function mutates the provided output array.\n*\n* @private\n* @param {ArrayLikeObject<Object>} arrays - list of ndarray-like objects\n* @param {Array<Object>} out - output array\n* @returns {Array<Object>} output array\n*/\nfunction initializeViews( arrays, out ) {\n\tvar v;\n\tvar i;\n\n\tfor ( i = 3; i < arrays.length; i++ ) {\n\t\tv = arrays[ i ];\n\t\tout.push({\n\t\t\t'dtype': v.dtype,\n\t\t\t'data': v.data,\n\t\t\t'shape': [],\n\t\t\t'strides': [ 0 ],\n\t\t\t'offset': v.offset,\n\t\t\t'order': v.order\n\t\t});\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = initializeViews;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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 iterationOrder = require( '@stdlib/ndarray-base-iteration-order' );\nvar minmaxViewBufferIndex = require( '@stdlib/ndarray-base-minmax-view-buffer-index' ).assign;\nvar ndarraylike2object = require( '@stdlib/ndarray-base-ndarraylike2object' );\nvar assign = require( '@stdlib/ndarray-base-assign' );\nvar ndarraylike2ndarray = require( '@stdlib/ndarray-base-ndarraylike2ndarray' );\nvar emptyLike = require( '@stdlib/ndarray-base-empty-like' );\n\n\n// FUNCTIONS //\n\n/**\n* Returns an input ndarray.\n*\n* @private\n* @param {ndarrayLike} x - input ndarray\n* @returns {ndarrayLike} input ndarray\n*/\nfunction identity( x ) {\n\treturn x;\n}\n\n/**\n* Broadcasts a zero-dimensional ndarray to a one-dimensional ndarray view containing a single element.\n*\n* @private\n* @param {ndarrayLike} x - input ndarray\n* @returns {ndarrayLike} broadcasted ndarray view\n*/\nfunction broadcast( x ) {\n\t// NOTE: the following properties must be set in the exact same order as in `x` in order to ensure that the returned object has the same hidden shape as the input ndarray-like object...\n\treturn {\n\t\t'dtype': x.dtype,\n\t\t'data': x.data,\n\t\t'shape': [ 1 ],\n\t\t'strides': [ 0 ],\n\t\t'offset': x.offset,\n\t\t'order': x.order\n\t};\n}\n\n/**\n* Returns a function which returns an ndarray view in which the singleton dimensions are removed from an input ndarray having only a single non-singleton dimension.\n*\n* @private\n* @param {ndarrayLike} arr - original ndarray\n* @param {NonNegativeInteger} index - index of the non-singleton dimension\n* @returns {Function} function for returning an ndarray view\n*/\nfunction squeeze( arr, index ) {\n\tvar sh = [ arr.shape[ index ] ];\n\tvar sx = [ arr.strides[ index ] ];\n\treturn reshape;\n\n\t/**\n\t* Returns an ndarray view in which the singleton dimensions are removed from an input ndarray having only a single non-singleton dimension.\n\t*\n\t* @private\n\t* @param {ndarrayLike} x - input ndarray\n\t* @returns {ndarrayLike} a squeezed ndarray view\n\t*/\n\tfunction reshape( x ) {\n\t\t// NOTE: the following properties must be set in the exact same order as in `arr` in order to ensure that the returned object has the same hidden shape as the input ndarray-like object...\n\t\treturn {\n\t\t\t'dtype': x.dtype,\n\t\t\t'data': x.data,\n\t\t\t'shape': sh,\n\t\t\t'strides': sx,\n\t\t\t'offset': x.offset,\n\t\t\t'order': x.order\n\t\t};\n\t}\n}\n\n/**\n* Returns a function which returns a one-dimensional ndarray view of a contiguous input ndarray having more than one dimension.\n*\n* @private\n* @param {NonNegativeInteger} len - number of elements in an ndarray\n* @param {integer} iox - iteration order\n* @returns {Function} function for returning a one-dimensional ndarray view\n*/\nfunction contiguous( len, iox ) {\n\tvar xmmv;\n\tvar ind;\n\tvar sh;\n\tvar sx;\n\n\t// Resolve the index of the min/max view buffer element which is the first indexed element...\n\tif ( iox === 1 ) {\n\t\tind = 0;\n\t} else {\n\t\tind = 1;\n\t}\n\t// Initialize an array for storing the min/max view buffer elements:\n\txmmv = [ 0, 0 ]; // [ min, max ]\n\n\t// Initialize the output one-dimensional view's shape and strides:\n\tsh = [ len ];\n\tsx = [ iox ];\n\n\treturn reshape;\n\n\t/**\n\t* Returns a one-dimensional ndarray view of a contiguous input ndarray having more than one dimension.\n\t*\n\t* @private\n\t* @param {ndarrayLike} x - input ndarray\n\t* @returns {ndarrayLike} a one-dimensional ndarray view\n\t*/\n\tfunction reshape( x ) {\n\t\t// Resolve the minimum and maximum linear indices in the underlying data buffer which are accessible to the input ndarray view:\n\t\tminmaxViewBufferIndex( x.shape, x.strides, x.offset, xmmv );\n\n\t\t// NOTE: the following properties must be set in the exact same order as in `x` in order to ensure that the returned object has the same hidden shape as the input ndarray-like object...\n\t\treturn {\n\t\t\t'dtype': x.dtype,\n\t\t\t'data': x.data,\n\t\t\t'shape': sh,\n\t\t\t'strides': sx,\n\t\t\t'offset': xmmv[ ind ], // the index of the first indexed element\n\t\t\t'order': x.order\n\t\t};\n\t}\n}\n\n/**\n* Returns a function which copies an input ndarray to a contiguous ndarray workspace.\n*\n* @private\n* @param {NonNegativeInteger} len - number of elements in an ndarray\n* @param {ndarrayLike} workspace - ndarray workspace\n* @returns {Function} function which copies an input ndarray to a contiguous ndarray workspace\n*/\nfunction copy( len, workspace ) {\n\t// NOTE: the following properties must be set in the exact same order as in the input ndarray-like object in order to ensure that the returned object has the same hidden shape...\n\tvar view = {\n\t\t'dtype': workspace.dtype,\n\t\t'data': workspace.data,\n\t\t'shape': [ len ],\n\t\t'strides': [ 1 ],\n\t\t'offset': workspace.offset,\n\t\t'order': workspace.order\n\t};\n\treturn reshape;\n\n\t/**\n\t* Copies an input ndarray to a contiguous ndarray workspace and returns a one-dimensional workspace view.\n\t*\n\t* @private\n\t* @param {ndarrayLike} x - input ndarray\n\t* @returns {ndarrayLike} one-dimensional workspace view\n\t*/\n\tfunction reshape( x ) {\n\t\tassign( [ x, workspace ] );\n\t\treturn view;\n\t}\n}\n\n\n// MAIN //\n\n/**\n* Returns a function for reshaping input ndarrays which have the same data type, shape, and strides as a provided ndarray.\n*\n* @private\n* @param {ndarrayLike} x - input ndarray\n* @param {*} x.dtype - input ndarray data type\n* @param {Collection} x.data - input ndarray data buffer\n* @param {NonNegativeIntegerArray} x.shape - input ndarray shape\n* @param {IntegerArray} x.strides - input ndarray strides\n* @param {NonNegativeInteger} x.offset - input ndarray index offset\n* @param {string} x.order - input ndarray memory layout\n* @returns {Function} function implementing a reshape strategy\n*/\nfunction strategy( x ) {\n\tvar ndims;\n\tvar xmmv;\n\tvar len;\n\tvar iox;\n\tvar sh;\n\tvar ns;\n\tvar i;\n\n\t// Resolve the number of array dimensions:\n\tsh = x.shape;\n\tndims = sh.length;\n\n\t// Check whether the ndarray is zero-dimensional...\n\tif ( ndims === 0 ) {\n\t\treturn broadcast;\n\t}\n\t// Check whether the ndarray is already one-dimensional...\n\tif ( ndims === 1 ) {\n\t\treturn identity;\n\t}\n\t// Determine the number of singleton dimensions...\n\tlen = 1; // number of elements\n\tns = 0;  // number of singleton dimensions\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\t// Check whether the current dimension is a singleton dimension...\n\t\tif ( sh[ i ] === 1 ) {\n\t\t\tns += 1;\n\t\t}\n\t\tlen *= sh[ i ];\n\t}\n\t// Determine whether the ndarray has only **one** non-singleton dimension (e.g., ndims=4, shape=[10,1,1,1]) so that we can simply create an ndarray view without the singleton dimensions...\n\tif ( ns === ndims-1 ) {\n\t\t// Get the index of the non-singleton dimension...\n\t\tfor ( i = 0; i < ndims; i++ ) {\n\t\t\tif ( sh[ i ] !== 1 ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn squeeze( x, i );\n\t}\n\tiox = iterationOrder( x.strides ); // +/-1\n\n\t// Determine whether we can avoid copying data...\n\tif ( iox !== 0 ) {\n\t\t// Determine the minimum and maximum linear indices which are accessible by the ndarray view:\n\t\txmmv = minmaxViewBufferIndex( sh, x.strides, x.offset, [ 0, 0 ] );\n\n\t\t// Determine whether we can ignore shape (and strides) and create a new one-dimensional ndarray view...\n\t\tif ( len === ( xmmv[1]-xmmv[0]+1 ) ) {\n\t\t\treturn contiguous( len, iox );\n\t\t}\n\t\t// The ndarray is non-contiguous, so we cannot directly interpret as a one-dimensional ndarray...\n\n\t\t// Fall-through to copying to a workspace ndarray...\n\t}\n\t// At this point, we're dealing with a non-contiguous multi-dimensional ndarray, so we need to copy to a contiguous workspace:\n\treturn copy( len, ndarraylike2object( emptyLike( ndarraylike2ndarray( x ) ) ) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = strategy;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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* Increments index offsets according to a list of increments.\n*\n* ## Notes\n*\n* -   This function mutates the list of index offsets.\n*\n* @private\n* @param {NonNegativeIntegerArray} offsets - list of index offsets\n* @param {NonNegativeIntegerArray} inc - list of increments\n* @returns {NonNegativeIntegerArray} updated offsets\n*/\nfunction incrementOffsets( offsets, inc ) {\n\tvar i;\n\tfor ( i = 0; i < offsets.length; i++ ) {\n\t\toffsets[ i ] += inc[ i ];\n\t}\n\treturn offsets;\n}\n\n\n// EXPORTS //\n\nmodule.exports = incrementOffsets;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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* Sets view offsets according to a list of index offsets.\n*\n* ## Notes\n*\n* -   This function skips the third element in the list of index offsets, as that is assumed to correspond to the output ndarray which does not have a corresponding view. Meaning, the list of views is expected to have `N` elements, and the list of index offsets is expected to have `N+1` elements.\n* -   This function mutates the provides view objects.\n*\n* @private\n* @param {Array<Object>} views - list of ndarray-like objects representing ndarray views\n* @param {NonNegativeIntegerArray} offsets - list of index offsets\n* @returns {Array<Object>} updated views\n*/\nfunction setViewOffsets( views, offsets ) {\n\tvar i;\n\tvar j;\n\tfor ( i = 0, j = 0; i < offsets.length; i++ ) {\n\t\tif ( i === 2 ) { // note: expected to correspond to the output ndarray which does not have a corresponding view\n\t\t\tcontinue;\n\t\t}\n\t\tviews[ j ].offset = offsets[ i ];\n\t\tj += 1;\n\t}\n\treturn views;\n}\n\n\n// EXPORTS //\n\nmodule.exports = setViewOffsets;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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* Resolves index offsets from a list of ndarray-like objects.\n*\n* @private\n* @param {ArrayLikeObject<Object>} arrays - list of ndarray-like objects\n* @returns {NonNegativeIntegerArray} list of offsets\n*/\nfunction offsets( arrays ) {\n\tvar out = [];\n\tvar i;\n\tfor ( i = 0; i < arrays.length; i++ ) {\n\t\tout.push( arrays[ i ].offset );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = offsets;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 3, 2, 2 ];\n* var ysh = [ 1, 3, 2, 2 ];\n* var zsh = [ 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary2d( gdot, [ x, y, z ], views, [ 12, 4 ], [ 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ 30.0, 174.0, 446.0 ] ]\n*/\nfunction blockedbinary2d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar ov1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[1];\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tdv1 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\tif ( j1 < bsize ) {\n\t\t\ts1 = j1;\n\t\t\tj1 = 0;\n\t\t} else {\n\t\t\ts1 = bsize;\n\t\t\tj1 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov1[ k ] = ov[k] + ( j1*sv[k][1] );\n\t\t}\n\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\tif ( j0 < bsize ) {\n\t\t\t\ts0 = j0;\n\t\t\t\tj0 = 0;\n\t\t\t} else {\n\t\t\t\ts0 = bsize;\n\t\t\t\tj0 -= bsize;\n\t\t\t}\n\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t}\n\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary3d( gdot, [ x, y, z ], views, [ 12, 12, 4 ], [ 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ 30.0, 174.0, 446.0 ] ] ]\n*/\nfunction blockedbinary3d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar ov1;\n\tvar ov2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[1];\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\tif ( j2 < bsize ) {\n\t\t\ts2 = j2;\n\t\t\tj2 = 0;\n\t\t} else {\n\t\t\ts2 = bsize;\n\t\t\tj2 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov2[ k ] = ov[k] + ( j2*sv[k][2] );\n\t\t}\n\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\tif ( j1 < bsize ) {\n\t\t\t\ts1 = j1;\n\t\t\t\tj1 = 0;\n\t\t\t} else {\n\t\t\t\ts1 = bsize;\n\t\t\t\tj1 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t}\n\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\ts0 = j0;\n\t\t\t\t\tj0 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts0 = bsize;\n\t\t\t\t\tj0 -= bsize;\n\t\t\t\t}\n\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t}\n\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary4d( gdot, [ x, y, z ], views, [ 12, 12, 12, 4 ], [ 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ]\n*/\nfunction blockedbinary4d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[1];\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\tif ( j3 < bsize ) {\n\t\t\ts3 = j3;\n\t\t\tj3 = 0;\n\t\t} else {\n\t\t\ts3 = bsize;\n\t\t\tj3 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov3[ k ] = ov[k] + ( j3*sv[k][3] );\n\t\t}\n\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\tif ( j2 < bsize ) {\n\t\t\t\ts2 = j2;\n\t\t\t\tj2 = 0;\n\t\t\t} else {\n\t\t\t\ts2 = bsize;\n\t\t\t\tj2 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t}\n\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\ts1 = j1;\n\t\t\t\t\tj1 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts1 = bsize;\n\t\t\t\t\tj1 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t}\n\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t}\n\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary5d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ]\n*/\nfunction blockedbinary5d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[1];\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\tif ( j4 < bsize ) {\n\t\t\ts4 = j4;\n\t\t\tj4 = 0;\n\t\t} else {\n\t\t\ts4 = bsize;\n\t\t\tj4 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov4[ k ] = ov[k] + ( j4*sv[k][4] );\n\t\t}\n\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\tif ( j3 < bsize ) {\n\t\t\t\ts3 = j3;\n\t\t\t\tj3 = 0;\n\t\t\t} else {\n\t\t\t\ts3 = bsize;\n\t\t\t\tj3 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t}\n\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\ts2 = j2;\n\t\t\t\t\tj2 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts2 = bsize;\n\t\t\t\t\tj2 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t}\n\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary6d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ]\n*/\nfunction blockedbinary6d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[1];\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\tif ( j5 < bsize ) {\n\t\t\ts5 = j5;\n\t\t\tj5 = 0;\n\t\t} else {\n\t\t\ts5 = bsize;\n\t\t\tj5 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov5[ k ] = ov[k] + ( j5*sv[k][5] );\n\t\t}\n\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\tif ( j4 < bsize ) {\n\t\t\t\ts4 = j4;\n\t\t\t\tj4 = 0;\n\t\t\t} else {\n\t\t\t\ts4 = bsize;\n\t\t\t\tj4 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t}\n\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\ts3 = j3;\n\t\t\t\t\tj3 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts3 = bsize;\n\t\t\t\t\tj3 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t}\n\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary7d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ]\n*/\nfunction blockedbinary7d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar ov6;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tov6 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tdv6 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\tif ( j6 < bsize ) {\n\t\t\ts6 = j6;\n\t\t\tj6 = 0;\n\t\t} else {\n\t\t\ts6 = bsize;\n\t\t\tj6 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov6[ k ] = ov[k] + ( j6*sv[k][6] );\n\t\t}\n\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\tif ( j5 < bsize ) {\n\t\t\t\ts5 = j5;\n\t\t\t\tj5 = 0;\n\t\t\t} else {\n\t\t\t\ts5 = bsize;\n\t\t\t\tj5 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv6[ k ] = sv[k][6] - ( s5*sv[k][5] );\n\t\t\t\tov5[ k ] = ov6[k] + ( j5*sv[k][5] );\n\t\t\t}\n\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\ts4 = j4;\n\t\t\t\t\tj4 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts4 = bsize;\n\t\t\t\t\tj4 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t\t}\n\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary8d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ]\n*/\nfunction blockedbinary8d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar ov6;\n\tvar ov7;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tov6 = zeros( N );\n\tov7 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tdv6 = zeros( N );\n\tdv7 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\tif ( j7 < bsize ) {\n\t\t\ts7 = j7;\n\t\t\tj7 = 0;\n\t\t} else {\n\t\t\ts7 = bsize;\n\t\t\tj7 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov7[ k ] = ov[k] + ( j7*sv[k][7] );\n\t\t}\n\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\tif ( j6 < bsize ) {\n\t\t\t\ts6 = j6;\n\t\t\t\tj6 = 0;\n\t\t\t} else {\n\t\t\t\ts6 = bsize;\n\t\t\t\tj6 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv7[ k ] = sv[k][7] - ( s6*sv[k][6] );\n\t\t\t\tov6[ k ] = ov7[k] + ( j6*sv[k][6] );\n\t\t\t}\n\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\ts5 = j5;\n\t\t\t\t\tj5 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts5 = bsize;\n\t\t\t\t\tj5 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv6[ k ] = sv[k][6] - ( s5*sv[k][5] );\n\t\t\t\t\tov5[ k ] = ov6[k] + ( j5*sv[k][5] );\n\t\t\t\t}\n\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv7 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary9d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ] ]\n*/\nfunction blockedbinary9d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar dv8;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar ov6;\n\tvar ov7;\n\tvar ov8;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tov6 = zeros( N );\n\tov7 = zeros( N );\n\tov8 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tdv6 = zeros( N );\n\tdv7 = zeros( N );\n\tdv8 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\tif ( j8 < bsize ) {\n\t\t\ts8 = j8;\n\t\t\tj8 = 0;\n\t\t} else {\n\t\t\ts8 = bsize;\n\t\t\tj8 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov8[ k ] = ov[k] + ( j8*sv[k][8] );\n\t\t}\n\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\tif ( j7 < bsize ) {\n\t\t\t\ts7 = j7;\n\t\t\t\tj7 = 0;\n\t\t\t} else {\n\t\t\t\ts7 = bsize;\n\t\t\t\tj7 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv8[ k ] = sv[k][8] - ( s7*sv[k][7] );\n\t\t\t\tov7[ k ] = ov8[k] + ( j7*sv[k][7] );\n\t\t\t}\n\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\ts6 = j6;\n\t\t\t\t\tj6 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts6 = bsize;\n\t\t\t\t\tj6 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv7[ k ] = sv[k][7] - ( s6*sv[k][6] );\n\t\t\t\t\tov6[ k ] = ov7[k] + ( j6*sv[k][6] );\n\t\t\t\t}\n\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv6[ k ] = sv[k][6] - ( s5*sv[k][5] );\n\t\t\t\t\t\tov5[ k ] = ov6[k] + ( j5*sv[k][5] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv7 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv8 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary10d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ] ] ]\n*/\nfunction blockedbinary10d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar dv8;\n\tvar dv9;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar ov6;\n\tvar ov7;\n\tvar ov8;\n\tvar ov9;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar s9;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar j9;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tov6 = zeros( N );\n\tov7 = zeros( N );\n\tov8 = zeros( N );\n\tov9 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tdv6 = zeros( N );\n\tdv7 = zeros( N );\n\tdv8 = zeros( N );\n\tdv9 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j9 = sh[9]; j9 > 0; ) {\n\t\tif ( j9 < bsize ) {\n\t\t\ts9 = j9;\n\t\t\tj9 = 0;\n\t\t} else {\n\t\t\ts9 = bsize;\n\t\t\tj9 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov9[ k ] = ov[k] + ( j9*sv[k][9] );\n\t\t}\n\t\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\t\tif ( j8 < bsize ) {\n\t\t\t\ts8 = j8;\n\t\t\t\tj8 = 0;\n\t\t\t} else {\n\t\t\t\ts8 = bsize;\n\t\t\t\tj8 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv9[ k ] = sv[k][9] - ( s8*sv[k][8] );\n\t\t\t\tov8[ k ] = ov9[k] + ( j8*sv[k][8] );\n\t\t\t}\n\t\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\t\tif ( j7 < bsize ) {\n\t\t\t\t\ts7 = j7;\n\t\t\t\t\tj7 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts7 = bsize;\n\t\t\t\t\tj7 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv8[ k ] = sv[k][8] - ( s7*sv[k][7] );\n\t\t\t\t\tov7[ k ] = ov8[k] + ( j7*sv[k][7] );\n\t\t\t\t}\n\t\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\t\ts6 = j6;\n\t\t\t\t\t\tj6 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts6 = bsize;\n\t\t\t\t\t\tj6 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv7[ k ] = sv[k][7] - ( s6*sv[k][6] );\n\t\t\t\t\t\tov6[ k ] = ov7[k] + ( j6*sv[k][6] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv6[ k ] = sv[k][6] - ( s5*sv[k][5] );\n\t\t\t\t\t\t\tov5[ k ] = ov6[k] + ( j5*sv[k][5] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\t\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\t\tfor ( i9 = 0; i9 < s9; i9++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv7 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv8 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv9 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 3, 2, 2 ];\n* var ysh = [ 1, 3, 2, 2 ];\n* var zsh = [ 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary2d( gdot, [ x, y, z ], views, [ 12, 4 ], [ 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ 30.0, 174.0, 446.0 ] ]\n*/\nfunction blockedbinary2d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar ov1;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar j0;\n\tvar j1;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tdv1 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\tif ( j1 < bsize ) {\n\t\t\ts1 = j1;\n\t\t\tj1 = 0;\n\t\t} else {\n\t\t\ts1 = bsize;\n\t\t\tj1 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov1[ k ] = ov[k] + ( j1*sv[k][1] );\n\t\t}\n\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\tif ( j0 < bsize ) {\n\t\t\t\ts0 = j0;\n\t\t\t\tj0 = 0;\n\t\t\t} else {\n\t\t\t\ts0 = bsize;\n\t\t\t\tj0 -= bsize;\n\t\t\t}\n\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t}\n\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary3d( gdot, [ x, y, z ], views, [ 12, 12, 4 ], [ 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ 30.0, 174.0, 446.0 ] ] ]\n*/\nfunction blockedbinary3d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar ov1;\n\tvar ov2;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\tif ( j2 < bsize ) {\n\t\t\ts2 = j2;\n\t\t\tj2 = 0;\n\t\t} else {\n\t\t\ts2 = bsize;\n\t\t\tj2 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov2[ k ] = ov[k] + ( j2*sv[k][2] );\n\t\t}\n\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\tif ( j1 < bsize ) {\n\t\t\t\ts1 = j1;\n\t\t\t\tj1 = 0;\n\t\t\t} else {\n\t\t\t\ts1 = bsize;\n\t\t\t\tj1 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t}\n\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\ts0 = j0;\n\t\t\t\t\tj0 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts0 = bsize;\n\t\t\t\t\tj0 -= bsize;\n\t\t\t\t}\n\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t}\n\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary4d( gdot, [ x, y, z ], views, [ 12, 12, 12, 4 ], [ 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ]\n*/\nfunction blockedbinary4d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\tif ( j3 < bsize ) {\n\t\t\ts3 = j3;\n\t\t\tj3 = 0;\n\t\t} else {\n\t\t\ts3 = bsize;\n\t\t\tj3 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov3[ k ] = ov[k] + ( j3*sv[k][3] );\n\t\t}\n\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\tif ( j2 < bsize ) {\n\t\t\t\ts2 = j2;\n\t\t\t\tj2 = 0;\n\t\t\t} else {\n\t\t\t\ts2 = bsize;\n\t\t\t\tj2 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t}\n\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\ts1 = j1;\n\t\t\t\t\tj1 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts1 = bsize;\n\t\t\t\t\tj1 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t}\n\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t}\n\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-statements, max-len */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary5d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ]\n*/\nfunction blockedbinary5d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\tif ( j4 < bsize ) {\n\t\t\ts4 = j4;\n\t\t\tj4 = 0;\n\t\t} else {\n\t\t\ts4 = bsize;\n\t\t\tj4 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov4[ k ] = ov[k] + ( j4*sv[k][4] );\n\t\t}\n\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\tif ( j3 < bsize ) {\n\t\t\t\ts3 = j3;\n\t\t\t\tj3 = 0;\n\t\t\t} else {\n\t\t\t\ts3 = bsize;\n\t\t\t\tj3 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t}\n\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\ts2 = j2;\n\t\t\t\t\tj2 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts2 = bsize;\n\t\t\t\t\tj2 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t}\n\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary6d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ]\n*/\nfunction blockedbinary6d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\tif ( j5 < bsize ) {\n\t\t\ts5 = j5;\n\t\t\tj5 = 0;\n\t\t} else {\n\t\t\ts5 = bsize;\n\t\t\tj5 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov5[ k ] = ov[k] + ( j5*sv[k][5] );\n\t\t}\n\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\tif ( j4 < bsize ) {\n\t\t\t\ts4 = j4;\n\t\t\t\tj4 = 0;\n\t\t\t} else {\n\t\t\t\ts4 = bsize;\n\t\t\t\tj4 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t}\n\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\ts3 = j3;\n\t\t\t\t\tj3 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts3 = bsize;\n\t\t\t\t\tj3 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t}\n\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary7d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ]\n*/\nfunction blockedbinary7d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar ov6;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tov6 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tdv6 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\tif ( j6 < bsize ) {\n\t\t\ts6 = j6;\n\t\t\tj6 = 0;\n\t\t} else {\n\t\t\ts6 = bsize;\n\t\t\tj6 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov6[ k ] = ov[k] + ( j6*sv[k][6] );\n\t\t}\n\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\tif ( j5 < bsize ) {\n\t\t\t\ts5 = j5;\n\t\t\t\tj5 = 0;\n\t\t\t} else {\n\t\t\t\ts5 = bsize;\n\t\t\t\tj5 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv6[ k ] = sv[k][6] - ( s5*sv[k][5] );\n\t\t\t\tov5[ k ] = ov6[k] + ( j5*sv[k][5] );\n\t\t\t}\n\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\ts4 = j4;\n\t\t\t\t\tj4 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts4 = bsize;\n\t\t\t\t\tj4 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t\t}\n\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary8d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ]\n*/\nfunction blockedbinary8d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar ov6;\n\tvar ov7;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tov6 = zeros( N );\n\tov7 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tdv6 = zeros( N );\n\tdv7 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\tif ( j7 < bsize ) {\n\t\t\ts7 = j7;\n\t\t\tj7 = 0;\n\t\t} else {\n\t\t\ts7 = bsize;\n\t\t\tj7 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov7[ k ] = ov[k] + ( j7*sv[k][7] );\n\t\t}\n\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\tif ( j6 < bsize ) {\n\t\t\t\ts6 = j6;\n\t\t\t\tj6 = 0;\n\t\t\t} else {\n\t\t\t\ts6 = bsize;\n\t\t\t\tj6 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv7[ k ] = sv[k][7] - ( s6*sv[k][6] );\n\t\t\t\tov6[ k ] = ov7[k] + ( j6*sv[k][6] );\n\t\t\t}\n\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\ts5 = j5;\n\t\t\t\t\tj5 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts5 = bsize;\n\t\t\t\t\tj5 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv6[ k ] = sv[k][6] - ( s5*sv[k][5] );\n\t\t\t\t\tov5[ k ] = ov6[k] + ( j5*sv[k][5] );\n\t\t\t\t}\n\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv7 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary9d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ] ]\n*/\nfunction blockedbinary9d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar dv8;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar ov6;\n\tvar ov7;\n\tvar ov8;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tov6 = zeros( N );\n\tov7 = zeros( N );\n\tov8 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tdv6 = zeros( N );\n\tdv7 = zeros( N );\n\tdv8 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\tif ( j8 < bsize ) {\n\t\t\ts8 = j8;\n\t\t\tj8 = 0;\n\t\t} else {\n\t\t\ts8 = bsize;\n\t\t\tj8 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov8[ k ] = ov[k] + ( j8*sv[k][8] );\n\t\t}\n\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\tif ( j7 < bsize ) {\n\t\t\t\ts7 = j7;\n\t\t\t\tj7 = 0;\n\t\t\t} else {\n\t\t\t\ts7 = bsize;\n\t\t\t\tj7 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv8[ k ] = sv[k][8] - ( s7*sv[k][7] );\n\t\t\t\tov7[ k ] = ov8[k] + ( j7*sv[k][7] );\n\t\t\t}\n\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\ts6 = j6;\n\t\t\t\t\tj6 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts6 = bsize;\n\t\t\t\t\tj6 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv7[ k ] = sv[k][7] - ( s6*sv[k][6] );\n\t\t\t\t\tov6[ k ] = ov7[k] + ( j6*sv[k][6] );\n\t\t\t\t}\n\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv6[ k ] = sv[k][6] - ( s5*sv[k][5] );\n\t\t\t\t\t\tov5[ k ] = ov6[k] + ( j5*sv[k][5] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv7 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv8 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar loopOrder = require( '@stdlib/ndarray-base-binary-loop-interchange-order' );\nvar blockSize = require( '@stdlib/ndarray-base-binary-tiling-block-size' );\nvar takeIndexed = require( '@stdlib/array-base-take-indexed' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray via loop blocking.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* blockedbinary10d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ] ] ]\n*/\nfunction blockedbinary10d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar bsize;\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar dv8;\n\tvar dv9;\n\tvar ov1;\n\tvar ov2;\n\tvar ov3;\n\tvar ov4;\n\tvar ov5;\n\tvar ov6;\n\tvar ov7;\n\tvar ov8;\n\tvar ov9;\n\tvar sh;\n\tvar s0;\n\tvar s1;\n\tvar s2;\n\tvar s3;\n\tvar s4;\n\tvar s5;\n\tvar s6;\n\tvar s7;\n\tvar s8;\n\tvar s9;\n\tvar sv;\n\tvar ov;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar j0;\n\tvar j1;\n\tvar j2;\n\tvar j3;\n\tvar j4;\n\tvar j5;\n\tvar j6;\n\tvar j7;\n\tvar j8;\n\tvar j9;\n\tvar N;\n\tvar o;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar v;\n\tvar k;\n\n\t// Note on variable naming convention: S#, dv#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\tN = arrays.length;\n\tx = arrays[ 0 ];\n\ty = arrays[ 1 ];\n\tz = arrays[ 2 ];\n\n\t// Resolve the loop interchange order:\n\to = loopOrder( z.shape, stridesX, stridesY, z.strides );\n\tsh = o.sh;\n\tsv = [ o.sx, o.sy, o.sz ];\n\tfor ( k = 3; k < N; k++ ) {\n\t\tsv.push( takeIndexed( arrays[k].strides, o.idx ) );\n\t}\n\t// Determine the block size:\n\tbsize = blockSize( x.dtype, y.dtype, z.dtype );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tov = offsets( arrays );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache offset increments for the innermost loop...\n\tdv0 = [];\n\tfor ( k = 0; k < N; k++ ) {\n\t\tdv0.push( sv[k][0] );\n\t}\n\t// Initialize loop variables...\n\tov1 = zeros( N );\n\tov2 = zeros( N );\n\tov3 = zeros( N );\n\tov4 = zeros( N );\n\tov5 = zeros( N );\n\tov6 = zeros( N );\n\tov7 = zeros( N );\n\tov8 = zeros( N );\n\tov9 = zeros( N );\n\tdv1 = zeros( N );\n\tdv2 = zeros( N );\n\tdv3 = zeros( N );\n\tdv4 = zeros( N );\n\tdv5 = zeros( N );\n\tdv6 = zeros( N );\n\tdv7 = zeros( N );\n\tdv8 = zeros( N );\n\tdv9 = zeros( N );\n\tiv = zeros( N );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Iterate over blocks...\n\tfor ( j9 = sh[9]; j9 > 0; ) {\n\t\tif ( j9 < bsize ) {\n\t\t\ts9 = j9;\n\t\t\tj9 = 0;\n\t\t} else {\n\t\t\ts9 = bsize;\n\t\t\tj9 -= bsize;\n\t\t}\n\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\tov9[ k ] = ov[k] + ( j9*sv[k][9] );\n\t\t}\n\t\tfor ( j8 = sh[8]; j8 > 0; ) {\n\t\t\tif ( j8 < bsize ) {\n\t\t\t\ts8 = j8;\n\t\t\t\tj8 = 0;\n\t\t\t} else {\n\t\t\t\ts8 = bsize;\n\t\t\t\tj8 -= bsize;\n\t\t\t}\n\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\tdv9[ k ] = sv[k][9] - ( s8*sv[k][8] );\n\t\t\t\tov8[ k ] = ov9[k] + ( j8*sv[k][8] );\n\t\t\t}\n\t\t\tfor ( j7 = sh[7]; j7 > 0; ) {\n\t\t\t\tif ( j7 < bsize ) {\n\t\t\t\t\ts7 = j7;\n\t\t\t\t\tj7 = 0;\n\t\t\t\t} else {\n\t\t\t\t\ts7 = bsize;\n\t\t\t\t\tj7 -= bsize;\n\t\t\t\t}\n\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\tdv8[ k ] = sv[k][8] - ( s7*sv[k][7] );\n\t\t\t\t\tov7[ k ] = ov8[k] + ( j7*sv[k][7] );\n\t\t\t\t}\n\t\t\t\tfor ( j6 = sh[6]; j6 > 0; ) {\n\t\t\t\t\tif ( j6 < bsize ) {\n\t\t\t\t\t\ts6 = j6;\n\t\t\t\t\t\tj6 = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ts6 = bsize;\n\t\t\t\t\t\tj6 -= bsize;\n\t\t\t\t\t}\n\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\tdv7[ k ] = sv[k][7] - ( s6*sv[k][6] );\n\t\t\t\t\t\tov6[ k ] = ov7[k] + ( j6*sv[k][6] );\n\t\t\t\t\t}\n\t\t\t\t\tfor ( j5 = sh[5]; j5 > 0; ) {\n\t\t\t\t\t\tif ( j5 < bsize ) {\n\t\t\t\t\t\t\ts5 = j5;\n\t\t\t\t\t\t\tj5 = 0;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ts5 = bsize;\n\t\t\t\t\t\t\tj5 -= bsize;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\tdv6[ k ] = sv[k][6] - ( s5*sv[k][5] );\n\t\t\t\t\t\t\tov5[ k ] = ov6[k] + ( j5*sv[k][5] );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor ( j4 = sh[4]; j4 > 0; ) {\n\t\t\t\t\t\t\tif ( j4 < bsize ) {\n\t\t\t\t\t\t\t\ts4 = j4;\n\t\t\t\t\t\t\t\tj4 = 0;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ts4 = bsize;\n\t\t\t\t\t\t\t\tj4 -= bsize;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\tdv5[ k ] = sv[k][5] - ( s4*sv[k][4] );\n\t\t\t\t\t\t\t\tov4[ k ] = ov5[k] + ( j4*sv[k][4] );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor ( j3 = sh[3]; j3 > 0; ) {\n\t\t\t\t\t\t\t\tif ( j3 < bsize ) {\n\t\t\t\t\t\t\t\t\ts3 = j3;\n\t\t\t\t\t\t\t\t\tj3 = 0;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\ts3 = bsize;\n\t\t\t\t\t\t\t\t\tj3 -= bsize;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\tdv4[ k ] = sv[k][4] - ( s3*sv[k][3] );\n\t\t\t\t\t\t\t\t\tov3[ k ] = ov4[k] + ( j3*sv[k][3] );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tfor ( j2 = sh[2]; j2 > 0; ) {\n\t\t\t\t\t\t\t\t\tif ( j2 < bsize ) {\n\t\t\t\t\t\t\t\t\t\ts2 = j2;\n\t\t\t\t\t\t\t\t\t\tj2 = 0;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\ts2 = bsize;\n\t\t\t\t\t\t\t\t\t\tj2 -= bsize;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\tdv3[ k ] = sv[k][3] - ( s2*sv[k][2] );\n\t\t\t\t\t\t\t\t\t\tov2[ k ] = ov3[k] + ( j2*sv[k][2] );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tfor ( j1 = sh[1]; j1 > 0; ) {\n\t\t\t\t\t\t\t\t\t\tif ( j1 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\ts1 = j1;\n\t\t\t\t\t\t\t\t\t\t\tj1 = 0;\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\ts1 = bsize;\n\t\t\t\t\t\t\t\t\t\t\tj1 -= bsize;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\t\tdv2[ k ] = sv[k][2] - ( s1*sv[k][1] );\n\t\t\t\t\t\t\t\t\t\t\tov1[ k ] = ov2[k] + ( j1*sv[k][1] );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tfor ( j0 = sh[0]; j0 > 0; ) {\n\t\t\t\t\t\t\t\t\t\t\tif ( j0 < bsize ) {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = j0;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 = 0;\n\t\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\t\ts0 = bsize;\n\t\t\t\t\t\t\t\t\t\t\t\tj0 -= bsize;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Compute index offsets and loop offset increments for the first ndarray elements in the current block...\n\t\t\t\t\t\t\t\t\t\t\tfor ( k = 0; k < N; k++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tiv[ k ] = ov1[k] + ( j0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\t\t\tdv1[ k ] = sv[k][1] - ( s0*sv[k][0] );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t// Iterate over the non-reduced ndarray dimensions...\n\t\t\t\t\t\t\t\t\t\t\tfor ( i9 = 0; i9 < s9; i9++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\tfor ( i8 = 0; i8 < s8; i8++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i7 = 0; i7 < s7; i7++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i6 = 0; i6 < s6; i6++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i5 = 0; i5 < s5; i5++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i4 = 0; i4 < s4; i4++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i3 = 0; i3 < s3; i3++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < s2; i2++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < s1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < s0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv7 );\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv8 );\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv9 );\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = blockedbinary10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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 without = require( '@stdlib/array-base-without' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 2, 2 ];\n* var ysh = [ 2, 2 ];\n* var zsh = [];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 0 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary0d( gdot, [ x, y, z ], strategy, strategy, {} );\n*\n* var v = z.data.get( 0 );\n* // returns 30.0\n*/\nfunction binary0d( fcn, arrays, strategyX, strategyY, opts ) {\n\tvar z = arrays[ 2 ];\n\tarrays[ 0 ] = strategyX( arrays[ 0 ] );\n\tarrays[ 1 ] = strategyY( arrays[ 1 ] );\n\tz.accessors[ 1 ]( z.data, z.offset, fcn( without( arrays, 2 ), opts ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary0d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 3, 2, 2 ];\n* var ysh = [ 3, 2, 2 ];\n* var zsh = [ 3 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary1d( gdot, [ x, y, z ], views, [ 4 ], [ 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ 30.0, 174.0, 446.0 ]\n*/\nfunction binary1d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar sh;\n\tvar S0;\n\tvar iv;\n\tvar i0;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables: dimensions and loop offset (pointer) increments...\n\tS0 = sh[ 0 ];\n\tdv0 = [\n\t\tstridesX[0],\n\t\tstridesY[0]\n\t];\n\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\tdv0.push( arrays[i].strides[0] );\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tsetViewOffsets( views, iv );\n\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\tset( zbuf, iv[2], fcn( v, opts ) );\n\t\tincrementOffsets( iv, dv0 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary1d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 3, 2, 2 ];\n* var ysh = [ 1, 3, 2, 2 ];\n* var zsh = [ 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary2d( gdot, [ x, y, z ], views, [ 12, 4 ], [ 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ 30.0, 174.0, 446.0 ] ]\n*/\nfunction binary2d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 1 ];\n\t\tS1 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[1],\n\t\t\tstridesY[1]\n\t\t];\n\t\tdv1 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S0*stridesX[1] ),\n\t\t\tstridesY[0] - ( S0*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[1] );\n\t\t\tdv1.push( sv[0] - ( S0*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tsetViewOffsets( views, iv );\n\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\tincrementOffsets( iv, dv0 );\n\t\t}\n\t\tincrementOffsets( iv, dv1 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary3d( gdot, [ x, y, z ], views, [ 12, 12, 4 ], [ 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ 30.0, 174.0, 446.0 ] ] ]\n*/\nfunction binary3d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 2 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[2],\n\t\t\tstridesY[2]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[2] ),\n\t\t\tstridesY[1] - ( S0*stridesY[2] )\n\t\t];\n\t\tdv2 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S1*stridesX[1] ),\n\t\t\tstridesY[0] - ( S1*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[2] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[2] ) );\n\t\t\tdv2.push( sv[0] - ( S1*sv[1] ) );\n\t\t}\n\t} else {\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv1 );\n\t\t}\n\t\tincrementOffsets( iv, dv2 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary4d( gdot, [ x, y, z ], views, [ 12, 12, 12, 4 ], [ 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ]\n*/\nfunction binary4d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 3 ];\n\t\tS1 = sh[ 2 ];\n\t\tS2 = sh[ 1 ];\n\t\tS3 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[3],\n\t\t\tstridesY[3]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[2] - ( S0*stridesX[3] ),\n\t\t\tstridesY[2] - ( S0*stridesY[3] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[1] - ( S1*stridesX[2] ),\n\t\t\tstridesY[1] - ( S1*stridesY[2] )\n\t\t];\n\t\tdv3 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S2*stridesX[1] ),\n\t\t\tstridesY[0] - ( S2*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[3] );\n\t\t\tdv1.push( sv[2] - ( S0*sv[3] ) );\n\t\t\tdv2.push( sv[1] - ( S1*sv[2] ) );\n\t\t\tdv3.push( sv[0] - ( S2*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tfor ( i = 1; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv2 );\n\t\t}\n\t\tincrementOffsets( iv, dv3 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary5d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ]\n*/\nfunction binary5d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 4 ];\n\t\tS1 = sh[ 3 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 1 ];\n\t\tS4 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[4],\n\t\t\tstridesY[4]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[3] - ( S0*stridesX[4] ),\n\t\t\tstridesY[3] - ( S0*stridesY[4] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[3] ),\n\t\t\tstridesY[2] - ( S1*stridesY[3] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[1] - ( S2*stridesX[2] ),\n\t\t\tstridesY[1] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S3*stridesX[1] ),\n\t\t\tstridesY[0] - ( S3*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[4] );\n\t\t\tdv1.push( sv[3] - ( S0*sv[4] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[3] ) );\n\t\t\tdv3.push( sv[1] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[0] - ( S3*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv3 );\n\t\t}\n\t\tincrementOffsets( iv, dv4 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary6d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ]\n*/\nfunction binary6d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 5 ];\n\t\tS1 = sh[ 4 ];\n\t\tS2 = sh[ 3 ];\n\t\tS3 = sh[ 2 ];\n\t\tS4 = sh[ 1 ];\n\t\tS5 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[5],\n\t\t\tstridesY[5]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[4] - ( S0*stridesX[5] ),\n\t\t\tstridesY[4] - ( S0*stridesY[5] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[3] - ( S1*stridesX[4] ),\n\t\t\tstridesY[3] - ( S1*stridesY[4] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[2] - ( S2*stridesX[3] ),\n\t\t\tstridesY[2] - ( S2*stridesY[3] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[1] - ( S3*stridesX[2] ),\n\t\t\tstridesY[1] - ( S3*stridesY[2] )\n\t\t];\n\t\tdv5 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S4*stridesX[1] ),\n\t\t\tstridesY[0] - ( S4*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[5] );\n\t\t\tdv1.push( sv[4] - ( S0*sv[5] ) );\n\t\t\tdv2.push( sv[3] - ( S1*sv[4] ) );\n\t\t\tdv3.push( sv[2] - ( S2*sv[3] ) );\n\t\t\tdv4.push( sv[1] - ( S3*sv[2] ) );\n\t\t\tdv5.push( sv[0] - ( S4*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv4 );\n\t\t}\n\t\tincrementOffsets( iv, dv5 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary7d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ]\n*/\nfunction binary7d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 6 ];\n\t\tS1 = sh[ 5 ];\n\t\tS2 = sh[ 4 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 2 ];\n\t\tS5 = sh[ 1 ];\n\t\tS6 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[6],\n\t\t\tstridesY[6]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[5] - ( S0*stridesX[6] ),\n\t\t\tstridesY[5] - ( S0*stridesY[6] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[4] - ( S1*stridesX[5] ),\n\t\t\tstridesY[4] - ( S1*stridesY[5] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[4] ),\n\t\t\tstridesY[3] - ( S2*stridesY[4] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[2] - ( S3*stridesX[3] ),\n\t\t\tstridesY[2] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[1] - ( S4*stridesX[2] ),\n\t\t\tstridesY[1] - ( S4*stridesY[2] )\n\t\t];\n\t\tdv6 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S5*stridesX[1] ),\n\t\t\tstridesY[0] - ( S5*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[6] );\n\t\t\tdv1.push( sv[5] - ( S0*sv[6] ) );\n\t\t\tdv2.push( sv[4] - ( S1*sv[5] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[4] ) );\n\t\t\tdv4.push( sv[2] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[1] - ( S4*sv[2] ) );\n\t\t\tdv6.push( sv[0] - ( S5*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[6] - ( S5*stridesX[5] ),\n\t\t\tstridesY[6] - ( S5*stridesY[5] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[6] - ( S5*sv[5] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv5 );\n\t\t}\n\t\tincrementOffsets( iv, dv6 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary8d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ]\n*/\nfunction binary8d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 7 ];\n\t\tS1 = sh[ 6 ];\n\t\tS2 = sh[ 5 ];\n\t\tS3 = sh[ 4 ];\n\t\tS4 = sh[ 3 ];\n\t\tS5 = sh[ 2 ];\n\t\tS6 = sh[ 1 ];\n\t\tS7 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[7],\n\t\t\tstridesY[7]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[6] - ( S0*stridesX[7] ),\n\t\t\tstridesY[6] - ( S0*stridesY[7] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[5] - ( S1*stridesX[6] ),\n\t\t\tstridesY[5] - ( S1*stridesY[6] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[4] - ( S2*stridesX[5] ),\n\t\t\tstridesY[4] - ( S2*stridesY[5] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[3] - ( S3*stridesX[4] ),\n\t\t\tstridesY[3] - ( S3*stridesY[4] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[2] - ( S4*stridesX[3] ),\n\t\t\tstridesY[2] - ( S4*stridesY[3] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[1] - ( S5*stridesX[2] ),\n\t\t\tstridesY[1] - ( S5*stridesY[2] )\n\t\t];\n\t\tdv7 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S6*stridesX[1] ),\n\t\t\tstridesY[0] - ( S6*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[7] );\n\t\t\tdv1.push( sv[6] - ( S0*sv[7] ) );\n\t\t\tdv2.push( sv[5] - ( S1*sv[6] ) );\n\t\t\tdv3.push( sv[4] - ( S2*sv[5] ) );\n\t\t\tdv4.push( sv[3] - ( S3*sv[4] ) );\n\t\t\tdv5.push( sv[2] - ( S4*sv[3] ) );\n\t\t\tdv6.push( sv[1] - ( S5*sv[2] ) );\n\t\t\tdv7.push( sv[0] - ( S6*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[6] - ( S5*stridesX[5] ),\n\t\t\tstridesY[6] - ( S5*stridesY[5] )\n\t\t];\n\t\tdv7 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[7] - ( S6*stridesX[6] ),\n\t\t\tstridesY[7] - ( S6*stridesY[6] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[6] - ( S5*sv[5] ) );\n\t\t\tdv7.push( sv[7] - ( S6*sv[6] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv6 );\n\t\t}\n\t\tincrementOffsets( iv, dv7 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary9d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ] ]\n*/\nfunction binary9d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar dv8;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 8 ];\n\t\tS1 = sh[ 7 ];\n\t\tS2 = sh[ 6 ];\n\t\tS3 = sh[ 5 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 3 ];\n\t\tS6 = sh[ 2 ];\n\t\tS7 = sh[ 1 ];\n\t\tS8 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[8],\n\t\t\tstridesY[8]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[7] - ( S0*stridesX[8] ),\n\t\t\tstridesY[7] - ( S0*stridesY[8] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[6] - ( S1*stridesX[7] ),\n\t\t\tstridesY[6] - ( S1*stridesY[7] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[5] - ( S2*stridesX[6] ),\n\t\t\tstridesY[5] - ( S2*stridesY[6] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[5] ),\n\t\t\tstridesY[4] - ( S3*stridesY[5] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[3] - ( S4*stridesX[4] ),\n\t\t\tstridesY[3] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[2] - ( S5*stridesX[3] ),\n\t\t\tstridesY[2] - ( S5*stridesY[3] )\n\t\t];\n\t\tdv7 = [\n\t\t\tstridesX[1] - ( S6*stridesX[2] ),\n\t\t\tstridesY[1] - ( S6*stridesY[2] )\n\t\t];\n\t\tdv8 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S7*stridesX[1] ),\n\t\t\tstridesY[0] - ( S7*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[8] );\n\t\t\tdv1.push( sv[7] - ( S0*sv[8] ) );\n\t\t\tdv2.push( sv[6] - ( S1*sv[7] ) );\n\t\t\tdv3.push( sv[5] - ( S2*sv[6] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[5] ) );\n\t\t\tdv5.push( sv[3] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[2] - ( S5*sv[3] ) );\n\t\t\tdv7.push( sv[1] - ( S6*sv[2] ) );\n\t\t\tdv8.push( sv[0] - ( S7*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[6] - ( S5*stridesX[5] ),\n\t\t\tstridesY[6] - ( S5*stridesY[5] )\n\t\t];\n\t\tdv7 = [\n\t\t\tstridesX[7] - ( S6*stridesX[6] ),\n\t\t\tstridesY[7] - ( S6*stridesY[6] )\n\t\t];\n\t\tdv8 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[8] - ( S7*stridesX[7] ),\n\t\t\tstridesY[8] - ( S7*stridesY[7] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[6] - ( S5*sv[5] ) );\n\t\t\tdv7.push( sv[7] - ( S6*sv[6] ) );\n\t\t\tdv8.push( sv[8] - ( S7*sv[7] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv7 );\n\t\t}\n\t\tincrementOffsets( iv, dv8 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary10d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ] ] ]\n*/\nfunction binary10d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar set;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar dv8;\n\tvar dv9;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar S9;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 9 ];\n\t\tS1 = sh[ 8 ];\n\t\tS2 = sh[ 7 ];\n\t\tS3 = sh[ 6 ];\n\t\tS4 = sh[ 5 ];\n\t\tS5 = sh[ 4 ];\n\t\tS6 = sh[ 3 ];\n\t\tS7 = sh[ 2 ];\n\t\tS8 = sh[ 1 ];\n\t\tS9 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[9],\n\t\t\tstridesY[9]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[8] - ( S0*stridesX[9] ),\n\t\t\tstridesY[8] - ( S0*stridesY[9] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[7] - ( S1*stridesX[8] ),\n\t\t\tstridesY[7] - ( S1*stridesY[8] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[6] - ( S2*stridesX[7] ),\n\t\t\tstridesY[6] - ( S2*stridesY[7] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[5] - ( S3*stridesX[6] ),\n\t\t\tstridesY[5] - ( S3*stridesY[6] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[4] - ( S4*stridesX[5] ),\n\t\t\tstridesY[4] - ( S4*stridesY[5] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[3] - ( S5*stridesX[4] ),\n\t\t\tstridesY[3] - ( S5*stridesY[4] )\n\t\t];\n\t\tdv7 = [\n\t\t\tstridesX[2] - ( S6*stridesX[3] ),\n\t\t\tstridesY[2] - ( S6*stridesY[3] )\n\t\t];\n\t\tdv8 = [\n\t\t\tstridesX[1] - ( S7*stridesX[2] ),\n\t\t\tstridesY[1] - ( S7*stridesY[2] )\n\t\t];\n\t\tdv9 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S8*stridesX[1] ),\n\t\t\tstridesY[0] - ( S8*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[9] );\n\t\t\tdv1.push( sv[8] - ( S0*sv[9] ) );\n\t\t\tdv2.push( sv[7] - ( S1*sv[8] ) );\n\t\t\tdv3.push( sv[6] - ( S2*sv[7] ) );\n\t\t\tdv4.push( sv[5] - ( S3*sv[6] ) );\n\t\t\tdv5.push( sv[4] - ( S4*sv[5] ) );\n\t\t\tdv6.push( sv[3] - ( S5*sv[4] ) );\n\t\t\tdv7.push( sv[2] - ( S6*sv[3] ) );\n\t\t\tdv8.push( sv[1] - ( S7*sv[2] ) );\n\t\t\tdv9.push( sv[0] - ( S8*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tS9 = sh[ 9 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[6] - ( S5*stridesX[5] ),\n\t\t\tstridesY[6] - ( S5*stridesY[5] )\n\t\t];\n\t\tdv7 = [\n\t\t\tstridesX[7] - ( S6*stridesX[6] ),\n\t\t\tstridesY[7] - ( S6*stridesY[6] )\n\t\t];\n\t\tdv8 = [\n\t\t\tstridesX[8] - ( S7*stridesX[7] ),\n\t\t\tstridesY[8] - ( S7*stridesY[7] )\n\t\t];\n\t\tdv9 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[9] - ( S8*stridesX[8] ),\n\t\t\tstridesY[9] - ( S8*stridesY[8] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[6] - ( S5*sv[5] ) );\n\t\t\tdv7.push( sv[7] - ( S6*sv[6] ) );\n\t\t\tdv8.push( sv[8] - ( S7*sv[7] ) );\n\t\t\tdv9.push( sv[9] - ( S8*sv[8] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i9 = 0; i9 < S9; i9++ ) {\n\t\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\tset( zbuf, iv[ 2 ], fcn( v, opts ) );\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv7 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv8 );\n\t\t}\n\t\tincrementOffsets( iv, dv9 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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 numel = require( '@stdlib/ndarray-base-numel' );\nvar vind2bind = require( '@stdlib/ndarray-base-vind2bind' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Performs a reduction over two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var toAccessorArray = require( '@stdlib/array-base-to-accessor-array' );\n* var accessors = require( '@stdlib/array-base-accessors' );\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var ybuf = toAccessorArray( new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] ) );\n* var zbuf = toAccessorArray( new Float64Array( [ 0.0, 0.0, 0.0 ] ) );\n*\n* // Define the array shapes:\n* var xsh = [ 3, 2, 2 ];\n* var ysh = [ 3, 2, 2 ];\n* var zsh = [ 3 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major',\n*     'accessors': accessors( xbuf ).accessors\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major',\n*     'accessors': accessors( ybuf ).accessors\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major',\n*     'accessors': accessors( zbuf ).accessors\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binarynd( gdot, [ x, y, z ], views, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ 30.0, 174.0, 446.0 ]\n*/\nfunction binarynd( fcn, arrays, views, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar len;\n\tvar arr;\n\tvar set;\n\tvar sh;\n\tvar iv;\n\tvar io;\n\tvar N;\n\tvar z;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tN = arrays.length;\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Compute the total number of elements over which to iterate:\n\tlen = numel( sh );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Cache accessors:\n\tset = z.accessors[ 1 ];\n\n\t// Iterate based on the linear **view** index, regardless as to how the data is stored in memory...\n\tio = zeros( N );\n\tfor ( i = 0; i < len; i++ ) {\n\t\tfor ( j = 0; j < N; j++ ) {\n\t\t\tarr = arrays[ j ];\n\t\t\tio[ j ] = vind2bind( sh, arr.strides, iv[ j ], arr.order, i, MODE );\n\t\t}\n\t\tsetViewOffsets( views, io );\n\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\tset( zbuf, io[2], fcn( v, opts ) );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binarynd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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 without = require( '@stdlib/array-base-without' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );\n* var zbuf = new Float64Array( [ 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 2, 2 ];\n* var ysh = [ 2, 2 ];\n* var zsh = [];\n*\n* // Define the array strides:\n* var sx = [ 2, 1 ];\n* var sy = [ 2, 1 ];\n* var sz = [ 0 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary0d( gdot, [ x, y, z ], strategy, strategy, {} );\n*\n* var v = z.data;\n* // returns <Float64Array>[ 30.0 ]\n*/\nfunction binary0d( fcn, arrays, strategyX, strategyY, opts ) {\n\tarrays[ 0 ] = strategyX( arrays[ 0 ] );\n\tarrays[ 1 ] = strategyY( arrays[ 1 ] );\n\tarrays[ 2 ].data[ arrays[ 2 ].offset ] = fcn( without( arrays, 2 ), opts );\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary0d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 3, 2, 2 ];\n* var ysh = [ 3, 2, 2 ];\n* var zsh = [ 3 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary1d( gdot, [ x, y, z ], views, [ 4 ], [ 4 ], strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ 30.0, 174.0, 446.0 ]\n*/\nfunction binary1d( fcn, arrays, views, stridesX, stridesY, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar sh;\n\tvar S0;\n\tvar iv;\n\tvar i0;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tS0 = sh[ 0 ];\n\tdv0 = [\n\t\tstridesX[0],\n\t\tstridesY[0]\n\t];\n\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\tdv0.push( arrays[i].strides[0] );\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\tsetViewOffsets( views, iv );\n\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\tincrementOffsets( iv, dv0 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary1d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 3, 2, 2 ];\n* var ysh = [ 1, 3, 2, 2 ];\n* var zsh = [ 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary2d( gdot, [ x, y, z ], views, [ 12, 4 ], [ 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ 30.0, 174.0, 446.0 ] ]\n*/\nfunction binary2d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 1 ];\n\t\tS1 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[1],\n\t\t\tstridesY[1]\n\t\t];\n\t\tdv1 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S0*stridesX[1] ),\n\t\t\tstridesY[0] - ( S0*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[1] );\n\t\t\tdv1.push( sv[0] - ( S0*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\tsetViewOffsets( views, iv );\n\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\tincrementOffsets( iv, dv0 );\n\t\t}\n\t\tincrementOffsets( iv, dv1 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary2d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary3d( gdot, [ x, y, z ], views, [ 12, 12, 4 ], [ 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ 30.0, 174.0, 446.0 ] ] ]\n*/\nfunction binary3d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 2 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[2],\n\t\t\tstridesY[2]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[2] ),\n\t\t\tstridesY[1] - ( S0*stridesY[2] )\n\t\t];\n\t\tdv2 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S1*stridesX[1] ),\n\t\t\tstridesY[0] - ( S1*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[2] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[2] ) );\n\t\t\tdv2.push( sv[0] - ( S1*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv1 );\n\t\t}\n\t\tincrementOffsets( iv, dv2 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary3d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary4d( gdot, [ x, y, z ], views, [ 12, 12, 12, 4 ], [ 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ]\n*/\nfunction binary4d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 3 ];\n\t\tS1 = sh[ 2 ];\n\t\tS2 = sh[ 1 ];\n\t\tS3 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[3],\n\t\t\tstridesY[3]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[2] - ( S0*stridesX[3] ),\n\t\t\tstridesY[2] - ( S0*stridesY[3] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[1] - ( S1*stridesX[2] ),\n\t\t\tstridesY[1] - ( S1*stridesY[2] )\n\t\t];\n\t\tdv3 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S2*stridesX[1] ),\n\t\t\tstridesY[0] - ( S2*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[3] );\n\t\t\tdv1.push( sv[2] - ( S0*sv[3] ) );\n\t\t\tdv2.push( sv[1] - ( S1*sv[2] ) );\n\t\t\tdv3.push( sv[0] - ( S2*sv[1]) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv2 );\n\t\t}\n\t\tincrementOffsets( iv, dv3 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary4d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary5d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ]\n*/\nfunction binary5d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 4 ];\n\t\tS1 = sh[ 3 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 1 ];\n\t\tS4 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[4],\n\t\t\tstridesY[4]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[3] - ( S0*stridesX[4] ),\n\t\t\tstridesY[3] - ( S0*stridesY[4] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[3] ),\n\t\t\tstridesY[2] - ( S1*stridesY[3] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[1] - ( S2*stridesX[2] ),\n\t\t\tstridesY[1] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S3*stridesX[1] ),\n\t\t\tstridesY[0] - ( S3*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[4] );\n\t\t\tdv1.push( sv[3] - ( S0*sv[4] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[3] ) );\n\t\t\tdv3.push( sv[1] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[0] - ( S3*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv3 );\n\t\t}\n\t\tincrementOffsets( iv, dv4 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary5d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary6d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ]\n*/\nfunction binary6d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 5 ];\n\t\tS1 = sh[ 4 ];\n\t\tS2 = sh[ 3 ];\n\t\tS3 = sh[ 2 ];\n\t\tS4 = sh[ 1 ];\n\t\tS5 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[5],\n\t\t\tstridesY[5]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[4] - ( S0*stridesX[5] ),\n\t\t\tstridesY[4] - ( S0*stridesY[5] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[3] - ( S1*stridesX[4] ),\n\t\t\tstridesY[3] - ( S1*stridesY[4] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[2] - ( S2*stridesX[3] ),\n\t\t\tstridesY[2] - ( S2*stridesY[3] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[1] - ( S3*stridesX[2] ),\n\t\t\tstridesY[1] - ( S3*stridesY[2] )\n\t\t];\n\t\tdv5 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S4*stridesX[1] ),\n\t\t\tstridesY[0] - ( S4*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[5] );\n\t\t\tdv1.push( sv[4] - ( S0*sv[5] ) );\n\t\t\tdv2.push( sv[3] - ( S1*sv[4] ) );\n\t\t\tdv3.push( sv[2] - ( S2*sv[3] ) );\n\t\t\tdv4.push( sv[1] - ( S3*sv[2] ) );\n\t\t\tdv5.push( sv[0] - ( S4*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv4 );\n\t\t}\n\t\tincrementOffsets( iv, dv5 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary6d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary7d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ]\n*/\nfunction binary7d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 6 ];\n\t\tS1 = sh[ 5 ];\n\t\tS2 = sh[ 4 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 2 ];\n\t\tS5 = sh[ 1 ];\n\t\tS6 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[6],\n\t\t\tstridesY[6]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[5] - ( S0*stridesX[6] ),\n\t\t\tstridesY[5] - ( S0*stridesY[6] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[4] - ( S1*stridesX[5] ),\n\t\t\tstridesY[4] - ( S1*stridesY[5] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[4] ),\n\t\t\tstridesY[3] - ( S2*stridesY[4] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[2] - ( S3*stridesX[3] ),\n\t\t\tstridesY[2] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[1] - ( S4*stridesX[2] ),\n\t\t\tstridesY[1] - ( S4*stridesY[2] )\n\t\t];\n\t\tdv6 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S5*stridesX[1] ),\n\t\t\tstridesY[0] - ( S5*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[6] );\n\t\t\tdv1.push( sv[5] - ( S0*sv[6] ) );\n\t\t\tdv2.push( sv[4] - ( S1*sv[5] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[4] ) );\n\t\t\tdv4.push( sv[2] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[1] - ( S4*sv[2] ) );\n\t\t\tdv6.push( sv[0] - ( S5*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[6] - ( S5*stridesX[5] ),\n\t\t\tstridesY[6] - ( S5*stridesY[5] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[6] - ( S5*sv[5] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv5 );\n\t\t}\n\t\tincrementOffsets( iv, dv6 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary7d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary8d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ]\n*/\nfunction binary8d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 7 ];\n\t\tS1 = sh[ 6 ];\n\t\tS2 = sh[ 5 ];\n\t\tS3 = sh[ 4 ];\n\t\tS4 = sh[ 3 ];\n\t\tS5 = sh[ 2 ];\n\t\tS6 = sh[ 1 ];\n\t\tS7 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[7],\n\t\t\tstridesY[7]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[6] - ( S0*stridesX[7] ),\n\t\t\tstridesY[6] - ( S0*stridesY[7] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[5] - ( S1*stridesX[6] ),\n\t\t\tstridesY[5] - ( S1*stridesY[6] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[4] - ( S2*stridesX[5] ),\n\t\t\tstridesY[4] - ( S2*stridesY[5] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[3] - ( S3*stridesX[4] ),\n\t\t\tstridesY[3] - ( S3*stridesY[4] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[2] - ( S4*stridesX[3] ),\n\t\t\tstridesY[2] - ( S4*stridesY[3] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[1] - ( S5*stridesX[2] ),\n\t\t\tstridesY[1] - ( S5*stridesY[2] )\n\t\t];\n\t\tdv7 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S6*stridesX[1] ),\n\t\t\tstridesY[0] - ( S6*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[7] );\n\t\t\tdv1.push( sv[6] - ( S0*sv[7] ) );\n\t\t\tdv2.push( sv[5] - ( S1*sv[6] ) );\n\t\t\tdv3.push( sv[4] - ( S2*sv[5] ) );\n\t\t\tdv4.push( sv[3] - ( S3*sv[4] ) );\n\t\t\tdv5.push( sv[2] - ( S4*sv[3] ) );\n\t\t\tdv6.push( sv[1] - ( S5*sv[2] ) );\n\t\t\tdv7.push( sv[0] - ( S6*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[6] - ( S5*stridesX[5] ),\n\t\t\tstridesY[6] - ( S5*stridesY[5] )\n\t\t];\n\t\tdv7 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[7] - ( S6*stridesX[6] ),\n\t\t\tstridesY[7] - ( S6*stridesY[6] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[6] - ( S5*sv[5] ) );\n\t\t\tdv7.push( sv[7] - ( S6*sv[6] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv6 );\n\t\t}\n\t\tincrementOffsets( iv, dv7 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary8d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary9d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ] ]\n*/\nfunction binary9d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar dv8;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 8 ];\n\t\tS1 = sh[ 7 ];\n\t\tS2 = sh[ 6 ];\n\t\tS3 = sh[ 5 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 3 ];\n\t\tS6 = sh[ 2 ];\n\t\tS7 = sh[ 1 ];\n\t\tS8 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[8],\n\t\t\tstridesY[8]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[7] - ( S0*stridesX[8] ),\n\t\t\tstridesY[7] - ( S0*stridesY[8] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[6] - ( S1*stridesX[7] ),\n\t\t\tstridesY[6] - ( S1*stridesY[7] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[5] - ( S2*stridesX[6] ),\n\t\t\tstridesY[5] - ( S2*stridesY[6] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[5] ),\n\t\t\tstridesY[4] - ( S3*stridesY[5] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[3] - ( S4*stridesX[4] ),\n\t\t\tstridesY[3] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[2] - ( S5*stridesX[3] ),\n\t\t\tstridesY[2] - ( S5*stridesY[3] )\n\t\t];\n\t\tdv7 = [\n\t\t\tstridesX[1] - ( S6*stridesX[2] ),\n\t\t\tstridesY[1] - ( S6*stridesY[2] )\n\t\t];\n\t\tdv8 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S7*stridesX[1] ),\n\t\t\tstridesY[0] - ( S7*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[8] );\n\t\t\tdv1.push( sv[7] - ( S0*sv[8] ) );\n\t\t\tdv2.push( sv[6] - ( S1*sv[7] ) );\n\t\t\tdv3.push( sv[5] - ( S2*sv[6] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[5] ) );\n\t\t\tdv5.push( sv[3] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[2] - ( S5*sv[3] ) );\n\t\t\tdv7.push( sv[1] - ( S6*sv[2] ) );\n\t\t\tdv8.push( sv[0] - ( S7*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tdv0 = [\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t]; // offset increment for innermost loop\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[6] - ( S5*stridesX[5] ),\n\t\t\tstridesY[6] - ( S5*stridesY[5] )\n\t\t];\n\t\tdv7 = [\n\t\t\tstridesX[7] - ( S6*stridesX[6] ),\n\t\t\tstridesY[7] - ( S6*stridesY[6] )\n\t\t];\n\t\tdv8 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[8] - ( S7*stridesX[7] ),\n\t\t\tstridesY[8] - ( S7*stridesY[7] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[6] - ( S5*sv[5] ) );\n\t\t\tdv7.push( sv[7] - ( S6*sv[6] ) );\n\t\t\tdv8.push( sv[8] - ( S7*sv[7] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv7 );\n\t\t}\n\t\tincrementOffsets( iv, dv8 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary9d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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/* eslint-disable max-depth, max-len, max-statements, max-lines-per-function */\n\n'use strict';\n\n// MODULES //\n\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar incrementOffsets = require( './increment_offsets.js' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {IntegerArray} stridesX - loop dimension strides for the first input ndarray\n* @param {IntegerArray} stridesY - loop dimension strides for the second input ndarray\n* @param {boolean} isRowMajor - boolean indicating if provided arrays are in row-major order\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var ysh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2 ];\n* var zsh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sy = [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 2, 1 ];\n* var sz = [ 3, 3, 3, 3, 3, 3, 3, 3, 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binary10d( gdot, [ x, y, z ], views, [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], [ 12, 12, 12, 12, 12, 12, 12, 12, 12, 4 ], true, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ [ [ [ [ [ [ [ 30.0, 174.0, 446.0 ] ] ] ] ] ] ] ] ] ]\n*/\nfunction binary10d( fcn, arrays, views, stridesX, stridesY, isRowMajor, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar dv0;\n\tvar dv1;\n\tvar dv2;\n\tvar dv3;\n\tvar dv4;\n\tvar dv5;\n\tvar dv6;\n\tvar dv7;\n\tvar dv8;\n\tvar dv9;\n\tvar sh;\n\tvar S0;\n\tvar S1;\n\tvar S2;\n\tvar S3;\n\tvar S4;\n\tvar S5;\n\tvar S6;\n\tvar S7;\n\tvar S8;\n\tvar S9;\n\tvar sv;\n\tvar iv;\n\tvar i0;\n\tvar i1;\n\tvar i2;\n\tvar i3;\n\tvar i4;\n\tvar i5;\n\tvar i6;\n\tvar i7;\n\tvar i8;\n\tvar i9;\n\tvar z;\n\tvar v;\n\tvar i;\n\n\t// Note on variable naming convention: S#, dv#, i# where # corresponds to the loop number, with `0` being the innermost loop...\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...\n\tif ( isRowMajor ) {\n\t\t// For row-major ndarrays, the last dimensions have the fastest changing indices...\n\t\tS0 = sh[ 9 ];\n\t\tS1 = sh[ 8 ];\n\t\tS2 = sh[ 7 ];\n\t\tS3 = sh[ 6 ];\n\t\tS4 = sh[ 5 ];\n\t\tS5 = sh[ 4 ];\n\t\tS6 = sh[ 3 ];\n\t\tS7 = sh[ 2 ];\n\t\tS8 = sh[ 1 ];\n\t\tS9 = sh[ 0 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[9],\n\t\t\tstridesY[9]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[8] - ( S0*stridesX[9] ),\n\t\t\tstridesY[8] - ( S0*stridesY[9] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[7] - ( S1*stridesX[8] ),\n\t\t\tstridesY[7] - ( S1*stridesY[8] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[6] - ( S2*stridesX[7] ),\n\t\t\tstridesY[6] - ( S2*stridesY[7] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[5] - ( S3*stridesX[6] ),\n\t\t\tstridesY[5] - ( S3*stridesY[6] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[4] - ( S4*stridesX[5] ),\n\t\t\tstridesY[4] - ( S4*stridesY[5] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[3] - ( S5*stridesX[4] ),\n\t\t\tstridesY[3] - ( S5*stridesY[4] )\n\t\t];\n\t\tdv7 = [\n\t\t\tstridesX[2] - ( S6*stridesX[3] ),\n\t\t\tstridesY[2] - ( S6*stridesY[3] )\n\t\t];\n\t\tdv8 = [\n\t\t\tstridesX[1] - ( S7*stridesX[2] ),\n\t\t\tstridesY[1] - ( S7*stridesY[2] )\n\t\t];\n\t\tdv9 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[0] - ( S8*stridesX[1] ),\n\t\t\tstridesY[0] - ( S8*stridesY[1] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[9] );\n\t\t\tdv1.push( sv[8] - ( S0*sv[9] ) );\n\t\t\tdv2.push( sv[7] - ( S1*sv[8] ) );\n\t\t\tdv3.push( sv[6] - ( S2*sv[7] ) );\n\t\t\tdv4.push( sv[5] - ( S3*sv[6] ) );\n\t\t\tdv5.push( sv[4] - ( S4*sv[5] ) );\n\t\t\tdv6.push( sv[3] - ( S5*sv[4] ) );\n\t\t\tdv7.push( sv[2] - ( S6*sv[3] ) );\n\t\t\tdv8.push( sv[1] - ( S7*sv[2] ) );\n\t\t\tdv9.push( sv[0] - ( S8*sv[1] ) );\n\t\t}\n\t} else { // order === 'column-major'\n\t\t// For column-major ndarrays, the first dimensions have the fastest changing indices...\n\t\tS0 = sh[ 0 ];\n\t\tS1 = sh[ 1 ];\n\t\tS2 = sh[ 2 ];\n\t\tS3 = sh[ 3 ];\n\t\tS4 = sh[ 4 ];\n\t\tS5 = sh[ 5 ];\n\t\tS6 = sh[ 6 ];\n\t\tS7 = sh[ 7 ];\n\t\tS8 = sh[ 8 ];\n\t\tS9 = sh[ 9 ];\n\t\tdv0 = [                                   // offset increment for innermost loop\n\t\t\tstridesX[0],\n\t\t\tstridesY[0]\n\t\t];\n\t\tdv1 = [\n\t\t\tstridesX[1] - ( S0*stridesX[0] ),\n\t\t\tstridesY[1] - ( S0*stridesY[0] )\n\t\t];\n\t\tdv2 = [\n\t\t\tstridesX[2] - ( S1*stridesX[1] ),\n\t\t\tstridesY[2] - ( S1*stridesY[1] )\n\t\t];\n\t\tdv3 = [\n\t\t\tstridesX[3] - ( S2*stridesX[2] ),\n\t\t\tstridesY[3] - ( S2*stridesY[2] )\n\t\t];\n\t\tdv4 = [\n\t\t\tstridesX[4] - ( S3*stridesX[3] ),\n\t\t\tstridesY[4] - ( S3*stridesY[3] )\n\t\t];\n\t\tdv5 = [\n\t\t\tstridesX[5] - ( S4*stridesX[4] ),\n\t\t\tstridesY[5] - ( S4*stridesY[4] )\n\t\t];\n\t\tdv6 = [\n\t\t\tstridesX[6] - ( S5*stridesX[5] ),\n\t\t\tstridesY[6] - ( S5*stridesY[5] )\n\t\t];\n\t\tdv7 = [\n\t\t\tstridesX[7] - ( S6*stridesX[6] ),\n\t\t\tstridesY[7] - ( S6*stridesY[6] )\n\t\t];\n\t\tdv8 = [\n\t\t\tstridesX[8] - ( S7*stridesX[7] ),\n\t\t\tstridesY[8] - ( S7*stridesY[7] )\n\t\t];\n\t\tdv9 = [                                   // offset increment for outermost loop\n\t\t\tstridesX[9] - ( S8*stridesX[8] ),\n\t\t\tstridesY[9] - ( S8*stridesY[8] )\n\t\t];\n\t\tfor ( i = 2; i < arrays.length; i++ ) {\n\t\t\tsv = arrays[ i ].strides;\n\t\t\tdv0.push( sv[0] );\n\t\t\tdv1.push( sv[1] - ( S0*sv[0] ) );\n\t\t\tdv2.push( sv[2] - ( S1*sv[1] ) );\n\t\t\tdv3.push( sv[3] - ( S2*sv[2] ) );\n\t\t\tdv4.push( sv[4] - ( S3*sv[3] ) );\n\t\t\tdv5.push( sv[5] - ( S4*sv[4] ) );\n\t\t\tdv6.push( sv[6] - ( S5*sv[5] ) );\n\t\t\tdv7.push( sv[7] - ( S6*sv[6] ) );\n\t\t\tdv8.push( sv[8] - ( S7*sv[7] ) );\n\t\t\tdv9.push( sv[9] - ( S8*sv[8] ) );\n\t\t}\n\t}\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate over the non-reduced ndarray dimensions...\n\tfor ( i9 = 0; i9 < S9; i9++ ) {\n\t\tfor ( i8 = 0; i8 < S8; i8++ ) {\n\t\t\tfor ( i7 = 0; i7 < S7; i7++ ) {\n\t\t\t\tfor ( i6 = 0; i6 < S6; i6++ ) {\n\t\t\t\t\tfor ( i5 = 0; i5 < S5; i5++ ) {\n\t\t\t\t\t\tfor ( i4 = 0; i4 < S4; i4++ ) {\n\t\t\t\t\t\t\tfor ( i3 = 0; i3 < S3; i3++ ) {\n\t\t\t\t\t\t\t\tfor ( i2 = 0; i2 < S2; i2++ ) {\n\t\t\t\t\t\t\t\t\tfor ( i1 = 0; i1 < S1; i1++ ) {\n\t\t\t\t\t\t\t\t\t\tfor ( i0 = 0; i0 < S0; i0++ ) {\n\t\t\t\t\t\t\t\t\t\t\tsetViewOffsets( views, iv );\n\t\t\t\t\t\t\t\t\t\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\t\t\t\t\t\t\t\t\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\t\t\t\t\t\t\t\t\t\tzbuf[ iv[2] ] = fcn( v, opts );\n\t\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv0 );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv1 );\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tincrementOffsets( iv, dv2 );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tincrementOffsets( iv, dv3 );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tincrementOffsets( iv, dv4 );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tincrementOffsets( iv, dv5 );\n\t\t\t\t\t}\n\t\t\t\t\tincrementOffsets( iv, dv6 );\n\t\t\t\t}\n\t\t\t\tincrementOffsets( iv, dv7 );\n\t\t\t}\n\t\t\tincrementOffsets( iv, dv8 );\n\t\t}\n\t\tincrementOffsets( iv, dv9 );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binary10d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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 numel = require( '@stdlib/ndarray-base-numel' );\nvar vind2bind = require( '@stdlib/ndarray-base-vind2bind' );\nvar copyIndexed = require( '@stdlib/array-base-copy-indexed' );\nvar zeros = require( '@stdlib/array-base-zeros' );\nvar setViewOffsets = require( './set_view_offsets.js' );\nvar offsets = require( './offsets.js' );\n\n\n// VARIABLES //\n\nvar MODE = 'throw';\n\n\n// MAIN //\n\n/**\n* Performs a reduction over two input ndarrays and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {Array<Object>} arrays - ndarrays\n* @param {Array<Object>} views - initialized ndarray-like objects representing sub-array views\n* @param {Function} strategyX - first input ndarray reshape strategy\n* @param {Function} strategyY - second input ndarray reshape strategy\n* @param {Options} opts - function options\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 3, 2, 2 ];\n* var ysh = [ 3, 2, 2 ];\n* var zsh = [ 3 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Initialize ndarray-like objects representing sub-array views:\n* var views = [\n*     {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     },\n*     {\n*         'dtype': y.dtype,\n*         'data': y.data,\n*         'shape': [ 2, 2 ],\n*         'strides': [ 2, 1 ],\n*         'offset': y.offset,\n*         'order': y.order\n*     }\n* ];\n*\n* // Define a reshape strategy:\n* function strategy( x ) {\n*     return {\n*         'dtype': x.dtype,\n*         'data': x.data,\n*         'shape': [ 4 ],\n*         'strides': [ 1 ],\n*         'offset': x.offset,\n*         'order': x.order\n*     };\n* }\n*\n* // Perform a reduction:\n* binarynd( gdot, [ x, y, z ], views, strategy, strategy, {} );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ 30.0, 174.0, 446.0 ]\n*/\nfunction binarynd( fcn, arrays, views, strategyX, strategyY, opts ) {\n\tvar zbuf;\n\tvar len;\n\tvar arr;\n\tvar sh;\n\tvar iv;\n\tvar io;\n\tvar N;\n\tvar z;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tN = arrays.length;\n\n\t// Resolve the output ndarray and associated shape:\n\tz = arrays[ 2 ];\n\tsh = z.shape;\n\n\t// Compute the total number of elements over which to iterate:\n\tlen = numel( sh );\n\n\t// Resolve a list of pointers to the first indexed elements in the respective ndarrays:\n\tiv = offsets( arrays );\n\n\t// Shallow copy the list of views to an internal array so that we can update with reshaped views without impacting the original list of views:\n\tv = copyIndexed( views );\n\n\t// Cache a reference to the output ndarray buffer:\n\tzbuf = z.data;\n\n\t// Iterate based on the linear **view** index, regardless as to how the data is stored in memory...\n\tio = zeros( N );\n\tfor ( i = 0; i < len; i++ ) {\n\t\tfor ( j = 0; j < N; j++ ) {\n\t\t\tarr = arrays[ j ];\n\t\t\tio[ j ] = vind2bind( sh, arr.strides, iv[ j ], arr.order, i, MODE );\n\t\t}\n\t\tsetViewOffsets( views, io );\n\t\tv[ 0 ] = strategyX( views[ 0 ] );\n\t\tv[ 1 ] = strategyY( views[ 1 ] );\n\t\tzbuf[ io[2] ] = fcn( v, opts );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = binarynd;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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 ndarray2object = require( '@stdlib/ndarray-base-ndarraylike2object' );\nvar normalizeIndices = require( '@stdlib/ndarray-base-to-unique-normalized-indices' );\nvar indicesComplement = require( '@stdlib/array-base-indices-complement' );\nvar takeIndexed2 = require( '@stdlib/array-base-take-indexed2' );\nvar iterationOrder = require( '@stdlib/ndarray-base-iteration-order' );\nvar strides2order = require( '@stdlib/ndarray-base-strides2order' );\nvar anyIsEntryIn = require( '@stdlib/array-base-any-is-entry-in' );\nvar numel = require( '@stdlib/ndarray-base-numel' );\nvar join = require( '@stdlib/array-base-join' );\nvar format = require( '@stdlib/string-format' );\nvar initializeViews = require( './initialize_array_views.js' );\nvar reshapeStrategy = require( './reshape_strategy.js' );\nvar blockedaccessorbinary2d = require( './2d_blocked_accessors.js' );\nvar blockedaccessorbinary3d = require( './3d_blocked_accessors.js' );\nvar blockedaccessorbinary4d = require( './4d_blocked_accessors.js' );\nvar blockedaccessorbinary5d = require( './5d_blocked_accessors.js' );\nvar blockedaccessorbinary6d = require( './6d_blocked_accessors.js' );\nvar blockedaccessorbinary7d = require( './7d_blocked_accessors.js' );\nvar blockedaccessorbinary8d = require( './8d_blocked_accessors.js' );\nvar blockedaccessorbinary9d = require( './9d_blocked_accessors.js' );\nvar blockedaccessorbinary10d = require( './10d_blocked_accessors.js' );\nvar blockedbinary2d = require( './2d_blocked.js' );\nvar blockedbinary3d = require( './3d_blocked.js' );\nvar blockedbinary4d = require( './4d_blocked.js' );\nvar blockedbinary5d = require( './5d_blocked.js' );\nvar blockedbinary6d = require( './6d_blocked.js' );\nvar blockedbinary7d = require( './7d_blocked.js' );\nvar blockedbinary8d = require( './8d_blocked.js' );\nvar blockedbinary9d = require( './9d_blocked.js' );\nvar blockedbinary10d = require( './10d_blocked.js' );\nvar accessorbinary0d = require( './0d_accessors.js' );\nvar accessorbinary1d = require( './1d_accessors.js' );\nvar accessorbinary2d = require( './2d_accessors.js' );\nvar accessorbinary3d = require( './3d_accessors.js' );\nvar accessorbinary4d = require( './4d_accessors.js' );\nvar accessorbinary5d = require( './5d_accessors.js' );\nvar accessorbinary6d = require( './6d_accessors.js' );\nvar accessorbinary7d = require( './7d_accessors.js' );\nvar accessorbinary8d = require( './8d_accessors.js' );\nvar accessorbinary9d = require( './9d_accessors.js' );\nvar accessorbinary10d = require( './10d_accessors.js' );\nvar accessorbinarynd = require( './nd_accessors.js' );\nvar binary0d = require( './0d.js' );\nvar binary1d = require( './1d.js' );\nvar binary2d = require( './2d.js' );\nvar binary3d = require( './3d.js' );\nvar binary4d = require( './4d.js' );\nvar binary5d = require( './5d.js' );\nvar binary6d = require( './6d.js' );\nvar binary7d = require( './7d.js' );\nvar binary8d = require( './8d.js' );\nvar binary9d = require( './9d.js' );\nvar binary10d = require( './10d.js' );\nvar binarynd = require( './nd.js' );\n\n\n// VARIABLES //\n\nvar BINARY = [\n\tbinary0d,\n\tbinary1d,\n\tbinary2d,\n\tbinary3d,\n\tbinary4d,\n\tbinary5d,\n\tbinary6d,\n\tbinary7d,\n\tbinary8d,\n\tbinary9d,\n\tbinary10d\n];\nvar ACCESSOR_BINARY = [\n\taccessorbinary0d,\n\taccessorbinary1d,\n\taccessorbinary2d,\n\taccessorbinary3d,\n\taccessorbinary4d,\n\taccessorbinary5d,\n\taccessorbinary6d,\n\taccessorbinary7d,\n\taccessorbinary8d,\n\taccessorbinary9d,\n\taccessorbinary10d\n];\nvar BLOCKED_BINARY = [\n\tblockedbinary2d, // 0\n\tblockedbinary3d,\n\tblockedbinary4d,\n\tblockedbinary5d,\n\tblockedbinary6d,\n\tblockedbinary7d,\n\tblockedbinary8d,\n\tblockedbinary9d,\n\tblockedbinary10d // 8\n];\nvar BLOCKED_ACCESSOR_BINARY = [\n\tblockedaccessorbinary2d, // 0\n\tblockedaccessorbinary3d,\n\tblockedaccessorbinary4d,\n\tblockedaccessorbinary5d,\n\tblockedaccessorbinary6d,\n\tblockedaccessorbinary7d,\n\tblockedaccessorbinary8d,\n\tblockedaccessorbinary9d,\n\tblockedaccessorbinary10d // 8\n];\nvar MAX_DIMS = BINARY.length - 1;\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if at least one ndarray data buffer implements the accessor protocol.\n*\n* @private\n* @param {ndarrayLike} x - first ndarray\n* @param {ndarrayLike} y - second ndarray\n* @param {ndarrayLike} z - third ndarray\n* @returns {boolean} boolean indicating whether an ndarray data buffer implements the accessor protocol\n*/\nfunction hasAccessors( x, y, z ) {\n\treturn anyIsEntryIn( [ x, y, z ], 'accessorProtocol', true );\n}\n\n\n// MAIN //\n\n/**\n* Performs a reduction over a list of specified dimensions in two input ndarrays via a one-dimensional strided array binary reduction function and assigns results to a provided output ndarray.\n*\n* @private\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @param {ArrayLikeObject<Object>} arrays - array-like object containing ndarrays\n* @param {IntegerArray} dims - list of dimensions over which to perform a reduction\n* @param {Options} [options] - function options\n* @throws {Error} arrays must have the expected number of dimensions\n* @throws {RangeError} dimension indices must not exceed input ndarray bounds\n* @throws {RangeError} number of dimension indices must not exceed the number of input ndarray dimensions\n* @throws {Error} must provide unique dimension indices\n* @throws {Error} arrays must have the same loop dimension sizes\n* @returns {void}\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var getStride = require( '@stdlib/ndarray-base-stride' );\n* var getOffset = require( '@stdlib/ndarray-base-offset' );\n* var getData = require( '@stdlib/ndarray-base-data-buffer' );\n* var numelDimension = require( '@stdlib/ndarray-base-numel-dimension' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 3, 2, 2 ];\n* var ysh = [ 1, 3, 2, 2 ];\n* var zsh = [ 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Perform a reduction:\n* binaryReduceStrided1d( gdot, [ x, y, z ], [ 2, 3 ] );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ 30.0, 174.0, 446.0 ] ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var getStride = require( '@stdlib/ndarray-base-stride' );\n* var getOffset = require( '@stdlib/ndarray-base-offset' );\n* var getData = require( '@stdlib/ndarray-base-data-buffer' );\n* var numelDimension = require( '@stdlib/ndarray-base-numel-dimension' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 3, 2, 2 ];\n* var ysh = [ 1, 3, 2, 2 ];\n* var zsh = [];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 0 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Perform a reduction:\n* binaryReduceStrided1d( gdot, [ x, y, z ], [ 0, 1, 2, 3 ] );\n*\n* var v = z.data;\n* // returns <Float64Array>[ 650.0 ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var getStride = require( '@stdlib/ndarray-base-stride' );\n* var getOffset = require( '@stdlib/ndarray-base-offset' );\n* var getData = require( '@stdlib/ndarray-base-data-buffer' );\n* var numelDimension = require( '@stdlib/ndarray-base-numel-dimension' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 3, 2, 2 ];\n* var ysh = [ 3, 2, 2 ];\n* var zsh = [ 3, 2, 2 ];\n*\n* // Define the array strides:\n* var sx = [ 4, 2, 1 ];\n* var sy = [ 4, 2, 1 ];\n* var sz = [ 4, 2, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Perform a reduction:\n* binaryReduceStrided1d( gdot, [ x, y, z ], [] );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ [ 1.0, 4.0 ], [ 9.0, 16.0 ] ], [ [ 25.0, 36.0 ], [ 49.0, 64.0 ] ], [ [ 81.0, 100.0 ], [ 121.0, 144.0 ] ] ]\n*/\nfunction binaryReduceStrided1d( fcn, arrays, dims, options ) { // eslint-disable-line max-statements\n\tvar strategyX;\n\tvar strategyY;\n\tvar views;\n\tvar ndims;\n\tvar ldims;\n\tvar opts;\n\tvar ordx;\n\tvar ordy;\n\tvar ordz;\n\tvar tmpx;\n\tvar tmpy;\n\tvar arr;\n\tvar len;\n\tvar shx;\n\tvar shy;\n\tvar shc;\n\tvar shl;\n\tvar iox;\n\tvar ioy;\n\tvar ioz;\n\tvar scx;\n\tvar scy;\n\tvar slx;\n\tvar sly;\n\tvar sz;\n\tvar ns;\n\tvar d;\n\tvar s;\n\tvar N;\n\tvar M;\n\tvar K;\n\tvar x;\n\tvar y;\n\tvar z;\n\tvar i;\n\tvar j;\n\n\tif ( arguments.length > 3 ) {\n\t\topts = options;\n\t} else {\n\t\topts = {};\n\t}\n\t// Standardize ndarray meta data...\n\tN = arrays.length;\n\tarr = [];\n\tfor ( i = 0; i < N; i++ ) {\n\t\tarr.push( ndarray2object( arrays[ i ] ) );\n\t}\n\t// Cache references to the input and output arrays:\n\tx = arr[ 0 ];\n\ty = arr[ 1 ];\n\tz = arr[ 2 ];\n\n\t// Resolve the number of input array dimensions:\n\tshx = x.shape;\n\tshy = y.shape;\n\tndims = shx.length;\n\n\t// Verify that both input arrays have the same shape:\n\tif ( shx.length !== shy.length ) {\n\t\tthrow new Error( format( 'invalid argument. Input arrays must have the same number of dimensions. First array dimensions: %d. Second array dimensions: %d.', shx.length, shy.length ) );\n\t}\n\tfor ( i = 0; i < ndims; i++ ) {\n\t\tif ( shx[ i ] !== shy[ i ] ) {\n\t\t\tthrow new Error( format( 'invalid argument. Input arrays must have the same shape. First array shape: [%s]. Second array shape: [%s].', join( shx, ',' ), join( shy, ',' ) ) );\n\t\t}\n\t}\n\n\t// Verify that we've been provided a list of unique dimension indices...\n\tM = dims.length;\n\td = normalizeIndices( dims, ndims-1 );\n\tif ( d === null ) {\n\t\tthrow new RangeError( format( 'invalid argument. Third argument contains an out-of-bounds dimension index. Value: [%s].', join( dims, ',' ) ) );\n\t}\n\td.sort();\n\tif ( d.length !== M ) {\n\t\tthrow new Error( format( 'invalid argument. Third argument must contain a list of unique dimension indices. Value: [%s].', join( dims, ',' ) ) );\n\t}\n\t// Check whether we've been provided a valid number of dimensions to reduce...\n\tif ( M > ndims ) {\n\t\tthrow new RangeError( format( 'invalid argument. Number of specified dimensions cannot exceed the number of dimensions in the input array. Number of dimensions: %d. Value: [%s].', ndims, join( dims, ',' ) ) );\n\t}\n\t// Verify that provided ndarrays have the expected number of dimensions...\n\tK = ndims - M;\n\tif ( z.shape.length !== K ) {\n\t\tthrow new Error( format( 'invalid argument. Output array must have the same number of non-reduced dimensions as input arrays. Input array shape: [%s]. Number of non-reduced dimensions: %d. Output array shape: [%s].', join( shx, ',' ), K, join( z.shape, ',' ) ) );\n\t}\n\n\t// Resolve the non-reduced (\"loop\") dimensions and associated strides:\n\tldims = indicesComplement( shx.length, d );\n\ttmpx = takeIndexed2( shx, x.strides, ldims );\n\ttmpy = takeIndexed2( shy, y.strides, ldims );\n\tshl = tmpx[ 0 ]; // tmpx[ 0 ] == tmpy[ 0 ]\n\tslx = tmpx[ 1 ];\n\tsly = tmpy[ 1 ];\n\n\t// Resolve the reduced (\"core\") dimensions and associated strides:\n\ttmpx = takeIndexed2( shx, x.strides, d );\n\ttmpy = takeIndexed2( shy, y.strides, d );\n\tshc = tmpx[ 0 ]; // tmpx[ 0 ] == tmpy[ 0 ]\n\tscx = tmpx[ 1 ];\n\tscy = tmpy[ 1 ];\n\n\t// Verify that the provided arrays have the same loop dimensions...\n\tlen = 1; // number of elements\n\tns = 0;  // number of singleton dimensions\n\tfor ( i = 0; i < K; i++ ) {\n\t\ts = shl[ i ];\n\t\tfor ( j = 2; j < N; j++ ) {\n\t\t\tif ( s !== arr[ j ].shape[ i ] ) {\n\t\t\t\tthrow new Error( format( 'invalid argument. Non-reduced dimensions must be consistent across all provided arrays. Input array shape: [%s]. Non-reduced dimension indices: [%s]. Non-reduced dimensions: [%s]. Array shape: [%s] (index: %d).', join( shx, ',' ), join( ldims, ',' ), join( shl, ',' ), join( arr[ j ].shape, ',' ), j ) );\n\t\t\t}\n\t\t}\n\t\t// Note that, if one of the dimensions is `0`, the length will be `0`...\n\t\tlen *= s;\n\n\t\t// Check whether the current dimension is a singleton dimension...\n\t\tif ( s === 1 ) {\n\t\t\tns += 1;\n\t\t}\n\t}\n\t// Check whether we were provided empty ndarrays...\n\tif ( len === 0 || ( shc.length && numel( shc ) === 0 ) ) {\n\t\treturn;\n\t}\n\t// Initialize ndarray-like objects for representing sub-array views...\n\tviews = [\n\t\t{\n\t\t\t'dtype': x.dtype,\n\t\t\t'data': x.data,\n\t\t\t'shape': shc,\n\t\t\t'strides': scx,\n\t\t\t'offset': x.offset,\n\t\t\t'order': x.order\n\t\t},\n\t\t{\n\t\t\t'dtype': y.dtype,\n\t\t\t'data': y.data,\n\t\t\t'shape': shc,\n\t\t\t'strides': scy,\n\t\t\t'offset': y.offset,\n\t\t\t'order': y.order\n\t\t}\n\t];\n\tinitializeViews( arr, views );\n\n\t// Determine the strategy for reshaping sub-array views of the input arrays prior to performing a reduction:\n\tstrategyX = reshapeStrategy( views[ 0 ] );\n\tstrategyY = reshapeStrategy( views[ 1 ] );\n\n\t// Determine whether we can avoid iteration altogether...\n\tif ( K === 0 ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ K ]( fcn, arr, strategyX, strategyY, opts );\n\t\t}\n\t\treturn BINARY[ K ]( fcn, arr, strategyX, strategyY, opts );\n\t}\n\t// Determine whether we only have one loop dimension and can thus readily perform one-dimensional iteration...\n\tif ( K === 1 ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ K ]( fcn, arr, views, slx, sly, strategyX, strategyY, opts ); // eslint-disable-line max-len\n\t\t}\n\t\treturn BINARY[ K ]( fcn, arr, views, slx, sly, strategyX, strategyY, opts ); // eslint-disable-line max-len\n\t}\n\tsz = z.strides;\n\n\t// Determine whether the loop dimensions have only **one** non-singleton dimension (e.g., shape=[10,1,1,1]) so that we can treat loop iteration as being equivalent to one-dimensional iteration...\n\tif ( ns === K-1 ) {\n\t\t// Get the index of the non-singleton dimension...\n\t\tfor ( i = 0; i < K; i++ ) {\n\t\t\tif ( shl[ i ] !== 1 ) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tz.shape = [ shl[i] ];\n\t\tfor ( j = 0; j < N; j++ ) {\n\t\t\tarr[ j ].strides = [ arr[j].strides[i] ];\n\t\t}\n\t\tslx = [ slx[i] ];\n\t\tsly = [ sly[i] ];\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ 1 ]( fcn, arr, views, slx, sly, strategyX, strategyY, opts ); // eslint-disable-line max-len\n\t\t}\n\t\treturn BINARY[ 1 ]( fcn, arr, views, slx, sly, strategyX, strategyY, opts ); // eslint-disable-line max-len\n\t}\n\tiox = iterationOrder( slx ); // +/-1\n\tioy = iterationOrder( sly ); // +/-1\n\tioz = iterationOrder( sz ); // +/-1\n\n\t// Determine whether we can avoid blocked iteration...\n\tordx = strides2order( slx );\n\tordy = strides2order( sly );\n\tordz = strides2order( sz );\n\tif ( iox !== 0 && ioy !== 0 && ioz !== 0 && ordx === ordz && ordy === ordz && K <= MAX_DIMS ) { // eslint-disable-line max-len\n\t\t// So long as iteration for each respective array always moves in the same direction (i.e., no mixed sign strides) and the memory layouts are the same, we can leverage cache-optimal (i.e., normal) nested loops without resorting to blocked iteration...\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn ACCESSOR_BINARY[ K ]( fcn, arr, views, slx, sly, ordx === 1, strategyX, strategyY, opts ); // eslint-disable-line max-len\n\t\t}\n\t\treturn BINARY[ K ]( fcn, arr, views, slx, sly, ordx === 1, strategyX, strategyY, opts ); // eslint-disable-line max-len\n\t}\n\t// At this point, we're either dealing with non-contiguous n-dimensional arrays, high dimensional n-dimensional arrays, and/or arrays having differing memory layouts, so our only hope is that we can still perform blocked iteration...\n\n\t// Determine whether we can perform blocked iteration...\n\tif ( K <= MAX_DIMS ) {\n\t\tif ( hasAccessors( x, y, z ) ) {\n\t\t\treturn BLOCKED_ACCESSOR_BINARY[ K-2 ]( fcn, arr, views, slx, sly, strategyX, strategyY, opts ); // eslint-disable-line max-len\n\t\t}\n\t\treturn BLOCKED_BINARY[ K-2 ]( fcn, arr, views, slx, sly, strategyX, strategyY, opts ); // eslint-disable-line max-len\n\t}\n\t// Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)...\n\tif ( hasAccessors( x, y, z ) ) {\n\t\treturn accessorbinarynd( fcn, arr, views, strategyX, strategyY, opts );\n\t}\n\tbinarynd( fcn, arr, views, strategyX, strategyY, opts );\n}\n\n\n// EXPORTS //\n\nmodule.exports = binaryReduceStrided1d;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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 isFunction = require( '@stdlib/assert-is-function' );\nvar format = require( '@stdlib/string-format' );\nvar reduce = require( './main.js' );\n\n\n// MAIN //\n\n/**\n* Return a function for performing a reduction over a list of specified dimensions in two input ndarrays via a one-dimensional strided array binary reduction function and assigning results to a provided output ndarray.\n*\n* @param {Function} fcn - wrapper for a one-dimensional strided array reduction function\n* @throws {TypeError} first argument must be a function\n* @returns {Function} function for performing a reduction\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var getStride = require( '@stdlib/ndarray-base-stride' );\n* var getOffset = require( '@stdlib/ndarray-base-offset' );\n* var getData = require( '@stdlib/ndarray-base-data-buffer' );\n* var numelDimension = require( '@stdlib/ndarray-base-numel-dimension' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 3, 2, 2 ];\n* var ysh = [ 1, 3, 2, 2 ];\n* var zsh = [ 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Create a function for performing a reduction over subarrays:\n* var dot = factory( gdot );\n* // returns <Function>\n*\n* // Perform a reduction:\n* dot( [ x, y, z ], [ 2, 3 ] );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ 30.0, 174.0, 446.0 ] ]\n*/\nfunction factory( fcn ) {\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\treturn reducer;\n\n\t/**\n\t* Performs a reduction over a list of specified dimensions in two input ndarrays via a one-dimensional strided array binary reduction function and assigns results to a provided output ndarray.\n\t*\n\t* @private\n\t* @param {ArrayLikeObject<Object>} arrays - array-like object containing ndarrays\n\t* @param {IntegerArray} dims - list of dimensions over which to perform a reduction\n\t* @param {Options} [options] - function options\n\t* @returns {void}\n\t*/\n\tfunction reducer( arrays, dims, options ) {\n\t\tvar opts;\n\t\tif ( arguments.length > 2 ) {\n\t\t\topts = options;\n\t\t} else {\n\t\t\topts = {};\n\t\t}\n\t\treturn reduce( fcn, arrays, dims, opts );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = factory;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2025 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* Perform a reduction over a list of specified dimensions in two input ndarrays via a one-dimensional strided array binary reduction function and assign results to a provided output ndarray.\n*\n* @module @stdlib/ndarray-base-binary-reduce-strided1d\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var getStride = require( '@stdlib/ndarray-base-stride' );\n* var getOffset = require( '@stdlib/ndarray-base-offset' );\n* var getData = require( '@stdlib/ndarray-base-data-buffer' );\n* var numelDimension = require( '@stdlib/ndarray-base-numel-dimension' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n* var binaryReduceStrided1d = require( '@stdlib/ndarray-base-binary-reduce-strided1d' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 3, 2, 2 ];\n* var ysh = [ 1, 3, 2, 2 ];\n* var zsh = [ 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Perform a reduction:\n* binaryReduceStrided1d( gdot, [ x, y, z ], [ 2, 3 ] );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ 30.0, 174.0, 446.0 ] ]\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var ndarray2array = require( '@stdlib/ndarray-base-to-array' );\n* var getStride = require( '@stdlib/ndarray-base-stride' );\n* var getOffset = require( '@stdlib/ndarray-base-offset' );\n* var getData = require( '@stdlib/ndarray-base-data-buffer' );\n* var numelDimension = require( '@stdlib/ndarray-base-numel-dimension' );\n* var gdot = require( '@stdlib/blas-base-ndarray-gdot' );\n* var binaryReduceStrided1d = require( '@stdlib/ndarray-base-binary-reduce-strided1d' );\n*\n* // Create data buffers:\n* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var ybuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );\n* var zbuf = new Float64Array( [ 0.0, 0.0, 0.0 ] );\n*\n* // Define the array shapes:\n* var xsh = [ 1, 3, 2, 2 ];\n* var ysh = [ 1, 3, 2, 2 ];\n* var zsh = [ 1, 3 ];\n*\n* // Define the array strides:\n* var sx = [ 12, 4, 2, 1 ];\n* var sy = [ 12, 4, 2, 1 ];\n* var sz = [ 3, 1 ];\n*\n* // Define the index offsets:\n* var ox = 0;\n* var oy = 0;\n* var oz = 0;\n*\n* // Create input ndarray-like objects:\n* var x = {\n*     'dtype': 'float64',\n*     'data': xbuf,\n*     'shape': xsh,\n*     'strides': sx,\n*     'offset': ox,\n*     'order': 'row-major'\n* };\n* var y = {\n*     'dtype': 'float64',\n*     'data': ybuf,\n*     'shape': ysh,\n*     'strides': sy,\n*     'offset': oy,\n*     'order': 'row-major'\n* };\n*\n* // Create an output ndarray-like object:\n* var z = {\n*     'dtype': 'float64',\n*     'data': zbuf,\n*     'shape': zsh,\n*     'strides': sz,\n*     'offset': oz,\n*     'order': 'row-major'\n* };\n*\n* // Create a function for performing a reduction over subarrays:\n* var dot = binaryReduceStrided1d.factory( gdot );\n* // returns <Function>\n*\n* // Perform a reduction:\n* dot( [ x, y, z ], [ 2, 3 ] );\n*\n* var arr = ndarray2array( z.data, z.shape, z.strides, z.offset, z.order );\n* // returns [ [ 30.0, 174.0, 446.0 ] ]\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n\n// exports: { \"factory\": \"main.factory\" }\n"],
+  "mappings": "wGAAA,IAAAA,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAmCA,SAASC,GAAiBC,EAAQC,EAAM,CACvC,IAAIC,EACAC,EAEJ,IAAMA,EAAI,EAAGA,EAAIH,EAAO,OAAQG,IAC/BD,EAAIF,EAAQG,CAAE,EACdF,EAAI,KAAK,CACR,MAASC,EAAE,MACX,KAAQA,EAAE,KACV,MAAS,CAAC,EACV,QAAW,CAAE,CAAE,EACf,OAAUA,EAAE,OACZ,MAASA,EAAE,KACZ,CAAC,EAEF,OAAOD,CACR,CAKAH,GAAO,QAAUC,KCxDjB,IAAAK,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,QAAS,sCAAuC,EACjEC,GAAwB,QAAS,+CAAgD,EAAE,OACnFC,GAAqB,QAAS,yCAA0C,EACxEC,GAAS,QAAS,6BAA8B,EAChDC,GAAsB,QAAS,0CAA2C,EAC1EC,GAAY,QAAS,iCAAkC,EAY3D,SAASC,GAAUC,EAAI,CACtB,OAAOA,CACR,CASA,SAASC,GAAWD,EAAI,CAEvB,MAAO,CACN,MAASA,EAAE,MACX,KAAQA,EAAE,KACV,MAAS,CAAE,CAAE,EACb,QAAW,CAAE,CAAE,EACf,OAAUA,EAAE,OACZ,MAASA,EAAE,KACZ,CACD,CAUA,SAASE,GAASC,EAAKC,EAAQ,CAC9B,IAAIC,EAAK,CAAEF,EAAI,MAAOC,CAAM,CAAE,EAC1BE,EAAK,CAAEH,EAAI,QAASC,CAAM,CAAE,EAChC,OAAOG,EASP,SAASA,EAASP,EAAI,CAErB,MAAO,CACN,MAASA,EAAE,MACX,KAAQA,EAAE,KACV,MAASK,EACT,QAAWC,EACX,OAAUN,EAAE,OACZ,MAASA,EAAE,KACZ,CACD,CACD,CAUA,SAASQ,GAAYC,EAAKC,EAAM,CAC/B,IAAIC,EACAC,EACAP,EACAC,EAGJ,OAAKI,IAAQ,EACZE,EAAM,EAENA,EAAM,EAGPD,EAAO,CAAE,EAAG,CAAE,EAGdN,EAAK,CAAEI,CAAI,EACXH,EAAK,CAAEI,CAAI,EAEJH,EASP,SAASA,EAASP,EAAI,CAErB,OAAAN,GAAuBM,EAAE,MAAOA,EAAE,QAASA,EAAE,OAAQW,CAAK,EAGnD,CACN,MAASX,EAAE,MACX,KAAQA,EAAE,KACV,MAASK,EACT,QAAWC,EACX,OAAUK,EAAMC,CAAI,EACpB,MAASZ,EAAE,KACZ,CACD,CACD,CAUA,SAASa,GAAMJ,EAAKK,EAAY,CAE/B,IAAIC,EAAO,CACV,MAASD,EAAU,MACnB,KAAQA,EAAU,KAClB,MAAS,CAAEL,CAAI,EACf,QAAW,CAAE,CAAE,EACf,OAAUK,EAAU,OACpB,MAASA,EAAU,KACpB,EACA,OAAOP,EASP,SAASA,EAASP,EAAI,CACrB,OAAAJ,GAAQ,CAAEI,EAAGc,CAAU,CAAE,EAClBC,CACR,CACD,CAkBA,SAASC,GAAUhB,EAAI,CACtB,IAAIiB,EACAN,EACAF,EACAC,EACAL,EACAa,EACAC,EAOJ,GAJAd,EAAKL,EAAE,MACPiB,EAAQZ,EAAG,OAGNY,IAAU,EACd,OAAOhB,GAGR,GAAKgB,IAAU,EACd,OAAOlB,GAKR,IAFAU,EAAM,EACNS,EAAK,EACCC,EAAI,EAAGA,EAAIF,EAAOE,IAElBd,EAAIc,CAAE,IAAM,IAChBD,GAAM,GAEPT,GAAOJ,EAAIc,CAAE,EAGd,GAAKD,IAAOD,EAAM,EAAI,CAErB,IAAME,EAAI,EAAGA,EAAIF,GACXZ,EAAIc,CAAE,IAAM,EADMA,IACvB,CAID,OAAOjB,GAASF,EAAGmB,CAAE,CACtB,CAIA,OAHAT,EAAMjB,GAAgBO,EAAE,OAAQ,EAG3BU,IAAQ,IAEZC,EAAOjB,GAAuBW,EAAIL,EAAE,QAASA,EAAE,OAAQ,CAAE,EAAG,CAAE,CAAE,EAG3DS,IAAUE,EAAK,CAAC,EAAEA,EAAK,CAAC,EAAE,GACvBH,GAAYC,EAAKC,CAAI,EAOvBG,GAAMJ,EAAKd,GAAoBG,GAAWD,GAAqBG,CAAE,CAAE,CAAE,CAAE,CAC/E,CAKAR,GAAO,QAAUwB,KCnQjB,IAAAI,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAkCA,SAASC,GAAkBC,EAASC,EAAM,CACzC,IAAIC,EACJ,IAAMA,EAAI,EAAGA,EAAIF,EAAQ,OAAQE,IAChCF,EAASE,CAAE,GAAKD,EAAKC,CAAE,EAExB,OAAOF,CACR,CAKAF,GAAO,QAAUC,KC7CjB,IAAAI,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAmCA,SAASC,GAAgBC,EAAOC,EAAU,CACzC,IAAIC,EACAC,EACJ,IAAMD,EAAI,EAAGC,EAAI,EAAGD,EAAID,EAAQ,OAAQC,IAClCA,IAAM,IAGXF,EAAOG,CAAE,EAAE,OAASF,EAASC,CAAE,EAC/BC,GAAK,GAEN,OAAOH,CACR,CAKAF,GAAO,QAAUC,KCnDjB,IAAAK,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cA6BA,SAASC,GAASC,EAAS,CAC1B,IAAIC,EAAM,CAAC,EACPC,EACJ,IAAMA,EAAI,EAAGA,EAAIF,EAAO,OAAQE,IAC/BD,EAAI,KAAMD,EAAQE,CAAE,EAAE,MAAO,EAE9B,OAAOD,CACR,CAKAH,GAAO,QAAUC,KCzCjB,IAAAI,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,IATAN,EAAIvB,EAAO,OACXyB,EAAIzB,EAAQ,CAAE,EACd0B,EAAI1B,EAAQ,CAAE,EACd2B,EAAI3B,EAAQ,CAAE,EAGdwB,EAAIlC,GAAWqC,EAAE,MAAOzB,EAAUC,EAAUwB,EAAE,OAAQ,EACtDd,EAAKW,EAAE,GACPR,EAAK,CAAEQ,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBb,EAAG,KAAMxB,GAAaQ,EAAO6B,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAgBlD,IAbAjB,EAAQhB,GAAWkC,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CV,EAAKpB,GAASG,CAAO,EAGrBQ,EAAOmB,EAAE,KAGTlB,EAAMkB,EAAE,UAAU,CAAC,EAGnBjB,EAAM,CAAC,EACDmB,EAAI,EAAGA,EAAIN,EAAGM,IACnBnB,EAAI,KAAMM,EAAGa,CAAC,EAAE,CAAC,CAAE,EAWpB,IARAjB,EAAMlB,GAAO6B,CAAE,EACfZ,EAAMjB,GAAO6B,CAAE,EACfL,EAAKxB,GAAO6B,CAAE,EAGdK,EAAInC,GAAaQ,CAAM,EAGjBqB,EAAKT,EAAG,CAAC,EAAGS,EAAK,GAAK,CAQ3B,IAPKA,EAAKf,GACTQ,EAAKO,EACLA,EAAK,IAELP,EAAKR,EACLe,GAAMf,GAEDsB,EAAI,EAAGA,EAAIN,EAAGM,IACnBjB,EAAKiB,CAAE,EAAIZ,EAAGY,CAAC,EAAMP,EAAGN,EAAGa,CAAC,EAAE,CAAC,EAEhC,IAAMR,EAAKR,EAAG,CAAC,EAAGQ,EAAK,GAAK,CAS3B,IARKA,EAAKd,GACTO,EAAKO,EACLA,EAAK,IAELP,EAAKP,EACLc,GAAMd,GAGDsB,EAAI,EAAGA,EAAIN,EAAGM,IACnBX,EAAIW,CAAE,EAAIjB,EAAIiB,CAAC,EAAMR,EAAGL,EAAGa,CAAC,EAAE,CAAC,EAC/BlB,EAAKkB,CAAE,EAAIb,EAAGa,CAAC,EAAE,CAAC,EAAMf,EAAGE,EAAGa,CAAC,EAAE,CAAC,EAGnC,IAAMT,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IACtBvB,GAAgBK,EAAOiB,CAAG,EAC1BU,EAAG,CAAE,EAAIxB,EAAWH,EAAO,CAAE,CAAE,EAC/B2B,EAAG,CAAE,EAAIvB,EAAWJ,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMU,EAAI,CAAE,EAAGnB,EAAK6B,EAAGtB,CAAK,CAAE,EACnCX,GAAkBuB,EAAIR,CAAI,EAE3Bf,GAAkBuB,EAAIP,CAAI,CAC3B,CACD,CACD,CACD,CAKAtB,GAAO,QAAUS,KC7PjB,IAAAgC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,IATAN,EAAI5B,EAAO,OACX8B,EAAI9B,EAAQ,CAAE,EACd+B,EAAI/B,EAAQ,CAAE,EACdgC,EAAIhC,EAAQ,CAAE,EAGd6B,EAAIvC,GAAW0C,EAAE,MAAO9B,EAAUC,EAAU6B,EAAE,OAAQ,EACtDjB,EAAKc,EAAE,GACPV,EAAK,CAAEU,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBf,EAAG,KAAM3B,GAAaQ,EAAOkC,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAgBlD,IAbAtB,EAAQhB,GAAWuC,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CZ,EAAKvB,GAASG,CAAO,EAGrBQ,EAAOwB,EAAE,KAGTvB,EAAMuB,EAAE,UAAU,CAAC,EAGnBtB,EAAM,CAAC,EACDwB,EAAI,EAAGA,EAAIN,EAAGM,IACnBxB,EAAI,KAAMS,EAAGe,CAAC,EAAE,CAAC,CAAE,EAapB,IAVArB,EAAMnB,GAAOkC,CAAE,EACfd,EAAMpB,GAAOkC,CAAE,EACfjB,EAAMjB,GAAOkC,CAAE,EACfhB,EAAMlB,GAAOkC,CAAE,EACfP,EAAK3B,GAAOkC,CAAE,EAGdK,EAAIxC,GAAaQ,CAAM,EAGjB0B,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAAK,CAQ3B,IAPKA,EAAKpB,GACTW,EAAKS,EACLA,EAAK,IAELT,EAAKX,EACLoB,GAAMpB,GAED2B,EAAI,EAAGA,EAAIN,EAAGM,IACnBpB,EAAKoB,CAAE,EAAId,EAAGc,CAAC,EAAMP,EAAGR,EAAGe,CAAC,EAAE,CAAC,EAEhC,IAAMR,EAAKX,EAAG,CAAC,EAAGW,EAAK,GAAK,CAQ3B,IAPKA,EAAKnB,GACTU,EAAKS,EACLA,EAAK,IAELT,EAAKV,EACLmB,GAAMnB,GAED2B,EAAI,EAAGA,EAAIN,EAAGM,IACnBrB,EAAKqB,CAAE,EAAIpB,EAAIoB,CAAC,EAAMR,EAAGP,EAAGe,CAAC,EAAE,CAAC,EAChCtB,EAAKsB,CAAE,EAAIf,EAAGe,CAAC,EAAE,CAAC,EAAMjB,EAAGE,EAAGe,CAAC,EAAE,CAAC,EAEnC,IAAMT,EAAKV,EAAG,CAAC,EAAGU,EAAK,GAAK,CAS3B,IARKA,EAAKlB,GACTS,EAAKS,EACLA,EAAK,IAELT,EAAKT,EACLkB,GAAMlB,GAGD2B,EAAI,EAAGA,EAAIN,EAAGM,IACnBb,EAAIa,CAAE,EAAIrB,EAAIqB,CAAC,EAAMT,EAAGN,EAAGe,CAAC,EAAE,CAAC,EAC/BvB,EAAKuB,CAAE,EAAIf,EAAGe,CAAC,EAAE,CAAC,EAAMlB,EAAGG,EAAGe,CAAC,EAAE,CAAC,EAGnC,IAAMV,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IACtB1B,GAAgBK,EAAOoB,CAAG,EAC1BY,EAAG,CAAE,EAAI7B,EAAWH,EAAO,CAAE,CAAE,EAC/BgC,EAAG,CAAE,EAAI5B,EAAWJ,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMa,EAAI,CAAE,EAAGtB,EAAKkC,EAAG3B,CAAK,CAAE,EACnCX,GAAkB0B,EAAIX,CAAI,EAE3Bf,GAAkB0B,EAAIV,CAAI,CAC3B,CACAhB,GAAkB0B,EAAIT,CAAI,CAC3B,CACD,CACD,CACD,CACD,CAKAvB,GAAO,QAAUS,KCpRjB,IAAAqC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,IATAN,EAAIjC,EAAO,OACXmC,EAAInC,EAAQ,CAAE,EACdoC,EAAIpC,EAAQ,CAAE,EACdqC,EAAIrC,EAAQ,CAAE,EAGdkC,EAAI5C,GAAW+C,EAAE,MAAOnC,EAAUC,EAAUkC,EAAE,OAAQ,EACtDpB,EAAKiB,EAAE,GACPZ,EAAK,CAAEY,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBjB,EAAG,KAAM9B,GAAaQ,EAAOuC,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAgBlD,IAbA3B,EAAQhB,GAAW4C,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7Cd,EAAK1B,GAASG,CAAO,EAGrBQ,EAAO6B,EAAE,KAGT5B,EAAM4B,EAAE,UAAU,CAAC,EAGnB3B,EAAM,CAAC,EACD6B,EAAI,EAAGA,EAAIN,EAAGM,IACnB7B,EAAI,KAAMY,EAAGiB,CAAC,EAAE,CAAC,CAAE,EAepB,IAZAzB,EAAMpB,GAAOuC,CAAE,EACflB,EAAMrB,GAAOuC,CAAE,EACfjB,EAAMtB,GAAOuC,CAAE,EACftB,EAAMjB,GAAOuC,CAAE,EACfrB,EAAMlB,GAAOuC,CAAE,EACfpB,EAAMnB,GAAOuC,CAAE,EACfT,EAAK9B,GAAOuC,CAAE,EAGdK,EAAI7C,GAAaQ,CAAM,EAGjB+B,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAAK,CAQ3B,IAPKA,EAAKzB,GACTc,EAAKW,EACLA,EAAK,IAELX,EAAKd,EACLyB,GAAMzB,GAEDgC,EAAI,EAAGA,EAAIN,EAAGM,IACnBvB,EAAKuB,CAAE,EAAIhB,EAAGgB,CAAC,EAAMP,EAAGV,EAAGiB,CAAC,EAAE,CAAC,EAEhC,IAAMR,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAAK,CAQ3B,IAPKA,EAAKxB,GACTa,EAAKW,EACLA,EAAK,IAELX,EAAKb,EACLwB,GAAMxB,GAEDgC,EAAI,EAAGA,EAAIN,EAAGM,IACnBxB,EAAKwB,CAAE,EAAIvB,EAAIuB,CAAC,EAAMR,EAAGT,EAAGiB,CAAC,EAAE,CAAC,EAChC1B,EAAK0B,CAAE,EAAIjB,EAAGiB,CAAC,EAAE,CAAC,EAAMnB,EAAGE,EAAGiB,CAAC,EAAE,CAAC,EAEnC,IAAMT,EAAKb,EAAG,CAAC,EAAGa,EAAK,GAAK,CAQ3B,IAPKA,EAAKvB,GACTY,EAAKW,EACLA,EAAK,IAELX,EAAKZ,EACLuB,GAAMvB,GAEDgC,EAAI,EAAGA,EAAIN,EAAGM,IACnBzB,EAAKyB,CAAE,EAAIxB,EAAIwB,CAAC,EAAMT,EAAGR,EAAGiB,CAAC,EAAE,CAAC,EAChC3B,EAAK2B,CAAE,EAAIjB,EAAGiB,CAAC,EAAE,CAAC,EAAMpB,EAAGG,EAAGiB,CAAC,EAAE,CAAC,EAEnC,IAAMV,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAAK,CAS3B,IARKA,EAAKtB,GACTW,EAAKW,EACLA,EAAK,IAELX,EAAKX,EACLsB,GAAMtB,GAGDgC,EAAI,EAAGA,EAAIN,EAAGM,IACnBf,EAAIe,CAAE,EAAIzB,EAAIyB,CAAC,EAAMV,EAAGP,EAAGiB,CAAC,EAAE,CAAC,EAC/B5B,EAAK4B,CAAE,EAAIjB,EAAGiB,CAAC,EAAE,CAAC,EAAMrB,EAAGI,EAAGiB,CAAC,EAAE,CAAC,EAGnC,IAAMX,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IACtB7B,GAAgBK,EAAOuB,CAAG,EAC1Bc,EAAG,CAAE,EAAIlC,EAAWH,EAAO,CAAE,CAAE,EAC/BqC,EAAG,CAAE,EAAIjC,EAAWJ,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMgB,EAAI,CAAE,EAAGzB,EAAKuC,EAAGhC,CAAK,CAAE,EACnCX,GAAkB6B,EAAId,CAAI,EAE3Bf,GAAkB6B,EAAIb,CAAI,CAC3B,CACAhB,GAAkB6B,EAAIZ,CAAI,CAC3B,CACAjB,GAAkB6B,EAAIX,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CAKAxB,GAAO,QAAUS,KC3SjB,IAAA0C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,IATAN,EAAItC,EAAO,OACXwC,EAAIxC,EAAQ,CAAE,EACdyC,EAAIzC,EAAQ,CAAE,EACd0C,EAAI1C,EAAQ,CAAE,EAGduC,EAAIjD,GAAWoD,EAAE,MAAOxC,EAAUC,EAAUuC,EAAE,OAAQ,EACtDvB,EAAKoB,EAAE,GACPd,EAAK,CAAEc,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBnB,EAAG,KAAMjC,GAAaQ,EAAO4C,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAgBlD,IAbAhC,EAAQhB,GAAWiD,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7ChB,EAAK7B,GAASG,CAAO,EAGrBQ,EAAOkC,EAAE,KAGTjC,EAAMiC,EAAE,UAAU,CAAC,EAGnBhC,EAAM,CAAC,EACDkC,EAAI,EAAGA,EAAIN,EAAGM,IACnBlC,EAAI,KAAMe,EAAGmB,CAAC,EAAE,CAAC,CAAE,EAiBpB,IAdA7B,EAAMrB,GAAO4C,CAAE,EACftB,EAAMtB,GAAO4C,CAAE,EACfrB,EAAMvB,GAAO4C,CAAE,EACfpB,EAAMxB,GAAO4C,CAAE,EACf3B,EAAMjB,GAAO4C,CAAE,EACf1B,EAAMlB,GAAO4C,CAAE,EACfzB,EAAMnB,GAAO4C,CAAE,EACfxB,EAAMpB,GAAO4C,CAAE,EACfX,EAAKjC,GAAO4C,CAAE,EAGdK,EAAIlD,GAAaQ,CAAM,EAGjBoC,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAAK,CAQ3B,IAPKA,EAAK9B,GACTiB,EAAKa,EACLA,EAAK,IAELb,EAAKjB,EACL8B,GAAM9B,GAEDqC,EAAI,EAAGA,EAAIN,EAAGM,IACnB1B,EAAK0B,CAAE,EAAIlB,EAAGkB,CAAC,EAAMP,EAAGZ,EAAGmB,CAAC,EAAE,CAAC,EAEhC,IAAMR,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAAK,CAQ3B,IAPKA,EAAK7B,GACTgB,EAAKa,EACLA,EAAK,IAELb,EAAKhB,EACL6B,GAAM7B,GAEDqC,EAAI,EAAGA,EAAIN,EAAGM,IACnB9B,EAAK8B,CAAE,EAAInB,EAAGmB,CAAC,EAAE,CAAC,EAAMrB,EAAGE,EAAGmB,CAAC,EAAE,CAAC,EAClC3B,EAAK2B,CAAE,EAAI1B,EAAI0B,CAAC,EAAMR,EAAGX,EAAGmB,CAAC,EAAE,CAAC,EAEjC,IAAMT,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAAK,CAQ3B,IAPKA,EAAK5B,GACTe,EAAKa,EACLA,EAAK,IAELb,EAAKf,EACL4B,GAAM5B,GAEDqC,EAAI,EAAGA,EAAIN,EAAGM,IACnB/B,EAAK+B,CAAE,EAAInB,EAAGmB,CAAC,EAAE,CAAC,EAAMtB,EAAGG,EAAGmB,CAAC,EAAE,CAAC,EAClC5B,EAAK4B,CAAE,EAAI3B,EAAI2B,CAAC,EAAMT,EAAGV,EAAGmB,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAAK,CAQ3B,IAPKA,EAAK3B,GACTc,EAAKa,EACLA,EAAK,IAELb,EAAKd,EACL2B,GAAM3B,GAEDqC,EAAI,EAAGA,EAAIN,EAAGM,IACnBhC,EAAKgC,CAAE,EAAInB,EAAGmB,CAAC,EAAE,CAAC,EAAMvB,EAAGI,EAAGmB,CAAC,EAAE,CAAC,EAClC7B,EAAK6B,CAAE,EAAI5B,EAAI4B,CAAC,EAAMV,EAAGT,EAAGmB,CAAC,EAAE,CAAC,EAEjC,IAAMX,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAAK,CAS3B,IARKA,EAAK1B,GACTa,EAAKa,EACLA,EAAK,IAELb,EAAKb,EACL0B,GAAM1B,GAGDqC,EAAI,EAAGA,EAAIN,EAAGM,IACnBjB,EAAIiB,CAAE,EAAI7B,EAAI6B,CAAC,EAAMX,EAAGR,EAAGmB,CAAC,EAAE,CAAC,EAC/BjC,EAAKiC,CAAE,EAAInB,EAAGmB,CAAC,EAAE,CAAC,EAAMxB,EAAGK,EAAGmB,CAAC,EAAE,CAAC,EAGnC,IAAMZ,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IACtBhC,GAAgBK,EAAO0B,CAAG,EAC1BgB,EAAG,CAAE,EAAIvC,EAAWH,EAAO,CAAE,CAAE,EAC/B0C,EAAG,CAAE,EAAItC,EAAWJ,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMmB,EAAI,CAAE,EAAG5B,EAAK4C,EAAGrC,CAAK,CAAE,EACnCX,GAAkBgC,EAAIjB,CAAI,EAE3Bf,GAAkBgC,EAAIhB,CAAI,CAC3B,CACAhB,GAAkBgC,EAAIf,CAAI,CAC3B,CACAjB,GAAkBgC,EAAId,CAAI,CAC3B,CACAlB,GAAkBgC,EAAIb,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CAKAzB,GAAO,QAAUS,KClUjB,IAAA+C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EAaJ,IATAN,EAAI3C,EAAO,OACX6C,GAAI7C,EAAQ,CAAE,EACd8C,GAAI9C,EAAQ,CAAE,EACd+C,GAAI/C,EAAQ,CAAE,EAGd4C,EAAItD,GAAWyD,GAAE,MAAO7C,EAAUC,EAAU4C,GAAE,OAAQ,EACtD1B,EAAKuB,EAAE,GACPhB,EAAK,CAAEgB,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBrB,EAAG,KAAMpC,GAAaQ,EAAOiD,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAgBlD,IAbArC,EAAQhB,GAAWsD,GAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7ClB,EAAKhC,GAASG,CAAO,EAGrBQ,EAAOuC,GAAE,KAGTtC,EAAMsC,GAAE,UAAU,CAAC,EAGnBrC,EAAM,CAAC,EACDuC,EAAI,EAAGA,EAAIN,EAAGM,IACnBvC,EAAI,KAAMkB,EAAGqB,CAAC,EAAE,CAAC,CAAE,EAmBpB,IAhBAjC,EAAMtB,GAAOiD,CAAE,EACf1B,EAAMvB,GAAOiD,CAAE,EACfzB,EAAMxB,GAAOiD,CAAE,EACfxB,EAAMzB,GAAOiD,CAAE,EACfvB,EAAM1B,GAAOiD,CAAE,EACfhC,EAAMjB,GAAOiD,CAAE,EACf/B,EAAMlB,GAAOiD,CAAE,EACf9B,EAAMnB,GAAOiD,CAAE,EACf7B,EAAMpB,GAAOiD,CAAE,EACf5B,EAAMrB,GAAOiD,CAAE,EACfb,EAAKpC,GAAOiD,CAAE,EAGdK,EAAIvD,GAAaQ,CAAM,EAGjByC,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAAK,CAQ3B,IAPKA,EAAKnC,GACToB,EAAKe,EACLA,EAAK,IAELf,EAAKpB,EACLmC,GAAMnC,GAED0C,EAAI,EAAGA,EAAIN,EAAGM,IACnB7B,EAAK6B,CAAE,EAAIpB,EAAGoB,CAAC,EAAMP,EAAGd,EAAGqB,CAAC,EAAE,CAAC,EAEhC,IAAMR,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAAK,CAQ3B,IAPKA,EAAKlC,GACTmB,EAAKe,EACLA,EAAK,IAELf,EAAKnB,EACLkC,GAAMlC,GAED0C,EAAI,EAAGA,EAAIN,EAAGM,IACnBlC,EAAKkC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAMvB,EAAGE,EAAGqB,CAAC,EAAE,CAAC,EAClC9B,EAAK8B,CAAE,EAAI7B,EAAI6B,CAAC,EAAMR,EAAGb,EAAGqB,CAAC,EAAE,CAAC,EAEjC,IAAMT,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAAK,CAQ3B,IAPKA,EAAKjC,GACTkB,EAAKe,EACLA,EAAK,IAELf,EAAKlB,EACLiC,GAAMjC,GAED0C,EAAI,EAAGA,EAAIN,EAAGM,IACnBnC,EAAKmC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAMxB,EAAGG,EAAGqB,CAAC,EAAE,CAAC,EAClC/B,EAAK+B,CAAE,EAAI9B,EAAI8B,CAAC,EAAMT,EAAGZ,EAAGqB,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAAK,CAQ3B,IAPKA,EAAKhC,GACTiB,EAAKe,EACLA,EAAK,IAELf,EAAKjB,EACLgC,GAAMhC,GAED0C,EAAI,EAAGA,EAAIN,EAAGM,IACnBpC,EAAKoC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAMzB,EAAGI,EAAGqB,CAAC,EAAE,CAAC,EAClChC,EAAKgC,CAAE,EAAI/B,EAAI+B,CAAC,EAAMV,EAAGX,EAAGqB,CAAC,EAAE,CAAC,EAEjC,IAAMX,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAAK,CAQ3B,IAPKA,EAAK/B,GACTgB,EAAKe,EACLA,EAAK,IAELf,EAAKhB,EACL+B,GAAM/B,GAED0C,EAAI,EAAGA,EAAIN,EAAGM,IACnBrC,EAAKqC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAM1B,EAAGK,EAAGqB,CAAC,EAAE,CAAC,EAClCjC,EAAKiC,CAAE,EAAIhC,EAAIgC,CAAC,EAAMX,EAAGV,EAAGqB,CAAC,EAAE,CAAC,EAEjC,IAAMZ,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAAK,CAS3B,IARKA,EAAK9B,GACTe,EAAKe,EACLA,EAAK,IAELf,EAAKf,EACL8B,GAAM9B,GAGD0C,EAAI,EAAGA,EAAIN,EAAGM,IACnBnB,EAAImB,CAAE,EAAIjC,EAAIiC,CAAC,EAAMZ,EAAGT,EAAGqB,CAAC,EAAE,CAAC,EAC/BtC,EAAKsC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAM3B,EAAGM,EAAGqB,CAAC,EAAE,CAAC,EAGnC,IAAMb,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IACtBnC,GAAgBK,EAAO6B,CAAG,EAC1BkB,EAAG,CAAE,EAAI5C,EAAWH,EAAO,CAAE,CAAE,EAC/B+C,EAAG,CAAE,EAAI3C,EAAWJ,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMsB,EAAI,CAAE,EAAG/B,EAAKiD,EAAG1C,CAAK,CAAE,EACnCX,GAAkBmC,EAAIpB,CAAI,EAE3Bf,GAAkBmC,EAAInB,CAAI,CAC3B,CACAhB,GAAkBmC,EAAIlB,CAAI,CAC3B,CACAjB,GAAkBmC,EAAIjB,CAAI,CAC3B,CACAlB,GAAkBmC,EAAIhB,CAAI,CAC3B,CACAnB,GAAkBmC,EAAIf,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKA1B,GAAO,QAAUS,KCzVjB,IAAAoD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EAaJ,IATAN,EAAIhD,EAAO,OACXkD,GAAIlD,EAAQ,CAAE,EACdmD,GAAInD,EAAQ,CAAE,EACdoD,GAAIpD,EAAQ,CAAE,EAGdiD,EAAI3D,GAAW8D,GAAE,MAAOlD,EAAUC,EAAUiD,GAAE,OAAQ,EACtD7B,EAAK0B,EAAE,GACPlB,EAAK,CAAEkB,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBvB,EAAG,KAAMvC,GAAaQ,EAAOsD,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAgBlD,IAbA1C,EAAQhB,GAAW2D,GAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7CpB,EAAKnC,GAASG,CAAO,EAGrBQ,EAAO4C,GAAE,KAGT3C,EAAM2C,GAAE,UAAW,CAAE,EAGrB1C,EAAM,CAAC,EACD4C,EAAI,EAAGA,EAAIN,EAAGM,IACnB5C,EAAI,KAAMqB,EAAGuB,CAAC,EAAE,CAAC,CAAE,EAqBpB,IAlBArC,EAAMvB,GAAOsD,CAAE,EACf9B,EAAMxB,GAAOsD,CAAE,EACf7B,EAAMzB,GAAOsD,CAAE,EACf5B,EAAM1B,GAAOsD,CAAE,EACf3B,EAAM3B,GAAOsD,CAAE,EACf1B,EAAM5B,GAAOsD,CAAE,EACfrC,EAAMjB,GAAOsD,CAAE,EACfpC,EAAMlB,GAAOsD,CAAE,EACfnC,EAAMnB,GAAOsD,CAAE,EACflC,EAAMpB,GAAOsD,CAAE,EACfjC,EAAMrB,GAAOsD,CAAE,EACfhC,EAAMtB,GAAOsD,CAAE,EACff,EAAKvC,GAAOsD,CAAE,EAGdK,EAAI5D,GAAaQ,CAAM,EAGjB8C,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GAAK,CAQ3B,IAPKA,GAAKxC,GACTuB,EAAKiB,GACLA,GAAK,IAELjB,EAAKvB,EACLwC,IAAMxC,GAED+C,EAAI,EAAGA,EAAIN,EAAGM,IACnBhC,EAAKgC,CAAE,EAAItB,EAAGsB,CAAC,EAAMP,GAAGhB,EAAGuB,CAAC,EAAE,CAAC,EAEhC,IAAMR,GAAKvB,EAAG,CAAC,EAAGuB,GAAK,GAAK,CAQ3B,IAPKA,GAAKvC,GACTsB,EAAKiB,GACLA,GAAK,IAELjB,EAAKtB,EACLuC,IAAMvC,GAED+C,EAAI,EAAGA,EAAIN,EAAGM,IACnBtC,EAAKsC,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAMzB,EAAGE,EAAGuB,CAAC,EAAE,CAAC,EAClCjC,EAAKiC,CAAE,EAAIhC,EAAIgC,CAAC,EAAMR,GAAGf,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMT,GAAKtB,EAAG,CAAC,EAAGsB,GAAK,GAAK,CAQ3B,IAPKA,GAAKtC,GACTqB,EAAKiB,GACLA,GAAK,IAELjB,EAAKrB,EACLsC,IAAMtC,GAED+C,EAAI,EAAGA,EAAIN,EAAGM,IACnBvC,EAAKuC,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM1B,EAAGG,EAAGuB,CAAC,EAAE,CAAC,EAClClC,EAAKkC,CAAE,EAAIjC,EAAIiC,CAAC,EAAMT,GAAGd,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAAK,CAQ3B,IAPKA,EAAKrC,GACToB,EAAKiB,EACLA,EAAK,IAELjB,EAAKpB,EACLqC,GAAMrC,GAED+C,EAAI,EAAGA,EAAIN,EAAGM,IACnBxC,EAAKwC,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM3B,EAAGI,EAAGuB,CAAC,EAAE,CAAC,EAClCnC,EAAKmC,CAAE,EAAIlC,EAAIkC,CAAC,EAAMV,EAAGb,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMX,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAAK,CAQ3B,IAPKA,EAAKpC,GACTmB,EAAKiB,EACLA,EAAK,IAELjB,EAAKnB,EACLoC,GAAMpC,GAED+C,EAAI,EAAGA,EAAIN,EAAGM,IACnBzC,EAAKyC,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM5B,EAAGK,EAAGuB,CAAC,EAAE,CAAC,EAClCpC,EAAKoC,CAAE,EAAInC,EAAImC,CAAC,EAAMX,EAAGZ,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMZ,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAAK,CAQ3B,IAPKA,EAAKnC,GACTkB,EAAKiB,EACLA,EAAK,IAELjB,EAAKlB,EACLmC,GAAMnC,GAED+C,EAAI,EAAGA,EAAIN,EAAGM,IACnB1C,EAAK0C,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM7B,EAAGM,EAAGuB,CAAC,EAAE,CAAC,EAClCrC,EAAKqC,CAAE,EAAIpC,EAAIoC,CAAC,EAAMZ,EAAGX,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMb,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAAK,CAS3B,IARKA,EAAKlC,GACTiB,EAAKiB,EACLA,EAAK,IAELjB,EAAKjB,EACLkC,GAAMlC,GAGD+C,EAAI,EAAGA,EAAIN,EAAGM,IACnBrB,EAAIqB,CAAE,EAAIrC,EAAIqC,CAAC,EAAMb,EAAGV,EAAGuB,CAAC,EAAE,CAAC,EAC/B3C,EAAK2C,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM9B,EAAGO,EAAGuB,CAAC,EAAE,CAAC,EAGnC,IAAMd,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IACtBtC,GAAgBK,EAAOgC,CAAG,EAC1BoB,EAAG,CAAE,EAAIjD,EAAWH,EAAO,CAAE,CAAE,EAC/BoD,EAAG,CAAE,EAAIhD,EAAWJ,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMyB,EAAI,CAAE,EAAGlC,EAAKsD,EAAG/C,CAAK,CAAE,EACnCX,GAAkBsC,EAAIvB,CAAI,EAE3Bf,GAAkBsC,EAAItB,CAAI,CAC3B,CACAhB,GAAkBsC,EAAIrB,CAAI,CAC3B,CACAjB,GAAkBsC,EAAIpB,CAAI,CAC3B,CACAlB,GAAkBsC,EAAInB,CAAI,CAC3B,CACAnB,GAAkBsC,EAAIlB,CAAI,CAC3B,CACApB,GAAkBsC,EAAIjB,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKA3B,GAAO,QAAUS,KChXjB,IAAAyD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EAaJ,IATAN,EAAIrD,EAAO,OACXuD,GAAIvD,EAAQ,CAAE,EACdwD,GAAIxD,EAAQ,CAAE,EACdyD,GAAIzD,EAAQ,CAAE,EAGdsD,EAAIhE,GAAWmE,GAAE,MAAOvD,EAAUC,EAAUsD,GAAE,OAAQ,EACtDhC,EAAK6B,EAAE,GACPpB,EAAK,CAAEoB,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBzB,EAAG,KAAM1C,GAAaQ,EAAO2D,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAgBlD,IAbA/C,EAAQhB,GAAWgE,GAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7CtB,EAAKtC,GAASG,CAAO,EAGrBQ,EAAOiD,GAAE,KAGThD,EAAMgD,GAAE,UAAW,CAAE,EAGrB/C,EAAM,CAAC,EACDiD,EAAI,EAAGA,EAAIN,EAAGM,IACnBjD,EAAI,KAAMwB,EAAGyB,CAAC,EAAE,CAAC,CAAE,EAuBpB,IApBAzC,EAAMxB,GAAO2D,CAAE,EACflC,EAAMzB,GAAO2D,CAAE,EACfjC,EAAM1B,GAAO2D,CAAE,EACfhC,EAAM3B,GAAO2D,CAAE,EACf/B,EAAM5B,GAAO2D,CAAE,EACf9B,EAAM7B,GAAO2D,CAAE,EACf7B,EAAM9B,GAAO2D,CAAE,EACf1C,EAAMjB,GAAO2D,CAAE,EACfzC,EAAMlB,GAAO2D,CAAE,EACfxC,EAAMnB,GAAO2D,CAAE,EACfvC,EAAMpB,GAAO2D,CAAE,EACftC,EAAMrB,GAAO2D,CAAE,EACfrC,EAAMtB,GAAO2D,CAAE,EACfpC,EAAMvB,GAAO2D,CAAE,EACfjB,EAAK1C,GAAO2D,CAAE,EAGdK,EAAIjE,GAAaQ,CAAM,EAGjBmD,GAAK3B,EAAG,CAAC,EAAG2B,GAAK,GAAK,CAQ3B,IAPKA,GAAK7C,GACT0B,EAAKmB,GACLA,GAAK,IAELnB,EAAK1B,EACL6C,IAAM7C,GAEDoD,EAAI,EAAGA,EAAIN,EAAGM,IACnBnC,EAAKmC,CAAE,EAAIxB,EAAGwB,CAAC,EAAMP,GAAGlB,EAAGyB,CAAC,EAAE,CAAC,EAEhC,IAAMR,GAAK1B,EAAG,CAAC,EAAG0B,GAAK,GAAK,CAQ3B,IAPKA,GAAK5C,GACTyB,EAAKmB,GACLA,GAAK,IAELnB,EAAKzB,EACL4C,IAAM5C,GAEDoD,EAAI,EAAGA,EAAIN,EAAGM,IACnB1C,EAAK0C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM3B,EAAGE,EAAGyB,CAAC,EAAE,CAAC,EAClCpC,EAAKoC,CAAE,EAAInC,EAAImC,CAAC,EAAMR,GAAGjB,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMT,GAAKzB,EAAG,CAAC,EAAGyB,GAAK,GAAK,CAQ3B,IAPKA,GAAK3C,GACTwB,EAAKmB,GACLA,GAAK,IAELnB,EAAKxB,EACL2C,IAAM3C,GAEDoD,EAAI,EAAGA,EAAIN,EAAGM,IACnB3C,EAAK2C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM5B,EAAGG,EAAGyB,CAAC,EAAE,CAAC,EAClCrC,EAAKqC,CAAE,EAAIpC,EAAIoC,CAAC,EAAMT,GAAGhB,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAAK,CAQ3B,IAPKA,EAAK1C,GACTuB,EAAKmB,EACLA,EAAK,IAELnB,EAAKvB,EACL0C,GAAM1C,GAEDoD,EAAI,EAAGA,EAAIN,EAAGM,IACnB5C,EAAK4C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM7B,EAAGI,EAAGyB,CAAC,EAAE,CAAC,EAClCtC,EAAKsC,CAAE,EAAIrC,EAAIqC,CAAC,EAAMV,EAAGf,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMX,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAAK,CAQ3B,IAPKA,EAAKzC,GACTsB,EAAKmB,EACLA,EAAK,IAELnB,EAAKtB,EACLyC,GAAMzC,GAEDoD,EAAI,EAAGA,EAAIN,EAAGM,IACnB7C,EAAK6C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM9B,EAAGK,EAAGyB,CAAC,EAAE,CAAC,EAClCvC,EAAKuC,CAAE,EAAItC,EAAIsC,CAAC,EAAMX,EAAGd,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMZ,GAAKtB,EAAG,CAAC,EAAGsB,GAAK,GAAK,CAQ3B,IAPKA,GAAKxC,GACTqB,EAAKmB,GACLA,GAAK,IAELnB,EAAKrB,EACLwC,IAAMxC,GAEDoD,EAAI,EAAGA,EAAIN,EAAGM,IACnB9C,EAAK8C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM/B,EAAGM,EAAGyB,CAAC,EAAE,CAAC,EAClCxC,EAAKwC,CAAE,EAAIvC,EAAIuC,CAAC,EAAMZ,GAAGb,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMb,GAAKrB,EAAG,CAAC,EAAGqB,GAAK,GAAK,CAQ3B,IAPKA,GAAKvC,GACToB,EAAKmB,GACLA,GAAK,IAELnB,EAAKpB,EACLuC,IAAMvC,GAEDoD,EAAI,EAAGA,EAAIN,EAAGM,IACnB/C,EAAK+C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAMhC,EAAGO,EAAGyB,CAAC,EAAE,CAAC,EAClCzC,EAAKyC,CAAE,EAAIxC,EAAIwC,CAAC,EAAMb,GAAGZ,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMd,GAAKpB,EAAG,CAAC,EAAGoB,GAAK,GAAK,CAS3B,IARKA,GAAKtC,GACTmB,EAAKmB,GACLA,GAAK,IAELnB,EAAKnB,EACLsC,IAAMtC,GAGDoD,EAAI,EAAGA,EAAIN,EAAGM,IACnBvB,EAAIuB,CAAE,EAAIzC,EAAIyC,CAAC,EAAMd,GAAGX,EAAGyB,CAAC,EAAE,CAAC,EAC/BhD,EAAKgD,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAMjC,EAAGQ,EAAGyB,CAAC,EAAE,CAAC,EAGnC,IAAMf,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IACtBzC,GAAgBK,EAAOmC,CAAG,EAC1BsB,EAAG,CAAE,EAAItD,EAAWH,EAAO,CAAE,CAAE,EAC/ByD,EAAG,CAAE,EAAIrD,EAAWJ,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAM4B,EAAI,CAAE,EAAGrC,EAAK2D,EAAGpD,CAAK,CAAE,EACnCX,GAAkByC,EAAI1B,CAAI,EAE3Bf,GAAkByC,EAAIzB,CAAI,CAC3B,CACAhB,GAAkByC,EAAIxB,CAAI,CAC3B,CACAjB,GAAkByC,EAAIvB,CAAI,CAC3B,CACAlB,GAAkByC,EAAItB,CAAI,CAC3B,CACAnB,GAAkByC,EAAIrB,CAAI,CAC3B,CACApB,GAAkByC,EAAIpB,CAAI,CAC3B,CACArB,GAAkByC,EAAInB,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKA5B,GAAO,QAAUS,KCvYjB,IAAA8D,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,GAaJ,IATAN,EAAI1D,EAAO,OACX4D,GAAI5D,EAAQ,CAAE,EACd6D,GAAI7D,EAAQ,CAAE,EACd8D,GAAI9D,EAAQ,CAAE,EAGd2D,EAAIrE,GAAWwE,GAAE,MAAO5D,EAAUC,EAAU2D,GAAE,OAAQ,EACtDnC,EAAKgC,EAAE,GACPtB,EAAK,CAAEsB,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,GAAI,EAAGA,GAAIN,EAAGM,KACnB3B,EAAG,KAAM7C,GAAaQ,EAAOgE,EAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAgBlD,IAbApD,EAAQhB,GAAWqE,GAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7CxB,EAAKzC,GAASG,CAAO,EAGrBQ,EAAOsD,GAAE,KAGTrD,EAAMqD,GAAE,UAAW,CAAE,EAGrBpD,EAAM,CAAC,EACDsD,GAAI,EAAGA,GAAIN,EAAGM,KACnBtD,EAAI,KAAM2B,EAAG2B,EAAC,EAAE,CAAC,CAAE,EAyBpB,IAtBA7C,EAAMzB,GAAOgE,CAAE,EACftC,EAAM1B,GAAOgE,CAAE,EACfrC,EAAM3B,GAAOgE,CAAE,EACfpC,EAAM5B,GAAOgE,CAAE,EACfnC,EAAM7B,GAAOgE,CAAE,EACflC,EAAM9B,GAAOgE,CAAE,EACfjC,EAAM/B,GAAOgE,CAAE,EACfhC,EAAMhC,GAAOgE,CAAE,EACf/C,EAAMjB,GAAOgE,CAAE,EACf9C,EAAMlB,GAAOgE,CAAE,EACf7C,EAAMnB,GAAOgE,CAAE,EACf5C,EAAMpB,GAAOgE,CAAE,EACf3C,EAAMrB,GAAOgE,CAAE,EACf1C,EAAMtB,GAAOgE,CAAE,EACfzC,EAAMvB,GAAOgE,CAAE,EACfxC,EAAMxB,GAAOgE,CAAE,EACfnB,EAAK7C,GAAOgE,CAAE,EAGdK,EAAItE,GAAaQ,CAAM,EAGjBwD,GAAK9B,EAAG,CAAC,EAAG8B,GAAK,GAAK,CAQ3B,IAPKA,GAAKlD,GACT6B,EAAKqB,GACLA,GAAK,IAELrB,EAAK7B,EACLkD,IAAMlD,GAEDyD,GAAI,EAAGA,GAAIN,EAAGM,KACnBtC,EAAKsC,EAAE,EAAI1B,EAAG0B,EAAC,EAAMP,GAAGpB,EAAG2B,EAAC,EAAE,CAAC,EAEhC,IAAMR,GAAK7B,EAAG,CAAC,EAAG6B,GAAK,GAAK,CAQ3B,IAPKA,GAAKjD,GACT4B,EAAKqB,GACLA,GAAK,IAELrB,EAAK5B,EACLiD,IAAMjD,GAEDyD,GAAI,EAAGA,GAAIN,EAAGM,KACnB9C,EAAK8C,EAAE,EAAI3B,EAAG2B,EAAC,EAAE,CAAC,EAAM7B,EAAGE,EAAG2B,EAAC,EAAE,CAAC,EAClCvC,EAAKuC,EAAE,EAAItC,EAAIsC,EAAC,EAAMR,GAAGnB,EAAG2B,EAAC,EAAE,CAAC,EAEjC,IAAMT,GAAK5B,EAAG,CAAC,EAAG4B,GAAK,GAAK,CAQ3B,IAPKA,GAAKhD,GACT2B,EAAKqB,GACLA,GAAK,IAELrB,EAAK3B,EACLgD,IAAMhD,GAEDyD,GAAI,EAAGA,GAAIN,EAAGM,KACnB/C,EAAK+C,EAAE,EAAI3B,EAAG2B,EAAC,EAAE,CAAC,EAAM9B,EAAGG,EAAG2B,EAAC,EAAE,CAAC,EAClCxC,EAAKwC,EAAE,EAAIvC,EAAIuC,EAAC,EAAMT,GAAGlB,EAAG2B,EAAC,EAAE,CAAC,EAEjC,IAAMV,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAAK,CAQ3B,IAPKA,EAAK/C,GACT0B,EAAKqB,EACLA,EAAK,IAELrB,EAAK1B,EACL+C,GAAM/C,GAEDyD,GAAI,EAAGA,GAAIN,EAAGM,KACnBhD,EAAKgD,EAAE,EAAI3B,EAAG2B,EAAC,EAAE,CAAC,EAAM/B,EAAGI,EAAG2B,EAAC,EAAE,CAAC,EAClCzC,EAAKyC,EAAE,EAAIxC,EAAIwC,EAAC,EAAMV,EAAGjB,EAAG2B,EAAC,EAAE,CAAC,EAEjC,IAAMX,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAAK,CAQ3B,IAPKA,EAAK9C,GACTyB,EAAKqB,EACLA,EAAK,IAELrB,EAAKzB,EACL8C,GAAM9C,GAEDyD,GAAI,EAAGA,GAAIN,EAAGM,KACnBjD,EAAKiD,EAAE,EAAI3B,EAAG2B,EAAC,EAAE,CAAC,EAAMhC,EAAGK,EAAG2B,EAAC,EAAE,CAAC,EAClC1C,EAAK0C,EAAE,EAAIzC,EAAIyC,EAAC,EAAMX,EAAGhB,EAAG2B,EAAC,EAAE,CAAC,EAEjC,IAAMZ,GAAKzB,EAAG,CAAC,EAAGyB,GAAK,GAAK,CAQ3B,IAPKA,GAAK7C,GACTwB,EAAKqB,GACLA,GAAK,IAELrB,EAAKxB,EACL6C,IAAM7C,GAEDyD,GAAI,EAAGA,GAAIN,EAAGM,KACnBlD,EAAKkD,EAAE,EAAI3B,EAAG2B,EAAC,EAAE,CAAC,EAAMjC,EAAGM,EAAG2B,EAAC,EAAE,CAAC,EAClC3C,EAAK2C,EAAE,EAAI1C,EAAI0C,EAAC,EAAMZ,GAAGf,EAAG2B,EAAC,EAAE,CAAC,EAEjC,IAAMb,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GAAK,CAQ3B,IAPKA,GAAK5C,GACTuB,EAAKqB,GACLA,GAAK,IAELrB,EAAKvB,EACL4C,IAAM5C,GAEDyD,GAAI,EAAGA,GAAIN,EAAGM,KACnBnD,EAAKmD,EAAE,EAAI3B,EAAG2B,EAAC,EAAE,CAAC,EAAMlC,EAAGO,EAAG2B,EAAC,EAAE,CAAC,EAClC5C,EAAK4C,EAAE,EAAI3C,EAAI2C,EAAC,EAAMb,GAAGd,EAAG2B,EAAC,EAAE,CAAC,EAEjC,IAAMd,GAAKvB,EAAG,CAAC,EAAGuB,GAAK,GAAK,CAQ3B,IAPKA,GAAK3C,GACTsB,EAAKqB,GACLA,GAAK,IAELrB,EAAKtB,EACL2C,IAAM3C,GAEDyD,GAAI,EAAGA,GAAIN,EAAGM,KACnBpD,EAAKoD,EAAE,EAAI3B,EAAG2B,EAAC,EAAE,CAAC,EAAMnC,EAAGQ,EAAG2B,EAAC,EAAE,CAAC,EAClC7C,EAAK6C,EAAE,EAAI5C,EAAI4C,EAAC,EAAMd,GAAGb,EAAG2B,EAAC,EAAE,CAAC,EAEjC,IAAMf,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAAK,CAS3B,IARKA,EAAK1C,GACTqB,EAAKqB,EACLA,EAAK,IAELrB,EAAKrB,EACL0C,GAAM1C,GAGDyD,GAAI,EAAGA,GAAIN,EAAGM,KACnBzB,EAAIyB,EAAE,EAAI7C,EAAI6C,EAAC,EAAMf,EAAGZ,EAAG2B,EAAC,EAAE,CAAC,EAC/BrD,EAAKqD,EAAE,EAAI3B,EAAG2B,EAAC,EAAE,CAAC,EAAMpC,EAAGS,EAAG2B,EAAC,EAAE,CAAC,EAGnC,IAAMhB,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKZ,EAAIY,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKZ,EAAIY,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKZ,EAAIY,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IACtB5C,GAAgBK,EAAOsC,CAAG,EAC1BwB,EAAG,CAAE,EAAI3D,EAAWH,EAAO,CAAE,CAAE,EAC/B8D,EAAG,CAAE,EAAI1D,EAAWJ,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAM+B,EAAI,CAAE,EAAGxC,EAAKgE,EAAGzD,CAAK,CAAE,EACnCX,GAAkB4C,EAAI7B,CAAI,EAE3Bf,GAAkB4C,EAAI5B,CAAI,CAC3B,CACAhB,GAAkB4C,EAAI3B,CAAI,CAC3B,CACAjB,GAAkB4C,EAAI1B,CAAI,CAC3B,CACAlB,GAAkB4C,EAAIzB,CAAI,CAC3B,CACAnB,GAAkB4C,EAAIxB,CAAI,CAC3B,CACApB,GAAkB4C,EAAIvB,CAAI,CAC3B,CACArB,GAAkB4C,EAAItB,CAAI,CAC3B,CACAtB,GAAkB4C,EAAIrB,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKA7B,GAAO,QAAUS,KC9ZjB,IAAAmE,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAkBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC/F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,GACAC,GACAC,GACAC,GACAC,EACAC,GAaJ,IATAN,EAAI/D,EAAO,OACXiE,GAAIjE,EAAQ,CAAE,EACdkE,GAAIlE,EAAQ,CAAE,EACdmE,GAAInE,EAAQ,CAAE,EAGdgE,GAAI1E,GAAW6E,GAAE,MAAOjE,EAAUC,EAAUgE,GAAE,OAAQ,EACtDtC,EAAKmC,GAAE,GACPxB,EAAK,CAAEwB,GAAE,GAAIA,GAAE,GAAIA,GAAE,EAAG,EAClBK,GAAI,EAAGA,GAAIN,EAAGM,KACnB7B,EAAG,KAAMhD,GAAaQ,EAAOqE,EAAC,EAAE,QAASL,GAAE,GAAI,CAAE,EAgBlD,IAbAzD,EAAQhB,GAAW0E,GAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7C1B,EAAK5C,GAASG,CAAO,EAGrBQ,EAAO2D,GAAE,KAGT1D,EAAM0D,GAAE,UAAW,CAAE,EAGrBzD,EAAM,CAAC,EACD2D,GAAI,EAAGA,GAAIN,EAAGM,KACnB3D,EAAI,KAAM8B,EAAG6B,EAAC,EAAE,CAAC,CAAE,EA2BpB,IAxBAjD,EAAM1B,GAAOqE,CAAE,EACf1C,EAAM3B,GAAOqE,CAAE,EACfzC,EAAM5B,GAAOqE,CAAE,EACfxC,EAAM7B,GAAOqE,CAAE,EACfvC,EAAM9B,GAAOqE,CAAE,EACftC,EAAM/B,GAAOqE,CAAE,EACfrC,EAAMhC,GAAOqE,CAAE,EACfpC,EAAMjC,GAAOqE,CAAE,EACfnC,EAAMlC,GAAOqE,CAAE,EACfpD,EAAMjB,GAAOqE,CAAE,EACfnD,EAAMlB,GAAOqE,CAAE,EACflD,EAAMnB,GAAOqE,CAAE,EACfjD,EAAMpB,GAAOqE,CAAE,EACfhD,EAAMrB,GAAOqE,CAAE,EACf/C,EAAMtB,GAAOqE,CAAE,EACf9C,EAAMvB,GAAOqE,CAAE,EACf7C,EAAMxB,GAAOqE,CAAE,EACf5C,EAAMzB,GAAOqE,CAAE,EACfrB,EAAKhD,GAAOqE,CAAE,EAGdK,EAAI3E,GAAaQ,CAAM,EAGjB6D,GAAKjC,EAAG,CAAC,EAAGiC,GAAK,GAAK,CAQ3B,IAPKA,GAAKvD,GACTgC,EAAKuB,GACLA,GAAK,IAELvB,EAAKhC,EACLuD,IAAMvD,GAED8D,GAAI,EAAGA,GAAIN,EAAGM,KACnBzC,EAAKyC,EAAE,EAAI5B,EAAG4B,EAAC,EAAMP,GAAGtB,EAAG6B,EAAC,EAAE,CAAC,EAEhC,IAAMR,GAAKhC,EAAG,CAAC,EAAGgC,GAAK,GAAK,CAQ3B,IAPKA,GAAKtD,GACT+B,EAAKuB,GACLA,GAAK,IAELvB,EAAK/B,EACLsD,IAAMtD,GAED8D,GAAI,EAAGA,GAAIN,EAAGM,KACnBlD,EAAKkD,EAAE,EAAI7B,EAAG6B,EAAC,EAAE,CAAC,EAAM/B,EAAGE,EAAG6B,EAAC,EAAE,CAAC,EAClC1C,EAAK0C,EAAE,EAAIzC,EAAIyC,EAAC,EAAMR,GAAGrB,EAAG6B,EAAC,EAAE,CAAC,EAEjC,IAAMT,GAAK/B,EAAG,CAAC,EAAG+B,GAAK,GAAK,CAQ3B,IAPKA,GAAKrD,GACT8B,EAAKuB,GACLA,GAAK,IAELvB,EAAK9B,EACLqD,IAAMrD,GAED8D,GAAI,EAAGA,GAAIN,EAAGM,KACnBnD,EAAKmD,EAAE,EAAI7B,EAAG6B,EAAC,EAAE,CAAC,EAAMhC,EAAGG,EAAG6B,EAAC,EAAE,CAAC,EAClC3C,EAAK2C,EAAE,EAAI1C,EAAI0C,EAAC,EAAMT,GAAGpB,EAAG6B,EAAC,EAAE,CAAC,EAEjC,IAAMV,EAAK9B,EAAG,CAAC,EAAG8B,EAAK,GAAK,CAQ3B,IAPKA,EAAKpD,GACT6B,EAAKuB,EACLA,EAAK,IAELvB,EAAK7B,EACLoD,GAAMpD,GAED8D,GAAI,EAAGA,GAAIN,EAAGM,KACnBpD,EAAKoD,EAAE,EAAI7B,EAAG6B,EAAC,EAAE,CAAC,EAAMjC,EAAGI,EAAG6B,EAAC,EAAE,CAAC,EAClC5C,EAAK4C,EAAE,EAAI3C,EAAI2C,EAAC,EAAMV,EAAGnB,EAAG6B,EAAC,EAAE,CAAC,EAEjC,IAAMX,EAAK7B,EAAG,CAAC,EAAG6B,EAAK,GAAK,CAQ3B,IAPKA,EAAKnD,GACT4B,EAAKuB,EACLA,EAAK,IAELvB,EAAK5B,EACLmD,GAAMnD,GAED8D,GAAI,EAAGA,GAAIN,EAAGM,KACnBrD,EAAKqD,EAAE,EAAI7B,EAAG6B,EAAC,EAAE,CAAC,EAAMlC,EAAGK,EAAG6B,EAAC,EAAE,CAAC,EAClC7C,EAAK6C,EAAE,EAAI5C,EAAI4C,EAAC,EAAMX,EAAGlB,EAAG6B,EAAC,EAAE,CAAC,EAEjC,IAAMZ,GAAK5B,EAAG,CAAC,EAAG4B,GAAK,GAAK,CAQ3B,IAPKA,GAAKlD,GACT2B,EAAKuB,GACLA,GAAK,IAELvB,EAAK3B,EACLkD,IAAMlD,GAED8D,GAAI,EAAGA,GAAIN,EAAGM,KACnBtD,EAAKsD,EAAE,EAAI7B,EAAG6B,EAAC,EAAE,CAAC,EAAMnC,EAAGM,EAAG6B,EAAC,EAAE,CAAC,EAClC9C,EAAK8C,EAAE,EAAI7C,EAAI6C,EAAC,EAAMZ,GAAGjB,EAAG6B,EAAC,EAAE,CAAC,EAEjC,IAAMb,GAAK3B,EAAG,CAAC,EAAG2B,GAAK,GAAK,CAQ3B,IAPKA,GAAKjD,GACT0B,EAAKuB,GACLA,GAAK,IAELvB,EAAK1B,EACLiD,IAAMjD,GAED8D,GAAI,EAAGA,GAAIN,EAAGM,KACnBvD,EAAKuD,EAAE,EAAI7B,EAAG6B,EAAC,EAAE,CAAC,EAAMpC,EAAGO,EAAG6B,EAAC,EAAE,CAAC,EAClC/C,EAAK+C,EAAE,EAAI9C,EAAI8C,EAAC,EAAMb,GAAGhB,EAAG6B,EAAC,EAAE,CAAC,EAEjC,IAAMd,GAAK1B,EAAG,CAAC,EAAG0B,GAAK,GAAK,CAQ3B,IAPKA,GAAKhD,GACTyB,EAAKuB,GACLA,GAAK,IAELvB,EAAKzB,EACLgD,IAAMhD,GAED8D,GAAI,EAAGA,GAAIN,EAAGM,KACnBxD,EAAKwD,EAAE,EAAI7B,EAAG6B,EAAC,EAAE,CAAC,EAAMrC,EAAGQ,EAAG6B,EAAC,EAAE,CAAC,EAClChD,EAAKgD,EAAE,EAAI/C,EAAI+C,EAAC,EAAMd,GAAGf,EAAG6B,EAAC,EAAE,CAAC,EAEjC,IAAMf,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAAK,CAQ3B,IAPKA,EAAK/C,GACTwB,EAAKuB,EACLA,EAAK,IAELvB,EAAKxB,EACL+C,GAAM/C,GAED8D,GAAI,EAAGA,GAAIN,EAAGM,KACnBzD,EAAKyD,EAAE,EAAI7B,EAAG6B,EAAC,EAAE,CAAC,EAAMtC,EAAGS,EAAG6B,EAAC,EAAE,CAAC,EAClCjD,EAAKiD,EAAE,EAAIhD,EAAIgD,EAAC,EAAMf,EAAGd,EAAG6B,EAAC,EAAE,CAAC,EAEjC,IAAMhB,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAAK,CAS3B,IARKA,EAAK9C,GACTuB,EAAKuB,EACLA,EAAK,IAELvB,EAAKvB,EACL8C,GAAM9C,GAGD8D,GAAI,EAAGA,GAAIN,EAAGM,KACnB3B,EAAI2B,EAAE,EAAIjD,EAAIiD,EAAC,EAAMhB,EAAGb,EAAG6B,EAAC,EAAE,CAAC,EAC/B1D,EAAK0D,EAAE,EAAI7B,EAAG6B,EAAC,EAAE,CAAC,EAAMvC,EAAGU,EAAG6B,EAAC,EAAE,CAAC,EAGnC,IAAMjB,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IACtB/C,GAAgBK,EAAOyC,CAAG,EAC1B0B,EAAG,CAAE,EAAIhE,EAAWH,EAAO,CAAE,CAAE,EAC/BmE,EAAG,CAAE,EAAI/D,EAAWJ,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMkC,EAAI,CAAE,EAAG3C,EAAKqE,EAAG9D,CAAK,CAAE,EACnCX,GAAkB+C,EAAIhC,CAAI,EAE3Bf,GAAkB+C,EAAI/B,CAAI,CAC3B,CACAhB,GAAkB+C,EAAI9B,CAAI,CAC3B,CACAjB,GAAkB+C,EAAI7B,CAAI,CAC3B,CACAlB,GAAkB+C,EAAI5B,CAAI,CAC3B,CACAnB,GAAkB+C,EAAI3B,CAAI,CAC3B,CACApB,GAAkB+C,EAAI1B,CAAI,CAC3B,CACArB,GAAkB+C,EAAIzB,CAAI,CAC3B,CACAtB,GAAkB+C,EAAIxB,CAAI,CAC3B,CACAvB,GAAkB+C,EAAIvB,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKA9B,GAAO,QAAUS,KCrbjB,IAAAwE,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,IATAN,EAAItB,EAAO,OACXwB,EAAIxB,EAAQ,CAAE,EACdyB,EAAIzB,EAAQ,CAAE,EACd0B,EAAI1B,EAAQ,CAAE,EAGduB,EAAIjC,GAAWoC,EAAE,MAAOxB,EAAUC,EAAUuB,EAAE,OAAQ,EACtDd,EAAKW,EAAE,GACPR,EAAK,CAAEQ,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBb,EAAG,KAAMvB,GAAaQ,EAAO4B,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAalD,IAVAhB,EAAQhB,GAAWiC,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CV,EAAKnB,GAASG,CAAO,EAGrBQ,EAAOkB,EAAE,KAGTjB,EAAM,CAAC,EACDmB,EAAI,EAAGA,EAAIN,EAAGM,IACnBnB,EAAI,KAAMM,EAAGa,CAAC,EAAE,CAAC,CAAE,EAWpB,IARAjB,EAAMjB,GAAO4B,CAAE,EACfZ,EAAMhB,GAAO4B,CAAE,EACfL,EAAKvB,GAAO4B,CAAE,EAGdK,EAAIlC,GAAaQ,CAAM,EAGjBoB,EAAKT,EAAG,CAAC,EAAGS,EAAK,GAAK,CAQ3B,IAPKA,EAAKd,GACTO,EAAKO,EACLA,EAAK,IAELP,EAAKP,EACLc,GAAMd,GAEDqB,EAAI,EAAGA,EAAIN,EAAGM,IACnBjB,EAAKiB,CAAE,EAAIZ,EAAGY,CAAC,EAAMP,EAAGN,EAAGa,CAAC,EAAE,CAAC,EAEhC,IAAMR,EAAKR,EAAG,CAAC,EAAGQ,EAAK,GAAK,CAS3B,IARKA,EAAKb,GACTM,EAAKO,EACLA,EAAK,IAELP,EAAKN,EACLa,GAAMb,GAGDqB,EAAI,EAAGA,EAAIN,EAAGM,IACnBX,EAAIW,CAAE,EAAIjB,EAAIiB,CAAC,EAAMR,EAAGL,EAAGa,CAAC,EAAE,CAAC,EAC/BlB,EAAKkB,CAAE,EAAIb,EAAGa,CAAC,EAAE,CAAC,EAAMf,EAAGE,EAAGa,CAAC,EAAE,CAAC,EAGnC,IAAMT,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IACtBtB,GAAgBK,EAAOgB,CAAG,EAC1BU,EAAG,CAAE,EAAIvB,EAAWH,EAAO,CAAE,CAAE,EAC/B0B,EAAG,CAAE,EAAItB,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAMS,EAAG,CAAC,CAAE,EAAIlB,EAAK4B,EAAGrB,CAAK,EAC7BX,GAAkBsB,EAAIR,CAAI,EAE3Bd,GAAkBsB,EAAIP,CAAI,CAC3B,CACD,CACD,CACD,CAKArB,GAAO,QAAUS,KCpPjB,IAAA+B,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA,EAaJ,IATAL,EAAI3B,EAAO,OACX6B,EAAI7B,EAAQ,CAAE,EACd8B,EAAI9B,EAAQ,CAAE,EACd+B,EAAI/B,EAAQ,CAAE,EAGd4B,EAAItC,GAAWyC,EAAE,MAAO7B,EAAUC,EAAU4B,EAAE,OAAQ,EACtDjB,EAAKc,EAAE,GACPV,EAAK,CAAEU,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClB,EAAI,EAAG,EAAID,EAAG,IACnBT,EAAG,KAAM1B,GAAaQ,EAAO,CAAC,EAAE,QAAS4B,EAAE,GAAI,CAAE,EAalD,IAVArB,EAAQhB,GAAWsC,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7CZ,EAAKtB,GAASG,CAAO,EAGrBQ,EAAOuB,EAAE,KAGTtB,EAAM,CAAC,EACD,EAAI,EAAG,EAAIkB,EAAG,IACnBlB,EAAI,KAAMS,EAAG,CAAC,EAAE,CAAC,CAAE,EAapB,IAVAN,EAAMlB,GAAOiC,CAAE,EACfd,EAAMnB,GAAOiC,CAAE,EACfjB,EAAMhB,GAAOiC,CAAE,EACfhB,EAAMjB,GAAOiC,CAAE,EACfP,EAAK1B,GAAOiC,CAAE,EAGdK,EAAIvC,GAAaQ,CAAM,EAGjByB,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAAK,CAQ3B,IAPKA,EAAKnB,GACTU,EAAKS,EACLA,EAAK,IAELT,EAAKV,EACLmB,GAAMnB,GAED,EAAI,EAAG,EAAIoB,EAAG,IACnBd,EAAK,CAAE,EAAIM,EAAG,CAAC,EAAMO,EAAGR,EAAG,CAAC,EAAE,CAAC,EAEhC,IAAMO,EAAKX,EAAG,CAAC,EAAGW,EAAK,GAAK,CAQ3B,IAPKA,EAAKlB,GACTS,EAAKS,EACLA,EAAK,IAELT,EAAKT,EACLkB,GAAMlB,GAED,EAAI,EAAG,EAAIoB,EAAG,IACnBf,EAAK,CAAE,EAAIC,EAAI,CAAC,EAAMY,EAAGP,EAAG,CAAC,EAAE,CAAC,EAChCP,EAAK,CAAE,EAAIO,EAAG,CAAC,EAAE,CAAC,EAAMF,EAAGE,EAAG,CAAC,EAAE,CAAC,EAEnC,IAAMM,EAAKV,EAAG,CAAC,EAAGU,EAAK,GAAK,CAS3B,IARKA,EAAKjB,GACTQ,EAAKS,EACLA,EAAK,IAELT,EAAKR,EACLiB,GAAMjB,GAGD,EAAI,EAAG,EAAIoB,EAAG,IACnBP,EAAI,CAAE,EAAIR,EAAI,CAAC,EAAMY,EAAGN,EAAG,CAAC,EAAE,CAAC,EAC/BR,EAAK,CAAE,EAAIQ,EAAG,CAAC,EAAE,CAAC,EAAMH,EAAGG,EAAG,CAAC,EAAE,CAAC,EAGnC,IAAMK,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IACtBzB,GAAgBK,EAAOmB,CAAG,EAC1BY,EAAG,CAAE,EAAI5B,EAAWH,EAAO,CAAE,CAAE,EAC/B+B,EAAG,CAAE,EAAI3B,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAMY,EAAG,CAAC,CAAE,EAAIrB,EAAKiC,EAAG1B,CAAK,EAC7BX,GAAkByB,EAAIX,CAAI,EAE3Bd,GAAkByB,EAAIV,CAAI,CAC3B,CACAf,GAAkByB,EAAIT,CAAI,CAC3B,CACD,CACD,CACD,CACD,CAKAtB,GAAO,QAAUS,KC3QjB,IAAAmC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,IATAN,EAAIhC,EAAO,OACXkC,EAAIlC,EAAQ,CAAE,EACdmC,EAAInC,EAAQ,CAAE,EACdoC,EAAIpC,EAAQ,CAAE,EAGdiC,EAAI3C,GAAW8C,EAAE,MAAOlC,EAAUC,EAAUiC,EAAE,OAAQ,EACtDpB,EAAKiB,EAAE,GACPZ,EAAK,CAAEY,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBjB,EAAG,KAAM7B,GAAaQ,EAAOsC,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAalD,IAVA1B,EAAQhB,GAAW2C,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7Cd,EAAKzB,GAASG,CAAO,EAGrBQ,EAAO4B,EAAE,KAGT3B,EAAM,CAAC,EACD6B,EAAI,EAAGA,EAAIN,EAAGM,IACnB7B,EAAI,KAAMY,EAAGiB,CAAC,EAAE,CAAC,CAAE,EAepB,IAZAzB,EAAMnB,GAAOsC,CAAE,EACflB,EAAMpB,GAAOsC,CAAE,EACfjB,EAAMrB,GAAOsC,CAAE,EACftB,EAAMhB,GAAOsC,CAAE,EACfrB,EAAMjB,GAAOsC,CAAE,EACfpB,EAAMlB,GAAOsC,CAAE,EACfT,EAAK7B,GAAOsC,CAAE,EAGdK,EAAI5C,GAAaQ,CAAM,EAGjB8B,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAAK,CAQ3B,IAPKA,EAAKxB,GACTa,EAAKW,EACLA,EAAK,IAELX,EAAKb,EACLwB,GAAMxB,GAED+B,EAAI,EAAGA,EAAIN,EAAGM,IACnBvB,EAAKuB,CAAE,EAAIhB,EAAGgB,CAAC,EAAMP,EAAGV,EAAGiB,CAAC,EAAE,CAAC,EAEhC,IAAMR,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAAK,CAQ3B,IAPKA,EAAKvB,GACTY,EAAKW,EACLA,EAAK,IAELX,EAAKZ,EACLuB,GAAMvB,GAED+B,EAAI,EAAGA,EAAIN,EAAGM,IACnBxB,EAAKwB,CAAE,EAAIvB,EAAIuB,CAAC,EAAMR,EAAGT,EAAGiB,CAAC,EAAE,CAAC,EAChC1B,EAAK0B,CAAE,EAAIjB,EAAGiB,CAAC,EAAE,CAAC,EAAMnB,EAAGE,EAAGiB,CAAC,EAAE,CAAC,EAEnC,IAAMT,EAAKb,EAAG,CAAC,EAAGa,EAAK,GAAK,CAQ3B,IAPKA,EAAKtB,GACTW,EAAKW,EACLA,EAAK,IAELX,EAAKX,EACLsB,GAAMtB,GAED+B,EAAI,EAAGA,EAAIN,EAAGM,IACnBzB,EAAKyB,CAAE,EAAIxB,EAAIwB,CAAC,EAAMT,EAAGR,EAAGiB,CAAC,EAAE,CAAC,EAChC3B,EAAK2B,CAAE,EAAIjB,EAAGiB,CAAC,EAAE,CAAC,EAAMpB,EAAGG,EAAGiB,CAAC,EAAE,CAAC,EAEnC,IAAMV,EAAKZ,EAAG,CAAC,EAAGY,EAAK,GAAK,CAS3B,IARKA,EAAKrB,GACTU,EAAKW,EACLA,EAAK,IAELX,EAAKV,EACLqB,GAAMrB,GAGD+B,EAAI,EAAGA,EAAIN,EAAGM,IACnBf,EAAIe,CAAE,EAAIzB,EAAIyB,CAAC,EAAMV,EAAGP,EAAGiB,CAAC,EAAE,CAAC,EAC/B5B,EAAK4B,CAAE,EAAIjB,EAAGiB,CAAC,EAAE,CAAC,EAAMrB,EAAGI,EAAGiB,CAAC,EAAE,CAAC,EAGnC,IAAMX,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IACtB5B,GAAgBK,EAAOsB,CAAG,EAC1Bc,EAAG,CAAE,EAAIjC,EAAWH,EAAO,CAAE,CAAE,EAC/BoC,EAAG,CAAE,EAAIhC,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAMe,EAAG,CAAC,CAAE,EAAIxB,EAAKsC,EAAG/B,CAAK,EAC7BX,GAAkB4B,EAAId,CAAI,EAE3Bd,GAAkB4B,EAAIb,CAAI,CAC3B,CACAf,GAAkB4B,EAAIZ,CAAI,CAC3B,CACAhB,GAAkB4B,EAAIX,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CAKAvB,GAAO,QAAUS,KClSjB,IAAAyC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAaJ,IATAN,EAAIrC,EAAO,OACXuC,EAAIvC,EAAQ,CAAE,EACdwC,EAAIxC,EAAQ,CAAE,EACdyC,EAAIzC,EAAQ,CAAE,EAGdsC,EAAIhD,GAAWmD,EAAE,MAAOvC,EAAUC,EAAUsC,EAAE,OAAQ,EACtDvB,EAAKoB,EAAE,GACPd,EAAK,CAAEc,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBnB,EAAG,KAAMhC,GAAaQ,EAAO2C,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAalD,IAVA/B,EAAQhB,GAAWgD,EAAE,MAAOC,EAAE,MAAOC,EAAE,KAAM,EAG7ChB,EAAK5B,GAASG,CAAO,EAGrBQ,EAAOiC,EAAE,KAGThC,EAAM,CAAC,EACDkC,EAAI,EAAGA,EAAIN,EAAGM,IACnBlC,EAAI,KAAMe,EAAGmB,CAAC,EAAE,CAAC,CAAE,EAiBpB,IAdA7B,EAAMpB,GAAO2C,CAAE,EACftB,EAAMrB,GAAO2C,CAAE,EACfrB,EAAMtB,GAAO2C,CAAE,EACfpB,EAAMvB,GAAO2C,CAAE,EACf3B,EAAMhB,GAAO2C,CAAE,EACf1B,EAAMjB,GAAO2C,CAAE,EACfzB,EAAMlB,GAAO2C,CAAE,EACfxB,EAAMnB,GAAO2C,CAAE,EACfX,EAAKhC,GAAO2C,CAAE,EAGdK,EAAIjD,GAAaQ,CAAM,EAGjBmC,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAAK,CAQ3B,IAPKA,EAAK7B,GACTgB,EAAKa,EACLA,EAAK,IAELb,EAAKhB,EACL6B,GAAM7B,GAEDoC,EAAI,EAAGA,EAAIN,EAAGM,IACnB1B,EAAK0B,CAAE,EAAIlB,EAAGkB,CAAC,EAAMP,EAAGZ,EAAGmB,CAAC,EAAE,CAAC,EAEhC,IAAMR,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAAK,CAQ3B,IAPKA,EAAK5B,GACTe,EAAKa,EACLA,EAAK,IAELb,EAAKf,EACL4B,GAAM5B,GAEDoC,EAAI,EAAGA,EAAIN,EAAGM,IACnB9B,EAAK8B,CAAE,EAAInB,EAAGmB,CAAC,EAAE,CAAC,EAAMrB,EAAGE,EAAGmB,CAAC,EAAE,CAAC,EAClC3B,EAAK2B,CAAE,EAAI1B,EAAI0B,CAAC,EAAMR,EAAGX,EAAGmB,CAAC,EAAE,CAAC,EAEjC,IAAMT,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAAK,CAQ3B,IAPKA,EAAK3B,GACTc,EAAKa,EACLA,EAAK,IAELb,EAAKd,EACL2B,GAAM3B,GAEDoC,EAAI,EAAGA,EAAIN,EAAGM,IACnB/B,EAAK+B,CAAE,EAAInB,EAAGmB,CAAC,EAAE,CAAC,EAAMtB,EAAGG,EAAGmB,CAAC,EAAE,CAAC,EAClC5B,EAAK4B,CAAE,EAAI3B,EAAI2B,CAAC,EAAMT,EAAGV,EAAGmB,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAKf,EAAG,CAAC,EAAGe,EAAK,GAAK,CAQ3B,IAPKA,EAAK1B,GACTa,EAAKa,EACLA,EAAK,IAELb,EAAKb,EACL0B,GAAM1B,GAEDoC,EAAI,EAAGA,EAAIN,EAAGM,IACnBhC,EAAKgC,CAAE,EAAInB,EAAGmB,CAAC,EAAE,CAAC,EAAMvB,EAAGI,EAAGmB,CAAC,EAAE,CAAC,EAClC7B,EAAK6B,CAAE,EAAI5B,EAAI4B,CAAC,EAAMV,EAAGT,EAAGmB,CAAC,EAAE,CAAC,EAEjC,IAAMX,EAAKd,EAAG,CAAC,EAAGc,EAAK,GAAK,CAS3B,IARKA,EAAKzB,GACTY,EAAKa,EACLA,EAAK,IAELb,EAAKZ,EACLyB,GAAMzB,GAGDoC,EAAI,EAAGA,EAAIN,EAAGM,IACnBjB,EAAIiB,CAAE,EAAI7B,EAAI6B,CAAC,EAAMX,EAAGR,EAAGmB,CAAC,EAAE,CAAC,EAC/BjC,EAAKiC,CAAE,EAAInB,EAAGmB,CAAC,EAAE,CAAC,EAAMxB,EAAGK,EAAGmB,CAAC,EAAE,CAAC,EAGnC,IAAMZ,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IACtB/B,GAAgBK,EAAOyB,CAAG,EAC1BgB,EAAG,CAAE,EAAItC,EAAWH,EAAO,CAAE,CAAE,EAC/ByC,EAAG,CAAE,EAAIrC,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAMkB,EAAG,CAAC,CAAE,EAAI3B,EAAK2C,EAAGpC,CAAK,EAC7BX,GAAkB+B,EAAIjB,CAAI,EAE3Bd,GAAkB+B,EAAIhB,CAAI,CAC3B,CACAf,GAAkB+B,EAAIf,CAAI,CAC3B,CACAhB,GAAkB+B,EAAId,CAAI,CAC3B,CACAjB,GAAkB+B,EAAIb,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CAKAxB,GAAO,QAAUS,KCzTjB,IAAA8C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EAaJ,IATAN,EAAI1C,EAAO,OACX4C,EAAI5C,EAAQ,CAAE,EACd6C,GAAI7C,EAAQ,CAAE,EACd8C,GAAI9C,EAAQ,CAAE,EAGd2C,EAAIrD,GAAWwD,GAAE,MAAO5C,EAAUC,EAAU2C,GAAE,OAAQ,EACtD1B,EAAKuB,EAAE,GACPhB,EAAK,CAAEgB,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,EAAGM,IACnBrB,EAAG,KAAMnC,GAAaQ,EAAOgD,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAalD,IAVApC,EAAQhB,GAAWqD,EAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7ClB,EAAK/B,GAASG,CAAO,EAGrBQ,EAAOsC,GAAE,KAGTrC,EAAM,CAAC,EACDuC,EAAI,EAAGA,EAAIN,EAAGM,IACnBvC,EAAI,KAAMkB,EAAGqB,CAAC,EAAE,CAAC,CAAE,EAmBpB,IAhBAjC,EAAMrB,GAAOgD,CAAE,EACf1B,EAAMtB,GAAOgD,CAAE,EACfzB,EAAMvB,GAAOgD,CAAE,EACfxB,EAAMxB,GAAOgD,CAAE,EACfvB,EAAMzB,GAAOgD,CAAE,EACfhC,EAAMhB,GAAOgD,CAAE,EACf/B,EAAMjB,GAAOgD,CAAE,EACf9B,EAAMlB,GAAOgD,CAAE,EACf7B,EAAMnB,GAAOgD,CAAE,EACf5B,EAAMpB,GAAOgD,CAAE,EACfb,EAAKnC,GAAOgD,CAAE,EAGdK,GAAItD,GAAaQ,CAAM,EAGjBwC,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAAK,CAQ3B,IAPKA,EAAKlC,GACTmB,EAAKe,EACLA,EAAK,IAELf,EAAKnB,EACLkC,GAAMlC,GAEDyC,EAAI,EAAGA,EAAIN,EAAGM,IACnB7B,EAAK6B,CAAE,EAAIpB,EAAGoB,CAAC,EAAMP,EAAGd,EAAGqB,CAAC,EAAE,CAAC,EAEhC,IAAMR,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAAK,CAQ3B,IAPKA,EAAKjC,GACTkB,EAAKe,EACLA,EAAK,IAELf,EAAKlB,EACLiC,GAAMjC,GAEDyC,EAAI,EAAGA,EAAIN,EAAGM,IACnBlC,EAAKkC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAMvB,EAAGE,EAAGqB,CAAC,EAAE,CAAC,EAClC9B,EAAK8B,CAAE,EAAI7B,EAAI6B,CAAC,EAAMR,EAAGb,EAAGqB,CAAC,EAAE,CAAC,EAEjC,IAAMT,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAAK,CAQ3B,IAPKA,EAAKhC,GACTiB,EAAKe,EACLA,EAAK,IAELf,EAAKjB,EACLgC,GAAMhC,GAEDyC,EAAI,EAAGA,EAAIN,EAAGM,IACnBnC,EAAKmC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAMxB,EAAGG,EAAGqB,CAAC,EAAE,CAAC,EAClC/B,EAAK+B,CAAE,EAAI9B,EAAI8B,CAAC,EAAMT,EAAGZ,EAAGqB,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAAK,CAQ3B,IAPKA,EAAK/B,GACTgB,EAAKe,EACLA,EAAK,IAELf,EAAKhB,EACL+B,GAAM/B,GAEDyC,EAAI,EAAGA,EAAIN,EAAGM,IACnBpC,EAAKoC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAMzB,EAAGI,EAAGqB,CAAC,EAAE,CAAC,EAClChC,EAAKgC,CAAE,EAAI/B,EAAI+B,CAAC,EAAMV,EAAGX,EAAGqB,CAAC,EAAE,CAAC,EAEjC,IAAMX,EAAKjB,EAAG,CAAC,EAAGiB,EAAK,GAAK,CAQ3B,IAPKA,EAAK9B,GACTe,EAAKe,EACLA,EAAK,IAELf,EAAKf,EACL8B,GAAM9B,GAEDyC,EAAI,EAAGA,EAAIN,EAAGM,IACnBrC,EAAKqC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAM1B,EAAGK,EAAGqB,CAAC,EAAE,CAAC,EAClCjC,EAAKiC,CAAE,EAAIhC,EAAIgC,CAAC,EAAMX,EAAGV,EAAGqB,CAAC,EAAE,CAAC,EAEjC,IAAMZ,EAAKhB,EAAG,CAAC,EAAGgB,EAAK,GAAK,CAS3B,IARKA,EAAK7B,GACTc,EAAKe,EACLA,EAAK,IAELf,EAAKd,EACL6B,GAAM7B,GAGDyC,EAAI,EAAGA,EAAIN,EAAGM,IACnBnB,EAAImB,CAAE,EAAIjC,EAAIiC,CAAC,EAAMZ,EAAGT,EAAGqB,CAAC,EAAE,CAAC,EAC/BtC,EAAKsC,CAAE,EAAIrB,EAAGqB,CAAC,EAAE,CAAC,EAAM3B,EAAGM,EAAGqB,CAAC,EAAE,CAAC,EAGnC,IAAMb,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IACtBlC,GAAgBK,EAAO4B,CAAG,EAC1BkB,GAAG,CAAE,EAAI3C,EAAWH,EAAO,CAAE,CAAE,EAC/B8C,GAAG,CAAE,EAAI1C,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAMqB,EAAG,CAAC,CAAE,EAAI9B,EAAKgD,GAAGzC,CAAK,EAC7BX,GAAkBkC,EAAIpB,CAAI,EAE3Bd,GAAkBkC,EAAInB,CAAI,CAC3B,CACAf,GAAkBkC,EAAIlB,CAAI,CAC3B,CACAhB,GAAkBkC,EAAIjB,CAAI,CAC3B,CACAjB,GAAkBkC,EAAIhB,CAAI,CAC3B,CACAlB,GAAkBkC,EAAIf,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKAzB,GAAO,QAAUS,KChVjB,IAAAmD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EAaJ,IATAN,GAAI/C,EAAO,OACXiD,EAAIjD,EAAQ,CAAE,EACdkD,GAAIlD,EAAQ,CAAE,EACdmD,GAAInD,EAAQ,CAAE,EAGdgD,EAAI1D,GAAW6D,GAAE,MAAOjD,EAAUC,EAAUgD,GAAE,OAAQ,EACtD7B,EAAK0B,EAAE,GACPlB,EAAK,CAAEkB,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,GAAGM,IACnBvB,EAAG,KAAMtC,GAAaQ,EAAOqD,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAalD,IAVAzC,EAAQhB,GAAW0D,EAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7CpB,EAAKlC,GAASG,CAAO,EAGrBQ,EAAO2C,GAAE,KAGT1C,EAAM,CAAC,EACD4C,EAAI,EAAGA,EAAIN,GAAGM,IACnB5C,EAAI,KAAMqB,EAAGuB,CAAC,EAAE,CAAC,CAAE,EAqBpB,IAlBArC,EAAMtB,GAAOqD,EAAE,EACf9B,EAAMvB,GAAOqD,EAAE,EACf7B,EAAMxB,GAAOqD,EAAE,EACf5B,EAAMzB,GAAOqD,EAAE,EACf3B,EAAM1B,GAAOqD,EAAE,EACf1B,EAAM3B,GAAOqD,EAAE,EACfrC,EAAMhB,GAAOqD,EAAE,EACfpC,EAAMjB,GAAOqD,EAAE,EACfnC,EAAMlB,GAAOqD,EAAE,EACflC,EAAMnB,GAAOqD,EAAE,EACfjC,EAAMpB,GAAOqD,EAAE,EACfhC,EAAMrB,GAAOqD,EAAE,EACff,EAAKtC,GAAOqD,EAAE,EAGdK,GAAI3D,GAAaQ,CAAM,EAGjB6C,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GAAK,CAQ3B,IAPKA,GAAKvC,GACTsB,EAAKiB,GACLA,GAAK,IAELjB,EAAKtB,EACLuC,IAAMvC,GAED8C,EAAI,EAAGA,EAAIN,GAAGM,IACnBhC,EAAKgC,CAAE,EAAItB,EAAGsB,CAAC,EAAMP,GAAGhB,EAAGuB,CAAC,EAAE,CAAC,EAEhC,IAAMR,GAAKvB,EAAG,CAAC,EAAGuB,GAAK,GAAK,CAQ3B,IAPKA,GAAKtC,GACTqB,EAAKiB,GACLA,GAAK,IAELjB,EAAKrB,EACLsC,IAAMtC,GAED8C,EAAI,EAAGA,EAAIN,GAAGM,IACnBtC,EAAKsC,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAMzB,EAAGE,EAAGuB,CAAC,EAAE,CAAC,EAClCjC,EAAKiC,CAAE,EAAIhC,EAAIgC,CAAC,EAAMR,GAAGf,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMT,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAAK,CAQ3B,IAPKA,EAAKrC,GACToB,EAAKiB,EACLA,EAAK,IAELjB,EAAKpB,EACLqC,GAAMrC,GAED8C,EAAI,EAAGA,EAAIN,GAAGM,IACnBvC,EAAKuC,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM1B,EAAGG,EAAGuB,CAAC,EAAE,CAAC,EAClClC,EAAKkC,CAAE,EAAIjC,EAAIiC,CAAC,EAAMT,EAAGd,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAKrB,EAAG,CAAC,EAAGqB,EAAK,GAAK,CAQ3B,IAPKA,EAAKpC,GACTmB,EAAKiB,EACLA,EAAK,IAELjB,EAAKnB,EACLoC,GAAMpC,GAED8C,EAAI,EAAGA,EAAIN,GAAGM,IACnBxC,EAAKwC,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM3B,EAAGI,EAAGuB,CAAC,EAAE,CAAC,EAClCnC,EAAKmC,CAAE,EAAIlC,EAAIkC,CAAC,EAAMV,EAAGb,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMX,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAAK,CAQ3B,IAPKA,EAAKnC,GACTkB,EAAKiB,EACLA,EAAK,IAELjB,EAAKlB,EACLmC,GAAMnC,GAED8C,EAAI,EAAGA,EAAIN,GAAGM,IACnBzC,EAAKyC,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM5B,EAAGK,EAAGuB,CAAC,EAAE,CAAC,EAClCpC,EAAKoC,CAAE,EAAInC,EAAImC,CAAC,EAAMX,EAAGZ,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMZ,EAAKnB,EAAG,CAAC,EAAGmB,EAAK,GAAK,CAQ3B,IAPKA,EAAKlC,GACTiB,EAAKiB,EACLA,EAAK,IAELjB,EAAKjB,EACLkC,GAAMlC,GAED8C,EAAI,EAAGA,EAAIN,GAAGM,IACnB1C,EAAK0C,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM7B,EAAGM,EAAGuB,CAAC,EAAE,CAAC,EAClCrC,EAAKqC,CAAE,EAAIpC,EAAIoC,CAAC,EAAMZ,EAAGX,EAAGuB,CAAC,EAAE,CAAC,EAEjC,IAAMb,EAAKlB,EAAG,CAAC,EAAGkB,EAAK,GAAK,CAS3B,IARKA,EAAKjC,GACTgB,EAAKiB,EACLA,EAAK,IAELjB,EAAKhB,EACLiC,GAAMjC,GAGD8C,EAAI,EAAGA,EAAIN,GAAGM,IACnBrB,EAAIqB,CAAE,EAAIrC,EAAIqC,CAAC,EAAMb,EAAGV,EAAGuB,CAAC,EAAE,CAAC,EAC/B3C,EAAK2C,CAAE,EAAIvB,EAAGuB,CAAC,EAAE,CAAC,EAAM9B,EAAGO,EAAGuB,CAAC,EAAE,CAAC,EAGnC,IAAMd,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IACtBrC,GAAgBK,EAAO+B,CAAG,EAC1BoB,GAAG,CAAE,EAAIhD,EAAWH,EAAO,CAAE,CAAE,EAC/BmD,GAAG,CAAE,EAAI/C,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAMwB,EAAG,CAAC,CAAE,EAAIjC,EAAKqD,GAAG9C,CAAK,EAC7BX,GAAkBqC,EAAIvB,CAAI,EAE3Bd,GAAkBqC,EAAItB,CAAI,CAC3B,CACAf,GAAkBqC,EAAIrB,CAAI,CAC3B,CACAhB,GAAkBqC,EAAIpB,CAAI,CAC3B,CACAjB,GAAkBqC,EAAInB,CAAI,CAC3B,CACAlB,GAAkBqC,EAAIlB,CAAI,CAC3B,CACAnB,GAAkBqC,EAAIjB,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKA1B,GAAO,QAAUS,KCvWjB,IAAAwD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EAaJ,IATAN,GAAIpD,EAAO,OACXsD,EAAItD,EAAQ,CAAE,EACduD,GAAIvD,EAAQ,CAAE,EACdwD,GAAIxD,EAAQ,CAAE,EAGdqD,EAAI/D,GAAWkE,GAAE,MAAOtD,EAAUC,EAAUqD,GAAE,OAAQ,EACtDhC,EAAK6B,EAAE,GACPpB,EAAK,CAAEoB,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,GAAGM,IACnBzB,EAAG,KAAMzC,GAAaQ,EAAO0D,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAalD,IAVA9C,EAAQhB,GAAW+D,EAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7CtB,EAAKrC,GAASG,CAAO,EAGrBQ,EAAOgD,GAAE,KAGT/C,EAAM,CAAC,EACDiD,EAAI,EAAGA,EAAIN,GAAGM,IACnBjD,EAAI,KAAMwB,EAAGyB,CAAC,EAAE,CAAC,CAAE,EAuBpB,IApBAzC,EAAMvB,GAAO0D,EAAE,EACflC,EAAMxB,GAAO0D,EAAE,EACfjC,EAAMzB,GAAO0D,EAAE,EACfhC,EAAM1B,GAAO0D,EAAE,EACf/B,EAAM3B,GAAO0D,EAAE,EACf9B,EAAM5B,GAAO0D,EAAE,EACf7B,EAAM7B,GAAO0D,EAAE,EACf1C,EAAMhB,GAAO0D,EAAE,EACfzC,EAAMjB,GAAO0D,EAAE,EACfxC,EAAMlB,GAAO0D,EAAE,EACfvC,EAAMnB,GAAO0D,EAAE,EACftC,EAAMpB,GAAO0D,EAAE,EACfrC,EAAMrB,GAAO0D,EAAE,EACfpC,EAAMtB,GAAO0D,EAAE,EACfjB,EAAKzC,GAAO0D,EAAE,EAGdK,GAAIhE,GAAaQ,CAAM,EAGjBkD,GAAK3B,EAAG,CAAC,EAAG2B,GAAK,GAAK,CAQ3B,IAPKA,GAAK5C,GACTyB,EAAKmB,GACLA,GAAK,IAELnB,EAAKzB,EACL4C,IAAM5C,GAEDmD,EAAI,EAAGA,EAAIN,GAAGM,IACnBnC,EAAKmC,CAAE,EAAIxB,EAAGwB,CAAC,EAAMP,GAAGlB,EAAGyB,CAAC,EAAE,CAAC,EAEhC,IAAMR,GAAK1B,EAAG,CAAC,EAAG0B,GAAK,GAAK,CAQ3B,IAPKA,GAAK3C,GACTwB,EAAKmB,GACLA,GAAK,IAELnB,EAAKxB,EACL2C,IAAM3C,GAEDmD,EAAI,EAAGA,EAAIN,GAAGM,IACnB1C,EAAK0C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM3B,EAAGE,EAAGyB,CAAC,EAAE,CAAC,EAClCpC,EAAKoC,CAAE,EAAInC,EAAImC,CAAC,EAAMR,GAAGjB,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMT,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAAK,CAQ3B,IAPKA,EAAK1C,GACTuB,EAAKmB,EACLA,EAAK,IAELnB,EAAKvB,EACL0C,GAAM1C,GAEDmD,EAAI,EAAGA,EAAIN,GAAGM,IACnB3C,EAAK2C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM5B,EAAGG,EAAGyB,CAAC,EAAE,CAAC,EAClCrC,EAAKqC,CAAE,EAAIpC,EAAIoC,CAAC,EAAMT,EAAGhB,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAKxB,EAAG,CAAC,EAAGwB,EAAK,GAAK,CAQ3B,IAPKA,EAAKzC,GACTsB,EAAKmB,EACLA,EAAK,IAELnB,EAAKtB,EACLyC,GAAMzC,GAEDmD,EAAI,EAAGA,EAAIN,GAAGM,IACnB5C,EAAK4C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM7B,EAAGI,EAAGyB,CAAC,EAAE,CAAC,EAClCtC,EAAKsC,CAAE,EAAIrC,EAAIqC,CAAC,EAAMV,EAAGf,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMX,GAAKvB,EAAG,CAAC,EAAGuB,GAAK,GAAK,CAQ3B,IAPKA,GAAKxC,GACTqB,EAAKmB,GACLA,GAAK,IAELnB,EAAKrB,EACLwC,IAAMxC,GAEDmD,EAAI,EAAGA,EAAIN,GAAGM,IACnB7C,EAAK6C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM9B,EAAGK,EAAGyB,CAAC,EAAE,CAAC,EAClCvC,EAAKuC,CAAE,EAAItC,EAAIsC,CAAC,EAAMX,GAAGd,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMZ,GAAKtB,EAAG,CAAC,EAAGsB,GAAK,GAAK,CAQ3B,IAPKA,GAAKvC,GACToB,EAAKmB,GACLA,GAAK,IAELnB,EAAKpB,EACLuC,IAAMvC,GAEDmD,EAAI,EAAGA,EAAIN,GAAGM,IACnB9C,EAAK8C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAM/B,EAAGM,EAAGyB,CAAC,EAAE,CAAC,EAClCxC,EAAKwC,CAAE,EAAIvC,EAAIuC,CAAC,EAAMZ,GAAGb,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMb,GAAKrB,EAAG,CAAC,EAAGqB,GAAK,GAAK,CAQ3B,IAPKA,GAAKtC,GACTmB,EAAKmB,GACLA,GAAK,IAELnB,EAAKnB,EACLsC,IAAMtC,GAEDmD,EAAI,EAAGA,EAAIN,GAAGM,IACnB/C,EAAK+C,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAMhC,EAAGO,EAAGyB,CAAC,EAAE,CAAC,EAClCzC,EAAKyC,CAAE,EAAIxC,EAAIwC,CAAC,EAAMb,GAAGZ,EAAGyB,CAAC,EAAE,CAAC,EAEjC,IAAMd,EAAKpB,EAAG,CAAC,EAAGoB,EAAK,GAAK,CAS3B,IARKA,EAAKrC,GACTkB,EAAKmB,EACLA,EAAK,IAELnB,EAAKlB,EACLqC,GAAMrC,GAGDmD,EAAI,EAAGA,EAAIN,GAAGM,IACnBvB,EAAIuB,CAAE,EAAIzC,EAAIyC,CAAC,EAAMd,EAAGX,EAAGyB,CAAC,EAAE,CAAC,EAC/BhD,EAAKgD,CAAE,EAAIzB,EAAGyB,CAAC,EAAE,CAAC,EAAMjC,EAAGQ,EAAGyB,CAAC,EAAE,CAAC,EAGnC,IAAMf,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IACtBxC,GAAgBK,EAAOkC,CAAG,EAC1BsB,GAAG,CAAE,EAAIrD,EAAWH,EAAO,CAAE,CAAE,EAC/BwD,GAAG,CAAE,EAAIpD,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAM2B,EAAG,CAAC,CAAE,EAAIpC,EAAK0D,GAAGnD,CAAK,EAC7BX,GAAkBwC,EAAI1B,CAAI,EAE3Bd,GAAkBwC,EAAIzB,CAAI,CAC3B,CACAf,GAAkBwC,EAAIxB,CAAI,CAC3B,CACAhB,GAAkBwC,EAAIvB,CAAI,CAC3B,CACAjB,GAAkBwC,EAAItB,CAAI,CAC3B,CACAlB,GAAkBwC,EAAIrB,CAAI,CAC3B,CACAnB,GAAkBwC,EAAIpB,CAAI,CAC3B,CACApB,GAAkBwC,EAAInB,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKA3B,GAAO,QAAUS,KC9XjB,IAAA6D,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAiBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC9F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EAaJ,IATAN,GAAIzD,EAAO,OACX2D,EAAI3D,EAAQ,CAAE,EACd4D,GAAI5D,EAAQ,CAAE,EACd6D,GAAI7D,EAAQ,CAAE,EAGd0D,EAAIpE,GAAWuE,GAAE,MAAO3D,EAAUC,EAAU0D,GAAE,OAAQ,EACtDnC,EAAKgC,EAAE,GACPtB,EAAK,CAAEsB,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,GAAGM,IACnB3B,EAAG,KAAM5C,GAAaQ,EAAO+D,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAalD,IAVAnD,EAAQhB,GAAWoE,EAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7CxB,EAAKxC,GAASG,CAAO,EAGrBQ,EAAOqD,GAAE,KAGTpD,EAAM,CAAC,EACDsD,EAAI,EAAGA,EAAIN,GAAGM,IACnBtD,EAAI,KAAM2B,EAAG2B,CAAC,EAAE,CAAC,CAAE,EAyBpB,IAtBA7C,EAAMxB,GAAO+D,EAAE,EACftC,EAAMzB,GAAO+D,EAAE,EACfrC,EAAM1B,GAAO+D,EAAE,EACfpC,EAAM3B,GAAO+D,EAAE,EACfnC,EAAM5B,GAAO+D,EAAE,EACflC,EAAM7B,GAAO+D,EAAE,EACfjC,EAAM9B,GAAO+D,EAAE,EACfhC,EAAM/B,GAAO+D,EAAE,EACf/C,EAAMhB,GAAO+D,EAAE,EACf9C,EAAMjB,GAAO+D,EAAE,EACf7C,EAAMlB,GAAO+D,EAAE,EACf5C,EAAMnB,GAAO+D,EAAE,EACf3C,EAAMpB,GAAO+D,EAAE,EACf1C,EAAMrB,GAAO+D,EAAE,EACfzC,EAAMtB,GAAO+D,EAAE,EACfxC,EAAMvB,GAAO+D,EAAE,EACfnB,EAAK5C,GAAO+D,EAAE,EAGdK,GAAIrE,GAAaQ,CAAM,EAGjBuD,GAAK9B,EAAG,CAAC,EAAG8B,GAAK,GAAK,CAQ3B,IAPKA,GAAKjD,GACT4B,EAAKqB,GACLA,GAAK,IAELrB,EAAK5B,EACLiD,IAAMjD,GAEDwD,EAAI,EAAGA,EAAIN,GAAGM,IACnBtC,EAAKsC,CAAE,EAAI1B,EAAG0B,CAAC,EAAMP,GAAGpB,EAAG2B,CAAC,EAAE,CAAC,EAEhC,IAAMR,GAAK7B,EAAG,CAAC,EAAG6B,GAAK,GAAK,CAQ3B,IAPKA,GAAKhD,GACT2B,EAAKqB,GACLA,GAAK,IAELrB,EAAK3B,EACLgD,IAAMhD,GAEDwD,EAAI,EAAGA,EAAIN,GAAGM,IACnB9C,EAAK8C,CAAE,EAAI3B,EAAG2B,CAAC,EAAE,CAAC,EAAM7B,EAAGE,EAAG2B,CAAC,EAAE,CAAC,EAClCvC,EAAKuC,CAAE,EAAItC,EAAIsC,CAAC,EAAMR,GAAGnB,EAAG2B,CAAC,EAAE,CAAC,EAEjC,IAAMT,EAAK5B,EAAG,CAAC,EAAG4B,EAAK,GAAK,CAQ3B,IAPKA,EAAK/C,GACT0B,EAAKqB,EACLA,EAAK,IAELrB,EAAK1B,EACL+C,GAAM/C,GAEDwD,EAAI,EAAGA,EAAIN,GAAGM,IACnB/C,EAAK+C,CAAE,EAAI3B,EAAG2B,CAAC,EAAE,CAAC,EAAM9B,EAAGG,EAAG2B,CAAC,EAAE,CAAC,EAClCxC,EAAKwC,CAAE,EAAIvC,EAAIuC,CAAC,EAAMT,EAAGlB,EAAG2B,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAK3B,EAAG,CAAC,EAAG2B,EAAK,GAAK,CAQ3B,IAPKA,EAAK9C,GACTyB,EAAKqB,EACLA,EAAK,IAELrB,EAAKzB,EACL8C,GAAM9C,GAEDwD,EAAI,EAAGA,EAAIN,GAAGM,IACnBhD,EAAKgD,CAAE,EAAI3B,EAAG2B,CAAC,EAAE,CAAC,EAAM/B,EAAGI,EAAG2B,CAAC,EAAE,CAAC,EAClCzC,EAAKyC,CAAE,EAAIxC,EAAIwC,CAAC,EAAMV,EAAGjB,EAAG2B,CAAC,EAAE,CAAC,EAEjC,IAAMX,GAAK1B,EAAG,CAAC,EAAG0B,GAAK,GAAK,CAQ3B,IAPKA,GAAK7C,GACTwB,EAAKqB,GACLA,GAAK,IAELrB,EAAKxB,EACL6C,IAAM7C,GAEDwD,EAAI,EAAGA,EAAIN,GAAGM,IACnBjD,EAAKiD,CAAE,EAAI3B,EAAG2B,CAAC,EAAE,CAAC,EAAMhC,EAAGK,EAAG2B,CAAC,EAAE,CAAC,EAClC1C,EAAK0C,CAAE,EAAIzC,EAAIyC,CAAC,EAAMX,GAAGhB,EAAG2B,CAAC,EAAE,CAAC,EAEjC,IAAMZ,GAAKzB,EAAG,CAAC,EAAGyB,GAAK,GAAK,CAQ3B,IAPKA,GAAK5C,GACTuB,EAAKqB,GACLA,GAAK,IAELrB,EAAKvB,EACL4C,IAAM5C,GAEDwD,EAAI,EAAGA,EAAIN,GAAGM,IACnBlD,EAAKkD,CAAE,EAAI3B,EAAG2B,CAAC,EAAE,CAAC,EAAMjC,EAAGM,EAAG2B,CAAC,EAAE,CAAC,EAClC3C,EAAK2C,CAAE,EAAI1C,EAAI0C,CAAC,EAAMZ,GAAGf,EAAG2B,CAAC,EAAE,CAAC,EAEjC,IAAMb,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GAAK,CAQ3B,IAPKA,GAAK3C,GACTsB,EAAKqB,GACLA,GAAK,IAELrB,EAAKtB,EACL2C,IAAM3C,GAEDwD,EAAI,EAAGA,EAAIN,GAAGM,IACnBnD,EAAKmD,CAAE,EAAI3B,EAAG2B,CAAC,EAAE,CAAC,EAAMlC,EAAGO,EAAG2B,CAAC,EAAE,CAAC,EAClC5C,EAAK4C,CAAE,EAAI3C,EAAI2C,CAAC,EAAMb,GAAGd,EAAG2B,CAAC,EAAE,CAAC,EAEjC,IAAMd,EAAKvB,EAAG,CAAC,EAAGuB,EAAK,GAAK,CAQ3B,IAPKA,EAAK1C,GACTqB,EAAKqB,EACLA,EAAK,IAELrB,EAAKrB,EACL0C,GAAM1C,GAEDwD,EAAI,EAAGA,EAAIN,GAAGM,IACnBpD,EAAKoD,CAAE,EAAI3B,EAAG2B,CAAC,EAAE,CAAC,EAAMnC,EAAGQ,EAAG2B,CAAC,EAAE,CAAC,EAClC7C,EAAK6C,CAAE,EAAI5C,EAAI4C,CAAC,EAAMd,EAAGb,EAAG2B,CAAC,EAAE,CAAC,EAEjC,IAAMf,EAAKtB,EAAG,CAAC,EAAGsB,EAAK,GAAK,CAS3B,IARKA,EAAKzC,GACToB,EAAKqB,EACLA,EAAK,IAELrB,EAAKpB,EACLyC,GAAMzC,GAGDwD,EAAI,EAAGA,EAAIN,GAAGM,IACnBzB,EAAIyB,CAAE,EAAI7C,EAAI6C,CAAC,EAAMf,EAAGZ,EAAG2B,CAAC,EAAE,CAAC,EAC/BrD,EAAKqD,CAAE,EAAI3B,EAAG2B,CAAC,EAAE,CAAC,EAAMpC,EAAGS,EAAG2B,CAAC,EAAE,CAAC,EAGnC,IAAMhB,GAAK,EAAGA,GAAKZ,EAAIY,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKZ,EAAIY,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKZ,EAAIY,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IACtB3C,GAAgBK,EAAOqC,CAAG,EAC1BwB,GAAG,CAAE,EAAI1D,EAAWH,EAAO,CAAE,CAAE,EAC/B6D,GAAG,CAAE,EAAIzD,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAM8B,EAAG,CAAC,CAAE,EAAIvC,EAAK+D,GAAGxD,CAAK,EAC7BX,GAAkB2C,EAAI7B,CAAI,EAE3Bd,GAAkB2C,EAAI5B,CAAI,CAC3B,CACAf,GAAkB2C,EAAI3B,CAAI,CAC3B,CACAhB,GAAkB2C,EAAI1B,CAAI,CAC3B,CACAjB,GAAkB2C,EAAIzB,CAAI,CAC3B,CACAlB,GAAkB2C,EAAIxB,CAAI,CAC3B,CACAnB,GAAkB2C,EAAIvB,CAAI,CAC3B,CACApB,GAAkB2C,EAAItB,CAAI,CAC3B,CACArB,GAAkB2C,EAAIrB,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKA5B,GAAO,QAAUS,KCrZjB,IAAAkE,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAY,QAAS,oDAAqD,EAC1EC,GAAY,QAAS,+CAAgD,EACrEC,GAAc,QAAS,iCAAkC,EACzDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAkBC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CAC/F,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,EACAC,GACAC,GACAC,GACAC,EACAC,GACAC,GACAC,GACAC,GACAC,EAaJ,IATAN,GAAI9D,EAAO,OACXgE,GAAIhE,EAAQ,CAAE,EACdiE,GAAIjE,EAAQ,CAAE,EACdkE,GAAIlE,EAAQ,CAAE,EAGd+D,EAAIzE,GAAW4E,GAAE,MAAOhE,EAAUC,EAAU+D,GAAE,OAAQ,EACtDtC,EAAKmC,EAAE,GACPxB,EAAK,CAAEwB,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAG,EAClBK,EAAI,EAAGA,EAAIN,GAAGM,IACnB7B,EAAG,KAAM/C,GAAaQ,EAAOoE,CAAC,EAAE,QAASL,EAAE,GAAI,CAAE,EAalD,IAVAxD,EAAQhB,GAAWyE,GAAE,MAAOC,GAAE,MAAOC,GAAE,KAAM,EAG7C1B,EAAK3C,GAASG,CAAO,EAGrBQ,EAAO0D,GAAE,KAGTzD,EAAM,CAAC,EACD2D,EAAI,EAAGA,EAAIN,GAAGM,IACnB3D,EAAI,KAAM8B,EAAG6B,CAAC,EAAE,CAAC,CAAE,EA2BpB,IAxBAjD,EAAMzB,GAAOoE,EAAE,EACf1C,EAAM1B,GAAOoE,EAAE,EACfzC,EAAM3B,GAAOoE,EAAE,EACfxC,EAAM5B,GAAOoE,EAAE,EACfvC,EAAM7B,GAAOoE,EAAE,EACftC,EAAM9B,GAAOoE,EAAE,EACfrC,EAAM/B,GAAOoE,EAAE,EACfpC,EAAMhC,GAAOoE,EAAE,EACfnC,EAAMjC,GAAOoE,EAAE,EACfpD,EAAMhB,GAAOoE,EAAE,EACfnD,EAAMjB,GAAOoE,EAAE,EACflD,EAAMlB,GAAOoE,EAAE,EACfjD,EAAMnB,GAAOoE,EAAE,EACfhD,EAAMpB,GAAOoE,EAAE,EACf/C,EAAMrB,GAAOoE,EAAE,EACf9C,EAAMtB,GAAOoE,EAAE,EACf7C,EAAMvB,GAAOoE,EAAE,EACf5C,EAAMxB,GAAOoE,EAAE,EACfrB,EAAK/C,GAAOoE,EAAE,EAGdK,GAAI1E,GAAaQ,CAAM,EAGjB4D,GAAKjC,EAAG,CAAC,EAAGiC,GAAK,GAAK,CAQ3B,IAPKA,GAAKtD,GACT+B,EAAKuB,GACLA,GAAK,IAELvB,EAAK/B,EACLsD,IAAMtD,GAED6D,EAAI,EAAGA,EAAIN,GAAGM,IACnBzC,EAAKyC,CAAE,EAAI5B,EAAG4B,CAAC,EAAMP,GAAGtB,EAAG6B,CAAC,EAAE,CAAC,EAEhC,IAAMR,GAAKhC,EAAG,CAAC,EAAGgC,GAAK,GAAK,CAQ3B,IAPKA,GAAKrD,GACT8B,EAAKuB,GACLA,GAAK,IAELvB,EAAK9B,EACLqD,IAAMrD,GAED6D,EAAI,EAAGA,EAAIN,GAAGM,IACnBlD,EAAKkD,CAAE,EAAI7B,EAAG6B,CAAC,EAAE,CAAC,EAAM/B,EAAGE,EAAG6B,CAAC,EAAE,CAAC,EAClC1C,EAAK0C,CAAE,EAAIzC,EAAIyC,CAAC,EAAMR,GAAGrB,EAAG6B,CAAC,EAAE,CAAC,EAEjC,IAAMT,EAAK/B,EAAG,CAAC,EAAG+B,EAAK,GAAK,CAQ3B,IAPKA,EAAKpD,GACT6B,EAAKuB,EACLA,EAAK,IAELvB,EAAK7B,EACLoD,GAAMpD,GAED6D,EAAI,EAAGA,EAAIN,GAAGM,IACnBnD,EAAKmD,CAAE,EAAI7B,EAAG6B,CAAC,EAAE,CAAC,EAAMhC,EAAGG,EAAG6B,CAAC,EAAE,CAAC,EAClC3C,EAAK2C,CAAE,EAAI1C,EAAI0C,CAAC,EAAMT,EAAGpB,EAAG6B,CAAC,EAAE,CAAC,EAEjC,IAAMV,EAAK9B,EAAG,CAAC,EAAG8B,EAAK,GAAK,CAQ3B,IAPKA,EAAKnD,GACT4B,EAAKuB,EACLA,EAAK,IAELvB,EAAK5B,EACLmD,GAAMnD,GAED6D,EAAI,EAAGA,EAAIN,GAAGM,IACnBpD,EAAKoD,CAAE,EAAI7B,EAAG6B,CAAC,EAAE,CAAC,EAAMjC,EAAGI,EAAG6B,CAAC,EAAE,CAAC,EAClC5C,EAAK4C,CAAE,EAAI3C,EAAI2C,CAAC,EAAMV,EAAGnB,EAAG6B,CAAC,EAAE,CAAC,EAEjC,IAAMX,GAAK7B,EAAG,CAAC,EAAG6B,GAAK,GAAK,CAQ3B,IAPKA,GAAKlD,GACT2B,EAAKuB,GACLA,GAAK,IAELvB,EAAK3B,EACLkD,IAAMlD,GAED6D,EAAI,EAAGA,EAAIN,GAAGM,IACnBrD,EAAKqD,CAAE,EAAI7B,EAAG6B,CAAC,EAAE,CAAC,EAAMlC,EAAGK,EAAG6B,CAAC,EAAE,CAAC,EAClC7C,EAAK6C,CAAE,EAAI5C,EAAI4C,CAAC,EAAMX,GAAGlB,EAAG6B,CAAC,EAAE,CAAC,EAEjC,IAAMZ,GAAK5B,EAAG,CAAC,EAAG4B,GAAK,GAAK,CAQ3B,IAPKA,GAAKjD,GACT0B,EAAKuB,GACLA,GAAK,IAELvB,EAAK1B,EACLiD,IAAMjD,GAED6D,EAAI,EAAGA,EAAIN,GAAGM,IACnBtD,EAAKsD,CAAE,EAAI7B,EAAG6B,CAAC,EAAE,CAAC,EAAMnC,EAAGM,EAAG6B,CAAC,EAAE,CAAC,EAClC9C,EAAK8C,CAAE,EAAI7C,EAAI6C,CAAC,EAAMZ,GAAGjB,EAAG6B,CAAC,EAAE,CAAC,EAEjC,IAAMb,GAAK3B,EAAG,CAAC,EAAG2B,GAAK,GAAK,CAQ3B,IAPKA,GAAKhD,GACTyB,EAAKuB,GACLA,GAAK,IAELvB,EAAKzB,EACLgD,IAAMhD,GAED6D,EAAI,EAAGA,EAAIN,GAAGM,IACnBvD,EAAKuD,CAAE,EAAI7B,EAAG6B,CAAC,EAAE,CAAC,EAAMpC,EAAGO,EAAG6B,CAAC,EAAE,CAAC,EAClC/C,EAAK+C,CAAE,EAAI9C,EAAI8C,CAAC,EAAMb,GAAGhB,EAAG6B,CAAC,EAAE,CAAC,EAEjC,IAAMd,EAAK1B,EAAG,CAAC,EAAG0B,EAAK,GAAK,CAQ3B,IAPKA,EAAK/C,GACTwB,EAAKuB,EACLA,EAAK,IAELvB,EAAKxB,EACL+C,GAAM/C,GAED6D,EAAI,EAAGA,EAAIN,GAAGM,IACnBxD,EAAKwD,CAAE,EAAI7B,EAAG6B,CAAC,EAAE,CAAC,EAAMrC,EAAGQ,EAAG6B,CAAC,EAAE,CAAC,EAClChD,EAAKgD,CAAE,EAAI/C,EAAI+C,CAAC,EAAMd,EAAGf,EAAG6B,CAAC,EAAE,CAAC,EAEjC,IAAMf,EAAKzB,EAAG,CAAC,EAAGyB,EAAK,GAAK,CAQ3B,IAPKA,EAAK9C,GACTuB,EAAKuB,EACLA,EAAK,IAELvB,EAAKvB,EACL8C,GAAM9C,GAED6D,EAAI,EAAGA,EAAIN,GAAGM,IACnBzD,EAAKyD,CAAE,EAAI7B,EAAG6B,CAAC,EAAE,CAAC,EAAMtC,EAAGS,EAAG6B,CAAC,EAAE,CAAC,EAClCjD,EAAKiD,CAAE,EAAIhD,EAAIgD,CAAC,EAAMf,EAAGd,EAAG6B,CAAC,EAAE,CAAC,EAEjC,IAAMhB,GAAKxB,EAAG,CAAC,EAAGwB,GAAK,GAAK,CAS3B,IARKA,GAAK7C,GACTsB,EAAKuB,GACLA,GAAK,IAELvB,EAAKtB,EACL6C,IAAM7C,GAGD6D,EAAI,EAAGA,EAAIN,GAAGM,IACnB3B,EAAI2B,CAAE,EAAIjD,EAAIiD,CAAC,EAAMhB,GAAGb,EAAG6B,CAAC,EAAE,CAAC,EAC/B1D,EAAK0D,CAAE,EAAI7B,EAAG6B,CAAC,EAAE,CAAC,EAAMvC,EAAGU,EAAG6B,CAAC,EAAE,CAAC,EAGnC,IAAMjB,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,GAAK,EAAGA,GAAKb,EAAIa,KAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKb,EAAIa,IACtB9C,GAAgBK,EAAOwC,CAAG,EAC1B0B,GAAG,CAAE,EAAI/D,EAAWH,EAAO,CAAE,CAAE,EAC/BkE,GAAG,CAAE,EAAI9D,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAMiC,EAAG,CAAC,CAAE,EAAI1C,EAAKoE,GAAG7D,CAAK,EAC7BX,GAAkB8C,EAAIhC,CAAI,EAE3Bd,GAAkB8C,EAAI/B,CAAI,CAC3B,CACAf,GAAkB8C,EAAI9B,CAAI,CAC3B,CACAhB,GAAkB8C,EAAI7B,CAAI,CAC3B,CACAjB,GAAkB8C,EAAI5B,CAAI,CAC3B,CACAlB,GAAkB8C,EAAI3B,CAAI,CAC3B,CACAnB,GAAkB8C,EAAI1B,CAAI,CAC3B,CACApB,GAAkB8C,EAAIzB,CAAI,CAC3B,CACArB,GAAkB8C,EAAIxB,CAAI,CAC3B,CACAtB,GAAkB8C,EAAIvB,CAAI,CAC3B,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CACD,CAKA7B,GAAO,QAAUS,KC5ajB,IAAAuE,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,4BAA6B,EA2FpD,SAASC,GAAUC,EAAKC,EAAQC,EAAWC,EAAWC,EAAO,CAC5D,IAAIC,EAAIJ,EAAQ,CAAE,EAClBA,EAAQ,CAAE,EAAIC,EAAWD,EAAQ,CAAE,CAAE,EACrCA,EAAQ,CAAE,EAAIE,EAAWF,EAAQ,CAAE,CAAE,EACrCI,EAAE,UAAW,CAAE,EAAGA,EAAE,KAAMA,EAAE,OAAQL,EAAKF,GAASG,EAAQ,CAAE,EAAGG,CAAK,CAAE,CACvE,CAKAP,GAAO,QAAUE,KC3HjB,IAAAO,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAmHd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CACvF,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAcJ,IATAF,EAAId,EAAQ,CAAE,EACdU,EAAKI,EAAE,MAGPH,EAAKD,EAAI,CAAE,EACXD,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACMa,EAAI,EAAGA,EAAIhB,EAAO,OAAQgB,IAC/BP,EAAI,KAAMT,EAAOgB,CAAC,EAAE,QAAQ,CAAC,CAAE,EAehC,IAZAJ,EAAKf,GAASG,CAAO,EAGrBe,EAAIrB,GAAaO,CAAM,EAGvBM,EAAOO,EAAE,KAGTN,EAAMM,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKF,EAAIE,IACtBjB,GAAgBK,EAAOW,CAAG,EAC1BG,EAAG,CAAE,EAAIX,EAAWH,EAAO,CAAE,CAAE,EAC/Bc,EAAG,CAAE,EAAIV,EAAWJ,EAAO,CAAE,CAAE,EAC/BO,EAAKD,EAAMK,EAAG,CAAC,EAAGb,EAAKgB,EAAGT,CAAK,CAAE,EACjCX,GAAkBiB,EAAIH,CAAI,CAE5B,CAKAhB,GAAO,QAAUK,KClMjB,IAAAmB,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAoHd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAInB,EAAQ,CAAE,EACdY,EAAKO,EAAE,MAGFf,EAYJ,IAVAS,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMU,EAAGV,EAAS,CAAC,CAC9B,EACMkB,EAAI,EAAGA,EAAIrB,EAAO,OAAQqB,IAC/BN,EAAKf,EAAQqB,CAAE,EAAE,QACjBX,EAAI,KAAMK,EAAG,CAAC,CAAE,EAChBJ,EAAI,KAAMI,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAchC,KAVAF,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMU,EAAGV,EAAS,CAAC,CAC9B,EACMkB,EAAI,EAAGA,EAAIrB,EAAO,OAAQqB,IAC/BN,EAAKf,EAAQqB,CAAE,EAAE,QACjBX,EAAI,KAAMK,EAAG,CAAC,CAAE,EAChBJ,EAAI,KAAMI,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAgBjC,IAZAC,EAAKnB,GAASG,CAAO,EAGrBoB,EAAI1B,GAAaO,CAAM,EAGvBO,EAAOW,EAAE,KAGTV,EAAMU,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKJ,EAAII,IACtBrB,GAAgBK,EAAOe,CAAG,EAC1BI,EAAG,CAAE,EAAIf,EAAWJ,EAAO,CAAE,CAAE,EAC/BmB,EAAG,CAAE,EAAId,EAAWL,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMQ,EAAI,CAAE,EAAGjB,EAAKqB,EAAGb,CAAK,CAAE,EACnCZ,GAAkBqB,EAAIN,CAAI,EAE3Bf,GAAkBqB,EAAIL,CAAI,CAC3B,CACD,CAKAlB,GAAO,QAAUK,KCrOjB,IAAAwB,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAoHd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAItB,EAAQ,CAAE,EACda,EAAKS,EAAE,MAGFlB,EAiBJ,IAfAU,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,CAC9B,EACMqB,EAAI,EAAGA,EAAIxB,EAAO,OAAQwB,IAC/BP,EAAKjB,EAAQwB,CAAE,EAAE,QACjBd,EAAI,KAAMO,EAAG,CAAC,CAAE,EAChBN,EAAI,KAAMM,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BL,EAAI,KAAMK,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAmBhC,KAfAH,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,CAC9B,EACMqB,EAAI,EAAGA,EAAIxB,EAAO,OAAQwB,IAC/BP,EAAKjB,EAAQwB,CAAE,EAAE,QACjBd,EAAI,KAAMO,EAAG,CAAC,CAAE,EAChBN,EAAI,KAAMM,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BL,EAAI,KAAMK,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAgBjC,IAZAC,EAAKrB,GAASG,CAAO,EAGrBuB,EAAI7B,GAAaO,CAAM,EAGvBO,EAAOc,EAAE,KAGTb,EAAMa,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IACtBvB,GAAgBK,EAAOiB,CAAG,EAC1BK,EAAG,CAAE,EAAIlB,EAAWJ,EAAO,CAAE,CAAE,EAC/BsB,EAAG,CAAE,EAAIjB,EAAWL,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMU,EAAI,CAAE,EAAGnB,EAAKwB,EAAGhB,CAAK,CAAE,EACnCZ,GAAkBuB,EAAIR,CAAI,EAE3Bf,GAAkBuB,EAAIP,CAAI,CAC3B,CACAhB,GAAkBuB,EAAIN,CAAI,CAC3B,CACD,CAKAnB,GAAO,QAAUK,KCvPjB,IAAA2B,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAoHd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAIzB,EAAQ,CAAE,EACdc,EAAKW,EAAE,MAGFrB,EAsBJ,IApBAW,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACMwB,EAAI,EAAGA,EAAI3B,EAAO,OAAQ2B,IAC/BR,EAAKnB,EAAQ2B,CAAE,EAAE,QACjBjB,EAAI,KAAMS,EAAG,CAAC,CAAE,EAChBR,EAAI,KAAMQ,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BP,EAAI,KAAMO,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BN,EAAI,KAAMM,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAwBhC,KApBAJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACMwB,EAAI,EAAGA,EAAI3B,EAAO,OAAQ2B,IAC/BR,EAAKnB,EAAQ2B,CAAE,EAAE,QACjBjB,EAAI,KAAMS,EAAG,CAAC,CAAE,EAChBR,EAAI,KAAMQ,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BP,EAAI,KAAMO,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BN,EAAI,KAAMM,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAgBjC,IAZAC,EAAKvB,GAASG,CAAO,EAGrB0B,EAAIhC,GAAaO,CAAM,EAGvBO,EAAOiB,EAAE,KAGThB,EAAMgB,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IACtBzB,GAAgBK,EAAOmB,CAAG,EAC1BM,EAAG,CAAE,EAAIrB,EAAWJ,EAAO,CAAE,CAAE,EAC/ByB,EAAG,CAAE,EAAIpB,EAAWL,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMY,EAAI,CAAE,EAAGrB,EAAK2B,EAAGnB,CAAK,CAAE,EACnCZ,GAAkByB,EAAIV,CAAI,EAE3Bf,GAAkByB,EAAIT,CAAI,CAC3B,CACAhB,GAAkByB,EAAIR,CAAI,CAC3B,CACAjB,GAAkByB,EAAIP,CAAI,CAC3B,CACD,CAKApB,GAAO,QAAUK,KCzQjB,IAAA8B,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAoHd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAI5B,EAAQ,CAAE,EACde,EAAKa,EAAE,MAGFxB,EA2BJ,IAzBAY,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACM2B,EAAI,EAAGA,EAAI9B,EAAO,OAAQ8B,IAC/BT,EAAKrB,EAAQ8B,CAAE,EAAE,QACjBpB,EAAI,KAAMW,EAAG,CAAC,CAAE,EAChBV,EAAI,KAAMU,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BR,EAAI,KAAMQ,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BP,EAAI,KAAMO,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MA6BhC,KAzBAL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACM2B,EAAI,EAAGA,EAAI9B,EAAO,OAAQ8B,IAC/BT,EAAKrB,EAAQ8B,CAAE,EAAE,QACjBpB,EAAI,KAAMW,EAAG,CAAC,CAAE,EAChBV,EAAI,KAAMU,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BR,EAAI,KAAMQ,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BP,EAAI,KAAMO,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAgBjC,IAZAC,EAAKzB,GAASG,CAAO,EAGrB6B,EAAInC,GAAaO,CAAM,EAGvBO,EAAOoB,EAAE,KAGTnB,EAAMmB,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IACtB3B,GAAgBK,EAAOqB,CAAG,EAC1BO,EAAG,CAAE,EAAIxB,EAAWJ,EAAO,CAAE,CAAE,EAC/B4B,EAAG,CAAE,EAAIvB,EAAWL,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMc,EAAI,CAAE,EAAGvB,EAAK8B,EAAGtB,CAAK,CAAE,EACnCZ,GAAkB2B,EAAIZ,CAAI,EAE3Bf,GAAkB2B,EAAIX,CAAI,CAC3B,CACAhB,GAAkB2B,EAAIV,CAAI,CAC3B,CACAjB,GAAkB2B,EAAIT,CAAI,CAC3B,CACAlB,GAAkB2B,EAAIR,CAAI,CAC3B,CACD,CAKArB,GAAO,QAAUK,KC3RjB,IAAAiC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAoHd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAI/B,EAAQ,CAAE,EACdgB,EAAKe,EAAE,MAGF3B,EAgCJ,IA9BAa,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACM8B,EAAI,EAAGA,EAAIjC,EAAO,OAAQiC,IAC/BV,EAAKvB,EAAQiC,CAAE,EAAE,QACjBvB,EAAI,KAAMa,EAAG,CAAC,CAAE,EAChBZ,EAAI,KAAMY,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BR,EAAI,KAAMQ,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAkChC,KA9BAN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACM8B,EAAI,EAAGA,EAAIjC,EAAO,OAAQiC,IAC/BV,EAAKvB,EAAQiC,CAAE,EAAE,QACjBvB,EAAI,KAAMa,EAAG,CAAC,CAAE,EAChBZ,EAAI,KAAMY,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BR,EAAI,KAAMQ,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAgBjC,IAZAC,EAAK3B,GAASG,CAAO,EAGrBgC,EAAItC,GAAaO,CAAM,EAGvBO,EAAOuB,EAAE,KAGTtB,EAAMsB,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IACtB7B,GAAgBK,EAAOuB,CAAG,EAC1BQ,EAAG,CAAE,EAAI3B,EAAWJ,EAAO,CAAE,CAAE,EAC/B+B,EAAG,CAAE,EAAI1B,EAAWL,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMgB,EAAI,CAAE,EAAGzB,EAAKiC,EAAGzB,CAAK,CAAE,EACnCZ,GAAkB6B,EAAId,CAAI,EAE3Bf,GAAkB6B,EAAIb,CAAI,CAC3B,CACAhB,GAAkB6B,EAAIZ,CAAI,CAC3B,CACAjB,GAAkB6B,EAAIX,CAAI,CAC3B,CACAlB,GAAkB6B,EAAIV,CAAI,CAC3B,CACAnB,GAAkB6B,EAAIT,CAAI,CAC3B,CACD,CAKAtB,GAAO,QAAUK,KC7SjB,IAAAoC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAoHd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAIlC,EAAQ,CAAE,EACdiB,EAAKiB,EAAE,MAGF9B,EAqCJ,IAnCAc,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACMiC,EAAI,EAAGA,EAAIpC,EAAO,OAAQoC,IAC/BX,EAAKzB,EAAQoC,CAAE,EAAE,QACjB1B,EAAI,KAAMe,EAAG,CAAC,CAAE,EAChBd,EAAI,KAAMc,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAuChC,KAnCAP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACMiC,EAAI,EAAGA,EAAIpC,EAAO,OAAQoC,IAC/BX,EAAKzB,EAAQoC,CAAE,EAAE,QACjB1B,EAAI,KAAMe,EAAG,CAAC,CAAE,EAChBd,EAAI,KAAMc,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAgBjC,IAZAC,EAAK7B,GAASG,CAAO,EAGrBmC,EAAIzC,GAAaO,CAAM,EAGvBO,EAAO0B,EAAE,KAGTzB,EAAMyB,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IACtB/B,GAAgBK,EAAOyB,CAAG,EAC1BS,EAAG,CAAE,EAAI9B,EAAWJ,EAAO,CAAE,CAAE,EAC/BkC,EAAG,CAAE,EAAI7B,EAAWL,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMkB,EAAI,CAAE,EAAG3B,EAAKoC,EAAG5B,CAAK,CAAE,EACnCZ,GAAkB+B,EAAIhB,CAAI,EAE3Bf,GAAkB+B,EAAIf,CAAI,CAC3B,CACAhB,GAAkB+B,EAAId,CAAI,CAC3B,CACAjB,GAAkB+B,EAAIb,CAAI,CAC3B,CACAlB,GAAkB+B,EAAIZ,CAAI,CAC3B,CACAnB,GAAkB+B,EAAIX,CAAI,CAC3B,CACApB,GAAkB+B,EAAIV,CAAI,CAC3B,CACD,CAKAvB,GAAO,QAAUK,KC/TjB,IAAAuC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAoHd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAIrC,EAAQ,CAAE,EACdkB,EAAKmB,EAAE,MAGFjC,EA0CJ,IAxCAe,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACMoC,EAAI,EAAGA,EAAIvC,EAAO,OAAQuC,IAC/BZ,EAAK3B,EAAQuC,CAAE,EAAE,QACjB7B,EAAI,KAAMiB,EAAG,CAAC,CAAE,EAChBhB,EAAI,KAAMgB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MA4ChC,KAxCAR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACMoC,EAAI,EAAGA,EAAIvC,EAAO,OAAQuC,IAC/BZ,EAAK3B,EAAQuC,CAAE,EAAE,QACjB7B,EAAI,KAAMiB,EAAG,CAAC,CAAE,EAChBhB,EAAI,KAAMgB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAgBjC,IAZAC,EAAK/B,GAASG,CAAO,EAGrBsC,EAAI5C,GAAaO,CAAM,EAGvBO,EAAO6B,EAAE,KAGT5B,EAAM4B,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IACtBjC,GAAgBK,EAAO2B,CAAG,EAC1BU,EAAG,CAAE,EAAIjC,EAAWJ,EAAO,CAAE,CAAE,EAC/BqC,EAAG,CAAE,EAAIhC,EAAWL,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMoB,EAAI,CAAE,EAAG7B,EAAKuC,EAAG/B,CAAK,CAAE,EACnCZ,GAAkBiC,EAAIlB,CAAI,EAE3Bf,GAAkBiC,EAAIjB,CAAI,CAC3B,CACAhB,GAAkBiC,EAAIhB,CAAI,CAC3B,CACAjB,GAAkBiC,EAAIf,CAAI,CAC3B,CACAlB,GAAkBiC,EAAId,CAAI,CAC3B,CACAnB,GAAkBiC,EAAIb,CAAI,CAC3B,CACApB,GAAkBiC,EAAIZ,CAAI,CAC3B,CACArB,GAAkBiC,EAAIX,CAAI,CAC3B,CACD,CAKAxB,GAAO,QAAUK,KCjVjB,IAAA0C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAoHd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAIxC,EAAQ,CAAE,EACdmB,EAAKqB,EAAE,MAGFpC,EA+CJ,IA7CAgB,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,CAC9B,EACAe,EAAM,CACLhB,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,CAC9B,EACMuC,EAAI,EAAGA,EAAI1C,EAAO,OAAQ0C,IAC/Bb,EAAK7B,EAAQ0C,CAAE,EAAE,QACjBhC,EAAI,KAAMmB,EAAG,CAAC,CAAE,EAChBlB,EAAI,KAAMkB,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,CAAI,EAC/BjB,EAAI,KAAMiB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/BhB,EAAI,KAAMgB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAiDhC,KA7CAT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,CAC9B,EACAe,EAAM,CACLhB,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,CAC9B,EACMuC,EAAI,EAAGA,EAAI1C,EAAO,OAAQ0C,IAC/Bb,EAAK7B,EAAQ0C,CAAE,EAAE,QACjBhC,EAAI,KAAMmB,EAAG,CAAC,CAAE,EAChBlB,EAAI,KAAMkB,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,CAAI,EAC/BjB,EAAI,KAAMiB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/BhB,EAAI,KAAMgB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAgBjC,IAZAC,EAAKjC,GAASG,CAAO,EAGrByC,EAAI/C,GAAaO,CAAM,EAGvBO,EAAOgC,EAAE,KAGT/B,EAAM+B,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IACtBnC,GAAgBK,EAAO6B,CAAG,EAC1BW,EAAG,CAAE,EAAIpC,EAAWJ,EAAO,CAAE,CAAE,EAC/BwC,EAAG,CAAE,EAAInC,EAAWL,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMsB,EAAI,CAAE,EAAG/B,EAAK0C,EAAGlC,CAAK,CAAE,EACnCZ,GAAkBmC,EAAIpB,CAAI,EAE3Bf,GAAkBmC,EAAInB,CAAI,CAC3B,CACAhB,GAAkBmC,EAAIlB,CAAI,CAC3B,CACAjB,GAAkBmC,EAAIjB,CAAI,CAC3B,CACAlB,GAAkBmC,EAAIhB,CAAI,CAC3B,CACAnB,GAAkBmC,EAAIf,CAAI,CAC3B,CACApB,GAAkBmC,EAAId,CAAI,CAC3B,CACArB,GAAkBmC,EAAIb,CAAI,CAC3B,CACAtB,GAAkBmC,EAAIZ,CAAI,CAC3B,CACD,CAKAzB,GAAO,QAAUK,KCnWjB,IAAA6C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KAoHd,SAASC,GAAWC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACpG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GASJ,GAJAF,EAAI3C,EAAQ,CAAE,EACdoB,EAAKuB,EAAE,MAGFvC,EAoDJ,IAlDAiB,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,CAC9B,EACAe,EAAM,CACLhB,EAAS,CAAC,EAAM0B,EAAG1B,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,CAC9B,EACAgB,EAAM,CACLjB,EAAS,CAAC,EAAM2B,EAAG3B,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAM0B,EAAG1B,EAAS,CAAC,CAC9B,EACM0C,GAAI,EAAGA,GAAI7C,EAAO,OAAQ6C,KAC/Bd,EAAK/B,EAAQ6C,EAAE,EAAE,QACjBnC,EAAI,KAAMqB,EAAG,CAAC,CAAE,EAChBpB,EAAI,KAAMoB,EAAG,CAAC,EAAMV,EAAGU,EAAG,CAAC,CAAI,EAC/BnB,EAAI,KAAMmB,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,CAAI,EAC/BlB,EAAI,KAAMkB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/BjB,EAAI,KAAMiB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/BhB,EAAI,KAAMgB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAsDhC,KAlDAV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAM,CACLR,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,CAC9B,EACAe,EAAM,CACLhB,EAAS,CAAC,EAAM0B,EAAG1B,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,CAC9B,EACAgB,EAAM,CACLjB,EAAS,CAAC,EAAM2B,EAAG3B,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAM0B,EAAG1B,EAAS,CAAC,CAC9B,EACM0C,GAAI,EAAGA,GAAI7C,EAAO,OAAQ6C,KAC/Bd,EAAK/B,EAAQ6C,EAAE,EAAE,QACjBnC,EAAI,KAAMqB,EAAG,CAAC,CAAE,EAChBpB,EAAI,KAAMoB,EAAG,CAAC,EAAMV,EAAGU,EAAG,CAAC,CAAI,EAC/BnB,EAAI,KAAMmB,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,CAAI,EAC/BlB,EAAI,KAAMkB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/BjB,EAAI,KAAMiB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/BhB,EAAI,KAAMgB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAgBjC,IAZAC,EAAKnC,GAASG,CAAO,EAGrB4C,EAAIlD,GAAaO,CAAM,EAGvBO,EAAOmC,EAAE,KAGTlC,EAAMkC,EAAE,UAAW,CAAE,EAGfD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IACtBrC,GAAgBK,EAAO+B,CAAG,EAC1BY,EAAG,CAAE,EAAIvC,EAAWJ,EAAO,CAAE,CAAE,EAC/B2C,EAAG,CAAE,EAAItC,EAAWL,EAAO,CAAE,CAAE,EAC/BQ,EAAKD,EAAMwB,EAAI,CAAE,EAAGjC,EAAK6C,EAAGrC,CAAK,CAAE,EACnCZ,GAAkBqC,EAAItB,CAAI,EAE3Bf,GAAkBqC,EAAIrB,CAAI,CAC3B,CACAhB,GAAkBqC,EAAIpB,CAAI,CAC3B,CACAjB,GAAkBqC,EAAInB,CAAI,CAC3B,CACAlB,GAAkBqC,EAAIlB,CAAI,CAC3B,CACAnB,GAAkBqC,EAAIjB,CAAI,CAC3B,CACApB,GAAkBqC,EAAIhB,CAAI,CAC3B,CACArB,GAAkBqC,EAAIf,CAAI,CAC3B,CACAtB,GAAkBqC,EAAId,CAAI,CAC3B,CACAvB,GAAkBqC,EAAIb,CAAI,CAC3B,CACD,CAKA1B,GAAO,QAAUK,KCrXjB,IAAAgD,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAY,QAAS,gCAAiC,EACtDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAiB,KACjBC,GAAU,KAKVC,GAAO,QAiHX,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAWC,EAAWC,EAAO,CACnE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAyBJ,IAvBAJ,EAAIZ,EAAO,OAGXa,EAAIb,EAAQ,CAAE,EACdS,EAAKI,EAAE,MAGPP,EAAMf,GAAOkB,CAAG,EAGhBC,EAAKd,GAASI,CAAO,EAGrBc,EAAIrB,GAAaQ,CAAM,EAGvBI,EAAOQ,EAAE,KAGTL,EAAMK,EAAE,UAAW,CAAE,EAGrBF,EAAKjB,GAAOkB,CAAE,EACRG,EAAI,EAAGA,EAAIT,EAAKS,IAAM,CAC3B,IAAMC,EAAI,EAAGA,EAAIJ,EAAGI,IACnBT,EAAMP,EAAQgB,CAAE,EAChBL,EAAIK,CAAE,EAAIxB,GAAWiB,EAAIF,EAAI,QAASG,EAAIM,CAAE,EAAGT,EAAI,MAAOQ,EAAGlB,EAAK,EAEnEF,GAAgBM,EAAOU,CAAG,EAC1BG,EAAG,CAAE,EAAIZ,EAAWD,EAAO,CAAE,CAAE,EAC/Ba,EAAG,CAAE,EAAIX,EAAWF,EAAO,CAAE,CAAE,EAC/BO,EAAKH,EAAMM,EAAG,CAAC,EAAGZ,EAAKe,EAAGV,CAAK,CAAE,CAClC,CACD,CAKAd,GAAO,QAAUQ,KCrMjB,IAAAmB,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAU,QAAS,4BAA6B,EAsFpD,SAASC,GAAUC,EAAKC,EAAQC,EAAWC,EAAWC,EAAO,CAC5DH,EAAQ,CAAE,EAAIC,EAAWD,EAAQ,CAAE,CAAE,EACrCA,EAAQ,CAAE,EAAIE,EAAWF,EAAQ,CAAE,CAAE,EACrCA,EAAQ,CAAE,EAAE,KAAMA,EAAQ,CAAE,EAAE,MAAO,EAAID,EAAKF,GAASG,EAAQ,CAAE,EAAGG,CAAK,CAC1E,CAKAP,GAAO,QAAUE,KCrHjB,IAAAM,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA8Gd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAWC,EAAWC,EAAO,CACvF,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAcJ,IATAF,EAAIb,EAAQ,CAAE,EACdS,EAAKI,EAAE,MAGPH,EAAKD,EAAI,CAAE,EACXD,EAAM,CACLN,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACMY,EAAI,EAAGA,EAAIf,EAAO,OAAQe,IAC/BP,EAAI,KAAMR,EAAOe,CAAC,EAAE,QAAQ,CAAC,CAAE,EAYhC,IATAJ,EAAKd,GAASG,CAAO,EAGrBc,EAAIpB,GAAaO,CAAM,EAGvBM,EAAOM,EAAE,KAGHD,EAAK,EAAGA,EAAKF,EAAIE,IACtBhB,GAAgBK,EAAOU,CAAG,EAC1BG,EAAG,CAAE,EAAIV,EAAWH,EAAO,CAAE,CAAE,EAC/Ba,EAAG,CAAE,EAAIT,EAAWJ,EAAO,CAAE,CAAE,EAC/BM,EAAMI,EAAG,CAAC,CAAE,EAAIZ,EAAKe,EAAGR,CAAK,EAC7BX,GAAkBgB,EAAIH,CAAI,CAE5B,CAKAf,GAAO,QAAUK,KCzLjB,IAAAkB,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA+Gd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAIlB,EAAQ,CAAE,EACdW,EAAKO,EAAE,MAGFd,EAYJ,IAVAQ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMU,EAAGV,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMS,EAAGT,EAAS,CAAC,CAC9B,EACMiB,EAAI,EAAGA,EAAIpB,EAAO,OAAQoB,IAC/BN,EAAKd,EAAQoB,CAAE,EAAE,QACjBX,EAAI,KAAMK,EAAG,CAAC,CAAE,EAChBJ,EAAI,KAAMI,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAchC,KAVAF,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXF,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMU,EAAGV,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMS,EAAGT,EAAS,CAAC,CAC9B,EACMiB,EAAI,EAAGA,EAAIpB,EAAO,OAAQoB,IAC/BN,EAAKd,EAAQoB,CAAE,EAAE,QACjBX,EAAI,KAAMK,EAAG,CAAC,CAAE,EAChBJ,EAAI,KAAMI,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAajC,IATAC,EAAKlB,GAASG,CAAO,EAGrBmB,EAAIzB,GAAaO,CAAM,EAGvBO,EAAOU,EAAE,KAGHD,EAAK,EAAGA,EAAKJ,EAAII,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKJ,EAAII,IACtBpB,GAAgBK,EAAOc,CAAG,EAC1BI,EAAG,CAAE,EAAId,EAAWJ,EAAO,CAAE,CAAE,EAC/BkB,EAAG,CAAE,EAAIb,EAAWL,EAAO,CAAE,CAAE,EAC/BO,EAAMO,EAAG,CAAC,CAAE,EAAIhB,EAAKoB,EAAGZ,CAAK,EAC7BZ,GAAkBoB,EAAIN,CAAI,EAE3Bd,GAAkBoB,EAAIL,CAAI,CAC3B,CACD,CAKAjB,GAAO,QAAUK,KC5NjB,IAAAuB,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA+Gd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAIrB,EAAQ,CAAE,EACdY,EAAKS,EAAE,MAGFjB,EAiBJ,IAfAS,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMU,EAAGV,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,CAC9B,EACMoB,EAAI,EAAGA,EAAIvB,EAAO,OAAQuB,IAC/BP,EAAKhB,EAAQuB,CAAE,EAAE,QACjBd,EAAI,KAAMO,EAAG,CAAC,CAAE,EAChBN,EAAI,KAAMM,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BL,EAAI,KAAMK,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAmBhC,KAfAH,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXH,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMU,EAAGV,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,CAC9B,EACMoB,EAAI,EAAGA,EAAIvB,EAAO,OAAQuB,IAC/BP,EAAKhB,EAAQuB,CAAE,EAAE,QACjBd,EAAI,KAAMO,EAAG,CAAC,CAAE,EAChBN,EAAI,KAAMM,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BL,EAAI,KAAMK,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAajC,IATAC,EAAKpB,GAASG,CAAO,EAGrBsB,EAAI5B,GAAaO,CAAM,EAGvBO,EAAOa,EAAE,KAGHD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKL,EAAIK,IACtBtB,GAAgBK,EAAOgB,CAAG,EAC1BK,EAAG,CAAE,EAAIjB,EAAWJ,EAAO,CAAE,CAAE,EAC/BqB,EAAG,CAAE,EAAIhB,EAAWL,EAAO,CAAE,CAAE,EAC/BO,EAAMS,EAAG,CAAC,CAAE,EAAIlB,EAAKuB,EAAGf,CAAK,EAC7BZ,GAAkBsB,EAAIR,CAAI,EAE3Bd,GAAkBsB,EAAIP,CAAI,CAC3B,CACAf,GAAkBsB,EAAIN,CAAI,CAC3B,CACD,CAKAlB,GAAO,QAAUK,KC9OjB,IAAA0B,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA+Gd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA,EACAC,EACAC,EASJ,GAJA,EAAIzB,EAAQ,CAAE,EACda,EAAK,EAAE,MAGFT,EAsBJ,IApBAU,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACMsB,EAAI,EAAGA,EAAIzB,EAAO,OAAQyB,IAC/BP,EAAKlB,EAAQyB,CAAE,EAAE,QACjBhB,EAAI,KAAMS,EAAG,CAAC,CAAE,EAChBR,EAAI,KAAMQ,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BP,EAAI,KAAMO,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BN,EAAI,KAAMM,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAG,MAwB/B,KApBAJ,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXJ,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMW,EAAGX,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACMsB,EAAI,EAAGA,EAAIzB,EAAO,OAAQyB,IAC/BP,EAAKlB,EAAQyB,CAAE,EAAE,QACjBhB,EAAI,KAAMS,EAAG,CAAC,CAAE,EAChBR,EAAI,KAAMQ,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BP,EAAI,KAAMO,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BN,EAAI,KAAMM,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAajC,IATAC,EAAKtB,GAASG,CAAO,EAGrBwB,EAAI9B,GAAaO,CAAM,EAGvBO,EAAO,EAAE,KAGHe,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKN,EAAIM,IACtBxB,GAAgBK,EAAOkB,CAAG,EAC1BK,EAAG,CAAE,EAAInB,EAAWJ,EAAO,CAAE,CAAE,EAC/BuB,EAAG,CAAE,EAAIlB,EAAWL,EAAO,CAAE,CAAE,EAC/BO,EAAMW,EAAG,CAAC,CAAE,EAAIpB,EAAKyB,EAAGjB,CAAK,EAC7BZ,GAAkBwB,EAAIV,CAAI,EAE3Bd,GAAkBwB,EAAIT,CAAI,CAC3B,CACAf,GAAkBwB,EAAIR,CAAI,CAC3B,CACAhB,GAAkBwB,EAAIP,CAAI,CAC3B,CACD,CAKAnB,GAAO,QAAUK,KChQjB,IAAA4B,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA+Gd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAI3B,EAAQ,CAAE,EACdc,EAAKa,EAAE,MAGFvB,EA2BJ,IAzBAW,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACM0B,EAAI,EAAGA,EAAI7B,EAAO,OAAQ6B,IAC/BT,EAAKpB,EAAQ6B,CAAE,EAAE,QACjBpB,EAAI,KAAMW,EAAG,CAAC,CAAE,EAChBV,EAAI,KAAMU,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BR,EAAI,KAAMQ,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BP,EAAI,KAAMO,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MA6BhC,KAzBAL,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXL,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMY,EAAGZ,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACM0B,EAAI,EAAGA,EAAI7B,EAAO,OAAQ6B,IAC/BT,EAAKpB,EAAQ6B,CAAE,EAAE,QACjBpB,EAAI,KAAMW,EAAG,CAAC,CAAE,EAChBV,EAAI,KAAMU,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BR,EAAI,KAAMQ,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BP,EAAI,KAAMO,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAajC,IATAC,EAAKxB,GAASG,CAAO,EAGrB4B,EAAIlC,GAAaO,CAAM,EAGvBO,EAAOmB,EAAE,KAGHD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKP,EAAIO,IACtB1B,GAAgBK,EAAOoB,CAAG,EAC1BO,EAAG,CAAE,EAAIvB,EAAWJ,EAAO,CAAE,CAAE,EAC/B2B,EAAG,CAAE,EAAItB,EAAWL,EAAO,CAAE,CAAE,EAC/BO,EAAMa,EAAG,CAAC,CAAE,EAAItB,EAAK6B,EAAGrB,CAAK,EAC7BZ,GAAkB0B,EAAIZ,CAAI,EAE3Bd,GAAkB0B,EAAIX,CAAI,CAC3B,CACAf,GAAkB0B,EAAIV,CAAI,CAC3B,CACAhB,GAAkB0B,EAAIT,CAAI,CAC3B,CACAjB,GAAkB0B,EAAIR,CAAI,CAC3B,CACD,CAKApB,GAAO,QAAUK,KClRjB,IAAAgC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA+Gd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAI9B,EAAQ,CAAE,EACde,EAAKe,EAAE,MAGF1B,EAgCJ,IA9BAY,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACM6B,EAAI,EAAGA,EAAIhC,EAAO,OAAQgC,IAC/BV,EAAKtB,EAAQgC,CAAE,EAAE,QACjBvB,EAAI,KAAMa,EAAG,CAAC,CAAE,EAChBZ,EAAI,KAAMY,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BR,EAAI,KAAMQ,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAkChC,KA9BAN,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXN,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMa,EAAGb,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACM6B,EAAI,EAAGA,EAAIhC,EAAO,OAAQgC,IAC/BV,EAAKtB,EAAQgC,CAAE,EAAE,QACjBvB,EAAI,KAAMa,EAAG,CAAC,CAAE,EAChBZ,EAAI,KAAMY,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BR,EAAI,KAAMQ,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAajC,IATAC,EAAK1B,GAASG,CAAO,EAGrB+B,EAAIrC,GAAaO,CAAM,EAGvBO,EAAOsB,EAAE,KAGHD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKR,EAAIQ,IACtB5B,GAAgBK,EAAOsB,CAAG,EAC1BQ,EAAG,CAAE,EAAI1B,EAAWJ,EAAO,CAAE,CAAE,EAC/B8B,EAAG,CAAE,EAAIzB,EAAWL,EAAO,CAAE,CAAE,EAC/BO,EAAMe,EAAG,CAAC,CAAE,EAAIxB,EAAKgC,EAAGxB,CAAK,EAC7BZ,GAAkB4B,EAAId,CAAI,EAE3Bd,GAAkB4B,EAAIb,CAAI,CAC3B,CACAf,GAAkB4B,EAAIZ,CAAI,CAC3B,CACAhB,GAAkB4B,EAAIX,CAAI,CAC3B,CACAjB,GAAkB4B,EAAIV,CAAI,CAC3B,CACAlB,GAAkB4B,EAAIT,CAAI,CAC3B,CACD,CAKArB,GAAO,QAAUK,KCpSjB,IAAAmC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA+Gd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAIjC,EAAQ,CAAE,EACdgB,EAAKiB,EAAE,MAGF7B,EAqCJ,IAnCAa,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACMgC,EAAI,EAAGA,EAAInC,EAAO,OAAQmC,IAC/BX,EAAKxB,EAAQmC,CAAE,EAAE,QACjB1B,EAAI,KAAMe,EAAG,CAAC,CAAE,EAChBd,EAAI,KAAMc,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAuChC,KAnCAP,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXP,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMc,EAAGd,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACMgC,EAAI,EAAGA,EAAInC,EAAO,OAAQmC,IAC/BX,EAAKxB,EAAQmC,CAAE,EAAE,QACjB1B,EAAI,KAAMe,EAAG,CAAC,CAAE,EAChBd,EAAI,KAAMc,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BT,EAAI,KAAMS,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAajC,IATAC,EAAK5B,GAASG,CAAO,EAGrBkC,EAAIxC,GAAaO,CAAM,EAGvBO,EAAOyB,EAAE,KAGHD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKT,EAAIS,IACtB9B,GAAgBK,EAAOwB,CAAG,EAC1BS,EAAG,CAAE,EAAI7B,EAAWJ,EAAO,CAAE,CAAE,EAC/BiC,EAAG,CAAE,EAAI5B,EAAWL,EAAO,CAAE,CAAE,EAC/BO,EAAMiB,EAAG,CAAC,CAAE,EAAI1B,EAAKmC,EAAG3B,CAAK,EAC7BZ,GAAkB8B,EAAIhB,CAAI,EAE3Bd,GAAkB8B,EAAIf,CAAI,CAC3B,CACAf,GAAkB8B,EAAId,CAAI,CAC3B,CACAhB,GAAkB8B,EAAIb,CAAI,CAC3B,CACAjB,GAAkB8B,EAAIZ,CAAI,CAC3B,CACAlB,GAAkB8B,EAAIX,CAAI,CAC3B,CACAnB,GAAkB8B,EAAIV,CAAI,CAC3B,CACD,CAKAtB,GAAO,QAAUK,KCtTjB,IAAAsC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA+Gd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAIpC,EAAQ,CAAE,EACdiB,EAAKmB,EAAE,MAGFhC,EA0CJ,IAxCAc,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACMmC,EAAI,EAAGA,EAAItC,EAAO,OAAQsC,IAC/BZ,EAAK1B,EAAQsC,CAAE,EAAE,QACjB7B,EAAI,KAAMiB,EAAG,CAAC,CAAE,EAChBhB,EAAI,KAAMgB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MA4ChC,KAxCAR,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXR,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMe,EAAGf,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACMmC,EAAI,EAAGA,EAAItC,EAAO,OAAQsC,IAC/BZ,EAAK1B,EAAQsC,CAAE,EAAE,QACjB7B,EAAI,KAAMiB,EAAG,CAAC,CAAE,EAChBhB,EAAI,KAAMgB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BV,EAAI,KAAMU,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAajC,IATAC,EAAK9B,GAASG,CAAO,EAGrBqC,EAAI3C,GAAaO,CAAM,EAGvBO,EAAO4B,EAAE,KAGHD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKV,EAAIU,IACtBhC,GAAgBK,EAAO0B,CAAG,EAC1BU,EAAG,CAAE,EAAIhC,EAAWJ,EAAO,CAAE,CAAE,EAC/BoC,EAAG,CAAE,EAAI/B,EAAWL,EAAO,CAAE,CAAE,EAC/BO,EAAMmB,EAAG,CAAC,CAAE,EAAI5B,EAAKsC,EAAG9B,CAAK,EAC7BZ,GAAkBgC,EAAIlB,CAAI,EAE3Bd,GAAkBgC,EAAIjB,CAAI,CAC3B,CACAf,GAAkBgC,EAAIhB,CAAI,CAC3B,CACAhB,GAAkBgC,EAAIf,CAAI,CAC3B,CACAjB,GAAkBgC,EAAId,CAAI,CAC3B,CACAlB,GAAkBgC,EAAIb,CAAI,CAC3B,CACAnB,GAAkBgC,EAAIZ,CAAI,CAC3B,CACApB,GAAkBgC,EAAIX,CAAI,CAC3B,CACD,CAKAvB,GAAO,QAAUK,KCxUjB,IAAAyC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA+Gd,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACnG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAIvC,EAAQ,CAAE,EACdkB,EAAKqB,EAAE,MAGFnC,EA+CJ,IA7CAe,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,CAC9B,EACMsC,EAAI,EAAGA,EAAIzC,EAAO,OAAQyC,IAC/Bb,EAAK5B,EAAQyC,CAAE,EAAE,QACjBhC,EAAI,KAAMmB,EAAG,CAAC,CAAE,EAChBlB,EAAI,KAAMkB,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,CAAI,EAC/BjB,EAAI,KAAMiB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/BhB,EAAI,KAAMgB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAiDhC,KA7CAT,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXT,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMgB,EAAGhB,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,CAC9B,EACMsC,EAAI,EAAGA,EAAIzC,EAAO,OAAQyC,IAC/Bb,EAAK5B,EAAQyC,CAAE,EAAE,QACjBhC,EAAI,KAAMmB,EAAG,CAAC,CAAE,EAChBlB,EAAI,KAAMkB,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,CAAI,EAC/BjB,EAAI,KAAMiB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/BhB,EAAI,KAAMgB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BX,EAAI,KAAMW,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAajC,IATAC,EAAKhC,GAASG,CAAO,EAGrBwC,EAAI9C,GAAaO,CAAM,EAGvBO,EAAO+B,EAAE,KAGHD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKX,EAAIW,IACtBlC,GAAgBK,EAAO4B,CAAG,EAC1BW,EAAG,CAAE,EAAInC,EAAWJ,EAAO,CAAE,CAAE,EAC/BuC,EAAG,CAAE,EAAIlC,EAAWL,EAAO,CAAE,CAAE,EAC/BO,EAAMqB,EAAG,CAAC,CAAE,EAAI9B,EAAKyC,EAAGjC,CAAK,EAC7BZ,GAAkBkC,EAAIpB,CAAI,EAE3Bd,GAAkBkC,EAAInB,CAAI,CAC3B,CACAf,GAAkBkC,EAAIlB,CAAI,CAC3B,CACAhB,GAAkBkC,EAAIjB,CAAI,CAC3B,CACAjB,GAAkBkC,EAAIhB,CAAI,CAC3B,CACAlB,GAAkBkC,EAAIf,CAAI,CAC3B,CACAnB,GAAkBkC,EAAId,CAAI,CAC3B,CACApB,GAAkBkC,EAAIb,CAAI,CAC3B,CACArB,GAAkBkC,EAAIZ,CAAI,CAC3B,CACD,CAKAxB,GAAO,QAAUK,KC1VjB,IAAA4C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAwBA,IAAIC,GAAc,QAAS,iCAAkC,EACzDC,GAAmB,KACnBC,GAAiB,KACjBC,GAAU,KA+Gd,SAASC,GAAWC,EAAKC,EAAQC,EAAOC,EAAUC,EAAUC,EAAYC,EAAWC,EAAWC,EAAO,CACpG,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EASJ,GAJAF,EAAI1C,EAAQ,CAAE,EACdmB,EAAKuB,EAAE,MAGFtC,EAoDJ,IAlDAgB,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,CAC9B,EACAe,EAAM,CACLhB,EAAS,CAAC,EAAM0B,EAAG1B,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,CAC9B,EACMyC,EAAI,EAAGA,EAAI5C,EAAO,OAAQ4C,IAC/Bd,EAAK9B,EAAQ4C,CAAE,EAAE,QACjBnC,EAAI,KAAMqB,EAAG,CAAC,CAAE,EAChBpB,EAAI,KAAMoB,EAAG,CAAC,EAAMV,EAAGU,EAAG,CAAC,CAAI,EAC/BnB,EAAI,KAAMmB,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,CAAI,EAC/BlB,EAAI,KAAMkB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/BjB,EAAI,KAAMiB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/BhB,EAAI,KAAMgB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,MAsDhC,KAlDAV,EAAKD,EAAI,CAAE,EACXE,EAAKF,EAAI,CAAE,EACXG,EAAKH,EAAI,CAAE,EACXI,EAAKJ,EAAI,CAAE,EACXK,EAAKL,EAAI,CAAE,EACXM,EAAKN,EAAI,CAAE,EACXO,EAAKP,EAAI,CAAE,EACXQ,EAAKR,EAAI,CAAE,EACXS,EAAKT,EAAI,CAAE,EACXU,EAAKV,EAAI,CAAE,EACXV,EAAM,CACLP,EAAS,CAAC,EACVC,EAAS,CAAC,CACX,EACAO,EAAM,CACLR,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMiB,EAAGjB,EAAS,CAAC,CAC9B,EACAQ,EAAM,CACLT,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMkB,EAAGlB,EAAS,CAAC,CAC9B,EACAS,EAAM,CACLV,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMmB,EAAGnB,EAAS,CAAC,CAC9B,EACAU,EAAM,CACLX,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMoB,EAAGpB,EAAS,CAAC,CAC9B,EACAW,EAAM,CACLZ,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMqB,EAAGrB,EAAS,CAAC,CAC9B,EACAY,EAAM,CACLb,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMsB,EAAGtB,EAAS,CAAC,CAC9B,EACAa,EAAM,CACLd,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMuB,EAAGvB,EAAS,CAAC,CAC9B,EACAc,EAAM,CACLf,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMwB,EAAGxB,EAAS,CAAC,CAC9B,EACAe,EAAM,CACLhB,EAAS,CAAC,EAAM0B,EAAG1B,EAAS,CAAC,EAC7BC,EAAS,CAAC,EAAMyB,EAAGzB,EAAS,CAAC,CAC9B,EACMyC,EAAI,EAAGA,EAAI5C,EAAO,OAAQ4C,IAC/Bd,EAAK9B,EAAQ4C,CAAE,EAAE,QACjBnC,EAAI,KAAMqB,EAAG,CAAC,CAAE,EAChBpB,EAAI,KAAMoB,EAAG,CAAC,EAAMV,EAAGU,EAAG,CAAC,CAAI,EAC/BnB,EAAI,KAAMmB,EAAG,CAAC,EAAMT,EAAGS,EAAG,CAAC,CAAI,EAC/BlB,EAAI,KAAMkB,EAAG,CAAC,EAAMR,EAAGQ,EAAG,CAAC,CAAI,EAC/BjB,EAAI,KAAMiB,EAAG,CAAC,EAAMP,EAAGO,EAAG,CAAC,CAAI,EAC/BhB,EAAI,KAAMgB,EAAG,CAAC,EAAMN,EAAGM,EAAG,CAAC,CAAI,EAC/Bf,EAAI,KAAMe,EAAG,CAAC,EAAML,EAAGK,EAAG,CAAC,CAAI,EAC/Bd,EAAI,KAAMc,EAAG,CAAC,EAAMJ,EAAGI,EAAG,CAAC,CAAI,EAC/Bb,EAAI,KAAMa,EAAG,CAAC,EAAMH,EAAGG,EAAG,CAAC,CAAI,EAC/BZ,EAAI,KAAMY,EAAG,CAAC,EAAMF,EAAGE,EAAG,CAAC,CAAI,EAajC,IATAC,EAAKlC,GAASG,CAAO,EAGrB2C,EAAIjD,GAAaO,CAAM,EAGvBO,EAAOkC,EAAE,KAGHD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IAAO,CAC7B,IAAMD,EAAK,EAAGA,EAAKZ,EAAIY,IACtBpC,GAAgBK,EAAO8B,CAAG,EAC1BY,EAAG,CAAE,EAAItC,EAAWJ,EAAO,CAAE,CAAE,EAC/B0C,EAAG,CAAE,EAAIrC,EAAWL,EAAO,CAAE,CAAE,EAC/BO,EAAMuB,EAAG,CAAC,CAAE,EAAIhC,EAAK4C,EAAGpC,CAAK,EAC7BZ,GAAkBoC,EAAItB,CAAI,EAE3Bd,GAAkBoC,EAAIrB,CAAI,CAC3B,CACAf,GAAkBoC,EAAIpB,CAAI,CAC3B,CACAhB,GAAkBoC,EAAInB,CAAI,CAC3B,CACAjB,GAAkBoC,EAAIlB,CAAI,CAC3B,CACAlB,GAAkBoC,EAAIjB,CAAI,CAC3B,CACAnB,GAAkBoC,EAAIhB,CAAI,CAC3B,CACApB,GAAkBoC,EAAIf,CAAI,CAC3B,CACArB,GAAkBoC,EAAId,CAAI,CAC3B,CACAtB,GAAkBoC,EAAIb,CAAI,CAC3B,CACD,CAKAzB,GAAO,QAAUK,KC5WjB,IAAA+C,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAY,QAAS,gCAAiC,EACtDC,GAAc,QAAS,iCAAkC,EACzDC,GAAQ,QAAS,0BAA2B,EAC5CC,GAAiB,KACjBC,GAAU,KAKVC,GAAO,QA4GX,SAASC,GAAUC,EAAKC,EAAQC,EAAOC,EAAWC,EAAWC,EAAO,CACnE,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA,EACAC,EAsBJ,IApBAH,EAAIX,EAAO,OAGXY,EAAIZ,EAAQ,CAAE,EACdQ,EAAKI,EAAE,MAGPN,EAAMf,GAAOiB,CAAG,EAGhBC,EAAKb,GAASI,CAAO,EAGrBa,EAAIpB,GAAaQ,CAAM,EAGvBI,EAAOO,EAAE,KAGTF,EAAKhB,GAAOiB,CAAE,EACR,EAAI,EAAG,EAAIL,EAAK,IAAM,CAC3B,IAAMQ,EAAI,EAAGA,EAAIH,EAAGG,IACnBP,EAAMP,EAAQc,CAAE,EAChBJ,EAAII,CAAE,EAAItB,GAAWgB,EAAID,EAAI,QAASE,EAAIK,CAAE,EAAGP,EAAI,MAAO,EAAGV,EAAK,EAEnEF,GAAgBM,EAAOS,CAAG,EAC1BG,EAAG,CAAE,EAAIX,EAAWD,EAAO,CAAE,CAAE,EAC/BY,EAAG,CAAE,EAAIV,EAAWF,EAAO,CAAE,CAAE,EAC/BI,EAAMK,EAAG,CAAC,CAAE,EAAIX,EAAKc,EAAGT,CAAK,CAC9B,CACD,CAKAd,GAAO,QAAUQ,KC5LjB,IAAAiB,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAiB,QAAS,yCAA0C,EACpEC,GAAmB,QAAS,mDAAoD,EAChFC,GAAoB,QAAS,uCAAwC,EACrEC,GAAe,QAAS,kCAAmC,EAC3DC,GAAiB,QAAS,sCAAuC,EACjEC,GAAgB,QAAS,oCAAqC,EAC9DC,GAAe,QAAS,oCAAqC,EAC7DC,GAAQ,QAAS,4BAA6B,EAC9CC,GAAO,QAAS,yBAA0B,EAC1CC,GAAS,QAAS,uBAAwB,EAC1CC,GAAkB,KAClBC,GAAkB,KAClBC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA0B,KAC1BC,GAA2B,KAC3BC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAkB,KAClBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAmB,KACnBC,GAAoB,KACpBC,GAAmB,KACnBC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAW,KACXC,GAAY,KACZC,GAAW,KAKXC,GAAS,CACZZ,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIG,GAAkB,CACrBzB,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIgB,GAAiB,CACpBnC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACI4B,GAA0B,CAC7B7C,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,EACD,EACIsC,GAAWJ,GAAO,OAAS,EAc/B,SAASK,GAAcC,EAAGC,EAAGC,EAAI,CAChC,OAAOxD,GAAc,CAAEsD,EAAGC,EAAGC,CAAE,EAAG,mBAAoB,EAAK,CAC5D,CAgNA,SAASC,GAAuBC,EAAKC,EAAQC,EAAMC,EAAU,CAC5D,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAtC,EACAC,EACAC,EACAqC,EACAC,EAUJ,IARK,UAAU,OAAS,EACvB3B,EAAON,EAEPM,EAAO,CAAC,EAGTuB,EAAI/B,EAAO,OACXc,EAAM,CAAC,EACDoB,EAAI,EAAGA,EAAIH,EAAGG,IACnBpB,EAAI,KAAM/E,GAAgBiE,EAAQkC,CAAE,CAAE,CAAE,EAazC,GAVAvC,EAAImB,EAAK,CAAE,EACXlB,EAAIkB,EAAK,CAAE,EACXjB,EAAIiB,EAAK,CAAE,EAGXE,EAAMrB,EAAE,MACRsB,EAAMrB,EAAE,MACRU,EAAQU,EAAI,OAGPA,EAAI,SAAWC,EAAI,OACvB,MAAM,IAAI,MAAOzE,GAAQ,mIAAoIwE,EAAI,OAAQC,EAAI,MAAO,CAAE,EAEvL,IAAMiB,EAAI,EAAGA,EAAI5B,EAAO4B,IACvB,GAAKlB,EAAKkB,CAAE,IAAMjB,EAAKiB,CAAE,EACxB,MAAM,IAAI,MAAO1F,GAAQ,8GAA+GD,GAAMyE,EAAK,GAAI,EAAGzE,GAAM0E,EAAK,GAAI,CAAE,CAAE,EAO/K,GAFAe,EAAI/B,EAAK,OACT4B,EAAI7F,GAAkBiE,EAAMK,EAAM,CAAE,EAC/BuB,IAAM,KACV,MAAM,IAAI,WAAYrF,GAAQ,2FAA4FD,GAAM0D,EAAM,GAAI,CAAE,CAAE,EAG/I,GADA4B,EAAE,KAAK,EACFA,EAAE,SAAWG,EACjB,MAAM,IAAI,MAAOxF,GAAQ,iGAAkGD,GAAM0D,EAAM,GAAI,CAAE,CAAE,EAGhJ,GAAK+B,EAAI1B,EACR,MAAM,IAAI,WAAY9D,GAAQ,qJAAsJ8D,EAAO/D,GAAM0D,EAAM,GAAI,CAAE,CAAE,EAIhN,GADAgC,EAAI3B,EAAQ0B,EACPnC,EAAE,MAAM,SAAWoC,EACvB,MAAM,IAAI,MAAOzF,GAAQ,+LAAgMD,GAAMyE,EAAK,GAAI,EAAGiB,EAAG1F,GAAMsD,EAAE,MAAO,GAAI,CAAE,CAAE,EAqBtQ,IAjBAU,EAAQtE,GAAmB+E,EAAI,OAAQa,CAAE,EACzCjB,EAAO1E,GAAc8E,EAAKrB,EAAE,QAASY,CAAM,EAC3CM,EAAO3E,GAAc+E,EAAKrB,EAAE,QAASW,CAAM,EAC3CY,EAAMP,EAAM,CAAE,EACda,EAAMb,EAAM,CAAE,EACdc,EAAMb,EAAM,CAAE,EAGdD,EAAO1E,GAAc8E,EAAKrB,EAAE,QAASkC,CAAE,EACvChB,EAAO3E,GAAc+E,EAAKrB,EAAE,QAASiC,CAAE,EACvCX,EAAMN,EAAM,CAAE,EACdW,EAAMX,EAAM,CAAE,EACdY,EAAMX,EAAM,CAAE,EAGdE,EAAM,EACNa,EAAK,EACCM,EAAI,EAAGA,EAAID,EAAGC,IAAM,CAEzB,IADAJ,EAAIX,EAAKe,CAAE,EACLC,EAAI,EAAGA,EAAIJ,EAAGI,IACnB,GAAKL,IAAMhB,EAAKqB,CAAE,EAAE,MAAOD,CAAE,EAC5B,MAAM,IAAI,MAAO1F,GAAQ,qNAAsND,GAAMyE,EAAK,GAAI,EAAGzE,GAAMgE,EAAO,GAAI,EAAGhE,GAAM4E,EAAK,GAAI,EAAG5E,GAAMuE,EAAKqB,CAAE,EAAE,MAAO,GAAI,EAAGA,CAAE,CAAE,EAI1UpB,GAAOe,EAGFA,IAAM,IACVF,GAAM,EAER,CAEA,GAAK,EAAAb,IAAQ,GAAOG,EAAI,QAAU5E,GAAO4E,CAAI,IAAM,GA6BnD,IAzBAb,EAAQ,CACP,CACC,MAASV,EAAE,MACX,KAAQA,EAAE,KACV,MAASuB,EACT,QAAWK,EACX,OAAU5B,EAAE,OACZ,MAASA,EAAE,KACZ,EACA,CACC,MAASC,EAAE,MACX,KAAQA,EAAE,KACV,MAASsB,EACT,QAAWM,EACX,OAAU5B,EAAE,OACZ,MAASA,EAAE,KACZ,CACD,EACAnD,GAAiBqE,EAAKT,CAAM,EAG5BF,EAAYzD,GAAiB2D,EAAO,CAAE,CAAE,EACxCD,EAAY1D,GAAiB2D,EAAO,CAAE,CAAE,EAGnC4B,IAAM,EACV,OAAKvC,GAAcC,EAAGC,EAAGC,CAAE,EACnBP,GAAiB2C,CAAE,EAAGlC,EAAKe,EAAKX,EAAWC,EAAWI,CAAK,EAE5DnB,GAAQ4C,CAAE,EAAGlC,EAAKe,EAAKX,EAAWC,EAAWI,CAAK,EAG1D,GAAKyB,IAAM,EACV,OAAKvC,GAAcC,EAAGC,EAAGC,CAAE,EACnBP,GAAiB2C,CAAE,EAAGlC,EAAKe,EAAKT,EAAOoB,EAAKC,EAAKvB,EAAWC,EAAWI,CAAK,EAE7EnB,GAAQ4C,CAAE,EAAGlC,EAAKe,EAAKT,EAAOoB,EAAKC,EAAKvB,EAAWC,EAAWI,CAAK,EAK3E,GAHAmB,EAAK9B,EAAE,QAGF+B,IAAOK,EAAE,EAAI,CAEjB,IAAMC,EAAI,EAAGA,EAAID,GACXd,EAAKe,CAAE,IAAM,EADCA,IACnB,CAKD,IADArC,EAAE,MAAQ,CAAEsB,EAAIe,CAAC,CAAE,EACbC,EAAI,EAAGA,EAAIJ,EAAGI,IACnBrB,EAAKqB,CAAE,EAAE,QAAU,CAAErB,EAAIqB,CAAC,EAAE,QAAQD,CAAC,CAAE,EAIxC,OAFAT,EAAM,CAAEA,EAAIS,CAAC,CAAE,EACfR,EAAM,CAAEA,EAAIQ,CAAC,CAAE,EACVxC,GAAcC,EAAGC,EAAGC,CAAE,EACnBP,GAAiB,CAAE,EAAGS,EAAKe,EAAKT,EAAOoB,EAAKC,EAAKvB,EAAWC,EAAWI,CAAK,EAE7EnB,GAAQ,CAAE,EAAGU,EAAKe,EAAKT,EAAOoB,EAAKC,EAAKvB,EAAWC,EAAWI,CAAK,CAC3E,CASA,GARAY,EAAMjF,GAAgBsF,CAAI,EAC1BJ,EAAMlF,GAAgBuF,CAAI,EAC1BJ,EAAMnF,GAAgBwF,CAAG,EAGzBlB,EAAOrE,GAAeqF,CAAI,EAC1Bf,EAAOtE,GAAesF,CAAI,EAC1Bf,EAAOvE,GAAeuF,CAAG,EACpBP,IAAQ,GAAKC,IAAQ,GAAKC,IAAQ,GAAKb,IAASE,GAAQD,IAASC,GAAQsB,GAAKxC,GAElF,OAAKC,GAAcC,EAAGC,EAAGC,CAAE,EACnBP,GAAiB2C,CAAE,EAAGlC,EAAKe,EAAKT,EAAOoB,EAAKC,EAAKjB,IAAS,EAAGN,EAAWC,EAAWI,CAAK,EAEzFnB,GAAQ4C,CAAE,EAAGlC,EAAKe,EAAKT,EAAOoB,EAAKC,EAAKjB,IAAS,EAAGN,EAAWC,EAAWI,CAAK,EAKvF,GAAKyB,GAAKxC,GACT,OAAKC,GAAcC,EAAGC,EAAGC,CAAE,EACnBL,GAAyByC,EAAE,CAAE,EAAGlC,EAAKe,EAAKT,EAAOoB,EAAKC,EAAKvB,EAAWC,EAAWI,CAAK,EAEvFjB,GAAgB0C,EAAE,CAAE,EAAGlC,EAAKe,EAAKT,EAAOoB,EAAKC,EAAKvB,EAAWC,EAAWI,CAAK,EAGrF,GAAKd,GAAcC,EAAGC,EAAGC,CAAE,EAC1B,OAAOrB,GAAkBuB,EAAKe,EAAKT,EAAOF,EAAWC,EAAWI,CAAK,EAEtEpB,GAAUW,EAAKe,EAAKT,EAAOF,EAAWC,EAAWI,CAAK,EACvD,CAKA1E,GAAO,QAAUgE,KC5jBjB,IAAAsC,GAAAC,GAAA,SAAAC,GAAAC,GAAA,cAsBA,IAAIC,GAAa,QAAS,4BAA6B,EACnDC,GAAS,QAAS,uBAAwB,EAC1CC,GAAS,KA+Eb,SAASC,GAASC,EAAM,CACvB,GAAK,CAACJ,GAAYI,CAAI,EACrB,MAAM,IAAI,UAAWH,GAAQ,oEAAqEG,CAAI,CAAE,EAEzG,OAAOC,EAWP,SAASA,EAASC,EAAQC,EAAMC,EAAU,CACzC,IAAIC,EACJ,OAAK,UAAU,OAAS,EACvBA,EAAOD,EAEPC,EAAO,CAAC,EAEFP,GAAQE,EAAKE,EAAQC,EAAME,CAAK,CACxC,CACD,CAKAV,GAAO,QAAUI,KC4BjB,IAAIO,GAAc,QAAS,uDAAwD,EAC/EC,GAAO,KACPC,GAAU,KAKdF,GAAaC,GAAM,UAAWC,EAAQ,EAKtC,OAAO,QAAUD",
+  "names": ["require_initialize_array_views", "__commonJSMin", "exports", "module", "initializeViews", "arrays", "out", "v", "i", "require_reshape_strategy", "__commonJSMin", "exports", "module", "iterationOrder", "minmaxViewBufferIndex", "ndarraylike2object", "assign", "ndarraylike2ndarray", "emptyLike", "identity", "x", "broadcast", "squeeze", "arr", "index", "sh", "sx", "reshape", "contiguous", "len", "iox", "xmmv", "ind", "copy", "workspace", "view", "strategy", "ndims", "ns", "i", "require_increment_offsets", "__commonJSMin", "exports", "module", "incrementOffsets", "offsets", "inc", "i", "require_set_view_offsets", "__commonJSMin", "exports", "module", "setViewOffsets", "views", "offsets", "i", "j", "require_offsets", "__commonJSMin", "exports", "module", "offsets", "arrays", "out", "i", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary2d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "set", "dv0", "dv1", "ov1", "sh", "s0", "s1", "sv", "ov", "iv", "i0", "i1", "j0", "j1", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary3d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "set", "dv0", "dv1", "dv2", "ov1", "ov2", "sh", "s0", "s1", "s2", "sv", "ov", "iv", "i0", "i1", "i2", "j0", "j1", "j2", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary4d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "ov1", "ov2", "ov3", "sh", "s0", "s1", "s2", "s3", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "j0", "j1", "j2", "j3", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary5d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "ov1", "ov2", "ov3", "ov4", "sh", "s0", "s1", "s2", "s3", "s4", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "j0", "j1", "j2", "j3", "j4", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary6d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "ov1", "ov2", "ov3", "ov4", "ov5", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "j0", "j1", "j2", "j3", "j4", "j5", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary7d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "ov1", "ov2", "ov3", "ov4", "ov5", "ov6", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary8d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "ov1", "ov2", "ov3", "ov4", "ov5", "ov6", "ov7", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary9d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "dv8", "ov1", "ov2", "ov3", "ov4", "ov5", "ov6", "ov7", "ov8", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked_accessors", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary10d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "dv8", "dv9", "ov1", "ov2", "ov3", "ov4", "ov5", "ov6", "ov7", "ov8", "ov9", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "s9", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "j9", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary2d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "dv0", "dv1", "ov1", "sh", "s0", "s1", "sv", "ov", "iv", "i0", "i1", "j0", "j1", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary3d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "dv0", "dv1", "dv2", "ov1", "ov2", "sh", "s0", "s1", "s2", "sv", "ov", "iv", "i0", "i1", "i2", "j0", "j1", "j2", "N", "o", "x", "y", "z", "v", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary4d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "dv0", "dv1", "dv2", "dv3", "ov1", "ov2", "ov3", "sh", "s0", "s1", "s2", "s3", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "j0", "j1", "j2", "j3", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary5d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "ov1", "ov2", "ov3", "ov4", "sh", "s0", "s1", "s2", "s3", "s4", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "j0", "j1", "j2", "j3", "j4", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary6d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "ov1", "ov2", "ov3", "ov4", "ov5", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "j0", "j1", "j2", "j3", "j4", "j5", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary7d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "ov1", "ov2", "ov3", "ov4", "ov5", "ov6", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary8d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "ov1", "ov2", "ov3", "ov4", "ov5", "ov6", "ov7", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary9d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "dv8", "ov1", "ov2", "ov3", "ov4", "ov5", "ov6", "ov7", "ov8", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "N", "o", "x", "y", "z", "v", "k", "require_d_blocked", "__commonJSMin", "exports", "module", "loopOrder", "blockSize", "takeIndexed", "copyIndexed", "zeros", "incrementOffsets", "setViewOffsets", "offsets", "blockedbinary10d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "bsize", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "dv8", "dv9", "ov1", "ov2", "ov3", "ov4", "ov5", "ov6", "ov7", "ov8", "ov9", "sh", "s0", "s1", "s2", "s3", "s4", "s5", "s6", "s7", "s8", "s9", "sv", "ov", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "j0", "j1", "j2", "j3", "j4", "j5", "j6", "j7", "j8", "j9", "N", "o", "x", "y", "z", "v", "k", "require_d_accessors", "__commonJSMin", "exports", "module", "without", "binary0d", "fcn", "arrays", "strategyX", "strategyY", "opts", "z", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary1d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "sh", "S0", "iv", "i0", "z", "v", "i", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary2d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "dv1", "sh", "S0", "S1", "sv", "iv", "i0", "i1", "z", "v", "i", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary3d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "dv1", "dv2", "sh", "S0", "S1", "S2", "sv", "iv", "i0", "i1", "i2", "z", "v", "i", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary4d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "sh", "S0", "S1", "S2", "S3", "sv", "iv", "i0", "i1", "i2", "i3", "z", "v", "i", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary5d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "sh", "S0", "S1", "S2", "S3", "S4", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "z", "v", "i", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary6d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "z", "v", "i", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary7d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "z", "v", "i", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary8d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "z", "v", "i", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary9d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "dv8", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "z", "v", "i", "require_d_accessors", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary10d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "set", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "dv8", "dv9", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "S9", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "z", "v", "i", "require_nd_accessors", "__commonJSMin", "exports", "module", "numel", "vind2bind", "copyIndexed", "zeros", "setViewOffsets", "offsets", "MODE", "binarynd", "fcn", "arrays", "views", "strategyX", "strategyY", "opts", "zbuf", "len", "arr", "set", "sh", "iv", "io", "N", "z", "v", "i", "j", "require_d", "__commonJSMin", "exports", "module", "without", "binary0d", "fcn", "arrays", "strategyX", "strategyY", "opts", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary1d", "fcn", "arrays", "views", "stridesX", "stridesY", "strategyX", "strategyY", "opts", "zbuf", "dv0", "sh", "S0", "iv", "i0", "z", "v", "i", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary2d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "dv0", "dv1", "sh", "S0", "S1", "sv", "iv", "i0", "i1", "z", "v", "i", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary3d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "dv0", "dv1", "dv2", "sh", "S0", "S1", "S2", "sv", "iv", "i0", "i1", "i2", "z", "v", "i", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary4d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "dv0", "dv1", "dv2", "dv3", "sh", "S0", "S1", "S2", "S3", "sv", "iv", "i0", "i1", "i2", "i3", "v", "i", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary5d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "sh", "S0", "S1", "S2", "S3", "S4", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "z", "v", "i", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary6d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "z", "v", "i", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary7d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "z", "v", "i", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary8d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "z", "v", "i", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary9d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "dv8", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "z", "v", "i", "require_d", "__commonJSMin", "exports", "module", "copyIndexed", "incrementOffsets", "setViewOffsets", "offsets", "binary10d", "fcn", "arrays", "views", "stridesX", "stridesY", "isRowMajor", "strategyX", "strategyY", "opts", "zbuf", "dv0", "dv1", "dv2", "dv3", "dv4", "dv5", "dv6", "dv7", "dv8", "dv9", "sh", "S0", "S1", "S2", "S3", "S4", "S5", "S6", "S7", "S8", "S9", "sv", "iv", "i0", "i1", "i2", "i3", "i4", "i5", "i6", "i7", "i8", "i9", "z", "v", "i", "require_nd", "__commonJSMin", "exports", "module", "numel", "vind2bind", "copyIndexed", "zeros", "setViewOffsets", "offsets", "MODE", "binarynd", "fcn", "arrays", "views", "strategyX", "strategyY", "opts", "zbuf", "len", "arr", "sh", "iv", "io", "N", "z", "v", "j", "require_main", "__commonJSMin", "exports", "module", "ndarray2object", "normalizeIndices", "indicesComplement", "takeIndexed2", "iterationOrder", "strides2order", "anyIsEntryIn", "numel", "join", "format", "initializeViews", "reshapeStrategy", "blockedaccessorbinary2d", "blockedaccessorbinary3d", "blockedaccessorbinary4d", "blockedaccessorbinary5d", "blockedaccessorbinary6d", "blockedaccessorbinary7d", "blockedaccessorbinary8d", "blockedaccessorbinary9d", "blockedaccessorbinary10d", "blockedbinary2d", "blockedbinary3d", "blockedbinary4d", "blockedbinary5d", "blockedbinary6d", "blockedbinary7d", "blockedbinary8d", "blockedbinary9d", "blockedbinary10d", "accessorbinary0d", "accessorbinary1d", "accessorbinary2d", "accessorbinary3d", "accessorbinary4d", "accessorbinary5d", "accessorbinary6d", "accessorbinary7d", "accessorbinary8d", "accessorbinary9d", "accessorbinary10d", "accessorbinarynd", "binary0d", "binary1d", "binary2d", "binary3d", "binary4d", "binary5d", "binary6d", "binary7d", "binary8d", "binary9d", "binary10d", "binarynd", "BINARY", "ACCESSOR_BINARY", "BLOCKED_BINARY", "BLOCKED_ACCESSOR_BINARY", "MAX_DIMS", "hasAccessors", "x", "y", "z", "binaryReduceStrided1d", "fcn", "arrays", "dims", "options", "strategyX", "strategyY", "views", "ndims", "ldims", "opts", "ordx", "ordy", "ordz", "tmpx", "tmpy", "arr", "len", "shx", "shy", "shc", "shl", "iox", "ioy", "ioz", "scx", "scy", "slx", "sly", "sz", "ns", "d", "s", "N", "M", "K", "i", "j", "require_factory", "__commonJSMin", "exports", "module", "isFunction", "format", "reduce", "factory", "fcn", "reducer", "arrays", "dims", "options", "opts", "setReadOnly", "main", "factory"]
+}