feat: add base.factorial2 to namespace

lib/node_modules/@stdlib/namespace/alias2pkg/data/data.csv

@@ -631,6 +631,7 @@ base.expm1rel,"@stdlib/math/base/special/expm1rel"
 base.exponent,"@stdlib/number/float64/base/exponent"
 base.exponentf,"@stdlib/number/float32/base/exponent"
 base.factorial,"@stdlib/math/base/special/factorial"
+base.factorial2,"@stdlib/math/base/special/factorial2"
 base.factorialln,"@stdlib/math/base/special/factorialln"
 base.fallingFactorial,"@stdlib/math/base/special/falling-factorial"
 base.fibonacci,"@stdlib/math/base/special/fibonacci"

lib/node_modules/@stdlib/namespace/alias2related/data/data.csv

@@ -631,6 +631,7 @@ base.expm1rel,"base.exp,base.expm1"
 base.exponent,"base.exponentf"
 base.exponentf,"base.exponent"
 base.factorial,"base.factorialln"
+base.factorial2,"base.factorial"
 base.factorialln,"base.factorial"
 base.fallingFactorial,"base.risingFactorial"
 base.fibonacci,"base.binet,base.fibonacciIndex,base.lucas,base.negafibonacci"

lib/node_modules/@stdlib/namespace/alias2standalone/data/data.csv

@@ -631,6 +631,7 @@ base.expm1rel,"@stdlib/math-base-special-expm1rel"
 base.exponent,"@stdlib/number-float64-base-exponent"
 base.exponentf,"@stdlib/number-float32-base-exponent"
 base.factorial,"@stdlib/math-base-special-factorial"
+base.factorial2,"@stdlib/math-base-special-factorial2"
 base.factorialln,"@stdlib/math-base-special-factorialln"
 base.fallingFactorial,"@stdlib/math-base-special-falling-factorial"
 base.fibonacci,"@stdlib/math-base-special-fibonacci"

lib/node_modules/@stdlib/namespace/aliases/data/data.txt

@@ -631,6 +631,7 @@ base.expm1rel
 base.exponent
 base.exponentf
 base.factorial
+base.factorial2
 base.factorialln
 base.fallingFactorial
 base.fibonacci

lib/node_modules/@stdlib/namespace/lib/namespace/base/f.js

@@ -38,6 +38,16 @@ ns.push({
 	]
 });
 
