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 | 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 63x 63x 63x 63x 63x 63x 63x 63x 63x 63x 2x 2x 61x 61x 61x 63x 30x 30x 30x 31x 31x 63x 93x 93x 93x 31x 31x 63x 62x 62x 31x 31x 31x 62x 62x 62x 93x 93x 93x 62x 62x 31x 63x 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-params */
'use strict';
// MODULES //
var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var accessors = require( './accessors.js' );
// MAIN //
/**
* Generates a Leslie matrix using alternative indexing semantics.
*
* @param {NonNegativeInteger} N - number of fecundity coefficients
* @param {Collection} f - fecundity coefficients
* @param {integer} strideF - stride length for `f`
* @param {NonNegativeInteger} offsetF - starting index for `f`
* @param {Collection} s - survival coefficients
* @param {integer} strideS - stride length for `s`
* @param {NonNegativeInteger} offsetS - starting index for `s`
* @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 f = [ 1.0, 2.0, 3.0 ];
* var s = [ 0.4, 0.5 ];
* var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];
*
* gleslie( 3, f, 1, 0, s, 1, 0, out, 3, 1, 0 );
* // out => [ 1.0, 2.0, 3.0, 0.4, 0.0, 0.0, 0.0, 0.5, 0.0 ]
*/
function gleslie( N, f, strideF, offsetF, s, strideS, offsetS, out, strideOut1, strideOut2, offsetOut ) { // eslint-disable-line max-len
var fo;
var so;
var oo;
var io;
var ij;
var i;
var j;
if ( N <= 0 ) {
return out;
}
fo = arraylike2object( f );
so = arraylike2object( s );
oo = arraylike2object( out );
if ( fo.accessorProtocol || so.accessorProtocol || oo.accessorProtocol ) {
accessors( N, fo, strideF, offsetF, so, strideS, offsetS, oo, strideOut1, strideOut2, offsetOut ); // eslint-disable-line max-len
return out;
}
// Set the first row to the fecundity coefficients:
ij = offsetOut;
for ( j = 0; j < N; j++ ) {
out[ ij ] = f[ offsetF + ( j * strideF ) ];
ij += strideOut2;
}
// Set the sub-diagonal to the survival coefficients and fill remaining elements with zeros:
io = offsetOut + strideOut1;
for ( i = 1; i < N; i++ ) {
ij = io;
for ( j = 0; j < i - 1; j++ ) {
out[ ij ] = 0.0;
ij += strideOut2;
}
out[ ij ] = s[ offsetS + ( ( i - 1 ) * strideS ) ];
ij += strideOut2;
for ( j = i; j < N; j++ ) {
out[ ij ] = 0.0;
ij += strideOut2;
}
io += strideOut1;
}
return out;
}
// EXPORTS //
module.exports = gleslie;
|