All files ndarray.js

100% Statements 70/70
100% Branches 11/11
100% Functions 1/1
100% Lines 70/70

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 713x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 73x 73x 73x 73x 73x 73x 8x 8x 65x 73x 32x 32x 33x 73x 73x 25x 25x 48x 48x 8x 73x 3x 3x 3x 3x 3x  
/**
* @license Apache-2.0
*
* Copyright (c) 2026 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 arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var accessors = require( './accessors.js' );
 
 
// MAIN //
 
/**
* Returns the index of the first element in a strided array which is greater than or equal to a specified search element using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {*} searchElement - search element
* @param {Collection} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {integer} index
*
* @example
* var x = [ 0.0, 0.0, 1.0, 0.0 ];
*
* var idx = gindexOfGreaterThanEqual( x.length, 1.0, x, 1, 0 );
* // returns 2
*/
function gindexOfGreaterThanEqual( N, searchElement, x, strideX, offsetX ) {
	var ix;
	var o;
	var i;
 
	if ( N <= 0 ) {
		return -1;
	}
	o = arraylike2object( x );
	if ( o.accessorProtocol ) {
		return accessors( N, searchElement, o, strideX, offsetX );
	}
	ix = offsetX;
	for ( i = 0; i < N; i++ ) {
		if ( x[ ix ] >= searchElement ) {
			return i;
		}
		ix += strideX;
	}
	return -1;
}
 
 
// EXPORTS //
 
module.exports = gindexOfGreaterThanEqual;