Skip to content

test: migrate math/base/special/binet to ULP-based testing #11719

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
MANDEep22332 wants to merge 3 commits into
base: develop
Choose a base branch
from
+4 −21
Open

test: migrate math/base/special/binet to ULP-based testing #11719

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
e8c3a21
ulp-bases testing
MANDEep22332 Apr 22, 2026
f588623
test-file
MANDEep22332 Apr 22, 2026
459d3d9
fixed the error
MANDEep22332 Apr 24, 2026
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
25 changes: 4 additions & 21 deletions lib/node_modules/@stdlib/math/base/special/binet/test/test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -24,10 +24,9 @@ var tape = require( 'tape' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var PINF = require( '@stdlib/constants/float64/pinf' );
var NINF = require( '@stdlib/constants/float64/ninf' );
var EPS = require( '@stdlib/constants/float64/eps' );
var isAlmostSameValue = require( '@stdlib/assert/is-almost-same-value' );
var fibonacci = require( '@stdlib/math/base/special/fibonacci' );
var negaFibonacci = require( '@stdlib/math/base/special/negafibonacci' );
var abs = require( '@stdlib/math/base/special/abs' );
var binet = require( './../lib' );


Expand Down Expand Up @@ -59,40 +58,24 @@ tape( 'if provided `-infinity`, the function returns `NaN`', function test( t )

tape( 'for nonnegative integers, the function approximates the nth Fibonacci number', function test( t ) {
var expected;
var delta;
var tol;
var v;
var i;
for ( i = 0; i < 79; i++ ) {
v = binet( i );
expected = fibonacci( i );
if ( v === expected ) {
t.strictEqual( v, expected, 'returns the '+i+'th Fibonacci number' );
} else {
delta = abs( v - expected );
tol = 13.0 * EPS * abs( expected );
t.strictEqual( delta <= tol, true, 'returns approximation. n: '+i+'. expected: '+expected+'. actual: '+v+'. Δ: '+delta+'. tol: '+tol+'.' );
}
t.strictEqual( isAlmostSameValue( v, expected, 24 ), true, 'returns expected value' );
}
t.end();
});

tape( 'for nonpositive integers, the function approximates the nth negaFibonacci number', function test( t ) {
tape( 'for nonpositive integers, the function approximates the nth negative Fibonacci number', function test( t ) {
var expected;
var delta;
var tol;
var v;
var i;
for ( i = 0; i > -79; i-- ) {
v = binet( i );
expected = negaFibonacci( i );
if ( v === expected ) {
t.strictEqual( v, expected, 'returns the '+i+'th negaFibonacci number' );
} else {
delta = abs( v - expected );
tol = 12.0 * EPS * abs( expected );
t.strictEqual( delta <= tol, true, 'returns approximation. n: '+i+'. expected: '+expected+'. actual: '+v+'. Δ: '+delta+'. tol: '+tol+'.' );
}
t.strictEqual( isAlmostSameValue( v, expected, 24 ), true, 'returns expected value' );
}
t.end();
});