feat: add implementation

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: passed
  - task: lint_package_json
    status: passed
  - task: lint_repl_help
    status: passed
  - task: lint_javascript_src
    status: passed
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: passed
  - task: lint_javascript_tests
    status: passed
  - task: lint_javascript_benchmarks
    status: passed
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: passed
  - task: lint_c_examples
    status: passed
  - task: lint_c_benchmarks
    status: passed
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: passed
  - task: lint_typescript_tests
    status: passed
  - task: lint_license_headers
    status: passed
---

Author: anandkaranubc

lib/node_modules/@stdlib/math/base/special/rempio2f/README.md

@@ -18,56 +18,47 @@ limitations under the License.
 
 -->
 
-# rempio2
+# rempio2f
 
-> Compute `x - nπ/2 = r`.
+> Compute `x - nπ/2 = r` (single-precision).
 
 <section class="usage">
 
 ## Usage
 
 ```javascript
-var rempio2 = require( '@stdlib/math/base/special/rempio2' );
+var rempio2f = require( '@stdlib/math/base/special/rempio2f' );
 ```
 
-#### rempio2( x, y )
+#### rempio2f( x, y )
 
 Computes `x - nπ/2 = r`.
 
 ```javascript
-var y = [ 0.0, 0.0 ];
-var n = rempio2( 128.0, y );
+var y = [ 0.0 ];
+var n = rempio2f( 128.0, y );
 // returns 81
 
 var y1 = y[ 0 ];
 // returns ~0.765
-
-var y2 = y[ 1 ];
-// returns ~3.618e-17
 ```
 
-When `x` is `NaN` or infinite, the function returns `0` and sets the elements of `y` to `NaN`.
+When `x` is `NaN` or infinite, the function returns `0` and sets `y[0]` to `NaN`.
 
 ```javascript
-var y = [ 0.0, 0.0 ];
-var n = rempio2( NaN, y );
+var y = [ 0.0 ];
+var n = rempio2f( NaN, y );
 // returns 0
 
 var y1 = y[ 0 ];
 // returns NaN
 
-var y2 = y[ 1 ];
-// returns NaN
-
-y = [ 0.0, 0.0 ];
-n = rempio2( Infinity, y );
+y = [ 0.0 ];
+n = rempio2f( Infinity, y );
 // returns 0
 
 y1 = y[ 0 ];
 // returns NaN
-
-y2 = y[ 1 ];
-// returns NaN
 ```
 
 </section>
@@ -80,8 +71,8 @@ y2 = y[ 1 ];
 
 ## Notes
 
--   The function returns `n` and stores the remainder `r` as two numbers in `y`, such that `y[0]+y[1] = r`.
--   For input values larger than `2^20*π/2` in magnitude, the function **only** returns the last three binary digits of `n` and not the full result.
+-   The function returns `n` and stores the remainder `r` as `y[0]`.
+-   For input values larger than `2^28*π/2` in magnitude, the function **only** returns the last three binary digits of `n` and not the full result.
 
 </section>
 
@@ -95,16 +86,16 @@ y2 = y[ 1 ];
 
 ```javascript
 var linspace = require( '@stdlib/array/base/linspace' );
-var rempio2 = require( '@stdlib/math/base/special/rempio2' );
+var rempio2f = require( '@stdlib/math/base/special/rempio2f' );
 
 var x = linspace( 0.0, 100.0, 100 );
-var y = [ 0.0, 0.0 ];
+var y = [ 0.0 ];
 var n;
 var i;
 
 for ( i = 0; i < x.length; i++ ) {
-    n = rempio2( x[ i ], y );
-    console.log( '%d - %dπ/2 = %d + %d', x[ i ], n, y[ 0 ], y[ 1 ] );
+    n = rempio2f( x[ i ], y );
+    console.log( '%d - %dπ/2 = %d', x[ i ], n, y[ 0 ] );
 }
 ```
 