+ns.push({
+	'alias': 'base.factorial2',
+	'path': '@stdlib/math/base/special/factorial2',
+	'value': require( '@stdlib/math/base/special/factorial2' ),
+	'type': 'Function',
+	'related': [
+		'@stdlib/math/base/special/factorial'
+	]
+});
+
 ns.push({
 	'alias': 'base.factorialln',
 	'path': '@stdlib/math/base/special/factorialln',

lib/node_modules/@stdlib/namespace/pkg2alias/data/data.csv

@@ -631,6 +631,7 @@
 "@stdlib/number/float64/base/exponent",base.exponent
 "@stdlib/number/float32/base/exponent",base.exponentf
 "@stdlib/math/base/special/factorial",base.factorial
+"@stdlib/math/base/special/factorial2",base.factorial2
 "@stdlib/math/base/special/factorialln",base.factorialln
 "@stdlib/math/base/special/falling-factorial",base.fallingFactorial
 "@stdlib/math/base/special/fibonacci",base.fibonacci

lib/node_modules/@stdlib/namespace/pkg2related/data/data.csv

@@ -631,6 +631,7 @@
 "@stdlib/number/float64/base/exponent","@stdlib/number/float32/base/exponent"
 "@stdlib/number/float32/base/exponent","@stdlib/number/float64/base/exponent"
 "@stdlib/math/base/special/factorial","@stdlib/math/base/special/factorialln"
+"@stdlib/math/base/special/factorial2","@stdlib/math/base/special/factorial"
 "@stdlib/math/base/special/factorialln","@stdlib/math/base/special/factorial"
 "@stdlib/math/base/special/falling-factorial","@stdlib/math/base/special/rising-factorial"
 "@stdlib/math/base/special/fibonacci","@stdlib/math/base/special/binet,@stdlib/math/base/special/fibonacci-index,@stdlib/math/base/special/lucas,@stdlib/math/base/special/negafibonacci"

lib/node_modules/@stdlib/namespace/pkg2standalone/data/data.csv

@@ -631,6 +631,7 @@
 "@stdlib/number/float64/base/exponent","@stdlib/number-float64-base-exponent"
 "@stdlib/number/float32/base/exponent","@stdlib/number-float32-base-exponent"
 "@stdlib/math/base/special/factorial","@stdlib/math-base-special-factorial"
+"@stdlib/math/base/special/factorial2","@stdlib/math-base-special-factorial2"
 "@stdlib/math/base/special/factorialln","@stdlib/math-base-special-factorialln"
 "@stdlib/math/base/special/falling-factorial","@stdlib/math-base-special-falling-factorial"
 "@stdlib/math/base/special/fibonacci","@stdlib/math-base-special-fibonacci"

lib/node_modules/@stdlib/namespace/standalone2pkg/data/data.csv

@@ -631,6 +631,7 @@
 "@stdlib/number-float64-base-exponent","@stdlib/number/float64/base/exponent"
 "@stdlib/number-float32-base-exponent","@stdlib/number/float32/base/exponent"
 "@stdlib/math-base-special-factorial","@stdlib/math/base/special/factorial"
+"@stdlib/math-base-special-factorial2","@stdlib/math/base/special/factorial2"
 "@stdlib/math-base-special-factorialln","@stdlib/math/base/special/factorialln"
 "@stdlib/math-base-special-falling-factorial","@stdlib/math/base/special/falling-factorial"
 "@stdlib/math-base-special-fibonacci","@stdlib/math/base/special/fibonacci"

lib/node_modules/@stdlib/repl/data/contributor.json

@@ -1 +1 @@
-["Ali Salesi","Amit Jimiwal","Athan Reines","Brendan Graetz","Bruno Fenzl","Christopher Dambamuromo","Dan Rose","Dominik Moritz","Dorrin Sotoudeh","Frank Kovacs","Harshita Kalani","James Gelok","Jithin KS","Joey Reed","Jordan Gallivan","Joris Labie","Justin Dennison","Marcus Fantham","Matt Cochrane","Milan Raj","Momtchil Momtchev","Naresh Jagadeesan","Nithin Katta","Ognjen Jevremović","Philipp Burckhardt","Pranav Goswami","Ricky Reusser","Roman Stetsyk","Ryan Seal","Seyyed Parsa Neshaei","Shraddheya Shendre","Stephannie Jiménez Gacha","Yernar Yergaziyev","orimiles5","rei2hu","Robert Gislason"]
+["Ali Salesi","Amit Jimiwal","Athan Reines","Brendan Graetz","Bruno Fenzl","Christopher Dambamuromo","Dan Rose","Dominik Moritz","Dorrin Sotoudeh","Frank Kovacs","Harshita Kalani","James Gelok","Jithin KS","Joey Reed","Jordan Gallivan","Joris Labie","Justin Dennison","Marcus Fantham","Matt Cochrane","Milan Raj","Momtchil Momtchev","Naresh Jagadeesan","Nithin Katta","Ognjen Jevremović","Philipp Burckhardt","Pranav Goswami","Ricky Reusser","Robert Gislason","Roman Stetsyk","Ryan Seal","Seyyed Parsa Neshaei","Shraddheya Shendre","Stephannie Jiménez Gacha","Yernar Yergaziyev","orimiles5","rei2hu"]

lib/node_modules/@stdlib/repl/help/data/data.csv

@@ -830,6 +830,7 @@ base.expm1rel,"\nbase.expm1rel( x )\n    Relative error exponential.\n\n    When
 base.exponent,"\nbase.exponent( x )\n    Returns an integer corresponding to the unbiased exponent of a double-\n    precision floating-point number.\n\n    Parameters\n    ----------\n    x: number\n        Double-precision floating-point number.\n\n    Returns\n    -------\n    out: integer\n        Unbiased exponent.\n\n    Examples\n    --------\n    > var exponent = base.exponent( 3.14e-307 )\n    -1019\n    > exponent = base.exponent( -3.14 )\n    1\n    > exponent = base.exponent( 0.0 )\n    -1023\n    > exponent = base.exponent( NaN )\n    1024\n\n    See Also\n    --------\n    base.exponentf\n"
 base.exponentf,"\nbase.exponentf( x )\n    Returns an integer corresponding to the unbiased exponent of a single-\n    precision floating-point number.\n\n    Parameters\n    ----------\n    x: float\n        Single-precision floating-point number.\n\n    Returns\n    -------\n    out: integer\n        Unbiased exponent.\n\n    Examples\n    --------\n    > var exponent = base.exponentf( base.float64ToFloat32( 3.14e34 ) )\n    114\n    > exponent = base.exponentf( base.float64ToFloat32( 3.14e-34 ) )\n    -112\n    > exponent = base.exponentf( base.float64ToFloat32( -3.14 ) )\n    1\n    > exponent = base.exponentf( 0.0 )\n    -127\n    > exponent = base.exponentf( NaN )\n    128\n\n    See Also\n    --------\n    base.exponent\n"
 base.factorial,"\nbase.factorial( x )\n    Evaluates the factorial of `x`.\n\n    If provided `NaN`, the function returns `NaN`.\n\n    Parameters\n    ----------\n    x: number\n        Input value.\n\n    Returns\n    -------\n    y: number\n        Factorial.\n\n    Examples\n    --------\n    > var y = base.factorial( 3.0 )\n    6.0\n    > y = base.factorial( -1.5 )\n    ~-3.545\n    > y = base.factorial( -0.5 )\n    ~1.772\n    > y = base.factorial( 0.5 )\n    ~0.886\n    > y = base.factorial( -10.0 )\n    NaN\n    > y = base.factorial( 171.0 )\n    Infinity\n    > y = base.factorial( NaN )\n    NaN\n\n    See Also\n    --------\n    base.factorialln\n"
+base.factorial2,"\nbase.factorial2( n )\n    Evaluates the double factorial of `n`.\n\n    If provided `NaN`, the function returns `NaN`.\n\n    Parameters\n    ----------\n    n: number\n        Input value.\n\n    Returns\n    -------\n    y: number\n        Double factorial.\n\n    Examples\n    --------\n    > var y = base.factorial2( 3 )\n    3\n    > y = base.factorial2( 5 )\n    15\n    > y = base.factorial2( 6 )\n    48\n    > y = base.factorial2( 301 )\n    Infinity\n    > y = base.factorial2( NaN )\n    NaN\n\n    See Also\n    --------\n    base.factorial\n"
 base.factorialln,"\nbase.factorialln( x )\n    Evaluates the natural logarithm of the factorial of `x`.\n\n    For input values other than negative integers, the function returns\n\n      ln( x! ) = ln( Γ(x+1) )\n\n    where `Γ` is the Gamma function. For negative integers, the function returns\n    `NaN`.\n\n    If provided `NaN`, the function returns `NaN`.\n\n    Parameters\n    ----------\n    x: number\n        Input value.\n\n    Returns\n    -------\n    y: number\n        Natural logarithm of the factorial of `x`.\n\n    Examples\n    --------\n    > var y = base.factorialln( 3.0 )\n    ~1.792\n    > y = base.factorialln( 2.4 )\n    ~1.092\n    > y = base.factorialln( -1.0 )\n    NaN\n    > y = base.factorialln( -1.5 )\n    ~1.266\n    > y = base.factorialln( NaN )\n    NaN\n\n    See Also\n    --------\n    base.factorial\n"
 base.fallingFactorial,"\nbase.fallingFactorial( x, n )\n    Computes the falling factorial of `x` and `n`.\n\n    If not provided a nonnegative integer for `n`, the function returns `NaN`.\n\n    If provided `NaN` as any argument, the function returns `NaN`.\n\n    Parameters\n    ----------\n    x: number\n        First function parameter.\n\n    n: integer\n        Second function parameter.\n\n    Returns\n    -------\n    y: number\n        Function value.\n\n    Examples\n    --------\n    > var v = base.fallingFactorial( 0.9, 5 )\n    ~0.644\n    > v = base.fallingFactorial( -9.0, 3 )\n    -990.0\n    > v = base.fallingFactorial( 0.0, 2 )\n    0.0\n    > v = base.fallingFactorial( 3.0, -2 )\n    NaN\n\n    See Also\n    --------\n    base.risingFactorial\n"
 base.fibonacci,"\nbase.fibonacci( n )\n    Computes the nth Fibonacci number.\n\n    Fibonacci numbers follow the recurrence relation\n\n      F_n = F_{n-1} + F_{n-2}\n\n    with seed values F_0 = 0 and F_1 = 1.\n\n    If `n` is greater than `78`, the function returns `NaN`, as larger Fibonacci\n    numbers cannot be accurately represented due to limitations of double-\n    precision floating-point format.\n\n    If not provided a nonnegative integer value, the function returns `NaN`.\n\n    If provided `NaN`, the function returns `NaN`.\n\n    Parameters\n    ----------\n    n: integer\n        Input value.\n\n    Returns\n    -------\n    y: integer\n        Fibonacci number.\n\n    Examples\n    --------\n    > var y = base.fibonacci( 0 )\n    0\n    > y = base.fibonacci( 1 )\n    1\n    > y = base.fibonacci( 2 )\n    1\n    > y = base.fibonacci( 3 )\n    2\n    > y = base.fibonacci( 4 )\n    3\n    > y = base.fibonacci( 79 )\n    NaN\n    > y = base.fibonacci( NaN )\n    NaN\n\n    See Also\n    --------\n    base.binet, base.fibonacciIndex, base.lucas, base.negafibonacci\n"