All files ndarray.js

100% Statements 142/142
100% Branches 21/21
100% Functions 1/1
100% Lines 142/142

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 1433x 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 3x 3x 3x 3x 3x 3x 3x 3x 41x 41x 41x 41x 41x 41x 41x 41x 41x 41x 41x 41x 4x 4x 37x 41x 6x 6x 6x 31x 31x 31x 31x 31x 41x 20x 20x 20x 20x 20x 20x 18x 30x 22x 22x 22x 22x 30x 30x 30x 30x 30x 18x 20x 12x 12x 20x 146x 146x 146x 146x 146x 146x 146x 146x 146x 146x 146x 144x 144x 144x 144x 146x 146x 146x 146x 146x 8x 8x 11x 11x 41x 16x 16x 16x 16x 16x 16x 16x 16x 16x 16x 11x 41x 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 floor = require( '@stdlib/math/base/special/floor' );
var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var accessors = require( './accessors.js' );
 
 
// VARIABLES //
 
var M = 3;
 
 
// MAIN //
 
/**
* Reverses a strided array in-place according to a mask using alternative indexing semantics.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {NumericArray} x - input array
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {NumericArray} mask - mask array
* @param {integer} strideMask - stride length for `mask`
* @param {NonNegativeInteger} offsetMask - starting index for `mask`
* @returns {NumericArray} input array
*
* @example
* var x = [ -2.0, 1.0, 3.0, -5.0, 4.0, 0.0, -1.0, -3.0 ];
* var mask = [ 0, 0, 0, 1, 0, 0, 0, 0 ];
*
* gmskrev( x.length, x, 1, 0, mask, 1, 0 );
* // x => [ -3.0, -1.0, 0.0, -5.0, 4.0, 3.0, 1.0, -2.0 ]
*/
function gmskrev( N, x, strideX, offsetX, mask, strideMask, offsetMask ) {
	var tmp;
	var ix;
	var iy;
	var im;
	var jm;
	var o;
	var m;
	var n;
	var i;
 
	if ( N <= 0 ) {
		return x;
	}
	o = arraylike2object( x );
	if ( o.accessorProtocol ) {
		accessors( N, o, strideX, offsetX, arraylike2object( mask ), strideMask, offsetMask ); // eslint-disable-line max-len
		return o.data;
	}
	n = floor( N/2 );
	ix = offsetX;
	im = offsetMask;
 
	// Use loop unrolling if the strides are equal to `1`...
	if ( strideX === 1 && strideMask === 1 ) {
		m = n % M;
		iy = ix + N - 1;
		jm = im + N - 1;
 
		// If we have a remainder, run a clean-up loop...
		if ( m > 0 ) {
			for ( i = 0; i < m; i++ ) {
				if ( mask[ im ] === 0 && mask[ jm ] === 0 ) {
					tmp = x[ ix ];
					x[ ix ] = x[ iy ];
					x[ iy ] = tmp;
				}
				ix += 1;
				im += 1;
				iy -= 1;
				jm -= 1;
			}
		}
		if ( n < M ) {
			return x;
		}
		for ( i = m; i < n; i += M ) {
			if ( mask[ im ] === 0 && mask[ jm ] === 0 ) {
				tmp = x[ ix ];
				x[ ix ] = x[ iy ];
				x[ iy ] = tmp;
			}
			if ( mask[ im+1 ] === 0 && mask[ jm-1 ] === 0 ) {
				tmp = x[ ix+1 ];
				x[ ix+1 ] = x[ iy-1 ];
				x[ iy-1 ] = tmp;
			}
			if ( mask[ im+2 ] === 0 && mask[ jm-2 ] === 0 ) {
				tmp = x[ ix+2 ];
				x[ ix+2 ] = x[ iy-2 ];
				x[ iy-2 ] = tmp;
			}
			ix += M;
			im += M;
			iy -= M;
			jm -= M;
		}
		return x;
	}
	iy = ix + ( (N-1) * strideX );
	jm = im + ( (N-1) * strideMask );
	for ( i = 0; i < n; i++ ) {
		if ( mask[ im ] === 0 && mask[ jm ] === 0 ) {
			tmp = x[ ix ];
			x[ ix ] = x[ iy ];
			x[ iy ] = tmp;
		}
		ix += strideX;
		im += strideMask;
		iy -= strideX;
		jm -= strideMask;
	}
	return x;
}
 
 
// EXPORTS //
 
module.exports = gmskrev;