@@ -135,30 +126,28 @@ for ( i = 0; i < x.length; i++ ) {
 ### Usage
 
 ```c
-#include "stdlib/math/base/special/rempio2.h"
+#include "stdlib/math/base/special/rempio2f.h"
 ```
 
-#### stdlib_base_rempio2( x, &rem1, &rem2 )
+#### stdlib_base_rempio2f( x, &rem )
 
-Computes `x - nπ/2 = r`.
+Computes `x - nπ/2 = r` (single-precision).
 
 ```c
 #include <stdint.h>
 
-double rem1;
-double rem2;
+double rem;
 
-int32_t n = stdlib_base_rempio2( 4.0, &rem1, &rem2 );
+int32_t n = stdlib_base_rempio2f( 4.0f, &rem );
 ```
 
 The function accepts the following arguments:
 
--   **x**: `[in] double` input value.
--   **rem1**: `[out] double*` destination for first remainder number.
--   **rem2**: `[out] double*` destination for second remainder number.
+-   **x**: `[in] float` input value.
+-   **rem**: `[out] double*` destination for the remainder.
 
 ```c
-int32_t stdlib_base_rempio2( const double x, double *rem1, double *rem2 );
+int32_t stdlib_base_rempio2f( const float x, double *rem );
 ```
 
 </section>
@@ -169,10 +158,6 @@ int32_t stdlib_base_rempio2( const double x, double *rem1, double *rem2 );
 
 <section class="notes">
 
-### Notes
-
--   The function returns `n` and stores the remainder `r` as two numbers in `rem1` and `rem2`, respectively, such that `rem1+rem2 = r`.
-
 </section>
 
 <!-- /.notes -->
@@ -184,21 +169,20 @@ int32_t stdlib_base_rempio2( const double x, double *rem1, double *rem2 );
 ### Examples
 
 ```c
-#include "stdlib/math/base/special/rempio2.h"
+#include "stdlib/math/base/special/rempio2f.h"
 #include <stdio.h>
 #include <stdint.h>
 #include <inttypes.h>
 
 int main( void ) {
-    const double x[] = { 0.0, 1.0, 4.0, 128.0 };
+    const double x[] = { 0.0f, 1.0f, 4.0f, 128.0f };
 
-    double rem1;
-    double rem2;
+    double rem;
     int32_t n;
     int i;
     for ( i = 0; i < 4; i++ ) {
-        n = stdlib_base_rempio2( x[ i ], &rem1, &rem2 );
-        printf( "%lf - %"PRId32"π/2 = %lf + %lf\n", x[ i ], n, rem1, rem2 );
+        n = stdlib_base_rempio2f( x[ i ], &rem );
+        printf( "%lf - %"PRId32"π/2 = %lf\n", x[ i ], n, rem );
     }
 }
 ```

lib/node_modules/@stdlib/math/base/special/rempio2f/benchmark/benchmark.js

@@ -21,10 +21,10 @@
 // MODULES //
 
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/array/uniform' );
-var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var pkg = require( './../package.json' ).name;
-var rempio2 = require( './../lib' );
+var rempio2f = require( './../lib' );
 
 
 // MAIN //
@@ -35,18 +35,20 @@ bench( pkg, function benchmark( b ) {
 	var n;
 	var i;
 
-	y = [ 0.0, 0.0 ];
-	x = randu( 100, -100.0, 100.0 );
+	y = [ 0.0 ];
+	x = uniform( 100, -100.0, 100.0, {
+		'dtype': 'float32'
+	});
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		n = rempio2( x[ i % x.length ], y );
-		if ( isnan( n ) ) {
+		n = rempio2f( x[ i % x.length ], y );
+		if ( isnanf( n ) || isnanf( y[0] ) ) {
 			b.fail( 'should not return NaN' );
 		}
 	}
 	b.toc();
-	if ( isnan( n ) || isnan( y[0] ) || isnan( y[1] ) ) {
+	if ( isnanf( n ) || isnanf( y[0] ) ) {
 		b.fail( 'should not return NaN' );
 	}
 	b.pass( 'benchmark finished' );

lib/node_modules/@stdlib/math/base/special/rempio2f/benchmark/benchmark.native.js

@@ -22,17 +22,18 @@
 
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
-var randu = require( '@stdlib/random/array/uniform' );
-var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var Float64Array = require( '@stdlib/array/float64' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
 var tryRequire = require( '@stdlib/utils/try-require' );
 var pkg = require( './../package.json' ).name;
 
 
 // VARIABLES //
 
-var rempio2 = tryRequire( resolve( __dirname, './../lib/native.js' ) );
+var rempio2f = tryRequire( resolve( __dirname, './../lib/native.js' ) );
 var opts = {
-	'skip': ( rempio2 instanceof Error )
+	'skip': ( rempio2f instanceof Error )
 };
 
 
@@ -44,18 +45,20 @@ bench( pkg+'::native', opts, function benchmark( b ) {
 	var n;
 	var i;
 
-	y = [ 0.0, 0.0 ];
-	x = randu( 100, -100.0, 100.0 );
+	y = new Float64Array( [ 0.0 ] );
+	x = uniform( 100, -100.0, 100.0, {
+		'dtype': 'float32'
+	});
 
 	b.tic();
 	for ( i = 0; i < b.iterations; i++ ) {
-		n = rempio2( x[ i % x.length ], y );
-		if ( isnan( n ) ) {
+		n = rempio2f( x[ i % x.length ], y );
+		if ( isnanf( n ) || isnanf( y[0] ) ) {
 			b.fail( 'should not return NaN' );
 		}
 	}
 	b.toc();
-	if ( isnan( n ) || isnan( y[0] ) || isnan( y[1] ) ) {
+	if ( isnanf( n ) || isnanf( y[0] ) ) {
 		b.fail( 'should not return NaN' );
 	}
 	b.pass( 'benchmark finished' );

lib/node_modules/@stdlib/math/base/special/rempio2f/benchmark/c/native/benchmark.c

@@ -16,14 +16,14 @@
 * limitations under the License.
 */
 
-#include "stdlib/math/base/special/rempio2.h"
+#include "stdlib/math/base/special/rempio2f.h"
 #include <stdlib.h>
 #include <stdio.h>
 #include <math.h>
 #include <time.h>
 #include <sys/time.h>
 
-#define NAME "rempio2"
+#define NAME "rempio2f"
 #define ITERATIONS 1000000
 #define REPEATS 3
 
@@ -79,9 +79,9 @@ static double tic( void ) {
 *
 * @return random number
 */
-static double rand_double( void ) {
+static float rand_float( void ) {
 	int r = rand();
-	return (double)r / ( (double)RAND_MAX + 1.0 );
+	return (float)r / ( (float)RAND_MAX + 1.0f );
 }
 
 /**
@@ -90,28 +90,27 @@ static double rand_double( void ) {
 * @return elapsed time in seconds
 */
 static double benchmark( void ) {
-	double x[ 100 ];
+	float x[ 100 ];
 	double elapsed;
-	double rem1;
-	double rem2;
+	double rem;
 	double y;
 	double t;
 	int i;
 
 	for ( i = 0; i < 100; i++ ) {
-		x[ i ] = ( rand_double() * 200.0 ) - 100.0;
+		x[ i ] = ( rand_float() * 200.0f ) - 100.0f;
 	}
 
 	t = tic();
 	for ( i = 0; i < ITERATIONS; i++ ) {
-		y = stdlib_base_rempio2( x[ i % 100 ], &rem1, &rem2 );
-		if ( y != y ) {
+		y = stdlib_base_rempio2f( x[ i%100 ], &rem );
+		if ( y != y && rem != rem ) {
 			printf( "should not return NaN\n" );
 			break;
 		}
 	}
 	elapsed = tic() - t;
-	if ( y != y ) {
+	if ( y != y && rem != rem ) {
 		printf( "should not return NaN\n" );
 	}
 	return elapsed;

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

@@ -1,11 +1,10 @@
 
 {{alias}}( x, y )
-    Computes `x - nπ/2 = r`.
+    Computes `x - nπ/2 = r` (single-precision).
 
-    The function returns `n` and stores the remainder `r` as the two numbers
-    `y[0]` and `y[1]`, such that `y[0] + y[1] = r`.
+    The function returns `n` and stores the remainder `r` as `y[0]`.
 
-    For input values larger than `2^20 * π/2` in magnitude, the function only
+    For input values larger than `2^28 * π/2` in magnitude, the function only
     returns the last three binary digits of `n` and not the full result.
 
     Parameters
@@ -14,7 +13,7 @@
         Input value.
 
     y: Array|TypedArray|Object
-        Remainder elements.
+        Remainder element.
 
     Returns
     -------
@@ -23,13 +22,11 @@
 
     Examples
     --------
-    > var y = [ 0.0, 0.0 ];
+    > var y = [ 0.0 ];
     > var n = {{alias}}( 128.0, y )
     81
     > var y1 = y[ 0 ]
     ~0.765
-    > var y2 = y[ 1 ]
-    ~3.618e-17
 
 
     See Also