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 | 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 10x 10x 3x 3x 10x 3x 3x 4x 10x 2x 2x 2x 2x 2x | /**
* @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 format = require( '@stdlib/string/format' );
var base = require( './base.js' );
// MAIN //
/**
* Generates a permutation list to merge the entries of two independently sorted sets into a single set sorted in ascending order.
*
* ## Notes
*
* - `A` should have `N1` + `N2` elements.
* - `index` should have `N1` + `N2` elements and is overwritten with indices of array `A` such that the elements are in ascending order.
*
* @name dlamrg
* @type {Function}
* @param {number} N1 - the length of the first sorted list to be merged.
* @param {number} N2 - the length of the second sorted list to be merged.
* @param {Float64Array} A - the array containing the first and the second sorted lists to be merged.
* @param {integer} strideA - stride length for `A`
* @param {NonNegativeInteger} offsetA - starting index of `A`
* @param {integer} DTRD1 - stride for first `N1` elements in `A`.
* @param {integer} DTRD2 - stride for first `N2` elements in `A`.
* @param {Int32Array} index - the array containing the indices of elements of `A` such that they are in ascending order.
* @param {integer} strideIndex - stride length for `index`.
* @param {NonNegativeInteger} offsetIndex - starting index of `index`.
* @throws {RangeError} first and second argument(s) must be a nonnegative integer
* @returns {integer} status code
*
* @example
* var Float64Array = require( '@stdlib/array/float64' );
* var Int32Array = require( '@stdlib/array/int32' )
*
* var A = new Float64Array( [ 1.0, 3.0, 2.0, 4.0, 5.0 ] );
* var index = new Int32Array( 5 );
*
* dlamrg( 2, 3, A, 1, 0, 1, 1, index, 1, 0 );
* // index => <Int32Array>[ 0, 2, 1, 3, 4 ]
*/
function dlamrg( N1, N2, A, strideA, offsetA, DTRD1, DTRD2, index, strideIndex, offsetIndex ) {
if ( N1 < 0 ) {
throw new RangeError( format( 'invalid argument. First argument must be a nonnegative integer. Value: `%d`.', N1 ) );
}
if ( N2 < 0 ) {
throw new RangeError( format( 'invalid argument. Second argument must be a nonnegative integer. Value: `%d`.', N2 ) );
}
return base( N1, N2, A, strideA, offsetA, DTRD1, DTRD2, index, strideIndex, offsetIndex );
}
// EXPORTS //
module.exports = dlamrg;
|