All files ndarray.js

100% Statements 102/102
100% Branches 15/15
100% Functions 1/1
100% Lines 102/102

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 1033x 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 49x 49x 49x 49x 49x 49x 49x 49x 49x 49x 49x 49x 4x 4x 45x 45x 49x 22x 22x 22x 23x 23x 23x 23x 23x 23x 23x 23x 23x 49x 67x 67x 67x 67x 23x 49x 44x 44x 44x 130x 44x 130x 86x 86x 130x 130x 44x 23x 49x 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 //
 
/**
* Generates a companion matrix using alternative indexing semantics.
*
* @param {NonNegativeInteger} N - number of indexed elements in `x`
* @param {Collection} x - input array containing polynomial coefficients
* @param {integer} strideX - stride length for `x`
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {Collection} out - output array
* @param {integer} strideOut1 - stride length for the first dimension of `out`
* @param {integer} strideOut2 - stride length for the second dimension of `out`
* @param {NonNegativeInteger} offsetOut - starting index for `out`
* @returns {Collection} output matrix
*
* @example
* var x = [ 1.0, 2.0, 3.0 ];
* var out = [ 0.0, 0.0, 0.0, 0.0 ];
*
* gcompanion( 3, x, 1, 0, out, 2, 1, 0 );
* // out => [ -2.0, -3.0, 1.0, 0.0 ]
*/
function gcompanion( N, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut ) { // eslint-disable-line max-len
	var ox;
	var oo;
	var ix;
	var io;
	var ij;
	var M;
	var v;
	var i;
	var j;
 
	if ( N <= 1 ) {
		return out;
	}
	ox = arraylike2object( x );
	oo = arraylike2object( out );
	if ( ox.accessorProtocol || oo.accessorProtocol ) {
		accessors( N, ox, strideX, offsetX, oo, strideOut1, strideOut2, offsetOut ); // eslint-disable-line max-len
		return out;
	}
	M = N - 1;
 
	// Cache the leading coefficient:
	v = x[ offsetX ];
 
	// Fill the first row with the remaining coefficients negated and normalized by the leading coefficient...
	ix = offsetX + strideX;
	io = offsetOut;
	ij = io;
	for ( j = 0; j < M; j++ ) {
		out[ ij ] = -x[ ix ] / v;
		ix += strideX;
		ij += strideOut2;
	}
	// Fill the remaining rows with ones along the first subdiagonal and zeros elsewhere...
	for ( i = 1; i < M; i++ ) {
		io += strideOut1;
		ij = io;
		for ( j = 0; j < M; j++ ) {
			if ( j === i-1 ) {
				out[ ij ] = 1.0;
			} else {
				out[ ij ] = 0.0;
			}
			ij += strideOut2;
		}
	}
	return out;
}
 
 
// EXPORTS //
 
module.exports = gcompanion;