Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 | 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 6x 6x 6x 6x 6x 16x 10x 10x 10x 10x 10x 10x 10x 16x 16x 16x 16x 16x 16x 16x 16x 25x 40x 8x 8x 32x 32x 17x 17x 8x 16x 4x 4x 4x 4x 4x | /**
* @license Apache-2.0
*
* Copyright (c) 2025 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
'use strict';
// MODULES //
var strides2order = require( '@stdlib/ndarray/base/strides2order' );
var zeroTo = require( '@stdlib/array/base/zero-to' );
var reverse = require( '@stdlib/array/base/reverse' );
var take = require( '@stdlib/array/base/take-indexed' );
// MAIN //
/**
* Tests whether all elements in an ndarray pass a test implemented by a predicate function.
*
* @private
* @param {Object} x - object containing ndarray meta data
* @param {ndarrayLike} x.ref - reference to the original ndarray-like object
* @param {string} x.dtype - data type
* @param {Collection} x.data - data buffer
* @param {NonNegativeIntegerArray} x.shape - dimensions
* @param {IntegerArray} x.strides - stride lengths
* @param {NonNegativeInteger} x.offset - index offset
* @param {string} x.order - specifies whether `x` is row-major (C-style) or column-major (Fortran-style)
* @param {Function} predicate - predicate function
* @param {*} thisArg - predicate function execution context
* @returns {boolean} boolean indicating whether all elements pass a test
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* function predicate( value ) {
* return value > 0.0;
* }
*
* // Create a data buffer:
* var xbuf = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 ] );
*
* // Define the shape of the input array:
* var shape = [ 2, 2 ];
*
* // Define the array strides:
* var sx = [ 4, 1 ];
*
* // Define the index offset:
* var ox = 1;
*
* // Create the input ndarray-like object:
* var x = {
* 'ref': null,
* 'dtype': 'float64',
* 'data': xbuf,
* 'shape': shape,
* 'strides': sx,
* 'offset': ox,
* 'order': 'row-major'
* };
*
* // Test elements:
* var out = every2d( x, predicate );
* // returns true
*/
function every2d( x, predicate, thisArg ) {
var xbuf;
var idx;
var dx0;
var dx1;
var sh;
var S0;
var S1;
var sx;
var ix;
var i0;
var i1;
// Note on variable naming convention: S#, dx#, i# where # corresponds to the loop number, with `0` being the innermost loop...
// Extract loop variables for purposes of loop interchange: dimensions and loop offset (pointer) increments...
sh = x.shape;
sx = x.strides;
idx = zeroTo( sh.length );
if ( strides2order( sx ) === 1 ) {
// For row-major ndarrays, the last dimensions have the fastest changing indices...
S0 = sh[ 1 ];
S1 = sh[ 0 ];
dx0 = sx[ 1 ]; // offset increment for innermost loop
dx1 = sx[ 0 ] - ( S0*sx[1] ); // offset increment for outermost loop
} else { // order === 'column-major'
// For column-major ndarrays, the first dimensions have the fastest changing indices...
S0 = sh[ 0 ];
S1 = sh[ 1 ];
dx0 = sx[ 0 ]; // offset increment for innermost loop
dx1 = sx[ 1 ] - ( S0*sx[0] ); // offset increment for outermost loop
idx = reverse( idx );
}
// Set a pointer to the first indexed element:
ix = x.offset;
// Cache a reference to the input ndarray buffer:
xbuf = x.data;
// Iterate over the ndarray dimensions...
for ( i1 = 0; i1 < S1; i1++ ) {
for ( i0 = 0; i0 < S0; i0++ ) {
if ( !predicate.call( thisArg, xbuf[ ix ], take( [ i1, i0 ], idx ), x.ref ) ) { // eslint-disable-line max-len
return false;
}
ix += dx0;
}
ix += dx1;
}
return true;
}
// EXPORTS //
module.exports = every2d;
|