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 | 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 5x 136x 136x 136x 136x 136x 136x 136x 136x 136x 136x 136x 136x 136x 136x 136x 136x 136x 136x 4x 2x 2x 2x 2x 132x 132x 132x 136x 78x 78x 39x 39x 39x 39x 54x 54x 54x 28x 28x 26x 26x 136x 5x 5x 5x 5x 5x | /**
* @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';
/* eslint-disable stdlib/no-redeclare */
// MODULES //
var iterationOrder = require( '@stdlib/ndarray/base/iteration-order' );
var ndarray2object = require( '@stdlib/ndarray/base/ndarraylike2object' );
var numel = require( '@stdlib/ndarray/base/numel' );
var blockedaccessorfind2d = require( './2d_blocked_accessors.js' );
var blockedaccessorfind3d = require( './3d_blocked_accessors.js' );
var blockedfind2d = require( './2d_blocked.js' );
var blockedfind3d = require( './3d_blocked.js' );
var accessorfind0d = require( './0d_accessors.js' );
var accessorfind1d = require( './1d_accessors.js' );
var accessorfind2d = require( './2d_accessors.js' );
var accessorfind3d = require( './3d_accessors.js' );
var accessorfindnd = require( './nd_accessors.js' );
var find0d = require( './0d.js' );
var find1d = require( './1d.js' );
var find2d = require( './2d.js' );
var find3d = require( './3d.js' );
var findnd = require( './nd.js' );
// VARIABLES //
var FIND = [
find0d,
find1d,
find2d,
find3d
];
var ACCESSOR_FIND = [
accessorfind0d,
accessorfind1d,
accessorfind2d,
accessorfind3d
];
var BLOCKED_FIND = [
blockedfind2d, // 0
blockedfind3d
];
var BLOCKED_ACCESSOR_FIND = [
blockedaccessorfind2d, // 0
blockedaccessorfind3d
];
var MAX_DIMS = FIND.length - 1;
// MAIN //
/**
* Returns the first element in an ndarray which passes a test implemented by a predicate function.
*
* ## Notes
*
* - A provided ndarray should be an `object` with the following properties:
*
* - **dtype**: data type.
* - **data**: data buffer.
* - **shape**: dimensions.
* - **strides**: stride lengths.
* - **offset**: index offset.
* - **order**: specifies whether an ndarray is row-major (C-style) or column major (Fortran-style).
*
* @param {ArrayLikeObject<Object>} arrays - array-like object containing one input array and a zero-dimensional sentinel value ndarray
* @param {Function} predicate - predicate function
* @param {thisArg} [thisArg] - predicate function execution context
* @returns {*} result
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* function predicate( value ) {
* return value % 2.0 === 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, 9.0, 10.0, 11.0, 12.0 ] );
*
* // Define the shape of the input array:
* var shape = [ 3, 1, 2 ];
*
* // Define the array strides:
* var sx = [ 4, 4, 1 ];
*
* // Define the index offset:
* var ox = 1;
*
* // Create the input ndarray-like object:
* var x = {
* 'dtype': 'float64',
* 'data': xbuf,
* 'shape': shape,
* 'strides': sx,
* 'offset': ox,
* 'order': 'row-major'
* };
*
* // Create the sentinel value ndarray-like object:
* var sentinelValue = {
* 'dtype': 'float64',
* 'data': new Float64Array( [ NaN ] ),
* 'shape': [],
* 'strides': [ 0 ],
* 'offset': 0,
* 'order': 'row-major'
* };
*
* // Test elements:
* var out = find( [ x, sentinelValue ], predicate );
* // returns 2.0
*/
function find( arrays, predicate, thisArg ) {
var ndims;
var shx;
var sv;
var x;
// Unpack the ndarray and standardize ndarray meta data:
x = ndarray2object( arrays[ 0 ] );
sv = ndarray2object( arrays[ 1 ] );
shx = x.shape;
ndims = shx.length;
// Resolve the sentinel value:
sv = sv.accessors[ 0 ]( sv.data, sv.offset );
// Determine whether we can avoid iteration altogether...
if ( ndims === 0 ) {
if ( x.accessorProtocol ) {
return ACCESSOR_FIND[ ndims ]( x, sv, predicate, thisArg );
}
return FIND[ ndims ]( x, sv, predicate, thisArg );
}
// Check whether we were provided an empty ndarray...
if ( numel( shx ) === 0 ) {
return sv;
}
// Determine whether we can avoid blocked iteration...
if ( ndims <= MAX_DIMS && iterationOrder( x.strides ) !== 0 ) {
// So long as iteration always moves in the same direction (i.e., no mixed sign strides), we can leverage cache-optimal (i.e., normal) nested loops without resorting to blocked iteration...
if ( x.accessorProtocol ) {
return ACCESSOR_FIND[ ndims ]( x, sv, predicate, thisArg );
}
return FIND[ ndims ]( x, sv, predicate, thisArg );
}
// Determine whether we can perform blocked iteration...
if ( ndims <= MAX_DIMS ) {
if ( x.accessorProtocol ) {
return BLOCKED_ACCESSOR_FIND[ ndims-2 ]( x, sv, predicate, thisArg ); // eslint-disable-line max-len
}
return BLOCKED_FIND[ ndims-2 ]( x, sv, predicate, thisArg );
}
// Fall-through to linear view iteration without regard for how data is stored in memory (i.e., take the slow path)...
if ( x.accessorProtocol ) {
return accessorfindnd( x, sv, predicate, thisArg );
}
return findnd( x, sv, predicate, thisArg );
}
// EXPORTS //
module.exports = find;
|