All files accessors.js

100% Statements 115/115
100% Branches 7/7
100% Functions 1/1
100% Lines 115/115

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 1163x 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 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 28x 80x 54x 54x 54x 26x 26x 26x 26x 26x 26x 80x 35x 35x 35x 35x 35x 35x 26x 26x 26x 26x 26x 28x 28x 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.
*/
 
/* eslint-disable max-len, max-params */
 
'use strict';
 
// MODULES //
 
var gcopy = require( '@stdlib/blas/base/gcopy' ).ndarray;
 
 
// MAIN //
 
/**
* Permutes the rows of a matrix according to the specified strided permutation array.
*
* @private
* @param {NonNegativeInteger} M - number of rows in matrix `A`
* @param {NonNegativeInteger} N - number of columns in matrix `A`
* @param {Object} A - input matrix object
* @param {Collection} A.data - input matrix data
* @param {Array<Function>} A.accessors - matrix element accessors
* @param {integer} strideA1 - stride length for the first dimension of `A`
* @param {integer} strideA2 - stride length for the second dimension of `A`
* @param {NonNegativeInteger} offsetA - starting index for `A`
* @param {Object} ip - permutation index array object
* @param {Collection} ip.data - permutation index array data
* @param {Array<Function>} ip.accessors - permutation index array element accessors
* @param {integer} strideIp - stride length for `ip`
* @param {NonNegativeInteger} offsetIp - starting index for `ip`
* @param {Object} workspace - workspace array object
* @param {Collection} workspace.data - workspace array data
* @param {Array<Function>} workspace.accessors - workspace array element accessors
* @param {integer} strideW - stride length for `workspace`
* @param {NonNegativeInteger} offsetW - starting index for `workspace`
* @returns {Object} `A`
*
* @example
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
*
* var A = [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ];
* var ip = [ 2, 0, 1 ];
* var workspace = [ 0.0, 0.0 ];
*
* gpermuteRows( 3, 2, arraylike2object( toAccessorArray( A ) ), 2, 1, 0, arraylike2object( toAccessorArray( ip ) ), 1, 0, arraylike2object( toAccessorArray( workspace ) ), 1, 0 );
* // A => [ 5.0, 6.0, 1.0, 2.0, 3.0, 4.0 ]
*/
function gpermuteRows( M, N, A, strideA1, strideA2, offsetA, ip, strideIp, offsetIp, workspace, strideW, offsetW ) {
	var abuf;
	var pbuf;
	var wbuf;
	var pget;
	var pset;
	var pp;
	var i;
	var j;
	var k;
 
	// Cache references to array data:
	abuf = A.data;
	pbuf = ip.data;
	wbuf = workspace.data;
 
	// Cache references to the element accessors:
	pget = ip.accessors[ 0 ];
	pset = ip.accessors[ 1 ];
 
	pp = offsetIp;
	for ( i = 0; i < M; i++ ) {
		if ( pget( pbuf, pp ) === i ) {
			pp += strideIp;
			continue;
		}
		// Save row `i` into the workspace...
		gcopy( N, abuf, strideA2, offsetA+(i*strideA1), wbuf, strideW, offsetW );
 
		// Follow the permutation cycle...
		j = i;
		k = pget( pbuf, offsetIp+(j*strideIp) );
		while ( k !== i ) {
			// Copy row `k` into row `j`...
			gcopy( N, abuf, strideA2, offsetA+(k*strideA1), abuf, strideA2, offsetA+(j*strideA1) );
			pset( pbuf, offsetIp+(j*strideIp), j );
			j = k;
			k = pget( pbuf, offsetIp+(j*strideIp) );
		}
		// Close the cycle by copying the workspace into row `j`...
		gcopy( N, wbuf, strideW, offsetW, abuf, strideA2, offsetA+(j*strideA1) );
		pset( pbuf, offsetIp+(j*strideIp), j );
		pp += strideIp;
	}
	return A;
}
 
 
// EXPORTS //
 
module.exports = gpermuteRows;