Skip to content

Commit

Permalink
chore: apply review changes
Browse files Browse the repository at this point in the history
  • Loading branch information
@aman-095
aman-095 committed Apr 5, 2024
1 parent 92f2ce0 commit 440b1b0
Show file tree
Hide file tree
Showing 2 changed files with 8 additions and 16 deletions.
12 changes: 4 additions & 8 deletions lib/node_modules/@stdlib/blas/base/cscal/test/test.cscal.js
View file
Original file line number Diff line number Diff line change
Expand Up @@ -79,8 +79,7 @@ tape( 'the function scales elements from `cx` by `ca`', function test( t ) {
for ( k = 0; k < expected.length; k++ ) {
if ( viewX[ k ] === expected[ k ] ) {
t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
}
else {
} else {
delta = abs( viewX[ k ] - expected[ k ] );
tol = 1.0 * EPS * abs( expected[ k ] );
t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
Expand Down Expand Up @@ -134,8 +133,7 @@ tape( 'the function supports a `cx` stride', function test( t ) {
for ( k = 0; k < expected.length; k++ ) {
if ( viewX[ k ] === expected[ k ] ) {
t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
}
else {
} else {
delta = abs( viewX[ k ] - expected[ k ] );
tol = 1.0 * EPS * abs( expected[ k ] );
t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
Expand Down Expand Up @@ -241,8 +239,7 @@ tape( 'the function supports complex access patterns', function test( t ) {
for ( k = 0; k < expected.length; k++ ) {
if ( viewX[ k ] === expected[ k ] ) {
t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
}
else {
} else {
delta = abs( viewX[ k ] - expected[ k ] );
tol = 1.0 * EPS * abs( expected[ k ] );
t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
Expand Down Expand Up @@ -297,8 +294,7 @@ tape( 'the function supports view offsets', function test( t ) {
for ( k = 0; k < expected.length; k++ ) {
if ( viewX[ k ] === expected[ k ] ) {
t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
}
else {
} else {
delta = abs( viewX[ k ] - expected[ k ] );
tol = 1.0 * EPS * abs( expected[ k ] );
t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
Expand Down
12 changes: 4 additions & 8 deletions lib/node_modules/@stdlib/blas/base/cscal/test/test.ndarray.js
View file
Original file line number Diff line number Diff line change
Expand Up @@ -87,8 +87,7 @@ tape( 'the function scales elements from `cx` by `ca`', function test( t ) {
for ( k = 0; k < expected.length; k++ ) {
if ( viewX[ k ] === expected[ k ] ) {
t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
}
else {
} else {
delta = abs( viewX[ k ] - expected[ k ] );
tol = 1.0 * EPS * abs( expected[ k ] );
t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
Expand Down Expand Up @@ -142,8 +141,7 @@ tape( 'the function supports a `cx` stride', function test( t ) {
for ( k = 0; k < expected.length; k++ ) {
if ( viewX[ k ] === expected[ k ] ) {
t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
}
else {
} else {
delta = abs( viewX[ k ] - expected[ k ] );
tol = 1.0 * EPS * abs( expected[ k ] );
t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
Expand Down Expand Up @@ -197,8 +195,7 @@ tape( 'the function supports a `cx` offset', function test( t ) {
for ( k = 0; k < expected.length; k++ ) {
if ( viewX[ k ] === expected[ k ] ) {
t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
}
else {
} else {
delta = abs( viewX[ k ] - expected[ k ] );
tol = 5.0 * EPS * abs( expected[ k ] );
t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
Expand Down Expand Up @@ -312,8 +309,7 @@ tape( 'the function supports complex access patterns', function test( t ) {
for ( k = 0; k < expected.length; k++ ) {
if ( viewX[ k ] === expected[ k ] ) {
t.strictEqual( viewX[ k ], expected[ k ], 'returns expected value' );
}
else {
} else {
delta = abs( viewX[ k ] - expected[ k ] );
tol = 5.0 * EPS * abs( expected[ k ] );
t.ok( delta <= tol, 'within tolerance. x: '+viewX[ k ]+'. expected: '+expected[ k ]+'. delta: '+delta+'. tol: '+tol+'.' );
Expand Down

0 comments on commit 440b1b0

Please sign in to comment.