diff --git a/lib/node_modules/@stdlib/math/base/special/negafibonaccif/benchmark/benchmark.js b/lib/node_modules/@stdlib/math/base/special/negafibonaccif/benchmark/benchmark.js index 17ca77d01fb4..663e6ac1aa88 100644 --- a/lib/node_modules/@stdlib/math/base/special/negafibonaccif/benchmark/benchmark.js +++ b/lib/node_modules/@stdlib/math/base/special/negafibonaccif/benchmark/benchmark.js @@ -24,7 +24,7 @@ var bench = require( '@stdlib/bench' ); var discreteUniform = require( '@stdlib/random/array/discrete-uniform' ); var roundf = require( '@stdlib/math/base/special/roundf' ); var sqrtf = require( '@stdlib/math/base/special/sqrtf' ); -var pow = require( '@stdlib/math/base/special/pow' ); +var powf = require( '@stdlib/math/base/special/powf' ); var absf = require( '@stdlib/math/base/special/absf' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); var Float32Array = require( '@stdlib/array/float32' ); @@ -71,8 +71,7 @@ bench( pkg+'::analytic', function benchmark( b ) { function negafibonaccif( n ) { var an = absf( n ); - // TODO: replace with `powf` when available - return pow( -1.0, an+1 ) * roundf( pow( PHI, an ) / SQRT_5 ); + return powf( -1.0, an + 1.0 ) * roundf( powf( PHI, an ) / SQRT_5 ); } x = discreteUniform( 100, -36, 0 ); diff --git a/lib/node_modules/@stdlib/math/base/special/negafibonaccif/test/test.js b/lib/node_modules/@stdlib/math/base/special/negafibonaccif/test/test.js index 8c28fc19901d..e0edffd64b3d 100644 --- a/lib/node_modules/@stdlib/math/base/special/negafibonaccif/test/test.js +++ b/lib/node_modules/@stdlib/math/base/special/negafibonaccif/test/test.js @@ -22,7 +22,7 @@ var tape = require( 'tape' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); -var pow = require( '@stdlib/math/base/special/pow' ); +var powf = require( '@stdlib/math/base/special/powf' ); var absf = require( '@stdlib/math/base/special/absf' ); var NINF = require( '@stdlib/constants/float32/ninf' ); var fibonaccif = require( '@stdlib/math/base/special/fibonaccif' ); @@ -89,9 +89,7 @@ tape( 'the function returns the nth negaFibonacci number (Fibonacci relationship var i; for ( i = 0; i > -37; i-- ) { v = negafibonaccif( i ); - - // TODO: replace with `powf` when available - f = pow( -1.0, absf(i)+1 ) * fibonaccif( absf(i) ); + f = powf( -1.0, absf(i) + 1.0 ) * fibonaccif( absf(i) ); t.strictEqual( v, f, 'returns expected value' ); } t.end(); diff --git a/lib/node_modules/@stdlib/math/base/special/negafibonaccif/test/test.native.js b/lib/node_modules/@stdlib/math/base/special/negafibonaccif/test/test.native.js index 40c7e50cfb5a..2a38a320b65e 100644 --- a/lib/node_modules/@stdlib/math/base/special/negafibonaccif/test/test.native.js +++ b/lib/node_modules/@stdlib/math/base/special/negafibonaccif/test/test.native.js @@ -23,7 +23,7 @@ var resolve = require( 'path' ).resolve; var tape = require( 'tape' ); var isnanf = require( '@stdlib/math/base/assert/is-nanf' ); -var pow = require( '@stdlib/math/base/special/pow' ); +var powf = require( '@stdlib/math/base/special/powf' ); var absf = require( '@stdlib/math/base/special/absf' ); var fibonaccif = require( '@stdlib/math/base/special/fibonaccif' ); var tryRequire = require( '@stdlib/utils/try-require' ); @@ -79,9 +79,7 @@ tape( 'the function returns the nth negaFibonacci number (Fibonacci relationship var i; for ( i = 0; i > -37; i-- ) { v = negafibonaccif( i ); - - // TODO: replace with `powf` when available - f = pow( -1.0, absf(i) + 1 ) * fibonaccif( absf(i) ); + f = powf( -1.0, absf(i) + 1.0 ) * fibonaccif( absf(i) ); t.strictEqual( v, f, 'returns expected value' ); } t.end();