All files ndarray.js

100% Statements 67/67
100% Branches 10/10
100% Functions 1/1
100% Lines 67/67

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 683x 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 54x 54x 54x 54x 54x 54x 8x 8x 46x 46x 54x 129x 63x 63x 39x 39x 63x 90x 90x 7x 54x 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';
 
// MAIN //
 
/**
* Returns the index of the n-th occurrence of a specified search element in a double-precision floating-point strided array using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {PositiveInteger} k - occurrence number
* @param {number} searchElement - search element
* @param {Float64Array} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {integer} index
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
*
* var x = new Float64Array( [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, 3.0 ] );
*
* var idx = dnthIndexOf( x.length, 2, 3.0, x, 1, 0 );
* // returns 7
*/
function dnthIndexOf( N, k, searchElement, x, strideX, offsetX ) {
	var count;
	var ix;
	var i;
 
	if ( N <= 0 || k <= 0 ) {
		return -1;
	}
	ix = offsetX;
	count = 0;
	for ( i = 0; i < N; i++ ) {
		if ( x[ ix ] === searchElement ) {
			count += 1;
			if ( count === k ) {
				return i;
			}
		}
		ix += strideX;
	}
	return -1;
}
 
 
// EXPORTS //
 
module.exports = dnthIndexOf;