feat: add C ndarray interface and refactor implementation for stats/base/dmediansorted

lib/node_modules/@stdlib/stats/base/dmediansorted/README.md

@@ -36,7 +36,7 @@ limitations under the License.
 var dmediansorted = require( '@stdlib/stats/base/dmediansorted' );
 ```
 
-#### dmediansorted( N, x, stride )
+#### dmediansorted( N, x, strideX )
 
 Computes the median value of a sorted double-precision floating-point strided array `x`.
 
@@ -56,18 +56,16 @@ The function has the following parameters:
 
 -   **N**: number of indexed elements.
 -   **x**: sorted input [`Float64Array`][@stdlib/array/float64].
--   **stride**: index increment for `x`.
+-   **strideX**: index increment for `x`.
 
-The `N` and `stride` parameters determine which elements in `x` are accessed at runtime. For example, to compute the median value of every other element in `x`,
+The `N` and stride parameters determine which elements in the strided array are accessed at runtime. For example, to compute the median value of every other element in `x`,
 
 ```javascript
 var Float64Array = require( '@stdlib/array/float64' );
-var floor = require( '@stdlib/math/base/special/floor' );
 
 var x = new Float64Array( [ 1.0, 2.0, 2.0, -7.0, 3.0, 3.0, 4.0, 2.0 ] );
-var N = floor( x.length / 2 );
 
-var v = dmediansorted( N, x, 2 );
+var v = dmediansorted( 4, x, 2 );
 // returns 2.5
 ```
 
@@ -77,28 +75,24 @@ Note that indexing is relative to the first index. To introduce an offset, use [
 
 ```javascript
 var Float64Array = require( '@stdlib/array/float64' );
-var floor = require( '@stdlib/math/base/special/floor' );
 
 var x0 = new Float64Array( [ 2.0, 1.0, 2.0, 2.0, -2.0, 2.0, 3.0, 4.0 ] );
 var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
 
-var N = floor( x0.length / 2 );
-
-var v = dmediansorted( N, x1, 2 );
+var v = dmediansorted( 4, x1, 2 );
 // returns 2.0
 ```
 
-#### dmediansorted.ndarray( N, x, stride, offset )
+#### dmediansorted.ndarray( N, x, strideX, offsetX )
 
 Computes the median value of a sorted double-precision floating-point strided array using alternative indexing semantics.
 
 ```javascript
 var Float64Array = require( '@stdlib/array/float64' );
 
 var x = new Float64Array( [ 1.0, 2.0, 3.0 ] );
-var N = x.length;
 
-var v = dmediansorted.ndarray( N, x, 1, 0 );
+var v = dmediansorted.ndarray( x.length, x, 1, 0 );
 // returns 2.0
 ```
 
@@ -110,12 +104,10 @@ While [`typed array`][mdn-typed-array] views mandate a view offset based on the
 
 ```javascript
 var Float64Array = require( '@stdlib/array/float64' );
-var floor = require( '@stdlib/math/base/special/floor' );
 
 var x = new Float64Array( [ 2.0, 1.0, 2.0, 2.0, -2.0, 2.0, 3.0, 4.0 ] );
-var N = floor( x.length / 2 );
 
-var v = dmediansorted.ndarray( N, x, 2, 1 );
+var v = dmediansorted.ndarray( 4, x, 2, 1 );
 // returns 2.0
 ```
 
@@ -141,16 +133,13 @@ var v = dmediansorted.ndarray( N, x, 2, 1 );
 <!-- eslint no-undef: "error" -->
 
 ```javascript
-var Float64Array = require( '@stdlib/array/float64' );
+var linspace = require( '@stdlib/array/linspace' );
 var dmediansorted = require( '@stdlib/stats/base/dmediansorted' );
 
-var x;
-var i;
-
-x = new Float64Array( 10 );
-for ( i = 0; i < x.length; i++ ) {
-    x[ i ] = i - 5.0;
-}
+var options = {
+    'dtype': 'float64'
+};
+var x = linspace( -5.0, 5.0, 10, options );
 console.log( x );
 
 var v = dmediansorted( x.length, x, 1 );
@@ -161,6 +150,123 @@ console.log( v );
 
 <!-- /.examples -->
 
