feat: add ml/strided/dkmeans-closest-centroids

lib/node_modules/@stdlib/ml/strided/dkmeans-closest-centroids/benchmark/benchmark.js

@@ -0,0 +1,134 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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';
+
+// MODULES //
+
+var bench = require( '@stdlib/bench' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var zeros = require( '@stdlib/array/zeros' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+var dclosestCentroids = require( './../lib/dkmeans_closest_centroids.js' );
+
+
+// VARIABLES //
+
+var LAYOUTS = [
+	'row-major',
+	'column-major'
+];
+var K = 4; // number of centroids
+var options = {
+	'dtype': 'float64'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {string} order - storage layout
+* @param {PositiveInteger} N - number of data points and features along each dimension
+* @returns {Function} benchmark function
+*/
+function createBenchmark( order, N ) {
+	var counts;
+	var LDX;
+	var LDC;
+	var out;
+	var X;
+	var C;
+
+	X = uniform( N*N, -10000.0, 10000.0, options );
+	C = uniform( K*N, -10000.0, 10000.0, options );
+	out = zeros( N, 'int32' );
+	counts = zeros( K, 'int32' );
+
+	if ( order === 'column-major' ) {
+		LDX = N;
+		LDC = K;
+	} else {
+		LDX = N;
+		LDC = N;
+	}
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var z;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			z = dclosestCentroids( order, N, N, K, 'sqeuclidean', X, LDX, C, LDC, out, 1, counts, 1 );
+			if ( isnan( z[ i%z.length ] ) ) {
+				b.fail( 'should not return NaN' );
+			}
+		}
+		b.toc();
+		if ( isnan( z[ i%z.length ] ) ) {
+			b.fail( 'should not return NaN' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var min;
+	var max;
+	var ord;
+	var N;
+	var f;
+	var i;
+	var k;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( k = 0; k < LAYOUTS.length; k++ ) {
+		ord = LAYOUTS[ k ];
+		for ( i = min; i <= max; i++ ) {
+			N = floor( pow( pow( 10, i ), 1.0/2.0 ) );
+			f = createBenchmark( ord, N );
+			bench( format( '%s:order=%s,size=%d', pkg, ord, N*N ), f );
+		}
+	}
+}
+
+main();

lib/node_modules/@stdlib/ml/strided/dkmeans-closest-centroids/benchmark/benchmark.native.js

@@ -0,0 +1,139 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2026 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';
+
+// MODULES //
+
+var resolve = require( 'path' ).resolve;
+var bench = require( '@stdlib/bench' );
+var isnan = require( '@stdlib/math/base/assert/is-nan' );
+var uniform = require( '@stdlib/random/array/uniform' );
+var zeros = require( '@stdlib/array/zeros' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var floor = require( '@stdlib/math/base/special/floor' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+var format = require( '@stdlib/string/format' );
+var pkg = require( './../package.json' ).name;
+
+
+// VARIABLES //
+
+var dclosestCentroids = tryRequire( resolve( __dirname, './../lib/dkmeans_closest_centroids.native.js' ) );
+var opts = {
+	'skip': ( dclosestCentroids instanceof Error )
+};
+var LAYOUTS = [
+	'row-major',
+	'column-major'
+];
+var K = 4; // number of centroids
+var options = {
+	'dtype': 'float64'
+};
+
+
+// FUNCTIONS //
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {string} order - storage layout
+* @param {PositiveInteger} N - number of data points and features along each dimension
+* @returns {Function} benchmark function
+*/
+function createBenchmark( order, N ) {
+	var counts;
+	var LDX;
+	var LDC;
+	var out;
+	var X;
+	var C;
+
+	X = uniform( N*N, -10000.0, 10000.0, options );
+	C = uniform( K*N, -10000.0, 10000.0, options );
+	out = zeros( N, 'int32' );
+	counts = zeros( K, 'int32' );
+
+	if ( order === 'column-major' ) {
+		LDX = N;
+		LDC = K;
+	} else {
+		LDX = N;
+		LDC = N;
+	}
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var z;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			z = dclosestCentroids( order, N, N, K, 'sqeuclidean', X, LDX, C, LDC, out, 1, counts, 1 );
+			if ( isnan( z[ i%z.length ] ) ) {
+				b.fail( 'should not return NaN' );
+			}
+		}
+		b.toc();
+		if ( isnan( z[ i%z.length ] ) ) {
+			b.fail( 'should not return NaN' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var min;
+	var max;
+	var ord;
+	var N;
+	var f;
+	var i;
+	var k;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( k = 0; k < LAYOUTS.length; k++ ) {
+		ord = LAYOUTS[ k ];
+		for ( i = min; i <= max; i++ ) {
+			N = floor( pow( pow( 10, i ), 1.0/2.0 ) );
+			f = createBenchmark( ord, N );
+			bench( format( '%s::native:order=%s,size=%d', pkg, ord, N*N ), opts, f );
+		}
+	}
+}
+
+main();