Skip to content

Commit 8ca2304

Browse files
fix: improve sorted arrays generation in C benchmarks for
1 parent 0c31eaf commit 8ca2304

8 files changed

Lines changed: 16 additions & 16 deletions

File tree

lib/node_modules/@stdlib/stats/strided/dmaxabssorted/benchmark/c/benchmark.length.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -102,7 +102,7 @@ static double benchmark1( int iterations, int len ) {
102102
int i;
103103

104104
for ( i = 0; i < len; i++ ) {
105-
x[ i ] = i - (len/2);
105+
x[ i ] = (double)( i - (len/2) ) + rand_double();
106106
}
107107
v = 0.0;
108108
t = tic();
@@ -136,7 +136,7 @@ static double benchmark2( int iterations, int len ) {
136136
int i;
137137

138138
for ( i = 0; i < len; i++ ) {
139-
x[ i ] = i - (len/2);
139+
x[ i ] = (double)( i - (len/2) ) + rand_double();
140140
}
141141
v = 0.0;
142142
t = tic();

lib/node_modules/@stdlib/stats/strided/dmaxsorted/benchmark/c/benchmark.length.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -102,7 +102,7 @@ static double benchmark1( int iterations, int len ) {
102102
int i;
103103

104104
for ( i = 0; i < len; i++ ) {
105-
x[ i ] = i;
105+
x[ i ] = (double)i + rand_double();
106106
}
107107
v = 0.0;
108108
t = tic();
@@ -136,7 +136,7 @@ static double benchmark2( int iterations, int len ) {
136136
int i;
137137

138138
for ( i = 0; i < len; i++ ) {
139-
x[ i ] = i;
139+
x[ i ] = (double)i + rand_double();
140140
}
141141
v = 0.0;
142142
t = tic();

lib/node_modules/@stdlib/stats/strided/dmediansorted/benchmark/c/benchmark.length.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -103,7 +103,7 @@ static double benchmark1( int iterations, int len ) {
103103

104104
x = (double *) malloc( len * sizeof( double ) );
105105
for ( i = 0; i < len; i++ ) {
106-
x[ i ] = i;
106+
x[ i ] = (double)i + rand_double();
107107
}
108108
v = 0.0;
109109
t = tic();
@@ -139,7 +139,7 @@ static double benchmark2( int iterations, int len ) {
139139

140140
x = (double *) malloc( len * sizeof( double ) );
141141
for ( i = 0; i < len; i++ ) {
142-
x[ i ] = i;
142+
x[ i ] = (double)i + rand_double();
143143
}
144144
v = 0.0;
145145
t = tic();

lib/node_modules/@stdlib/stats/strided/dminsorted/benchmark/c/benchmark.length.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -103,7 +103,7 @@ static double benchmark1( int iterations, int len ) {
103103

104104
x = (double *) malloc( len * sizeof( double ) );
105105
for ( i = 0; i < len; i++ ) {
106-
x[ i ] = i;
106+
x[ i ] = (double)i + rand_double();
107107
}
108108
v = 0.0;
109109
t = tic();
@@ -139,7 +139,7 @@ static double benchmark2( int iterations, int len ) {
139139

140140
x = (double *) malloc( len * sizeof( double ) );
141141
for ( i = 0; i < len; i++ ) {
142-
x[ i ] = i;
142+
x[ i ] = (double)i + rand_double();
143143
}
144144
v = 0.0;
145145
t = tic();

lib/node_modules/@stdlib/stats/strided/smaxabssorted/benchmark/c/benchmark.length.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -102,7 +102,7 @@ static double benchmark1( int iterations, int len ) {
102102
int i;
103103

104104
for ( i = 0; i < len; i++ ) {
105-
x[ i ] = i - (len/2);
105+
x[ i ] = (float)( i - (len/2) ) + rand_float();
106106
}
107107
v = 0.0f;
108108
t = tic();
@@ -136,7 +136,7 @@ static double benchmark2( int iterations, int len ) {
136136
int i;
137137

138138
for ( i = 0; i < len; i++ ) {
139-
x[ i ] = i - (len/2);
139+
x[ i ] = (float)( i - (len/2) ) + rand_float();
140140
}
141141
v = 0.0f;
142142
t = tic();

lib/node_modules/@stdlib/stats/strided/smaxsorted/benchmark/c/benchmark.length.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -102,7 +102,7 @@ static double benchmark1( int iterations, int len ) {
102102
int i;
103103

104104
for ( i = 0; i < len; i++ ) {
105-
x[ i ] = i;
105+
x[ i ] = (float)i + rand_float();
106106
}
107107
v = 0.0f;
108108
t = tic();
@@ -136,7 +136,7 @@ static double benchmark2( int iterations, int len ) {
136136
int i;
137137

138138
for ( i = 0; i < len; i++ ) {
139-
x[ i ] = i;
139+
x[ i ] = (float)i + rand_float();
140140
}
141141
v = 0.0f;
142142
t = tic();

lib/node_modules/@stdlib/stats/strided/smediansorted/benchmark/c/benchmark.length.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -102,7 +102,7 @@ static double benchmark1( int iterations, int len ) {
102102
int i;
103103

104104
for ( i = 0; i < len; i++ ) {
105-
x[ i ] = i;
105+
x[ i ] = (float)i + rand_float();
106106
}
107107
v = 0.0f;
108108
t = tic();
@@ -136,7 +136,7 @@ static double benchmark2( int iterations, int len ) {
136136
int i;
137137

138138
for ( i = 0; i < len; i++ ) {
139-
x[ i ] = i;
139+
x[ i ] = (float)i + rand_float();
140140
}
141141
v = 0.0f;
142142
t = tic();

lib/node_modules/@stdlib/stats/strided/sminsorted/benchmark/c/benchmark.length.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -102,7 +102,7 @@ static double benchmark1( int iterations, int len ) {
102102
int i;
103103

104104
for ( i = 0; i < len; i++ ) {
105-
x[ i ] = i;
105+
x[ i ] = (float)i + rand_float();
106106
}
107107
v = 0.0f;
108108
t = tic();
@@ -136,7 +136,7 @@ static double benchmark2( int iterations, int len ) {
136136
int i;
137137

138138
for ( i = 0; i < len; i++ ) {
139-
x[ i ] = i;
139+
x[ i ] = (float)i + rand_float();
140140
}
141141
v = 0.0f;
142142
t = tic();

0 commit comments

Comments
 (0)