feat: add math/base/special/lcmf

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

@@ -0,0 +1,225 @@
+<!--
+
+@license Apache-2.0
+
+Copyright (c) 2024 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.
+
+-->
+
+# lcmf
+
+> Compute the [least common multiple][lcm] of two single-precision floating-point numbers.
+
+<!-- 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">
+
+The [least common multiple][lcm] (lcm) of two non-zero integers `a` and `b` is the smallest positive integer that is divisible by both `a` and `b`. The lcm is also known as the **lowest common multiple** or **smallest common multiple** and finds common use in calculating the **lowest common denominator** (lcd).
+
+</section>
+
+<!-- /.intro -->
+
+<!-- Package usage documentation. -->
+
+<section class="usage">
+
+## Usage
+
+```javascript
+var lcmf = require( '@stdlib/math/base/special/lcmf' );
+```
+
+### lcmf( a, b )
+
+Computes the [least common multiple][lcm] for two single-precision floating-point numbers `a` and `b`.
+
+```javascript
+var v = lcmf( 10, 12 );
+// returns 60
+```
+
+If either `a` or `b` is `0`, the function returns `0`.
+
+```javascript
+var v = lcmf( 0, 12 );
+// returns 0
+```
+
+Both `a` and `b` must have integer values; otherwise, the function returns `NaN`.
+
+```javascript
+var v = lcmf( 3.14, 12 );
+// returns NaN
+
+v = lcmf( NaN, 12 );
+// returns NaN
+```
+
+</section> 
+
+<!-- /.usage --> 
+
+<!-- Package usage notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. --> 
+
+<section class="notes"> 
+
+</section> 
+
+<!-- /.notes --> 
+
+<!-- Package usage examples. --> 
+
+<section class="examples">
+
+## Examples
+
+<!-- eslint no-undef: "error" -->
+
+```javascript
+var lcmf = require( '@stdlib/math/base/special/lcmf' );
+
+var v;
+var i;
+
+for ( i = 0; i < 100; i++ ) {
+	a = round( randu()*50 );
+	b = round( randu()*50 );
+	v = lcm( a, b );
+	console.log( 'lcmf(%d,%d) = %d', a, b, v );
+}
+```
+
+</section>
+
+<!-- /.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/math/base/special/lcmf.h"
+```
+
+### stdlib_base_lcmf( a, b )
+
+Computes the [least common multiple][lcm] for two single-precision floating-point numbers `a` and `b`.
+
+```c
+float v = stdlib_base_lcmf( 10.0f, 12.0f );
+// returns 60.0f
+```
+
+The function accepts the following arguments:
+
+-   **a**: `[in] float` input value.
+-   **b**: `[in] float` input value.
+
+```c
+float stdlib_base_lcmf( const float a, const float b );
+```
+
+</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/math/base/special/lcmf.h"
+#include <stdio.h>
+
+int main( void ) {
+    const float a[] = { 24.0f, 32.0f, 48.0f, 116.0f, 33.0f };
+    const float b[] = { 12.0f, 6.0f, 15.0f, 52.0f, 22.0f };
+
+    float out;
+    int i;
+    for (i = 0; i < 5; i++) {
+        out = lcmf(a[i], b[i]);
+        printf("lcm(%f, %f) = %f\n", a[i], b[i], out);
+    }
+}
+```
+
+</section>
+
+<!-- /.examples -->
+
+</section>
+
+<!-- /.c -->
+
+<!-- Section to include cited references. If references are included, add a horizontal rule *before* the section. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="references">
+
+</section>
+
+<!-- /.references -->
+
+<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
+
+<section class="related">
+
+</section>
+
+<!-- /.related -->
+
+<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
+
+<section class="links">
+
+[lcm]: https://en.wikipedia.org/wiki/Least_common_multiple
+
+<!-- <related-links> -->
+
+<!-- </related-links> -->
+
+</section>
+
+<!-- /.links -->
+

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

@@ -0,0 +1,108 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 randu = require( '@stdlib/random/array/discrete-uniform' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var pkg = require( './../package.json' ).name;
+var lcmf = require( './../lib' );
+
+
+// MAIN //
+
+bench( pkg, function benchmark( b ) {
+    var x;
+    var y;
+    var z;
+    var i;
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 randu = require( '@stdlib/random/array/discrete-uniform' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var pkg = require( './../package.json' ).name;
+var lcmf = require( './../lib' );
+
+
+// MAIN //
+
+bench( pkg, function benchmark( b ) {
+	var x;
+	var y;
+	var z;
+	var i;
+
+	x = randu( 100, 0, 50 );
+	y = randu( 100, 0, 50 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		z = lcmf( x[ i % x.length ], y[ i % y.length ] );
+		if ( isnanf( z ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( z ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});
+
+	x = randu( 100, 0, 50 );
+	y = randu( 100, 0, 50 );
+
+	b.tic();
+    for ( i = 0; i < b.iterations; i++ ) {
+	z = lcmf( x[ i % x.length ], y[ i % y.length ] );
+        if ( isnanf( z ) ) {
+            b.fail( 'should not return NaN' );
+        }
+    }
+    b.toc();
+    if ( isnanf( z ) ) {
+        b.fail( 'should not return NaN' );
+    }
+    b.pass( 'benchmark finished' );
+    b.end();
+});

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

@@ -0,0 +1,63 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 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 randu = require( '@stdlib/random/array/discrete-uniform' );
+var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
+var tryRequire = require( '@stdlib/utils/try-require' );
+var pkg = require( './../package.json' ).name;
+
+
+// VARIABLES //
+
+var lcmf = tryRequire( resolve( __dirname, './../lib/native.js' ) );
+var opts = {
+	'skip': ( lcmf instanceof Error )
+};
+
+
+// MAIN //
+
+bench( pkg+'::native', opts, function benchmark( b ) {
+	var x;
+	var y;
+	var z;
+	var i;
+
+	x = randu( 100, 0, 50 );
+	y = randu( 100, 0, 50 );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		z = lcmf( x[ i % x.length ], y[ i % y.length ] );
+		if ( isnanf( z ) ) {
+			b.fail( 'should not return NaN' );
+		}
+	}
+	b.toc();
+	if ( isnanf( z ) ) {
+		b.fail( 'should not return NaN' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+});