function gcdf( a, b ) {
	if ( isnanf( a ) || isnanf( b ) ) {
		return NaN;
	}
	if (
		a === PINF ||
		b === PINF ||
		a === NINF ||
		b === NINF
	) {
		return NaN;
	}
	if ( !( isIntegerf( a ) && isIntegerf( b ) ) ) {
		return NaN;
	}
	if ( a < 0 ) {
		a = -a;
	}
	if ( b < 0 ) {
		b = -b;
	}
	if ( a <= INT32_MAX && b <= INT32_MAX ) {
		return bitwisef( a, b );
	}
	return largeIntegersf( a, b );
}
Computes the greatest common divisor (gcd) of two single-precision floating-point numbers.

@param {integer} a - first number
@param {integer} b - second number
@returns {integer} greatest common divisor

@example
var v = gcdf( 48, 18 );
// returns 6

@example
var v = gcdf( 3.14, 18 );
// returns NaN

@example
var v = gcdf( NaN, 18 );
// returns NaN