feat: temp commit

Author: anandkaranubc

lib/node_modules/@stdlib/number/float32/base/ulp-difference/examples/index.js

@@ -18,8 +18,8 @@
 
 'use strict';
 
-var EPS = require( '@stdlib/constants/float64/eps' );
-var SMALLEST_SUBNORMAL = require( '@stdlib/constants/float64/smallest-subnormal' );
+var EPS = require( '@stdlib/constants/float32/eps' );
+var SMALLEST_SUBNORMAL = require( '@stdlib/constants/float32/smallest-subnormal' );
 var ulpdiff = require( './../lib' );
 
 var d = ulpdiff( 1.0, 1.0+EPS );

lib/node_modules/@stdlib/number/float32/base/ulp-difference/lib/main.js

@@ -24,114 +24,23 @@ var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var SIGN_MASK = require( '@stdlib/constants/float32/sign-mask' );
 var toWordf = require( '@stdlib/number/float32/base/to-word' );
 var abs = require( '@stdlib/math/base/special/abs' );
-var Uint32Array = require( '@stdlib/array/uint32' );
-
-
-// VARIABLES //
-
-var WX = new Uint32Array( 2 ); // WARNING: not thread safe
-var WY = new Uint32Array( 2 );
-var WZ = new Uint32Array( 2 );
-
-// 2^32:
-var TWO_32 = 4294967296;
 
 
 // FUNCTIONS //
 
 /**
-* Converts the high and low words of a single-precision floating-point number to a lexicographically ordered integer.
-*
-* ## Notes
-*
-* -   This function mutates the input array.
+* Converts an unsigned 32-bit integer corresponding to the IEEE 754 binary representation of a single-precision floating-point number to a lexicographically ordered integer.
 *
 * @private
-* @param {Array<integer>} words - high and low words
-* @returns {Array<integer>} input array
+* @param {unsigned32} word - unsigned 32-bit integer
+* @returns {integer} lexicographically ordered integer
 */
 function monotoneKey( word ) {
 	if ( word & SIGN_MASK ) { // x < 0
-		return ( ~word + 1 ) >>> 0; // maps -∞ to 0
-	}
-	return ( word | SIGN_MASK ) >>> 0; // maps +∞ to 2^32-1
-}
-
-/**
-* Perform two's-complement negation.
-*
-* ## Notes
-*
-* -   This function mutates the input array.
-*
-* @private
-* @param {Array<integer>} words - high and low words
-* @returns {Array<integer>} input array
-*/
-function negate( words ) {
-	words[ 0 ] = ~words[ 0 ];
-	words[ 1 ] = ~words[ 1 ];
-	words[ 1 ] += 1;
-
-	// Handle the carry into the high word...
-	if ( words[ 1 ] === 0 ) {
-		words[ 0 ] += 1;
-	}
-	return words;
-}
-
-/**
-* Returns the ordering of two single-precision floating-point numbers according to their lexicographically ordered high and low words.
-*
-* @private
-* @param {Array<integer>} wa - high and low words for first value
-* @param {Array<integer>} wb - high and low words for second value
-* @returns {integer} relative ordering
-*/
-function compare( wa, wb ) {
-	if ( wa[ 0 ] > wb[ 0 ] ) {
-		return 1;
-	}
-	if ( wa[ 0 ] < wb[ 0 ] ) {
-		return -1;
-	}
-	if ( wa[ 1 ] > wb[ 1 ] ) {
-		return 1;
-	}
-	if ( wa[ 1 ] < wb[ 1 ] ) {
-		return -1;
-	}
-	return 0;
-}
-
-/**
-* Performs double-word subtraction.
-*
-* @private
-* @param {Array<integer>} wa - high and low words for first value
-* @param {Array<integer>} wb - high and low words for second value
-* @param {Array<integer>} wc - output array
-* @returns {Array<integer>} output array
-*/
-function subtract( wa, wb, wc ) {
-	var ha;
-	var hb;
-	var la;
-	var lb;
-
-	ha = wa[ 0 ];
-	la = wa[ 1 ];
-	hb = wb[ 0 ];
-	lb = wb[ 1 ];
-
-	if ( la >= lb ) {
-		wc[ 0 ] = ha - hb;
-		wc[ 1 ] = la - lb;
-	} else {
-		wc[ 0 ] = ( ha - hb - 1 );      // wrap
-		wc[ 1 ] = ( la + TWO_32 ) - lb; // borrow
+		return ( ~word + 1 );
 	}
-	return wc;
+	// x >= 0
+	return ( word | SIGN_MASK ) >>> 0; // push +0 to just above -0
 }
 
 
@@ -171,23 +80,21 @@ function subtract( wa, wb, wc ) {
 * // returns NaN
 */
 function ulpdiff( x, y ) {
-	var ord;
 	var wx;
 	var wy;
-	var wz;
 
 	if ( isnanf( x ) || isnanf( y ) ) {
 		return NaN;
 	}
-	// Convert input values to high and low words:
+	// Convert input values to unsigned 32-bit integers corresponding to the IEEE 754 binary representation of single-precision floating-point numbers:
 	wx = toWordf( x );
 	wy = toWordf( y );
 
-	// Convert the values to lexicographically order integers:
+	// Convert the words to lexicographically order integers:
 	wx = monotoneKey( wx );
 	wy = monotoneKey( wy );
 
-	// Return a double as a result, which is fine for ≤2^53 ulps:
+	// Return a double as a result, which can exactly represent the ULP difference for all representable single-precision floating-point numbers:
 	return abs( wx - wy );
 }