feat: add C implementation for `math/base/special/rising-factorial` #4455

DhruvArvindSingh · 2025-01-02T09:39:17Z

Progresses #649 .

Description

What is the purpose of this pull request?

This pull request:

adds C implementation for math/base/special/rising-factorial.

double stdlib_base_rising_factorial( const double x, const int32_t n )

Related Issues

Does this pull request have any related issues?

This pull request:

progresses [RFC]: Add C implementations to base special math functions (tracking issue) #649

Questions

Any questions for reviewers of this pull request?

No.

Other

Any other information relevant to this pull request? This may include screenshots, references, and/or implementation notes.

No.

Checklist

Please ensure the following tasks are completed before submitting this pull request.

Read, understood, and followed the contributing guidelines.

@stdlib-js/reviewers

--- 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: na - 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: na - task: lint_typescript_tests status: na - task: lint_license_headers status: passed --- --- type: pre_push_report description: Results of running various checks prior to pushing changes. report: - task: run_javascript_examples status: na - task: run_c_examples status: na - task: run_cpp_examples status: na - task: run_javascript_readme_examples status: na - task: run_c_benchmarks status: na - task: run_cpp_benchmarks status: na - task: run_fortran_benchmarks status: na - task: run_javascript_benchmarks status: na - task: run_julia_benchmarks status: na - task: run_python_benchmarks status: na - task: run_r_benchmarks status: na - task: run_javascript_tests status: na ---

stdlib-bot · 2025-01-02T09:41:53Z

Coverage Report

Package	Statements	Branches	Functions	Lines
math/base/special/rising-factorial	$\color{green}229/229$ $\color{green}+100.00\%$	$\color{green}25/25$ $\color{green}+100.00\%$	$\color{green}2/2$ $\color{green}+100.00\%$	$\color{green}229/229$ $\color{green}+100.00\%$

The above coverage report was generated for the changes in this PR.

--- 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: na - task: lint_repl_help status: na - task: lint_javascript_src status: na - task: lint_javascript_cli status: na - task: lint_javascript_examples status: na - task: lint_javascript_tests status: na - task: lint_javascript_benchmarks status: na - task: lint_python status: na - task: lint_r status: na - task: lint_c_src status: na - task: lint_c_examples status: na - task: lint_c_benchmarks status: na - task: lint_c_tests_fixtures status: na - task: lint_shell status: na - task: lint_typescript_declarations status: na - task: lint_typescript_tests status: na - task: lint_license_headers status: passed --- --- type: pre_push_report description: Results of running various checks prior to pushing changes. report: - task: run_javascript_examples status: na - task: run_c_examples status: na - task: run_cpp_examples status: na - task: run_javascript_readme_examples status: passed - task: run_c_benchmarks status: na - task: run_cpp_benchmarks status: na - task: run_fortran_benchmarks status: na - task: run_javascript_benchmarks status: na - task: run_julia_benchmarks status: na - task: run_python_benchmarks status: na - task: run_r_benchmarks status: na - task: run_javascript_tests status: na ---

Signed-off-by: Karan Anand <[email protected]>

anandkaranubc · 2025-05-11T07:52:23Z

/stdlib merge

anandkaranubc · 2025-05-11T07:57:52Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

+*
+* ## Notice
+*
+* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/factorials.hpp}. The implementation has been modified according to project conventions.


Suggested change

* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/factorials.hpp}. The implementation has been modified according to project conventions.

* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/factorials.hpp}. The implementation has been modified according to stdlib conventions.

anandkaranubc · 2025-05-11T08:08:32Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

