Skip to content

test: migrate math/base/special/spencef to ULP-based testing #13726

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

Merged
kgryte merged 1 commit into from
Jul 28, 2026
Merged

test: migrate math/base/special/spencef to ULP-based testing #13726

Show file tree
Hide file tree
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
27 changes: 5 additions & 22 deletions lib/node_modules/@stdlib/math/base/special/spencef/test/test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,10 +22,9 @@

var tape = require( 'tape' );
var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
var absf = require( '@stdlib/math/base/special/absf' );
var isAlmostSameValuef = require( '@stdlib/number/float32/base/assert/is-almost-same-value' );
var PI_SQUARED = require( '@stdlib/constants/float32/pi-squared' );
var f32 = require( '@stdlib/number/float64/base/to-float32' );
var EPS = require( '@stdlib/constants/float32/eps' );
var spencef = require( './../lib' );


Expand All @@ -47,8 +46,6 @@ tape( 'main export is a function', function test( t ) {

tape( 'the function accurately computes the dilogarithm for small positive numbers', function test( t ) {
var expected;
var delta;
var tol;
var x;
var v;
var i;
Expand All @@ -58,17 +55,13 @@ tape( 'the function accurately computes the dilogarithm for small positive numbe

for ( i = 0; i < x.length; i++ ) {
v = spencef( x[ i ] );
delta = absf( v - expected[ i ] );
tol = 1.3 * EPS * absf( expected[ i ] );
t.ok( delta <= tol, 'within tolerance. x: ' + x[ i ] + '. actual: ' + v + '. expected: ' + expected[ i ] + '. tol: ' + tol + '. Δ: ' + delta + '.' );
t.strictEqual( isAlmostSameValuef( v, expected[ i ], 2 ), true, 'returns expected value' );
}
t.end();
});

tape( 'the function accurately computes the dilogarithm for medium positive numbers', function test( t ) {
var expected;
var delta;
var tol;
var x;
var v;
var i;
Expand All @@ -78,17 +71,13 @@ tape( 'the function accurately computes the dilogarithm for medium positive numb

for ( i = 0; i < x.length; i++ ) {
v = spencef( x[ i ] );
delta = absf( v - expected[ i ] );
tol = 8.2 * EPS * absf( expected[ i ] );
t.ok( delta <= tol, 'within tolerance. x: ' + x[ i ] + '. actual: ' + v + '. expected: ' + expected[ i ] + '. tol: ' + tol + '. Δ: ' + delta + '.' );
t.strictEqual( isAlmostSameValuef( v, expected[ i ], 11 ), true, 'returns expected value' );
}
t.end();
});

tape( 'the function accurately computes the dilogarithm for large positive numbers', function test( t ) {
var expected;
var delta;
var tol;
var x;
var v;
var i;
Expand All @@ -98,17 +87,13 @@ tape( 'the function accurately computes the dilogarithm for large positive numbe

for ( i = 0; i < x.length; i++ ) {
v = spencef( x[ i ] );
delta = absf( v - expected[ i ] );
tol = 2.0 * EPS * absf( expected[ i ] );
t.ok( delta <= tol, 'within tolerance. x: ' + x[ i ] + '. actual: ' + v + '. expected: ' + expected[ i ] + '. tol: ' + tol + '. Δ: ' + delta + '.' );
t.strictEqual( isAlmostSameValuef( v, expected[ i ], 3 ), true, 'returns expected value' );
}
t.end();
});

tape( 'the function accurately computes the dilogarithm for huge positive numbers', function test( t ) {
var expected;
var delta;
var tol;
var x;
var v;
var i;
Expand All @@ -118,9 +103,7 @@ tape( 'the function accurately computes the dilogarithm for huge positive number

for ( i = 0; i < x.length; i++ ) {
v = spencef( x[ i ] );
delta = absf( v - expected[ i ] );
tol = 7.0 * EPS * absf( expected[ i ] );
t.ok( delta <= tol, 'within tolerance. x: ' + x[ i ] + '. actual: ' + v + '. expected: ' + expected[ i ] + '. tol: ' + tol + '. Δ: ' + delta + '.' );
t.strictEqual( isAlmostSameValuef( v, expected[ i ], 11 ), true, 'returns expected value' );
}
t.end();
});
Expand Down
27 changes: 5 additions & 22 deletions lib/node_modules/@stdlib/math/base/special/spencef/test/test.native.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -23,10 +23,9 @@
var resolve = require( 'path' ).resolve;
var tape = require( 'tape' );
var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
var absf = require( '@stdlib/math/base/special/absf' );
var isAlmostSameValuef = require( '@stdlib/number/float32/base/assert/is-almost-same-value' );
var f32 = require( '@stdlib/number/float64/base/to-float32' );
var PI_SQUARED = require( '@stdlib/constants/float32/pi-squared' );
var EPS = require( '@stdlib/constants/float32/eps' );
var tryRequire = require( '@stdlib/utils/try-require' );


Expand Down Expand Up @@ -56,8 +55,6 @@ tape( 'main export is a function', opts, function test( t ) {

tape( 'the function accurately computes the dilogarithm for small positive numbers', opts, function test( t ) {
var expected;
var delta;
var tol;
var x;
var v;
var i;
Expand All @@ -67,17 +64,13 @@ tape( 'the function accurately computes the dilogarithm for small positive numbe

for ( i = 0; i < x.length; i++ ) {
v = spencef( x[ i ] );
delta = absf( v - expected[ i ] );
tol = 1.3 * EPS * absf( expected[ i ] );
t.ok( delta <= tol, 'within tolerance. x: ' + x[ i ] + '. Value: ' + v + '. Expected: ' + expected[ i ] + '. Tolerance: ' + tol + '.' );
t.strictEqual( isAlmostSameValuef( v, expected[ i ], 2 ), true, 'returns expected value' );
}
t.end();
});

tape( 'the function accurately computes the dilogarithm for medium positive numbers', opts, function test( t ) {
var expected;
var delta;
var tol;
var x;
var v;
var i;
Expand All @@ -87,17 +80,13 @@ tape( 'the function accurately computes the dilogarithm for medium positive numb

for ( i = 0; i < x.length; i++ ) {
v = spencef( x[ i ] );
delta = absf( v - expected[ i ] );
tol = 8.2 * EPS * absf( expected[ i ] );
t.ok( delta <= tol, 'within tolerance. x: ' + x[ i ] + '. actual: ' + v + '. expected: ' + expected[ i ] + '. tol: ' + tol + '. Δ: ' + delta + '.' );
t.strictEqual( isAlmostSameValuef( v, expected[ i ], 11 ), true, 'returns expected value' );
}
t.end();
});

tape( 'the function accurately computes the dilogarithm for large positive numbers', opts, function test( t ) {
var expected;
var delta;
var tol;
var x;
var v;
var i;
Expand All @@ -107,17 +96,13 @@ tape( 'the function accurately computes the dilogarithm for large positive numbe

for ( i = 0; i < x.length; i++ ) {
v = spencef( x[ i ] );
delta = absf( v - expected[ i ] );
tol = 2.0 * EPS * absf( expected[ i ] );
t.ok( delta <= tol, 'within tolerance. x: ' + x[ i ] + '. actual: ' + v + '. expected: ' + expected[ i ] + '. tol: ' + tol + '. Δ: ' + delta + '.' );
t.strictEqual( isAlmostSameValuef( v, expected[ i ], 3 ), true, 'returns expected value' );
}
t.end();
});

tape( 'the function accurately computes the dilogarithm for huge positive numbers', opts, function test( t ) {
var expected;
var delta;
var tol;
var x;
var v;
var i;
Expand All @@ -127,9 +112,7 @@ tape( 'the function accurately computes the dilogarithm for huge positive number

for ( i = 0; i < x.length; i++ ) {
v = spencef( x[ i ] );
delta = absf( v - expected[ i ] );
tol = 7.0 * EPS * absf( expected[ i ] );
t.ok( delta <= tol, 'within tolerance. x: ' + x[ i ] + '. actual: ' + v + '. expected: ' + expected[ i ] + '. tol: ' + tol + '. Δ: ' + delta + '.' );
t.strictEqual( isAlmostSameValuef( v, expected[ i ], 11 ), true, 'returns expected value' );
}
t.end();
});
Expand Down