chore: update package descriptions

Author: aayush0325

lib/node_modules/@stdlib/math/base/special/gcdf/docs/repl.txt

@@ -1,6 +1,7 @@
 
 {{alias}}( a, b )
-    Computes the greatest common divisor (gcd).
+    Computes the greatest common divisor (gcd) of two single-precision
+    floating point numbers.
 
     If both `a` and `b` are `0`, the function returns `0`.
 

lib/node_modules/@stdlib/math/base/special/gcdf/docs/types/index.d.ts

@@ -19,7 +19,7 @@
 // TypeScript Version: 4.1
 
 /**
-* Computes the greatest common divisor (gcd).
+* Computes the greatest common divisor (gcd) of two single-precision floating point numbers.
 *
 * ## Notes
 *

lib/node_modules/@stdlib/math/base/special/gcdf/include/stdlib/math/base/special/gcdf.h

@@ -27,7 +27,7 @@ extern "C" {
 #endif
 
 /**
-* Computes the greatest common divisor (gcd).
+* Computes the greatest common divisor (gcd) of two single-precision floating point numbers.
 */
 float stdlib_base_gcdf( const float a, const float b );
 

lib/node_modules/@stdlib/math/base/special/gcdf/lib/binary_gcd.js

@@ -19,7 +19,7 @@
 'use strict';
 
 /**
-* Computes the greatest common divisor (gcd) using the binary GCD algorithm.
+* Computes the greatest common divisor (gcd) of two single-precision floating point numbers using the binary GCD algorithm.
 *
 * ## References
 *

lib/node_modules/@stdlib/math/base/special/gcdf/lib/bitwise_binary_gcd.js

@@ -19,7 +19,7 @@
 'use strict';
 
 /**
-* Computes the greatest common divisor (gcd) using the binary GCD algorithm and bitwise operations.
+* Computes the greatest common divisor (gcd) of two single-precision floating point numbers using the binary GCD algorithm and bitwise operations.
 *
 * ## References
 *

lib/node_modules/@stdlib/math/base/special/gcdf/lib/index.js

@@ -19,7 +19,7 @@
 'use strict';
 
 /**
-* Compute the greatest common divisor (gcd).
+* Compute the greatest common divisor (gcd) of two single-precision floating point numbers.
 *
 * @module @stdlib/math/base/special/gcdf
 *

lib/node_modules/@stdlib/math/base/special/gcdf/lib/main.js

@@ -32,7 +32,7 @@ var largeIntegersf = require( './binary_gcd.js' );
 // MAIN //
 
 /**
-* Computes the greatest common divisor (gcd).
+* Computes the greatest common divisor (gcd) of two single-precision floating point numbers.
 *
 * @param {integer} a - first number
 * @param {integer} b - second number

lib/node_modules/@stdlib/math/base/special/gcdf/lib/native.js

@@ -26,7 +26,7 @@ var addon = require( './../src/addon.node' );
 // MAIN //
 
 /**
-* Computes the greatest common divisor (gcd).
+* Computes the greatest common divisor (gcd) of two single-precision floating point numbers.
 *
 * @private
 * @param {number} a - first number