Skip to content

chore: fix C lint errors (issue #11210) #11216

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

Closed
MANDEep22332 wants to merge 3 commits into from
+10 −6
Closed

chore: fix C lint errors (issue #11210) #11216

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
c9b7da9
c lint error fix
MANDEep22332 Mar 30, 2026
93eedf7
fix c lint error
MANDEep22332 Mar 30, 2026
1e2f7d7
fix c lint error
MANDEep22332 Mar 30, 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
16 changes: 10 additions & 6 deletions lib/node_modules/@stdlib/strided/base/zmap/benchmark/c/benchmark.length.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -106,8 +106,8 @@ static double complex identity( const double complex x ) {
* @return elapsed time in seconds
*/
static double benchmark( int iterations, int len ) {
double complex x[ len ];
double complex y[ len ];
double complex *x = malloc( len * sizeof(double complex) );
double complex *y = malloc( len * sizeof(double complex) );
double elapsed;
double t;
int i;
Expand All @@ -116,18 +116,22 @@ static double benchmark( int iterations, int len ) {
x[ i ] = ( ( rand_double()*200.0 ) - 100.0 ) + ( ( rand_double()*200.0 ) - 100.0 )*I;
y[ i ] = 0.0 + 0.0*I;
}

t = tic();
for ( i = 0; i < iterations; i++ ) {
stdlib_strided_zmap( len, x, 1, y, 1, identity );
if ( y[ i%len ] != y[ i%len ] ) {
if ( y[ 0 ] != y[ 0 ] ) {
printf( "should not return NaN\n" );
break;
}
}
elapsed = tic() - t;
if ( y[ i%len ] != y[ i%len ] ) {

if ( y[ 0 ] != y[ 0 ] ) {
printf( "should not return NaN\n" );
}
free( x );
free( y );
return elapsed;
}

Expand All @@ -148,8 +152,8 @@ int main( void ) {
print_version();
count = 0;
for ( i = MIN; i <= MAX; i++ ) {
len = pow( 10, i );
iter = ITERATIONS / pow( 10, i-1 );
len = (int)pow( 10, i );
iter = ITERATIONS / (int)pow( 10, i-1 );
for ( j = 0; j < REPEATS; j++ ) {
count += 1;
printf( "# c::%s:len=%d\n", NAME, len );
Expand Down