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 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 | 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 13x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 20x 21x 18x 18x 21x 3x 3x 3x 21x 21x 23x 17x 17x 23x 6x 6x 6x 23x 23x 23x 24x 21x 21x 24x 3x 3x 3x 24x 24x 24x 28x 16x 16x 28x 12x 12x 12x 28x 28x 28x 28x 28x 28x 28x 28x 36x 54x 62x 146x 10x 10x 10x 10x 10x 136x 136x 52x 52x 44x 44x 26x 26x 28x 24x 23x 21x 10x 20x 13x 13x 13x 13x 13x | /**
* @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.
*/
/* eslint-disable max-depth */
'use strict';
// MODULES //
var loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
var take = require( '@stdlib/array/base/take-indexed' );
var reverse = require( '@stdlib/array/base/reverse' );
// MAIN //
/**
* Tests whether at least `n` 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 {PositiveInteger} n - number of elements
* @param {Function} predicate - predicate function
* @param {*} thisArg - predicate function execution context
* @returns {boolean} boolean indicating whether at least `n` elements pass a test
*
* @example
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
* var accessors = require( '@stdlib/array/base/accessors' );
* var Float64Array = require( '@stdlib/array/float64' );
*
* function predicate( value ) {
* return value > 0.0;
* }
*
* // Create a data buffer:
* var xbuf = toAccessorArray( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );
*
* // Define the shape of the input array:
* var shape = [ 1, 3, 1, 2 ];
*
* // Define the array strides:
* var sx = [ 12, 4, 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',
* 'accessors': accessors( xbuf ).accessors
* };
*
* // Test elements:
* var out = blockedsome4d( x, 4, predicate, {} );
* // returns true
*/
function blockedsome4d( x, n, predicate, thisArg ) {
var bsize;
var count;
var xbuf;
var idx;
var get;
var dx0;
var dx1;
var dx2;
var dx3;
var ox1;
var ox2;
var ox3;
var sh;
var s0;
var s1;
var s2;
var s3;
var sx;
var ox;
var ix;
var i0;
var i1;
var i2;
var i3;
var j0;
var j1;
var j2;
var j3;
var o;
// Note on variable naming convention: s#, dx#, i#, j# where # corresponds to the loop number, with `0` being the innermost loop...
// Resolve the loop interchange order:
o = loopOrder( x.shape, x.strides );
sh = o.sh;
sx = o.sx;
idx = reverse( o.idx );
// Determine the block size:
bsize = blockSize( x.dtype );
// Set a pointer to the first indexed element:
ox = x.offset;
// Cache a reference to the input ndarray buffer:
xbuf = x.data;
// Cache the offset increment for the innermost loop:
dx0 = sx[0];
// Cache accessor:
get = x.accessors[0];
// Initialize a counter:
count = 0;
// Iterate over blocks...
for ( j3 = sh[3]; j3 > 0; ) {
if ( j3 < bsize ) {
s3 = j3;
j3 = 0;
} else {
s3 = bsize;
j3 -= bsize;
}
ox3 = ox + ( j3*sx[3] );
for ( j2 = sh[2]; j2 > 0; ) {
if ( j2 < bsize ) {
s2 = j2;
j2 = 0;
} else {
s2 = bsize;
j2 -= bsize;
}
dx3 = sx[3] - ( s2*sx[2] );
ox2 = ox3 + ( j2*sx[2] );
for ( j1 = sh[1]; j1 > 0; ) {
if ( j1 < bsize ) {
s1 = j1;
j1 = 0;
} else {
s1 = bsize;
j1 -= bsize;
}
dx2 = sx[2] - ( s1*sx[1] );
ox1 = ox2 + ( j1*sx[1] );
for ( j0 = sh[0]; j0 > 0; ) {
if ( j0 < bsize ) {
s0 = j0;
j0 = 0;
} else {
s0 = bsize;
j0 -= bsize;
}
// Compute the index offset for the first input ndarray element in the current block:
ix = ox1 + ( j0*sx[0] );
// Compute the loop offset increment:
dx1 = sx[1] - ( s0*sx[0] );
// Iterate over the ndarray dimensions...
for ( i3 = 0; i3 < s3; i3++ ) {
for ( i2 = 0; i2 < s2; i2++ ) {
for ( i1 = 0; i1 < s1; i1++ ) {
for ( i0 = 0; i0 < s0; i0++ ) {
if ( predicate.call( thisArg, get( xbuf, ix ), take( [ j3+i3, j2+i2, j1+i1, j0+i0 ], idx ), x.ref ) ) { // eslint-disable-line max-len
count += 1;
if ( count === n ) {
return true;
}
}
ix += dx0;
}
ix += dx1;
}
ix += dx2;
}
ix += dx3;
}
}
}
}
}
return false;
}
// EXPORTS //
module.exports = blockedsome4d;
|