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 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 | 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 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 36x 38x 34x 34x 38x 4x 4x 4x 38x 38x 42x 34x 34x 42x 8x 8x 8x 42x 42x 42x 44x 40x 40x 44x 4x 4x 4x 44x 44x 44x 50x 38x 38x 50x 12x 12x 12x 50x 50x 50x 52x 48x 48x 52x 4x 4x 4x 52x 52x 52x 60x 44x 44x 60x 16x 16x 16x 60x 60x 60x 62x 58x 58x 62x 4x 4x 4x 62x 62x 62x 68x 56x 56x 68x 12x 12x 12x 68x 68x 68x 68x 68x 68x 68x 68x 86x 154x 202x 370x 436x 884x 952x 2080x 1040x 1040x 2080x 2080x 952x 952x 884x 884x 436x 436x 370x 370x 202x 202x 154x 154x 86x 86x 68x 62x 60x 52x 50x 44x 42x 38x 36x 36x 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, max-len */
'use strict';
// MODULES //
var loopOrder = require( '@stdlib/ndarray/base/nullary-loop-interchange-order' );
var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' );
// MAIN //
/**
* Counts the number of truthy elements in a reinterpreted complex number ndarray via loop blocking.
*
* @private
* @param {Object} x - object containing ndarray meta data
* @param {*} 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)
* @returns {NonNegativeInteger} result
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* // 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 = [ 1, 1, 1, 1, 1, 1, 2, 2 ];
*
* // Define the array strides:
* var sx = [ 8, 8, 8, 8, 8, 8, 4, 2 ];
*
* // Define the index offset:
* var ox = 0;
*
* // Create the input ndarray-like object:
* var x = {
* 'dtype': 'complex128',
* 'data': xbuf,
* 'shape': shape,
* 'strides': sx,
* 'offset': ox,
* 'order': 'row-major'
* };
*
* // Perform operation:
* var out = blockedCountTruthy8d( x );
* // returns 4
*/
function blockedCountTruthy8d( x ) { // eslint-disable-line max-statements
var count;
var bsize;
var xbuf;
var dx0;
var dx1;
var dx2;
var dx3;
var dx4;
var dx5;
var dx6;
var dx7;
var ox1;
var ox2;
var ox3;
var ox4;
var ox5;
var ox6;
var ox7;
var sh;
var s0;
var s1;
var s2;
var s3;
var s4;
var s5;
var s6;
var s7;
var sx;
var ox;
var ix;
var i0;
var i1;
var i2;
var i3;
var i4;
var i5;
var i6;
var i7;
var j0;
var j1;
var j2;
var j3;
var j4;
var j5;
var j6;
var j7;
var o;
// Note on variable naming convention: s#, dx#, dy#, 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;
// 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];
// Initialize a counter:
count = 0;
// Iterate over blocks...
for ( j7 = sh[7]; j7 > 0; ) {
if ( j7 < bsize ) {
s7 = j7;
j7 = 0;
} else {
s7 = bsize;
j7 -= bsize;
}
ox7 = ox + ( j7*sx[7] );
for ( j6 = sh[6]; j6 > 0; ) {
if ( j6 < bsize ) {
s6 = j6;
j6 = 0;
} else {
s6 = bsize;
j6 -= bsize;
}
dx7 = sx[7] - ( s6*sx[6] );
ox6 = ox7 + ( j6*sx[6] );
for ( j5 = sh[5]; j5 > 0; ) {
if ( j5 < bsize ) {
s5 = j5;
j5 = 0;
} else {
s5 = bsize;
j5 -= bsize;
}
dx6 = sx[6] - ( s5*sx[5] );
ox5 = ox6 + ( j5*sx[5] );
for ( j4 = sh[4]; j4 > 0; ) {
if ( j4 < bsize ) {
s4 = j4;
j4 = 0;
} else {
s4 = bsize;
j4 -= bsize;
}
dx5 = sx[5] - ( s4*sx[4] );
ox4 = ox5 + ( j4*sx[4] );
for ( j3 = sh[3]; j3 > 0; ) {
if ( j3 < bsize ) {
s3 = j3;
j3 = 0;
} else {
s3 = bsize;
j3 -= bsize;
}
dx4 = sx[4] - ( s3*sx[3] );
ox3 = ox4 + ( 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 ( i7 = 0; i7 < s7; i7++ ) {
for ( i6 = 0; i6 < s6; i6++ ) {
for ( i5 = 0; i5 < s5; i5++ ) {
for ( i4 = 0; i4 < s4; i4++ ) {
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 ( xbuf[ ix ] || xbuf[ ix+1 ] ) {
count += 1;
}
ix += dx0;
}
ix += dx1;
}
ix += dx2;
}
ix += dx3;
}
ix += dx4;
}
ix += dx5;
}
ix += dx6;
}
ix += dx7;
}
}
}
}
}
}
}
}
}
return count;
}
// EXPORTS //
module.exports = blockedCountTruthy8d;
|