+	double xc;
+	bool inv;
+
+	if ( stdlib_base_is_nan( x ) || !stdlib_base_is_integer( n ) ) {


Suggested change

if ( stdlib_base_is_nan( x ) || !stdlib_base_is_integer( n ) ) {

if ( stdlib_base_is_nan( x ) ) {

n is already and integer.

anandkaranubc · 2025-05-11T08:09:20Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

+#include "stdlib/math/base/assert/is_integer.h"
+#include "stdlib/math/base/assert/is_nan.h"
+#include "stdlib/math/base/special/gamma_delta_ratio.h"
+#include "stdlib/math/base/special/falling_factorial.h"


Suggested change

#include "stdlib/math/base/special/falling_factorial.h"

#include <stdint.h>

anandkaranubc · 2025-05-11T08:09:56Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

+#include "stdlib/math/base/assert/is_integer.h"
+#include "stdlib/math/base/assert/is_nan.h"
+#include "stdlib/math/base/special/gamma_delta_ratio.h"
+#include "stdlib/math/base/special/falling_factorial.h"


Suggested change

#include "stdlib/math/base/special/falling_factorial.h"

#include <stdbool.h>

anandkaranubc · 2025-05-11T08:12:33Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

+	nc = n;
+	xc = x;
+	inv = false;
+	if ( xc < 0.0 ) {


Suggested change

if ( xc < 0.0 ) {

// For `x < 0`, we really have a falling factorial, modulo a possible change of sign. Note that the falling factorial isn't defined for negative `n`, so we'll get rid of that case first:

anandkaranubc · 2025-05-11T08:13:37Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

+			nc = -nc;
+			inv = true;
+		}
+		result = ( ( nc & 1 ) ? -1.0 : 1.0 ) * stdlib_base_falling_factorial( -xc, nc );


Suggested change

result = ( ( nc & 1 ) ? -1.0 : 1.0 ) * stdlib_base_falling_factorial( -xc, nc );

result = ( (nc&1) ? -1.0 : 1.0 ) * stdlib_base_falling_factorial( -xc, nc );

Following the same negative spacing in main.js

anandkaranubc · 2025-05-11T08:14:16Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

+	xc = x;
+	inv = false;
+	if ( xc < 0.0 ) {
+		if ( nc < 0.0 ) {


Suggested change

if ( nc < 0.0 ) {

if ( nc < 0 ) {

nc is int32_t

anandkaranubc · 2025-05-11T08:15:11Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

+		}
+		return 0.0;
+	}
+	if ( ( xc < 1.0 ) && ( xc + nc < 0.0 ) ) {


Suggested change

if ( ( xc < 1.0 ) && ( xc + nc < 0.0 ) ) {

if ( ( xc < 1.0 ) && ( xc+nc < 0.0 ) ) {

anandkaranubc · 2025-05-11T08:15:40Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

+	}
+	if ( ( xc < 1.0 ) && ( xc + nc < 0.0 ) ) {
+		result = stdlib_base_gamma_delta_ratio( 1.0 - xc, -nc );
+		return ( nc & 1 ) ? -result : result;


Suggested change

return ( nc & 1 ) ? -result : result;

return ( nc&1 ) ? -result : result;

anandkaranubc · 2025-05-11T08:19:14Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/addon.c

+#include "stdlib/math/base/special/rising_factorial.h"
+#include "stdlib/math/base/napi/binary.h"
+
+// cppcheck-suppress shadowFunction


Suggested change

// cppcheck-suppress shadowFunction

anandkaranubc · 2025-05-11T08:21:54Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/lib/native.js

+*
+*
+* ## Notice
+*
+* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/factorials.hpp}. The implementation has been modified for JavaScript.
+*
+* ```text
+* (C) Copyright John Maddock 2006, 2010.
+*
+* Use, modification and distribution are subject to the
+* Boost Software License, Version 1.0. (See accompanying file
+* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
+* ```
+*/


Suggested change

*

*

* ## Notice

*

* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/factorials.hpp}. The implementation has been modified for JavaScript.

*

* ```text

* (C) Copyright John Maddock 2006, 2010.

*

* Use, modification and distribution are subject to the

* Boost Software License, Version 1.0. (See accompanying file

* LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)

* ```

*/

This is not needed in native.js as there isn't anything derived from the Boost library.

anandkaranubc · 2025-05-11T08:23:14Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/lib/native.js

+*
+* ## Notes
+*
+* -   The rising factorial is defined as
+*
+*     ```tex
+*     \operatorname{risingFactorial}(x, n) = x (x-1) (x-2) (x-3) \ldots (x-n+1)
+*     ```
+*
+*     or equivalently
+*
+*     ```tex
+*     \operatorname{risingFactorial}(x, n) = \frac{ \Gamma(x + n) }{ \Gamma(x) };
+*     ```
+*


Suggested change

*

* ## Notes

*

* - The rising factorial is defined as

*

* ```tex

* \operatorname{risingFactorial}(x, n) = x (x-1) (x-2) (x-3) \ldots (x-n+1)

* ```

*

* or equivalently

*

* ```tex

* \operatorname{risingFactorial}(x, n) = \frac{ \Gamma(x + n) }{ \Gamma(x) };

* ```

*

anandkaranubc · 2025-05-11T08:23:38Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/lib/native.js

+*     ```tex
+*     \operatorname{risingFactorial}(x, n) = \frac{ \Gamma(x + n) }{ \Gamma(x) };
+*     ```
+*


Suggested change

*

* @private

anandkaranubc · 2025-05-11T08:25:04Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/manifest.json

+      "libraries": [],
+      "libpath": [],
+      "dependencies": [
+        "@stdlib/math/base/assert/is-integer",


Suggested change

"@stdlib/math/base/assert/is-integer",

anandkaranubc · 2025-05-11T08:30:11Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/benchmark/c/native/benchmark.c

+
+	t = tic();
+	for ( i = 0; i < ITERATIONS; i++ ) {
+		y = stdlib_base_rising_factorial( x[ i % 100 ], n[ i % 100 ] );


Suggested change

y = stdlib_base_rising_factorial( x[ i % 100 ], n[ i % 100 ] );

y = stdlib_base_rising_factorial( x[ i%100 ], n[ i%100 ] );

anandkaranubc · 2025-05-11T08:30:39Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/benchmark/c/native/benchmark.c

+
+	for ( i = 0; i < 100; i++ ) {
+		x[ i ] = ( 40.0 * rand_double() ) + 1.0;
+		n[ i ] = (int32_t)( 41.0 * rand_double() );


Suggested change

n[ i ] = (int32_t)( 41.0 * rand_double() );

x[ i ] = ( 100.0*rand_double() ) - 50.0;

Using similar values used in cpp benchmarks, for consistency.

anandkaranubc · 2025-05-11T08:30:57Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/benchmark/c/native/benchmark.c

+
+	for ( i = 0; i < 100; i++ ) {
+		x[ i ] = ( 40.0 * rand_double() ) + 1.0;
+		n[ i ] = (int32_t)( 41.0 * rand_double() );


Suggested change

n[ i ] = (int32_t)( 41.0 * rand_double() );

n[ i ] = (int32_t)( 50.0*rand_double() );

Same comment.

anandkaranubc · 2025-05-11T08:32:18Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/benchmark/benchmark.native.js

+
+// MAIN //
+
+bench( pkg, opts, function benchmark( b ) {


Suggested change

bench( pkg, opts, function benchmark( b ) {

bench( pkg+'::native', opts, function benchmark( b ) {

anandkaranubc · 2025-05-11T08:33:00Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/benchmark/benchmark.native.js

+	var i;
+
+	x = randu( 100, 1.0, 41.0 );
+	n = discreteUniform( 100, 0, 40 );


Suggested change

n = discreteUniform( 100, 0, 40 );

x = uniform( 100, -50.0, 50.0 );

anandkaranubc · 2025-05-11T08:33:08Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/benchmark/benchmark.native.js

+	var i;
+
+	x = randu( 100, 1.0, 41.0 );
+	n = discreteUniform( 100, 0, 40 );


Suggested change

n = discreteUniform( 100, 0, 40 );

n = discreteUniform( 100, -50, 50 );

anandkaranubc · 2025-05-11T08:33:16Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/benchmark/benchmark.native.js

+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		y = risingFactorial( x[ i % x.length ], n[ i % n.length ] );


Suggested change

y = risingFactorial( x[ i % x.length ], n[ i % n.length ] );

y = risingFactorial( x[ i%x.length ], n[ i%n.length ] );

anandkaranubc · 2025-05-11T08:35:07Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/examples/c/example.c

+	int i;
+	for ( i = 0; i < 10; i++ ) {
+		v = stdlib_base_rising_factorial( x[ i ], n[ i ] );
+		printf( "x: %lf, n: %d, rising_factorial(x,n): %lf\n", x[ i ], n[ i ], v );


Suggested change

printf( "x: %lf, n: %d, rising_factorial(x,n): %lf\n", x[ i ], n[ i ], v );

printf( "risingFactorial(%lf, %d) = %lf\n", x[ i ], n[ i ], v );

Following the JS equivalent example file.

anandkaranubc · 2025-05-11T08:35:37Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/benchmark/c/native/benchmark.c

+*/
+
+#include "stdlib/math/base/special/rising_factorial.h"
+#include <stdlib.h>


Suggested change

#include <stdlib.h>

#include <stdint.h>

anandkaranubc · 2025-05-11T08:40:28Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/examples/index.js

This file needs to be revisited using logEachMap

anandkaranubc · 2025-05-11T08:44:57Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/test/test.native.js

+
+tape( 'the function returns `1` if provided `n = 0` and a nonnegative `x`', opts, function test( t ) {
+	var val = risingFactorial( 2.0, 0 );
+	t.equal( val, 1.0, 'returns expected value' );


Suggested change

t.equal( val, 1.0, 'returns expected value' );

t.strictEqual( val, 1.0, 'returns expected value' );

Applies here and elsewhere.

anandkaranubc · 2025-05-11T08:46:37Z

lib/node_modules/@stdlib/math/base/special/rising-factorial/README.md

+
+#### stdlib_base_rising_factorial( x, n )
+
+Evaluates the rising factorial of `x` and `n`.


Suggested change

Evaluates the rising factorial of `x` and `n`.

Evaluates the [rising factorial][falling-and-rising-factorials] of `x` and `n`.

--- 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: na - task: lint_repl_help status: na - 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: na - task: lint_typescript_tests status: na - task: lint_license_headers status: passed ---

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c

Signed-off-by: Philipp Burckhardt <[email protected]>

stdlib-bot added Math Issue or pull request specific to math functionality. Needs Review A pull request which needs code review. labels Jan 2, 2025

DhruvArvindSingh changed the title ~~feat: add C implementation for math/base/special/rising-factorial~~ feat: add C implementation for math/base/special/rising-factorial Jan 2, 2025

DhruvArvindSingh mentioned this pull request Apr 7, 2025

[RFC]: Add support for string arrays in stdlib stdlib-js/google-summer-of-code#144

Closed

7 tasks

anandkaranubc self-requested a review May 11, 2025 07:50

Merge branch 'develop' into feat/rising-factorial_develop

f934da8

Signed-off-by: Karan Anand <[email protected]>

stdlib-bot added bot: In Progress Pull request is currently awaiting automation. and removed bot: In Progress Pull request is currently awaiting automation. labels May 11, 2025

anandkaranubc reviewed May 11, 2025

View reviewed changes

anandkaranubc previously approved these changes May 11, 2025

View reviewed changes

Planeshifter reviewed May 12, 2025

View reviewed changes

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c Outdated Show resolved Hide resolved

Planeshifter reviewed May 12, 2025

View reviewed changes

lib/node_modules/@stdlib/math/base/special/rising-factorial/src/main.c Outdated Show resolved Hide resolved

chore: apply suggestions from code review

56756e0

Signed-off-by: Philipp Burckhardt <[email protected]>

Planeshifter dismissed anandkaranubc’s stale review via 56756e0 May 12, 2025 10:41

Planeshifter approved these changes May 12, 2025

View reviewed changes

Planeshifter added the Ready To Merge A pull request which is ready to be merged. label May 12, 2025

stdlib-bot removed the Needs Review A pull request which needs code review. label May 12, 2025

Planeshifter merged commit c9777d9 into stdlib-js:develop May 12, 2025
28 of 29 checks passed

	* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/factorials.hpp}. The implementation has been modified according to project conventions.
	* The original C++ code and copyright notice are from the [Boost library]{@link http://www.boost.org/doc/libs/1_64_0/boost/math/special_functions/factorials.hpp}. The implementation has been modified according to stdlib conventions.

	if ( stdlib_base_is_nan( x ) \|\| !stdlib_base_is_integer( n ) ) {
	if ( stdlib_base_is_nan( x ) ) {

	#include "stdlib/math/base/special/falling_factorial.h"
	#include <stdint.h>

	#include "stdlib/math/base/special/falling_factorial.h"
	#include <stdbool.h>

	if ( xc < 0.0 ) {
	// For `x < 0`, we really have a falling factorial, modulo a possible change of sign. Note that the falling factorial isn't defined for negative `n`, so we'll get rid of that case first:

	result = ( ( nc & 1 ) ? -1.0 : 1.0 ) * stdlib_base_falling_factorial( -xc, nc );
	result = ( (nc&1) ? -1.0 : 1.0 ) * stdlib_base_falling_factorial( -xc, nc );

	if ( ( xc < 1.0 ) && ( xc + nc < 0.0 ) ) {
	if ( ( xc < 1.0 ) && ( xc+nc < 0.0 ) ) {

	return ( nc & 1 ) ? -result : result;
	return ( nc&1 ) ? -result : result;

	y = stdlib_base_rising_factorial( x[ i % 100 ], n[ i % 100 ] );
	y = stdlib_base_rising_factorial( x[ i%100 ], n[ i%100 ] );

	n[ i ] = (int32_t)( 41.0 * rand_double() );
	x[ i ] = ( 100.0*rand_double() ) - 50.0;

	n[ i ] = (int32_t)( 41.0 * rand_double() );
	n[ i ] = (int32_t)( 50.0*rand_double() );

	bench( pkg, opts, function benchmark( b ) {
	bench( pkg+'::native', opts, function benchmark( b ) {

	n = discreteUniform( 100, 0, 40 );
	x = uniform( 100, -50.0, 50.0 );

	n = discreteUniform( 100, 0, 40 );
	n = discreteUniform( 100, -50, 50 );

	y = risingFactorial( x[ i % x.length ], n[ i % n.length ] );
	y = risingFactorial( x[ i%x.length ], n[ i%n.length ] );

	printf( "x: %lf, n: %d, rising_factorial(x,n): %lf\n", x[ i ], n[ i ], v );
	printf( "risingFactorial(%lf, %d) = %lf\n", x[ i ], n[ i ], v );

	t.equal( val, 1.0, 'returns expected value' );
	t.strictEqual( val, 1.0, 'returns expected value' );


		#### stdlib_base_rising_factorial( x, n )

		Evaluates the rising factorial of `x` and `n`.

	Evaluates the rising factorial of `x` and `n`.
	Evaluates the [rising factorial][falling-and-rising-factorials] of `x` and `n`.

Uh oh!

feat: add C implementation for math/base/special/rising-factorial #4455

feat: add C implementation for math/base/special/rising-factorial #4455

Uh oh!

Conversation

DhruvArvindSingh commented Jan 2, 2025

Description

Related Issues

Questions

Other

Checklist

Uh oh!

stdlib-bot commented Jan 2, 2025 • edited Loading Uh oh! There was an error while loading. Please reload this page.

Uh oh!

Coverage Report

Uh oh!

anandkaranubc commented May 11, 2025

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Choose a reason for hiding this comment

Uh oh!

Uh oh!

Uh oh!

Uh oh!

Reviewers

Assignees

Labels

Projects

Milestone

Development

Uh oh!

feat: add C implementation for `math/base/special/rising-factorial` #4455

feat: add C implementation for `math/base/special/rising-factorial` #4455

stdlib-bot commented Jan 2, 2025 •

edited

Loading