+<!-- C interface documentation. -->
+
+* * *
+
+<section class="c">
+
+## C APIs
+
+<!-- Section to include introductory text. Make sure to keep an empty line after the intro `section` element and another before the `/section` close. -->
+
+<section class="intro">
+
+</section>
+
+<!-- /.intro -->
+
+<!-- C usage documentation. -->
+
+<section class="usage">
+
+### Usage
+
+```c
+#include "stdlib/stats/base/dmediansorted.h"
+```
+
+#### stdlib_strided_dmediansorted( N, \*X, strideX )
+
+Computes the median value of a sorted double-precision floating-point strided array.
+
+```c
+const double x[] = { 1.0, 2.0, 3.0 };
+
+double v = stdlib_strided_dmediansorted( 3, x, 1 );
+// returns 2.0
+```
+
+The function accepts the following arguments:
+
+-   **N**: `[in] CBLAS_INT` number of indexed elements.
+-   **X**: `[in] double*` input array.
+-   **strideX**: `[in] CBLAS_INT` stride length for `X`.
+
+```c
+double stdlib_strided_dmediansorted( const CBLAS_INT N, const double *X, const CBLAS_INT strideX );
+```
+
+#### stdlib_strided_dmediansorted_ndarray( N, \*X, strideX, offsetX )
+
+Computes the median value of a sorted double-precision floating-point strided array using alternative indexing semantics.
+
+```c
+const double x[] = { 1.0, 2.0, 3.0 };
+
+double v = stdlib_strided_dmediansorted_ndarray( 3, x, 1, 0 );
+// returns 2.0
+```
+
+The function accepts the following arguments:
+
+-   **N**: `[in] CBLAS_INT` number of indexed elements.
+-   **X**: `[in] double*` input array.
+-   **strideX**: `[in] CBLAS_INT` stride length for `X`.
+-   **offsetX**: `[in] CBLAS_INT` starting index for `X`.
+
+```c
+double stdlib_strided_dmediansorted_ndarray( const CBLAS_INT N, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX );
+```
+
+</section>
+
+<!-- /.usage -->
+
+<!-- C API usage notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="notes">
+
+</section>
+
+<!-- /.notes -->
+
+<!-- C API usage examples. -->
+
+<section class="examples">
+
+### Examples
+
+```c
+#include "stdlib/stats/base/dmediansorted.h"
+#include <stdio.h>
+
+int main( void ) {
+    // Create a strided array:
+    const double x[] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0 };
+
+    // Specify the number of elements:
+    const int N = 4;
+
+    // Specify the stride length:
+    const int strideX = 2;
+
+    // Compute the median value:
+    double v = stdlib_strided_dmediansorted( N, x, strideX );
+
+    // Print the result:
+    printf( "median: %lf\n", v );
+}
+```
+
+</section>
+
+<!-- /.examples -->
+
+</section>
+
+<!-- /.c -->
+
 <!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
 
 <section class="related">

lib/node_modules/@stdlib/stats/base/dmediansorted/benchmark/benchmark.js

@@ -22,12 +22,19 @@
 
 var bench = require( '@stdlib/bench' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var linspace = require( '@stdlib/array/linspace' );
 var pow = require( '@stdlib/math/base/special/pow' );
-var Float64Array = require( '@stdlib/array/float64' );
 var pkg = require( './../package.json' ).name;
 var dmediansorted = require( './../lib/dmediansorted.js' );
 
 
+// VARIABLES //
+
+var options = {
+	'dtype': 'float64'
+};
+
+
 // FUNCTIONS //
 
 /**
@@ -38,13 +45,7 @@ var dmediansorted = require( './../lib/dmediansorted.js' );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x;
-	var i;
-
-	x = new Float64Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = i;
-	}
+	var x = linspace( -len/2, len/2, len, options );
 	return benchmark;
 
 	function benchmark( b ) {

lib/node_modules/@stdlib/stats/base/dmediansorted/benchmark/benchmark.native.js

@@ -23,8 +23,8 @@
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var linspace = require( '@stdlib/array/linspace' );
 var pow = require( '@stdlib/math/base/special/pow' );
-var Float64Array = require( '@stdlib/array/float64' );
 var tryRequire = require( '@stdlib/utils/try-require' );
 var pkg = require( './../package.json' ).name;
 
@@ -35,6 +35,9 @@ var dmediansorted = tryRequire( resolve( __dirname, './../lib/dmediansorted.nati
 var opts = {
 	'skip': ( dmediansorted instanceof Error )
 };
+var options = {
+	'dtype': 'float64'
+};
 
 
 // FUNCTIONS //
@@ -47,13 +50,7 @@ var opts = {
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x;
-	var i;
-
-	x = new Float64Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = i;
-	}
+	var x = linspace( -len/2, len/2, len, options );
 	return benchmark;
 
 	function benchmark( b ) {

lib/node_modules/@stdlib/stats/base/dmediansorted/benchmark/benchmark.ndarray.js

@@ -22,12 +22,19 @@
 
 var bench = require( '@stdlib/bench' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var linspace = require( '@stdlib/array/linspace' );
 var pow = require( '@stdlib/math/base/special/pow' );
-var Float64Array = require( '@stdlib/array/float64' );
 var pkg = require( './../package.json' ).name;
 var dmediansorted = require( './../lib/ndarray.js' );
 
 
+// VARIABLES //
+
+var options = {
+	'dtype': 'float64'
+};
+
+
 // FUNCTIONS //
 
 /**
@@ -38,13 +45,7 @@ var dmediansorted = require( './../lib/ndarray.js' );
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x;
-	var i;
-
-	x = new Float64Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = i;
-	}
+	var x = linspace( -len/2, len/2, len, options );
 	return benchmark;
 
 	function benchmark( b ) {

lib/node_modules/@stdlib/stats/base/dmediansorted/benchmark/benchmark.ndarray.native.js

@@ -23,8 +23,8 @@
 var resolve = require( 'path' ).resolve;
 var bench = require( '@stdlib/bench' );
 var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var linspace = require( '@stdlib/array/linspace' );
 var pow = require( '@stdlib/math/base/special/pow' );
-var Float64Array = require( '@stdlib/array/float64' );
 var tryRequire = require( '@stdlib/utils/try-require' );
 var pkg = require( './../package.json' ).name;
 
@@ -35,6 +35,9 @@ var dmediansorted = tryRequire( resolve( __dirname, './../lib/ndarray.native.js'
 var opts = {
 	'skip': ( dmediansorted instanceof Error )
 };
+var options = {
+	'dtype': 'float64'
+};
 
 
 // FUNCTIONS //
@@ -47,13 +50,7 @@ var opts = {
 * @returns {Function} benchmark function
 */
 function createBenchmark( len ) {
-	var x;
-	var i;
-
-	x = new Float64Array( len );
-	for ( i = 0; i < x.length; i++ ) {
-		x[ i ] = i;
-	}
+	var x = linspace( -len/2, len/2, len, options );
 	return benchmark;
 
 	function benchmark( b ) {