diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/README.md b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/README.md index a9705c567d90..6a97ef2697b4 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/README.md +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/README.md @@ -93,6 +93,164 @@ console.log( v ); + + +* * * + +
+ +## C APIs + + + +
+ +
+ + + + + +
+ +### Usage + +```c +#include "stdlib/blas/ext/base/ndarray/csumkbn.h" +``` + +#### stdlib_blas_ext_csumkbn( arrays ) + +Computes the sum of all elements in a one-dimensional single-precision complex floating-point ndarray using an improved Kahan–Babuška algorithm. + +```c +#include "stdlib/complex/float32/ctor.h" +#include "stdlib/ndarray/ctor.h" +#include "stdlib/ndarray/dtypes.h" +#include "stdlib/ndarray/index_modes.h" +#include "stdlib/ndarray/orders.h" +#include "stdlib/ndarray/base/bytes_per_element.h" +#include "stdlib/complex/float32/real.h" +#include "stdlib/complex/float32/imag.h" +#include + +// Create an ndarray: +const float data[] = { 1.0f, 2.0f, 3.0f, 4.0f }; +int64_t shape[] = { 2 }; +int64_t strides[] = { STDLIB_NDARRAY_COMPLEX64_BYTES_PER_ELEMENT }; +int8_t submodes[] = { STDLIB_NDARRAY_INDEX_ERROR }; + +struct ndarray *x = stdlib_ndarray_allocate( STDLIB_NDARRAY_COMPLEX64, (uint8_t *)data, 1, shape, strides, 0, STDLIB_NDARRAY_ROW_MAJOR, STDLIB_NDARRAY_INDEX_ERROR, 1, submodes ); + +// Compute the sum: +const struct ndarray *arrays[] = { x }; +stdlib_complex64_t v = stdlib_blas_ext_csumkbn( arrays ); + +float re = stdlib_complex64_real( v ); +// returns 4.0f + +float im = stdlib_complex64_imag( v ); +// returns 6.0f + +// Free allocated memory: +stdlib_ndarray_free( x ); +``` + +The function accepts the following arguments: + +- **arrays**: `[in] struct ndarray**` list containing a one-dimensional input ndarray. + +```c +stdlib_complex64_t stdlib_blas_ext_csumkbn( const struct ndarray *arrays[] ); +``` + +
+ + + + + +
+ +
+ + + + + +
+ +### Examples + +```c +#include "stdlib/blas/ext/base/ndarray/csumkbn.h" +#include "stdlib/complex/float32/ctor.h" +#include "stdlib/complex/float32/real.h" +#include "stdlib/complex/float32/imag.h" +#include "stdlib/ndarray/ctor.h" +#include "stdlib/ndarray/dtypes.h" +#include "stdlib/ndarray/index_modes.h" +#include "stdlib/ndarray/orders.h" +#include "stdlib/ndarray/base/bytes_per_element.h" +#include +#include +#include + +int main( void ) { + // Create a data buffer: + const float data[] = { 16777216.0f, 16777216.0f, 1.0f, 2.0f, -16777216.0f, -16777216.0f }; + + // Specify the number of array dimensions: + const int64_t ndims = 1; + + // Specify the array shape: + int64_t shape[] = { 3 }; + + // Specify the array strides: + int64_t strides[] = { STDLIB_NDARRAY_COMPLEX64_BYTES_PER_ELEMENT }; + + // Specify the byte offset: + const int64_t offset = 0; + + // Specify the array order: + const enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR; + + // Specify the index mode: + const enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR; + + // Specify the subscript index modes: + int8_t submodes[] = { STDLIB_NDARRAY_INDEX_ERROR }; + const int64_t nsubmodes = 1; + + // Create an ndarray: + struct ndarray *x = stdlib_ndarray_allocate( STDLIB_NDARRAY_COMPLEX64, (uint8_t *)data, ndims, shape, strides, offset, order, imode, nsubmodes, submodes ); + if ( x == NULL ) { + fprintf( stderr, "Error allocating memory.\n" ); + exit( 1 ); + } + + // Define a list of ndarrays: + const struct ndarray *arrays[] = { x }; + + // Compute the sum: + stdlib_complex64_t v = stdlib_blas_ext_csumkbn( arrays ); + + // Print the result: + printf( "sum: %f + %fi\n", stdlib_complex64_real( v ), stdlib_complex64_imag( v ) ); + + // Free allocated memory: + stdlib_ndarray_free( x ); +} +``` + +
+ + + +
+ + +
## References diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/benchmark/benchmark.native.js b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/benchmark/benchmark.native.js new file mode 100644 index 000000000000..d7924a7bd282 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/benchmark/benchmark.native.js @@ -0,0 +1,115 @@ +/** +* @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 resolve = require( 'path' ).resolve; +var bench = require( '@stdlib/bench' ); +var uniform = require( '@stdlib/random/array/uniform' ); +var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); +var realf = require( '@stdlib/complex/float32/real' ); +var imagf = require( '@stdlib/complex/float32/imag' ); +var pow = require( '@stdlib/math/base/special/pow' ); +var Complex64Vector = require( '@stdlib/ndarray/vector/complex64' ); +var format = require( '@stdlib/string/format' ); +var tryRequire = require( '@stdlib/utils/try-require' ); +var pkg = require( './../package.json' ).name; + + +// VARIABLES // + +var csumkbn = tryRequire( resolve( __dirname, './../lib/native.js' ) ); +var opts = { + 'skip': ( csumkbn instanceof Error ) +}; + + +// FUNCTIONS // + +/** +* Creates a benchmark function. +* +* @private +* @param {PositiveInteger} len - array length +* @returns {Function} benchmark function +*/ +function createBenchmark( len ) { + var xbuf; + var x; + + xbuf = uniform( len*2, -10.0, 10.0, { + 'dtype': 'float32' + }); + x = new Complex64Vector( xbuf.buffer ); + + 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 = csumkbn( [ x ] ); + if ( isnanf( realf( v ) ) ) { + b.fail( 'should not return NaN' ); + } + } + b.toc(); + if ( isnanf( imagf( v ) ) ) { + 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 = 1; // 10^min + max = 6; // 10^max + + for ( i = min; i <= max; i++ ) { + len = pow( 10, i ); + f = createBenchmark( len ); + bench( format( '%s::native:len=%d', pkg, len ), opts, f ); + } +} + +main(); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/benchmark/c/Makefile b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/benchmark/c/Makefile new file mode 100644 index 000000000000..0756dc7da20a --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/benchmark/c/Makefile @@ -0,0 +1,146 @@ +#/ +# @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. +#/ + +# VARIABLES # + +ifndef VERBOSE + QUIET := @ +else + QUIET := +endif + +# Determine the OS ([1][1], [2][2]). +# +# [1]: https://en.wikipedia.org/wiki/Uname#Examples +# [2]: http://stackoverflow.com/a/27776822/2225624 +OS ?= $(shell uname) +ifneq (, $(findstring MINGW,$(OS))) + OS := WINNT +else +ifneq (, $(findstring MSYS,$(OS))) + OS := WINNT +else +ifneq (, $(findstring CYGWIN,$(OS))) + OS := WINNT +else +ifneq (, $(findstring Windows_NT,$(OS))) + OS := WINNT +endif +endif +endif +endif + +# Define the program used for compiling C source files: +ifdef C_COMPILER + CC := $(C_COMPILER) +else + CC := gcc +endif + +# Define the command-line options when compiling C files: +CFLAGS ?= \ + -std=c99 \ + -O3 \ + -Wall \ + -pedantic + +# Determine whether to generate position independent code ([1][1], [2][2]). +# +# [1]: https://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options +# [2]: http://stackoverflow.com/questions/5311515/gcc-fpic-option +ifeq ($(OS), WINNT) + fPIC ?= +else + fPIC ?= -fPIC +endif + +# List of includes (e.g., `-I /foo/bar -I /beep/boop/include`): +INCLUDE ?= + +# List of source files: +SOURCE_FILES ?= + +# List of libraries (e.g., `-lopenblas -lpthread`): +LIBRARIES ?= + +# List of library paths (e.g., `-L /foo/bar -L /beep/boop`): +LIBPATH ?= + +# List of C targets: +c_targets := benchmark.length.out + + +# RULES # + +#/ +# Compiles source files. +# +# @param {string} [C_COMPILER] - C compiler (e.g., `gcc`) +# @param {string} [CFLAGS] - C compiler options +# @param {(string|void)} [fPIC] - compiler flag determining whether to generate position independent code (e.g., `-fPIC`) +# @param {string} [INCLUDE] - list of includes (e.g., `-I /foo/bar -I /beep/boop/include`) +# @param {string} [SOURCE_FILES] - list of source files +# @param {string} [LIBPATH] - list of library paths (e.g., `-L /foo/bar -L /beep/boop`) +# @param {string} [LIBRARIES] - list of libraries (e.g., `-lopenblas -lpthread`) +# +# @example +# make +# +# @example +# make all +#/ +all: $(c_targets) + +.PHONY: all + +#/ +# Compiles C source files. +# +# @private +# @param {string} CC - C compiler (e.g., `gcc`) +# @param {string} CFLAGS - C compiler options +# @param {(string|void)} fPIC - compiler flag determining whether to generate position independent code (e.g., `-fPIC`) +# @param {string} INCLUDE - list of includes (e.g., `-I /foo/bar`) +# @param {string} SOURCE_FILES - list of source files +# @param {string} LIBPATH - list of library paths (e.g., `-L /foo/bar`) +# @param {string} LIBRARIES - list of libraries (e.g., `-lopenblas`) +#/ +$(c_targets): %.out: %.c + $(QUIET) $(CC) $(CFLAGS) $(fPIC) $(INCLUDE) -o $@ $(SOURCE_FILES) $< $(LIBPATH) -lm $(LIBRARIES) + +#/ +# Runs compiled benchmarks. +# +# @example +# make run +#/ +run: $(c_targets) + $(QUIET) ./$< + +.PHONY: run + +#/ +# Removes generated files. +# +# @example +# make clean +#/ +clean: + $(QUIET) -rm -f *.o *.out + +.PHONY: clean diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/benchmark/c/benchmark.length.c b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/benchmark/c/benchmark.length.c new file mode 100644 index 000000000000..44d6c752ab0a --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/benchmark/c/benchmark.length.c @@ -0,0 +1,193 @@ +/** +* @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. +*/ + +#include "stdlib/blas/ext/base/ndarray/csumkbn.h" +#include "stdlib/complex/float32/ctor.h" +#include "stdlib/complex/float32/real.h" +#include "stdlib/complex/float32/imag.h" +#include "stdlib/ndarray/ctor.h" +#include "stdlib/ndarray/dtypes.h" +#include "stdlib/ndarray/index_modes.h" +#include "stdlib/ndarray/orders.h" +#include "stdlib/ndarray/base/bytes_per_element.h" +#include +#include +#include +#include +#include +#include + +#define NAME "csumkbn" +#define ITERATIONS 1000000 +#define REPEATS 3 +#define MIN 1 +#define MAX 6 + +/** +* Prints the TAP version. +*/ +static void print_version( void ) { + printf( "TAP version 13\n" ); +} + +/** +* Prints the TAP summary. +* +* @param total total number of tests +* @param passing total number of passing tests +*/ +static void print_summary( int total, int passing ) { + printf( "#\n" ); + printf( "1..%d\n", total ); // TAP plan + printf( "# total %d\n", total ); + printf( "# pass %d\n", passing ); + printf( "#\n" ); + printf( "# ok\n" ); +} + +/** +* Prints benchmarks results. +* +* @param iterations number of iterations +* @param elapsed elapsed time in seconds +*/ +static void print_results( int iterations, double elapsed ) { + double rate = (double)iterations / elapsed; + printf( " ---\n" ); + printf( " iterations: %d\n", iterations ); + printf( " elapsed: %0.9f\n", elapsed ); + printf( " rate: %0.9f\n", rate ); + printf( " ...\n" ); +} + +/** +* Returns a clock time. +* +* @return clock time +*/ +static double tic( void ) { + struct timeval now; + gettimeofday( &now, NULL ); + return (double)now.tv_sec + (double)now.tv_usec/1.0e6; +} + +/** +* Generates a random number on the interval [0,1). +* +* @return random number +*/ +static float rand_float( void ) { + int r = rand(); + return (float)r / ( (float)RAND_MAX + 1.0f ); +} + +/** +* Runs a benchmark. +* +* @param iterations number of iterations +* @param len array length +* @return elapsed time in seconds +*/ +static double benchmark( int iterations, int len ) { + enum STDLIB_NDARRAY_INDEX_MODE imode; + const struct ndarray *arrays[ 1 ]; + enum STDLIB_NDARRAY_ORDER order; + int8_t submodes[ 1 ]; + int64_t strides[ 1 ]; + int64_t shape[ 1 ]; + int64_t nsubmodes; + struct ndarray *x; + stdlib_complex64_t v; + int64_t offset; + double elapsed; + int64_t ndims; + float *data; + double t; + float r; + int i; + + ndims = 1; + shape[ 0 ] = len; + strides[ 0 ] = STDLIB_NDARRAY_COMPLEX64_BYTES_PER_ELEMENT; + offset = 0; + order = STDLIB_NDARRAY_ROW_MAJOR; + imode = STDLIB_NDARRAY_INDEX_ERROR; + submodes[ 0 ] = imode; + nsubmodes = 1; + + data = (float *) malloc( len * 2 * sizeof( float ) ); + for ( i = 0; i < len*2; i += 2 ) { + r = ( rand_float() * 20000.0f ) - 10000.0f; + data[ i ] = r; + data[ i+1 ] = r; + } + // cppcheck-suppress invalidPointerCast + x = stdlib_ndarray_allocate( STDLIB_NDARRAY_COMPLEX64, (uint8_t *)data, ndims, shape, strides, offset, order, imode, nsubmodes, submodes ); + arrays[ 0 ] = x; + + v = stdlib_complex64( 0.0f, 0.0f ); + t = tic(); + for ( i = 0; i < iterations; i++ ) { + v = stdlib_blas_ext_csumkbn( arrays ); + r = stdlib_complex64_real( v ); + if ( r != r ) { + printf( "should not return NaN\n" ); + break; + } + } + elapsed = tic() - t; + r = stdlib_complex64_imag( v ); + if ( r != r ) { + printf( "should not return NaN\n" ); + } + stdlib_ndarray_free( x ); + free( data ); + arrays[ 0 ] = NULL; + + return elapsed; +} + +/** +* Main execution sequence. +*/ +int main( void ) { + double elapsed; + int count; + int iter; + int len; + int i; + int j; + + // Use the current time to seed the random number generator: + srand( time( NULL ) ); + + print_version(); + count = 0; + for ( i = MIN; i <= MAX; i++ ) { + len = pow( 10, i ); + iter = ITERATIONS / pow( 10, i-1 ); + for ( j = 0; j < REPEATS; j++ ) { + count += 1; + printf( "# c::%s:len=%d\n", NAME, len ); + elapsed = benchmark( iter, len ); + print_results( iter, elapsed ); + printf( "ok %d benchmark finished\n", count ); + } + } + print_summary( count, count ); +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/binding.gyp b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/binding.gyp new file mode 100644 index 000000000000..0d6508a12e99 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/binding.gyp @@ -0,0 +1,170 @@ +# @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. + +# A `.gyp` file for building a Node.js native add-on. +# +# [1]: https://gyp.gsrc.io/docs/InputFormatReference.md +# [2]: https://gyp.gsrc.io/docs/UserDocumentation.md +{ + # List of files to include in this file: + 'includes': [ + './include.gypi', + ], + + # Define variables to be used throughout the configuration for all targets: + 'variables': { + # Target name should match the add-on export name: + 'addon_target_name%': 'addon', + + # Set variables based on the host OS: + 'conditions': [ + [ + 'OS=="win"', + { + # Define the object file suffix: + 'obj': 'obj', + }, + { + # Define the object file suffix: + 'obj': 'o', + } + ], # end condition (OS=="win") + ], # end conditions + }, # end variables + + # Define compile targets: + 'targets': [ + + # Target to generate an add-on: + { + # The target name should match the add-on export name: + 'target_name': '<(addon_target_name)', + + # Define dependencies: + 'dependencies': [], + + # Define directories which contain relevant include headers: + 'include_dirs': [ + # Local include directory: + '<@(include_dirs)', + ], + + # List of source files: + 'sources': [ + '<@(src_files)', + ], + + # Settings which should be applied when a target's object files are used as linker input: + 'link_settings': { + # Define libraries: + 'libraries': [ + '<@(libraries)', + ], + + # Define library directories: + 'library_dirs': [ + '<@(library_dirs)', + ], + }, + + # C/C++ compiler flags: + 'cflags': [ + # Enable commonly used warning options: + '-Wall', + + # Aggressive optimization: + '-O3', + ], + + # C specific compiler flags: + 'cflags_c': [ + # Specify the C standard to which a program is expected to conform: + '-std=c99', + ], + + # C++ specific compiler flags: + 'cflags_cpp': [ + # Specify the C++ standard to which a program is expected to conform: + '-std=c++11', + ], + + # Linker flags: + 'ldflags': [], + + # Apply conditions based on the host OS: + 'conditions': [ + [ + 'OS=="mac"', + { + # Linker flags: + 'ldflags': [ + '-undefined dynamic_lookup', + '-Wl,-no-pie', + '-Wl,-search_paths_first', + ], + }, + ], # end condition (OS=="mac") + [ + 'OS!="win"', + { + # C/C++ flags: + 'cflags': [ + # Generate platform-independent code: + '-fPIC', + ], + }, + ], # end condition (OS!="win") + ], # end conditions + }, # end target <(addon_target_name) + + # Target to copy a generated add-on to a standard location: + { + 'target_name': 'copy_addon', + + # Declare that the output of this target is not linked: + 'type': 'none', + + # Define dependencies: + 'dependencies': [ + # Require that the add-on be generated before building this target: + '<(addon_target_name)', + ], + + # Define a list of actions: + 'actions': [ + { + 'action_name': 'copy_addon', + 'message': 'Copying addon...', + + # Explicitly list the inputs in the command-line invocation below: + 'inputs': [], + + # Declare the expected outputs: + 'outputs': [ + '<(addon_output_dir)/<(addon_target_name).node', + ], + + # Define the command-line invocation: + 'action': [ + 'cp', + '<(PRODUCT_DIR)/<(addon_target_name).node', + '<(addon_output_dir)/<(addon_target_name).node', + ], + }, + ], # end actions + }, # end target copy_addon + ], # end targets +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/examples/c/Makefile b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/examples/c/Makefile new file mode 100644 index 000000000000..c8f8e9a1517b --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/examples/c/Makefile @@ -0,0 +1,146 @@ +#/ +# @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. +#/ + +# VARIABLES # + +ifndef VERBOSE + QUIET := @ +else + QUIET := +endif + +# Determine the OS ([1][1], [2][2]). +# +# [1]: https://en.wikipedia.org/wiki/Uname#Examples +# [2]: http://stackoverflow.com/a/27776822/2225624 +OS ?= $(shell uname) +ifneq (, $(findstring MINGW,$(OS))) + OS := WINNT +else +ifneq (, $(findstring MSYS,$(OS))) + OS := WINNT +else +ifneq (, $(findstring CYGWIN,$(OS))) + OS := WINNT +else +ifneq (, $(findstring Windows_NT,$(OS))) + OS := WINNT +endif +endif +endif +endif + +# Define the program used for compiling C source files: +ifdef C_COMPILER + CC := $(C_COMPILER) +else + CC := gcc +endif + +# Define the command-line options when compiling C files: +CFLAGS ?= \ + -std=c99 \ + -O3 \ + -Wall \ + -pedantic + +# Determine whether to generate position independent code ([1][1], [2][2]). +# +# [1]: https://gcc.gnu.org/onlinedocs/gcc/Code-Gen-Options.html#Code-Gen-Options +# [2]: http://stackoverflow.com/questions/5311515/gcc-fpic-option +ifeq ($(OS), WINNT) + fPIC ?= +else + fPIC ?= -fPIC +endif + +# List of includes (e.g., `-I /foo/bar -I /beep/boop/include`): +INCLUDE ?= + +# List of source files: +SOURCE_FILES ?= + +# List of libraries (e.g., `-lopenblas -lpthread`): +LIBRARIES ?= + +# List of library paths (e.g., `-L /foo/bar -L /beep/boop`): +LIBPATH ?= + +# List of C targets: +c_targets := example.out + + +# RULES # + +#/ +# Compiles source files. +# +# @param {string} [C_COMPILER] - C compiler (e.g., `gcc`) +# @param {string} [CFLAGS] - C compiler options +# @param {(string|void)} [fPIC] - compiler flag determining whether to generate position independent code (e.g., `-fPIC`) +# @param {string} [INCLUDE] - list of includes (e.g., `-I /foo/bar -I /beep/boop/include`) +# @param {string} [SOURCE_FILES] - list of source files +# @param {string} [LIBPATH] - list of library paths (e.g., `-L /foo/bar -L /beep/boop`) +# @param {string} [LIBRARIES] - list of libraries (e.g., `-lopenblas -lpthread`) +# +# @example +# make +# +# @example +# make all +#/ +all: $(c_targets) + +.PHONY: all + +#/ +# Compiles C source files. +# +# @private +# @param {string} CC - C compiler (e.g., `gcc`) +# @param {string} CFLAGS - C compiler options +# @param {(string|void)} fPIC - compiler flag determining whether to generate position independent code (e.g., `-fPIC`) +# @param {string} INCLUDE - list of includes (e.g., `-I /foo/bar`) +# @param {string} SOURCE_FILES - list of source files +# @param {string} LIBPATH - list of library paths (e.g., `-L /foo/bar`) +# @param {string} LIBRARIES - list of libraries (e.g., `-lopenblas`) +#/ +$(c_targets): %.out: %.c + $(QUIET) $(CC) $(CFLAGS) $(fPIC) $(INCLUDE) -o $@ $(SOURCE_FILES) $< $(LIBPATH) -lm $(LIBRARIES) + +#/ +# Runs compiled examples. +# +# @example +# make run +#/ +run: $(c_targets) + $(QUIET) ./$< + +.PHONY: run + +#/ +# Removes generated files. +# +# @example +# make clean +#/ +clean: + $(QUIET) -rm -f *.o *.out + +.PHONY: clean diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/examples/c/example.c b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/examples/c/example.c new file mode 100644 index 000000000000..177f4dcbaa06 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/examples/c/example.c @@ -0,0 +1,77 @@ +/** +* @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. +*/ + +#include "stdlib/blas/ext/base/ndarray/csumkbn.h" +#include "stdlib/complex/float32/ctor.h" +#include "stdlib/complex/float32/real.h" +#include "stdlib/complex/float32/imag.h" +#include "stdlib/ndarray/ctor.h" +#include "stdlib/ndarray/dtypes.h" +#include "stdlib/ndarray/index_modes.h" +#include "stdlib/ndarray/orders.h" +#include "stdlib/ndarray/base/bytes_per_element.h" +#include +#include +#include + +int main( void ) { + // Create a data buffer: + const float data[] = { 16777216.0f, 16777216.0f, 1.0f, 2.0f, -16777216.0f, -16777216.0f }; + + // Specify the number of array dimensions: + const int64_t ndims = 1; + + // Specify the array shape: + int64_t shape[] = { 3 }; + + // Specify the array strides: + int64_t strides[] = { STDLIB_NDARRAY_COMPLEX64_BYTES_PER_ELEMENT }; + + // Specify the byte offset: + const int64_t offset = 0; + + // Specify the array order: + const enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR; + + // Specify the index mode: + const enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR; + + // Specify the subscript index modes: + int8_t submodes[] = { STDLIB_NDARRAY_INDEX_ERROR }; + const int64_t nsubmodes = 1; + + // Create an ndarray: + // cppcheck-suppress invalidPointerCast + struct ndarray *x = stdlib_ndarray_allocate( STDLIB_NDARRAY_COMPLEX64, (uint8_t *)data, ndims, shape, strides, offset, order, imode, nsubmodes, submodes ); + if ( x == NULL ) { + fprintf( stderr, "Error allocating memory.\n" ); + exit( 1 ); + } + + // Define a list of ndarrays: + const struct ndarray *arrays[] = { x }; + + // Compute the sum: + stdlib_complex64_t v = stdlib_blas_ext_csumkbn( arrays ); + + // Print the result: + printf( "sum: %f + %fi\n", stdlib_complex64_real( v ), stdlib_complex64_imag( v ) ); + + // Free allocated memory: + stdlib_ndarray_free( x ); +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/include.gypi b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/include.gypi new file mode 100644 index 000000000000..bee8d41a2caf --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/include.gypi @@ -0,0 +1,53 @@ +# @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. + +# A GYP include file for building a Node.js native add-on. +# +# Main documentation: +# +# [1]: https://gyp.gsrc.io/docs/InputFormatReference.md +# [2]: https://gyp.gsrc.io/docs/UserDocumentation.md +{ + # Define variables to be used throughout the configuration for all targets: + 'variables': { + # Source directory: + 'src_dir': './src', + + # Include directories: + 'include_dirs': [ + '} arrays - array-like object containing ndarrays +* @returns {Complex64} sum +* +* @example +* var Complex64Vector = require( '@stdlib/ndarray/vector/complex64' ); +* +* var x = new Complex64Vector( [ 1.0, 3.0, 4.0, 2.0 ] ); +* +* var v = csumkbn( [ x ] ); +* // returns [ 5.0, 5.0 ] +*/ +function csumkbn( arrays ) { + var x = arrays[ 0 ]; + var o = addon( reinterpret( getData( x ), 0 ), serialize( x ) ); + return new Complex64( o.re, o.im ); +} + + +// EXPORTS // + +module.exports = csumkbn; diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/manifest.json b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/manifest.json new file mode 100644 index 000000000000..46cd0b689bda --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/manifest.json @@ -0,0 +1,120 @@ +{ + "options": { + "task": "build", + "wasm": false + }, + "fields": [ + { + "field": "src", + "resolve": true, + "relative": true + }, + { + "field": "include", + "resolve": true, + "relative": true + }, + { + "field": "libraries", + "resolve": false, + "relative": false + }, + { + "field": "libpath", + "resolve": true, + "relative": false + } + ], + "confs": [ + { + "task": "build", + "wasm": false, + "src": [ + "./src/main.c" + ], + "include": [ + "./include" + ], + "libraries": [], + "libpath": [], + "dependencies": [ + "@stdlib/blas/base/shared", + "@stdlib/blas/ext/base/csumkbn", + "@stdlib/complex/float32/ctor", + "@stdlib/complex/float32/real", + "@stdlib/complex/float32/imag", + "@stdlib/ndarray/ctor", + "@stdlib/ndarray/base/napi/addon-arguments", + "@stdlib/napi/export", + "@stdlib/napi/argv", + "@stdlib/napi/create-complex-like" + ] + }, + { + "task": "benchmark", + "wasm": false, + "src": [ + "./src/main.c" + ], + "include": [ + "./include" + ], + "libraries": [], + "libpath": [], + "dependencies": [ + "@stdlib/blas/base/shared", + "@stdlib/blas/ext/base/csumkbn", + "@stdlib/complex/float32/ctor", + "@stdlib/complex/float32/real", + "@stdlib/complex/float32/imag", + "@stdlib/ndarray/ctor", + "@stdlib/ndarray/dtypes", + "@stdlib/ndarray/index-modes", + "@stdlib/ndarray/orders", + "@stdlib/ndarray/base/bytes-per-element" + ] + }, + { + "task": "examples", + "wasm": false, + "src": [ + "./src/main.c" + ], + "include": [ + "./include" + ], + "libraries": [], + "libpath": [], + "dependencies": [ + "@stdlib/blas/base/shared", + "@stdlib/blas/ext/base/csumkbn", + "@stdlib/complex/float32/ctor", + "@stdlib/complex/float32/real", + "@stdlib/complex/float32/imag", + "@stdlib/ndarray/ctor", + "@stdlib/ndarray/dtypes", + "@stdlib/ndarray/index-modes", + "@stdlib/ndarray/orders", + "@stdlib/ndarray/base/bytes-per-element" + ] + }, + { + "task": "", + "wasm": true, + "src": [ + "./src/main.c" + ], + "include": [ + "./include" + ], + "libraries": [], + "libpath": [], + "dependencies": [ + "@stdlib/blas/base/shared", + "@stdlib/blas/ext/base/csumkbn", + "@stdlib/complex/float32/ctor", + "@stdlib/ndarray/ctor" + ] + } + ] +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/package.json b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/package.json index 9bf6d2ddafd5..d1c69b2d8b15 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/package.json +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/package.json @@ -14,11 +14,15 @@ } ], "main": "./lib", + "browser": "./lib/main.js", + "gypfile": true, "directories": { "benchmark": "./benchmark", "doc": "./docs", "example": "./examples", + "include": "./include", "lib": "./lib", + "src": "./src", "test": "./test" }, "types": "./docs/types", diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/src/Makefile b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/src/Makefile new file mode 100644 index 000000000000..2caf905cedbe --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/src/Makefile @@ -0,0 +1,70 @@ +#/ +# @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. +#/ + +# VARIABLES # + +ifndef VERBOSE + QUIET := @ +else + QUIET := +endif + +# Determine the OS ([1][1], [2][2]). +# +# [1]: https://en.wikipedia.org/wiki/Uname#Examples +# [2]: http://stackoverflow.com/a/27776822/2225624 +OS ?= $(shell uname) +ifneq (, $(findstring MINGW,$(OS))) + OS := WINNT +else +ifneq (, $(findstring MSYS,$(OS))) + OS := WINNT +else +ifneq (, $(findstring CYGWIN,$(OS))) + OS := WINNT +else +ifneq (, $(findstring Windows_NT,$(OS))) + OS := WINNT +endif +endif +endif +endif + + +# RULES # + +#/ +# Removes generated files for building an add-on. +# +# @example +# make clean-addon +#/ +clean-addon: + $(QUIET) -rm -f *.o *.node + +.PHONY: clean-addon + +#/ +# Removes generated files. +# +# @example +# make clean +#/ +clean: clean-addon + +.PHONY: clean diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/src/addon.c b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/src/addon.c new file mode 100644 index 000000000000..3ca6f8da6e7c --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/src/addon.c @@ -0,0 +1,63 @@ +/** +* @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. +*/ + +#include "stdlib/blas/ext/base/ndarray/csumkbn.h" +#include "stdlib/complex/float32/ctor.h" +#include "stdlib/complex/float32/real.h" +#include "stdlib/complex/float32/imag.h" +#include "stdlib/ndarray/ctor.h" +#include "stdlib/ndarray/base/napi/addon_arguments.h" +#include "stdlib/napi/export.h" +#include "stdlib/napi/argv.h" +#include "stdlib/napi/create_complex_like.h" +#include +#include + +/** +* Receives JavaScript callback invocation data. +* +* @param env environment under which the function is invoked +* @param info callback data +* @return Node-API value +*/ +static napi_value addon( napi_env env, napi_callback_info info ) { + STDLIB_NAPI_ARGV( env, info, argv, argc, 2 ); + + // Process provided arguments: + struct ndarray *arrays[ 1 ]; + napi_value err; + napi_status status = stdlib_ndarray_napi_addon_arguments( env, argv, 2, 1, arrays, &err ); + assert( status == napi_ok ); + if ( err != NULL ) { + status = napi_throw( env, err ); + assert( status == napi_ok ); + return NULL; + } + // Perform computation: + const struct ndarray *arr[ 1 ] = { arrays[ 0 ] }; + stdlib_complex64_t z = stdlib_blas_ext_csumkbn( arr ); + STDLIB_NAPI_CREATE_COMPLEX_LIKE( env, (double)stdlib_complex64_real( z ), (double)stdlib_complex64_imag( z ), v ); + + // Free allocated memory: + stdlib_ndarray_free( arrays[ 0 ] ); + arrays[ 0 ] = NULL; + + return v; +} + +STDLIB_NAPI_MODULE_EXPORT_FCN( addon ) diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/src/main.c b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/src/main.c new file mode 100644 index 000000000000..11d709b74b92 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/src/main.c @@ -0,0 +1,34 @@ +/** +* @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. +*/ + +#include "stdlib/blas/ext/base/ndarray/csumkbn.h" +#include "stdlib/blas/ext/base/csumkbn.h" +#include "stdlib/complex/float32/ctor.h" +#include "stdlib/ndarray/ctor.h" +#include "stdlib/blas/base/shared.h" + +/** +* Computes the sum of all elements in a one-dimensional single-precision complex floating-point ndarray using an improved Kahan–Babuška algorithm. +* +* @param arrays list containing an input ndarray +* @return sum +*/ +stdlib_complex64_t stdlib_blas_ext_csumkbn( const struct ndarray *arrays[] ) { + const struct ndarray *x = arrays[ 0 ]; + return API_SUFFIX(stdlib_strided_csumkbn_ndarray)( stdlib_ndarray_dimension( x, 0 ), (const stdlib_complex64_t *)stdlib_ndarray_data( x ), stdlib_ndarray_stride_elements( x, 0 ), stdlib_ndarray_offset_elements( x ) ); +} diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.js b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.js index 63acb590470d..3fe1814bfbdf 100644 --- a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.js +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.js @@ -25,6 +25,8 @@ var isSameComplex64 = require( '@stdlib/assert/is-same-complex64' ); var Complex64Array = require( '@stdlib/array/complex64' ); var Complex64 = require( '@stdlib/complex/float32/ctor' ); var ndarray = require( '@stdlib/ndarray/base/ctor' ); +var Float32Array = require( '@stdlib/array/float32' ); +var reinterpret = require( '@stdlib/strided/base/reinterpret-complex64' ); var csumkbn = require( './../lib' ); @@ -197,3 +199,115 @@ tape( 'the function supports one-dimensional ndarrays having non-zero offsets', t.end(); }); + +tape( 'the function compensates cancellation independently in real and imaginary components', function test( t ) { + var x; + var v; + + // Exactly representable float32 powers of two have a mathematical sum of 1+2i: + x = new Complex64Array([ + 16777216.0, + 16777216.0, + 1.0, + 2.0, + -16777216.0, + -16777216.0 + ]); + v = csumkbn( [ vector( x, 3, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'recovers low-order components' ); + t.strictEqual( v instanceof Complex64, true, 'returns a Complex64 instance' ); + + // With 2^100, naive summation loses the middle terms even in double precision: + x = new Complex64Array([ + 1.2676506002282294e30, + -1.2676506002282294e30, + 1.0, + 2.0, + -1.2676506002282294e30, + 1.2676506002282294e30 + ]); + v = csumkbn( [ vector( x, 3, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'compensates large cancellation' ); + t.end(); +}); + +tape( 'the function preserves compensated sums for reversed and offset views without mutating their buffers', function test( t ) { + var data; + var x; + var v; + + data = [ + 91.0, + 92.0, + 16777216.0, + 16777216.0, + 93.0, + 94.0, + 1.0, + 2.0, + 95.0, + 96.0, + -16777216.0, + -16777216.0, + 97.0, + 98.0 + ]; + x = new Complex64Array( data ); + v = csumkbn( [ vector( x, 3, 2, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'sums the selected positive-stride elements' ); + v = csumkbn( [ vector( x, 3, -2, 5 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'sums the selected negative-stride elements' ); + t.deepEqual( reinterpret( x, 0 ), new Float32Array( data ), 'preserves input and guard elements' ); + t.end(); +}); + +tape( 'the function supports zero strides and zero-length views of populated buffers', function test( t ) { + var x; + var v; + + x = new Complex64Array( [ 99.0, 99.0, 1.5, -2.0, 99.0, 99.0 ] ); + v = csumkbn( [ vector( x, 4, 0, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 6.0, -8.0 ) ), true, 'repeats the selected element' ); + v = csumkbn( [ vector( x, 0, -1, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 0.0, 0.0 ) ), true, 'uses logical length instead of buffer length' ); + t.end(); +}); + +tape( 'the function respects the byte offset of the underlying complex array view', function test( t ) { + var buffer; + var x; + var v; + + buffer = new Float32Array([ + 99.0, + 99.0, + 1.0, + 2.0, + 3.0, + 4.0, + 5.0, + 6.0, + 99.0, + 99.0 + ]); + x = new Complex64Array( buffer.buffer, 8, 3 ); + v = csumkbn( [ vector( x, 2, -1, 2 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 8.0, 10.0 ) ), true, 'combines data-buffer byte offset with ndarray element offset' ); + t.end(); +}); + +tape( 'the function handles non-finite and zero components independently', function test( t ) { + var x; + var v; + + x = new Complex64Array( [ Infinity, -Infinity ] ); + v = csumkbn( [ vector( x, 1, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( Infinity, -Infinity ) ), true, 'preserves singleton infinities' ); + x = new Complex64Array( [ NaN, 1.0, 3.0, 2.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( NaN, 3.0 ) ), true, 'a NaN component does not affect the other component' ); + x = new Complex64Array( [ -0.0, -0.0, -0.0, -0.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( -0.0, -0.0 ) ), true, 'preserves negative zero components' ); + t.end(); +}); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.main.js b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.main.js new file mode 100644 index 000000000000..9dd29023242e --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.main.js @@ -0,0 +1,313 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2025 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 tape = require( 'tape' ); +var isSameComplex64 = require( '@stdlib/assert/is-same-complex64' ); +var Complex64Array = require( '@stdlib/array/complex64' ); +var Complex64 = require( '@stdlib/complex/float32/ctor' ); +var ndarray = require( '@stdlib/ndarray/base/ctor' ); +var Float32Array = require( '@stdlib/array/float32' ); +var reinterpret = require( '@stdlib/strided/base/reinterpret-complex64' ); +var csumkbn = require( './../lib/main.js' ); + + +// FUNCTIONS // + +/** +* Returns a one-dimensional ndarray. +* +* @private +* @param {Complex64Array} buffer - underlying data buffer +* @param {NonNegativeInteger} length - number of indexed elements +* @param {integer} stride - stride length +* @param {NonNegativeInteger} offset - index offset +* @returns {ndarray} one-dimensional ndarray +*/ +function vector( buffer, length, stride, offset ) { + return new ndarray( 'complex64', buffer, [ length ], [ stride ], offset, 'row-major' ); +} + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof csumkbn, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'the function has an arity of 1', function test( t ) { + t.strictEqual( csumkbn.length, 1, 'has expected arity' ); + t.end(); +}); + +tape( 'the function computes the sum of all elements in a one-dimensional ndarray using an improved Kahan–Babuška algorithm', function test( t ) { + var x; + var v; + + x = new Complex64Array( [ 1.0, -2.0, -4.0, 5.0, 0.0, 3.0 ] ); + v = csumkbn( [ vector( x, 3, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( -3.0, 6.0 ) ), true, 'returns expected value' ); + + x = new Complex64Array( [ -4.0, -5.0, -4.0, -5.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( -8.0, -10.0 ) ), true, 'returns expected value' ); + + x = new Complex64Array( [ -0.0, 0.0, -0.0, -0.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( -0.0, 0.0 ) ), true, 'returns expected value' ); + + x = new Complex64Array( [ NaN, NaN ] ); + v = csumkbn( [ vector( x, 1, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( NaN, NaN ) ), true, 'returns expected value' ); + + x = new Complex64Array( [ NaN, NaN, NaN, NaN ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( NaN, NaN ) ), true, 'returns expected value' ); + + t.end(); +}); + +tape( 'if provided an empty ndarray, the function returns `0.0`', function test( t ) { + var x; + var v; + + x = new Complex64Array( [] ); + + v = csumkbn( [ vector( x, 0, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 0.0, 0.0 ) ), true, 'returns expected value' ); + + t.end(); +}); + +tape( 'if provided a ndarray containing a single element, the function returns that element', function test( t ) { + var x; + var v; + + x = new Complex64Array( [ 1.0, 2.0 ] ); + + v = csumkbn( [ vector( x, 1, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'returns expected value' ); + + t.end(); +}); + +tape( 'the function supports one-dimensional ndarrays having non-unit strides', function test( t ) { + var x; + var v; + + x = new Complex64Array([ + 1.0, // 0 + 1.0, // 0 + 2.0, + 2.0, + 2.0, // 1 + 2.0, // 1 + -7.0, + -7.0, + -2.0, // 2 + -2.0, // 2 + 3.0, + 3.0, + 4.0, // 3 + 4.0, // 3 + 2.0, + 2.0 + ]); + + v = csumkbn( [ vector( x, 4, 2, 0 ) ] ); + + t.strictEqual( isSameComplex64( v, new Complex64( 5.0, 5.0 ) ), true, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports one-dimensional ndarrays having negative strides', function test( t ) { + var x; + var v; + + x = new Complex64Array([ + 1.0, // 3 + 1.0, // 3 + 2.0, + 2.0, + 2.0, // 2 + 2.0, // 2 + -7.0, + -7.0, + -2.0, // 1 + -2.0, // 1 + 3.0, + 3.0, + 4.0, // 0 + 4.0, // 0 + 2.0, + 2.0 + ]); + + v = csumkbn( [ vector( x, 4, -2, 6 ) ] ); + + t.strictEqual( isSameComplex64( v, new Complex64( 5.0, 5.0 ) ), true, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports one-dimensional ndarrays having non-zero offsets', function test( t ) { + var x; + var v; + + x = new Complex64Array([ + -9.0, + -9.0, + 1.0, // 3 + 1.0, // 3 + 2.0, + 2.0, + 2.0, // 2 + 2.0, // 2 + -7.0, + -7.0, + -2.0, // 1 + -2.0, // 1 + 3.0, + 3.0, + 4.0, // 0 + 4.0, // 0 + 2.0, + 2.0 + ]); + + v = csumkbn( [ vector( x, 4, 2, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 5.0, 5.0 ) ), true, 'returns expected value' ); + + t.end(); +}); + +tape( 'the function compensates cancellation independently in real and imaginary components', function test( t ) { + var x; + var v; + + // Exactly representable float32 powers of two have a mathematical sum of 1+2i: + x = new Complex64Array([ + 16777216.0, + 16777216.0, + 1.0, + 2.0, + -16777216.0, + -16777216.0 + ]); + v = csumkbn( [ vector( x, 3, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'recovers low-order components' ); + t.strictEqual( v instanceof Complex64, true, 'returns a Complex64 instance' ); + + // With 2^100, naive summation loses the middle terms even in double precision: + x = new Complex64Array([ + 1.2676506002282294e30, + -1.2676506002282294e30, + 1.0, + 2.0, + -1.2676506002282294e30, + 1.2676506002282294e30 + ]); + v = csumkbn( [ vector( x, 3, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'compensates large cancellation' ); + t.end(); +}); + +tape( 'the function preserves compensated sums for reversed and offset views without mutating their buffers', function test( t ) { + var data; + var x; + var v; + + data = [ + 91.0, + 92.0, + 16777216.0, + 16777216.0, + 93.0, + 94.0, + 1.0, + 2.0, + 95.0, + 96.0, + -16777216.0, + -16777216.0, + 97.0, + 98.0 + ]; + x = new Complex64Array( data ); + v = csumkbn( [ vector( x, 3, 2, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'sums the selected positive-stride elements' ); + v = csumkbn( [ vector( x, 3, -2, 5 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'sums the selected negative-stride elements' ); + t.deepEqual( reinterpret( x, 0 ), new Float32Array( data ), 'preserves input and guard elements' ); + t.end(); +}); + +tape( 'the function supports zero strides and zero-length views of populated buffers', function test( t ) { + var x; + var v; + + x = new Complex64Array( [ 99.0, 99.0, 1.5, -2.0, 99.0, 99.0 ] ); + v = csumkbn( [ vector( x, 4, 0, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 6.0, -8.0 ) ), true, 'repeats the selected element' ); + v = csumkbn( [ vector( x, 0, -1, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 0.0, 0.0 ) ), true, 'uses logical length instead of buffer length' ); + t.end(); +}); + +tape( 'the function respects the byte offset of the underlying complex array view', function test( t ) { + var buffer; + var x; + var v; + + buffer = new Float32Array([ + 99.0, + 99.0, + 1.0, + 2.0, + 3.0, + 4.0, + 5.0, + 6.0, + 99.0, + 99.0 + ]); + x = new Complex64Array( buffer.buffer, 8, 3 ); + v = csumkbn( [ vector( x, 2, -1, 2 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 8.0, 10.0 ) ), true, 'combines data-buffer byte offset with ndarray element offset' ); + t.end(); +}); + +tape( 'the function handles non-finite and zero components independently', function test( t ) { + var x; + var v; + + x = new Complex64Array( [ Infinity, -Infinity ] ); + v = csumkbn( [ vector( x, 1, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( Infinity, -Infinity ) ), true, 'preserves singleton infinities' ); + x = new Complex64Array( [ NaN, 1.0, 3.0, 2.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( NaN, 3.0 ) ), true, 'a NaN component does not affect the other component' ); + x = new Complex64Array( [ -0.0, -0.0, -0.0, -0.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( -0.0, -0.0 ) ), true, 'preserves negative zero components' ); + t.end(); +}); diff --git a/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.native.js b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.native.js new file mode 100644 index 000000000000..3d80807dd604 --- /dev/null +++ b/lib/node_modules/@stdlib/blas/ext/base/ndarray/csumkbn/test/test.native.js @@ -0,0 +1,322 @@ +/** +* @license Apache-2.0 +* +* Copyright (c) 2025 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 resolve = require( 'path' ).resolve; +var tape = require( 'tape' ); +var isSameComplex64 = require( '@stdlib/assert/is-same-complex64' ); +var Complex64Array = require( '@stdlib/array/complex64' ); +var Complex64 = require( '@stdlib/complex/float32/ctor' ); +var ndarray = require( '@stdlib/ndarray/base/ctor' ); +var Float32Array = require( '@stdlib/array/float32' ); +var reinterpret = require( '@stdlib/strided/base/reinterpret-complex64' ); +var tryRequire = require( '@stdlib/utils/try-require' ); + + +// VARIABLES // + +var csumkbn = tryRequire( resolve( __dirname, './../lib/native.js' ) ); +var opts = { + 'skip': ( csumkbn instanceof Error ) +}; + + +// FUNCTIONS // + +/** +* Returns a one-dimensional ndarray. +* +* @private +* @param {Complex64Array} buffer - underlying data buffer +* @param {NonNegativeInteger} length - number of indexed elements +* @param {integer} stride - stride length +* @param {NonNegativeInteger} offset - index offset +* @returns {ndarray} one-dimensional ndarray +*/ +function vector( buffer, length, stride, offset ) { + return new ndarray( 'complex64', buffer, [ length ], [ stride ], offset, 'row-major' ); +} + + +// TESTS // + +tape( 'main export is a function', opts, function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof csumkbn, 'function', 'main export is a function' ); + t.end(); +}); + +tape( 'the function has an arity of 1', opts, function test( t ) { + t.strictEqual( csumkbn.length, 1, 'has expected arity' ); + t.end(); +}); + +tape( 'the function computes the sum of all elements in a one-dimensional ndarray using an improved Kahan–Babuška algorithm', opts, function test( t ) { + var x; + var v; + + x = new Complex64Array( [ 1.0, -2.0, -4.0, 5.0, 0.0, 3.0 ] ); + v = csumkbn( [ vector( x, 3, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( -3.0, 6.0 ) ), true, 'returns expected value' ); + + x = new Complex64Array( [ -4.0, -5.0, -4.0, -5.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( -8.0, -10.0 ) ), true, 'returns expected value' ); + + x = new Complex64Array( [ -0.0, 0.0, -0.0, -0.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( -0.0, 0.0 ) ), true, 'returns expected value' ); + + x = new Complex64Array( [ NaN, NaN ] ); + v = csumkbn( [ vector( x, 1, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( NaN, NaN ) ), true, 'returns expected value' ); + + x = new Complex64Array( [ NaN, NaN, NaN, NaN ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( NaN, NaN ) ), true, 'returns expected value' ); + + t.end(); +}); + +tape( 'if provided an empty ndarray, the function returns `0.0`', opts, function test( t ) { + var x; + var v; + + x = new Complex64Array( [] ); + + v = csumkbn( [ vector( x, 0, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 0.0, 0.0 ) ), true, 'returns expected value' ); + + t.end(); +}); + +tape( 'if provided a ndarray containing a single element, the function returns that element', opts, function test( t ) { + var x; + var v; + + x = new Complex64Array( [ 1.0, 2.0 ] ); + + v = csumkbn( [ vector( x, 1, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'returns expected value' ); + + t.end(); +}); + +tape( 'the function supports one-dimensional ndarrays having non-unit strides', opts, function test( t ) { + var x; + var v; + + x = new Complex64Array([ + 1.0, // 0 + 1.0, // 0 + 2.0, + 2.0, + 2.0, // 1 + 2.0, // 1 + -7.0, + -7.0, + -2.0, // 2 + -2.0, // 2 + 3.0, + 3.0, + 4.0, // 3 + 4.0, // 3 + 2.0, + 2.0 + ]); + + v = csumkbn( [ vector( x, 4, 2, 0 ) ] ); + + t.strictEqual( isSameComplex64( v, new Complex64( 5.0, 5.0 ) ), true, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports one-dimensional ndarrays having negative strides', opts, function test( t ) { + var x; + var v; + + x = new Complex64Array([ + 1.0, // 3 + 1.0, // 3 + 2.0, + 2.0, + 2.0, // 2 + 2.0, // 2 + -7.0, + -7.0, + -2.0, // 1 + -2.0, // 1 + 3.0, + 3.0, + 4.0, // 0 + 4.0, // 0 + 2.0, + 2.0 + ]); + + v = csumkbn( [ vector( x, 4, -2, 6 ) ] ); + + t.strictEqual( isSameComplex64( v, new Complex64( 5.0, 5.0 ) ), true, 'returns expected value' ); + t.end(); +}); + +tape( 'the function supports one-dimensional ndarrays having non-zero offsets', opts, function test( t ) { + var x; + var v; + + x = new Complex64Array([ + -9.0, + -9.0, + 1.0, // 3 + 1.0, // 3 + 2.0, + 2.0, + 2.0, // 2 + 2.0, // 2 + -7.0, + -7.0, + -2.0, // 1 + -2.0, // 1 + 3.0, + 3.0, + 4.0, // 0 + 4.0, // 0 + 2.0, + 2.0 + ]); + + v = csumkbn( [ vector( x, 4, 2, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 5.0, 5.0 ) ), true, 'returns expected value' ); + + t.end(); +}); + +tape( 'the function compensates cancellation independently in real and imaginary components', opts, function test( t ) { + var x; + var v; + + // Exactly representable float32 powers of two have a mathematical sum of 1+2i: + x = new Complex64Array([ + 16777216.0, + 16777216.0, + 1.0, + 2.0, + -16777216.0, + -16777216.0 + ]); + v = csumkbn( [ vector( x, 3, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'recovers low-order components' ); + t.strictEqual( v instanceof Complex64, true, 'returns a Complex64 instance' ); + + // With 2^100, naive summation loses the middle terms even in double precision: + x = new Complex64Array([ + 1.2676506002282294e30, + -1.2676506002282294e30, + 1.0, + 2.0, + -1.2676506002282294e30, + 1.2676506002282294e30 + ]); + v = csumkbn( [ vector( x, 3, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'compensates large cancellation' ); + t.end(); +}); + +tape( 'the function preserves compensated sums for reversed and offset views without mutating their buffers', opts, function test( t ) { + var data; + var x; + var v; + + data = [ + 91.0, + 92.0, + 16777216.0, + 16777216.0, + 93.0, + 94.0, + 1.0, + 2.0, + 95.0, + 96.0, + -16777216.0, + -16777216.0, + 97.0, + 98.0 + ]; + x = new Complex64Array( data ); + v = csumkbn( [ vector( x, 3, 2, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'sums the selected positive-stride elements' ); + v = csumkbn( [ vector( x, 3, -2, 5 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 1.0, 2.0 ) ), true, 'sums the selected negative-stride elements' ); + t.deepEqual( reinterpret( x, 0 ), new Float32Array( data ), 'preserves input and guard elements' ); + t.end(); +}); + +tape( 'the function supports zero strides and zero-length views of populated buffers', opts, function test( t ) { + var x; + var v; + + x = new Complex64Array( [ 99.0, 99.0, 1.5, -2.0, 99.0, 99.0 ] ); + v = csumkbn( [ vector( x, 4, 0, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 6.0, -8.0 ) ), true, 'repeats the selected element' ); + v = csumkbn( [ vector( x, 0, -1, 1 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 0.0, 0.0 ) ), true, 'uses logical length instead of buffer length' ); + t.end(); +}); + +tape( 'the function respects the byte offset of the underlying complex array view', opts, function test( t ) { + var buffer; + var x; + var v; + + buffer = new Float32Array([ + 99.0, + 99.0, + 1.0, + 2.0, + 3.0, + 4.0, + 5.0, + 6.0, + 99.0, + 99.0 + ]); + x = new Complex64Array( buffer.buffer, 8, 3 ); + v = csumkbn( [ vector( x, 2, -1, 2 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( 8.0, 10.0 ) ), true, 'combines data-buffer byte offset with ndarray element offset' ); + t.end(); +}); + +tape( 'the function handles non-finite and zero components independently', opts, function test( t ) { + var x; + var v; + + x = new Complex64Array( [ Infinity, -Infinity ] ); + v = csumkbn( [ vector( x, 1, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( Infinity, -Infinity ) ), true, 'preserves singleton infinities' ); + x = new Complex64Array( [ NaN, 1.0, 3.0, 2.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( NaN, 3.0 ) ), true, 'a NaN component does not affect the other component' ); + x = new Complex64Array( [ -0.0, -0.0, -0.0, -0.0 ] ); + v = csumkbn( [ vector( x, 2, 1, 0 ) ] ); + t.strictEqual( isSameComplex64( v, new Complex64( -0.0, -0.0 ) ), true, 'preserves negative zero components' ); + t.end(); +});