Skip to content

Commit aadc7fa

Browse files
stdlib-botstdlib-bot
committed
Auto-generated commit
1 parent e8bdc7b commit aadc7fa

30 files changed

Lines changed: 232 additions & 77 deletions

File tree

‎CHANGELOG.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -731,6 +731,7 @@ A total of 96 issues were closed in this release:
731731

732732
<details>
733733

734+
- [`23d316f`](https://github.com/stdlib-js/stdlib/commit/23d316f6eda9201e0827d9f98ee523f9270d5939) - **bench:** refactor to use dynamic memory allocation in `maths/strided/special` [(#11697)](https://github.com/stdlib-js/stdlib/pull/11697) _(by Uday Kakade)_
734735
- [`1089250`](https://github.com/stdlib-js/stdlib/commit/1089250db272eca254d75532dcc159a6a0aaafc3) - **chore:** fix JavaScript lint errors [(#11692)](https://github.com/stdlib-js/stdlib/pull/11692) _(by Matt Van Horn, Athan Reines)_
735736
- [`0b14ced`](https://github.com/stdlib-js/stdlib/commit/0b14ced4fce04bbfde2d98230391ed699dd15235) - **bench:** replace M_PI in `math/base/special/sincospi` C benchmark [(#11690)](https://github.com/stdlib-js/stdlib/pull/11690) _(by Karan Anand)_
736737
- [`c73c8b3`](https://github.com/stdlib-js/stdlib/commit/c73c8b39bd76529182ea2b3423c6f0feab434774) - **bench:** refactor to use string interpolation in `math/base/special` [(#11387)](https://github.com/stdlib-js/stdlib/pull/11387) _(by Karan Anand)_

‎strided/special/dmskabs/benchmark/c/benchmark.length.c‎

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
115115
*/
116116
static double benchmark( int iterations, int len ) {
117117
double elapsed;
118-
uint8_t m[ len ];
119-
double x[ len ];
120-
double y[ len ];
118+
uint8_t *m;
119+
double *x;
120+
double *y;
121121
double t;
122122
int i;
123123

124+
m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
125+
x = (double *) malloc( len * sizeof( double ) );
126+
y = (double *) malloc( len * sizeof( double ) );
124127
for ( i = 0; i < len; i++ ) {
125128
x[ i ] = rand_uniform( -100.0, 100.0 );
126129
y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
138141
if ( y[ 0 ] != y[ 0 ] ) {
139142
printf( "should not return NaN\n" );
140143
}
144+
free( m );
145+
free( x );
146+
free( y );
141147
return elapsed;
142148
}
143149

‎strided/special/dmskabs2/benchmark/c/benchmark.length.c‎

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
115115
*/
116116
static double benchmark( int iterations, int len ) {
117117
double elapsed;
118-
uint8_t m[ len ];
119-
double x[ len ];
120-
double y[ len ];
118+
uint8_t *m;
119+
double *x;
120+
double *y;
121121
double t;
122122
int i;
123123

124+
m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
125+
x = (double *) malloc( len * sizeof( double ) );
126+
y = (double *) malloc( len * sizeof( double ) );
124127
for ( i = 0; i < len; i++ ) {
125128
x[ i ] = rand_uniform( -100.0, 100.0 );
126129
y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
138141
if ( y[ 0 ] != y[ 0 ] ) {
139142
printf( "should not return NaN\n" );
140143
}
144+
free( m );
145+
free( x );
146+
free( y );
141147
return elapsed;
142148
}
143149

‎strided/special/dmskcbrt/benchmark/c/benchmark.length.c‎

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
115115
*/
116116
static double benchmark( int iterations, int len ) {
117117
double elapsed;
118-
uint8_t m[ len ];
119-
double x[ len ];
120-
double y[ len ];
118+
uint8_t *m;
119+
double *x;
120+
double *y;
121121
double t;
122122
int i;
123123

124+
m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
125+
x = (double *) malloc( len * sizeof( double ) );
126+
y = (double *) malloc( len * sizeof( double ) );
124127
for ( i = 0; i < len; i++ ) {
125128
x[ i ] = rand_uniform( -100.0, 100.0 );
126129
y[ i ] = 0.0;
@@ -139,6 +142,9 @@ static double benchmark( int iterations, int len ) {
139142
if ( y[ 0 ] != y[ 0 ] ) {
140143
printf( "should not return NaN\n" );
141144
}
145+
free( m );
146+
free( x );
147+
free( y );
142148
return elapsed;
143149
}
144150

‎strided/special/dmskceil/benchmark/c/benchmark.length.c‎

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
115115
*/
116116
static double benchmark( int iterations, int len ) {
117117
double elapsed;
118-
uint8_t m[ len ];
119-
double x[ len ];
120-
double y[ len ];
118+
uint8_t *m;
119+
double *x;
120+
double *y;
121121
double t;
122122
int i;
123123

124+
m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
125+
x = (double *) malloc( len * sizeof( double ) );
126+
y = (double *) malloc( len * sizeof( double ) );
124127
for ( i = 0; i < len; i++ ) {
125128
x[ i ] = rand_uniform( -10.0, 10.0 );
126129
y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
138141
if ( y[ 0 ] != y[ 0 ] ) {
139142
printf( "should not return NaN\n" );
140143
}
144+
free( m );
145+
free( x );
146+
free( y );
141147
return elapsed;
142148
}
143149

‎strided/special/dmskdeg2rad/benchmark/c/benchmark.length.c‎

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
115115
*/
116116
static double benchmark( int iterations, int len ) {
117117
double elapsed;
118-
uint8_t m[ len ];
119-
double x[ len ];
120-
double y[ len ];
118+
uint8_t *m;
119+
double *x;
120+
double *y;
121121
double t;
122122
int i;
123123

124+
m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
125+
x = (double *) malloc( len * sizeof( double ) );
126+
y = (double *) malloc( len * sizeof( double ) );
124127
for ( i = 0; i < len; i++ ) {
125128
x[ i ] = rand_uniform( -180.0, 180.0 );
126129
y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
138141
if ( y[ 0 ] != y[ 0 ] ) {
139142
printf( "should not return NaN\n" );
140143
}
144+
free( m );
145+
free( x );
146+
free( y );
141147
return elapsed;
142148
}
143149

‎strided/special/dmskfloor/benchmark/c/benchmark.length.c‎

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
115115
*/
116116
static double benchmark( int iterations, int len ) {
117117
double elapsed;
118-
uint8_t m[ len ];
119-
double x[ len ];
120-
double y[ len ];
118+
uint8_t *m;
119+
double *x;
120+
double *y;
121121
double t;
122122
int i;
123123

124+
m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
125+
x = (double *) malloc( len * sizeof( double ) );
126+
y = (double *) malloc( len * sizeof( double ) );
124127
for ( i = 0; i < len; i++ ) {
125128
x[ i ] = rand_uniform( -10.0, 10.0 );
126129
y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
138141
if ( y[ 0 ] != y[ 0 ] ) {
139142
printf( "should not return NaN\n" );
140143
}
144+
free( m );
145+
free( x );
146+
free( y );
141147
return elapsed;
142148
}
143149

‎strided/special/dmskinv/benchmark/c/benchmark.length.c‎

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
115115
*/
116116
static double benchmark( int iterations, int len ) {
117117
double elapsed;
118-
uint8_t m[ len ];
119-
double x[ len ];
120-
double y[ len ];
118+
uint8_t *m;
119+
double *x;
120+
double *y;
121121
double t;
122122
int i;
123123

124+
m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
125+
x = (double *) malloc( len * sizeof( double ) );
126+
y = (double *) malloc( len * sizeof( double ) );
124127
for ( i = 0; i < len; i++ ) {
125128
x[ i ] = rand_uniform( -50.0, 50.0 );
126129
y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
138141
if ( y[ 0 ] != y[ 0 ] ) {
139142
printf( "should not return NaN\n" );
140143
}
144+
free( m );
145+
free( x );
146+
free( y );
141147
return elapsed;
142148
}
143149

‎strided/special/dmskramp/benchmark/c/benchmark.length.c‎

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
115115
*/
116116
static double benchmark( int iterations, int len ) {
117117
double elapsed;
118-
uint8_t m[ len ];
119-
double x[ len ];
120-
double y[ len ];
118+
uint8_t *m;
119+
double *x;
120+
double *y;
121121
double t;
122122
int i;
123123

124+
m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
125+
x = (double *) malloc( len * sizeof( double ) );
126+
y = (double *) malloc( len * sizeof( double ) );
124127
for ( i = 0; i < len; i++ ) {
125128
x[ i ] = rand_uniform( -10.0, 10.0 );
126129
y[ i ] = 0.0;
@@ -139,6 +142,9 @@ static double benchmark( int iterations, int len ) {
139142
if ( y[ 0 ] != y[ 0 ] ) {
140143
printf( "should not return NaN\n" );
141144
}
145+
free( m );
146+
free( x );
147+
free( y );
142148
return elapsed;
143149
}
144150

‎strided/special/dmsksqrt/benchmark/c/benchmark.length.c‎

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -115,12 +115,15 @@ float rand_uniformf( float a, float b ) {
115115
*/
116116
static double benchmark( int iterations, int len ) {
117117
double elapsed;
118-
uint8_t m[ len ];
119-
double x[ len ];
120-
double y[ len ];
118+
uint8_t *m;
119+
double *x;
120+
double *y;
121121
double t;
122122
int i;
123123

124+
m = (uint8_t *) malloc( len * sizeof( uint8_t ) );
125+
x = (double *) malloc( len * sizeof( double ) );
126+
y = (double *) malloc( len * sizeof( double ) );
124127
for ( i = 0; i < len; i++ ) {
125128
x[ i ] = rand_uniform( 0.0, 200.0 );
126129
y[ i ] = 0.0;
@@ -138,6 +141,9 @@ static double benchmark( int iterations, int len ) {
138141
if ( y[ 0 ] != y[ 0 ] ) {
139142
printf( "should not return NaN\n" );
140143
}
144+
free( m );
145+
free( x );
146+
free( y );
141147
return elapsed;
142148
}
143149

0 commit comments

Comments
 (0)