All files / fast/uint32-sqrt/lib main.js

65.47% Statements 55/84
100% Branches 1/1
0% Functions 0/1
65.47% Lines 55/84

Press n or j to go to the next uncovered block, b, p or k for the previous block.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 851x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x                                                           1x 1x 1x 1x 1x  
/**
* @license Apache-2.0
*
* Copyright (c) 2018 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
*    http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
 
'use strict';
 
// VARIABLES //
 
// Set the second most significant bit: 00100000000000000000000000000000 => 1<<30 = 1073741824
var BIT = 1073741824 >>> 0; // asm type annotation
 
 
// MAIN //
 
/**
* Returns an integer square root.
*
* @param {uinteger32} x - input value
* @returns {uinteger32} integer square root
*
* @example
* var v = sqrt( 9 >>> 0 );
* // returns 3
*
* @example
* var v = sqrt( 2 >>> 0 );
* // returns 1
*
* @example
* var v = sqrt( 3 >>> 0 );
* // returns 1
*
* @example
* var v = sqrt( 0 >>> 0 );
* // returns 0
*/
function sqrt( x ) {
	var root;
	var bit;
	var sum;
	var y;

	y = x >>> 0; // asm type annotation

	root = 0 >>> 0; // asm type annotation
	bit = BIT;

	// `bit` should start as the highest power of `4` less than or equal to `x`:
	while ( bit > y ) {
		bit >>>= 2;
	}
	// Perform a digit-by-digit/abacus computation...
	while ( bit !== 0 ) {
		sum = ( root + bit ) >>> 0; // asm type annotation
		root >>>= 1;
		if ( x >= sum ) {
			x -= sum;
			root += bit;
		}
		bit >>>= 2;
	}
	// Note: `x` is the remainder

	return root >>> 0; // asm type annotation
}
 
 
// EXPORTS //
 
module.exports = sqrt;