Skip to content

Commit 1e2f7d7

Browse files
committed
fix c lint error
1 parent 93eedf7 commit 1e2f7d7

File tree

1 file changed

+24
-24
lines changed

1 file changed

+24
-24
lines changed

lib/node_modules/@stdlib/strided/base/zmap/benchmark/c/benchmark.length.c

Lines changed: 24 additions & 24 deletions
Original file line numberDiff line numberDiff line change
@@ -106,33 +106,33 @@ static double complex identity( const double complex x ) {
106106
* @return elapsed time in seconds
107107
*/
108108
static double benchmark( int iterations, int len ) {
109-
double complex *x = malloc( len * sizeof(double complex) );
110-
double complex *y = malloc( len * sizeof(double complex) );
111-
double elapsed;
112-
double t;
113-
int i;
109+
double complex *x = malloc( len * sizeof(double complex) );
110+
double complex *y = malloc( len * sizeof(double complex) );
111+
double elapsed;
112+
double t;
113+
int i;
114114

115-
for ( i = 0; i < len; i++ ) {
116-
x[ i ] = ( ( rand_double()*200.0 ) - 100.0 ) + ( ( rand_double()*200.0 ) - 100.0 )*I;
117-
y[ i ] = 0.0 + 0.0*I;
118-
}
115+
for ( i = 0; i < len; i++ ) {
116+
x[ i ] = ( ( rand_double()*200.0 ) - 100.0 ) + ( ( rand_double()*200.0 ) - 100.0 )*I;
117+
y[ i ] = 0.0 + 0.0*I;
118+
}
119119

120-
t = tic();
121-
for ( i = 0; i < iterations; i++ ) {
122-
stdlib_strided_zmap( len, x, 1, y, 1, identity );
123-
if ( y[ 0 ] != y[ 0 ] ) {
124-
printf( "should not return NaN\n" );
125-
break;
126-
}
127-
}
128-
elapsed = tic() - t;
120+
t = tic();
121+
for ( i = 0; i < iterations; i++ ) {
122+
stdlib_strided_zmap( len, x, 1, y, 1, identity );
123+
if ( y[ 0 ] != y[ 0 ] ) {
124+
printf( "should not return NaN\n" );
125+
break;
126+
}
127+
}
128+
elapsed = tic() - t;
129129

130-
if ( y[ 0 ] != y[ 0 ] ) {
131-
printf( "should not return NaN\n" );
132-
}
133-
free( x );
134-
free( y );
135-
return elapsed;
130+
if ( y[ 0 ] != y[ 0 ] ) {
131+
printf( "should not return NaN\n" );
132+
}
133+
free( x );
134+
free( y );
135+
return elapsed;
136136
}
137137

138138
/**

0 commit comments

Comments
 (0)