Skip to content

test: migrate stats/incr/pcorrdistmat to ULP-based assertions #14927

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鈥檒l occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
kgryte merged 1 commit into from
Sep 4, 2026
Merged

test: migrate stats/incr/pcorrdistmat to ULP-based assertions #14927

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
43 changes: 5 additions & 38 deletions lib/node_modules/@stdlib/stats/incr/pcorrdistmat/test/test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,8 +21,7 @@
// MODULES //

var tape = require( 'tape' );
var abs = require( '@stdlib/math/base/special/abs' );
var EPS = require( '@stdlib/constants/float64/eps' );
var isAlmostSameValue = require( '@stdlib/assert/is-almost-same-value' );
var ndarray = require( '@stdlib/ndarray/ctor' );
var Float64Array = require( '@stdlib/array/float64' );
var incrpcorrdistmat = require( './../lib' );
Expand Down Expand Up @@ -591,9 +590,7 @@ tape( 'the accumulator function incrementally computes a sample Pearson product-
var strides;
var actual;
var shape;
var delta;
var order;
var tol;
var acc;
var n;
var v;
Expand Down Expand Up @@ -636,13 +633,7 @@ tape( 'the accumulator function incrementally computes a sample Pearson product-
for ( k = 0; k < n; k++ ) {
v = actual.get( j, k );
e = expected[ i ][ (j*n)+k ];
if ( v === e ) {
t.strictEqual( v, e, 'returns expected result. i: '+i+'. j: '+j+'. k: '+k+'.' );
} else {
delta = abs( e - v );
tol = 3.0 * EPS * abs( e );
t.strictEqual( delta <= tol, true, 'i: '+i+'. j: '+j+'. k: '+k+'. expected: '+e+'. actual: '+v+'. tol: '+tol+'. delta: '+delta+'.' );
}
t.strictEqual( isAlmostSameValue( v, e, 0 ), true, 'returns expected value' );
}
}
}
Expand All @@ -655,10 +646,8 @@ tape( 'the accumulator function incrementally computes a sample Pearson product-
var actual;
var buffer;
var shape;
var delta;
var order;
var dist;
var tol;
var acc;
var n;
var v;
Expand Down Expand Up @@ -707,13 +696,7 @@ tape( 'the accumulator function incrementally computes a sample Pearson product-
for ( k = 0; k < n; k++ ) {
v = actual.get( j, k );
e = expected[ i ][ (j*n)+k ];
if ( v === e ) {
t.strictEqual( v, e, 'returns expected result. i: '+i+'. j: '+j+'. k: '+k+'.' );
} else {
delta = abs( e - v );
tol = 3.0 * EPS * abs( e );
t.strictEqual( delta <= tol, true, 'i: '+i+'. j: '+j+'. k: '+k+'. expected: '+e+'. actual: '+v+'. tol: '+tol+'. delta: '+delta+'.' );
}
t.strictEqual( isAlmostSameValue( v, e, 0 ), true, 'returns expected value' );
}
}
}
Expand All @@ -727,9 +710,7 @@ tape( 'the accumulator function incrementally computes a sample Pearson product-
var buffer;
var means;
var shape;
var delta;
var order;
var tol;
var acc;
var n;
var v;
Expand Down Expand Up @@ -775,13 +756,7 @@ tape( 'the accumulator function incrementally computes a sample Pearson product-
for ( k = 0; k < n; k++ ) {
v = actual.get( j, k );
e = expected[ i ][ (j*n)+k ];
if ( v === e ) {
t.strictEqual( v, e, 'returns expected result. i: '+i+'. j: '+j+'. k: '+k+'.' );
} else {
delta = abs( e - v );
tol = 3.0 * EPS * abs( e );
t.strictEqual( delta <= tol, true, 'i: '+i+'. j: '+j+'. k: '+k+'. expected: '+e+'. actual: '+v+'. tol: '+tol+'. delta: '+delta+'.' );
}
t.strictEqual( isAlmostSameValue( v, e, 1 ), true, 'returns expected value' );
}
}
}
Expand All @@ -795,10 +770,8 @@ tape( 'the accumulator function incrementally computes a sample Pearson product-
var buffer;
var means;
var shape;
var delta;
var order;
var dist;
var tol;
var acc;
var n;
var v;
Expand Down Expand Up @@ -850,13 +823,7 @@ tape( 'the accumulator function incrementally computes a sample Pearson product-
for ( k = 0; k < n; k++ ) {
v = actual.get( j, k );
e = expected[ i ][ (j*n)+k ];
if ( v === e ) {
t.strictEqual( v, e, 'returns expected result. i: '+i+'. j: '+j+'. k: '+k+'.' );
} else {
delta = abs( e - v );
tol = 3.0 * EPS * abs( e );
t.strictEqual( delta <= tol, true, 'i: '+i+'. j: '+j+'. k: '+k+'. expected: '+e+'. actual: '+v+'. tol: '+tol+'. delta: '+delta+'.' );
}
t.strictEqual( isAlmostSameValue( v, e, 1 ), true, 'returns expected value' );
}
}
}
Expand Down