All files ndarray.js

100% Statements 68/68
100% Branches 6/6
100% Functions 1/1
100% Lines 68/68

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 693x 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 3x 22x 22x 22x 4x 4x 18x 18x 18x 18x 18x 18x 22x 6x 6x 12x 12x 12x 22x 3x 3x 3x 3x 3x  
/**
* @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';
 
// MODULES //
 
var sindexOf = require( '@stdlib/blas/ext/base/sindex-of' ).ndarray;
 
 
// MAIN //
 
/**
* Returns the last index of a specified search element in a single-precision floating-point strided array using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {number} searchElement - search element
* @param {Float32Array} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {integer} index
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
*
* var x = new Float32Array( [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, 3.0 ] );
*
* var idx = slastIndexOf( x.length, 3.0, x, 1, 0 );
* // returns 7
*/
function slastIndexOf( N, searchElement, x, strideX, offsetX ) {
	var idx;
	if ( N <= 0 ) {
		return -1;
	}
	// Reverse the iteration order by flipping the stride and adjusting the offset:
	offsetX += ( N-1 ) * strideX;
	strideX *= -1;
 
	// Find the index of the search element in the reversed "view":
	idx = sindexOf( N, searchElement, x, strideX, offsetX );
	if ( idx < 0 ) {
		return idx;
	}
	// Convert the index from reversed "view" to an index in the original "view":
	idx = N - 1 - idx;
	return idx;
}
 
 
// EXPORTS //
 
module.exports = slastIndexOf;