Usage

`javascript
var evalrationalf = require( '@stdlib/math-base-tools-evalrationalf' );
`

#### evalrationalf( P, Q, x )

Evaluates a [rational function][rational-function] at a value x using single-precision floating-point arithmetic.

`javascript
var Float32Array = require( '@stdlib/array-float32' );

var P = new Float32Array( [ -6.0, -5.0 ] );
var Q = new Float32Array( [ 3.0, 0.5 ] );

var v = evalrationalf( P, Q, 6.0 ); // => ( -66^0 - 56^1 ) / ( 36^0 + 0.56^1 ) = (-6-30)/(3+3)
// returns -6.0
`

For polynomials of different degree, the coefficient array for the lower degree [polynomial][polynomial] should be padded with zeros.

`javascript
var Float32Array = require( '@stdlib/array-float32' );

// 2x^3 + 4x^2 - 5x^1 - 6x^0 => degree 4
var P = new Float32Array( [ -6.0, -5.0, 4.0, 2.0 ] );

// 0.5x^1 + 3x^0 => degree 2
var Q = new Float32Array( [ 3.0, 0.5, 0.0, 0.0 ] ); // zero-padded

var v = evalrationalf( P, Q, 6.0 ); // => ( -66^0 - 56^1 + 46^2 + 26^3 ) / ( 36^0 + 0.56^1 + 06^2 + 06^3 ) = (-6-30+144+432)/(3+3)
// returns ~90.0
`

Coefficients should be ordered in ascending degree, thus matching summation notation.

#### evalrationalf.factory( P, Q )

Uses code generation to in-line coefficients and return a function for evaluating a [rational function][rational-function] using single-precision floating-point arithmetic.

`javascript
var Float32Array = require( '@stdlib/array-float32' );

var P = new Float32Array( [ 20.0, 8.0, 3.0 ] );
var Q = new Float32Array( [ 10.0, 9.0, 1.0 ] );

var rational = evalrationalf.factory( P, Q );

var v = rational( 10.0 ); // => (2010^0 + 810^1 + 310^2) / (1010^0 + 910^1 + 110^2) = (20+80+300)/(10+90+100)
// returns 2.0

v = rational( 2.0 ); // => (202^0 + 82^1 + 32^2) / (102^0 + 92^1 + 12^2) = (20+16+12)/(10+18+4)
// returns 1.5
`