-
-
Notifications
You must be signed in to change notification settings - Fork 1.2k
feat: add blas/ext/base/dcartesian-square
#10797
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from 18 commits
Commits
Show all changes
33 commits
Select commit
Hold shift + click to select a range
7a9dbd2
feat: add blas/ext/base/dcartesian-square
headlessNode 5c721ab
docs: apply suggestion from code review
headlessNode 6130af2
fix: apply suggestions from code review
headlessNode 118cf33
refactor: apply suggestions from code review
headlessNode 76228dd
fix: apply suggestions from code review
headlessNode c53582f
refactor: apply suggestions from code review
headlessNode 9dc49fa
refactor: apply suggestions from code review
headlessNode 2184ca5
fix: apply suggestions from code review
headlessNode 5aeee86
Apply suggestions from code review
kgryte ed3f207
bench: reduce allocated memory
kgryte 13c3db2
style: remove spaces
kgryte b3b3b8c
Apply suggestions from code review
kgryte 19e8c94
Apply suggestions from code review
kgryte 21e0622
Apply suggestions from code review
kgryte d6560fe
Apply suggestions from code review
kgryte 86ad7c9
Apply suggestions from code review
kgryte d25fbe0
Apply suggestions from code review
kgryte 86e1630
Apply suggestions from code review
kgryte e64462a
test: update description
kgryte 68f4696
Apply suggestions from code review
kgryte 15b01de
fix: apply suggestions from code review
headlessNode 73503f2
fix: apply suggestions from code review
headlessNode c91cbd6
Merge branch 'develop' into dcart-sq
headlessNode 63d1426
Apply suggestions from code review
kgryte c1ab742
Apply suggestions from code review
kgryte 0093bc8
Apply suggestions from code review
kgryte 6dba965
Apply suggestions from code review
kgryte 59feafc
Apply suggestions from code review
kgryte 8169530
Apply suggestions from code review
kgryte 5cf5653
Apply suggestions from code review
kgryte 3c4ac25
Apply suggestions from code review
kgryte 5405085
Apply suggestions from code review
kgryte eb4c40c
Merge remote-tracking branch 'upstream/develop' into dcart-sq
stdlib-bot File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
319 changes: 319 additions & 0 deletions
319
lib/node_modules/@stdlib/blas/ext/base/dcartesian-square/README.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,319 @@ | ||
| <!-- | ||
|
|
||
| @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. | ||
|
|
||
| --> | ||
|
|
||
| # dcartesianSquare | ||
|
|
||
| > Compute the Cartesian square for a double-precision floating-point strided array. | ||
|
|
||
| <section class="usage"> | ||
|
|
||
| ## Usage | ||
|
|
||
| ```javascript | ||
| var dcartesianSquare = require( '@stdlib/blas/ext/base/dcartesian-square' ); | ||
| ``` | ||
|
|
||
| #### dcartesianSquare( order, N, x, strideX, out, LDO ) | ||
|
|
||
| Computes the Cartesian square for a double-precision floating-point strided array. | ||
|
|
||
| ```javascript | ||
| var Float64Array = require( '@stdlib/array/float64' ); | ||
|
|
||
| var x = new Float64Array( [ 1.0, 2.0 ] ); | ||
| var out = new Float64Array( 8 ); | ||
|
|
||
| dcartesianSquare( 'row-major', x.length, x, 1, out, 2 ); | ||
| // out => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ] | ||
| ``` | ||
|
|
||
| The function has the following parameters: | ||
|
|
||
| - **order**: storage layout. Must be either `'row-major'` or `'column-major'`. | ||
| - **N**: number of indexed elements. | ||
| - **x**: input [`Float64Array`][@stdlib/array/float64]. | ||
| - **strideX**: stride length for `x`. | ||
| - **out**: output [`Float64Array`][@stdlib/array/float64]. | ||
| - **LDO**: stride length for the leading dimension of `out`. | ||
|
|
||
| The `N` and stride parameters determine which elements in the strided arrays are accessed at runtime. For example, to compute the Cartesian square of every other element: | ||
|
|
||
| ```javascript | ||
| var Float64Array = require( '@stdlib/array/float64' ); | ||
|
|
||
| var x = new Float64Array( [ 1.0, 0.0, 2.0, 0.0 ] ); | ||
| var out = new Float64Array( 8 ); | ||
|
|
||
| dcartesianSquare( 'row-major', 2, x, 2, out, 2 ); | ||
| // out => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ] | ||
| ``` | ||
|
|
||
| Note that indexing is relative to the first index. To introduce an offset, use [`typed array`][mdn-typed-array] views. | ||
|
|
||
| ```javascript | ||
| var Float64Array = require( '@stdlib/array/float64' ); | ||
|
|
||
| // Initial array... | ||
| var x0 = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] ); | ||
|
|
||
| // Create an offset view... | ||
| var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element | ||
|
|
||
|
kgryte marked this conversation as resolved.
Outdated
|
||
| var out = new Float64Array( 8 ); | ||
|
|
||
| dcartesianSquare( 'row-major', 2, x1, 1, out, 2 ); | ||
| // out => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ] | ||
| ``` | ||
|
|
||
| <!-- lint disable maximum-heading-length --> | ||
|
|
||
| #### dcartesianSquare.ndarray( N, x, strideX, offsetX, out, strideOut1, strideOut2, offsetOut ) | ||
|
|
||
| <!-- lint enable maximum-heading-length --> | ||
|
|
||
| Computes the Cartesian square for a double-precision floating-point strided array using alternative indexing semantics. | ||
|
|
||
| ```javascript | ||
| var Float64Array = require( '@stdlib/array/float64' ); | ||
|
|
||
| var x = new Float64Array( [ 1.0, 2.0 ] ); | ||
| var out = new Float64Array( 8 ); | ||
|
|
||
| dcartesianSquare.ndarray( x.length, x, 1, 0, out, 2, 1, 0 ); | ||
| // out => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ] | ||
| ``` | ||
|
|
||
| The function has the following additional parameters: | ||
|
headlessNode marked this conversation as resolved.
Outdated
|
||
|
|
||
| - **offsetX**: starting index for `x`. | ||
| - **strideOut1**: stride length of the first dimension of `out`. | ||
| - **strideOut2**: stride length of 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 parameters support indexing semantics based on starting indices. For example, to access only the last two elements: | ||
|
|
||
| ```javascript | ||
| var Float64Array = require( '@stdlib/array/float64' ); | ||
|
|
||
| var x = new Float64Array( [ 0.0, 0.0, 1.0, 2.0 ] ); | ||
| var out = new Float64Array( 8 ); | ||
|
|
||
| dcartesianSquare.ndarray( 2, x, 1, 2, out, 2, 1, 0 ); | ||
| // out => <Float64Array>[ 1.0, 1.0, 1.0, 2.0, 2.0, 1.0, 2.0, 2.0 ] | ||
| ``` | ||
|
|
||
| </section> | ||
|
|
||
| <!-- /.usage --> | ||
|
|
||
| <section class="notes"> | ||
|
|
||
| ## Notes | ||
|
headlessNode marked this conversation as resolved.
|
||
|
|
||
| - For an input array `x` of length `N`, the output array `out` must contain at least `N^2 * LDO` elements. | ||
|
kgryte marked this conversation as resolved.
Outdated
|
||
| - The `LDO` parameter must be greater than or equal to `max(1,N)`. | ||
| - If `N <= 0`, both functions return `out` unchanged. | ||
|
|
||
| </section> | ||
|
|
||
| <!-- /.notes --> | ||
|
|
||
| <section class="examples"> | ||
|
|
||
| ## Examples | ||
|
|
||
| <!-- eslint no-undef: "error" --> | ||
|
|
||
| ```javascript | ||
| var discreteUniform = require( '@stdlib/random/array/discrete-uniform' ); | ||
| var Float64Array = require( '@stdlib/array/float64' ); | ||
| var dcartesianSquare = require( '@stdlib/blas/ext/base/dcartesian-square' ); | ||
|
|
||
| var N = 2; | ||
| var x = discreteUniform( N, 1, 10, { | ||
| 'dtype': 'float64' | ||
| }); | ||
| console.log( x ); | ||
|
|
||
| var out = new Float64Array( N * N * 2 ); | ||
| dcartesianSquare( 'row-major', N, x, 1, out, 2 ); | ||
| console.log( out ); | ||
| ``` | ||
|
|
||
| </section> | ||
|
|
||
| <!-- /.examples --> | ||
|
|
||
| <!-- C interface documentation. --> | ||
|
|
||
| * * * | ||
|
|
||
| <section class="c"> | ||
|
|
||
| ## C APIs | ||
|
|
||
| <!-- Section to include introductory text. Make sure to keep an empty line after the intro `section` element and another before the `/section` close. --> | ||
|
|
||
| <section class="intro"> | ||
|
|
||
| </section> | ||
|
|
||
| <!-- /.intro --> | ||
|
|
||
| <!-- C usage documentation. --> | ||
|
|
||
| <section class="usage"> | ||
|
|
||
| ### Usage | ||
|
|
||
| ```c | ||
| #include "stdlib/blas/ext/base/dcartesiansquare.h" | ||
| ``` | ||
|
|
||
| #### stdlib_strided_dcartesian_square( order, N, \*X, strideX, \*Out, LDO ) | ||
|
|
||
| Computes the Cartesian square for a double-precision floating-point strided array. | ||
|
|
||
| ```c | ||
| #include "stdlib/blas/base/shared.h" | ||
|
|
||
| const double x[] = { 1.0, 2.0 }; | ||
| double out[ 8 ]; | ||
|
|
||
| stdlib_strided_dcartesian_square( CblasRowMajor, 2, x, 1, out, 2 ); | ||
| ``` | ||
|
|
||
| The function accepts the following arguments: | ||
|
|
||
| - **order**: `[in] CBLAS_LAYOUT` storage layout. | ||
| - **N**: `[in] CBLAS_INT` number of indexed elements. | ||
| - **X**: `[in] double*` input array. | ||
| - **strideX**: `[in] CBLAS_INT` stride length for `X`. | ||
| - **Out**: `[out] double*` output array. | ||
| - **LDO**: `[in] CBLAS_INT` stride length for the leading dimension of `Out`. Must be greater than or equal to `max(1,N)`. | ||
|
|
||
| ```c | ||
| void stdlib_strided_dcartesian_square( const CBLAS_LAYOUT order, const CBLAS_INT N, const double *X, const CBLAS_INT strideX, double *Out, const CBLAS_INT LDO ); | ||
| ``` | ||
|
|
||
| <!-- lint disable maximum-heading-length --> | ||
|
|
||
| #### stdlib_strided_dcartesian_square_ndarray( N, \*X, strideX, offsetX, \*Out, strideOut1, strideOut2, offsetOut ) | ||
|
|
||
| <!-- lint enable maximum-heading-length --> | ||
|
|
||
| Computes the Cartesian square for a double-precision floating-point strided array using alternative indexing semantics. | ||
|
|
||
| ```c | ||
| const double x[] = { 1.0, 2.0 }; | ||
| double out[ 8 ]; | ||
|
|
||
| stdlib_strided_dcartesian_square_ndarray( 2, x, 1, 0, out, 2, 1, 0 ); | ||
| ``` | ||
|
|
||
| The function accepts the following arguments: | ||
|
|
||
| - **N**: `[in] CBLAS_INT` number of indexed elements. | ||
| - **X**: `[in] double*` input array. | ||
| - **strideX**: `[in] CBLAS_INT` stride length for `X`. | ||
| - **offsetX**: `[in] CBLAS_INT` starting index for `X`. | ||
| - **Out**: `[out] double*` output array. | ||
| - **strideOut1**: `[in] CBLAS_INT` stride length of the first dimension of `Out`. | ||
| - **strideOut2**: `[in] CBLAS_INT` stride length of the second dimension of `Out`. | ||
| - **offsetOut**: `[in] CBLAS_INT` starting index for `Out`. | ||
|
|
||
| ```c | ||
| void stdlib_strided_dcartesian_square_ndarray( const CBLAS_INT N, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, double *Out, const CBLAS_INT strideOut1, const CBLAS_INT strideOut2, const CBLAS_INT offsetOut ); | ||
| ``` | ||
|
|
||
| </section> | ||
|
|
||
| <!-- /.usage --> | ||
|
|
||
| <!-- C API usage notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. --> | ||
|
|
||
| <section class="notes"> | ||
|
|
||
| </section> | ||
|
|
||
| <!-- /.notes --> | ||
|
|
||
| <!-- C API usage examples. --> | ||
|
|
||
| <section class="examples"> | ||
|
|
||
| ### Examples | ||
|
|
||
| ```c | ||
| #include "stdlib/blas/ext/base/dcartesiansquare.h" | ||
| #include "stdlib/blas/base/shared.h" | ||
| #include <stdio.h> | ||
|
|
||
| int main( void ) { | ||
| // Create a strided input array: | ||
| const double x[] = { 1.0, 2.0 }; | ||
|
|
||
| // Specify the number of indexed elements: | ||
| const int N = 2; | ||
|
|
||
| // Create an output array (N*N pairs, each pair has 2 elements): | ||
| double out[ 8 ]; | ||
|
|
||
| // Specify strides: | ||
| const int strideX = 1; | ||
| const int LDO = 2; | ||
|
|
||
| // Compute the Cartesian square: | ||
| stdlib_strided_dcartesian_square( CblasRowMajor, N, x, strideX, out, LDO ); | ||
|
|
||
| // Print the result: | ||
| for ( int i = 0; i < N*N; i++ ) { | ||
| printf( "out[ %i ] = ( %lf, %lf )\n", i, out[ i*2 ], out[ i*2+1 ] ); | ||
|
kgryte marked this conversation as resolved.
Outdated
|
||
| } | ||
| } | ||
| ``` | ||
|
|
||
| </section> | ||
|
|
||
| <!-- /.examples --> | ||
|
|
||
| </section> | ||
|
|
||
| <!-- /.c --> | ||
|
|
||
| <!-- 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"> | ||
|
|
||
| [@stdlib/array/float64]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/float64 | ||
|
|
||
| [mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray | ||
|
|
||
| </section> | ||
|
|
||
| <!-- /.links --> | ||
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.