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 | 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 4006x 4006x 4006x 4006x 4006x 4006x 4006x 4006x 1043x 1043x 2963x 2963x 2963x 4006x 50250x 50250x 10099x 10099x 10099x 2963x 2963x 50250x 40151x 40151x 40151x 50250x 50250x 2963x 2963x 50250x 2963x 2963x 4006x 1x 1x 1x 1x 1x | /**
* @license Apache-2.0
*
* Copyright (c) 2025 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 //
var MAX_ITER = 24; // 15+10-1 (subnormals) => BIAS+NUM_SIGNFICAND_BITS-1
var MAX_BITS = 11; // only 10 bits for fraction
// MAIN //
/**
* Converts a fraction to a literal bit representation using the multiply-by-2 algorithm.
*
* @private
* @param {number} x - number less than 1
* @returns {BinaryString} bit representation
*
* @example
* var v = mult2( 0.234375 );
* // returns '001111'
*
* @example
* var v = mult2( 0.0 );
* // returns ''
*/
function mult2( x ) {
var str;
var y;
var i;
var j;
str = '';
if ( x === 0.0 ) {
return str;
}
j = MAX_ITER;
// Each time we multiply by 2 and find a ones digit, add a '1'; otherwise, add a '0'..
for ( i = 0; i < MAX_ITER; i++ ) {
y = x * 2.0;
if ( y >= 1.0 ) {
x = y - 1.0;
str += '1';
if ( j === MAX_ITER ) {
j = i; // first '1'
}
} else {
x = y;
str += '0';
}
// Stop when we have no more decimals to process or in the event we found a fraction which cannot be represented in a finite number of bits...
if ( y === 1.0 || i-j > MAX_BITS ) {
break;
}
}
return str;
}
// EXPORTS //
module.exports = mult2;
|