Commit 7bbf305

committed

Update for tests

1 parent 976b553 commit 7bbf305Copy full SHA for 7bbf305

File tree

+14

-25

lines changed

+14

-25

lines changed

Lines changed: 1 addition & 1 deletion

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,13 +8,13 @@ def get_even_numbers(n: int) -> []:`
`8`	`8`
`9`	`9`
`10`	`10`	`# Test Section`
`11`		`-def test_even_numbers_10():`
	`11`	`+def test_even_numbers():`
`12`	`12`	`n = 10`
`13`	`13`	`expected_list = [2, 4, 6, 8]`
`14`	`14`	`assert get_even_numbers(n) == expected_list`
`15`	`15`
`16`	`16`
`17`		`-def test_even_numbers_20():`
	`17`	`+def test_even_numbers():`
`18`	`18`	`n = 20`
`19`	`19`	`expected_list = [2, 4, 6, 8, 10, 12, 14, 16, 18]`
`20`	`20`	`assert get_even_numbers(n) == expected_list`

Lines changed: 7 additions & 18 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,9 @@`
`2`	`2`	`# Write a program to calculate fibonacci`
`3`	`3`
`4`	`4`	`# Implementation`
	`5`	`+import pytest`
	`6`	`+`
	`7`	`+`
`5`	`8`	`def get_fibonacci_recursive(n: int) -> int:`
`6`	`9`	`if n == 0:`
`7`	`10`	`return 0`
`@@ -19,25 +22,11 @@ def get_fibonacci_iterative(n: int) -> int:`
`19`	`22`
`20`	`23`
`21`	`24`	`# Test Section`
`22`		`-def test_fibonacci_recursive_small():`
`23`		`- n = 7`
`24`		`- expected_value = 13`
`25`		`- assert get_fibonacci_recursive(n) == expected_value`
`26`		`-`
`27`		`-`
`28`		`-def test_fibonacci_recursive_bigger():`
`29`		`- n = 20`
`30`		`- expected_value = 6765`
	`25`	`+@pytest.mark.parametrize("n, expected_value", [(7, 13), (20, 6765)])`
	`26`	`+def test_fibonacci_recursive(n, expected_value):`
`31`	`27`	`assert get_fibonacci_recursive(n) == expected_value`
`32`	`28`
`33`	`29`
`34`		`-def test_fibonacci_iterative_small():`
`35`		`- n = 7`
`36`		`- expected_value = 13`
`37`		`- assert get_fibonacci_iterative(n) == expected_value`
`38`		`-`
`39`		`-`
`40`		`-def test_fibonacci_iterative_bigger():`
`41`		`- n = 20`
`42`		`- expected_value = 6765`
	`30`	`+@pytest.mark.parametrize("n, expected_value", [(7, 13), (20, 6765)])`
	`31`	`+def test_fibonacci_iterative(n, expected_value):`
`43`	`32`	`assert get_fibonacci_iterative(n) == expected_value`

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,5 @@`
`1`	`1`	`# Task 7`
`2`	`2`	`# Write a program to check if a number is a prime number`
`3`		`-from py import test`
`4`	`3`
`5`	`4`
`6`	`5`	`def is_prime(number):`
`@@ -10,10 +9,11 @@ def is_prime(number):`
`10`	`9`	`prime_status = False`
`11`	`10`	`break`
`12`	`11`	`return prime_status`
`13`		`-test.`
	`12`	`+`
	`13`	`+`
`14`	`14`	`def test_prime_number():`
`15`		`- assert is_prime(13)`
	`15`	`+ assert is_prime(13)==True`
`16`	`16`
`17`	`17`
`18`	`18`	`def test_not_prime_number():`
`19`		`- assert notis_prime(2000)`
	`19`	`+ assert is_prime(2000)==False`

Comments

(0)