Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
189 changes: 189 additions & 0 deletions lib/node_modules/@stdlib/blas/ext/base/gpascal/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,189 @@
<!--

@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.

-->

# gpascal

> Generate a Pascal matrix.

<section class="intro">

</section>

<!-- /.intro -->

<section class="usage">

## Usage

```javascript
var gpascal = require( '@stdlib/blas/ext/base/gpascal' );
```

#### gpascal( order, uplo, N, out, ldo )

Generates a Pascal matrix.

```javascript
var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];

gpascal( 'row-major', 'symmetric', 3, out, 3 );
// out => [ 1.0, 1.0, 1.0, 1.0, 2.0, 3.0, 1.0, 3.0, 6.0 ]
```

To generate a lower triangular Pascal matrix:

```javascript
var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];

gpascal( 'row-major', 'lower', 3, out, 3 );
// out => [ 1.0, 0.0, 0.0, 1.0, 1.0, 0.0, 1.0, 2.0, 1.0 ]
```

To generate an upper triangular Pascal matrix:

```javascript
var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];

gpascal( 'row-major', 'upper', 3, out, 3 );
// out => [ 1.0, 1.0, 1.0, 0.0, 1.0, 2.0, 0.0, 0.0, 1.0 ]
```

The function has the following parameters:

- **order**: storage layout.
- **uplo**: specifies which form of the Pascal matrix to generate. Must be one of `'symmetric'`, `'lower'`, or `'upper'`.
- **N**: order of the Pascal matrix.
- **out**: output array.
- **ldo**: stride between successive contiguous vectors of the matrix `out` (a.k.a., leading dimension of the matrix `out`).

Note that indexing is relative to the first index. To introduce an offset, use [`typed array`][mdn-typed-array] views.

<!-- eslint-disable stdlib/capitalized-comments, max-len -->

```javascript
var Float64Array = require( '@stdlib/array/float64' );

// Initial array:
var out0 = new Float64Array( [ 0.0, 0.0, 0.0, 0.0, 0.0 ] );

// Create an offset view:
var out1 = new Float64Array( out0.buffer, out0.BYTES_PER_ELEMENT*1 );

gpascal( 'row-major', 'symmetric', 2, out1, 2 );
// out0 => <Float64Array>[ 0.0, 1.0, 1.0, 1.0, 2.0 ]
```

#### gpascal.ndarray( uplo, N, out, strideOut1, strideOut2, offsetOut )

Generates a Pascal matrix using alternative indexing semantics.

```javascript
var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];

gpascal.ndarray( 'symmetric', 3, out, 3, 1, 0 );
// out => [ 1.0, 1.0, 1.0, 1.0, 2.0, 3.0, 1.0, 3.0, 6.0 ]
```

The function has the following additional parameters:

- **strideOut1**: stride length for the first dimension of `out`.
- **strideOut2**: stride length for the second dimension of `out`.
- **offsetOut**: starting index for `out`.

While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameter supports indexing semantics based on a starting index. For example, to start writing matrix elements from the second element of the output array:

```javascript
var out = [ 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 ];

gpascal.ndarray( 'symmetric', 3, out, 3, 1, 1 );
// out => [ 0.0, 1.0, 1.0, 1.0, 1.0, 2.0, 3.0, 1.0, 3.0, 6.0 ]
```

</section>

<!-- /.usage -->

<section class="notes">

## Notes

- If `N` is less than or equal to `0`, both functions return `out` unchanged.
- Both functions support array-like objects having getter and setter accessors for array element access (e.g., [`@stdlib/array/base/accessor`][@stdlib/array/base/accessor]).

</section>

<!-- /.notes -->

<section class="examples">

## Examples

<!-- eslint no-undef: "error" -->

```javascript
var ndarray2array = require( '@stdlib/ndarray/base/to-array' );
var shape2strides = require( '@stdlib/ndarray/base/shape2strides' );
var zeros = require( '@stdlib/array/zeros' );
var gpascal = require( '@stdlib/blas/ext/base/gpascal' );

var N = 5;
var order = 'row-major';
var shape = [ N, N ];
var strides = shape2strides( shape, order );

var out = zeros( N*N, 'generic' );

gpascal( order, 'symmetric', N, out, N );
console.log( ndarray2array( out, shape, strides, 0, order ) );
```

</section>

<!-- /.examples -->

<section class="references">

</section>

<!-- /.references -->

<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->

<section class="related">

</section>

<!-- /.related -->

<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->

<section class="links">

[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray

[@stdlib/array/base/accessor]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/base/accessor

<!-- <related-links> -->

<!-- </related-links> -->

</section>

<!-- /.links -->
103 changes: 103 additions & 0 deletions lib/node_modules/@stdlib/blas/ext/base/gpascal/benchmark/benchmark.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,103 @@
/**
* @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 bench = require( '@stdlib/bench' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var pow = require( '@stdlib/math/base/special/pow' );
var zeros = require( '@stdlib/array/zeros' );
var format = require( '@stdlib/string/format' );
var pkg = require( './../package.json' ).name;
var gpascal = require( './../lib/main.js' );


// VARIABLES //

var options = {
'dtype': 'generic'
};


// FUNCTIONS //

/**
* Creates a benchmark function.
*
* @private
* @param {PositiveInteger} len - array length
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
var out = zeros( len * len, options.dtype );
return benchmark;

/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var v;
var i;

b.tic();
for ( i = 0; i < b.iterations; i++ ) {
v = gpascal( 'row-major', 'symmetric', len, out, len );
if ( isnan( v[ i%v.length ] ) ) {
b.fail( 'should not return NaN' );
}
}
b.toc();
if ( isnan( v[ i%v.length ] ) ) {
b.fail( 'should not return NaN' );
}
b.pass( 'benchmark finished' );
b.end();
}
}


// MAIN //

/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var f;
var i;

min = 2; // 2^min
max = 10; // 2^max

for ( i = min; i <= max; i += 2 ) {
len = pow( 2, i );
f = createBenchmark( len );
bench( format( '%s:len=%d', pkg, len ), f );
}
}

main();
Original file line number Diff line number Diff line change
@@ -0,0 +1,103 @@
/**
* @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 bench = require( '@stdlib/bench' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var pow = require( '@stdlib/math/base/special/pow' );
var zeros = require( '@stdlib/array/zeros' );
var format = require( '@stdlib/string/format' );
var pkg = require( './../package.json' ).name;
var gpascal = require( './../lib/ndarray.js' );


// VARIABLES //

var options = {
'dtype': 'generic'
};


// FUNCTIONS //

/**
* Creates a benchmark function.
*
* @private
* @param {PositiveInteger} len - array length
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
var out = zeros( len * len, options.dtype );
return benchmark;

/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var v;
var i;

b.tic();
for ( i = 0; i < b.iterations; i++ ) {
v = gpascal( 'symmetric', len, out, len, 1, 0 );
if ( isnan( v[ i%v.length ] ) ) {
b.fail( 'should not return NaN' );
}
}
b.toc();
if ( isnan( v[ i%v.length ] ) ) {
b.fail( 'should not return NaN' );
}
b.pass( 'benchmark finished' );
b.end();
}
}


// MAIN //

/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var f;
var i;

min = 2; // 2^min
max = 10; // 2^max

for ( i = min; i <= max; i += 2 ) {
len = pow( 2, i );
f = createBenchmark( len );
bench( format( '%s:ndarray:len=%d', pkg, len ), f );
}
}

main();
Loading
Loading