mirror of
https://github.com/TheAlgorithms/Python.git
synced 2026-09-28 13:33:11 +08:00
Christian Clauss
0525ef5da8
* ruff rule ANN202 missing-return-type-private-function * ruff rule ANN202 missing-return-type-private-function
44 lines
1.0 KiB
Python
44 lines
1.0 KiB
Python
# /// script
|
|
# requires-python = ">=3.13"
|
|
# dependencies = [
|
|
# "pytest",
|
|
# ]
|
|
# ///
|
|
|
|
import pytest
|
|
|
|
from maths.factorial import factorial, factorial_recursive
|
|
|
|
|
|
@pytest.mark.parametrize("function", [factorial, factorial_recursive])
|
|
def test_zero(function) -> None:
|
|
assert function(0) == 1
|
|
|
|
|
|
@pytest.mark.parametrize("function", [factorial, factorial_recursive])
|
|
def test_positive_integers(function) -> None:
|
|
assert function(1) == 1
|
|
assert function(5) == 120
|
|
assert function(7) == 5040
|
|
|
|
|
|
@pytest.mark.parametrize("function", [factorial, factorial_recursive])
|
|
def test_large_number(function) -> None:
|
|
assert function(10) == 3628800
|
|
|
|
|
|
@pytest.mark.parametrize("function", [factorial, factorial_recursive])
|
|
def test_negative_number(function) -> None:
|
|
with pytest.raises(ValueError):
|
|
function(-3)
|
|
|
|
|
|
@pytest.mark.parametrize("function", [factorial, factorial_recursive])
|
|
def test_float_number(function) -> None:
|
|
with pytest.raises(ValueError):
|
|
function(1.5)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
pytest.main(["-v", __file__])
|