Skip to content

bench: refactor to use dynamic memory allocation in stats/strided/dmskmin #9652

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.

Sign up for GitHub

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
kgryte merged 7 commits into from
Jan 10, 2026
Merged

bench: refactor to use dynamic memory allocation in stats/strided/dmskmin #9652

Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
b61c7b7
bench: refactor to use string interpolation in buffer/from-array-buffer
ivishal-g Jan 5, 2026
400cdf8
Merge branch 'stdlib-js:develop' into develop
ivishal-g Jan 6, 2026
b71f0ba
Merge branch 'stdlib-js:develop' into develop
ivishal-g Jan 7, 2026
b2d1650
Merge branch 'stdlib-js:develop' into develop
ivishal-g Jan 8, 2026
fd99196
Merge branch 'stdlib-js:develop' into develop
ivishal-g Jan 9, 2026
1347256
bench: refactor to use dynamic memory allocation in stats/strided/dms…
ivishal-g Jan 9, 2026
39cae6b
bench: use dynamic allocation
kgryte Jan 10, 2026
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
17 changes: 13 additions & 4 deletions lib/node_modules/@stdlib/stats/strided/dmskmin/benchmark/c/benchmark.length.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -18,6 +18,7 @@

#include "stdlib/stats/strided/dmskmin.h"
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <math.h>
#include <time.h>
Expand Down Expand Up @@ -95,13 +96,15 @@ static double rand_double( void ) {
* @return elapsed time in seconds
*/
static double benchmark1( int iterations, int len ) {
unsigned char mask[ len ];
double elapsed;
double x[ len ];
uint8_t *mask;
double *x;
double v;
double t;
int i;

x = (double *) malloc( len * sizeof( double ) );
mask = (uint8_t *) malloc( len * sizeof( uint8_t ) );
for ( i = 0; i < len; i++ ) {
if ( rand_double() < 0.2 ) {
mask[ i ] = 1; // missing
Expand All @@ -124,6 +127,8 @@ static double benchmark1( int iterations, int len ) {
if ( v != v ) {
printf( "should not return NaN\n" );
}
free( x );
free( mask );
return elapsed;
}

Expand All @@ -135,13 +140,15 @@ static double benchmark1( int iterations, int len ) {
* @return elapsed time in seconds
*/
static double benchmark2( int iterations, int len ) {
unsigned char mask[ len ];
double elapsed;
double x[ len ];
uint8_t *mask;
double *x;
double v;
double t;
int i;

x = (double *) malloc( len * sizeof( double ) );
mask = (uint8_t *) malloc( len * sizeof( uint8_t ) );
for ( i = 0; i < len; i++ ) {
if ( rand_double() < 0.2 ) {
mask[ i ] = 1; // missing
Expand All @@ -164,6 +171,8 @@ static double benchmark2( int iterations, int len ) {
if ( v != v ) {
printf( "should not return NaN\n" );
}
free( x );
free( mask );
return elapsed;
}

Expand Down
Loading