Skip to content

chore: fix JavaScript lint errors (issue #12222) #12226

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

Open
algojogacor wants to merge 1 commit into
base: develop
Choose a base branch
from
+12 −12
Open

chore: fix JavaScript lint errors (issue #12222) #12226

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
24 changes: 12 additions & 12 deletions lib/node_modules/@stdlib/blas/base/gasum/test/test.ndarray.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -198,31 +198,31 @@ tape( 'if the stride equals `1`, the function efficiently sums the absolute valu
var y;
var i;

x = new Array( 100 );
for ( i = 0; i < x.length; i++ ) {
x = [];
for ( i = 0; i < 100; i++ ) {
sign = randu();
if ( sign < 0.5 ) {
sign = -1.0;
} else {
sign = 1.0;
}
x[ i ] = sign * (i+1);
x.push( sign * (i+1) );
}

y = gasum( x.length, x, 1, 0 );

// Compare to closed-form formula:
t.strictEqual( y, x.length*(x.length+1)/2, 'returns expected value' );

x = new Array( 240 );
for ( i = 0; i < x.length; i++ ) {
x = [];
for ( i = 0; i < 240; i++ ) {
sign = randu();
if ( sign < 0.5 ) {
sign = -1.0;
} else {
sign = 1.0;
}
x[ i ] = sign * (i-5);
x.push( sign * (i-5) );
}

N = x.length - 6;
Expand All @@ -241,31 +241,31 @@ tape( 'if the stride equals `1`, the function efficiently sums the absolute valu
var y;
var i;

x = new Array( 100 );
for ( i = 0; i < x.length; i++ ) {
x = [];
for ( i = 0; i < 100; i++ ) {
sign = randu();
if ( sign < 0.5 ) {
sign = -1.0;
} else {
sign = 1.0;
}
x[ i ] = sign * (i+1);
x.push( sign * (i+1) );
}

y = gasum( x.length, toAccessorArray( x ), 1, 0 );

// Compare to closed-form formula:
t.strictEqual( y, x.length*(x.length+1)/2, 'returns expected value' );

x = new Array( 240 );
for ( i = 0; i < x.length; i++ ) {
x = [];
for ( i = 0; i < 240; i++ ) {
sign = randu();
if ( sign < 0.5 ) {
sign = -1.0;
} else {
sign = 1.0;
}
x[ i ] = sign * (i-5);
x.push( sign * (i-5) );
}

N = x.length - 6;
Expand Down
Loading