@@ -25,7 +25,7 @@ <h1><a href="../../../../../index.html">All files</a> / <a href="index.html">mat
2525 < div class ='fl pad1y space-right2 '>
2626 < span class ="strong "> 100% </ span >
2727 < span class ="quiet "> Statements</ span >
28- < span class ='fraction '> 81/81 </ span >
28+ < span class ='fraction '> 86/86 </ span >
2929 </ div >
3030
3131
@@ -46,7 +46,7 @@ <h1><a href="../../../../../index.html">All files</a> / <a href="index.html">mat
4646 < div class ='fl pad1y space-right2 '>
4747 < span class ="strong "> 100% </ span >
4848 < span class ="quiet "> Lines</ span >
49- < span class ='fraction '> 81/81 </ span >
49+ < span class ='fraction '> 86/86 </ span >
5050 </ div >
5151
5252
@@ -144,7 +144,12 @@ <h1><a href="../../../../../index.html">All files</a> / <a href="index.html">mat
144144< a name ='L79 '> </ a > < a href ='#L79 '> 79</ a >
145145< a name ='L80 '> </ a > < a href ='#L80 '> 80</ a >
146146< a name ='L81 '> </ a > < a href ='#L81 '> 81</ a >
147- < a name ='L82 '> </ a > < a href ='#L82 '> 82</ a > </ td > < td class ="line-coverage quiet "> < span class ="cline-any cline-yes "> 1x</ span >
147+ < a name ='L82 '> </ a > < a href ='#L82 '> 82</ a >
148+ < a name ='L83 '> </ a > < a href ='#L83 '> 83</ a >
149+ < a name ='L84 '> </ a > < a href ='#L84 '> 84</ a >
150+ < a name ='L85 '> </ a > < a href ='#L85 '> 85</ a >
151+ < a name ='L86 '> </ a > < a href ='#L86 '> 86</ a >
152+ < a name ='L87 '> </ a > < a href ='#L87 '> 87</ a > </ td > < td class ="line-coverage quiet "> < span class ="cline-any cline-yes "> 1x</ span >
148153< span class ="cline-any cline-yes "> 1x</ span >
149154< span class ="cline-any cline-yes "> 1x</ span >
150155< span class ="cline-any cline-yes "> 1x</ span >
@@ -194,23 +199,27 @@ <h1><a href="../../../../../index.html">All files</a> / <a href="index.html">mat
194199< span class ="cline-any cline-yes "> 1x</ span >
195200< span class ="cline-any cline-yes "> 1x</ span >
196201< span class ="cline-any cline-yes "> 7x</ span >
202+ < span class ="cline-any cline-yes "> 7x</ span >
197203< span class ="cline-any cline-yes "> 10x</ span >
198204< span class ="cline-any cline-yes "> 4x</ span >
199205< span class ="cline-any cline-yes "> 4x</ span >
200206< span class ="cline-any cline-yes "> 4x</ span >
201207< span class ="cline-any cline-yes "> 4x</ span >
202208< span class ="cline-any cline-yes "> 7x</ span >
209+ < span class ="cline-any cline-yes "> 7x</ span >
203210< span class ="cline-any cline-yes "> 10x</ span >
204211< span class ="cline-any cline-yes "> 5x</ span >
205212< span class ="cline-any cline-yes "> 5x</ span >
206213< span class ="cline-any cline-yes "> 7x</ span >
214+ < span class ="cline-any cline-yes "> 7x</ span >
207215< span class ="cline-any cline-yes "> 10x</ span >
208216< span class ="cline-any cline-yes "> 15x</ span >
209217< span class ="cline-any cline-yes "> 15x</ span >
210218< span class ="cline-any cline-yes "> 13x</ span >
211219< span class ="cline-any cline-yes "> 13x</ span >
212220< span class ="cline-any cline-yes "> 15x</ span >
213221< span class ="cline-any cline-yes "> 15x</ span >
222+ < span class ="cline-any cline-yes "> 15x</ span >
214223< span class ="cline-any cline-yes "> 6x</ span >
215224< span class ="cline-any cline-yes "> 6x</ span >
216225< span class ="cline-any cline-yes "> 6x</ span >
@@ -219,6 +228,7 @@ <h1><a href="../../../../../index.html">All files</a> / <a href="index.html">mat
219228< span class ="cline-any cline-yes "> 15x</ span >
220229< span class ="cline-any cline-yes "> 7x</ span >
221230< span class ="cline-any cline-yes "> 7x</ span >
231+ < span class ="cline-any cline-yes "> 7x</ span >
222232< span class ="cline-any cline-yes "> 10x</ span >
223233< span class ="cline-any cline-yes "> 1x</ span >
224234< span class ="cline-any cline-yes "> 1x</ span >
@@ -246,7 +256,7 @@ <h1><a href="../../../../../index.html">All files</a> / <a href="index.html">mat
246256'use strict';
247257
248258/**
249- * Computes the greatest common divisor (gcd) of two single-precision floating point numbers using the binary GCD algorithm and bitwise operations.
259+ * Computes the greatest common divisor (gcd) of two single-precision floating- point numbers using the binary GCD algorithm and bitwise operations.
250260*
251261* ## References
252262*
@@ -274,22 +284,26 @@ <h1><a href="../../../../../index.html">All files</a> / <a href="index.html">mat
274284 if ( b === 0 ) {
275285 return a;
276286 }
287+
277288 // Reduce `a` and/or `b` to odd numbers and keep track of the greatest power of 2 dividing both `a` and `b`...
278- while ( (a & 1) === 0 && (b & 1) === 0 ) {
289+ while ( ( a & 1 ) === 0 && ( b & 1 ) === 0 ) {
279290 a >>>= 1; // right shift
280291 b >>>= 1; // right shift
281292 k += 1;
282293 }
294+
283295 // Reduce `a` to an odd number...
284- while ( (a & 1) === 0 ) {
296+ while ( ( a & 1 ) === 0 ) {
285297 a >>>= 1; // right shift
286298 }
299+
287300 // Henceforth, `a` is always odd...
288301 while ( b ) {
289302 // Remove all factors of 2 in `b`, as they are not common...
290- while ( (b & 1) === 0 ) {
303+ while ( ( b & 1 ) === 0 ) {
291304 b >>>= 1; // right shift
292305 }
306+
293307 // `a` and `b` are both odd. Swap values such that `b` is the larger of the two values, and then set `b` to the difference (which is even)...
294308 if ( a > b ) {
295309 t = b;
@@ -298,6 +312,7 @@ <h1><a href="../../../../../index.html">All files</a> / <a href="index.html">mat
298312 }
299313 b -= a; // b=0 iff b=a
300314 }
315+
301316 // Restore common factors of 2...
302317 return a << k;
303318}
@@ -313,7 +328,7 @@ <h1><a href="../../../../../index.html">All files</a> / <a href="index.html">mat
313328 < div class ='footer quiet pad2 space-top1 center small '>
314329 Code coverage generated by
315330 < a href ="https://istanbul.js.org/ " target ="_blank " rel ="noopener noreferrer "> istanbul</ a >
316- at 2024-11-11T15:20:25.784Z
331+ at 2024-11-17T09:32:57.284Z
317332 </ div >
318333 < script src ="../../../../../prettify.js "> </ script >
319334 < script >
0 commit comments